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
|
/* { dg-require-effective-target vect_condition } */
#include <stdlib.h>
#include "tree-vect.h"
#define M 32
#define N 16
int x_in[M];
int x_out_a[M], x_out_b[M];
int c[N] = {3,2,1,10,1,42,3,4,50,9,32,8,11,10,1,2};
int a[N+1] = {0,16,32,48,64,128,256,512,0,16,32,48,64,128,256,512,1024};
int b[N+1] = {17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1};
int check_result_a[M] = {1024,1024,1024,256,256,256,256,256,256,256,256,128,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48,48};
int check_result_b[M] = {17,17,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1};
__attribute__ ((noinline)) void
foo ()
{
int j, i, x;
int curr_a, flag, next_a, curr_b, next_b;
for (j = 0; j < M; j++)
{
x = x_in[j];
curr_a = a[0];
curr_b = b[0];
for (i = 0; i < N; i++)
{
flag = x > c[i];
next_a = a[i+1];
next_b = b[i+1];
curr_a = flag ? curr_a : next_a;
curr_b = flag ? next_b : curr_b;
}
x_out_a[j] = curr_a;
x_out_b[j] = curr_b;
}
}
int main (void)
{
int i,j;
check_vect ();
for (j = 0; j < M; j++)
x_in[j] = j;
foo ();
for (j = 0; j < M; j++)
if (x_out_a[j] != check_result_a[j]
|| x_out_b[j] != check_result_b[j])
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" { xfail vect_no_align } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
