| /freebsd-12-stable/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | DAGISelEmitter.cpp | 26 CodeGenDAGPatterns CGP; member in class:__anon5910::DAGISelEmitter
28 explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {}
41 CodeGenDAGPatterns &CGP) {
48 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
53 Cost += getResultPatternCost(P->getChild(i), CGP);
60 CodeGenDAGPatterns &CGP) {
69 Cost += getResultPatternSize(P->getChild(i), CGP);
78 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
79 CodeGenDAGPatterns &CGP; member in struct:__anon5911::PatternSortingPredicate
96 int LHSSize = LHS->getPatternComplexity(CGP);
40 getResultPatternCost(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument
59 getResultPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | DAGISelMatcherGen.cpp | 55 const CodeGenDAGPatterns &CGP; member in class:__anon5914::MatcherGen
148 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0),
176 TreePattern &TP = *CGP.pf_begin()->second;
211 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm"));
285 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("build_vector"));
295 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("build_vector"));
328 const SDNodeInfo &CInfo = CGP
730 mayInstNodeLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument
739 numNodesThatMayLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument
1065 ConvertPatternToMatcher(const PatternToMatch &Pattern, unsigned Variant, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | DAGISelMatcherOpt.cpp | 25 const CodeGenDAGPatterns &CGP) {
34 ContractNodes(Child, CGP);
72 return ContractNodes(MatcherPtr, CGP);
81 return ContractNodes(MatcherPtr, CGP);
101 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP))
111 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP))
141 ContractNodes(N->getNextPtr(), CGP);
160 return ContractNodes(MatcherPtr, CGP);
468 const CodeGenDAGPatterns &CGP) {
469 ContractNodes(MatcherPtr, CGP);
24 ContractNodes(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument
467 OptimizeMatcher(std::unique_ptr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | FastISelEmitter.cpp | 405 void collectPatterns(CodeGenDAGPatterns &CGP);
416 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
417 return CGP.getSDNodeInfo(Op).getEnumName();
447 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) {
448 const CodeGenTarget &Target = CGP.getTargetInfo();
451 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
452 E = CGP.ptm_end(); I != E; ++I) {
462 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
521 std::string OpcodeName = getOpcodeName(InstPatOp, CGP);
593 int complexity = Pattern.getPatternComplexity(CGP);
[all...] |
| H A D | DAGISelMatcherEmitter.cpp | 48 const CodeGenDAGPatterns &CGP; member in class:__anon5913::MatcherTableEmitter
83 : CGP(cgp) {}
767 << SNT->getPattern().getPatternComplexity(CGP) << '\n';
802 << CM->getPattern().getPatternComplexity(CGP) << '\n';
953 CGP.getSDNodeTransform(NodeXForms[i]);
963 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName();
1064 const CodeGenDAGPatterns &CGP,
1096 MatcherTableEmitter MatcherEmitter(CGP);
|
| H A D | CodeGenDAGPatterns.h | 776 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
782 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;
785 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
789 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
1141 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| H A D | CodeGenDAGPatterns.cpp | 1369 const CodeGenDAGPatterns &CGP) {
1376 if (const ComplexPattern *AM = P->getComplexPatternInfo(CGP)) {
1395 Size += getPatternSize(Child, CGP);
1402 else if (Child->getComplexPatternInfo(CGP))
1403 Size += getPatternSize(Child, CGP);
1417 getPatternComplexity(const CodeGenDAGPatterns &CGP) const {
1418 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity();
2247 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
2259 return &CGP.getComplexPattern(Rec);
2262 unsigned TreePatternNode::getNumMIResults(const CodeGenDAGPatterns &CGP) cons
1368 getPatternSize(const TreePatternNode *P, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | DAGISelMatcher.h | 31 const CodeGenDAGPatterns &CGP);
33 const CodeGenDAGPatterns &CGP);
34 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| H A D | GlobalISelEmitter.cpp | 3270 const CodeGenDAGPatterns CGP;
3479 : RK(RK), CGP(RK), Target(CGP.getTargetInfo()),
3751 const CodeGenIntrinsic *II = Src->getIntrinsicInfo(CGP);
3852 auto &ChildSDNI = CGP.getSDNodeInfo(SrcChild->getOperator());
4019 auto &ChildSDNI = CGP.getSDNodeInfo(DstChild->getOperator());
4398 CGP.operandHasDefault(DstI->Operands[NonOverridableOperands - 1].Rec))
4409 if (CGP.operandHasDefault(OperandNode) &&
4620 int Score = P.getPatternComplexity(CGP);
5116 for (const PatternToMatch &Pat : CGP
[all...] |
| /freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | CallGraphSCCPass.cpp | 575 CGPassManager *CGP; local
578 CGP = (CGPassManager*)PMS.top();
585 CGP = new CGPassManager();
589 TPM->addIndirectPassManager(CGP);
593 Pass *P = CGP;
597 PMS.push(CGP);
600 CGP->add(this);
|