lib/libz/trees.c

420     s->opt_len = s->static_len = 0L;
485  *     The length opt_len is updated; static_len is also updated if stree is
525         s->opt_len += (ulg)f * (bits + xbits);
558                 s->opt_len += ((long)bits - (long)tree[m].Len)
614  *     and corresponding code. The length opt_len is updated; static_len is
652         s->opt_len--; if (stree) s->static_len -= stree[node].Len;
812     /* opt_len now includes the length of the tree representations, except
823     /* Update opt_len to include the bit length tree and counts */
824     s->opt_len += 3*(max_blindex+1) + 5+5+4;
826             s->opt_len, s->static_len));
913     ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
925         Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
929         Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
931         /* At this point, opt_len and static_len are the total bit lengths of
941         opt_lenb = (s->opt_len+3+7)>>3;
945                 opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
987         s->compressed_len += 3 + s->opt_len;