blob: 7004e9e4e4403e8fb11d7adf29acb3ac032073c8 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 256
volatile int y = 0;
__attribute__ ((noinline))
void main1 (signed char x, signed char max_result, signed char min_result)
{
int i;
signed char b[N];
signed char c[N];
signed char check_diff = 2;
signed char diff = 2;
signed char max = x;
signed char min = x;
check_diff = 2;
for (i = 0; i < N; i++) {
b[i] = i;
c[i] = i;
if (i%16 == 0)
{
c[i] = i + 1;
check_diff += 1;
}
if (c[i] > max_result)
max_result = c[i];
if (c[i] < min_result)
min_result = c[i];
/* Avoid vectorization. */
if (y)
abort ();
}
for (i = 0; i < N; i++) {
diff += (signed char) (c[i] - b[i]);
}
for (i = 0; i < N; i++) {
max = max < c[i] ? c[i] : max;
}
for (i = 0; i < N; i++) {
min = min > c[i] ? c[i] : min;
}
/* check results: */
if (diff != check_diff)
abort ();
if (max != max_result)
abort ();
if (min != min_result)
abort ();
}
int main (void)
{
check_vect ();
main1 (100, 100, 1);
main1 (0, 15, 0);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail *-*-* } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
