#include "config.h"
#include "system.h"
#include "coretypes.h"
-#include "tree.h"
#include "tm.h"
+#include "tree.h"
#include "rtl.h"
-#include "expr.h"
-#include "insn-codes.h"
-#include "diagnostic.h"
-#include "optabs.h"
-#include "machmode.h"
-#include "langhooks.h"
+#include "real.h"
+#include "flags.h"
#include "tree-flow.h"
#include "tree-gimple.h"
#include "tree-iterator.h"
#include "tree-pass.h"
-#include "flags.h"
-#include "ggc.h"
+#include "tree-ssa-propagate.h"
+
+
+/* For each complex ssa name, a lattice value. We're interested in finding
+ out whether a complex number is degenerate in some way, having only real
+ or only complex parts. */
+
+typedef enum
+{
+ UNINITIALIZED = 0,
+ ONLY_REAL = 1,
+ ONLY_IMAG = 2,
+ VARYING = 3
+} complex_lattice_t;
+
+#define PAIR(a, b) ((a) << 2 | (b))
+
+DEF_VEC_I(complex_lattice_t);
+DEF_VEC_ALLOC_I(complex_lattice_t, heap);
+
+static VEC(complex_lattice_t, heap) *complex_lattice_values;
+
+/* For each complex variable, a pair of variables for the components. */
+static VEC(tree, heap) *complex_variable_components;
+
+
+/* Return true if T is not a zero constant. In the case of real values,
+ we're only interested in +0.0. */
+
+static int
+some_nonzerop (tree t)
+{
+ int zerop = false;
+
+ if (TREE_CODE (t) == REAL_CST)
+ zerop = REAL_VALUES_IDENTICAL (TREE_REAL_CST (t), dconst0);
+ else if (TREE_CODE (t) == INTEGER_CST)
+ zerop = integer_zerop (t);
+
+ return !zerop;
+}
+
+/* Compute a lattice value from T. It may be a gimple_val, or, as a
+ special exception, a COMPLEX_EXPR. */
+static complex_lattice_t
+find_lattice_value (tree t)
+{
+ tree real, imag;
+ int r, i;
+ complex_lattice_t ret;
+
+ switch (TREE_CODE (t))
+ {
+ case SSA_NAME:
+ return VEC_index (complex_lattice_t, complex_lattice_values,
+ SSA_NAME_VERSION (t));
+
+ case COMPLEX_CST:
+ real = TREE_REALPART (t);
+ imag = TREE_IMAGPART (t);
+ break;
+
+ case COMPLEX_EXPR:
+ real = TREE_OPERAND (t, 0);
+ imag = TREE_OPERAND (t, 1);
+ break;
+
+ default:
+ gcc_unreachable ();
+ }
+
+ r = some_nonzerop (real);
+ i = some_nonzerop (imag);
+ ret = r*ONLY_REAL + i*ONLY_IMAG;
+
+ /* ??? On occasion we could do better than mapping 0+0i to real, but we
+ certainly don't want to leave it UNINITIALIZED, which eventually gets
+ mapped to VARYING. */
+ if (ret == UNINITIALIZED)
+ ret = ONLY_REAL;
+
+ return ret;
+}
+
+/* Determine if LHS is something for which we're interested in seeing
+ simulation results. */
+
+static bool
+is_complex_reg (tree lhs)
+{
+ return TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE && is_gimple_reg (lhs);
+}
+
+/* Mark the incoming parameters to the function as VARYING. */
+
+static void
+init_parameter_lattice_values (void)
+{
+ tree parm;
+
+ for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm))
+ if (is_complex_reg (parm) && var_ann (parm) != NULL)
+ {
+ tree ssa_name = default_def (parm);
+ VEC_replace (complex_lattice_t, complex_lattice_values,
+ SSA_NAME_VERSION (ssa_name), VARYING);
+ }
+}
+
+/* Initialize DONT_SIMULATE_AGAIN for each stmt and phi. Return false if
+ we found no statements we want to simulate, and thus there's nothing for
+ the entire pass to do. */
+
+static bool
+init_dont_simulate_again (void)
+{
+ basic_block bb;
+ block_stmt_iterator bsi;
+ tree phi;
+ bool saw_a_complex_value = false;
+
+ FOR_EACH_BB (bb)
+ {
+ for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
+ DONT_SIMULATE_AGAIN (phi) = !is_complex_reg (PHI_RESULT (phi));
+
+ for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
+ {
+ tree stmt = bsi_stmt (bsi);
+ bool dsa = true;
+
+ if (TREE_CODE (stmt) == MODIFY_EXPR
+ && is_complex_reg (TREE_OPERAND (stmt, 0)))
+ {
+ dsa = false;
+ saw_a_complex_value = true;
+ }
+
+ DONT_SIMULATE_AGAIN (stmt) = dsa;
+ }
+ }
+
+ return saw_a_complex_value;
+}
+
+
+/* Evaluate statement STMT against the complex lattice defined above. */
+
+static enum ssa_prop_result
+complex_visit_stmt (tree stmt, edge *taken_edge_p ATTRIBUTE_UNUSED,
+ tree *result_p)
+{
+ complex_lattice_t new_l, old_l, op1_l, op2_l;
+ unsigned int ver;
+ tree lhs, rhs;
+
+ /* These conditions should be satisfied due to the initial filter
+ set up in init_dont_simulate_again. */
+ gcc_assert (TREE_CODE (stmt) == MODIFY_EXPR);
+
+ lhs = TREE_OPERAND (stmt, 0);
+ rhs = TREE_OPERAND (stmt, 1);
+
+ gcc_assert (TREE_CODE (lhs) == SSA_NAME);
+ gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
+
+ *result_p = lhs;
+ ver = SSA_NAME_VERSION (lhs);
+ old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
+
+ switch (TREE_CODE (rhs))
+ {
+ case SSA_NAME:
+ case COMPLEX_EXPR:
+ case COMPLEX_CST:
+ new_l = find_lattice_value (rhs);
+ break;
+
+ case PLUS_EXPR:
+ case MINUS_EXPR:
+ op1_l = find_lattice_value (TREE_OPERAND (rhs, 0));
+ op2_l = find_lattice_value (TREE_OPERAND (rhs, 1));
+
+ /* We've set up the lattice values such that IOR neatly
+ models addition. */
+ new_l = op1_l | op2_l;
+ break;
+
+ case MULT_EXPR:
+ case RDIV_EXPR:
+ case TRUNC_DIV_EXPR:
+ case CEIL_DIV_EXPR:
+ case FLOOR_DIV_EXPR:
+ case ROUND_DIV_EXPR:
+ op1_l = find_lattice_value (TREE_OPERAND (rhs, 0));
+ op2_l = find_lattice_value (TREE_OPERAND (rhs, 1));
+
+ /* Obviously, if either varies, so does the result. */
+ if (op1_l == VARYING || op2_l == VARYING)
+ new_l = VARYING;
+ /* Don't prematurely promote variables if we've not yet seen
+ their inputs. */
+ else if (op1_l == UNINITIALIZED)
+ new_l = op2_l;
+ else if (op2_l == UNINITIALIZED)
+ new_l = op1_l;
+ else
+ {
+ /* At this point both numbers have only one component. If the
+ numbers are of opposite kind, the result is imaginary,
+ otherwise the result is real. The add/subtract translates
+ the real/imag from/to 0/1; the ^ performs the comparison. */
+ new_l = ((op1_l - ONLY_REAL) ^ (op2_l - ONLY_REAL)) + ONLY_REAL;
+
+ /* Don't allow the lattice value to flip-flop indefinitely. */
+ new_l |= old_l;
+ }
+ break;
+
+ case NEGATE_EXPR:
+ case CONJ_EXPR:
+ new_l = find_lattice_value (TREE_OPERAND (rhs, 0));
+ break;
+
+ default:
+ new_l = VARYING;
+ break;
+ }
+
+ /* If nothing changed this round, let the propagator know. */
+ if (new_l == old_l)
+ return SSA_PROP_NOT_INTERESTING;
+
+ VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
+ return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
+}
+
+/* Evaluate a PHI node against the complex lattice defined above. */
+
+static enum ssa_prop_result
+complex_visit_phi (tree phi)
+{
+ complex_lattice_t new_l, old_l;
+ unsigned int ver;
+ tree lhs;
+ int i;
+
+ lhs = PHI_RESULT (phi);
+
+ /* This condition should be satisfied due to the initial filter
+ set up in init_dont_simulate_again. */
+ gcc_assert (TREE_CODE (TREE_TYPE (lhs)) == COMPLEX_TYPE);
+
+ /* We've set up the lattice values such that IOR neatly models PHI meet. */
+ new_l = UNINITIALIZED;
+ for (i = PHI_NUM_ARGS (phi) - 1; i >= 0; --i)
+ new_l |= find_lattice_value (PHI_ARG_DEF (phi, i));
+
+ ver = SSA_NAME_VERSION (lhs);
+ old_l = VEC_index (complex_lattice_t, complex_lattice_values, ver);
+
+ if (new_l == old_l)
+ return SSA_PROP_NOT_INTERESTING;
+
+ VEC_replace (complex_lattice_t, complex_lattice_values, ver, new_l);
+ return new_l == VARYING ? SSA_PROP_VARYING : SSA_PROP_INTERESTING;
+}
+
+/* For each referenced complex gimple register, set up a pair of registers
+ to hold the components of the complex value. */
+
+static void
+create_components (void)
+{
+ size_t k, n;
+
+ n = num_referenced_vars;
+ complex_variable_components = VEC_alloc (tree, heap, 2*n);
+ VEC_safe_grow (tree, heap, complex_variable_components, 2*n);
+
+ for (k = 0; k < n; ++k)
+ {
+ tree var = referenced_var (k);
+ tree r = NULL, i = NULL;
+
+ if (var != NULL
+ && TREE_CODE (TREE_TYPE (var)) == COMPLEX_TYPE
+ && is_gimple_reg (var))
+ {
+ tree inner_type = TREE_TYPE (TREE_TYPE (var));
+
+ r = make_rename_temp (inner_type, "CR");
+ i = make_rename_temp (inner_type, "CI");
+ DECL_SOURCE_LOCATION (r) = DECL_SOURCE_LOCATION (var);
+ DECL_SOURCE_LOCATION (i) = DECL_SOURCE_LOCATION (var);
+ DECL_ARTIFICIAL (r) = 1;
+ DECL_ARTIFICIAL (i) = 1;
+
+ if (DECL_NAME (var) && !DECL_IGNORED_P (var))
+ {
+ const char *name = IDENTIFIER_POINTER (DECL_NAME (var));
+
+ DECL_NAME (r) = get_identifier (ACONCAT ((name, "$real", NULL)));
+ DECL_NAME (i) = get_identifier (ACONCAT ((name, "$imag", NULL)));
+
+ SET_DECL_DEBUG_EXPR (r, build1 (REALPART_EXPR, inner_type, var));
+ SET_DECL_DEBUG_EXPR (i, build1 (IMAGPART_EXPR, inner_type, var));
+ DECL_DEBUG_EXPR_IS_FROM (r) = 1;
+ DECL_DEBUG_EXPR_IS_FROM (i) = 1;
+
+ DECL_IGNORED_P (r) = 0;
+ DECL_IGNORED_P (i) = 0;
+
+ TREE_NO_WARNING (r) = TREE_NO_WARNING (var);
+ TREE_NO_WARNING (i) = TREE_NO_WARNING (var);
+ }
+ else
+ {
+ DECL_IGNORED_P (r) = 1;
+ DECL_IGNORED_P (i) = 1;
+ TREE_NO_WARNING (r) = 1;
+ TREE_NO_WARNING (i) = 1;
+ }
+ }
+
+ VEC_replace (tree, complex_variable_components, 2*k, r);
+ VEC_replace (tree, complex_variable_components, 2*k + 1, i);
+ }
+}
/* Extract the real or imaginary part of a complex variable or constant.
Make sure that it's a proper gimple_val and gimplify it if not.
Emit any new code before BSI. */
static tree
-extract_component (block_stmt_iterator *bsi, tree t, bool imagpart_p)
+extract_component (block_stmt_iterator *bsi, tree t, bool imagpart_p,
+ bool gimple_p)
{
- tree ret, inner_type;
-
- inner_type = TREE_TYPE (TREE_TYPE (t));
switch (TREE_CODE (t))
{
case COMPLEX_CST:
- ret = (imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t));
- break;
+ return imagpart_p ? TREE_IMAGPART (t) : TREE_REALPART (t);
case COMPLEX_EXPR:
- ret = TREE_OPERAND (t, imagpart_p);
- break;
+ return TREE_OPERAND (t, imagpart_p);
case VAR_DECL:
case PARM_DECL:
- ret = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR),
- inner_type, t);
- break;
+ case INDIRECT_REF:
+ case COMPONENT_REF:
+ case ARRAY_REF:
+ {
+ tree inner_type = TREE_TYPE (TREE_TYPE (t));
+
+ t = build1 ((imagpart_p ? IMAGPART_EXPR : REALPART_EXPR),
+ inner_type, unshare_expr (t));
+
+ if (gimple_p)
+ t = gimplify_val (bsi, inner_type, t);
+
+ return t;
+ }
+
+ case SSA_NAME:
+ {
+ tree def = SSA_NAME_DEF_STMT (t);
+
+ if (TREE_CODE (def) == MODIFY_EXPR)
+ {
+ def = TREE_OPERAND (def, 1);
+ if (TREE_CODE (def) == COMPLEX_CST)
+ return imagpart_p ? TREE_IMAGPART (def) : TREE_REALPART (def);
+ if (TREE_CODE (def) == COMPLEX_EXPR)
+ {
+ def = TREE_OPERAND (def, imagpart_p);
+ if (TREE_CONSTANT (def))
+ return def;
+ }
+ }
+
+ return VEC_index (tree, complex_variable_components,
+ var_ann (SSA_NAME_VAR (t))->uid * 2 + imagpart_p);
+ }
default:
gcc_unreachable ();
}
+}
+
+/* Update the complex components of the ssa name on the lhs of STMT. */
- return gimplify_val (bsi, inner_type, ret);
+static void
+update_complex_components (block_stmt_iterator *bsi, tree stmt, tree r, tree i)
+{
+ unsigned int uid = var_ann (SSA_NAME_VAR (TREE_OPERAND (stmt, 0)))->uid;
+ tree v, x;
+
+ v = VEC_index (tree, complex_variable_components, 2*uid);
+ x = build2 (MODIFY_EXPR, TREE_TYPE (v), v, r);
+ SET_EXPR_LOCUS (x, EXPR_LOCUS (stmt));
+ TREE_BLOCK (x) = TREE_BLOCK (stmt);
+ bsi_insert_after (bsi, x, BSI_NEW_STMT);
+
+ v = VEC_index (tree, complex_variable_components, 2*uid + 1);
+ x = build2 (MODIFY_EXPR, TREE_TYPE (v), v, i);
+ SET_EXPR_LOCUS (x, EXPR_LOCUS (stmt));
+ TREE_BLOCK (x) = TREE_BLOCK (stmt);
+ bsi_insert_after (bsi, x, BSI_NEW_STMT);
}
/* Update an assignment to a complex variable in place. */
static void
update_complex_assignment (block_stmt_iterator *bsi, tree r, tree i)
{
- tree stmt = bsi_stmt (*bsi);
+ tree stmt, mod;
tree type;
+ mod = stmt = bsi_stmt (*bsi);
if (TREE_CODE (stmt) == RETURN_EXPR)
- stmt = TREE_OPERAND (stmt, 0);
+ mod = TREE_OPERAND (mod, 0);
+ else if (in_ssa_p)
+ update_complex_components (bsi, stmt, r, i);
- type = TREE_TYPE (TREE_OPERAND (stmt, 1));
- TREE_OPERAND (stmt, 1) = build (COMPLEX_EXPR, type, r, i);
- mark_stmt_modified (stmt);
+ type = TREE_TYPE (TREE_OPERAND (mod, 1));
+ TREE_OPERAND (mod, 1) = build (COMPLEX_EXPR, type, r, i);
+ update_stmt (stmt);
+}
+
+/* Generate code at the entry point of the function to initialize the
+ component variables for a complex parameter. */
+
+static void
+update_parameter_components (void)
+{
+ edge entry_edge = single_succ_edge (ENTRY_BLOCK_PTR);
+ tree parm;
+
+ for (parm = DECL_ARGUMENTS (cfun->decl); parm ; parm = TREE_CHAIN (parm))
+ {
+ tree type = TREE_TYPE (parm);
+ tree ssa_name, x, y;
+ unsigned int uid;
+
+ if (TREE_CODE (type) != COMPLEX_TYPE || !is_gimple_reg (parm))
+ continue;
+
+ type = TREE_TYPE (type);
+ ssa_name = default_def (parm);
+ uid = var_ann (parm)->uid;
+
+ x = VEC_index (tree, complex_variable_components, 2*uid);
+ y = build1 (REALPART_EXPR, type, ssa_name);
+ bsi_insert_on_edge (entry_edge, build2 (MODIFY_EXPR, type, x, y));
+
+ x = VEC_index (tree, complex_variable_components, 2*uid + 1);
+ y = build1 (IMAGPART_EXPR, type, ssa_name);
+ bsi_insert_on_edge (entry_edge, build2 (MODIFY_EXPR, type, x, y));
+ }
+}
+
+/* Generate code to set the component variables of a complex variable
+ to match the PHI statements in block BB. */
+
+static void
+update_phi_components (basic_block bb)
+{
+ tree phi;
+
+ for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
+ if (is_complex_reg (PHI_RESULT (phi)))
+ {
+ unsigned int i, n, uid;
+ tree real, imag, type;
+
+ uid = var_ann (SSA_NAME_VAR (PHI_RESULT (phi)))->uid;
+ real = VEC_index (tree, complex_variable_components, 2*uid);
+ imag = VEC_index (tree, complex_variable_components, 2*uid + 1);
+ type = TREE_TYPE (real);
+
+ for (i = 0, n = PHI_NUM_ARGS (phi); i < n; ++i)
+ {
+ edge e = PHI_ARG_EDGE (phi, i);
+ tree arg = PHI_ARG_DEF (phi, i);
+ tree x;
+
+ x = extract_component (NULL, arg, 0, false);
+ if (real != x)
+ bsi_insert_on_edge (e, build2 (MODIFY_EXPR, type, real, x));
+
+ x = extract_component (NULL, arg, 1, false);
+ if (imag != x)
+ bsi_insert_on_edge (e, build2 (MODIFY_EXPR, type, imag, x));
+ }
+ }
+}
+
+/* Mark each virtual op in STMT for ssa update. */
+
+static void
+update_all_vops (tree stmt)
+{
+ ssa_op_iter iter;
+ tree sym;
+
+ FOR_EACH_SSA_TREE_OPERAND (sym, stmt, iter, SSA_OP_ALL_VIRTUALS)
+ {
+ if (TREE_CODE (sym) == SSA_NAME)
+ sym = SSA_NAME_VAR (sym);
+ mark_sym_for_renaming (sym);
+ }
+}
+
+/* Expand a complex move to scalars. */
+
+static void
+expand_complex_move (block_stmt_iterator *bsi, tree stmt, tree type,
+ tree lhs, tree rhs)
+{
+ tree inner_type = TREE_TYPE (type);
+ tree r, i;
+
+ if (TREE_CODE (lhs) == SSA_NAME)
+ {
+ if (TREE_CODE (rhs) == CALL_EXPR || TREE_SIDE_EFFECTS (rhs))
+ {
+ r = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs));
+ i = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
+ update_complex_components (bsi, stmt, r, i);
+ }
+ else
+ {
+ update_all_vops (bsi_stmt (*bsi));
+ r = extract_component (bsi, rhs, 0, true);
+ i = extract_component (bsi, rhs, 1, true);
+ update_complex_assignment (bsi, r, i);
+ }
+ }
+ else if (TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs))
+ {
+ tree x;
+
+ r = extract_component (bsi, rhs, 0, false);
+ i = extract_component (bsi, rhs, 1, false);
+
+ x = build1 (REALPART_EXPR, inner_type, unshare_expr (lhs));
+ x = build2 (MODIFY_EXPR, inner_type, x, r);
+ bsi_insert_before (bsi, x, BSI_SAME_STMT);
+
+ if (stmt == bsi_stmt (*bsi))
+ {
+ x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
+ TREE_OPERAND (stmt, 0) = x;
+ TREE_OPERAND (stmt, 1) = i;
+ TREE_TYPE (stmt) = inner_type;
+ }
+ else
+ {
+ x = build1 (IMAGPART_EXPR, inner_type, unshare_expr (lhs));
+ x = build2 (MODIFY_EXPR, inner_type, x, i);
+ bsi_insert_before (bsi, x, BSI_SAME_STMT);
+
+ stmt = bsi_stmt (*bsi);
+ gcc_assert (TREE_CODE (stmt) == RETURN_EXPR);
+ TREE_OPERAND (stmt, 0) = lhs;
+ }
+
+ update_all_vops (stmt);
+ update_stmt (stmt);
+ }
}
/* Expand complex addition to scalars:
static void
expand_complex_addition (block_stmt_iterator *bsi, tree inner_type,
tree ar, tree ai, tree br, tree bi,
- enum tree_code code)
+ enum tree_code code,
+ complex_lattice_t al, complex_lattice_t bl)
{
tree rr, ri;
- rr = gimplify_build2 (bsi, code, inner_type, ar, br);
- ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
+ switch (PAIR (al, bl))
+ {
+ case PAIR (ONLY_REAL, ONLY_REAL):
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = ai;
+ break;
+
+ case PAIR (ONLY_REAL, ONLY_IMAG):
+ rr = ar;
+ if (code == MINUS_EXPR)
+ ri = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, bi);
+ else
+ ri = bi;
+ break;
+
+ case PAIR (ONLY_IMAG, ONLY_REAL):
+ if (code == MINUS_EXPR)
+ rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ar, br);
+ else
+ rr = br;
+ ri = ai;
+ break;
+
+ case PAIR (ONLY_IMAG, ONLY_IMAG):
+ rr = ar;
+ ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
+ break;
+
+ case PAIR (VARYING, ONLY_REAL):
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = ai;
+ break;
+
+ case PAIR (VARYING, ONLY_IMAG):
+ rr = ar;
+ ri = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, bi);
+ break;
+
+ case PAIR (ONLY_REAL, VARYING):
+ if (code == MINUS_EXPR)
+ goto general;
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = bi;
+ break;
+
+ case PAIR (ONLY_IMAG, VARYING):
+ if (code == MINUS_EXPR)
+ goto general;
+ rr = br;
+ ri = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, bi);
+ break;
+
+ case PAIR (VARYING, VARYING):
+ general:
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = gimplify_build2 (bsi, code, inner_type, ai, bi);
+ break;
+
+ default:
+ gcc_unreachable ();
+ }
update_complex_assignment (bsi, rr, ri);
}
TREE_OPERAND (stmt, 1)
= build3 (CALL_EXPR, type, build_fold_addr_expr (fn), args, NULL);
update_stmt (stmt);
+
+ if (in_ssa_p)
+ {
+ tree lhs = TREE_OPERAND (stmt, 0);
+ update_complex_components (bsi, stmt,
+ build1 (REALPART_EXPR, type, lhs),
+ build1 (IMAGPART_EXPR, type, lhs));
+ }
}
/* Expand complex multiplication to scalars:
static void
expand_complex_multiplication (block_stmt_iterator *bsi, tree inner_type,
- tree ar, tree ai, tree br, tree bi)
+ tree ar, tree ai, tree br, tree bi,
+ complex_lattice_t al, complex_lattice_t bl)
{
- tree t1, t2, t3, t4, rr, ri;
+ tree rr, ri;
- if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type))
+ if (al < bl)
{
- expand_complex_libcall (bsi, ar, ai, br, bi, MULT_EXPR);
- return;
+ complex_lattice_t tl;
+ rr = ar, ar = br, br = rr;
+ ri = ai, ai = bi, bi = ri;
+ tl = al, al = bl, bl = tl;
}
- t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
- t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
- t3 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
+ switch (PAIR (al, bl))
+ {
+ case PAIR (ONLY_REAL, ONLY_REAL):
+ rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
+ ri = ai;
+ break;
- /* Avoid expanding redundant multiplication for the common
- case of squaring a complex number. */
- if (ar == br && ai == bi)
- t4 = t3;
- else
- t4 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
+ case PAIR (ONLY_IMAG, ONLY_REAL):
+ rr = ar;
+ if (TREE_CODE (ai) == REAL_CST
+ && REAL_VALUES_IDENTICAL (TREE_REAL_CST (ai), dconst1))
+ ri = br;
+ else
+ ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
+ break;
- rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2);
- ri = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t3, t4);
+ case PAIR (ONLY_IMAG, ONLY_IMAG):
+ rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
+ rr = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, rr);
+ ri = ar;
+ break;
+
+ case PAIR (VARYING, ONLY_REAL):
+ rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
+ ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
+ break;
+
+ case PAIR (VARYING, ONLY_IMAG):
+ rr = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
+ rr = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, rr);
+ ri = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
+ break;
+
+ case PAIR (VARYING, VARYING):
+ if (flag_complex_method == 2 && SCALAR_FLOAT_TYPE_P (inner_type))
+ {
+ expand_complex_libcall (bsi, ar, ai, br, bi, MULT_EXPR);
+ return;
+ }
+ else
+ {
+ tree t1, t2, t3, t4;
+
+ t1 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, br);
+ t2 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, bi);
+ t3 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ar, bi);
+
+ /* Avoid expanding redundant multiplication for the common
+ case of squaring a complex number. */
+ if (ar == br && ai == bi)
+ t4 = t3;
+ else
+ t4 = gimplify_build2 (bsi, MULT_EXPR, inner_type, ai, br);
+
+ rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2);
+ ri = gimplify_build2 (bsi, PLUS_EXPR, inner_type, t3, t4);
+ }
+ break;
+
+ default:
+ gcc_unreachable ();
+ }
update_complex_assignment (bsi, rr, ri);
}
static void
expand_complex_division (block_stmt_iterator *bsi, tree inner_type,
tree ar, tree ai, tree br, tree bi,
- enum tree_code code)
+ enum tree_code code,
+ complex_lattice_t al, complex_lattice_t bl)
{
- switch (flag_complex_method)
+ tree rr, ri;
+
+ switch (PAIR (al, bl))
{
- case 0:
- /* straightforward implementation of complex divide acceptable. */
- expand_complex_div_straight (bsi, inner_type, ar, ai, br, bi, code);
+ case PAIR (ONLY_REAL, ONLY_REAL):
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = ai;
break;
- case 2:
- if (SCALAR_FLOAT_TYPE_P (inner_type))
- {
- expand_complex_libcall (bsi, ar, ai, br, bi, code);
- return;
- }
- /* FALLTHRU */
+ case PAIR (ONLY_REAL, ONLY_IMAG):
+ rr = ai;
+ ri = gimplify_build2 (bsi, code, inner_type, ar, bi);
+ ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ri);
+ break;
+
+ case PAIR (ONLY_IMAG, ONLY_REAL):
+ rr = ar;
+ ri = gimplify_build2 (bsi, code, inner_type, ai, br);
+ break;
- case 1:
- /* wide ranges of inputs must work for complex divide. */
- expand_complex_div_wide (bsi, inner_type, ar, ai, br, bi, code);
+ case PAIR (ONLY_IMAG, ONLY_IMAG):
+ rr = gimplify_build2 (bsi, code, inner_type, ai, bi);
+ ri = ar;
break;
+ case PAIR (VARYING, ONLY_REAL):
+ rr = gimplify_build2 (bsi, code, inner_type, ar, br);
+ ri = gimplify_build2 (bsi, code, inner_type, ai, br);
+ break;
+
+ case PAIR (VARYING, ONLY_IMAG):
+ rr = gimplify_build2 (bsi, code, inner_type, ai, bi);
+ ri = gimplify_build2 (bsi, code, inner_type, ar, bi);
+ ri = gimplify_build1 (bsi, NEGATE_EXPR, inner_type, ri);
+
+ case PAIR (ONLY_REAL, VARYING):
+ case PAIR (ONLY_IMAG, VARYING):
+ case PAIR (VARYING, VARYING):
+ switch (flag_complex_method)
+ {
+ case 0:
+ /* straightforward implementation of complex divide acceptable. */
+ expand_complex_div_straight (bsi, inner_type, ar, ai, br, bi, code);
+ break;
+
+ case 2:
+ if (SCALAR_FLOAT_TYPE_P (inner_type))
+ {
+ expand_complex_libcall (bsi, ar, ai, br, bi, code);
+ break;
+ }
+ /* FALLTHRU */
+
+ case 1:
+ /* wide ranges of inputs must work for complex divide. */
+ expand_complex_div_wide (bsi, inner_type, ar, ai, br, bi, code);
+ break;
+
+ default:
+ gcc_unreachable ();
+ }
+ return;
+
default:
gcc_unreachable ();
}
+
+ update_complex_assignment (bsi, rr, ri);
}
/* Expand complex negation to scalars:
gcc_unreachable ();
}
- mark_stmt_modified (stmt);
+ update_stmt (stmt);
}
/* Process one statement. If we identify a complex operation, expand it. */
tree stmt = bsi_stmt (*bsi);
tree rhs, type, inner_type;
tree ac, ar, ai, bc, br, bi;
+ complex_lattice_t al, bl;
enum tree_code code;
switch (TREE_CODE (stmt))
break;
default:
+ {
+ tree lhs = TREE_OPERAND (stmt, 0);
+ tree rhs = TREE_OPERAND (stmt, 1);
+
+ if (TREE_CODE (type) == COMPLEX_TYPE)
+ expand_complex_move (bsi, stmt, type, lhs, rhs);
+ else if ((TREE_CODE (rhs) == REALPART_EXPR
+ || TREE_CODE (rhs) == IMAGPART_EXPR)
+ && TREE_CODE (TREE_OPERAND (rhs, 0)) == SSA_NAME)
+ {
+ TREE_OPERAND (stmt, 1)
+ = extract_component (bsi, TREE_OPERAND (rhs, 0),
+ TREE_CODE (rhs) == IMAGPART_EXPR, false);
+ update_stmt (stmt);
+ }
+ }
return;
}
/* Extract the components of the two complex values. Make sure and
handle the common case of the same value used twice specially. */
ac = TREE_OPERAND (rhs, 0);
- ar = extract_component (bsi, ac, 0);
- ai = extract_component (bsi, ac, 1);
+ ar = extract_component (bsi, ac, 0, true);
+ ai = extract_component (bsi, ac, 1, true);
if (TREE_CODE_CLASS (code) == tcc_unary)
bc = br = bi = NULL;
br = ar, bi = ai;
else
{
- br = extract_component (bsi, bc, 0);
- bi = extract_component (bsi, bc, 1);
+ br = extract_component (bsi, bc, 0, true);
+ bi = extract_component (bsi, bc, 1, true);
}
}
+ if (in_ssa_p)
+ {
+ al = find_lattice_value (ac);
+ if (al == UNINITIALIZED)
+ al = VARYING;
+
+ if (TREE_CODE_CLASS (code) == tcc_unary)
+ bl = UNINITIALIZED;
+ else if (ac == bc)
+ bl = al;
+ else
+ {
+ bl = find_lattice_value (bc);
+ if (bl == UNINITIALIZED)
+ bl = VARYING;
+ }
+ }
+ else
+ al = bl = VARYING;
+
switch (code)
{
case PLUS_EXPR:
case MINUS_EXPR:
- expand_complex_addition (bsi, inner_type, ar, ai, br, bi, code);
+ expand_complex_addition (bsi, inner_type, ar, ai, br, bi, code, al, bl);
break;
case MULT_EXPR:
- expand_complex_multiplication (bsi, inner_type, ar, ai, br, bi);
+ expand_complex_multiplication (bsi, inner_type, ar, ai, br, bi, al, bl);
break;
case TRUNC_DIV_EXPR:
case FLOOR_DIV_EXPR:
case ROUND_DIV_EXPR:
case RDIV_EXPR:
- expand_complex_division (bsi, inner_type, ar, ai, br, bi, code);
+ expand_complex_division (bsi, inner_type, ar, ai, br, bi, code, al, bl);
break;
case NEGATE_EXPR:
default:
gcc_unreachable ();
}
- update_stmt_if_modified (stmt);
}
+\f
+/* Entry point for complex operation lowering during optimization. */
+
static void
tree_lower_complex (void)
{
- int old_last_basic_block = last_basic_block;
+ int old_last_basic_block;
block_stmt_iterator bsi;
basic_block bb;
+ if (!init_dont_simulate_again ())
+ return;
+
+ complex_lattice_values = VEC_alloc (complex_lattice_t, heap, num_ssa_names);
+ VEC_safe_grow (complex_lattice_t, heap,
+ complex_lattice_values, num_ssa_names);
+ memset (VEC_address (complex_lattice_t, complex_lattice_values), 0,
+ num_ssa_names * sizeof(complex_lattice_t));
+ init_parameter_lattice_values ();
+
+ ssa_propagate (complex_visit_stmt, complex_visit_phi);
+
+ create_components ();
+ update_parameter_components ();
+
+ old_last_basic_block = last_basic_block;
FOR_EACH_BB (bb)
{
if (bb->index >= old_last_basic_block)
continue;
+ update_phi_components (bb);
for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
expand_complex_operations_1 (&bsi);
}
-}
+ bsi_commit_edge_inserts ();
+
+ VEC_free (tree, heap, complex_variable_components);
+ VEC_free (complex_lattice_t, heap, complex_lattice_values);
+}
struct tree_opt_pass pass_lower_complex =
{
NULL, /* next */
0, /* static_pass_number */
0, /* tv_id */
+ PROP_ssa, /* properties_required */
+ 0, /* properties_provided */
+ 0, /* properties_destroyed */
+ 0, /* todo_flags_start */
+ TODO_dump_func | TODO_ggc_collect
+ | TODO_update_ssa
+ | TODO_verify_stmts, /* todo_flags_finish */
+ 0 /* letter */
+};
+
+\f
+/* Entry point for complex operation lowering without optimization. */
+
+static void
+tree_lower_complex_O0 (void)
+{
+ int old_last_basic_block = last_basic_block;
+ block_stmt_iterator bsi;
+ basic_block bb;
+
+ FOR_EACH_BB (bb)
+ {
+ if (bb->index >= old_last_basic_block)
+ continue;
+ for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
+ expand_complex_operations_1 (&bsi);
+ }
+}
+
+static bool
+gate_no_optimization (void)
+{
+ return optimize == 0;
+}
+
+struct tree_opt_pass pass_lower_complex_O0 =
+{
+ "cplxlower0", /* name */
+ gate_no_optimization, /* gate */
+ tree_lower_complex_O0, /* execute */
+ NULL, /* sub */
+ NULL, /* next */
+ 0, /* static_pass_number */
+ 0, /* tv_id */
PROP_cfg, /* properties_required */
0, /* properties_provided */
0, /* properties_destroyed */
projects / platform / upstream / gcc.git / commitdiff