89 lines
1.6 KiB
C
89 lines
1.6 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <assert.h>
|
|
#include <errno.h>
|
|
#include <poll.h>
|
|
#include <unistd.h>
|
|
#include <linux/perf_event.h>
|
|
#include <sys/mman.h>
|
|
#include "trace_helpers.h"
|
|
|
|
#define MAX_SYMS 300000
|
|
static struct ksym syms[MAX_SYMS];
|
|
static int sym_cnt;
|
|
|
|
static int ksym_cmp(const void *p1, const void *p2)
|
|
{
|
|
return ((struct ksym *)p1)->addr - ((struct ksym *)p2)->addr;
|
|
}
|
|
|
|
int load_kallsyms(void)
|
|
{
|
|
FILE *f = fopen("/proc/kallsyms", "r");
|
|
char func[256], buf[256];
|
|
char symbol;
|
|
void *addr;
|
|
int i = 0;
|
|
|
|
if (!f)
|
|
return -ENOENT;
|
|
|
|
while (fgets(buf, sizeof(buf), f)) {
|
|
if (sscanf(buf, "%p %c %s", &addr, &symbol, func) != 3)
|
|
break;
|
|
if (!addr)
|
|
continue;
|
|
syms[i].addr = (long) addr;
|
|
syms[i].name = strdup(func);
|
|
i++;
|
|
}
|
|
fclose(f);
|
|
sym_cnt = i;
|
|
qsort(syms, sym_cnt, sizeof(struct ksym), ksym_cmp);
|
|
return 0;
|
|
}
|
|
|
|
struct ksym *ksym_search(long key)
|
|
{
|
|
int start = 0, end = sym_cnt;
|
|
int result;
|
|
|
|
/* kallsyms not loaded. return NULL */
|
|
if (sym_cnt <= 0)
|
|
return NULL;
|
|
|
|
while (start < end) {
|
|
size_t mid = start + (end - start) / 2;
|
|
|
|
result = key - syms[mid].addr;
|
|
if (result < 0)
|
|
end = mid;
|
|
else if (result > 0)
|
|
start = mid + 1;
|
|
else
|
|
return &syms[mid];
|
|
}
|
|
|
|
if (start >= 1 && syms[start - 1].addr < key &&
|
|
key < syms[start].addr)
|
|
/* valid ksym */
|
|
return &syms[start - 1];
|
|
|
|
/* out of range. return _stext */
|
|
return &syms[0];
|
|
}
|
|
|
|
long ksym_get_addr(const char *name)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < sym_cnt; i++) {
|
|
if (strcmp(syms[i].name, name) == 0)
|
|
return syms[i].addr;
|
|
}
|
|
|
|
return 0;
|
|
}
|