* [PATCH] tree-optimization/108793 - niter compute type mismatch
@ 2023-02-20 13:08 Richard Biener
0 siblings, 0 replies; only message in thread
From: Richard Biener @ 2023-02-20 13:08 UTC (permalink / raw)
To: gcc-patches
When computing the number of iterations until wrap types are mixed up,
eventually leading to checking ICEs with a pointer bitwise inversion.
The following uses niter_type for the calculation.
Bootstrapped and tested on x86_64-unknown-linux-gnu, pushed.
PR tree-optimization/108793
* tree-ssa-loop-niter.cc (number_of_iterations_until_wrap):
Use convert operands to niter_type when computing num.
* gcc.dg/torture/pr108793.c: New testcase.
---
gcc/testsuite/gcc.dg/torture/pr108793.c | 10 ++++++++++
gcc/tree-ssa-loop-niter.cc | 11 ++++++-----
2 files changed, 16 insertions(+), 5 deletions(-)
create mode 100644 gcc/testsuite/gcc.dg/torture/pr108793.c
diff --git a/gcc/testsuite/gcc.dg/torture/pr108793.c b/gcc/testsuite/gcc.dg/torture/pr108793.c
new file mode 100644
index 00000000000..83973eb05d9
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/torture/pr108793.c
@@ -0,0 +1,10 @@
+/* { dg-do compile } */
+
+typedef int *p;
+extern p a[], b[];
+int f () {
+ int n = 0;
+ for (p* i = &a[0]; i > &b[0]; i++)
+ n++;
+ return n;
+}
diff --git a/gcc/tree-ssa-loop-niter.cc b/gcc/tree-ssa-loop-niter.cc
index 1ce5e736ce3..dc4c7a418f6 100644
--- a/gcc/tree-ssa-loop-niter.cc
+++ b/gcc/tree-ssa-loop-niter.cc
@@ -1494,8 +1494,9 @@ number_of_iterations_until_wrap (class loop *loop, tree type, affine_iv *iv0,
if (integer_zerop (assumptions))
return false;
- num = fold_build2 (MINUS_EXPR, niter_type, wide_int_to_tree (type, max),
- iv1->base);
+ num = fold_build2 (MINUS_EXPR, niter_type,
+ wide_int_to_tree (niter_type, max),
+ fold_convert (niter_type, iv1->base));
/* When base has the form iv + 1, if we know iv >= n, then iv + 1 < n
only when iv + 1 overflows, i.e. when iv == TYPE_VALUE_MAX. */
@@ -1531,8 +1532,9 @@ number_of_iterations_until_wrap (class loop *loop, tree type, affine_iv *iv0,
if (integer_zerop (assumptions))
return false;
- num = fold_build2 (MINUS_EXPR, niter_type, iv0->base,
- wide_int_to_tree (type, min));
+ num = fold_build2 (MINUS_EXPR, niter_type,
+ fold_convert (niter_type, iv0->base),
+ wide_int_to_tree (niter_type, min));
low = min;
if (TREE_CODE (iv0->base) == INTEGER_CST)
high = wi::to_wide (iv0->base) + 1;
@@ -1546,7 +1548,6 @@ number_of_iterations_until_wrap (class loop *loop, tree type, affine_iv *iv0,
/* (delta + step - 1) / step */
step = fold_convert (niter_type, step);
- num = fold_convert (niter_type, num);
num = fold_build2 (PLUS_EXPR, niter_type, num, step);
niter->niter = fold_build2 (FLOOR_DIV_EXPR, niter_type, num, step);
--
2.35.3
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2023-02-20 13:08 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2023-02-20 13:08 [PATCH] tree-optimization/108793 - niter compute type mismatch Richard Biener
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).