blob: 8aca27ca1742719126a3ff5cca6a5e2752a45628 (
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
54
|
/* { dg-require-effective-target vect_int } */
/* { dg-add-options quad_vectors } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int ib[N+7];
__attribute__ ((noinline))
int main1 ()
{
int i;
int ia[N+1];
/* All the accesses are misaligned. With cost model disabled, we count the
the number of aligned accesses for each peeling option, and in this case
we align the two loads if possible (i.e., if misaligned stores are
supported). */
for (i = 1; i <= N; i++)
{
ia[i] = ib[i+2] + ib[i+6];
}
/* check results: */
for (i = 1; i <= N; i++)
{
if (ia[i] != ib[i+2] + ib[i+6])
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" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 1 "vect" { target { { vect_element_align } && { vect_aligned_arrays } } } } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 1 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
