blob: 4e742b2018069c672ff5c050fc6730899aa3704f (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
typedef struct {
unsigned int a;
unsigned int b;
} ii;
__attribute__ ((noinline)) int
main1 ()
{
unsigned short arr[N];
unsigned short *ptr = arr;
ii iarr[N];
ii *iptr = iarr;
unsigned short res[N];
ii ires[N];
int i;
for (i = 0; i < N; i++)
{
arr[i] = i;
iarr[i].a = i;
iarr[i].b = i * 3;
__asm__ volatile ("");
}
for (i = 0; i < N; i++)
{
ires[i].a = iptr->b - iptr->a;
ires[i].b = iptr->b + iptr->a;
res[i] = *ptr;
iptr++;
ptr++;
}
/* check results: */
for (i = 0; i < N; i++)
{
if (res[i] != arr[i]
|| ires[i].a != iarr[i].b - iarr[i].a
|| ires[i].b != iarr[i].b + iarr[i].a)
abort ();
}
return 0;
}
int main (void)
{
int i;
check_vect ();
main1 ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided2 } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
