aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat
-rw-r--r--gcc/testsuite/gcc.dg/tree-ssa/ivopts-5.c14
-rw-r--r--gcc/testsuite/gcc.dg/tree-ssa/ivopts-6.c14
-rw-r--r--gcc/testsuite/gcc.dg/tree-ssa/ivopts-7.c14
-rw-r--r--gcc/testsuite/gcc.dg/tree-ssa/ivopts-8.c14
-rw-r--r--gcc/testsuite/gcc.dg/tree-ssa/ivopts-9.c14
-rw-r--r--gcc/testsuite/gcc.dg/wrapped-binop-simplify.c2
-rw-r--r--gcc/tree-ssa-loop-ivopts.c41
7 files changed, 106 insertions, 7 deletions
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ivopts-5.c b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-5.c
new file mode 100644
index 0000000..a6af497
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-5.c
@@ -0,0 +1,14 @@
+/* { dg-do compile { target lp64 } } */
+/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
+
+int*
+foo (int* mem, int sz, int val)
+{
+ int i;
+ for (i = 0; i < sz; i++)
+ if (mem[i] == val)
+ return &mem[i];
+ return 0;
+}
+
+/* { dg-final { scan-tree-dump "inv_expr \[0-9\]: \\t\\(unsigned long\\) sz_\[0-9\]\\(D\\) \\* 4 \\+ \\(unsigned long\\) mem_\[0-9\]\\(D\\)" "ivopts" } } */
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ivopts-6.c b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-6.c
new file mode 100644
index 0000000..8383154
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-6.c
@@ -0,0 +1,14 @@
+/* { dg-do compile { target lp64 } } */
+/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
+
+int*
+foo (int* mem, int sz, int val)
+{
+ int i;
+ for (i = 0; i != sz; i++)
+ if (mem[i] == val)
+ return &mem[i];
+ return 0;
+}
+
+/* { dg-final { scan-tree-dump "inv_expr \[0-9\]: \\t\\(unsigned long\\) sz_\[0-9\]\\(D\\) \\* 4 \\+ \\(unsigned long\\) mem_\[0-9\]\\(D\\)" "ivopts" } } */
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ivopts-7.c b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-7.c
new file mode 100644
index 0000000..44f5603
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-7.c
@@ -0,0 +1,14 @@
+/* { dg-do compile { target lp64 } } */
+/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
+
+int*
+foo (int* mem, int beg, int end, int val)
+{
+ int i;
+ for (i = beg; i < end; i++)
+ if (mem[i] == val)
+ return &mem[i];
+ return 0;
+}
+/* { dg-final { scan-tree-dump "inv_expr \[0-9\]: \\t\\(unsigned long\\) \\(\\(unsigned int\\) end_\[0-9\]\\(D\\) - \\(unsigned int\\) beg_\[0-9\]\\(D\\)\\)" "ivopts" } } */
+
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ivopts-8.c b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-8.c
new file mode 100644
index 0000000..9e89a03
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-8.c
@@ -0,0 +1,14 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
+
+int*
+foo (int* mem, char sz, int val)
+{
+ char i;
+ for (i = 0; i < sz; i++)
+ if (mem[i] == val)
+ return &mem[i];
+ return 0;
+}
+
+/* { dg-final { scan-tree-dump "inv_expr \[0-9\]: \\t\\(unsigned long\\) sz_\[0-9\]*\\(D\\) \\* 4 \\+ \\(unsigned long\\) mem_\[0-9\]*\\(D\\)" "ivopts" } } */
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/ivopts-9.c b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-9.c
new file mode 100644
index 0000000..22b4a12
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/ivopts-9.c
@@ -0,0 +1,14 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-ivopts-details" } */
+
+int*
+foo (int* mem, unsigned char sz, int val)
+{
+ unsigned char i;
+ for (i = 0; i < sz; i++)
+ if (mem[i] == val)
+ return &mem[i];
+ return 0;
+}
+
+/* { dg-final { scan-tree-dump "inv_expr \[0-9\]: \\t\\(unsigned long\\) sz_\[0-9\]\\(D\\) \\* 4 \\+ \\(unsigned long\\) mem_\[0-9\]\\(D\\)" "ivopts" } } */
diff --git a/gcc/testsuite/gcc.dg/wrapped-binop-simplify.c b/gcc/testsuite/gcc.dg/wrapped-binop-simplify.c
index a5d953b..706eed8 100644
--- a/gcc/testsuite/gcc.dg/wrapped-binop-simplify.c
+++ b/gcc/testsuite/gcc.dg/wrapped-binop-simplify.c
@@ -1,6 +1,6 @@
/* { dg-do compile { target { { i?86-*-* x86_64-*-* s390*-*-* } && lp64 } } } */
/* { dg-options "-O2 -fdump-tree-vrp2-details" } */
-/* { dg-final { scan-tree-dump-times "gimple_simplified to" 4 "vrp2" } } */
+/* { dg-final { scan-tree-dump-times "gimple_simplified to" 1 "vrp2" } } */
void v1 (unsigned long *in, unsigned long *out, unsigned int n)
{
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c
index 4769b65..067f823 100644
--- a/gcc/tree-ssa-loop-ivopts.c
+++ b/gcc/tree-ssa-loop-ivopts.c
@@ -5030,28 +5030,57 @@ determine_group_iv_cost_address (struct ivopts_data *data,
return !sum_cost.infinite_cost_p ();
}
-/* Computes value of candidate CAND at position AT in iteration NITER, and
- stores it to VAL. */
+/* Computes value of candidate CAND at position AT in iteration DESC->NITER,
+ and stores it to VAL. */
static void
-cand_value_at (class loop *loop, struct iv_cand *cand, gimple *at, tree niter,
- aff_tree *val)
+cand_value_at (class loop *loop, struct iv_cand *cand, gimple *at,
+ class tree_niter_desc *desc, aff_tree *val)
{
aff_tree step, delta, nit;
struct iv *iv = cand->iv;
tree type = TREE_TYPE (iv->base);
+ tree niter = desc->niter;
+ bool after_adjust = stmt_after_increment (loop, cand, at);
tree steptype;
+
if (POINTER_TYPE_P (type))
steptype = sizetype;
else
steptype = unsigned_type_for (type);
+ /* If AFTER_ADJUST is required, the code below generates the equivalent
+ of BASE + NITER * STEP + STEP, when ideally we'd prefer the expression
+ BASE + (NITER + 1) * STEP, especially when NITER is often of the form
+ SSA_NAME - 1. Unfortunately, guaranteeing that adding 1 to NITER
+ doesn't overflow is tricky, so we peek inside the TREE_NITER_DESC
+ class for common idioms that we know are safe. */
+ if (after_adjust
+ && desc->control.no_overflow
+ && integer_onep (desc->control.step)
+ && (desc->cmp == LT_EXPR
+ || desc->cmp == NE_EXPR)
+ && TREE_CODE (desc->bound) == SSA_NAME)
+ {
+ if (integer_onep (desc->control.base))
+ {
+ niter = desc->bound;
+ after_adjust = false;
+ }
+ else if (TREE_CODE (niter) == MINUS_EXPR
+ && integer_onep (TREE_OPERAND (niter, 1)))
+ {
+ niter = TREE_OPERAND (niter, 0);
+ after_adjust = false;
+ }
+ }
+
tree_to_aff_combination (iv->step, TREE_TYPE (iv->step), &step);
aff_combination_convert (&step, steptype);
tree_to_aff_combination (niter, TREE_TYPE (niter), &nit);
aff_combination_convert (&nit, steptype);
aff_combination_mult (&nit, &step, &delta);
- if (stmt_after_increment (loop, cand, at))
+ if (after_adjust)
aff_combination_add (&delta, &step);
tree_to_aff_combination (iv->base, type, val);
@@ -5402,7 +5431,7 @@ may_eliminate_iv (struct ivopts_data *data,
return true;
}
- cand_value_at (loop, cand, use->stmt, desc->niter, &bnd);
+ cand_value_at (loop, cand, use->stmt, desc, &bnd);
*bound = fold_convert (TREE_TYPE (cand->iv->base),
aff_combination_to_tree (&bnd));
generated by cgit v1.1 at 2025-02-07 22:11:04 +0000