Searched refs:ulist_next (Results 1 – 5 of 5) sorted by relevance
| /fs/btrfs/ |
| D | qgroup.c | 1430 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_excl_accounting()
1472 while ((unode = ulist_next(roots, &uiter))) { in qgroup_calc_old_refcnt()
1499 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_calc_old_refcnt()
1615 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_account_deleted_refs()
1663 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_calc_new_refcnt()
1706 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_adjust_counters()
1790 while ((unode = ulist_next(roots, &uiter))) { in check_existing_refs()
1988 unode = ulist_next(roots, &uiter); /* Only want 1 so no need to loop */ in qgroup_subtree_accounting()
2032 while ((unode = ulist_next(parents, &uiter))) { in qgroup_subtree_accounting()
2403 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_reserve()
[all …]
|
| D | ulist.h | 75 struct ulist_node *ulist_next(struct ulist *ulist,
|
| D | backref.c | 429 node = ulist_next(parents, &uiter); in __resolve_indirect_refs()
435 while ((node = ulist_next(parents, &uiter))) { in __resolve_indirect_refs()
1096 while ((node = ulist_next(blocks, &uiter))) {
1176 node = ulist_next(tmp, &uiter);
1234 node = ulist_next(tmp, &uiter);
1649 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) {
1655 while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
|
| D | ulist.c | 228 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
|
| D | ioctl.c | 3102 while ((root_node = ulist_next(roots, &uiter))) { in check_ref()
|