re PR tree-optimization/33291 (a+=2; a+=2 not simplified to a+=4; with -O3 ...
[gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / gen-vect-11a.c
1 /* { dg-do run { target vect_cmdline_needed } } */
2 /* { dg-options "-O2 -ftree-vectorize -ftree-vectorizer-verbose=3 -fdump-tree-vect-stats" } */
3
4 #include <stdlib.h>
5
6 #define N 16
7
8 #if __INT_MAX__ == 32767
9 typedef char half_word;
10 #elif __LONG_MAX__ == 2147483647
11 typedef short half_word;
12 #else
13 typedef int half_word;
14 #endif
15
16 int main ()
17 {
18 int i;
19 half_word ia[N];
20 half_word ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
21 half_word ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
22
23 for (i = 0; i < N; i++)
24 {
25 ia[i] = ib[i] & ic[i];
26 }
27
28 /* check results: */
29 for (i = 0; i < N; i++)
30 {
31 if (ia[i] != ib[i] & ic[i])
32 abort ();
33 }
34
35 return 0;
36 }
37
38
39 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
40 /* { dg-final { cleanup-tree-dump "vect" } } */