Home
last modified time | relevance | path

Searched refs:max_iters (Results 1 – 11 of 11) sorted by relevance

/external/ltp/testcases/kernel/mem/tunable/
Dmax_map_count.c145 long max_iters; in max_map_count_test() local
167 max_iters = memfree / sysconf(_SC_PAGESIZE) * 1024 - 64; in max_map_count_test()
168 if (max_iters > MAX_MAP_COUNT) in max_map_count_test()
169 max_iters = MAX_MAP_COUNT; in max_map_count_test()
172 while (max_maps <= max_iters) { in max_map_count_test()
/external/skqp/src/core/
DSkCubicMap.cpp49 static int max_iters; variable
84 if (iters > max_iters) { in solve_nice_cubic_halley()
85 max_iters = iters; in solve_nice_cubic_halley()
86 SkDebugf("max_iters %d\n", max_iters); in solve_nice_cubic_halley()
129 if (iters > max_iters) { in solve_nice_cubic_householder()
130 max_iters = iters; in solve_nice_cubic_householder()
131 SkDebugf("max_iters %d\n", max_iters); in solve_nice_cubic_householder()
/external/skia/src/core/
DSkCubicMap.cpp49 static int max_iters; variable
84 if (iters > max_iters) { in solve_nice_cubic_halley()
85 max_iters = iters; in solve_nice_cubic_halley()
86 SkDebugf("max_iters %d\n", max_iters); in solve_nice_cubic_halley()
129 if (iters > max_iters) { in solve_nice_cubic_householder()
130 max_iters = iters; in solve_nice_cubic_householder()
131 SkDebugf("max_iters %d\n", max_iters); in solve_nice_cubic_householder()
/external/tensorflow/tensorflow/compiler/aot/
Dbenchmark_test.cc32 options.max_iters = 1; in TEST()
37 options.max_iters = 5; in TEST()
Dbenchmark.cc114 const int64 max_us = (options.max_micros <= 0 && options.max_iters <= 0) in Benchmark()
129 (options.max_iters > 0 && iters >= options.max_iters)) { in Benchmark()
Dbenchmark.h43 int64 max_iters = 0; // Maximum iterations to run, ignored if <= 0. member
/external/google-benchmark/src/
Dbenchmark.cc124 State::State(size_t max_iters, const std::vector<int64_t>& ranges, int thread_i, in State() argument
129 max_iterations(max_iters), in State()
/external/libcxx/utils/google-benchmark/src/
Dbenchmark.cc124 State::State(size_t max_iters, const std::vector<int64_t>& ranges, int thread_i, in State() argument
129 max_iterations(max_iters), in State()
/external/brotli/c/enc/
Dbackward_references_hq.c416 const size_t max_iters = MaxZopfliCandidates(params); in UpdateNodes() local
434 for (k = 0; k < max_iters && k < StartPosQueueSize(queue); ++k) { in UpdateNodes()
/external/libcxx/utils/google-benchmark/include/benchmark/
Dbenchmark.h670 State(size_t max_iters, const std::vector<int64_t>& ranges, int thread_i,
/external/google-benchmark/include/benchmark/
Dbenchmark.h670 State(size_t max_iters, const std::vector<int64_t>& ranges, int thread_i,