Lines Matching defs:node
578 struct ocfs2_path_item *node;
584 node = &path->p_node[i];
586 brelse(node->bh);
587 node->bh = NULL;
588 node->el = NULL;
1266 * eb_el isn't always an interior node, but even leaf
1675 * there was no empty extent on a non full rightmost leaf node,
1738 * For a rotation which involves two leaf nodes, the "root node" is
1739 * the lowest level tree node which contains a path to both leafs. This
1878 * Note that this will not do any comparisons on leaf node extent
1995 * Adjust the adjacent root node records involved in a
2051 * The root node is handled below the loop.
2067 * the leftmost right node record and the rightmost
2068 * left node record.
2091 * At the root node, adjust the two adjacent records which
2125 "Inode %llu has non-full interior leaf node %llu (next free = %u)\n",
2223 /* Start at the tree node just above the leaf and work our way up. */
2261 * If we got here, we never found a valid node where
2401 * 3) Determine the 'subtree root' - the lowest level tree node
2819 /* Start at the tree node just above the leaf and work our way up. */
2857 * If we got here, we never found a valid node where
4521 * depth. If we consider the root extent list to be the rightmost leaf node
6173 /* called during the 1st stage of node recovery. we stamp a clean
7663 "finish, which is running from another node.\n",
7678 "just done from node (%u), return.\n",