Convert tabs to spaces
llvm-svn: 21440
diff --git a/llvm/lib/Support/Compressor.cpp b/llvm/lib/Support/Compressor.cpp
index 7396d4a..d2dc5e5 100644
--- a/llvm/lib/Support/Compressor.cpp
+++ b/llvm/lib/Support/Compressor.cpp
@@ -37,7 +37,8 @@
}
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/llvm/lib/Support/PluginLoader.cpp b/llvm/lib/Support/PluginLoader.cpp
index 85b2a31..799c125 100644
--- a/llvm/lib/Support/PluginLoader.cpp
+++ b/llvm/lib/Support/PluginLoader.cpp
@@ -31,5 +31,5 @@
}
if (!ErrorMessage.empty())
std::cerr << "Error opening '" << Filename << "': " << ErrorMessage
- << "\n -load request ignored.\n";
+ << "\n -load request ignored.\n";
}
diff --git a/llvm/lib/Support/bzip2/blocksort.c b/llvm/lib/Support/bzip2/blocksort.c
index aba3efc..218afed 100644
--- a/llvm/lib/Support/bzip2/blocksort.c
+++ b/llvm/lib/Support/bzip2/blocksort.c
@@ -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)) {
diff --git a/llvm/lib/Support/bzip2/bzlib.c b/llvm/lib/Support/bzip2/bzlib.c
index 2210c3a..ab35929 100644
--- a/llvm/lib/Support/bzip2/bzlib.c
+++ b/llvm/lib/Support/bzip2/bzlib.c
@@ -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;
diff --git a/llvm/lib/Support/bzip2/compress.c b/llvm/lib/Support/bzip2/compress.c
index 56501c1..f25622d 100644
--- a/llvm/lib/Support/bzip2/compress.c
+++ b/llvm/lib/Support/bzip2/compress.c
@@ -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]],