blob: 5aab8053ed657ec6410240485d432f78e12f82b1 (
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
51
52
53
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
#define RES 21640
int ib[N+10];
int ia[N+10];
int ic[N+10];
__attribute__ ((noinline))
int main1 ()
{
int i, suma = 0, sumb = 0, sumc = 0;
/* ib and ic have same misalignment, we peel to align them. */
for (i = 0; i <= N; i++)
{
suma += ia[i];
sumb += ib[i+5];
sumc += ic[i+1];
}
/* check results: */
if (suma + sumb + sumc != RES)
abort ();
return 0;
}
int main (void)
{
int i;
check_vect ();
for (i = 0; i < N+10; i++)
{
asm volatile ("" : "+r" (i));
ib[i] = i;
ic[i] = i+2;
ia[i] = i/2;
}
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 } || {vect_sizes_32B_16B } } } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" { xfail { { vect_no_align } || {vect_sizes_32B_16B } } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
