Lines Matching refs:el
281 struct ocfs2_extent_list *el;
290 el = &eb->h_list;
292 if (el->l_tree_depth) {
301 next_free = le16_to_cpu(el->l_next_free_rec);
304 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0])))
313 * Return the 1st index within el which contains an extent start
316 static int ocfs2_search_for_hole_index(struct ocfs2_extent_list *el,
322 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
323 rec = &el->l_recs[i];
339 * If we have in-inode extents, then el points to the dinode list and
341 * containing el.
344 struct ocfs2_extent_list *el,
353 i = ocfs2_search_for_hole_index(el, v_cluster);
355 if (i == le16_to_cpu(el->l_next_free_rec) && eb_bh) {
374 el = &next_eb->h_list;
375 i = ocfs2_search_for_hole_index(el, v_cluster);
379 if (i == le16_to_cpu(el->l_next_free_rec)) {
387 *num_clusters = le32_to_cpu(el->l_recs[i].e_cpos) - v_cluster;
405 struct ocfs2_extent_list *el;
414 el = &di->id2.i_list;
415 tree_height = le16_to_cpu(el->l_tree_depth);
418 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, v_cluster,
426 el = &eb->h_list;
428 if (el->l_tree_depth) {
438 i = ocfs2_search_extent_list(el, v_cluster);
447 el, eb_bh,
459 rec = &el->l_recs[i];
468 ocfs2_rec_clusters(el, rec));
491 if (i == (le16_to_cpu(el->l_next_free_rec) - 1)) {
532 struct ocfs2_extent_list *el,
541 if (el->l_tree_depth) {
542 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, v_cluster,
550 el = &eb->h_list;
552 if (el->l_tree_depth) {
562 i = ocfs2_search_extent_list(el, v_cluster);
568 rec = &el->l_recs[i];
576 ocfs2_rec_clusters(el, rec));
585 *num_clusters = ocfs2_rec_clusters(el, rec) - coff;