unwind-libunwind.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689
  1. /*
  2. * Post mortem Dwarf CFI based unwinding on top of regs and stack dumps.
  3. *
  4. * Lots of this code have been borrowed or heavily inspired from parts of
  5. * the libunwind 0.99 code which are (amongst other contributors I may have
  6. * forgotten):
  7. *
  8. * Copyright (C) 2002-2007 Hewlett-Packard Co
  9. * Contributed by David Mosberger-Tang <davidm@hpl.hp.com>
  10. *
  11. * And the bugs have been added by:
  12. *
  13. * Copyright (C) 2010, Frederic Weisbecker <fweisbec@gmail.com>
  14. * Copyright (C) 2012, Jiri Olsa <jolsa@redhat.com>
  15. *
  16. */
  17. #include <elf.h>
  18. #include <gelf.h>
  19. #include <fcntl.h>
  20. #include <string.h>
  21. #include <unistd.h>
  22. #include <sys/mman.h>
  23. #include <linux/list.h>
  24. #include <libunwind.h>
  25. #include <libunwind-ptrace.h>
  26. #include "callchain.h"
  27. #include "thread.h"
  28. #include "session.h"
  29. #include "perf_regs.h"
  30. #include "unwind.h"
  31. #include "symbol.h"
  32. #include "util.h"
  33. #include "debug.h"
  34. extern int
  35. UNW_OBJ(dwarf_search_unwind_table) (unw_addr_space_t as,
  36. unw_word_t ip,
  37. unw_dyn_info_t *di,
  38. unw_proc_info_t *pi,
  39. int need_unwind_info, void *arg);
  40. #define dwarf_search_unwind_table UNW_OBJ(dwarf_search_unwind_table)
  41. extern int
  42. UNW_OBJ(dwarf_find_debug_frame) (int found, unw_dyn_info_t *di_debug,
  43. unw_word_t ip,
  44. unw_word_t segbase,
  45. const char *obj_name, unw_word_t start,
  46. unw_word_t end);
  47. #define dwarf_find_debug_frame UNW_OBJ(dwarf_find_debug_frame)
  48. #define DW_EH_PE_FORMAT_MASK 0x0f /* format of the encoded value */
  49. #define DW_EH_PE_APPL_MASK 0x70 /* how the value is to be applied */
  50. /* Pointer-encoding formats: */
  51. #define DW_EH_PE_omit 0xff
  52. #define DW_EH_PE_ptr 0x00 /* pointer-sized unsigned value */
  53. #define DW_EH_PE_udata4 0x03 /* unsigned 32-bit value */
  54. #define DW_EH_PE_udata8 0x04 /* unsigned 64-bit value */
  55. #define DW_EH_PE_sdata4 0x0b /* signed 32-bit value */
  56. #define DW_EH_PE_sdata8 0x0c /* signed 64-bit value */
  57. /* Pointer-encoding application: */
  58. #define DW_EH_PE_absptr 0x00 /* absolute value */
  59. #define DW_EH_PE_pcrel 0x10 /* rel. to addr. of encoded value */
  60. /*
  61. * The following are not documented by LSB v1.3, yet they are used by
  62. * GCC, presumably they aren't documented by LSB since they aren't
  63. * used on Linux:
  64. */
  65. #define DW_EH_PE_funcrel 0x40 /* start-of-procedure-relative */
  66. #define DW_EH_PE_aligned 0x50 /* aligned pointer */
  67. /* Flags intentionaly not handled, since they're not needed:
  68. * #define DW_EH_PE_indirect 0x80
  69. * #define DW_EH_PE_uleb128 0x01
  70. * #define DW_EH_PE_udata2 0x02
  71. * #define DW_EH_PE_sleb128 0x09
  72. * #define DW_EH_PE_sdata2 0x0a
  73. * #define DW_EH_PE_textrel 0x20
  74. * #define DW_EH_PE_datarel 0x30
  75. */
  76. struct unwind_info {
  77. struct perf_sample *sample;
  78. struct machine *machine;
  79. struct thread *thread;
  80. };
  81. #define dw_read(ptr, type, end) ({ \
  82. type *__p = (type *) ptr; \
  83. type __v; \
  84. if ((__p + 1) > (type *) end) \
  85. return -EINVAL; \
  86. __v = *__p++; \
  87. ptr = (typeof(ptr)) __p; \
  88. __v; \
  89. })
  90. static int __dw_read_encoded_value(u8 **p, u8 *end, u64 *val,
  91. u8 encoding)
  92. {
  93. u8 *cur = *p;
  94. *val = 0;
  95. switch (encoding) {
  96. case DW_EH_PE_omit:
  97. *val = 0;
  98. goto out;
  99. case DW_EH_PE_ptr:
  100. *val = dw_read(cur, unsigned long, end);
  101. goto out;
  102. default:
  103. break;
  104. }
  105. switch (encoding & DW_EH_PE_APPL_MASK) {
  106. case DW_EH_PE_absptr:
  107. break;
  108. case DW_EH_PE_pcrel:
  109. *val = (unsigned long) cur;
  110. break;
  111. default:
  112. return -EINVAL;
  113. }
  114. if ((encoding & 0x07) == 0x00)
  115. encoding |= DW_EH_PE_udata4;
  116. switch (encoding & DW_EH_PE_FORMAT_MASK) {
  117. case DW_EH_PE_sdata4:
  118. *val += dw_read(cur, s32, end);
  119. break;
  120. case DW_EH_PE_udata4:
  121. *val += dw_read(cur, u32, end);
  122. break;
  123. case DW_EH_PE_sdata8:
  124. *val += dw_read(cur, s64, end);
  125. break;
  126. case DW_EH_PE_udata8:
  127. *val += dw_read(cur, u64, end);
  128. break;
  129. default:
  130. return -EINVAL;
  131. }
  132. out:
  133. *p = cur;
  134. return 0;
  135. }
  136. #define dw_read_encoded_value(ptr, end, enc) ({ \
  137. u64 __v; \
  138. if (__dw_read_encoded_value(&ptr, end, &__v, enc)) { \
  139. return -EINVAL; \
  140. } \
  141. __v; \
  142. })
  143. static u64 elf_section_offset(int fd, const char *name)
  144. {
  145. Elf *elf;
  146. GElf_Ehdr ehdr;
  147. GElf_Shdr shdr;
  148. u64 offset = 0;
  149. elf = elf_begin(fd, PERF_ELF_C_READ_MMAP, NULL);
  150. if (elf == NULL)
  151. return 0;
  152. do {
  153. if (gelf_getehdr(elf, &ehdr) == NULL)
  154. break;
  155. if (!elf_section_by_name(elf, &ehdr, &shdr, name, NULL))
  156. break;
  157. offset = shdr.sh_offset;
  158. } while (0);
  159. elf_end(elf);
  160. return offset;
  161. }
  162. #ifndef NO_LIBUNWIND_DEBUG_FRAME
  163. static int elf_is_exec(int fd, const char *name)
  164. {
  165. Elf *elf;
  166. GElf_Ehdr ehdr;
  167. int retval = 0;
  168. elf = elf_begin(fd, PERF_ELF_C_READ_MMAP, NULL);
  169. if (elf == NULL)
  170. return 0;
  171. if (gelf_getehdr(elf, &ehdr) == NULL)
  172. goto out;
  173. retval = (ehdr.e_type == ET_EXEC);
  174. out:
  175. elf_end(elf);
  176. pr_debug("unwind: elf_is_exec(%s): %d\n", name, retval);
  177. return retval;
  178. }
  179. #endif
  180. struct table_entry {
  181. u32 start_ip_offset;
  182. u32 fde_offset;
  183. };
  184. struct eh_frame_hdr {
  185. unsigned char version;
  186. unsigned char eh_frame_ptr_enc;
  187. unsigned char fde_count_enc;
  188. unsigned char table_enc;
  189. /*
  190. * The rest of the header is variable-length and consists of the
  191. * following members:
  192. *
  193. * encoded_t eh_frame_ptr;
  194. * encoded_t fde_count;
  195. */
  196. /* A single encoded pointer should not be more than 8 bytes. */
  197. u64 enc[2];
  198. /*
  199. * struct {
  200. * encoded_t start_ip;
  201. * encoded_t fde_addr;
  202. * } binary_search_table[fde_count];
  203. */
  204. char data[0];
  205. } __packed;
  206. static int unwind_spec_ehframe(struct dso *dso, struct machine *machine,
  207. u64 offset, u64 *table_data, u64 *segbase,
  208. u64 *fde_count)
  209. {
  210. struct eh_frame_hdr hdr;
  211. u8 *enc = (u8 *) &hdr.enc;
  212. u8 *end = (u8 *) &hdr.data;
  213. ssize_t r;
  214. r = dso__data_read_offset(dso, machine, offset,
  215. (u8 *) &hdr, sizeof(hdr));
  216. if (r != sizeof(hdr))
  217. return -EINVAL;
  218. /* We dont need eh_frame_ptr, just skip it. */
  219. dw_read_encoded_value(enc, end, hdr.eh_frame_ptr_enc);
  220. *fde_count = dw_read_encoded_value(enc, end, hdr.fde_count_enc);
  221. *segbase = offset;
  222. *table_data = (enc - (u8 *) &hdr) + offset;
  223. return 0;
  224. }
  225. static int read_unwind_spec_eh_frame(struct dso *dso, struct machine *machine,
  226. u64 *table_data, u64 *segbase,
  227. u64 *fde_count)
  228. {
  229. int ret = -EINVAL, fd;
  230. u64 offset = dso->data.eh_frame_hdr_offset;
  231. if (offset == 0) {
  232. fd = dso__data_get_fd(dso, machine);
  233. if (fd < 0)
  234. return -EINVAL;
  235. /* Check the .eh_frame section for unwinding info */
  236. offset = elf_section_offset(fd, ".eh_frame_hdr");
  237. dso->data.eh_frame_hdr_offset = offset;
  238. dso__data_put_fd(dso);
  239. }
  240. if (offset)
  241. ret = unwind_spec_ehframe(dso, machine, offset,
  242. table_data, segbase,
  243. fde_count);
  244. return ret;
  245. }
  246. #ifndef NO_LIBUNWIND_DEBUG_FRAME
  247. static int read_unwind_spec_debug_frame(struct dso *dso,
  248. struct machine *machine, u64 *offset)
  249. {
  250. int fd;
  251. u64 ofs = dso->data.debug_frame_offset;
  252. if (ofs == 0) {
  253. fd = dso__data_get_fd(dso, machine);
  254. if (fd < 0)
  255. return -EINVAL;
  256. /* Check the .debug_frame section for unwinding info */
  257. ofs = elf_section_offset(fd, ".debug_frame");
  258. dso->data.debug_frame_offset = ofs;
  259. dso__data_put_fd(dso);
  260. }
  261. *offset = ofs;
  262. if (*offset)
  263. return 0;
  264. return -EINVAL;
  265. }
  266. #endif
  267. static struct map *find_map(unw_word_t ip, struct unwind_info *ui)
  268. {
  269. struct addr_location al;
  270. thread__find_addr_map(ui->thread, PERF_RECORD_MISC_USER,
  271. MAP__FUNCTION, ip, &al);
  272. if (!al.map) {
  273. /*
  274. * We've seen cases (softice) where DWARF unwinder went
  275. * through non executable mmaps, which we need to lookup
  276. * in MAP__VARIABLE tree.
  277. */
  278. thread__find_addr_map(ui->thread, PERF_RECORD_MISC_USER,
  279. MAP__VARIABLE, ip, &al);
  280. }
  281. return al.map;
  282. }
  283. static int
  284. find_proc_info(unw_addr_space_t as, unw_word_t ip, unw_proc_info_t *pi,
  285. int need_unwind_info, void *arg)
  286. {
  287. struct unwind_info *ui = arg;
  288. struct map *map;
  289. unw_dyn_info_t di;
  290. u64 table_data, segbase, fde_count;
  291. int ret = -EINVAL;
  292. map = find_map(ip, ui);
  293. if (!map || !map->dso)
  294. return -EINVAL;
  295. pr_debug("unwind: find_proc_info dso %s\n", map->dso->name);
  296. /* Check the .eh_frame section for unwinding info */
  297. if (!read_unwind_spec_eh_frame(map->dso, ui->machine,
  298. &table_data, &segbase, &fde_count)) {
  299. memset(&di, 0, sizeof(di));
  300. di.format = UNW_INFO_FORMAT_REMOTE_TABLE;
  301. di.start_ip = map->start;
  302. di.end_ip = map->end;
  303. di.u.rti.segbase = map->start + segbase;
  304. di.u.rti.table_data = map->start + table_data;
  305. di.u.rti.table_len = fde_count * sizeof(struct table_entry)
  306. / sizeof(unw_word_t);
  307. ret = dwarf_search_unwind_table(as, ip, &di, pi,
  308. need_unwind_info, arg);
  309. }
  310. #ifndef NO_LIBUNWIND_DEBUG_FRAME
  311. /* Check the .debug_frame section for unwinding info */
  312. if (ret < 0 &&
  313. !read_unwind_spec_debug_frame(map->dso, ui->machine, &segbase)) {
  314. int fd = dso__data_get_fd(map->dso, ui->machine);
  315. int is_exec = elf_is_exec(fd, map->dso->name);
  316. unw_word_t base = is_exec ? 0 : map->start;
  317. const char *symfile;
  318. if (fd >= 0)
  319. dso__data_put_fd(map->dso);
  320. symfile = map->dso->symsrc_filename ?: map->dso->name;
  321. memset(&di, 0, sizeof(di));
  322. if (dwarf_find_debug_frame(0, &di, ip, base, symfile,
  323. map->start, map->end))
  324. return dwarf_search_unwind_table(as, ip, &di, pi,
  325. need_unwind_info, arg);
  326. }
  327. #endif
  328. return ret;
  329. }
  330. static int access_fpreg(unw_addr_space_t __maybe_unused as,
  331. unw_regnum_t __maybe_unused num,
  332. unw_fpreg_t __maybe_unused *val,
  333. int __maybe_unused __write,
  334. void __maybe_unused *arg)
  335. {
  336. pr_err("unwind: access_fpreg unsupported\n");
  337. return -UNW_EINVAL;
  338. }
  339. static int get_dyn_info_list_addr(unw_addr_space_t __maybe_unused as,
  340. unw_word_t __maybe_unused *dil_addr,
  341. void __maybe_unused *arg)
  342. {
  343. return -UNW_ENOINFO;
  344. }
  345. static int resume(unw_addr_space_t __maybe_unused as,
  346. unw_cursor_t __maybe_unused *cu,
  347. void __maybe_unused *arg)
  348. {
  349. pr_err("unwind: resume unsupported\n");
  350. return -UNW_EINVAL;
  351. }
  352. static int
  353. get_proc_name(unw_addr_space_t __maybe_unused as,
  354. unw_word_t __maybe_unused addr,
  355. char __maybe_unused *bufp, size_t __maybe_unused buf_len,
  356. unw_word_t __maybe_unused *offp, void __maybe_unused *arg)
  357. {
  358. pr_err("unwind: get_proc_name unsupported\n");
  359. return -UNW_EINVAL;
  360. }
  361. static int access_dso_mem(struct unwind_info *ui, unw_word_t addr,
  362. unw_word_t *data)
  363. {
  364. struct map *map;
  365. ssize_t size;
  366. map = find_map(addr, ui);
  367. if (!map) {
  368. pr_debug("unwind: no map for %lx\n", (unsigned long)addr);
  369. return -1;
  370. }
  371. if (!map->dso)
  372. return -1;
  373. size = dso__data_read_addr(map->dso, map, ui->machine,
  374. addr, (u8 *) data, sizeof(*data));
  375. return !(size == sizeof(*data));
  376. }
  377. static int access_mem(unw_addr_space_t __maybe_unused as,
  378. unw_word_t addr, unw_word_t *valp,
  379. int __write, void *arg)
  380. {
  381. struct unwind_info *ui = arg;
  382. struct stack_dump *stack = &ui->sample->user_stack;
  383. u64 start, end;
  384. int offset;
  385. int ret;
  386. /* Don't support write, probably not needed. */
  387. if (__write || !stack || !ui->sample->user_regs.regs) {
  388. *valp = 0;
  389. return 0;
  390. }
  391. ret = perf_reg_value(&start, &ui->sample->user_regs, PERF_REG_SP);
  392. if (ret)
  393. return ret;
  394. end = start + stack->size;
  395. /* Check overflow. */
  396. if (addr + sizeof(unw_word_t) < addr)
  397. return -EINVAL;
  398. if (addr < start || addr + sizeof(unw_word_t) >= end) {
  399. ret = access_dso_mem(ui, addr, valp);
  400. if (ret) {
  401. pr_debug("unwind: access_mem %p not inside range"
  402. " 0x%" PRIx64 "-0x%" PRIx64 "\n",
  403. (void *) (uintptr_t) addr, start, end);
  404. *valp = 0;
  405. return ret;
  406. }
  407. return 0;
  408. }
  409. offset = addr - start;
  410. *valp = *(unw_word_t *)&stack->data[offset];
  411. pr_debug("unwind: access_mem addr %p val %lx, offset %d\n",
  412. (void *) (uintptr_t) addr, (unsigned long)*valp, offset);
  413. return 0;
  414. }
  415. static int access_reg(unw_addr_space_t __maybe_unused as,
  416. unw_regnum_t regnum, unw_word_t *valp,
  417. int __write, void *arg)
  418. {
  419. struct unwind_info *ui = arg;
  420. int id, ret;
  421. u64 val;
  422. /* Don't support write, I suspect we don't need it. */
  423. if (__write) {
  424. pr_err("unwind: access_reg w %d\n", regnum);
  425. return 0;
  426. }
  427. if (!ui->sample->user_regs.regs) {
  428. *valp = 0;
  429. return 0;
  430. }
  431. id = libunwind__arch_reg_id(regnum);
  432. if (id < 0)
  433. return -EINVAL;
  434. ret = perf_reg_value(&val, &ui->sample->user_regs, id);
  435. if (ret) {
  436. pr_err("unwind: can't read reg %d\n", regnum);
  437. return ret;
  438. }
  439. *valp = (unw_word_t) val;
  440. pr_debug("unwind: reg %d, val %lx\n", regnum, (unsigned long)*valp);
  441. return 0;
  442. }
  443. static void put_unwind_info(unw_addr_space_t __maybe_unused as,
  444. unw_proc_info_t *pi __maybe_unused,
  445. void *arg __maybe_unused)
  446. {
  447. pr_debug("unwind: put_unwind_info called\n");
  448. }
  449. static int entry(u64 ip, struct thread *thread,
  450. unwind_entry_cb_t cb, void *arg)
  451. {
  452. struct unwind_entry e;
  453. struct addr_location al;
  454. thread__find_addr_location(thread, PERF_RECORD_MISC_USER,
  455. MAP__FUNCTION, ip, &al);
  456. e.ip = ip;
  457. e.map = al.map;
  458. e.sym = al.sym;
  459. pr_debug("unwind: %s:ip = 0x%" PRIx64 " (0x%" PRIx64 ")\n",
  460. al.sym ? al.sym->name : "''",
  461. ip,
  462. al.map ? al.map->map_ip(al.map, ip) : (u64) 0);
  463. return cb(&e, arg);
  464. }
  465. static void display_error(int err)
  466. {
  467. switch (err) {
  468. case UNW_EINVAL:
  469. pr_err("unwind: Only supports local.\n");
  470. break;
  471. case UNW_EUNSPEC:
  472. pr_err("unwind: Unspecified error.\n");
  473. break;
  474. case UNW_EBADREG:
  475. pr_err("unwind: Register unavailable.\n");
  476. break;
  477. default:
  478. break;
  479. }
  480. }
  481. static unw_accessors_t accessors = {
  482. .find_proc_info = find_proc_info,
  483. .put_unwind_info = put_unwind_info,
  484. .get_dyn_info_list_addr = get_dyn_info_list_addr,
  485. .access_mem = access_mem,
  486. .access_reg = access_reg,
  487. .access_fpreg = access_fpreg,
  488. .resume = resume,
  489. .get_proc_name = get_proc_name,
  490. };
  491. int unwind__prepare_access(struct thread *thread)
  492. {
  493. unw_addr_space_t addr_space;
  494. if (callchain_param.record_mode != CALLCHAIN_DWARF)
  495. return 0;
  496. addr_space = unw_create_addr_space(&accessors, 0);
  497. if (!addr_space) {
  498. pr_err("unwind: Can't create unwind address space.\n");
  499. return -ENOMEM;
  500. }
  501. unw_set_caching_policy(addr_space, UNW_CACHE_GLOBAL);
  502. thread__set_priv(thread, addr_space);
  503. return 0;
  504. }
  505. void unwind__flush_access(struct thread *thread)
  506. {
  507. unw_addr_space_t addr_space;
  508. if (callchain_param.record_mode != CALLCHAIN_DWARF)
  509. return;
  510. addr_space = thread__priv(thread);
  511. unw_flush_cache(addr_space, 0, 0);
  512. }
  513. void unwind__finish_access(struct thread *thread)
  514. {
  515. unw_addr_space_t addr_space;
  516. if (callchain_param.record_mode != CALLCHAIN_DWARF)
  517. return;
  518. addr_space = thread__priv(thread);
  519. unw_destroy_addr_space(addr_space);
  520. }
  521. static int get_entries(struct unwind_info *ui, unwind_entry_cb_t cb,
  522. void *arg, int max_stack)
  523. {
  524. u64 val;
  525. unw_word_t ips[max_stack];
  526. unw_addr_space_t addr_space;
  527. unw_cursor_t c;
  528. int ret, i = 0;
  529. ret = perf_reg_value(&val, &ui->sample->user_regs, PERF_REG_IP);
  530. if (ret)
  531. return ret;
  532. ips[i++] = (unw_word_t) val;
  533. /*
  534. * If we need more than one entry, do the DWARF
  535. * unwind itself.
  536. */
  537. if (max_stack - 1 > 0) {
  538. addr_space = thread__priv(ui->thread);
  539. if (addr_space == NULL)
  540. return -1;
  541. ret = unw_init_remote(&c, addr_space, ui);
  542. if (ret)
  543. display_error(ret);
  544. while (!ret && (unw_step(&c) > 0) && i < max_stack) {
  545. unw_get_reg(&c, UNW_REG_IP, &ips[i]);
  546. ++i;
  547. }
  548. max_stack = i;
  549. }
  550. /*
  551. * Display what we got based on the order setup.
  552. */
  553. for (i = 0; i < max_stack && !ret; i++) {
  554. int j = i;
  555. if (callchain_param.order == ORDER_CALLER)
  556. j = max_stack - i - 1;
  557. ret = ips[j] ? entry(ips[j], ui->thread, cb, arg) : 0;
  558. }
  559. return ret;
  560. }
  561. int unwind__get_entries(unwind_entry_cb_t cb, void *arg,
  562. struct thread *thread,
  563. struct perf_sample *data, int max_stack)
  564. {
  565. struct unwind_info ui = {
  566. .sample = data,
  567. .thread = thread,
  568. .machine = thread->mg->machine,
  569. };
  570. if (!data->user_regs.regs)
  571. return -EINVAL;
  572. if (max_stack <= 0)
  573. return -EINVAL;
  574. return get_entries(&ui, cb, arg, max_stack);
  575. }