Searched refs:uiter (Results 1 – 4 of 4) sorted by relevance
| /fs/btrfs/ |
| D | ulist.c | 261 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()
|
| D | ulist.h | 70 struct ulist_iterator *uiter);
72 #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL) argument
|
| D | qgroup.c | 1361 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1392 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1393 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2463 struct ulist_iterator uiter; in qgroup_update_refcnt() local
2471 ULIST_ITER_INIT(&uiter); in qgroup_update_refcnt()
2472 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2554 struct ulist_iterator uiter; in qgroup_update_counters() local
2558 ULIST_ITER_INIT(&uiter); in qgroup_update_counters()
2559 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2646 struct ulist_iterator uiter; in maybe_fs_roots() local
[all …]
|
| D | backref.c | 660 struct ulist_iterator uiter; in free_leaf_list() local
662 ULIST_ITER_INIT(&uiter); in free_leaf_list()
663 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
695 struct ulist_iterator uiter; in resolve_indirect_refs() local
750 ULIST_ITER_INIT(&uiter); in resolve_indirect_refs()
751 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
756 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1497 struct ulist_iterator uiter; in btrfs_find_all_roots_safe() local
1509 ULIST_ITER_INIT(&uiter); in btrfs_find_all_roots_safe()
1519 node = ulist_next(tmp, &uiter); in btrfs_find_all_roots_safe()
[all …]
|