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
71
72
73
74
75
76
77
78
79
80
81
82
83
|
/* { dg-require-effective-target vect_int } */
/* { dg-additional-options "-fdump-tree-optimized-details-blocks" } */
#include <stdlib.h>
#include <stdarg.h>
#include "tree-vect.h"
#define N 9
struct extraction
{
int a[N];
int b[N];
};
static int a[N] = {1,2,3,4,5,6,7,8,9};
static int b[N] = {2,3,4,5,6,7,8,9,0};
__attribute__ ((noinline))
int main1 () {
int i;
struct extraction *p;
p = (struct extraction *) malloc (sizeof (struct extraction));
/* Vectorizable: alias analysis determines that p can't point to a and/or b. */
for (i = 0; i < N; i++)
{
p->a[i] = a[i];
p->b[i] = b[i];
}
/* check results: */
#pragma GCC novector
for (i = 0; i < N; i++)
{
if (p->a[i] != a[i] || p->b[i] != b[i])
abort();
}
return 0;
}
__attribute__ ((noinline))
int main2 () {
int i;
int c[N] = {1,2,3,4,5,6,7,8,9};
int d[N] = {2,3,4,5,6,7,8,9,0};
struct extraction *p;
p = (struct extraction *) malloc (sizeof (struct extraction));
/* Vectorizable: c and d are local arrays. */
for (i = 0; i < N; i++)
{
p->a[i] = c[i];
p->b[i] = d[i];
}
/* check results: */
#pragma GCC novector
for (i = 0; i < N; i++)
{
if (p->a[i] != c[i] || p->b[i] != d[i])
abort();
}
return 0;
}
int main (void)
{
check_vect ();
main1 ();
main2 ();
return 0;
}
/* Requires versioning. */
/* { dg-final { scan-tree-dump-times "vectorized 2 loops" 0 "vect" } } */
/* { dg-final { scan-tree-dump-not "Invalid sum" "optimized" } } */
|
