144 local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
149 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
167 #  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)  argument
171 #  define send_code(s, c, tree) \  argument
173        send_bits(s, tree[c].Code, tree[c].Len); }
434 #define pqremove(s, tree, top) \  argument
438     pqdownheap(s, tree, SMALLEST); \
445 #define smaller(tree, n, m, depth) \  argument
446    (tree[n].Freq < tree[m].Freq || \
447    (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
455 local void pqdownheap(s, tree, k)  in pqdownheap()  argument
457     ct_data *tree;  /* the tree to restore */
465             smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
469         if (smaller(tree, v, s->heap[j], s->depth)) break;
494     ct_data *tree        = desc->dyn_tree;  local
512     tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
516         bits = tree[tree[n].Dad].Len + 1;
518         tree[n].Len = (ush)bits;
526         f = tree[n].Freq;
558             if ((unsigned) tree[m].Len != (unsigned) bits) {
559                 Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
560                 s->opt_len += ((long)bits - (long)tree[m].Len)
561                               *(long)tree[m].Freq;
562                 tree[m].Len = (ush)bits;
577 local void gen_codes (tree, max_code, bl_count)  in gen_codes()  argument
578     ct_data *tree;             /* the tree to decorate */  in gen_codes()
601         int len = tree[n].Len;
604         tree[n].Code = bi_reverse(next_code[len]++, len);
606         Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
607              n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
623     ct_data *tree         = desc->dyn_tree;  local
637         if (tree[n].Freq != 0) {
641             tree[n].Len = 0;
652         tree[node].Freq = 1;
662     for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
669         pqremove(s, tree, n);  /* n = node of least frequency */
676         tree[node].Freq = tree[n].Freq + tree[m].Freq;
679         tree[n].Dad = tree[m].Dad = (ush)node;
681         if (tree == s->bl_tree) {
683                     node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
688         pqdownheap(s, tree, SMALLEST);
700     gen_codes ((ct_data *)tree, max_code, s->bl_count);
707 local void scan_tree (s, tree, max_code)  in scan_tree()  argument
709     ct_data *tree;   /* the tree to be scanned */
715     int nextlen = tree[0].Len; /* length of next code */
721     tree[max_code+1].Len = (ush)0xffff; /* guard */
724         curlen = nextlen; nextlen = tree[n+1].Len;
752 local void send_tree (s, tree, max_code)  in send_tree()  argument
754     ct_data *tree; /* the tree to be scanned */
760     int nextlen = tree[0].Len; /* length of next code */
769         curlen = nextlen; nextlen = tree[n+1].Len;