Home
last modified time | relevance | path

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

/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dulist.h69 struct ulist_node *ulist_next(struct ulist *ulist,
H A Dulist.c261 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next() function
H A Dqgroup.c1352 while ((unode = ulist_next(tmp, &uiter))) { in __qgroup_excl_accounting()
2406 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2420 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) { in qgroup_update_refcnt()
2493 while ((unode = ulist_next(qgroups, &uiter))) { in qgroup_update_counters()
2587 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
3072 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3096 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_reserve()
3159 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in btrfs_qgroup_free_refroot()
3784 while ((unode = ulist_next(&reserved->range_changed, &uiter))) { in qgroup_free_reserved_data()
4037 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) { in qgroup_convert_meta()
[all …]
H A Dbackref.c658 while ((node = ulist_next(ulist, &uiter))) in free_leaf_list()
746 node = ulist_next(parents, &uiter); in resolve_indirect_refs()
751 while ((node = ulist_next(parents, &uiter))) { in resolve_indirect_refs()
1519 node = ulist_next(tmp, &uiter);
1603 node = ulist_next(tmp, &uiter);
2029 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) {
2036 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()