Lines Matching defs:left_el
1998 struct ocfs2_extent_list *left_el,
2005 le16_to_cpu(left_el->l_tree_depth));
2041 struct ocfs2_extent_list *el, *left_el, *right_el;
2051 * We begin the loop with right_el and left_el pointing to the
2054 * NOTE: within this loop, left_el and right_el always refer
2057 left_el = path_leaf_el(left_path);
2069 idx = le16_to_cpu(left_el->l_next_free_rec) - 1;
2084 left_el = left_path->p_node[i].el;
2094 left_el = left_path->p_node[subtree_index + 1].el;
2097 ocfs2_adjust_root_records(el, left_el, right_el,
2115 struct ocfs2_extent_list *right_el, *left_el;
2119 left_el = path_leaf_el(left_path);
2121 if (left_el->l_next_free_rec != left_el->l_count) {
2126 le16_to_cpu(left_el->l_next_free_rec));
2134 if (ocfs2_is_empty_extent(&left_el->l_recs[0]))
2177 i = le16_to_cpu(left_el->l_next_free_rec) - 1;
2178 move_rec = left_el->l_recs[i];
2188 le16_add_cpu(&left_el->l_next_free_rec, -1);
2189 ocfs2_shift_records_right(left_el);
2190 memset(&left_el->l_recs[0], 0, sizeof(struct ocfs2_extent_rec));
2191 le16_add_cpu(&left_el->l_next_free_rec, 1);
2308 struct ocfs2_extent_list *left_el;
2312 left_el = path_leaf_el(left_path);
2313 next_free = le16_to_cpu(left_el->l_next_free_rec);
2314 rec = &left_el->l_recs[next_free - 1];
3293 struct ocfs2_extent_list *left_el;
3300 left_el = path_leaf_el(left_path);
3301 BUG_ON(left_el->l_next_free_rec != left_el->l_count);
3521 struct ocfs2_extent_list *left_el;
3534 left_el = path_leaf_el(left_path);
3535 BUG_ON(le16_to_cpu(left_el->l_next_free_rec) !=
3536 le16_to_cpu(left_el->l_count));
3538 left_rec = &left_el->l_recs[
3539 le16_to_cpu(left_el->l_next_free_rec) - 1];
4077 struct ocfs2_extent_list *left_el = NULL, *right_el, *insert_el, *el;
4082 left_el = path_leaf_el(left_path);
4110 insert_el = left_el;
4120 ocfs2_rotate_leaf(left_el, tmprec);
4121 el = left_el;
4124 index = ocfs2_search_extent_list(left_el, cpos);
4130 BUG_ON(!ocfs2_is_empty_extent(&left_el->l_recs[0]));
4135 el = left_el;
4136 insert_el = left_el;