brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.2 KiB · 7ba854f Raw
46 lines · c
1if (ni >= t0 + 1 && nj >= t1 + 1)2  for (int c2 = 0; c2 <= min(15, nk - 1); c2 += 1) {3    S_1(t0, t1, c2);4    if (nj >= t1 + 17) {5      S_1(t0, t1 + 16, c2);6      if (nj >= t1 + 33) {7        S_1(t0, t1 + 32, c2);8        if (nj >= t1 + 49)9          S_1(t0, t1 + 48, c2);10      }11    }12    if (ni >= t0 + 17) {13      S_1(t0 + 16, t1, c2);14      if (nj >= t1 + 17) {15        S_1(t0 + 16, t1 + 16, c2);16        if (nj >= t1 + 33) {17          S_1(t0 + 16, t1 + 32, c2);18          if (nj >= t1 + 49)19            S_1(t0 + 16, t1 + 48, c2);20        }21      }22      if (ni >= t0 + 33) {23        S_1(t0 + 32, t1, c2);24        if (nj >= t1 + 17) {25          S_1(t0 + 32, t1 + 16, c2);26          if (nj >= t1 + 33) {27            S_1(t0 + 32, t1 + 32, c2);28            if (nj >= t1 + 49)29              S_1(t0 + 32, t1 + 48, c2);30          }31        }32        if (ni >= t0 + 49) {33          S_1(t0 + 48, t1, c2);34          if (nj >= t1 + 17) {35            S_1(t0 + 48, t1 + 16, c2);36            if (nj >= t1 + 33) {37              S_1(t0 + 48, t1 + 32, c2);38              if (nj >= t1 + 49)39                S_1(t0 + 48, t1 + 48, c2);40            }41          }42        }43      }44    }45  }46