Lines Matching defs:CGP
25 CodeGenDAGPatterns CGP;
27 explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {}
40 CodeGenDAGPatterns &CGP) {
47 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
52 Cost += getResultPatternCost(P->getChild(i), CGP);
59 CodeGenDAGPatterns &CGP) {
68 Cost += getResultPatternSize(P->getChild(i), CGP);
77 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
78 CodeGenDAGPatterns &CGP;
97 unsigned LHSSize = LHS->getPatternComplexity(CGP);
98 unsigned RHSSize = RHS->getPatternComplexity(CGP);
103 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
104 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);
108 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);
109 unsigned RHSPatSize = getResultPatternSize(RHS->getDstPattern(), CGP);
124 CGP.getTargetInfo().getName() + " target", OS);
131 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
132 E = CGP.ptm_end(); I != E; ++I) {
140 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();
146 std::sort(Patterns.begin(), Patterns.end(), PatternSortingPredicate(CGP));
153 if (Matcher *M = ConvertPatternToMatcher(*Patterns[i], Variant, CGP))
163 TheMatcher = OptimizeMatcher(TheMatcher, CGP);
165 EmitMatcherTable(TheMatcher, CGP, OS);
