Home
last modified time | relevance | path

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

/llvm-project-15.0.7/third-party/benchmark/test/
H A Dcomplexity_test.cc78 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
79 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity();
82 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anon456a40700202()
131 ->Complexity(benchmark::oN);
135 ->Complexity([](benchmark::IterationCount n) -> double { in __anon456a40700302()
141 ->Complexity();
172 ->Complexity(benchmark::oNLogN);
176 ->Complexity([](benchmark::IterationCount n) { in __anon456a40700402()
182 ->Complexity();
213 ->Complexity(benchmark::oN)
H A Dreporter_output_test.cc411 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/readability/
H A Dfunction-cognitive-complexity.rst6 Checks function Cognitive Complexity metric.
17 Flag functions with Cognitive Complexity exceeding this number.
37 There are three basic building blocks of a Cognitive Complexity metric:
42 The following structures increase the function's Cognitive Complexity metric
71 Complexity metric, it is tracked, and is used by the next, third building block.
102 The following structures increase the function's Cognitive Complexity metric by
123 The simplest case. This function has Cognitive Complexity of `0`.
129 Slightly better example. This function has Cognitive Complexity of `1`.
139 Full example. This function has Cognitive Complexity of `3`.
/llvm-project-15.0.7/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();
/llvm-project-15.0.7/clang/lib/Analysis/
H A DCloneDetection.cpp424 size_t Complexity = 1; in calculateStmtComplexity() local
441 Complexity = 0; in calculateStmtComplexity()
448 Complexity += calculateStmtComplexity( in calculateStmtComplexity()
450 if (Complexity >= Limit) in calculateStmtComplexity()
455 Complexity += calculateStmtComplexity( in calculateStmtComplexity()
457 if (Complexity >= Limit) in calculateStmtComplexity()
461 return Complexity; in calculateStmtComplexity()
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h297 if (Complexity == 0) in computeComplexity()
298 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
299 return Complexity; in computeComplexity()
347 if (Complexity == 0) in computeComplexity()
348 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
349 return Complexity; in computeComplexity()
446 if (Complexity == 0) in computeComplexity()
447 Complexity = in computeComplexity()
449 return Complexity; in computeComplexity()
H A DSymExpr.h51 mutable unsigned Complexity = 0; variable
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DCodeGenTarget.h209 unsigned Complexity; variable
220 unsigned getComplexity() const { return Complexity; } in getComplexity()
H A DCodeGenTarget.cpp595 Complexity = NumOperands * 3; in ComplexPattern()
597 Complexity = RawComplexity; in ComplexPattern()
H A DCodeGenDAGPatterns.cpp4334 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParseOnePattern() local
4351 InstImpResults, Complexity, in ParseOnePattern()
/llvm-project-15.0.7/third-party/benchmark/src/
H A Dbenchmark_register.cc405 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() function in benchmark::internal::Benchmark
410 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() function in benchmark::internal::Benchmark
/llvm-project-15.0.7/third-party/benchmark/bindings/python/google_benchmark/
H A Dbenchmark.cc114 (Benchmark * (Benchmark::*)(benchmark::BigO)) & Benchmark::Complexity, in PYBIND11_MODULE()
/llvm-project-15.0.7/libcxx/docs/Status/
H A DCxx17Papers.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 DCxx14Issues.csv130 "`2304 <https://wg21.link/lwg2304>`__","Complexity of count in unordered associative containers","I…
/llvm-project-15.0.7/third-party/benchmark/docs/
H A Duser_guide.md27 [Calculating Asymptotic Complexity](#asymptotic-complexity)
451 ## Calculating Asymptotic Complexity (Big O)
467 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity(benchmark::oN);
475 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity();
483 ->Range(1<<10, 1<<18)->Complexity([](benchmark::IterationCount n)->double{return n; });
/llvm-project-15.0.7/third-party/benchmark/include/benchmark/
H A Dbenchmark.h1050 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
1054 Benchmark* Complexity(BigOFunc* complexity);
/llvm-project-15.0.7/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp2756 unsigned Complexity = 0; in selectLEAAddr() local
2758 Complexity = 1; in selectLEAAddr()
2760 Complexity = 4; in selectLEAAddr()
2763 Complexity++; in selectLEAAddr()
2768 Complexity++; in selectLEAAddr()
2778 Complexity = 4; in selectLEAAddr()
2780 Complexity += 2; in selectLEAAddr()
2810 Complexity++; in selectLEAAddr()
2814 Complexity++; in selectLEAAddr()
2817 if (Complexity <= 2) in selectLEAAddr()
H A DX86InstrArithmetic.td1475 // Complexity is reduced to give and with immediate a chance to match first.
/llvm-project-15.0.7/llvm/lib/Target/Hexagon/
H A DHexagonPatterns.td1780 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1797 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1821 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
1846 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.
1853 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.
1869 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DScalarEvolution.cpp872 auto Complexity = in GroupByComplexity() local
874 return Complexity && *Complexity < 0; in GroupByComplexity()
896 unsigned Complexity = S->getSCEVType(); in GroupByComplexity() local
900 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity()
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Checkers/
H A DCheckers.td1635 "Complexity is here defined as the total amount of children "
/llvm-project-15.0.7/llvm/lib/Target/RISCV/
H A DRISCVInstrInfoVVLPatterns.td299 // Give explicit Complexity to prefer simm5/uimm5.
/llvm-project-15.0.7/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td1866 int Complexity = complexity;
/llvm-project-15.0.7/llvm/lib/Target/SystemZ/
H A DSystemZInstrInfo.td2340 // Complexity is added so that we match this before we match NILF on the AND