diff options
| author | Nathan Sidwell <nathan@codesourcery.com> | 2004-09-07 10:22:44 +0000 |
|---|---|---|
| committer | Nathan Sidwell <nathan@gcc.gnu.org> | 2004-09-07 10:22:44 +0000 |
| commit | 5212068fdf32944f8a35909cd5e9eb8d420fbc76 (patch) | |
| tree | efd2d72434d72037608c092c5558556582089fc1 /gcc/tree-ssa-loop-ivopts.c | |
| parent | 366de0ce7d916d313aba839a2802cfbc70b991cf (diff) | |
| download | gcc-5212068fdf32944f8a35909cd5e9eb8d420fbc76.zip gcc-5212068fdf32944f8a35909cd5e9eb8d420fbc76.tar.gz gcc-5212068fdf32944f8a35909cd5e9eb8d420fbc76.tar.bz2 | |
builtins.c (fold_builtin_strchr): Use build_int_cst, not fold_convert.
* builtins.c (fold_builtin_strchr): Use build_int_cst, not
fold_convert.
(fold_builtin_strpbrk): Likewise.
* expr.c (array_ref_low_bound): Likewise.
* tree-scalar-evolution.c (chrec_is_positive, add_to_evolution_1,
interpret_rhs_modify_expr, number_of_iterations_in_loop): Likewise.
* tree-sra.c (generate_element_zero): Likewise.
* tree-ssa-dom.c (simplify_rhs_and_lookup_avail_expr): Likewise.
* tree-ssa-loop-ivopts.c (determine_biv_step, idx_find_step,
add_old_iv_candidates, add_iv_candidates): Likewise.
* tree-tailcall.c (tree_optimize_tail_calls_1): Likewise.
From-SVN: r87141
Diffstat (limited to 'gcc/tree-ssa-loop-ivopts.c')
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 13 |
1 files changed, 5 insertions, 8 deletions
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index 0464c73..7234660 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -687,7 +687,7 @@ determine_biv_step (tree phi) return NULL_TREE; if (!step) - return fold_convert (type, integer_zero_node); + return build_int_cst (type, 0); return step; } @@ -1173,10 +1173,8 @@ idx_find_step (tree base, tree *idx, void *data) if (TREE_CODE (base) == ARRAY_REF) step = array_ref_element_size (base); else - { - /* The step for pointer arithmetics already is 1 byte. */ - step = fold_convert (type, integer_one_node); - } + /* The step for pointer arithmetics already is 1 byte. */ + step = build_int_cst (type, 1); if (TYPE_PRECISION (iv_type) < TYPE_PRECISION (type)) iv_step = can_count_iv_in_wider_type (dta->ivopts_data->current_loop, @@ -1586,7 +1584,7 @@ add_old_iv_candidates (struct ivopts_data *data, struct iv *iv) /* The same, but with initial value zero. */ add_candidate (data, - fold_convert (TREE_TYPE (iv->base), integer_zero_node), + build_int_cst (TREE_TYPE (iv->base), 0), iv->step, true, NULL); phi = SSA_NAME_DEF_STMT (iv->ssa_name); @@ -1628,8 +1626,7 @@ add_iv_value_candidates (struct ivopts_data *data, add_candidate (data, iv->base, iv->step, false, use); /* The same, but with initial value zero. */ - add_candidate (data, - fold_convert (TREE_TYPE (iv->base), integer_zero_node), + add_candidate (data, build_int_cst (TREE_TYPE (iv->base), 0), iv->step, false, use); } |