tree 529 net/pf.c pf_find_state(struct pfi_kif *kif, struct pf_state_key_cmp *key, u_int8_t tree)
tree 536 net/pf.c switch (tree) {
tree 559 net/pf.c pf_find_state_all(struct pf_state_key_cmp *key, u_int8_t tree, int *more)
tree 566 net/pf.c switch (tree) {
tree 786 net/pf.c pf_stateins_err(const char *tree, struct pf_state *s, struct pfi_kif *kif)
tree 791 net/pf.c printf("pf: state insert failed: %s %s", tree, kif->pfik_name);
tree 280 net/pf_norm.c pf_find_fragment(struct ip *ip, struct pf_frag_tree *tree)
tree 287 net/pf_norm.c frag = RB_FIND(pf_frag_tree, tree, &key);
tree 1584 net/zlib.c local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
tree 1586 net/zlib.c local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
tree 1588 net/zlib.c local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
tree 1589 net/zlib.c local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
tree 1603 net/zlib.c # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
tree 1607 net/zlib.c # define send_code(s, c, tree) \
tree 1609 net/zlib.c send_bits(s, tree[c].Code, tree[c].Len); }
tree 1804 net/zlib.c #define pqremove(s, tree, top) \
tree 1808 net/zlib.c pqdownheap(s, tree, SMALLEST); \
tree 1815 net/zlib.c #define smaller(tree, n, m, depth) \
tree 1816 net/zlib.c (tree[n].Freq < tree[m].Freq || \
tree 1817 net/zlib.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
tree 1825 net/zlib.c local void pqdownheap(s, tree, k)
tree 1827 net/zlib.c ct_data *tree; /* the tree to restore */
tree 1835 net/zlib.c smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
tree 1839 net/zlib.c if (smaller(tree, v, s->heap[j], s->depth)) break;
tree 1864 net/zlib.c ct_data *tree = desc->dyn_tree;
tree 1882 net/zlib.c tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
tree 1886 net/zlib.c bits = tree[tree[n].Dad].Len + 1;
tree 1888 net/zlib.c tree[n].Len = (ush)bits;
tree 1896 net/zlib.c f = tree[n].Freq;
tree 1928 net/zlib.c if (tree[m].Len != (unsigned) bits) {
tree 1929 net/zlib.c Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
tree 1930 net/zlib.c s->opt_len += ((long)bits - (long)tree[m].Len)
tree 1931 net/zlib.c *(long)tree[m].Freq;
tree 1932 net/zlib.c tree[m].Len = (ush)bits;
tree 1947 net/zlib.c local void gen_codes (tree, max_code, bl_count)
tree 1948 net/zlib.c ct_data *tree; /* the tree to decorate */
tree 1971 net/zlib.c int len = tree[n].Len;
tree 1974 net/zlib.c tree[n].Code = bi_reverse(next_code[len]++, len);
tree 1976 net/zlib.c Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
tree 1977 net/zlib.c n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
tree 1993 net/zlib.c ct_data *tree = desc->dyn_tree;
tree 2007 net/zlib.c if (tree[n].Freq != 0) {
tree 2011 net/zlib.c tree[n].Len = 0;
tree 2022 net/zlib.c tree[node].Freq = 1;
tree 2032 net/zlib.c for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
tree 2039 net/zlib.c pqremove(s, tree, n); /* n = node of least frequency */
tree 2046 net/zlib.c tree[node].Freq = tree[n].Freq + tree[m].Freq;
tree 2048 net/zlib.c tree[n].Dad = tree[m].Dad = (ush)node;
tree 2050 net/zlib.c if (tree == s->bl_tree) {
tree 2052 net/zlib.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
tree 2057 net/zlib.c pqdownheap(s, tree, SMALLEST);
tree 2069 net/zlib.c gen_codes ((ct_data *)tree, max_code, s->bl_count);
tree 2076 net/zlib.c local void scan_tree (s, tree, max_code)
tree 2078 net/zlib.c ct_data *tree; /* the tree to be scanned */
tree 2084 net/zlib.c int nextlen = tree[0].Len; /* length of next code */
tree 2090 net/zlib.c tree[max_code+1].Len = (ush)0xffff; /* guard */
tree 2093 net/zlib.c curlen = nextlen; nextlen = tree[n+1].Len;
tree 2121 net/zlib.c local void send_tree (s, tree, max_code)
tree 2123 net/zlib.c ct_data *tree; /* the tree to be scanned */
tree 2129 net/zlib.c int nextlen = tree[0].Len; /* length of next code */
tree 2138 net/zlib.c curlen = nextlen; nextlen = tree[n+1].Len;
tree 4121 net/zlib.c inflate_huft *tree; /* pointer into tree */
tree 4199 net/zlib.c c->sub.code.tree = c->ltree;
tree 4204 net/zlib.c t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
tree 4226 net/zlib.c c->sub.code.tree = t->next;
tree 4245 net/zlib.c c->sub.code.tree = c->dtree;
tree 4251 net/zlib.c t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
tree 4264 net/zlib.c c->sub.code.tree = t->next;