diff options
| author | Roger Sayle <roger@eyesopen.com> | 2004-11-23 01:27:42 +0000 |
|---|---|---|
| committer | Roger Sayle <sayle@gcc.gnu.org> | 2004-11-23 01:27:42 +0000 |
| commit | b52d5eaa44789d6c9593c12d7d1c1419fe59b0c1 (patch) | |
| tree | cbdc035bbae2cbaa36d0c682f7035fccc80e4ec2 /gcc/tree-ssa-loop-ivopts.c | |
| parent | ba2baa55a34a75ddde02a3ac05daf805fc413e1c (diff) | |
| download | gcc-b52d5eaa44789d6c9593c12d7d1c1419fe59b0c1.zip gcc-b52d5eaa44789d6c9593c12d7d1c1419fe59b0c1.tar.gz gcc-b52d5eaa44789d6c9593c12d7d1c1419fe59b0c1.tar.bz2 | |
fold-const.c (nondestructive_fold_binary_to_constant): Rename to fold_binary_to_constant.
* fold-const.c (nondestructive_fold_binary_to_constant): Rename
to fold_binary_to_constant.
(nondestructive_fold_unary_to_constant): Likewise, rename to
fold_unary_to_constant.
(fold_relational_hi_lo): Update call to fold_binary_to_constant.
* tree.h (nondestructive_fold_binary_to_constant): Update prototype.
(nondestructive_fold_unary_to_constant): Likewise.
* tree-ssa-ccp.c (ccp_fold): Update calls to fold_unary_to_constant
and fold_binary_to_constant.
* tree-ssa-loop-niter.c (EXEC_BINARY, EXEC_UNARY): Delete macros.
(inverse, number_of_iterations_cond): Replace uses of EXEC_BINARY
and EXEC_UNARY with calls to fold_*nary_to_constant.
* tree-ssa-loop-ivopts.c (EXEC_BINARY, EXEC_UNARY): Delete macros.
(idx_find_step): Replace uses of EXEC_BINARY with calls to
fold_binary_to_constant.
From-SVN: r91063
Diffstat (limited to 'gcc/tree-ssa-loop-ivopts.c')
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 8 |
1 files changed, 3 insertions, 5 deletions
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index 833cbf8..1de1e82 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -96,9 +96,6 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA this. */ #define AVG_LOOP_NITER(LOOP) 5 -/* Just to shorten the ugly names. */ -#define EXEC_BINARY nondestructive_fold_binary_to_constant -#define EXEC_UNARY nondestructive_fold_unary_to_constant /* Representation of the induction variable. */ struct iv @@ -1364,12 +1361,13 @@ idx_find_step (tree base, tree *idx, void *data) return false; } - step = EXEC_BINARY (MULT_EXPR, type, step, iv_step); + step = fold_binary_to_constant (MULT_EXPR, type, step, iv_step); if (!*dta->step_p) *dta->step_p = step; else - *dta->step_p = EXEC_BINARY (PLUS_EXPR, type, *dta->step_p, step); + *dta->step_p = fold_binary_to_constant (PLUS_EXPR, type, + *dta->step_p, step); return true; } |