Searched refs:Complexity (Results 1 – 14 of 14) sorted by relevance
274 if (Complexity == 0) in computeComplexity()275 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()276 return Complexity; in computeComplexity()350 if (Complexity == 0) in computeComplexity()351 Complexity = 1 + LHS->computeComplexity(); in computeComplexity()352 return Complexity; in computeComplexity()393 if (Complexity == 0) in computeComplexity()394 Complexity = 1 + RHS->computeComplexity(); in computeComplexity()395 return Complexity; in computeComplexity()437 if (Complexity == 0) in computeComplexity()[all …]
52 mutable unsigned Complexity = 0; variable
430 size_t Complexity = 1; in calculateStmtComplexity() local447 Complexity = 0; in calculateStmtComplexity()454 Complexity += calculateStmtComplexity( in calculateStmtComplexity()456 if (Complexity >= Limit) in calculateStmtComplexity()461 Complexity += calculateStmtComplexity( in calculateStmtComplexity()463 if (Complexity >= Limit) in calculateStmtComplexity()467 return Complexity; in calculateStmtComplexity()
200 unsigned Complexity; variable211 unsigned getComplexity() const { return Complexity; } in getComplexity()
467 Complexity = NumOperands * 3; in ComplexPattern()469 Complexity = RawComplexity; in ComplexPattern()
4089 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParseOnePattern() local4107 InstImpResults, Complexity, in ParseOnePattern()
2138 unsigned Complexity = 0; in selectLEAAddr() local2141 Complexity = 1; in selectLEAAddr()2145 Complexity = 4; in selectLEAAddr()2148 Complexity++; in selectLEAAddr()2155 Complexity++; in selectLEAAddr()2165 Complexity = 4; in selectLEAAddr()2167 Complexity += 2; in selectLEAAddr()2171 Complexity++; in selectLEAAddr()2174 if (Complexity <= 2) in selectLEAAddr()
1285 // Complexity is reduced to give and with immediate a chance to match first.
1670 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1687 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1710 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.1721 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.1728 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.1741 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
658 // them immediately after __pos. __x must not be *this. Complexity:
1358 int Complexity = complexity;
2161 // Complexity is added so that we match this before we match NILF on the AND
810 unsigned Complexity = S->getSCEVType(); in GroupByComplexity() local814 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity()
173 ed.), Vol.@: A, @cite{Algorithms and Complexity}, Elsevier/MIT Press,