Searched refs:Complexity (Results 1 – 15 of 15) sorted by relevance
424 size_t Complexity = 1; in calculateStmtComplexity() local441 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()
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()
52 mutable unsigned Complexity = 0; variable
240 unsigned Complexity; variable250 unsigned getComplexity() const { return Complexity; } in getComplexity()
417 Complexity = NumOperands * 3; in ComplexPattern()419 Complexity = RawComplexity; in ComplexPattern()
4329 int Complexity = TheDef->getValueAsInt("AddedComplexity"); in ParseOnePattern() local4346 InstImpResults, Complexity, in ParseOnePattern()
3072 unsigned Complexity = 0; in selectLEAAddr() local3074 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()
1371 // Complexity is reduced to give and with immediate a chance to match first.
1926 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1943 let AddedComplexity = 20 in { // Complexity greater than and/or/xor1967 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.
1682 "Complexity is here defined as the total amount of children "
809 auto Complexity = in GroupByComplexity() local811 return Complexity && *Complexity < 0; in GroupByComplexity()833 unsigned Complexity = S->getSCEVType(); in GroupByComplexity() local837 for (unsigned j = i+1; j != e && Ops[j]->getSCEVType() == Complexity; ++j) { in GroupByComplexity()
2048 int Complexity = complexity;
2284 // Complexity is added so that we match this before we match NILF on the AND
600 // Give explicit Complexity to prefer simm5/uimm5.
173 ed.), Vol.@: A, @cite{Algorithms and Complexity}, Elsevier/MIT Press,