Lines Matching defs:CGP
28 CodeGenDAGPatterns &CGP) {
35 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
40 Cost += getResultPatternCost(P->getChild(i), CGP);
47 CodeGenDAGPatterns &CGP) {
56 Cost += getResultPatternSize(P->getChild(i), CGP);
65 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
66 CodeGenDAGPatterns &CGP;
85 unsigned LHSSize = LHS->getPatternComplexity(CGP);
86 unsigned RHSSize = RHS->getPatternComplexity(CGP);
91 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
92 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);
96 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);
97 unsigned RHSPatSize = getResultPatternSize(RHS->getDstPattern(), CGP);
112 CGP.getTargetInfo().getName() + " target", OS);
119 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
120 E = CGP.ptm_end(); I != E; ++I) {
128 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();
134 std::sort(Patterns.begin(), Patterns.end(), PatternSortingPredicate(CGP));
141 if (Matcher *M = ConvertPatternToMatcher(*Patterns[i], Variant, CGP))
151 TheMatcher = OptimizeMatcher(TheMatcher, CGP);
153 EmitMatcherTable(TheMatcher, CGP, OS);
