Home
last modified time | relevance | path

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

/linux-5.19.10/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.c1322 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1353 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1354 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2389 struct ulist_iterator uiter; in qgroup_update_refcnt() local
2397 ULIST_ITER_INIT(&uiter); in qgroup_update_refcnt()
2398 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2480 struct ulist_iterator uiter; in qgroup_update_counters() local
2484 ULIST_ITER_INIT(&uiter); in qgroup_update_counters()
2485 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2572 struct ulist_iterator uiter; in maybe_fs_roots() local
[all …]
Dbackref.c676 struct ulist_iterator uiter; in resolve_indirect_refs() local
731 ULIST_ITER_INIT(&uiter); in resolve_indirect_refs()
732 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
737 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1402 struct ulist_iterator uiter; in free_leaf_list() local
1404 ULIST_ITER_INIT(&uiter); in free_leaf_list()
1405 while ((node = ulist_next(blocks, &uiter))) { in free_leaf_list()
1465 struct ulist_iterator uiter; in btrfs_find_all_roots_safe() local
1477 ULIST_ITER_INIT(&uiter); in btrfs_find_all_roots_safe()
1487 node = ulist_next(tmp, &uiter); in btrfs_find_all_roots_safe()
[all …]