Searched refs:tree (Results 1 - 23 of 23) sorted by relevance

/darwin-on-arm/xnu/bsd/sys/
H A Dtree.h29 #include <libkern/tree.h>
H A DMakefile54 tree.h \
85 # whose source is outside of the xnu/bsd tree.
125 uio_internal.h tree.h munge.h
/darwin-on-arm/xnu/libkern/zlib/
H A Dtrees.c39 * Each code tree is stored in a compressed form which is itself
118 /* The static literal tree. Since the bit lengths are imposed, there is no
120 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
125 /* The static distance tree. (Actually a trivial tree since all codes use
149 const ct_data *static_tree; /* static tree or NULL */
152 int elems; /* max number of elements in the tree */
171 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
173 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
175 local void scan_tree OF((deflate_state *s, ct_data *tree, in
521 ct_data *tree = desc->dyn_tree; local
650 ct_data *tree = desc->dyn_tree; local
[all...]
/darwin-on-arm/xnu/libkern/libkern/
H A DMakefile42 tree.h \
66 tree.h \
/darwin-on-arm/xnu/bsd/hfs/hfscommon/Misc/
H A DHybridAllocator.c51 * initialize the tree
52 * static void extent_tree_offset_new(extent_tree_offset_t * tree)
54 * Get the first node in the tree. If it is empty, return NULL
55 * static extent_node_t* extent_tree_offset_first (extent_tree_offset_t * tree)
57 * Get the last node in the tree. If it is empty, return NULL
58 * static extent_node_t* extent_tree_offset_last (extent_tree_offset_t * tree)
61 * static extent_node_t* extent_tree_offset_next (extent_tree_offset_t * tree, extent_node_t * node)
64 * static extent_node_t* extent_tree_offset_prev(extent_tree_offset_t * tree, extent_node_t * node)
67 * static extent_node_t* extent_tree_offset_search(extent_tree_offset_t * tree, extent_node_t * key)
71 * static extent_node_t* extent_tree_offset_nsearch(extent_tree_offset_t * tree, extent_node_
193 extent_tree_off_search(extent_tree_offset_t *tree, extent_node_t *key) argument
263 extent_tree_off_next(extent_tree_offset_t * tree, extent_node_t *node) argument
272 extent_tree_off_prev(extent_tree_offset_t * tree, extent_node_t *node) argument
[all...]
H A DVolumeAllocation.c51 whether or not the red-black tree is enabled and call the appropriate function
55 not the red-black tree is enabled and call the appropriate function if applicable.
59 Since the red-black tree obviates the need to maintain the free extent cache, we do
60 not update it if the tree is also live. As a result, if we ever need to destroy the trees
70 filesystem. It is also used to shrink or grow the number of blocks that the red-black tree should
72 number of items in the tree that we can allocate from.
81 use the red-black tree code.
85 and/or create Red-Black Tree allocation tree nodes to correspond
95 we'll remove the appropriate entries from the red-black tree.
104 called by the bitmap scanning logic as the red-black tree shoul
3450 extent_tree_offset_t *tree = &hfsmp->offset_tree; local
[all...]
/darwin-on-arm/xnu/bsd/hfs/hfscommon/headers/
H A DRedBlackTree.h449 /* Iteratively search down the tree for the insertion point, */\
452 /* the tree, assuming a sufficiently deep tree. */\
459 /* This iteration does not move down the tree, due to the */\
532 /* Iterate down the tree, but always transform 2-nodes to 3- or */\
705 a_prefix##new(a_tree_type *tree) { \
706 rb_new(a_type, a_field, tree); \
709 a_prefix##first(a_tree_type *tree) { \
711 rb_first(a_type, a_field, tree, ret); \
715 a_prefix##last(a_tree_type *tree) { \
[all...]
H A DHybridAllocator.h64 extent_tree_offset_alloc_unaligned(extent_tree_offset_t *tree, u_int32_t size, u_int32_t offset);
/darwin-on-arm/xnu/osfmk/vm/
H A Dvm_map_store.h41 #include <libkern/tree.h>
/darwin-on-arm/xnu/bsd/net/
H A Dif_llreach.h60 #include <sys/tree.h>
85 RB_ENTRY(if_llreach) lr_link; /* RB tree links */
88 u_int32_t lr_reqcnt; /* RB tree request count */
H A Dpf_norm.c446 pf_find_fragment_by_key(struct pf_fragment *key, struct pf_frag_tree *tree) argument
450 frag = RB_FIND(pf_frag_tree, tree, key);
467 pf_find_fragment_by_ipv4_header(struct ip *ip, struct pf_frag_tree *tree) argument
471 return pf_find_fragment_by_key(&key, tree);
476 struct pf_frag_tree *tree)
480 return pf_find_fragment_by_key(&key, tree);
475 pf_find_fragment_by_ipv6_header(struct ip6_hdr *ip6, struct ip6_frag *fh, struct pf_frag_tree *tree) argument
H A Dif_llreach.c32 * Each interface maintains a red-black tree which contains records related
34 * record gets allocated and inserted into the tree in the following manner:
43 * resolver entry which now refers to it. A record gets removed from the tree
50 * record in the red-black tree consists of the link-layer protocol, therefore
60 * for a matching record in the red-black tree for the interface where the
115 #include <sys/tree.h>
157 "Per-interface tree of source link-layer reachability records");
190 /* Initialize link-layer source tree (if not already) */
201 * Nothing to do for now; the link-layer source tree might
208 * Link-layer source tree compariso
[all...]
H A Dif_var.h491 #include <sys/tree.h>
614 struct ll_reach_tree if_ll_srcs; /* source link-layer tree */
H A Dpfvar.h81 #include <libkern/tree.h>
H A Dpf.c1368 pf_stateins_err(const char *tree, struct pf_state *s, struct pfi_kif *kif) argument
1373 printf("pf: state insert failed: %s %s ", tree, kif->pfik_name);
3967 /* don't touch tree entries, states and refcnt on sk */
/darwin-on-arm/xnu/bsd/netinet/
H A Din_var.h163 #include <sys/tree.h>
251 RB_ENTRY(ip_msource) ims_link; /* RB tree links */
264 RB_ENTRY(ip_msource) ims_link; /* RB tree links */
291 * If any source filters are present, then a node will exist in the RB-tree
325 struct ip_msource_tree inm_srcs; /* tree of sources */
326 u_long inm_nsrc; /* # of tree entries */
H A Din_pcb.h78 #include <sys/tree.h>
H A Din_mcast.c74 #include <sys/tree.h>
691 * This lives here as it modifies the shared tree.
1262 * NOTE: imf argument cannot be const due to sys/tree.h limitations.
/darwin-on-arm/xnu/iokit/IOKit/
H A DIOStatisticsPrivate.h35 #include <sys/tree.h>
/darwin-on-arm/xnu/bsd/netinet6/
H A Din6_var.h101 #include <sys/tree.h>
702 RB_ENTRY(ip6_msource) im6s_link; /* RB tree links */
766 struct ip6_msource_tree in6m_srcs; /* tree of sources */
767 u_long in6m_nsrc; /* # of tree entries */
H A Dnd6.h75 #include <sys/tree.h>
580 struct prproxy_sols_tree ndpr_prproxy_sols; /* tree of proxied NS */
H A Din6_mcast.c74 #include <sys/tree.h>
253 * IPv6 source tree comparison function.
623 * This lives here as it modifies the shared tree.
1234 * NOTE: imf argument cannot be const due to sys/tree.h limitations.
/darwin-on-arm/xnu/bsd/kern/
H A Dkern_memorystatus.c50 #include <sys/tree.h>

Completed in 216 milliseconds