Re: [PATCH 1/1] mm/damon: fix typos in comments

[Zenghui Yu <zenghui.yu@linux.dev>]

On 9/15/26 6:27 PM, Adrian Huang (Lenovo) wrote:
> Correct spelling mistakes. No functional changes.
> 
> Signed-off-by: Adrian Huang (Lenovo) <adrianhuang0701@gmail.com>
> ---
>  mm/damon/core.c     | 6 +++---
>  mm/damon/lru_sort.c | 2 +-
>  2 files changed, 4 insertions(+), 4 deletions(-)
> 
> diff --git a/mm/damon/core.c b/mm/damon/core.c
> index 0c98f7e267d0..981a153619c0 100644
> --- a/mm/damon/core.c
> +++ b/mm/damon/core.c
> @@ -2447,7 +2447,7 @@ static bool damos_valid_target(struct damon_ctx *c, struct damon_region *r,
>   * This function checks if a given region should be skipped or not for the
>   * reason.  If only the starting part of the region has previously charged,
>   * this function splits the region into two so that the second one covers the
> - * area that not charged in the previous charge widnow, and return true.  The
> + * area that not charged in the previous charge window, and return true.  The
>   * caller can see the second one on the next iteration of the region walk.
>   * Note that this means the caller should use damon_for_each_region() instead
>   * of damon_for_each_region_safe().  If damon_for_each_region_safe() is used,
> @@ -2613,7 +2613,7 @@ static void damos_walk_call_walk(struct damon_ctx *ctx, struct damon_target *t,
>   * This function is called when kdamond finished applying the action of a DAMOS
>   * scheme to all regions that eligible for the given &damos->apply_interval_us.
>   * If every scheme of @ctx including @s now finished walking for at least one
> - * &damos->apply_interval_us, this function makrs the handling of the given
> + * &damos->apply_interval_us, this function marks the handling of the given
>   * DAMOS walk request is done, so that damos_walk() can wake up and return.
>   */
>  static void damos_walk_complete(struct damon_ctx *ctx, struct damos *s)
> @@ -4143,7 +4143,7 @@ static bool damon_find_system_rams_range(unsigned long *start,
>   * This function sets the region of @t as requested by @start and @end.  If the
>   * values of @start and @end are zero, however, this function finds 'System
>   * RAM' resources and sets the region to cover all the resource.  In the latter
> - * case, this function saves the start and the end addresseses of the first and
> + * case, this function saves the start and the end addresses of the first and
>   * the last resources in @start and @end, respectively.
>   *
>   * Return: 0 on success, negative error code otherwise.
> diff --git a/mm/damon/lru_sort.c b/mm/damon/lru_sort.c
> index ad8e86dd3a93..273efa3c913e 100644
> --- a/mm/damon/lru_sort.c
> +++ b/mm/damon/lru_sort.c
> @@ -260,7 +260,7 @@ static int damon_lru_sort_add_filters(struct damos *hot_scheme,
>  		return -ENOMEM;
>  	damos_add_filter(hot_scheme, filter);
>  
> -	/* disabllow de-prioritizing young pages */
> +	/* disallow de-prioritizing young pages */
>  	filter = damos_new_filter(DAMOS_FILTER_TYPE_YOUNG, true, false);
>  	if (!filter)
>  		return -ENOMEM;

Reviewed-by: Zenghui Yu (Huawei) <zenghui.yu@linux.dev>

Thanks,
Zenghui