blob: 0a2149a4525bed2f08f5516f1ceadff10b502473 (
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
56
57
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int
main1 ()
{
int i, j;
unsigned short out[N*8], a[N][N];
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
a[i][j] = 8;
}
out[i*4] = 8;
out[i*4 + 1] = 18;
out[i*4 + 2] = 28;
out[i*4 + 3] = 38;
}
/* check results: */
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (a[i][j] != 8)
abort ();
}
if (out[i*4] != 8
|| out[i*4 + 1] != 18
|| out[i*4 + 2] != 28
|| out[i*4 + 3] != 38)
abort();
}
return 0;
}
int main (void)
{
check_vect ();
main1 ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
