libcpp, c, middle-end: Optimize initializers using #embed in C
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-26.c
blob84ae7af2a6d2154eae8e61b0e99e3a74931affae
1 /* Disabling epilogues until we find a better way to deal with scans. */
2 /* { dg-additional-options "--param vect-epilogues-nomask=0 -fdump-tree-optimized-details-blocks" } */
3 /* { dg-require-effective-target vect_int } */
5 #include <stdarg.h>
6 #include "tree-vect.h"
8 #define N 128
10 /* unaligned store. */
12 __attribute__ ((noinline))
13 int main1 ()
15 int i;
16 int ia[N+1];
18 for (i = 1; i <= N; i++)
20 ia[i] = 5;
23 /* check results: */
24 #pragma GCC novector
25 for (i = 1; i <= N; i++)
27 if (ia[i] != 5)
28 abort ();
31 return 0;
34 int main (void)
36 check_vect ();
38 return main1 ();
41 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
42 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { xfail { ! vect_align_stack_vars } } } } */
43 /* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { vect_element_align_preferred || { ! vect_align_stack_vars } } } } } */
44 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */