fs/btrfs/delayed-ref.c

11 #include "delayed-ref.h"
23  * delayed back reference update tracking.  For subvolume trees
25  * delayed processing.   This avoids deep call chains where we
60  * @nr_refs:  number of delayed refs to drop
63  * Drops the delayed ref head's count from the delayed refs rsv and free any
82  * Adjust the size of the delayed refs rsv.
104 	 * Try to take num_bytes from the transaction's local delayed reserve.  in btrfs_update_delayed_refs_rsv()
106 	 * reserve doesn't have enough reserved space, the delayed refs reserve  in btrfs_update_delayed_refs_rsv()
129  * Adjust the size of the delayed refs block reserve for 1 block group item
148  * Adjust the size of the delayed refs block reserve to release space for 1
164  * Adjust the size of the delayed refs block reserve for 1 block group item
183  * Adjust the size of the delayed refs block reserve to release space for 1
199  * Transfer bytes to our delayed refs rsv.
241  * Refill based on our delayed refs usage.
246  * This will refill the delayed block_rsv up to 1 items size worth of space and
308  * compare two delayed tree backrefs with same bytenr and type
328  * compare two delayed data backrefs with same bytenr and type
463  * Find a head entry based on bytenr. This returns the delayed ref head if it
762 		 * reallocated before the delayed ref  in update_existing_head_ref()
857 		 * later modification deletes the delayed ref without ever  in init_delayed_ref_head()
941 		 * delayed drop ref (the data extent's ref count drops to 0).  in add_delayed_ref_head()
1008  * add a delayed tree ref.  This does all of the accounting required
1009  * to make sure the delayed ref is eventually processed before this
1102  * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.