Home
last modified time | relevance | path

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

/linux-4.1.27/fs/btrfs/
Dulist.c228 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() argument
234 if (uiter->cur_list && uiter->cur_list->next == &ulist->nodes) in ulist_next()
236 if (uiter->cur_list) { in ulist_next()
237 uiter->cur_list = uiter->cur_list->next; in ulist_next()
239 uiter->cur_list = ulist->nodes.next; in ulist_next()
241 uiter->i = 0; in ulist_next()
244 node = list_entry(uiter->cur_list, struct ulist_node, list); in ulist_next()
246 ASSERT(node->seqnum == uiter->i); in ulist_next()
247 ASSERT(uiter->i >= 0 && uiter->i < ulist->nnodes); in ulist_next()
248 uiter->i++; in ulist_next()
Dulist.h76 struct ulist_iterator *uiter);
78 #define ULIST_ITER_INIT(uiter) ((uiter)->cur_list = NULL) argument
Dqgroup.c1018 struct ulist_iterator uiter; in __qgroup_excl_accounting() local
1045 ULIST_ITER_INIT(&uiter); in __qgroup_excl_accounting()
1046 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
1568 struct ulist_iterator uiter; in qgroup_calc_old_refcnt() local
1574 ULIST_ITER_INIT(&uiter); in qgroup_calc_old_refcnt()
1575 while ((unode = ulist_next(roots, &uiter))) { in qgroup_calc_old_refcnt()
1657 struct ulist_iterator uiter; in qgroup_account_deleted_refs() local
1717 ULIST_ITER_INIT(&uiter); in qgroup_account_deleted_refs()
1718 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_account_deleted_refs()
1752 struct ulist_iterator uiter; in qgroup_calc_new_refcnt() local
[all …]
Dbackref.c393 struct ulist_iterator uiter; in __resolve_indirect_refs() local
428 ULIST_ITER_INIT(&uiter); in __resolve_indirect_refs()
429 node = ulist_next(parents, &uiter); in __resolve_indirect_refs()
435 while ((node = ulist_next(parents, &uiter))) { in __resolve_indirect_refs()
1095 struct ulist_iterator uiter; local
1097 ULIST_ITER_INIT(&uiter);
1098 while ((node = ulist_next(blocks, &uiter))) {
1157 struct ulist_iterator uiter; local
1169 ULIST_ITER_INIT(&uiter);
1178 node = ulist_next(tmp, &uiter);
[all …]
Dioctl.c3059 struct ulist_iterator uiter; in check_ref() local
3072 ULIST_ITER_INIT(&uiter); in check_ref()
3073 while ((root_node = ulist_next(roots, &uiter))) { in check_ref()