Home
last modified time | relevance | path

Searched refs:NodeData (Results 1 – 6 of 6) sorted by relevance

/wasmtime-44.0.1/cranelift/bforest/src/
H A Dpool.rs5 use super::{Forest, Node, NodeData};
14 nodes: PrimaryMap<Node, NodeData<F>>,
40 NodeData::Free { next } => self.freelist = next, in alloc_node()
58 self.nodes[node] = NodeData::Free { in free_node()
66 if let NodeData::Inner { size, tree, .. } = self[node] { in free_tree()
84 NodeData<F>: fmt::Display, in verify_tree()
94 if let NodeData::Inner { size, .. } = self[node] { in verify_tree()
99 NodeData::Inner { size, .. } | NodeData::Leaf { size, .. } => { in verify_tree()
118 NodeData::Inner { size, keys, tree } => { in verify_tree()
160 NodeData::Leaf { size, keys, .. } => { in verify_tree()
[all …]
H A Dpath.rs60 NodeData::Inner { size, keys, tree } => { in find()
72 NodeData::Leaf { size, keys, vals } => { in find()
210 NodeData::Inner { size, ref tree, .. } => { in goto_subtree_last()
214 NodeData::Leaf { size, .. } => { in goto_subtree_last()
421 NodeData::Inner { in update_crit_key()
453 while let NodeData::Inner { in balance_nodes()
640 NodeData::Inner { ref mut keys, .. } => { in update_right_crit_key()
665 NodeData::Inner { size, tree, .. } => { in verify()
680 NodeData::Leaf { size, .. } => { in verify()
689 NodeData::Free { .. } => { in verify()
[all …]
H A Dnode.rs16 pub(super) enum NodeData<F: Forest> { enum
47 impl<F: Forest> Copy for NodeData<F> {} implementation
48 impl<F: Forest> Clone for NodeData<F> { implementation
54 impl<F: Forest> NodeData<F> { implementation
499 pub rhs_data: NodeData<F>,
553 impl<F> fmt::Display for NodeData<F> implementation
614 let mut inner = NodeData::<TF>::inner(n1, 'c', n4); in inner()
737 let mut lhs = NodeData::<TF>::inner(n1, 'a', n2); in inner_balance()
743 let mut rhs = NodeData::<TF>::inner(n11, 'p', n12); in inner_balance()
779 let mut lhs = NodeData::<TF>::leaf('a', SetValue()); in leaf_balance()
[all …]
H A Dset.rs3 use super::{Comparator, Forest, INNER_SIZE, Node, NodeData, NodePool, Path, SetValue};
298 let root = self.pool.alloc_node(NodeData::leaf(elem, SetValue()))?; in try_insert()
381 assert_eq!(mem::size_of::<NodeData<F>>(), 64); in node_size()
H A Dlib.rs38 use self::node::NodeData;
H A Dmap.rs3 use super::{Comparator, Forest, INNER_SIZE, Node, NodeData, NodePool, Path};
292 NodeData<MapTypes<K, V>>: fmt::Display, in verify()
415 let node = pool.alloc_node(NodeData::leaf(key, value))?; in try_insert()
880 assert_eq!(mem::size_of::<NodeData<F>>(), 64); in node_size()