HomeSort by relevance Sort by last modified time
    Searched refs:CGP (Results 1 - 11 of 11) sorted by null

  /external/llvm/utils/TableGen/
DAGISelEmitter.h 27 CodeGenDAGPatterns CGP;
29 explicit DAGISelEmitter(RecordKeeper &R) : Records(R), CGP(R) {}
DAGISelEmitter.cpp 28 CodeGenDAGPatterns &CGP) {
35 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
40 Cost += getResultPatternCost(P->getChild(i), CGP);
47 CodeGenDAGPatterns &CGP) {
56 Cost += getResultPatternSize(P->getChild(i), CGP);
65 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
66 CodeGenDAGPatterns &CGP;
85 unsigned LHSSize = LHS->getPatternComplexity(CGP);
    [all...]
FastISelEmitter.h 29 CodeGenDAGPatterns CGP;
DAGISelMatcherGen.cpp 52 const CodeGenDAGPatterns &CGP;
97 MatcherGen(const PatternToMatch &pattern, const CodeGenDAGPatterns &cgp);
144 const CodeGenDAGPatterns &cgp)
145 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0),
173 TreePattern &TP = *CGP.pf_begin()->second;
211 const SDNodeInfo &NI = CGP.getSDNodeInfo(CGP.getSDNodeNamed("imm"));
270 const SDNodeInfo &CInfo = CGP.getSDNodeInfo(N->getOperator());
314 if (N->NodeHasProperty(SDNPMemOperand, CGP))
    [all...]
DAGISelMatcherOpt.cpp 26 const CodeGenDAGPatterns &CGP) {
35 ContractNodes(Child, CGP);
61 return ContractNodes(MatcherPtr, CGP);
70 return ContractNodes(MatcherPtr, CGP);
88 return ContractNodes(MatcherPtr, CGP);
108 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP))
118 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP))
149 ContractNodes(N->getNextPtr(), CGP);
168 return ContractNodes(MatcherPtr, CGP);
507 const CodeGenDAGPatterns &CGP) {
    [all...]
FastISelEmitter.cpp 375 void collectPatterns(CodeGenDAGPatterns &CGP);
382 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
383 return CGP.getSDNodeInfo(Op).getEnumName();
416 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) {
417 const CodeGenTarget &Target = CGP.getTargetInfo();
424 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
425 E = CGP.ptm_end(); I != E; ++I) {
435 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
487 std::string OpcodeName = getOpcodeName(InstPatOp, CGP);
855 const CodeGenTarget &Target = CGP.getTargetInfo()
    [all...]
DAGISelMatcherEmitter.cpp 35 const CodeGenDAGPatterns &CGP;
51 MatcherTableEmitter(const CodeGenDAGPatterns &cgp)
52 : CGP(cgp) {}
540 << SNT->getPattern().getPatternComplexity(CGP) << '\n';
568 << CM->getPattern().getPatternComplexity(CGP) << '\n';
615 for (CodeGenDAGPatterns::pf_iterator I = CGP.pf_begin(), E = CGP.pf_end();
687 CGP.getSDNodeTransform(NodeXForms[i]);
697 std::string ClassName = CGP.getSDNodeInfo(SDNode).getSDClassName()
    [all...]
CodeGenDAGPatterns.h 404 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
407 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
411 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
660 unsigned getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
CodeGenDAGPatterns.cpp 691 const CodeGenDAGPatterns &CGP) {
703 const ComplexPattern *AM = P->getComplexPatternInfo(CGP);
717 Size += getPatternSize(Child, CGP);
721 else if (Child->getComplexPatternInfo(CGP))
722 Size += getPatternSize(Child, CGP);
734 getPatternComplexity(const CodeGenDAGPatterns &CGP) const {
735 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity();
    [all...]
DAGISelMatcher.h 32 const CodeGenDAGPatterns &CGP);
33 Matcher *OptimizeMatcher(Matcher *Matcher, const CodeGenDAGPatterns &CGP);
34 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
    [all...]
  /external/llvm/lib/Analysis/IPA/
CallGraphSCCPass.cpp 535 CGPassManager *CGP;
538 CGP = (CGPassManager*)PMS.top();
545 CGP = new CGPassManager(PMD->getDepth() + 1);
549 TPM->addIndirectPassManager(CGP);
553 Pass *P = CGP;
557 PMS.push(CGP);
560 CGP->add(this);

Completed in 603 milliseconds