void DAGISelEmitter::
FindPatternInputsAndOutputs(TreePattern *I, TreePatternNode *Pat,
std::map<std::string, TreePatternNode*> &InstInputs,
- std::map<std::string, TreePatternNode*> &InstResults,
+ std::map<std::string, TreePatternNode*>&InstResults,
std::vector<Record*> &InstImpInputs,
std::vector<Record*> &InstImpResults) {
if (Pat->isLeaf()) {
/// EmitResultCode - Emit the action for a pattern. Now that it has matched
/// we actually have to build a DAG!
std::pair<unsigned, unsigned>
- EmitResultCode(TreePatternNode *N, bool LikeLeaf = false, bool isRoot = false) {
+ EmitResultCode(TreePatternNode *N, bool LikeLeaf = false,
+ bool isRoot = false) {
// This is something selected from the pattern we matched.
if (!N->getName().empty()) {
std::string &Val = VariableMap[N->getName()];
}
// Print all declarations.
- for (std::set<std::pair<bool, std::string> >::iterator I = GeneratedDecl.begin(),
- E = GeneratedDecl.end(); I != E; ++I)
+ for (std::set<std::pair<bool, std::string> >::iterator
+ I = GeneratedDecl.begin(), E = GeneratedDecl.end(); I != E; ++I)
if (I->first)
OS << " SDNode *" << I->second << ";\n";
else
<< " }\n"
<< " return;\n"
<< " }\n"
- << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
+ << " case ISD::INLINEASM: Select_INLINEASM(Result, N); return;\n";
// Loop over all of the case statements, emiting a call to each method we