[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <ZxZbgWc2IsztAOOx@visitorckw-System-Product-Name>
Date: Mon, 21 Oct 2024 21:47:45 +0800
From: Kuan-Wei Chiu <visitorckw@...il.com>
To: Bagas Sanjaya <bagasdotme@...il.com>
Cc: colyli@...e.de, kent.overstreet@...ux.dev, msakai@...hat.com,
corbet@....net, peterz@...radead.org, mingo@...hat.com,
acme@...nel.org, namhyung@...nel.org, akpm@...ux-foundation.org,
mark.rutland@....com, alexander.shishkin@...ux.intel.com,
jolsa@...nel.org, irogers@...gle.com, adrian.hunter@...el.com,
kan.liang@...ux.intel.com, willy@...radead.org,
jserv@...s.ncku.edu.tw, linux-kernel@...r.kernel.org,
linux-bcache@...r.kernel.org, dm-devel@...ts.linux.dev,
linux-bcachefs@...r.kernel.org, linux-perf-users@...r.kernel.org,
linux-doc@...r.kernel.org
Subject: Re: [PATCH v2 00/10] Enhance min heap API with non-inline functions
and optimizations
On Mon, Oct 21, 2024 at 04:33:37PM +0700, Bagas Sanjaya wrote:
> On Sun, Oct 20, 2024 at 12:01:50PM +0800, Kuan-Wei Chiu wrote:
> > Add non-inline versions of the min heap API functions in lib/min_heap.c
> > and updates all users outside of kernel/events/core.c to use these
> > non-inline versions. To mitigate the performance impact of indirect
> > function calls caused by the non-inline versions of the swap and
> > compare functions, a builtin swap has been introduced that swaps
> > elements based on their size. Additionally, it micro-optimizes the
> > efficiency of the min heap by pre-scaling the counter, following the
> > same approach as in lib/sort.c. Documentation for the min heap API has
> > also been added to the core-api section.
>
> What tree (and commit) this series is based on?
>
> Confused...
>
This patchset is based on Linus' tree, commit 715ca9dd687f ("Merge tag
'io_uring-6.12-20241019' of git://git.kernel.dk/linux"). Since it
touches multiple subsystems, I'm not entirely sure which tree I should
base it on. Should it be linux-next, perhaps?
Regards,
Kuan-Wei
Powered by blists - more mailing lists