Lines Matching defs:leaf
74 * to another branching node or a leaf node. The root pointer would also
75 * point to either the first branching node or a leaf node. Leaf nodes
81 * each node has two identities: its leaf identity and its branch identity.
83 * it points to a leaf or a branch. This is not an attribute of the object
85 * the tag to determine whether it points to a leaf or branch identity, with
89 * root to the node's leaf identity, one of the branches traversed will be via
101 * that mask node is converted from being a leaf node to being a one-way
249 * identity. We know that between root and the leaf identity,
284 * change mask from a leaf to a branch.
363 pt_node_t * const leaf = PT_NODE(leaf_node);
369 const bool at_mask = PTN_ISMASK_P(leaf);
370 const pt_bitlen_t leaf_masklen = PTN_MASK_BITLEN(leaf);
378 * where this leaf is which will point to the old and new leaves.
381 KASSERT(PTN_LEAF_POSITION(leaf) == id->id_parent_slot);
382 matched = ptree_matchnode(pt, target, leaf, UINT_MAX,
386 * We aren't inserting a mask nor is the leaf a mask, which
387 * means we are trying to insert a duplicate leaf. Can't do
395 * We are at a mask and the leaf we are about to insert
397 * from a leaf to a one-way branch interior mask.
410 * If the leaf isn't a mask, we obviously have to
411 * insert the new mask before non-mask leaf. If the
412 * leaf is a mask, and the new node has a LEQ mask
413 * length it too needs to inserted before leaf (*).
415 * In other cases, we place the new mask as leaf after
416 * leaf mask. Which mask comes first will be a one-way
429 * If the new mask has a bit offset GEQ than the leaf's
431 * interior mask and make that point to the new [leaf]
437 * The new mask has a bit offset less than the leaf's
438 * mask length or if the leaf isn't a mask at all, the
439 * new mask deserves to be its own leaf so we use the
467 * We need a leaf so we can match against. Until we get a leaf
494 * If we hit a leaf, try to insert target at leaf. We could
506 * If we aren't a leaf, we must be a branch. Make sure we are
555 * because this mask needs to a be a new leaf.
565 * If they don't match, it means we have a leaf to insert.
888 * We better have found that the leaf we are looking for is target.
908 * We have to special remove the last leaf from the root since
938 * leaf identity:
969 * mask which pointed to a single leaf which we are
971 * parent back to a leaf node. So in the same
973 * leaf pointer to parent. In the other position,
997 * Parent was a one-way branch which is changing back to a leaf.
1012 * target's leaf identity is removed from the its parent,
1031 * If target's branch identity contained its leaf identity, we
Indexes created Thu Sep 25 16:09:42 GMT 2025