2018-01-16 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / testsuite / gcc.dg / vect / vect-reduc-1.c
blobaafa9a2c96d2de838ab1822e34c4a77a550df1e4
1 /* { dg-require-effective-target vect_int } */
3 #include <stdarg.h>
4 #include "tree-vect.h"
6 #define N 16
7 #define DIFF 242
9 unsigned int ub[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
10 unsigned int uc[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
12 /* Test vectorization of reduction of unsigned-int. */
14 __attribute__ ((noinline))
15 void main1 (unsigned int x, unsigned int max_result, unsigned int min_result)
17 int i;
18 unsigned int udiff = 2;
19 unsigned int umax = x;
20 unsigned int umin = x;
22 /* Summation. */
23 for (i = 0; i < N; i++) {
24 udiff += (ub[i] - uc[i]);
27 /* Maximum. */
28 for (i = 0; i < N; i++) {
29 umax = umax < uc[i] ? uc[i] : umax;
32 /* Minimum. */
33 for (i = 0; i < N; i++) {
34 umin = umin > uc[i] ? uc[i] : umin;
37 /* check results: */
38 if (udiff != DIFF)
39 abort ();
40 if (umax != max_result)
41 abort ();
42 if (umin != min_result)
43 abort ();
46 int main (void)
48 check_vect ();
50 main1 (100, 100, 1);
51 main1 (0, 15, 0);
52 return 0;
55 /* { dg-final { scan-tree-dump-times "vectorized 3 loops" 1 "vect" { xfail { vect_no_int_add || vect_no_int_min_max } } } } */