Lines Matching refs:tree
140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
145 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
167 send_bits(s, tree[c].Code, tree[c].Len); }
430 #define pqremove(s, tree, top) \ argument
434 pqdownheap(s, tree, SMALLEST); \
441 #define smaller(tree, n, m, depth) \ argument
442 (tree[n].Freq < tree[m].Freq || \
443 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
451 local void pqdownheap(s, tree, k) in pqdownheap() argument
453 ct_data *tree; /* the tree to restore */
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
465 if (smaller(tree, v, s->heap[j], s->depth)) break;
490 ct_data *tree = desc->dyn_tree; local
508 tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
512 bits = tree[tree[n].Dad].Len + 1;
514 tree[n].Len = (ush)bits;
522 f = tree[n].Freq;
554 if ((unsigned) tree[m].Len != (unsigned) bits) {
555 Tracev((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
556 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq;
557 tree[m].Len = (ush)bits;
572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
573 ct_data *tree; /* the tree to decorate */ in gen_codes()
597 int len = tree[n].Len;
600 tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
602 Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
603 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
619 ct_data *tree = desc->dyn_tree; local
633 if (tree[n].Freq != 0) {
637 tree[n].Len = 0;
648 tree[node].Freq = 1;
658 for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
665 pqremove(s, tree, n); /* n = node of least frequency */
672 tree[node].Freq = tree[n].Freq + tree[m].Freq;
675 tree[n].Dad = tree[m].Dad = (ush)node;
677 if (tree == s->bl_tree) {
679 node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
684 pqdownheap(s, tree, SMALLEST);
696 gen_codes ((ct_data *)tree, max_code, s->bl_count);
703 local void scan_tree (s, tree, max_code) in scan_tree() argument
705 ct_data *tree; /* the tree to be scanned */
711 int nextlen = tree[0].Len; /* length of next code */
717 tree[max_code+1].Len = (ush)0xffff; /* guard */
720 curlen = nextlen; nextlen = tree[n+1].Len;
748 local void send_tree (s, tree, max_code) in send_tree() argument
750 ct_data *tree; /* the tree to be scanned */
756 int nextlen = tree[0].Len; /* length of next code */
765 curlen = nextlen; nextlen = tree[n+1].Len;