On Mon, Jul 15, 2024 at 8:40 AM Ryan Roberts <ryan.roberts@xxxxxxx> wrote:
>
> On 11/07/2024 08:29, Chris Li wrote:
> > Track the nonfull cluster as well as the empty cluster
> > on lists. Each order has one nonfull cluster list.
> >
> > The cluster will remember which order it was used during
> > new cluster allocation.
> >
> > When the cluster has free entry, add to the nonfull[order]
> > list. When the free cluster list is empty, also allocate
> > from the nonempty list of that order.
> >
> > This improves the mTHP swap allocation success rate.
> >
> > There are limitations if the distribution of numbers of
> > different orders of mTHP changes a lot. e.g. there are a lot
> > of nonfull cluster assign to order A while later time there
> > are a lot of order B allocation while very little allocation
> > in order A. Currently the cluster used by order A will not
> > reused by order B unless the cluster is 100% empty.
> >
> > Signed-off-by: Chris Li <chrisl@xxxxxxxxxx>
> > ---
> > include/linux/swap.h | 4 ++++
> > mm/swapfile.c | 34 +++++++++++++++++++++++++++++++---
> > 2 files changed, 35 insertions(+), 3 deletions(-)
> >
> > diff --git a/include/linux/swap.h b/include/linux/swap.h
> > index e9be95468fc7..db8d6000c116 100644
> > --- a/include/linux/swap.h
> > +++ b/include/linux/swap.h
> > @@ -254,9 +254,11 @@ struct swap_cluster_info {
> > */
> > u16 count;
> > u8 flags;
> > + u8 order;
> > struct list_head list;
> > };
> > #define CLUSTER_FLAG_FREE 1 /* This cluster is free */
> > +#define CLUSTER_FLAG_NONFULL 2 /* This cluster is on nonfull list */
> >
> >
> > /*
> > @@ -296,6 +298,8 @@ struct swap_info_struct {
> > unsigned long *zeromap; /* vmalloc'ed bitmap to track zero pages */
> > struct swap_cluster_info *cluster_info; /* cluster info. Only for SSD */
> > struct list_head free_clusters; /* free clusters list */
> > + struct list_head nonfull_clusters[SWAP_NR_ORDERS];
> > + /* list of cluster that contains at least one free slot */
> > unsigned int lowest_bit; /* index of first free in swap_map */
> > unsigned int highest_bit; /* index of last free in swap_map */
> > unsigned int pages; /* total of usable pages of swap */
> > diff --git a/mm/swapfile.c b/mm/swapfile.c
> > index f70d25005d2c..e13a33664cfa 100644
> > --- a/mm/swapfile.c
> > +++ b/mm/swapfile.c
> > @@ -361,14 +361,21 @@ static void swap_cluster_schedule_discard(struct swap_info_struct *si,
> > memset(si->swap_map + idx * SWAPFILE_CLUSTER,
> > SWAP_MAP_BAD, SWAPFILE_CLUSTER);
> >
> > - list_add_tail(&ci->list, &si->discard_clusters);
> > + if (ci->flags)
>
> I'm not sure this is future proof; what happens if a flag is added in future
> that does not indicate that the cluster is on a list. Perhaps explicitly check
> CLUSTER_FLAG_NONFULL? Or `if (!list_empty(&ci->list))`.
Currently flags are only used to track which list it is on. BTW, this
line has changed to check for explicite which list in patch 3 the big
rewrite. I can move that line change to patch 2 if you want.
>
> > + list_move_tail(&ci->list, &si->discard_clusters);
> > + else
> > + list_add_tail(&ci->list, &si->discard_clusters);
> > + ci->flags = 0;
>
> Bug: (I think?) the cluster ends up on the discard_clusters list and
> swap_do_scheduled_discard() calls __free_cluster() which will then call
swap_do_scheduled_discard() delete the entry from discard list.
The flag does not track the discard list state.
> list_add_tail() to put it on the free_clusters list. But since it is on the
> discard_list at that point, shouldn't it call list_move_tail()?
See above. Call list_move_tail() would be a mistake.
>
> > schedule_work(&si->discard_work);
> > }
> >
> > static void __free_cluster(struct swap_info_struct *si, struct swap_cluster_info *ci)
> > {
> > + if (ci->flags & CLUSTER_FLAG_NONFULL)
> > + list_move_tail(&ci->list, &si->free_clusters);
> > + else
> > + list_add_tail(&ci->list, &si->free_clusters);
> > ci->flags = CLUSTER_FLAG_FREE;
> > - list_add_tail(&ci->list, &si->free_clusters);
> > }
> >
> > /*
> > @@ -491,7 +498,12 @@ static void dec_cluster_info_page(struct swap_info_struct *p, struct swap_cluste
> > ci->count--;
> >
> > if (!ci->count)
> > - free_cluster(p, ci);
> > + return free_cluster(p, ci);
>
> nit: I'm not sure what the kernel style guide says about this, but I'm not a
> huge fan of returning void. I'd find it clearer if you just turn the below `if`
> into an `else if`.
I try to avoid 'else if' if possible.
Changed to
if (!ci->count) {
free_cluster(p, ci);
return;
}
>
> > +
> > + if (!(ci->flags & CLUSTER_FLAG_NONFULL)) {
> > + list_add_tail(&ci->list, &p->nonfull_clusters[ci->order]);
>
> I find the transitions when you add and remove a cluster from the
> nonfull_clusters list a bit strange (if I've understood correctly): It is added
> to the list whenever there is at least one free swap entry if not already on the
> list. But you take it off the list when assigning it as the current cluster for
> a cpu in scan_swap_map_try_ssd_cluster().
>
> So you could have this situation:
>
> - cpuA allocs cluster from free list (exclusive to that cpu)
> - cpuA allocs 1 swap entry from current cluster
> - swap entry is freed; cluster added to nonfull_clusters
> - cpuB "allocs" cluster from nonfull_clusters
>
> At this point both cpuA and cpuB share the same cluster as their current
> cluster. So why not just put the cluster on the nonfull_clusters list at
> allocation time (when removed from free_list) and only remove it from the
The big rewrite on patch 3 does that, taking it off the free list and
moving it into nonfull.
I am only making the minimal change in this step so the big rewrite can land.
> nonfull_clusters list when it is completely full (or at least definitely doesn't
> have room for an `order` allocation)? Then you allow "stealing" always instead
> of just sometimes. You would likely want to move the cluster to the end of the
> nonfull list when selecting it in scan_swap_map_try_ssd_cluster() to reduce the
> chances of multiple CPUs using the same cluster.
For nonfull clusters it is less important to avoid multiple CPU
sharing the cluster. Because the cluster already has previous swap
entries allocated from the previous CPU. Those behaviors will be fine
tuned after the patch 3 big rewrite. Try to make this patch simple.
> Another potential optimization (which was in my hacked version IIRC) is to only
> add/remove from nonfull list when `total - count` crosses the (1 << order)
> boundary rather than when becoming completely full. You definitely won't be able
> to allocate order-2 if there are only 3 pages available, for example.
That is in patch 3 as well. This patch is just doing the bare minimum
to introduce the nonfull list.
>
> > + ci->flags |= CLUSTER_FLAG_NONFULL;
> > + }
> > }
> >
> > /*
> > @@ -550,6 +562,18 @@ static bool scan_swap_map_try_ssd_cluster(struct swap_info_struct *si,
> > if (tmp == SWAP_NEXT_INVALID) {
> > if (!list_empty(&si->free_clusters)) {
> > ci = list_first_entry(&si->free_clusters, struct swap_cluster_info, list);
> > + list_del(&ci->list);
> > + spin_lock(&ci->lock);
> > + ci->order = order;
> > + ci->flags = 0;
> > + spin_unlock(&ci->lock);
> > + tmp = cluster_index(si, ci) * SWAPFILE_CLUSTER;
> > + } else if (!list_empty(&si->nonfull_clusters[order])) {
> > + ci = list_first_entry(&si->nonfull_clusters[order], struct swap_cluster_info, list);
> > + list_del(&ci->list);
> > + spin_lock(&ci->lock);
> > + ci->flags = 0;
> > + spin_unlock(&ci->lock);
> > tmp = cluster_index(si, ci) * SWAPFILE_CLUSTER;
> > } else if (!list_empty(&si->discard_clusters)) {
> > /*
> > @@ -964,6 +988,7 @@ static void swap_free_cluster(struct swap_info_struct *si, unsigned long idx)
> > ci = lock_cluster(si, offset);
> > memset(si->swap_map + offset, 0, SWAPFILE_CLUSTER);
> > ci->count = 0;
> > + ci->order = 0;
> > ci->flags = 0;
>
> Wonder if it would be better to put this in __free_cluster()?
Both flags and order were moved to __free_cluster() in patch 3 of this
series. The order is best assigned together with flags when the
cluster changes the list.
Thanks for the review. The patch 3 big rewrite is the heavy lifting.
Chris
