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 | 1334 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1365 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1366 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2425 struct ulist_iterator uiter; in qgroup_update_refcnt() local
2433 ULIST_ITER_INIT(&uiter); in qgroup_update_refcnt()
2434 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2516 struct ulist_iterator uiter; in qgroup_update_counters() local
2520 ULIST_ITER_INIT(&uiter); in qgroup_update_counters()
2521 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2608 struct ulist_iterator uiter; in maybe_fs_roots() local
[all …]
|
| D | backref.c | 659 struct ulist_iterator uiter; in free_leaf_list() local
661 ULIST_ITER_INIT(&uiter); in free_leaf_list()
662 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
694 struct ulist_iterator uiter; in resolve_indirect_refs() local
749 ULIST_ITER_INIT(&uiter); in resolve_indirect_refs()
750 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
755 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1501 struct ulist_iterator uiter; local
1513 ULIST_ITER_INIT(&uiter);
1523 node = ulist_next(tmp, &uiter);
[all …]
|