Lines Matching defs:left_el
2000 struct ocfs2_extent_list *left_el,
2007 le16_to_cpu(left_el->l_tree_depth));
2043 struct ocfs2_extent_list *el, *left_el, *right_el;
2053 * We begin the loop with right_el and left_el pointing to the
2056 * NOTE: within this loop, left_el and right_el always refer
2059 left_el = path_leaf_el(left_path);
2071 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2086 left_el = left_path->p_node[i].el;
2096 left_el = left_path->p_node[subtree_index + 1].el;
2099 ocfs2_adjust_root_records(el, left_el, right_el,
2117 struct ocfs2_extent_list *right_el, *left_el;
2121 left_el = path_leaf_el(left_path);
2123 if (left_el->l_next_free_rec != left_el->l_count) {
2128 le16_to_cpu(left_el->l_next_free_rec));
2136 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2179 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2180 move_rec = left_el->l_recs[i];
2190 le16_add_cpu(&left_el->l_next_free_rec, -1);
2191 ocfs2_shift_records_right(left_el);
2192 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2193 le16_add_cpu(&left_el->l_next_free_rec, 1);
2310 struct ocfs2_extent_list *left_el;
2314 left_el = path_leaf_el(left_path);
2315 next_free = le16_to_cpu(left_el->l_next_free_rec);
2316 rec = &left_el->l_recs[next_free - 1];
3295 struct ocfs2_extent_list *left_el;
3302 left_el = path_leaf_el(left_path);
3303 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3523 struct ocfs2_extent_list *left_el;
3536 left_el = path_leaf_el(left_path);
3537 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3538 le16_to_cpu(left_el->l_count));
3540 left_rec = &left_el->l_recs[
3541 le16_to_cpu(left_el->l_next_free_rec) - 1];
4079 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4084 left_el = path_leaf_el(left_path);
4112 insert_el = left_el;
4122 ocfs2_rotate_leaf(left_el, tmprec);
4123 el = left_el;
4126 index = ocfs2_search_extent_list(left_el, cpos);
4132 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4137 el = left_el;
4138 insert_el = left_el;