Home
last modified time | relevance | path

Searched refs:Complexity (Results 1 – 25 of 37) sorted by relevance

12

/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/test/
H A Dcomplexity_test.cc56 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([](int64_t) { in __anon0ed6190e0202()
105 ->Complexity(benchmark::oN);
109 ->Complexity([](int64_t n) -> double { return n; }); in __anon0ed6190e0302()
113 ->Complexity();
140 ->Complexity(benchmark::oNLogN);
144 ->Complexity([](int64_t n) { return n * log2(n); }); in __anon0ed6190e0402()
148 ->Complexity();
H A Dreporter_output_test.cc207 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/
H A Dcomplexity_test.cc63 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
64 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
65 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int64_t) { in __anondfe756870202()
116 ->Complexity(benchmark::oN);
120 ->Complexity([](int64_t n) -> double { return static_cast<double>(n); }); in __anondfe756870302()
124 ->Complexity();
155 ->Complexity(benchmark::oNLogN);
159 ->Complexity([](int64_t n) { return kLog2E * n * log(static_cast<double>(n)); }); in __anondfe756870402()
163 ->Complexity();
H A Dreporter_output_test.cc244 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
/netbsd-src/external/apache2/llvm/dist/libcxx/benchmarks/
H A Dfilesystem.bench.cpp24 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity();
72 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity();
74 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity();
94 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity();
115 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity();
159 getRandomPaths, /*PathLen*/5)->RangeMultiplier(2)->Range(2, 256)->Complexity();
161 getRandomPaths, /*PathLen*/32)->RangeMultiplier(2)->Range(2, 256)->Complexity();
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/
H A DCloneDetection.cpp425 size_t Complexity = 1; in calculateStmtComplexity() local
442 Complexity = 0; in calculateStmtComplexity()
449 Complexity += calculateStmtComplexity( in calculateStmtComplexity()
451 if (Complexity >= Limit) in calculateStmtComplexity()
456 Complexity += calculateStmtComplexity( in calculateStmtComplexity()
458 if (Complexity >= Limit) in calculateStmtComplexity()
462 return Complexity; in calculateStmtComplexity()
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h283 if (Complexity == 0) in computeComplexity()
284 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
285 return Complexity; in computeComplexity()
382 if (Complexity == 0) in computeComplexity()
383 Complexity = in computeComplexity()
385 return Complexity; in computeComplexity()
H A DSymExpr.h51 mutable unsigned Complexity = 0; variable
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DCodeGenTarget.h210 unsigned Complexity; variable
221 unsigned getComplexity() const { return Complexity; } in getComplexity()
H A DCodeGenTarget.cpp575 Complexity = NumOperands * 3; in ComplexPattern()
577 Complexity = RawComplexity; in ComplexPattern()
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/
H A Dbenchmark_register.cc411 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() function in benchmark::internal::Benchmark
416 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() function in benchmark::internal::Benchmark
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/src/
H A Dbenchmark_register.cc390 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() function in benchmark::internal::Benchmark
395 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() function in benchmark::internal::Benchmark
/netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/container/
H A Drbtree.d970 Complexity: $(BIGOH 1).
1047 Complexity: $(BIGOH log(n))
1286 Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1330 Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1385 Complexity: $(BIGOH m log(n)) (where m is the number of elements to remove)
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/container/
H A Drbtree.d981 Complexity: $(BIGOH 1).
1058 Complexity: $(BIGOH log(n))
1426 Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1470 Complexity: $(BIGOH m * log(n)) (where m is the number of elements in
1525 Complexity: $(BIGOH m log(n)) (where m is the number of elements to remove)
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/include/benchmark/
H A Dbenchmark.h856 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
860 Benchmark* Complexity(BigOFunc* complexity);
/netbsd-src/external/apache2/llvm/dist/libcxx/docs/
H A DCxx1zStatusPaperStatus.csv102 "`P0523R1 <https://wg21.link/P0523R1>`__","LWG","Wording for CH 10: Complexity of parallel algorith…
105 "`P0574R1 <https://wg21.link/P0574R1>`__","LWG","Algorithm Complexity Constraints and Parallel Over…
H A DCxx1yStatusIssuesStatus.csv130 "`2304 <https://wg21.link/lwg2304>`__","Complexity of count in unordered associative containers","I…
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/include/benchmark/
H A Dbenchmark.h895 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
899 Benchmark* Complexity(BigOFunc* complexity);
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp2641 unsigned Complexity = 0; in selectLEAAddr() local
2643 Complexity = 1; in selectLEAAddr()
2645 Complexity = 4; in selectLEAAddr()
2648 Complexity++; in selectLEAAddr()
2653 Complexity++; in selectLEAAddr()
2663 Complexity = 4; in selectLEAAddr()
2665 Complexity += 2; in selectLEAAddr()
2696 Complexity++; in selectLEAAddr()
2700 Complexity++; in selectLEAAddr()
2703 if (Complexity <= 2) in selectLEAAddr()
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/
H A DREADME.md242 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity(benchmark::oN);
250 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity();
258 ->Range(1<<10, 1<<18)->Complexity([](int64_t n)->double{return n; });
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/
H A DREADME.md230 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity(benchmark::oN);
238 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity();
246 ->Range(1<<10, 1<<18)->Complexity([](int n)->double{return n; });
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonPatterns.td1783 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1800 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1824 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
1849 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.
1856 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.
1872 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
H A Dslist655 // them immediately after __pos. __x must not be *this. Complexity:
/netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dslist655 // them immediately after __pos. __x must not be *this. Complexity:
/netbsd-src/external/historical/nawk/dist/testdir/
H A Dfunstack.ok973 I. Pohl A Sorting Problem and Its Complexity . . 462--464
2302 William C. Rounds The Intrinsically Exponential Complexity
2307 Jeffrey D. Ullman On the Complexity of LR(k) Testing . . . 707--716
2786 Michael O. Rabin Complexity of Computations . . . . . . . 625--633
2953 Michael O. Rabin Corrigendum: ``Complexity of

12