blob: dffb858e2b2e662b215ac4a5ecd949c3fbfa89cf (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int ib[N+7];
int ia[N+1];
__attribute__ ((noinline))
int main1 ()
{
int i;
/* Don't peel keeping one load and the store aligned. */
for (i = 0; i <= N; i++)
{
ia[i] = ib[i] + ib[i+5];
}
/* check results: */
for (i = 1; i <= N; i++)
{
if (ia[i] != ib[i] + ib[i+5])
abort ();
}
return 0;
}
int main (void)
{
int i;
check_vect ();
for (i = 0; i <= N+6; i++)
{
asm volatile ("" : "+r" (i));
ib[i] = i;
}
return main1 ();
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_align } } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { xfail vect_no_align } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 0 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
