trace_helpers.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211
  1. // SPDX-License-Identifier: GPL-2.0
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4. #include <string.h>
  5. #include <assert.h>
  6. #include <errno.h>
  7. #include <poll.h>
  8. #include <unistd.h>
  9. #include <linux/perf_event.h>
  10. #include <sys/mman.h>
  11. #include "trace_helpers.h"
  12. #define MAX_SYMS 300000
  13. static struct ksym syms[MAX_SYMS];
  14. static int sym_cnt;
  15. static int ksym_cmp(const void *p1, const void *p2)
  16. {
  17. return ((struct ksym *)p1)->addr - ((struct ksym *)p2)->addr;
  18. }
  19. int load_kallsyms(void)
  20. {
  21. FILE *f = fopen("/proc/kallsyms", "r");
  22. char func[256], buf[256];
  23. char symbol;
  24. void *addr;
  25. int i = 0;
  26. if (!f)
  27. return -ENOENT;
  28. while (!feof(f)) {
  29. if (!fgets(buf, sizeof(buf), f))
  30. break;
  31. if (sscanf(buf, "%p %c %s", &addr, &symbol, func) != 3)
  32. break;
  33. if (!addr)
  34. continue;
  35. syms[i].addr = (long) addr;
  36. syms[i].name = strdup(func);
  37. i++;
  38. }
  39. fclose(f);
  40. sym_cnt = i;
  41. qsort(syms, sym_cnt, sizeof(struct ksym), ksym_cmp);
  42. return 0;
  43. }
  44. struct ksym *ksym_search(long key)
  45. {
  46. int start = 0, end = sym_cnt;
  47. int result;
  48. while (start < end) {
  49. size_t mid = start + (end - start) / 2;
  50. result = key - syms[mid].addr;
  51. if (result < 0)
  52. end = mid;
  53. else if (result > 0)
  54. start = mid + 1;
  55. else
  56. return &syms[mid];
  57. }
  58. if (start >= 1 && syms[start - 1].addr < key &&
  59. key < syms[start].addr)
  60. /* valid ksym */
  61. return &syms[start - 1];
  62. /* out of range. return _stext */
  63. return &syms[0];
  64. }
  65. long ksym_get_addr(const char *name)
  66. {
  67. int i;
  68. for (i = 0; i < sym_cnt; i++) {
  69. if (strcmp(syms[i].name, name) == 0)
  70. return syms[i].addr;
  71. }
  72. return 0;
  73. }
  74. static int page_size;
  75. static int page_cnt = 8;
  76. static struct perf_event_mmap_page *header;
  77. int perf_event_mmap_header(int fd, struct perf_event_mmap_page **header)
  78. {
  79. void *base;
  80. int mmap_size;
  81. page_size = getpagesize();
  82. mmap_size = page_size * (page_cnt + 1);
  83. base = mmap(NULL, mmap_size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
  84. if (base == MAP_FAILED) {
  85. printf("mmap err\n");
  86. return -1;
  87. }
  88. *header = base;
  89. return 0;
  90. }
  91. int perf_event_mmap(int fd)
  92. {
  93. return perf_event_mmap_header(fd, &header);
  94. }
  95. static int perf_event_poll(int fd)
  96. {
  97. struct pollfd pfd = { .fd = fd, .events = POLLIN };
  98. return poll(&pfd, 1, 1000);
  99. }
  100. struct perf_event_sample {
  101. struct perf_event_header header;
  102. __u32 size;
  103. char data[];
  104. };
  105. static enum bpf_perf_event_ret
  106. bpf_perf_event_print(struct perf_event_header *hdr, void *private_data)
  107. {
  108. struct perf_event_sample *e = (struct perf_event_sample *)hdr;
  109. perf_event_print_fn fn = private_data;
  110. int ret;
  111. if (e->header.type == PERF_RECORD_SAMPLE) {
  112. ret = fn(e->data, e->size);
  113. if (ret != LIBBPF_PERF_EVENT_CONT)
  114. return ret;
  115. } else if (e->header.type == PERF_RECORD_LOST) {
  116. struct {
  117. struct perf_event_header header;
  118. __u64 id;
  119. __u64 lost;
  120. } *lost = (void *) e;
  121. printf("lost %lld events\n", lost->lost);
  122. } else {
  123. printf("unknown event type=%d size=%d\n",
  124. e->header.type, e->header.size);
  125. }
  126. return LIBBPF_PERF_EVENT_CONT;
  127. }
  128. int perf_event_poller(int fd, perf_event_print_fn output_fn)
  129. {
  130. enum bpf_perf_event_ret ret;
  131. void *buf = NULL;
  132. size_t len = 0;
  133. for (;;) {
  134. perf_event_poll(fd);
  135. ret = bpf_perf_event_read_simple(header, page_cnt * page_size,
  136. page_size, &buf, &len,
  137. bpf_perf_event_print,
  138. output_fn);
  139. if (ret != LIBBPF_PERF_EVENT_CONT)
  140. break;
  141. }
  142. free(buf);
  143. return ret;
  144. }
  145. int perf_event_poller_multi(int *fds, struct perf_event_mmap_page **headers,
  146. int num_fds, perf_event_print_fn output_fn)
  147. {
  148. enum bpf_perf_event_ret ret;
  149. struct pollfd *pfds;
  150. void *buf = NULL;
  151. size_t len = 0;
  152. int i;
  153. pfds = calloc(num_fds, sizeof(*pfds));
  154. if (!pfds)
  155. return LIBBPF_PERF_EVENT_ERROR;
  156. for (i = 0; i < num_fds; i++) {
  157. pfds[i].fd = fds[i];
  158. pfds[i].events = POLLIN;
  159. }
  160. for (;;) {
  161. poll(pfds, num_fds, 1000);
  162. for (i = 0; i < num_fds; i++) {
  163. if (!pfds[i].revents)
  164. continue;
  165. ret = bpf_perf_event_read_simple(headers[i],
  166. page_cnt * page_size,
  167. page_size, &buf, &len,
  168. bpf_perf_event_print,
  169. output_fn);
  170. if (ret != LIBBPF_PERF_EVENT_CONT)
  171. break;
  172. }
  173. }
  174. free(buf);
  175. free(pfds);
  176. return ret;
  177. }