Lines Matching defs:leaf
39 * Internal (non-leaf) nodes contain pointers to other nodes.
1487 * mas_leaf_max_gap() - Returns the largest gap in a leaf node
1490 * Return: The maximum gap in the leaf.
1563 * ma_max_gap() - Get the maximum gap in a maple node (non-leaf)
1593 * mas_max_gap() - find the largest gap in a non-leaf node and set the slot.
1881 * end on a NULL entry, with the exception of the left-most leaf. The
1989 * mas_leaf_set_meta() - Set the metadata of a leaf if possible.
3360 * how much space will be needed until the leaf is (or leaves are)
3592 * The last entry of leaf node cannot be NULL unless it is the
4261 /* At this point, we are at the leaf node that needs to be altered. */
4312 /* At this point, we are at the leaf node that needs to be altered. */
4718 * Return: True if found in a leaf, false otherwise.
5497 /* At this point, we are at the leaf node that needs to be altered. */
6762 bool leaf = mte_is_leaf(entry);
6787 if (leaf)
6817 bool leaf = mte_is_leaf(entry);
6853 if (leaf)
7064 pr_err("Non-leaf node lacks child at %p[%u]\n",