On Wed, Nov 10, 2021 at 04:37:14PM +0100, David Hildenbrand wrote: > > - Fully locked. Under the PTLs (gup slow is an example) > > - Semi-locked. Under the read mmap lock and no PTLs (hmm is an example) > > - hw-locked. Barriered with TLB flush (gup fast is an example) > > Three additions as far as I can tell: > > 1. Fully locked currently needs the read mmap lock OR the rmap lock in > read. PTLs on their own are not sufficient AFAIKT. I think the reality is we don't have any fully locked walkers.. Even gup slow is semi-lockless until it reaches lower levels, then it takes the PTLs. (I forgot about that detail!) The mmap lock is being used to protect the higher levels of the page table. It is part of its complicated dual purpose. > 2. #1 and #2 can currently only walk within VMA ranges. AFICT this is an artifact of re-using the mmap lock to protect the page table and not being able to obtain the mmap lock in all the places the page table structure is manipulated. > 3. We can theoretically walk page tables outside VMA ranges with the > write mmap lock, because page tables get removed with the mmap lock in > read mode and heavy-weight operations (VMA layout, khugepaged) are > performed under the write mmap lock. Yes, again, an artifact of the current locking. > The rmap locks protect from modifications where we want to exclude rmap > walkers similarly to how we grab the mmap lock in write, where the PTLs > are not sufficient. It is a similar dual purpose locking as the mmap sem :( > > #1 should be completely safe as the PTLs will protect eveything > > #2 is safe so long as the write side is held during any layout changes > > #3 interacts with the TLB flush, and is also safe with zap > > > > rmap itself is a #1 page table walker, ie it gets the PTLs under > > page_vma_mapped_walk(). > > When you talk about PTLs, do you mean only PTE-PTLs or also PMD-PTLs? Ah, here I was thinking about a lock that can protect all the levels. Today we are abusing the mmap lock to act as the pud_lock, for instance. > Because the PMD-PTLs re usually not taken in case we know there is a > page table (nothing would currently change it without heavy > locking). This only works with the lockless walkers, and relies on the read mmap sem/etc to also mean 'a PTE table cannot become a leaf PMD' > For example, walk_page_range() requires the mmap lock in read and grabs > the PTE-PTLs. Yes, that is a semi-locked reader. > It would still be a fairly coarse-grained locking, I am not sure if that > is a step into the right direction. If you want to modify *some* page > table in your process you have exclude each and every page table walker. > Or did I mis-interpret what you were saying? That is one possible design, it favours fast walking and penalizes mutation. We could also stick a lock in the PMD (instead of a refcount) and still logically be using a lock instead of a refcount scheme. Remember modify here is "want to change a table pointer into a leaf pointer" so it isn't an every day activity.. There is some advantage with this thinking because it harmonizes well with the other stuff that wants to convert tables into leafs, but has to deal with complicated locking. On the other hand, refcounts are a degenerate kind of rwsem and only help with freeing pages. It also puts more atomics in normal fast paths since we are refcounting each PTE, not read locking the PMD. Perhaps the ideal thing would be to stick a rwsem in the PMD. read means a table cannot be come a leaf. I don't know if there is space for another atomic in the PMD level, and we'd have to use a hitching post/hashed waitq scheme too since there surely isn't room for a waitq too.. I wouldn't be so quick to say one is better than the other, but at least let's have thought about a locking solution before merging refcounts :) Jason
