On Mon, Oct 13, 2025 at 9:53 PM Donglin Peng <[email protected]> wrote: > > I’d like to suggest a dual-mechanism approach: > 1. If BTF is generated by a newer pahole (with pre-sorting support), the > kernel would use the pre-sorted data directly. > 2. For BTF from older pahole versions, the kernel would handle sorting > at load time or later.
The problem with 2 is extra memory consumption for narrow use case. The "time cat trace" example shows that search is in critical path, but I suspect ftrace can do it differently. I don't know why it's doing the search so much. Everyelse in bpf we don't call it that often. So optimizing the search is nice, but not at the expense of so much extra memory. Hence I don't think 2 is worth doing. > Regarding the pahole changes: this is now my highest priority. I’ve > already incorporated it into my development plan and will begin > working on the patches shortly. let's land pahole changes first.
