[Bug rtl-optimization/126501] New: [17 Regression] wrong code with RTL late combine

"ktkachov at gcc dot gnu.org via Gcc-bugs" <[email protected]>
Newsgroups gmane.comp.gcc.bugs
Message-ID <[email protected]/bugzilla/>
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=126501

            Bug ID: 126501
           Summary: [17 Regression] wrong code with RTL late combine
           Product: gcc
           Version: 17.0
            Status: UNCONFIRMED
          Keywords: wrong-code
          Severity: normal
          Priority: P3
         Component: rtl-optimization
          Assignee: unassigned at gcc dot gnu.org
          Reporter: ktkachov at gcc dot gnu.org
  Target Milestone: ---
            Target: aarch64

The following testcase aborts at -O2 on aarch64:
struct F { unsigned int f0 : 2, f1 : 2, f2 : 2; };
struct G { unsigned int g : 2; };
struct S { struct F f; struct G g[6]; };

__attribute__((noipa)) int
f (struct S *p, int x)
{
  p->g[1].g = (1 >= p->f.f1);
  p->g[2].g = x ? p->f.f0 : p->f.f2;
  p->g[0].g = p->g[1].g + p->g[2].g;
  return p->g[0].g;
}

__attribute__((noipa)) int
ref (struct S *p, int x)
{
  volatile int f0 = p->f.f0, f1 = p->f.f1, f2 = p->f.f2;
  volatile int a = (1 >= f1);
  volatile int b = (x ? f0 : f2);

  p->g[1].g = a;
  p->g[2].g = b;
  p->g[0].g = (int) p->g[1].g + (int) p->g[2].g;
  return p->g[0].g;
}

__attribute__((noipa)) int opaque (int v) { return v; }

int
main (void)
{
  struct S s;
  int i, j, k, xi;

  for (i = 0; i < 4; i++)
    for (j = 0; j < 4; j++)
      for (k = 0; k < 4; k++)
        for (xi = 0; xi < 2; xi++)
          {
            int x = opaque (xi);
            int got, want;

            __builtin_memset (&s, 0, sizeof s);
            s.f.f0 = i; s.f.f1 = j; s.f.f2 = k;
            got = f (&s, x);

            __builtin_memset (&s, 0, sizeof s);
            s.f.f0 = i; s.f.f1 = j; s.f.f2 = k;
            want = ref (&s, x);

            if (got != want)
              __builtin_abort ();
          }
  return 0;
}
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.