On 23.01.2023 16:47, Carlo Nonato wrote: > From: Luca Miccio <[email protected]> > > This commit adds a new memory page allocator that implements the cache > coloring mechanism. The allocation algorithm follows the given domain color > configuration and maximizes contiguity in the page selection of multiple > subsequent requests. > > Pages are stored in a color-indexed array of lists, each one sorted by > machine address, that is referred to as "colored heap". Those lists are > filled by a simple init function which computes the color of each page. > When a domain requests a page, the allocator takes one from those lists > whose colors equals the domain configuration. It chooses the page with the > lowest machine address such that contiguous pages are sequentially > allocated if this is made possible by a color assignment which includes > adjacent colors.
What use is this with ... > The allocator can handle only requests with order equal to 0 since the > single color granularity is represented in memory by one page. ... this restriction? Plus aiui there's no guarantee of contiguous pages coming back in any event (because things depend on what may have been allocated / freed earlier on), so why even give the impression of there being a way to obtain contiguous pages? Jan
