probe-finder.c 30.3 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
/* Line number list operations */

/* Add a line to line number list */
114
static int line_list__add_line(struct list_head *head, int line)
115 116 117 118 119 120 121 122 123 124
{
	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 */
125
			return 1;
126 127 128 129 130
	}
	/* List is empty, or the smallest entry */
	p = head;
found:
	pr_debug("line list: add a line %u\n", line);
131 132 133
	ln = zalloc(sizeof(struct line_node));
	if (ln == NULL)
		return -ENOMEM;
134 135 136
	ln->line = line;
	INIT_LIST_HEAD(&ln->list);
	list_add(&ln->list, p);
137
	return 0;
138 139 140
}

/* Check if the line in line number list */
141
static int line_list__has_line(struct list_head *head, int line)
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 171 172 173
{
	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)
174
{
175 176
	Dwarf_Files *files;
	size_t nfiles, i;
177
	const char *src = NULL;
178 179 180
	int ret;

	if (!fname)
181
		return NULL;
182

183
	ret = dwarf_getsrcfiles(cu_die, &files, &nfiles);
184 185 186 187 188 189 190
	if (ret != 0)
		return NULL;

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

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

205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226
/* 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;
}

227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251
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;
}

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 285 286 287
/* 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;
}

288 289 290 291 292 293
struct __addr_die_search_param {
	Dwarf_Addr	addr;
	Dwarf_Die	*die_mem;
};

static int __die_search_func_cb(Dwarf_Die *fn_die, void *data)
294
{
295
	struct __addr_die_search_param *ad = data;
296

297 298 299 300 301 302 303
	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;
}
304

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

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

324 325 326
	if (dwarf_tag(die_mem) == DW_TAG_inlined_subroutine &&
	    dwarf_haspc(die_mem, *addr))
		return DIE_FIND_CB_FOUND;
327

328
	return DIE_FIND_CB_CONTINUE;
329 330
}

331 332 333
/* 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)
334
{
335
	return die_find_child(sp_die, __die_find_inline_cb, &addr, die_mem);
336 337
}

338
static int __die_find_variable_cb(Dwarf_Die *die_mem, void *data)
339
{
340 341
	const char *name = data;
	int tag;
342

343 344 345 346 347 348 349
	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;
350 351
}

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

360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378
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);
}

379 380 381 382 383
/*
 * Probe finder related functions
 */

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

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

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

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

427 428 429 430
	tvar->value = strdup(regs);
	if (tvar->value == NULL)
		return -ENOMEM;

431
	if (ref) {
432 433 434
		tvar->ref = zalloc(sizeof(struct kprobe_trace_arg_ref));
		if (tvar->ref == NULL)
			return -ENOMEM;
435 436
		tvar->ref->offset = (long)offs;
	}
437
	return 0;
438 439
}

440 441
static int convert_variable_type(Dwarf_Die *vr_die,
				 struct kprobe_trace_arg *targ)
442 443 444 445 446
{
	Dwarf_Die type;
	char buf[16];
	int ret;

447 448 449 450 451
	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;
	}
452 453 454 455 456

	ret = die_get_byte_size(&type) * 8;
	if (ret) {
		/* Check the bitwidth */
		if (ret > MAX_BASIC_TYPE_BITS) {
457 458 459
			pr_info("%s exceeds max-bitwidth."
				" Cut down to %d bits.\n",
				dwarf_diename(&type), MAX_BASIC_TYPE_BITS);
460 461 462 463 464
			ret = MAX_BASIC_TYPE_BITS;
		}

		ret = snprintf(buf, 16, "%c%d",
			       die_is_signed_type(&type) ? 's' : 'u', ret);
465 466 467 468 469 470 471
		if (ret < 0 || ret >= 16) {
			if (ret >= 16)
				ret = -E2BIG;
			pr_warning("Failed to convert variable type: %s\n",
				   strerror(-ret));
			return ret;
		}
472 473 474
		targ->type = strdup(buf);
		if (targ->type == NULL)
			return -ENOMEM;
475
	}
476
	return 0;
477 478
}

479
static int convert_variable_fields(Dwarf_Die *vr_die, const char *varname,
480
				    struct perf_probe_arg_field *field,
481 482
				    struct kprobe_trace_arg_ref **ref_ptr,
				    Dwarf_Die *die_mem)
483 484 485 486 487 488 489
{
	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);
490 491 492 493
	if (die_get_real_type(vr_die, &type) == NULL) {
		pr_warning("Failed to get the type of %s.\n", varname);
		return -ENOENT;
	}
494 495 496

	/* Check the pointer and dereference */
	if (dwarf_tag(&type) == DW_TAG_pointer_type) {
497 498 499 500 501
		if (!field->ref) {
			pr_err("Semantic error: %s must be referred by '->'\n",
			       field->name);
			return -EINVAL;
		}
502
		/* Get the type pointed by this pointer */
503 504 505 506
		if (die_get_real_type(&type, &type) == NULL) {
			pr_warning("Failed to get the type of %s.\n", varname);
			return -ENOENT;
		}
507
		/* Verify it is a data structure  */
508 509 510 511
		if (dwarf_tag(&type) != DW_TAG_structure_type) {
			pr_warning("%s is not a data structure.\n", varname);
			return -EINVAL;
		}
512

513 514 515
		ref = zalloc(sizeof(struct kprobe_trace_arg_ref));
		if (ref == NULL)
			return -ENOMEM;
516 517 518 519 520
		if (*ref_ptr)
			(*ref_ptr)->next = ref;
		else
			*ref_ptr = ref;
	} else {
521
		/* Verify it is a data structure  */
522 523 524 525 526 527 528 529 530 531 532 533 534 535
		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;
		}
536 537
	}

538 539 540 541 542
	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;
	}
543 544

	/* Get the offset of the field */
545
	if (dwarf_attr(die_mem, DW_AT_data_member_location, &attr) == NULL ||
546 547 548 549
	    dwarf_formudata(&attr, &offs) != 0) {
		pr_warning("Failed to get the offset of %s.\n", field->name);
		return -ENOENT;
	}
550 551 552 553
	ref->offset += (long)offs;

	/* Converting next field */
	if (field->next)
554 555 556 557
		return convert_variable_fields(die_mem, field->name,
					       field->next, &ref, die_mem);
	else
		return 0;
558 559
}

560
/* Show a variables in kprobe event format */
561
static int convert_variable(Dwarf_Die *vr_die, struct probe_finder *pf)
562 563
{
	Dwarf_Attribute attr;
564
	Dwarf_Die die_mem;
565 566
	Dwarf_Op *expr;
	size_t nexpr;
567 568
	int ret;

569
	if (dwarf_attr(vr_die, DW_AT_location, &attr) == NULL)
570
		goto error;
571
	/* TODO: handle more than 1 exprs */
572
	ret = dwarf_getlocation_addr(&attr, pf->addr, &expr, &nexpr, 1);
573
	if (ret <= 0 || nexpr == 0)
574
		goto error;
575

576 577 578 579 580
	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);
581 582
		vr_die = &die_mem;
	}
583
	if (ret == 0) {
584 585 586 587 588
		if (pf->pvar->type) {
			pf->tvar->type = strdup(pf->pvar->type);
			if (pf->tvar->type == NULL)
				ret = -ENOMEM;
		} else
589 590
			ret = convert_variable_type(vr_die, pf->tvar);
	}
591
	/* *expr will be cached in libdw. Don't free it. */
592
	return ret;
593
error:
594
	/* TODO: Support const_value */
595 596 597
	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;
598 599 600
}

/* Find a variable in a subprogram die */
601
static int find_variable(Dwarf_Die *sp_die, struct probe_finder *pf)
602
{
603
	Dwarf_Die vr_die;
604
	char buf[32], *ptr;
605
	int ret;
606

607 608
	/* TODO: Support arrays */
	if (pf->pvar->name)
609
		pf->tvar->name = strdup(pf->pvar->name);
610
	else {
611 612 613
		ret = synthesize_perf_probe_arg(pf->pvar, buf, 32);
		if (ret < 0)
			return ret;
614 615 616
		ptr = strchr(buf, ':');	/* Change type separator to _ */
		if (ptr)
			*ptr = '_';
617
		pf->tvar->name = strdup(buf);
618
	}
619 620
	if (pf->tvar->name == NULL)
		return -ENOMEM;
621 622

	if (!is_c_varname(pf->pvar->var)) {
623
		/* Copy raw parameters */
624 625 626 627 628
		pf->tvar->value = strdup(pf->pvar->var);
		if (pf->tvar->value == NULL)
			return -ENOMEM;
		else
			return 0;
629
	}
630 631 632 633 634 635 636 637 638 639

	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);
640 641 642
}

/* Show a probe point to output buffer */
643
static int convert_probe_point(Dwarf_Die *sp_die, struct probe_finder *pf)
644
{
645
	struct kprobe_trace_event *tev;
646 647
	Dwarf_Addr eaddr;
	Dwarf_Die die_mem;
648
	const char *name;
649
	int ret, i;
650 651
	Dwarf_Attribute fb_attr;
	size_t nops;
652

653 654 655 656
	if (pf->ntevs == MAX_PROBES) {
		pr_warning("Too many( > %d) probe point found.\n", MAX_PROBES);
		return -ERANGE;
	}
657 658
	tev = &pf->tevs[pf->ntevs++];

659 660
	/* If no real subprogram, find a real one */
	if (!sp_die || dwarf_tag(sp_die) != DW_TAG_subprogram) {
661
		sp_die = die_find_real_subprogram(&pf->cu_die,
662
						 pf->addr, &die_mem);
663 664 665 666 667
		if (!sp_die) {
			pr_warning("Failed to find probe point in any "
				   "functions.\n");
			return -ENOENT;
		}
668 669
	}

670
	/* Copy the name of probe point */
671 672
	name = dwarf_diename(sp_die);
	if (name) {
673 674 675 676 677
		if (dwarf_entrypc(sp_die, &eaddr) != 0) {
			pr_warning("Failed to get entry pc of %s\n",
				   dwarf_diename(sp_die));
			return -ENOENT;
		}
678 679 680
		tev->point.symbol = strdup(name);
		if (tev->point.symbol == NULL)
			return -ENOMEM;
681 682
		tev->point.offset = (unsigned long)(pf->addr - eaddr);
	} else
683
		/* This function has no name. */
684 685 686 687
		tev->point.offset = (unsigned long)pf->addr;

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

689 690
	/* Get the frame base attribute/ops */
	dwarf_attr(sp_die, DW_AT_frame_base, &fb_attr);
691
	ret = dwarf_getlocation_addr(&fb_attr, pf->addr, &pf->fb_ops, &nops, 1);
692
	if (ret <= 0 || nops == 0) {
693
		pf->fb_ops = NULL;
694 695 696
	} else if (nops == 1 && pf->fb_ops[0].atom == DW_OP_call_frame_cfa &&
		   pf->cfi != NULL) {
		Dwarf_Frame *frame;
697 698 699 700 701 702
		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;
		}
703
	}
704

705
	/* Find each argument */
706
	tev->nargs = pf->pev->nargs;
707 708 709
	tev->args = zalloc(sizeof(struct kprobe_trace_arg) * tev->nargs);
	if (tev->args == NULL)
		return -ENOMEM;
710 711 712
	for (i = 0; i < pf->pev->nargs; i++) {
		pf->pvar = &pf->pev->args[i];
		pf->tvar = &tev->args[i];
713 714 715
		ret = find_variable(sp_die, pf);
		if (ret != 0)
			return ret;
716
	}
717 718 719

	/* *pf->fb_ops will be cached in libdw. Don't free it. */
	pf->fb_ops = NULL;
720
	return 0;
721 722 723
}

/* Find probe point from its line number */
724
static int find_probe_point_by_line(struct probe_finder *pf)
725
{
726 727 728
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
729
	Dwarf_Addr addr;
730
	int lineno;
731
	int ret = 0;
732

733 734 735 736
	if (dwarf_getsrclines(&pf->cu_die, &lines, &nlines) != 0) {
		pr_warning("No source lines found in this CU.\n");
		return -ENOENT;
	}
737

738
	for (i = 0; i < nlines && ret == 0; i++) {
739
		line = dwarf_onesrcline(lines, i);
740 741
		if (dwarf_lineno(line, &lineno) != 0 ||
		    lineno != pf->lno)
742 743
			continue;

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

748 749 750 751
		if (dwarf_lineaddr(line, &addr) != 0) {
			pr_warning("Failed to get the address of the line.\n");
			return -ENOENT;
		}
752 753
		pr_debug("Probe line found: line[%d]:%d addr:0x%jx\n",
			 (int)i, lineno, (uintmax_t)addr);
754
		pf->addr = addr;
755

756
		ret = convert_probe_point(NULL, pf);
757 758
		/* Continuing, because target line might be inlined. */
	}
759
	return ret;
760 761
}

762 763 764 765 766
/* 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;
767
	int fd, ret, line, nlines = 0;
768 769 770
	struct stat st;

	fd = open(fname, O_RDONLY);
771 772 773 774 775 776 777 778 779 780 781
	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;
	}
782
	fbuf = xmalloc(st.st_size + 2);
783 784 785 786 787
	ret = read(fd, fbuf, st.st_size);
	if (ret < 0) {
		pr_warning("Failed to read %s: %s\n", fname, strerror(errno));
		return ret;
	}
788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806
	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  */
807
static int find_probe_point_lazy(Dwarf_Die *sp_die, struct probe_finder *pf)
808 809 810 811 812 813 814
{
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
	Dwarf_Addr addr;
	Dwarf_Die die_mem;
	int lineno;
815
	int ret = 0;
816 817 818 819

	if (list_empty(&pf->lcache)) {
		/* Matching lazy line pattern */
		ret = find_lazy_match_lines(&pf->lcache, pf->fname,
820
					    pf->pev->point.lazy_line);
821 822 823 824 825
		if (ret == 0) {
			pr_debug("No matched lines found in %s.\n", pf->fname);
			return 0;
		} else if (ret < 0)
			return ret;
826 827
	}

828 829 830 831 832 833
	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++) {
834 835
		line = dwarf_onesrcline(lines, i);

836 837
		if (dwarf_lineno(line, &lineno) != 0 ||
		    !line_list__has_line(&pf->lcache, lineno))
838 839 840 841 842 843
			continue;

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

844 845 846 847 848
		if (dwarf_lineaddr(line, &addr) != 0) {
			pr_debug("Failed to get the address of line %d.\n",
				 lineno);
			continue;
		}
849 850 851 852 853
		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? */
854
			if (die_find_inlinefunc(sp_die, addr, &die_mem))
855 856 857 858 859 860 861
				continue;
		}

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

862
		ret = convert_probe_point(sp_die, pf);
863 864 865
		/* Continuing, because target line might be inlined. */
	}
	/* TODO: deallocate lines, but how? */
866
	return ret;
867 868
}

869 870 871 872 873 874
/* Callback parameter with return value */
struct dwarf_callback_param {
	void *data;
	int retval;
};

875 876
static int probe_point_inline_cb(Dwarf_Die *in_die, void *data)
{
877 878
	struct dwarf_callback_param *param = data;
	struct probe_finder *pf = param->data;
879
	struct perf_probe_point *pp = &pf->pev->point;
880
	Dwarf_Addr addr;
881

882
	if (pp->lazy_line)
883
		param->retval = find_probe_point_lazy(in_die, pf);
884 885
	else {
		/* Get probe address */
886 887 888 889 890 891 892
		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;
893 894 895 896
		pf->addr += pp->offset;
		pr_debug("found inline addr: 0x%jx\n",
			 (uintmax_t)pf->addr);

897
		param->retval = convert_probe_point(in_die, pf);
898
	}
899 900 901

	return DWARF_CB_OK;
}
902

903
/* Search function from function name */
904
static int probe_point_search_cb(Dwarf_Die *sp_die, void *data)
905
{
906 907
	struct dwarf_callback_param *param = data;
	struct probe_finder *pf = param->data;
908
	struct perf_probe_point *pp = &pf->pev->point;
909

910 911 912
	/* Check tag and diename */
	if (dwarf_tag(sp_die) != DW_TAG_subprogram ||
	    die_compare_name(sp_die, pp->function) != 0)
913
		return DWARF_CB_OK;
914

915
	pf->fname = dwarf_decl_file(sp_die);
916 917 918
	if (pp->line) { /* Function relative line */
		dwarf_decl_line(sp_die, &pf->lno);
		pf->lno += pp->line;
919
		param->retval = find_probe_point_by_line(pf);
920 921
	} else if (!dwarf_func_inline(sp_die)) {
		/* Real function */
922
		if (pp->lazy_line)
923
			param->retval = find_probe_point_lazy(sp_die, pf);
924
		else {
925 926 927 928 929 930
			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;
			}
931 932
			pf->addr += pp->offset;
			/* TODO: Check the address in this function */
933
			param->retval = convert_probe_point(sp_die, pf);
934
		}
935 936 937
	} else {
		struct dwarf_callback_param _param = {.data = (void *)pf,
						      .retval = 0};
938
		/* Inlined function: search instances */
939 940 941 942
		dwarf_func_inline_instances(sp_die, probe_point_inline_cb,
					    &_param);
		param->retval = _param.retval;
	}
943

944
	return DWARF_CB_ABORT; /* Exit; no same symbol in this CU. */
945 946
}

947
static int find_probe_point_by_func(struct probe_finder *pf)
948
{
949 950 951 952
	struct dwarf_callback_param _param = {.data = (void *)pf,
					      .retval = 0};
	dwarf_getfuncs(&pf->cu_die, probe_point_search_cb, &_param, 0);
	return _param.retval;
953 954
}

955 956 957
/* 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)
958
{
959 960
	struct probe_finder pf = {.pev = pev};
	struct perf_probe_point *pp = &pev->point;
961 962 963 964
	Dwarf_Off off, noff;
	size_t cuhl;
	Dwarf_Die *diep;
	Dwarf *dbg;
965
	int ret = 0;
966

967 968 969
	pf.tevs = zalloc(sizeof(struct kprobe_trace_event) * MAX_PROBES);
	if (pf.tevs == NULL)
		return -ENOMEM;
970 971 972
	*tevs = pf.tevs;
	pf.ntevs = 0;

973
	dbg = dwarf_begin(fd, DWARF_C_READ);
974 975 976 977 978
	if (!dbg) {
		pr_warning("No dwarf info found in the vmlinux - "
			"please rebuild with CONFIG_DEBUG_INFO=y.\n");
		return -EBADF;
	}
979

980 981 982
	/* Get the call frame information from this dwarf */
	pf.cfi = dwarf_getcfi(dbg);

983
	off = 0;
984
	line_list__init(&pf.lcache);
985
	/* Loop on CUs (Compilation Unit) */
986 987
	while (!dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL) &&
	       ret >= 0) {
988
		/* Get the DIE(Debugging Information Entry) of this CU */
989 990 991
		diep = dwarf_offdie(dbg, off + cuhl, &pf.cu_die);
		if (!diep)
			continue;
992 993 994

		/* Check if target file is included. */
		if (pp->file)
995
			pf.fname = cu_find_realpath(&pf.cu_die, pp->file);
996
		else
997
			pf.fname = NULL;
998

999
		if (!pp->file || pf.fname) {
1000
			if (pp->function)
1001
				ret = find_probe_point_by_func(&pf);
1002
			else if (pp->lazy_line)
1003
				ret = find_probe_point_lazy(NULL, &pf);
1004 1005
			else {
				pf.lno = pp->line;
1006
				ret = find_probe_point_by_line(&pf);
1007
			}
1008
		}
1009
		off = noff;
1010
	}
1011
	line_list__free(&pf.lcache);
1012
	dwarf_end(dbg);
1013

1014
	return (ret < 0) ? ret : pf.ntevs;
1015 1016
}

1017 1018 1019 1020 1021 1022 1023 1024 1025 1026
/* 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;
1027
	bool found = false;
1028 1029 1030

	dbg = dwarf_begin(fd, DWARF_C_READ);
	if (!dbg)
1031
		return -EBADF;
1032 1033

	/* Find cu die */
1034 1035 1036 1037
	if (!dwarf_addrdie(dbg, (Dwarf_Addr)addr, &cudie)) {
		ret = -EINVAL;
		goto end;
	}
1038 1039 1040 1041

	/* Find a corresponding line */
	line = dwarf_getsrc_die(&cudie, (Dwarf_Addr)addr);
	if (line) {
1042 1043 1044
		if (dwarf_lineaddr(line, &laddr) == 0 &&
		    (Dwarf_Addr)addr == laddr &&
		    dwarf_lineno(line, &lineno) == 0) {
1045
			tmp = dwarf_linesrc(line, NULL, NULL);
1046 1047
			if (tmp) {
				ppt->line = lineno;
1048 1049 1050 1051 1052
				ppt->file = strdup(tmp);
				if (ppt->file == NULL) {
					ret = -ENOMEM;
					goto end;
				}
1053 1054
				found = true;
			}
1055 1056 1057 1058 1059 1060
		}
	}

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

1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083
		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;
			}
1084
		}
1085 1086 1087
		/* We don't have a line number, let's use offset */
		ppt->offset = addr - (unsigned long)eaddr;
found:
1088 1089 1090 1091 1092
		ppt->function = strdup(tmp);
		if (ppt->function == NULL) {
			ret = -ENOMEM;
			goto end;
		}
1093
		found = true;
1094 1095 1096 1097
	}

end:
	dwarf_end(dbg);
1098 1099
	if (ret >= 0)
		ret = found ? 1 : 0;
1100 1101 1102 1103
	return ret;
}


1104
/* Find line range from its line number */
1105
static int find_line_range_by_line(Dwarf_Die *sp_die, struct line_finder *lf)
1106
{
1107 1108 1109
	Dwarf_Lines *lines;
	Dwarf_Line *line;
	size_t nlines, i;
1110
	Dwarf_Addr addr;
1111 1112
	int lineno;
	const char *src;
1113
	Dwarf_Die die_mem;
1114

1115
	line_list__init(&lf->lr->line_list);
1116 1117 1118 1119
	if (dwarf_getsrclines(&lf->cu_die, &lines, &nlines) != 0) {
		pr_warning("No source lines found in this CU.\n");
		return -ENOENT;
	}
1120

1121 1122
	for (i = 0; i < nlines; i++) {
		line = dwarf_onesrcline(lines, i);
1123 1124
		if (dwarf_lineno(line, &lineno) != 0 ||
		    (lf->lno_s > lineno || lf->lno_e < lineno))
1125 1126
			continue;

1127 1128
		if (sp_die) {
			/* Address filtering 1: does sp_die include addr? */
1129 1130
			if (dwarf_lineaddr(line, &addr) != 0 ||
			    !dwarf_haspc(sp_die, addr))
1131 1132 1133
				continue;

			/* Address filtering 2: No child include addr? */
1134
			if (die_find_inlinefunc(sp_die, addr, &die_mem))
1135 1136 1137
				continue;
		}

1138 1139 1140
		/* TODO: Get fileno from line, but how? */
		src = dwarf_linesrc(line, NULL, NULL);
		if (strtailcmp(src, lf->fname) != 0)
1141 1142
			continue;

1143
		/* Copy real path */
1144 1145 1146 1147 1148
		if (!lf->lr->path) {
			lf->lr->path = strdup(src);
			if (lf->lr->path == NULL)
				return -ENOMEM;
		}
1149
		line_list__add_line(&lf->lr->line_list, lineno);
1150
	}
1151
	/* Update status */
1152 1153
	if (!list_empty(&lf->lr->line_list))
		lf->found = 1;
1154 1155 1156 1157
	else {
		free(lf->lr->path);
		lf->lr->path = NULL;
	}
1158
	return lf->found;
1159 1160
}

1161 1162
static int line_range_inline_cb(Dwarf_Die *in_die, void *data)
{
1163 1164 1165
	struct dwarf_callback_param *param = data;

	param->retval = find_line_range_by_line(in_die, param->data);
1166 1167 1168
	return DWARF_CB_ABORT;	/* No need to find other instances */
}

1169
/* Search function from function name */
1170
static int line_range_search_cb(Dwarf_Die *sp_die, void *data)
1171
{
1172 1173
	struct dwarf_callback_param *param = data;
	struct line_finder *lf = param->data;
1174 1175
	struct line_range *lr = lf->lr;

1176 1177 1178 1179
	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);
1180
		pr_debug("fname: %s, lineno:%d\n", lf->fname, lr->offset);
1181
		lf->lno_s = lr->offset + lr->start;
1182 1183 1184 1185
		if (lf->lno_s < 0)	/* Overflow */
			lf->lno_s = INT_MAX;
		lf->lno_e = lr->offset + lr->end;
		if (lf->lno_e < 0)	/* Overflow */
1186
			lf->lno_e = INT_MAX;
1187
		pr_debug("New line range: %d to %d\n", lf->lno_s, lf->lno_e);
1188 1189
		lr->start = lf->lno_s;
		lr->end = lf->lno_e;
1190 1191 1192 1193
		if (dwarf_func_inline(sp_die)) {
			struct dwarf_callback_param _param;
			_param.data = (void *)lf;
			_param.retval = 0;
1194
			dwarf_func_inline_instances(sp_die,
1195 1196 1197 1198 1199 1200
						    line_range_inline_cb,
						    &_param);
			param->retval = _param.retval;
		} else
			param->retval = find_line_range_by_line(sp_die, lf);
		return DWARF_CB_ABORT;
1201
	}
1202
	return DWARF_CB_OK;
1203 1204
}

1205
static int find_line_range_by_func(struct line_finder *lf)
1206
{
1207 1208 1209
	struct dwarf_callback_param param = {.data = (void *)lf, .retval = 0};
	dwarf_getfuncs(&lf->cu_die, line_range_search_cb, &param, 0);
	return param.retval;
1210 1211 1212 1213
}

int find_line_range(int fd, struct line_range *lr)
{
1214
	struct line_finder lf = {.lr = lr, .found = 0};
1215
	int ret = 0;
1216 1217 1218 1219 1220 1221
	Dwarf_Off off = 0, noff;
	size_t cuhl;
	Dwarf_Die *diep;
	Dwarf *dbg;

	dbg = dwarf_begin(fd, DWARF_C_READ);
1222 1223 1224 1225 1226
	if (!dbg) {
		pr_warning("No dwarf info found in the vmlinux - "
			"please rebuild with CONFIG_DEBUG_INFO=y.\n");
		return -EBADF;
	}
1227

1228
	/* Loop on CUs (Compilation Unit) */
1229 1230
	while (!lf.found && ret >= 0) {
		if (dwarf_nextcu(dbg, off, &noff, &cuhl, NULL, NULL, NULL) != 0)
1231 1232 1233
			break;

		/* Get the DIE(Debugging Information Entry) of this CU */
1234 1235 1236
		diep = dwarf_offdie(dbg, off + cuhl, &lf.cu_die);
		if (!diep)
			continue;
1237 1238 1239

		/* Check if target file is included. */
		if (lr->file)
1240
			lf.fname = cu_find_realpath(&lf.cu_die, lr->file);
1241
		else
1242
			lf.fname = 0;
1243

1244
		if (!lr->file || lf.fname) {
1245
			if (lr->function)
1246
				ret = find_line_range_by_func(&lf);
1247 1248
			else {
				lf.lno_s = lr->start;
1249
				lf.lno_e = lr->end;
1250
				ret = find_line_range_by_line(NULL, &lf);
1251 1252
			}
		}
1253
		off = noff;
1254
	}
1255 1256
	pr_debug("path: %lx\n", (unsigned long)lr->path);
	dwarf_end(dbg);
1257 1258

	return (ret < 0) ? ret : lf.found;
1259 1260
}