diff options
| author | Zdenek Dvorak <dvorakz@suse.cz> | 2004-10-01 09:06:06 +0000 |
|---|---|---|
| committer | Zdenek Dvorak <dvorakz@suse.cz> | 2004-10-01 09:06:06 +0000 |
| commit | a8f92e25729ba7c6e4fe518772a2857bac5b501c (patch) | |
| tree | 7e352a964e8d59a79b5a87f2f3a25bb04f957d6a /gcc/tree-chrec.c | |
| parent | 02a8aeb9e4c4209200e6b61356c640f410eaf854 (diff) | |
* tree-chrec.c (chrec_fold_plus_poly_poly, chrec_fold_plus_1,
chrec_fold_multiply): Use fold_convert or build_int_cst_type instead
od fonvert.
* tree-scalar-evolution.c (compute_overall_effect_of_inner_loop,
add_to_evolution, set_nb_iterations_in_loop, follow_ssa_edge_in_rhs,
follow_ssa_edge_in_rhs): Ditto.
* tree-ssa-loop-ivopts.c (struct iv): Add base_object field.
(dump_iv): Dump base_object.
(dump_use, dump_cand): Use dump_iv.
(determine_base_object): New function.
(alloc_iv): Initialize base_object field.
(record_use): Clear the ssa_name field of iv.
(get_computation_cost_at): Do not use difference of addresses of
two different objects.
(may_eliminate_iv): Do not require the loop to have just single exit.
* tree-ssa-loop-niter.c (zero_p): Do not check for overflows.
(nonzero_p): New function.
(inverse, number_of_iterations_cond, simplify_using_outer_evolutions,
tree_simplify_using_condition, simplify_using_initial_conditions,
loop_niter_by_eval, find_loop_niter_by_eval,
estimate_numbers_of_iterations_loop, compare_trees,
upper_bound_in_type, lower_bound_in_type,
can_count_iv_in_wider_type_bound): Use buildN instead of build. Use
fold_convert or build_int_cst_type instead of convert. Use (non)zero_p
instead of integer_(non)zerop.
git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@88388 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-chrec.c')
| -rw-r--r-- | gcc/tree-chrec.c | 13 |
1 files changed, 6 insertions, 7 deletions
diff --git a/gcc/tree-chrec.c b/gcc/tree-chrec.c index 2d48093c0e2..00f3b5f285c 100644 --- a/gcc/tree-chrec.c +++ b/gcc/tree-chrec.c @@ -117,7 +117,7 @@ chrec_fold_plus_poly_poly (enum tree_code code, (CHREC_VARIABLE (poly1), chrec_fold_minus (type, poly0, CHREC_LEFT (poly1)), chrec_fold_multiply (type, CHREC_RIGHT (poly1), - convert (type, integer_minus_one_node))); + build_int_cst_type (type, -1))); } if (CHREC_VARIABLE (poly0) > CHREC_VARIABLE (poly1)) @@ -282,9 +282,8 @@ chrec_fold_plus_1 (enum tree_code code, return build_polynomial_chrec (CHREC_VARIABLE (op1), chrec_fold_minus (type, op0, CHREC_LEFT (op1)), - chrec_fold_multiply (type, CHREC_RIGHT (op1), - convert (type, - integer_minus_one_node))); + chrec_fold_multiply (type, CHREC_RIGHT (op1), + build_int_cst_type (type, -1))); default: if (tree_contains_chrecs (op0) @@ -347,7 +346,7 @@ chrec_fold_multiply (tree type, if (integer_onep (op1)) return op0; if (integer_zerop (op1)) - return convert (type, integer_zero_node); + return build_int_cst_type (type, 0); return build_polynomial_chrec (CHREC_VARIABLE (op0), @@ -360,7 +359,7 @@ chrec_fold_multiply (tree type, return op1; if (integer_zerop (op0)) - return convert (type, integer_zero_node); + return build_int_cst_type (type, 0); switch (TREE_CODE (op1)) { @@ -374,7 +373,7 @@ chrec_fold_multiply (tree type, if (integer_onep (op1)) return op0; if (integer_zerop (op1)) - return convert (type, integer_zero_node); + return build_int_cst_type (type, 0); return fold (build (MULT_EXPR, type, op0, op1)); } } |