| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in __anon9b3a95f30111::DAGISelEmitter
29 explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {} in DAGISelEmitter()
54 Cost += getResultPatternCost(P->getChild(i), CGP); in getResultPatternCost()
80 CodeGenDAGPatterns &CGP; member
97 int LHSSize = LHS->getPatternComplexity(CGP); in operator ()()
98 int RHSSize = RHS->getPatternComplexity(CGP); in operator ()()
144 E = CGP.ptm_end(); in run()
155 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end(); in run()
162 PatternSortingPredicate(CGP)); in run()
179 OptimizeMatcher(TheMatcher, CGP); in run()
[all …]
|
| H A D | DAGISelMatcherGen.cpp | 56 const CodeGenDAGPatterns &CGP; member in __anon9462ce770111::MatcherGen
177 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes()
212 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode()
352 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode()
358 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode()
419 if (N->NodeHasProperty(SDNPOutGlue, CGP) && in EmitOperatorMatchCode()
431 if (N->NodeHasProperty(SDNPOptInGlue, CGP) || in EmitOperatorMatchCode()
432 N->NodeHasProperty(SDNPInGlue, CGP)) in EmitOperatorMatchCode()
718 if (mayInstNodeLoadOrStore(N, CGP)) in numNodesThatMayLoadOrStore()
775 = CGP.getDefaultOperand(OperandNode); in EmitResultInstructionAsOperand()
[all …]
|
| H A D | DAGISelMatcherOpt.cpp | 26 const CodeGenDAGPatterns &CGP) { in ContractNodes() argument
35 ContractNodes(Child, CGP); in ContractNodes()
69 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
78 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
98 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) in ContractNodes()
108 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) in ContractNodes()
138 ContractNodes(N->getNextPtr(), CGP); in ContractNodes()
157 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
464 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument
465 ContractNodes(MatcherPtr, CGP); in OptimizeMatcher()
|
| H A D | FastISelEmitter.cpp | 406 void collectPatterns(CodeGenDAGPatterns &CGP);
418 return CGP.getSDNodeInfo(Op).getEnumName(); in getOpcodeName()
448 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument
449 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns()
452 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns()
453 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns()
522 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns()
594 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns()
881 CodeGenDAGPatterns CGP(RK); in EmitFastISel() local
882 const CodeGenTarget &Target = CGP.getTargetInfo(); in EmitFastISel()
[all …]
|
| H A D | DAGISelMatcherEmitter.cpp | 49 const CodeGenDAGPatterns &CGP; member in __anonf9e4b9570211::MatcherTableEmitter
84 : CGP(cgp) {} in MatcherTableEmitter()
745 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
780 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
931 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions()
941 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); in EmitPredicateFunctions()
1039 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument
1071 MatcherTableEmitter MatcherEmitter(CGP); in EmitMatcherTable()
|
| H A D | CodeGenDAGPatterns.h | 762 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
768 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;
771 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
775 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
1124 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| H A D | CodeGenDAGPatterns.cpp | 1309 Size += getPatternSize(Child, CGP); in getPatternSize()
1316 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize()
1317 Size += getPatternSize(Child, CGP); in getPatternSize()
1329 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity()
2167 return &CGP.getComplexPattern(Rec); in getComplexPatternInfo()
2172 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in getNumMIResults()
2193 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in NodeHasProperty()
2203 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CGP)) in NodeHasProperty()
2210 return CGP.getSDNodeInfo(Operator).hasProperty(Property); in NodeHasProperty()
2220 if (NodeHasProperty(Property, CGP)) in TreeHasProperty()
[all …]
|
| H A D | DAGISelMatcher.h | 32 const CodeGenDAGPatterns &CGP);
34 const CodeGenDAGPatterns &CGP);
35 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| H A D | GlobalISelEmitter.cpp | 2963 const CodeGenDAGPatterns CGP; member in __anon7e76e5f80111::GlobalISelEmitter
3136 : RK(RK), CGP(RK), Target(CGP.getTargetInfo()), in GlobalISelEmitter()
3348 if (const CodeGenIntrinsic *II = Src->getIntrinsicInfo(CGP)) { in createAndImportSelDAGMatcher()
3398 auto &ChildSDNI = CGP.getSDNodeInfo(SrcChild->getOperator()); in importChildMatcher()
3524 auto &ChildSDNI = CGP.getSDNodeInfo(DstChild->getOperator()); in importExplicitUseRenderer()
3830 int Score = P.getPatternComplexity(CGP); in runOnPattern()
4261 for (const PatternToMatch &Pat : CGP.ptms()) { in run()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | CallGraphSCCPass.cpp | 576 CGPassManager *CGP; in assignPassManager() local
579 CGP = (CGPassManager*)PMS.top(); in assignPassManager()
586 CGP = new CGPassManager(); in assignPassManager()
590 TPM->addIndirectPassManager(CGP); in assignPassManager()
594 Pass *P = CGP; in assignPassManager()
598 PMS.push(CGP); in assignPassManager()
601 CGP->add(this); in assignPassManager()
|
| /freebsd-12.1/share/misc/ |
| H A D | pci_vendors | 24491 15d9 0652 Dual Port i350 GbE MicroLP [AOC-CGP-i2]
|