diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-06-26 21:21:34 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-06-26 21:21:34 +0000 |
| commit | 49d00087091a73bd5ed4e29ea8afd093cac6c58f (patch) | |
| tree | 2b44df571f1322c6e8919fb2cb0153a1b07bc292 /gcc/tree-data-ref.c | |
| parent | b5b8d5d10f38daca6cd6b592e4d63a5d809fbe82 (diff) | |
| download | gcc-49d00087091a73bd5ed4e29ea8afd093cac6c58f.tar.gz | |
* builtins.c, c-common.c, c-convert.c, c-decl.c, c-typeck.c,
convert.c, lambda-code.c, predict.c, tree-cfg.c,
tree-complex.c, tree-data-ref.c, tree-if-conv.c,
tree-mudflap.c, tree-scalar-evolution.c, tree-ssa-ccp.c,
tree-ssa-loop-ivcanon.c, tree-ssa-loop-ivopts.c,
tree-ssa-loop-manip.c, tree-ssa-phiopt.c, tree-ssa-pre.c,
tree-vect-analyze.c, tree-vect-transform.c, tree-vectorizer.c,
tree.c: Use fold_buildN instead of fold (buildN (...)).
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@101338 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-data-ref.c')
| -rw-r--r-- | gcc/tree-data-ref.c | 21 |
1 files changed, 11 insertions, 10 deletions
diff --git a/gcc/tree-data-ref.c b/gcc/tree-data-ref.c index dcc85f7af55..d48f020a495 100644 --- a/gcc/tree-data-ref.c +++ b/gcc/tree-data-ref.c @@ -190,7 +190,7 @@ tree_fold_divides_p (tree type, { /* Determines whether (A == gcd (A, B)). */ return integer_zerop - (fold (build (MINUS_EXPR, type, a, tree_fold_gcd (a, b)))); + (fold_build2 (MINUS_EXPR, type, a, tree_fold_gcd (a, b))); } /* Compute the greatest common denominator of two numbers using @@ -487,17 +487,17 @@ estimate_niter_from_size_of_data (struct loop *loop, || TREE_CODE (element_size) != INTEGER_CST) return; - data_size = fold (build2 (EXACT_DIV_EXPR, integer_type_node, - array_size, element_size)); + data_size = fold_build2 (EXACT_DIV_EXPR, integer_type_node, + array_size, element_size); if (init != NULL_TREE && step != NULL_TREE && TREE_CODE (init) == INTEGER_CST && TREE_CODE (step) == INTEGER_CST) { - estimation = fold (build2 (CEIL_DIV_EXPR, integer_type_node, - fold (build2 (MINUS_EXPR, integer_type_node, - data_size, init)), step)); + estimation = fold_build2 (CEIL_DIV_EXPR, integer_type_node, + fold_build2 (MINUS_EXPR, integer_type_node, + data_size, init), step); record_estimate (loop, estimation, boolean_true_node, stmt); } @@ -920,10 +920,11 @@ analyze_siv_subscript_cst_affine (tree chrec_a, (integer_type_node, CHREC_RIGHT (chrec_b), difference)) { *overlaps_a = integer_zero_node; - *overlaps_b = fold - (build (EXACT_DIV_EXPR, integer_type_node, - fold (build1 (ABS_EXPR, integer_type_node, difference)), - CHREC_RIGHT (chrec_b))); + *overlaps_b = fold_build2 (EXACT_DIV_EXPR, integer_type_node, + fold_build1 (ABS_EXPR, + integer_type_node, + difference), + CHREC_RIGHT (chrec_b)); *last_conflicts = integer_one_node; return; } |