1 #include <asm/bug.h>
2 #include <sys/time.h>
3 #include <sys/resource.h>
4 #include "symbol.h"
5 #include "dso.h"
6 #include "machine.h"
7 #include "util.h"
8 #include "debug.h"
9
dso__symtab_origin(const struct dso * dso)10 char dso__symtab_origin(const struct dso *dso)
11 {
12 static const char origin[] = {
13 [DSO_BINARY_TYPE__KALLSYMS] = 'k',
14 [DSO_BINARY_TYPE__VMLINUX] = 'v',
15 [DSO_BINARY_TYPE__JAVA_JIT] = 'j',
16 [DSO_BINARY_TYPE__DEBUGLINK] = 'l',
17 [DSO_BINARY_TYPE__BUILD_ID_CACHE] = 'B',
18 [DSO_BINARY_TYPE__FEDORA_DEBUGINFO] = 'f',
19 [DSO_BINARY_TYPE__UBUNTU_DEBUGINFO] = 'u',
20 [DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO] = 'o',
21 [DSO_BINARY_TYPE__BUILDID_DEBUGINFO] = 'b',
22 [DSO_BINARY_TYPE__SYSTEM_PATH_DSO] = 'd',
23 [DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE] = 'K',
24 [DSO_BINARY_TYPE__GUEST_KALLSYMS] = 'g',
25 [DSO_BINARY_TYPE__GUEST_KMODULE] = 'G',
26 [DSO_BINARY_TYPE__GUEST_VMLINUX] = 'V',
27 };
28
29 if (dso == NULL || dso->symtab_type == DSO_BINARY_TYPE__NOT_FOUND)
30 return '!';
31 return origin[dso->symtab_type];
32 }
33
dso__read_binary_type_filename(const struct dso * dso,enum dso_binary_type type,char * root_dir,char * filename,size_t size)34 int dso__read_binary_type_filename(const struct dso *dso,
35 enum dso_binary_type type,
36 char *root_dir, char *filename, size_t size)
37 {
38 char build_id_hex[BUILD_ID_SIZE * 2 + 1];
39 int ret = 0;
40 size_t len;
41
42 switch (type) {
43 case DSO_BINARY_TYPE__DEBUGLINK: {
44 char *debuglink;
45
46 strncpy(filename, dso->long_name, size);
47 debuglink = filename + dso->long_name_len;
48 while (debuglink != filename && *debuglink != '/')
49 debuglink--;
50 if (*debuglink == '/')
51 debuglink++;
52 ret = filename__read_debuglink(dso->long_name, debuglink,
53 size - (debuglink - filename));
54 }
55 break;
56 case DSO_BINARY_TYPE__BUILD_ID_CACHE:
57 /* skip the locally configured cache if a symfs is given */
58 if (symbol_conf.symfs[0] ||
59 (dso__build_id_filename(dso, filename, size) == NULL))
60 ret = -1;
61 break;
62
63 case DSO_BINARY_TYPE__FEDORA_DEBUGINFO:
64 len = __symbol__join_symfs(filename, size, "/usr/lib/debug");
65 snprintf(filename + len, size - len, "%s.debug", dso->long_name);
66 break;
67
68 case DSO_BINARY_TYPE__UBUNTU_DEBUGINFO:
69 len = __symbol__join_symfs(filename, size, "/usr/lib/debug");
70 snprintf(filename + len, size - len, "%s", dso->long_name);
71 break;
72
73 case DSO_BINARY_TYPE__OPENEMBEDDED_DEBUGINFO:
74 {
75 const char *last_slash;
76 size_t dir_size;
77
78 last_slash = dso->long_name + dso->long_name_len;
79 while (last_slash != dso->long_name && *last_slash != '/')
80 last_slash--;
81
82 len = __symbol__join_symfs(filename, size, "");
83 dir_size = last_slash - dso->long_name + 2;
84 if (dir_size > (size - len)) {
85 ret = -1;
86 break;
87 }
88 len += scnprintf(filename + len, dir_size, "%s", dso->long_name);
89 len += scnprintf(filename + len , size - len, ".debug%s",
90 last_slash);
91 break;
92 }
93
94 case DSO_BINARY_TYPE__BUILDID_DEBUGINFO:
95 if (!dso->has_build_id) {
96 ret = -1;
97 break;
98 }
99
100 build_id__sprintf(dso->build_id,
101 sizeof(dso->build_id),
102 build_id_hex);
103 len = __symbol__join_symfs(filename, size, "/usr/lib/debug/.build-id/");
104 snprintf(filename + len, size - len, "%.2s/%s.debug",
105 build_id_hex, build_id_hex + 2);
106 break;
107
108 case DSO_BINARY_TYPE__VMLINUX:
109 case DSO_BINARY_TYPE__GUEST_VMLINUX:
110 case DSO_BINARY_TYPE__SYSTEM_PATH_DSO:
111 __symbol__join_symfs(filename, size, dso->long_name);
112 break;
113
114 case DSO_BINARY_TYPE__GUEST_KMODULE:
115 path__join3(filename, size, symbol_conf.symfs,
116 root_dir, dso->long_name);
117 break;
118
119 case DSO_BINARY_TYPE__SYSTEM_PATH_KMODULE:
120 __symbol__join_symfs(filename, size, dso->long_name);
121 break;
122
123 case DSO_BINARY_TYPE__KCORE:
124 case DSO_BINARY_TYPE__GUEST_KCORE:
125 snprintf(filename, size, "%s", dso->long_name);
126 break;
127
128 default:
129 case DSO_BINARY_TYPE__KALLSYMS:
130 case DSO_BINARY_TYPE__GUEST_KALLSYMS:
131 case DSO_BINARY_TYPE__JAVA_JIT:
132 case DSO_BINARY_TYPE__NOT_FOUND:
133 ret = -1;
134 break;
135 }
136
137 return ret;
138 }
139
140 /*
141 * Global list of open DSOs and the counter.
142 */
143 static LIST_HEAD(dso__data_open);
144 static long dso__data_open_cnt;
145
dso__list_add(struct dso * dso)146 static void dso__list_add(struct dso *dso)
147 {
148 list_add_tail(&dso->data.open_entry, &dso__data_open);
149 dso__data_open_cnt++;
150 }
151
dso__list_del(struct dso * dso)152 static void dso__list_del(struct dso *dso)
153 {
154 list_del(&dso->data.open_entry);
155 WARN_ONCE(dso__data_open_cnt <= 0,
156 "DSO data fd counter out of bounds.");
157 dso__data_open_cnt--;
158 }
159
160 static void close_first_dso(void);
161
do_open(char * name)162 static int do_open(char *name)
163 {
164 int fd;
165 char sbuf[STRERR_BUFSIZE];
166
167 do {
168 fd = open(name, O_RDONLY);
169 if (fd >= 0)
170 return fd;
171
172 pr_debug("dso open failed, mmap: %s\n",
173 strerror_r(errno, sbuf, sizeof(sbuf)));
174 if (!dso__data_open_cnt || errno != EMFILE)
175 break;
176
177 close_first_dso();
178 } while (1);
179
180 return -1;
181 }
182
__open_dso(struct dso * dso,struct machine * machine)183 static int __open_dso(struct dso *dso, struct machine *machine)
184 {
185 int fd;
186 char *root_dir = (char *)"";
187 char *name = malloc(PATH_MAX);
188
189 if (!name)
190 return -ENOMEM;
191
192 if (machine)
193 root_dir = machine->root_dir;
194
195 if (dso__read_binary_type_filename(dso, dso->binary_type,
196 root_dir, name, PATH_MAX)) {
197 free(name);
198 return -EINVAL;
199 }
200
201 fd = do_open(name);
202 free(name);
203 return fd;
204 }
205
206 static void check_data_close(void);
207
208 /**
209 * dso_close - Open DSO data file
210 * @dso: dso object
211 *
212 * Open @dso's data file descriptor and updates
213 * list/count of open DSO objects.
214 */
open_dso(struct dso * dso,struct machine * machine)215 static int open_dso(struct dso *dso, struct machine *machine)
216 {
217 int fd = __open_dso(dso, machine);
218
219 if (fd >= 0) {
220 dso__list_add(dso);
221 /*
222 * Check if we crossed the allowed number
223 * of opened DSOs and close one if needed.
224 */
225 check_data_close();
226 }
227
228 return fd;
229 }
230
close_data_fd(struct dso * dso)231 static void close_data_fd(struct dso *dso)
232 {
233 if (dso->data.fd >= 0) {
234 close(dso->data.fd);
235 dso->data.fd = -1;
236 dso->data.file_size = 0;
237 dso__list_del(dso);
238 }
239 }
240
241 /**
242 * dso_close - Close DSO data file
243 * @dso: dso object
244 *
245 * Close @dso's data file descriptor and updates
246 * list/count of open DSO objects.
247 */
close_dso(struct dso * dso)248 static void close_dso(struct dso *dso)
249 {
250 close_data_fd(dso);
251 }
252
close_first_dso(void)253 static void close_first_dso(void)
254 {
255 struct dso *dso;
256
257 dso = list_first_entry(&dso__data_open, struct dso, data.open_entry);
258 close_dso(dso);
259 }
260
get_fd_limit(void)261 static rlim_t get_fd_limit(void)
262 {
263 struct rlimit l;
264 rlim_t limit = 0;
265
266 /* Allow half of the current open fd limit. */
267 if (getrlimit(RLIMIT_NOFILE, &l) == 0) {
268 if (l.rlim_cur == RLIM_INFINITY)
269 limit = l.rlim_cur;
270 else
271 limit = l.rlim_cur / 2;
272 } else {
273 pr_err("failed to get fd limit\n");
274 limit = 1;
275 }
276
277 return limit;
278 }
279
may_cache_fd(void)280 static bool may_cache_fd(void)
281 {
282 static rlim_t limit;
283
284 if (!limit)
285 limit = get_fd_limit();
286
287 if (limit == RLIM_INFINITY)
288 return true;
289
290 return limit > (rlim_t) dso__data_open_cnt;
291 }
292
293 /*
294 * Check and close LRU dso if we crossed allowed limit
295 * for opened dso file descriptors. The limit is half
296 * of the RLIMIT_NOFILE files opened.
297 */
check_data_close(void)298 static void check_data_close(void)
299 {
300 bool cache_fd = may_cache_fd();
301
302 if (!cache_fd)
303 close_first_dso();
304 }
305
306 /**
307 * dso__data_close - Close DSO data file
308 * @dso: dso object
309 *
310 * External interface to close @dso's data file descriptor.
311 */
dso__data_close(struct dso * dso)312 void dso__data_close(struct dso *dso)
313 {
314 close_dso(dso);
315 }
316
317 /**
318 * dso__data_fd - Get dso's data file descriptor
319 * @dso: dso object
320 * @machine: machine object
321 *
322 * External interface to find dso's file, open it and
323 * returns file descriptor.
324 */
dso__data_fd(struct dso * dso,struct machine * machine)325 int dso__data_fd(struct dso *dso, struct machine *machine)
326 {
327 enum dso_binary_type binary_type_data[] = {
328 DSO_BINARY_TYPE__BUILD_ID_CACHE,
329 DSO_BINARY_TYPE__SYSTEM_PATH_DSO,
330 DSO_BINARY_TYPE__NOT_FOUND,
331 };
332 int i = 0;
333
334 if (dso->data.status == DSO_DATA_STATUS_ERROR)
335 return -1;
336
337 if (dso->data.fd >= 0)
338 goto out;
339
340 if (dso->binary_type != DSO_BINARY_TYPE__NOT_FOUND) {
341 dso->data.fd = open_dso(dso, machine);
342 goto out;
343 }
344
345 do {
346 dso->binary_type = binary_type_data[i++];
347
348 dso->data.fd = open_dso(dso, machine);
349 if (dso->data.fd >= 0)
350 goto out;
351
352 } while (dso->binary_type != DSO_BINARY_TYPE__NOT_FOUND);
353 out:
354 if (dso->data.fd >= 0)
355 dso->data.status = DSO_DATA_STATUS_OK;
356 else
357 dso->data.status = DSO_DATA_STATUS_ERROR;
358
359 return dso->data.fd;
360 }
361
dso__data_status_seen(struct dso * dso,enum dso_data_status_seen by)362 bool dso__data_status_seen(struct dso *dso, enum dso_data_status_seen by)
363 {
364 u32 flag = 1 << by;
365
366 if (dso->data.status_seen & flag)
367 return true;
368
369 dso->data.status_seen |= flag;
370
371 return false;
372 }
373
374 static void
dso_cache__free(struct rb_root * root)375 dso_cache__free(struct rb_root *root)
376 {
377 struct rb_node *next = rb_first(root);
378
379 while (next) {
380 struct dso_cache *cache;
381
382 cache = rb_entry(next, struct dso_cache, rb_node);
383 next = rb_next(&cache->rb_node);
384 rb_erase(&cache->rb_node, root);
385 free(cache);
386 }
387 }
388
dso_cache__find(const struct rb_root * root,u64 offset)389 static struct dso_cache *dso_cache__find(const struct rb_root *root, u64 offset)
390 {
391 struct rb_node * const *p = &root->rb_node;
392 const struct rb_node *parent = NULL;
393 struct dso_cache *cache;
394
395 while (*p != NULL) {
396 u64 end;
397
398 parent = *p;
399 cache = rb_entry(parent, struct dso_cache, rb_node);
400 end = cache->offset + DSO__DATA_CACHE_SIZE;
401
402 if (offset < cache->offset)
403 p = &(*p)->rb_left;
404 else if (offset >= end)
405 p = &(*p)->rb_right;
406 else
407 return cache;
408 }
409 return NULL;
410 }
411
412 static void
dso_cache__insert(struct rb_root * root,struct dso_cache * new)413 dso_cache__insert(struct rb_root *root, struct dso_cache *new)
414 {
415 struct rb_node **p = &root->rb_node;
416 struct rb_node *parent = NULL;
417 struct dso_cache *cache;
418 u64 offset = new->offset;
419
420 while (*p != NULL) {
421 u64 end;
422
423 parent = *p;
424 cache = rb_entry(parent, struct dso_cache, rb_node);
425 end = cache->offset + DSO__DATA_CACHE_SIZE;
426
427 if (offset < cache->offset)
428 p = &(*p)->rb_left;
429 else if (offset >= end)
430 p = &(*p)->rb_right;
431 }
432
433 rb_link_node(&new->rb_node, parent, p);
434 rb_insert_color(&new->rb_node, root);
435 }
436
437 static ssize_t
dso_cache__memcpy(struct dso_cache * cache,u64 offset,u8 * data,u64 size)438 dso_cache__memcpy(struct dso_cache *cache, u64 offset,
439 u8 *data, u64 size)
440 {
441 u64 cache_offset = offset - cache->offset;
442 u64 cache_size = min(cache->size - cache_offset, size);
443
444 memcpy(data, cache->data + cache_offset, cache_size);
445 return cache_size;
446 }
447
448 static ssize_t
dso_cache__read(struct dso * dso,u64 offset,u8 * data,ssize_t size)449 dso_cache__read(struct dso *dso, u64 offset, u8 *data, ssize_t size)
450 {
451 struct dso_cache *cache;
452 ssize_t ret;
453
454 do {
455 u64 cache_offset;
456
457 ret = -ENOMEM;
458
459 cache = zalloc(sizeof(*cache) + DSO__DATA_CACHE_SIZE);
460 if (!cache)
461 break;
462
463 cache_offset = offset & DSO__DATA_CACHE_MASK;
464 ret = -EINVAL;
465
466 if (-1 == lseek(dso->data.fd, cache_offset, SEEK_SET))
467 break;
468
469 ret = read(dso->data.fd, cache->data, DSO__DATA_CACHE_SIZE);
470 if (ret <= 0)
471 break;
472
473 cache->offset = cache_offset;
474 cache->size = ret;
475 dso_cache__insert(&dso->data.cache, cache);
476
477 ret = dso_cache__memcpy(cache, offset, data, size);
478
479 } while (0);
480
481 if (ret <= 0)
482 free(cache);
483
484 return ret;
485 }
486
dso_cache_read(struct dso * dso,u64 offset,u8 * data,ssize_t size)487 static ssize_t dso_cache_read(struct dso *dso, u64 offset,
488 u8 *data, ssize_t size)
489 {
490 struct dso_cache *cache;
491
492 cache = dso_cache__find(&dso->data.cache, offset);
493 if (cache)
494 return dso_cache__memcpy(cache, offset, data, size);
495 else
496 return dso_cache__read(dso, offset, data, size);
497 }
498
499 /*
500 * Reads and caches dso data DSO__DATA_CACHE_SIZE size chunks
501 * in the rb_tree. Any read to already cached data is served
502 * by cached data.
503 */
cached_read(struct dso * dso,u64 offset,u8 * data,ssize_t size)504 static ssize_t cached_read(struct dso *dso, u64 offset, u8 *data, ssize_t size)
505 {
506 ssize_t r = 0;
507 u8 *p = data;
508
509 do {
510 ssize_t ret;
511
512 ret = dso_cache_read(dso, offset, p, size);
513 if (ret < 0)
514 return ret;
515
516 /* Reached EOF, return what we have. */
517 if (!ret)
518 break;
519
520 BUG_ON(ret > size);
521
522 r += ret;
523 p += ret;
524 offset += ret;
525 size -= ret;
526
527 } while (size);
528
529 return r;
530 }
531
data_file_size(struct dso * dso)532 static int data_file_size(struct dso *dso)
533 {
534 struct stat st;
535 char sbuf[STRERR_BUFSIZE];
536
537 if (!dso->data.file_size) {
538 if (fstat(dso->data.fd, &st)) {
539 pr_err("dso mmap failed, fstat: %s\n",
540 strerror_r(errno, sbuf, sizeof(sbuf)));
541 return -1;
542 }
543 dso->data.file_size = st.st_size;
544 }
545
546 return 0;
547 }
548
549 /**
550 * dso__data_size - Return dso data size
551 * @dso: dso object
552 * @machine: machine object
553 *
554 * Return: dso data size
555 */
dso__data_size(struct dso * dso,struct machine * machine)556 off_t dso__data_size(struct dso *dso, struct machine *machine)
557 {
558 int fd;
559
560 fd = dso__data_fd(dso, machine);
561 if (fd < 0)
562 return fd;
563
564 if (data_file_size(dso))
565 return -1;
566
567 /* For now just estimate dso data size is close to file size */
568 return dso->data.file_size;
569 }
570
data_read_offset(struct dso * dso,u64 offset,u8 * data,ssize_t size)571 static ssize_t data_read_offset(struct dso *dso, u64 offset,
572 u8 *data, ssize_t size)
573 {
574 if (data_file_size(dso))
575 return -1;
576
577 /* Check the offset sanity. */
578 if (offset > dso->data.file_size)
579 return -1;
580
581 if (offset + size < offset)
582 return -1;
583
584 return cached_read(dso, offset, data, size);
585 }
586
587 /**
588 * dso__data_read_offset - Read data from dso file offset
589 * @dso: dso object
590 * @machine: machine object
591 * @offset: file offset
592 * @data: buffer to store data
593 * @size: size of the @data buffer
594 *
595 * External interface to read data from dso file offset. Open
596 * dso data file and use cached_read to get the data.
597 */
dso__data_read_offset(struct dso * dso,struct machine * machine,u64 offset,u8 * data,ssize_t size)598 ssize_t dso__data_read_offset(struct dso *dso, struct machine *machine,
599 u64 offset, u8 *data, ssize_t size)
600 {
601 if (dso__data_fd(dso, machine) < 0)
602 return -1;
603
604 return data_read_offset(dso, offset, data, size);
605 }
606
607 /**
608 * dso__data_read_addr - Read data from dso address
609 * @dso: dso object
610 * @machine: machine object
611 * @add: virtual memory address
612 * @data: buffer to store data
613 * @size: size of the @data buffer
614 *
615 * External interface to read data from dso address.
616 */
dso__data_read_addr(struct dso * dso,struct map * map,struct machine * machine,u64 addr,u8 * data,ssize_t size)617 ssize_t dso__data_read_addr(struct dso *dso, struct map *map,
618 struct machine *machine, u64 addr,
619 u8 *data, ssize_t size)
620 {
621 u64 offset = map->map_ip(map, addr);
622 return dso__data_read_offset(dso, machine, offset, data, size);
623 }
624
dso__new_map(const char * name)625 struct map *dso__new_map(const char *name)
626 {
627 struct map *map = NULL;
628 struct dso *dso = dso__new(name);
629
630 if (dso)
631 map = map__new2(0, dso, MAP__FUNCTION);
632
633 return map;
634 }
635
dso__kernel_findnew(struct machine * machine,const char * name,const char * short_name,int dso_type)636 struct dso *dso__kernel_findnew(struct machine *machine, const char *name,
637 const char *short_name, int dso_type)
638 {
639 /*
640 * The kernel dso could be created by build_id processing.
641 */
642 struct dso *dso = __dsos__findnew(&machine->kernel_dsos, name);
643
644 /*
645 * We need to run this in all cases, since during the build_id
646 * processing we had no idea this was the kernel dso.
647 */
648 if (dso != NULL) {
649 dso__set_short_name(dso, short_name, false);
650 dso->kernel = dso_type;
651 }
652
653 return dso;
654 }
655
656 /*
657 * Find a matching entry and/or link current entry to RB tree.
658 * Either one of the dso or name parameter must be non-NULL or the
659 * function will not work.
660 */
dso__findlink_by_longname(struct rb_root * root,struct dso * dso,const char * name)661 static struct dso *dso__findlink_by_longname(struct rb_root *root,
662 struct dso *dso, const char *name)
663 {
664 struct rb_node **p = &root->rb_node;
665 struct rb_node *parent = NULL;
666
667 if (!name)
668 name = dso->long_name;
669 /*
670 * Find node with the matching name
671 */
672 while (*p) {
673 struct dso *this = rb_entry(*p, struct dso, rb_node);
674 int rc = strcmp(name, this->long_name);
675
676 parent = *p;
677 if (rc == 0) {
678 /*
679 * In case the new DSO is a duplicate of an existing
680 * one, print an one-time warning & put the new entry
681 * at the end of the list of duplicates.
682 */
683 if (!dso || (dso == this))
684 return this; /* Find matching dso */
685 /*
686 * The core kernel DSOs may have duplicated long name.
687 * In this case, the short name should be different.
688 * Comparing the short names to differentiate the DSOs.
689 */
690 rc = strcmp(dso->short_name, this->short_name);
691 if (rc == 0) {
692 pr_err("Duplicated dso name: %s\n", name);
693 return NULL;
694 }
695 }
696 if (rc < 0)
697 p = &parent->rb_left;
698 else
699 p = &parent->rb_right;
700 }
701 if (dso) {
702 /* Add new node and rebalance tree */
703 rb_link_node(&dso->rb_node, parent, p);
704 rb_insert_color(&dso->rb_node, root);
705 }
706 return NULL;
707 }
708
709 static inline struct dso *
dso__find_by_longname(const struct rb_root * root,const char * name)710 dso__find_by_longname(const struct rb_root *root, const char *name)
711 {
712 return dso__findlink_by_longname((struct rb_root *)root, NULL, name);
713 }
714
dso__set_long_name(struct dso * dso,const char * name,bool name_allocated)715 void dso__set_long_name(struct dso *dso, const char *name, bool name_allocated)
716 {
717 if (name == NULL)
718 return;
719
720 if (dso->long_name_allocated)
721 free((char *)dso->long_name);
722
723 dso->long_name = name;
724 dso->long_name_len = strlen(name);
725 dso->long_name_allocated = name_allocated;
726 }
727
dso__set_short_name(struct dso * dso,const char * name,bool name_allocated)728 void dso__set_short_name(struct dso *dso, const char *name, bool name_allocated)
729 {
730 if (name == NULL)
731 return;
732
733 if (dso->short_name_allocated)
734 free((char *)dso->short_name);
735
736 dso->short_name = name;
737 dso->short_name_len = strlen(name);
738 dso->short_name_allocated = name_allocated;
739 }
740
dso__set_basename(struct dso * dso)741 static void dso__set_basename(struct dso *dso)
742 {
743 /*
744 * basename() may modify path buffer, so we must pass
745 * a copy.
746 */
747 char *base, *lname = strdup(dso->long_name);
748
749 if (!lname)
750 return;
751
752 /*
753 * basename() may return a pointer to internal
754 * storage which is reused in subsequent calls
755 * so copy the result.
756 */
757 base = strdup(basename(lname));
758
759 free(lname);
760
761 if (!base)
762 return;
763
764 dso__set_short_name(dso, base, true);
765 }
766
dso__name_len(const struct dso * dso)767 int dso__name_len(const struct dso *dso)
768 {
769 if (!dso)
770 return strlen("[unknown]");
771 if (verbose)
772 return dso->long_name_len;
773
774 return dso->short_name_len;
775 }
776
dso__loaded(const struct dso * dso,enum map_type type)777 bool dso__loaded(const struct dso *dso, enum map_type type)
778 {
779 return dso->loaded & (1 << type);
780 }
781
dso__sorted_by_name(const struct dso * dso,enum map_type type)782 bool dso__sorted_by_name(const struct dso *dso, enum map_type type)
783 {
784 return dso->sorted_by_name & (1 << type);
785 }
786
dso__set_sorted_by_name(struct dso * dso,enum map_type type)787 void dso__set_sorted_by_name(struct dso *dso, enum map_type type)
788 {
789 dso->sorted_by_name |= (1 << type);
790 }
791
dso__new(const char * name)792 struct dso *dso__new(const char *name)
793 {
794 struct dso *dso = calloc(1, sizeof(*dso) + strlen(name) + 1);
795
796 if (dso != NULL) {
797 int i;
798 strcpy(dso->name, name);
799 dso__set_long_name(dso, dso->name, false);
800 dso__set_short_name(dso, dso->name, false);
801 for (i = 0; i < MAP__NR_TYPES; ++i)
802 dso->symbols[i] = dso->symbol_names[i] = RB_ROOT;
803 dso->data.cache = RB_ROOT;
804 dso->data.fd = -1;
805 dso->data.status = DSO_DATA_STATUS_UNKNOWN;
806 dso->symtab_type = DSO_BINARY_TYPE__NOT_FOUND;
807 dso->binary_type = DSO_BINARY_TYPE__NOT_FOUND;
808 dso->is_64_bit = (sizeof(void *) == 8);
809 dso->loaded = 0;
810 dso->rel = 0;
811 dso->sorted_by_name = 0;
812 dso->has_build_id = 0;
813 dso->has_srcline = 1;
814 dso->a2l_fails = 1;
815 dso->kernel = DSO_TYPE_USER;
816 dso->needs_swap = DSO_SWAP__UNSET;
817 RB_CLEAR_NODE(&dso->rb_node);
818 INIT_LIST_HEAD(&dso->node);
819 INIT_LIST_HEAD(&dso->data.open_entry);
820 }
821
822 return dso;
823 }
824
dso__delete(struct dso * dso)825 void dso__delete(struct dso *dso)
826 {
827 int i;
828
829 if (!RB_EMPTY_NODE(&dso->rb_node))
830 pr_err("DSO %s is still in rbtree when being deleted!\n",
831 dso->long_name);
832 for (i = 0; i < MAP__NR_TYPES; ++i)
833 symbols__delete(&dso->symbols[i]);
834
835 if (dso->short_name_allocated) {
836 zfree((char **)&dso->short_name);
837 dso->short_name_allocated = false;
838 }
839
840 if (dso->long_name_allocated) {
841 zfree((char **)&dso->long_name);
842 dso->long_name_allocated = false;
843 }
844
845 dso__data_close(dso);
846 dso_cache__free(&dso->data.cache);
847 dso__free_a2l(dso);
848 zfree(&dso->symsrc_filename);
849 free(dso);
850 }
851
dso__set_build_id(struct dso * dso,void * build_id)852 void dso__set_build_id(struct dso *dso, void *build_id)
853 {
854 memcpy(dso->build_id, build_id, sizeof(dso->build_id));
855 dso->has_build_id = 1;
856 }
857
dso__build_id_equal(const struct dso * dso,u8 * build_id)858 bool dso__build_id_equal(const struct dso *dso, u8 *build_id)
859 {
860 return memcmp(dso->build_id, build_id, sizeof(dso->build_id)) == 0;
861 }
862
dso__read_running_kernel_build_id(struct dso * dso,struct machine * machine)863 void dso__read_running_kernel_build_id(struct dso *dso, struct machine *machine)
864 {
865 char path[PATH_MAX];
866
867 if (machine__is_default_guest(machine))
868 return;
869 sprintf(path, "%s/sys/kernel/notes", machine->root_dir);
870 if (sysfs__read_build_id(path, dso->build_id,
871 sizeof(dso->build_id)) == 0)
872 dso->has_build_id = true;
873 }
874
dso__kernel_module_get_build_id(struct dso * dso,const char * root_dir)875 int dso__kernel_module_get_build_id(struct dso *dso,
876 const char *root_dir)
877 {
878 char filename[PATH_MAX];
879 /*
880 * kernel module short names are of the form "[module]" and
881 * we need just "module" here.
882 */
883 const char *name = dso->short_name + 1;
884
885 snprintf(filename, sizeof(filename),
886 "%s/sys/module/%.*s/notes/.note.gnu.build-id",
887 root_dir, (int)strlen(name) - 1, name);
888
889 if (sysfs__read_build_id(filename, dso->build_id,
890 sizeof(dso->build_id)) == 0)
891 dso->has_build_id = true;
892
893 return 0;
894 }
895
__dsos__read_build_ids(struct list_head * head,bool with_hits)896 bool __dsos__read_build_ids(struct list_head *head, bool with_hits)
897 {
898 bool have_build_id = false;
899 struct dso *pos;
900
901 list_for_each_entry(pos, head, node) {
902 if (with_hits && !pos->hit)
903 continue;
904 if (pos->has_build_id) {
905 have_build_id = true;
906 continue;
907 }
908 if (filename__read_build_id(pos->long_name, pos->build_id,
909 sizeof(pos->build_id)) > 0) {
910 have_build_id = true;
911 pos->has_build_id = true;
912 }
913 }
914
915 return have_build_id;
916 }
917
dsos__add(struct dsos * dsos,struct dso * dso)918 void dsos__add(struct dsos *dsos, struct dso *dso)
919 {
920 list_add_tail(&dso->node, &dsos->head);
921 dso__findlink_by_longname(&dsos->root, dso, NULL);
922 }
923
dsos__find(const struct dsos * dsos,const char * name,bool cmp_short)924 struct dso *dsos__find(const struct dsos *dsos, const char *name,
925 bool cmp_short)
926 {
927 struct dso *pos;
928
929 if (cmp_short) {
930 list_for_each_entry(pos, &dsos->head, node)
931 if (strcmp(pos->short_name, name) == 0)
932 return pos;
933 return NULL;
934 }
935 return dso__find_by_longname(&dsos->root, name);
936 }
937
__dsos__findnew(struct dsos * dsos,const char * name)938 struct dso *__dsos__findnew(struct dsos *dsos, const char *name)
939 {
940 struct dso *dso = dsos__find(dsos, name, false);
941
942 if (!dso) {
943 dso = dso__new(name);
944 if (dso != NULL) {
945 dsos__add(dsos, dso);
946 dso__set_basename(dso);
947 }
948 }
949
950 return dso;
951 }
952
__dsos__fprintf_buildid(struct list_head * head,FILE * fp,bool (skip)(struct dso * dso,int parm),int parm)953 size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp,
954 bool (skip)(struct dso *dso, int parm), int parm)
955 {
956 struct dso *pos;
957 size_t ret = 0;
958
959 list_for_each_entry(pos, head, node) {
960 if (skip && skip(pos, parm))
961 continue;
962 ret += dso__fprintf_buildid(pos, fp);
963 ret += fprintf(fp, " %s\n", pos->long_name);
964 }
965 return ret;
966 }
967
__dsos__fprintf(struct list_head * head,FILE * fp)968 size_t __dsos__fprintf(struct list_head *head, FILE *fp)
969 {
970 struct dso *pos;
971 size_t ret = 0;
972
973 list_for_each_entry(pos, head, node) {
974 int i;
975 for (i = 0; i < MAP__NR_TYPES; ++i)
976 ret += dso__fprintf(pos, i, fp);
977 }
978
979 return ret;
980 }
981
dso__fprintf_buildid(struct dso * dso,FILE * fp)982 size_t dso__fprintf_buildid(struct dso *dso, FILE *fp)
983 {
984 char sbuild_id[BUILD_ID_SIZE * 2 + 1];
985
986 build_id__sprintf(dso->build_id, sizeof(dso->build_id), sbuild_id);
987 return fprintf(fp, "%s", sbuild_id);
988 }
989
dso__fprintf(struct dso * dso,enum map_type type,FILE * fp)990 size_t dso__fprintf(struct dso *dso, enum map_type type, FILE *fp)
991 {
992 struct rb_node *nd;
993 size_t ret = fprintf(fp, "dso: %s (", dso->short_name);
994
995 if (dso->short_name != dso->long_name)
996 ret += fprintf(fp, "%s, ", dso->long_name);
997 ret += fprintf(fp, "%s, %sloaded, ", map_type__name[type],
998 dso__loaded(dso, type) ? "" : "NOT ");
999 ret += dso__fprintf_buildid(dso, fp);
1000 ret += fprintf(fp, ")\n");
1001 for (nd = rb_first(&dso->symbols[type]); nd; nd = rb_next(nd)) {
1002 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
1003 ret += symbol__fprintf(pos, fp);
1004 }
1005
1006 return ret;
1007 }
1008
dso__type(struct dso * dso,struct machine * machine)1009 enum dso_type dso__type(struct dso *dso, struct machine *machine)
1010 {
1011 int fd;
1012
1013 fd = dso__data_fd(dso, machine);
1014 if (fd < 0)
1015 return DSO__TYPE_UNKNOWN;
1016
1017 return dso__type_fd(fd);
1018 }
1019