[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Message-ID: <4oaulium6rn7xzio3dg3lxjc7qrlt27dl2bs3dlmmkytjkiqlg@zwphzvpirbes>
Date: Mon, 29 Sep 2025 12:51:49 -0400
From: "Liam R. Howlett" <Liam.Howlett@...cle.com>
To: Vlastimil Babka <vbabka@...e.cz>
Cc: Suren Baghdasaryan <surenb@...gle.com>, Christoph Lameter <cl@...two.org>,
David Rientjes <rientjes@...gle.com>,
Roman Gushchin <roman.gushchin@...ux.dev>,
Harry Yoo <harry.yoo@...cle.com>, Uladzislau Rezki <urezki@...il.com>,
Sidhartha Kumar <sidhartha.kumar@...cle.com>, linux-mm@...ck.org,
linux-kernel@...r.kernel.org, rcu@...r.kernel.org,
maple-tree@...ts.infradead.org
Subject: Re: [PATCH v8 21/23] maple_tree: Prefilled sheaf conversion and
testing
* Vlastimil Babka <vbabka@...e.cz> [250929 03:30]:
> On 9/27/25 03:08, Suren Baghdasaryan wrote:
> > On Wed, Sep 10, 2025 at 1:01 AM Vlastimil Babka <vbabka@...e.cz> wrote:
> >>
> >> From: "Liam R. Howlett" <Liam.Howlett@...cle.com>
> >>
> >> Use prefilled sheaves instead of bulk allocations. This should speed up
> >> the allocations and the return path of unused allocations.
> >>
> >> Remove the push and pop of nodes from the maple state as this is now
> >> handled by the slab layer with sheaves.
> >>
> >> Testing has been removed as necessary since the features of the tree
> >> have been reduced.
> >>
> >> Signed-off-by: Liam R. Howlett <Liam.Howlett@...cle.com>
> >> Signed-off-by: Vlastimil Babka <vbabka@...e.cz>
> >
> > Couple nits but otherwise looks great!
> >
> > Reviewed-by: Suren Baghdasaryan <surenb@...gle.com>
> >
> >> ---
> >> include/linux/maple_tree.h | 6 +-
> >> lib/maple_tree.c | 326 ++++++---------------------
> >> tools/testing/radix-tree/maple.c | 461 ++-------------------------------------
> >> tools/testing/shared/linux.c | 5 +-
> >> 4 files changed, 88 insertions(+), 710 deletions(-)
> >>
> >> diff --git a/include/linux/maple_tree.h b/include/linux/maple_tree.h
> >> index bafe143b1f783202e27b32567fffee4149e8e266..166fd67e00d882b1e6de1f80c1b590bba7497cd3 100644
> >> --- a/include/linux/maple_tree.h
> >> +++ b/include/linux/maple_tree.h
> >> @@ -442,7 +442,8 @@ struct ma_state {
> >> struct maple_enode *node; /* The node containing this entry */
> >> unsigned long min; /* The minimum index of this node - implied pivot min */
> >> unsigned long max; /* The maximum index of this node - implied pivot max */
> >> - struct maple_alloc *alloc; /* Allocated nodes for this operation */
> >> + struct slab_sheaf *sheaf; /* Allocated nodes for this operation */
> >> + unsigned long node_request;
> >
> > No comment for this poor fella?
>
> adding: /* The number of nodes to allocate for this operation */
>
Thanks. That sounds better than my planned /* requested nodes */
Powered by blists - more mailing lists