|
@@ -38,15 +38,6 @@ failure:
|
|
return ret;
|
|
return ret;
|
|
}
|
|
}
|
|
|
|
|
|
-void map_groups__init(struct map_groups *self)
|
|
|
|
-{
|
|
|
|
- int i;
|
|
|
|
- for (i = 0; i < MAP__NR_TYPES; ++i) {
|
|
|
|
- self->maps[i] = RB_ROOT;
|
|
|
|
- INIT_LIST_HEAD(&self->removed_maps[i]);
|
|
|
|
- }
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
static struct thread *thread__new(pid_t pid)
|
|
static struct thread *thread__new(pid_t pid)
|
|
{
|
|
{
|
|
struct thread *self = zalloc(sizeof(*self));
|
|
struct thread *self = zalloc(sizeof(*self));
|
|
@@ -62,28 +53,6 @@ static struct thread *thread__new(pid_t pid)
|
|
return self;
|
|
return self;
|
|
}
|
|
}
|
|
|
|
|
|
-static void map_groups__flush(struct map_groups *self)
|
|
|
|
-{
|
|
|
|
- int type;
|
|
|
|
-
|
|
|
|
- for (type = 0; type < MAP__NR_TYPES; type++) {
|
|
|
|
- struct rb_root *root = &self->maps[type];
|
|
|
|
- struct rb_node *next = rb_first(root);
|
|
|
|
-
|
|
|
|
- while (next) {
|
|
|
|
- struct map *pos = rb_entry(next, struct map, rb_node);
|
|
|
|
- next = rb_next(&pos->rb_node);
|
|
|
|
- rb_erase(&pos->rb_node, root);
|
|
|
|
- /*
|
|
|
|
- * We may have references to this map, for
|
|
|
|
- * instance in some hist_entry instances, so
|
|
|
|
- * just move them to a separate list.
|
|
|
|
- */
|
|
|
|
- list_add_tail(&pos->node, &self->removed_maps[pos->type]);
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
int thread__set_comm(struct thread *self, const char *comm)
|
|
int thread__set_comm(struct thread *self, const char *comm)
|
|
{
|
|
{
|
|
int err;
|
|
int err;
|
|
@@ -110,69 +79,10 @@ int thread__comm_len(struct thread *self)
|
|
return self->comm_len;
|
|
return self->comm_len;
|
|
}
|
|
}
|
|
|
|
|
|
-size_t __map_groups__fprintf_maps(struct map_groups *self,
|
|
|
|
- enum map_type type, FILE *fp)
|
|
|
|
-{
|
|
|
|
- size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
|
|
|
|
- struct rb_node *nd;
|
|
|
|
-
|
|
|
|
- for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
|
|
|
|
- struct map *pos = rb_entry(nd, struct map, rb_node);
|
|
|
|
- printed += fprintf(fp, "Map:");
|
|
|
|
- printed += map__fprintf(pos, fp);
|
|
|
|
- if (verbose > 2) {
|
|
|
|
- printed += dso__fprintf(pos->dso, type, fp);
|
|
|
|
- printed += fprintf(fp, "--\n");
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- return printed;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-size_t map_groups__fprintf_maps(struct map_groups *self, FILE *fp)
|
|
|
|
-{
|
|
|
|
- size_t printed = 0, i;
|
|
|
|
- for (i = 0; i < MAP__NR_TYPES; ++i)
|
|
|
|
- printed += __map_groups__fprintf_maps(self, i, fp);
|
|
|
|
- return printed;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
|
|
|
|
- enum map_type type, FILE *fp)
|
|
|
|
-{
|
|
|
|
- struct map *pos;
|
|
|
|
- size_t printed = 0;
|
|
|
|
-
|
|
|
|
- list_for_each_entry(pos, &self->removed_maps[type], node) {
|
|
|
|
- printed += fprintf(fp, "Map:");
|
|
|
|
- printed += map__fprintf(pos, fp);
|
|
|
|
- if (verbose > 1) {
|
|
|
|
- printed += dso__fprintf(pos->dso, type, fp);
|
|
|
|
- printed += fprintf(fp, "--\n");
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
- return printed;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-static size_t map_groups__fprintf_removed_maps(struct map_groups *self, FILE *fp)
|
|
|
|
-{
|
|
|
|
- size_t printed = 0, i;
|
|
|
|
- for (i = 0; i < MAP__NR_TYPES; ++i)
|
|
|
|
- printed += __map_groups__fprintf_removed_maps(self, i, fp);
|
|
|
|
- return printed;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-static size_t map_groups__fprintf(struct map_groups *self, FILE *fp)
|
|
|
|
-{
|
|
|
|
- size_t printed = map_groups__fprintf_maps(self, fp);
|
|
|
|
- printed += fprintf(fp, "Removed maps:\n");
|
|
|
|
- return printed + map_groups__fprintf_removed_maps(self, fp);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
static size_t thread__fprintf(struct thread *self, FILE *fp)
|
|
static size_t thread__fprintf(struct thread *self, FILE *fp)
|
|
{
|
|
{
|
|
return fprintf(fp, "Thread %d %s\n", self->pid, self->comm) +
|
|
return fprintf(fp, "Thread %d %s\n", self->pid, self->comm) +
|
|
- map_groups__fprintf(&self->mg, fp);
|
|
|
|
|
|
+ map_groups__fprintf(&self->mg, verbose, fp);
|
|
}
|
|
}
|
|
|
|
|
|
struct thread *perf_session__findnew(struct perf_session *self, pid_t pid)
|
|
struct thread *perf_session__findnew(struct perf_session *self, pid_t pid)
|
|
@@ -214,87 +124,12 @@ struct thread *perf_session__findnew(struct perf_session *self, pid_t pid)
|
|
return th;
|
|
return th;
|
|
}
|
|
}
|
|
|
|
|
|
-static int map_groups__fixup_overlappings(struct map_groups *self,
|
|
|
|
- struct map *map)
|
|
|
|
-{
|
|
|
|
- struct rb_root *root = &self->maps[map->type];
|
|
|
|
- struct rb_node *next = rb_first(root);
|
|
|
|
-
|
|
|
|
- while (next) {
|
|
|
|
- struct map *pos = rb_entry(next, struct map, rb_node);
|
|
|
|
- next = rb_next(&pos->rb_node);
|
|
|
|
-
|
|
|
|
- if (!map__overlap(pos, map))
|
|
|
|
- continue;
|
|
|
|
-
|
|
|
|
- if (verbose >= 2) {
|
|
|
|
- fputs("overlapping maps:\n", stderr);
|
|
|
|
- map__fprintf(map, stderr);
|
|
|
|
- map__fprintf(pos, stderr);
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- rb_erase(&pos->rb_node, root);
|
|
|
|
- /*
|
|
|
|
- * We may have references to this map, for instance in some
|
|
|
|
- * hist_entry instances, so just move them to a separate
|
|
|
|
- * list.
|
|
|
|
- */
|
|
|
|
- list_add_tail(&pos->node, &self->removed_maps[map->type]);
|
|
|
|
- /*
|
|
|
|
- * Now check if we need to create new maps for areas not
|
|
|
|
- * overlapped by the new map:
|
|
|
|
- */
|
|
|
|
- if (map->start > pos->start) {
|
|
|
|
- struct map *before = map__clone(pos);
|
|
|
|
-
|
|
|
|
- if (before == NULL)
|
|
|
|
- return -ENOMEM;
|
|
|
|
-
|
|
|
|
- before->end = map->start - 1;
|
|
|
|
- map_groups__insert(self, before);
|
|
|
|
- if (verbose >= 2)
|
|
|
|
- map__fprintf(before, stderr);
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- if (map->end < pos->end) {
|
|
|
|
- struct map *after = map__clone(pos);
|
|
|
|
-
|
|
|
|
- if (after == NULL)
|
|
|
|
- return -ENOMEM;
|
|
|
|
-
|
|
|
|
- after->start = map->end + 1;
|
|
|
|
- map_groups__insert(self, after);
|
|
|
|
- if (verbose >= 2)
|
|
|
|
- map__fprintf(after, stderr);
|
|
|
|
- }
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
- return 0;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
void thread__insert_map(struct thread *self, struct map *map)
|
|
void thread__insert_map(struct thread *self, struct map *map)
|
|
{
|
|
{
|
|
- map_groups__fixup_overlappings(&self->mg, map);
|
|
|
|
|
|
+ map_groups__fixup_overlappings(&self->mg, map, verbose, stderr);
|
|
map_groups__insert(&self->mg, map);
|
|
map_groups__insert(&self->mg, map);
|
|
}
|
|
}
|
|
|
|
|
|
-/*
|
|
|
|
- * XXX This should not really _copy_ te maps, but refcount them.
|
|
|
|
- */
|
|
|
|
-static int map_groups__clone(struct map_groups *self,
|
|
|
|
- struct map_groups *parent, enum map_type type)
|
|
|
|
-{
|
|
|
|
- struct rb_node *nd;
|
|
|
|
- for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
|
|
|
|
- struct map *map = rb_entry(nd, struct map, rb_node);
|
|
|
|
- struct map *new = map__clone(map);
|
|
|
|
- if (new == NULL)
|
|
|
|
- return -ENOMEM;
|
|
|
|
- map_groups__insert(self, new);
|
|
|
|
- }
|
|
|
|
- return 0;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
int thread__fork(struct thread *self, struct thread *parent)
|
|
int thread__fork(struct thread *self, struct thread *parent)
|
|
{
|
|
{
|
|
int i;
|
|
int i;
|