blob: 5f18baab4e3522c97039ddb67fa2a269f62d7b1e (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
typedef struct {
unsigned short a;
unsigned short b;
} s;
s buffer1[N], buffer2[N];
__attribute__ ((noinline)) int
main1 (s * __restrict__ pIn, s* __restrict__ pOut)
{
unsigned short i, x, y, d;
s *p, *q;
p = pIn;
q = pOut;
for (i = 0; i < N/2; i++)
{
x = pIn->a + 5;
y = pIn->a + 2;
pOut->a = x;
pOut->b = pIn->b;
pOut++;
pOut->a = y;
pOut->b = pIn->b;
pOut++;
pIn++;
}
/* check results: */
for (i = 0; i < N/2; i++)
{
if (q->a != p->a + 5
|| q->b != p->b)
abort ();
q++;
if (q->a != p->a + 2
|| q->b != p->b)
abort ();
q++;
p++;
}
return 0;
}
int main (void)
{
short i;
for (i = 0; i < N; i++)
{
buffer1[i].a = i;
buffer1[i].b = i + 8;
buffer2[i].a = i * 3;
buffer2[i].b = i * 2;
if (buffer1[i].a == 500)
abort();
}
check_vect ();
main1 (buffer1, buffer2);
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" } } */
|
