ops-common.c 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Common Primitives for Data Access Monitoring
  4. *
  5. * Author: SeongJae Park <[email protected]>
  6. */
  7. #include <linux/mmu_notifier.h>
  8. #include <linux/page_idle.h>
  9. #include <linux/pagemap.h>
  10. #include <linux/rmap.h>
  11. #include "ops-common.h"
  12. /*
  13. * Get an online page for a pfn if it's in the LRU list. Otherwise, returns
  14. * NULL.
  15. *
  16. * The body of this function is stolen from the 'page_idle_get_page()'. We
  17. * steal rather than reuse it because the code is quite simple.
  18. */
  19. struct page *damon_get_page(unsigned long pfn)
  20. {
  21. struct page *page = pfn_to_online_page(pfn);
  22. if (!page || !PageLRU(page) || !get_page_unless_zero(page))
  23. return NULL;
  24. if (unlikely(!PageLRU(page))) {
  25. put_page(page);
  26. page = NULL;
  27. }
  28. return page;
  29. }
  30. void damon_ptep_mkold(pte_t *pte, struct vm_area_struct *vma, unsigned long addr)
  31. {
  32. struct page *page = damon_get_page(pte_pfn(*pte));
  33. if (!page)
  34. return;
  35. if (ptep_clear_young_notify(vma, addr, pte))
  36. set_page_young(page);
  37. set_page_idle(page);
  38. put_page(page);
  39. }
  40. void damon_pmdp_mkold(pmd_t *pmd, struct vm_area_struct *vma, unsigned long addr)
  41. {
  42. #ifdef CONFIG_TRANSPARENT_HUGEPAGE
  43. struct page *page = damon_get_page(pmd_pfn(*pmd));
  44. if (!page)
  45. return;
  46. if (pmdp_clear_young_notify(vma, addr, pmd))
  47. set_page_young(page);
  48. set_page_idle(page);
  49. put_page(page);
  50. #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
  51. }
  52. #define DAMON_MAX_SUBSCORE (100)
  53. #define DAMON_MAX_AGE_IN_LOG (32)
  54. int damon_hot_score(struct damon_ctx *c, struct damon_region *r,
  55. struct damos *s)
  56. {
  57. int freq_subscore;
  58. unsigned int age_in_sec;
  59. int age_in_log, age_subscore;
  60. unsigned int freq_weight = s->quota.weight_nr_accesses;
  61. unsigned int age_weight = s->quota.weight_age;
  62. int hotness;
  63. freq_subscore = r->nr_accesses * DAMON_MAX_SUBSCORE /
  64. damon_max_nr_accesses(&c->attrs);
  65. age_in_sec = (unsigned long)r->age * c->attrs.aggr_interval / 1000000;
  66. for (age_in_log = 0; age_in_log < DAMON_MAX_AGE_IN_LOG && age_in_sec;
  67. age_in_log++, age_in_sec >>= 1)
  68. ;
  69. /* If frequency is 0, higher age means it's colder */
  70. if (freq_subscore == 0)
  71. age_in_log *= -1;
  72. /*
  73. * Now age_in_log is in [-DAMON_MAX_AGE_IN_LOG, DAMON_MAX_AGE_IN_LOG].
  74. * Scale it to be in [0, 100] and set it as age subscore.
  75. */
  76. age_in_log += DAMON_MAX_AGE_IN_LOG;
  77. age_subscore = age_in_log * DAMON_MAX_SUBSCORE /
  78. DAMON_MAX_AGE_IN_LOG / 2;
  79. hotness = (freq_weight * freq_subscore + age_weight * age_subscore);
  80. if (freq_weight + age_weight)
  81. hotness /= freq_weight + age_weight;
  82. /*
  83. * Transform it to fit in [0, DAMOS_MAX_SCORE]
  84. */
  85. hotness = hotness * DAMOS_MAX_SCORE / DAMON_MAX_SUBSCORE;
  86. return hotness;
  87. }
  88. int damon_cold_score(struct damon_ctx *c, struct damon_region *r,
  89. struct damos *s)
  90. {
  91. int hotness = damon_hot_score(c, r, s);
  92. /* Return coldness of the region */
  93. return DAMOS_MAX_SCORE - hotness;
  94. }