mirrors
/
linux-stable
mirror of https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
1
0
Fork 0
Code Issues Releases Wiki Activity

ubifs: Fix spelling mistakes 

Fix some spelling mistakes in comments:
withoug  ==> without
numer  ==> number
aswell  ==> as well
referes  ==> refers
childs  ==> children
unnecesarry  ==> unnecessary

Signed-off-by: Zheng Yongjun <zhengyongjun3@huawei.com>
Reviewed-by: Alexander Dahl <ada@thorsis.com>
Signed-off-by: Richard Weinberger <richard@nod.at>
This commit is contained in:
Zheng Yongjun 2021-06-04 09:45:56 +08:00 committed by Richard Weinberger
parent 819f9ab430
commit 07c32de44e
6 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
fs/ubifs/journal.c
View File

@ -1432,7 +1432,7 @@ out_free:
/** /**
* truncate_data_node - re-compress/encrypt a truncated data node. * truncate_data_node - re-compress/encrypt a truncated data node.
* @c: UBIFS file-system description object * @c: UBIFS file-system description object
* @inode: inode which referes to the data node * @inode: inode which refers to the data node
* @block: data block number * @block: data block number
* @dn: data node to re-compress * @dn: data node to re-compress
* @new_len: new length * @new_len: new length

2
fs/ubifs/master.c
View File

@ -37,7 +37,7 @@ int ubifs_compare_master_node(struct ubifs_info *c, void *m1, void *m2)
return ret; return ret;
/* /*
* Do not compare the embedded HMAC aswell which also must be different * Do not compare the embedded HMAC as well which also must be different
* due to the different common node header. * due to the different common node header.
*/ */
behind = hmac_offs + UBIFS_MAX_HMAC_LEN; behind = hmac_offs + UBIFS_MAX_HMAC_LEN;

2
fs/ubifs/replay.c
View File

@ -296,7 +296,7 @@ static int apply_replay_entry(struct ubifs_info *c, struct replay_entry *r)
* @b: second replay entry * @b: second replay entry
* *
* This is a comparios function for 'list_sort()' which compares 2 replay * This is a comparios function for 'list_sort()' which compares 2 replay
* entries @a and @b by comparing their sequence numer. Returns %1 if @a has * entries @a and @b by comparing their sequence number. Returns %1 if @a has
* greater sequence number and %-1 otherwise. * greater sequence number and %-1 otherwise.
*/ */
static int replay_entries_cmp(void *priv, const struct list_head *a, static int replay_entries_cmp(void *priv, const struct list_head *a,

2
fs/ubifs/super.c
View File

@ -2061,7 +2061,7 @@ const struct super_operations ubifs_super_operations = {
* @mode: UBI volume open mode * @mode: UBI volume open mode
* *
* The primary method of mounting UBIFS is by specifying the UBI volume * The primary method of mounting UBIFS is by specifying the UBI volume
* character device node path. However, UBIFS may also be mounted withoug any * character device node path. However, UBIFS may also be mounted without any
* character device node using one of the following methods: * character device node using one of the following methods:
* *
* o ubiX_Y - mount UBI device number X, volume Y; * o ubiX_Y - mount UBI device number X, volume Y;

2
fs/ubifs/tnc_commit.c
View File

@ -930,7 +930,7 @@ static int write_index(struct ubifs_info *c)
* flag cleared before %COW_ZNODE. Specifically, it matters in * flag cleared before %COW_ZNODE. Specifically, it matters in
* the 'dirty_cow_znode()' function. This is the reason for the * the 'dirty_cow_znode()' function. This is the reason for the
* first barrier. Also, we want the bit changes to be seen to * first barrier. Also, we want the bit changes to be seen to
* other threads ASAP, to avoid unnecesarry copying, which is * other threads ASAP, to avoid unnecessary copying, which is
* the reason for the second barrier. * the reason for the second barrier.
*/ */
clear_bit(DIRTY_ZNODE, &znode->flags); clear_bit(DIRTY_ZNODE, &znode->flags);

2
fs/ubifs/ubifs.h
View File

@ -914,7 +914,7 @@ struct ubifs_budget_req {
* @rb: rb-tree node of rb-tree of orphans sorted by inode number * @rb: rb-tree node of rb-tree of orphans sorted by inode number
* @list: list head of list of orphans in order added * @list: list head of list of orphans in order added
* @new_list: list head of list of orphans added since the last commit * @new_list: list head of list of orphans added since the last commit
* @child_list: list of xattr childs if this orphan hosts xattrs, list head * @child_list: list of xattr children if this orphan hosts xattrs, list head
* if this orphan is a xattr, not used otherwise. * if this orphan is a xattr, not used otherwise.
* @cnext: next orphan to commit * @cnext: next orphan to commit
* @dnext: next orphan to delete * @dnext: next orphan to delete