Home
last modified time | relevance | path

Searched refs:ulist (Results 1 – 13 of 13) sorted by relevance

/fs/btrfs/
Dulist.c47 void ulist_init(struct ulist *ulist) in ulist_init() argument
49 INIT_LIST_HEAD(&ulist->nodes); in ulist_init()
50 ulist->root = RB_ROOT; in ulist_init()
51 ulist->nnodes = 0; in ulist_init()
61 void ulist_release(struct ulist *ulist) in ulist_release() argument
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
69 ulist->root = RB_ROOT; in ulist_release()
70 INIT_LIST_HEAD(&ulist->nodes); in ulist_release()
80 void ulist_reinit(struct ulist *ulist) in ulist_reinit() argument
82 ulist_release(ulist); in ulist_reinit()
[all …]
Dulist.h35 struct ulist { struct
45 void ulist_init(struct ulist *ulist); argument
46 void ulist_release(struct ulist *ulist);
47 void ulist_reinit(struct ulist *ulist);
48 struct ulist *ulist_alloc(gfp_t gfp_mask);
49 void ulist_free(struct ulist *ulist);
50 int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask);
51 int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux,
53 int ulist_del(struct ulist *ulist, u64 val, u64 aux);
56 static inline int ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, in ulist_add_merge_ptr() argument
[all …]
Dbackref.h45 u64 time_seq, struct ulist **roots, bool ignore_offset);
61 struct ulist *roots, struct ulist *tmp_ulist);
Dqgroup.h121 struct ulist *old_roots;
331 u64 num_bytes, struct ulist *old_roots,
332 struct ulist *new_roots);
Dbackref.c413 struct ulist *parents, struct prelim_ref *ref, in add_all_parents()
505 struct prelim_ref *ref, struct ulist *parents, in resolve_indirect_ref()
617 struct ulist *parents; in resolve_indirect_refs()
1115 u64 time_seq, struct ulist *refs,
1116 struct ulist *roots, const u64 *extent_item_pos,
1339 static void free_leaf_list(struct ulist *blocks)
1367 u64 time_seq, struct ulist **leafs,
1401 u64 time_seq, struct ulist **roots,
1404 struct ulist *tmp;
1440 u64 time_seq, struct ulist **roots,
[all …]
Dqgroup.c1140 struct ulist *tmp, u64 ref_root, in __qgroup_excl_accounting()
1217 struct ulist *tmp, u64 src, u64 dst, in quick_update_accounting()
1250 struct ulist *tmp; in btrfs_add_qgroup_relation()
1314 struct ulist *tmp; in __del_qgroup_relation()
1581 struct ulist *old_root; in btrfs_qgroup_trace_extent_post()
2208 struct ulist *roots, struct ulist *tmp, in qgroup_update_refcnt()
2209 struct ulist *qgroups, u64 seq, int update_old) in qgroup_update_refcnt()
2297 struct ulist *qgroups, in qgroup_update_counters()
2392 static int maybe_fs_roots(struct ulist *roots) in maybe_fs_roots()
2415 u64 num_bytes, struct ulist *old_roots, in btrfs_qgroup_account_extent()
[all …]
DMakefile12 reada.o backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
Dextent_io.h206 struct ulist range_changed;
Dextent_io.c4600 struct ulist *roots; in extent_fiemap()
4601 struct ulist *tmp_ulist; in extent_fiemap()
Dctree.h832 struct ulist *qgroup_ulist;
/fs/btrfs/tests/
Dqgroup-tests.c212 struct ulist *old_roots = NULL; in test_no_shared_qgroup()
213 struct ulist *new_roots = NULL; in test_no_shared_qgroup()
313 struct ulist *old_roots = NULL; in test_multiple_refs()
314 struct ulist *new_roots = NULL; in test_multiple_refs()
/fs/cifs/
Ddfs_cache.c1272 list_add_tail(&tcon->ulist, head); in get_tcons()
1277 list_add_tail(&ses->tcon_ipc->ulist, head); in get_tcons()
1467 list_for_each_entry_safe(tcon, ntcon, &list, ulist) { in refresh_cache_worker()
1469 list_del_init(&tcon->ulist); in refresh_cache_worker()
Dcifsglob.h1120 struct list_head ulist; /* cache update list */ member