111
|
1 /* { dg-require-effective-target vect_int } */
|
|
2
|
|
3 #include <stdarg.h>
|
|
4 #include "tree-vect.h"
|
|
5
|
|
6 #define N 16
|
|
7
|
|
8 typedef struct {
|
|
9 unsigned char a;
|
|
10 unsigned char b;
|
|
11 unsigned char c;
|
|
12 unsigned char d;
|
|
13 unsigned char e;
|
|
14 unsigned char f;
|
|
15 unsigned char g;
|
|
16 unsigned char h;
|
|
17 } s;
|
|
18
|
|
19 __attribute__ ((noinline)) int
|
|
20 main1 ()
|
|
21 {
|
|
22 int i;
|
|
23 s arr[N];
|
|
24 s *ptr = arr;
|
|
25 s res[N];
|
|
26 unsigned char u, t, s, x, z, w;
|
|
27
|
|
28 for (i = 0; i < N; i++)
|
|
29 {
|
|
30 arr[i].a = i;
|
|
31 arr[i].b = i * 2;
|
|
32 arr[i].c = 17;
|
|
33 arr[i].d = i+34;
|
|
34 arr[i].e = i * 3 + 5;
|
|
35 arr[i].f = i * 5;
|
|
36 arr[i].g = i - 3;
|
|
37 arr[i].h = 67;
|
131
|
38 asm volatile ("" ::: "memory");
|
111
|
39 }
|
|
40
|
|
41 for (i = 0; i < N; i++)
|
|
42 {
|
|
43 u = ptr->b - ptr->a;
|
|
44 t = ptr->d - ptr->c;
|
|
45 res[i].c = u + t;
|
|
46 x = ptr->b + ptr->d;
|
|
47 res[i].a = ptr->a + x;
|
|
48 res[i].d = u + t;
|
|
49 s = ptr->h - ptr->a;
|
|
50 res[i].b = s + t;
|
|
51 res[i].f = ptr->f + ptr->h;
|
|
52 res[i].e = ptr->b + ptr->e;
|
|
53 res[i].h = ptr->d;
|
|
54 res[i].g = u + t;
|
|
55 ptr++;
|
|
56 }
|
|
57
|
|
58 /* check results: */
|
|
59 for (i = 0; i < N; i++)
|
|
60 {
|
|
61 if (res[i].c != arr[i].b - arr[i].a + arr[i].d - arr[i].c
|
|
62 || res[i].a != arr[i].a + arr[i].b + arr[i].d
|
|
63 || res[i].d != arr[i].b - arr[i].a + arr[i].d - arr[i].c
|
|
64 || res[i].b != arr[i].h - arr[i].a + arr[i].d - arr[i].c
|
|
65 || res[i].f != arr[i].f + arr[i].h
|
|
66 || res[i].e != arr[i].b + arr[i].e
|
|
67 || res[i].h != arr[i].d
|
|
68 || res[i].g != arr[i].b - arr[i].a + arr[i].d - arr[i].c)
|
|
69 abort();
|
|
70 }
|
|
71 }
|
|
72
|
|
73
|
|
74 int main (void)
|
|
75 {
|
|
76 check_vect ();
|
|
77
|
|
78 main1 ();
|
|
79
|
|
80 return 0;
|
|
81 }
|
|
82
|
|
83 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided8 } } } */
|
|
84
|