IVOPT performance tuning patch. The main problem is a variant of maximal weight
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / slp-reduc-1.c
blob95faba8e9d43345a1e22ea8cc5c65ca3f41dee01
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include <stdio.h>
5 #include "tree-vect.h"
7 #define N 16
9 unsigned int ub[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
10 unsigned int uc[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
12 /* Vectorization of reduction using loop-aware SLP. */
14 __attribute__ ((noinline))
15 int main1 (int n, int res0, int res1, int res2, int res3)
17 int i;
18 unsigned int udiff0 = 5, udiff1 = 10, udiff2 = 20, udiff3 = 30;
20 for (i = 0; i < n; i++) {
21 udiff3 += (ub[4*i + 3] - uc[4*i + 3]);
22 udiff2 += (ub[4*i + 2] - uc[4*i + 2]);
23 udiff1 += (ub[4*i + 1] - uc[4*i + 1]);
24 udiff0 += (ub[4*i] - uc[4*i]);
27 /* Check results: */
28 if (udiff0 != res0
29 || udiff1 != res1
30 || udiff2 != res2
31 || udiff3 != res3)
32 abort ();
34 return 0;
37 int main (void)
39 check_vect ();
41 main1 (N/4, 53, 66, 84, 102);
42 main1 (N/4 - 1, 29, 40, 56, 72);
43 return 0;
46 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail vect_no_int_add } } } */
47 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { xfail vect_no_int_add } } } */
48 /* { dg-final { cleanup-tree-dump "vect" } } */