Home
last modified time | relevance | path

Searched refs:uiter (Results 1 – 4 of 4) sorted by relevance

/Linux-v6.1/fs/btrfs/
Dulist.c261 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() argument
267 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()
269 if (uiter->cur_list) { in ulist_next()
270 uiter->cur_list = uiter->cur_list->next; in ulist_next()
272 uiter->cur_list = ulist->nodes.next; in ulist_next()
274 node = list_entry(uiter->cur_list, struct ulist_node, list); in ulist_next()
Dulist.h70 struct ulist_iterator *uiter);
72 #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL) argument
Dqgroup.c1347 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1378 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1379 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2435 struct ulist_iterator uiter; in qgroup_update_refcnt() local
2443 ULIST_ITER_INIT(&uiter); in qgroup_update_refcnt()
2444 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2526 struct ulist_iterator uiter; in qgroup_update_counters() local
2530 ULIST_ITER_INIT(&uiter); in qgroup_update_counters()
2531 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2618 struct ulist_iterator uiter; in maybe_fs_roots() local
[all …]
Dbackref.c656 struct ulist_iterator uiter; in free_leaf_list() local
658 ULIST_ITER_INIT(&uiter); in free_leaf_list()
659 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
691 struct ulist_iterator uiter; in resolve_indirect_refs() local
746 ULIST_ITER_INIT(&uiter); in resolve_indirect_refs()
747 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
752 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1493 struct ulist_iterator uiter; in btrfs_find_all_roots_safe() local
1505 ULIST_ITER_INIT(&uiter); in btrfs_find_all_roots_safe()
1515 node = ulist_next(tmp, &uiter); in btrfs_find_all_roots_safe()
[all …]