142 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
241     ush bl_count[MAX_BITS+1];  in tr_static_init()  local
289     for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;  in tr_static_init()
291     while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
292     while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;  in tr_static_init()
293     while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;  in tr_static_init()
294     while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;  in tr_static_init()
299     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
503     for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
519         s->bl_count[bits]++;
534         while (s->bl_count[bits] == 0) bits--;
535         s->bl_count[bits]--;      /* move one leaf down the tree */
536         s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
537         s->bl_count[max_length]--;
550         n = s->bl_count[bits];
572 local void gen_codes (tree, max_code, bl_count)  in gen_codes()  argument
575     ushf *bl_count;            /* number of codes at each bit length */
586         code = (code + bl_count[bits-1]) << 1;
592     Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
696     gen_codes ((ct_data *)tree, max_code, s->bl_count);