Convert tabs to spaces

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21440 91177308-0d34-0410-b5e6-96231b3b80d8

5 files changed, 10 insertions, 9 deletions

diff --git a/lib/Support/Compressor.cpp b/lib/Support/Compressor.cpp
index 7396d4ad25..d2dc5e50ab 100644
--- a/lib/Support/Compressor.cpp
+++ b/lib/Support/Compressor.cpp
@@ -37,7 +37,8 @@ static int getdata(char*& buffer, size_t &size,
 }
 
 static int getdata_uns(char*& buffer, unsigned &size,
-		       llvm::Compressor::OutputDataCallback* cb, void* context) {
+                       llvm::Compressor::OutputDataCallback* cb, void* context)
+{
   size_t SizeOut;
   int Res = getdata(buffer, SizeOut, cb, context);
   size = SizeOut;
diff --git a/lib/Support/PluginLoader.cpp b/lib/Support/PluginLoader.cpp
index 85b2a310e7..799c125658 100644
--- a/lib/Support/PluginLoader.cpp
+++ b/lib/Support/PluginLoader.cpp
@@ -31,5 +31,5 @@ void PluginLoader::operator=(const std::string &Filename) {
   }
   if (!ErrorMessage.empty())
     std::cerr << "Error opening '" << Filename << "': " << ErrorMessage
-              << "\n  -load request ignored.\n";	
+              << "\n  -load request ignored.\n";
 }
diff --git a/lib/Support/bzip2/blocksort.c b/lib/Support/bzip2/blocksort.c
index aba3efcd31..218afedf31 100644
--- a/lib/Support/bzip2/blocksort.c
+++ b/lib/Support/bzip2/blocksort.c
@@ -321,7 +321,7 @@ void fallbackSort ( UInt32* fmap,
       r = -1;
       while (1) {
 
-	 /*-- find the next non-singleton bucket --*/
+         /*-- find the next non-singleton bucket --*/
          k = r + 1;
          while (ISSET_BH(k) && UNALIGNED_BH(k)) k++;
          if (ISSET_BH(k)) {
diff --git a/lib/Support/bzip2/bzlib.c b/lib/Support/bzip2/bzlib.c
index 2210c3a464..ab35929017 100644
--- a/lib/Support/bzip2/bzlib.c
+++ b/lib/Support/bzip2/bzlib.c
@@ -470,7 +470,7 @@ int BZ_API(BZ2_bzCompress) ( bz_stream *strm, int action )
             return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
          } 
          else
-	 if (action == BZ_FLUSH) {
+         if (action == BZ_FLUSH) {
             s->avail_in_expect = strm->avail_in;
             s->mode = BZ_M_FLUSHING;
             goto preswitch;
diff --git a/lib/Support/bzip2/compress.c b/lib/Support/bzip2/compress.c
index 56501c1155..f25622da93 100644
--- a/lib/Support/bzip2/compress.c
+++ b/lib/Support/bzip2/compress.c
@@ -373,14 +373,14 @@ void sendMTFValues ( EState* s )
 
       /*---
         Set up an auxiliary length table which is used to fast-track
-	the common case (nGroups == 6). 
+        the common case (nGroups == 6). 
       ---*/
       if (nGroups == 6) {
          for (v = 0; v < alphaSize; v++) {
             s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v];
             s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v];
             s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v];
-	 }
+         }
       }
 
       nSelectors = 0;
@@ -429,7 +429,7 @@ void sendMTFValues ( EState* s )
             cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
 
          } else {
-	    /*--- slow version which correctly handles all situations ---*/
+            /*--- slow version which correctly handles all situations ---*/
             for (i = gs; i <= ge; i++) { 
                UInt16 icv = mtfv[i];
                for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv];
@@ -470,7 +470,7 @@ void sendMTFValues ( EState* s )
 #           undef BZ_ITUR
 
          } else {
-	    /*--- slow version which correctly handles all situations ---*/
+            /*--- slow version which correctly handles all situations ---*/
             for (i = gs; i <= ge; i++)
                s->rfreq[bt][ mtfv[i] ]++;
          }
@@ -621,7 +621,7 @@ void sendMTFValues ( EState* s )
 #           undef BZ_ITAH
 
       } else {
-	 /*--- slow version which correctly handles all situations ---*/
+         /*--- slow version which correctly handles all situations ---*/
          for (i = gs; i <= ge; i++) {
             bsW ( s, 
                   s->len  [s->selector[selCtr]] [mtfv[i]],