Home
last modified time | relevance | path

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

/OK3568_Linux_fs/kernel/fs/btrfs/
H A 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()
H A Dulist.h70 struct ulist_iterator *uiter);
72 #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL) argument
H A Dqgroup.c1320 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1351 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1352 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2397 struct ulist_iterator uiter; in qgroup_update_refcnt() local
2405 ULIST_ITER_INIT(&uiter); in qgroup_update_refcnt()
2406 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2488 struct ulist_iterator uiter; in qgroup_update_counters() local
2492 ULIST_ITER_INIT(&uiter); in qgroup_update_counters()
2493 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2580 struct ulist_iterator uiter; in maybe_fs_roots() local
[all …]
H A Dbackref.c655 struct ulist_iterator uiter; in free_leaf_list() local
657 ULIST_ITER_INIT(&uiter); in free_leaf_list()
658 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
690 struct ulist_iterator uiter; in resolve_indirect_refs() local
745 ULIST_ITER_INIT(&uiter); in resolve_indirect_refs()
746 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
751 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1497 struct ulist_iterator uiter; local
1509 ULIST_ITER_INIT(&uiter);
1519 node = ulist_next(tmp, &uiter);
[all …]