blob: ccfb888fc5a9422c509539be4169408133e9b5d9 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 128
int a[N], b[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
/* Vectorization of reduction. Loop-aware SLP is not possible, because of
different arrays. */
__attribute__ ((noinline))
int main1 (int n, int res0, int res1)
{
int i;
int sum0 = 0, sum1 = 0;
for (i = 0; i < n; i++) {
sum1 += a[2*i];
sum0 += b[2*i];
}
/* Check results: */
if (sum0 != res0
|| sum1 != res1)
abort ();
return 0;
}
int main (void)
{
int i;
check_vect ();
for (i = 0; i < N; i++)
a[i] = b[i] = i;
main1 (N/2, 4032, 4032);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { xfail { vect_no_int_add || { ! vect_unpack } } } } } */
/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect" } } */
/* { dg-final { scan-tree-dump-times "different interleaving chains in one node" 1 "vect" { target { ! vect_no_int_add } } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
