github-mirror/linux
1
0
Fork 0
mirror of https://github.com/torvalds/linux.git synced 2026-11-07 06:17:02 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity Graph

mm/damon: fix typos in comments

Browse Source 
Correct spelling mistakes. No functional changes.

Link: https://lore.kernel.org/20260921151547.78472-4-sj@kernel.org
Signed-off-by: Adrian Huang (Lenovo) <adrianhuang0701@gmail.com>
Signed-off-by: SJ Park <sj@kernel.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Reviewed-by: Zenghui Yu (Huawei) <zenghui.yu@linux.dev>
Reviewed-by: SJ Park <sj@kernel.org>
Cc: Karthikeyan KS <karthiproffesional@gmail.com>
Cc: Liew Rui Yan <aethernet65535@gmail.com>
Cc: Xuewen Wang <wangxuewen@kylinos.cn>
This commit is contained in:
Adrian Huang (Lenovo) 2026-09-21 08:15:45 -07:00 committed by Andrew Morton
parent 639b0cca7d
commit 76ba2763d5
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
mm/damon/core.c
View File

@ -2486,7 +2486,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,
@ -2652,7 +2652,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)
@ -4194,7 +4194,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.

2
mm/damon/lru_sort.c
View File

@ -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;