Lines Matching defs:el
283 struct ocfs2_extent_list *el;
292 el = &eb->h_list;
294 if (el->l_tree_depth) {
303 next_free = le16_to_cpu(el->l_next_free_rec);
306 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0])))
315 * Return the 1st index within el which contains an extent start
318 static int ocfs2_search_for_hole_index(struct ocfs2_extent_list *el,
324 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) {
325 rec = &el->l_recs[i];
341 * If we have in-inode extents, then el points to the dinode list and
343 * containing el.
346 struct ocfs2_extent_list *el,
355 i = ocfs2_search_for_hole_index(el, v_cluster);
357 if (i == le16_to_cpu(el->l_next_free_rec) && eb_bh) {
376 el = &next_eb->h_list;
377 i = ocfs2_search_for_hole_index(el, v_cluster);
381 if (i == le16_to_cpu(el->l_next_free_rec)) {
389 *num_clusters = le32_to_cpu(el->l_recs[i].e_cpos) - v_cluster;
407 struct ocfs2_extent_list *el;
416 el = &di->id2.i_list;
417 tree_height = le16_to_cpu(el->l_tree_depth);
420 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, v_cluster,
428 el = &eb->h_list;
430 if (el->l_tree_depth) {
440 i = ocfs2_search_extent_list(el, v_cluster);
449 el, eb_bh,
461 rec = &el->l_recs[i];
470 ocfs2_rec_clusters(el, rec));
493 if (i == (le16_to_cpu(el->l_next_free_rec) - 1)) {
534 struct ocfs2_extent_list *el,
543 if (el->l_tree_depth) {
544 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, v_cluster,
552 el = &eb->h_list;
554 if (el->l_tree_depth) {
564 i = ocfs2_search_extent_list(el, v_cluster);
570 rec = &el->l_recs[i];
578 ocfs2_rec_clusters(el, rec));
587 *num_clusters = ocfs2_rec_clusters(el, rec) - coff;