Searched refs:ulist (Results 1 - 12 of 12) sorted by relevance
| /linux-master/fs/btrfs/ |
| H A D | ulist.h | 15 * ulist is a generic data structure to hold a collection of unique u64
36 struct ulist { struct
46 void ulist_init(struct ulist *ulist);
47 void ulist_release(struct ulist *ulist);
48 void ulist_reinit(struct ulist *ulist);
49 struct ulist *ulist_alloc(gfp_t gfp_mask);
50 void ulist_free(struct ulist *ulis
57 ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, void **old_aux, gfp_t gfp_mask) argument
[all...] |
| H A D | ulist.c | 9 #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 * Freshly initialize a ulist.
43 * @ulist: the ulist t
48 ulist_init(struct ulist *ulist) argument
63 ulist_release(struct ulist *ulist) argument
83 ulist_reinit(struct ulist *ulist) argument
98 struct ulist *ulist = kmalloc(sizeof(*ulist), gfp_mask); local
115 ulist_free(struct ulist *ulist) argument
123 ulist_rbtree_search(struct ulist *ulist, u64 val) argument
140 ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) argument
149 ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) argument
192 ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask) argument
197 ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, u64 *old_aux, gfp_t gfp_mask) argument
235 ulist_del(struct ulist *ulist, u64 val, u64 aux) argument
269 ulist_next(const struct ulist *ulist, struct ulist_iterator *uiter) argument
[all...] |
| H A D | backref.h | 22 struct ulist;
78 * added to each reference added to the @refs ulist.
102 struct ulist *refs;
108 struct ulist *roots;
117 void (*cache_store)(u64 leaf_bytenr, const struct ulist *root_ids,
166 struct ulist refs;
|
| H A D | qgroup.h | 143 struct ulist *old_roots;
349 u64 num_bytes, struct ulist *old_roots,
350 struct ulist *new_roots);
|
| H A D | Makefile | 32 backref.o ulist.o qgroup.o send.o dev-replace.o raid56.o \
|
| H A D | extent_io.h | 17 #include "ulist.h"
196 struct ulist range_changed;
|
| H A D | fs.h | 40 struct ulist;
715 struct ulist *qgroup_ulist;
|
| H A D | qgroup.c | 20 #include "ulist.h"
1008 struct ulist *ulist = NULL; local
1031 ulist = ulist_alloc(GFP_KERNEL);
1032 if (!ulist) {
1076 fs_info->qgroup_ulist = ulist;
1077 ulist = NULL;
1295 ulist_free(ulist);
2647 struct ulist *roots, struct list_head *qgroups,
2804 * Return 0 for definitely not a fs/subvol tree roots ulist
[all...] |
| H A D | backref.c | 12 #include "ulist.h"
470 struct ulist *parents,
594 struct prelim_ref *ref, struct ulist *parents)
704 static void free_leaf_list(struct ulist *ulist) argument
710 while ((node = ulist_next(ulist, &uiter)))
713 ulist_free(ulist);
739 struct ulist *parents;
827 * We may have inode lists attached to refs in the parents ulist, so we
828 * must free them before freeing the ulist an
[all...] |
| H A D | send.c | 1451 static void store_backref_cache(u64 leaf_bytenr, const struct ulist *root_ids,
|
| /linux-master/tools/perf/ |
| H A D | builtin-probe.c | 445 struct strlist *klist = NULL, *ulist = NULL; local
462 ulist = strlist__new(NULL, NULL);
463 if (!klist || !ulist) {
479 ret2 = probe_file__get_events(ufd, filter, ulist);
481 strlist__for_each_entry(ent, ulist)
484 ret2 = probe_file__del_strlist(ufd, ulist);
502 strlist__delete(ulist);
|
| /linux-master/fs/btrfs/tests/ |
| H A D | qgroup-tests.c | 211 struct ulist *old_roots = NULL;
212 struct ulist *new_roots = NULL;
323 struct ulist *old_roots = NULL;
324 struct ulist *new_roots = NULL;
|
Completed in 189 milliseconds