13f49584bSSeongJae Park // SPDX-License-Identifier: GPL-2.0 23f49584bSSeongJae Park /* 33f49584bSSeongJae Park * DAMON Primitives for Virtual Address Spaces 43f49584bSSeongJae Park * 53f49584bSSeongJae Park * Author: SeongJae Park <sjpark@amazon.de> 63f49584bSSeongJae Park */ 73f49584bSSeongJae Park 83f49584bSSeongJae Park #define pr_fmt(fmt) "damon-va: " fmt 93f49584bSSeongJae Park 106dea8addSSeongJae Park #include <asm-generic/mman-common.h> 113f49584bSSeongJae Park #include <linux/highmem.h> 1246c3a0acSSeongJae Park #include <linux/hugetlb.h> 1346c3a0acSSeongJae Park #include <linux/mmu_notifier.h> 143f49584bSSeongJae Park #include <linux/page_idle.h> 153f49584bSSeongJae Park #include <linux/pagewalk.h> 168581fd40SJakub Kicinski #include <linux/sched/mm.h> 1746c3a0acSSeongJae Park 1846c3a0acSSeongJae Park #include "prmtv-common.h" 193f49584bSSeongJae Park 2017ccae8bSSeongJae Park #ifdef CONFIG_DAMON_VADDR_KUNIT_TEST 2117ccae8bSSeongJae Park #undef DAMON_MIN_REGION 2217ccae8bSSeongJae Park #define DAMON_MIN_REGION 1 2317ccae8bSSeongJae Park #endif 2417ccae8bSSeongJae Park 253f49584bSSeongJae Park /* 263f49584bSSeongJae Park * 't->id' should be the pointer to the relevant 'struct pid' having reference 273f49584bSSeongJae Park * count. Caller must put the returned task, unless it is NULL. 283f49584bSSeongJae Park */ 293f49584bSSeongJae Park #define damon_get_task_struct(t) \ 303f49584bSSeongJae Park (get_pid_task((struct pid *)t->id, PIDTYPE_PID)) 313f49584bSSeongJae Park 323f49584bSSeongJae Park /* 333f49584bSSeongJae Park * Get the mm_struct of the given target 343f49584bSSeongJae Park * 353f49584bSSeongJae Park * Caller _must_ put the mm_struct after use, unless it is NULL. 363f49584bSSeongJae Park * 373f49584bSSeongJae Park * Returns the mm_struct of the target on success, NULL on failure 383f49584bSSeongJae Park */ 393f49584bSSeongJae Park static struct mm_struct *damon_get_mm(struct damon_target *t) 403f49584bSSeongJae Park { 413f49584bSSeongJae Park struct task_struct *task; 423f49584bSSeongJae Park struct mm_struct *mm; 433f49584bSSeongJae Park 443f49584bSSeongJae Park task = damon_get_task_struct(t); 453f49584bSSeongJae Park if (!task) 463f49584bSSeongJae Park return NULL; 473f49584bSSeongJae Park 483f49584bSSeongJae Park mm = get_task_mm(task); 493f49584bSSeongJae Park put_task_struct(task); 503f49584bSSeongJae Park return mm; 513f49584bSSeongJae Park } 523f49584bSSeongJae Park 533f49584bSSeongJae Park /* 543f49584bSSeongJae Park * Functions for the initial monitoring target regions construction 553f49584bSSeongJae Park */ 563f49584bSSeongJae Park 573f49584bSSeongJae Park /* 583f49584bSSeongJae Park * Size-evenly split a region into 'nr_pieces' small regions 593f49584bSSeongJae Park * 603f49584bSSeongJae Park * Returns 0 on success, or negative error code otherwise. 613f49584bSSeongJae Park */ 623f49584bSSeongJae Park static int damon_va_evenly_split_region(struct damon_target *t, 633f49584bSSeongJae Park struct damon_region *r, unsigned int nr_pieces) 643f49584bSSeongJae Park { 653f49584bSSeongJae Park unsigned long sz_orig, sz_piece, orig_end; 663f49584bSSeongJae Park struct damon_region *n = NULL, *next; 673f49584bSSeongJae Park unsigned long start; 683f49584bSSeongJae Park 693f49584bSSeongJae Park if (!r || !nr_pieces) 703f49584bSSeongJae Park return -EINVAL; 713f49584bSSeongJae Park 723f49584bSSeongJae Park orig_end = r->ar.end; 733f49584bSSeongJae Park sz_orig = r->ar.end - r->ar.start; 743f49584bSSeongJae Park sz_piece = ALIGN_DOWN(sz_orig / nr_pieces, DAMON_MIN_REGION); 753f49584bSSeongJae Park 763f49584bSSeongJae Park if (!sz_piece) 773f49584bSSeongJae Park return -EINVAL; 783f49584bSSeongJae Park 793f49584bSSeongJae Park r->ar.end = r->ar.start + sz_piece; 803f49584bSSeongJae Park next = damon_next_region(r); 813f49584bSSeongJae Park for (start = r->ar.end; start + sz_piece <= orig_end; 823f49584bSSeongJae Park start += sz_piece) { 833f49584bSSeongJae Park n = damon_new_region(start, start + sz_piece); 843f49584bSSeongJae Park if (!n) 853f49584bSSeongJae Park return -ENOMEM; 863f49584bSSeongJae Park damon_insert_region(n, r, next, t); 873f49584bSSeongJae Park r = n; 883f49584bSSeongJae Park } 893f49584bSSeongJae Park /* complement last region for possible rounding error */ 903f49584bSSeongJae Park if (n) 913f49584bSSeongJae Park n->ar.end = orig_end; 923f49584bSSeongJae Park 933f49584bSSeongJae Park return 0; 943f49584bSSeongJae Park } 953f49584bSSeongJae Park 963f49584bSSeongJae Park static unsigned long sz_range(struct damon_addr_range *r) 973f49584bSSeongJae Park { 983f49584bSSeongJae Park return r->end - r->start; 993f49584bSSeongJae Park } 1003f49584bSSeongJae Park 1013f49584bSSeongJae Park static void swap_ranges(struct damon_addr_range *r1, 1023f49584bSSeongJae Park struct damon_addr_range *r2) 1033f49584bSSeongJae Park { 1043f49584bSSeongJae Park struct damon_addr_range tmp; 1053f49584bSSeongJae Park 1063f49584bSSeongJae Park tmp = *r1; 1073f49584bSSeongJae Park *r1 = *r2; 1083f49584bSSeongJae Park *r2 = tmp; 1093f49584bSSeongJae Park } 1103f49584bSSeongJae Park 1113f49584bSSeongJae Park /* 1123f49584bSSeongJae Park * Find three regions separated by two biggest unmapped regions 1133f49584bSSeongJae Park * 1143f49584bSSeongJae Park * vma the head vma of the target address space 1153f49584bSSeongJae Park * regions an array of three address ranges that results will be saved 1163f49584bSSeongJae Park * 1173f49584bSSeongJae Park * This function receives an address space and finds three regions in it which 1183f49584bSSeongJae Park * separated by the two biggest unmapped regions in the space. Please refer to 1193f49584bSSeongJae Park * below comments of '__damon_va_init_regions()' function to know why this is 1203f49584bSSeongJae Park * necessary. 1213f49584bSSeongJae Park * 1223f49584bSSeongJae Park * Returns 0 if success, or negative error code otherwise. 1233f49584bSSeongJae Park */ 1243f49584bSSeongJae Park static int __damon_va_three_regions(struct vm_area_struct *vma, 1253f49584bSSeongJae Park struct damon_addr_range regions[3]) 1263f49584bSSeongJae Park { 1273f49584bSSeongJae Park struct damon_addr_range gap = {0}, first_gap = {0}, second_gap = {0}; 1283f49584bSSeongJae Park struct vm_area_struct *last_vma = NULL; 1293f49584bSSeongJae Park unsigned long start = 0; 1303f49584bSSeongJae Park struct rb_root rbroot; 1313f49584bSSeongJae Park 1323f49584bSSeongJae Park /* Find two biggest gaps so that first_gap > second_gap > others */ 1333f49584bSSeongJae Park for (; vma; vma = vma->vm_next) { 1343f49584bSSeongJae Park if (!last_vma) { 1353f49584bSSeongJae Park start = vma->vm_start; 1363f49584bSSeongJae Park goto next; 1373f49584bSSeongJae Park } 1383f49584bSSeongJae Park 1393f49584bSSeongJae Park if (vma->rb_subtree_gap <= sz_range(&second_gap)) { 1403f49584bSSeongJae Park rbroot.rb_node = &vma->vm_rb; 1413f49584bSSeongJae Park vma = rb_entry(rb_last(&rbroot), 1423f49584bSSeongJae Park struct vm_area_struct, vm_rb); 1433f49584bSSeongJae Park goto next; 1443f49584bSSeongJae Park } 1453f49584bSSeongJae Park 1463f49584bSSeongJae Park gap.start = last_vma->vm_end; 1473f49584bSSeongJae Park gap.end = vma->vm_start; 1483f49584bSSeongJae Park if (sz_range(&gap) > sz_range(&second_gap)) { 1493f49584bSSeongJae Park swap_ranges(&gap, &second_gap); 1503f49584bSSeongJae Park if (sz_range(&second_gap) > sz_range(&first_gap)) 1513f49584bSSeongJae Park swap_ranges(&second_gap, &first_gap); 1523f49584bSSeongJae Park } 1533f49584bSSeongJae Park next: 1543f49584bSSeongJae Park last_vma = vma; 1553f49584bSSeongJae Park } 1563f49584bSSeongJae Park 1573f49584bSSeongJae Park if (!sz_range(&second_gap) || !sz_range(&first_gap)) 1583f49584bSSeongJae Park return -EINVAL; 1593f49584bSSeongJae Park 1603f49584bSSeongJae Park /* Sort the two biggest gaps by address */ 1613f49584bSSeongJae Park if (first_gap.start > second_gap.start) 1623f49584bSSeongJae Park swap_ranges(&first_gap, &second_gap); 1633f49584bSSeongJae Park 1643f49584bSSeongJae Park /* Store the result */ 1653f49584bSSeongJae Park regions[0].start = ALIGN(start, DAMON_MIN_REGION); 1663f49584bSSeongJae Park regions[0].end = ALIGN(first_gap.start, DAMON_MIN_REGION); 1673f49584bSSeongJae Park regions[1].start = ALIGN(first_gap.end, DAMON_MIN_REGION); 1683f49584bSSeongJae Park regions[1].end = ALIGN(second_gap.start, DAMON_MIN_REGION); 1693f49584bSSeongJae Park regions[2].start = ALIGN(second_gap.end, DAMON_MIN_REGION); 1703f49584bSSeongJae Park regions[2].end = ALIGN(last_vma->vm_end, DAMON_MIN_REGION); 1713f49584bSSeongJae Park 1723f49584bSSeongJae Park return 0; 1733f49584bSSeongJae Park } 1743f49584bSSeongJae Park 1753f49584bSSeongJae Park /* 1763f49584bSSeongJae Park * Get the three regions in the given target (task) 1773f49584bSSeongJae Park * 1783f49584bSSeongJae Park * Returns 0 on success, negative error code otherwise. 1793f49584bSSeongJae Park */ 1803f49584bSSeongJae Park static int damon_va_three_regions(struct damon_target *t, 1813f49584bSSeongJae Park struct damon_addr_range regions[3]) 1823f49584bSSeongJae Park { 1833f49584bSSeongJae Park struct mm_struct *mm; 1843f49584bSSeongJae Park int rc; 1853f49584bSSeongJae Park 1863f49584bSSeongJae Park mm = damon_get_mm(t); 1873f49584bSSeongJae Park if (!mm) 1883f49584bSSeongJae Park return -EINVAL; 1893f49584bSSeongJae Park 1903f49584bSSeongJae Park mmap_read_lock(mm); 1913f49584bSSeongJae Park rc = __damon_va_three_regions(mm->mmap, regions); 1923f49584bSSeongJae Park mmap_read_unlock(mm); 1933f49584bSSeongJae Park 1943f49584bSSeongJae Park mmput(mm); 1953f49584bSSeongJae Park return rc; 1963f49584bSSeongJae Park } 1973f49584bSSeongJae Park 1983f49584bSSeongJae Park /* 1993f49584bSSeongJae Park * Initialize the monitoring target regions for the given target (task) 2003f49584bSSeongJae Park * 2013f49584bSSeongJae Park * t the given target 2023f49584bSSeongJae Park * 2033f49584bSSeongJae Park * Because only a number of small portions of the entire address space 2043f49584bSSeongJae Park * is actually mapped to the memory and accessed, monitoring the unmapped 2053f49584bSSeongJae Park * regions is wasteful. That said, because we can deal with small noises, 2063f49584bSSeongJae Park * tracking every mapping is not strictly required but could even incur a high 2073f49584bSSeongJae Park * overhead if the mapping frequently changes or the number of mappings is 2083f49584bSSeongJae Park * high. The adaptive regions adjustment mechanism will further help to deal 2093f49584bSSeongJae Park * with the noise by simply identifying the unmapped areas as a region that 2103f49584bSSeongJae Park * has no access. Moreover, applying the real mappings that would have many 2113f49584bSSeongJae Park * unmapped areas inside will make the adaptive mechanism quite complex. That 2123f49584bSSeongJae Park * said, too huge unmapped areas inside the monitoring target should be removed 2133f49584bSSeongJae Park * to not take the time for the adaptive mechanism. 2143f49584bSSeongJae Park * 2153f49584bSSeongJae Park * For the reason, we convert the complex mappings to three distinct regions 2163f49584bSSeongJae Park * that cover every mapped area of the address space. Also the two gaps 2173f49584bSSeongJae Park * between the three regions are the two biggest unmapped areas in the given 2183f49584bSSeongJae Park * address space. In detail, this function first identifies the start and the 2193f49584bSSeongJae Park * end of the mappings and the two biggest unmapped areas of the address space. 2203f49584bSSeongJae Park * Then, it constructs the three regions as below: 2213f49584bSSeongJae Park * 2223f49584bSSeongJae Park * [mappings[0]->start, big_two_unmapped_areas[0]->start) 2233f49584bSSeongJae Park * [big_two_unmapped_areas[0]->end, big_two_unmapped_areas[1]->start) 2243f49584bSSeongJae Park * [big_two_unmapped_areas[1]->end, mappings[nr_mappings - 1]->end) 2253f49584bSSeongJae Park * 2263f49584bSSeongJae Park * As usual memory map of processes is as below, the gap between the heap and 2273f49584bSSeongJae Park * the uppermost mmap()-ed region, and the gap between the lowermost mmap()-ed 2283f49584bSSeongJae Park * region and the stack will be two biggest unmapped regions. Because these 2293f49584bSSeongJae Park * gaps are exceptionally huge areas in usual address space, excluding these 2303f49584bSSeongJae Park * two biggest unmapped regions will be sufficient to make a trade-off. 2313f49584bSSeongJae Park * 2323f49584bSSeongJae Park * <heap> 2333f49584bSSeongJae Park * <BIG UNMAPPED REGION 1> 2343f49584bSSeongJae Park * <uppermost mmap()-ed region> 2353f49584bSSeongJae Park * (other mmap()-ed regions and small unmapped regions) 2363f49584bSSeongJae Park * <lowermost mmap()-ed region> 2373f49584bSSeongJae Park * <BIG UNMAPPED REGION 2> 2383f49584bSSeongJae Park * <stack> 2393f49584bSSeongJae Park */ 2403f49584bSSeongJae Park static void __damon_va_init_regions(struct damon_ctx *ctx, 2413f49584bSSeongJae Park struct damon_target *t) 2423f49584bSSeongJae Park { 2433f49584bSSeongJae Park struct damon_region *r; 2443f49584bSSeongJae Park struct damon_addr_range regions[3]; 2453f49584bSSeongJae Park unsigned long sz = 0, nr_pieces; 2463f49584bSSeongJae Park int i; 2473f49584bSSeongJae Park 2483f49584bSSeongJae Park if (damon_va_three_regions(t, regions)) { 2493f49584bSSeongJae Park pr_err("Failed to get three regions of target %lu\n", t->id); 2503f49584bSSeongJae Park return; 2513f49584bSSeongJae Park } 2523f49584bSSeongJae Park 2533f49584bSSeongJae Park for (i = 0; i < 3; i++) 2543f49584bSSeongJae Park sz += regions[i].end - regions[i].start; 2553f49584bSSeongJae Park if (ctx->min_nr_regions) 2563f49584bSSeongJae Park sz /= ctx->min_nr_regions; 2573f49584bSSeongJae Park if (sz < DAMON_MIN_REGION) 2583f49584bSSeongJae Park sz = DAMON_MIN_REGION; 2593f49584bSSeongJae Park 2603f49584bSSeongJae Park /* Set the initial three regions of the target */ 2613f49584bSSeongJae Park for (i = 0; i < 3; i++) { 2623f49584bSSeongJae Park r = damon_new_region(regions[i].start, regions[i].end); 2633f49584bSSeongJae Park if (!r) { 2643f49584bSSeongJae Park pr_err("%d'th init region creation failed\n", i); 2653f49584bSSeongJae Park return; 2663f49584bSSeongJae Park } 2673f49584bSSeongJae Park damon_add_region(r, t); 2683f49584bSSeongJae Park 2693f49584bSSeongJae Park nr_pieces = (regions[i].end - regions[i].start) / sz; 2703f49584bSSeongJae Park damon_va_evenly_split_region(t, r, nr_pieces); 2713f49584bSSeongJae Park } 2723f49584bSSeongJae Park } 2733f49584bSSeongJae Park 2743f49584bSSeongJae Park /* Initialize '->regions_list' of every target (task) */ 2753f49584bSSeongJae Park void damon_va_init(struct damon_ctx *ctx) 2763f49584bSSeongJae Park { 2773f49584bSSeongJae Park struct damon_target *t; 2783f49584bSSeongJae Park 2793f49584bSSeongJae Park damon_for_each_target(t, ctx) { 2803f49584bSSeongJae Park /* the user may set the target regions as they want */ 2813f49584bSSeongJae Park if (!damon_nr_regions(t)) 2823f49584bSSeongJae Park __damon_va_init_regions(ctx, t); 2833f49584bSSeongJae Park } 2843f49584bSSeongJae Park } 2853f49584bSSeongJae Park 2863f49584bSSeongJae Park /* 2873f49584bSSeongJae Park * Functions for the dynamic monitoring target regions update 2883f49584bSSeongJae Park */ 2893f49584bSSeongJae Park 2903f49584bSSeongJae Park /* 2913f49584bSSeongJae Park * Check whether a region is intersecting an address range 2923f49584bSSeongJae Park * 2933f49584bSSeongJae Park * Returns true if it is. 2943f49584bSSeongJae Park */ 2953f49584bSSeongJae Park static bool damon_intersect(struct damon_region *r, struct damon_addr_range *re) 2963f49584bSSeongJae Park { 2973f49584bSSeongJae Park return !(r->ar.end <= re->start || re->end <= r->ar.start); 2983f49584bSSeongJae Park } 2993f49584bSSeongJae Park 3003f49584bSSeongJae Park /* 3013f49584bSSeongJae Park * Update damon regions for the three big regions of the given target 3023f49584bSSeongJae Park * 3033f49584bSSeongJae Park * t the given target 3043f49584bSSeongJae Park * bregions the three big regions of the target 3053f49584bSSeongJae Park */ 3063f49584bSSeongJae Park static void damon_va_apply_three_regions(struct damon_target *t, 3073f49584bSSeongJae Park struct damon_addr_range bregions[3]) 3083f49584bSSeongJae Park { 3093f49584bSSeongJae Park struct damon_region *r, *next; 310a460a360SXin Hao unsigned int i; 3113f49584bSSeongJae Park 3123f49584bSSeongJae Park /* Remove regions which are not in the three big regions now */ 3133f49584bSSeongJae Park damon_for_each_region_safe(r, next, t) { 3143f49584bSSeongJae Park for (i = 0; i < 3; i++) { 3153f49584bSSeongJae Park if (damon_intersect(r, &bregions[i])) 3163f49584bSSeongJae Park break; 3173f49584bSSeongJae Park } 3183f49584bSSeongJae Park if (i == 3) 3193f49584bSSeongJae Park damon_destroy_region(r, t); 3203f49584bSSeongJae Park } 3213f49584bSSeongJae Park 3223f49584bSSeongJae Park /* Adjust intersecting regions to fit with the three big regions */ 3233f49584bSSeongJae Park for (i = 0; i < 3; i++) { 3243f49584bSSeongJae Park struct damon_region *first = NULL, *last; 3253f49584bSSeongJae Park struct damon_region *newr; 3263f49584bSSeongJae Park struct damon_addr_range *br; 3273f49584bSSeongJae Park 3283f49584bSSeongJae Park br = &bregions[i]; 3293f49584bSSeongJae Park /* Get the first and last regions which intersects with br */ 3303f49584bSSeongJae Park damon_for_each_region(r, t) { 3313f49584bSSeongJae Park if (damon_intersect(r, br)) { 3323f49584bSSeongJae Park if (!first) 3333f49584bSSeongJae Park first = r; 3343f49584bSSeongJae Park last = r; 3353f49584bSSeongJae Park } 3363f49584bSSeongJae Park if (r->ar.start >= br->end) 3373f49584bSSeongJae Park break; 3383f49584bSSeongJae Park } 3393f49584bSSeongJae Park if (!first) { 3403f49584bSSeongJae Park /* no damon_region intersects with this big region */ 3413f49584bSSeongJae Park newr = damon_new_region( 3423f49584bSSeongJae Park ALIGN_DOWN(br->start, 3433f49584bSSeongJae Park DAMON_MIN_REGION), 3443f49584bSSeongJae Park ALIGN(br->end, DAMON_MIN_REGION)); 3453f49584bSSeongJae Park if (!newr) 3463f49584bSSeongJae Park continue; 3473f49584bSSeongJae Park damon_insert_region(newr, damon_prev_region(r), r, t); 3483f49584bSSeongJae Park } else { 3493f49584bSSeongJae Park first->ar.start = ALIGN_DOWN(br->start, 3503f49584bSSeongJae Park DAMON_MIN_REGION); 3513f49584bSSeongJae Park last->ar.end = ALIGN(br->end, DAMON_MIN_REGION); 3523f49584bSSeongJae Park } 3533f49584bSSeongJae Park } 3543f49584bSSeongJae Park } 3553f49584bSSeongJae Park 3563f49584bSSeongJae Park /* 3573f49584bSSeongJae Park * Update regions for current memory mappings 3583f49584bSSeongJae Park */ 3593f49584bSSeongJae Park void damon_va_update(struct damon_ctx *ctx) 3603f49584bSSeongJae Park { 3613f49584bSSeongJae Park struct damon_addr_range three_regions[3]; 3623f49584bSSeongJae Park struct damon_target *t; 3633f49584bSSeongJae Park 3643f49584bSSeongJae Park damon_for_each_target(t, ctx) { 3653f49584bSSeongJae Park if (damon_va_three_regions(t, three_regions)) 3663f49584bSSeongJae Park continue; 3673f49584bSSeongJae Park damon_va_apply_three_regions(t, three_regions); 3683f49584bSSeongJae Park } 3693f49584bSSeongJae Park } 3703f49584bSSeongJae Park 3713f49584bSSeongJae Park static int damon_mkold_pmd_entry(pmd_t *pmd, unsigned long addr, 3723f49584bSSeongJae Park unsigned long next, struct mm_walk *walk) 3733f49584bSSeongJae Park { 3743f49584bSSeongJae Park pte_t *pte; 3753f49584bSSeongJae Park spinlock_t *ptl; 3763f49584bSSeongJae Park 3773f49584bSSeongJae Park if (pmd_huge(*pmd)) { 3783f49584bSSeongJae Park ptl = pmd_lock(walk->mm, pmd); 3793f49584bSSeongJae Park if (pmd_huge(*pmd)) { 3803f49584bSSeongJae Park damon_pmdp_mkold(pmd, walk->mm, addr); 3813f49584bSSeongJae Park spin_unlock(ptl); 3823f49584bSSeongJae Park return 0; 3833f49584bSSeongJae Park } 3843f49584bSSeongJae Park spin_unlock(ptl); 3853f49584bSSeongJae Park } 3863f49584bSSeongJae Park 3873f49584bSSeongJae Park if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd))) 3883f49584bSSeongJae Park return 0; 3893f49584bSSeongJae Park pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl); 3903f49584bSSeongJae Park if (!pte_present(*pte)) 3913f49584bSSeongJae Park goto out; 3923f49584bSSeongJae Park damon_ptep_mkold(pte, walk->mm, addr); 3933f49584bSSeongJae Park out: 3943f49584bSSeongJae Park pte_unmap_unlock(pte, ptl); 3953f49584bSSeongJae Park return 0; 3963f49584bSSeongJae Park } 3973f49584bSSeongJae Park 398199b50f4SRikard Falkeborn static const struct mm_walk_ops damon_mkold_ops = { 3993f49584bSSeongJae Park .pmd_entry = damon_mkold_pmd_entry, 4003f49584bSSeongJae Park }; 4013f49584bSSeongJae Park 4023f49584bSSeongJae Park static void damon_va_mkold(struct mm_struct *mm, unsigned long addr) 4033f49584bSSeongJae Park { 4043f49584bSSeongJae Park mmap_read_lock(mm); 4053f49584bSSeongJae Park walk_page_range(mm, addr, addr + 1, &damon_mkold_ops, NULL); 4063f49584bSSeongJae Park mmap_read_unlock(mm); 4073f49584bSSeongJae Park } 4083f49584bSSeongJae Park 4093f49584bSSeongJae Park /* 4103f49584bSSeongJae Park * Functions for the access checking of the regions 4113f49584bSSeongJae Park */ 4123f49584bSSeongJae Park 413*b627b774SXin Hao static void __damon_va_prepare_access_check(struct damon_ctx *ctx, 4143f49584bSSeongJae Park struct mm_struct *mm, struct damon_region *r) 4153f49584bSSeongJae Park { 4163f49584bSSeongJae Park r->sampling_addr = damon_rand(r->ar.start, r->ar.end); 4173f49584bSSeongJae Park 4183f49584bSSeongJae Park damon_va_mkold(mm, r->sampling_addr); 4193f49584bSSeongJae Park } 4203f49584bSSeongJae Park 4213f49584bSSeongJae Park void damon_va_prepare_access_checks(struct damon_ctx *ctx) 4223f49584bSSeongJae Park { 4233f49584bSSeongJae Park struct damon_target *t; 4243f49584bSSeongJae Park struct mm_struct *mm; 4253f49584bSSeongJae Park struct damon_region *r; 4263f49584bSSeongJae Park 4273f49584bSSeongJae Park damon_for_each_target(t, ctx) { 4283f49584bSSeongJae Park mm = damon_get_mm(t); 4293f49584bSSeongJae Park if (!mm) 4303f49584bSSeongJae Park continue; 4313f49584bSSeongJae Park damon_for_each_region(r, t) 432*b627b774SXin Hao __damon_va_prepare_access_check(ctx, mm, r); 4333f49584bSSeongJae Park mmput(mm); 4343f49584bSSeongJae Park } 4353f49584bSSeongJae Park } 4363f49584bSSeongJae Park 4373f49584bSSeongJae Park struct damon_young_walk_private { 4383f49584bSSeongJae Park unsigned long *page_sz; 4393f49584bSSeongJae Park bool young; 4403f49584bSSeongJae Park }; 4413f49584bSSeongJae Park 4423f49584bSSeongJae Park static int damon_young_pmd_entry(pmd_t *pmd, unsigned long addr, 4433f49584bSSeongJae Park unsigned long next, struct mm_walk *walk) 4443f49584bSSeongJae Park { 4453f49584bSSeongJae Park pte_t *pte; 4463f49584bSSeongJae Park spinlock_t *ptl; 4473f49584bSSeongJae Park struct page *page; 4483f49584bSSeongJae Park struct damon_young_walk_private *priv = walk->private; 4493f49584bSSeongJae Park 4503f49584bSSeongJae Park #ifdef CONFIG_TRANSPARENT_HUGEPAGE 4513f49584bSSeongJae Park if (pmd_huge(*pmd)) { 4523f49584bSSeongJae Park ptl = pmd_lock(walk->mm, pmd); 4533f49584bSSeongJae Park if (!pmd_huge(*pmd)) { 4543f49584bSSeongJae Park spin_unlock(ptl); 4553f49584bSSeongJae Park goto regular_page; 4563f49584bSSeongJae Park } 4573f49584bSSeongJae Park page = damon_get_page(pmd_pfn(*pmd)); 4583f49584bSSeongJae Park if (!page) 4593f49584bSSeongJae Park goto huge_out; 4603f49584bSSeongJae Park if (pmd_young(*pmd) || !page_is_idle(page) || 4613f49584bSSeongJae Park mmu_notifier_test_young(walk->mm, 4623f49584bSSeongJae Park addr)) { 4633f49584bSSeongJae Park *priv->page_sz = ((1UL) << HPAGE_PMD_SHIFT); 4643f49584bSSeongJae Park priv->young = true; 4653f49584bSSeongJae Park } 4663f49584bSSeongJae Park put_page(page); 4673f49584bSSeongJae Park huge_out: 4683f49584bSSeongJae Park spin_unlock(ptl); 4693f49584bSSeongJae Park return 0; 4703f49584bSSeongJae Park } 4713f49584bSSeongJae Park 4723f49584bSSeongJae Park regular_page: 4733f49584bSSeongJae Park #endif /* CONFIG_TRANSPARENT_HUGEPAGE */ 4743f49584bSSeongJae Park 4753f49584bSSeongJae Park if (pmd_none(*pmd) || unlikely(pmd_bad(*pmd))) 4763f49584bSSeongJae Park return -EINVAL; 4773f49584bSSeongJae Park pte = pte_offset_map_lock(walk->mm, pmd, addr, &ptl); 4783f49584bSSeongJae Park if (!pte_present(*pte)) 4793f49584bSSeongJae Park goto out; 4803f49584bSSeongJae Park page = damon_get_page(pte_pfn(*pte)); 4813f49584bSSeongJae Park if (!page) 4823f49584bSSeongJae Park goto out; 4833f49584bSSeongJae Park if (pte_young(*pte) || !page_is_idle(page) || 4843f49584bSSeongJae Park mmu_notifier_test_young(walk->mm, addr)) { 4853f49584bSSeongJae Park *priv->page_sz = PAGE_SIZE; 4863f49584bSSeongJae Park priv->young = true; 4873f49584bSSeongJae Park } 4883f49584bSSeongJae Park put_page(page); 4893f49584bSSeongJae Park out: 4903f49584bSSeongJae Park pte_unmap_unlock(pte, ptl); 4913f49584bSSeongJae Park return 0; 4923f49584bSSeongJae Park } 4933f49584bSSeongJae Park 494199b50f4SRikard Falkeborn static const struct mm_walk_ops damon_young_ops = { 4953f49584bSSeongJae Park .pmd_entry = damon_young_pmd_entry, 4963f49584bSSeongJae Park }; 4973f49584bSSeongJae Park 4983f49584bSSeongJae Park static bool damon_va_young(struct mm_struct *mm, unsigned long addr, 4993f49584bSSeongJae Park unsigned long *page_sz) 5003f49584bSSeongJae Park { 5013f49584bSSeongJae Park struct damon_young_walk_private arg = { 5023f49584bSSeongJae Park .page_sz = page_sz, 5033f49584bSSeongJae Park .young = false, 5043f49584bSSeongJae Park }; 5053f49584bSSeongJae Park 5063f49584bSSeongJae Park mmap_read_lock(mm); 5073f49584bSSeongJae Park walk_page_range(mm, addr, addr + 1, &damon_young_ops, &arg); 5083f49584bSSeongJae Park mmap_read_unlock(mm); 5093f49584bSSeongJae Park return arg.young; 5103f49584bSSeongJae Park } 5113f49584bSSeongJae Park 5123f49584bSSeongJae Park /* 5133f49584bSSeongJae Park * Check whether the region was accessed after the last preparation 5143f49584bSSeongJae Park * 5153f49584bSSeongJae Park * mm 'mm_struct' for the given virtual address space 5163f49584bSSeongJae Park * r the region to be checked 5173f49584bSSeongJae Park */ 518*b627b774SXin Hao static void __damon_va_check_access(struct damon_ctx *ctx, 5193f49584bSSeongJae Park struct mm_struct *mm, struct damon_region *r) 5203f49584bSSeongJae Park { 5213f49584bSSeongJae Park static struct mm_struct *last_mm; 5223f49584bSSeongJae Park static unsigned long last_addr; 5233f49584bSSeongJae Park static unsigned long last_page_sz = PAGE_SIZE; 5243f49584bSSeongJae Park static bool last_accessed; 5253f49584bSSeongJae Park 5263f49584bSSeongJae Park /* If the region is in the last checked page, reuse the result */ 5273f49584bSSeongJae Park if (mm == last_mm && (ALIGN_DOWN(last_addr, last_page_sz) == 5283f49584bSSeongJae Park ALIGN_DOWN(r->sampling_addr, last_page_sz))) { 5293f49584bSSeongJae Park if (last_accessed) 5303f49584bSSeongJae Park r->nr_accesses++; 5313f49584bSSeongJae Park return; 5323f49584bSSeongJae Park } 5333f49584bSSeongJae Park 5343f49584bSSeongJae Park last_accessed = damon_va_young(mm, r->sampling_addr, &last_page_sz); 5353f49584bSSeongJae Park if (last_accessed) 5363f49584bSSeongJae Park r->nr_accesses++; 5373f49584bSSeongJae Park 5383f49584bSSeongJae Park last_mm = mm; 5393f49584bSSeongJae Park last_addr = r->sampling_addr; 5403f49584bSSeongJae Park } 5413f49584bSSeongJae Park 5423f49584bSSeongJae Park unsigned int damon_va_check_accesses(struct damon_ctx *ctx) 5433f49584bSSeongJae Park { 5443f49584bSSeongJae Park struct damon_target *t; 5453f49584bSSeongJae Park struct mm_struct *mm; 5463f49584bSSeongJae Park struct damon_region *r; 5473f49584bSSeongJae Park unsigned int max_nr_accesses = 0; 5483f49584bSSeongJae Park 5493f49584bSSeongJae Park damon_for_each_target(t, ctx) { 5503f49584bSSeongJae Park mm = damon_get_mm(t); 5513f49584bSSeongJae Park if (!mm) 5523f49584bSSeongJae Park continue; 5533f49584bSSeongJae Park damon_for_each_region(r, t) { 554*b627b774SXin Hao __damon_va_check_access(ctx, mm, r); 5553f49584bSSeongJae Park max_nr_accesses = max(r->nr_accesses, max_nr_accesses); 5563f49584bSSeongJae Park } 5573f49584bSSeongJae Park mmput(mm); 5583f49584bSSeongJae Park } 5593f49584bSSeongJae Park 5603f49584bSSeongJae Park return max_nr_accesses; 5613f49584bSSeongJae Park } 5623f49584bSSeongJae Park 5633f49584bSSeongJae Park /* 5643f49584bSSeongJae Park * Functions for the target validity check and cleanup 5653f49584bSSeongJae Park */ 5663f49584bSSeongJae Park 5673f49584bSSeongJae Park bool damon_va_target_valid(void *target) 5683f49584bSSeongJae Park { 5693f49584bSSeongJae Park struct damon_target *t = target; 5703f49584bSSeongJae Park struct task_struct *task; 5713f49584bSSeongJae Park 5723f49584bSSeongJae Park task = damon_get_task_struct(t); 5733f49584bSSeongJae Park if (task) { 5743f49584bSSeongJae Park put_task_struct(task); 5753f49584bSSeongJae Park return true; 5763f49584bSSeongJae Park } 5773f49584bSSeongJae Park 5783f49584bSSeongJae Park return false; 5793f49584bSSeongJae Park } 5803f49584bSSeongJae Park 5816dea8addSSeongJae Park #ifndef CONFIG_ADVISE_SYSCALLS 5826dea8addSSeongJae Park static int damos_madvise(struct damon_target *target, struct damon_region *r, 5836dea8addSSeongJae Park int behavior) 5846dea8addSSeongJae Park { 5856dea8addSSeongJae Park return -EINVAL; 5866dea8addSSeongJae Park } 5876dea8addSSeongJae Park #else 5886dea8addSSeongJae Park static int damos_madvise(struct damon_target *target, struct damon_region *r, 5896dea8addSSeongJae Park int behavior) 5906dea8addSSeongJae Park { 5916dea8addSSeongJae Park struct mm_struct *mm; 5926dea8addSSeongJae Park int ret = -ENOMEM; 5936dea8addSSeongJae Park 5946dea8addSSeongJae Park mm = damon_get_mm(target); 5956dea8addSSeongJae Park if (!mm) 5966dea8addSSeongJae Park goto out; 5976dea8addSSeongJae Park 5986dea8addSSeongJae Park ret = do_madvise(mm, PAGE_ALIGN(r->ar.start), 5996dea8addSSeongJae Park PAGE_ALIGN(r->ar.end - r->ar.start), behavior); 6006dea8addSSeongJae Park mmput(mm); 6016dea8addSSeongJae Park out: 6026dea8addSSeongJae Park return ret; 6036dea8addSSeongJae Park } 6046dea8addSSeongJae Park #endif /* CONFIG_ADVISE_SYSCALLS */ 6056dea8addSSeongJae Park 6066dea8addSSeongJae Park int damon_va_apply_scheme(struct damon_ctx *ctx, struct damon_target *t, 6076dea8addSSeongJae Park struct damon_region *r, struct damos *scheme) 6086dea8addSSeongJae Park { 6096dea8addSSeongJae Park int madv_action; 6106dea8addSSeongJae Park 6116dea8addSSeongJae Park switch (scheme->action) { 6126dea8addSSeongJae Park case DAMOS_WILLNEED: 6136dea8addSSeongJae Park madv_action = MADV_WILLNEED; 6146dea8addSSeongJae Park break; 6156dea8addSSeongJae Park case DAMOS_COLD: 6166dea8addSSeongJae Park madv_action = MADV_COLD; 6176dea8addSSeongJae Park break; 6186dea8addSSeongJae Park case DAMOS_PAGEOUT: 6196dea8addSSeongJae Park madv_action = MADV_PAGEOUT; 6206dea8addSSeongJae Park break; 6216dea8addSSeongJae Park case DAMOS_HUGEPAGE: 6226dea8addSSeongJae Park madv_action = MADV_HUGEPAGE; 6236dea8addSSeongJae Park break; 6246dea8addSSeongJae Park case DAMOS_NOHUGEPAGE: 6256dea8addSSeongJae Park madv_action = MADV_NOHUGEPAGE; 6266dea8addSSeongJae Park break; 6272f0b548cSSeongJae Park case DAMOS_STAT: 6282f0b548cSSeongJae Park return 0; 6296dea8addSSeongJae Park default: 6306dea8addSSeongJae Park return -EINVAL; 6316dea8addSSeongJae Park } 6326dea8addSSeongJae Park 6336dea8addSSeongJae Park return damos_madvise(t, r, madv_action); 6346dea8addSSeongJae Park } 6356dea8addSSeongJae Park 636198f0f4cSSeongJae Park int damon_va_scheme_score(struct damon_ctx *context, struct damon_target *t, 637198f0f4cSSeongJae Park struct damon_region *r, struct damos *scheme) 638198f0f4cSSeongJae Park { 639198f0f4cSSeongJae Park 640198f0f4cSSeongJae Park switch (scheme->action) { 641198f0f4cSSeongJae Park case DAMOS_PAGEOUT: 642198f0f4cSSeongJae Park return damon_pageout_score(context, r, scheme); 643198f0f4cSSeongJae Park default: 644198f0f4cSSeongJae Park break; 645198f0f4cSSeongJae Park } 646198f0f4cSSeongJae Park 647198f0f4cSSeongJae Park return DAMOS_MAX_SCORE; 648198f0f4cSSeongJae Park } 649198f0f4cSSeongJae Park 6503f49584bSSeongJae Park void damon_va_set_primitives(struct damon_ctx *ctx) 6513f49584bSSeongJae Park { 6523f49584bSSeongJae Park ctx->primitive.init = damon_va_init; 6533f49584bSSeongJae Park ctx->primitive.update = damon_va_update; 6543f49584bSSeongJae Park ctx->primitive.prepare_access_checks = damon_va_prepare_access_checks; 6553f49584bSSeongJae Park ctx->primitive.check_accesses = damon_va_check_accesses; 6563f49584bSSeongJae Park ctx->primitive.reset_aggregated = NULL; 6573f49584bSSeongJae Park ctx->primitive.target_valid = damon_va_target_valid; 6583f49584bSSeongJae Park ctx->primitive.cleanup = NULL; 6596dea8addSSeongJae Park ctx->primitive.apply_scheme = damon_va_apply_scheme; 660198f0f4cSSeongJae Park ctx->primitive.get_scheme_score = damon_va_scheme_score; 6613f49584bSSeongJae Park } 66217ccae8bSSeongJae Park 66317ccae8bSSeongJae Park #include "vaddr-test.h" 664