blob: 678152ba4168d32f84a1d1b01ba6c43b210ec8b9 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
/* { dg-require-effective-target vect_int } */
#include "tree-vect.h"
int a[256], b[256];
void __attribute__((noinline))
foo (void)
{
int i;
for (i = 0; i < 32; ++i)
{
b[i*8+0] = a[i*8+0];
b[i*8+1] = a[i*8+0];
b[i*8+2] = a[i*8+3];
b[i*8+3] = a[i*8+3];
b[i*8+4] = a[i*8+4];
b[i*8+5] = a[i*8+6];
b[i*8+6] = a[i*8+4];
b[i*8+7] = a[i*8+6];
}
}
int main ()
{
int i;
check_vect ();
for (i = 0; i < 256; ++i)
{
a[i] = i;
__asm__ volatile ("");
}
foo ();
for (i = 0; i < 32; ++i)
if (b[i*8+0] != i*8+0
|| b[i*8+1] != i*8+0
|| b[i*8+2] != i*8+3
|| b[i*8+3] != i*8+3
|| b[i*8+4] != i*8+4
|| b[i*8+5] != i*8+6
|| b[i*8+6] != i*8+4
|| b[i*8+7] != i*8+6)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_perm } } } */
/* SLP fails for variable-length SVE because the load size is greater
than the minimum vector size. */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_perm xfail { aarch64_sve && vect_variable_length } } } } */
|
