diff options
Diffstat (limited to 'gcc/tree-complex.c')
| -rw-r--r-- | gcc/tree-complex.c | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/gcc/tree-complex.c b/gcc/tree-complex.c index 193fc65c0e8..b0ffc00bb8f 100644 --- a/gcc/tree-complex.c +++ b/gcc/tree-complex.c @@ -220,7 +220,7 @@ init_dont_simulate_again (void) for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) { - gimple stmt; + gimple *stmt; tree op0, op1; bool sim_again_p; @@ -308,7 +308,7 @@ init_dont_simulate_again (void) /* Evaluate statement STMT against the complex lattice defined above. */ static enum ssa_prop_result -complex_visit_stmt (gimple stmt, edge *taken_edge_p ATTRIBUTE_UNUSED, +complex_visit_stmt (gimple *stmt, edge *taken_edge_p ATTRIBUTE_UNUSED, tree *result_p) { complex_lattice_t new_l, old_l, op1_l, op2_l; @@ -536,7 +536,7 @@ set_component_ssa_name (tree ssa_name, bool imag_p, tree value) complex_lattice_t lattice = find_lattice_value (ssa_name); size_t ssa_name_index; tree comp; - gimple last; + gimple *last; gimple_seq list; /* We know the value must be zero, else there's a bug in our lattice @@ -642,7 +642,7 @@ extract_component (gimple_stmt_iterator *gsi, tree t, bool imagpart_p, /* Update the complex components of the ssa name on the lhs of STMT. */ static void -update_complex_components (gimple_stmt_iterator *gsi, gimple stmt, tree r, +update_complex_components (gimple_stmt_iterator *gsi, gimple *stmt, tree r, tree i) { tree lhs; @@ -679,7 +679,7 @@ update_complex_components_on_edge (edge e, tree lhs, tree r, tree i) static void update_complex_assignment (gimple_stmt_iterator *gsi, tree r, tree i) { - gimple stmt; + gimple *stmt; gimple_assign_set_rhs_with_ops (gsi, COMPLEX_EXPR, r, i); stmt = gsi_stmt (*gsi); @@ -735,7 +735,7 @@ update_phi_components (basic_block bb) if (is_complex_reg (gimple_phi_result (phi))) { tree lr, li; - gimple pr = NULL, pi = NULL; + gimple *pr = NULL, *pi = NULL; unsigned int i, n; lr = get_component_ssa_name (gimple_phi_result (phi), false); @@ -771,7 +771,7 @@ expand_complex_move (gimple_stmt_iterator *gsi, tree type) { tree inner_type = TREE_TYPE (type); tree r, i, lhs, rhs; - gimple stmt = gsi_stmt (*gsi); + gimple *stmt = gsi_stmt (*gsi); if (is_gimple_assign (stmt)) { @@ -832,7 +832,7 @@ expand_complex_move (gimple_stmt_iterator *gsi, tree type) else if (rhs && TREE_CODE (rhs) == SSA_NAME && !TREE_SIDE_EFFECTS (lhs)) { tree x; - gimple t; + gimple *t; location_t loc; loc = gimple_location (stmt); @@ -954,7 +954,7 @@ expand_complex_libcall (gimple_stmt_iterator *gsi, tree ar, tree ai, machine_mode mode; enum built_in_function bcode; tree fn, type, lhs; - gimple old_stmt; + gimple *old_stmt; gcall *stmt; old_stmt = gsi_stmt (*gsi); @@ -1120,7 +1120,7 @@ expand_complex_div_wide (gimple_stmt_iterator *gsi, tree inner_type, { tree rr, ri, ratio, div, t1, t2, tr, ti, compare; basic_block bb_cond, bb_true, bb_false, bb_join; - gimple stmt; + gimple *stmt; /* Examine |br| < |bi|, and branch. */ t1 = gimplify_build1 (gsi, ABS_EXPR, inner_type, br); @@ -1134,7 +1134,7 @@ expand_complex_div_wide (gimple_stmt_iterator *gsi, tree inner_type, if (TREE_CODE (compare) != INTEGER_CST) { edge e; - gimple stmt; + gimple *stmt; tree cond, tmp; tmp = create_tmp_var (boolean_type_node); @@ -1382,7 +1382,7 @@ expand_complex_comparison (gimple_stmt_iterator *gsi, tree ar, tree ai, tree br, tree bi, enum tree_code code) { tree cr, ci, cc, type; - gimple stmt; + gimple *stmt; cr = gimplify_build2 (gsi, code, boolean_type_node, ar, br); ci = gimplify_build2 (gsi, code, boolean_type_node, ai, bi); @@ -1460,7 +1460,7 @@ expand_complex_asm (gimple_stmt_iterator *gsi) static void expand_complex_operations_1 (gimple_stmt_iterator *gsi) { - gimple stmt = gsi_stmt (*gsi); + gimple *stmt = gsi_stmt (*gsi); tree type, inner_type, lhs; tree ac, ar, ai, bc, br, bi; complex_lattice_t al, bl; |