| /macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/ |
| H A D | DAGISelEmitter.cpp | 25 CodeGenDAGPatterns CGP; member in class:__anon10610::DAGISelEmitter
27 explicit DAGISelEmitter(RecordKeeper &R) : CGP(R) {}
40 CodeGenDAGPatterns &CGP) {
47 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
52 Cost += getResultPatternCost(P->getChild(i), CGP);
59 CodeGenDAGPatterns &CGP) {
68 Cost += getResultPatternSize(P->getChild(i), CGP);
77 PatternSortingPredicate(CodeGenDAGPatterns &cgp) : CGP(cgp) {}
78 CodeGenDAGPatterns &CGP; member in struct:__anon10611::PatternSortingPredicate
97 unsigned LHSSize = LHS->getPatternComplexity(CGP);
39 getResultPatternCost(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument
58 getResultPatternSize(TreePatternNode *P, CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | DAGISelMatcherGen.cpp | 52 const CodeGenDAGPatterns &CGP; member in class:__anon10614::MatcherGen
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))
320 if (N->NodeHasProperty(SDNPHasChain, CGP)) {
364 const SDNodeInfo &PInfo = CGP.getSDNodeInfo(Root->getOperator());
366 Root->getOperator() == CGP
645 mayInstNodeLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument
654 numNodesThatMayLoadOrStore(const TreePatternNode *N, const CodeGenDAGPatterns &CGP) argument
938 ConvertPatternToMatcher(const PatternToMatch &Pattern, unsigned Variant, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | 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) {
25 ContractNodes(OwningPtr<Matcher> &MatcherPtr, const CodeGenDAGPatterns &CGP) argument
506 OptimizeMatcher(Matcher *TheMatcher, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | FastISelEmitter.cpp | 381 void collectPatterns(CodeGenDAGPatterns &CGP);
387 static std::string getOpcodeName(Record *Op, CodeGenDAGPatterns &CGP) {
388 return CGP.getSDNodeInfo(Op).getEnumName();
421 void FastISelMap::collectPatterns(CodeGenDAGPatterns &CGP) {
422 const CodeGenTarget &Target = CGP.getTargetInfo();
429 for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(),
430 E = CGP.ptm_end(); I != E; ++I) {
440 CodeGenInstruction &II = CGP.getTargetInfo().getInstruction(Op);
492 std::string OpcodeName = getOpcodeName(InstPatOp, CGP);
862 CodeGenDAGPatterns CGP(R
[all...] |
| H A D | DAGISelMatcherEmitter.cpp | 35 const CodeGenDAGPatterns &CGP; member in class:__anon10613::MatcherTableEmitter
52 : CGP(cgp) {}
540 << SNT->getPattern().getPatternComplexity(CGP) << '\n';
568 << CM->getPattern().getPatternComplexity(CGP) << '\n';
614 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();
788 const CodeGenDAGPatterns &CGP,
795 MatcherTableEmitter MatcherEmitter(CGP);
787 EmitMatcherTable(const Matcher *TheMatcher, const CodeGenDAGPatterns &CGP, raw_ostream &O) argument
[all...] |
| H A D | CodeGenDAGPatterns.h | 405 getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const;
408 bool NodeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
412 bool TreeHasProperty(SDNP Property, const CodeGenDAGPatterns &CGP) const;
661 unsigned getPatternComplexity(const CodeGenDAGPatterns &CGP) const;
|
| H A D | CodeGenDAGPatterns.cpp | 690 const CodeGenDAGPatterns &CGP) {
702 const ComplexPattern *AM = P->getComplexPatternInfo(CGP);
716 Size += getPatternSize(Child, CGP);
720 else if (Child->getComplexPatternInfo(CGP))
721 Size += getPatternSize(Child, CGP);
733 getPatternComplexity(const CodeGenDAGPatterns &CGP) const {
734 return getPatternSize(getSrcPattern(), CGP) + getAddedComplexity();
1327 TreePatternNode::getComplexPatternInfo(const CodeGenDAGPatterns &CGP) const {
1332 return &CGP.getComplexPattern(DI->getDef());
1338 const CodeGenDAGPatterns &CGP) cons
689 getPatternSize(const TreePatternNode *P, const CodeGenDAGPatterns &CGP) argument
[all...] |
| H A D | DAGISelMatcher.h | 32 const CodeGenDAGPatterns &CGP);
33 Matcher *OptimizeMatcher(Matcher *Matcher, const CodeGenDAGPatterns &CGP);
34 void EmitMatcherTable(const Matcher *Matcher, const CodeGenDAGPatterns &CGP,
|
| /macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/IPA/ |
| H A D | CallGraphSCCPass.cpp | 538 CGPassManager *CGP; local
541 CGP = (CGPassManager*)PMS.top();
548 CGP = new CGPassManager();
552 TPM->addIndirectPassManager(CGP);
556 Pass *P = CGP;
560 PMS.push(CGP);
563 CGP->add(this);
|
| /macosx-10.10.1/emacs-93/emacs/leim/quail/ |
| H A D | hangul.el | 2314 ("gkr" ?$(CGP(B)
|