blob: ccbc366f22be0d772876079be3ad54a4286882b6 (
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include <stdio.h>
#include "tree-vect.h"
#define N 160
typedef struct {
unsigned char a;
unsigned char b;
unsigned char c;
unsigned char d;
unsigned char e;
unsigned char f;
unsigned char g;
unsigned char h;
} s;
__attribute__ ((noinline)) int
main1 (s *arr, int n)
{
int i;
s *ptr = arr;
s res[N];
unsigned char x;
for (i = 0; i < N; i++)
{
res[i].a = 0;
res[i].b = 0;
res[i].c = 0;
res[i].d = 0;
res[i].e = 0;
res[i].f = 0;
res[i].g = 0;
res[i].h = 0;
__asm__ volatile ("");
}
/* Check peeling for gaps for unknown loop bound. */
for (i = 0; i < n; i++)
{
res[i].c = ptr->b + ptr->c;
x = ptr->c + ptr->f;
res[i].a = x + ptr->b;
res[i].d = ptr->b + ptr->c;
res[i].b = ptr->c;
res[i].f = ptr->f + ptr->e;
res[i].e = ptr->b + ptr->e;
res[i].h = ptr->c;
res[i].g = ptr->b + ptr->c;
ptr++;
}
/* check results: */
for (i = 0; i < n; i++)
{
if (res[i].c != arr[i].b + arr[i].c
|| res[i].a != arr[i].c + arr[i].f + arr[i].b
|| res[i].d != arr[i].b + arr[i].c
|| res[i].b != arr[i].c
|| res[i].f != arr[i].f + arr[i].e
|| res[i].e != arr[i].b + arr[i].e
|| res[i].h != arr[i].c
|| res[i].g != arr[i].b + arr[i].c)
abort ();
}
/* Check also that we don't do more iterations than needed. */
for (i = n; i < N; i++)
{
if (res[i].c == arr[i].b + arr[i].c
|| res[i].a == arr[i].c + arr[i].f + arr[i].b
|| res[i].d == arr[i].b + arr[i].c
|| res[i].b == arr[i].c
|| res[i].f == arr[i].f + arr[i].e
|| res[i].e == arr[i].b + arr[i].e
|| res[i].h == arr[i].c
|| res[i].g == arr[i].b + arr[i].c)
abort ();
}
return 0;
}
int main (void)
{
int i;
s arr[N];
check_vect ();
for (i = 0; i < N; i++)
{
arr[i].a = 5;
arr[i].b = 6;
arr[i].c = 17;
arr[i].d = 3;
arr[i].e = 16;
arr[i].f = 16;
arr[i].g = 3;
arr[i].h = 56;
if (arr[i].a == 178)
abort();
}
main1 (arr, N-2);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
