mirror of
https://github.com/torvalds/linux.git
synced 2024-11-23 20:51:44 +00:00
d0cf3dd47f
This rather specialised walk can use the VMA iterator. If this proves to
be too slow, we can write a custom routine to find the two largest gaps,
but it will be somewhat complicated, so let's see if we need it first.
Update the kunit test case to use the maple tree. This also fixes an
issue with the kunit testcase not adding the last VMA to the list.
Link: https://lkml.kernel.org/r/20220906194824.2110408-16-Liam.Howlett@oracle.com
Fixes:
|
||
---|---|---|
.. | ||
core-test.h | ||
core.c | ||
dbgfs-test.h | ||
dbgfs.c | ||
Kconfig | ||
lru_sort.c | ||
Makefile | ||
ops-common.c | ||
ops-common.h | ||
paddr.c | ||
reclaim.c | ||
sysfs.c | ||
vaddr-test.h | ||
vaddr.c |