When d->perm[i] == d->perm[i-1] + 1 and d->perm[i] == nelt, it's not
continuous. It should fail if there's more than 2 continuous areas.
gcc/ChangeLog:
PR target/105587
* config/i386/i386-expand.cc
(expand_vec_perm_pslldq_psrldq_por): Fail when (d->perm[i] ==
d->perm[i-1] + 1) && d->perm[i] == nelt && start != -1.
gcc/testsuite/ChangeLog:
* gcc.target/i386/pr105587.c: New test.
start1 = d->perm[0];
for (i = 1; i < nelt; i++)
{
- if (d->perm[i] != d->perm[i-1] + 1)
+ if (d->perm[i] != d->perm[i-1] + 1
+ || d->perm[i] == nelt)
{
if (start2 == -1)
{
else
return false;
}
- else if (d->perm[i] >= nelt
- && start2 == -1)
- {
- start2 = d->perm[i];
- end1 = d->perm[i-1];
- }
}
clear_op0 = end1 != nelt - 1;
--- /dev/null
+#/* { dg-do compile } */
+/* { dg-options "-O3 -msse2 -mno-ssse3" } */
+
+extern short arr_108[][4][2][24][12], arr_110[][4][2][24][12];
+void test() {
+ for (unsigned a = 0; a < 2; a += 2)
+ for (unsigned b = 4; b < 22; b++)
+ for (int c = 1; c < 11; c++)
+ arr_110[0][0][a][b][c] = (unsigned char)arr_108[0][0][a][b][c];
+}
+