https://gcc.gnu.org/bugzilla/show_bug.cgi?id=125390
Robin Dapp <rdapp at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Last reconfirmed| |2026-05-20
Status|UNCONFIRMED |NEW
Ever confirmed|0 |1
CC| |rdapp at gcc dot gnu.org
--- Comment #1 from Robin Dapp <rdapp at gcc dot gnu.org> ---
Confirmed. Infinite loop during expand.
That's the optimized tree:
int main ()
{
vector(4) int D.2944;
vector(4) int vect_array.9[2];
int f;
vector(4) int _44(D);
int _48;
int _50;
<bb 2> [local count: 214748370]:
vect_array.9 = .MASK_LEN_LOAD_LANES (&c, 32B, { -1, -1, -1, -1 }, _44(D), 4,
0);
_48 = BIT_FIELD_REF <vect_array.9[0], 32, 96>;
_50 = BIT_FIELD_REF <vect_array.9[1], 32, 96>;
vect_array.9 ={v} {CLOBBER};
.MASK_LEN_STRIDED_STORE (&b, 8, { 0, 0, 0, 0 }, { -1, -1, -1, -1 }, 4, 0);
f_13 = _48 ^ _50;
a = f_13;
return 0;
}