Lines Matching defs:leaf
41 * Internal (non-leaf) nodes contain pointers to other nodes.
1464 * mas_leaf_max_gap() - Returns the largest gap in a leaf node
1467 * Return: The maximum gap in the leaf.
1543 * ma_max_gap() - Get the maximum gap in a maple node (non-leaf)
1573 * mas_max_gap() - find the largest gap in a non-leaf node and set the slot.
1861 * end on a NULL entry, with the exception of the left-most leaf. The
1969 * mas_leaf_set_meta() - Set the metadata of a leaf if possible.
3325 * how much space will be needed until the leaf is (or leaves are)
3558 * The last entry of leaf node cannot be NULL unless it is the
4221 /* At this point, we are at the leaf node that needs to be altered. */
4272 /* At this point, we are at the leaf node that needs to be altered. */
4739 * Return: True if found in a leaf, false otherwise.
5522 /* At this point, we are at the leaf node that needs to be altered. */
6755 /* Only allocate child nodes for non-leaf nodes. */
6761 * This is the last leaf node and duplication is
6767 /* This is not the last leaf node and needs to go up. */
6801 * new child nodes in non-leaf nodes. The new node is exactly the same as the
6839 * new child nodes in non-leaf nodes. The new node is exactly the same as the
7134 bool leaf = mte_is_leaf(entry);
7158 if (leaf)
7187 bool leaf = mte_is_leaf(entry);
7221 if (leaf)
7432 pr_err("Non-leaf node lacks child at %p[%u]\n",