Eric Lee / smarc-ti-linux-kernel

Download as
Browse Code ยป

Commit c78bad11fbf1272ea021f56458025dc98486d6f4

Authored by Joe Perches
Committed by Adrian Bunk
1 parent ee0fc097ef
Exists in master and in 20 other branches dlt-processor-sdk-linux-03.00.00.04, newt-ti-linux-3.12.y, processor-sdk-linux-01.00.00, processor-sdk-linux-02.00.01, smarc-ti-linux-3.12.10, smarc-ti-linux-3.12.y, smarc-ti-linux-3.14.y, smarc-ti-linux-3.15.y, smarc-ti-lsk-linux-4.1.y, smarct3x-processor-sdk-04.01.00.06, smarct3x-processor-sdk-linux-02.00.01, smarct3x-processor-sdk-linux-03.00.00.04, smarct4x-800-processor-sdk-linux-02.00.01, smarct4x-processor-sdk-04.01.00.06, smarct4x-processor-sdk-linux-02.00.01, smarct4x-processor-sdk-linux-03.00.00.04, ti-linux-3.12.y, ti-linux-3.14.y, ti-linux-3.15.y, ti-lsk-linux-4.1.y

fs/: Spelling fixes 

Signed-off-by: Joe Perches <joe@perches.com>
Signed-off-by: Adrian Bunk <bunk@kernel.org>

Showing 9 changed files with 11 additions and 11 deletions Side-by-side Diff

... ... @@ -232,7 +232,7 @@
232 232 * @key: Key string to lookup in btree
233 233 * @value: Value stored with @key
234 234 *
235   - * On sucess, returns BEFS_OK and sets *@value to the value stored
  235 + * On success, returns BEFS_OK and sets *@value to the value stored
236 236 * with @key (usually the disk block number of an inode).
237 237 *
238 238 * On failure, returns BEFS_ERR or BEFS_BT_NOT_FOUND.
fs/freevxfs/vxfs_dir.h
Diff comments   View file @ c78bad1
... ... @@ -41,7 +41,7 @@
41 41 * VxFS directory block header.
42 42 *
43 43 * This entry is the head of every filesystem block in a directory.
44   - * It is used for free space managment and additionally includes
  44 + * It is used for free space management and additionally includes
45 45 * a hash for speeding up directory search (lookup).
46 46 *
47 47 * The hash may be empty and in fact we do not use it all in the
fs/freevxfs/vxfs_immed.c
Diff comments   View file @ c78bad1
... ... @@ -54,7 +54,7 @@
54 54 };
55 55  
56 56 /*
57   - * Adress space operations for immed files and directories.
  57 + * Address space operations for immed files and directories.
58 58 */
59 59 const struct address_space_operations vxfs_immed_aops = {
60 60 .readpage = vxfs_immed_readpage,
... ... @@ -450,7 +450,7 @@
450 450 fs_info(sdp, "jid=%u: Trying to acquire journal lock...\n",
451 451 jd->jd_jid);
452 452  
453   - /* Aquire the journal lock so we can do recovery */
  453 + /* Acquire the journal lock so we can do recovery */
454 454  
455 455 error = gfs2_glock_nq_num(sdp, jd->jd_jid, &gfs2_journal_glops,
456 456 LM_ST_EXCLUSIVE,
... ... @@ -3338,7 +3338,7 @@
3338 3338 if (insert->ins_split != SPLIT_NONE) {
3339 3339 /*
3340 3340 * We could call ocfs2_insert_at_leaf() for some types
3341   - * of splits, but it's easier to just let one seperate
  3341 + * of splits, but it's easier to just let one separate
3342 3342 * function sort it all out.
3343 3343 */
3344 3344 ocfs2_split_record(inode, left_path, right_path,
... ... @@ -1215,7 +1215,7 @@
1215 1215 down_write(&oi->ip_alloc_sem);
1216 1216  
1217 1217 /*
1218   - * Prepare for worst case allocation scenario of two seperate
  1218 + * Prepare for worst case allocation scenario of two separate
1219 1219 * extents.
1220 1220 */
1221 1221 if (alloc == 2)
fs/ocfs2/ocfs1_fs_compat.h
Diff comments   View file @ c78bad1
... ... @@ -77,7 +77,7 @@
77 77 {
78 78 /*00*/ __u32 curr_master;
79 79 __u8 file_lock;
80   - __u8 compat_pad[3]; /* Not in orignal definition. Used to
  80 + __u8 compat_pad[3]; /* Not in original definition. Used to
81 81 make the already existing alignment
82 82 explicit */
83 83 __u64 last_write_time;
... ... @@ -646,7 +646,7 @@
646 646 * sync-data inodes."
647 647 *
648 648 * Note: OCFS2 already does this differently for metadata vs data
649   - * allocations, as those bitmaps are seperate and undo access is never
  649 + * allocations, as those bitmaps are separate and undo access is never
650 650 * called on a metadata group descriptor.
651 651 */
652 652 static int ocfs2_test_bg_bit_allocatable(struct buffer_head *bg_bh,
fs/reiserfs/bitmap.c
Diff comments   View file @ c78bad1
... ... @@ -272,7 +272,7 @@
272 272  
273 273 /* If we don't have cached information on this bitmap block, we're
274 274 * going to have to load it later anyway. Loading it here allows us
275   - * to make a better decision. This favors long-term performace gain
  275 + * to make a better decision. This favors long-term performance gain
276 276 * with a better on-disk layout vs. a short term gain of skipping the
277 277 * read and potentially having a bad placement. */
278 278 if (info->free_count == UINT_MAX) {
... ... @@ -663,7 +663,7 @@
663 663  
664 664 /*
665 665 * Relocation based on dirid, hashing them into a given bitmap block
666   - * files. Formatted nodes are unaffected, a seperate policy covers them
  666 + * files. Formatted nodes are unaffected, a separate policy covers them
667 667 */
668 668 static void dirid_groups(reiserfs_blocknr_hint_t * hint)
669 669 {
... ... @@ -688,7 +688,7 @@
688 688  
689 689 /*
690 690 * Relocation based on oid, hashing them into a given bitmap block
691   - * files. Formatted nodes are unaffected, a seperate policy covers them
  691 + * files. Formatted nodes are unaffected, a separate policy covers them
692 692 */
693 693 static void oid_groups(reiserfs_blocknr_hint_t * hint)
694 694 {