Mercurial > hg > CbC > CbC_gcc
comparison gcc/testsuite/gcc.dg/vect/vect-strided-mult.c @ 111:04ced10e8804
gcc 7
author | kono |
---|---|
date | Fri, 27 Oct 2017 22:46:09 +0900 |
parents | |
children | 84e7813d76e9 |
comparison
equal
deleted
inserted
replaced
68:561a7518be6b | 111:04ced10e8804 |
---|---|
1 /* { dg-require-effective-target vect_int } */ | |
2 | |
3 #include <stdarg.h> | |
4 #include "tree-vect.h" | |
5 | |
6 #define N 128 | |
7 | |
8 typedef struct { | |
9 unsigned short a; | |
10 unsigned short b; | |
11 } s; | |
12 | |
13 typedef struct { | |
14 unsigned int a; | |
15 unsigned int b; | |
16 } ii; | |
17 | |
18 volatile int y = 0; | |
19 | |
20 __attribute__ ((noinline)) int | |
21 main1 (s *arr, ii *iarr) | |
22 { | |
23 s *ptr = arr; | |
24 ii *iptr = iarr; | |
25 s res[N]; | |
26 ii ires[N]; | |
27 int i; | |
28 | |
29 for (i = 0; i < N; i++) | |
30 { | |
31 ires[i].a = iptr->b - iptr->a; | |
32 ires[i].b = iptr->b + iptr->a; | |
33 res[i].b = ptr->b - ptr->a; | |
34 res[i].a = ptr->b + ptr->a; | |
35 iptr++; | |
36 ptr++; | |
37 } | |
38 | |
39 /* check results: */ | |
40 for (i = 0; i < N; i++) | |
41 { | |
42 if (res[i].b != arr[i].b - arr[i].a | |
43 || ires[i].a != iarr[i].b - iarr[i].a | |
44 || res[i].a != arr[i].b + arr[i].a | |
45 || ires[i].b != iarr[i].b + iarr[i].a | |
46 ) | |
47 abort (); | |
48 } | |
49 | |
50 return 0; | |
51 } | |
52 | |
53 int main (void) | |
54 { | |
55 int i; | |
56 s arr[N]; | |
57 ii iarr[N]; | |
58 | |
59 check_vect (); | |
60 | |
61 for (i = 0; i < N; i++) | |
62 { | |
63 arr[i].a = i; | |
64 arr[i].b = i * 2; | |
65 iarr[i].a = i; | |
66 iarr[i].b = i * 3; | |
67 if (y) /* Avoid vectorization. */ | |
68 abort (); | |
69 } | |
70 | |
71 main1 (arr, iarr); | |
72 | |
73 return 0; | |
74 } | |
75 | |
76 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided2 } } } */ | |
77 |