Home
last modified time | relevance | path

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

/llvm-project/third-party/benchmark/test/
H A Dcomplexity_test.cc90 ->Complexity(benchmark::o1);
91 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->UseManualTime()->Complexity();
95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anon6994ed730202()
140 ->Complexity(benchmark::oN);
145 ->Complexity();
150 ->Complexity([](benchmark::IterationCount n) -> double { in __anon6994ed730302()
198 ->Complexity(benchmark::oNLogN);
203 ->Complexity();
208 ->Complexity([](benchmark::IterationCount n) { in __anon6994ed730402()
256 ->Complexity(benchmark::oN)
H A Dreporter_output_test.cc417 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1);
/llvm-project/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/libcxx/benchmarks/
H A Dfilesystem.bench.cpp
/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h308 if (Complexity == 0)
309 Complexity = 1 + Operand->computeComplexity();
310 return Complexity; in Profile()
360 if (Complexity == 0) in Profile()
361 Complexity = 1 + Operand->computeComplexity(); in Profile()
362 return Complexity; in Profile()
458 if (Complexity == 0) in Profile()
459 Complexity = in Profile()
461 return Complexity;
H A DSymExpr.h64 mutable unsigned Complexity = 0;
52 mutable unsigned Complexity = 0; global() variable
/llvm-project/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/llvm/utils/TableGen/Common/
H A DCodeGenTarget.h245 unsigned Complexity; in getValueType()
257 unsigned getComplexity() const { return Complexity; }
240 unsigned Complexity; global() variable
H A DCodeGenTarget.cpp403 int64_t RawComplexity = R->getValueAsInt("Complexity");
405 Complexity = NumOperands * 3; in ComplexPattern()
407 Complexity = RawComplexity; in ComplexPattern()
H A DCodeGenDAGPatterns.cpp4357 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParsePatterns()
4374 InstImpResults, Complexity, in ParsePatterns()
4321 int Complexity = TheDef->getValueAsInt("AddedComplexity"); ParseOnePattern() local
/llvm-project/third-party/benchmark/src/
H A Dbenchmark_register.cc421 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() function in benchmark::internal::Benchmark
426 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() function in benchmark::internal::Benchmark
/llvm-project/third-party/benchmark/bindings/python/google_benchmark/
H A Dbenchmark.cc114 (Benchmark * (Benchmark::*)(benchmark::BigO)) & Benchmark::Complexity, in NB_MODULE()
/llvm-project/libcxx/docs/Status/
H A DCxx17Papers.csv102 "`P0523R1 <https://wg21.link/P0523R1>`__","Wording for CH 10: Complexity of parallel algorithms","2017-02 (Kona)","|Nothing To Do|","",""
105 "`P0574R1 <https://wg21.link/P0574R1>`__","Algorithm Complexity Constraints and Parallel Overloads","2017-02 (Kona)","|Nothing To Do|","",""
H A DCxx14Issues.csv
/llvm-project/third-party/benchmark/docs/
H A Duser_guide.md27 [Calculating Asymptotic Complexity](#asymptotic-complexity)
489 ## Calculating Asymptotic Complexity (Big O)
506 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity(benchmark::oN);
514 ->RangeMultiplier(2)->Range(1<<10, 1<<18)->Complexity();
522 ->Range(1<<10, 1<<18)->Complexity([](benchmark::IterationCount n)->double{return n; });
/llvm-project/third-party/benchmark/include/benchmark/
H A Dbenchmark.h1255 Benchmark* Complexity(BigO complexity = benchmark::oAuto);
1259 Benchmark* Complexity(BigOFunc* complexity);
/llvm-project/llvm/lib/Target/X86/
H A DX86ISelDAGToDAG.cpp3118 unsigned Complexity = 0; in selectLEAAddr()
3120 Complexity = 1; in selectLEAAddr()
3122 Complexity = 4; in selectLEAAddr()
3125 Complexity++; in selectLEAAddr()
3130 Complexity++; in selectLEAAddr()
3140 Complexity = 4; in selectTLSADDRAddr()
3142 Complexity += 2; in selectTLSADDRAddr()
3172 Complexity++; in selectRelocImm()
3176 Complexity++; in selectRelocImm()
3179 if (Complexity < in selectRelocImm()
3071 unsigned Complexity = 0; selectLEAAddr() local
[all...]
H A DX86InstrArithmetic.td1369 // Complexity is reduced to give and with immediate a chance to match first.
/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonPatterns.td1929 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1946 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1970 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
1995 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.
2002 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.
2018 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/
H A DCheckers.td1642 "Complexity is here defined as the total amount of children "
/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp782 auto Complexity = CompareSCEVComplexity(EqCacheSCEV, LI, LHS, RHS, DT); in CompareSCEVComplexity()
783 return Complexity && *Complexity < 0; in CompareSCEVComplexity()
805 unsigned Complexity = S->getSCEVType(); in GroupByComplexity()
809 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity() local
833 unsigned Complexity = S->getSCEVType(); GroupByComplexity() local
/llvm-project/llvm/include/llvm/Target/
H A DTargetSelectionDAG.td2090 int Complexity = complexity;
/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZInstrInfo.td2355 // Complexity is added so that we match this before we match NILF on the AND
/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVInstrInfoVVLPatterns.td589 // Give explicit Complexity to prefer simm5/uimm5.