Received-SPF: pass (google.com: domain of linux-kernel+bounces-146135-linux.lists.archive=gmail.com@vger.kernel.org designates 147.75.80.249 as permitted sender) client-ip=147.75.80.249;
Precedence: bulk
MIME-Version: 1.0
References: <20240409082631.187483-1-21cnbao@gmail.com> <20240409082631.187483-5-21cnbao@gmail.com>
 <87frvn2f89.fsf@yhuang6-desk2.ccr.corp.intel.com> <CAGsJ_4x_bOchG=bJjR8WE=vQxu3ke8fkxcDOFhqX5FS_a-0heA@mail.gmail.com>
 <8734rm2gdj.fsf@yhuang6-desk2.ccr.corp.intel.com> <CAGsJ_4xHVN_QXu5Q8c_FcjsnffZYWsjOx4KR4G_2GNyaxfVWAw@mail.gmail.com>
 <87y19e115l.fsf@yhuang6-desk2.ccr.corp.intel.com>
In-Reply-To: <87y19e115l.fsf@yhuang6-desk2.ccr.corp.intel.com>
From: Barry Song <21cnbao@gmail.com>
Date: Tue, 16 Apr 2024 14:52:24 +1200
Message-ID: <CAGsJ_4xUna=wNNoLw0yCkzjD1d0pfJDKfqmWuA5zrSzWF+-cow@mail.gmail.com>
Subject: Re: [PATCH v2 4/5] mm: swap: entirely map large folios found in swapcache
To: "Huang, Ying" <ying.huang@intel.com>
Cc: Khalid Aziz <khalid.aziz@oracle.com>, akpm@linux-foundation.org, linux-mm@kvack.org, 
	baolin.wang@linux.alibaba.com, chrisl@kernel.org, david@redhat.com, 
	hanchuanhua@oppo.com, hannes@cmpxchg.org, hughd@google.com, 
	kasong@tencent.com, ryan.roberts@arm.com, surenb@google.com, 
	v-songbaohua@oppo.com, willy@infradead.org, xiang@kernel.org, 
	yosryahmed@google.com, yuzhao@google.com, ziy@nvidia.com, 
	linux-kernel@vger.kernel.org
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

On Tue, Apr 16, 2024 at 2:41=E2=80=AFPM Huang, Ying <ying.huang@intel.com> =
wrote:
>
> Barry Song <21cnbao@gmail.com> writes:
>
> > On Tue, Apr 16, 2024 at 2:27=E2=80=AFPM Huang, Ying <ying.huang@intel.c=
om> wrote:
> >>
> >>
> >> Added Khalid for arch_do_swap_page().
> >>
> >> Barry Song <21cnbao@gmail.com> writes:
> >>
> >> > On Mon, Apr 15, 2024 at 8:39=E2=80=AFPM Huang, Ying <ying.huang@inte=
l.com> wrote:
> >> >>
> >> >> Barry Song <21cnbao@gmail.com> writes:
> >>
> >> [snip]
> >>
> >> >>
> >> >> > +     bool any_swap_shared =3D false;
> >> >> >
> >> >> >       if (!pte_unmap_same(vmf))
> >> >> >               goto out;
> >> >> > @@ -4137,6 +4141,35 @@ vm_fault_t do_swap_page(struct vm_fault *v=
mf)
> >> >> >        */
> >> >> >       vmf->pte =3D pte_offset_map_lock(vma->vm_mm, vmf->pmd, vmf-=
>address,
> >> >> >                       &vmf->ptl);
> >> >>
> >> >> We should move pte check here.  That is,
> >> >>
> >> >>         if (unlikely(!vmf->pte || !pte_same(ptep_get(vmf->pte), vmf=
->orig_pte)))
> >> >>                 goto out_nomap;
> >> >>
> >> >> This will simplify the situation for large folio.
> >> >
> >> > the plan is moving the whole code block
> >> >
> >> > if (start_pte && folio_test_large(folio) && folio_test_swapcache(fol=
io))
> >> >
> >> > after
> >> >         if (unlikely(!folio_test_uptodate(folio))) {
> >> >                 ret =3D VM_FAULT_SIGBUS;
> >> >                 goto out_nomap;
> >> >         }
> >> >
> >> > though we couldn't be !folio_test_uptodate(folio)) for hitting
> >> > swapcache but it seems
> >> > logically better for future use.
> >>
> >> LGTM, Thanks!
> >>
> >> >>
> >> >> > +
> >> >> > +     /* We hit large folios in swapcache */
> >> >>
> >> >> The comments seems unnecessary because the code tells that already.
> >> >>
> >> >> > +     if (start_pte && folio_test_large(folio) && folio_test_swap=
cache(folio)) {
> >> >> > +             int nr =3D folio_nr_pages(folio);
> >> >> > +             int idx =3D folio_page_idx(folio, page);
> >> >> > +             unsigned long folio_start =3D vmf->address - idx * =
PAGE_SIZE;
> >> >> > +             unsigned long folio_end =3D folio_start + nr * PAGE=
_SIZE;
> >> >> > +             pte_t *folio_ptep;
> >> >> > +             pte_t folio_pte;
> >> >> > +
> >> >> > +             if (unlikely(folio_start < max(vmf->address & PMD_M=
ASK, vma->vm_start)))
> >> >> > +                     goto check_pte;
> >> >> > +             if (unlikely(folio_end > pmd_addr_end(vmf->address,=
 vma->vm_end)))
> >> >> > +                     goto check_pte;
> >> >> > +
> >> >> > +             folio_ptep =3D vmf->pte - idx;
> >> >> > +             folio_pte =3D ptep_get(folio_ptep);
> >> >>
> >> >> It's better to construct pte based on fault PTE via generalizing
> >> >> pte_next_swp_offset() (may be pte_move_swp_offset()).  Then we can =
find
> >> >> inconsistent PTEs quicker.
> >> >
> >> > it seems your point is getting the pte of page0 by pte_next_swp_offs=
et()
> >> > unfortunately pte_next_swp_offset can't go back. on the other hand,
> >> > we have to check the real pte value of the 0nd entry right now becau=
se
> >> > swap_pte_batch() only really reads pte from the 1st entry. it assume=
s
> >> > pte argument is the real value for the 0nd pte entry.
> >> >
> >> > static inline int swap_pte_batch(pte_t *start_ptep, int max_nr, pte_=
t pte)
> >> > {
> >> >         pte_t expected_pte =3D pte_next_swp_offset(pte);
> >> >         const pte_t *end_ptep =3D start_ptep + max_nr;
> >> >         pte_t *ptep =3D start_ptep + 1;
> >> >
> >> >         VM_WARN_ON(max_nr < 1);
> >> >         VM_WARN_ON(!is_swap_pte(pte));
> >> >         VM_WARN_ON(non_swap_entry(pte_to_swp_entry(pte)));
> >> >
> >> >         while (ptep < end_ptep) {
> >> >                 pte =3D ptep_get(ptep);
> >> >
> >> >                 if (!pte_same(pte, expected_pte))
> >> >                         break;
> >> >
> >> >                 expected_pte =3D pte_next_swp_offset(expected_pte);
> >> >                 ptep++;
> >> >         }
> >> >
> >> >         return ptep - start_ptep;
> >> > }
> >>
> >> Yes.  You are right.
> >>
> >> But we may check whether the pte of page0 is same as "vmf->orig_pte -
> >> folio_page_idx()" (fake code).
> >
> > right, that is why we are reading and checking PTE0 before calling
> > swap_pte_batch()
> > right now.
> >
> >   folio_ptep =3D vmf->pte - idx;
> >   folio_pte =3D ptep_get(folio_ptep);
> >   if (!is_swap_pte(folio_pte) || non_swap_entry(pte_to_swp_entry(folio_=
pte)) ||
> >       swap_pte_batch(folio_ptep, nr, folio_pte, &any_swap_shared) !=3D =
nr)
> >    goto check_pte;
> >
> > So, if I understand correctly, you're proposing that we should directly=
 check
> > PTE0 in swap_pte_batch(). Personally, I don't have any objections to th=
is idea.
> > However, I'd also like to hear the feedback from Ryan and David :-)
>
> I mean that we can replace
>
>         !is_swap_pte(folio_pte) || non_swap_entry(pte_to_swp_entry(folio_=
pte))
>
> in above code with pte_same() with constructed expected first pte.

Got it. It could be quite tricky, especially with considerations like
pte_swp_soft_dirty, pte_swp_exclusive, and pte_swp_uffd_wp. We might
require a helper function similar to pte_next_swp_offset() but capable of
moving both forward and backward. For instance:

pte_move_swp_offset(pte_t pte, long delta)

pte_next_swp_offset can insteadly call it by:
pte_move_swp_offset(pte, 1);

Is it what you are proposing?

>
> >>
> >> You need to check the pte of page 0 anyway.
> >>
> >> >>
> >> >> > +             if (!is_swap_pte(folio_pte) || non_swap_entry(pte_t=
o_swp_entry(folio_pte)) ||
> >> >> > +                 swap_pte_batch(folio_ptep, nr, folio_pte, &any_=
swap_shared) !=3D nr)
> >> >> > +                     goto check_pte;
> >> >> > +
> >> >> > +             start_address =3D folio_start;
> >> >> > +             start_pte =3D folio_ptep;
> >> >> > +             nr_pages =3D nr;
> >> >> > +             entry =3D folio->swap;
> >> >> > +             page =3D &folio->page;
> >> >> > +     }
> >> >> > +
> >> >> > +check_pte:
> >> >> >       if (unlikely(!vmf->pte || !pte_same(ptep_get(vmf->pte), vmf=
->orig_pte)))
> >> >> >               goto out_nomap;
> >> >> >
> >> >> > @@ -4190,6 +4223,10 @@ vm_fault_t do_swap_page(struct vm_fault *v=
mf)
> >> >> >                        */
> >> >> >                       exclusive =3D false;
> >> >> >               }
> >> >> > +
> >> >> > +             /* Reuse the whole large folio iff all entries are =
exclusive */
> >> >> > +             if (nr_pages > 1 && any_swap_shared)
> >> >> > +                     exclusive =3D false;
> >> >> >       }
> >> >> >
>
> [snip]
>
> --
> Best Regards,
> Huang, Ying