[llvm-commits] CVS: llvm/lib/Support/bzip2/blocksort.c bzlib.c compress.c

Misha Brukman brukman at cs.uiuc.edu
Thu Apr 21 21:08:41 PDT 2005



Changes in directory llvm/lib/Support/bzip2:

blocksort.c updated: 1.1 -> 1.2
bzlib.c updated: 1.1 -> 1.2
compress.c updated: 1.1 -> 1.2
---
Log message:

Convert tabs to spaces


---
Diffs of the changes:  (+7 -7)

 blocksort.c |    2 +-
 bzlib.c     |    2 +-
 compress.c  |   10 +++++-----
 3 files changed, 7 insertions(+), 7 deletions(-)


Index: llvm/lib/Support/bzip2/blocksort.c
diff -u llvm/lib/Support/bzip2/blocksort.c:1.1 llvm/lib/Support/bzip2/blocksort.c:1.2
--- llvm/lib/Support/bzip2/blocksort.c:1.1	Thu Nov 25 10:11:36 2004
+++ llvm/lib/Support/bzip2/blocksort.c	Thu Apr 21 23:08:30 2005
@@ -321,7 +321,7 @@
       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)) {


Index: llvm/lib/Support/bzip2/bzlib.c
diff -u llvm/lib/Support/bzip2/bzlib.c:1.1 llvm/lib/Support/bzip2/bzlib.c:1.2
--- llvm/lib/Support/bzip2/bzlib.c:1.1	Thu Nov 25 10:11:36 2004
+++ llvm/lib/Support/bzip2/bzlib.c	Thu Apr 21 23:08:30 2005
@@ -470,7 +470,7 @@
             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;


Index: llvm/lib/Support/bzip2/compress.c
diff -u llvm/lib/Support/bzip2/compress.c:1.1 llvm/lib/Support/bzip2/compress.c:1.2
--- llvm/lib/Support/bzip2/compress.c:1.1	Thu Nov 25 10:11:36 2004
+++ llvm/lib/Support/bzip2/compress.c	Thu Apr 21 23:08:30 2005
@@ -373,14 +373,14 @@
 
       /*---
         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 @@
             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 @@
 #           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 @@
 #           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]],






More information about the llvm-commits mailing list