probe-finder.c 29.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33
/*
 * probe-finder.c : C expression to kprobe event converter
 *
 * Written by Masami Hiramatsu <mhiramat@redhat.com>
 *
 * 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 <sys/utsname.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <errno.h>
#include <stdio.h>
#include <unistd.h>
#include <getopt.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <ctype.h>
34

35
#include "string.h"
36 37
#include "event.h"
#include "debug.h"
38
#include "util.h"
39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86
#include "probe-finder.h"


/*
 * 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

87 88 89
/* Kprobe tracer basic type is up to u64 */
#define MAX_BASIC_TYPE_BITS	64

90 91 92 93 94 95 96 97 98 99 100 101 102 103
/* 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);
104
	while (--i1 >= 0 && --i2 >= 0) {
105 106 107 108 109 110
		if (s1[i1] != s2[i2])
			return s1[i1] - s2[i2];
	}
	return 0;
}

111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130
/* Line number list operations */

/* Add a line to line number list */
static void line_list__add_line(struct list_head *head, 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, head, 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 = head;
found:
	pr_debug("line list: add a line %u\n", line);
131
	ln = xzalloc(sizeof(struct line_node));
132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
	ln->line = line;
	INIT_LIST_HEAD(&ln->list);
	list_add(&ln->list, p);
}

/* Check if the line in line number list */
static int line_list__has_line(struct list_head *head, unsigned int line)
{
	struct line_node *ln;

	/* Reverse search, because new line will be the last one */
	list_for_each_entry(ln, head, list)
		if (ln->line == line)
			return 1;

	return 0;
}

/* Init line number list */
static void line_list__init(struct list_head *head)
{
	INIT_LIST_HEAD(head);
}

/* Free line number list */
static void line_list__free(struct list_head *head)
{
	struct line_node *ln;
	while (!list_empty(head)) {
		ln = list_first_entry(head, struct line_node, list);
		list_del(&ln->list);
		free(ln);
	}
}

/* Dwarf wrappers */

/* Find the realpath of the target file. */
static const char *cu_find_realpath(Dwarf_Die *cu_die, const char *fname)
171
{
172 173
	Dwarf_Files *files;
	size_t nfiles, i;
174
	const char *src = NULL;
175 176 177
	int ret;

	if (!fname)
178
		return NULL;
179

180
	ret = dwarf_getsrcfiles(cu_die, &files, &nfiles);
181 182 183 184 185 186 187
	if (ret != 0)
		return NULL;

	for (i = 0; i < nfiles; i++) {
		src = dwarf_filesrc(files, i, NULL, NULL);
		if (strtailcmp(src, fname) == 0)
			break;
188
	}
189 190
	if (i == nfiles)
		return NULL;
191
	return src;
192 193
}

194 195 196 197 198
/* Compare diename and tname */
static bool die_compare_name(Dwarf_Die *dw_die, const char *tname)
{
	const char *name;
	name = dwarf_diename(dw_die);
199
	return name ? strcmp(tname, name) : -1;
200 201
}

202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223
/* Get type die, but skip qualifiers and typedef */
static Dwarf_Die *die_get_real_type(Dwarf_Die *vr_die, Dwarf_Die *die_mem)
{
	Dwarf_Attribute attr;
	int tag;

	do {
		if (dwarf_attr(vr_die, DW_AT_type, &attr) == NULL ||
		    dwarf_formref_die(&attr, die_mem) == NULL)
			return NULL;

		tag = dwarf_tag(die_mem);
		vr_die = die_mem;
	} while (tag == DW_TAG_const_type ||
		 tag == DW_TAG_restrict_type ||
		 tag == DW_TAG_volatile_type ||
		 tag == DW_TAG_shared_type ||
		 tag == DW_TAG_typedef);

	return die_mem;
}

224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248
static bool die_is_signed_type(Dwarf_Die *tp_die)
{
	Dwarf_Attribute attr;
	Dwarf_Word ret;

	if (dwarf_attr(tp_die, DW_AT_encoding, &attr) == NULL ||
	    dwarf_formudata(&attr, &ret) != 0)
		return false;

	return (ret == DW_ATE_signed_char || ret == DW_ATE_signed ||
		ret == DW_ATE_signed_fixed);
}

static int die_get_byte_size(Dwarf_Die *tp_die)
{
	Dwarf_Attribute attr;
	Dwarf_Word ret;

	if (dwarf_attr(tp_die, DW_AT_byte_size, &attr) == NULL ||
	    dwarf_formudata(&attr, &ret) != 0)
		return 0;

	return (int)ret;
}

249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
/* Return values for die_find callbacks */
enum {
	DIE_FIND_CB_FOUND = 0,		/* End of Search */
	DIE_FIND_CB_CHILD = 1,		/* Search only children */
	DIE_FIND_CB_SIBLING = 2,	/* Search only siblings */
	DIE_FIND_CB_CONTINUE = 3,	/* Search children and siblings */
};

/* Search a child die */
static Dwarf_Die *die_find_child(Dwarf_Die *rt_die,
				 int (*callback)(Dwarf_Die *, void *),
				 void *data, Dwarf_Die *die_mem)
{
	Dwarf_Die child_die;
	int ret;

	ret = dwarf_child(rt_die, die_mem);
	if (ret != 0)
		return NULL;

	do {
		ret = callback(die_mem, data);
		if (ret == DIE_FIND_CB_FOUND)
			return die_mem;

		if ((ret & DIE_FIND_CB_CHILD) &&
		    die_find_child(die_mem, callback, data, &child_die)) {
			memcpy(die_mem, &child_die, sizeof(Dwarf_Die));
			return die_mem;
		}
	} while ((ret & DIE_FIND_CB_SIBLING) &&
		 dwarf_siblingof(die_mem, die_mem) == 0);

	return NULL;
}

285 286 287 288 289 290
struct __addr_die_search_param {
	Dwarf_Addr	addr;
	Dwarf_Die	*die_mem;
};

static int __die_search_func_cb(Dwarf_Die *fn_die, void *data)
291
{
292
	struct __addr_die_search_param *ad = data;
293

294 295 296 297 298 299 300
	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;
}
301

302
/* Search a real subprogram including this line, */
303 304
static Dwarf_Die *die_find_real_subprogram(Dwarf_Die *cu_die, Dwarf_Addr addr,
					   Dwarf_Die *die_mem)
305 306 307 308 309 310 311 312 313
{
	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;
314 315
}

316 317
/* die_find callback for inline function search */
static int __die_find_inline_cb(Dwarf_Die *die_mem, void *data)
318
{
319
	Dwarf_Addr *addr = data;
320

321 322 323
	if (dwarf_tag(die_mem) == DW_TAG_inlined_subroutine &&
	    dwarf_haspc(die_mem, *addr))
		return DIE_FIND_CB_FOUND;
324

325
	return DIE_FIND_CB_CONTINUE;
326 327
}

328 329 330
/* Similar to dwarf_getfuncs, but returns inlined_subroutine if exists. */
static Dwarf_Die *die_find_inlinefunc(Dwarf_Die *sp_die, Dwarf_Addr addr,
				      Dwarf_Die *die_mem)
331
{
332
	return die_find_child(sp_die, __die_find_inline_cb, &addr, die_mem);
333 334
}

335
static int __die_find_variable_cb(Dwarf_Die *die_mem, void *data)
336
{
337 338
	const char *name = data;
	int tag;
339

340 341 342 343 344 345 346
	tag = dwarf_tag(die_mem);
	if ((tag == DW_TAG_formal_parameter ||
	     tag == DW_TAG_variable) &&
	    (die_compare_name(die_mem, name) == 0))
		return DIE_FIND_CB_FOUND;

	return DIE_FIND_CB_CONTINUE;
347 348
}

349
/* Find a variable called 'name' */
350 351
static Dwarf_Die *die_find_variable(Dwarf_Die *sp_die, const char *name,
				    Dwarf_Die *die_mem)
352
{
353 354
	return die_find_child(sp_die, __die_find_variable_cb, (void *)name,
			      die_mem);
355 356
}

357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375
static int __die_find_member_cb(Dwarf_Die *die_mem, void *data)
{
	const char *name = data;

	if ((dwarf_tag(die_mem) == DW_TAG_member) &&
	    (die_compare_name(die_mem, name) == 0))
		return DIE_FIND_CB_FOUND;

	return DIE_FIND_CB_SIBLING;
}

/* Find a member called 'name' */
static Dwarf_Die *die_find_member(Dwarf_Die *st_die, const char *name,
				  Dwarf_Die *die_mem)
{
	return die_find_child(st_die, __die_find_member_cb, (void *)name,
			      die_mem);
}

376 377 378 379 380
/*
 * Probe finder related functions
 */

/* Show a location */
381
static int convert_location(Dwarf_Op *op, struct probe_finder *pf)
382
{
383 384
	unsigned int regn;
	Dwarf_Word offs = 0;
385
	bool ref = false;
386
	const char *regs;
387
	struct kprobe_trace_arg *tvar = pf->tvar;
388 389

	/* If this is based on frame buffer, set the offset */
390
	if (op->atom == DW_OP_fbreg) {
391 392 393 394 395
		if (pf->fb_ops == NULL) {
			pr_warning("The attribute of frame base is not "
				   "supported.\n");
			return -ENOTSUP;
		}
396
		ref = true;
397 398 399
		offs = op->number;
		op = &pf->fb_ops[0];
	}
400

401 402 403
	if (op->atom >= DW_OP_breg0 && op->atom <= DW_OP_breg31) {
		regn = op->atom - DW_OP_breg0;
		offs += op->number;
404
		ref = true;
405 406 407 408 409
	} 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;
410
		ref = true;
411 412
	} else if (op->atom == DW_OP_regx) {
		regn = op->number;
413 414 415 416
	} else {
		pr_warning("DW_OP %x is not supported.\n", op->atom);
		return -ENOTSUP;
	}
417 418

	regs = get_arch_regstr(regn);
419 420 421 422
	if (!regs) {
		pr_warning("%u exceeds max register number.\n", regn);
		return -ERANGE;
	}
423

424 425 426 427 428
	tvar->value = xstrdup(regs);
	if (ref) {
		tvar->ref = xzalloc(sizeof(struct kprobe_trace_arg_ref));
		tvar->ref->offset = (long)offs;
	}
429
	return 0;
430 431
}

432 433
static int convert_variable_type(Dwarf_Die *vr_die,
				 struct kprobe_trace_arg *targ)
434 435 436 437 438
{
	Dwarf_Die type;
	char buf[16];
	int ret;

439 440 441 442 443
	if (die_get_real_type(vr_die, &type) == NULL) {
		pr_warning("Failed to get a type information of %s.\n",
			   dwarf_diename(vr_die));
		return -ENOENT;
	}
444 445 446 447 448

	ret = die_get_byte_size(&type) * 8;
	if (ret) {
		/* Check the bitwidth */
		if (ret > MAX_BASIC_TYPE_BITS) {
449 450 451
			pr_info("%s exceeds max-bitwidth."
				" Cut down to %d bits.\n",
				dwarf_diename(&type), MAX_BASIC_TYPE_BITS);
452 453 454 455 456
			ret = MAX_BASIC_TYPE_BITS;
		}

		ret = snprintf(buf, 16, "%c%d",
			       die_is_signed_type(&type) ? 's' : 'u', ret);
457 458 459 460 461 462 463
		if (ret < 0 || ret >= 16) {
			if (ret >= 16)
				ret = -E2BIG;
			pr_warning("Failed to convert variable type: %s\n",
				   strerror(-ret));
			return ret;
		}
464 465
		targ->type = xstrdup(buf);
	}
466
	return 0;
467 468
}

469
static int convert_variable_fields(Dwarf_Die *vr_die, const char *varname,
470
				    struct perf_probe_arg_field *field,
471 472
				    struct kprobe_trace_arg_ref **ref_ptr,
				    Dwarf_Die *die_mem)
473 474 475 476 477 478 479
{
	struct kprobe_trace_arg_ref *ref = *ref_ptr;
	Dwarf_Attribute attr;
	Dwarf_Die type;
	Dwarf_Word offs;

	pr_debug("converting %s in %s\n", field->name, varname);
480 481 482 483
	if (die_get_real_type(vr_die, &type) == NULL) {
		pr_warning("Failed to get the type of %s.\n", varname);
		return -ENOENT;
	}
484 485 486

	/* Check the pointer and dereference */
	if (dwarf_tag(&type) == DW_TAG_pointer_type) {
487 488 489 490 491
		if (!field->ref) {
			pr_err("Semantic error: %s must be referred by '->'\n",
			       field->name);
			return -EINVAL;
		}
492
		/* Get the type pointed by this pointer */
493 494 495 496
		if (die_get_real_type(&type, &type) == NULL) {
			pr_warning("Failed to get the type of %s.\n", varname);
			return -ENOENT;
		}
497
		/* Verify it is a data structure  */
498 499 500 501
		if (dwarf_tag(&type) != DW_TAG_structure_type) {
			pr_warning("%s is not a data structure.\n", varname);
			return -EINVAL;
		}
502

503 504 505 506 507 508
		ref = xzalloc(sizeof(struct kprobe_trace_arg_ref));
		if (*ref_ptr)
			(*ref_ptr)->next = ref;
		else
			*ref_ptr = ref;
	} else {
509
		/* Verify it is a data structure  */
510 511 512 513 514 515 516 517 518 519 520 521 522 523
		if (dwarf_tag(&type) != DW_TAG_structure_type) {
			pr_warning("%s is not a data structure.\n", varname);
			return -EINVAL;
		}
		if (field->ref) {
			pr_err("Semantic error: %s must be referred by '.'\n",
			       field->name);
			return -EINVAL;
		}
		if (!ref) {
			pr_warning("Structure on a register is not "
				   "supported yet.\n");
			return -ENOTSUP;
		}
524 525
	}

526 527 528 529 530
	if (die_find_member(&type, field->name, die_mem) == NULL) {
		pr_warning("%s(tyep:%s) has no member %s.\n", varname,
			   dwarf_diename(&type), field->name);
		return -EINVAL;
	}
531 532

	/* Get the offset of the field */
533
	if (dwarf_attr(die_mem, DW_AT_data_member_location, &attr) == NULL ||
534 535 536 537
	    dwarf_formudata(&attr, &offs) != 0) {
		pr_warning("Failed to get the offset of %s.\n", field->name);
		return -ENOENT;
	}
538 539 540 541
	ref->offset += (long)offs;

	/* Converting next field */
	if (field->next)
542 543 544 545
		return convert_variable_fields(die_mem, field->name,
					       field->next, &ref, die_mem);
	else
		return 0;
546 547
}

548
/* Show a variables in kprobe event format */
549
static int convert_variable(Dwarf_Die *vr_die, struct probe_finder *pf)
550 551
{
	Dwarf_Attribute attr;
552
	Dwarf_Die die_mem;
553 554
	Dwarf_Op *expr;
	size_t nexpr;
555 556
	int ret;

557
	if (dwarf_attr(vr_die, DW_AT_location, &attr) == NULL)
558
		goto error;
559
	/* TODO: handle more than 1 exprs */
560
	ret = dwarf_getlocation_addr(&attr, pf->addr, &expr, &nexpr, 1);
561
	if (ret <= 0 || nexpr == 0)
562
		goto error;
563

564 565 566 567 568
	ret = convert_location(expr, pf);
	if (ret == 0 && pf->pvar->field) {
		ret = convert_variable_fields(vr_die, pf->pvar->var,
					      pf->pvar->field, &pf->tvar->ref,
					      &die_mem);
569 570
		vr_die = &die_mem;
	}
571 572 573 574 575 576
	if (ret == 0) {
		if (pf->pvar->type)
			pf->tvar->type = xstrdup(pf->pvar->type);
		else
			ret = convert_variable_type(vr_die, pf->tvar);
	}
577
	/* *expr will be cached in libdw. Don't free it. */
578
	return ret;
579
error:
580
	/* TODO: Support const_value */
581 582 583
	pr_err("Failed to find the location of %s at this address.\n"
	       " Perhaps, it has been optimized out.\n", pf->pvar->var);
	return -ENOENT;
584 585 586
}

/* Find a variable in a subprogram die */
587
static int find_variable(Dwarf_Die *sp_die, struct probe_finder *pf)
588
{
589
	Dwarf_Die vr_die;
590
	char buf[32], *ptr;
591

592 593 594 595 596
	/* TODO: Support arrays */
	if (pf->pvar->name)
		pf->tvar->name = xstrdup(pf->pvar->name);
	else {
		synthesize_perf_probe_arg(pf->pvar, buf, 32);
597 598 599
		ptr = strchr(buf, ':');	/* Change type separator to _ */
		if (ptr)
			*ptr = '_';
600 601 602 603
		pf->tvar->name = xstrdup(buf);
	}

	if (!is_c_varname(pf->pvar->var)) {
604
		/* Copy raw parameters */
605
		pf->tvar->value = xstrdup(pf->pvar->var);
606
		return 0;
607
	}
608 609 610 611 612 613 614 615 616 617

	pr_debug("Searching '%s' variable in context.\n",
		 pf->pvar->var);
	/* Search child die for local variables and parameters. */
	if (!die_find_variable(sp_die, pf->pvar->var, &vr_die)) {
		pr_warning("Failed to find '%s' in this function.\n",
			   pf->pvar->var);
		return -ENOENT;
	}
	return convert_variable(&vr_die, pf);
618 619 620
}

/* Show a probe point to output buffer */
621
static int convert_probe_point(Dwarf_Die *sp_die, struct probe_finder *pf)
622
{
623
	struct kprobe_trace_event *tev;
624 625
	Dwarf_Addr eaddr;
	Dwarf_Die die_mem;
626
	const char *name;
627
	int ret, i;
628 629
	Dwarf_Attribute fb_attr;
	size_t nops;
630

631 632 633 634
	if (pf->ntevs == MAX_PROBES) {
		pr_warning("Too many( > %d) probe point found.\n", MAX_PROBES);
		return -ERANGE;
	}
635 636
	tev = &pf->tevs[pf->ntevs++];

637 638
	/* If no real subprogram, find a real one */
	if (!sp_die || dwarf_tag(sp_die) != DW_TAG_subprogram) {
639
		sp_die = die_find_real_subprogram(&pf->cu_die,
640
						 pf->addr, &die_mem);
641 642 643 644 645
		if (!sp_die) {
			pr_warning("Failed to find probe point in any "
				   "functions.\n");
			return -ENOENT;
		}
646 647
	}

648
	/* Copy the name of probe point */
649 650
	name = dwarf_diename(sp_die);
	if (name) {
651 652 653 654 655
		if (dwarf_entrypc(sp_die, &eaddr) != 0) {
			pr_warning("Failed to get entry pc of %s\n",
				   dwarf_diename(sp_die));
			return -ENOENT;
		}
656 657 658
		tev->point.symbol = xstrdup(name);
		tev->point.offset = (unsigned long)(pf->addr - eaddr);
	} else
659
		/* This function has no name. */
660 661 662 663
		tev->point.offset = (unsigned long)pf->addr;

	pr_debug("Probe point found: %s+%lu\n", tev->point.symbol,
		 tev->point.offset);
664

665 666
	/* Get the frame base attribute/ops */
	dwarf_attr(sp_die, DW_AT_frame_base, &fb_attr);
667
	ret = dwarf_getlocation_addr(&fb_attr, pf->addr, &pf->fb_ops, &nops, 1);
668
	if (ret <= 0 || nops == 0) {
669
		pf->fb_ops = NULL;
670 671 672
	} else if (nops == 1 && pf->fb_ops[0].atom == DW_OP_call_frame_cfa &&
		   pf->cfi != NULL) {
		Dwarf_Frame *frame;
673 674 675 676 677 678
		if (dwarf_cfi_addrframe(pf->cfi, pf->addr, &frame) != 0 ||
		    dwarf_frame_cfa(frame, &pf->fb_ops, &nops) != 0) {
			pr_warning("Failed to get CFA on 0x%jx\n",
				   (uintmax_t)pf->addr);
			return -ENOENT;
		}
679
	}
680

681
	/* Find each argument */
682 683 684 685 686
	tev->nargs = pf->pev->nargs;
	tev->args = xzalloc(sizeof(struct kprobe_trace_arg) * tev->nargs);
	for (i = 0; i < pf->pev->nargs; i++) {
		pf->pvar = &pf->pev->args[i];
		pf->tvar = &tev->args[i];
687 688 689
		ret = find_variable(sp_die, pf);
		if (ret != 0)
			return ret;
690
	}
691 692 693

	/* *pf->fb_ops will be cached in libdw. Don't free it. */
	pf->fb_ops = NULL;
694
	return 0;
695 696 697
}

/* Find probe point from its line number */
698
static int find_probe_point_by_line(struct probe_finder *pf)
699
{
700 701 702
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
703
	Dwarf_Addr addr;
704
	int lineno;
705
	int ret = 0;
706

707 708 709 710
	if (dwarf_getsrclines(&pf->cu_die, &lines, &nlines) != 0) {
		pr_warning("No source lines found in this CU.\n");
		return -ENOENT;
	}
711

712
	for (i = 0; i < nlines && ret == 0; i++) {
713
		line = dwarf_onesrcline(lines, i);
714 715
		if (dwarf_lineno(line, &lineno) != 0 ||
		    lineno != pf->lno)
716 717
			continue;

718 719 720
		/* TODO: Get fileno from line, but how? */
		if (strtailcmp(dwarf_linesrc(line, NULL, NULL), pf->fname) != 0)
			continue;
721

722 723 724 725
		if (dwarf_lineaddr(line, &addr) != 0) {
			pr_warning("Failed to get the address of the line.\n");
			return -ENOENT;
		}
726 727
		pr_debug("Probe line found: line[%d]:%d addr:0x%jx\n",
			 (int)i, lineno, (uintmax_t)addr);
728
		pf->addr = addr;
729

730
		ret = convert_probe_point(NULL, pf);
731 732
		/* Continuing, because target line might be inlined. */
	}
733
	return ret;
734 735
}

736 737 738 739 740
/* Find lines which match lazy pattern */
static int find_lazy_match_lines(struct list_head *head,
				 const char *fname, const char *pat)
{
	char *fbuf, *p1, *p2;
741
	int fd, ret, line, nlines = 0;
742 743 744
	struct stat st;

	fd = open(fname, O_RDONLY);
745 746 747 748 749 750 751 752 753 754 755
	if (fd < 0) {
		pr_warning("Failed to open %s: %s\n", fname, strerror(-fd));
		return fd;
	}

	ret = fstat(fd, &st);
	if (ret < 0) {
		pr_warning("Failed to get the size of %s: %s\n",
			   fname, strerror(errno));
		return ret;
	}
756
	fbuf = xmalloc(st.st_size + 2);
757 758 759 760 761
	ret = read(fd, fbuf, st.st_size);
	if (ret < 0) {
		pr_warning("Failed to read %s: %s\n", fname, strerror(errno));
		return ret;
	}
762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780
	close(fd);
	fbuf[st.st_size] = '\n';	/* Dummy line */
	fbuf[st.st_size + 1] = '\0';
	p1 = fbuf;
	line = 1;
	while ((p2 = strchr(p1, '\n')) != NULL) {
		*p2 = '\0';
		if (strlazymatch(p1, pat)) {
			line_list__add_line(head, line);
			nlines++;
		}
		line++;
		p1 = p2 + 1;
	}
	free(fbuf);
	return nlines;
}

/* Find probe points from lazy pattern  */
781
static int find_probe_point_lazy(Dwarf_Die *sp_die, struct probe_finder *pf)
782 783 784 785 786 787 788
{
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
	Dwarf_Addr addr;
	Dwarf_Die die_mem;
	int lineno;
789
	int ret = 0;
790 791 792 793

	if (list_empty(&pf->lcache)) {
		/* Matching lazy line pattern */
		ret = find_lazy_match_lines(&pf->lcache, pf->fname,
794
					    pf->pev->point.lazy_line);
795 796 797 798 799
		if (ret == 0) {
			pr_debug("No matched lines found in %s.\n", pf->fname);
			return 0;
		} else if (ret < 0)
			return ret;
800 801
	}

802 803 804 805 806 807
	if (dwarf_getsrclines(&pf->cu_die, &lines, &nlines) != 0) {
		pr_warning("No source lines found in this CU.\n");
		return -ENOENT;
	}

	for (i = 0; i < nlines && ret >= 0; i++) {
808 809
		line = dwarf_onesrcline(lines, i);

810 811
		if (dwarf_lineno(line, &lineno) != 0 ||
		    !line_list__has_line(&pf->lcache, lineno))
812 813 814 815 816 817
			continue;

		/* TODO: Get fileno from line, but how? */
		if (strtailcmp(dwarf_linesrc(line, NULL, NULL), pf->fname) != 0)
			continue;

818 819 820 821 822
		if (dwarf_lineaddr(line, &addr) != 0) {
			pr_debug("Failed to get the address of line %d.\n",
				 lineno);
			continue;
		}
823 824 825 826 827
		if (sp_die) {
			/* Address filtering 1: does sp_die include addr? */
			if (!dwarf_haspc(sp_die, addr))
				continue;
			/* Address filtering 2: No child include addr? */
828
			if (die_find_inlinefunc(sp_die, addr, &die_mem))
829 830 831 832 833 834 835
				continue;
		}

		pr_debug("Probe line found: line[%d]:%d addr:0x%llx\n",
			 (int)i, lineno, (unsigned long long)addr);
		pf->addr = addr;

836
		ret = convert_probe_point(sp_die, pf);
837 838 839
		/* Continuing, because target line might be inlined. */
	}
	/* TODO: deallocate lines, but how? */
840
	return ret;
841 842
}

843 844 845 846 847 848
/* Callback parameter with return value */
struct dwarf_callback_param {
	void *data;
	int retval;
};

849 850
static int probe_point_inline_cb(Dwarf_Die *in_die, void *data)
{
851 852
	struct dwarf_callback_param *param = data;
	struct probe_finder *pf = param->data;
853
	struct perf_probe_point *pp = &pf->pev->point;
854
	Dwarf_Addr addr;
855

856
	if (pp->lazy_line)
857
		param->retval = find_probe_point_lazy(in_die, pf);
858 859
	else {
		/* Get probe address */
860 861 862 863 864 865 866
		if (dwarf_entrypc(in_die, &addr) != 0) {
			pr_warning("Failed to get entry pc of %s.\n",
				   dwarf_diename(in_die));
			param->retval = -ENOENT;
			return DWARF_CB_ABORT;
		}
		pf->addr = addr;
867 868 869 870
		pf->addr += pp->offset;
		pr_debug("found inline addr: 0x%jx\n",
			 (uintmax_t)pf->addr);

871
		param->retval = convert_probe_point(in_die, pf);
872
	}
873 874 875

	return DWARF_CB_OK;
}
876

877
/* Search function from function name */
878
static int probe_point_search_cb(Dwarf_Die *sp_die, void *data)
879
{
880 881
	struct dwarf_callback_param *param = data;
	struct probe_finder *pf = param->data;
882
	struct perf_probe_point *pp = &pf->pev->point;
883

884 885 886
	/* Check tag and diename */
	if (dwarf_tag(sp_die) != DW_TAG_subprogram ||
	    die_compare_name(sp_die, pp->function) != 0)
887
		return DWARF_CB_OK;
888

889
	pf->fname = dwarf_decl_file(sp_die);
890 891 892
	if (pp->line) { /* Function relative line */
		dwarf_decl_line(sp_die, &pf->lno);
		pf->lno += pp->line;
893
		param->retval = find_probe_point_by_line(pf);
894 895
	} else if (!dwarf_func_inline(sp_die)) {
		/* Real function */
896
		if (pp->lazy_line)
897
			param->retval = find_probe_point_lazy(sp_die, pf);
898
		else {
899 900 901 902 903 904
			if (dwarf_entrypc(sp_die, &pf->addr) != 0) {
				pr_warning("Failed to get entry pc of %s.\n",
					   dwarf_diename(sp_die));
				param->retval = -ENOENT;
				return DWARF_CB_ABORT;
			}
905 906
			pf->addr += pp->offset;
			/* TODO: Check the address in this function */
907
			param->retval = convert_probe_point(sp_die, pf);
908
		}
909 910 911
	} else {
		struct dwarf_callback_param _param = {.data = (void *)pf,
						      .retval = 0};
912
		/* Inlined function: search instances */
913 914 915 916
		dwarf_func_inline_instances(sp_die, probe_point_inline_cb,
					    &_param);
		param->retval = _param.retval;
	}
917

918
	return DWARF_CB_ABORT; /* Exit; no same symbol in this CU. */
919 920
}

921
static int find_probe_point_by_func(struct probe_finder *pf)
922
{
923 924 925 926
	struct dwarf_callback_param _param = {.data = (void *)pf,
					      .retval = 0};
	dwarf_getfuncs(&pf->cu_die, probe_point_search_cb, &_param, 0);
	return _param.retval;
927 928
}

929 930 931
/* Find kprobe_trace_events specified by perf_probe_event from debuginfo */
int find_kprobe_trace_events(int fd, struct perf_probe_event *pev,
			     struct kprobe_trace_event **tevs)
932
{
933 934
	struct probe_finder pf = {.pev = pev};
	struct perf_probe_point *pp = &pev->point;
935 936 937 938
	Dwarf_Off off, noff;
	size_t cuhl;
	Dwarf_Die *diep;
	Dwarf *dbg;
939
	int ret = 0;
940

941 942 943 944
	pf.tevs = xzalloc(sizeof(struct kprobe_trace_event) * MAX_PROBES);
	*tevs = pf.tevs;
	pf.ntevs = 0;

945
	dbg = dwarf_begin(fd, DWARF_C_READ);
946 947 948 949 950
	if (!dbg) {
		pr_warning("No dwarf info found in the vmlinux - "
			"please rebuild with CONFIG_DEBUG_INFO=y.\n");
		return -EBADF;
	}
951

952 953 954
	/* Get the call frame information from this dwarf */
	pf.cfi = dwarf_getcfi(dbg);

955
	off = 0;
956
	line_list__init(&pf.lcache);
957
	/* Loop on CUs (Compilation Unit) */
958 959
	while (!dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL) &&
	       ret >= 0) {
960
		/* Get the DIE(Debugging Information Entry) of this CU */
961 962 963
		diep = dwarf_offdie(dbg, off + cuhl, &pf.cu_die);
		if (!diep)
			continue;
964 965 966

		/* Check if target file is included. */
		if (pp->file)
967
			pf.fname = cu_find_realpath(&pf.cu_die, pp->file);
968
		else
969
			pf.fname = NULL;
970

971
		if (!pp->file || pf.fname) {
972
			if (pp->function)
973
				ret = find_probe_point_by_func(&pf);
974
			else if (pp->lazy_line)
975
				ret = find_probe_point_lazy(NULL, &pf);
976 977
			else {
				pf.lno = pp->line;
978
				ret = find_probe_point_by_line(&pf);
979
			}
980
		}
981
		off = noff;
982
	}
983
	line_list__free(&pf.lcache);
984
	dwarf_end(dbg);
985

986
	return (ret < 0) ? ret : pf.ntevs;
987 988
}

989 990 991 992 993 994 995 996 997 998
/* Reverse search */
int find_perf_probe_point(int fd, unsigned long addr,
			  struct perf_probe_point *ppt)
{
	Dwarf_Die cudie, spdie, indie;
	Dwarf *dbg;
	Dwarf_Line *line;
	Dwarf_Addr laddr, eaddr;
	const char *tmp;
	int lineno, ret = 0;
999
	bool found = false;
1000 1001 1002

	dbg = dwarf_begin(fd, DWARF_C_READ);
	if (!dbg)
1003
		return -EBADF;
1004 1005

	/* Find cu die */
1006 1007 1008 1009
	if (!dwarf_addrdie(dbg, (Dwarf_Addr)addr, &cudie)) {
		ret = -EINVAL;
		goto end;
	}
1010 1011 1012 1013

	/* Find a corresponding line */
	line = dwarf_getsrc_die(&cudie, (Dwarf_Addr)addr);
	if (line) {
1014 1015 1016
		if (dwarf_lineaddr(line, &laddr) == 0 &&
		    (Dwarf_Addr)addr == laddr &&
		    dwarf_lineno(line, &lineno) == 0) {
1017
			tmp = dwarf_linesrc(line, NULL, NULL);
1018 1019 1020 1021 1022
			if (tmp) {
				ppt->line = lineno;
				ppt->file = xstrdup(tmp);
				found = true;
			}
1023 1024 1025 1026 1027 1028
		}
	}

	/* Find a corresponding function */
	if (die_find_real_subprogram(&cudie, (Dwarf_Addr)addr, &spdie)) {
		tmp = dwarf_diename(&spdie);
1029
		if (!tmp || dwarf_entrypc(&spdie, &eaddr) != 0)
1030 1031
			goto end;

1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051
		if (ppt->line) {
			if (die_find_inlinefunc(&spdie, (Dwarf_Addr)addr,
						&indie)) {
				/* addr in an inline function */
				tmp = dwarf_diename(&indie);
				if (!tmp)
					goto end;
				ret = dwarf_decl_line(&indie, &lineno);
			} else {
				if (eaddr == addr) {	/* Function entry */
					lineno = ppt->line;
					ret = 0;
				} else
					ret = dwarf_decl_line(&spdie, &lineno);
			}
			if (ret == 0) {
				/* Make a relative line number */
				ppt->line -= lineno;
				goto found;
			}
1052
		}
1053 1054 1055
		/* We don't have a line number, let's use offset */
		ppt->offset = addr - (unsigned long)eaddr;
found:
1056
		ppt->function = xstrdup(tmp);
1057
		found = true;
1058 1059 1060 1061
	}

end:
	dwarf_end(dbg);
1062 1063
	if (ret >= 0)
		ret = found ? 1 : 0;
1064 1065 1066 1067
	return ret;
}


1068
/* Find line range from its line number */
1069
static int find_line_range_by_line(Dwarf_Die *sp_die, struct line_finder *lf)
1070
{
1071 1072 1073
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
1074
	Dwarf_Addr addr;
1075 1076
	int lineno;
	const char *src;
1077
	Dwarf_Die die_mem;
1078

1079
	line_list__init(&lf->lr->line_list);
1080 1081 1082 1083
	if (dwarf_getsrclines(&lf->cu_die, &lines, &nlines) != 0) {
		pr_warning("No source lines found in this CU.\n");
		return -ENOENT;
	}
1084

1085 1086
	for (i = 0; i < nlines; i++) {
		line = dwarf_onesrcline(lines, i);
1087 1088
		if (dwarf_lineno(line, &lineno) != 0 ||
		    (lf->lno_s > lineno || lf->lno_e < lineno))
1089 1090
			continue;

1091 1092
		if (sp_die) {
			/* Address filtering 1: does sp_die include addr? */
1093 1094
			if (dwarf_lineaddr(line, &addr) != 0 ||
			    !dwarf_haspc(sp_die, addr))
1095 1096 1097
				continue;

			/* Address filtering 2: No child include addr? */
1098
			if (die_find_inlinefunc(sp_die, addr, &die_mem))
1099 1100 1101
				continue;
		}

1102 1103 1104
		/* TODO: Get fileno from line, but how? */
		src = dwarf_linesrc(line, NULL, NULL);
		if (strtailcmp(src, lf->fname) != 0)
1105 1106
			continue;

1107 1108
		/* Copy real path */
		if (!lf->lr->path)
1109
			lf->lr->path = xstrdup(src);
1110
		line_list__add_line(&lf->lr->line_list, (unsigned int)lineno);
1111
	}
1112
	/* Update status */
1113 1114
	if (!list_empty(&lf->lr->line_list))
		lf->found = 1;
1115 1116 1117 1118
	else {
		free(lf->lr->path);
		lf->lr->path = NULL;
	}
1119
	return lf->found;
1120 1121
}

1122 1123
static int line_range_inline_cb(Dwarf_Die *in_die, void *data)
{
1124 1125 1126
	struct dwarf_callback_param *param = data;

	param->retval = find_line_range_by_line(in_die, param->data);
1127 1128 1129
	return DWARF_CB_ABORT;	/* No need to find other instances */
}

1130
/* Search function from function name */
1131
static int line_range_search_cb(Dwarf_Die *sp_die, void *data)
1132
{
1133 1134
	struct dwarf_callback_param *param = data;
	struct line_finder *lf = param->data;
1135 1136
	struct line_range *lr = lf->lr;

1137 1138 1139 1140
	if (dwarf_tag(sp_die) == DW_TAG_subprogram &&
	    die_compare_name(sp_die, lr->function) == 0) {
		lf->fname = dwarf_decl_file(sp_die);
		dwarf_decl_line(sp_die, &lr->offset);
1141
		pr_debug("fname: %s, lineno:%d\n", lf->fname, lr->offset);
1142 1143
		lf->lno_s = lr->offset + lr->start;
		if (!lr->end)
1144
			lf->lno_e = INT_MAX;
1145 1146 1147 1148
		else
			lf->lno_e = lr->offset + lr->end;
		lr->start = lf->lno_s;
		lr->end = lf->lno_e;
1149 1150 1151 1152
		if (dwarf_func_inline(sp_die)) {
			struct dwarf_callback_param _param;
			_param.data = (void *)lf;
			_param.retval = 0;
1153
			dwarf_func_inline_instances(sp_die,
1154 1155 1156 1157 1158 1159
						    line_range_inline_cb,
						    &_param);
			param->retval = _param.retval;
		} else
			param->retval = find_line_range_by_line(sp_die, lf);
		return DWARF_CB_ABORT;
1160
	}
1161
	return DWARF_CB_OK;
1162 1163
}

1164
static int find_line_range_by_func(struct line_finder *lf)
1165
{
1166 1167 1168
	struct dwarf_callback_param param = {.data = (void *)lf, .retval = 0};
	dwarf_getfuncs(&lf->cu_die, line_range_search_cb, &param, 0);
	return param.retval;
1169 1170 1171 1172
}

int find_line_range(int fd, struct line_range *lr)
{
1173
	struct line_finder lf = {.lr = lr, .found = 0};
1174
	int ret = 0;
1175 1176 1177 1178 1179 1180
	Dwarf_Off off = 0, noff;
	size_t cuhl;
	Dwarf_Die *diep;
	Dwarf *dbg;

	dbg = dwarf_begin(fd, DWARF_C_READ);
1181 1182 1183 1184 1185
	if (!dbg) {
		pr_warning("No dwarf info found in the vmlinux - "
			"please rebuild with CONFIG_DEBUG_INFO=y.\n");
		return -EBADF;
	}
1186

1187
	/* Loop on CUs (Compilation Unit) */
1188 1189
	while (!lf.found && ret >= 0) {
		if (dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL) != 0)
1190 1191 1192
			break;

		/* Get the DIE(Debugging Information Entry) of this CU */
1193 1194 1195
		diep = dwarf_offdie(dbg, off + cuhl, &lf.cu_die);
		if (!diep)
			continue;
1196 1197 1198

		/* Check if target file is included. */
		if (lr->file)
1199
			lf.fname = cu_find_realpath(&lf.cu_die, lr->file);
1200
		else
1201
			lf.fname = 0;
1202

1203
		if (!lr->file || lf.fname) {
1204
			if (lr->function)
1205
				ret = find_line_range_by_func(&lf);
1206 1207 1208
			else {
				lf.lno_s = lr->start;
				if (!lr->end)
1209
					lf.lno_e = INT_MAX;
1210 1211
				else
					lf.lno_e = lr->end;
1212
				ret = find_line_range_by_line(NULL, &lf);
1213 1214
			}
		}
1215
		off = noff;
1216
	}
1217 1218
	pr_debug("path: %lx\n", (unsigned long)lr->path);
	dwarf_end(dbg);
1219 1220

	return (ret < 0) ? ret : lf.found;
1221 1222
}