1*5971e316Smrg for (int c0 = 1; c0 < n; c0 += 64) 2*5971e316Smrg for (int c1 = c0 - 1; c1 <= n; c1 += 64) 3*5971e316Smrg for (int c2 = c0; c2 <= n; c2 += 1) { 4*5971e316Smrg for (int c3 = c0; c3 <= min(min(c0 + 63, c1 + 62), c2 - 1); c3 += 1) 5*5971e316Smrg for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) 6*5971e316Smrg s1(c3, c4, c2); 7*5971e316Smrg if (c0 + 63 >= c2) 8*5971e316Smrg for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) 9*5971e316Smrg s0(c2, c4); 10*5971e316Smrg } 11