ulist 413 fs/btrfs/backref.c struct ulist *parents, struct prelim_ref *ref, ulist 505 fs/btrfs/backref.c struct prelim_ref *ref, struct ulist *parents, ulist 617 fs/btrfs/backref.c struct ulist *parents; ulist 1115 fs/btrfs/backref.c u64 time_seq, struct ulist *refs, ulist 1116 fs/btrfs/backref.c struct ulist *roots, const u64 *extent_item_pos, ulist 1339 fs/btrfs/backref.c static void free_leaf_list(struct ulist *blocks) ulist 1367 fs/btrfs/backref.c u64 time_seq, struct ulist **leafs, ulist 1401 fs/btrfs/backref.c u64 time_seq, struct ulist **roots, ulist 1404 fs/btrfs/backref.c struct ulist *tmp; ulist 1440 fs/btrfs/backref.c u64 time_seq, struct ulist **roots, ulist 1469 fs/btrfs/backref.c struct ulist *roots, struct ulist *tmp) ulist 1902 fs/btrfs/backref.c struct ulist *refs = NULL; ulist 1903 fs/btrfs/backref.c struct ulist *roots = NULL; ulist 45 fs/btrfs/backref.h u64 time_seq, struct ulist **roots, bool ignore_offset); ulist 61 fs/btrfs/backref.h struct ulist *roots, struct ulist *tmp_ulist); ulist 830 fs/btrfs/ctree.h struct ulist *qgroup_ulist; ulist 4654 fs/btrfs/extent_io.c struct ulist *roots; ulist 4655 fs/btrfs/extent_io.c struct ulist *tmp_ulist; ulist 206 fs/btrfs/extent_io.h struct ulist range_changed; ulist 1141 fs/btrfs/qgroup.c struct ulist *tmp, u64 ref_root, ulist 1218 fs/btrfs/qgroup.c struct ulist *tmp, u64 src, u64 dst, ulist 1251 fs/btrfs/qgroup.c struct ulist *tmp; ulist 1315 fs/btrfs/qgroup.c struct ulist *tmp; ulist 1582 fs/btrfs/qgroup.c struct ulist *old_root; ulist 2209 fs/btrfs/qgroup.c struct ulist *roots, struct ulist *tmp, ulist 2210 fs/btrfs/qgroup.c struct ulist *qgroups, u64 seq, int update_old) ulist 2298 fs/btrfs/qgroup.c struct ulist *qgroups, ulist 2393 fs/btrfs/qgroup.c static int maybe_fs_roots(struct ulist *roots) ulist 2416 fs/btrfs/qgroup.c u64 num_bytes, struct ulist *old_roots, ulist 2417 fs/btrfs/qgroup.c struct ulist *new_roots) ulist 2420 fs/btrfs/qgroup.c struct ulist *qgroups = NULL; ulist 2421 fs/btrfs/qgroup.c struct ulist *tmp = NULL; ulist 2512 fs/btrfs/qgroup.c struct ulist *new_roots = NULL; ulist 3055 fs/btrfs/qgroup.c struct ulist *roots = NULL; ulist 121 fs/btrfs/qgroup.h struct ulist *old_roots; ulist 331 fs/btrfs/qgroup.h u64 num_bytes, struct ulist *old_roots, ulist 332 fs/btrfs/qgroup.h struct ulist *new_roots); ulist 212 fs/btrfs/tests/qgroup-tests.c struct ulist *old_roots = NULL; ulist 213 fs/btrfs/tests/qgroup-tests.c struct ulist *new_roots = NULL; ulist 313 fs/btrfs/tests/qgroup-tests.c struct ulist *old_roots = NULL; ulist 314 fs/btrfs/tests/qgroup-tests.c struct ulist *new_roots = NULL; ulist 47 fs/btrfs/ulist.c void ulist_init(struct ulist *ulist) ulist 49 fs/btrfs/ulist.c INIT_LIST_HEAD(&ulist->nodes); ulist 50 fs/btrfs/ulist.c ulist->root = RB_ROOT; ulist 51 fs/btrfs/ulist.c ulist->nnodes = 0; ulist 61 fs/btrfs/ulist.c void ulist_release(struct ulist *ulist) ulist 66 fs/btrfs/ulist.c list_for_each_entry_safe(node, next, &ulist->nodes, list) { ulist 69 fs/btrfs/ulist.c ulist->root = RB_ROOT; ulist 70 fs/btrfs/ulist.c INIT_LIST_HEAD(&ulist->nodes); ulist 80 fs/btrfs/ulist.c void ulist_reinit(struct ulist *ulist) ulist 82 fs/btrfs/ulist.c ulist_release(ulist); ulist 83 fs/btrfs/ulist.c ulist_init(ulist); ulist 92 fs/btrfs/ulist.c struct ulist *ulist_alloc(gfp_t gfp_mask) ulist 94 fs/btrfs/ulist.c struct ulist *ulist = kmalloc(sizeof(*ulist), gfp_mask); ulist 96 fs/btrfs/ulist.c if (!ulist) ulist 99 fs/btrfs/ulist.c ulist_init(ulist); ulist 101 fs/btrfs/ulist.c return ulist; ulist 110 fs/btrfs/ulist.c void ulist_free(struct ulist *ulist) ulist 112 fs/btrfs/ulist.c if (!ulist) ulist 114 fs/btrfs/ulist.c ulist_release(ulist); ulist 115 fs/btrfs/ulist.c kfree(ulist); ulist 118 fs/btrfs/ulist.c static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val) ulist 120 fs/btrfs/ulist.c struct rb_node *n = ulist->root.rb_node; ulist 135 fs/btrfs/ulist.c static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) ulist 137 fs/btrfs/ulist.c rb_erase(&node->rb_node, &ulist->root); ulist 140 fs/btrfs/ulist.c BUG_ON(ulist->nnodes == 0); ulist 141 fs/btrfs/ulist.c ulist->nnodes--; ulist 144 fs/btrfs/ulist.c static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) ulist 146 fs/btrfs/ulist.c struct rb_node **p = &ulist->root.rb_node; ulist 162 fs/btrfs/ulist.c rb_insert_color(&ins->rb_node, &ulist->root); ulist 186 fs/btrfs/ulist.c int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask) ulist 188 fs/btrfs/ulist.c return ulist_add_merge(ulist, val, aux, NULL, gfp_mask); ulist 191 fs/btrfs/ulist.c int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, ulist 197 fs/btrfs/ulist.c node = ulist_rbtree_search(ulist, val); ulist 210 fs/btrfs/ulist.c ret = ulist_rbtree_insert(ulist, node); ulist 212 fs/btrfs/ulist.c list_add_tail(&node->list, &ulist->nodes); ulist 213 fs/btrfs/ulist.c ulist->nnodes++; ulist 228 fs/btrfs/ulist.c int ulist_del(struct ulist *ulist, u64 val, u64 aux) ulist 232 fs/btrfs/ulist.c node = ulist_rbtree_search(ulist, val); ulist 241 fs/btrfs/ulist.c ulist_rbtree_erase(ulist, node); ulist 261 fs/btrfs/ulist.c struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) ulist 265 fs/btrfs/ulist.c if (list_empty(&ulist->nodes)) ulist 267 fs/btrfs/ulist.c if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) ulist 272 fs/btrfs/ulist.c uiter->cur_list = ulist->nodes.next; ulist 45 fs/btrfs/ulist.h void ulist_init(struct ulist *ulist); ulist 46 fs/btrfs/ulist.h void ulist_release(struct ulist *ulist); ulist 47 fs/btrfs/ulist.h void ulist_reinit(struct ulist *ulist); ulist 48 fs/btrfs/ulist.h struct ulist *ulist_alloc(gfp_t gfp_mask); ulist 49 fs/btrfs/ulist.h void ulist_free(struct ulist *ulist); ulist 50 fs/btrfs/ulist.h int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask); ulist 51 fs/btrfs/ulist.h int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux, ulist 53 fs/btrfs/ulist.h int ulist_del(struct ulist *ulist, u64 val, u64 aux); ulist 56 fs/btrfs/ulist.h static inline int ulist_add_merge_ptr(struct ulist *ulist, u64 val, void *aux, ulist 61 fs/btrfs/ulist.h int ret = ulist_add_merge(ulist, val, (uintptr_t)aux, &old64, gfp_mask); ulist 65 fs/btrfs/ulist.h return ulist_add_merge(ulist, val, (u64)aux, (u64 *)old_aux, gfp_mask); ulist 69 fs/btrfs/ulist.h struct ulist_node *ulist_next(struct ulist *ulist, ulist 1120 fs/cifs/cifsglob.h struct list_head ulist; /* cache update list */ ulist 1272 fs/cifs/dfs_cache.c list_add_tail(&tcon->ulist, head); ulist 1277 fs/cifs/dfs_cache.c list_add_tail(&ses->tcon_ipc->ulist, head); ulist 1467 fs/cifs/dfs_cache.c list_for_each_entry_safe(tcon, ntcon, &list, ulist) { ulist 1469 fs/cifs/dfs_cache.c list_del_init(&tcon->ulist); ulist 421 tools/perf/builtin-probe.c struct strlist *klist = NULL, *ulist = NULL; ulist 438 tools/perf/builtin-probe.c ulist = strlist__new(NULL, NULL); ulist 439 tools/perf/builtin-probe.c if (!klist || !ulist) { ulist 454 tools/perf/builtin-probe.c ret2 = probe_file__get_events(ufd, filter, ulist); ulist 456 tools/perf/builtin-probe.c strlist__for_each_entry(ent, ulist) ulist 459 tools/perf/builtin-probe.c ret2 = probe_file__del_strlist(ufd, ulist); ulist 476 tools/perf/builtin-probe.c strlist__delete(ulist);