aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorRichard Biener <rguenther@suse.de>2022-04-05 16:06:10 +0200
committerRichard Biener <rguenther@suse.de>2022-04-06 08:21:43 +0200
commit86242eb1bd03eba82d8e22b01b16925d43bcc539 (patch)
tree58ed0740e9e26006698bd45272cc212f46a357d3 /gcc
parent6d4bbee4f59c7102f8ed9b6774f0b2d9f6ff4365 (diff)
downloadgcc-86242eb1bd03eba82d8e22b01b16925d43bcc539.zip
gcc-86242eb1bd03eba82d8e22b01b16925d43bcc539.tar.gz
gcc-86242eb1bd03eba82d8e22b01b16925d43bcc539.tar.bz2
tree-optimization/105148 - fix IVOPTs recording uses
The following fixes recording uses in ARRAY_REFs with non-constant element size or low bound. 2022-04-05 Richard Biener <rguenther@suse.de> PR tree-optimization/105148 * tree-ssa-loop-ivopts.cc (idx_record_use): Walk raw operands 2 and 3 of ARRAY_REFs. * gcc.dg/torture/pr105148.c: New testcase.
Diffstat (limited to 'gcc')
-rw-r--r--gcc/testsuite/gcc.dg/torture/pr105148.c20
-rw-r--r--gcc/tree-ssa-loop-ivopts.cc6
2 files changed, 24 insertions, 2 deletions
diff --git a/gcc/testsuite/gcc.dg/torture/pr105148.c b/gcc/testsuite/gcc.dg/torture/pr105148.c
new file mode 100644
index 0000000..3338b0f
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/torture/pr105148.c
@@ -0,0 +1,20 @@
+/* { dg-do compile } */
+
+extern void foo (void);
+
+static inline int
+bar (int n)
+{
+ for (int i = 0; i < n; i++)
+ {
+ foo ();
+ int y[1][i];
+ y[n][i] = 0;
+ }
+}
+
+int
+baz (void)
+{
+ return bar (5);
+}
diff --git a/gcc/tree-ssa-loop-ivopts.cc b/gcc/tree-ssa-loop-ivopts.cc
index 935d2d4..581f92b 100644
--- a/gcc/tree-ssa-loop-ivopts.cc
+++ b/gcc/tree-ssa-loop-ivopts.cc
@@ -2123,8 +2123,10 @@ idx_record_use (tree base, tree *idx,
find_interesting_uses_op (data, *idx);
if (TREE_CODE (base) == ARRAY_REF || TREE_CODE (base) == ARRAY_RANGE_REF)
{
- find_interesting_uses_op (data, array_ref_element_size (base));
- find_interesting_uses_op (data, array_ref_low_bound (base));
+ if (TREE_OPERAND (base, 2))
+ find_interesting_uses_op (data, TREE_OPERAND (base, 2));
+ if (TREE_OPERAND (base, 3))
+ find_interesting_uses_op (data, TREE_OPERAND (base, 3));
}
return true;
}