2023-05-05 14:31:29

by Wonguk Lee

Subject: [PATCH v2] fs: jfs: (trivial) Fix typo in dbInitTree function

While trying to fix the jfs UBSAN problem reported in syzkaller,
(https://syzkaller.appspot.com/bug?id=01abadbd6ae6a08b1f1987aa61554c6b3ac19ff2)

I found the typo in the comment of dbInitTree function and fix it.

Signed-off-by: Wonguk Lee <[email protected]>
---
Changes in v2:
- Add the patch description and change the name in the Signed-off-by

fs/jfs/jfs_dmap.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/fs/jfs/jfs_dmap.c b/fs/jfs/jfs_dmap.c
index a3eb1e826947..d8a03d3026cc 100644
--- a/fs/jfs/jfs_dmap.c
+++ b/fs/jfs/jfs_dmap.c
@@ -3851,7 +3851,7 @@ static int dbInitTree(struct dmaptree * dtp)
l2max = le32_to_cpu(dtp->l2nleafs) + dtp->budmin;

/*
- * configure the leaf levevl into binary buddy system
+ * configure the leaf level into binary buddy system
*
* Try to combine buddies starting with a buddy size of 1
* (i.e. two leaves). At a buddy size of 1 two buddy leaves
--
2.34.1

2023-06-20 20:14:07

by Dave Kleikamp

Subject: Re: [PATCH v2] fs: jfs: (trivial) Fix typo in dbInitTree function

On 5/5/23 9:05AM, Wonguk Lee wrote:
> While trying to fix the jfs UBSAN problem reported in syzkaller,
> (https://syzkaller.appspot.com/bug?id=01abadbd6ae6a08b1f1987aa61554c6b3ac19ff2)
>
> I found the typo in the comment of dbInitTree function and fix it.

Thanks. Applied to jfs-next.

>
> Signed-off-by: Wonguk Lee <[email protected]>
> ---
> Changes in v2:
> - Add the patch description and change the name in the Signed-off-by
>
> fs/jfs/jfs_dmap.c | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/fs/jfs/jfs_dmap.c b/fs/jfs/jfs_dmap.c
> index a3eb1e826947..d8a03d3026cc 100644
> --- a/fs/jfs/jfs_dmap.c
> +++ b/fs/jfs/jfs_dmap.c
> @@ -3851,7 +3851,7 @@ static int dbInitTree(struct dmaptree * dtp)
> l2max = le32_to_cpu(dtp->l2nleafs) + dtp->budmin;
>
> /*
> - * configure the leaf levevl into binary buddy system
> + * configure the leaf level into binary buddy system
> *
> * Try to combine buddies starting with a buddy size of 1
> * (i.e. two leaves). At a buddy size of 1 two buddy leaves