Loading fs/btrfs/ctree.h +1 −1 Original line number Diff line number Diff line Loading @@ -2734,7 +2734,7 @@ int btrfs_get_extent_inline_ref_type(const struct extent_buffer *eb, u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset); /* * Take the number of bytes to be checksummmed and figure out how many leaves * Take the number of bytes to be checksummed and figure out how many leaves * it would require to store the csums for that many bytes. */ static inline u64 btrfs_csum_bytes_to_leaves( Loading fs/btrfs/disk-io.c +1 −1 Original line number Diff line number Diff line Loading @@ -1872,7 +1872,7 @@ static struct btrfs_root *btrfs_get_root_ref(struct btrfs_fs_info *fs_info, fail: /* * If our caller provided us an anonymous device, then it's his * responsability to free it in case we fail. So we have to set our * responsibility to free it in case we fail. So we have to set our * root's anon_dev to 0 to avoid a double free, once by btrfs_put_root() * and once again by our caller. */ Loading fs/btrfs/inode.c +1 −1 Original line number Diff line number Diff line Loading @@ -4228,7 +4228,7 @@ static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans, /* * If we are in a rename context, we don't need to update anything in the * log. That will be done later during the rename by btrfs_log_new_name(). * Besides that, doing it here would only cause extra unncessary btree * Besides that, doing it here would only cause extra unnecessary btree * operations on the log tree, increasing latency for applications. */ if (!rename_ctx) { Loading fs/btrfs/ordered-data.c +2 −2 Original line number Diff line number Diff line Loading @@ -275,7 +275,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, /* * Mark all ordered extents io inside the specified range finished. * * @page: The invovled page for the opeartion. * @page: The involved page for the operation. * For uncompressed buffered IO, the page status also needs to be * updated to indicate whether the pending ordered io is finished. * Can be NULL for direct IO and compressed write. Loading @@ -285,7 +285,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, * extent are finished. * * This function is called for endio, thus the range must have ordered * extent(s) coveri it. * extent(s) covering it. */ void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode, struct page *page, u64 file_offset, Loading fs/btrfs/raid56.c +1 −1 Original line number Diff line number Diff line Loading @@ -132,7 +132,7 @@ struct btrfs_raid_bio { /* Number of data stripes (no p/q) */ u8 nr_data; /* Numer of all stripes (including P/Q) */ /* Number of all stripes (including P/Q) */ u8 real_stripes; /* How many pages there are for each stripe */ Loading Loading
fs/btrfs/ctree.h +1 −1 Original line number Diff line number Diff line Loading @@ -2734,7 +2734,7 @@ int btrfs_get_extent_inline_ref_type(const struct extent_buffer *eb, u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset); /* * Take the number of bytes to be checksummmed and figure out how many leaves * Take the number of bytes to be checksummed and figure out how many leaves * it would require to store the csums for that many bytes. */ static inline u64 btrfs_csum_bytes_to_leaves( Loading
fs/btrfs/disk-io.c +1 −1 Original line number Diff line number Diff line Loading @@ -1872,7 +1872,7 @@ static struct btrfs_root *btrfs_get_root_ref(struct btrfs_fs_info *fs_info, fail: /* * If our caller provided us an anonymous device, then it's his * responsability to free it in case we fail. So we have to set our * responsibility to free it in case we fail. So we have to set our * root's anon_dev to 0 to avoid a double free, once by btrfs_put_root() * and once again by our caller. */ Loading
fs/btrfs/inode.c +1 −1 Original line number Diff line number Diff line Loading @@ -4228,7 +4228,7 @@ static int __btrfs_unlink_inode(struct btrfs_trans_handle *trans, /* * If we are in a rename context, we don't need to update anything in the * log. That will be done later during the rename by btrfs_log_new_name(). * Besides that, doing it here would only cause extra unncessary btree * Besides that, doing it here would only cause extra unnecessary btree * operations on the log tree, increasing latency for applications. */ if (!rename_ctx) { Loading
fs/btrfs/ordered-data.c +2 −2 Original line number Diff line number Diff line Loading @@ -275,7 +275,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, /* * Mark all ordered extents io inside the specified range finished. * * @page: The invovled page for the opeartion. * @page: The involved page for the operation. * For uncompressed buffered IO, the page status also needs to be * updated to indicate whether the pending ordered io is finished. * Can be NULL for direct IO and compressed write. Loading @@ -285,7 +285,7 @@ void btrfs_add_ordered_sum(struct btrfs_ordered_extent *entry, * extent are finished. * * This function is called for endio, thus the range must have ordered * extent(s) coveri it. * extent(s) covering it. */ void btrfs_mark_ordered_io_finished(struct btrfs_inode *inode, struct page *page, u64 file_offset, Loading
fs/btrfs/raid56.c +1 −1 Original line number Diff line number Diff line Loading @@ -132,7 +132,7 @@ struct btrfs_raid_bio { /* Number of data stripes (no p/q) */ u8 nr_data; /* Numer of all stripes (including P/Q) */ /* Number of all stripes (including P/Q) */ u8 real_stripes; /* How many pages there are for each stripe */ Loading