Home
last modified time | relevance | path

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

/fs/ocfs2/
Dalloc.c588 node->el = NULL; in ocfs2_reinit_path()
631 dest->p_node[i].el = src->p_node[i].el; in ocfs2_cp_path()
653 dest->p_node[i].el = src->p_node[i].el; in ocfs2_mv_path()
656 src->p_node[i].el = NULL; in ocfs2_mv_path()
679 path->p_node[index].el = &eb->h_list; in ocfs2_path_insert_eb()
768 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster) in ocfs2_search_extent_list() argument
775 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { in ocfs2_search_extent_list()
776 rec = &el->l_recs[i]; in ocfs2_search_extent_list()
779 clusters = ocfs2_rec_clusters(el, rec); in ocfs2_search_extent_list()
953 struct ocfs2_extent_list *el = NULL; in ocfs2_num_free_extents() local
[all …]
Dextent_map.c283 struct ocfs2_extent_list *el; in ocfs2_last_eb_is_empty() local
292 el = &eb->h_list; in ocfs2_last_eb_is_empty()
294 if (el->l_tree_depth) { in ocfs2_last_eb_is_empty()
303 next_free = le16_to_cpu(el->l_next_free_rec); in ocfs2_last_eb_is_empty()
306 (next_free == 1 && ocfs2_is_empty_extent(&el->l_recs[0]))) in ocfs2_last_eb_is_empty()
318 static int ocfs2_search_for_hole_index(struct ocfs2_extent_list *el, in ocfs2_search_for_hole_index() argument
324 for(i = 0; i < le16_to_cpu(el->l_next_free_rec); i++) { in ocfs2_search_for_hole_index()
325 rec = &el->l_recs[i]; in ocfs2_search_for_hole_index()
346 struct ocfs2_extent_list *el, in ocfs2_figure_hole_clusters() argument
355 i = ocfs2_search_for_hole_index(el, v_cluster); in ocfs2_figure_hole_clusters()
[all …]
Dalloc.h228 int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
234 static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, in ocfs2_rec_clusters() argument
244 if (el->l_tree_depth) in ocfs2_rec_clusters()
273 struct ocfs2_extent_list *el; member
285 #define path_root_el(_path) ((_path)->p_node[0].el)
288 #define path_leaf_el(_path) ((_path)->p_node[(_path)->p_tree_depth].el)
Dextent_map.h50 struct ocfs2_extent_list *el,
58 struct ocfs2_extent_list *el,
Drefcounttree.c959 struct ocfs2_extent_list *el, in ocfs2_get_refcount_cpos_end() argument
970 if (index < le16_to_cpu(el->l_next_free_rec) - 1) { in ocfs2_get_refcount_cpos_end()
975 *cpos_end = le32_to_cpu(el->l_recs[index+1].e_cpos); in ocfs2_get_refcount_cpos_end()
1032 tmp_el = left_path->p_node[subtree_root].el; in ocfs2_get_refcount_cpos_end()
1065 struct ocfs2_extent_list *el; in ocfs2_get_refcount_rec() local
1081 el = &rb->rf_list; in ocfs2_get_refcount_rec()
1084 if (el->l_tree_depth) { in ocfs2_get_refcount_rec()
1085 ret = ocfs2_find_leaf(ci, el, low_cpos, &eb_bh); in ocfs2_get_refcount_rec()
1092 el = &eb->h_list; in ocfs2_get_refcount_rec()
1094 if (el->l_tree_depth) { in ocfs2_get_refcount_rec()
[all …]
Dxattr.c1111 struct ocfs2_extent_list *el; in ocfs2_xattr_get_value_outside() local
1113 el = &xv->xr_list; in ocfs2_xattr_get_value_outside()
1121 &num_clusters, el, NULL); in ocfs2_xattr_get_value_outside()
2656 struct ocfs2_extent_list *el = &di->id2.i_list; in ocfs2_xattr_has_space_inline() local
2657 free = (le16_to_cpu(el->l_count) - in ocfs2_xattr_has_space_inline()
2658 le16_to_cpu(el->l_next_free_rec)) * in ocfs2_xattr_has_space_inline()
2746 struct ocfs2_extent_list *el = &di->id2.i_list; in ocfs2_xattr_ibody_init() local
2747 le16_add_cpu(&el->l_count, -(xattrsize / in ocfs2_xattr_ibody_init()
3203 struct ocfs2_extent_list *el = in ocfs2_calc_xattr_set_need() local
3205 meta_add += ocfs2_extend_meta_needed(el); in ocfs2_calc_xattr_set_need()
[all …]
Dsuballoc.c325 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_bg_discontig_add_extent() local
329 if (!el->l_next_free_rec) in ocfs2_bg_discontig_add_extent()
330 el->l_count = cpu_to_le16(ocfs2_extent_recs_per_gd(osb->sb)); in ocfs2_bg_discontig_add_extent()
331 rec = &el->l_recs[le16_to_cpu(el->l_next_free_rec)]; in ocfs2_bg_discontig_add_extent()
339 le16_add_cpu(&el->l_next_free_rec, 1); in ocfs2_bg_discontig_add_extent()
498 struct ocfs2_extent_list *el = &bg->bg_list; in ocfs2_block_group_grow_discontig() local
509 while ((needed > 0) && (le16_to_cpu(el->l_next_free_rec) < in ocfs2_block_group_grow_discontig()
510 le16_to_cpu(el->l_count))) { in ocfs2_block_group_grow_discontig()
552 struct ocfs2_extent_list *el; in ocfs2_bg_alloc_cleanup() local
559 el = &bg->bg_list; in ocfs2_bg_alloc_cleanup()
[all …]
Dmove_extents.c61 struct ocfs2_extent_list *el; in __ocfs2_move_extent() local
91 el = path_leaf_el(path); in __ocfs2_move_extent()
93 index = ocfs2_search_extent_list(el, cpos); in __ocfs2_move_extent()
101 rec = &el->l_recs[index]; in __ocfs2_move_extent()
Dfile.c1681 static int ocfs2_find_rec(struct ocfs2_extent_list *el, u32 pos) in ocfs2_find_rec() argument
1686 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) { in ocfs2_find_rec()
1688 rec = &el->l_recs[i]; in ocfs2_find_rec()
1706 struct ocfs2_extent_list *el, in ocfs2_calc_trunc_pos() argument
1715 range = le32_to_cpu(rec->e_cpos) + ocfs2_rec_clusters(el, rec); in ocfs2_calc_trunc_pos()
1773 struct ocfs2_extent_list *el = NULL; in ocfs2_remove_inode_range() local
1853 el = path_leaf_el(path); in ocfs2_remove_inode_range()
1855 i = ocfs2_find_rec(el, trunc_end); in ocfs2_remove_inode_range()
1889 rec = &el->l_recs[i]; in ocfs2_remove_inode_range()
1891 ocfs2_calc_trunc_pos(inode, el, rec, trunc_start, &trunc_cpos, in ocfs2_remove_inode_range()
Ddir.c766 struct ocfs2_extent_list *el, in ocfs2_dx_dir_lookup_rec() argument
777 if (el->l_tree_depth) { in ocfs2_dx_dir_lookup_rec()
778 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, major_hash, in ocfs2_dx_dir_lookup_rec()
786 el = &eb->h_list; in ocfs2_dx_dir_lookup_rec()
788 if (el->l_tree_depth) { in ocfs2_dx_dir_lookup_rec()
798 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) { in ocfs2_dx_dir_lookup_rec()
799 rec = &el->l_recs[i]; in ocfs2_dx_dir_lookup_rec()
812 ocfs2_rec_clusters(el, rec)); in ocfs2_dx_dir_lookup_rec()
845 struct ocfs2_extent_list *el, in ocfs2_dx_dir_lookup() argument
856 ret = ocfs2_dx_dir_lookup_rec(inode, el, name_hash, &cpos, &blkno, in ocfs2_dx_dir_lookup()
[all …]
/fs/gfs2/
Dxattr.c176 struct gfs2_ea_location *el = ef->ef_el; in ea_find_i() local
178 el->el_bh = bh; in ea_find_i()
179 el->el_ea = ea; in ea_find_i()
180 el->el_prev = prev; in ea_find_i()
189 struct gfs2_ea_location *el) in gfs2_ea_find() argument
197 ef.ef_el = el; in gfs2_ea_find()
199 memset(el, 0, sizeof(struct gfs2_ea_location)); in gfs2_ea_find()
504 static int gfs2_ea_get_copy(struct gfs2_inode *ip, struct gfs2_ea_location *el, in gfs2_ea_get_copy() argument
508 size_t len = GFS2_EA_DATA_LEN(el->el_ea); in gfs2_ea_get_copy()
512 if (GFS2_EA_IS_STUFFED(el->el_ea)) { in gfs2_ea_get_copy()
[all …]
/fs/cifs/
Dfile.c1281 struct list_head locks_to_send, *el; in cifs_push_posix_locks() local
1291 list_for_each(el, &flctx->flc_posix) { in cifs_push_posix_locks()
1312 el = locks_to_send.next; in cifs_push_posix_locks()
1315 if (el == &locks_to_send) { in cifs_push_posix_locks()
1328 lck = list_entry(el, struct lock_to_push, llist); in cifs_push_posix_locks()