Lines Matching defs:refs
173 * Return 0 when both refs are for the same block (and can be merged).
221 * Add @newref to the @root rbtree, merging identical refs.
250 /* Identical refs, merge them and free @newref */
307 * delayed refs
320 * on disk refs (inline or keyed)
368 /* direct refs use root == 0, key == NULL */
378 /* indirect refs use parent == 0 */
557 * adding new delayed refs. To deal with this we need to look in cache
669 * We maintain three separate rbtrees: one for direct refs, one for
670 * indirect refs which have a key, and one for indirect refs which do not
674 * indirect refs with missing keys. An appropriate key is located and
675 * the ref is moved onto the tree for indirect refs. After all missing
703 * the tree, allocating new refs for each insertion, and then
783 * We may have inode lists attached to refs in the parents ulist, so we
784 * must free them before freeing the ulist and its refs.
835 * add all currently queued delayed refs from this head whose seq nr is
946 * refs have been checked.
980 * enumerate all inline refs
1182 * refs) for the given bytenr to the refs list, merges duplicates and resolves
1183 * indirect refs to their parent bytenr.
1196 * If ignore_offset is set to false, only extent refs whose offsets match
1204 u64 time_seq, struct ulist *refs,
1243 * We need both to get a consistent picture of how the refs look
1274 refcount_inc(&head->refs);
1337 * This walks the tree of merged and resolved refs. Tree blocks are
1349 * refs with a node->action of BTRFS_DROP_DELAYED_REF.
1351 * identical refs to keep the overall count correct.
1352 * prelim_ref_insert() will merge only those refs
1353 * which compare identically. Any refs having
1404 ret = ulist_add_merge_ptr(refs, ref->parent,
1430 * this ref to the ref we added to the 'refs' ulist.
1560 * delayed refs, but continues on even when no running transaction exists.
1855 * helper function to iterate extent inline refs. ptr must point to a 0 value
1857 * if more refs exist, 0 is returned and the next call to
2000 struct ulist *refs = NULL;
2027 tree_mod_seq_elem.seq, &refs,
2033 while (!ret && (ref_node = ulist_next(refs, &ref_uiter))) {
2055 free_leaf_list(refs);
2502 /* We're still inside the inline refs */