Searched refs:trees (Results 1 - 5 of 5) sorted by relevance

/illumos-gate/usr/src/boot/lib/libz/
H A DMakefile33 SRCS+= trees.c
/illumos-gate/usr/src/tools/scripts/
H A Dvalidate_pkg.py792 trees = []
857 trees.append(manifesttree)
862 trees.append(prototree)
870 trees.append(protolist)
887 trees[0].compare(trees[1])
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c311 /* used by trees.c: */
324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
328 * The same heap array is used to build all trees.
332 /* Depth of each subtree used as tie breaker for trees of equal frequency
348 * - creating new Huffman trees less frequently may not provide fast
353 * trees more frequently.
365 ulg opt_len; /* bit length of current block with optimal trees */
366 ulg static_len; /* bit length of current block with static trees */
407 /* in trees.c */
1440 /* trees
3074 } trees; /* if DTREE, decoding info for trees */ member in union:inflate_blocks_state::__anon136
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c472 /* used by trees.c: */
486 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
492 * trees.
497 * Depth of each subtree used as tie breaker for trees of
521 * - creating new Huffman trees less frequently may not
526 * but have of course the overhead of transmitting trees
541 ulg opt_len; /* bit length of current block with optimal trees */
542 ulg static_len; /* bit length of current block with static trees */
583 /* in trees.c */
2209 /* +++ trees
4177 } trees; /* if DTREE, decoding info for trees */ member in union:inflate_blocks_state::__anon6454
[all...]
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/profile/
H A Dprof_file.c39 /* This is the head of the global list of shared trees */
40 prf_data_t trees; member in struct:global_shared_profile_data
44 #define g_shared_trees (krb5int_profile_shared_data.trees)

Completed in 90 milliseconds