bpf_load.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411
  1. #include <stdio.h>
  2. #include <sys/types.h>
  3. #include <sys/stat.h>
  4. #include <fcntl.h>
  5. #include <libelf.h>
  6. #include <gelf.h>
  7. #include <errno.h>
  8. #include <unistd.h>
  9. #include <string.h>
  10. #include <stdbool.h>
  11. #include <stdlib.h>
  12. #include <linux/bpf.h>
  13. #include <linux/filter.h>
  14. #include <linux/perf_event.h>
  15. #include <sys/syscall.h>
  16. #include <sys/ioctl.h>
  17. #include <sys/mman.h>
  18. #include <poll.h>
  19. #include <ctype.h>
  20. #include "libbpf.h"
  21. #include "bpf_helpers.h"
  22. #include "bpf_load.h"
  23. #define DEBUGFS "/sys/kernel/debug/tracing/"
  24. static char license[128];
  25. static int kern_version;
  26. static bool processed_sec[128];
  27. int map_fd[MAX_MAPS];
  28. int prog_fd[MAX_PROGS];
  29. int event_fd[MAX_PROGS];
  30. int prog_cnt;
  31. int prog_array_fd = -1;
  32. static int populate_prog_array(const char *event, int prog_fd)
  33. {
  34. int ind = atoi(event), err;
  35. err = bpf_update_elem(prog_array_fd, &ind, &prog_fd, BPF_ANY);
  36. if (err < 0) {
  37. printf("failed to store prog_fd in prog_array\n");
  38. return -1;
  39. }
  40. return 0;
  41. }
  42. static int load_and_attach(const char *event, struct bpf_insn *prog, int size)
  43. {
  44. bool is_socket = strncmp(event, "socket", 6) == 0;
  45. bool is_kprobe = strncmp(event, "kprobe/", 7) == 0;
  46. bool is_kretprobe = strncmp(event, "kretprobe/", 10) == 0;
  47. enum bpf_prog_type prog_type;
  48. char buf[256];
  49. int fd, efd, err, id;
  50. struct perf_event_attr attr = {};
  51. attr.type = PERF_TYPE_TRACEPOINT;
  52. attr.sample_type = PERF_SAMPLE_RAW;
  53. attr.sample_period = 1;
  54. attr.wakeup_events = 1;
  55. if (is_socket) {
  56. prog_type = BPF_PROG_TYPE_SOCKET_FILTER;
  57. } else if (is_kprobe || is_kretprobe) {
  58. prog_type = BPF_PROG_TYPE_KPROBE;
  59. } else {
  60. printf("Unknown event '%s'\n", event);
  61. return -1;
  62. }
  63. fd = bpf_prog_load(prog_type, prog, size, license, kern_version);
  64. if (fd < 0) {
  65. printf("bpf_prog_load() err=%d\n%s", errno, bpf_log_buf);
  66. return -1;
  67. }
  68. prog_fd[prog_cnt++] = fd;
  69. if (is_socket) {
  70. event += 6;
  71. if (*event != '/')
  72. return 0;
  73. event++;
  74. if (!isdigit(*event)) {
  75. printf("invalid prog number\n");
  76. return -1;
  77. }
  78. return populate_prog_array(event, fd);
  79. }
  80. if (is_kprobe || is_kretprobe) {
  81. if (is_kprobe)
  82. event += 7;
  83. else
  84. event += 10;
  85. if (*event == 0) {
  86. printf("event name cannot be empty\n");
  87. return -1;
  88. }
  89. if (isdigit(*event))
  90. return populate_prog_array(event, fd);
  91. snprintf(buf, sizeof(buf),
  92. "echo '%c:%s %s' >> /sys/kernel/debug/tracing/kprobe_events",
  93. is_kprobe ? 'p' : 'r', event, event);
  94. err = system(buf);
  95. if (err < 0) {
  96. printf("failed to create kprobe '%s' error '%s'\n",
  97. event, strerror(errno));
  98. return -1;
  99. }
  100. }
  101. strcpy(buf, DEBUGFS);
  102. strcat(buf, "events/kprobes/");
  103. strcat(buf, event);
  104. strcat(buf, "/id");
  105. efd = open(buf, O_RDONLY, 0);
  106. if (efd < 0) {
  107. printf("failed to open event %s\n", event);
  108. return -1;
  109. }
  110. err = read(efd, buf, sizeof(buf));
  111. if (err < 0 || err >= sizeof(buf)) {
  112. printf("read from '%s' failed '%s'\n", event, strerror(errno));
  113. return -1;
  114. }
  115. close(efd);
  116. buf[err] = 0;
  117. id = atoi(buf);
  118. attr.config = id;
  119. efd = perf_event_open(&attr, -1/*pid*/, 0/*cpu*/, -1/*group_fd*/, 0);
  120. if (efd < 0) {
  121. printf("event %d fd %d err %s\n", id, efd, strerror(errno));
  122. return -1;
  123. }
  124. event_fd[prog_cnt - 1] = efd;
  125. ioctl(efd, PERF_EVENT_IOC_ENABLE, 0);
  126. ioctl(efd, PERF_EVENT_IOC_SET_BPF, fd);
  127. return 0;
  128. }
  129. static int load_maps(struct bpf_map_def *maps, int len)
  130. {
  131. int i;
  132. for (i = 0; i < len / sizeof(struct bpf_map_def); i++) {
  133. map_fd[i] = bpf_create_map(maps[i].type,
  134. maps[i].key_size,
  135. maps[i].value_size,
  136. maps[i].max_entries,
  137. maps[i].map_flags);
  138. if (map_fd[i] < 0) {
  139. printf("failed to create a map: %d %s\n",
  140. errno, strerror(errno));
  141. return 1;
  142. }
  143. if (maps[i].type == BPF_MAP_TYPE_PROG_ARRAY)
  144. prog_array_fd = map_fd[i];
  145. }
  146. return 0;
  147. }
  148. static int get_sec(Elf *elf, int i, GElf_Ehdr *ehdr, char **shname,
  149. GElf_Shdr *shdr, Elf_Data **data)
  150. {
  151. Elf_Scn *scn;
  152. scn = elf_getscn(elf, i);
  153. if (!scn)
  154. return 1;
  155. if (gelf_getshdr(scn, shdr) != shdr)
  156. return 2;
  157. *shname = elf_strptr(elf, ehdr->e_shstrndx, shdr->sh_name);
  158. if (!*shname || !shdr->sh_size)
  159. return 3;
  160. *data = elf_getdata(scn, 0);
  161. if (!*data || elf_getdata(scn, *data) != NULL)
  162. return 4;
  163. return 0;
  164. }
  165. static int parse_relo_and_apply(Elf_Data *data, Elf_Data *symbols,
  166. GElf_Shdr *shdr, struct bpf_insn *insn)
  167. {
  168. int i, nrels;
  169. nrels = shdr->sh_size / shdr->sh_entsize;
  170. for (i = 0; i < nrels; i++) {
  171. GElf_Sym sym;
  172. GElf_Rel rel;
  173. unsigned int insn_idx;
  174. gelf_getrel(data, i, &rel);
  175. insn_idx = rel.r_offset / sizeof(struct bpf_insn);
  176. gelf_getsym(symbols, GELF_R_SYM(rel.r_info), &sym);
  177. if (insn[insn_idx].code != (BPF_LD | BPF_IMM | BPF_DW)) {
  178. printf("invalid relo for insn[%d].code 0x%x\n",
  179. insn_idx, insn[insn_idx].code);
  180. return 1;
  181. }
  182. insn[insn_idx].src_reg = BPF_PSEUDO_MAP_FD;
  183. insn[insn_idx].imm = map_fd[sym.st_value / sizeof(struct bpf_map_def)];
  184. }
  185. return 0;
  186. }
  187. int load_bpf_file(char *path)
  188. {
  189. int fd, i;
  190. Elf *elf;
  191. GElf_Ehdr ehdr;
  192. GElf_Shdr shdr, shdr_prog;
  193. Elf_Data *data, *data_prog, *symbols = NULL;
  194. char *shname, *shname_prog;
  195. if (elf_version(EV_CURRENT) == EV_NONE)
  196. return 1;
  197. fd = open(path, O_RDONLY, 0);
  198. if (fd < 0)
  199. return 1;
  200. elf = elf_begin(fd, ELF_C_READ, NULL);
  201. if (!elf)
  202. return 1;
  203. if (gelf_getehdr(elf, &ehdr) != &ehdr)
  204. return 1;
  205. /* clear all kprobes */
  206. i = system("echo \"\" > /sys/kernel/debug/tracing/kprobe_events");
  207. /* scan over all elf sections to get license and map info */
  208. for (i = 1; i < ehdr.e_shnum; i++) {
  209. if (get_sec(elf, i, &ehdr, &shname, &shdr, &data))
  210. continue;
  211. if (0) /* helpful for llvm debugging */
  212. printf("section %d:%s data %p size %zd link %d flags %d\n",
  213. i, shname, data->d_buf, data->d_size,
  214. shdr.sh_link, (int) shdr.sh_flags);
  215. if (strcmp(shname, "license") == 0) {
  216. processed_sec[i] = true;
  217. memcpy(license, data->d_buf, data->d_size);
  218. } else if (strcmp(shname, "version") == 0) {
  219. processed_sec[i] = true;
  220. if (data->d_size != sizeof(int)) {
  221. printf("invalid size of version section %zd\n",
  222. data->d_size);
  223. return 1;
  224. }
  225. memcpy(&kern_version, data->d_buf, sizeof(int));
  226. } else if (strcmp(shname, "maps") == 0) {
  227. processed_sec[i] = true;
  228. if (load_maps(data->d_buf, data->d_size))
  229. return 1;
  230. } else if (shdr.sh_type == SHT_SYMTAB) {
  231. symbols = data;
  232. }
  233. }
  234. /* load programs that need map fixup (relocations) */
  235. for (i = 1; i < ehdr.e_shnum; i++) {
  236. if (get_sec(elf, i, &ehdr, &shname, &shdr, &data))
  237. continue;
  238. if (shdr.sh_type == SHT_REL) {
  239. struct bpf_insn *insns;
  240. if (get_sec(elf, shdr.sh_info, &ehdr, &shname_prog,
  241. &shdr_prog, &data_prog))
  242. continue;
  243. insns = (struct bpf_insn *) data_prog->d_buf;
  244. processed_sec[shdr.sh_info] = true;
  245. processed_sec[i] = true;
  246. if (parse_relo_and_apply(data, symbols, &shdr, insns))
  247. continue;
  248. if (memcmp(shname_prog, "kprobe/", 7) == 0 ||
  249. memcmp(shname_prog, "kretprobe/", 10) == 0 ||
  250. memcmp(shname_prog, "socket", 6) == 0)
  251. load_and_attach(shname_prog, insns, data_prog->d_size);
  252. }
  253. }
  254. /* load programs that don't use maps */
  255. for (i = 1; i < ehdr.e_shnum; i++) {
  256. if (processed_sec[i])
  257. continue;
  258. if (get_sec(elf, i, &ehdr, &shname, &shdr, &data))
  259. continue;
  260. if (memcmp(shname, "kprobe/", 7) == 0 ||
  261. memcmp(shname, "kretprobe/", 10) == 0 ||
  262. memcmp(shname, "socket", 6) == 0)
  263. load_and_attach(shname, data->d_buf, data->d_size);
  264. }
  265. close(fd);
  266. return 0;
  267. }
  268. void read_trace_pipe(void)
  269. {
  270. int trace_fd;
  271. trace_fd = open(DEBUGFS "trace_pipe", O_RDONLY, 0);
  272. if (trace_fd < 0)
  273. return;
  274. while (1) {
  275. static char buf[4096];
  276. ssize_t sz;
  277. sz = read(trace_fd, buf, sizeof(buf));
  278. if (sz > 0) {
  279. buf[sz] = 0;
  280. puts(buf);
  281. }
  282. }
  283. }
  284. #define MAX_SYMS 300000
  285. static struct ksym syms[MAX_SYMS];
  286. static int sym_cnt;
  287. static int ksym_cmp(const void *p1, const void *p2)
  288. {
  289. return ((struct ksym *)p1)->addr - ((struct ksym *)p2)->addr;
  290. }
  291. int load_kallsyms(void)
  292. {
  293. FILE *f = fopen("/proc/kallsyms", "r");
  294. char func[256], buf[256];
  295. char symbol;
  296. void *addr;
  297. int i = 0;
  298. if (!f)
  299. return -ENOENT;
  300. while (!feof(f)) {
  301. if (!fgets(buf, sizeof(buf), f))
  302. break;
  303. if (sscanf(buf, "%p %c %s", &addr, &symbol, func) != 3)
  304. break;
  305. if (!addr)
  306. continue;
  307. syms[i].addr = (long) addr;
  308. syms[i].name = strdup(func);
  309. i++;
  310. }
  311. sym_cnt = i;
  312. qsort(syms, sym_cnt, sizeof(struct ksym), ksym_cmp);
  313. return 0;
  314. }
  315. struct ksym *ksym_search(long key)
  316. {
  317. int start = 0, end = sym_cnt;
  318. int result;
  319. while (start < end) {
  320. size_t mid = start + (end - start) / 2;
  321. result = key - syms[mid].addr;
  322. if (result < 0)
  323. end = mid;
  324. else if (result > 0)
  325. start = mid + 1;
  326. else
  327. return &syms[mid];
  328. }
  329. if (start >= 1 && syms[start - 1].addr < key &&
  330. key < syms[start].addr)
  331. /* valid ksym */
  332. return &syms[start - 1];
  333. /* out of range. return _stext */
  334. return &syms[0];
  335. }