Home
last modified time | relevance | path

Searched refs:l1_depth (Results 1 – 6 of 6) sorted by relevance

/external/gemmlowp/internal/
Dblock_params.h37 int l1_depth; member
53 &l1_rows, &l1_cols, &l1_depth); in Init()
106 int l1_depth = 0; in FindL1BlockSizes() local
123 l1_depth = in FindL1BlockSizes()
129 std::max(1, l1_bytes_to_use / (l1_depth + 4 * l1_cols)); in FindL1BlockSizes()
138 *out_l1_depth = l1_depth; in FindL1BlockSizes()
151 int l1_depth; member
168 side_block_params->l1_depth = block_params.l1_depth; in GetSideBlockParams()
Dcompute.h54 for (int d = 0; d < depth; d += block_params_.l1_depth) { in Compute()
55 int ds = std::min(block_params_.l1_depth, depth - d); in Compute()
Dpack.h65 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth); in seek_run()
318 d += packed_side_block_->params().l1_depth) { in PackL2()
319 int ds = std::min<int>(packed_side_block_->params().l1_depth, in PackL2()
Dsingle_thread_gemm.h109 block_params.l2_cols, block_params.l1_rows, block_params.l1_depth, in SingleThreadGemm()
/external/gemmlowp/doc/
Dpacking.txt119 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth);
123 We see that the formula involves the l1_depth parameter, which is how the
Dpacking.md116 std::min<int>(params_.l1_depth, params_.l2_depth - start_depth);
121 We see that the formula involves the l1_depth parameter, which is how the packed