| /external/llvm/utils/TableGen/ |
| D | DAGISelEmitter.cpp | 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 ()()
[all …]
|
| D | DAGISelMatcherGen.cpp | 52 const CodeGenDAGPatterns &CGP; member in __anon914186370111::MatcherGen
145 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), in MatcherGen()
173 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes()
211 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode()
270 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); in EmitOperatorMatchCode()
314 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode()
320 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode()
364 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); in EmitOperatorMatchCode()
366 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || in EmitOperatorMatchCode()
367 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || in EmitOperatorMatchCode()
[all …]
|
| D | DAGISelMatcherOpt.cpp | 26 const CodeGenDAGPatterns &CGP) { in ContractNodes() argument
35 ContractNodes(Child, CGP); in ContractNodes()
61 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
70 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
88 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
108 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) in ContractNodes()
118 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) in ContractNodes()
149 ContractNodes(N->getNextPtr(), CGP); in ContractNodes()
168 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
507 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument
[all …]
|
| D | DAGISelEmitter.h | 27 CodeGenDAGPatterns CGP; variable
29 explicit DAGISelEmitter(RecordKeeper &R) : Records(R), CGP(R) {} in DAGISelEmitter()
|
| D | FastISelEmitter.cpp | 375 void collectPatterns(CodeGenDAGPatterns &CGP);
382 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) { in getOpcodeName() argument
383 return CGP.getSDNodeInfo(Op).getEnumName(); in getOpcodeName()
416 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument
417 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns()
424 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns()
425 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns()
435 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op); in collectPatterns()
487 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns()
855 const CodeGenTarget &Target = CGP.getTargetInfo(); in run()
[all …]
|
| D | DAGISelMatcherEmitter.cpp | 35 const CodeGenDAGPatterns &CGP; member in __anon32d951170211::MatcherTableEmitter
52 : CGP(cgp) {} in MatcherTableEmitter()
540 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
568 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
615 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end(); in EmitPredicateFunctions()
687 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions()
697 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); in EmitPredicateFunctions()
788 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument
795 MatcherTableEmitter MatcherEmitter(CGP); in EmitMatcherTable()
|
| D | FastISelEmitter.h | 29 CodeGenDAGPatterns CGP; variable
|
| D | CodeGenDAGPatterns.h | 404 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
407 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
411 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
660 unsigned getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| D | CodeGenDAGPatterns.cpp | 691 const CodeGenDAGPatterns &CGP) { in getPatternSize() argument
703 const ComplexPattern *AM = P->getComplexPatternInfo(CGP); in getPatternSize()
717 Size += getPatternSize(Child, CGP); in getPatternSize()
721 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize()
722 Size += getPatternSize(Child, CGP); in getPatternSize()
734 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity()
735 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); in getPatternComplexity()
1329 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { in getComplexPatternInfo()
1334 return &CGP.getComplexPattern(DI->getDef()); in getComplexPatternInfo()
1340 const CodeGenDAGPatterns &CGP) const { in NodeHasProperty()
[all …]
|
| D | DAGISelMatcher.h | 32 const CodeGenDAGPatterns &CGP);
33 Matcher *OptimizeMatcher(Matcher *Matcher, const CodeGenDAGPatterns &CGP);
34 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| /external/llvm/lib/Analysis/IPA/ |
| D | CallGraphSCCPass.cpp | 535 CGPassManager *CGP; in assignPassManager() local
538 CGP = (CGPassManager*)PMS.top(); in assignPassManager()
545 CGP = new CGPassManager(PMD->getDepth() + 1); in assignPassManager()
549 TPM->addIndirectPassManager(CGP); in assignPassManager()
553 Pass *P = CGP; in assignPassManager()
557 PMS.push(CGP); in assignPassManager()
560 CGP->add(this); in assignPassManager()
|