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
|
/* { dg-require-effective-target vect_int } */
/* { dg-additional-options "-fno-tree-scev-cprop" } */
#include "tree-vect.h"
/* Statement in SLP vectorization used outside the loop.
NOTE: SCEV disabled to ensure the live operation is not removed before
vectorization. */
#define LIVELOOP(RET) \
__attribute__ ((noinline)) int \
liveloop##RET (int n, int *x, int *y) \
{ \
int n0, n1, n2, n3, j; \
for (j = 0; j < n; ++j) \
{ \
n0 = x[(j*4)]; \
n1 = x[(j*4)+1]; \
n2 = x[(j*4)+2]; \
n3 = x[(j*4)+3]; \
y[(j*4)] = n0 + 1; \
y[(j*4)+1] = n1 + 2; \
y[(j*4)+2] = n2 + 3; \
y[(j*4)+3] = n3 + 4; \
} \
return n##RET; \
}
LIVELOOP (0)
LIVELOOP (1)
LIVELOOP (2)
LIVELOOP (3)
typedef int (*FP)(int n, int *x, int *y);
const FP llf[]= {&liveloop0, &liveloop1, &liveloop2, &liveloop3};
#define MAX 113
int
main (void)
{
int a[MAX*4];
int b[MAX*4];
int i;
check_vect ();
for (i=0; i<MAX*4; i++)
{
__asm__ volatile ("");
a[i] = i;
}
for (i=0; i<4; i++)
{
__asm__ volatile ("");
int ret = llf[i] (MAX, a, b);
if (ret != (MAX * 4) - 4 + i)
abort ();
for (i=0; i<MAX*4; i++)
{
__asm__ volatile ("");
if (b[i] != i + (i%4) + 1)
abort ();
}
}
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 4 "vect" } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 4 "vect" } } */
/* { dg-final { scan-tree-dump-times "vec_stmt_relevant_p: stmt live but not relevant" 4 "vect" } } */
|
