| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | CloneDetection.cpp | 424 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()
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | SymbolManager.h | 298 if (Complexity == 0) in computeComplexity()
299 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
300 return Complexity; in computeComplexity()
348 if (Complexity == 0) in computeComplexity()
349 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()
350 return Complexity; in computeComplexity()
447 if (Complexity == 0) in computeComplexity()
448 Complexity = in computeComplexity()
450 return Complexity; in computeComplexity()
|
| H A D | SymExpr.h | 52 mutable unsigned Complexity = 0; variable
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenTarget.h | 240 unsigned Complexity; variable
250 unsigned getComplexity() const { return Complexity; } in getComplexity()
|
| H A D | CodeGenTarget.cpp | 417 Complexity = NumOperands * 3; in ComplexPattern()
419 Complexity = RawComplexity; in ComplexPattern()
|
| H A D | CodeGenDAGPatterns.cpp | 4321 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParseOnePattern() local
4338 InstImpResults, Complexity, in ParseOnePattern()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86ISelDAGToDAG.cpp | 3072 unsigned Complexity = 0; in selectLEAAddr() local
3074 Complexity = 1; in selectLEAAddr()
3076 Complexity = 4; in selectLEAAddr()
3079 Complexity++; in selectLEAAddr()
3084 Complexity++; in selectLEAAddr()
3094 Complexity = 4; in selectLEAAddr()
3096 Complexity += 2; in selectLEAAddr()
3126 Complexity++; in selectLEAAddr()
3130 Complexity++; in selectLEAAddr()
3133 if (Complexity <= 2) in selectLEAAddr()
|
| H A D | X86InstrArithmetic.td | 1371 // Complexity is reduced to give and with immediate a chance to match first.
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonPatterns.td | 1926 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1943 let AddedComplexity = 20 in { // Complexity greater than and/or/xor
1967 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
1992 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.
1999 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.
2015 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
|
| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | funstack.ok | 973 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
|
| H A D | funstack.in | 6860 title = "A Sorting Problem and Its Complexity",
17438 …title = "The Intrinsically Exponential Complexity of the Circularity Problem for Attribute …
17465 title = "On the Complexity of {LR(k)} Testing",
21188 title = "Complexity of Computations",
22477 title = "Corrigendum: {``Complexity of computations''}",
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Checkers/ |
| H A D | Checkers.td | 1682 "Complexity is here defined as the total amount of children "
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolution.cpp | 809 auto Complexity = in GroupByComplexity() local
811 return Complexity && *Complexity < 0; in GroupByComplexity()
833 unsigned Complexity = S->getSCEVType(); in GroupByComplexity() local
837 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetSelectionDAG.td | 2048 int Complexity = complexity;
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZInstrInfo.td | 2284 // Complexity is added so that we match this before we match NILF on the AND
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVInstrInfoVVLPatterns.td | 600 // Give explicit Complexity to prefer simm5/uimm5.
|
| /freebsd/contrib/diff/doc/ |
| H A D | diff.texi | 173 ed.), Vol.@: A, @cite{Algorithms and Complexity}, Elsevier/MIT Press,
|