diff options
author | Chris Lattner <sabre@nondot.org> | 2008-01-05 22:54:53 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2008-01-05 22:54:53 +0000 |
commit | 443e3f9dd61b8d0974bb13d484195ce1a9b7536c (patch) | |
tree | 10f3a110d27587cc0fc04cbdd72d1525d9f5e0de /utils/TableGen/DAGISelEmitter.cpp | |
parent | dc32f9802adc139e3d7ee5e25fe656b1d3999bc2 (diff) | |
download | llvm-443e3f9dd61b8d0974bb13d484195ce1a9b7536c.tar.gz llvm-443e3f9dd61b8d0974bb13d484195ce1a9b7536c.tar.bz2 llvm-443e3f9dd61b8d0974bb13d484195ce1a9b7536c.tar.xz |
move Node Transformation printing from CodeGenDAGPatterns -> DAGISelEmitter.
The only difference in output is that we now print them in alphabetical
order instead of reverse alphabetical order.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@45635 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils/TableGen/DAGISelEmitter.cpp')
-rw-r--r-- | utils/TableGen/DAGISelEmitter.cpp | 36 |
1 files changed, 35 insertions, 1 deletions
diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp index 89b41a4f31..8819538a2e 100644 --- a/utils/TableGen/DAGISelEmitter.cpp +++ b/utils/TableGen/DAGISelEmitter.cpp @@ -207,6 +207,39 @@ static bool PatternHasProperty(TreePatternNode *N, SDNP Property, } //===----------------------------------------------------------------------===// +// Node Transformation emitter implementation. +// +void DAGISelEmitter::EmitNodeTransforms(std::ostream &OS) { + // Walk the pattern fragments, adding them to a map, which sorts them by + // name. + typedef std::map<std::string, CodegenDAGPatterns::NodeXForm> NXsByNameTy; + NXsByNameTy NXsByName; + + for (CodegenDAGPatterns::nx_iterator I = CGP->nx_begin(), E = CGP->nx_end(); + I != E; ++I) + NXsByName.insert(std::make_pair(I->first->getName(), I->second)); + + OS << "\n// Node transformations.\n"; + + for (NXsByNameTy::iterator I = NXsByName.begin(), E = NXsByName.end(); + I != E; ++I) { + Record *SDNode = I->second.first; + std::string Code = I->second.second; + + if (Code.empty()) continue; // Empty code? Skip it. + + std::string ClassName = CGP->getSDNodeInfo(SDNode).getSDClassName(); + const char *C2 = ClassName == "SDNode" ? "N" : "inN"; + + OS << "inline SDOperand Transform_" << I->first << "(SDNode *" << C2 + << ") {\n"; + if (ClassName != "SDNode") + OS << " " << ClassName << " *N = cast<" << ClassName << ">(inN);\n"; + OS << Code << "\n}\n"; + } +} + +//===----------------------------------------------------------------------===// // Predicate emitter implementation. // @@ -2010,10 +2043,11 @@ OS << " unsigned NumKilled = ISelKilled.size();\n"; OS << " return Dummy.getValue();\n"; OS << "}\n"; - CodegenDAGPatterns CGP(Records, OS); + CodegenDAGPatterns CGP(Records); this->CGP = &CGP; + EmitNodeTransforms(OS); EmitPredicateFunctions(OS); DOUT << "\n\nALL PATTERNS TO MATCH:\n\n"; |