forked from Minki/linux
btrfs: fix typos in comments
Codespell has found a few typos. Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
parent
e0dccc3b76
commit
143823cf4d
@ -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(
|
||||
|
@ -1872,7 +1872,7 @@ again:
|
||||
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.
|
||||
*/
|
||||
|
@ -4228,7 +4228,7 @@ skip_backref:
|
||||
/*
|
||||
* 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) {
|
||||
|
@ -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.
|
||||
@ -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,
|
||||
|
@ -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 */
|
||||
|
@ -1280,7 +1280,7 @@ static void priority_reclaim_metadata_space(struct btrfs_fs_info *fs_info,
|
||||
to_reclaim = btrfs_calc_reclaim_metadata_size(fs_info, space_info);
|
||||
/*
|
||||
* This is the priority reclaim path, so to_reclaim could be >0 still
|
||||
* because we may have only satisified the priority tickets and still
|
||||
* because we may have only satisfied the priority tickets and still
|
||||
* left non priority tickets on the list. We would then have
|
||||
* to_reclaim but ->bytes == 0.
|
||||
*/
|
||||
|
@ -123,7 +123,7 @@ int btrfs_attach_subpage(const struct btrfs_fs_info *fs_info,
|
||||
struct btrfs_subpage *subpage;
|
||||
|
||||
/*
|
||||
* We have cases like a dummy extent buffer page, which is not mappped
|
||||
* We have cases like a dummy extent buffer page, which is not mapped
|
||||
* and doesn't need to be locked.
|
||||
*/
|
||||
if (page->mapping)
|
||||
|
@ -72,7 +72,7 @@ static int btrfs_remount(struct super_block *sb, int *flags, char *data);
|
||||
#define STATE_STRING_BUF_LEN (sizeof(STATE_STRING_PREFACE) + BTRFS_FS_STATE_COUNT)
|
||||
|
||||
/*
|
||||
* Characters to print to indicate error conditions or uncommon filesystem sate.
|
||||
* Characters to print to indicate error conditions or uncommon filesystem state.
|
||||
* RO is not an error.
|
||||
*/
|
||||
static const char fs_state_chars[] = {
|
||||
|
@ -296,7 +296,7 @@ BTRFS_FEAT_ATTR_COMPAT_RO(verity, VERITY);
|
||||
/*
|
||||
* Features which depend on feature bits and may differ between each fs.
|
||||
*
|
||||
* /sys/fs/btrfs/features - all available features implemeted by this version
|
||||
* /sys/fs/btrfs/features - all available features implemented by this version
|
||||
* /sys/fs/btrfs/UUID/features - features of the fs which are enabled or
|
||||
* can be changed on a mounted filesystem.
|
||||
*/
|
||||
|
@ -2287,7 +2287,7 @@ static noinline int check_item_in_log(struct btrfs_trans_handle *trans,
|
||||
struct btrfs_key location;
|
||||
|
||||
/*
|
||||
* Currenly we only log dir index keys. Even if we replay a log created
|
||||
* Currently we only log dir index keys. Even if we replay a log created
|
||||
* by an older kernel that logged both dir index and dir item keys, all
|
||||
* we need to do is process the dir index keys, we (and our caller) can
|
||||
* safely ignore dir item keys (key type BTRFS_DIR_ITEM_KEY).
|
||||
|
Loading…
Reference in New Issue
Block a user