49   unsigned Cost = 0;  in getResultPatternCost()  local
52     Cost++;  in getResultPatternCost()
55       Cost += 10;  in getResultPatternCost()
58     Cost += getResultPatternCost(P.getChild(i), CGP);  in getResultPatternCost()
59   return Cost;  in getResultPatternCost()
69   unsigned Cost = 0;  in getResultPatternSize()  local
72     Cost += Op->getValueAsInt("CodeSize");  in getResultPatternSize()
75     Cost += getResultPatternSize(P.getChild(i), CGP);  in getResultPatternSize()
76   return Cost;  in getResultPatternSize()
81 // In particular, we want to match maximal patterns first and lowest cost within
105       return true; // LHS -> bigger -> less cost  in operator ()()
109     // If the patterns have equal complexity, compare generated instruction cost  in operator ()()
171   // We want to process the matches in order of minimal cost.  Sort the patterns  in run()
172   // so the least cost one is at the start.  in run()