Remove trailing space

sed -Ei 's/[[:space:]]+$//' include/**/*.{def,h,td} lib/**/*.{cpp,h}

llvm-svn: 338293

1 files changed, 19 insertions, 19 deletions

diff --git a/llvm/lib/TableGen/StringMatcher.cpp b/llvm/lib/TableGen/StringMatcher.cpp
index 32599104f6a..2c4d1f33997 100644
--- a/llvm/lib/TableGen/StringMatcher.cpp
+++ b/llvm/lib/TableGen/StringMatcher.cpp
@@ -25,19 +25,19 @@ using namespace llvm;
 /// FindFirstNonCommonLetter - Find the first character in the keys of the
 /// string pairs that is not shared across the whole set of strings.  All
 /// strings are assumed to have the same length.
-static unsigned 
+static unsigned
 FindFirstNonCommonLetter(const std::vector<const
                               StringMatcher::StringPair*> &Matches) {
   assert(!Matches.empty());
   for (unsigned i = 0, e = Matches[0]->first.size(); i != e; ++i) {
     // Check to see if letter i is the same across the set.
     char Letter = Matches[0]->first[i];
-    
+
     for (unsigned str = 0, e = Matches.size(); str != e; ++str)
       if (Matches[str]->first[i] != Letter)
         return i;
   }
-  
+
   return Matches[0]->first.size();
 }
 
@@ -51,7 +51,7 @@ bool StringMatcher::EmitStringMatcherForChar(
     unsigned IndentCount, bool IgnoreDuplicates) const {
   assert(!Matches.empty() && "Must have at least one string to match!");
   std::string Indent(IndentCount * 2 + 4, ' ');
-  
+
   // If we have verified that the entire string matches, we're done: output the
   // matching code.
   if (CharNo == Matches[0]->first.size()) {
@@ -60,7 +60,7 @@ bool StringMatcher::EmitStringMatcherForChar(
 
     // If the to-execute code has \n's in it, indent each subsequent line.
     StringRef Code = Matches[0]->second;
-    
+
     std::pair<StringRef, StringRef> Split = Code.split('\n');
     OS << Indent << Split.first << "\t // \"" << Matches[0]->first << "\"\n";
 
@@ -72,20 +72,20 @@ bool StringMatcher::EmitStringMatcherForChar(
     }
     return false;
   }
-  
+
   // Bucket the matches by the character we are comparing.
   std::map<char, std::vector<const StringPair*>> MatchesByLetter;
-  
+
   for (unsigned i = 0, e = Matches.size(); i != e; ++i)
     MatchesByLetter[Matches[i]->first[CharNo]].push_back(Matches[i]);
-  
-  
+
+
   // If we have exactly one bucket to match, see how many characters are common
   // across the whole set and match all of them at once.
   if (MatchesByLetter.size() == 1) {
     unsigned FirstNonCommonLetter = FindFirstNonCommonLetter(Matches);
     unsigned NumChars = FirstNonCommonLetter-CharNo;
-    
+
     // Emit code to break out if the prefix doesn't match.
     if (NumChars == 1) {
       // Do the comparison with if (Str[1] != 'f')
@@ -105,13 +105,13 @@ bool StringMatcher::EmitStringMatcherForChar(
     return EmitStringMatcherForChar(Matches, FirstNonCommonLetter, IndentCount,
                                     IgnoreDuplicates);
   }
-  
+
   // Otherwise, we have multiple possible things, emit a switch on the
   // character.
   OS << Indent << "switch (" << StrVariableName << "[" << CharNo << "]) {\n";
   OS << Indent << "default: break;\n";
-  
-  for (std::map<char, std::vector<const StringPair*>>::iterator LI = 
+
+  for (std::map<char, std::vector<const StringPair*>>::iterator LI =
        MatchesByLetter.begin(), E = MatchesByLetter.end(); LI != E; ++LI) {
     // TODO: escape hard stuff (like \n) if we ever care about it.
     OS << Indent << "case '" << LI->first << "':\t // "
@@ -122,7 +122,7 @@ bool StringMatcher::EmitStringMatcherForChar(
                                  IgnoreDuplicates))
       OS << Indent << "  break;\n";
   }
-  
+
   OS << Indent << "}\n";
   return true;
 }
@@ -132,18 +132,18 @@ bool StringMatcher::EmitStringMatcherForChar(
 void StringMatcher::Emit(unsigned Indent, bool IgnoreDuplicates) const {
   // If nothing to match, just fall through.
   if (Matches.empty()) return;
-  
+
   // First level categorization: group strings by length.
   std::map<unsigned, std::vector<const StringPair*>> MatchesByLength;
-  
+
   for (unsigned i = 0, e = Matches.size(); i != e; ++i)
     MatchesByLength[Matches[i].first.size()].push_back(&Matches[i]);
-  
+
   // Output a switch statement on length and categorize the elements within each
   // bin.
   OS.indent(Indent*2+2) << "switch (" << StrVariableName << ".size()) {\n";
   OS.indent(Indent*2+2) << "default: break;\n";
-  
+
   for (std::map<unsigned, std::vector<const StringPair*>>::iterator LI =
        MatchesByLength.begin(), E = MatchesByLength.end(); LI != E; ++LI) {
     OS.indent(Indent*2+2) << "case " << LI->first << ":\t // "
@@ -152,6 +152,6 @@ void StringMatcher::Emit(unsigned Indent, bool IgnoreDuplicates) const {
     if (EmitStringMatcherForChar(LI->second, 0, Indent, IgnoreDuplicates))
       OS.indent(Indent*2+4) << "break;\n";
   }
-  
+
   OS.indent(Indent*2+2) << "}\n";
 }