1 // SPDX-License-Identifier: GPL-2.0
7 #include "namespaces.h"
12 #include <symbol.h> // filename__read_build_id
15 static int __dso_id__cmp(struct dso_id *a, struct dso_id *b)
17 if (a->maj > b->maj) return -1;
18 if (a->maj < b->maj) return 1;
20 if (a->min > b->min) return -1;
21 if (a->min < b->min) return 1;
23 if (a->ino > b->ino) return -1;
24 if (a->ino < b->ino) return 1;
26 if (a->ino_generation > b->ino_generation) return -1;
27 if (a->ino_generation < b->ino_generation) return 1;
32 static bool dso_id__empty(struct dso_id *id)
37 return !id->maj && !id->min && !id->ino && !id->ino_generation;
40 static void dso__inject_id(struct dso *dso, struct dso_id *id)
42 dso->id.maj = id->maj;
43 dso->id.min = id->min;
44 dso->id.ino = id->ino;
45 dso->id.ino_generation = id->ino_generation;
48 static int dso_id__cmp(struct dso_id *a, struct dso_id *b)
51 * The second is always dso->id, so zeroes if not set, assume passing
52 * NULL for a means a zeroed id
54 if (dso_id__empty(a) || dso_id__empty(b))
57 return __dso_id__cmp(a, b);
60 int dso__cmp_id(struct dso *a, struct dso *b)
62 return __dso_id__cmp(&a->id, &b->id);
65 bool __dsos__read_build_ids(struct list_head *head, bool with_hits)
67 bool have_build_id = false;
71 list_for_each_entry(pos, head, node) {
72 if (with_hits && !pos->hit && !dso__is_vdso(pos))
74 if (pos->has_build_id) {
78 nsinfo__mountns_enter(pos->nsinfo, &nsc);
79 if (filename__read_build_id(pos->long_name, &pos->bid) > 0) {
81 pos->has_build_id = true;
82 } else if (errno == ENOENT && pos->nsinfo) {
83 char *new_name = filename_with_chroot(pos->nsinfo->pid,
86 if (new_name && filename__read_build_id(new_name,
89 pos->has_build_id = true;
93 nsinfo__mountns_exit(&nsc);
99 static int __dso__cmp_long_name(const char *long_name, struct dso_id *id, struct dso *b)
101 int rc = strcmp(long_name, b->long_name);
102 return rc ?: dso_id__cmp(id, &b->id);
105 static int __dso__cmp_short_name(const char *short_name, struct dso_id *id, struct dso *b)
107 int rc = strcmp(short_name, b->short_name);
108 return rc ?: dso_id__cmp(id, &b->id);
111 static int dso__cmp_short_name(struct dso *a, struct dso *b)
113 return __dso__cmp_short_name(a->short_name, &a->id, b);
117 * Find a matching entry and/or link current entry to RB tree.
118 * Either one of the dso or name parameter must be non-NULL or the
119 * function will not work.
121 struct dso *__dsos__findnew_link_by_longname_id(struct rb_root *root, struct dso *dso,
122 const char *name, struct dso_id *id)
124 struct rb_node **p = &root->rb_node;
125 struct rb_node *parent = NULL;
128 name = dso->long_name;
130 * Find node with the matching name
133 struct dso *this = rb_entry(*p, struct dso, rb_node);
134 int rc = __dso__cmp_long_name(name, id, this);
139 * In case the new DSO is a duplicate of an existing
140 * one, print a one-time warning & put the new entry
141 * at the end of the list of duplicates.
143 if (!dso || (dso == this))
144 return this; /* Find matching dso */
146 * The core kernel DSOs may have duplicated long name.
147 * In this case, the short name should be different.
148 * Comparing the short names to differentiate the DSOs.
150 rc = dso__cmp_short_name(dso, this);
152 pr_err("Duplicated dso name: %s\n", name);
157 p = &parent->rb_left;
159 p = &parent->rb_right;
162 /* Add new node and rebalance tree */
163 rb_link_node(&dso->rb_node, parent, p);
164 rb_insert_color(&dso->rb_node, root);
170 void __dsos__add(struct dsos *dsos, struct dso *dso)
172 list_add_tail(&dso->node, &dsos->head);
173 __dsos__findnew_link_by_longname_id(&dsos->root, dso, NULL, &dso->id);
175 * It is now in the linked list, grab a reference, then garbage collect
176 * this when needing memory, by looking at LRU dso instances in the
177 * list with atomic_read(&dso->refcnt) == 1, i.e. no references
178 * anywhere besides the one for the list, do, under a lock for the
179 * list: remove it from the list, then a dso__put(), that probably will
180 * be the last and will then call dso__delete(), end of life.
182 * That, or at the end of the 'struct machine' lifetime, when all
183 * 'struct dso' instances will be removed from the list, in
184 * dsos__exit(), if they have no other reference from some other data
187 * E.g.: after processing a 'perf.data' file and storing references
188 * to objects instantiated while processing events, we will have
189 * references to the 'thread', 'map', 'dso' structs all from 'struct
190 * hist_entry' instances, but we may not need anything not referenced,
191 * so we might as well call machines__exit()/machines__delete() and
192 * garbage collect it.
197 void dsos__add(struct dsos *dsos, struct dso *dso)
199 down_write(&dsos->lock);
200 __dsos__add(dsos, dso);
201 up_write(&dsos->lock);
204 static struct dso *__dsos__findnew_by_longname_id(struct rb_root *root, const char *name, struct dso_id *id)
206 return __dsos__findnew_link_by_longname_id(root, NULL, name, id);
209 static struct dso *__dsos__find_id(struct dsos *dsos, const char *name, struct dso_id *id, bool cmp_short)
214 list_for_each_entry(pos, &dsos->head, node)
215 if (__dso__cmp_short_name(name, id, pos) == 0)
219 return __dsos__findnew_by_longname_id(&dsos->root, name, id);
222 struct dso *__dsos__find(struct dsos *dsos, const char *name, bool cmp_short)
224 return __dsos__find_id(dsos, name, NULL, cmp_short);
227 static void dso__set_basename(struct dso *dso)
232 if (sscanf(dso->long_name, "/tmp/perf-%d.map", &tid) == 1) {
233 if (asprintf(&base, "[JIT] tid %d", tid) < 0)
237 * basename() may modify path buffer, so we must pass
240 lname = strdup(dso->long_name);
245 * basename() may return a pointer to internal
246 * storage which is reused in subsequent calls
247 * so copy the result.
249 base = strdup(basename(lname));
256 dso__set_short_name(dso, base, true);
259 static struct dso *__dsos__addnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
261 struct dso *dso = dso__new_id(name, id);
264 __dsos__add(dsos, dso);
265 dso__set_basename(dso);
266 /* Put dso here because __dsos_add already got it */
272 struct dso *__dsos__addnew(struct dsos *dsos, const char *name)
274 return __dsos__addnew_id(dsos, name, NULL);
277 static struct dso *__dsos__findnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
279 struct dso *dso = __dsos__find_id(dsos, name, id, false);
281 if (dso && dso_id__empty(&dso->id) && !dso_id__empty(id))
282 dso__inject_id(dso, id);
284 return dso ? dso : __dsos__addnew_id(dsos, name, id);
287 struct dso *dsos__findnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
290 down_write(&dsos->lock);
291 dso = dso__get(__dsos__findnew_id(dsos, name, id));
292 up_write(&dsos->lock);
296 size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp,
297 bool (skip)(struct dso *dso, int parm), int parm)
302 list_for_each_entry(pos, head, node) {
303 char sbuild_id[SBUILD_ID_SIZE];
305 if (skip && skip(pos, parm))
307 build_id__sprintf(&pos->bid, sbuild_id);
308 ret += fprintf(fp, "%-40s %s\n", sbuild_id, pos->long_name);
313 size_t __dsos__fprintf(struct list_head *head, FILE *fp)
318 list_for_each_entry(pos, head, node) {
319 ret += dso__fprintf(pos, fp);