Searched refs:right_path (Results 1 - 5 of 5) sorted by relevance

/linux-4.1.27/fs/ocfs2/
H A Dalloc.c2018 * We've changed a leaf block (in right_path) and need to reflect that
2032 struct ocfs2_path *right_path, ocfs2_complete_edge_insert()
2053 right_el = path_leaf_el(right_path); ocfs2_complete_edge_insert()
2067 el = right_path->p_node[i].el; ocfs2_complete_edge_insert()
2074 ocfs2_journal_dirty(handle, right_path->p_node[i].bh); ocfs2_complete_edge_insert()
2081 right_el = right_path->p_node[i].el; ocfs2_complete_edge_insert()
2091 right_el = right_path->p_node[subtree_index + 1].el; ocfs2_complete_edge_insert()
2104 struct ocfs2_path *right_path, ocfs2_rotate_subtree_right()
2135 BUG_ON(root_bh != right_path->p_node[subtree_index].bh); ocfs2_rotate_subtree_right()
2137 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, ocfs2_rotate_subtree_right()
2144 for(i = subtree_index + 1; i < path_num_items(right_path); i++) { ocfs2_rotate_subtree_right()
2146 right_path, i); ocfs2_rotate_subtree_right()
2160 right_leaf_bh = path_leaf_bh(right_path); ocfs2_rotate_subtree_right()
2161 right_el = path_leaf_el(right_path); ocfs2_rotate_subtree_right()
2192 ocfs2_complete_edge_insert(handle, left_path, right_path, ocfs2_rotate_subtree_right()
2351 * - The 'right_path' array will contain a path to the leaf block
2362 struct ocfs2_path *right_path, ocfs2_rotate_tree_right()
2372 left_path = ocfs2_new_path_from_path(right_path); ocfs2_rotate_tree_right()
2379 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos); ocfs2_rotate_tree_right()
2428 path_leaf_bh(right_path), ocfs2_rotate_tree_right()
2459 start = ocfs2_find_subtree_root(et, left_path, right_path); ocfs2_rotate_tree_right()
2463 right_path->p_node[start].bh->b_blocknr, ocfs2_rotate_tree_right()
2464 right_path->p_tree_depth); ocfs2_rotate_tree_right()
2467 orig_credits, right_path); ocfs2_rotate_tree_right()
2474 right_path, start); ocfs2_rotate_tree_right()
2481 ocfs2_leftmost_rec_contains(path_leaf_el(right_path), ocfs2_rotate_tree_right()
2503 ocfs2_mv_path(right_path, left_path); ocfs2_rotate_tree_right()
2505 ret = ocfs2_find_cpos_for_left_leaf(sb, right_path, &cpos); ocfs2_rotate_tree_right()
2622 struct ocfs2_path *right_path, ocfs2_unlink_subtree()
2634 eb = (struct ocfs2_extent_block *)right_path->p_node[subtree_index + 1].bh->b_data; ocfs2_unlink_subtree()
2651 ocfs2_unlink_path(handle, et, dealloc, right_path, ocfs2_unlink_subtree()
2658 struct ocfs2_path *right_path, ocfs2_rotate_subtree_left()
2664 struct buffer_head *root_bh, *et_root_bh = path_root_bh(right_path); ocfs2_rotate_subtree_left()
2670 right_leaf_el = path_leaf_el(right_path); ocfs2_rotate_subtree_left()
2673 BUG_ON(root_bh != right_path->p_node[subtree_index].bh); ocfs2_rotate_subtree_left()
2678 eb = (struct ocfs2_extent_block *)path_leaf_bh(right_path)->b_data; ocfs2_rotate_subtree_left()
2698 path_leaf_bh(right_path), ocfs2_rotate_subtree_left()
2732 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, ocfs2_rotate_subtree_left()
2739 for(i = subtree_index + 1; i < path_num_items(right_path); i++) { ocfs2_rotate_subtree_left()
2741 right_path, i); ocfs2_rotate_subtree_left()
2777 ocfs2_journal_dirty(handle, path_leaf_bh(right_path)); ocfs2_rotate_subtree_left()
2780 ocfs2_unlink_subtree(handle, et, left_path, right_path, ocfs2_rotate_subtree_left()
2804 ocfs2_complete_edge_insert(handle, left_path, right_path, ocfs2_rotate_subtree_left()
2925 struct ocfs2_path *right_path = NULL; __ocfs2_rotate_tree_left() local
2947 right_path = ocfs2_new_path_from_path(path); __ocfs2_rotate_tree_left()
2948 if (!right_path) { __ocfs2_rotate_tree_left()
2955 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos); __ocfs2_rotate_tree_left()
2962 right_path); __ocfs2_rotate_tree_left()
2966 right_path->p_node[subtree_root].bh->b_blocknr, __ocfs2_rotate_tree_left()
2967 right_path->p_tree_depth); __ocfs2_rotate_tree_left()
2988 right_path, subtree_root, __ocfs2_rotate_tree_left()
2997 *empty_extent_path = right_path; __ocfs2_rotate_tree_left()
2998 right_path = NULL; __ocfs2_rotate_tree_left()
3014 ocfs2_mv_path(left_path, right_path); __ocfs2_rotate_tree_left()
3025 ocfs2_free_path(right_path); __ocfs2_rotate_tree_left()
3299 struct ocfs2_path *right_path = NULL; ocfs2_get_right_path() local
3320 right_path = ocfs2_new_path_from_path(left_path); ocfs2_get_right_path()
3321 if (!right_path) { ocfs2_get_right_path()
3327 ret = ocfs2_find_path(et->et_ci, right_path, right_cpos); ocfs2_get_right_path()
3333 *ret_right_path = right_path; ocfs2_get_right_path()
3336 ocfs2_free_path(right_path); ocfs2_get_right_path()
3358 struct ocfs2_path *right_path = NULL; ocfs2_merge_rec_right() local
3370 ret = ocfs2_get_right_path(et, left_path, &right_path); ocfs2_merge_rec_right()
3376 right_el = path_leaf_el(right_path); ocfs2_merge_rec_right()
3390 right_path); ocfs2_merge_rec_right()
3394 right_path); ocfs2_merge_rec_right()
3401 BUG_ON(root_bh != right_path->p_node[subtree_index].bh); ocfs2_merge_rec_right()
3403 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, ocfs2_merge_rec_right()
3411 i < path_num_items(right_path); i++) { ocfs2_merge_rec_right()
3413 right_path, i); ocfs2_merge_rec_right()
3450 if (right_path) { ocfs2_merge_rec_right()
3451 ocfs2_journal_dirty(handle, path_leaf_bh(right_path)); ocfs2_merge_rec_right()
3452 ocfs2_complete_edge_insert(handle, left_path, right_path, ocfs2_merge_rec_right()
3456 ocfs2_free_path(right_path); ocfs2_merge_rec_right()
3461 struct ocfs2_path *right_path, ocfs2_get_left_path()
3471 BUG_ON(right_path->p_tree_depth == 0); ocfs2_get_left_path()
3474 right_path, &left_cpos); ocfs2_get_left_path()
3483 left_path = ocfs2_new_path_from_path(right_path); ocfs2_get_left_path()
3510 * remove the rightmost leaf extent block in the right_path and change
3513 static int ocfs2_merge_rec_left(struct ocfs2_path *right_path, ocfs2_merge_rec_left() argument
3524 struct ocfs2_extent_list *el = path_leaf_el(right_path); ocfs2_merge_rec_left()
3525 struct buffer_head *bh = path_leaf_bh(right_path); ocfs2_merge_rec_left()
3535 ret = ocfs2_get_left_path(et, right_path, &left_path); ocfs2_merge_rec_left()
3552 right_path); ocfs2_merge_rec_left()
3563 BUG_ON(root_bh != right_path->p_node[subtree_index].bh); ocfs2_merge_rec_left()
3565 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, ocfs2_merge_rec_left()
3573 i < path_num_items(right_path); i++) { ocfs2_merge_rec_left()
3575 right_path, i); ocfs2_merge_rec_left()
3594 ret = ocfs2_path_bh_journal_access(handle, et->et_ci, right_path, ocfs2_merge_rec_left()
3595 path_num_items(right_path) - 1); ocfs2_merge_rec_left()
3632 right_path, ocfs2_merge_rec_left()
3642 ocfs2_mv_path(right_path, left_path); ocfs2_merge_rec_left()
3646 right_path, subtree_index); ocfs2_merge_rec_left()
3953 struct ocfs2_path *right_path, ocfs2_append_rec_to_path()
3966 BUG_ON(right_path->p_tree_depth == 0); ocfs2_append_rec_to_path()
3973 el = path_leaf_el(right_path); ocfs2_append_rec_to_path()
3980 right_path, &left_cpos); ocfs2_append_rec_to_path()
3997 left_path = ocfs2_new_path_from_path(right_path); ocfs2_append_rec_to_path()
4018 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path); ocfs2_append_rec_to_path()
4024 ocfs2_adjust_rightmost_records(handle, et, right_path, insert_rec); ocfs2_append_rec_to_path()
4037 struct ocfs2_path *right_path, ocfs2_split_record()
4046 right_el = path_leaf_el(right_path); ocfs2_split_record()
4117 * right_path is the path we want to do the actual insert
4124 struct ocfs2_path *right_path, ocfs2_insert_path()
4129 struct buffer_head *leaf_bh = path_leaf_bh(right_path); ocfs2_insert_path()
4155 ret = ocfs2_journal_access_path(et->et_ci, handle, right_path); ocfs2_insert_path()
4167 ocfs2_split_record(et, left_path, right_path, ocfs2_insert_path()
4179 ocfs2_insert_at_leaf(et, insert_rec, path_leaf_el(right_path), ocfs2_insert_path()
4192 right_path); ocfs2_insert_path()
4193 ocfs2_complete_edge_insert(handle, left_path, right_path, ocfs2_insert_path()
4209 struct ocfs2_path *right_path = NULL; ocfs2_do_insert_extent() local
4227 right_path = ocfs2_new_path_from_et(et); ocfs2_do_insert_extent()
4228 if (!right_path) { ocfs2_do_insert_extent()
4246 ret = ocfs2_find_path(et->et_ci, right_path, cpos); ocfs2_do_insert_extent()
4267 right_path, &left_path); ocfs2_do_insert_extent()
4286 right_path, &left_path); ocfs2_do_insert_extent()
4293 ret = ocfs2_insert_path(handle, et, left_path, right_path, ocfs2_do_insert_extent()
4309 ocfs2_free_path(right_path); ocfs2_do_insert_extent()
4325 struct ocfs2_path *left_path = NULL, *right_path = NULL; ocfs2_figure_merge_contig_type() local
4394 right_path = ocfs2_new_path_from_path(path); ocfs2_figure_merge_contig_type()
4395 if (!right_path) ocfs2_figure_merge_contig_type()
4398 status = ocfs2_find_path(et->et_ci, right_path, right_cpos); ocfs2_figure_merge_contig_type()
4402 new_el = path_leaf_el(right_path); ocfs2_figure_merge_contig_type()
4406 bh = path_leaf_bh(right_path); ocfs2_figure_merge_contig_type()
4432 ocfs2_free_path(right_path); ocfs2_figure_merge_contig_type()
2030 ocfs2_complete_edge_insert(handle_t *handle, struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index) ocfs2_complete_edge_insert() argument
2101 ocfs2_rotate_subtree_right(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index) ocfs2_rotate_subtree_right() argument
2358 ocfs2_rotate_tree_right(handle_t *handle, struct ocfs2_extent_tree *et, enum ocfs2_split_type split, u32 insert_cpos, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) ocfs2_rotate_tree_right() argument
2619 ocfs2_unlink_subtree(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index, struct ocfs2_cached_dealloc_ctxt *dealloc) ocfs2_unlink_subtree() argument
2655 ocfs2_rotate_subtree_left(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, int subtree_index, struct ocfs2_cached_dealloc_ctxt *dealloc, int *deleted) ocfs2_rotate_subtree_left() argument
3460 ocfs2_get_left_path(struct ocfs2_extent_tree *et, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) ocfs2_get_left_path() argument
3950 ocfs2_append_rec_to_path(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_extent_rec *insert_rec, struct ocfs2_path *right_path, struct ocfs2_path **ret_left_path) ocfs2_append_rec_to_path() argument
4035 ocfs2_split_record(struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *split_rec, enum ocfs2_split_type split) ocfs2_split_record() argument
4121 ocfs2_insert_path(handle_t *handle, struct ocfs2_extent_tree *et, struct ocfs2_path *left_path, struct ocfs2_path *right_path, struct ocfs2_extent_rec *insert_rec, struct ocfs2_insert_type *insert) ocfs2_insert_path() argument
H A Drefcounttree.c976 struct ocfs2_path *left_path = NULL, *right_path = NULL; ocfs2_get_refcount_cpos_end() local
1020 right_path = ocfs2_new_path_from_path(left_path); ocfs2_get_refcount_cpos_end()
1021 if (!right_path) { ocfs2_get_refcount_cpos_end()
1033 ret = ocfs2_find_path(ci, right_path, cpos); ocfs2_get_refcount_cpos_end()
1040 right_path); ocfs2_get_refcount_cpos_end()
1055 ocfs2_free_path(right_path); ocfs2_get_refcount_cpos_end()
/linux-4.1.27/fs/btrfs/
H A Dctree.c5284 struct btrfs_path *right_path, tree_compare_item()
5292 len2 = btrfs_item_size_nr(right_path->nodes[0], right_path->slots[0]); tree_compare_item()
5297 off2 = btrfs_item_ptr_offset(right_path->nodes[0], tree_compare_item()
5298 right_path->slots[0]); tree_compare_item()
5302 cmp = memcmp_extent_buffer(right_path->nodes[0], tmp_buf, off2, len1); tree_compare_item()
5331 struct btrfs_path *right_path = NULL; btrfs_compare_trees() local
5353 right_path = btrfs_alloc_path(); btrfs_compare_trees()
5354 if (!right_path) { btrfs_compare_trees()
5367 right_path->search_commit_root = 1; btrfs_compare_trees()
5368 right_path->skip_locking = 1; btrfs_compare_trees()
5414 right_path->nodes[right_level] = right_root->commit_root; btrfs_compare_trees()
5415 extent_buffer_get(right_path->nodes[right_level]); btrfs_compare_trees()
5425 btrfs_item_key_to_cpu(right_path->nodes[right_level], btrfs_compare_trees()
5426 &right_key, right_path->slots[right_level]); btrfs_compare_trees()
5428 btrfs_node_key_to_cpu(right_path->nodes[right_level], btrfs_compare_trees()
5429 &right_key, right_path->slots[right_level]); btrfs_compare_trees()
5445 ret = tree_advance(right_root, right_path, &right_level, btrfs_compare_trees()
5460 left_path, right_path, btrfs_compare_trees()
5472 left_path, right_path, btrfs_compare_trees()
5487 left_path, right_path, btrfs_compare_trees()
5496 left_path, right_path, btrfs_compare_trees()
5508 right_path, tmp_buf); btrfs_compare_trees()
5514 left_path, right_path, btrfs_compare_trees()
5532 right_path->nodes[right_level], btrfs_compare_trees()
5533 right_path->slots[right_level]); btrfs_compare_trees()
5538 right_path->nodes[right_level], btrfs_compare_trees()
5539 right_path->slots[right_level]); btrfs_compare_trees()
5562 btrfs_free_path(right_path); btrfs_compare_trees()
5282 tree_compare_item(struct btrfs_root *left_root, struct btrfs_path *left_path, struct btrfs_path *right_path, char *tmp_buf) tree_compare_item() argument
H A Dsend.c101 struct btrfs_path *right_path; member in struct:send_ctx
3848 ret = iterate_inode_ref(sctx->parent_root, sctx->right_path, record_deleted_ref()
3929 ret = find_iref(sctx->parent_root, sctx->right_path, __record_changed_new_ref()
3970 ret = iterate_inode_ref(sctx->parent_root, sctx->right_path, record_changed_ref()
4178 ret = iterate_dir_item(sctx->parent_root, sctx->right_path, process_deleted_xattr()
4252 ret = find_xattr(sctx->parent_root, sctx->right_path, __process_changed_new_xattr()
4299 ret = iterate_dir_item(sctx->parent_root, sctx->right_path, process_changed_xattr()
5221 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0], changed_inode()
5222 sctx->right_path->slots[0], changed_inode()
5224 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0], changed_inode()
5228 right_ii = btrfs_item_ptr(sctx->right_path->nodes[0], changed_inode()
5229 sctx->right_path->slots[0], changed_inode()
5232 right_gen = btrfs_inode_generation(sctx->right_path->nodes[0], changed_inode()
5262 sctx->right_path->nodes[0], right_ii); changed_inode()
5264 sctx->right_path->nodes[0], right_ii); changed_inode()
5281 sctx->right_path->nodes[0], right_ii); changed_inode()
5283 sctx->right_path->nodes[0], right_ii); changed_inode()
5480 struct btrfs_path *right_path, changed_cb()
5506 sctx->right_path = right_path; changed_cb()
5477 changed_cb(struct btrfs_root *left_root, struct btrfs_root *right_root, struct btrfs_path *left_path, struct btrfs_path *right_path, struct btrfs_key *key, enum btrfs_compare_tree_result result, void *ctx) changed_cb() argument
H A Dctree.h3547 struct btrfs_path *right_path,

Completed in 289 milliseconds