diff options
Diffstat (limited to 'trees.c')
-rw-r--r-- | trees.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -525,7 +525,7 @@ local void gen_bitlen(s, desc) | |||
525 | } | 525 | } |
526 | if (overflow == 0) return; | 526 | if (overflow == 0) return; |
527 | 527 | ||
528 | Trace((stderr,"\nbit length overflow\n")); | 528 | Tracev((stderr,"\nbit length overflow\n")); |
529 | /* This happens for example on obj2 and pic of the Calgary corpus */ | 529 | /* This happens for example on obj2 and pic of the Calgary corpus */ |
530 | 530 | ||
531 | /* Find the first bit length which could increase: */ | 531 | /* Find the first bit length which could increase: */ |
@@ -552,7 +552,7 @@ local void gen_bitlen(s, desc) | |||
552 | m = s->heap[--h]; | 552 | m = s->heap[--h]; |
553 | if (m > max_code) continue; | 553 | if (m > max_code) continue; |
554 | if ((unsigned) tree[m].Len != (unsigned) bits) { | 554 | if ((unsigned) tree[m].Len != (unsigned) bits) { |
555 | Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); | 555 | Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); |
556 | s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq; | 556 | s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq; |
557 | tree[m].Len = (ush)bits; | 557 | tree[m].Len = (ush)bits; |
558 | } | 558 | } |