Lines Matching defs:NR
836 // KR, NR: block sizes for "right". We run blocking iterations that operate on
845 int* KR, int* NR, int* KL, int* JB,
1311 bool transpose_left, int num_threads, int* KR, int* NR, int* KL, int* JB,
1319 *NR = right.dimension(1);
1320 if (*KR * *NR > mem) {
1326 *NR = std::max(1, *NR / 256) * 256;
1327 if (*KR * *NR > mem) {
1328 *NR = mem / *KR;
1330 *NR = std::max(1, *NR / 256) * 256;
1502 // The matrix "right" is divided into a grid with block size KR * NR. Lets
1515 // that if R_kj has dimensions (KR, NR), we create NR / N slices, and the
1516 // buffer has dimensions (KR * NR / N, N) (assuming N divides NR).
1529 int KR, NR, KL, JB, IB;
1530 ComputeBlockSizes(left, right, transpose_left, num_threads, &KR, &NR, &KL,
1542 // Note buffer needs enough space to hold at most a KR * NR matrix since that
1545 std::min(KR, right_dim0) * (std::min(NR, right_dim1) + N - 1) / N;
1551 // Number of blocks based on block sizes of KR * NR.
1553 const int num_n_blocks = (right_dim1 + NR - 1) / NR;
1558 std::min(NR, static_cast<int>(right_dim1 - NR * nb));
1563 right, kb * KR, right_num_rows, nb * NR, right_num_cols, thread_pool,
1585 N * j_inner + nb * NR, kb == 0, transpose_output, output));