Loop nest optimization: Difference between revisions

Revision as of 08:59, 6 April 2017

Revision as of 22:08, 17 April 2017

Line 193:

for (k = kk; k < kk + kb; k++)

{

acc00 += A[k][ji + 0][k] * B[ik][j + 0][k];

acc01 += A[k][ji + 10][k] * B[ik][j + 0][k1];

acc10 += A[k][ji + 01][k] * B[ik][j + 1][k0];

acc11 += A[k][ji + 1][k] * B[ik][j + 1][k];

}

C[i + 0][j + 0] = acc00;