]> git.ipfire.org Git - thirdparty/gcc.git/blob - gcc/testsuite/gcc.dg/vect/vect-75-big-array.c
Fix profile update after prologue peeling in vectorizer
[thirdparty/gcc.git] / gcc / testsuite / gcc.dg / vect / vect-75-big-array.c
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 } */
4
5 #include <stdarg.h>
6 #include "tree-vect.h"
7
8 #define N 120
9 #define OFF 8
10
11 /* Check handling of accesses for which the "initial condition" -
12 the expression that represents the first location accessed - is
13 more involved than just an ssa_name. */
14
15 int ib[N+OFF] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__))) = {0, 1, 3, 5, 7, 11, 13, 17};
16
17 __attribute__ ((noinline))
18 int main1 (int *ib)
19 {
20 int i;
21 int ia[N];
22
23 for (i = OFF; i < N+OFF; i++)
24 {
25 ib[i] = ib[i%OFF]*(i/OFF);
26 asm volatile ("" ::: "memory");
27 }
28 for (i = 0; i < N; i++)
29 {
30 ia[i] = ib[i+OFF];
31 }
32
33
34 /* check results: */
35 for (i = 0; i < N; i++)
36 {
37 if (ia[i] != ib[i+OFF])
38 abort ();
39 }
40
41 return 0;
42 }
43
44 int main (void)
45 {
46 check_vect ();
47
48 main1 (ib);
49 return 0;
50 }
51
52
53 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
54 /* { dg-final { scan-tree-dump-times "Alignment of access forced using versioning" 1 "vect" { target { vect_no_align && { ! vect_hw_misalign } } } } } */
55 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 2 "vect" { target { ! vect_align_stack_vars } xfail { ! vect_unaligned_possible } } } } */
56 /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target vect_align_stack_vars xfail { ! vect_unaligned_possible } } } } */
57 /* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */