/* * probe-finder.c : C expression to kprobe event converter * * Written by Masami Hiramatsu * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * */ #include #include #include #include #include #include #include #include #include #include #include #include #include "event.h" #include "debug.h" #include "util.h" #include "probe-finder.h" /* Dwarf_Die Linkage to parent Die */ struct die_link { struct die_link *parent; /* Parent die */ Dwarf_Die die; /* Current die */ }; /* * Generic dwarf analysis helpers */ #define X86_32_MAX_REGS 8 const char *x86_32_regs_table[X86_32_MAX_REGS] = { "%ax", "%cx", "%dx", "%bx", "$stack", /* Stack address instead of %sp */ "%bp", "%si", "%di", }; #define X86_64_MAX_REGS 16 const char *x86_64_regs_table[X86_64_MAX_REGS] = { "%ax", "%dx", "%cx", "%bx", "%si", "%di", "%bp", "%sp", "%r8", "%r9", "%r10", "%r11", "%r12", "%r13", "%r14", "%r15", }; /* TODO: switching by dwarf address size */ #ifdef __x86_64__ #define ARCH_MAX_REGS X86_64_MAX_REGS #define arch_regs_table x86_64_regs_table #else #define ARCH_MAX_REGS X86_32_MAX_REGS #define arch_regs_table x86_32_regs_table #endif /* Return architecture dependent register string (for kprobe-tracer) */ static const char *get_arch_regstr(unsigned int n) { return (n <= ARCH_MAX_REGS) ? arch_regs_table[n] : NULL; } /* * Compare the tail of two strings. * Return 0 if whole of either string is same as another's tail part. */ static int strtailcmp(const char *s1, const char *s2) { int i1 = strlen(s1); int i2 = strlen(s2); while (--i1 >= 0 && --i2 >= 0) { if (s1[i1] != s2[i2]) return s1[i1] - s2[i2]; } return 0; } /* Find the fileno of the target file. */ static int cu_find_fileno(Dwarf_Die *cu_die, const char *fname) { Dwarf_Files *files; size_t nfiles, i; const char *src; int ret; if (!fname) return -EINVAL; ret = dwarf_getsrcfiles(cu_die, &files, &nfiles); if (ret == 0) { for (i = 0; i < nfiles; i++) { src = dwarf_filesrc(files, i, NULL, NULL); if (strtailcmp(src, fname) == 0) { ret = (int)i; /*???: +1 or not?*/ break; } } if (ret) pr_debug("found fno: %d\n", ret); } return ret; } struct __addr_die_search_param { Dwarf_Addr addr; Dwarf_Die *die_mem; }; static int __die_search_func_cb(Dwarf_Die *fn_die, void *data) { struct __addr_die_search_param *ad = data; if (dwarf_tag(fn_die) == DW_TAG_subprogram && dwarf_haspc(fn_die, ad->addr)) { memcpy(ad->die_mem, fn_die, sizeof(Dwarf_Die)); return DWARF_CB_ABORT; } return DWARF_CB_OK; } /* Search a real subprogram including this line, */ static Dwarf_Die *die_get_real_subprogram(Dwarf_Die *cu_die, Dwarf_Addr addr, Dwarf_Die *die_mem) { struct __addr_die_search_param ad; ad.addr = addr; ad.die_mem = die_mem; /* dwarf_getscopes can't find subprogram. */ if (!dwarf_getfuncs(cu_die, __die_search_func_cb, &ad, 0)) return NULL; else return die_mem; } /* Compare diename and tname */ static bool die_compare_name(Dwarf_Die *dw_die, const char *tname) { const char *name; name = dwarf_diename(dw_die); DIE_IF(name == NULL); return strcmp(tname, name); } /* Check the address is in the subprogram(function). */ static bool die_within_subprogram(Dwarf_Die *sp_die, Dwarf_Addr addr, size_t *offs) { Dwarf_Addr epc; int ret; ret = dwarf_haspc(sp_die, addr); if (ret <= 0) return false; if (offs) { ret = dwarf_entrypc(sp_die, &epc); DIE_IF(ret == -1); *offs = addr - epc; } return true; } /* Get entry pc(or low pc, 1st entry of ranges) of the die */ static Dwarf_Addr die_get_entrypc(Dwarf_Die *dw_die) { Dwarf_Addr epc; int ret; ret = dwarf_entrypc(dw_die, &epc); DIE_IF(ret == -1); return epc; } /* Check if the abstract origin's address or not */ static bool die_compare_abstract_origin(Dwarf_Die *in_die, void *origin_addr) { Dwarf_Attribute attr; Dwarf_Die origin; if (!dwarf_attr(in_die, DW_AT_abstract_origin, &attr)) return false; if (!dwarf_formref_die(&attr, &origin)) return false; return origin.addr == origin_addr; } /* * Search a Die from Die tree. * Note: cur_link->die should be deallocated in this function. */ static int __search_die_tree(struct die_link *cur_link, int (*die_cb)(struct die_link *, void *), void *data) { struct die_link new_link; int ret; if (!die_cb) return 0; /* Check current die */ while (!(ret = die_cb(cur_link, data))) { /* Check child die */ ret = dwarf_child(&cur_link->die, &new_link.die); if (ret == 0) { new_link.parent = cur_link; ret = __search_die_tree(&new_link, die_cb, data); if (ret) break; } /* Move to next sibling */ ret = dwarf_siblingof(&cur_link->die, &cur_link->die); if (ret != 0) return 0; } return ret; } /* Search a die in its children's die tree */ static int search_die_from_children(Dwarf_Die *parent_die, int (*die_cb)(struct die_link *, void *), void *data) { struct die_link new_link; int ret; new_link.parent = NULL; ret = dwarf_child(parent_die, &new_link.die); if (ret == 0) return __search_die_tree(&new_link, die_cb, data); else return 0; } /* * Probe finder related functions */ /* Show a location */ static void show_location(Dwarf_Op *op, struct probe_finder *pf) { unsigned int regn; Dwarf_Word offs = 0; int deref = 0, ret; const char *regs; /* TODO: support CFA */ /* If this is based on frame buffer, set the offset */ if (op->atom == DW_OP_fbreg) { if (pf->fb_ops == NULL) die("The attribute of frame base is not supported.\n"); deref = 1; offs = op->number; op = &pf->fb_ops[0]; } if (op->atom >= DW_OP_breg0 && op->atom <= DW_OP_breg31) { regn = op->atom - DW_OP_breg0; offs += op->number; deref = 1; } else if (op->atom >= DW_OP_reg0 && op->atom <= DW_OP_reg31) { regn = op->atom - DW_OP_reg0; } else if (op->atom == DW_OP_bregx) { regn = op->number; offs += op->number2; deref = 1; } else if (op->atom == DW_OP_regx) { regn = op->number; } else die("DW_OP %d is not supported.", op->atom); regs = get_arch_regstr(regn); if (!regs) die("%u exceeds max register number.", regn); if (deref) ret = snprintf(pf->buf, pf->len, " %s=+%ju(%s)", pf->var, (uintmax_t)offs, regs); else ret = snprintf(pf->buf, pf->len, " %s=%s", pf->var, regs); DIE_IF(ret < 0); DIE_IF(ret >= pf->len); } /* Show a variables in kprobe event format */ static void show_variable(Dwarf_Die *vr_die, struct probe_finder *pf) { Dwarf_Attribute attr; Dwarf_Op *expr; size_t nexpr; int ret; if (dwarf_attr(vr_die, DW_AT_location, &attr) == NULL) goto error; /* TODO: handle more than 1 exprs */ ret = dwarf_getlocation_addr(&attr, (pf->addr - pf->cu_base), &expr, &nexpr, 1); if (ret <= 0 || nexpr == 0) goto error; show_location(expr, pf); /* *expr will be cached in libdw. Don't free it. */ return ; error: /* TODO: Support const_value */ die("Failed to find the location of %s at this address.\n" " Perhaps, it has been optimized out.", pf->var); } static int variable_search_cb(struct die_link *dlink, void *data) { struct probe_finder *pf = (struct probe_finder *)data; int tag; tag = dwarf_tag(&dlink->die); DIE_IF(tag < 0); if ((tag == DW_TAG_formal_parameter || tag == DW_TAG_variable) && (die_compare_name(&dlink->die, pf->var) == 0)) { show_variable(&dlink->die, pf); return 1; } /* TODO: Support struct members and arrays */ return 0; } /* Find a variable in a subprogram die */ static void find_variable(Dwarf_Die *sp_die, struct probe_finder *pf) { int ret; if (!is_c_varname(pf->var)) { /* Output raw parameters */ ret = snprintf(pf->buf, pf->len, " %s", pf->var); DIE_IF(ret < 0); DIE_IF(ret >= pf->len); return ; } pr_debug("Searching '%s' variable in context.\n", pf->var); /* Search child die for local variables and parameters. */ ret = search_die_from_children(sp_die, variable_search_cb, pf); if (!ret) die("Failed to find '%s' in this function.", pf->var); } /* Show a probe point to output buffer */ static void show_probe_point(Dwarf_Die *sp_die, size_t offs, struct probe_finder *pf) { struct probe_point *pp = pf->pp; const char *name; char tmp[MAX_PROBE_BUFFER]; int ret, i, len; Dwarf_Attribute fb_attr; size_t nops; /* Output name of probe point */ name = dwarf_diename(sp_die); if (name) { ret = snprintf(tmp, MAX_PROBE_BUFFER, "%s+%u", name, (unsigned int)offs); /* Copy the function name if possible */ if (!pp->function) { pp->function = strdup(name); pp->offset = offs; } } else { /* This function has no name. */ ret = snprintf(tmp, MAX_PROBE_BUFFER, "0x%jx", (uintmax_t)pf->addr); if (!pp->function) { /* TODO: Use _stext */ pp->function = strdup(""); pp->offset = (size_t)pf->addr; } } DIE_IF(ret < 0); DIE_IF(ret >= MAX_PROBE_BUFFER); len = ret; pr_debug("Probe point found: %s\n", tmp); /* Get the frame base attribute/ops */ dwarf_attr(sp_die, DW_AT_frame_base, &fb_attr); ret = dwarf_getlocation_addr(&fb_attr, (pf->addr - pf->cu_base), &pf->fb_ops, &nops, 1); if (ret <= 0 || nops == 0) pf->fb_ops = NULL; /* Find each argument */ /* TODO: use dwarf_cfi_addrframe */ for (i = 0; i < pp->nr_args; i++) { pf->var = pp->args[i]; pf->buf = &tmp[len]; pf->len = MAX_PROBE_BUFFER - len; find_variable(sp_die, pf); len += strlen(pf->buf); } /* *pf->fb_ops will be cached in libdw. Don't free it. */ pf->fb_ops = NULL; pp->probes[pp->found] = strdup(tmp); pp->found++; } /* Find probe point from its line number */ static void find_probe_point_by_line(struct probe_finder *pf) { Dwarf_Lines *lines; Dwarf_Line *line; size_t nlines, i; Dwarf_Addr addr, epc; int lineno; int ret; Dwarf_Die *sp_die, die_mem; ret = dwarf_getsrclines(&pf->cu_die, &lines, &nlines); DIE_IF(ret != 0); for (i = 0; i < nlines; i++) { line = dwarf_onesrcline(lines, i); dwarf_lineno(line, &lineno); if (lineno != pf->lno) continue; /* TODO: Get fileno from line, but how? */ if (strtailcmp(dwarf_linesrc(line, NULL, NULL), pf->fname) != 0) continue; ret = dwarf_lineaddr(line, &addr); DIE_IF(ret != 0); pr_debug("Probe line found: line[%d]:%d addr:0x%jx\n", (int)i, lineno, (uintmax_t)addr); pf->addr = addr; sp_die = die_get_real_subprogram(&pf->cu_die, addr, &die_mem); if (!sp_die) die("Probe point is not found in subprograms."); dwarf_entrypc(sp_die, &epc); show_probe_point(sp_die, (size_t)(addr - epc), pf); /* Continuing, because target line might be inlined. */ } } /* Search function from function name */ static int probe_point_search_cb(struct die_link *dlink, void *data) { struct probe_finder *pf = (struct probe_finder *)data; struct probe_point *pp = pf->pp; struct die_link *lk; size_t offs; int tag; int ret; tag = dwarf_tag(&dlink->die); if (tag == DW_TAG_subprogram) { if (die_compare_name(&dlink->die, pp->function) == 0) { if (pp->line) { /* Function relative line */ pf->fname = dwarf_decl_file(&dlink->die); dwarf_decl_line(&dlink->die, &pf->lno); pf->lno += pp->line; find_probe_point_by_line(pf); return 1; } if (dwarf_func_inline(&dlink->die)) { /* Inlined function, save it. */ pf->origin = dlink->die.addr; return 0; /* Continue to search */ } /* Get probe address */ pf->addr = die_get_entrypc(&dlink->die); pf->addr += pp->offset; /* TODO: Check the address in this function */ show_probe_point(&dlink->die, pp->offset, pf); return 1; /* Exit; no same symbol in this CU. */ } } else if (tag == DW_TAG_inlined_subroutine && pf->origin) { if (die_compare_abstract_origin(&dlink->die, pf->origin)) { /* Get probe address */ pf->addr = die_get_entrypc(&dlink->die); pf->addr += pp->offset; pr_debug("found inline addr: 0x%jx\n", (uintmax_t)pf->addr); /* Inlined function. Get a real subprogram */ for (lk = dlink->parent; lk != NULL; lk = lk->parent) { tag = dwarf_tag(&lk->die); if (tag == DW_TAG_subprogram && !dwarf_func_inline(&lk->die)) goto found; } die("Failed to find real subprogram."); found: /* Get offset from subprogram */ ret = die_within_subprogram(&lk->die, pf->addr, &offs); DIE_IF(!ret); show_probe_point(&lk->die, offs, pf); /* Continue to search */ } } return 0; } static void find_probe_point_by_func(struct probe_finder *pf) { search_die_from_children(&pf->cu_die, probe_point_search_cb, pf); } /* Find a probe point */ int find_probe_point(int fd, struct probe_point *pp) { struct probe_finder pf = {.pp = pp}; int ret; Dwarf_Off off, noff; size_t cuhl; Dwarf_Die *diep; Dwarf *dbg; int fno = 0; dbg = dwarf_begin(fd, DWARF_C_READ); if (!dbg) return -ENOENT; pp->found = 0; off = 0; /* Loop on CUs (Compilation Unit) */ while (!dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL)) { /* Get the DIE(Debugging Information Entry) of this CU */ diep = dwarf_offdie(dbg, off + cuhl, &pf.cu_die); if (!diep) continue; /* Check if target file is included. */ if (pp->file) fno = cu_find_fileno(&pf.cu_die, pp->file); else fno = 0; if (!pp->file || fno) { /* Save CU base address (for frame_base) */ ret = dwarf_lowpc(&pf.cu_die, &pf.cu_base); if (ret != 0) pf.cu_base = 0; if (pp->function) find_probe_point_by_func(&pf); else { pf.lno = pp->line; find_probe_point_by_line(&pf); } } off = noff; } dwarf_end(dbg); return pp->found; } static void line_range_add_line(struct line_range *lr, unsigned int line) { struct line_node *ln; struct list_head *p; /* Reverse search, because new line will be the last one */ list_for_each_entry_reverse(ln, &lr->line_list, list) { if (ln->line < line) { p = &ln->list; goto found; } else if (ln->line == line) /* Already exist */ return ; } /* List is empty, or the smallest entry */ p = &lr->line_list; found: pr_debug("Debug: add a line %u\n", line); ln = zalloc(sizeof(struct line_node)); DIE_IF(ln == NULL); ln->line = line; INIT_LIST_HEAD(&ln->list); list_add(&ln->list, p); } /* Find line range from its line number */ static void find_line_range_by_line(struct line_finder *lf) { Dwarf_Lines *lines; Dwarf_Line *line; size_t nlines, i; Dwarf_Addr addr; int lineno; int ret; const char *src; INIT_LIST_HEAD(&lf->lr->line_list); ret = dwarf_getsrclines(&lf->cu_die, &lines, &nlines); DIE_IF(ret != 0); for (i = 0; i < nlines; i++) { line = dwarf_onesrcline(lines, i); dwarf_lineno(line, &lineno); if (lf->lno_s > lineno || lf->lno_e < lineno) continue; /* TODO: Get fileno from line, but how? */ src = dwarf_linesrc(line, NULL, NULL); if (strtailcmp(src, lf->fname) != 0) continue; /* Filter line in the function address range */ if (lf->addr_s && lf->addr_e) { ret = dwarf_lineaddr(line, &addr); DIE_IF(ret != 0); if (lf->addr_s > addr || lf->addr_e <= addr) continue; } /* Copy real path */ if (!lf->lr->path) lf->lr->path = strdup(src); line_range_add_line(lf->lr, (unsigned int)lineno); } /* Update status */ if (!list_empty(&lf->lr->line_list)) lf->found = 1; else { free(lf->lr->path); lf->lr->path = NULL; } } /* Search function from function name */ static int line_range_search_cb(struct die_link *dlink, void *data) { struct line_finder *lf = (struct line_finder *)data; struct line_range *lr = lf->lr; int tag; int ret; tag = dwarf_tag(&dlink->die); if (tag == DW_TAG_subprogram && die_compare_name(&dlink->die, lr->function) == 0) { /* Get the address range of this function */ ret = dwarf_highpc(&dlink->die, &lf->addr_e); if (ret == 0) ret = dwarf_lowpc(&dlink->die, &lf->addr_s); if (ret != 0) { lf->addr_s = 0; lf->addr_e = 0; } lf->fname = dwarf_decl_file(&dlink->die); dwarf_decl_line(&dlink->die, &lr->offset); pr_debug("fname: %s, lineno:%d\n", lf->fname, lr->offset); lf->lno_s = lr->offset + lr->start; if (!lr->end) lf->lno_e = INT_MAX; else lf->lno_e = lr->offset + lr->end; lr->start = lf->lno_s; lr->end = lf->lno_e; find_line_range_by_line(lf); return 1; } return 0; } static void find_line_range_by_func(struct line_finder *lf) { search_die_from_children(&lf->cu_die, line_range_search_cb, lf); } int find_line_range(int fd, struct line_range *lr) { struct line_finder lf = {.lr = lr, .found = 0}; int ret; Dwarf_Off off = 0, noff; size_t cuhl; Dwarf_Die *diep; Dwarf *dbg; int fno; dbg = dwarf_begin(fd, DWARF_C_READ); if (!dbg) return -ENOENT; /* Loop on CUs (Compilation Unit) */ while (!lf.found) { ret = dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL); if (ret != 0) break; /* Get the DIE(Debugging Information Entry) of this CU */ diep = dwarf_offdie(dbg, off + cuhl, &lf.cu_die); if (!diep) continue; /* Check if target file is included. */ if (lr->file) fno = cu_find_fileno(&lf.cu_die, lr->file); else fno = 0; if (!lr->file || fno) { if (lr->function) find_line_range_by_func(&lf); else { lf.fname = lr->file; lf.lno_s = lr->start; if (!lr->end) lf.lno_e = INT_MAX; else lf.lno_e = lr->end; find_line_range_by_line(&lf); } } off = noff; } pr_debug("path: %lx\n", (unsigned long)lr->path); dwarf_end(dbg); return lf.found; }