Searched defs:CGP (Results 1 - 6 of 6) sorted by relevance
/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in class:__anon11352::DAGISelEmitter 29 explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {} 42 CodeGenDAGPatterns &CGP) { 49 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op); 54 Cost += getResultPatternCost(P->getChild(i), CGP); 61 CodeGenDAGPatterns &CGP) { 70 Cost += getResultPatternSize(P->getChild(i), CGP); 79 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {} 80 CodeGenDAGPatterns &CGP; member in struct:__anon11353::PatternSortingPredicate 97 int LHSSize = LHS->getPatternComplexity(CGP); 41 getResultPatternCost(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument 60 getResultPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument [all...] |
H A D | DAGISelMatcherOpt.cpp | 27 const CodeGenDAGPatterns &CGP) { 36 ContractNodes(Child, CGP); 70 return ContractNodes(MatcherPtr, CGP); 79 return ContractNodes(MatcherPtr, CGP); 97 return ContractNodes(MatcherPtr, CGP); 117 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) 127 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) 157 ContractNodes(N->getNextPtr(), CGP); 176 return ContractNodes(MatcherPtr, CGP); 516 const CodeGenDAGPatterns &CGP) { 26 ContractNodes(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument 515 OptimizeMatcher(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | DAGISelMatcherEmitter.cpp | 35 const CodeGenDAGPatterns &CGP; member in class:__anon11355::MatcherTableEmitter 52 : CGP(cgp) {} 557 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; 585 << CM->getPattern().getPatternComplexity(CGP) << '\n'; 631 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end(); 704 CGP.getSDNodeTransform(NodeXForms[i]); 714 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); 807 const CodeGenDAGPatterns &CGP, 814 MatcherTableEmitter MatcherEmitter(CGP); 806 EmitMatcherTable(const Matcher *TheMatcher, const CodeGenDAGPatterns &CGP, raw_ostream &O) argument [all...] |
H A D | DAGISelMatcherGen.cpp | 51 const CodeGenDAGPatterns &CGP; member in class:__anon11356::MatcherGen 154 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), 182 TreePattern &TP = *CGP.pf_begin()->second; 215 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); 308 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); 352 if (N->NodeHasProperty(SDNPMemOperand, CGP)) 358 if (N->NodeHasProperty(SDNPHasChain, CGP)) { 402 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); 404 Root->getOperator() == CGP 683 mayInstNodeLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 692 numNodesThatMayLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 1001 ConvertPatternToMatcher(const PatternToMatch &Pattern, unsigned Variant, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | CodeGenDAGPatterns.cpp | 788 const CodeGenDAGPatterns &CGP) { 800 const ComplexPattern *AM = P->getComplexPatternInfo(CGP); 818 Size += getPatternSize(Child, CGP); 822 else if (Child->getComplexPatternInfo(CGP)) 823 Size += getPatternSize(Child, CGP); 835 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { 836 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); 1552 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { 1564 return &CGP.getComplexPattern(Rec); 1567 unsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) cons 787 getPatternSize(const TreePatternNode *P, const CodeGenDAGPatterns &CGP) argument [all...] |
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 553 CGPassManager *CGP; local 556 CGP = (CGPassManager*)PMS.top(); 563 CGP = new CGPassManager(); 567 TPM->addIndirectPassManager(CGP); 571 Pass *P = CGP; 575 PMS.push(CGP); 578 CGP->add(this);
|
Completed in 1632 milliseconds