[Bug tree-optimization/99777] [11 Regression] ICE in build2, at tree.c:4869 with -O3

["jakub at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=99777

Jakub Jelinek <jakub at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
             Status|UNCONFIRMED                 |NEW
   Target Milestone|---                         |11.0
            Summary|ICE in build2, at           |[11 Regression] ICE in
                   |tree.c:4869 with -O3        |build2, at tree.c:4869 with
                   |                            |-O3
                 CC|                            |jakub at gcc dot gnu.org
           Priority|P3                          |P1
     Ever confirmed|0                           |1
   Last reconfirmed|                            |2021-03-25

--- Comment #1 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
Started with r11-3705-gdae673abd37d400408959497e50fe1f3fbef5533
Testcase without any includes:

template<typename T>
constexpr inline const T&
min(const T& a, const T& b) { if (b < a) return b; return a; }
template<typename T>
constexpr inline const T&
max(const T& a, const T& b) { if (a < b) return b; return a; }
extern int var_142;
extern int a, c;
long h;
unsigned long long e;
signed char d;
extern short arr_323[][7][5][30];

void test(long long b, short f[][17][25][22][20])
{
  for (char i = 0; i < 7; i += 3)
    for (unsigned char l = e; l < 5; l += 2) {
      if (max(0LL, min(7LL, b)))
        for (bool j = 0; j < 1; j = b) {
          for (unsigned k = d; k < 20; k++)
            h = f[0][i][l][b][k];
          for (int m = 0; m < 5; m++)
            arr_323[c][i][l][m] = 0;
        }
      for (int n = 0; n < 4; n += a)
        var_142 = n;
    }
}