From: Jiri Olsa <olsajiri@gmail.com>
To: Andrii Nakryiko <andrii.nakryiko@gmail.com>
Cc: Alexei Starovoitov <ast@kernel.org>,
Daniel Borkmann <daniel@iogearbox.net>,
Andrii Nakryiko <andrii@kernel.org>,
bpf@vger.kernel.org, Martin KaFai Lau <kafai@fb.com>,
Song Liu <songliubraving@fb.com>, Yonghong Song <yhs@fb.com>,
John Fastabend <john.fastabend@gmail.com>,
KP Singh <kpsingh@chromium.org>,
Stanislav Fomichev <sdf@google.com>, Hao Luo <haoluo@google.com>
Subject: Re: [PATCHv2 bpf-next 08/24] libbpf: Add elf_find_multi_func_offset function
Date: Sun, 25 Jun 2023 03:19:24 +0200 [thread overview]
Message-ID: <ZJeWHKFXubOWd+Mj@krava> (raw)
In-Reply-To: <CAEf4BzZFipgUhpaUY7-Cy9+jBOtBws5bdnFMh0FgWk_kh-z6pQ@mail.gmail.com>
On Fri, Jun 23, 2023 at 01:39:54PM -0700, Andrii Nakryiko wrote:
> On Tue, Jun 20, 2023 at 1:37 AM Jiri Olsa <jolsa@kernel.org> wrote:
> >
> > Adding elf_find_multi_func_offset function that looks up
> > offsets for symbols specified in syms array argument.
> >
> > Offsets are returned in allocated array with the 'cnt' size,
> > that needs to be released by the caller.
> >
> > Signed-off-by: Jiri Olsa <jolsa@kernel.org>
> > ---
> > tools/lib/bpf/libbpf.c | 112 ++++++++++++++++++++++++++++++++
> > tools/lib/bpf/libbpf_internal.h | 2 +
> > 2 files changed, 114 insertions(+)
> >
> > diff --git a/tools/lib/bpf/libbpf.c b/tools/lib/bpf/libbpf.c
> > index 30d9e3b69114..1c310b718961 100644
> > --- a/tools/lib/bpf/libbpf.c
> > +++ b/tools/lib/bpf/libbpf.c
> > @@ -11053,6 +11053,118 @@ static long elf_find_func_offset(Elf *elf, const char *binary_path, const char *
> > return ret;
> > }
> >
> > +struct elf_symbol_offset {
> > + const char *name;
> > + unsigned long offset;
> > + int bind;
> > + int idx;
> > +};
> > +
> > +static int cmp_func_offset(const void *_a, const void *_b)
> > +{
> > + const struct elf_symbol_offset *a = _a;
> > + const struct elf_symbol_offset *b = _b;
> > +
> > + return strcmp(a->name, b->name);
> > +}
> > +
> > +static int
> > +__elf_find_multi_func_offset(Elf *elf, const char *binary_path, int cnt,
> > + const char **syms, unsigned long **poffsets)
> > +{
> > + int sh_types[2] = { SHT_DYNSYM, SHT_SYMTAB };
> > + struct elf_symbol_offset *func_offs;
> > + int err = 0, i, idx, cnt_done = 0;
> > + unsigned long *offsets = NULL;
> > +
> > + func_offs = calloc(cnt, sizeof(*func_offs));
> > + if (!func_offs)
> > + return -ENOMEM;
> > +
> > + for (i = 0; i < cnt; i++) {
> > + func_offs[i].name = syms[i];
> > + func_offs[i].idx = i;
> > + }
> > +
> > + qsort(func_offs, cnt, sizeof(*func_offs), cmp_func_offset);
> > +
> > + for (i = 0; i < ARRAY_SIZE(sh_types); i++) {
> > + struct elf_symbol_iter iter;
> > + struct elf_symbol *sym;
> > +
> > + if (elf_symbol_iter_new(&iter, elf, binary_path, sh_types[i]))
>
> a bit lax handling of initialization errors here, let's be a bit more
> strict here?
right, I'll have elf_symbol_iter_new return -ENOENT in case there's no
'sh_types[i]' section type (and we want to try next section type) and
fail otherwise
>
> > + continue;
> > +
> > + while ((sym = elf_symbol_iter_next(&iter))) {
> > + struct elf_symbol_offset *fo, tmp = {
> > + .name = sym->name,
> > + };
> > +
> > + fo = bsearch(&tmp, func_offs, cnt, sizeof(*func_offs),
> > + cmp_func_offset);
> > + if (!fo)
> > + continue;
> > +
> > + if (fo->offset > 0) {
> > + /* same offset, no problem */
> > + if (fo->offset == sym->offset)
> > + continue;
> > + /* handle multiple matches */
> > + if (fo->bind != STB_WEAK && sym->bind != STB_WEAK) {
> > + /* Only accept one non-weak bind. */
> > + pr_warn("elf: ambiguous match for '%s', '%s' in '%s'\n",
> > + sym->name, fo->name, binary_path);
> > + err = -LIBBPF_ERRNO__FORMAT;
> > + goto out;
> > + } else if (sym->bind == STB_WEAK) {
> > + /* already have a non-weak bind, and
> > + * this is a weak bind, so ignore.
> > + */
> > + continue;
> > + }
> > + }
> > + if (!fo->offset)
> > + cnt_done++;
> > + fo->offset = sym->offset;
> > + fo->bind = sym->bind;
> > + }
> > + }
> > +
> > + if (cnt != cnt_done) {
> > + err = -ENOENT;
> > + goto out;
> > + }
> > + offsets = calloc(cnt, sizeof(*offsets));
>
> you can allocate it at the very beginning and fill it out based on
> fo->idx, there is no need to store offset in elf_symbol_offset
true, will fix
>
> > + if (!offsets) {
> > + err = -ENOMEM;
> > + goto out;
> > + }
> > + for (i = 0; i < cnt; i++) {
> > + idx = func_offs[i].idx;
> > + offsets[idx] = func_offs[i].offset;
> > + }
> > +
> > +out:
> > + *poffsets = offsets;
> > + free(func_offs);
> > + return err;
> > +}
> > +
> > +int elf_find_multi_func_offset(const char *binary_path, int cnt,
> > + const char **syms, unsigned long **poffsets)
> > +{
> > + struct elf_fd elf_fd = {};
>
> do you need to initialize this struct?
I recall getting gcc warn/error, which I can't see anymore ;-)
will remove
>
> > + long ret = -ENOENT;
>
> same here, you always override ret, so no need to init it?
yes
>
> > +
> > + ret = open_elf(binary_path, &elf_fd);
> > + if (ret)
> > + return ret;
> > +
> > + ret = __elf_find_multi_func_offset(elf_fd.elf, binary_path, cnt, syms, poffsets);
>
> is there a point of having elf_find_multi_func_offset and
> __elf_find_multi_func_offset separately? can you please combine?
ok
thanks,
jirka
next prev parent reply other threads:[~2023-06-25 1:19 UTC|newest]
Thread overview: 61+ messages / expand[flat|nested] mbox.gz Atom feed top
2023-06-20 8:35 [PATCHv2 bpf-next 00/24] bpf: Add multi uprobe link Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 01/24] " Jiri Olsa
2023-06-20 17:11 ` Alexei Starovoitov
2023-06-21 8:32 ` Jiri Olsa
2023-06-23 0:18 ` Andrii Nakryiko
2023-06-23 8:19 ` Jiri Olsa
2023-06-23 16:24 ` Andrii Nakryiko
2023-06-23 16:39 ` Alexei Starovoitov
2023-06-23 17:11 ` Andrii Nakryiko
2023-06-23 17:20 ` Alexei Starovoitov
2023-06-25 1:19 ` Jiri Olsa
2023-06-25 1:18 ` Jiri Olsa
2023-06-26 18:27 ` Andrii Nakryiko
2023-06-26 19:23 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 02/24] bpf: Add cookies support for uprobe_multi link Jiri Olsa
2023-06-23 0:18 ` Andrii Nakryiko
2023-06-23 8:01 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 03/24] bpf: Add pid filter " Jiri Olsa
2023-06-20 12:40 ` Oleg Nesterov
2023-06-20 8:35 ` [PATCHv2 bpf-next 04/24] bpf: Add bpf_get_func_ip helper support for uprobe link Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 05/24] libbpf: Add uprobe_multi attach type and link names Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 06/24] libbpf: Add elf symbol iterator Jiri Olsa
2023-06-23 0:31 ` Andrii Nakryiko
2023-06-23 8:19 ` Jiri Olsa
2023-06-23 16:27 ` Andrii Nakryiko
2023-06-23 16:29 ` Andrii Nakryiko
2023-06-20 8:35 ` [PATCHv2 bpf-next 07/24] libbpf: Add open_elf/close_elf functions Jiri Olsa
2023-06-23 0:33 ` Andrii Nakryiko
2023-06-23 8:21 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 08/24] libbpf: Add elf_find_multi_func_offset function Jiri Olsa
2023-06-23 20:39 ` Andrii Nakryiko
2023-06-25 1:19 ` Jiri Olsa [this message]
2023-06-20 8:35 ` [PATCHv2 bpf-next 09/24] libbpf: Add elf_find_pattern_func_offset function Jiri Olsa
2023-06-23 20:39 ` Andrii Nakryiko
2023-06-25 1:19 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 10/24] libbpf: Add bpf_link_create support for multi uprobes Jiri Olsa
2023-06-23 20:40 ` Andrii Nakryiko
2023-06-20 8:35 ` [PATCHv2 bpf-next 11/24] libbpf: Add bpf_program__attach_uprobe_multi_opts function Jiri Olsa
2023-06-23 20:40 ` Andrii Nakryiko
2023-06-25 1:19 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 12/24] libbpf: Add support for u[ret]probe.multi[.s] program sections Jiri Olsa
2023-06-23 20:40 ` Andrii Nakryiko
2023-06-25 1:20 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 13/24] libbpf: Add uprobe multi link detection Jiri Olsa
2023-06-23 20:40 ` Andrii Nakryiko
2023-06-25 1:18 ` Jiri Olsa
2023-06-26 18:21 ` Andrii Nakryiko
2023-06-26 19:22 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 14/24] libbpf: Add uprobe multi link support to bpf_program__attach_usdt Jiri Olsa
2023-06-23 20:40 ` Andrii Nakryiko
2023-06-25 1:18 ` Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 15/24] selftests/bpf: Add uprobe_multi skel test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 16/24] selftests/bpf: Add uprobe_multi api test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 17/24] selftests/bpf: Add uprobe_multi link test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 18/24] selftests/bpf: Add uprobe_multi test program Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 19/24] selftests/bpf: Add uprobe_multi bench test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 20/24] selftests/bpf: Add usdt_multi test program Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 21/24] selftests/bpf: Add usdt_multi bench test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 22/24] selftests/bpf: Add uprobe_multi cookie test Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 23/24] selftests/bpf: Add uprobe_multi pid filter tests Jiri Olsa
2023-06-20 8:35 ` [PATCHv2 bpf-next 24/24] selftests/bpf: Add extra link to uprobe_multi tests Jiri Olsa
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=ZJeWHKFXubOWd+Mj@krava \
--to=olsajiri@gmail.com \
--cc=andrii.nakryiko@gmail.com \
--cc=andrii@kernel.org \
--cc=ast@kernel.org \
--cc=bpf@vger.kernel.org \
--cc=daniel@iogearbox.net \
--cc=haoluo@google.com \
--cc=john.fastabend@gmail.com \
--cc=kafai@fb.com \
--cc=kpsingh@chromium.org \
--cc=sdf@google.com \
--cc=songliubraving@fb.com \
--cc=yhs@fb.com \
/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