blob: 80afd692d354209ee1adb916ed6b0fe781fc27fd (
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/* { dg-do compile } */
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 256
extern int a[N];
/* The alignment of 'pa' is unknown.
Yet we do know that both the read access and write access have
the same alignment. Peeling to align one of the accesses will
align the other.
Not vectorized yet due to problems in dataref analysis that
are fixed in autovect-branch but not yet in mainline. */
int
main1 (int * pa)
{
int i;
for (i = 0; i < N; i++)
{
pa[i] = pa[i] + 1;
}
return 0;
}
/* The alignment of 'a' is unknown.
Yet we do know that both the read access and write access have
the same alignment. Peeling to align one of the accesses will
align the other. */
int
main2 ()
{
int i;
for (i = 0; i < N; i++)
{
a[i] = a[i] + 1;
}
return 0;
}
int
main3 ()
{
int i;
for (i = 0; i < N; i++)
{
a[i] = a[i+20];
}
return 0;
}
/* Currently only the loops in main2 and main3 get vectorized. After the merge
of the datarefs-analysis cleanups from autovect-branch to mainline, the loop
in main1 will also be vectorized. */
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" } } */
/* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" } } */
/* { dg-final { scan-tree-dump-times "accesses have the same alignment." 2 "vect" } } */
/* { dg-final { scan-tree-dump-times "Alignment of access forced using peeling" 2 "vect" } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
