forked from Minki/linux
ext4: fix various seppling typos
Signed-off-by: Bhaskar Chowdhury <unixbhaskar@gmail.com> Link: https://lore.kernel.org/r/cover.1616840203.git.unixbhaskar@gmail.com Signed-off-by: Theodore Ts'o <tytso@mit.edu>
This commit is contained in:
parent
e1262cd2e6
commit
3088e5a515
@ -66,7 +66,7 @@
|
||||
* Fast Commit Ineligibility
|
||||
* -------------------------
|
||||
* Not all operations are supported by fast commits today (e.g extended
|
||||
* attributes). Fast commit ineligiblity is marked by calling one of the
|
||||
* attributes). Fast commit ineligibility is marked by calling one of the
|
||||
* two following functions:
|
||||
*
|
||||
* - ext4_fc_mark_ineligible(): This makes next fast commit operation to fall
|
||||
|
@ -705,7 +705,7 @@ static int ext4_ind_trunc_restart_fn(handle_t *handle, struct inode *inode,
|
||||
|
||||
/*
|
||||
* Truncate transactions can be complex and absolutely huge. So we need to
|
||||
* be able to restart the transaction at a conventient checkpoint to make
|
||||
* be able to restart the transaction at a convenient checkpoint to make
|
||||
* sure we don't overflow the journal.
|
||||
*
|
||||
* Try to extend this transaction for the purposes of truncation. If
|
||||
|
@ -795,7 +795,7 @@ ext4_journalled_write_inline_data(struct inode *inode,
|
||||
* clear the inode state safely.
|
||||
* 2. The inode has inline data, then we need to read the data, make it
|
||||
* update and dirty so that ext4_da_writepages can handle it. We don't
|
||||
* need to start the journal since the file's metatdata isn't changed now.
|
||||
* need to start the journal since the file's metadata isn't changed now.
|
||||
*/
|
||||
static int ext4_da_convert_inline_data_to_extent(struct address_space *mapping,
|
||||
struct inode *inode,
|
||||
|
@ -3822,7 +3822,7 @@ unlock:
|
||||
* starting from file offset 'from'. The range to be zero'd must
|
||||
* be contained with in one block. If the specified range exceeds
|
||||
* the end of the block it will be shortened to end of the block
|
||||
* that cooresponds to 'from'
|
||||
* that corresponds to 'from'
|
||||
*/
|
||||
static int ext4_block_zero_page_range(handle_t *handle,
|
||||
struct address_space *mapping, loff_t from, loff_t length)
|
||||
|
@ -59,7 +59,7 @@
|
||||
* by the stream allocator, which purpose is to pack requests
|
||||
* as close each to other as possible to produce smooth I/O traffic
|
||||
* We use locality group prealloc space for stream request.
|
||||
* We can tune the same via /proc/fs/ext4/<parition>/stream_req
|
||||
* We can tune the same via /proc/fs/ext4/<partition>/stream_req
|
||||
*/
|
||||
#define MB_DEFAULT_STREAM_THRESHOLD 16 /* 64K */
|
||||
|
||||
|
@ -32,7 +32,7 @@ static int finish_range(handle_t *handle, struct inode *inode,
|
||||
newext.ee_block = cpu_to_le32(lb->first_block);
|
||||
newext.ee_len = cpu_to_le16(lb->last_block - lb->first_block + 1);
|
||||
ext4_ext_store_pblock(&newext, lb->first_pblock);
|
||||
/* Locking only for convinience since we are operating on temp inode */
|
||||
/* Locking only for convenience since we are operating on temp inode */
|
||||
down_write(&EXT4_I(inode)->i_data_sem);
|
||||
path = ext4_find_extent(inode, lb->first_block, NULL, 0);
|
||||
if (IS_ERR(path)) {
|
||||
@ -43,8 +43,8 @@ static int finish_range(handle_t *handle, struct inode *inode,
|
||||
|
||||
/*
|
||||
* Calculate the credit needed to inserting this extent
|
||||
* Since we are doing this in loop we may accumalate extra
|
||||
* credit. But below we try to not accumalate too much
|
||||
* Since we are doing this in loop we may accumulate extra
|
||||
* credit. But below we try to not accumulate too much
|
||||
* of them by restarting the journal.
|
||||
*/
|
||||
needed = ext4_ext_calc_credits_for_single_extent(inode,
|
||||
|
@ -979,7 +979,7 @@ static int ext4_htree_next_block(struct inode *dir, __u32 hash,
|
||||
* If the hash is 1, then continue only if the next page has a
|
||||
* continuation hash of any value. This is used for readdir
|
||||
* handling. Otherwise, check to see if the hash matches the
|
||||
* desired contiuation hash. If it doesn't, return since
|
||||
* desired continuation hash. If it doesn't, return since
|
||||
* there's no point to read in the successive index pages.
|
||||
*/
|
||||
bhash = dx_get_hash(p->at);
|
||||
|
@ -1617,7 +1617,7 @@ static int ext4_xattr_set_entry(struct ext4_xattr_info *i,
|
||||
* If storing the value in an external inode is an option,
|
||||
* reserve space for xattr entries/names in the external
|
||||
* attribute block so that a long value does not occupy the
|
||||
* whole space and prevent futher entries being added.
|
||||
* whole space and prevent further entries being added.
|
||||
*/
|
||||
if (ext4_has_feature_ea_inode(inode->i_sb) &&
|
||||
new_size && is_block &&
|
||||
|
Loading…
Reference in New Issue
Block a user