Home
last modified time | relevance | path

Searched refs:CeilQuotient (Results 1 – 4 of 4) sorted by relevance

/external/gemmlowp/internal/
Dblock_params.h78 std::max(1, CeilQuotient(cols, max_cache_friendly_l2_cols)); in FindL2BlockSizes()
80 RoundUp<KernelFormat::kCols>(CeilQuotient(cols, min_l2_cols_blocks)); in FindL2BlockSizes()
93 1, CeilQuotient(per_thread_rows, max_cache_friendly_l2_rows)); in FindL2BlockSizes()
95 CeilQuotient(per_thread_rows, min_l2_rows_blocks)); in FindL2BlockSizes()
125 std::max(1, CeilQuotient(depth, max_cache_friendly_l1_depth)); in FindL1BlockSizes()
127 RoundUp<kRegisterSize>(CeilQuotient(depth, min_l1_depth_blocks)); in FindL1BlockSizes()
134 std::max(1, CeilQuotient(rows, max_cache_friendly_l1_rows)); in FindL1BlockSizes()
136 RoundUp<KernelFormat::kRows>(CeilQuotient(rows, min_l1_rows_blocks)); in FindL1BlockSizes()
Dcommon.h280 Integer CeilQuotient(Integer a, Integer b) { in CeilQuotient() function
Dmulti_thread_gemm.h573 int thread_count = std::min(max_count, CeilQuotient(rows, MinRowsPerThread)); in HowManyThreads()
/external/gemmlowp/test/
Dtest_math_helpers.cc56 Check(CeilQuotient(x, y) * y >= x); in test_ceil_quotient()
57 Check(CeilQuotient(x, y) * y < x + y); in test_ceil_quotient()