Searched refs:tree (Results 1 - 3 of 3) sorted by relevance
/macosx-10.5.8/xnu-1228.15.4/osfmk/ipc/ |
H A D | ipc_splay.c | 63 * Primitive splay tree operations. 86 * The tree is stored in an unassembled form. If ist_root is null, 87 * then the tree has no entries. Otherwise, ist_name records 89 * middle tree obtained from the top-down splay. ist_ltree and 91 * are all smaller (larger) than those in the middle tree. 105 * When descending down the tree, child pointers are reversed 109 * The biggest potential problem with the splay tree implementation 112 * the splay tree doesn't require its own lock, and ist_lock/ist_unlock 118 * there is hope. Use a read/write lock on the splay tree. 119 * Keep track of the number of entries in the tree 165 ipc_splay_prim_lookup( mach_port_name_t name, ipc_tree_entry_t tree, ipc_tree_entry_t *treep, ipc_tree_entry_t *ltreep, ipc_tree_entry_t **ltreepp, ipc_tree_entry_t *rtreep, ipc_tree_entry_t **rtreepp) argument 268 ipc_splay_prim_assemble( ipc_tree_entry_t tree, ipc_tree_entry_t *ltree, ipc_tree_entry_t *ltreep, ipc_tree_entry_t *rtree, ipc_tree_entry_t *rtreep) argument [all...] |
H A D | ipc_entry.h | 83 * Capabilities can have large names, and a splay tree holds 84 * those entries. The cutoff point between the table and the tree 109 struct ipc_tree_entry *tree; member in union:ipc_entry::__anon773 152 #define ite_next ite_entry.hash.tree
|
/macosx-10.5.8/xnu-1228.15.4/libkern/ |
H A D | zlib.c | 351 ush dad; /* father node in Huffman tree */ 364 ct_data *dyn_tree; /* the dynamic tree */ 366 static_tree_desc *stat_desc; /* the corresponding static tree */ 474 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 475 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 476 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 478 struct tree_desc_s l_desc; /* desc. for literal tree */ 479 struct tree_desc_s d_desc; /* desc. for distance tree */ 480 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 483 /* number of codes at each bit length for an optimal tree */ 2562 pqdownheap(deflate_state *s, ct_data *tree, int k) argument 2597 ct_data *tree = desc->dyn_tree; local 2685 gen_codes(ct_data *tree, int max_code, ushf *bl_count) argument 2727 ct_data *tree = desc->dyn_tree; local 2814 scan_tree(deflate_state *s, ct_data *tree, int max_code) argument 2860 send_tree(deflate_state *s, ct_data *tree, int max_code) argument 5032 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon618::__anon619 [all...] |
Completed in 37 milliseconds