Lines Matching full:cost
45 unsigned Cost = 0;
48 Cost++;
51 Cost += 10;
54 Cost += getResultPatternCost(P->getChild(i), CGP);
55 return Cost;
64 unsigned Cost = 0;
67 Cost += Op->getValueAsInt("CodeSize");
70 Cost += getResultPatternSize(P->getChild(i), CGP);
71 return Cost;
76 // In particular, we want to match maximal patterns first and lowest cost within
99 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
102 // If the patterns have equal complexity, compare generated instruction cost
144 // We want to process the matches in order of minimal cost. Sort the patterns
145 // so the least cost one is at the start.
