229     int bits;     /* bit counter */  in tr_static_init()  local
272     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;  in tr_static_init()
420     int bits;           /* bit length */  in gen_bitlen()  local
425     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;  in gen_bitlen()
434         bits = tree[tree[n].Dad].Len + 1;  in gen_bitlen()
435         if (bits > max_length) bits = max_length, overflow++;  in gen_bitlen()
436         tree[n].Len = (ush)bits;  in gen_bitlen()
441         s->bl_count[bits]++;  in gen_bitlen()
445         s->opt_len += (ulg)f * (bits + xbits);  in gen_bitlen()
455         bits = max_length-1;  in gen_bitlen()
456         while (s->bl_count[bits] == 0) bits--;  in gen_bitlen()
457         s->bl_count[bits]--;      /* move one leaf down the tree */  in gen_bitlen()
458         s->bl_count[bits+1] += 2; /* move one overflow item as its brother */  in gen_bitlen()
471     for (bits = max_length; bits != 0; bits--) {  in gen_bitlen()
472         n = s->bl_count[bits];  in gen_bitlen()
476             if (tree[m].Len != (unsigned) bits) {  in gen_bitlen()
477                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));  in gen_bitlen()
478                 s->opt_len += ((long)bits - (long)tree[m].Len)  in gen_bitlen()
480                 tree[m].Len = (ush)bits;  in gen_bitlen()
503     int bits;                  /* bit index */  in gen_codes()  local
509     for (bits = 1; bits <= MAX_BITS; bits++) {  in gen_codes()
510         next_code[bits] = code = (code + bl_count[bits-1]) << 1;  in gen_codes()