Lines Matching full:delayed
11 #include "delayed-ref.h"
23 * delayed back reference update tracking. For subvolume trees
25 * delayed processing. This avoids deep call chains where we
62 * Drops the delayed ref head's count from the delayed refs rsv and free any
78 * Adjust the size of the delayed refs rsv.
103 * Transfer bytes to our delayed refs rsv.
145 * Refill based on our delayed refs usage.
150 * This will refill the delayed block_rsv up to 1 items size worth of space and
212 * compare two delayed tree backrefs with same bytenr and type
232 * compare two delayed data backrefs with same bytenr and type
367 * Find a head entry based on bytenr. This returns the delayed ref head if it
652 * reallocated before the delayed ref in update_existing_head_ref()
744 * later modification deletes the delayed ref without ever in init_delayed_ref_head()
889 * add a delayed tree ref. This does all of the accounting required
890 * to make sure the delayed ref is eventually processed before this
984 * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.