From: Donglin Peng <dolinux.peng@gmail.com>
To: ast@kernel.org
Cc: linux-kernel@vger.kernel.org, bpf@vger.kernel.org,
Donglin Peng <dolinux.peng@gmail.com>,
Eduard Zingerman <eddyz87@gmail.com>,
Andrii Nakryiko <andrii.nakryiko@gmail.com>,
Alan Maguire <alan.maguire@oracle.com>,
Song Liu <song@kernel.org>, pengdonglin <pengdonglin@xiaomi.com>
Subject: [RFC PATCH v4 5/7] btf: Optimize type lookup with binary search
Date: Tue, 4 Nov 2025 21:40:31 +0800 [thread overview]
Message-ID: <20251104134033.344807-6-dolinux.peng@gmail.com> (raw)
In-Reply-To: <20251104134033.344807-1-dolinux.peng@gmail.com>
From: pengdonglin <pengdonglin@xiaomi.com>
Improve btf_find_by_name_kind() performance by adding binary search
support for sorted types. Falls back to linear search for compatibility.
Cc: Eduard Zingerman <eddyz87@gmail.com>
Cc: Alexei Starovoitov <ast@kernel.org>
Cc: Andrii Nakryiko <andrii.nakryiko@gmail.com>
Cc: Alan Maguire <alan.maguire@oracle.com>
Cc: Song Liu <song@kernel.org>
Signed-off-by: pengdonglin <pengdonglin@xiaomi.com>
Signed-off-by: Donglin Peng <dolinux.peng@gmail.com>
---
kernel/bpf/btf.c | 111 ++++++++++++++++++++++++++++++++++++++++++-----
1 file changed, 101 insertions(+), 10 deletions(-)
diff --git a/kernel/bpf/btf.c b/kernel/bpf/btf.c
index 0de8fc8a0e0b..da35d8636b9b 100644
--- a/kernel/bpf/btf.c
+++ b/kernel/bpf/btf.c
@@ -259,6 +259,7 @@ struct btf {
void *nohdr_data;
struct btf_header hdr;
u32 nr_types; /* includes VOID for base BTF */
+ u32 nr_sorted_types; /* exclude VOID for base BTF */
u32 types_size;
u32 data_size;
refcount_t refcnt;
@@ -494,6 +495,11 @@ static bool btf_type_is_modifier(const struct btf_type *t)
return false;
}
+static int btf_start_id(const struct btf *btf)
+{
+ return btf->start_id + (btf->base_btf ? 0 : 1);
+}
+
bool btf_type_is_void(const struct btf_type *t)
{
return t == &btf_void;
@@ -544,24 +550,109 @@ u32 btf_nr_types(const struct btf *btf)
return total;
}
-s32 btf_find_by_name_kind(const struct btf *btf, const char *name, u8 kind)
+/* Find BTF types with matching names within the [left, right] index range.
+ * On success, updates *left and *right to the boundaries of the matching range
+ * and returns the leftmost matching index.
+ */
+static s32 btf_find_by_name_kind_bsearch(const struct btf *btf, const char *name,
+ s32 *left, s32 *right)
{
const struct btf_type *t;
const char *tname;
- u32 i, total;
+ s32 l, r, m, lmost, rmost;
+ int ret;
- total = btf_nr_types(btf);
- for (i = 1; i < total; i++) {
- t = btf_type_by_id(btf, i);
- if (BTF_INFO_KIND(t->info) != kind)
- continue;
+ /* found the leftmost btf_type that matches */
+ l = *left;
+ r = *right;
+ lmost = -1;
+ while (l <= r) {
+ m = l + (r - l) / 2;
+ t = btf_type_by_id(btf, m);
+ tname = btf_name_by_offset(btf, t->name_off);
+ ret = strcmp(tname, name);
+ if (ret < 0) {
+ l = m + 1;
+ } else {
+ if (ret == 0)
+ lmost = m;
+ r = m - 1;
+ }
+ }
+ if (lmost == -1)
+ return -ENOENT;
+
+ /* found the rightmost btf_type that matches */
+ l = lmost;
+ r = *right;
+ rmost = -1;
+ while (l <= r) {
+ m = l + (r - l) / 2;
+ t = btf_type_by_id(btf, m);
tname = btf_name_by_offset(btf, t->name_off);
- if (!strcmp(tname, name))
- return i;
+ ret = strcmp(tname, name);
+ if (ret <= 0) {
+ if (ret == 0)
+ rmost = m;
+ l = m + 1;
+ } else {
+ r = m - 1;
+ }
}
- return -ENOENT;
+ *left = lmost;
+ *right = rmost;
+ return lmost;
+}
+
+s32 btf_find_by_name_kind(const struct btf *btf, const char *name, u8 kind)
+{
+ const struct btf *base_btf = btf_base_btf(btf);;
+ const struct btf_type *t;
+ const char *tname;
+ int err = -ENOENT;
+
+ if (base_btf)
+ err = btf_find_by_name_kind(base_btf, name, kind);
+
+ if (err == -ENOENT) {
+ if (btf->nr_sorted_types) {
+ /* binary search */
+ s32 l, r;
+ int ret;
+
+ l = btf_start_id(btf);
+ r = l + btf->nr_sorted_types - 1;
+ ret = btf_find_by_name_kind_bsearch(btf, name, &l, &r);
+ if (ret < 0)
+ goto out;
+ /* found the leftmost btf_type that matches */
+ while (l <= r) {
+ t = btf_type_by_id(btf, l);
+ if (BTF_INFO_KIND(t->info) == kind)
+ return l;
+ l++;
+ }
+ } else {
+ /* linear search */
+ u32 i, total;
+
+ total = btf_nr_types(btf);
+ for (i = btf_start_id(btf); i < total; i++) {
+ t = btf_type_by_id(btf, i);
+ if (BTF_INFO_KIND(t->info) != kind)
+ continue;
+
+ tname = btf_name_by_offset(btf, t->name_off);
+ if (!strcmp(tname, name))
+ return i;
+ }
+ }
+ }
+
+out:
+ return err;
}
s32 bpf_find_btf_id(const char *name, u32 kind, struct btf **btf_p)
--
2.34.1
next prev parent reply other threads:[~2025-11-04 13:40 UTC|newest]
Thread overview: 53+ messages / expand[flat|nested] mbox.gz Atom feed top
2025-11-04 13:40 [RFC PATCH v4 0/7] libbpf: BTF performance optimizations with permutation and binary search Donglin Peng
2025-11-04 13:40 ` [RFC PATCH v4 1/7] libbpf: Extract BTF type remapping logic into helper function Donglin Peng
2025-11-04 23:16 ` Eduard Zingerman
2025-11-05 0:11 ` Andrii Nakryiko
2025-11-05 0:36 ` Eduard Zingerman
2025-11-05 0:57 ` Andrii Nakryiko
2025-11-05 1:23 ` Eduard Zingerman
2025-11-05 18:20 ` Andrii Nakryiko
2025-11-05 19:41 ` Eduard Zingerman
2025-11-06 17:09 ` Andrii Nakryiko
2025-11-04 13:40 ` [RFC PATCH v4 2/7] libbpf: Add BTF permutation support for type reordering Donglin Peng
2025-11-04 23:45 ` Eduard Zingerman
2025-11-05 11:31 ` Donglin Peng
2025-11-05 0:11 ` Andrii Nakryiko
2025-11-05 0:16 ` Eduard Zingerman
2025-11-05 1:04 ` Andrii Nakryiko
2025-11-05 1:20 ` Eduard Zingerman
2025-11-05 13:19 ` Donglin Peng
2025-11-05 18:32 ` Andrii Nakryiko
2025-11-05 18:23 ` Andrii Nakryiko
2025-11-05 19:23 ` Eduard Zingerman
2025-11-06 17:21 ` Andrii Nakryiko
2025-11-07 2:36 ` Donglin Peng
2025-11-07 17:43 ` Andrii Nakryiko
2025-11-05 12:52 ` Donglin Peng
2025-11-05 18:29 ` Andrii Nakryiko
2025-11-06 7:31 ` Donglin Peng
2025-11-06 17:12 ` Andrii Nakryiko
2025-11-07 1:39 ` Donglin Peng
2025-11-04 13:40 ` [RFC PATCH v4 3/7] libbpf: Optimize type lookup with binary search for sorted BTF Donglin Peng
2025-11-04 14:15 ` bot+bpf-ci
2025-11-05 0:06 ` Eduard Zingerman
2025-11-05 0:11 ` Andrii Nakryiko
2025-11-05 0:19 ` Eduard Zingerman
2025-11-05 0:54 ` Andrii Nakryiko
2025-11-05 1:17 ` Eduard Zingerman
2025-11-05 13:48 ` Donglin Peng
2025-11-05 16:52 ` Eduard Zingerman
2025-11-06 6:10 ` Donglin Peng
2025-11-05 18:11 ` Andrii Nakryiko
2025-11-06 7:49 ` Donglin Peng
2025-11-06 17:31 ` Andrii Nakryiko
2025-11-07 4:57 ` Donglin Peng
2025-11-07 17:01 ` Andrii Nakryiko
2025-11-10 2:04 ` Donglin Peng
2025-11-04 13:40 ` [RFC PATCH v4 4/7] libbpf: Implement lazy sorting validation for binary search optimization Donglin Peng
2025-11-05 0:29 ` Eduard Zingerman
2025-11-04 13:40 ` Donglin Peng [this message]
2025-11-04 17:14 ` [RFC PATCH v4 5/7] btf: Optimize type lookup with binary search Alexei Starovoitov
2025-11-05 13:22 ` Donglin Peng
2025-11-04 13:40 ` [RFC PATCH v4 6/7] btf: Add lazy sorting validation for " Donglin Peng
2025-11-04 13:40 ` [RFC PATCH v4 7/7] selftests/bpf: Add test cases for btf__permute functionality Donglin Peng
2025-11-05 0:41 ` Eduard Zingerman
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=20251104134033.344807-6-dolinux.peng@gmail.com \
--to=dolinux.peng@gmail.com \
--cc=alan.maguire@oracle.com \
--cc=andrii.nakryiko@gmail.com \
--cc=ast@kernel.org \
--cc=bpf@vger.kernel.org \
--cc=eddyz87@gmail.com \
--cc=linux-kernel@vger.kernel.org \
--cc=pengdonglin@xiaomi.com \
--cc=song@kernel.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox