On Wed, Jun 14, 2017 at 04:51:41PM +0300, Kirill A. Shutemov wrote: > We need an atomic way to make pmd page table entry not-present. > This is required to implement pmdp_invalidate() that doesn't loose dirty > or access bits. What does the cmpxchg() loop achieves compared to xchg() and then return the old value (potentially with the dirty bit set when it was not before we called xchg)? > index f5af95a0c6b8..576420df12b8 100644 > --- a/arch/x86/include/asm/pgtable.h > +++ b/arch/x86/include/asm/pgtable.h > @@ -1092,6 +1092,19 @@ static inline void pmdp_set_wrprotect(struct mm_struct *mm, > clear_bit(_PAGE_BIT_RW, (unsigned long *)pmdp); > } > > +#ifndef pmdp_mknotpresent > +#define pmdp_mknotpresent pmdp_mknotpresent > +static inline void pmdp_mknotpresent(pmd_t *pmdp) > +{ > + pmd_t old, new; > + > + { > + old = *pmdp; > + new = pmd_mknotpresent(old); > + } while (pmd_val(cmpxchg(pmdp, old, new)) != pmd_val(old)); > +} > +#endif Isn't it faster to do xchg(&xp->pmd, pmd_mknotpresent(pmd)) and have the pmdp_invalidate caller can set the dirty bit in the page if it was found set in the returned old pmd value (and skip the loop and cmpxchg)? Thanks, Andrea -- To unsubscribe, send a message with 'unsubscribe linux-mm' in the body to majordomo@xxxxxxxxx. For more info on Linux MM, see: http://www.linux-mm.org/ . Don't email: <a href=mailto:"dont@xxxxxxxxx"> email@xxxxxxxxx </a>