* [PATCH] befs: fix typos in btree.c
@ 2016-08-11 21:15 Luis de Bethencourt
2016-08-12 7:30 ` Salah Triki
0 siblings, 1 reply; 2+ messages in thread
From: Luis de Bethencourt @ 2016-08-11 21:15 UTC (permalink / raw)
To: linux-kernel; +Cc: akpm, viro, salah.triki, Luis de Bethencourt
Fixing typos in kernel-doc function descriptions in fs/befs/btree.c.
Signed-off-by: Luis de Bethencourt <luisbg@osg.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
^ permalink raw reply related [flat|nested] 2+ messages in thread
* Re: [PATCH] befs: fix typos in btree.c
2016-08-11 21:15 [PATCH] befs: fix typos in btree.c Luis de Bethencourt
@ 2016-08-12 7:30 ` Salah Triki
0 siblings, 0 replies; 2+ messages in thread
From: Salah Triki @ 2016-08-12 7:30 UTC (permalink / raw)
To: Luis de Bethencourt; +Cc: linux-kernel, akpm, viro, salah.triki
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@osg.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@gmail.com>
Thanx,
Salah
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2016-08-12 7:30 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2016-08-11 21:15 [PATCH] befs: fix typos in btree.c Luis de Bethencourt
2016-08-12 7:30 ` Salah Triki
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.