From f0d6e81c06c3a390e450aad66ac3083a175621f3 Mon Sep 17 00:00:00 2001 From: tneumann Date: Wed, 6 Jun 2007 20:18:47 +0000 Subject: * tree-ssa-alias-warnings.c (maybe_add_match): Cast according to the coding conventions. (add_key): Likewise. * tree-ssa.c (init_tree_ssa): Use type safe memory macros. * tree-ssa-ccp.c (ccp_fold_builtin): Avoid using C++ keywords as variable names. * tree-ssa-coalesce.c (find_coalesce_pair): Use type safe memory macros. (add_cost_one_coalesce): Likewise. * tree-ssa-copy.c (merge_alias_info): Avoid using C++ keywords as variable names. Rename orig to orig_name for consistency. * tree-ssa-dom.c (dom_thread_across_edge): Cast according to the coding conventions. (cprop_into_successor_phis): Avoid using C++ keywords as variable names. (record_equivalences_from_stmt): Likewise. * tree-ssa-dse.c (dse_initialize_block_local_data): Cast according to the coding conventions. (memory_ssa_name_same): Likewise. (dse_optimize_stmt): Likewise. (dse_record_phis): Likewise. (dse_finalize_block): Likewise. * tree-ssa-loop-im.c (outermost_invariant_loop_expr): Avoid using C++ keywords as variable names. (may_move_till): Cast according to the coding conventions. (force_move_till_expr): Avoid using C++ keywords as variable names. (force_move_till): Cast according to the coding conventions. (memref_hash): Likewise. (memref_eq): Likewise. (gather_mem_refs_stmt): Likewise. * tree-ssa-loop-ivopts.c (contains_abnormal_ssa_name_p): Avoid using C++ keywords as variable names. (idx_find_step): Cast according to the coding conventions. (idx_record_use): Likewise. (find_depends): Likewise. (prepare_decl_rtl): Likewise. (mbc_entry_hash): Likewise. (mbc_entry_eq): Likewise. * tree-ssa-loop-niter.c (SWAP): Use the correct the type for tmp. (simplify_replace_tree): Avoid using C++ keywords as variable names. (idx_infer_loop_bounds): Cast according to the coding conventions. * tree-ssa-loop-prefetch.c (idx_analyze_ref): Likewise. * tree-ssa-math-opts.c (occ_new ): Likwise. * tree-ssanames.c (duplicate_ssa_name_ptr_info): Use type safe memory macros. * tree-ssa-operands.c (add_def_op): Avoid using C++ keywords as variable names. (add_use_op): Likewise. (add_vop): Likewise. (add_vuse_op): Likewise. (add_vdef_op): Likewise. (get_expr_operands): Likewise. (push_stmt_changes): Use type safe memory macros. * tree-ssa-phiopt.c (replace_phi_edge_with_variable): Avoid using C++ keywords as variable names. (conditional_replacement): Likewise. (minmax_replacement): Likewise. (abs_replacement): Likewise. * tree-ssa-pre.c (create_expression_by_pieces): Cast according to the coding conventions. (insert_fake_stores): Avoid using C++ keywords as variable names. * tree-ssa-reassoc.c (add_to_ops_vec): Cast according to the coding conventions. * tree-ssa-structalias.c (heapvar_lookup): Likewise. (heapvar_insert): Use type safe memory macros. (new_var_info): Cast according to the coding conventions. (new_constraint): Likewise. (remove_preds_and_fake_succs): Use type safe memory macros. * tree-ssa-threadupdate.c (thread_block): Cast according to the coding conventions. (thread_single_edge): Likewise. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@125504 138bc75d-0d04-0410-961f-82ee72b054a4 --- gcc/tree-ssa-dom.c | 32 ++++++++++++++++---------------- 1 file changed, 16 insertions(+), 16 deletions(-) (limited to 'gcc/tree-ssa-dom.c') diff --git a/gcc/tree-ssa-dom.c b/gcc/tree-ssa-dom.c index 87270fc8e08..0241155de0f 100644 --- a/gcc/tree-ssa-dom.c +++ b/gcc/tree-ssa-dom.c @@ -569,7 +569,7 @@ dom_thread_across_edge (struct dom_walk_data *walk_data, edge e) walk_data->global_data = dummy_cond; } - thread_across_edge (walk_data->global_data, e, false, + thread_across_edge ((tree) walk_data->global_data, e, false, &const_and_copies_stack, simplify_stmt_for_jump_threading); } @@ -1239,26 +1239,26 @@ cprop_into_successor_phis (basic_block bb) indx = e->dest_idx; for ( ; phi; phi = PHI_CHAIN (phi)) { - tree new; + tree new_val; use_operand_p orig_p; - tree orig; + tree orig_val; /* The alternative may be associated with a constant, so verify it is an SSA_NAME before doing anything with it. */ orig_p = PHI_ARG_DEF_PTR (phi, indx); - orig = USE_FROM_PTR (orig_p); - if (TREE_CODE (orig) != SSA_NAME) + orig_val = USE_FROM_PTR (orig_p); + if (TREE_CODE (orig_val) != SSA_NAME) continue; /* If we have *ORIG_P in our constant/copy table, then replace ORIG_P with its value in our constant/copy table. */ - new = SSA_NAME_VALUE (orig); - if (new - && new != orig - && (TREE_CODE (new) == SSA_NAME - || is_gimple_min_invariant (new)) - && may_propagate_copy (orig, new)) - propagate_value (orig_p, new); + new_val = SSA_NAME_VALUE (orig_val); + if (new_val + && new_val != orig_val + && (TREE_CODE (new_val) == SSA_NAME + || is_gimple_min_invariant (new_val)) + && may_propagate_copy (orig_val, new_val)) + propagate_value (orig_p, new_val); } } } @@ -1591,7 +1591,7 @@ record_equivalences_from_stmt (tree stmt, int may_optimize_p, stmt_ann_t ann) && !is_gimple_reg (lhs)) { tree rhs = GIMPLE_STMT_OPERAND (stmt, 1); - tree new; + tree new_stmt; /* FIXME: If the LHS of the assignment is a bitfield and the RHS is a constant, we need to adjust the constant to fit into the @@ -1617,13 +1617,13 @@ record_equivalences_from_stmt (tree stmt, int may_optimize_p, stmt_ann_t ann) if (rhs) { /* Build a new statement with the RHS and LHS exchanged. */ - new = build_gimple_modify_stmt (rhs, lhs); + new_stmt = build_gimple_modify_stmt (rhs, lhs); - create_ssa_artificial_load_stmt (new, stmt); + create_ssa_artificial_load_stmt (new_stmt, stmt); /* Finally enter the statement into the available expression table. */ - lookup_avail_expr (new, true); + lookup_avail_expr (new_stmt, true); } } } -- cgit v1.2.1