Lines Matching refs:bits
244 int bits; /* bit counter */ in tr_static_init() local
296 for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0; in tr_static_init()
505 int bits; /* bit length */ local
510 for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
519 bits = tree[tree[n].Dad].Len + 1;
520 if (bits > max_length) bits = max_length, overflow++;
521 tree[n].Len = (ush)bits;
526 s->bl_count[bits]++;
530 s->opt_len += (ulg)f * (bits + xbits);
540 bits = max_length-1;
541 while (s->bl_count[bits] == 0) bits--;
542 s->bl_count[bits]--; /* move one leaf down the tree */
543 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
556 for (bits = max_length; bits != 0; bits--) {
557 n = s->bl_count[bits];
561 if ((unsigned) tree[m].Len != (unsigned) bits) {
562 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
563 s->opt_len += ((long)bits - (long)tree[m].Len)
565 tree[m].Len = (ush)bits;
587 int bits; /* bit index */ local
593 for (bits = 1; bits <= MAX_BITS; bits++) {
594 next_code[bits] = code = (code + bl_count[bits-1]) << 1;