Searched refs:Complexity (Results 1 – 15 of 15) sorted by relevance
425 size_t Complexity = 1; in calculateStmtComplexity() local442 Complexity = 0; in calculateStmtComplexity()449 Complexity += calculateStmtComplexity( in calculateStmtComplexity()451 if (Complexity >= Limit) in calculateStmtComplexity()456 Complexity += calculateStmtComplexity( in calculateStmtComplexity()458 if (Complexity >= Limit) in calculateStmtComplexity()462 return Complexity; in calculateStmtComplexity()
283 if (Complexity == 0) in computeComplexity()284 Complexity = 1 + Operand->computeComplexity(); in computeComplexity()285 return Complexity; in computeComplexity()382 if (Complexity == 0) in computeComplexity()383 Complexity = in computeComplexity()385 return Complexity; in computeComplexity()
51 mutable unsigned Complexity = 0; variable
210 unsigned Complexity; variable221 unsigned getComplexity() const { return Complexity; } in getComplexity()
590 Complexity = NumOperands * 3; in ComplexPattern()592 Complexity = RawComplexity; in ComplexPattern()
4257 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParseOnePattern() local4274 InstImpResults, Complexity, in ParseOnePattern()
2641 unsigned Complexity = 0; in selectLEAAddr() local2643 Complexity = 1; in selectLEAAddr()2645 Complexity = 4; in selectLEAAddr()2648 Complexity++; in selectLEAAddr()2653 Complexity++; in selectLEAAddr()2663 Complexity = 4; in selectLEAAddr()2665 Complexity += 2; in selectLEAAddr()2696 Complexity++; in selectLEAAddr()2700 Complexity++; in selectLEAAddr()2703 if (Complexity <= 2) in selectLEAAddr()
1475 // Complexity is reduced to give and with immediate a chance to match first.
1783 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1800 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1824 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.1849 let AddedComplexity = 20 in { // Complexity greater than compare reg-imm.1856 let AddedComplexity = 10 in // Complexity greater than compare reg-reg.1872 let AddedComplexity = 20 in { // Complexity greater than cmp reg-imm.
39 // Give explicit Complexity to prefer simm5/uimm5.
855 auto Complexity = in GroupByComplexity() local857 return Complexity && *Complexity < 0; in GroupByComplexity()879 unsigned Complexity = S->getSCEVType(); in GroupByComplexity() local883 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity()
1574 "Complexity is here defined as the total amount of children "
1667 int Complexity = complexity;
2314 // Complexity is added so that we match this before we match NILF on the AND
173 ed.), Vol.@: A, @cite{Algorithms and Complexity}, Elsevier/MIT Press,