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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 8
unsigned short in[N*8] = {0,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};
unsigned int in2[N*8] = {0,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};
int
main1 ()
{
int i;
unsigned short out[N*8];
unsigned int out2[N*8];
for (i = 0; i < N; i++)
{
out[i*8] = in[i*8] + 5;
out[i*8 + 1] = in[i*8 + 1] + 6;
out[i*8 + 2] = in[i*8 + 2] + 7;
out[i*8 + 3] = in[i*8 + 3] + 8;
out[i*8 + 4] = in[i*8 + 4] + 9;
out[i*8 + 5] = in[i*8 + 5] + 10;
out[i*8 + 6] = in[i*8 + 6] + 11;
out[i*8 + 7] = in[i*8 + 7] + 12;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (out[i*8] != in[i*8] + 5
|| out[i*8 + 1] != in[i*8 + 1] + 6
|| out[i*8 + 2] != in[i*8 + 2] + 7
|| out[i*8 + 3] != in[i*8 + 3] + 8
|| out[i*8 + 4] != in[i*8 + 4] + 9
|| out[i*8 + 5] != in[i*8 + 5] + 10
|| out[i*8 + 6] != in[i*8 + 6] + 11
|| out[i*8 + 7] != in[i*8 + 7] + 12)
abort ();
}
for (i = 0; i < N*2; i++)
{
out[i*4] = in[i*4] + 2;
out[i*4 + 1] = in[i*4 + 1] + 2;
out[i*4 + 2] = in[i*4 + 2] + 1;
out[i*4 + 3] = in[i*4 + 3] + 3;
}
/* check results: */
for (i = 0; i < N*2; i++)
{
if (out[i*4] != in[i*4] + 2
|| out[i*4 + 1] != in[i*4 + 1] + 2
|| out[i*4 + 2] != in[i*4 + 2] + 1
|| out[i*4 + 3] != in[i*4 + 3] + 3)
abort ();
}
for (i = 0; i < N/2; i++)
{
out2[i*16] = in2[i*16] * 2;
out2[i*16 + 1] = in2[i*16 + 1] * 3;
out2[i*16 + 2] = in2[i*16 + 2] * 4;
out2[i*16 + 3] = in2[i*16 + 3] * 3;
out2[i*16 + 4] = in2[i*16 + 4] * 2;
out2[i*16 + 5] = in2[i*16 + 5] * 3;
out2[i*16 + 6] = in2[i*16 + 6] * 2;
out2[i*16 + 7] = in2[i*16 + 7] * 4;
out2[i*16 + 8] = in2[i*16 + 8] * 2;
out2[i*16 + 9] = in2[i*16 + 9] * 5;
out2[i*16 + 10] = in2[i*16 + 10] * 2;
out2[i*16 + 11] = in2[i*16 + 11] * 3;
out2[i*16 + 12] = in2[i*16 + 12] * 4;
out2[i*16 + 13] = in2[i*16 + 13] * 4;
out2[i*16 + 14] = in2[i*16 + 14] * 3;
out2[i*16 + 15] = in2[i*16 + 15] * 2;
}
/* check results: */
for (i = 0; i < N/2; i++)
{
if (out2[i*16] != in2[i*16] * 2
|| out2[i*16 + 1] != in2[i*16 + 1] * 3
|| out2[i*16 + 2] != in2[i*16 + 2] * 4
|| out2[i*16 + 3] != in2[i*16 + 3] * 3
|| out2[i*16 + 4] != in2[i*16 + 4] * 2
|| out2[i*16 + 5] != in2[i*16 + 5] * 3
|| out2[i*16 + 6] != in2[i*16 + 6] * 2
|| out2[i*16 + 7] != in2[i*16 + 7] * 4
|| out2[i*16 + 8] != in2[i*16 + 8] * 2
|| out2[i*16 + 9] != in2[i*16 + 9] * 5
|| out2[i*16 + 10] != in2[i*16 + 10] * 2
|| out2[i*16 + 11] != in2[i*16 + 11] * 3
|| out2[i*16 + 12] != in2[i*16 + 12] * 4
|| out2[i*16 + 13] != in2[i*16 + 13] * 4
|| out2[i*16 + 14] != in2[i*16 + 14] * 3
|| out2[i*16 + 15] != in2[i*16 + 15] * 2)
abort ();
}
return 0;
}
int main (void)
{
check_vect ();
main1 ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" {target vect_int_mult} } } */
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" {target { ! { vect_int_mult } } } } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 3 "vect" {target vect_int_mult } } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "vect" {target { ! { vect_int_mult } } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
