Lines Matching refs:tree
146 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
148 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
150 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
151 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
169 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
173 # define send_code(s, c, tree) \ argument
175 send_bits(s, tree[c].Code, tree[c].Len); }
437 #define pqremove(s, tree, top) \ argument
441 pqdownheap(s, tree, SMALLEST); \
448 #define smaller(tree, n, m, depth) \ argument
449 (tree[n].Freq < tree[m].Freq || \
450 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
458 local void pqdownheap(s, tree, k) in pqdownheap() argument
460 ct_data *tree; /* the tree to restore */
468 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
472 if (smaller(tree, v, s->heap[j], s->depth)) break;
497 ct_data *tree = desc->dyn_tree; local
515 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
519 bits = tree[tree[n].Dad].Len + 1;
521 tree[n].Len = (ush)bits;
529 f = tree[n].Freq;
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)
564 *(long)tree[m].Freq;
565 tree[m].Len = (ush)bits;
580 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
581 ct_data *tree; /* the tree to decorate */ in gen_codes()
604 int len = tree[n].Len;
607 tree[n].Code = bi_reverse(next_code[len]++, len);
609 Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
610 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
626 ct_data *tree = desc->dyn_tree; local
640 if (tree[n].Freq != 0) {
644 tree[n].Len = 0;
655 tree[node].Freq = 1;
665 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
672 pqremove(s, tree, n); /* n = node of least frequency */
679 tree[node].Freq = tree[n].Freq + tree[m].Freq;
682 tree[n].Dad = tree[m].Dad = (ush)node;
684 if (tree == s->bl_tree) {
686 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
691 pqdownheap(s, tree, SMALLEST);
703 gen_codes ((ct_data *)tree, max_code, s->bl_count);
710 local void scan_tree (s, tree, max_code) in scan_tree() argument
712 ct_data *tree; /* the tree to be scanned */
718 int nextlen = tree[0].Len; /* length of next code */
724 tree[max_code+1].Len = (ush)0xffff; /* guard */
727 curlen = nextlen; nextlen = tree[n+1].Len;
755 local void send_tree (s, tree, max_code) in send_tree() argument
757 ct_data *tree; /* the tree to be scanned */
763 int nextlen = tree[0].Len; /* length of next code */
772 curlen = nextlen; nextlen = tree[n+1].Len;