Home
last modified time | relevance | path

Searched refs:ulist_next (Results 1 - 11 of 11) sorted by relevance

/kernel/linux/linux-5.10/fs/btrfs/
H A Dulist.h69 struct ulist_node *ulist_next(struct ulist *ulist,
H A Dulist.c24 * while ((elem = ulist_next(ulist, &uiter)) {
246 * ulist_next - iterate ulist
261 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
H A Dqgroup.c1366 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2434 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2448 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_update_refcnt()
2521 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2615 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3109 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3133 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3196 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_free_refroot()
3830 while ((unode = ulist_next(&reserved->range_changed, &uiter))) { in qgroup_free_reserved_data()
4083 while ((unode = ulist_next(fs_inf in qgroup_convert_meta()
[all...]
H A Dbackref.c662 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
750 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
755 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1523 node = ulist_next(tmp, &uiter);
1607 node = ulist_next(tmp, &uiter);
2033 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) {
2040 while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
H A Drelocation.c3094 while ((ref_node = ulist_next(leaves, &leaf_uiter))) { in add_data_references()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dulist.h69 struct ulist_node *ulist_next(const struct ulist *ulist,
H A Dulist.c25 * while ((elem = ulist_next(ulist, &uiter)) {
269 struct ulist_node *ulist_next(const struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
H A Dqgroup.c1417 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2500 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2514 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_update_refcnt()
2587 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2681 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3257 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_free_refroot()
3884 while ((unode = ulist_next(&reserved->range_changed, &uiter))) { in qgroup_free_reserved_data()
4185 while ((unode = ulist_next(&changeset.range_changed, &iter))) { in btrfs_qgroup_check_reserved_leak()
H A Dbackref.c713 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
797 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
802 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1783 node = ulist_next(ctx->refs, &uiter); in btrfs_find_all_roots_safe()
1978 node = ulist_next(&ctx->refs, &uiter); in btrfs_is_data_extent_shared()
2452 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) { in iterate_extent_inodes()
2499 while (!ret && (root_node = ulist_next(ctx->roots, &root_uiter))) { in iterate_extent_inodes()
H A Drelocation.c3470 while ((ref_node = ulist_next(ctx.refs, &leaf_uiter))) { in add_data_references()
H A Dsend.c1464 while ((node = ulist_next(root_ids, &uiter)) != NULL) { in store_backref_cache()

Completed in 36 milliseconds