Home
last modified time | relevance | path

Searched refs:el (Results 1 – 12 of 12) sorted by relevance

/fs/ocfs2/
Dalloc.c593 node->el = NULL; in ocfs2_reinit_path()
636 dest->p_node[i].el = src->p_node[i].el; in ocfs2_cp_path()
658 dest->p_node[i].el = src->p_node[i].el; in ocfs2_mv_path()
661 src->p_node[i].el = NULL; in ocfs2_mv_path()
684 path->p_node[index].el = &eb->h_list; in ocfs2_path_insert_eb()
773 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster) in ocfs2_search_extent_list() argument
780 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { in ocfs2_search_extent_list()
781 rec = &el->l_recs[i]; in ocfs2_search_extent_list()
784 clusters = ocfs2_rec_clusters(el, rec); in ocfs2_search_extent_list()
961 struct ocfs2_extent_list *el = NULL; in ocfs2_num_free_extents() local
[all …]
Dextent_map.c295 struct ocfs2_extent_list *el; in ocfs2_last_eb_is_empty() local
304 el = &eb->h_list; in ocfs2_last_eb_is_empty()
306 if (el->l_tree_depth) { in ocfs2_last_eb_is_empty()
315 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_last_eb_is_empty()
318 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) in ocfs2_last_eb_is_empty()
330 static int ocfs2_search_for_hole_index(struct ocfs2_extent_list *el, in ocfs2_search_for_hole_index() argument
336 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { in ocfs2_search_for_hole_index()
337 rec = &el->l_recs[i]; in ocfs2_search_for_hole_index()
358 struct ocfs2_extent_list *el, in ocfs2_figure_hole_clusters() argument
367 i = ocfs2_search_for_hole_index(el, v_cluster); in ocfs2_figure_hole_clusters()
[all …]
Dalloc.h240 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
246 static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, in ocfs2_rec_clusters() argument
256 if (el->l_tree_depth) in ocfs2_rec_clusters()
285 struct ocfs2_extent_list *el; member
297 #define path_root_el(_path) ((_path)->p_node[0].el)
300 #define path_leaf_el(_path) ((_path)->p_node[(_path)->p_tree_depth].el)
Dextent_map.h60 struct ocfs2_extent_list *el,
68 struct ocfs2_extent_list *el,
Drefcounttree.c967 struct ocfs2_extent_list *el, in ocfs2_get_refcount_cpos_end() argument
978 if (index < le16_to_cpu(el->l_next_free_rec) - 1) { in ocfs2_get_refcount_cpos_end()
983 *cpos_end = le32_to_cpu(el->l_recs[index+1].e_cpos); in ocfs2_get_refcount_cpos_end()
1040 tmp_el = left_path->p_node[subtree_root].el; in ocfs2_get_refcount_cpos_end()
1073 struct ocfs2_extent_list *el; in ocfs2_get_refcount_rec() local
1089 el = &rb->rf_list; in ocfs2_get_refcount_rec()
1092 if (el->l_tree_depth) { in ocfs2_get_refcount_rec()
1093 ret = ocfs2_find_leaf(ci, el, low_cpos, &eb_bh); in ocfs2_get_refcount_rec()
1100 el = &eb->h_list; in ocfs2_get_refcount_rec()
1102 if (el->l_tree_depth) { in ocfs2_get_refcount_rec()
[all …]
Dxattr.c1097 struct ocfs2_extent_list *el; in ocfs2_xattr_get_value_outside() local
1099 el = &xv->xr_list; in ocfs2_xattr_get_value_outside()
1107 &num_clusters, el, NULL); in ocfs2_xattr_get_value_outside()
2641 struct ocfs2_extent_list *el = &di->id2.i_list; in ocfs2_xattr_has_space_inline() local
2642 free = (le16_to_cpu(el->l_count) - in ocfs2_xattr_has_space_inline()
2643 le16_to_cpu(el->l_next_free_rec)) * in ocfs2_xattr_has_space_inline()
2731 struct ocfs2_extent_list *el = &di->id2.i_list; in ocfs2_xattr_ibody_init() local
2732 le16_add_cpu(&el->l_count, -(xattrsize / in ocfs2_xattr_ibody_init()
3188 struct ocfs2_extent_list *el = in ocfs2_calc_xattr_set_need() local
3190 meta_add += ocfs2_extend_meta_needed(el); in ocfs2_calc_xattr_set_need()
[all …]
Dsuballoc.c341 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_bg_discontig_add_extent() local
345 if (!el->l_next_free_rec) in ocfs2_bg_discontig_add_extent()
346 el->l_count = cpu_to_le16(ocfs2_extent_recs_per_gd(osb->sb)); in ocfs2_bg_discontig_add_extent()
347 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec)]; in ocfs2_bg_discontig_add_extent()
355 le16_add_cpu(&el->l_next_free_rec, 1); in ocfs2_bg_discontig_add_extent()
514 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_block_group_grow_discontig() local
525 while ((needed > 0) && (le16_to_cpu(el->l_next_free_rec) < in ocfs2_block_group_grow_discontig()
526 le16_to_cpu(el->l_count))) { in ocfs2_block_group_grow_discontig()
568 struct ocfs2_extent_list *el; in ocfs2_bg_alloc_cleanup() local
575 el = &bg->bg_list; in ocfs2_bg_alloc_cleanup()
[all …]
Dfile.c1684 static int ocfs2_find_rec(struct ocfs2_extent_list *el, u32 pos) in ocfs2_find_rec() argument
1689 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) { in ocfs2_find_rec()
1691 rec = &el->l_recs[i]; in ocfs2_find_rec()
1709 struct ocfs2_extent_list *el, in ocfs2_calc_trunc_pos() argument
1718 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); in ocfs2_calc_trunc_pos()
1776 struct ocfs2_extent_list *el = NULL; in ocfs2_remove_inode_range() local
1857 el = path_leaf_el(path); in ocfs2_remove_inode_range()
1859 i = ocfs2_find_rec(el, trunc_end); in ocfs2_remove_inode_range()
1893 rec = &el->l_recs[i]; in ocfs2_remove_inode_range()
1895 ocfs2_calc_trunc_pos(inode, el, rec, trunc_start, &trunc_cpos, in ocfs2_remove_inode_range()
Dmove_extents.c69 struct ocfs2_extent_list *el; in __ocfs2_move_extent() local
99 el = path_leaf_el(path); in __ocfs2_move_extent()
101 index = ocfs2_search_extent_list(el, cpos); in __ocfs2_move_extent()
109 rec = &el->l_recs[index]; in __ocfs2_move_extent()
Ddir.c783 struct ocfs2_extent_list *el, in ocfs2_dx_dir_lookup_rec() argument
794 if (el->l_tree_depth) { in ocfs2_dx_dir_lookup_rec()
795 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, major_hash, in ocfs2_dx_dir_lookup_rec()
803 el = &eb->h_list; in ocfs2_dx_dir_lookup_rec()
805 if (el->l_tree_depth) { in ocfs2_dx_dir_lookup_rec()
815 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) { in ocfs2_dx_dir_lookup_rec()
816 rec = &el->l_recs[i]; in ocfs2_dx_dir_lookup_rec()
829 ocfs2_rec_clusters(el, rec)); in ocfs2_dx_dir_lookup_rec()
862 struct ocfs2_extent_list *el, in ocfs2_dx_dir_lookup() argument
873 ret = ocfs2_dx_dir_lookup_rec(inode, el, name_hash, &cpos, &blkno, in ocfs2_dx_dir_lookup()
[all …]
/fs/gfs2/
Dxattr.c178 struct gfs2_ea_location *el = ef->ef_el; in ea_find_i() local
180 el->el_bh = bh; in ea_find_i()
181 el->el_ea = ea; in ea_find_i()
182 el->el_prev = prev; in ea_find_i()
191 struct gfs2_ea_location *el) in gfs2_ea_find() argument
199 ef.ef_el = el; in gfs2_ea_find()
201 memset(el, 0, sizeof(struct gfs2_ea_location)); in gfs2_ea_find()
527 static int gfs2_ea_get_copy(struct gfs2_inode *ip, struct gfs2_ea_location *el, in gfs2_ea_get_copy() argument
531 size_t len = GFS2_EA_DATA_LEN(el->el_ea); in gfs2_ea_get_copy()
535 if (GFS2_EA_IS_STUFFED(el->el_ea)) { in gfs2_ea_get_copy()
[all …]
/fs/cifs/
Dfile.c1173 struct list_head locks_to_send, *el; in cifs_push_posix_locks() local
1183 list_for_each(el, &flctx->flc_posix) { in cifs_push_posix_locks()
1204 el = locks_to_send.next; in cifs_push_posix_locks()
1207 if (el == &locks_to_send) { in cifs_push_posix_locks()
1220 lck = list_entry(el, struct lock_to_push, llist); in cifs_push_posix_locks()