gcc/testsuite/gcc.dg/autopar/reduc-1.c

   1 /* { dg-do compile } */
   2 /* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-final_cleanup" } */
   3
   4 #include <stdarg.h>
   5 #include <stdlib.h>
   6
   7 #define N 16
   8 #define DIFF 242
   9
  10 /* Reduction of unsigned-int.  */
  11
  12 void main1 (unsigned int x, unsigned int max_result, unsigned int min_result)
  13 {
  14   int i;
  15   unsigned int ub[N] = {1,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  16   unsigned int uc[N] = {1,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
  17   unsigned int udiff = 2;
  18   unsigned int umax = x;
  19   unsigned int umin = x;
  20
  21   /* Summation.  */
  22   for (i = 0; i < N; i++) {
  23     udiff += (ub[i] - uc[i]);
  24   }
  25
  26   /* Maximum.  */
  27   for (i = 0; i < N; i++) {
  28     umax = umax < uc[i] ? uc[i] : umax;
  29   }
  30
  31   /* Minimum.  */
  32   for (i = 0; i < N; i++) {
  33     umin = umin > uc[i] ? uc[i] : umin;
  34   }
  35
  36   /* check results:  */
  37   if (udiff != DIFF)
  38     abort ();
  39   if (umax != max_result)
  40     abort ();
  41   if (umin != min_result)
  42     abort ();
  43 }
  44
  45 int main (void)
  46 {
  47
  48   main1 (100, 100, 1);
  49   main1 (0, 15, 0);
  50   return 0;
  51 }
  52
  53 /* { dg-final { scan-tree-dump-times "Detected reduction" 3 "parloops" } } */
  54 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops" } } */
  55 /* { dg-final { cleanup-tree-dump "parloops" } } */
  56 /* { dg-final { cleanup-tree-dump "final_cleanup" } } */
  57