test/escedk.c

   1 /* Generated from ./test/escedk.cloog by CLooG v0.14.0 64 bits in 0.01s. */
   2 /* CLooG asked for 168 KBytes. */
   3 if ((n <= m) && (n >= max(m+1,2))) {
   4   S1(i = n) ;
   5 }
   6 if ((n <= min(m,1)) && (n >= 0) && (m <= -1)) {
   7   S1(i = n) ;
   8 }
   9 if ((n == 1) && (m >= 1) && (m >= 0)) {
  10   S2(i = 0) ;
  11   for (j=0;j<=m;j++) {
  12     S3(i = 0) ;
  13   }
  14 }
  15 if ((n <= m) && (n >= 2)) {
  16   for (i=0;i<=min(m,n-1);i++) {
  17     S2 ;
  18   }
  19 }
  20 if ((n == 1) && (m == 0) && (m >= 0)) {
  21   S3(i = 0,j = 0) ;
  22 }
  23 if ((n <= min(min(1,m),m)) && (n >= 0)) {
  24   S1(i = n) ;
  25   S2(i = n) ;
  26   for (j=0;j<=m;j++) {
  27     S3(i = n) ;
  28   }
  29 }
  30 if ((n <= min(m,m)) && (n >= 2)) {
  31   S1(i = n) ;
  32   S2(i = n) ;
  33 }
  34 if ((n == 1) && (m == 0) && (m >= 1)) {
  35   S1(i = 1) ;
  36   S3(i = 1,j = 0) ;
  37 }
  38 if ((n <= min(1,m)) && (n >= 0)) {
  39   for (i=n+1;i<=m;i++) {
  40     S2 ;
  41     for (j=0;j<=m;j++) {
  42       S3 ;
  43     }
  44   }
  45 }
  46 if ((n <= m) && (n >= 2)) {
  47   for (i=n+1;i<=m;i++) {
  48     S2 ;
  49   }
  50 }
  51 if ((n == 1) && (m == 0)) {
  52   for (i=2;i<=m;i++) {
  53     S3(j = 0) ;
  54   }
  55 }