1 /* { dg-require-effective-target vect_int } */
76 for (i = 0; i < N; i++)
78 ia[i] = ib[i] ^ ic[i];
82 for (i = 0; i <N; i++)
84 if (ia[i] != ib[i] ^ ic[i])
90 for (i = 0; i < N; i++)
92 ca[i] = cb[i] ^ cc[i];
96 for (i = 0; i <N; i++)
98 if (ca[i] != cb[i] ^ cc[i])
104 for (i = 0; i < N; i++)
106 sa[i] = sb[i] ^ sc[i];
110 for (i = 0; i <N; i++)
112 if (sa[i] != sb[i] ^ sc[i])
126 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail vect_no_bitwise } } } */
127 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
128 /* { dg-final { cleanup-tree-dump "vect" } } */