Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 21 of 21) sorted by relevance

/xnu-11215/libkern/zlib/
H A Dtrees.c194 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
200 send_bits(s, tree[c].Code, tree[c].Len); }
477 (tree[n].Freq < tree[m].Freq || \
478 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
548 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
561 f = tree[n].Freq; in gen_bitlen()
680 tree[n].Len = 0; in build_tree()
691 tree[node].Freq = 1; in build_tree()
715 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
718 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
[all …]
/xnu-11215/bsd/tests/
H A Dtree_tests_sysctl.c91 rb_tree_insert_nodes(struct _rb_test_tree *tree, size_t count) in rb_tree_insert_nodes() argument
102 RB_INSERT(_rb_test_tree, tree, node); in rb_tree_insert_nodes()
109 rb_tree_remove_nodes(struct _rb_test_tree *tree, size_t count) in rb_tree_remove_nodes() argument
120 RB_REMOVE(_rb_test_tree, tree, node); in rb_tree_remove_nodes()
/xnu-11215/bsd/miscfs/devfs/
H A DREADME15 There is a tree of nodes that describe the layout of the DEVFS as seen by
16 the drivers.. they add nodes to this tree. This is called the 'back' layer
18 BLUEPRINT of the DEVFS tree. Each back node has associated with it
27 multiple places), a front layer is created that contains a tree of 'front'
64 except for the possibility of searching the entire backing tree
71 I see 'mount -u' as a possible solution to recovering a broken dev tree.
77 e.g. if you have a chroot tree like erf.tfs.com has, you
80 devices from the chroot tree.
92 a driver decides to remove a device from the backing tree, the FS
/xnu-11215/tests/
H A Dkernel_inspection.c112 ipc_info_tree_name_array_t tree; in attempt_kernel_inspection() local
115 &tblcnt, &tree, &treecnt), "mach_port_space_info"); in attempt_kernel_inspection()
123 (mach_vm_address_t)(uintptr_t)tree, in attempt_kernel_inspection()
124 treecnt * sizeof(*tree)); in attempt_kernel_inspection()
H A Dextract_right_soft_fail.c29 ipc_info_tree_name_array_t tree; /* unused */ in test_extract_immovable_task_port() local
49 kr = mach_port_space_info(tport, &space_info, &table, &tableCount, &tree, &treeCount); in test_extract_immovable_task_port()
H A Dexception_ports_info.c41 ipc_info_tree_name_array_t tree; variable
131 &tblcnt, &tree, &treecnt), "mach_port_space_info(): 0x%x", kr);
/xnu-11215/libkern/libkern/
H A DMakefile64 tree.h \
84 tree.h \
/xnu-11215/tools/lldbmacros/
H A Dsysreg.py65 tree = ET.parse(xmlfilename)
66 root = tree.getroot()
/xnu-11215/san/memory/
H A Dkasan_dynamic_blacklist.c143 RB_ENTRY(range_tree_entry) tree;
185 RB_PROTOTYPE(range_tree, range_tree_entry, tree, range_tree_cmp);
186 RB_GENERATE(range_tree, range_tree_entry, tree, range_tree_cmp);
/xnu-11215/osfmk/kern/
H A Dmachine.c693 RB_ENTRY(io_timeout_override_entry) tree;
716 RB_PROTOTYPE_PREV(io_timeout_override, io_timeout_override_entry, tree, io_timeout_override_cmp);
717 RB_GENERATE_PREV(io_timeout_override, io_timeout_override_entry, tree, io_timeout_override_cmp);
835 node = RB_LEFT(node, tree); in io_override_timeout()
837 node = RB_RIGHT(node, tree); in io_override_timeout()
/xnu-11215/doc/building/
H A Dxnu_build_consolidation.md38 All of these problems can be solved through a mix of relying more heavily on device tree informatio…
95 ### Deriving core/cluster counts from device tree
99 topology-related information into XNU, by parsing it from the device tree and exporting it to KEXTs…
/xnu-11215/tests/ipc/
H A Dipc_read_inspect.c416 ipc_info_tree_name_array_t tree; /* unused */ in test_task_port_mig_intrans() local
418 kr = mach_port_space_info(tport, &space_info, &table, &tableCount, &tree, &treeCount); in test_task_port_mig_intrans()
/xnu-11215/bsd/sys/
H A DMakefile127 tree.h \
253 tree.h \
/xnu-11215/doc/lifecycle/
H A Dstartup.md68 Initializes machine timeouts, which are device-tree/boot-args
H A Dhibernation.md109 image for use by iBoot. Those pieces are described in the device tree so
/xnu-11215/bsd/net/
H A Dpf_norm.c457 pf_find_fragment_by_key(struct pf_fragment *key, struct pf_frag_tree *tree) in pf_find_fragment_by_key() argument
461 frag = RB_FIND(pf_frag_tree, tree, key); in pf_find_fragment_by_key()
478 pf_find_fragment_by_ipv4_header(struct ip *ip, struct pf_frag_tree *tree) in pf_find_fragment_by_ipv4_header() argument
482 return pf_find_fragment_by_key(&key, tree); in pf_find_fragment_by_ipv4_header()
2228 struct pf_frag_tree *tree) in pf_find_fragment_by_ipv6_header() argument
2232 return pf_find_fragment_by_key(&key, tree); in pf_find_fragment_by_ipv6_header()
H A Dpf.c1421 pf_stateins_err(const char *tree, struct pf_state *s, struct pfi_kif *kif) in pf_stateins_err() argument
1426 printf("pf: state insert failed: %s %s ", tree, kif->pfik_name); in pf_stateins_err()
/xnu-11215/iokit/DriverKit/
H A DIOService.iig227 * @brief Add an IOService created by Create() to the power manangement tree.
228 … IOService objects created by matching on a provider are always added to the power management tree.
/xnu-11215/makedefs/
H A DMakeInc.top682 # Install source tree
705 # Clean up source tree
/xnu-11215/bsd/skywalk/namespace/
H A Dnetns.c443 ns_reservation_tree_find(struct ns_reservation_tree *tree, const in_port_t port) in ns_reservation_tree_find() argument
447 return RB_FIND(ns_reservation_tree, tree, &res); in ns_reservation_tree_find()
/xnu-11215/doc/vm/
H A Dmemorystatus.md116 …uded_count - vm_page_secluded_target)`. This target comes from the device tree `kern.secluded_mem_…