Home
last modified time | relevance | path

Searched refs:elem (Results 1 – 8 of 8) sorted by relevance

/fs/xfs/
Dxfs_mru_cache.c192 struct xfs_mru_cache_elem *elem) in _xfs_mru_cache_list_insert() argument
215 list_add_tail(&elem->list_node, mru->lists + grp); in _xfs_mru_cache_list_insert()
232 struct xfs_mru_cache_elem *elem, *next; in _xfs_mru_cache_clear_reap_list() local
236 list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) { in _xfs_mru_cache_clear_reap_list()
239 radix_tree_delete(&mru->store, elem->key); in _xfs_mru_cache_clear_reap_list()
245 list_move(&elem->list_node, &tmp); in _xfs_mru_cache_clear_reap_list()
249 list_for_each_entry_safe(elem, next, &tmp, list_node) { in _xfs_mru_cache_clear_reap_list()
250 list_del_init(&elem->list_node); in _xfs_mru_cache_clear_reap_list()
251 mru->free_func(mru->data, elem); in _xfs_mru_cache_clear_reap_list()
422 struct xfs_mru_cache_elem *elem) in xfs_mru_cache_insert() argument
[all …]
Dxfs_mru_cache.h26 struct xfs_mru_cache_elem *elem);
/fs/nfs_common/
Dnfsacl.c49 xdr_nfsace_encode(struct xdr_array2_desc *desc, void *elem) in xdr_nfsace_encode() argument
53 __be32 *p = elem; in xdr_nfsace_encode()
146 xdr_nfsace_decode(struct xdr_array2_desc *desc, void *elem) in xdr_nfsace_decode() argument
150 __be32 *p = elem; in xdr_nfsace_decode()
/fs/btrfs/
Ddelayed-ref.c496 struct seq_list *elem; in btrfs_merge_delayed_refs() local
498 elem = list_first_entry(&fs_info->tree_mod_seq_list, in btrfs_merge_delayed_refs()
500 seq = elem->seq; in btrfs_merge_delayed_refs()
517 struct seq_list *elem; in btrfs_check_delayed_seq() local
522 elem = list_first_entry(&fs_info->tree_mod_seq_list, in btrfs_check_delayed_seq()
524 if (seq >= elem->seq) { in btrfs_check_delayed_seq()
528 (u32)(elem->seq >> 32), (u32)elem->seq); in btrfs_check_delayed_seq()
Dctree.c294 struct seq_list *elem) in btrfs_get_tree_mod_seq() argument
297 if (!elem->seq) { in btrfs_get_tree_mod_seq()
298 elem->seq = btrfs_inc_tree_mod_seq(fs_info); in btrfs_get_tree_mod_seq()
299 list_add_tail(&elem->list, &fs_info->tree_mod_seq_list); in btrfs_get_tree_mod_seq()
303 return elem->seq; in btrfs_get_tree_mod_seq()
307 struct seq_list *elem) in btrfs_put_tree_mod_seq() argument
314 u64 seq_putting = elem->seq; in btrfs_put_tree_mod_seq()
320 list_del(&elem->list); in btrfs_put_tree_mod_seq()
321 elem->seq = 0; in btrfs_put_tree_mod_seq()
Dbackref.c1571 struct seq_list elem = SEQ_LIST_INIT(elem); local
1592 btrfs_get_tree_mod_seq(fs_info, &elem);
1597 ret = find_parent_nodes(trans, fs_info, bytenr, elem.seq, tmp,
1617 btrfs_put_tree_mod_seq(fs_info, &elem);
Dctree.h2829 struct seq_list *elem);
2831 struct seq_list *elem);
/fs/nfsd/
Dnfs4state.c1889 struct nfsd4_session *elem; in __find_in_sessionid_hashtbl() local
1898 list_for_each_entry(elem, &nn->sessionid_hashtbl[idx], se_hash) { in __find_in_sessionid_hashtbl()
1899 if (!memcmp(elem->se_sessionid.data, sessionid->data, in __find_in_sessionid_hashtbl()
1901 return elem; in __find_in_sessionid_hashtbl()