1*5971e316Smrg for (int c0 = 0; c0 < n - 1; c0 += 32) 2*5971e316Smrg for (int c1 = c0; c1 < n; c1 += 32) 3*5971e316Smrg for (int c2 = c0; c2 < n; c2 += 32) { 4*5971e316Smrg if (c1 >= c0 + 32) { 5*5971e316Smrg for (int c3 = c0; c3 <= min(c0 + 31, c2 + 30); c3 += 1) 6*5971e316Smrg for (int c4 = c1; c4 <= min(n - 1, c1 + 31); c4 += 1) 7*5971e316Smrg for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) 8*5971e316Smrg S_6(c3, c4, c5); 9*5971e316Smrg } else { 10*5971e316Smrg for (int c3 = c0; c3 <= min(min(n - 2, c0 + 31), c2 + 30); c3 += 1) { 11*5971e316Smrg for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) 12*5971e316Smrg S_2(c3, c5); 13*5971e316Smrg for (int c4 = c3 + 1; c4 <= min(n - 1, c0 + 31); c4 += 1) 14*5971e316Smrg for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) 15*5971e316Smrg S_6(c3, c4, c5); 16*5971e316Smrg } 17*5971e316Smrg } 18*5971e316Smrg } 19