Commit 1cc8dcf5 authored by Benoit Boissinot's avatar Benoit Boissinot Committed by Jesper Juhl
Browse files

ext*: spelling fix prefered -> preferred 



Spelling fix: prefered -> preferred

Signed-off-by: default avatarBenoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: default avatarJesper Juhl <jesper.juhl@gmail.com>
parent c0d1f295

fs/ext2/ialloc.c

+1 −1
Original line number Diff line number Diff line
@@ -253,7 +253,7 @@ static int find_group_dir(struct super_block *sb, struct inode *parent) 
 * it has too few free inodes left (min_inodes) or 

 * it has too few free blocks left (min_blocks) or 

 * it's already running too large debt (max_debt). 

 * Parent's group is prefered, if it doesn't satisfy these 

 * Parent's group is preferred, if it doesn't satisfy these 

 * conditions we search cyclically through the rest. If none 

 * of the groups look good we just look for a group with more 

 * free inodes than average (starting at parent's group).

fs/ext2/inode.c

+2 −2
Original line number Diff line number Diff line
@@ -239,7 +239,7 @@ static Indirect *ext2_get_branch(struct inode *inode, 
 *	@inode: owner

 *	@ind: descriptor of indirect block.

 *

 *	This function returns the prefered place for block allocation.

 *	This function returns the preferred place for block allocation.

 *	It is used when heuristic for sequential allocation fails.

 *	Rules are:

 *	  + if there is a block to the left of our position - allocate near it.
@@ -283,7 +283,7 @@ static unsigned long ext2_find_near(struct inode *inode, Indirect *ind) 
}



/**

 *	ext2_find_goal - find a prefered place for allocation.

 *	ext2_find_goal - find a preferred place for allocation.

 *	@inode: owner

 *	@block:  block we want

 *	@partial: pointer to the last triple within a chain

fs/ext3/ialloc.c

+1 −1
Original line number Diff line number Diff line
@@ -239,7 +239,7 @@ static int find_group_dir(struct super_block *sb, struct inode *parent) 
 * it has too few free inodes left (min_inodes) or

 * it has too few free blocks left (min_blocks) or

 * it's already running too large debt (max_debt).

 * Parent's group is prefered, if it doesn't satisfy these

 * Parent's group is preferred, if it doesn't satisfy these

 * conditions we search cyclically through the rest. If none

 * of the groups look good we just look for a group with more

 * free inodes than average (starting at parent's group).

fs/ext3/inode.c

+3 −3
Original line number Diff line number Diff line
@@ -392,7 +392,7 @@ static Indirect *ext3_get_branch(struct inode *inode, int depth, int *offsets, 
 *	@inode: owner

 *	@ind: descriptor of indirect block.

 *

 *	This function returns the prefered place for block allocation.

 *	This function returns the preferred place for block allocation.

 *	It is used when heuristic for sequential allocation fails.

 *	Rules are:

 *	  + if there is a block to the left of our position - allocate near it.
@@ -436,12 +436,12 @@ static ext3_fsblk_t ext3_find_near(struct inode *inode, Indirect *ind) 
}



/**

 *	ext3_find_goal - find a prefered place for allocation.

 *	ext3_find_goal - find a preferred place for allocation.

 *	@inode: owner

 *	@block:  block we want

 *	@partial: pointer to the last triple within a chain

 *

 *	Normally this function find the prefered place for block allocation,

 *	Normally this function find the preferred place for block allocation,

 *	returns it.

 */

fs/ext4/ialloc.c

+1 −1
Original line number Diff line number Diff line
@@ -305,7 +305,7 @@ static int find_group_dir(struct super_block *sb, struct inode *parent, 
 * it has too few free inodes left (min_inodes) or

 * it has too few free blocks left (min_blocks) or

 * it's already running too large debt (max_debt).

 * Parent's group is prefered, if it doesn't satisfy these

 * Parent's group is preferred, if it doesn't satisfy these

 * conditions we search cyclically through the rest. If none

 * of the groups look good we just look for a group with more

 * free inodes than average (starting at parent's group).