dso.c 23.5 KB
Newer Older
1
#include <asm/bug.h>
2 3
#include <sys/time.h>
#include <sys/resource.h>
4 5
#include "symbol.h"
#include "dso.h"
6
#include "machine.h"
7 8 9 10 11 12
#include "util.h"
#include "debug.h"

char dso__symtab_origin(const struct dso *dso)
{
	static const char origin[] = {
13 14 15 16 17 18 19 20 21 22 23
		[DSO_BINARY_TYPE__KALLSYMS]			= 'k',
		[DSO_BINARY_TYPE__VMLINUX]			= 'v',
		[DSO_BINARY_TYPE__JAVA_JIT]			= 'j',
		[DSO_BINARY_TYPE__DEBUGLINK]			= 'l',
		[DSO_BINARY_TYPE__BUILD_ID_CACHE]		= 'B',
		[DSO_BINARY_TYPE__FEDORA_DEBUGINFO]		= 'f',
		[DSO_BINARY_TYPE__UBUNTU_DEBUGINFO]		= 'u',
		[DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO]	= 'o',
		[DSO_BINARY_TYPE__BUILDID_DEBUGINFO]		= 'b',
		[DSO_BINARY_TYPE__SYSTEM_PATH_DSO]		= 'd',
		[DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE]		= 'K',
24
		[DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP]	= 'm',
25 26
		[DSO_BINARY_TYPE__GUEST_KALLSYMS]		= 'g',
		[DSO_BINARY_TYPE__GUEST_KMODULE]		= 'G',
27
		[DSO_BINARY_TYPE__GUEST_KMODULE_COMP]		= 'M',
28
		[DSO_BINARY_TYPE__GUEST_VMLINUX]		= 'V',
29 30 31 32 33 34 35
	};

	if (dso == NULL || dso->symtab_type == DSO_BINARY_TYPE__NOT_FOUND)
		return '!';
	return origin[dso->symtab_type];
}

36 37 38
int dso__read_binary_type_filename(const struct dso *dso,
				   enum dso_binary_type type,
				   char *root_dir, char *filename, size_t size)
39 40 41
{
	char build_id_hex[BUILD_ID_SIZE * 2 + 1];
	int ret = 0;
42
	size_t len;
43 44 45 46 47

	switch (type) {
	case DSO_BINARY_TYPE__DEBUGLINK: {
		char *debuglink;

48 49
		len = __symbol__join_symfs(filename, size, dso->long_name);
		debuglink = filename + len;
50
		while (debuglink != filename && *debuglink != '/')
51 52 53
			debuglink--;
		if (*debuglink == '/')
			debuglink++;
54
		ret = filename__read_debuglink(filename, debuglink,
55
					       size - (debuglink - filename));
56 57 58 59 60
		}
		break;
	case DSO_BINARY_TYPE__BUILD_ID_CACHE:
		/* skip the locally configured cache if a symfs is given */
		if (symbol_conf.symfs[0] ||
61
		    (dso__build_id_filename(dso, filename, size) == NULL))
62 63 64 65
			ret = -1;
		break;

	case DSO_BINARY_TYPE__FEDORA_DEBUGINFO:
66 67
		len = __symbol__join_symfs(filename, size, "/usr/lib/debug");
		snprintf(filename + len, size - len, "%s.debug", dso->long_name);
68 69 70
		break;

	case DSO_BINARY_TYPE__UBUNTU_DEBUGINFO:
71 72
		len = __symbol__join_symfs(filename, size, "/usr/lib/debug");
		snprintf(filename + len, size - len, "%s", dso->long_name);
73 74
		break;

75 76
	case DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO:
	{
77
		const char *last_slash;
78 79 80 81 82 83
		size_t dir_size;

		last_slash = dso->long_name + dso->long_name_len;
		while (last_slash != dso->long_name && *last_slash != '/')
			last_slash--;

84
		len = __symbol__join_symfs(filename, size, "");
85 86 87 88 89
		dir_size = last_slash - dso->long_name + 2;
		if (dir_size > (size - len)) {
			ret = -1;
			break;
		}
90 91
		len += scnprintf(filename + len, dir_size, "%s",  dso->long_name);
		len += scnprintf(filename + len , size - len, ".debug%s",
92 93 94 95
								last_slash);
		break;
	}

96 97 98 99 100 101 102 103 104
	case DSO_BINARY_TYPE__BUILDID_DEBUGINFO:
		if (!dso->has_build_id) {
			ret = -1;
			break;
		}

		build_id__sprintf(dso->build_id,
				  sizeof(dso->build_id),
				  build_id_hex);
105 106 107
		len = __symbol__join_symfs(filename, size, "/usr/lib/debug/.build-id/");
		snprintf(filename + len, size - len, "%.2s/%s.debug",
			 build_id_hex, build_id_hex + 2);
108 109
		break;

110 111
	case DSO_BINARY_TYPE__VMLINUX:
	case DSO_BINARY_TYPE__GUEST_VMLINUX:
112
	case DSO_BINARY_TYPE__SYSTEM_PATH_DSO:
113
		__symbol__join_symfs(filename, size, dso->long_name);
114 115 116
		break;

	case DSO_BINARY_TYPE__GUEST_KMODULE:
117
	case DSO_BINARY_TYPE__GUEST_KMODULE_COMP:
118 119
		path__join3(filename, size, symbol_conf.symfs,
			    root_dir, dso->long_name);
120 121 122
		break;

	case DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE:
123
	case DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP:
124
		__symbol__join_symfs(filename, size, dso->long_name);
125 126
		break;

127 128
	case DSO_BINARY_TYPE__KCORE:
	case DSO_BINARY_TYPE__GUEST_KCORE:
129
		snprintf(filename, size, "%s", dso->long_name);
130 131
		break;

132 133 134 135 136 137 138 139 140 141 142 143
	default:
	case DSO_BINARY_TYPE__KALLSYMS:
	case DSO_BINARY_TYPE__GUEST_KALLSYMS:
	case DSO_BINARY_TYPE__JAVA_JIT:
	case DSO_BINARY_TYPE__NOT_FOUND:
		ret = -1;
		break;
	}

	return ret;
}

144 145 146 147
static const struct {
	const char *fmt;
	int (*decompress)(const char *input, int output);
} compressions[] = {
148 149
#ifdef HAVE_ZLIB_SUPPORT
	{ "gz", gzip_decompress_to_file },
150 151 152
#endif
#ifdef HAVE_LZMA_SUPPORT
	{ "xz", lzma_decompress_to_file },
153 154
#endif
	{ NULL, NULL },
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213
};

bool is_supported_compression(const char *ext)
{
	unsigned i;

	for (i = 0; compressions[i].fmt; i++) {
		if (!strcmp(ext, compressions[i].fmt))
			return true;
	}
	return false;
}

bool is_kmodule_extension(const char *ext)
{
	if (strncmp(ext, "ko", 2))
		return false;

	if (ext[2] == '\0' || (ext[2] == '.' && is_supported_compression(ext+3)))
		return true;

	return false;
}

bool is_kernel_module(const char *pathname, bool *compressed)
{
	const char *ext = strrchr(pathname, '.');

	if (ext == NULL)
		return false;

	if (is_supported_compression(ext + 1)) {
		if (compressed)
			*compressed = true;
		ext -= 3;
	} else if (compressed)
		*compressed = false;

	return is_kmodule_extension(ext + 1);
}

bool decompress_to_file(const char *ext, const char *filename, int output_fd)
{
	unsigned i;

	for (i = 0; compressions[i].fmt; i++) {
		if (!strcmp(ext, compressions[i].fmt))
			return !compressions[i].decompress(filename,
							   output_fd);
	}
	return false;
}

bool dso__needs_decompress(struct dso *dso)
{
	return dso->symtab_type == DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE_COMP ||
		dso->symtab_type == DSO_BINARY_TYPE__GUEST_KMODULE_COMP;
}

214
/*
215
 * Global list of open DSOs and the counter.
216 217
 */
static LIST_HEAD(dso__data_open);
218
static long dso__data_open_cnt;
219 220 221 222

static void dso__list_add(struct dso *dso)
{
	list_add_tail(&dso->data.open_entry, &dso__data_open);
223
	dso__data_open_cnt++;
224 225 226 227 228
}

static void dso__list_del(struct dso *dso)
{
	list_del(&dso->data.open_entry);
229 230 231
	WARN_ONCE(dso__data_open_cnt <= 0,
		  "DSO data fd counter out of bounds.");
	dso__data_open_cnt--;
232 233
}

234 235 236 237 238
static void close_first_dso(void);

static int do_open(char *name)
{
	int fd;
239
	char sbuf[STRERR_BUFSIZE];
240 241 242 243 244 245

	do {
		fd = open(name, O_RDONLY);
		if (fd >= 0)
			return fd;

246
		pr_debug("dso open failed: %s\n",
247
			 strerror_r(errno, sbuf, sizeof(sbuf)));
248 249 250 251 252 253 254 255 256
		if (!dso__data_open_cnt || errno != EMFILE)
			break;

		close_first_dso();
	} while (1);

	return -1;
}

257
static int __open_dso(struct dso *dso, struct machine *machine)
258 259
{
	int fd;
260 261
	char *root_dir = (char *)"";
	char *name = malloc(PATH_MAX);
262 263 264 265 266 267 268

	if (!name)
		return -ENOMEM;

	if (machine)
		root_dir = machine->root_dir;

269
	if (dso__read_binary_type_filename(dso, dso->binary_type,
270
					    root_dir, name, PATH_MAX)) {
271 272 273 274
		free(name);
		return -EINVAL;
	}

275
	fd = do_open(name);
276 277 278 279
	free(name);
	return fd;
}

280 281
static void check_data_close(void);

282 283 284 285 286 287 288
/**
 * dso_close - Open DSO data file
 * @dso: dso object
 *
 * Open @dso's data file descriptor and updates
 * list/count of open DSO objects.
 */
289 290 291 292
static int open_dso(struct dso *dso, struct machine *machine)
{
	int fd = __open_dso(dso, machine);

293
	if (fd >= 0) {
294
		dso__list_add(dso);
295 296 297 298 299 300
		/*
		 * Check if we crossed the allowed number
		 * of opened DSOs and close one if needed.
		 */
		check_data_close();
	}
301 302 303 304 305

	return fd;
}

static void close_data_fd(struct dso *dso)
306 307 308 309
{
	if (dso->data.fd >= 0) {
		close(dso->data.fd);
		dso->data.fd = -1;
310
		dso->data.file_size = 0;
311
		dso__list_del(dso);
312 313 314
	}
}

315 316 317 318 319 320 321
/**
 * dso_close - Close DSO data file
 * @dso: dso object
 *
 * Close @dso's data file descriptor and updates
 * list/count of open DSO objects.
 */
322 323 324 325 326
static void close_dso(struct dso *dso)
{
	close_data_fd(dso);
}

327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366
static void close_first_dso(void)
{
	struct dso *dso;

	dso = list_first_entry(&dso__data_open, struct dso, data.open_entry);
	close_dso(dso);
}

static rlim_t get_fd_limit(void)
{
	struct rlimit l;
	rlim_t limit = 0;

	/* Allow half of the current open fd limit. */
	if (getrlimit(RLIMIT_NOFILE, &l) == 0) {
		if (l.rlim_cur == RLIM_INFINITY)
			limit = l.rlim_cur;
		else
			limit = l.rlim_cur / 2;
	} else {
		pr_err("failed to get fd limit\n");
		limit = 1;
	}

	return limit;
}

static bool may_cache_fd(void)
{
	static rlim_t limit;

	if (!limit)
		limit = get_fd_limit();

	if (limit == RLIM_INFINITY)
		return true;

	return limit > (rlim_t) dso__data_open_cnt;
}

367 368 369 370 371
/*
 * Check and close LRU dso if we crossed allowed limit
 * for opened dso file descriptors. The limit is half
 * of the RLIMIT_NOFILE files opened.
*/
372 373 374 375 376 377 378 379
static void check_data_close(void)
{
	bool cache_fd = may_cache_fd();

	if (!cache_fd)
		close_first_dso();
}

380 381 382 383 384 385
/**
 * dso__data_close - Close DSO data file
 * @dso: dso object
 *
 * External interface to close @dso's data file descriptor.
 */
386 387 388 389 390
void dso__data_close(struct dso *dso)
{
	close_dso(dso);
}

391 392 393 394 395 396 397 398
/**
 * dso__data_fd - Get dso's data file descriptor
 * @dso: dso object
 * @machine: machine object
 *
 * External interface to find dso's file, open it and
 * returns file descriptor.
 */
399 400
int dso__data_fd(struct dso *dso, struct machine *machine)
{
401
	enum dso_binary_type binary_type_data[] = {
402 403 404 405 406 407
		DSO_BINARY_TYPE__BUILD_ID_CACHE,
		DSO_BINARY_TYPE__SYSTEM_PATH_DSO,
		DSO_BINARY_TYPE__NOT_FOUND,
	};
	int i = 0;

408 409 410
	if (dso->data.status == DSO_DATA_STATUS_ERROR)
		return -1;

411
	if (dso->data.fd >= 0)
412
		goto out;
413 414 415

	if (dso->binary_type != DSO_BINARY_TYPE__NOT_FOUND) {
		dso->data.fd = open_dso(dso, machine);
416
		goto out;
417
	}
418 419

	do {
420
		dso->binary_type = binary_type_data[i++];
421

422 423 424
		dso->data.fd = open_dso(dso, machine);
		if (dso->data.fd >= 0)
			goto out;
425

426
	} while (dso->binary_type != DSO_BINARY_TYPE__NOT_FOUND);
427 428 429 430 431
out:
	if (dso->data.fd >= 0)
		dso->data.status = DSO_DATA_STATUS_OK;
	else
		dso->data.status = DSO_DATA_STATUS_ERROR;
432

433
	return dso->data.fd;
434 435
}

436 437 438 439 440 441 442 443 444 445 446 447
bool dso__data_status_seen(struct dso *dso, enum dso_data_status_seen by)
{
	u32 flag = 1 << by;

	if (dso->data.status_seen & flag)
		return true;

	dso->data.status_seen |= flag;

	return false;
}

448 449 450 451 452 453 454 455 456 457 458 459 460 461 462
static void
dso_cache__free(struct rb_root *root)
{
	struct rb_node *next = rb_first(root);

	while (next) {
		struct dso_cache *cache;

		cache = rb_entry(next, struct dso_cache, rb_node);
		next = rb_next(&cache->rb_node);
		rb_erase(&cache->rb_node, root);
		free(cache);
	}
}

463
static struct dso_cache *dso_cache__find(const struct rb_root *root, u64 offset)
464
{
465 466
	struct rb_node * const *p = &root->rb_node;
	const struct rb_node *parent = NULL;
467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522
	struct dso_cache *cache;

	while (*p != NULL) {
		u64 end;

		parent = *p;
		cache = rb_entry(parent, struct dso_cache, rb_node);
		end = cache->offset + DSO__DATA_CACHE_SIZE;

		if (offset < cache->offset)
			p = &(*p)->rb_left;
		else if (offset >= end)
			p = &(*p)->rb_right;
		else
			return cache;
	}
	return NULL;
}

static void
dso_cache__insert(struct rb_root *root, struct dso_cache *new)
{
	struct rb_node **p = &root->rb_node;
	struct rb_node *parent = NULL;
	struct dso_cache *cache;
	u64 offset = new->offset;

	while (*p != NULL) {
		u64 end;

		parent = *p;
		cache = rb_entry(parent, struct dso_cache, rb_node);
		end = cache->offset + DSO__DATA_CACHE_SIZE;

		if (offset < cache->offset)
			p = &(*p)->rb_left;
		else if (offset >= end)
			p = &(*p)->rb_right;
	}

	rb_link_node(&new->rb_node, parent, p);
	rb_insert_color(&new->rb_node, root);
}

static ssize_t
dso_cache__memcpy(struct dso_cache *cache, u64 offset,
		  u8 *data, u64 size)
{
	u64 cache_offset = offset - cache->offset;
	u64 cache_size   = min(cache->size - cache_offset, size);

	memcpy(data, cache->data + cache_offset, cache_size);
	return cache_size;
}

static ssize_t
523
dso_cache__read(struct dso *dso, u64 offset, u8 *data, ssize_t size)
524 525 526 527 528 529 530 531 532 533 534 535 536 537 538
{
	struct dso_cache *cache;
	ssize_t ret;

	do {
		u64 cache_offset;

		ret = -ENOMEM;

		cache = zalloc(sizeof(*cache) + DSO__DATA_CACHE_SIZE);
		if (!cache)
			break;

		cache_offset = offset & DSO__DATA_CACHE_MASK;

539
		ret = pread(dso->data.fd, cache->data, DSO__DATA_CACHE_SIZE, cache_offset);
540 541 542 543 544
		if (ret <= 0)
			break;

		cache->offset = cache_offset;
		cache->size   = ret;
545
		dso_cache__insert(&dso->data.cache, cache);
546 547 548 549 550 551 552 553 554 555 556

		ret = dso_cache__memcpy(cache, offset, data, size);

	} while (0);

	if (ret <= 0)
		free(cache);

	return ret;
}

557 558
static ssize_t dso_cache_read(struct dso *dso, u64 offset,
			      u8 *data, ssize_t size)
559 560 561
{
	struct dso_cache *cache;

562
	cache = dso_cache__find(&dso->data.cache, offset);
563 564 565
	if (cache)
		return dso_cache__memcpy(cache, offset, data, size);
	else
566
		return dso_cache__read(dso, offset, data, size);
567 568
}

569 570 571 572 573
/*
 * Reads and caches dso data DSO__DATA_CACHE_SIZE size chunks
 * in the rb_tree. Any read to already cached data is served
 * by cached data.
 */
574
static ssize_t cached_read(struct dso *dso, u64 offset, u8 *data, ssize_t size)
575 576 577 578 579 580 581
{
	ssize_t r = 0;
	u8 *p = data;

	do {
		ssize_t ret;

582
		ret = dso_cache_read(dso, offset, p, size);
583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601
		if (ret < 0)
			return ret;

		/* Reached EOF, return what we have. */
		if (!ret)
			break;

		BUG_ON(ret > size);

		r      += ret;
		p      += ret;
		offset += ret;
		size   -= ret;

	} while (size);

	return r;
}

602 603 604
static int data_file_size(struct dso *dso)
{
	struct stat st;
605
	char sbuf[STRERR_BUFSIZE];
606 607 608

	if (!dso->data.file_size) {
		if (fstat(dso->data.fd, &st)) {
609 610
			pr_err("dso mmap failed, fstat: %s\n",
				strerror_r(errno, sbuf, sizeof(sbuf)));
611 612 613 614 615 616 617 618
			return -1;
		}
		dso->data.file_size = st.st_size;
	}

	return 0;
}

A
Adrian Hunter 已提交
619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
/**
 * dso__data_size - Return dso data size
 * @dso: dso object
 * @machine: machine object
 *
 * Return: dso data size
 */
off_t dso__data_size(struct dso *dso, struct machine *machine)
{
	int fd;

	fd = dso__data_fd(dso, machine);
	if (fd < 0)
		return fd;

	if (data_file_size(dso))
		return -1;

	/* For now just estimate dso data size is close to file size */
	return dso->data.file_size;
}

641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656
static ssize_t data_read_offset(struct dso *dso, u64 offset,
				u8 *data, ssize_t size)
{
	if (data_file_size(dso))
		return -1;

	/* Check the offset sanity. */
	if (offset > dso->data.file_size)
		return -1;

	if (offset + size < offset)
		return -1;

	return cached_read(dso, offset, data, size);
}

657 658 659 660 661 662 663 664 665 666 667
/**
 * dso__data_read_offset - Read data from dso file offset
 * @dso: dso object
 * @machine: machine object
 * @offset: file offset
 * @data: buffer to store data
 * @size: size of the @data buffer
 *
 * External interface to read data from dso file offset. Open
 * dso data file and use cached_read to get the data.
 */
668 669 670 671 672 673 674 675 676
ssize_t dso__data_read_offset(struct dso *dso, struct machine *machine,
			      u64 offset, u8 *data, ssize_t size)
{
	if (dso__data_fd(dso, machine) < 0)
		return -1;

	return data_read_offset(dso, offset, data, size);
}

677 678 679 680 681 682 683 684 685 686
/**
 * dso__data_read_addr - Read data from dso address
 * @dso: dso object
 * @machine: machine object
 * @add: virtual memory address
 * @data: buffer to store data
 * @size: size of the @data buffer
 *
 * External interface to read data from dso address.
 */
687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718
ssize_t dso__data_read_addr(struct dso *dso, struct map *map,
			    struct machine *machine, u64 addr,
			    u8 *data, ssize_t size)
{
	u64 offset = map->map_ip(map, addr);
	return dso__data_read_offset(dso, machine, offset, data, size);
}

struct map *dso__new_map(const char *name)
{
	struct map *map = NULL;
	struct dso *dso = dso__new(name);

	if (dso)
		map = map__new2(0, dso, MAP__FUNCTION);

	return map;
}

struct dso *dso__kernel_findnew(struct machine *machine, const char *name,
		    const char *short_name, int dso_type)
{
	/*
	 * The kernel dso could be created by build_id processing.
	 */
	struct dso *dso = __dsos__findnew(&machine->kernel_dsos, name);

	/*
	 * We need to run this in all cases, since during the build_id
	 * processing we had no idea this was the kernel dso.
	 */
	if (dso != NULL) {
719
		dso__set_short_name(dso, short_name, false);
720 721 722 723 724 725
		dso->kernel = dso_type;
	}

	return dso;
}

726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784
/*
 * Find a matching entry and/or link current entry to RB tree.
 * Either one of the dso or name parameter must be non-NULL or the
 * function will not work.
 */
static struct dso *dso__findlink_by_longname(struct rb_root *root,
					     struct dso *dso, const char *name)
{
	struct rb_node **p = &root->rb_node;
	struct rb_node  *parent = NULL;

	if (!name)
		name = dso->long_name;
	/*
	 * Find node with the matching name
	 */
	while (*p) {
		struct dso *this = rb_entry(*p, struct dso, rb_node);
		int rc = strcmp(name, this->long_name);

		parent = *p;
		if (rc == 0) {
			/*
			 * In case the new DSO is a duplicate of an existing
			 * one, print an one-time warning & put the new entry
			 * at the end of the list of duplicates.
			 */
			if (!dso || (dso == this))
				return this;	/* Find matching dso */
			/*
			 * The core kernel DSOs may have duplicated long name.
			 * In this case, the short name should be different.
			 * Comparing the short names to differentiate the DSOs.
			 */
			rc = strcmp(dso->short_name, this->short_name);
			if (rc == 0) {
				pr_err("Duplicated dso name: %s\n", name);
				return NULL;
			}
		}
		if (rc < 0)
			p = &parent->rb_left;
		else
			p = &parent->rb_right;
	}
	if (dso) {
		/* Add new node and rebalance tree */
		rb_link_node(&dso->rb_node, parent, p);
		rb_insert_color(&dso->rb_node, root);
	}
	return NULL;
}

static inline struct dso *
dso__find_by_longname(const struct rb_root *root, const char *name)
{
	return dso__findlink_by_longname((struct rb_root *)root, NULL, name);
}

785
void dso__set_long_name(struct dso *dso, const char *name, bool name_allocated)
786 787 788
{
	if (name == NULL)
		return;
789 790

	if (dso->long_name_allocated)
791
		free((char *)dso->long_name);
792 793 794 795

	dso->long_name		 = name;
	dso->long_name_len	 = strlen(name);
	dso->long_name_allocated = name_allocated;
796 797
}

798
void dso__set_short_name(struct dso *dso, const char *name, bool name_allocated)
799 800 801
{
	if (name == NULL)
		return;
802 803 804 805 806 807 808

	if (dso->short_name_allocated)
		free((char *)dso->short_name);

	dso->short_name		  = name;
	dso->short_name_len	  = strlen(name);
	dso->short_name_allocated = name_allocated;
809 810 811 812
}

static void dso__set_basename(struct dso *dso)
{
813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834
       /*
        * basename() may modify path buffer, so we must pass
        * a copy.
        */
       char *base, *lname = strdup(dso->long_name);

       if (!lname)
               return;

       /*
        * basename() may return a pointer to internal
        * storage which is reused in subsequent calls
        * so copy the result.
        */
       base = strdup(basename(lname));

       free(lname);

       if (!base)
               return;

       dso__set_short_name(dso, base, true);
835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868
}

int dso__name_len(const struct dso *dso)
{
	if (!dso)
		return strlen("[unknown]");
	if (verbose)
		return dso->long_name_len;

	return dso->short_name_len;
}

bool dso__loaded(const struct dso *dso, enum map_type type)
{
	return dso->loaded & (1 << type);
}

bool dso__sorted_by_name(const struct dso *dso, enum map_type type)
{
	return dso->sorted_by_name & (1 << type);
}

void dso__set_sorted_by_name(struct dso *dso, enum map_type type)
{
	dso->sorted_by_name |= (1 << type);
}

struct dso *dso__new(const char *name)
{
	struct dso *dso = calloc(1, sizeof(*dso) + strlen(name) + 1);

	if (dso != NULL) {
		int i;
		strcpy(dso->name, name);
869
		dso__set_long_name(dso, dso->name, false);
870
		dso__set_short_name(dso, dso->name, false);
871 872
		for (i = 0; i < MAP__NR_TYPES; ++i)
			dso->symbols[i] = dso->symbol_names[i] = RB_ROOT;
873
		dso->data.cache = RB_ROOT;
874
		dso->data.fd = -1;
875
		dso->data.status = DSO_DATA_STATUS_UNKNOWN;
876
		dso->symtab_type = DSO_BINARY_TYPE__NOT_FOUND;
877
		dso->binary_type = DSO_BINARY_TYPE__NOT_FOUND;
878
		dso->is_64_bit = (sizeof(void *) == 8);
879
		dso->loaded = 0;
880
		dso->rel = 0;
881 882
		dso->sorted_by_name = 0;
		dso->has_build_id = 0;
883
		dso->has_srcline = 1;
884
		dso->a2l_fails = 1;
885 886
		dso->kernel = DSO_TYPE_USER;
		dso->needs_swap = DSO_SWAP__UNSET;
887
		RB_CLEAR_NODE(&dso->rb_node);
888
		INIT_LIST_HEAD(&dso->node);
889
		INIT_LIST_HEAD(&dso->data.open_entry);
890 891 892 893 894 895 896 897
	}

	return dso;
}

void dso__delete(struct dso *dso)
{
	int i;
898 899 900 901

	if (!RB_EMPTY_NODE(&dso->rb_node))
		pr_err("DSO %s is still in rbtree when being deleted!\n",
		       dso->long_name);
902 903
	for (i = 0; i < MAP__NR_TYPES; ++i)
		symbols__delete(&dso->symbols[i]);
904 905

	if (dso->short_name_allocated) {
906
		zfree((char **)&dso->short_name);
907 908 909 910
		dso->short_name_allocated = false;
	}

	if (dso->long_name_allocated) {
911
		zfree((char **)&dso->long_name);
912 913 914
		dso->long_name_allocated = false;
	}

915
	dso__data_close(dso);
916
	dso_cache__free(&dso->data.cache);
917
	dso__free_a2l(dso);
918
	zfree(&dso->symsrc_filename);
919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987
	free(dso);
}

void dso__set_build_id(struct dso *dso, void *build_id)
{
	memcpy(dso->build_id, build_id, sizeof(dso->build_id));
	dso->has_build_id = 1;
}

bool dso__build_id_equal(const struct dso *dso, u8 *build_id)
{
	return memcmp(dso->build_id, build_id, sizeof(dso->build_id)) == 0;
}

void dso__read_running_kernel_build_id(struct dso *dso, struct machine *machine)
{
	char path[PATH_MAX];

	if (machine__is_default_guest(machine))
		return;
	sprintf(path, "%s/sys/kernel/notes", machine->root_dir);
	if (sysfs__read_build_id(path, dso->build_id,
				 sizeof(dso->build_id)) == 0)
		dso->has_build_id = true;
}

int dso__kernel_module_get_build_id(struct dso *dso,
				    const char *root_dir)
{
	char filename[PATH_MAX];
	/*
	 * kernel module short names are of the form "[module]" and
	 * we need just "module" here.
	 */
	const char *name = dso->short_name + 1;

	snprintf(filename, sizeof(filename),
		 "%s/sys/module/%.*s/notes/.note.gnu.build-id",
		 root_dir, (int)strlen(name) - 1, name);

	if (sysfs__read_build_id(filename, dso->build_id,
				 sizeof(dso->build_id)) == 0)
		dso->has_build_id = true;

	return 0;
}

bool __dsos__read_build_ids(struct list_head *head, bool with_hits)
{
	bool have_build_id = false;
	struct dso *pos;

	list_for_each_entry(pos, head, node) {
		if (with_hits && !pos->hit)
			continue;
		if (pos->has_build_id) {
			have_build_id = true;
			continue;
		}
		if (filename__read_build_id(pos->long_name, pos->build_id,
					    sizeof(pos->build_id)) > 0) {
			have_build_id	  = true;
			pos->has_build_id = true;
		}
	}

	return have_build_id;
}

988
void dsos__add(struct dsos *dsos, struct dso *dso)
989
{
990
	list_add_tail(&dso->node, &dsos->head);
991
	dso__findlink_by_longname(&dsos->root, dso, NULL);
992 993
}

994 995
struct dso *dsos__find(const struct dsos *dsos, const char *name,
		       bool cmp_short)
996 997 998
{
	struct dso *pos;

999
	if (cmp_short) {
1000
		list_for_each_entry(pos, &dsos->head, node)
1001 1002 1003 1004
			if (strcmp(pos->short_name, name) == 0)
				return pos;
		return NULL;
	}
1005
	return dso__find_by_longname(&dsos->root, name);
1006 1007
}

1008
struct dso *__dsos__findnew(struct dsos *dsos, const char *name)
1009
{
1010
	struct dso *dso = dsos__find(dsos, name, false);
1011 1012 1013 1014

	if (!dso) {
		dso = dso__new(name);
		if (dso != NULL) {
1015
			dsos__add(dsos, dso);
1016 1017 1018 1019 1020 1021 1022 1023
			dso__set_basename(dso);
		}
	}

	return dso;
}

size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp,
1024
			       bool (skip)(struct dso *dso, int parm), int parm)
1025 1026 1027 1028 1029
{
	struct dso *pos;
	size_t ret = 0;

	list_for_each_entry(pos, head, node) {
1030
		if (skip && skip(pos, parm))
1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067
			continue;
		ret += dso__fprintf_buildid(pos, fp);
		ret += fprintf(fp, " %s\n", pos->long_name);
	}
	return ret;
}

size_t __dsos__fprintf(struct list_head *head, FILE *fp)
{
	struct dso *pos;
	size_t ret = 0;

	list_for_each_entry(pos, head, node) {
		int i;
		for (i = 0; i < MAP__NR_TYPES; ++i)
			ret += dso__fprintf(pos, i, fp);
	}

	return ret;
}

size_t dso__fprintf_buildid(struct dso *dso, FILE *fp)
{
	char sbuild_id[BUILD_ID_SIZE * 2 + 1];

	build_id__sprintf(dso->build_id, sizeof(dso->build_id), sbuild_id);
	return fprintf(fp, "%s", sbuild_id);
}

size_t dso__fprintf(struct dso *dso, enum map_type type, FILE *fp)
{
	struct rb_node *nd;
	size_t ret = fprintf(fp, "dso: %s (", dso->short_name);

	if (dso->short_name != dso->long_name)
		ret += fprintf(fp, "%s, ", dso->long_name);
	ret += fprintf(fp, "%s, %sloaded, ", map_type__name[type],
1068
		       dso__loaded(dso, type) ? "" : "NOT ");
1069 1070 1071 1072 1073 1074 1075 1076 1077
	ret += dso__fprintf_buildid(dso, fp);
	ret += fprintf(fp, ")\n");
	for (nd = rb_first(&dso->symbols[type]); nd; nd = rb_next(nd)) {
		struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
		ret += symbol__fprintf(pos, fp);
	}

	return ret;
}
A
Adrian Hunter 已提交
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088

enum dso_type dso__type(struct dso *dso, struct machine *machine)
{
	int fd;

	fd = dso__data_fd(dso, machine);
	if (fd < 0)
		return DSO__TYPE_UNKNOWN;

	return dso__type_fd(fd);
}