9 static struct rb_root threads;
10 static struct thread *last_match;
12 void map_groups__init(struct map_groups *self)
15 for (i = 0; i < MAP__NR_TYPES; ++i) {
16 self->maps[i] = RB_ROOT;
17 INIT_LIST_HEAD(&self->removed_maps[i]);
21 static struct thread *thread__new(pid_t pid)
23 struct thread *self = zalloc(sizeof(*self));
26 map_groups__init(&self->mg);
28 self->comm = malloc(32);
30 snprintf(self->comm, 32, ":%d", self->pid);
36 int thread__set_comm(struct thread *self, const char *comm)
40 self->comm = strdup(comm);
41 return self->comm ? 0 : -ENOMEM;
44 int thread__comm_len(struct thread *self)
46 if (!self->comm_len) {
49 self->comm_len = strlen(self->comm);
52 return self->comm_len;
55 static const char *map_type__name[MAP__NR_TYPES] = {
56 [MAP__FUNCTION] = "Functions",
57 [MAP__VARIABLE] = "Variables",
60 static size_t __map_groups__fprintf_maps(struct map_groups *self,
61 enum map_type type, FILE *fp)
63 size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
66 for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
67 struct map *pos = rb_entry(nd, struct map, rb_node);
68 printed += fprintf(fp, "Map:");
69 printed += map__fprintf(pos, fp);
71 printed += dso__fprintf(pos->dso, type, fp);
72 printed += fprintf(fp, "--\n");
79 size_t map_groups__fprintf_maps(struct map_groups *self, FILE *fp)
81 size_t printed = 0, i;
82 for (i = 0; i < MAP__NR_TYPES; ++i)
83 printed += __map_groups__fprintf_maps(self, i, fp);
87 static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
88 enum map_type type, FILE *fp)
93 list_for_each_entry(pos, &self->removed_maps[type], node) {
94 printed += fprintf(fp, "Map:");
95 printed += map__fprintf(pos, fp);
97 printed += dso__fprintf(pos->dso, type, fp);
98 printed += fprintf(fp, "--\n");
104 static size_t map_groups__fprintf_removed_maps(struct map_groups *self, FILE *fp)
106 size_t printed = 0, i;
107 for (i = 0; i < MAP__NR_TYPES; ++i)
108 printed += __map_groups__fprintf_removed_maps(self, i, fp);
112 static size_t map_groups__fprintf(struct map_groups *self, FILE *fp)
114 size_t printed = map_groups__fprintf_maps(self, fp);
115 printed += fprintf(fp, "Removed maps:\n");
116 return printed + map_groups__fprintf_removed_maps(self, fp);
119 static size_t thread__fprintf(struct thread *self, FILE *fp)
121 return fprintf(fp, "Thread %d %s\n", self->pid, self->comm) +
122 map_groups__fprintf(&self->mg, fp);
125 struct thread *threads__findnew(pid_t pid)
127 struct rb_node **p = &threads.rb_node;
128 struct rb_node *parent = NULL;
132 * Font-end cache - PID lookups come in blocks,
133 * so most of the time we dont have to look up
136 if (last_match && last_match->pid == pid)
141 th = rb_entry(parent, struct thread, rb_node);
143 if (th->pid == pid) {
154 th = thread__new(pid);
156 rb_link_node(&th->rb_node, parent, p);
157 rb_insert_color(&th->rb_node, &threads);
164 struct thread *register_idle_thread(void)
166 struct thread *thread = threads__findnew(0);
168 if (!thread || thread__set_comm(thread, "swapper")) {
169 fprintf(stderr, "problem inserting idle task.\n");
176 static void map_groups__remove_overlappings(struct map_groups *self,
179 struct rb_root *root = &self->maps[map->type];
180 struct rb_node *next = rb_first(root);
183 struct map *pos = rb_entry(next, struct map, rb_node);
184 next = rb_next(&pos->rb_node);
186 if (!map__overlap(pos, map))
190 fputs("overlapping maps:\n", stderr);
191 map__fprintf(map, stderr);
192 map__fprintf(pos, stderr);
195 rb_erase(&pos->rb_node, root);
197 * We may have references to this map, for instance in some
198 * hist_entry instances, so just move them to a separate
201 list_add_tail(&pos->node, &self->removed_maps[map->type]);
205 void maps__insert(struct rb_root *maps, struct map *map)
207 struct rb_node **p = &maps->rb_node;
208 struct rb_node *parent = NULL;
209 const u64 ip = map->start;
214 m = rb_entry(parent, struct map, rb_node);
221 rb_link_node(&map->rb_node, parent, p);
222 rb_insert_color(&map->rb_node, maps);
225 struct map *maps__find(struct rb_root *maps, u64 ip)
227 struct rb_node **p = &maps->rb_node;
228 struct rb_node *parent = NULL;
233 m = rb_entry(parent, struct map, rb_node);
236 else if (ip > m->end)
245 void thread__insert_map(struct thread *self, struct map *map)
247 map_groups__remove_overlappings(&self->mg, map);
248 map_groups__insert(&self->mg, map);
252 * XXX This should not really _copy_ te maps, but refcount them.
254 static int map_groups__clone(struct map_groups *self,
255 struct map_groups *parent, enum map_type type)
258 for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
259 struct map *map = rb_entry(nd, struct map, rb_node);
260 struct map *new = map__clone(map);
263 map_groups__insert(self, new);
268 int thread__fork(struct thread *self, struct thread *parent)
274 self->comm = strdup(parent->comm);
278 for (i = 0; i < MAP__NR_TYPES; ++i)
279 if (map_groups__clone(&self->mg, &parent->mg, i) < 0)
284 size_t threads__fprintf(FILE *fp)
289 for (nd = rb_first(&threads); nd; nd = rb_next(nd)) {
290 struct thread *pos = rb_entry(nd, struct thread, rb_node);
292 ret += thread__fprintf(pos, fp);
298 struct symbol *map_groups__find_symbol(struct map_groups *self,
299 enum map_type type, u64 addr,
300 symbol_filter_t filter)
302 struct map *map = map_groups__find(self, type, addr);
305 return map__find_symbol(map, map->map_ip(map, addr), filter);