[llvm-commits] CVS: llvm/utils/TableGen/DAGISelEmitter.cpp

Chris Lattner lattner at cs.uiuc.edu
Fri Mar 24 13:52:33 PST 2006



Changes in directory llvm/utils/TableGen:

DAGISelEmitter.cpp updated: 1.184 -> 1.185
---
Log message:

fix 80 column violations


---
Diffs of the changes:  (+6 -5)

 DAGISelEmitter.cpp |   11 ++++++-----
 1 files changed, 6 insertions(+), 5 deletions(-)


Index: llvm/utils/TableGen/DAGISelEmitter.cpp
diff -u llvm/utils/TableGen/DAGISelEmitter.cpp:1.184 llvm/utils/TableGen/DAGISelEmitter.cpp:1.185
--- llvm/utils/TableGen/DAGISelEmitter.cpp:1.184	Fri Mar 24 15:48:51 2006
+++ llvm/utils/TableGen/DAGISelEmitter.cpp	Fri Mar 24 15:52:20 2006
@@ -1138,7 +1138,7 @@
 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 @@
   /// 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 @@
     }
 
     // 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 @@
      << "    }\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






More information about the llvm-commits mailing list