27   CodeGenDAGPatterns CGP;  member in __anon0d2f67790111::DAGISelEmitter
29   explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {}  in DAGISelEmitter()
42                                      CodeGenDAGPatterns &CGP) {  in getResultPatternCost()  argument
49     CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);  in getResultPatternCost()
54     Cost += getResultPatternCost(P->getChild(i), CGP);  in getResultPatternCost()
61                                      CodeGenDAGPatterns &CGP) {  in getResultPatternSize()  argument
70     Cost += getResultPatternSize(P->getChild(i), CGP);  in getResultPatternSize()
79   PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}  in PatternSortingPredicate()
80   CodeGenDAGPatterns &CGP;  member
97     int LHSSize = LHS->getPatternComplexity(CGP);  in operator ()()
98     int RHSSize = RHS->getPatternComplexity(CGP);  in operator ()()
103     unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);  in operator ()()
104     unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);  in operator ()()
108     unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);  in operator ()()
109     unsigned RHSPatSize = getResultPatternSize(RHS->getDstPattern(), CGP);  in operator ()()
124                        CGP.getTargetInfo().getName() + " target", OS);  in run()
131         for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),  in run()
132              E = CGP.ptm_end(); I != E; ++I) {  in run()
140   for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end();  in run()
146   std::sort(Patterns.begin(), Patterns.end(), PatternSortingPredicate(CGP));  in run()
153       if (Matcher *M = ConvertPatternToMatcher(*Patterns[i], Variant, CGP))  in run()
163   OptimizeMatcher(TheMatcher, CGP);  in run()
165   EmitMatcherTable(TheMatcher.get(), CGP, OS);  in run()