test/reservoir/QR.c

   1 /* Generated from QR.cloog by CLooG v0.14.0 64 bits in 0.06s. */
   2 /* CLooG asked for 288 KBytes. */
   3 if ((M <= -1) && (N >= 1)) {
   4   S1(i = 0) ;
   5 }
   6 if ((M >= 0) && (N >= 1)) {
   7   S1(i = 0) ;
   8 }
   9 if ((M >= 1) && (N >= 2)) {
  10   for (c4=0;c4<=M-1;c4++) {
  11     S2(i = 0,j = c4) ;
  12   }
  13   S3(i = 0) ;
  14   for (c4=0;c4<=M-1;c4++) {
  15     S4(i = 0,j = c4) ;
  16   }
  17   S10(i = 0) ;
  18   S1(i = 1) ;
  19   S5(i = 0) ;
  20 }
  21 if ((M <= 0) && (N >= 2)) {
  22   S3(i = 0) ;
  23   S10(i = 0) ;
  24   S1(i = 1) ;
  25   S5(i = 0) ;
  26 }
  27 if ((M >= 1) && (N == 1)) {
  28   for (c4=0;c4<=M-1;c4++) {
  29     S2(i = 0,j = c4) ;
  30   }
  31   S3(i = 0) ;
  32   for (c4=0;c4<=M-1;c4++) {
  33     S4(i = 0,j = c4) ;
  34   }
  35   S10(i = 0) ;
  36   S5(i = 0) ;
  37 }
  38 if ((M <= 0) && (N == 1)) {
  39   S3(i = 0) ;
  40   S10(i = 0) ;
  41   S5(i = 0) ;
  42 }
  43 for (c2=2;c2<=min(N-1,M);c2++) {
  44   for (c4=c2-1;c4<=N-1;c4++) {
  45     i = c2-2 ;
  46     S6(j = c4) ;
  47     for (c6=c2-2;c6<=M-1;c6++) {
  48       i = c2-2 ;
  49       S7(j = c4,k = c6) ;
  50     }
  51     i = c2-2 ;
  52     S8(j = c4) ;
  53     for (c6=c2-2;c6<=M-1;c6++) {
  54       i = c2-2 ;
  55       S9(j = c4,k = c6) ;
  56     }
  57   }
  58   for (c4=c2-1;c4<=M-1;c4++) {
  59     i = c2-1 ;
  60     S2(j = c4) ;
  61   }
  62   i = c2-1 ;
  63   S3 ;
  64   for (c4=c2-1;c4<=M-1;c4++) {
  65     i = c2-1 ;
  66     S4(j = c4) ;
  67   }
  68   i = c2-1 ;
  69   S10 ;
  70   S1(i = c2) ;
  71   i = c2-1 ;
  72   S5 ;
  73 }
  74 if ((M >= 1) && (M <= N-2)) {
  75   c2 = M+1 ;
  76   for (c4=M;c4<=N-1;c4++) {
  77     i = M-1 ;
  78     S6(j = c4) ;
  79     c6 = M-1 ;
  80     i = M-1 ;
  81     k = M-1 ;
  82     S7(j = c4) ;
  83     i = M-1 ;
  84     S8(j = c4) ;
  85     c6 = M-1 ;
  86     i = M-1 ;
  87     k = M-1 ;
  88     S9(j = c4) ;
  89   }
  90   S3(i = M) ;
  91   S10(i = M) ;
  92   i = M+1 ;
  93   S1 ;
  94   S5(i = M) ;
  95 }
  96 if ((M >= N) && (N >= 2)) {
  97   c4 = N-1 ;
  98   i = N-2 ;
  99   j = N-1 ;
 100   S6 ;
 101   for (c6=N-2;c6<=M-1;c6++) {
 102     i = N-2 ;
 103     j = N-1 ;
 104     S7(k = c6) ;
 105   }
 106   i = N-2 ;
 107   j = N-1 ;
 108   S8 ;
 109   for (c6=N-2;c6<=M-1;c6++) {
 110     i = N-2 ;
 111     j = N-1 ;
 112     S9(k = c6) ;
 113   }
 114   for (c4=N-1;c4<=M-1;c4++) {
 115     i = N-1 ;
 116     S2(j = c4) ;
 117   }
 118   i = N-1 ;
 119   S3 ;
 120   for (c4=N-1;c4<=M-1;c4++) {
 121     i = N-1 ;
 122     S4(j = c4) ;
 123   }
 124   i = N-1 ;
 125   S10 ;
 126   i = N-1 ;
 127   S5 ;
 128 }
 129 if ((M == N-1) && (N >= 2)) {
 130   c4 = N-1 ;
 131   i = N-2 ;
 132   j = N-1 ;
 133   S6 ;
 134   c6 = N-2 ;
 135   i = N-2 ;
 136   j = N-1 ;
 137   k = N-2 ;
 138   S7 ;
 139   i = N-2 ;
 140   j = N-1 ;
 141   S8 ;
 142   c6 = N-2 ;
 143   i = N-2 ;
 144   j = N-1 ;
 145   k = N-2 ;
 146   S9 ;
 147   i = N-1 ;
 148   S3 ;
 149   i = N-1 ;
 150   S10 ;
 151   i = N-1 ;
 152   S5 ;
 153 }
 154 for (c2=max(M+2,2);c2<=N-1;c2++) {
 155   for (c4=c2-1;c4<=N-1;c4++) {
 156     i = c2-2 ;
 157     S6(j = c4) ;
 158     i = c2-2 ;
 159     S8(j = c4) ;
 160   }
 161   i = c2-1 ;
 162   S3 ;
 163   i = c2-1 ;
 164   S10 ;
 165   S1(i = c2) ;
 166   i = c2-1 ;
 167   S5 ;
 168 }
 169 if ((M <= N-2) && (N >= 2)) {
 170   c4 = N-1 ;
 171   i = N-2 ;
 172   j = N-1 ;
 173   S6 ;
 174   i = N-2 ;
 175   j = N-1 ;
 176   S8 ;
 177   i = N-1 ;
 178   S3 ;
 179   i = N-1 ;
 180   S10 ;
 181   i = N-1 ;
 182   S5 ;
 183 }