| /fs/btrfs/ |
| H A D | qgroup.h | 56 struct seq_list elem; member in struct:btrfs_qgroup_operation
|
| H A D | delayed-ref.c | 349 struct seq_list *elem; local
351 elem = list_first_entry(&fs_info->tree_mod_seq_list,
353 seq = elem->seq;
377 struct seq_list *elem; local
382 elem = list_first_entry(&fs_info->tree_mod_seq_list,
384 if (seq >= elem->seq) {
387 (u32)(elem->seq >> 32), (u32)elem->seq,
|
| H A D | qgroup.c | 1339 INIT_LIST_HEAD(&oper->elem.list);
1340 oper->elem.seq = 0;
1370 btrfs_get_tree_mod_seq(fs_info, &oper->elem);
1784 oper->elem.seq, &roots);
1797 btrfs_put_tree_mod_seq(fs_info, &oper->elem);
1849 struct seq_list elem = {}; local
1855 if (oper->elem.seq) {
1873 btrfs_get_tree_mod_seq(fs_info, &elem);
1874 ret = btrfs_find_all_roots(trans, fs_info, oper->bytenr, elem.seq,
1876 btrfs_put_tree_mod_seq(fs_info, &elem);
1971 struct seq_list elem = {}; local
[all...] |
| H A D | backref.c | 1209 struct seq_list elem = {}; local
1221 btrfs_get_tree_mod_seq(fs_info, &elem);
1226 ret = find_parent_nodes(trans, fs_info, bytenr, elem.seq, tmp,
1241 btrfs_put_tree_mod_seq(fs_info, &elem);
|
| H A D | check-integrity.c | 536 struct list_head *elem; local
538 list_for_each(elem, h->table + hashval) {
540 list_entry(elem, struct btrfsic_block,
593 struct list_head *elem; local
595 list_for_each(elem, h->table + hashval) {
597 list_entry(elem, struct btrfsic_block_link,
644 struct list_head *elem; local
646 list_for_each(elem, h->table + hashval) {
648 list_entry(elem, struct btrfsic_dev_state,
|
| H A D | ctree.c | 356 * This adds a new blocker to the tree mod log's blocker list if the @elem
358 * to record tree modifications, it should ensure to set elem->seq to zero
364 struct seq_list *elem)
368 if (!elem->seq) {
369 elem->seq = btrfs_inc_tree_mod_seq(fs_info);
370 list_add_tail(&elem->list, &fs_info->tree_mod_seq_list);
375 return elem->seq;
379 struct seq_list *elem)
387 u64 seq_putting = elem->seq;
393 list_del(&elem
363 btrfs_get_tree_mod_seq(struct btrfs_fs_info *fs_info, struct seq_list *elem) argument
378 btrfs_put_tree_mod_seq(struct btrfs_fs_info *fs_info, struct seq_list *elem) argument
[all...] |
| /fs/nfs_common/ |
| H A D | nfsacl.c | 48 xdr_nfsace_encode(struct xdr_array2_desc *desc, void *elem) argument
52 __be32 *p = elem;
145 xdr_nfsace_decode(struct xdr_array2_desc *desc, void *elem) argument
149 __be32 *p = elem;
|
| /fs/xfs/ |
| H A D | xfs_mru_cache.c | 203 struct xfs_mru_cache_elem *elem)
226 list_add_tail(&elem->list_node, mru->lists + grp);
243 struct xfs_mru_cache_elem *elem, *next; variable in typeref:struct:xfs_mru_cache_elem
247 list_for_each_entry_safe(elem, next, &mru->reap_list, list_node) {
250 radix_tree_delete(&mru->store, elem->key);
256 list_move(&elem->list_node, &tmp);
260 list_for_each_entry_safe(elem, next, &tmp, list_node) {
261 list_del_init(&elem->list_node);
262 mru->free_func(elem);
432 struct xfs_mru_cache_elem *elem)
201 _xfs_mru_cache_list_insert( struct xfs_mru_cache *mru, struct xfs_mru_cache_elem *elem) argument
429 xfs_mru_cache_insert( struct xfs_mru_cache *mru, unsigned long key, struct xfs_mru_cache_elem *elem) argument
467 struct xfs_mru_cache_elem *elem; local
491 struct xfs_mru_cache_elem *elem; local
523 struct xfs_mru_cache_elem *elem; local
[all...] |
| /fs/nfsd/ |
| H A D | nfs4state.c | 1461 struct nfsd4_session *elem; local
1470 list_for_each_entry(elem, &nn->sessionid_hashtbl[idx], se_hash) {
1471 if (!memcmp(elem->se_sessionid.data, sessionid->data,
1473 return elem;
|