fs/btrfs/delayed-ref.c

11 #include "delayed-ref.h"
22  * delayed back reference update tracking.  For subvolume trees
24  * delayed processing.   This avoids deep call chains where we
59  * @nr_refs:  number of delayed refs to drop
62  * Drops the delayed ref head's count from the delayed refs rsv and free any
81  * Adjust the size of the delayed refs rsv.
103 	 * Try to take num_bytes from the transaction's local delayed reserve.  in btrfs_update_delayed_refs_rsv()
105 	 * reserve doesn't have enough reserved space, the delayed refs reserve  in btrfs_update_delayed_refs_rsv()
128  * Adjust the size of the delayed refs block reserve for 1 block group item
147  * Adjust the size of the delayed refs block reserve to release space for 1
163  * Adjust the size of the delayed refs block reserve for 1 block group item
182  * Adjust the size of the delayed refs block reserve to release space for 1
198  * Refill based on our delayed refs usage.
203  * This will refill the delayed block_rsv up to 1 items size worth of space and
265  * compare two delayed data backrefs with same bytenr and type
396  * Find a head entry based on bytenr. This returns the delayed ref head if it
695 		 * reallocated before the delayed ref  in update_existing_head_ref()
792 		 * later modification deletes the delayed ref without ever  in init_delayed_ref_head()
894 		 * delayed drop ref (the data extent's ref count drops to 0).  in add_delayed_ref_head()
1090  * Add a delayed tree ref. This does all of the accounting required to make sure
1091  * the delayed ref is eventually processed before this transaction commits.
1102  * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.