Commit | Line | Data |
---|---|---|
4ea42b18 MH |
1 | /* |
2 | * probe-finder.c : C expression to kprobe event converter | |
3 | * | |
4 | * Written by Masami Hiramatsu <mhiramat@redhat.com> | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License as published by | |
8 | * the Free Software Foundation; either version 2 of the License, or | |
9 | * (at your option) any later version. | |
10 | * | |
11 | * This program is distributed in the hope that it will be useful, | |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | * GNU General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
17 | * along with this program; if not, write to the Free Software | |
18 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | |
19 | * | |
20 | */ | |
21 | ||
22 | #include <sys/utsname.h> | |
23 | #include <sys/types.h> | |
24 | #include <sys/stat.h> | |
25 | #include <fcntl.h> | |
26 | #include <errno.h> | |
27 | #include <stdio.h> | |
28 | #include <unistd.h> | |
29 | #include <getopt.h> | |
30 | #include <stdlib.h> | |
31 | #include <string.h> | |
32 | #include <stdarg.h> | |
33 | #include <ctype.h> | |
074fc0e4 | 34 | |
2a9c8c36 | 35 | #include "string.h" |
89c69c0e MH |
36 | #include "event.h" |
37 | #include "debug.h" | |
074fc0e4 | 38 | #include "util.h" |
4ea42b18 MH |
39 | #include "probe-finder.h" |
40 | ||
41 | ||
4ea42b18 MH |
42 | /* |
43 | * Generic dwarf analysis helpers | |
44 | */ | |
45 | ||
46 | #define X86_32_MAX_REGS 8 | |
47 | const char *x86_32_regs_table[X86_32_MAX_REGS] = { | |
48 | "%ax", | |
49 | "%cx", | |
50 | "%dx", | |
51 | "%bx", | |
52 | "$stack", /* Stack address instead of %sp */ | |
53 | "%bp", | |
54 | "%si", | |
55 | "%di", | |
56 | }; | |
57 | ||
58 | #define X86_64_MAX_REGS 16 | |
59 | const char *x86_64_regs_table[X86_64_MAX_REGS] = { | |
60 | "%ax", | |
61 | "%dx", | |
62 | "%cx", | |
63 | "%bx", | |
64 | "%si", | |
65 | "%di", | |
66 | "%bp", | |
67 | "%sp", | |
68 | "%r8", | |
69 | "%r9", | |
70 | "%r10", | |
71 | "%r11", | |
72 | "%r12", | |
73 | "%r13", | |
74 | "%r14", | |
75 | "%r15", | |
76 | }; | |
77 | ||
78 | /* TODO: switching by dwarf address size */ | |
79 | #ifdef __x86_64__ | |
80 | #define ARCH_MAX_REGS X86_64_MAX_REGS | |
81 | #define arch_regs_table x86_64_regs_table | |
82 | #else | |
83 | #define ARCH_MAX_REGS X86_32_MAX_REGS | |
84 | #define arch_regs_table x86_32_regs_table | |
85 | #endif | |
86 | ||
87 | /* Return architecture dependent register string (for kprobe-tracer) */ | |
88 | static const char *get_arch_regstr(unsigned int n) | |
89 | { | |
90 | return (n <= ARCH_MAX_REGS) ? arch_regs_table[n] : NULL; | |
91 | } | |
92 | ||
93 | /* | |
94 | * Compare the tail of two strings. | |
95 | * Return 0 if whole of either string is same as another's tail part. | |
96 | */ | |
97 | static int strtailcmp(const char *s1, const char *s2) | |
98 | { | |
99 | int i1 = strlen(s1); | |
100 | int i2 = strlen(s2); | |
d56728b8 | 101 | while (--i1 >= 0 && --i2 >= 0) { |
4ea42b18 MH |
102 | if (s1[i1] != s2[i2]) |
103 | return s1[i1] - s2[i2]; | |
104 | } | |
105 | return 0; | |
106 | } | |
107 | ||
2a9c8c36 MH |
108 | /* Line number list operations */ |
109 | ||
110 | /* Add a line to line number list */ | |
111 | static void line_list__add_line(struct list_head *head, unsigned int line) | |
112 | { | |
113 | struct line_node *ln; | |
114 | struct list_head *p; | |
115 | ||
116 | /* Reverse search, because new line will be the last one */ | |
117 | list_for_each_entry_reverse(ln, head, list) { | |
118 | if (ln->line < line) { | |
119 | p = &ln->list; | |
120 | goto found; | |
121 | } else if (ln->line == line) /* Already exist */ | |
122 | return ; | |
123 | } | |
124 | /* List is empty, or the smallest entry */ | |
125 | p = head; | |
126 | found: | |
127 | pr_debug("line list: add a line %u\n", line); | |
31facc5f | 128 | ln = xzalloc(sizeof(struct line_node)); |
2a9c8c36 MH |
129 | ln->line = line; |
130 | INIT_LIST_HEAD(&ln->list); | |
131 | list_add(&ln->list, p); | |
132 | } | |
133 | ||
134 | /* Check if the line in line number list */ | |
135 | static int line_list__has_line(struct list_head *head, unsigned int line) | |
136 | { | |
137 | struct line_node *ln; | |
138 | ||
139 | /* Reverse search, because new line will be the last one */ | |
140 | list_for_each_entry(ln, head, list) | |
141 | if (ln->line == line) | |
142 | return 1; | |
143 | ||
144 | return 0; | |
145 | } | |
146 | ||
147 | /* Init line number list */ | |
148 | static void line_list__init(struct list_head *head) | |
149 | { | |
150 | INIT_LIST_HEAD(head); | |
151 | } | |
152 | ||
153 | /* Free line number list */ | |
154 | static void line_list__free(struct list_head *head) | |
155 | { | |
156 | struct line_node *ln; | |
157 | while (!list_empty(head)) { | |
158 | ln = list_first_entry(head, struct line_node, list); | |
159 | list_del(&ln->list); | |
160 | free(ln); | |
161 | } | |
162 | } | |
163 | ||
164 | /* Dwarf wrappers */ | |
165 | ||
166 | /* Find the realpath of the target file. */ | |
167 | static const char *cu_find_realpath(Dwarf_Die *cu_die, const char *fname) | |
4ea42b18 | 168 | { |
804b3606 MH |
169 | Dwarf_Files *files; |
170 | size_t nfiles, i; | |
accd3cc4 | 171 | const char *src = NULL; |
4ea42b18 MH |
172 | int ret; |
173 | ||
174 | if (!fname) | |
2a9c8c36 | 175 | return NULL; |
4ea42b18 | 176 | |
804b3606 | 177 | ret = dwarf_getsrcfiles(cu_die, &files, &nfiles); |
2a9c8c36 MH |
178 | if (ret != 0) |
179 | return NULL; | |
180 | ||
181 | for (i = 0; i < nfiles; i++) { | |
182 | src = dwarf_filesrc(files, i, NULL, NULL); | |
183 | if (strtailcmp(src, fname) == 0) | |
184 | break; | |
4ea42b18 | 185 | } |
2a9c8c36 | 186 | return src; |
4ea42b18 MH |
187 | } |
188 | ||
016f262e MH |
189 | /* Compare diename and tname */ |
190 | static bool die_compare_name(Dwarf_Die *dw_die, const char *tname) | |
191 | { | |
192 | const char *name; | |
193 | name = dwarf_diename(dw_die); | |
194 | DIE_IF(name == NULL); | |
195 | return strcmp(tname, name); | |
196 | } | |
197 | ||
198 | /* Get entry pc(or low pc, 1st entry of ranges) of the die */ | |
199 | static Dwarf_Addr die_get_entrypc(Dwarf_Die *dw_die) | |
200 | { | |
201 | Dwarf_Addr epc; | |
202 | int ret; | |
203 | ||
204 | ret = dwarf_entrypc(dw_die, &epc); | |
205 | DIE_IF(ret == -1); | |
206 | return epc; | |
207 | } | |
208 | ||
209 | /* Return values for die_find callbacks */ | |
210 | enum { | |
211 | DIE_FIND_CB_FOUND = 0, /* End of Search */ | |
212 | DIE_FIND_CB_CHILD = 1, /* Search only children */ | |
213 | DIE_FIND_CB_SIBLING = 2, /* Search only siblings */ | |
214 | DIE_FIND_CB_CONTINUE = 3, /* Search children and siblings */ | |
215 | }; | |
216 | ||
217 | /* Search a child die */ | |
218 | static Dwarf_Die *die_find_child(Dwarf_Die *rt_die, | |
219 | int (*callback)(Dwarf_Die *, void *), | |
220 | void *data, Dwarf_Die *die_mem) | |
221 | { | |
222 | Dwarf_Die child_die; | |
223 | int ret; | |
224 | ||
225 | ret = dwarf_child(rt_die, die_mem); | |
226 | if (ret != 0) | |
227 | return NULL; | |
228 | ||
229 | do { | |
230 | ret = callback(die_mem, data); | |
231 | if (ret == DIE_FIND_CB_FOUND) | |
232 | return die_mem; | |
233 | ||
234 | if ((ret & DIE_FIND_CB_CHILD) && | |
235 | die_find_child(die_mem, callback, data, &child_die)) { | |
236 | memcpy(die_mem, &child_die, sizeof(Dwarf_Die)); | |
237 | return die_mem; | |
238 | } | |
239 | } while ((ret & DIE_FIND_CB_SIBLING) && | |
240 | dwarf_siblingof(die_mem, die_mem) == 0); | |
241 | ||
242 | return NULL; | |
243 | } | |
244 | ||
804b3606 MH |
245 | struct __addr_die_search_param { |
246 | Dwarf_Addr addr; | |
247 | Dwarf_Die *die_mem; | |
248 | }; | |
249 | ||
250 | static int __die_search_func_cb(Dwarf_Die *fn_die, void *data) | |
631c9def | 251 | { |
804b3606 | 252 | struct __addr_die_search_param *ad = data; |
631c9def | 253 | |
804b3606 MH |
254 | if (dwarf_tag(fn_die) == DW_TAG_subprogram && |
255 | dwarf_haspc(fn_die, ad->addr)) { | |
256 | memcpy(ad->die_mem, fn_die, sizeof(Dwarf_Die)); | |
257 | return DWARF_CB_ABORT; | |
258 | } | |
259 | return DWARF_CB_OK; | |
260 | } | |
631c9def | 261 | |
804b3606 | 262 | /* Search a real subprogram including this line, */ |
95a3e4c4 MH |
263 | static Dwarf_Die *die_find_real_subprogram(Dwarf_Die *cu_die, Dwarf_Addr addr, |
264 | Dwarf_Die *die_mem) | |
804b3606 MH |
265 | { |
266 | struct __addr_die_search_param ad; | |
267 | ad.addr = addr; | |
268 | ad.die_mem = die_mem; | |
269 | /* dwarf_getscopes can't find subprogram. */ | |
270 | if (!dwarf_getfuncs(cu_die, __die_search_func_cb, &ad, 0)) | |
271 | return NULL; | |
272 | else | |
273 | return die_mem; | |
631c9def MH |
274 | } |
275 | ||
016f262e MH |
276 | /* die_find callback for inline function search */ |
277 | static int __die_find_inline_cb(Dwarf_Die *die_mem, void *data) | |
161a26b0 | 278 | { |
016f262e | 279 | Dwarf_Addr *addr = data; |
161a26b0 | 280 | |
016f262e MH |
281 | if (dwarf_tag(die_mem) == DW_TAG_inlined_subroutine && |
282 | dwarf_haspc(die_mem, *addr)) | |
283 | return DIE_FIND_CB_FOUND; | |
161a26b0 | 284 | |
016f262e | 285 | return DIE_FIND_CB_CONTINUE; |
161a26b0 MH |
286 | } |
287 | ||
016f262e MH |
288 | /* Similar to dwarf_getfuncs, but returns inlined_subroutine if exists. */ |
289 | static Dwarf_Die *die_find_inlinefunc(Dwarf_Die *sp_die, Dwarf_Addr addr, | |
290 | Dwarf_Die *die_mem) | |
4ea42b18 | 291 | { |
016f262e | 292 | return die_find_child(sp_die, __die_find_inline_cb, &addr, die_mem); |
4ea42b18 MH |
293 | } |
294 | ||
016f262e | 295 | static int __die_find_variable_cb(Dwarf_Die *die_mem, void *data) |
4ea42b18 | 296 | { |
016f262e MH |
297 | const char *name = data; |
298 | int tag; | |
4ea42b18 | 299 | |
016f262e MH |
300 | tag = dwarf_tag(die_mem); |
301 | if ((tag == DW_TAG_formal_parameter || | |
302 | tag == DW_TAG_variable) && | |
303 | (die_compare_name(die_mem, name) == 0)) | |
304 | return DIE_FIND_CB_FOUND; | |
305 | ||
306 | return DIE_FIND_CB_CONTINUE; | |
4ea42b18 MH |
307 | } |
308 | ||
016f262e | 309 | /* Find a variable called 'name' */ |
e92b85e1 MH |
310 | static Dwarf_Die *die_find_variable(Dwarf_Die *sp_die, const char *name, |
311 | Dwarf_Die *die_mem) | |
4ea42b18 | 312 | { |
016f262e MH |
313 | return die_find_child(sp_die, __die_find_variable_cb, (void *)name, |
314 | die_mem); | |
4ea42b18 MH |
315 | } |
316 | ||
4ea42b18 MH |
317 | /* |
318 | * Probe finder related functions | |
319 | */ | |
320 | ||
321 | /* Show a location */ | |
4235b045 | 322 | static void convert_location(Dwarf_Op *op, struct probe_finder *pf) |
4ea42b18 | 323 | { |
804b3606 MH |
324 | unsigned int regn; |
325 | Dwarf_Word offs = 0; | |
4235b045 | 326 | bool ref = false; |
4ea42b18 | 327 | const char *regs; |
4235b045 | 328 | struct kprobe_trace_arg *tvar = pf->tvar; |
4ea42b18 | 329 | |
804b3606 | 330 | /* TODO: support CFA */ |
4ea42b18 | 331 | /* If this is based on frame buffer, set the offset */ |
804b3606 MH |
332 | if (op->atom == DW_OP_fbreg) { |
333 | if (pf->fb_ops == NULL) | |
334 | die("The attribute of frame base is not supported.\n"); | |
4235b045 | 335 | ref = true; |
804b3606 MH |
336 | offs = op->number; |
337 | op = &pf->fb_ops[0]; | |
338 | } | |
4ea42b18 | 339 | |
804b3606 MH |
340 | if (op->atom >= DW_OP_breg0 && op->atom <= DW_OP_breg31) { |
341 | regn = op->atom - DW_OP_breg0; | |
342 | offs += op->number; | |
4235b045 | 343 | ref = true; |
804b3606 MH |
344 | } else if (op->atom >= DW_OP_reg0 && op->atom <= DW_OP_reg31) { |
345 | regn = op->atom - DW_OP_reg0; | |
346 | } else if (op->atom == DW_OP_bregx) { | |
347 | regn = op->number; | |
348 | offs += op->number2; | |
4235b045 | 349 | ref = true; |
804b3606 MH |
350 | } else if (op->atom == DW_OP_regx) { |
351 | regn = op->number; | |
4ea42b18 | 352 | } else |
804b3606 | 353 | die("DW_OP %d is not supported.", op->atom); |
4ea42b18 MH |
354 | |
355 | regs = get_arch_regstr(regn); | |
356 | if (!regs) | |
804b3606 | 357 | die("%u exceeds max register number.", regn); |
4ea42b18 | 358 | |
4235b045 MH |
359 | tvar->value = xstrdup(regs); |
360 | if (ref) { | |
361 | tvar->ref = xzalloc(sizeof(struct kprobe_trace_arg_ref)); | |
362 | tvar->ref->offset = (long)offs; | |
363 | } | |
4ea42b18 MH |
364 | } |
365 | ||
366 | /* Show a variables in kprobe event format */ | |
4235b045 | 367 | static void convert_variable(Dwarf_Die *vr_die, struct probe_finder *pf) |
4ea42b18 MH |
368 | { |
369 | Dwarf_Attribute attr; | |
804b3606 MH |
370 | Dwarf_Op *expr; |
371 | size_t nexpr; | |
4ea42b18 MH |
372 | int ret; |
373 | ||
804b3606 | 374 | if (dwarf_attr(vr_die, DW_AT_location, &attr) == NULL) |
4ea42b18 | 375 | goto error; |
804b3606 | 376 | /* TODO: handle more than 1 exprs */ |
d0cb4260 | 377 | ret = dwarf_getlocation_addr(&attr, pf->addr, &expr, &nexpr, 1); |
804b3606 | 378 | if (ret <= 0 || nexpr == 0) |
4ea42b18 | 379 | goto error; |
804b3606 | 380 | |
4235b045 | 381 | convert_location(expr, pf); |
804b3606 | 382 | /* *expr will be cached in libdw. Don't free it. */ |
4ea42b18 MH |
383 | return ; |
384 | error: | |
804b3606 | 385 | /* TODO: Support const_value */ |
074fc0e4 | 386 | die("Failed to find the location of %s at this address.\n" |
4235b045 | 387 | " Perhaps, it has been optimized out.", pf->pvar->name); |
4ea42b18 MH |
388 | } |
389 | ||
4ea42b18 | 390 | /* Find a variable in a subprogram die */ |
804b3606 | 391 | static void find_variable(Dwarf_Die *sp_die, struct probe_finder *pf) |
4ea42b18 | 392 | { |
e92b85e1 | 393 | Dwarf_Die vr_die; |
4ea42b18 | 394 | |
e92b85e1 | 395 | /* TODO: Support struct members and arrays */ |
4235b045 MH |
396 | if (!is_c_varname(pf->pvar->name)) { |
397 | /* Copy raw parameters */ | |
398 | pf->tvar->value = xstrdup(pf->pvar->name); | |
399 | } else { | |
400 | pf->tvar->name = xstrdup(pf->pvar->name); | |
401 | pr_debug("Searching '%s' variable in context.\n", | |
402 | pf->pvar->name); | |
403 | /* Search child die for local variables and parameters. */ | |
404 | if (!die_find_variable(sp_die, pf->pvar->name, &vr_die)) | |
405 | die("Failed to find '%s' in this function.", | |
406 | pf->pvar->name); | |
407 | convert_variable(&vr_die, pf); | |
4ea42b18 | 408 | } |
4ea42b18 MH |
409 | } |
410 | ||
4ea42b18 | 411 | /* Show a probe point to output buffer */ |
4235b045 | 412 | static void convert_probe_point(Dwarf_Die *sp_die, struct probe_finder *pf) |
4ea42b18 | 413 | { |
4235b045 | 414 | struct kprobe_trace_event *tev; |
e92b85e1 MH |
415 | Dwarf_Addr eaddr; |
416 | Dwarf_Die die_mem; | |
804b3606 | 417 | const char *name; |
4235b045 | 418 | int ret, i; |
804b3606 MH |
419 | Dwarf_Attribute fb_attr; |
420 | size_t nops; | |
4ea42b18 | 421 | |
4235b045 MH |
422 | if (pf->ntevs == MAX_PROBES) |
423 | die("Too many( > %d) probe point found.\n", MAX_PROBES); | |
424 | tev = &pf->tevs[pf->ntevs++]; | |
425 | ||
e92b85e1 MH |
426 | /* If no real subprogram, find a real one */ |
427 | if (!sp_die || dwarf_tag(sp_die) != DW_TAG_subprogram) { | |
95a3e4c4 | 428 | sp_die = die_find_real_subprogram(&pf->cu_die, |
e92b85e1 MH |
429 | pf->addr, &die_mem); |
430 | if (!sp_die) | |
431 | die("Probe point is not found in subprograms."); | |
432 | } | |
433 | ||
4235b045 | 434 | /* Copy the name of probe point */ |
804b3606 MH |
435 | name = dwarf_diename(sp_die); |
436 | if (name) { | |
e92b85e1 | 437 | dwarf_entrypc(sp_die, &eaddr); |
4235b045 MH |
438 | tev->point.symbol = xstrdup(name); |
439 | tev->point.offset = (unsigned long)(pf->addr - eaddr); | |
440 | } else | |
4ea42b18 | 441 | /* This function has no name. */ |
4235b045 MH |
442 | tev->point.offset = (unsigned long)pf->addr; |
443 | ||
444 | pr_debug("Probe point found: %s+%lu\n", tev->point.symbol, | |
445 | tev->point.offset); | |
4ea42b18 | 446 | |
804b3606 MH |
447 | /* Get the frame base attribute/ops */ |
448 | dwarf_attr(sp_die, DW_AT_frame_base, &fb_attr); | |
d0cb4260 | 449 | ret = dwarf_getlocation_addr(&fb_attr, pf->addr, &pf->fb_ops, &nops, 1); |
804b3606 MH |
450 | if (ret <= 0 || nops == 0) |
451 | pf->fb_ops = NULL; | |
452 | ||
4ea42b18 | 453 | /* Find each argument */ |
804b3606 | 454 | /* TODO: use dwarf_cfi_addrframe */ |
4235b045 MH |
455 | tev->nargs = pf->pev->nargs; |
456 | tev->args = xzalloc(sizeof(struct kprobe_trace_arg) * tev->nargs); | |
457 | for (i = 0; i < pf->pev->nargs; i++) { | |
458 | pf->pvar = &pf->pev->args[i]; | |
459 | pf->tvar = &tev->args[i]; | |
4ea42b18 | 460 | find_variable(sp_die, pf); |
4ea42b18 | 461 | } |
804b3606 MH |
462 | |
463 | /* *pf->fb_ops will be cached in libdw. Don't free it. */ | |
464 | pf->fb_ops = NULL; | |
4ea42b18 MH |
465 | } |
466 | ||
4ea42b18 | 467 | /* Find probe point from its line number */ |
631c9def | 468 | static void find_probe_point_by_line(struct probe_finder *pf) |
4ea42b18 | 469 | { |
804b3606 MH |
470 | Dwarf_Lines *lines; |
471 | Dwarf_Line *line; | |
472 | size_t nlines, i; | |
e92b85e1 | 473 | Dwarf_Addr addr; |
804b3606 | 474 | int lineno; |
4ea42b18 MH |
475 | int ret; |
476 | ||
804b3606 MH |
477 | ret = dwarf_getsrclines(&pf->cu_die, &lines, &nlines); |
478 | DIE_IF(ret != 0); | |
4ea42b18 | 479 | |
804b3606 MH |
480 | for (i = 0; i < nlines; i++) { |
481 | line = dwarf_onesrcline(lines, i); | |
482 | dwarf_lineno(line, &lineno); | |
b0ef0732 | 483 | if (lineno != pf->lno) |
4ea42b18 MH |
484 | continue; |
485 | ||
804b3606 MH |
486 | /* TODO: Get fileno from line, but how? */ |
487 | if (strtailcmp(dwarf_linesrc(line, NULL, NULL), pf->fname) != 0) | |
488 | continue; | |
b0ef0732 | 489 | |
804b3606 MH |
490 | ret = dwarf_lineaddr(line, &addr); |
491 | DIE_IF(ret != 0); | |
492 | pr_debug("Probe line found: line[%d]:%d addr:0x%jx\n", | |
493 | (int)i, lineno, (uintmax_t)addr); | |
4ea42b18 | 494 | pf->addr = addr; |
804b3606 | 495 | |
4235b045 | 496 | convert_probe_point(NULL, pf); |
4ea42b18 MH |
497 | /* Continuing, because target line might be inlined. */ |
498 | } | |
4ea42b18 MH |
499 | } |
500 | ||
2a9c8c36 MH |
501 | /* Find lines which match lazy pattern */ |
502 | static int find_lazy_match_lines(struct list_head *head, | |
503 | const char *fname, const char *pat) | |
504 | { | |
505 | char *fbuf, *p1, *p2; | |
506 | int fd, line, nlines = 0; | |
507 | struct stat st; | |
508 | ||
509 | fd = open(fname, O_RDONLY); | |
510 | if (fd < 0) | |
511 | die("failed to open %s", fname); | |
512 | DIE_IF(fstat(fd, &st) < 0); | |
31facc5f | 513 | fbuf = xmalloc(st.st_size + 2); |
2a9c8c36 MH |
514 | DIE_IF(read(fd, fbuf, st.st_size) < 0); |
515 | close(fd); | |
516 | fbuf[st.st_size] = '\n'; /* Dummy line */ | |
517 | fbuf[st.st_size + 1] = '\0'; | |
518 | p1 = fbuf; | |
519 | line = 1; | |
520 | while ((p2 = strchr(p1, '\n')) != NULL) { | |
521 | *p2 = '\0'; | |
522 | if (strlazymatch(p1, pat)) { | |
523 | line_list__add_line(head, line); | |
524 | nlines++; | |
525 | } | |
526 | line++; | |
527 | p1 = p2 + 1; | |
528 | } | |
529 | free(fbuf); | |
530 | return nlines; | |
531 | } | |
532 | ||
533 | /* Find probe points from lazy pattern */ | |
534 | static void find_probe_point_lazy(Dwarf_Die *sp_die, struct probe_finder *pf) | |
535 | { | |
536 | Dwarf_Lines *lines; | |
537 | Dwarf_Line *line; | |
538 | size_t nlines, i; | |
539 | Dwarf_Addr addr; | |
540 | Dwarf_Die die_mem; | |
541 | int lineno; | |
542 | int ret; | |
543 | ||
544 | if (list_empty(&pf->lcache)) { | |
545 | /* Matching lazy line pattern */ | |
546 | ret = find_lazy_match_lines(&pf->lcache, pf->fname, | |
4235b045 | 547 | pf->pev->point.lazy_line); |
2a9c8c36 MH |
548 | if (ret <= 0) |
549 | die("No matched lines found in %s.", pf->fname); | |
550 | } | |
551 | ||
552 | ret = dwarf_getsrclines(&pf->cu_die, &lines, &nlines); | |
553 | DIE_IF(ret != 0); | |
554 | for (i = 0; i < nlines; i++) { | |
555 | line = dwarf_onesrcline(lines, i); | |
556 | ||
557 | dwarf_lineno(line, &lineno); | |
558 | if (!line_list__has_line(&pf->lcache, lineno)) | |
559 | continue; | |
560 | ||
561 | /* TODO: Get fileno from line, but how? */ | |
562 | if (strtailcmp(dwarf_linesrc(line, NULL, NULL), pf->fname) != 0) | |
563 | continue; | |
564 | ||
565 | ret = dwarf_lineaddr(line, &addr); | |
566 | DIE_IF(ret != 0); | |
567 | if (sp_die) { | |
568 | /* Address filtering 1: does sp_die include addr? */ | |
569 | if (!dwarf_haspc(sp_die, addr)) | |
570 | continue; | |
571 | /* Address filtering 2: No child include addr? */ | |
95a3e4c4 | 572 | if (die_find_inlinefunc(sp_die, addr, &die_mem)) |
2a9c8c36 MH |
573 | continue; |
574 | } | |
575 | ||
576 | pr_debug("Probe line found: line[%d]:%d addr:0x%llx\n", | |
577 | (int)i, lineno, (unsigned long long)addr); | |
578 | pf->addr = addr; | |
579 | ||
4235b045 | 580 | convert_probe_point(sp_die, pf); |
2a9c8c36 MH |
581 | /* Continuing, because target line might be inlined. */ |
582 | } | |
583 | /* TODO: deallocate lines, but how? */ | |
584 | } | |
585 | ||
e92b85e1 MH |
586 | static int probe_point_inline_cb(Dwarf_Die *in_die, void *data) |
587 | { | |
588 | struct probe_finder *pf = (struct probe_finder *)data; | |
4235b045 | 589 | struct perf_probe_point *pp = &pf->pev->point; |
e92b85e1 | 590 | |
2a9c8c36 MH |
591 | if (pp->lazy_line) |
592 | find_probe_point_lazy(in_die, pf); | |
593 | else { | |
594 | /* Get probe address */ | |
595 | pf->addr = die_get_entrypc(in_die); | |
596 | pf->addr += pp->offset; | |
597 | pr_debug("found inline addr: 0x%jx\n", | |
598 | (uintmax_t)pf->addr); | |
599 | ||
4235b045 | 600 | convert_probe_point(in_die, pf); |
2a9c8c36 | 601 | } |
e92b85e1 | 602 | |
e92b85e1 MH |
603 | return DWARF_CB_OK; |
604 | } | |
804b3606 | 605 | |
4ea42b18 | 606 | /* Search function from function name */ |
e92b85e1 | 607 | static int probe_point_search_cb(Dwarf_Die *sp_die, void *data) |
4ea42b18 MH |
608 | { |
609 | struct probe_finder *pf = (struct probe_finder *)data; | |
4235b045 | 610 | struct perf_probe_point *pp = &pf->pev->point; |
4ea42b18 | 611 | |
e92b85e1 MH |
612 | /* Check tag and diename */ |
613 | if (dwarf_tag(sp_die) != DW_TAG_subprogram || | |
614 | die_compare_name(sp_die, pp->function) != 0) | |
615 | return 0; | |
616 | ||
2a9c8c36 | 617 | pf->fname = dwarf_decl_file(sp_die); |
e92b85e1 | 618 | if (pp->line) { /* Function relative line */ |
e92b85e1 MH |
619 | dwarf_decl_line(sp_die, &pf->lno); |
620 | pf->lno += pp->line; | |
621 | find_probe_point_by_line(pf); | |
622 | } else if (!dwarf_func_inline(sp_die)) { | |
623 | /* Real function */ | |
2a9c8c36 MH |
624 | if (pp->lazy_line) |
625 | find_probe_point_lazy(sp_die, pf); | |
626 | else { | |
627 | pf->addr = die_get_entrypc(sp_die); | |
628 | pf->addr += pp->offset; | |
629 | /* TODO: Check the address in this function */ | |
4235b045 | 630 | convert_probe_point(sp_die, pf); |
2a9c8c36 | 631 | } |
e92b85e1 MH |
632 | } else |
633 | /* Inlined function: search instances */ | |
634 | dwarf_func_inline_instances(sp_die, probe_point_inline_cb, pf); | |
635 | ||
636 | return 1; /* Exit; no same symbol in this CU. */ | |
4ea42b18 MH |
637 | } |
638 | ||
631c9def | 639 | static void find_probe_point_by_func(struct probe_finder *pf) |
4ea42b18 | 640 | { |
e92b85e1 | 641 | dwarf_getfuncs(&pf->cu_die, probe_point_search_cb, pf, 0); |
4ea42b18 MH |
642 | } |
643 | ||
4235b045 MH |
644 | /* Find kprobe_trace_events specified by perf_probe_event from debuginfo */ |
645 | int find_kprobe_trace_events(int fd, struct perf_probe_event *pev, | |
646 | struct kprobe_trace_event **tevs) | |
4ea42b18 | 647 | { |
4235b045 MH |
648 | struct probe_finder pf = {.pev = pev}; |
649 | struct perf_probe_point *pp = &pev->point; | |
804b3606 MH |
650 | Dwarf_Off off, noff; |
651 | size_t cuhl; | |
652 | Dwarf_Die *diep; | |
653 | Dwarf *dbg; | |
804b3606 | 654 | |
4235b045 MH |
655 | pf.tevs = xzalloc(sizeof(struct kprobe_trace_event) * MAX_PROBES); |
656 | *tevs = pf.tevs; | |
657 | pf.ntevs = 0; | |
658 | ||
804b3606 MH |
659 | dbg = dwarf_begin(fd, DWARF_C_READ); |
660 | if (!dbg) | |
a225a1d9 | 661 | return -ENOENT; |
4ea42b18 | 662 | |
804b3606 | 663 | off = 0; |
2a9c8c36 | 664 | line_list__init(&pf.lcache); |
804b3606 MH |
665 | /* Loop on CUs (Compilation Unit) */ |
666 | while (!dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL)) { | |
4ea42b18 | 667 | /* Get the DIE(Debugging Information Entry) of this CU */ |
804b3606 MH |
668 | diep = dwarf_offdie(dbg, off + cuhl, &pf.cu_die); |
669 | if (!diep) | |
670 | continue; | |
4ea42b18 MH |
671 | |
672 | /* Check if target file is included. */ | |
673 | if (pp->file) | |
2a9c8c36 | 674 | pf.fname = cu_find_realpath(&pf.cu_die, pp->file); |
804b3606 | 675 | else |
2a9c8c36 | 676 | pf.fname = NULL; |
4ea42b18 | 677 | |
2a9c8c36 | 678 | if (!pp->file || pf.fname) { |
4ea42b18 | 679 | if (pp->function) |
631c9def | 680 | find_probe_point_by_func(&pf); |
2a9c8c36 MH |
681 | else if (pp->lazy_line) |
682 | find_probe_point_lazy(NULL, &pf); | |
b0ef0732 MH |
683 | else { |
684 | pf.lno = pp->line; | |
631c9def | 685 | find_probe_point_by_line(&pf); |
b0ef0732 | 686 | } |
4ea42b18 | 687 | } |
804b3606 | 688 | off = noff; |
4ea42b18 | 689 | } |
2a9c8c36 | 690 | line_list__free(&pf.lcache); |
804b3606 | 691 | dwarf_end(dbg); |
4ea42b18 | 692 | |
4235b045 | 693 | return pf.ntevs; |
4ea42b18 MH |
694 | } |
695 | ||
631c9def | 696 | /* Find line range from its line number */ |
161a26b0 | 697 | static void find_line_range_by_line(Dwarf_Die *sp_die, struct line_finder *lf) |
631c9def | 698 | { |
804b3606 MH |
699 | Dwarf_Lines *lines; |
700 | Dwarf_Line *line; | |
701 | size_t nlines, i; | |
631c9def | 702 | Dwarf_Addr addr; |
804b3606 | 703 | int lineno; |
631c9def | 704 | int ret; |
804b3606 | 705 | const char *src; |
161a26b0 | 706 | Dwarf_Die die_mem; |
631c9def | 707 | |
2a9c8c36 | 708 | line_list__init(&lf->lr->line_list); |
804b3606 MH |
709 | ret = dwarf_getsrclines(&lf->cu_die, &lines, &nlines); |
710 | DIE_IF(ret != 0); | |
631c9def | 711 | |
804b3606 MH |
712 | for (i = 0; i < nlines; i++) { |
713 | line = dwarf_onesrcline(lines, i); | |
161a26b0 MH |
714 | ret = dwarf_lineno(line, &lineno); |
715 | DIE_IF(ret != 0); | |
804b3606 | 716 | if (lf->lno_s > lineno || lf->lno_e < lineno) |
631c9def MH |
717 | continue; |
718 | ||
161a26b0 MH |
719 | if (sp_die) { |
720 | /* Address filtering 1: does sp_die include addr? */ | |
721 | ret = dwarf_lineaddr(line, &addr); | |
722 | DIE_IF(ret != 0); | |
723 | if (!dwarf_haspc(sp_die, addr)) | |
724 | continue; | |
725 | ||
726 | /* Address filtering 2: No child include addr? */ | |
95a3e4c4 | 727 | if (die_find_inlinefunc(sp_die, addr, &die_mem)) |
161a26b0 MH |
728 | continue; |
729 | } | |
730 | ||
804b3606 MH |
731 | /* TODO: Get fileno from line, but how? */ |
732 | src = dwarf_linesrc(line, NULL, NULL); | |
733 | if (strtailcmp(src, lf->fname) != 0) | |
631c9def MH |
734 | continue; |
735 | ||
804b3606 MH |
736 | /* Copy real path */ |
737 | if (!lf->lr->path) | |
31facc5f | 738 | lf->lr->path = xstrdup(src); |
2a9c8c36 | 739 | line_list__add_line(&lf->lr->line_list, (unsigned int)lineno); |
631c9def | 740 | } |
804b3606 | 741 | /* Update status */ |
631c9def MH |
742 | if (!list_empty(&lf->lr->line_list)) |
743 | lf->found = 1; | |
804b3606 MH |
744 | else { |
745 | free(lf->lr->path); | |
746 | lf->lr->path = NULL; | |
747 | } | |
631c9def MH |
748 | } |
749 | ||
161a26b0 MH |
750 | static int line_range_inline_cb(Dwarf_Die *in_die, void *data) |
751 | { | |
752 | find_line_range_by_line(in_die, (struct line_finder *)data); | |
753 | return DWARF_CB_ABORT; /* No need to find other instances */ | |
754 | } | |
755 | ||
631c9def | 756 | /* Search function from function name */ |
e92b85e1 | 757 | static int line_range_search_cb(Dwarf_Die *sp_die, void *data) |
631c9def MH |
758 | { |
759 | struct line_finder *lf = (struct line_finder *)data; | |
760 | struct line_range *lr = lf->lr; | |
631c9def | 761 | |
e92b85e1 MH |
762 | if (dwarf_tag(sp_die) == DW_TAG_subprogram && |
763 | die_compare_name(sp_die, lr->function) == 0) { | |
e92b85e1 MH |
764 | lf->fname = dwarf_decl_file(sp_die); |
765 | dwarf_decl_line(sp_die, &lr->offset); | |
804b3606 | 766 | pr_debug("fname: %s, lineno:%d\n", lf->fname, lr->offset); |
631c9def MH |
767 | lf->lno_s = lr->offset + lr->start; |
768 | if (!lr->end) | |
804b3606 | 769 | lf->lno_e = INT_MAX; |
631c9def MH |
770 | else |
771 | lf->lno_e = lr->offset + lr->end; | |
772 | lr->start = lf->lno_s; | |
773 | lr->end = lf->lno_e; | |
161a26b0 MH |
774 | if (dwarf_func_inline(sp_die)) |
775 | dwarf_func_inline_instances(sp_die, | |
776 | line_range_inline_cb, lf); | |
777 | else | |
778 | find_line_range_by_line(sp_die, lf); | |
631c9def MH |
779 | return 1; |
780 | } | |
781 | return 0; | |
782 | } | |
783 | ||
784 | static void find_line_range_by_func(struct line_finder *lf) | |
785 | { | |
e92b85e1 | 786 | dwarf_getfuncs(&lf->cu_die, line_range_search_cb, lf, 0); |
631c9def MH |
787 | } |
788 | ||
789 | int find_line_range(int fd, struct line_range *lr) | |
790 | { | |
804b3606 | 791 | struct line_finder lf = {.lr = lr, .found = 0}; |
631c9def | 792 | int ret; |
804b3606 MH |
793 | Dwarf_Off off = 0, noff; |
794 | size_t cuhl; | |
795 | Dwarf_Die *diep; | |
796 | Dwarf *dbg; | |
804b3606 MH |
797 | |
798 | dbg = dwarf_begin(fd, DWARF_C_READ); | |
799 | if (!dbg) | |
631c9def MH |
800 | return -ENOENT; |
801 | ||
804b3606 | 802 | /* Loop on CUs (Compilation Unit) */ |
631c9def | 803 | while (!lf.found) { |
804b3606 MH |
804 | ret = dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL); |
805 | if (ret != 0) | |
631c9def MH |
806 | break; |
807 | ||
808 | /* Get the DIE(Debugging Information Entry) of this CU */ | |
804b3606 MH |
809 | diep = dwarf_offdie(dbg, off + cuhl, &lf.cu_die); |
810 | if (!diep) | |
811 | continue; | |
631c9def MH |
812 | |
813 | /* Check if target file is included. */ | |
814 | if (lr->file) | |
2a9c8c36 | 815 | lf.fname = cu_find_realpath(&lf.cu_die, lr->file); |
804b3606 | 816 | else |
2a9c8c36 | 817 | lf.fname = 0; |
631c9def | 818 | |
2a9c8c36 | 819 | if (!lr->file || lf.fname) { |
631c9def MH |
820 | if (lr->function) |
821 | find_line_range_by_func(&lf); | |
822 | else { | |
823 | lf.lno_s = lr->start; | |
824 | if (!lr->end) | |
804b3606 | 825 | lf.lno_e = INT_MAX; |
631c9def MH |
826 | else |
827 | lf.lno_e = lr->end; | |
161a26b0 | 828 | find_line_range_by_line(NULL, &lf); |
631c9def | 829 | } |
631c9def | 830 | } |
804b3606 | 831 | off = noff; |
631c9def | 832 | } |
804b3606 MH |
833 | pr_debug("path: %lx\n", (unsigned long)lr->path); |
834 | dwarf_end(dbg); | |
631c9def MH |
835 | return lf.found; |
836 | } | |
837 |