diff options
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index caba8b5..2a66a6b 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -351,7 +351,7 @@ number_of_iterations_cond (tree type, tree base0, tree step0, (inverse(s/d) * (c/d)) mod (size of mode/d). */ s = step0; d = integer_one_node; - bound = convert (niter_type, build_int_cst (NULL_TREE, ~0, ~0)); + bound = convert (niter_type, build_int_cst (NULL_TREE, -1)); while (1) { tmp = EXEC_BINARY (BIT_AND_EXPR, niter_type, s, @@ -370,7 +370,7 @@ number_of_iterations_cond (tree type, tree base0, tree step0, assumption = fold (build2 (FLOOR_MOD_EXPR, niter_type, base1, d)); assumption = fold (build2 (EQ_EXPR, boolean_type_node, assumption, - build_int_cst (niter_type, 0, 0))); + build_int_cst (niter_type, 0))); assumptions = fold (build2 (TRUTH_AND_EXPR, boolean_type_node, assumptions, assumption)); @@ -884,7 +884,7 @@ loop_niter_by_eval (struct loop *loop, edge exit) fprintf (dump_file, "Proved that loop %d iterates %d times using brute force.\n", loop->num, i); - return build_int_cst (unsigned_type_node, i, 0); + return build_int_cst (unsigned_type_node, i); } for (j = 0; j < 2; j++) @@ -1098,7 +1098,7 @@ upper_bound_in_type (tree outer, tree inner) return convert (outer, convert (inner, - build_int_cst (NULL_TREE, lo, hi))); + build_int_cst_wide (NULL_TREE, lo, hi))); } /* Returns the smallest value obtainable by casting something in INNER type to @@ -1125,7 +1125,7 @@ lower_bound_in_type (tree outer, tree inner) return convert (outer, convert (inner, - build_int_cst (NULL_TREE, lo, hi))); + build_int_cst_wide (NULL_TREE, lo, hi))); } /* Returns true if statement S1 dominates statement S2. */ |