mirror of
https://github.com/torvalds/linux
synced 2024-10-18 17:29:25 +00:00
20d1b54a52
Function in modules could appear in /proc/kallsyms in random order. ffffffffa02608a0 t bpf_testmod_loop_test ffffffffa02600c0 t __traceiter_bpf_testmod_test_writable_bare ffffffffa0263b60 d __tracepoint_bpf_testmod_test_write_bare ffffffffa02608c0 T bpf_testmod_test_read ffffffffa0260d08 t __SCT__tp_func_bpf_testmod_test_writable_bare ffffffffa0263300 d __SCK__tp_func_bpf_testmod_test_read ffffffffa0260680 T bpf_testmod_test_write ffffffffa0260860 t bpf_testmod_test_mod_kfunc Therefore, we cannot reliably use kallsyms_find_next() to find the end of a function. Replace it with a simple guess (start + 128). This is good enough for this test. Signed-off-by: Song Liu <songliubraving@fb.com> Signed-off-by: Andrii Nakryiko <andrii@kernel.org> Link: https://lore.kernel.org/bpf/20211022234814.318457-1-songliubraving@fb.com
26 lines
564 B
C
26 lines
564 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __TRACE_HELPER_H
|
|
#define __TRACE_HELPER_H
|
|
|
|
#include <bpf/libbpf.h>
|
|
|
|
struct ksym {
|
|
long addr;
|
|
char *name;
|
|
};
|
|
|
|
int load_kallsyms(void);
|
|
struct ksym *ksym_search(long key);
|
|
long ksym_get_addr(const char *name);
|
|
|
|
/* open kallsyms and find addresses on the fly, faster than load + search. */
|
|
int kallsyms_find(const char *sym, unsigned long long *addr);
|
|
|
|
void read_trace_pipe(void);
|
|
|
|
ssize_t get_uprobe_offset(const void *addr, ssize_t base);
|
|
ssize_t get_base_addr(void);
|
|
ssize_t get_rel_offset(uintptr_t addr);
|
|
|
|
#endif
|