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-scalar-evolution.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-scalar-evolution.c')
| -rw-r--r-- | gcc/tree-scalar-evolution.c | 11 |
1 files changed, 5 insertions, 6 deletions
diff --git a/gcc/tree-scalar-evolution.c b/gcc/tree-scalar-evolution.c index 2566a23..d1f1607 100644 --- a/gcc/tree-scalar-evolution.c +++ b/gcc/tree-scalar-evolution.c @@ -571,7 +571,7 @@ chrec_is_positive (tree chrec, bool *value) nb_iter = chrec_fold_minus (chrec_type (nb_iter), nb_iter, - fold_convert (chrec_type (nb_iter), integer_one_node)); + build_int_cst (chrec_type (nb_iter), 1)); #if 0 /* TODO -- If the test is after the exit, we may decrease the number of @@ -579,7 +579,7 @@ chrec_is_positive (tree chrec, bool *value) if (after_exit) nb_iter = chrec_fold_minus (chrec_type (nb_iter), nb_iter, - fold_convert (chrec_type (nb_iter), integer_one_node)); + build_int_cst (chrec_type (nb_iter), 1)); #endif end_value = chrec_apply (CHREC_VARIABLE (chrec), chrec, nb_iter); @@ -704,7 +704,7 @@ add_to_evolution_1 (unsigned loop_nb, { var = loop_nb; left = chrec_before; - right = fold_convert (type, integer_zero_node); + right = build_int_cst (type, 0); } else { @@ -1748,8 +1748,7 @@ interpret_rhs_modify_expr (struct loop *loop, opnd10 = TREE_OPERAND (opnd1, 0); chrec10 = analyze_scalar_evolution (loop, opnd10); chrec10 = chrec_convert (type, chrec10); - res = chrec_fold_minus (type, fold_convert (type, integer_zero_node), - chrec10); + res = chrec_fold_minus (type, build_int_cst (type, 0), chrec10); break; case MULT_EXPR: @@ -2192,7 +2191,7 @@ number_of_iterations_in_loop (struct loop *loop) type = TREE_TYPE (niter_desc.niter); if (integer_nonzerop (niter_desc.may_be_zero)) - res = fold_convert (type, integer_zero_node); + res = build_int_cst (type, 0); else if (integer_zerop (niter_desc.may_be_zero)) res = niter_desc.niter; else |