Loading...
1// SPDX-License-Identifier: GPL-2.0
2#include "debug.h"
3#include "dsos.h"
4#include "dso.h"
5#include "vdso.h"
6#include "namespaces.h"
7#include <libgen.h>
8#include <stdlib.h>
9#include <string.h>
10#include <symbol.h> // filename__read_build_id
11
12bool __dsos__read_build_ids(struct list_head *head, bool with_hits)
13{
14 bool have_build_id = false;
15 struct dso *pos;
16 struct nscookie nsc;
17
18 list_for_each_entry(pos, head, node) {
19 if (with_hits && !pos->hit && !dso__is_vdso(pos))
20 continue;
21 if (pos->has_build_id) {
22 have_build_id = true;
23 continue;
24 }
25 nsinfo__mountns_enter(pos->nsinfo, &nsc);
26 if (filename__read_build_id(pos->long_name, pos->build_id,
27 sizeof(pos->build_id)) > 0) {
28 have_build_id = true;
29 pos->has_build_id = true;
30 }
31 nsinfo__mountns_exit(&nsc);
32 }
33
34 return have_build_id;
35}
36
37/*
38 * Find a matching entry and/or link current entry to RB tree.
39 * Either one of the dso or name parameter must be non-NULL or the
40 * function will not work.
41 */
42struct dso *__dsos__findnew_link_by_longname(struct rb_root *root, struct dso *dso, const char *name)
43{
44 struct rb_node **p = &root->rb_node;
45 struct rb_node *parent = NULL;
46
47 if (!name)
48 name = dso->long_name;
49 /*
50 * Find node with the matching name
51 */
52 while (*p) {
53 struct dso *this = rb_entry(*p, struct dso, rb_node);
54 int rc = strcmp(name, this->long_name);
55
56 parent = *p;
57 if (rc == 0) {
58 /*
59 * In case the new DSO is a duplicate of an existing
60 * one, print a one-time warning & put the new entry
61 * at the end of the list of duplicates.
62 */
63 if (!dso || (dso == this))
64 return this; /* Find matching dso */
65 /*
66 * The core kernel DSOs may have duplicated long name.
67 * In this case, the short name should be different.
68 * Comparing the short names to differentiate the DSOs.
69 */
70 rc = strcmp(dso->short_name, this->short_name);
71 if (rc == 0) {
72 pr_err("Duplicated dso name: %s\n", name);
73 return NULL;
74 }
75 }
76 if (rc < 0)
77 p = &parent->rb_left;
78 else
79 p = &parent->rb_right;
80 }
81 if (dso) {
82 /* Add new node and rebalance tree */
83 rb_link_node(&dso->rb_node, parent, p);
84 rb_insert_color(&dso->rb_node, root);
85 dso->root = root;
86 }
87 return NULL;
88}
89
90void __dsos__add(struct dsos *dsos, struct dso *dso)
91{
92 list_add_tail(&dso->node, &dsos->head);
93 __dsos__findnew_link_by_longname(&dsos->root, dso, NULL);
94 /*
95 * It is now in the linked list, grab a reference, then garbage collect
96 * this when needing memory, by looking at LRU dso instances in the
97 * list with atomic_read(&dso->refcnt) == 1, i.e. no references
98 * anywhere besides the one for the list, do, under a lock for the
99 * list: remove it from the list, then a dso__put(), that probably will
100 * be the last and will then call dso__delete(), end of life.
101 *
102 * That, or at the end of the 'struct machine' lifetime, when all
103 * 'struct dso' instances will be removed from the list, in
104 * dsos__exit(), if they have no other reference from some other data
105 * structure.
106 *
107 * E.g.: after processing a 'perf.data' file and storing references
108 * to objects instantiated while processing events, we will have
109 * references to the 'thread', 'map', 'dso' structs all from 'struct
110 * hist_entry' instances, but we may not need anything not referenced,
111 * so we might as well call machines__exit()/machines__delete() and
112 * garbage collect it.
113 */
114 dso__get(dso);
115}
116
117void dsos__add(struct dsos *dsos, struct dso *dso)
118{
119 down_write(&dsos->lock);
120 __dsos__add(dsos, dso);
121 up_write(&dsos->lock);
122}
123
124struct dso *__dsos__find(struct dsos *dsos, const char *name, bool cmp_short)
125{
126 struct dso *pos;
127
128 if (cmp_short) {
129 list_for_each_entry(pos, &dsos->head, node)
130 if (strcmp(pos->short_name, name) == 0)
131 return pos;
132 return NULL;
133 }
134 return __dsos__findnew_by_longname(&dsos->root, name);
135}
136
137struct dso *dsos__find(struct dsos *dsos, const char *name, bool cmp_short)
138{
139 struct dso *dso;
140 down_read(&dsos->lock);
141 dso = __dsos__find(dsos, name, cmp_short);
142 up_read(&dsos->lock);
143 return dso;
144}
145
146static void dso__set_basename(struct dso *dso)
147{
148 char *base, *lname;
149 int tid;
150
151 if (sscanf(dso->long_name, "/tmp/perf-%d.map", &tid) == 1) {
152 if (asprintf(&base, "[JIT] tid %d", tid) < 0)
153 return;
154 } else {
155 /*
156 * basename() may modify path buffer, so we must pass
157 * a copy.
158 */
159 lname = strdup(dso->long_name);
160 if (!lname)
161 return;
162
163 /*
164 * basename() may return a pointer to internal
165 * storage which is reused in subsequent calls
166 * so copy the result.
167 */
168 base = strdup(basename(lname));
169
170 free(lname);
171
172 if (!base)
173 return;
174 }
175 dso__set_short_name(dso, base, true);
176}
177
178struct dso *__dsos__addnew(struct dsos *dsos, const char *name)
179{
180 struct dso *dso = dso__new(name);
181
182 if (dso != NULL) {
183 __dsos__add(dsos, dso);
184 dso__set_basename(dso);
185 /* Put dso here because __dsos_add already got it */
186 dso__put(dso);
187 }
188 return dso;
189}
190
191struct dso *__dsos__findnew(struct dsos *dsos, const char *name)
192{
193 struct dso *dso = __dsos__find(dsos, name, false);
194
195 return dso ? dso : __dsos__addnew(dsos, name);
196}
197
198struct dso *dsos__findnew(struct dsos *dsos, const char *name)
199{
200 struct dso *dso;
201 down_write(&dsos->lock);
202 dso = dso__get(__dsos__findnew(dsos, name));
203 up_write(&dsos->lock);
204 return dso;
205}
206
207size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp,
208 bool (skip)(struct dso *dso, int parm), int parm)
209{
210 struct dso *pos;
211 size_t ret = 0;
212
213 list_for_each_entry(pos, head, node) {
214 if (skip && skip(pos, parm))
215 continue;
216 ret += dso__fprintf_buildid(pos, fp);
217 ret += fprintf(fp, " %s\n", pos->long_name);
218 }
219 return ret;
220}
221
222size_t __dsos__fprintf(struct list_head *head, FILE *fp)
223{
224 struct dso *pos;
225 size_t ret = 0;
226
227 list_for_each_entry(pos, head, node) {
228 ret += dso__fprintf(pos, fp);
229 }
230
231 return ret;
232}
1// SPDX-License-Identifier: GPL-2.0
2#include "debug.h"
3#include "dsos.h"
4#include "dso.h"
5#include "vdso.h"
6#include "namespaces.h"
7#include <libgen.h>
8#include <stdlib.h>
9#include <string.h>
10#include <symbol.h> // filename__read_build_id
11
12static int __dso_id__cmp(struct dso_id *a, struct dso_id *b)
13{
14 if (a->maj > b->maj) return -1;
15 if (a->maj < b->maj) return 1;
16
17 if (a->min > b->min) return -1;
18 if (a->min < b->min) return 1;
19
20 if (a->ino > b->ino) return -1;
21 if (a->ino < b->ino) return 1;
22
23 if (a->ino_generation > b->ino_generation) return -1;
24 if (a->ino_generation < b->ino_generation) return 1;
25
26 return 0;
27}
28
29static bool dso_id__empty(struct dso_id *id)
30{
31 if (!id)
32 return true;
33
34 return !id->maj && !id->min && !id->ino && !id->ino_generation;
35}
36
37static void dso__inject_id(struct dso *dso, struct dso_id *id)
38{
39 dso->id.maj = id->maj;
40 dso->id.min = id->min;
41 dso->id.ino = id->ino;
42 dso->id.ino_generation = id->ino_generation;
43}
44
45static int dso_id__cmp(struct dso_id *a, struct dso_id *b)
46{
47 /*
48 * The second is always dso->id, so zeroes if not set, assume passing
49 * NULL for a means a zeroed id
50 */
51 if (dso_id__empty(a) || dso_id__empty(b))
52 return 0;
53
54 return __dso_id__cmp(a, b);
55}
56
57int dso__cmp_id(struct dso *a, struct dso *b)
58{
59 return __dso_id__cmp(&a->id, &b->id);
60}
61
62bool __dsos__read_build_ids(struct list_head *head, bool with_hits)
63{
64 bool have_build_id = false;
65 struct dso *pos;
66 struct nscookie nsc;
67
68 list_for_each_entry(pos, head, node) {
69 if (with_hits && !pos->hit && !dso__is_vdso(pos))
70 continue;
71 if (pos->has_build_id) {
72 have_build_id = true;
73 continue;
74 }
75 nsinfo__mountns_enter(pos->nsinfo, &nsc);
76 if (filename__read_build_id(pos->long_name, pos->build_id,
77 sizeof(pos->build_id)) > 0) {
78 have_build_id = true;
79 pos->has_build_id = true;
80 }
81 nsinfo__mountns_exit(&nsc);
82 }
83
84 return have_build_id;
85}
86
87static int __dso__cmp_long_name(const char *long_name, struct dso_id *id, struct dso *b)
88{
89 int rc = strcmp(long_name, b->long_name);
90 return rc ?: dso_id__cmp(id, &b->id);
91}
92
93static int __dso__cmp_short_name(const char *short_name, struct dso_id *id, struct dso *b)
94{
95 int rc = strcmp(short_name, b->short_name);
96 return rc ?: dso_id__cmp(id, &b->id);
97}
98
99static int dso__cmp_short_name(struct dso *a, struct dso *b)
100{
101 return __dso__cmp_short_name(a->short_name, &a->id, b);
102}
103
104/*
105 * Find a matching entry and/or link current entry to RB tree.
106 * Either one of the dso or name parameter must be non-NULL or the
107 * function will not work.
108 */
109struct dso *__dsos__findnew_link_by_longname_id(struct rb_root *root, struct dso *dso,
110 const char *name, struct dso_id *id)
111{
112 struct rb_node **p = &root->rb_node;
113 struct rb_node *parent = NULL;
114
115 if (!name)
116 name = dso->long_name;
117 /*
118 * Find node with the matching name
119 */
120 while (*p) {
121 struct dso *this = rb_entry(*p, struct dso, rb_node);
122 int rc = __dso__cmp_long_name(name, id, this);
123
124 parent = *p;
125 if (rc == 0) {
126 /*
127 * In case the new DSO is a duplicate of an existing
128 * one, print a one-time warning & put the new entry
129 * at the end of the list of duplicates.
130 */
131 if (!dso || (dso == this))
132 return this; /* Find matching dso */
133 /*
134 * The core kernel DSOs may have duplicated long name.
135 * In this case, the short name should be different.
136 * Comparing the short names to differentiate the DSOs.
137 */
138 rc = dso__cmp_short_name(dso, this);
139 if (rc == 0) {
140 pr_err("Duplicated dso name: %s\n", name);
141 return NULL;
142 }
143 }
144 if (rc < 0)
145 p = &parent->rb_left;
146 else
147 p = &parent->rb_right;
148 }
149 if (dso) {
150 /* Add new node and rebalance tree */
151 rb_link_node(&dso->rb_node, parent, p);
152 rb_insert_color(&dso->rb_node, root);
153 dso->root = root;
154 }
155 return NULL;
156}
157
158void __dsos__add(struct dsos *dsos, struct dso *dso)
159{
160 list_add_tail(&dso->node, &dsos->head);
161 __dsos__findnew_link_by_longname_id(&dsos->root, dso, NULL, &dso->id);
162 /*
163 * It is now in the linked list, grab a reference, then garbage collect
164 * this when needing memory, by looking at LRU dso instances in the
165 * list with atomic_read(&dso->refcnt) == 1, i.e. no references
166 * anywhere besides the one for the list, do, under a lock for the
167 * list: remove it from the list, then a dso__put(), that probably will
168 * be the last and will then call dso__delete(), end of life.
169 *
170 * That, or at the end of the 'struct machine' lifetime, when all
171 * 'struct dso' instances will be removed from the list, in
172 * dsos__exit(), if they have no other reference from some other data
173 * structure.
174 *
175 * E.g.: after processing a 'perf.data' file and storing references
176 * to objects instantiated while processing events, we will have
177 * references to the 'thread', 'map', 'dso' structs all from 'struct
178 * hist_entry' instances, but we may not need anything not referenced,
179 * so we might as well call machines__exit()/machines__delete() and
180 * garbage collect it.
181 */
182 dso__get(dso);
183}
184
185void dsos__add(struct dsos *dsos, struct dso *dso)
186{
187 down_write(&dsos->lock);
188 __dsos__add(dsos, dso);
189 up_write(&dsos->lock);
190}
191
192static struct dso *__dsos__findnew_by_longname_id(struct rb_root *root, const char *name, struct dso_id *id)
193{
194 return __dsos__findnew_link_by_longname_id(root, NULL, name, id);
195}
196
197static struct dso *__dsos__find_id(struct dsos *dsos, const char *name, struct dso_id *id, bool cmp_short)
198{
199 struct dso *pos;
200
201 if (cmp_short) {
202 list_for_each_entry(pos, &dsos->head, node)
203 if (__dso__cmp_short_name(name, id, pos) == 0)
204 return pos;
205 return NULL;
206 }
207 return __dsos__findnew_by_longname_id(&dsos->root, name, id);
208}
209
210struct dso *__dsos__find(struct dsos *dsos, const char *name, bool cmp_short)
211{
212 return __dsos__find_id(dsos, name, NULL, cmp_short);
213}
214
215static void dso__set_basename(struct dso *dso)
216{
217 char *base, *lname;
218 int tid;
219
220 if (sscanf(dso->long_name, "/tmp/perf-%d.map", &tid) == 1) {
221 if (asprintf(&base, "[JIT] tid %d", tid) < 0)
222 return;
223 } else {
224 /*
225 * basename() may modify path buffer, so we must pass
226 * a copy.
227 */
228 lname = strdup(dso->long_name);
229 if (!lname)
230 return;
231
232 /*
233 * basename() may return a pointer to internal
234 * storage which is reused in subsequent calls
235 * so copy the result.
236 */
237 base = strdup(basename(lname));
238
239 free(lname);
240
241 if (!base)
242 return;
243 }
244 dso__set_short_name(dso, base, true);
245}
246
247static struct dso *__dsos__addnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
248{
249 struct dso *dso = dso__new_id(name, id);
250
251 if (dso != NULL) {
252 __dsos__add(dsos, dso);
253 dso__set_basename(dso);
254 /* Put dso here because __dsos_add already got it */
255 dso__put(dso);
256 }
257 return dso;
258}
259
260struct dso *__dsos__addnew(struct dsos *dsos, const char *name)
261{
262 return __dsos__addnew_id(dsos, name, NULL);
263}
264
265static struct dso *__dsos__findnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
266{
267 struct dso *dso = __dsos__find_id(dsos, name, id, false);
268
269 if (dso && dso_id__empty(&dso->id) && !dso_id__empty(id))
270 dso__inject_id(dso, id);
271
272 return dso ? dso : __dsos__addnew_id(dsos, name, id);
273}
274
275struct dso *dsos__findnew_id(struct dsos *dsos, const char *name, struct dso_id *id)
276{
277 struct dso *dso;
278 down_write(&dsos->lock);
279 dso = dso__get(__dsos__findnew_id(dsos, name, id));
280 up_write(&dsos->lock);
281 return dso;
282}
283
284size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp,
285 bool (skip)(struct dso *dso, int parm), int parm)
286{
287 struct dso *pos;
288 size_t ret = 0;
289
290 list_for_each_entry(pos, head, node) {
291 if (skip && skip(pos, parm))
292 continue;
293 ret += dso__fprintf_buildid(pos, fp);
294 ret += fprintf(fp, " %s\n", pos->long_name);
295 }
296 return ret;
297}
298
299size_t __dsos__fprintf(struct list_head *head, FILE *fp)
300{
301 struct dso *pos;
302 size_t ret = 0;
303
304 list_for_each_entry(pos, head, node) {
305 ret += dso__fprintf(pos, fp);
306 }
307
308 return ret;
309}