linux-kernel - Re: [PATCH] befs: fix typos in btree.c

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [day] [month] [year] [list]

Message-ID: <20160812073009.GA6693@pc>
Date:	Fri, 12 Aug 2016 08:30:10 +0100
From:	Salah Triki <salah.triki@...il.com>
To:	Luis de Bethencourt <luisbg@....samsung.com>
Cc:	linux-kernel@...r.kernel.org, akpm@...ux-foundation.org,
	viro@...iv.linux.org.uk, salah.triki@....org
Subject: Re: [PATCH] befs: fix typos in btree.c

On Thu, Aug 11, 2016 at 10:15:16PM +0100, Luis de Bethencourt wrote:
> Fixing typos in kernel-doc function descriptions in fs/befs/btree.c.
> 
> Signed-off-by: Luis de Bethencourt <luisbg@....samsung.com>
> ---
> 
> Hi,
> 
> Noticed the typo of "actuall" below and decided to fix all typos in the
> btree.c file.
> 
> Thanks,
> Luis
> 
>  fs/befs/btree.c | 7 +++----
>  1 file changed, 3 insertions(+), 4 deletions(-)
> 
> diff --git a/fs/befs/btree.c b/fs/befs/btree.c
> index 54a1f95..866d070 100644
> --- a/fs/befs/btree.c
> +++ b/fs/befs/btree.c
> @@ -242,7 +242,7 @@ befs_bt_read_node(struct super_block *sb, const befs_data_stream *ds,
>   *   Read the superblock and rootnode of the b+tree.
>   *   Drill down through the interior nodes using befs_find_key().
>   *   Once at the correct leaf node, use befs_find_key() again to get the
> - *   actuall value stored with the key.
> + *   actual value stored with the key.
>   */
>  int
>  befs_btree_find(struct super_block *sb, const befs_data_stream *ds,
> @@ -397,7 +397,7 @@ befs_find_key(struct super_block *sb, struct befs_btree_node *node,
>   * @keysize: Length of the returned key
>   * @value: Value stored with the returned key
>   *
> - * Heres how it works: Key_no is the index of the key/value pair to 
> + * Here's how it works: Key_no is the index of the key/value pair to
>   * return in keybuf/value.
>   * Bufsize is the size of keybuf (BEFS_NAME_LEN+1 is a good size). Keysize is 
>   * the number of characters in the key (just a convenience).
> @@ -533,7 +533,6 @@ befs_btree_read(struct super_block *sb, const befs_data_stream *ds,
>   * @node_off: Pointer to offset of current node within datastream. Modified
>   * 		by the function.
>   *
> - *
>   * Helper function for btree traverse. Moves the current position to the 
>   * start of the first leaf node.
>   *
> @@ -707,7 +706,7 @@ befs_bt_get_key(struct super_block *sb, struct befs_btree_node *node,
>   *
>   * Returns 0 if @key1 and @key2 are equal.
>   * Returns >0 if @key1 is greater.
> - * Returns <0 if @key2 is greater..
> + * Returns <0 if @key2 is greater.
>   */
>  static int
>  befs_compare_strings(const void *key1, int keylen1,
> -- 
> 2.5.1
> 

Signed-off-by: Salah Triki <salah.triki@...il.com>

Thanx,
Salah