fs/btrfs/delayed-ref.c

308  * compare two delayed tree backrefs with same bytenr and type
328  * compare two delayed data backrefs with same bytenr and type
391 	u64 bytenr;
395 	bytenr = ins->bytenr;
401 		if (bytenr < entry->bytenr) {
403 		} else if (bytenr > entry->bytenr) {
463  * Find a head entry based on bytenr. This returns the delayed ref head if it
468 		struct btrfs_delayed_ref_root *dr, u64 bytenr,
480 		if (bytenr < entry->bytenr)
482 		else if (bytenr > entry->bytenr)
488 		if (bytenr > entry->bytenr) {
660 	delayed_refs->run_delayed_start = head->bytenr +
737  * existing and update must have the same bytenr
832 				  u64 bytenr, u64 num_bytes, u64 ref_root,
871 	head_ref->bytenr = bytenr;
892 		qrecord->bytenr = bytenr;
966  * @bytenr:	The logical address of the extent for which a modification is
985 				    u64 bytenr, u64 num_bytes, u64 ref_root,
997 	ref->bytenr = bytenr;
1007 void btrfs_init_generic_ref(struct btrfs_ref *generic_ref, int action, u64 bytenr,
1011 	generic_ref->bytenr = bytenr;
1072 	u64 bytenr = generic_ref->bytenr;
1104 	init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,
1111 	init_delayed_ref_head(head_ref, record, bytenr, num_bytes,
1162 	u64 bytenr = generic_ref->bytenr;
1179 	init_delayed_ref_common(fs_info, &ref->node, bytenr, num_bytes,
1203 	init_delayed_ref_head(head_ref, record, bytenr, num_bytes, ref_root,
1239 				u64 bytenr, u64 num_bytes,
1249 	init_delayed_ref_head(head_ref, NULL, bytenr, num_bytes, 0, 0,
1293 btrfs_find_delayed_ref_head(struct btrfs_delayed_ref_root *delayed_refs, u64 bytenr)
1297 	return find_ref_head(delayed_refs, bytenr, false);