aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-chrec.c
diff options
context:
space:
mode:
Diffstat (limited to 'gcc/tree-chrec.c')
-rw-r--r--gcc/tree-chrec.c18
1 files changed, 10 insertions, 8 deletions
diff --git a/gcc/tree-chrec.c b/gcc/tree-chrec.c
index 79f07b0..e7e47b1 100644
--- a/gcc/tree-chrec.c
+++ b/gcc/tree-chrec.c
@@ -490,7 +490,6 @@ tree_fold_binomial (tree type, tree n, unsigned int k)
{
bool overflow;
unsigned int i;
- tree res;
/* Handle the most frequent cases. */
if (k == 0)
@@ -498,18 +497,20 @@ tree_fold_binomial (tree type, tree n, unsigned int k)
if (k == 1)
return fold_convert (type, n);
+ widest_int num = wi::to_widest (n);
+
/* Check that k <= n. */
- if (wi::ltu_p (n, k))
+ if (wi::ltu_p (num, k))
return NULL_TREE;
/* Denominator = 2. */
- wide_int denom = wi::two (TYPE_PRECISION (TREE_TYPE (n)));
+ widest_int denom = 2;
/* Index = Numerator-1. */
- wide_int idx = wi::sub (n, 1);
+ widest_int idx = num - 1;
/* Numerator = Numerator*Index = n*(n-1). */
- wide_int num = wi::smul (n, idx, &overflow);
+ num = wi::smul (num, idx, &overflow);
if (overflow)
return NULL_TREE;
@@ -528,9 +529,10 @@ tree_fold_binomial (tree type, tree n, unsigned int k)
}
/* Result = Numerator / Denominator. */
- wide_int di_res = wi::udiv_trunc (num, denom);
- res = wide_int_to_tree (type, di_res);
- return int_fits_type_p (res, type) ? res : NULL_TREE;
+ num = wi::udiv_trunc (num, denom);
+ if (! wi::fits_to_tree_p (num, type))
+ return NULL_TREE;
+ return wide_int_to_tree (type, num);
}
/* Helper function. Use the Newton's interpolating formula for