| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/test/ |
| complexity_test.cc | 63 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) {
73 // FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
116 ->Complexity(benchmark::oN);
120 ->Complexity([](int64_t n) -> double { return static_cast<double>(n); });
124 ->Complexity();
155 ->Complexity(benchmark::oNLogN);
159 ->Complexity([](int64_t n) { return kLog2E * n * log(static_cast<double>(n)); });
163 ->Complexity();
[all...] |
| reporter_output_test.cc | 236 // ----------------------- Testing Complexity Output ----------------------- //
244 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
|
| /src/external/apache2/llvm/dist/llvm/utils/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([](int64_t) {
65 // FIXME: Tolerate both '(1)' and 'lgN' as output when the complexity is auto
105 ->Complexity(benchmark::oN);
109 ->Complexity([](int64_t n) -> double { return n; });
113 ->Complexity();
140 ->Complexity(benchmark::oNLogN);
144 ->Complexity([](int64_t n) { return n * log2(n); });
148 ->Complexity();
[all...] |
| reporter_output_test.cc | 199 // ----------------------- Testing Complexity Output ----------------------- //
207 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
|
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| filesystem.bench.cpp | 24 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();
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| CodeGenTarget.h | 210 unsigned Complexity;
221 unsigned getComplexity() const { return Complexity; }
|
| CodeGenTarget.cpp | 571 // possible pattern match we'll need to dynamically calculate the complexity
573 int64_t RawComplexity = R->getValueAsInt("Complexity");
575 Complexity = NumOperands * 3;
577 Complexity = RawComplexity;
|
| CodeGenDAGPatterns.cpp | 1408 // complexity of this node.
1439 /// Compute the complexity metric for the input pattern. This roughly
4256 int Complexity = TheDef->getValueAsInt("AddedComplexity");
4273 InstImpResults, Complexity,
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| CloneDetection.cpp | 425 size_t Complexity = 1;
436 // statement, we reduce the initial complexity of this statement to zero.
438 // macro expansion will only increase the total complexity by one.
439 // Note: This is not the final complexity of this statement as we still
440 // add the complexity of the child statements to the complexity value.
442 Complexity = 0;
445 // Iterate over the Stmts in the StmtSequence and add their complexity values
446 // to the current complexity value.
449 Complexity += calculateStmtComplexity
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SymbolManager.h | 283 if (Complexity == 0)
284 Complexity = 1 + Operand->computeComplexity();
285 return Complexity;
382 if (Complexity == 0)
383 Complexity =
385 return Complexity;
|
| SymExpr.h | 51 mutable unsigned Complexity = 0;
|
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/ |
| benchmark_register.cc | 41 #include "complexity.h"
167 instance.complexity = family->complexity_;
411 Benchmark* Benchmark::Complexity(BigO complexity) {
412 complexity_ = complexity;
416 Benchmark* Benchmark::Complexity(BigOFunc* complexity) {
417 complexity_lambda_ = complexity;
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/ |
| benchmark_register.cc | 41 #include "complexity.h"
167 instance.complexity = family->complexity_;
390 Benchmark* Benchmark::Complexity(BigO complexity) {
391 complexity_ = complexity;
395 Benchmark* Benchmark::Complexity(BigOFunc* complexity) {
396 complexity_lambda_ = complexity;
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| rbtree.d | 698 * Complexity: amortized $(BIGOH 1)
708 * Complexity: amortized $(BIGOH 1)
728 * All inserts, removes, searches, and any function in general has complexity
981 Complexity: $(BIGOH 1).
992 * Complexity: $(BIGOH n)
1015 * Complexity: $(BIGOH 1)
1037 * Complexity: $(BIGOH 1)
1047 * Complexity: $(BIGOH log(n))
1058 Complexity: $(BIGOH log(n))
1075 * Complexity: $(BIGOH n
[all...] |
| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/include/benchmark/ |
| benchmark.h | 412 // complexity for the benchmark. In case oAuto is selected, complexity will be
417 // computational complexity for the benchmark.
568 // If this routine is called with complexity_n > 0 and complexity report is
893 // Set the asymptotic computational complexity for the benchmark. If called
894 // the asymptotic computational complexity will be shown on the output.
895 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
897 // Set the asymptotic computational complexity for the benchmark. If called
898 // the asymptotic computational complexity will be shown on the output
1371 BigO complexity; member in struct:benchmark::BenchmarkReporter::Run
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/include/benchmark/ |
| benchmark.h | 394 // complexity for the benchmark. In case oAuto is selected, complexity will be
399 // computational complexity for the benchmark.
534 // If this routine is called with complexity_n > 0 and complexity report is
854 // Set the asymptotic computational complexity for the benchmark. If called
855 // the asymptotic computational complexity will be shown on the output.
856 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
858 // Set the asymptotic computational complexity for the benchmark. If called
859 // the asymptotic computational complexity will be shown on the output
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | 2641 unsigned Complexity = 0;
2643 Complexity = 1;
2645 Complexity = 4;
2648 Complexity++;
2653 Complexity++;
2663 Complexity = 4;
2665 Complexity += 2;
2696 Complexity++;
2700 Complexity++;
2703 if (Complexity <= 2
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | 188 cl::desc("Maximum depth of recursive SCEV complexity comparisons"),
198 cl::desc("Maximum depth of recursive value complexity comparisons"),
593 /// Compare the two values \p LV and \p RV in terms of their "complexity" where
594 /// "complexity" is a partial (and somewhat ad-hoc) relation used to order
597 /// intended to avoid exponential time complexity in cases like:
758 // Addrec complexity grows with operand count.
838 /// Given a list of SCEV objects, order them by their complexity, and group
839 /// objects of the same complexity together by value. When this routine is
841 /// complexity is monotonically increasing.
854 // Whether LHS has provably less complexity than RHS
[all...] |
