Matt McCutchen's Web Site
/
rsync
/
rsync.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
a1f9949
)
Changed "Overflow" back to "overflow".
author
Wayne Davison
<wayned@samba.org>
Thu, 7 Jul 2005 20:16:41 +0000
(20:16 +0000)
committer
Wayne Davison
<wayned@samba.org>
Thu, 7 Jul 2005 20:16:41 +0000
(20:16 +0000)
zlib/trees.c
patch
|
blob
|
blame
|
history
diff --git
a/zlib/trees.c
b/zlib/trees.c
index
b830aa4
..
91dacdc
100644
(file)
--- a/
zlib/trees.c
+++ b/
zlib/trees.c
@@
-505,7
+505,7
@@
local void gen_bitlen(s, desc)
int bits; /* bit length */
int xbits; /* extra bits */
ush f; /* frequency */
int bits; /* bit length */
int xbits; /* extra bits */
ush f; /* frequency */
- int
O
verflow = 0; /* number of elements with bit length too large */
+ int
o
verflow = 0; /* number of elements with bit length too large */
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
@@
-517,7
+517,7
@@
local void gen_bitlen(s, desc)
for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
n = s->heap[h];
bits = tree[tree[n].Dad].Len + 1;
for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
n = s->heap[h];
bits = tree[tree[n].Dad].Len + 1;
- if (bits > max_length) bits = max_length,
O
verflow++;
+ if (bits > max_length) bits = max_length,
o
verflow++;
tree[n].Len = (ush)bits;
/* We overwrite tree[n].Dad which is no longer needed */
tree[n].Len = (ush)bits;
/* We overwrite tree[n].Dad which is no longer needed */
@@
-530,7
+530,7
@@
local void gen_bitlen(s, desc)
s->opt_len += (ulg)f * (bits + xbits);
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
}
s->opt_len += (ulg)f * (bits + xbits);
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
}
- if (
O
verflow == 0) return;
+ if (
o
verflow == 0) return;
Trace((stderr,"\nbit length overflow\n"));
/* This happens for example on obj2 and pic of the Calgary corpus */
Trace((stderr,"\nbit length overflow\n"));
/* This happens for example on obj2 and pic of the Calgary corpus */
@@
-545,8
+545,8
@@
local void gen_bitlen(s, desc)
/* The brother of the overflow item also moves one step up,
* but this does not affect bl_count[max_length]
*/
/* The brother of the overflow item also moves one step up,
* but this does not affect bl_count[max_length]
*/
-
O
verflow -= 2;
- } while (
O
verflow > 0);
+
o
verflow -= 2;
+ } while (
o
verflow > 0);
/* Now recompute all bit lengths, scanning in increasing frequency.
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
/* Now recompute all bit lengths, scanning in increasing frequency.
* h is still equal to HEAP_SIZE. (It is simpler to reconstruct all