/external/llvm/utils/TableGen/ |
D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in __anon4225247b0111::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 | 50 const CodeGenDAGPatterns &CGP; member in __anon19352fff0111::MatcherGen 149 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), in MatcherGen() 177 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes() 210 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode() 305 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); in EmitOperatorMatchCode() 349 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode() 355 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode() 399 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); in EmitOperatorMatchCode() 401 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || in EmitOperatorMatchCode() 402 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || in EmitOperatorMatchCode() [all …]
|
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() 446 const CodeGenDAGPatterns &CGP) { in OptimizeMatcher() argument 447 ContractNodes(MatcherPtr, CGP); in OptimizeMatcher()
|
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() 440 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument 441 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns() 448 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns() 449 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns() 459 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op); in collectPatterns() 511 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns() 584 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() [all …]
|
D | DAGISelMatcherEmitter.cpp | 36 const CodeGenDAGPatterns &CGP; member in __anon7c9c9edf0211::MatcherTableEmitter 57 : CGP(cgp) {} in MatcherTableEmitter() 589 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher() 608 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher() 723 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions() 733 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); in EmitPredicateFunctions() 825 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument 832 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/swiftshader/third_party/llvm-7.0/llvm/utils/TableGen/ |
D | DAGISelEmitter.cpp | 27 CodeGenDAGPatterns CGP; member in __anon8e44fb130111::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 | 56 const CodeGenDAGPatterns &CGP; member in __anon5aa09f970111::MatcherGen 149 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0), in MatcherGen() 177 TreePattern &TP = *CGP.pf_begin()->second; in InferPossibleTypes() 212 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm")); in EmitLeafMatchCode() 308 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator()); in EmitOperatorMatchCode() 352 if (N->NodeHasProperty(SDNPMemOperand, CGP)) in EmitOperatorMatchCode() 358 if (N->NodeHasProperty(SDNPHasChain, CGP)) { in EmitOperatorMatchCode() 402 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator()); in EmitOperatorMatchCode() 404 Root->getOperator() == CGP.get_intrinsic_void_sdnode() || in EmitOperatorMatchCode() 405 Root->getOperator() == CGP.get_intrinsic_w_chain_sdnode() || in EmitOperatorMatchCode() [all …]
|
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()
|
D | FastISelEmitter.cpp | 405 void collectPatterns(CodeGenDAGPatterns &CGP); 416 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) { in getOpcodeName() argument 417 return CGP.getSDNodeInfo(Op).getEnumName(); in getOpcodeName() 447 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) { in collectPatterns() argument 448 const CodeGenTarget &Target = CGP.getTargetInfo(); in collectPatterns() 451 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), in collectPatterns() 452 E = CGP.ptm_end(); I != E; ++I) { in collectPatterns() 462 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op); in collectPatterns() 521 std::string OpcodeName = getOpcodeName(InstPatOp, CGP); in collectPatterns() 593 int complexity = Pattern.getPatternComplexity(CGP); in collectPatterns() [all …]
|
D | DAGISelMatcherEmitter.cpp | 49 const CodeGenDAGPatterns &CGP; member in __anon5ee61a770211::MatcherTableEmitter 83 : CGP(cgp) {} in MatcherTableEmitter() 721 << SNT->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher() 756 << CM->getPattern().getPatternComplexity(CGP) << '\n'; in EmitMatcher() 895 CGP.getSDNodeTransform(NodeXForms[i]); in EmitPredicateFunctions() 905 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName(); in EmitPredicateFunctions() 1003 const CodeGenDAGPatterns &CGP, in EmitMatcherTable() argument 1035 MatcherTableEmitter MatcherEmitter(CGP); in EmitMatcherTable()
|
D | CodeGenDAGPatterns.h | 690 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const; 696 unsigned getNumMIResults(const CodeGenDAGPatterns &CGP) const; 699 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const; 703 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const; 1052 int getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
D | CodeGenDAGPatterns.cpp | 1259 const CodeGenDAGPatterns &CGP) { in getPatternSize() argument 1266 if (const ComplexPattern *AM = P->getComplexPatternInfo(CGP)) { in getPatternSize() 1285 Size += getPatternSize(Child, CGP); in getPatternSize() 1292 else if (Child->getComplexPatternInfo(CGP)) in getPatternSize() 1293 Size += getPatternSize(Child, CGP); in getPatternSize() 1305 getPatternComplexity(const CodeGenDAGPatterns &CGP) const { in getPatternComplexity() 1306 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity(); in getPatternComplexity() 2113 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const { in getComplexPatternInfo() 2125 return &CGP.getComplexPattern(Rec); in getComplexPatternInfo() 2128 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/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/ |
D | and-sink.ll | 2 ; RUN: opt -S -codegenprepare -mtriple=aarch64-linux %s | FileCheck --check-prefix=CHECK-CGP %s 15 ; CHECK-CGP-LABEL: @and_sink1( 16 ; CHECK-CGP-NOT: and i32 20 ; CHECK-CGP-LABEL: bb0: 21 ; CHECK-CGP: and i32 22 ; CHECK-CGP-NEXT: icmp eq i32 23 ; CHECK-CGP-NEXT: store 24 ; CHECK-CGP-NEXT: br 44 ; CHECK-CGP-LABEL: @and_sink2( 45 ; CHECK-CGP-NOT: and i32 [all …]
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/ |
D | and-sink.ll | 3 …opt < %s -codegenprepare -S -mtriple=x86_64-unknown-unknown | FileCheck --check-prefix=CHECK-CGP %s 27 ; CHECK-CGP-LABEL: @and_sink1( 28 ; CHECK-CGP-NOT: and i32 32 ; CHECK-CGP-LABEL: bb0: 33 ; CHECK-CGP: and i32 34 ; CHECK-CGP-NEXT: icmp eq i32 35 ; CHECK-CGP-NEXT: store 36 ; CHECK-CGP-NEXT: br 74 ; CHECK-CGP-LABEL: @and_sink2( 75 ; CHECK-CGP-NOT: and i32 [all …]
|
D | tailcall-cgp-dup.ll | 3 ; Teach CGP to dup returns to enable tail call optimization.
|
/external/llvm/lib/Analysis/ |
D | CallGraphSCCPass.cpp | 556 CGPassManager *CGP; in assignPassManager() local 559 CGP = (CGPassManager*)PMS.top(); in assignPassManager() 566 CGP = new CGPassManager(); in assignPassManager() 570 TPM->addIndirectPassManager(CGP); in assignPassManager() 574 Pass *P = CGP; in assignPassManager() 578 PMS.push(CGP); in assignPassManager() 581 CGP->add(this); in assignPassManager()
|
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
D | CallGraphSCCPass.cpp | 564 CGPassManager *CGP; in assignPassManager() local 567 CGP = (CGPassManager*)PMS.top(); in assignPassManager() 574 CGP = new CGPassManager(); in assignPassManager() 578 TPM->addIndirectPassManager(CGP); in assignPassManager() 582 Pass *P = CGP; in assignPassManager() 586 PMS.push(CGP); in assignPassManager() 589 CGP->add(this); in assignPassManager()
|
/external/swiftshader/third_party/llvm-7.0/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/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/swiftshader/third_party/llvm-7.0/llvm/test/DebugInfo/X86/ |
D | zextload.ll | 19 ; When CGP moves a zext Z of a load L to the block where L lives, Z should not
|