fs/btrfs/ordered-data.c

14 #include "btrfs_inode.h"
126 static inline struct rb_node *ordered_tree_search(struct btrfs_inode *inode,
148 			struct btrfs_inode *inode, u64 file_offset, u64 num_bytes,
210 	struct btrfs_inode *inode = BTRFS_I(entry->inode);
265 			struct btrfs_inode *inode, u64 file_offset,
290 	struct btrfs_inode *inode = BTRFS_I(entry->inode);
309 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);
362 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);
375 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);
403 void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode,
495 bool btrfs_dec_test_ordered_pending(struct btrfs_inode *inode,
576 void btrfs_remove_ordered_extent(struct btrfs_inode *btrfs_inode,
579 	struct btrfs_root *root = btrfs_inode->root;
589 	freespace_inode = btrfs_is_free_space_inode(btrfs_inode);
593 	spin_lock(&btrfs_inode->lock);
594 	btrfs_mod_outstanding_extents(btrfs_inode, -1);
595 	spin_unlock(&btrfs_inode->lock);
603 		btrfs_delalloc_release_metadata(btrfs_inode, release,
611 	spin_lock_irq(&btrfs_inode->ordered_tree_lock);
613 	rb_erase(node, &btrfs_inode->ordered_tree);
615 	if (btrfs_inode->ordered_tree_last == node)
616 		btrfs_inode->ordered_tree_last = NULL;
619 	spin_unlock_irq(&btrfs_inode->ordered_tree_lock);
654 	trace_btrfs_ordered_extent_remove(btrfs_inode, entry);
780 	struct btrfs_inode *inode = BTRFS_I(entry->inode);
873 struct btrfs_ordered_extent *btrfs_lookup_ordered_extent(struct btrfs_inode *inode,
901 		struct btrfs_inode *inode, u64 file_offset, u64 len)
941 void btrfs_get_ordered_extents_for_logging(struct btrfs_inode *inode,
970 btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset)
998 			struct btrfs_inode *inode, u64 file_offset, u64 len)
1079 void btrfs_lock_and_flush_ordered_range(struct btrfs_inode *inode, u64 start,
1117 bool btrfs_try_lock_ordered_range(struct btrfs_inode *inode, u64 start, u64 end,
1139 	struct btrfs_inode *inode = BTRFS_I(ordered->inode);