| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ulist.c | 8 #include "ulist.h"
12 * ulist is a generic data structure to hold a collection of unique u64
20 * ulist = ulist_alloc();
21 * ulist_add(ulist, root);
24 * while ((elem = ulist_next(ulist, &uiter)) {
26 * ulist_add(ulist, n);
29 * ulist_free(ulist);
41 * ulist_init - freshly initialize a ulist
42 * @ulist: the ulist t
47 ulist_init(struct ulist *ulist) ulist_init() argument
61 ulist_release(struct ulist *ulist) ulist_release() argument
80 ulist_reinit(struct ulist *ulist) ulist_reinit() argument
94 struct ulist *ulist = kmalloc(sizeof(*ulist), gfp_mask); ulist_alloc() local
110 ulist_free(struct ulist *ulist) ulist_free() argument
118 ulist_rbtree_search(struct ulist *ulist, u64 val) ulist_rbtree_search() argument
135 ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) ulist_rbtree_erase() argument
144 ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) ulist_rbtree_insert() argument
186 ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask) ulist_add() argument
191 ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, u64 *old_aux, gfp_t gfp_mask) ulist_add_merge() argument
228 ulist_del(struct ulist *ulist, u64 val, u64 aux) ulist_del() argument
261 ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) ulist_next() argument
[all...] |
| H A D | ulist.h | 14 * ulist is a generic data structure to hold a collection of unique u64
35 struct ulist { struct
45 void ulist_init(struct ulist *ulist);
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 *ulis
56 ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, void **old_aux, gfp_t gfp_mask) ulist_add_merge_ptr() argument
[all...] |
| H A D | backref.h | 10 #include "ulist.h"
45 u64 time_seq, struct ulist **leafs,
49 u64 time_seq, struct ulist **roots, bool ignore_offset);
65 struct ulist *roots, struct ulist *tmp_ulist);
|
| H A D | qgroup.h | 12 #include "ulist.h"
122 struct ulist *old_roots;
342 u64 num_bytes, struct ulist *old_roots,
343 struct ulist *new_roots);
|
| H A D | qgroup.c | 20 #include "ulist.h"
940 struct ulist *ulist = NULL; in btrfs_quota_enable() local
956 ulist = ulist_alloc(GFP_KERNEL); in btrfs_quota_enable()
957 if (!ulist) { in btrfs_quota_enable()
1001 fs_info->qgroup_ulist = ulist; in btrfs_quota_enable()
1002 ulist = NULL; in btrfs_quota_enable()
1194 ulist_free(ulist); in btrfs_quota_enable()
1328 struct ulist *tmp, u64 ref_root, in __qgroup_excl_accounting()
1405 struct ulist *tm in quick_update_accounting()
[all...] |
| H A D | backref.c | 12 #include "ulist.h"
419 struct ulist *parents, in add_all_parents()
544 struct prelim_ref *ref, struct ulist *parents, in resolve_indirect_ref()
656 static void free_leaf_list(struct ulist *ulist) in free_leaf_list() argument
662 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
665 ulist_free(ulist); in free_leaf_list()
692 struct ulist *parents; in resolve_indirect_refs()
783 * We may have inode lists attached to refs in the parents ulist, so we in resolve_indirect_refs()
784 * must free them before freeing the ulist an in resolve_indirect_refs()
[all...] |
| H A D | extent_io.h | 9 #include "ulist.h"
127 struct ulist range_changed;
|
| H A D | extent_io.c | 4686 struct ulist *roots; in extent_fiemap()
4687 struct ulist *tmp_ulist; in extent_fiemap()
|
| H A D | ctree.h | 885 struct ulist *qgroup_ulist;
|
| H A D | relocation.c | 3081 struct ulist *leaves = NULL; in add_data_references()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ulist.c | 9 #include "ulist.h"
13 * ulist is a generic data structure to hold a collection of unique u64
21 * ulist = ulist_alloc();
22 * ulist_add(ulist, root);
25 * while ((elem = ulist_next(ulist, &uiter)) {
27 * ulist_add(ulist, n);
30 * ulist_free(ulist);
42 * Freshly initialize a ulist.
44 * @ulist: the ulist t
49 ulist_init(struct ulist *ulist) ulist_init() argument
64 ulist_release(struct ulist *ulist) ulist_release() argument
84 ulist_reinit(struct ulist *ulist) ulist_reinit() argument
99 struct ulist *ulist = kmalloc(sizeof(*ulist), gfp_mask); ulist_alloc() local
116 ulist_free(struct ulist *ulist) ulist_free() argument
124 ulist_rbtree_search(struct ulist *ulist, u64 val) ulist_rbtree_search() argument
141 ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) ulist_rbtree_erase() argument
150 ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) ulist_rbtree_insert() argument
193 ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask) ulist_add() argument
198 ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, u64 *old_aux, gfp_t gfp_mask) ulist_add_merge() argument
235 ulist_del(struct ulist *ulist, u64 val, u64 aux) ulist_del() argument
269 ulist_next(const struct ulist *ulist, struct ulist_iterator *uiter) ulist_next() argument
[all...] |
| H A D | ulist.h | 14 * ulist is a generic data structure to hold a collection of unique u64
35 struct ulist { struct
45 void ulist_init(struct ulist *ulist);
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 *ulis
56 ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, void **old_aux, gfp_t gfp_mask) ulist_add_merge_ptr() argument
[all...] |
| H A D | backref.h | 11 #include "ulist.h"
66 * added to each reference added to the @refs ulist.
90 struct ulist *refs;
96 struct ulist *roots;
105 void (*cache_store)(u64 leaf_bytenr, const struct ulist *root_ids,
154 struct ulist refs;
|
| H A D | qgroup.h | 12 #include "ulist.h"
126 struct ulist *old_roots;
357 u64 num_bytes, struct ulist *old_roots,
358 struct ulist *new_roots);
|
| H A D | qgroup.c | 20 #include "ulist.h"
964 struct ulist *ulist = NULL; in btrfs_quota_enable() local
986 ulist = ulist_alloc(GFP_KERNEL); in btrfs_quota_enable()
987 if (!ulist) { in btrfs_quota_enable()
1031 fs_info->qgroup_ulist = ulist; in btrfs_quota_enable()
1032 ulist = NULL; in btrfs_quota_enable()
1225 ulist_free(ulist); in btrfs_quota_enable()
1379 struct ulist *tmp, u64 ref_root, in __qgroup_excl_accounting()
1456 struct ulist *tm in quick_update_accounting()
[all...] |
| H A D | Makefile | 32 backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
|
| H A D | extent_io.h | 11 #include "ulist.h"
144 struct ulist range_changed;
|
| H A D | backref.c | 12 #include "ulist.h"
473 struct ulist *parents, in add_all_parents()
597 struct prelim_ref *ref, struct ulist *parents) in resolve_indirect_ref()
707 static void free_leaf_list(struct ulist *ulist) in free_leaf_list() argument
713 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
716 ulist_free(ulist); in free_leaf_list()
742 struct ulist *parents; in resolve_indirect_refs()
830 * We may have inode lists attached to refs in the parents ulist, so we in resolve_indirect_refs()
831 * must free them before freeing the ulist an in resolve_indirect_refs()
[all...] |
| H A D | fs.h | 662 struct ulist *qgroup_ulist;
|
| /kernel/linux/linux-5.10/tools/perf/ |
| H A D | builtin-probe.c | 424 struct strlist *klist = NULL, *ulist = NULL; in perf_del_probe_events() local
441 ulist = strlist__new(NULL, NULL); in perf_del_probe_events()
442 if (!klist || !ulist) { in perf_del_probe_events()
458 ret2 = probe_file__get_events(ufd, filter, ulist); in perf_del_probe_events()
460 strlist__for_each_entry(ent, ulist) in perf_del_probe_events()
463 ret2 = probe_file__del_strlist(ufd, ulist); in perf_del_probe_events()
481 strlist__delete(ulist); in perf_del_probe_events()
|
| /kernel/linux/linux-6.6/tools/perf/ |
| H A D | builtin-probe.c | 445 struct strlist *klist = NULL, *ulist = NULL; in perf_del_probe_events() local
462 ulist = strlist__new(NULL, NULL); in perf_del_probe_events()
463 if (!klist || !ulist) { in perf_del_probe_events()
479 ret2 = probe_file__get_events(ufd, filter, ulist); in perf_del_probe_events()
481 strlist__for_each_entry(ent, ulist) in perf_del_probe_events()
484 ret2 = probe_file__del_strlist(ufd, ulist); in perf_del_probe_events()
502 strlist__delete(ulist); in perf_del_probe_events()
|
| /kernel/linux/linux-5.10/fs/btrfs/tests/ |
| H A D | qgroup-tests.c | 212 struct ulist *old_roots = NULL; in test_no_shared_qgroup()
213 struct ulist *new_roots = NULL; in test_no_shared_qgroup()
315 struct ulist *old_roots = NULL; in test_multiple_refs()
316 struct ulist *new_roots = NULL; in test_multiple_refs()
|
| /kernel/linux/linux-6.6/fs/btrfs/tests/ |
| H A D | qgroup-tests.c | 211 struct ulist *old_roots = NULL; in test_no_shared_qgroup()
212 struct ulist *new_roots = NULL; in test_no_shared_qgroup()
323 struct ulist *old_roots = NULL; in test_multiple_refs()
324 struct ulist *new_roots = NULL; in test_multiple_refs()
|
| /kernel/linux/linux-5.10/fs/cifs/ |
| H A D | dfs_cache.c | 1404 list_add_tail(&tcon->ulist, head); in get_tcons()
1409 list_add_tail(&ses->tcon_ipc->ulist, head); in get_tcons()
1645 list_for_each_entry_safe(tcon, ntcon, &tcons, ulist) { in refresh_cache_worker()
1653 list_del_init(&tcon->ulist); in refresh_cache_worker()
|
| H A D | cifsglob.h | 1181 struct list_head ulist; /* cache update list */ member
|