| /external/llvm/utils/TableGen/ |
| D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in __anonbb5c23f50111::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 ()()
[all …]
|
| D | DAGISelMatcherGen.cpp | 51 const CodeGenDAGPatterns &CGP; member in __anon1ac2b5390111::MatcherGen
154 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), in MatcherGen()
182 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes()
215 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode()
310 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); in EmitOperatorMatchCode()
354 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode()
360 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode()
404 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); in EmitOperatorMatchCode()
406 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || in EmitOperatorMatchCode()
407 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || in EmitOperatorMatchCode()
[all …]
|
| D | DAGISelMatcherOpt.cpp | 27 const CodeGenDAGPatterns &CGP) { in ContractNodes() argument
36 ContractNodes(Child, CGP); in ContractNodes()
70 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
79 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
97 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
117 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) in ContractNodes()
127 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) in ContractNodes()
157 ContractNodes(N->getNextPtr(), CGP); in ContractNodes()
176 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
516 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument
[all …]
|
| D | FastISelEmitter.cpp | 398 void collectPatterns(CodeGenDAGPatterns &CGP);
409 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) { in getOpcodeName() argument
410 return CGP.getSDNodeInfo(Op).getEnumName(); in getOpcodeName()
442 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument
443 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns()
450 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns()
451 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns()
461 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op); in collectPatterns()
513 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns()
586 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns()
[all …]
|
| D | DAGISelMatcherEmitter.cpp | 36 const CodeGenDAGPatterns &CGP; member in __anone77e31190211::MatcherTableEmitter
57 : CGP(cgp) {} in MatcherTableEmitter()
575 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
603 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
718 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions()
728 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); in EmitPredicateFunctions()
821 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument
828 MatcherTableEmitter MatcherEmitter(CGP); in EmitMatcherTable()
|
| D | CodeGenDAGPatterns.h | 430 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
436 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;
439 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
443 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
713 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| D | CodeGenDAGPatterns.cpp | 816 const CodeGenDAGPatterns &CGP) { in getPatternSize() argument
828 const ComplexPattern *AM = P->getComplexPatternInfo(CGP); in getPatternSize()
846 Size += getPatternSize(Child, CGP); in getPatternSize()
850 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize()
851 Size += getPatternSize(Child, CGP); in getPatternSize()
863 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity()
864 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); in getPatternComplexity()
1597 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { in getComplexPatternInfo()
1609 return &CGP.getComplexPattern(Rec); in getComplexPatternInfo()
1612 unsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) const { in getNumMIResults()
[all …]
|
| D | DAGISelMatcher.h | 32 const CodeGenDAGPatterns &CGP);
34 const CodeGenDAGPatterns &CGP);
35 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| /external/llvm/lib/Analysis/ |
| D | CallGraphSCCPass.cpp | 555 CGPassManager *CGP; in assignPassManager() local
558 CGP = (CGPassManager*)PMS.top(); in assignPassManager()
565 CGP = new CGPassManager(); in assignPassManager()
569 TPM->addIndirectPassManager(CGP); in assignPassManager()
573 Pass *P = CGP; in assignPassManager()
577 PMS.push(CGP); in assignPassManager()
580 CGP->add(this); in assignPassManager()
|
| /external/llvm/test/CodeGen/NVPTX/ |
| D | branch-fold.ll | 2 ; Disable CGP which also folds branches, so that only BranchFolding is under
|
| /external/llvm/test/CodeGen/X86/ |
| D | tailcall-cgp-dup.ll | 3 ; Teach CGP to dup returns to enable tail call optimization.
|
| /external/webrtc/talk/media/testdata/ |
| D | faces.1280x720_P420.yuv | 3 …���������������������������������zuv{��xudQHDC>>J\o|������oUA9993340,+.26<CGP\ejie_^^__^^___`bfkq…
|