232     int bits;     /* bit counter */  in tr_static_init()  local
275     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;  in tr_static_init()
419     int bits;           /* bit length */  local
424     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
433         bits = tree[tree[n].Dad].Len + 1;
434         if (bits > max_length) bits = max_length, overflow++;
435         tree[n].Len = (ush)bits;
440         s->bl_count[bits]++;
444         s->opt_len += (ulg)f * (bits + xbits);
454         bits = max_length-1;
455         while (s->bl_count[bits] == 0) bits--;
456         s->bl_count[bits]--;      /* move one leaf down the tree */
457         s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
470     for (bits = max_length; bits != 0; bits--) {
471         n = s->bl_count[bits];
475             if (tree[m].Len != (unsigned) bits) {
476                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
477                 s->opt_len += ((long)bits - (long)tree[m].Len)
479                 tree[m].Len = (ush)bits;
501     int bits;                  /* bit index */  local
507     for (bits = 1; bits <= MAX_BITS; bits++) {
508         next_code[bits] = code = (code + bl_count[bits-1]) << 1;