Home
last modified time | relevance | path

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

/linux-4.1.27/fs/btrfs/
Dulist.h75 struct ulist_node *ulist_next(struct ulist *ulist,
Dqgroup.c1046 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
1575 while ((unode = ulist_next(roots, &uiter))) { in qgroup_calc_old_refcnt()
1602 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_calc_old_refcnt()
1718 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_account_deleted_refs()
1766 while ((unode = ulist_next(tmp, &uiter))) { in qgroup_calc_new_refcnt()
1809 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_adjust_counters()
1893 while ((unode = ulist_next(roots, &uiter))) { in check_existing_refs()
2091 unode = ulist_next(roots, &uiter); /* Only want 1 so no need to loop */ in qgroup_subtree_accounting()
2135 while ((unode = ulist_next(parents, &uiter))) { in qgroup_subtree_accounting()
2522 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_reserve()
[all …]
Dbackref.c429 node = ulist_next(parents, &uiter); in __resolve_indirect_refs()
435 while ((node = ulist_next(parents, &uiter))) { in __resolve_indirect_refs()
1098 while ((node = ulist_next(blocks, &uiter))) {
1178 node = ulist_next(tmp, &uiter);
1251 node = ulist_next(tmp, &uiter);
1655 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) {
1661 while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
Dulist.c228 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
Dioctl.c3073 while ((root_node = ulist_next(roots, &uiter))) { in check_ref()