trace_helpers.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <ctype.h>
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include <assert.h>
  7. #include <errno.h>
  8. #include <fcntl.h>
  9. #include <poll.h>
  10. #include <pthread.h>
  11. #include <unistd.h>
  12. #include <linux/perf_event.h>
  13. #include <linux/fs.h>
  14. #include <sys/ioctl.h>
  15. #include <sys/mman.h>
  16. #include "trace_helpers.h"
  17. #include <linux/limits.h>
  18. #include <libelf.h>
  19. #include <gelf.h>
  20. #include "bpf/libbpf_internal.h"
  21. #define TRACEFS_PIPE "/sys/kernel/tracing/trace_pipe"
  22. #define DEBUGFS_PIPE "/sys/kernel/debug/tracing/trace_pipe"
  23. struct ksyms {
  24. struct ksym *syms;
  25. size_t sym_cap;
  26. size_t sym_cnt;
  27. };
  28. static struct ksyms *ksyms;
  29. static pthread_mutex_t ksyms_mutex = PTHREAD_MUTEX_INITIALIZER;
  30. static int ksyms__add_symbol(struct ksyms *ksyms, const char *name,
  31. unsigned long addr)
  32. {
  33. void *tmp;
  34. tmp = strdup(name);
  35. if (!tmp)
  36. return -ENOMEM;
  37. ksyms->syms[ksyms->sym_cnt].addr = addr;
  38. ksyms->syms[ksyms->sym_cnt].name = tmp;
  39. ksyms->sym_cnt++;
  40. return 0;
  41. }
  42. void free_kallsyms_local(struct ksyms *ksyms)
  43. {
  44. unsigned int i;
  45. if (!ksyms)
  46. return;
  47. if (!ksyms->syms) {
  48. free(ksyms);
  49. return;
  50. }
  51. for (i = 0; i < ksyms->sym_cnt; i++)
  52. free(ksyms->syms[i].name);
  53. free(ksyms->syms);
  54. free(ksyms);
  55. }
  56. static struct ksyms *load_kallsyms_local_common(ksym_cmp_t cmp_cb)
  57. {
  58. FILE *f;
  59. char func[256], buf[256];
  60. char symbol;
  61. void *addr;
  62. int ret;
  63. struct ksyms *ksyms;
  64. f = fopen("/proc/kallsyms", "r");
  65. if (!f)
  66. return NULL;
  67. ksyms = calloc(1, sizeof(struct ksyms));
  68. if (!ksyms) {
  69. fclose(f);
  70. return NULL;
  71. }
  72. while (fgets(buf, sizeof(buf), f)) {
  73. if (sscanf(buf, "%p %c %s", &addr, &symbol, func) != 3)
  74. break;
  75. if (!addr)
  76. continue;
  77. ret = libbpf_ensure_mem((void **) &ksyms->syms, &ksyms->sym_cap,
  78. sizeof(struct ksym), ksyms->sym_cnt + 1);
  79. if (ret)
  80. goto error;
  81. ret = ksyms__add_symbol(ksyms, func, (unsigned long)addr);
  82. if (ret)
  83. goto error;
  84. }
  85. fclose(f);
  86. qsort(ksyms->syms, ksyms->sym_cnt, sizeof(struct ksym), cmp_cb);
  87. return ksyms;
  88. error:
  89. fclose(f);
  90. free_kallsyms_local(ksyms);
  91. return NULL;
  92. }
  93. static int ksym_cmp(const void *p1, const void *p2)
  94. {
  95. return ((struct ksym *)p1)->addr - ((struct ksym *)p2)->addr;
  96. }
  97. struct ksyms *load_kallsyms_local(void)
  98. {
  99. return load_kallsyms_local_common(ksym_cmp);
  100. }
  101. struct ksyms *load_kallsyms_custom_local(ksym_cmp_t cmp_cb)
  102. {
  103. return load_kallsyms_local_common(cmp_cb);
  104. }
  105. int load_kallsyms(void)
  106. {
  107. pthread_mutex_lock(&ksyms_mutex);
  108. if (!ksyms)
  109. ksyms = load_kallsyms_local();
  110. pthread_mutex_unlock(&ksyms_mutex);
  111. return ksyms ? 0 : 1;
  112. }
  113. struct ksym *ksym_search_local(struct ksyms *ksyms, long key)
  114. {
  115. int start = 0, end = ksyms->sym_cnt;
  116. int result;
  117. /* kallsyms not loaded. return NULL */
  118. if (ksyms->sym_cnt <= 0)
  119. return NULL;
  120. while (start < end) {
  121. size_t mid = start + (end - start) / 2;
  122. result = key - ksyms->syms[mid].addr;
  123. if (result < 0)
  124. end = mid;
  125. else if (result > 0)
  126. start = mid + 1;
  127. else
  128. return &ksyms->syms[mid];
  129. }
  130. if (start >= 1 && ksyms->syms[start - 1].addr < key &&
  131. key < ksyms->syms[start].addr)
  132. /* valid ksym */
  133. return &ksyms->syms[start - 1];
  134. /* out of range. return _stext */
  135. return &ksyms->syms[0];
  136. }
  137. struct ksym *search_kallsyms_custom_local(struct ksyms *ksyms, const void *p,
  138. ksym_search_cmp_t cmp_cb)
  139. {
  140. int start = 0, mid, end = ksyms->sym_cnt;
  141. struct ksym *ks;
  142. int result;
  143. while (start < end) {
  144. mid = start + (end - start) / 2;
  145. ks = &ksyms->syms[mid];
  146. result = cmp_cb(p, ks);
  147. if (result < 0)
  148. end = mid;
  149. else if (result > 0)
  150. start = mid + 1;
  151. else
  152. return ks;
  153. }
  154. return NULL;
  155. }
  156. struct ksym *ksym_search(long key)
  157. {
  158. if (!ksyms)
  159. return NULL;
  160. return ksym_search_local(ksyms, key);
  161. }
  162. long ksym_get_addr_local(struct ksyms *ksyms, const char *name)
  163. {
  164. int i;
  165. for (i = 0; i < ksyms->sym_cnt; i++) {
  166. if (strcmp(ksyms->syms[i].name, name) == 0)
  167. return ksyms->syms[i].addr;
  168. }
  169. return 0;
  170. }
  171. long ksym_get_addr(const char *name)
  172. {
  173. if (!ksyms)
  174. return 0;
  175. return ksym_get_addr_local(ksyms, name);
  176. }
  177. /* open kallsyms and read symbol addresses on the fly. Without caching all symbols,
  178. * this is faster than load + find.
  179. */
  180. int kallsyms_find(const char *sym, unsigned long long *addr)
  181. {
  182. char type, name[500], *match;
  183. unsigned long long value;
  184. int err = 0;
  185. FILE *f;
  186. f = fopen("/proc/kallsyms", "r");
  187. if (!f)
  188. return -EINVAL;
  189. while (fscanf(f, "%llx %c %499s%*[^\n]\n", &value, &type, name) > 0) {
  190. /* If CONFIG_LTO_CLANG_THIN is enabled, static variable/function
  191. * symbols could be promoted to global due to cross-file inlining.
  192. * For such cases, clang compiler will add .llvm.<hash> suffix
  193. * to those symbols to avoid potential naming conflict.
  194. * Let us ignore .llvm.<hash> suffix during symbol comparison.
  195. */
  196. if (type == 'd') {
  197. match = strstr(name, ".llvm.");
  198. if (match)
  199. *match = '\0';
  200. }
  201. if (strcmp(name, sym) == 0) {
  202. *addr = value;
  203. goto out;
  204. }
  205. }
  206. err = -ENOENT;
  207. out:
  208. fclose(f);
  209. return err;
  210. }
  211. #ifdef PROCMAP_QUERY
  212. int env_verbosity __weak = 0;
  213. static int procmap_query(int fd, const void *addr, __u32 query_flags, size_t *start, size_t *offset, int *flags)
  214. {
  215. char path_buf[PATH_MAX], build_id_buf[20];
  216. struct procmap_query q;
  217. int err;
  218. memset(&q, 0, sizeof(q));
  219. q.size = sizeof(q);
  220. q.query_flags = query_flags;
  221. q.query_addr = (__u64)addr;
  222. q.vma_name_addr = (__u64)path_buf;
  223. q.vma_name_size = sizeof(path_buf);
  224. q.build_id_addr = (__u64)build_id_buf;
  225. q.build_id_size = sizeof(build_id_buf);
  226. err = ioctl(fd, PROCMAP_QUERY, &q);
  227. if (err < 0) {
  228. err = -errno;
  229. if (err == -ENOTTY)
  230. return -EOPNOTSUPP; /* ioctl() not implemented yet */
  231. if (err == -ENOENT)
  232. return -ESRCH; /* vma not found */
  233. return err;
  234. }
  235. if (env_verbosity >= 1) {
  236. printf("VMA FOUND (addr %08lx): %08lx-%08lx %c%c%c%c %08lx %02x:%02x %ld %s (build ID: %s, %d bytes)\n",
  237. (long)addr, (long)q.vma_start, (long)q.vma_end,
  238. (q.vma_flags & PROCMAP_QUERY_VMA_READABLE) ? 'r' : '-',
  239. (q.vma_flags & PROCMAP_QUERY_VMA_WRITABLE) ? 'w' : '-',
  240. (q.vma_flags & PROCMAP_QUERY_VMA_EXECUTABLE) ? 'x' : '-',
  241. (q.vma_flags & PROCMAP_QUERY_VMA_SHARED) ? 's' : 'p',
  242. (long)q.vma_offset, q.dev_major, q.dev_minor, (long)q.inode,
  243. q.vma_name_size ? path_buf : "",
  244. q.build_id_size ? "YES" : "NO",
  245. q.build_id_size);
  246. }
  247. *start = q.vma_start;
  248. *offset = q.vma_offset;
  249. *flags = q.vma_flags;
  250. return 0;
  251. }
  252. #else
  253. # ifndef PROCMAP_QUERY_VMA_EXECUTABLE
  254. # define PROCMAP_QUERY_VMA_EXECUTABLE 0x04
  255. # endif
  256. static int procmap_query(int fd, const void *addr, __u32 query_flags, size_t *start, size_t *offset, int *flags)
  257. {
  258. return -EOPNOTSUPP;
  259. }
  260. #endif
  261. ssize_t get_uprobe_offset(const void *addr)
  262. {
  263. size_t start, base, end;
  264. FILE *f;
  265. char buf[256];
  266. int err, flags;
  267. f = fopen("/proc/self/maps", "r");
  268. if (!f)
  269. return -errno;
  270. /* requested executable VMA only */
  271. err = procmap_query(fileno(f), addr, PROCMAP_QUERY_VMA_EXECUTABLE, &start, &base, &flags);
  272. if (err == -EOPNOTSUPP) {
  273. bool found = false;
  274. while (fscanf(f, "%zx-%zx %s %zx %*[^\n]\n", &start, &end, buf, &base) == 4) {
  275. if (buf[2] == 'x' && (uintptr_t)addr >= start && (uintptr_t)addr < end) {
  276. found = true;
  277. break;
  278. }
  279. }
  280. if (!found) {
  281. fclose(f);
  282. return -ESRCH;
  283. }
  284. } else if (err) {
  285. fclose(f);
  286. return err;
  287. }
  288. fclose(f);
  289. #if defined(__powerpc64__) && defined(_CALL_ELF) && _CALL_ELF == 2
  290. #define OP_RT_RA_MASK 0xffff0000UL
  291. #define LIS_R2 0x3c400000UL
  292. #define ADDIS_R2_R12 0x3c4c0000UL
  293. #define ADDI_R2_R2 0x38420000UL
  294. /*
  295. * A PPC64 ABIv2 function may have a local and a global entry
  296. * point. We need to use the local entry point when patching
  297. * functions, so identify and step over the global entry point
  298. * sequence.
  299. *
  300. * The global entry point sequence is always of the form:
  301. *
  302. * addis r2,r12,XXXX
  303. * addi r2,r2,XXXX
  304. *
  305. * A linker optimisation may convert the addis to lis:
  306. *
  307. * lis r2,XXXX
  308. * addi r2,r2,XXXX
  309. */
  310. {
  311. const __u32 *insn = (const __u32 *)(uintptr_t)addr;
  312. if ((((*insn & OP_RT_RA_MASK) == ADDIS_R2_R12) ||
  313. ((*insn & OP_RT_RA_MASK) == LIS_R2)) &&
  314. ((*(insn + 1) & OP_RT_RA_MASK) == ADDI_R2_R2))
  315. return (uintptr_t)(insn + 2) - start + base;
  316. }
  317. #endif
  318. return (uintptr_t)addr - start + base;
  319. }
  320. ssize_t get_rel_offset(uintptr_t addr)
  321. {
  322. size_t start, end, offset;
  323. char buf[256];
  324. FILE *f;
  325. int err, flags;
  326. f = fopen("/proc/self/maps", "r");
  327. if (!f)
  328. return -errno;
  329. err = procmap_query(fileno(f), (const void *)addr, 0, &start, &offset, &flags);
  330. if (err == 0) {
  331. fclose(f);
  332. return (size_t)addr - start + offset;
  333. } else if (err != -EOPNOTSUPP) {
  334. fclose(f);
  335. return err;
  336. } else if (err) {
  337. while (fscanf(f, "%zx-%zx %s %zx %*[^\n]\n", &start, &end, buf, &offset) == 4) {
  338. if (addr >= start && addr < end) {
  339. fclose(f);
  340. return (size_t)addr - start + offset;
  341. }
  342. }
  343. }
  344. fclose(f);
  345. return -EINVAL;
  346. }
  347. static int
  348. parse_build_id_buf(const void *note_start, Elf32_Word note_size, char *build_id)
  349. {
  350. Elf32_Word note_offs = 0;
  351. while (note_offs + sizeof(Elf32_Nhdr) < note_size) {
  352. Elf32_Nhdr *nhdr = (Elf32_Nhdr *)(note_start + note_offs);
  353. if (nhdr->n_type == 3 && nhdr->n_namesz == sizeof("GNU") &&
  354. !strcmp((char *)(nhdr + 1), "GNU") && nhdr->n_descsz > 0 &&
  355. nhdr->n_descsz <= BPF_BUILD_ID_SIZE) {
  356. memcpy(build_id, note_start + note_offs +
  357. ALIGN(sizeof("GNU"), 4) + sizeof(Elf32_Nhdr), nhdr->n_descsz);
  358. memset(build_id + nhdr->n_descsz, 0, BPF_BUILD_ID_SIZE - nhdr->n_descsz);
  359. return (int) nhdr->n_descsz;
  360. }
  361. note_offs = note_offs + sizeof(Elf32_Nhdr) +
  362. ALIGN(nhdr->n_namesz, 4) + ALIGN(nhdr->n_descsz, 4);
  363. }
  364. return -ENOENT;
  365. }
  366. /* Reads binary from *path* file and returns it in the *build_id* buffer
  367. * with *size* which is expected to be at least BPF_BUILD_ID_SIZE bytes.
  368. * Returns size of build id on success. On error the error value is
  369. * returned.
  370. */
  371. int read_build_id(const char *path, char *build_id, size_t size)
  372. {
  373. int fd, err = -EINVAL;
  374. Elf *elf = NULL;
  375. GElf_Ehdr ehdr;
  376. size_t max, i;
  377. if (size < BPF_BUILD_ID_SIZE)
  378. return -EINVAL;
  379. fd = open(path, O_RDONLY | O_CLOEXEC);
  380. if (fd < 0)
  381. return -errno;
  382. (void)elf_version(EV_CURRENT);
  383. elf = elf_begin(fd, ELF_C_READ_MMAP, NULL);
  384. if (!elf)
  385. goto out;
  386. if (elf_kind(elf) != ELF_K_ELF)
  387. goto out;
  388. if (!gelf_getehdr(elf, &ehdr))
  389. goto out;
  390. for (i = 0; i < ehdr.e_phnum; i++) {
  391. GElf_Phdr mem, *phdr;
  392. char *data;
  393. phdr = gelf_getphdr(elf, i, &mem);
  394. if (!phdr)
  395. goto out;
  396. if (phdr->p_type != PT_NOTE)
  397. continue;
  398. data = elf_rawfile(elf, &max);
  399. if (!data)
  400. goto out;
  401. if (phdr->p_offset + phdr->p_memsz > max)
  402. goto out;
  403. err = parse_build_id_buf(data + phdr->p_offset, phdr->p_memsz, build_id);
  404. if (err > 0)
  405. break;
  406. }
  407. out:
  408. if (elf)
  409. elf_end(elf);
  410. close(fd);
  411. return err;
  412. }
  413. int read_trace_pipe_iter(void (*cb)(const char *str, void *data), void *data, int iter)
  414. {
  415. size_t buflen, n;
  416. char *buf = NULL;
  417. FILE *fp = NULL;
  418. if (access(TRACEFS_PIPE, F_OK) == 0)
  419. fp = fopen(TRACEFS_PIPE, "r");
  420. else
  421. fp = fopen(DEBUGFS_PIPE, "r");
  422. if (!fp)
  423. return -1;
  424. /* We do not want to wait forever when iter is specified. */
  425. if (iter)
  426. fcntl(fileno(fp), F_SETFL, O_NONBLOCK);
  427. while ((n = getline(&buf, &buflen, fp) >= 0) || errno == EAGAIN) {
  428. if (n > 0)
  429. cb(buf, data);
  430. if (iter && !(--iter))
  431. break;
  432. }
  433. free(buf);
  434. if (fp)
  435. fclose(fp);
  436. return 0;
  437. }
  438. static void trace_pipe_cb(const char *str, void *data)
  439. {
  440. printf("%s", str);
  441. }
  442. void read_trace_pipe(void)
  443. {
  444. read_trace_pipe_iter(trace_pipe_cb, NULL, 0);
  445. }