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