1 /* { dg-require-effective-target vect_int } */
2
3 #include <stdarg.h>
4 #include "tree-vect.h"
5
6 #define N 16
7
8 unsigned int ub[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
9 unsigned int uc[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
10
11 /* Vectorization of reduction using loop-aware SLP (with unrolling). */
12
13 __attribute__ ((noinline))
main1(int n,int res0,int res1,int res2,int res3)14 int main1 (int n, int res0, int res1, int res2, int res3)
15 {
16 int i;
17 unsigned int udiff0 = 5, udiff1 = 10;
18
19 for (i = 0; i < n; i++) {
20 udiff1 += (ub[2*i + 1] - uc[2*i + 1]);
21 udiff0 += (ub[2*i] - uc[2*i]);
22 }
23
24 /* Check results: */
25 if (udiff0 != res0
26 || udiff1 != res1)
27 abort ();
28
29 return 0;
30 }
31
main(void)32 int main (void)
33 {
34 check_vect ();
35
36 main1 (N/2, 117, 138, 84, 102);
37 return 0;
38 }
39
40 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_int_add } } } */
41 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { xfail vect_no_int_add } } } */
42
43