Home
last modified time | relevance | path

Searched refs:CGP (Results 1 – 25 of 28) sorted by relevance

12

/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/GlobalISel/
H A Dsrem.i32.ll38 ; CGP-LABEL: v_srem_i32:
39 ; CGP: ; %bb.0:
109 ; CGP-LABEL: s_srem_i32:
110 ; CGP: ; %bb.0:
203 ; CGP-LABEL: v_srem_v2i32:
204 ; CGP: ; %bb.0:
349 ; CGP: ; %bb.0:
480 ; CGP: ; %bb.0:
626 ; CGP: ; %bb.0:
728 ; CGP: ; %bb.0:
[all …]
H A Dsdiv.i32.ll41 ; CGP-LABEL: v_sdiv_i32:
42 ; CGP: ; %bb.0:
118 ; CGP-LABEL: s_sdiv_i32:
119 ; CGP: ; %bb.0:
221 ; CGP-LABEL: v_sdiv_v2i32:
222 ; CGP: ; %bb.0:
379 ; CGP: ; %bb.0:
520 ; CGP: ; %bb.0:
679 ; CGP: ; %bb.0:
790 ; CGP: ; %bb.0:
[all …]
H A Dudiv.i32.ll32 ; CGP-LABEL: v_udiv_i32:
33 ; CGP: ; %bb.0:
37 ; CGP-NEXT: v_rcp_f32_e32 v2, v2
91 ; CGP-LABEL: s_udiv_i32:
92 ; CGP: ; %bb.0:
167 ; CGP-LABEL: v_udiv_v2i32:
168 ; CGP: ; %bb.0:
354 ; CGP: ; %bb.0:
437 ; CGP-LABEL: v_udiv_i32_24bit:
438 ; CGP: ; %bb.0:
[all …]
H A Durem.i32.ll30 ; CGP-LABEL: v_urem_i32:
31 ; CGP: ; %bb.0:
85 ; CGP-LABEL: s_urem_i32:
86 ; CGP: ; %bb.0:
155 ; CGP-LABEL: v_urem_v2i32:
156 ; CGP: ; %bb.0:
287 ; CGP: ; %bb.0:
391 ; CGP: ; %bb.0:
468 ; CGP-LABEL: v_urem_i32_24bit:
469 ; CGP: ; %bb.0:
[all …]
H A Durem.i64.ll613 ; CGP: ; %bb.0:
626 ; CGP-NEXT: ; %bb.1:
756 ; CGP-NEXT: ; %bb.3:
775 ; CGP-NEXT: .LBB2_4:
787 ; CGP-NEXT: .LBB2_6:
790 ; CGP-NEXT: .LBB2_7:
919 ; CGP-NEXT: .LBB2_8:
1354 ; CGP: ; %bb.0:
2040 ; CGP: ; %bb.0:
2055 ; CGP-NEXT: ; %bb.1:
[all …]
H A Dsdiv.i64.ll645 ; CGP: ; %bb.0:
658 ; CGP-NEXT: ; %bb.1:
795 ; CGP-NEXT: ; %bb.3:
816 ; CGP-NEXT: .LBB2_4:
828 ; CGP-NEXT: .LBB2_6:
831 ; CGP-NEXT: .LBB2_7:
967 ; CGP-NEXT: .LBB2_8:
1399 ; CGP: ; %bb.0:
2063 ; CGP: ; %bb.0:
2781 ; CGP: ; %bb.0:
[all …]
H A Dsrem.i64.ll635 ; CGP: ; %bb.0:
648 ; CGP-NEXT: ; %bb.1:
783 ; CGP-NEXT: ; %bb.3:
802 ; CGP-NEXT: .LBB2_4:
814 ; CGP-NEXT: .LBB2_6:
817 ; CGP-NEXT: .LBB2_7:
951 ; CGP-NEXT: .LBB2_8:
1377 ; CGP: ; %bb.0:
2033 ; CGP: ; %bb.0:
2742 ; CGP: ; %bb.0:
[all …]
H A Dudiv.i64.ll621 ; CGP: ; %bb.0:
634 ; CGP-NEXT: ; %bb.1:
765 ; CGP-NEXT: ; %bb.3:
786 ; CGP-NEXT: .LBB2_4:
798 ; CGP-NEXT: .LBB2_6:
801 ; CGP-NEXT: .LBB2_7:
931 ; CGP-NEXT: .LBB2_8:
1506 ; CGP: ; %bb.0:
1521 ; CGP-NEXT: ; %bb.1:
1654 ; CGP-NEXT: ; %bb.3:
[all …]
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DDAGISelEmitter.cpp28 CodeGenDAGPatterns CGP; member in __anon812e1f5e0111::DAGISelEmitter
43 CodeGenDAGPatterns &CGP) { in getResultPatternCost() argument
55 Cost += getResultPatternCost(P->getChild(i), CGP); in getResultPatternCost()
71 Cost += getResultPatternSize(P->getChild(i), CGP); in getResultPatternSize()
81 CodeGenDAGPatterns &CGP; member
98 int LHSSize = LHS->getPatternComplexity(CGP); in operator ()()
99 int RHSSize = RHS->getPatternComplexity(CGP); in operator ()()
145 E = CGP.ptm_end(); in run()
157 for (const PatternToMatch &PTM : CGP.ptms()) in run()
180 OptimizeMatcher(TheMatcher, CGP); in run()
[all …]
H A DDAGISelMatcherGen.cpp56 const CodeGenDAGPatterns &CGP; member in __anone4d064020111::MatcherGen
177 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes()
212 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode()
288 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed(Name)); in EmitLeafMatchCode()
300 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed(Name)); in EmitLeafMatchCode()
377 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode()
383 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode()
444 if (N->NodeHasProperty(SDNPOutGlue, CGP) && in EmitOperatorMatchCode()
457 N->NodeHasProperty(SDNPInGlue, CGP)) in EmitOperatorMatchCode()
776 if (mayInstNodeLoadOrStore(N, CGP)) in numNodesThatMayLoadOrStore()
[all …]
H A DDAGISelMatcherOpt.cpp25 const CodeGenDAGPatterns &CGP) { in ContractNodes() argument
34 ContractNodes(Child, CGP); in ContractNodes()
72 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
81 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
101 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP)) in ContractNodes()
111 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP)) in ContractNodes()
141 ContractNodes(N->getNextPtr(), CGP); in ContractNodes()
160 return ContractNodes(MatcherPtr, CGP); in ContractNodes()
468 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument
469 ContractNodes(MatcherPtr, CGP); in OptimizeMatcher()
H A DFastISelEmitter.cpp401 void collectPatterns(CodeGenDAGPatterns &CGP);
413 return std::string(CGP.getSDNodeInfo(Op).getEnumName()); in getOpcodeName()
443 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument
444 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns()
447 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns()
448 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns()
517 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns()
588 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns()
866 CodeGenDAGPatterns CGP(RK); in EmitFastISel() local
867 const CodeGenTarget &Target = CGP.getTargetInfo(); in EmitFastISel()
[all …]
H A DDAGISelMatcherEmitter.cpp47 const CodeGenDAGPatterns &CGP; member in __anon4ae81c620211::MatcherTableEmitter
83 MatcherTableEmitter(const CodeGenDAGPatterns &cgp) : CGP(cgp) { in MatcherTableEmitter()
818 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
853 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher()
1004 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions()
1015 std::string(CGP.getSDNodeInfo(SDNode).getSDClassName()); in EmitPredicateFunctions()
1091 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument
1123 MatcherTableEmitter MatcherEmitter(CGP); in EmitMatcherTable()
H A DCodeGenDAGPatterns.h778 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
784 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const;
787 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
791 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
1098 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
H A DCodeGenDAGPatterns.cpp1475 Size += getPatternSize(Child, CGP); in getPatternSize()
1482 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize()
1483 Size += getPatternSize(Child, CGP); in getPatternSize()
1497 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity()
2373 return &CGP.getComplexPattern(Rec); in getComplexPatternInfo()
2378 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in getNumMIResults()
2399 if (const ComplexPattern *CP = getComplexPatternInfo(CGP)) in NodeHasProperty()
2409 if (const CodeGenIntrinsic *Int = getIntrinsicInfo(CGP)) in NodeHasProperty()
2416 return CGP.getSDNodeInfo(Operator).hasProperty(Property); in NodeHasProperty()
2426 if (NodeHasProperty(Property, CGP)) in TreeHasProperty()
[all …]
H A DDAGISelMatcher.h31 const CodeGenDAGPatterns &CGP);
33 const CodeGenDAGPatterns &CGP);
34 void EmitMatcherTable(Matcher *Matcher, const CodeGenDAGPatterns &CGP,
H A DGlobalISelEmitter.cpp3566 const CodeGenDAGPatterns CGP; member in __anoncee47b830111::GlobalISelEmitter
3802 : RK(RK), CGP(RK), Target(CGP.getTargetInfo()), in GlobalISelEmitter()
4145 const CodeGenIntrinsic *II = Src->getIntrinsicInfo(CGP); in createAndImportSelDAGMatcher()
4257 auto &ChildSDNI = CGP.getSDNodeInfo(SrcChild->getOperator()); in importChildMatcher()
4480 auto &ChildSDNI = CGP.getSDNodeInfo(DstChild->getOperator()); in importExplicitUseRenderer()
4923 CGP.operandHasDefault(DstI->Operands[NonOverridableOperands - 1].Rec)) in importExplicitUseRenderers()
4934 if (CGP.operandHasDefault(OperandNode) && in importExplicitUseRenderers()
5157 int Score = P.getPatternComplexity(CGP); in runOnPattern()
5697 for (const PatternToMatch &Pat : CGP.ptms()) { in run()
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dand-sink.ll16 ; CHECK-CGP-NOT: and i32
20 ; CHECK-CGP-LABEL: bb0:
21 ; CHECK-CGP: and i32
23 ; CHECK-CGP-NEXT: store
24 ; CHECK-CGP-NEXT: br
50 ; CHECK-CGP-LABEL: bb0:
52 ; CHECK-CGP-NOT: icmp
57 ; CHECK-CGP-LABEL: bb1:
58 ; CHECK-CGP: and i32
60 ; CHECK-CGP-NEXT: store
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A Dand-sink.ll32 ; CHECK-CGP-LABEL: bb0:
33 ; CHECK-CGP: and i32
35 ; CHECK-CGP-NEXT: store
36 ; CHECK-CGP-NEXT: br
82 ; CHECK-CGP-NOT: icmp
88 ; CHECK-CGP: and i32
91 ; CHECK-CGP-NEXT: br
120 ; CHECK-CGP: load i32
170 ; CHECK-CGP: and i32
176 ; CHECK-CGP: and i32
[all …]
H A Dtailcall-cgp-dup.ll5 ; Teach CGP to dup returns to enable tail call optimization.
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DCallGraphSCCPass.cpp627 CGPassManager *CGP; in assignPassManager() local
630 CGP = (CGPassManager*)PMS.top(); in assignPassManager()
637 CGP = new CGPassManager(); in assignPassManager()
641 TPM->addIndirectPassManager(CGP); in assignPassManager()
645 Pass *P = CGP; in assignPassManager()
649 PMS.push(CGP); in assignPassManager()
652 CGP->add(this); in assignPassManager()
/llvm-project-15.0.7/llvm/test/CodeGen/NVPTX/
H A Dbranch-fold.ll4 ; Disable CGP which also folds branches, so that only BranchFolding is under
/llvm-project-15.0.7/llvm/test/CodeGen/SystemZ/
H A Dcodegenprepare-sink-and-for-tm.ll4 ; CGP will duplicate and sink the 'icmp' to the users. Test that it does the
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Dzextload.ll19 ; When CGP moves a zext Z of a load L to the block where L lives, Z should not
H A Dcodegenprep-addrsink.ll3 ; CGP duplicates address calculation into each basic block that contains loads

12