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 	if (le16_to_cpu(el->l_next_free_rec) > le16_to_cpu(el->l_count)) {
442 			    le16_to_cpu(el->l_next_free_rec),
443 			    le16_to_cpu(el->l_count));
448 	i = ocfs2_search_extent_list(el, v_cluster);
457 							 el, eb_bh,
469 	rec = &el->l_recs[i];
478 			    ocfs2_rec_clusters(el, rec));
501 		if (i == (le16_to_cpu(el->l_next_free_rec) - 1)) {
542 			     struct ocfs2_extent_list *el,
551 	if (el->l_tree_depth) {
552 		ret = ocfs2_find_leaf(INODE_CACHE(inode), el, v_cluster,
560 		el = &eb->h_list;
562 		if (el->l_tree_depth) {
572 	i = ocfs2_search_extent_list(el, v_cluster);
578 		rec = &el->l_recs[i];
586 				    ocfs2_rec_clusters(el, rec));
595 			*num_clusters = ocfs2_rec_clusters(el, rec) - coff;