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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define M00 100
#define M10 216
#define M20 23
#define M30 237
#define M01 1322
#define M11 13
#define M21 27271
#define M31 2280
#define M02 74
#define M12 191
#define M22 500
#define M32 111
#define M03 134
#define M13 117
#define M23 11
#define M33 771
#define N 16
void foo (unsigned int *__restrict__ pInput, unsigned int *__restrict__ pOutput)
{
unsigned int i, a, b, c, d;
for (i = 0; i < N / 4; i++)
{
a = *pInput++;
b = *pInput++;
c = *pInput++;
d = *pInput++;
*pOutput++ = M00 * a + M01 * b + M02 * c + M03 * d;
*pOutput++ = M10 * a + M11 * b + M12 * c + M13 * d;
*pOutput++ = M20 * a + M21 * b + M22 * c + M23 * d;
*pOutput++ = M30 * a + M31 * b + M32 * c + M33 * d;
}
}
int main (int argc, const char* argv[])
{
unsigned int input[N], output[N], i;
unsigned int check_results[N] = {1872, 746, 28304, 4815, 8392, 2894, 139524, 18411, 14912, 5042, 250744, 32007, 21432, 7190, 361964, 45603};
check_vect ();
for (i = 0; i < N; i++)
{
input[i] = i%256;
output[i] = 0;
__asm__ volatile ("");
}
foo (input, output);
for (i = 0; i < N; i++)
{
if (output[i] != check_results[i])
abort ();
__asm__ volatile ("");
}
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_perm } } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target vect_perm } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
