[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <ZxYf8VvQIZv9_Y1j@archie.me>
Date: Mon, 21 Oct 2024 16:33:37 +0700
From: Bagas Sanjaya <bagasdotme@...il.com>
To: Kuan-Wei Chiu <visitorckw@...il.com>, 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
Cc: 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 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...
--
An old man doll... just what I always wanted! - Clara
Download attachment "signature.asc" of type "application/pgp-signature" (229 bytes)
Powered by blists - more mailing lists