aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorVladimir N. Makarov <vmakarov@redhat.com>2023-12-08 15:37:42 -0500
committerVladimir N. Makarov <vmakarov@redhat.com>2023-12-08 15:51:12 -0500
commit48cb51827c9eb991b92014a3f59d31eb237ce03f (patch)
tree73968cfb1f781608c51149120584d824aa38d0c1
parent662a613dd381e327b90b42bb850cb393a01e7f7e (diff)
downloadgcc-48cb51827c9eb991b92014a3f59d31eb237ce03f.zip
gcc-48cb51827c9eb991b92014a3f59d31eb237ce03f.tar.gz
gcc-48cb51827c9eb991b92014a3f59d31eb237ce03f.tar.bz2
[PR112875][LRA]: Fix an assert in lra elimination code
PR112875 test ran into a wrong assert (gcc_unreachable) in elimination in a debug insn. The insn seems ok. So I change the assertion. To be more accurate I made it the same as analogous reload pass code. gcc/ChangeLog: PR rtl-optimization/112875 * lra-eliminations.cc (lra_eliminate_regs_1): Change an assert. Add ASM_OPERANDS case. gcc/testsuite/ChangeLog: PR rtl-optimization/112875 * gcc.target/i386/pr112875.c: New test.
-rw-r--r--gcc/lra-eliminations.cc4
-rw-r--r--gcc/testsuite/gcc.target/i386/pr112875.c33
2 files changed, 37 insertions, 0 deletions
diff --git a/gcc/lra-eliminations.cc b/gcc/lra-eliminations.cc
index f3b75e0..cf229b4 100644
--- a/gcc/lra-eliminations.cc
+++ b/gcc/lra-eliminations.cc
@@ -666,6 +666,10 @@ lra_eliminate_regs_1 (rtx_insn *insn, rtx x, machine_mode mem_mode,
return x;
case CLOBBER:
+ case ASM_OPERANDS:
+ gcc_assert (insn && DEBUG_INSN_P (insn));
+ break;
+
case SET:
gcc_unreachable ();
diff --git a/gcc/testsuite/gcc.target/i386/pr112875.c b/gcc/testsuite/gcc.target/i386/pr112875.c
new file mode 100644
index 0000000..b704404
--- /dev/null
+++ b/gcc/testsuite/gcc.target/i386/pr112875.c
@@ -0,0 +1,33 @@
+/* { dg-do compile } */
+/* { dg-options "-Oz -frounding-math -fno-dce -fno-trapping-math -fno-tree-dce -fno-tree-dse -g" } */
+long a, f;
+int b, c, d, g, h, i, j;
+char e;
+void k(long, int l, char t) {
+ char m = b, n = g, o = 0;
+ int p, q, r = h;
+ long s = g;
+ if (f) {
+ q = t + (float)16777217;
+ o = ~0;
+ }
+ if (e) {
+ d = g + a;
+ if (d % (a % l)) {
+ p = d;
+ n = b;
+ }
+ if (l) {
+ i = b;
+ r = a;
+ p = h;
+ }
+ if (s)
+ s = q;
+ c = f;
+ e += t;
+ a = p;
+ }
+ j = r % n;
+ s += g / 0xc000000000000000 + !o;
+}