/external/swiftshader/third_party/LLVM/utils/TableGen/ |
H A D | FastISelEmitter.h | 29 CodeGenDAGPatterns CGP; member in class:llvm::FastISelEmitter
|
H A D | DAGISelEmitter.h | 27 CodeGenDAGPatterns CGP; member in class:llvm::DAGISelEmitter 29 explicit DAGISelEmitter(RecordKeeper &R) : Records(R), CGP(R) {}
|
H A D | DAGISelEmitter.cpp | 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; member in struct:__anon20417::PatternSortingPredicate 85 unsigned LHSSize = LHS->getPatternComplexity(CGP); 86 unsigned RHSSize = RHS->getPatternComplexity(CGP); 91 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP); 27 getResultPatternCost(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument 46 getResultPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument [all...] |
H A D | DAGISelMatcherOpt.cpp | 26 const CodeGenDAGPatterns &CGP) { 35 ContractNodes(Child, CGP); 61 return ContractNodes(MatcherPtr, CGP); 70 return ContractNodes(MatcherPtr, CGP); 88 return ContractNodes(MatcherPtr, CGP); 108 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) 118 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) 149 ContractNodes(N->getNextPtr(), CGP); 168 return ContractNodes(MatcherPtr, CGP); 507 const CodeGenDAGPatterns &CGP) { 25 ContractNodes(OwningPtr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument 506 OptimizeMatcher(Matcher *TheMatcher, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | DAGISelMatcherEmitter.cpp | 35 const CodeGenDAGPatterns &CGP; member in class:__anon20419::MatcherTableEmitter 52 : CGP(cgp) {} 540 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; 568 << CM->getPattern().getPatternComplexity(CGP) << '\n'; 615 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end(); 687 CGP.getSDNodeTransform(NodeXForms[i]); 697 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); 788 const CodeGenDAGPatterns &CGP, 795 MatcherTableEmitter MatcherEmitter(CGP); 787 EmitMatcherTable(const Matcher *TheMatcher, const CodeGenDAGPatterns &CGP, raw_ostream &O) argument [all...] |
H A D | DAGISelMatcherGen.cpp | 52 const CodeGenDAGPatterns &CGP; member in class:__anon20420::MatcherGen 145 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), 173 TreePattern &TP = *CGP.pf_begin()->second; 211 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); 270 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); 314 if (N->NodeHasProperty(SDNPMemOperand, CGP)) 320 if (N->NodeHasProperty(SDNPHasChain, CGP)) { 364 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); 366 Root->getOperator() == CGP 645 mayInstNodeLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 654 numNodesThatMayLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 932 ConvertPatternToMatcher(const PatternToMatch &Pattern, unsigned Variant, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | CodeGenDAGPatterns.cpp | 691 const CodeGenDAGPatterns &CGP) { 703 const ComplexPattern *AM = P->getComplexPatternInfo(CGP); 717 Size += getPatternSize(Child, CGP); 721 else if (Child->getComplexPatternInfo(CGP)) 722 Size += getPatternSize(Child, CGP); 734 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { 735 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); 1329 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { 1334 return &CGP.getComplexPattern(DI->getDef()); 1340 const CodeGenDAGPatterns &CGP) cons 690 getPatternSize(const TreePatternNode *P, const CodeGenDAGPatterns &CGP) argument [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in class:__anon13877::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:__anon13878::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 | 26 const CodeGenDAGPatterns &CGP) { 35 ContractNodes(Child, CGP); 69 return ContractNodes(MatcherPtr, CGP); 78 return ContractNodes(MatcherPtr, CGP); 98 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) 108 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) 138 ContractNodes(N->getNextPtr(), CGP); 157 return ContractNodes(MatcherPtr, CGP); 446 const CodeGenDAGPatterns &CGP) { 447 ContractNodes(MatcherPtr, CGP); 25 ContractNodes(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument 445 OptimizeMatcher(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | DAGISelMatcherEmitter.cpp | 36 const CodeGenDAGPatterns &CGP; member in class:__anon13880::MatcherTableEmitter 57 : CGP(cgp) {} 589 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; 608 << CM->getPattern().getPatternComplexity(CGP) << '\n'; 723 CGP.getSDNodeTransform(NodeXForms[i]); 733 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); 825 const CodeGenDAGPatterns &CGP, 832 MatcherTableEmitter MatcherEmitter(CGP);
|
H A D | DAGISelMatcherGen.cpp | 50 const CodeGenDAGPatterns &CGP; member in class:__anon13881::MatcherGen 149 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), 177 TreePattern &TP = *CGP.pf_begin()->second; 210 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); 305 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); 349 if (N->NodeHasProperty(SDNPMemOperand, CGP)) 355 if (N->NodeHasProperty(SDNPHasChain, CGP)) { 399 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); 401 Root->getOperator() == CGP 678 mayInstNodeLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 687 numNodesThatMayLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument 991 ConvertPatternToMatcher(const PatternToMatch &Pattern, unsigned Variant, const CodeGenDAGPatterns &CGP) argument [all...] |
H A D | CodeGenDAGPatterns.cpp | 816 const CodeGenDAGPatterns &CGP) { 828 const ComplexPattern *AM = P->getComplexPatternInfo(CGP); 846 Size += getPatternSize(Child, CGP); 850 else if (Child->getComplexPatternInfo(CGP)) 851 Size += getPatternSize(Child, CGP); 863 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { 864 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); 1597 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { 1609 return &CGP.getComplexPattern(Rec); 1612 unsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) cons 815 getPatternSize(const TreePatternNode *P, const CodeGenDAGPatterns &CGP) argument [all...] |
/external/llvm/lib/Analysis/ |
H A D | CallGraphSCCPass.cpp | 556 CGPassManager *CGP; local 559 CGP = (CGPassManager*)PMS.top(); 566 CGP = new CGPassManager(); 570 TPM->addIndirectPassManager(CGP); 574 Pass *P = CGP; 578 PMS.push(CGP); 581 CGP->add(this);
|
/external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 536 CGPassManager *CGP; local 539 CGP = (CGPassManager*)PMS.top(); 546 CGP = new CGPassManager(); 550 TPM->addIndirectPassManager(CGP); 554 Pass *P = CGP; 558 PMS.push(CGP); 561 CGP->add(this);
|