diff options
| author | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-22 04:08:30 +0000 |
|---|---|---|
| committer | Misha Brukman <brukman+llvm@gmail.com> | 2005-04-22 04:08:30 +0000 |
| commit | 3c94497ec7852eccd68c1bc1663e8ac2a7bb1ab9 (patch) | |
| tree | 8ea25aedce956722659fcc377605a326d05c1015 /lib/Support/bzip2/compress.c | |
| parent | dedf2bd5a34dac25e4245f58bb902ced6b64edd9 (diff) | |
Convert tabs to spaces
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21440 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Support/bzip2/compress.c')
| -rw-r--r-- | lib/Support/bzip2/compress.c | 10 |
1 files changed, 5 insertions, 5 deletions
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]], |