blob: c18204ea3548b16f60479854206c2cc71798fd58 (
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
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
|
#include "tree-vect.h"
extern void abort (void);
int a[4096];
__attribute__((noinline, noclone)) void
f1 (int x)
{
int i, j;
for (i = 1; i <= x; i++)
{
j = a[i] >> 8;
j = 1 + (j / 2);
a[i] = j << 8;
}
}
__attribute__((noinline, noclone)) void
f2 (int x)
{
int i, j;
for (i = 1; i <= x; i++)
{
j = a[i] >> 8;
j = 1 + (j / 16);
a[i] = j << 8;
}
}
__attribute__((noinline, noclone)) void
f3 (int x)
{
int i, j;
for (i = 1; i <= x; i++)
{
j = a[i] >> 8;
j = 1 + (j % 2);
a[i] = j << 8;
}
}
__attribute__((noinline, noclone)) void
f4 (int x)
{
int i, j;
for (i = 1; i <= x; i++)
{
j = a[i] >> 8;
j = 1 + (j % 16);
a[i] = j << 8;
}
}
int
main ()
{
int i;
check_vect ();
for (i = 0; i < 4096; i++)
{
asm ("");
a[i] = (i - 2048) << 8;
}
f1 (4095);
if (a[0] != (-2048 << 8))
abort ();
for (i = 1; i < 4096; i++)
if (a[i] != ((1 + ((i - 2048) / 2)) << 8))
abort ();
else
a[i] = (i - 2048) << 8;
f2 (4095);
if (a[0] != (-2048 << 8))
abort ();
for (i = 1; i < 4096; i++)
if (a[i] != ((1 + ((i - 2048) / 16)) << 8))
abort ();
else
a[i] = (i - 2048) << 8;
f3 (4095);
if (a[0] != (-2048 << 8))
abort ();
for (i = 1; i < 4096; i++)
if (a[i] != ((1 + ((i - 2048) % 2)) << 8))
abort ();
else
a[i] = (i - 2048) << 8;
f4 (4095);
if (a[0] != (-2048 << 8))
abort ();
for (i = 1; i < 4096; i++)
if (a[i] != ((1 + ((i - 2048) % 16)) << 8))
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 4 "vect" { target vect_condition } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
