| /freebsd-14.2/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | DAGISelEmitter.cpp | 29 CodeGenDAGPatterns CGP; member in __anon4a3989a40111::DAGISelEmitter
44 CodeGenDAGPatterns &CGP) { in getResultPatternCost() argument
56 Cost += getResultPatternCost(P->getChild(i), CGP); in getResultPatternCost()
72 Cost += getResultPatternSize(P->getChild(i), CGP); in getResultPatternSize()
82 CodeGenDAGPatterns &CGP; member
99 int LHSSize = LHS->getPatternComplexity(CGP); in operator ()()
100 int RHSSize = RHS->getPatternComplexity(CGP); in operator ()()
147 E = CGP.ptm_end(); in run()
159 for (const PatternToMatch &PTM : CGP.ptms()) in run()
182 OptimizeMatcher(TheMatcher, CGP); in run()
[all …]
|
| H A D | DAGISelMatcherGen.cpp | 59 const CodeGenDAGPatterns &CGP; member in __anon5041f0880111::MatcherGen
179 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes()
212 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode()
289 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed(Name)); in EmitLeafMatchCode()
370 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode()
376 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode()
437 if (N->NodeHasProperty(SDNPOutGlue, CGP) && in EmitOperatorMatchCode()
450 N->NodeHasProperty(SDNPInGlue, CGP)) in EmitOperatorMatchCode()
769 if (mayInstNodeLoadOrStore(N, CGP)) in numNodesThatMayLoadOrStore()
833 if (CGP.operandHasDefault(OperandNode) && in EmitResultInstructionAsOperand()
[all …]
|
| H A D | DAGISelMatcherOpt.cpp | 26 const CodeGenDAGPatterns &CGP) { in ContractNodes() argument
36 ContractNodes(Child, CGP); in ContractNodes()
74 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
82 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
112 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) in ContractNodes()
138 ContractNodes(N->getNextPtr(), CGP); in ContractNodes()
156 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
166 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
177 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
496 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument
[all …]
|
| H A D | FastISelEmitter.cpp | 400 void collectPatterns(CodeGenDAGPatterns &CGP);
412 return std::string(CGP.getSDNodeInfo(Op).getEnumName()); in getOpcodeName()
442 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument
443 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns()
446 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns()
447 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns()
516 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns()
587 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns()
862 CodeGenDAGPatterns CGP(RK); in EmitFastISel() local
863 const CodeGenTarget &Target = CGP.getTargetInfo(); in EmitFastISel()
[all …]
|
| H A D | GlobalISelCombinerEmitter.cpp | 406 if (!CGP) in inferImmediateType()
472 const CodeGenInstructionPattern &CGP) { in getMCOIOperandTypes() argument
478 auto &CGI = CGP.getInst(); in getMCOIOperandTypes()
491 if (CGP.hasVariadicDefs()) { in getMCOIOperandTypes()
502 for (unsigned K = CGP.getNumInstDefs(); K < CGP.getNumInstOperands(); ++K) { in getMCOIOperandTypes()
505 assert(CGP.isVariadic()); in getMCOIOperandTypes()
512 assert(OpTypes.size() == CGP.operands_size()); in getMCOIOperandTypes()
531 if (!CGP) in getInstEqClasses()
1181 if (auto *FI = CGP->getMIFlagsInfo()) { in checkSemantics()
1218 if (auto *FI = CGP->getMIFlagsInfo()) { in checkSemantics()
[all …]
|
| H A D | DAGISelMatcherEmitter.cpp | 51 const CodeGenDAGPatterns &CGP; member in __anonf5b87be80211::MatcherTableEmitter
86 : CGP(cgp), OpcodeCounts(Matcher::HighestKind + 1, 0) { in MatcherTableEmitter()
991 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
1026 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
1176 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions()
1187 std::string(CGP.getSDNodeInfo(SDNode).getSDClassName()); in EmitPredicateFunctions()
1300 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument
1332 MatcherTableEmitter MatcherEmitter(TheMatcher, CGP); in EmitMatcherTable()
|
| H A D | GlobalISelEmitter.cpp | 330 const CodeGenDAGPatterns CGP; member in __anon3a5608090111::GlobalISelEmitter
510 N->getIntrinsicInfo(CGP)->isConvergent) in getEquivNode()
529 : GlobalISelMatchTableExecutorEmitter(), RK(RK), CGP(RK), in GlobalISelEmitter()
530 Target(CGP.getTargetInfo()), CGRegs(Target.getRegBank()) { in GlobalISelEmitter()
859 const CodeGenIntrinsic *II = Src->getIntrinsicInfo(CGP); in createAndImportSelDAGMatcher()
972 auto &ChildSDNI = CGP.getSDNodeInfo(SrcChild->getOperator()); in importChildMatcher()
1200 auto &ChildSDNI = CGP.getSDNodeInfo(DstChild->getOperator()); in importExplicitUseRenderer()
1678 if (CGP.operandHasDefault(OperandNode) && in importExplicitUseRenderers()
1686 InsertPt, M, DstMIBuilder, CGP.getDefaultOperand(OperandNode))) in importExplicitUseRenderers()
1894 int Score = P.getPatternComplexity(CGP); in runOnPattern()
[all …]
|
| H A D | CodeGenDAGPatterns.h | 783 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
789 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;
792 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
796 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
1103 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| H A D | CodeGenDAGPatterns.cpp | 1430 const CodeGenDAGPatterns &CGP) { in getPatternSize() argument
1456 Size += getPatternSize(Child, CGP); in getPatternSize()
1463 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize()
1464 Size += getPatternSize(Child, CGP); in getPatternSize()
1478 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity()
2363 return &CGP.getComplexPattern(Rec); in getComplexPatternInfo()
2368 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in getNumMIResults()
2389 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in NodeHasProperty()
2399 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CGP)) in NodeHasProperty()
2416 if (NodeHasProperty(Property, CGP)) in TreeHasProperty()
[all …]
|
| H A D | DAGISelMatcher.h | 38 const CodeGenDAGPatterns &CGP);
40 const CodeGenDAGPatterns &CGP);
41 void EmitMatcherTable(Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallGraphSCCPass.cpp | 620 CGPassManager *CGP; in assignPassManager() local
623 CGP = (CGPassManager*)PMS.top(); in assignPassManager()
630 CGP = new CGPassManager(); in assignPassManager()
634 TPM->addIndirectPassManager(CGP); in assignPassManager()
638 Pass *P = CGP; in assignPassManager()
642 PMS.push(CGP); in assignPassManager()
645 CGP->add(this); in assignPassManager()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | CodeGenPrepare.cpp | 511 CodeGenPrepare CGP(TM); in runOnFunction() local
512 CGP.DL = &F.getParent()->getDataLayout(); in runOnFunction()
513 CGP.SubtargetInfo = TM->getSubtargetImpl(F); in runOnFunction()
514 CGP.TLI = CGP.SubtargetInfo->getTargetLowering(); in runOnFunction()
515 CGP.TRI = CGP.SubtargetInfo->getRegisterInfo(); in runOnFunction()
518 CGP.LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction()
519 CGP.BPI.reset(new BranchProbabilityInfo(F, *CGP.LI)); in runOnFunction()
520 CGP.BFI.reset(new BlockFrequencyInfo(F, *CGP.BPI, *CGP.LI)); in runOnFunction()
526 return CGP._run(F); in runOnFunction()
546 CodeGenPrepare CGP(TM); in run() local
[all …]
|
| /freebsd-14.2/share/misc/ |
| H A D | pci_vendors | 30235 15d9 0652 Dual Port i350 GbE MicroLP [AOC-CGP-i2]
|