diff options
| author | Chris Lattner <sabre@nondot.org> | 2006-03-24 21:52:20 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2006-03-24 21:52:20 +0000 |
| commit | 947604b0e28ddec8e35b1199c7e718537312a5a8 (patch) | |
| tree | 0b2b1bfb7dd30a6b0003d0c005b5f071e832c5b4 /utils | |
| parent | ac53eadc29cbfa5da6700fef84dcc3cb1f6b31ce (diff) | |
| download | llvm-947604b0e28ddec8e35b1199c7e718537312a5a8.tar.gz llvm-947604b0e28ddec8e35b1199c7e718537312a5a8.tar.bz2 llvm-947604b0e28ddec8e35b1199c7e718537312a5a8.tar.xz | |
fix 80 column violations
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@27084 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'utils')
| -rw-r--r-- | utils/TableGen/DAGISelEmitter.cpp | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/utils/TableGen/DAGISelEmitter.cpp b/utils/TableGen/DAGISelEmitter.cpp index 8dd9eba5ed..b053dbddc1 100644 --- a/utils/TableGen/DAGISelEmitter.cpp +++ b/utils/TableGen/DAGISelEmitter.cpp @@ -1138,7 +1138,7 @@ static bool HandleUse(TreePattern *I, TreePatternNode *Pat, 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()) { @@ -2220,7 +2220,8 @@ public: /// 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()]; @@ -3056,8 +3057,8 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) { } // 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 @@ -3226,7 +3227,7 @@ void DAGISelEmitter::EmitInstructionSelector(std::ostream &OS) { << " }\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 |