Searched refs:p_tree_depth (Results 1 – 3 of 3) sorted by relevance
277 int p_tree_depth; member285 #define path_leaf_bh(_path) ((_path)->p_node[(_path)->p_tree_depth].bh)286 #define path_leaf_el(_path) ((_path)->p_node[(_path)->p_tree_depth].el)287 #define path_num_items(_path) ((_path)->p_tree_depth + 1)
599 path->p_tree_depth = depth; in ocfs2_reinit_path()690 path->p_tree_depth = le16_to_cpu(root_el->l_tree_depth); in ocfs2_new_path()1764 mlog_bug_on_msg(i > left->p_tree_depth, in ocfs2_find_subtree_root()1768 left->p_tree_depth, right->p_tree_depth, in ocfs2_find_subtree_root()2059 for(i = left_path->p_tree_depth - 1; i > subtree_index; i--) { in ocfs2_complete_edge_insert()2215 BUG_ON(path->p_tree_depth == 0); in ocfs2_find_cpos_for_left_leaf()2222 i = path->p_tree_depth - 1; in ocfs2_find_cpos_for_left_leaf()2286 int credits = (path->p_tree_depth - subtree_depth) * 2 + 1 + op_credits; in ocfs2_extend_rotate_transaction()2466 right_path->p_tree_depth); in ocfs2_rotate_tree_right()2547 for (i = 0; i < path->p_tree_depth; i++) { in ocfs2_update_edge_lengths()[all …]
1857 if (path->p_tree_depth == 0) in ocfs2_remove_inode_range()