1 // SPDX-License-Identifier: GPL-2.0
3 * Common Primitives for Data Access Monitoring
5 * Author: SeongJae Park <sj@kernel.org>
8 #include <linux/mmu_notifier.h>
9 #include <linux/page_idle.h>
10 #include <linux/pagemap.h>
11 #include <linux/rmap.h>
13 #include "ops-common.h"
16 * Get an online page for a pfn if it's in the LRU list. Otherwise, returns
19 * The body of this function is stolen from the 'page_idle_get_page()'. We
20 * steal rather than reuse it because the code is quite simple.
22 struct page *damon_get_page(unsigned long pfn)
24 struct page *page = pfn_to_online_page(pfn);
26 if (!page || !PageLRU(page) || !get_page_unless_zero(page))
29 if (unlikely(!PageLRU(page))) {
36 void damon_ptep_mkold(pte_t *pte, struct mm_struct *mm, unsigned long addr)
38 bool referenced = false;
39 struct page *page = damon_get_page(pte_pfn(*pte));
44 if (pte_young(*pte)) {
46 *pte = pte_mkold(*pte);
49 #ifdef CONFIG_MMU_NOTIFIER
50 if (mmu_notifier_clear_young(mm, addr, addr + PAGE_SIZE))
52 #endif /* CONFIG_MMU_NOTIFIER */
61 void damon_pmdp_mkold(pmd_t *pmd, struct mm_struct *mm, unsigned long addr)
63 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
64 bool referenced = false;
65 struct page *page = damon_get_page(pmd_pfn(*pmd));
70 if (pmd_young(*pmd)) {
72 *pmd = pmd_mkold(*pmd);
75 #ifdef CONFIG_MMU_NOTIFIER
76 if (mmu_notifier_clear_young(mm, addr, addr + HPAGE_PMD_SIZE))
78 #endif /* CONFIG_MMU_NOTIFIER */
85 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
88 #define DAMON_MAX_SUBSCORE (100)
89 #define DAMON_MAX_AGE_IN_LOG (32)
91 int damon_hot_score(struct damon_ctx *c, struct damon_region *r,
94 unsigned int max_nr_accesses;
96 unsigned int age_in_sec;
97 int age_in_log, age_subscore;
98 unsigned int freq_weight = s->quota.weight_nr_accesses;
99 unsigned int age_weight = s->quota.weight_age;
102 max_nr_accesses = c->attrs.aggr_interval / c->attrs.sample_interval;
103 freq_subscore = r->nr_accesses * DAMON_MAX_SUBSCORE / max_nr_accesses;
105 age_in_sec = (unsigned long)r->age * c->attrs.aggr_interval / 1000000;
106 for (age_in_log = 0; age_in_log < DAMON_MAX_AGE_IN_LOG && age_in_sec;
107 age_in_log++, age_in_sec >>= 1)
110 /* If frequency is 0, higher age means it's colder */
111 if (freq_subscore == 0)
115 * Now age_in_log is in [-DAMON_MAX_AGE_IN_LOG, DAMON_MAX_AGE_IN_LOG].
116 * Scale it to be in [0, 100] and set it as age subscore.
118 age_in_log += DAMON_MAX_AGE_IN_LOG;
119 age_subscore = age_in_log * DAMON_MAX_SUBSCORE /
120 DAMON_MAX_AGE_IN_LOG / 2;
122 hotness = (freq_weight * freq_subscore + age_weight * age_subscore);
123 if (freq_weight + age_weight)
124 hotness /= freq_weight + age_weight;
126 * Transform it to fit in [0, DAMOS_MAX_SCORE]
128 hotness = hotness * DAMOS_MAX_SCORE / DAMON_MAX_SUBSCORE;
133 int damon_cold_score(struct damon_ctx *c, struct damon_region *r,
136 int hotness = damon_hot_score(c, r, s);
138 /* Return coldness of the region */
139 return DAMOS_MAX_SCORE - hotness;