Re: [PATCH 02/13] jump_label: Index text reservation lookups

[Jiri Olsa]

On Thu, Nov 12, 2026 at 09:33:05AM +0100, Peter Zijlstra wrote:
> On Mon, Nov 09, 2026 at 08:49:05PM +0100, Jiri Olsa wrote:
> > Text reservation checks scan every jump entry. Build an index sorted by
> > code address for core entries and use binary search to find the starting
> > point near the requested range. Keep the original table sorted by
> > static-key address for updates.
> > 
> > Module reservation checks continue to use a linear scan, avoiding
> > per-module index allocation and teardown complexity.
> > 
> > Signed-off-by: Jiri Olsa <jolsa@xxxxxxxxxx>
> 
> This is the *exact* same code as the last patch; seriously? You
> couldn't share?

I think we could share the search for the lower bound,
but then the overlap check is different

perhaps if we keep the index generic we could share the
allocation and setup, I'll check

jirka