Lines Matching full:delayed
10 #include "delayed-ref.h"
20 * delayed back reference update tracking. For subvolume trees
22 * delayed processing. This avoids deep call chains where we
76 * This drops the delayed ref head's count from the delayed refs rsv and frees
92 * btrfs_update_delayed_refs_rsv - adjust the size of the delayed refs rsv
93 * @trans - the trans that may have generated delayed refs
117 * btrfs_migrate_to_delayed_refs_rsv - transfer bytes to our delayed refs rsv.
165 * btrfs_delayed_refs_rsv_refill - refill based on our delayed refs usage.
169 * This will refill the delayed block_rsv up to 1 items size worth of space and
201 * compare two delayed tree backrefs with same bytenr and type
221 * compare two delayed data backrefs with same bytenr and type
356 * Find a head entry based on bytenr. This returns the delayed ref head if it
664 * reallocated before the delayed ref in update_existing_head_ref()
773 * modification deletes the delayed ref without ever inserting the in init_delayed_ref_head()
924 * add a delayed tree ref. This does all of the accounting required
925 * to make sure the delayed ref is eventually processed before this
1021 * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.