Lines Matching defs:root
44 * UINT_MAX for the root node.
324 /* Bit 1 indicates the root is a node */
385 * Excluding root, the parent pointer is 256B aligned like all other tree nodes.
849 * mas_root() - Get the maple tree root.
852 * Return: The pointer to the root of the tree
865 * mas_root_locked() - Get the maple tree root when holding the maple tree lock.
868 * Return: The pointer to the root of the tree
1373 * - If it's a tree: NULL & mas->node == safe root node.
1378 struct maple_enode *root;
1385 root = mas_root(mas);
1387 if (likely(xa_is_node(root))) {
1389 mas->node = mte_safe_root(root);
1398 if (unlikely(!root)) {
1412 return root;
1904 * carry upwards all the way to the root in the worst case.
2295 * level upwards until root is reached.
2851 * Follow the tree upwards from @l_mas and @r_mas for @count, or until the root
2884 /* Check if this is not root and has sufficient data. */
2940 /* May be a new root stored in mast->bn */
3011 * entire range of the tree, then that node is used as a new root node.
3168 * @height: The height of the tree in case it's a new root.
3183 * Only a single node is used here, could be root.
3502 * mas_root_expand() - Expand a root to a node
3543 /* swap the new root into the tree */
3767 * mas_new_root() - Create a new root node that only contains the entry passed
3778 struct maple_enode *root = mas_root_locked(mas);
3808 if (xa_is_node(root))
3809 mte_destroy_walk(root, mas->tree);
3854 * entries per level plus a new root.
4263 /* New root for a single pointer */
5521 /* New root needs a singe node */
6487 void *root = mt_root_locked(mt);
6490 if (xa_is_node(root))
6491 mte_destroy_walk(root, mt);
6910 pr_info("maple_tree(%p) flags %X, height %u root %p\n",
6921 * the parent (unless root).