On Mon, Jan 29, 2024 at 06:56:58PM +0000, Carlos Llamas wrote: > On Mon, Jan 29, 2024 at 05:59:53PM +0000, Matthew Wilcox wrote: > > On Wed, Jan 24, 2024 at 11:20:23AM +0000, Alice Ryhl wrote: > > > This patch only adds support for pages of order zero, as that is all > > > Rust Binder needs. However, it is written to make it easy to add support > > > for higher-order pages in the future. To do that, you would add a const > > > generic parameter to `Page` that specifies the order. Most of the > > > methods do not need to be adjusted, as the logic for dealing with > > > mapping multiple pages at once can be isolated to just the > > > `with_pointer_into_page` method. Finally, the struct can be renamed to > > > `Pages<ORDER>`, and the type alias `Page = Pages<0>` can be introduced. > > > > This description concerns me because it reads like you're not keeping > > up with the current thinking in MM about what pages are and how we're > > improving the type hierarchy. As in, we're creating one instead of > > allowing the current mish-mash of absolutely everything to continue. > > > > Are you the right person to ask about the operations that Binder does > > with a page so we can figure out where it fits in the type hierarchy? > > I would guess you are suggesting a transition to folios here? I don't I don't think folios are the right type to use. Folios are for files and anonymous memory; things which are managed on the LRU, have refcounts and mapcounts, can be found with an rmap, need private data, belong to memory control groups, belong to either an inode or an anon_vma, and so on. It's _possible_ that Binder fits this use case well enough, but my guess is that it needs its own type, or maybe it's the initial example of a different type from folios (right now we have three types: folios, slabs and ptdescs, but more are on their way). > The only concern I have is that we've implemented a binder LRU-shrinker > mechanism. We add the unused pages to our freelist and give them back to > the system on demand. However, if a new transaction requests the unused > page before it gets reclaimed it is simply removed from this freelist. > This is convenient as we avoid taking the mmap sem during this process. > I don't know how this mechanism would look with folios though? This doesn't seem like too much of a problem. The key thing is that with memdescs, you get to define your own data type of whatever size makes sense for you. Until then you're limited to what we can fit into a struct page (and we need to be careful not to step on stuff that other people look at like the refcount).
