Home
last modified time | relevance | path

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

/linux-6.1.9/fs/btrfs/
Dulist.h69 struct ulist_node *ulist_next(struct ulist *ulist,
Dulist.c261 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
Dqgroup.c1379 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2444 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2458 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_update_refcnt()
2531 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2625 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3120 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3144 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3207 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_free_refroot()
3827 while ((unode = ulist_next(&reserved->range_changed, &uiter))) { in qgroup_free_reserved_data()
4081 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_convert_meta()
[all …]
Dbackref.c663 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
751 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
756 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1519 node = ulist_next(tmp, &uiter); in btrfs_find_all_roots_safe()
1775 node = ulist_next(tmp, &uiter); in btrfs_is_data_extent_shared()
2204 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { in iterate_extent_inodes()
2211 while (!ret && (root_node = ulist_next(roots, &root_uiter))) { in iterate_extent_inodes()
Drelocation.c3405 while ((ref_node = ulist_next(leaves, &leaf_uiter))) { in add_data_references()