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