adulau/aha
1
0
Fork 0
mirror of https://github.com/adulau/aha.git synced 2024-12-27 19:26:25 +00:00
Code Issues Projects Releases Packages Wiki Activity

fs/: Spelling fixes

Browse source 
Signed-off-by: Joe Perches <joe@perches.com>
Signed-off-by: Adrian Bunk <bunk@kernel.org>
This commit is contained in:
Joe Perches 2008-02-03 17:33:42 +02:00 committed by Adrian Bunk
parent ee0fc097ef
commit c78bad11fb
9 changed files with 11 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
fs/befs/btree.c
View file

@ -232,7 +232,7 @@ befs_bt_read_node(struct super_block *sb, befs_data_stream * ds,
* @key: Key string to lookup in btree * @key: Key string to lookup in btree
* @value: Value stored with @key * @value: Value stored with @key
* *
* On sucess, returns BEFS_OK and sets *@value to the value stored * On success, returns BEFS_OK and sets *@value to the value stored
* with @key (usually the disk block number of an inode). * with @key (usually the disk block number of an inode).
* *
* On failure, returns BEFS_ERR or BEFS_BT_NOT_FOUND. * On failure, returns BEFS_ERR or BEFS_BT_NOT_FOUND.

2
fs/freevxfs/vxfs_dir.h
View file

@ -41,7 +41,7 @@
* VxFS directory block header. * VxFS directory block header.
* *
* This entry is the head of every filesystem block in a directory. * This entry is the head of every filesystem block in a directory.
* It is used for free space managment and additionally includes * It is used for free space management and additionally includes
* a hash for speeding up directory search (lookup). * a hash for speeding up directory search (lookup).
* *
* The hash may be empty and in fact we do not use it all in the * The hash may be empty and in fact we do not use it all in the

2
fs/freevxfs/vxfs_immed.c
View file

@ -54,7 +54,7 @@ const struct inode_operations vxfs_immed_symlink_iops = {
}; };
/* /*
* Adress space operations for immed files and directories. * Address space operations for immed files and directories.
*/ */
const struct address_space_operations vxfs_immed_aops = { const struct address_space_operations vxfs_immed_aops = {
.readpage = vxfs_immed_readpage, .readpage = vxfs_immed_readpage,

2
fs/gfs2/recovery.c
View file

@ -450,7 +450,7 @@ int gfs2_recover_journal(struct gfs2_jdesc *jd)
fs_info(sdp, "jid=%u: Trying to acquire journal lock...\n", fs_info(sdp, "jid=%u: Trying to acquire journal lock...\n",
jd->jd_jid); jd->jd_jid);
/* Aquire the journal lock so we can do recovery */ /* Acquire the journal lock so we can do recovery */
error = gfs2_glock_nq_num(sdp, jd->jd_jid, &gfs2_journal_glops, error = gfs2_glock_nq_num(sdp, jd->jd_jid, &gfs2_journal_glops,
LM_ST_EXCLUSIVE, LM_ST_EXCLUSIVE,

2
fs/ocfs2/alloc.c
View file

@ -3338,7 +3338,7 @@ static int ocfs2_insert_path(struct inode *inode,
if (insert->ins_split != SPLIT_NONE) { if (insert->ins_split != SPLIT_NONE) {
/* /*
* We could call ocfs2_insert_at_leaf() for some types * We could call ocfs2_insert_at_leaf() for some types
* of splits, but it's easier to just let one seperate * of splits, but it's easier to just let one separate
* function sort it all out. * function sort it all out.
*/ */
ocfs2_split_record(inode, left_path, right_path, ocfs2_split_record(inode, left_path, right_path,

2
fs/ocfs2/dir.c
View file

@ -1215,7 +1215,7 @@ static int ocfs2_expand_inline_dir(struct inode *dir, struct buffer_head *di_bh,
down_write(&oi->ip_alloc_sem); down_write(&oi->ip_alloc_sem);
/* /*
* Prepare for worst case allocation scenario of two seperate * Prepare for worst case allocation scenario of two separate
* extents. * extents.
*/ */
if (alloc == 2) if (alloc == 2)

2
fs/ocfs2/ocfs1_fs_compat.h
View file

@ -77,7 +77,7 @@ struct ocfs1_disk_lock
{ {
/*00*/ __u32 curr_master; /*00*/ __u32 curr_master;
__u8 file_lock; __u8 file_lock;
__u8 compat_pad[3]; /* Not in orignal definition. Used to __u8 compat_pad[3]; /* Not in original definition. Used to
make the already existing alignment make the already existing alignment
explicit */ explicit */
__u64 last_write_time; __u64 last_write_time;

2
fs/ocfs2/suballoc.c
View file

@ -646,7 +646,7 @@ bail:
* sync-data inodes." * sync-data inodes."
* *
* Note: OCFS2 already does this differently for metadata vs data * Note: OCFS2 already does this differently for metadata vs data
* allocations, as those bitmaps are seperate and undo access is never * allocations, as those bitmaps are separate and undo access is never
* called on a metadata group descriptor. * called on a metadata group descriptor.
*/ */
static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh, static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,

6
fs/reiserfs/bitmap.c
View file

@ -272,7 +272,7 @@ static inline int block_group_used(struct super_block *s, u32 id)
/* If we don't have cached information on this bitmap block, we're /* If we don't have cached information on this bitmap block, we're
* going to have to load it later anyway. Loading it here allows us * going to have to load it later anyway. Loading it here allows us
* to make a better decision. This favors long-term performace gain * to make a better decision. This favors long-term performance gain
* with a better on-disk layout vs. a short term gain of skipping the * with a better on-disk layout vs. a short term gain of skipping the
* read and potentially having a bad placement. */ * read and potentially having a bad placement. */
if (info->free_count == UINT_MAX) { if (info->free_count == UINT_MAX) {
@ -663,7 +663,7 @@ static inline void new_hashed_relocation(reiserfs_blocknr_hint_t * hint)
/* /*
* Relocation based on dirid, hashing them into a given bitmap block * Relocation based on dirid, hashing them into a given bitmap block
* files. Formatted nodes are unaffected, a seperate policy covers them * files. Formatted nodes are unaffected, a separate policy covers them
*/ */
static void dirid_groups(reiserfs_blocknr_hint_t * hint) static void dirid_groups(reiserfs_blocknr_hint_t * hint)
{ {
@ -688,7 +688,7 @@ static void dirid_groups(reiserfs_blocknr_hint_t * hint)
/* /*
* Relocation based on oid, hashing them into a given bitmap block * Relocation based on oid, hashing them into a given bitmap block
* files. Formatted nodes are unaffected, a seperate policy covers them * files. Formatted nodes are unaffected, a separate policy covers them
*/ */
static void oid_groups(reiserfs_blocknr_hint_t * hint) static void oid_groups(reiserfs_blocknr_hint_t * hint)
{ {