Merge to HEAD at tree-cleanup-merge-20041024 .
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-23.c
blob801c0c88e72df66afb0e72e6a271c838b5a485a4
1 /* { dg-do run { target powerpc*-*-* } } */
2 /* { dg-do run { target i?86-*-* x86_64-*-* } } */
3 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -maltivec" { target powerpc*-*-* } } */
4 /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-stats -msse2" { target i?86-*-* x86_64-*-* } } */
6 #include <stdarg.h>
7 #include "tree-vect.h"
9 #define N 64
11 int
12 main1 ()
14 int i;
15 int ia[N];
16 int ib[N]=
17 {1,1,0,0,1,0,1,0,
18 1,1,0,0,1,0,1,0,
19 1,1,0,0,1,0,1,0,
20 1,1,0,0,1,0,1,0,
21 1,1,0,0,1,0,1,0,
22 1,1,0,0,1,0,1,0,
23 1,1,0,0,1,0,1,0,
24 1,1,0,0,1,0,1,0};
25 int ic[N] =
26 {1,1,0,0,1,0,1,0,
27 1,1,0,0,1,0,1,0,
28 1,1,0,0,1,0,1,0,
29 1,1,0,0,1,0,1,0,
30 1,1,0,0,1,0,1,0,
31 1,1,0,0,1,0,1,0,
32 1,1,0,0,1,0,1,0,
33 1,1,0,0,1,0,1,0};
35 char ca[N];
36 char cb[N] =
37 {1,1,0,0,1,0,1,0,
38 1,1,0,0,1,0,1,0,
39 1,1,0,0,1,0,1,0,
40 1,1,0,0,1,0,1,0,
41 1,1,0,0,1,0,1,0,
42 1,1,0,0,1,0,1,0,
43 1,1,0,0,1,0,1,0,
44 1,1,0,0,1,0,1,0};
46 char cc[N] =
47 {1,1,0,0,1,0,1,0,
48 1,1,0,0,1,0,1,0,
49 1,1,0,0,1,0,1,0,
50 1,1,0,0,1,0,1,0,
51 1,1,0,0,1,0,1,0,
52 1,1,0,0,1,0,1,0,
53 1,1,0,0,1,0,1,0,
54 1,1,0,0,1,0,1,0};
56 short sa[N];
57 short sb[N] =
58 {1,1,0,0,1,0,1,0,
59 1,1,0,0,1,0,1,0,
60 1,1,0,0,1,0,1,0,
61 1,1,0,0,1,0,1,0,
62 1,1,0,0,1,0,1,0,
63 1,1,0,0,1,0,1,0,
64 1,1,0,0,1,0,1,0,
65 1,1,0,0,1,0,1,0};
67 short sc[N] =
68 {1,1,0,0,1,0,1,0,
69 1,1,0,0,1,0,1,0,
70 1,1,0,0,1,0,1,0,
71 1,1,0,0,1,0,1,0,
72 1,1,0,0,1,0,1,0,
73 1,1,0,0,1,0,1,0,
74 1,1,0,0,1,0,1,0,
75 1,1,0,0,1,0,1,0};
77 /* Check ints. */
79 for (i = 0; i < N; i++)
81 ia[i] = ib[i] && ic[i];
84 /* check results: */
85 for (i = 0; i <N; i++)
87 if (ia[i] != ib[i] && ic[i])
88 abort ();
91 /* Check chars. */
93 for (i = 0; i < N; i++)
95 ca[i] = cb[i] && cc[i];
98 /* check results: */
99 for (i = 0; i <N; i++)
101 if (ca[i] != cb[i] && cc[i])
102 abort ();
105 /* Check shorts. */
107 for (i = 0; i < N; i++)
109 sa[i] = sb[i] && sc[i];
112 /* check results: */
113 for (i = 0; i <N; i++)
115 if (sa[i] != sb[i] && sc[i])
116 abort ();
119 return 0;
122 int main (void)
124 check_vect ();
126 return main1 ();
129 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail *-*-* } } } */