| /external/google-benchmark/test/ |
| complexity_test.cc | 56 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
57 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
58 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int) {
65 // FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
105 ->Complexity(benchmark::oN);
109 ->Complexity([](int n) -> double { return n; });
113 ->Complexity();
140 ->Complexity(benchmark::oNLogN);
144 ->Complexity([](int n) { return n * log2(n); });
148 ->Complexity();
[all...] |
| reporter_output_test.cc | 197 // ----------------------- Testing Complexity Output ----------------------- //
205 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
|
| /external/libcxx/utils/google-benchmark/test/ |
| complexity_test.cc | 56 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
57 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
58 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int) {
65 // FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
105 ->Complexity(benchmark::oN);
109 ->Complexity([](int n) -> double { return n; });
113 ->Complexity();
140 ->Complexity(benchmark::oNLogN);
144 ->Complexity([](int n) { return n * log2(n); });
148 ->Complexity();
[all...] |
| reporter_output_test.cc | 197 // ----------------------- Testing Complexity Output ----------------------- //
205 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/test/ |
| complexity_test.cc | 56 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
57 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
58 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int) {
65 // FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
105 ->Complexity(benchmark::oN);
109 ->Complexity([](int n) -> double { return n; });
113 ->Complexity();
140 ->Complexity(benchmark::oNLogN);
144 ->Complexity([](int n) { return n * std::log2(n); });
148 ->Complexity();
[all...] |
| reporter_output_test.cc | 164 // ----------------------- Testing Complexity Output ----------------------- //
172 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
|
| /external/libopus/silk/ |
| control_codec.c | 55 opus_int Complexity /* I */
115 /* Set encoding complexity */
117 ret += silk_setup_complexity( &psEnc->sCmn, encControl->complexity );
309 opus_int Complexity /* I */
314 /* Set encoding complexity */
315 silk_assert( Complexity >= 0 && Complexity <= 10 );
316 if( Complexity < 1 ) {
326 } else if( Complexity < 2 ) {
336 } else if( Complexity < 3 )
[all...] |
| structs.h | 166 opus_int Complexity; /* Complexity setting */
171 opus_int pitchEstimationComplexity; /* Complexity level for pitch estimator */
|
| enc_API.c | 123 encStatus->complexity = state_Fxx[ 0 ].sCmn.Complexity;
215 tmp_complexity = encControl->complexity;
216 encControl->complexity = 0;
551 encControl->complexity = tmp_complexity;
|
| /external/swiftshader/third_party/LLVM/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 554 unsigned Complexity = 0;
557 Complexity = 1;
561 Complexity = 4;
564 Complexity += 1;
569 Complexity += 1;
571 if (Complexity > 2) {
|
| /external/google-benchmark/src/ |
| benchmark_register.cc | 39 #include "complexity.h"
159 instance.complexity = family->complexity_;
405 Benchmark* Benchmark::Complexity(BigO complexity) {
406 complexity_ = complexity;
410 Benchmark* Benchmark::Complexity(BigOFunc* complexity) {
411 complexity_lambda_ = complexity;
|
| /external/libcxx/utils/google-benchmark/src/ |
| benchmark_register.cc | 39 #include "complexity.h"
159 instance.complexity = family->complexity_;
405 Benchmark* Benchmark::Complexity(BigO complexity) {
406 complexity_ = complexity;
410 Benchmark* Benchmark::Complexity(BigOFunc* complexity) {
411 complexity_lambda_ = complexity;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/include/benchmark/ |
| benchmark_api.h | 298 // complexity for the benchmark. In case oAuto is selected, complexity will be
303 // computational complexity for the benchmark.
404 // If this routine is called with complexity_n > 0 and complexity report is
617 // Set the asymptotic computational complexity for the benchmark. If called
618 // the asymptotic computational complexity will be shown on the output.
619 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
621 // Set the asymptotic computational complexity for the benchmark. If called
622 // the asymptotic computational complexity will be shown on the output
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/src/ |
| benchmark_register.cc | 38 #include "complexity.h"
150 instance.complexity = family->complexity_;
391 Benchmark* Benchmark::Complexity(BigO complexity) {
392 complexity_ = complexity;
396 Benchmark* Benchmark::Complexity(BigOFunc* complexity) {
397 complexity_lambda_ = complexity;
|
| /external/swiftshader/third_party/LLVM/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| /external/google-benchmark/include/benchmark/ |
| benchmark.h | 376 // complexity for the benchmark. In case oAuto is selected, complexity will be
381 // computational complexity for the benchmark.
513 // If this routine is called with complexity_n > 0 and complexity report is
773 // Set the asymptotic computational complexity for the benchmark. If called
774 // the asymptotic computational complexity will be shown on the output.
775 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
777 // Set the asymptotic computational complexity for the benchmark. If called
778 // the asymptotic computational complexity will be shown on the output
[all...] |
| /external/libcxx/utils/google-benchmark/include/benchmark/ |
| benchmark.h | 376 // complexity for the benchmark. In case oAuto is selected, complexity will be
381 // computational complexity for the benchmark.
513 // If this routine is called with complexity_n > 0 and complexity report is
773 // Set the asymptotic computational complexity for the benchmark. If called
774 // the asymptotic computational complexity will be shown on the output.
775 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
777 // Set the asymptotic computational complexity for the benchmark. If called
778 // the asymptotic computational complexity will be shown on the output
[all...] |
| /prebuilts/go/darwin-x86/src/sort/ |
| sort.go | 507 Complexity of Stable Sorting
510 Complexity of block swapping rotation
526 SymMerg complexity for same size input M = N:
|
| /prebuilts/go/linux-x86/src/sort/ |
| sort.go | 507 Complexity of Stable Sorting
510 Complexity of block swapping rotation
526 SymMerg complexity for same size input M = N:
|
| /prebuilts/go/darwin-x86/test/ |
| map.go | 8 // Complexity (linearity) test is in maplinear.go.
|
| /prebuilts/go/linux-x86/test/ |
| map.go | 8 // Complexity (linearity) test is in maplinear.go.
|
| /external/annotation-tools/asmx/test/lib/ |
| cobertura-1.7.jar | |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| ScalarEvolution.cpp | 426 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less
427 /// than the complexity of the RHS. This comparator is used to canonicalize
534 // Addrec complexity grows with operand count.
600 /// complexity, and group objects of the same complexity together by value.
602 /// consecutive and that complexity is monotonically increasing.
621 // Do the rough sort by complexity.
624 // Now that we are sorted by complexity, group elements of the same
625 // complexity. Note that this is, at worst, N^2, but the vector is likely to
630 unsigned Complexity = S->getSCEVType()
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | 451 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less
452 /// than the complexity of the RHS. This comparator is used to canonicalize
559 // Addrec complexity grows with operand count.
625 /// Given a list of SCEV objects, order them by their complexity, and group
626 /// objects of the same complexity together by value. When this routine is
628 /// complexity is monotonically increasing.
647 // Do the rough sort by complexity.
650 // Now that we are sorted by complexity, group elements of the same
651 // complexity. Note that this is, at worst, N^2, but the vector is likely to
656 unsigned Complexity = S->getSCEVType()
[all...] |
