Re: Definition of leaf PTE
Andrew Waterman
It's clear from context that the spec intends that SFENCE.VMA with rs1 != x0 be sufficient to purge an invalid PTE from an address-translation cache. (And the alternative of requiring SFENCE.VMA with rs1=x0 would be preposterous.) Anyway, I think there is a slight bug in your reasoning in inferring that step 5 of the algorithm circumscribes the set of leaf PTEs. Although it is true that reaching step 5 implies the PTE is a leaf, nothing says that not reaching step 5 implies a PTE is a non-leaf. So, a clarification might be in order, but by my reading, there isn't an outright contradiction. My preferred resolution would be to clarify that non-leaf PTEs have the V bit set. On Fri, Dec 9, 2022 at 4:10 PM Paul Donahue <pdonahue@...> wrote:
|
|