Merge -r 127928:132243 from trunk
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-strided-a-u8-i8-gap7.c
blob8dfb21be915c4dae81317c1155bedffb05fb9ea4
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 16
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;
19 __attribute__ ((noinline)) int
20 main1 ()
22 int i;
23 s arr[N];
24 s *ptr = arr;
25 s res[N];
26 unsigned char u, t, s, x, y, z, w;
28 for (i = 0; i < N; i++)
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;
38 if (arr[i].a == 178)
39 abort();
42 for (i = 0; i < N; i++)
44 u = ptr->b - ptr->a;
45 t = ptr->d - ptr->c;
46 res[i].c = u + t;
47 x = ptr->b + ptr->d;
48 res[i].a = ptr->a + x;
49 res[i].d = u + t;
50 s = ptr->h - ptr->a;
51 res[i].b = s + t;
52 res[i].f = ptr->f + ptr->h;
53 res[i].e = ptr->b + ptr->e;
54 res[i].h = ptr->d;
55 res[i].g = u + t;
56 ptr++;
59 /* check results: */
60 for (i = 0; i < N; i++)
62 if (res[i].c != arr[i].b - arr[i].a + arr[i].d - arr[i].c
63 || res[i].a != arr[i].a + arr[i].b + arr[i].d
64 || res[i].d != arr[i].b - arr[i].a + arr[i].d - arr[i].c
65 || res[i].b != arr[i].h - arr[i].a + arr[i].d - arr[i].c
66 || res[i].f != arr[i].f + arr[i].h
67 || res[i].e != arr[i].b + arr[i].e
68 || res[i].h != arr[i].d
69 || res[i].g != arr[i].b - arr[i].a + arr[i].d - arr[i].c)
70 abort();
75 int main (void)
77 check_vect ();
79 main1 ();
81 return 0;
84 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_interleave && vect_extract_even_odd } } } } */
85 /* { dg-final { cleanup-tree-dump "vect" } } */