Home
last modified time | relevance | path

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

/xnu-12377.1.9/libkern/zlib/
H A Dtrees.c171 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, int max_code));
176 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
194 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
198 # define send_code(s, c, tree) \ argument
200 send_bits(s, tree[c].Code, tree[c].Len); }
465 #define pqremove(s, tree, top) \ argument
469 pqdownheap(s, tree, SMALLEST); \
476 #define smaller(tree, n, m, depth) \ argument
[all …]
/xnu-12377.1.9/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-12377.1.9/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-12377.1.9/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 Dexception_ports_info.c41 ipc_info_tree_name_array_t tree; variable
131 &tblcnt, &tree, &treecnt), "mach_port_space_info(): 0x%x", kr);
/xnu-12377.1.9/libkern/libkern/
H A DMakefile64 tree.h \
84 tree.h \
/xnu-12377.1.9/tools/lldbmacros/
H A Dsysreg.py65 tree = ET.parse(xmlfilename)
66 root = tree.getroot()
/xnu-12377.1.9/tools/
H A Dpre-commit.sh16 against=$(git hash-object -t tree /dev/null)
/xnu-12377.1.9/san/memory/
H A Dkasan_dynamic_denylist.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-12377.1.9/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-12377.1.9/osfmk/kern/
H A Dmachine.c702 RB_ENTRY(io_timeout_override_entry) tree;
725 RB_PROTOTYPE_PREV(io_timeout_override, io_timeout_override_entry, tree, io_timeout_override_cmp);
726 RB_GENERATE_PREV(io_timeout_override, io_timeout_override_entry, tree, io_timeout_override_cmp);
844 node = RB_LEFT(node, tree); in io_override_timeout()
846 node = RB_RIGHT(node, tree); in io_override_timeout()
/xnu-12377.1.9/tests/ipc/
H A Dipc_read_inspect.c406 ipc_info_tree_name_array_t tree; /* unused */ in test_task_port_mig_intrans() local
408 kr = mach_port_space_info(tport, &space_info, &table, &tableCount, &tree, &treeCount); in test_task_port_mig_intrans()
/xnu-12377.1.9/bsd/sys/
H A DMakefile131 tree.h \
265 tree.h \
/xnu-12377.1.9/tests/unit/tools/
H A Dgenerate_ut_proj.py656 tree = ET.ElementTree(root)
657 ET.indent(tree, space=' ', level=0)
658 tree.write(open(path, "wb"), encoding="utf-8", xml_declaration=True)
/xnu-12377.1.9/bsd/net/
H A Dpf_norm.c458 pf_find_fragment_by_key(struct pf_fragment *key, struct pf_frag_tree *tree) in pf_find_fragment_by_key() argument
462 frag = RB_FIND(pf_frag_tree, tree, key); in pf_find_fragment_by_key()
479 pf_find_fragment_by_ipv4_header(struct ip *ip, struct pf_frag_tree *tree) in pf_find_fragment_by_ipv4_header() argument
483 return pf_find_fragment_by_key(&key, tree); in pf_find_fragment_by_ipv4_header()
2231 struct pf_frag_tree *tree) in pf_find_fragment_by_ipv6_header() argument
2235 return pf_find_fragment_by_key(&key, tree); in pf_find_fragment_by_ipv6_header()
H A Dpf.c1424 pf_stateins_err(const char *tree, struct pf_state *s, struct pfi_kif *kif) in pf_stateins_err() argument
1429 printf("pf: state insert failed: %s %s ", tree, kif->pfik_name); in pf_stateins_err()
/xnu-12377.1.9/doc/lifecycle/
H A Dstartup.md72 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-12377.1.9/iokit/DriverKit/
H A DIOService.iig244 * @brief Add an IOService created by Create() to the power manangement tree.
245 … IOService objects created by matching on a provider are always added to the power management tree.
/xnu-12377.1.9/makedefs/
H A DMakeInc.top686 # Install source tree
709 # Clean up source tree
/xnu-12377.1.9/bsd/skywalk/namespace/
H A Dnetns.c449 ns_reservation_tree_find(struct ns_reservation_tree *tree, const in_port_t port) in ns_reservation_tree_find() argument
453 return RB_FIND(ns_reservation_tree, tree, &res); in ns_reservation_tree_find()
/xnu-12377.1.9/doc/vm/
H A Dmemorystatus.md116 …uded_count - vm_page_secluded_target)`. This target comes from the device tree `kern.secluded_mem_…