|
@@ -16,6 +16,8 @@
|
|
|
#include "machine.h"
|
|
|
#include <linux/string.h>
|
|
|
|
|
|
+static void __maps__insert(struct maps *maps, struct map *map);
|
|
|
+
|
|
|
const char *map_type__name[MAP__NR_TYPES] = {
|
|
|
[MAP__FUNCTION] = "Functions",
|
|
|
[MAP__VARIABLE] = "Variables",
|
|
@@ -137,6 +139,7 @@ void map__init(struct map *map, enum map_type type,
|
|
|
map->groups = NULL;
|
|
|
map->referenced = false;
|
|
|
map->erange_warned = false;
|
|
|
+ atomic_set(&map->refcnt, 1);
|
|
|
}
|
|
|
|
|
|
struct map *map__new(struct machine *machine, u64 start, u64 len,
|
|
@@ -223,9 +226,16 @@ struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
|
|
|
|
|
|
void map__delete(struct map *map)
|
|
|
{
|
|
|
+ BUG_ON(!RB_EMPTY_NODE(&map->rb_node));
|
|
|
free(map);
|
|
|
}
|
|
|
|
|
|
+void map__put(struct map *map)
|
|
|
+{
|
|
|
+ if (map && atomic_dec_and_test(&map->refcnt))
|
|
|
+ map__delete(map);
|
|
|
+}
|
|
|
+
|
|
|
void map__fixup_start(struct map *map)
|
|
|
{
|
|
|
struct rb_root *symbols = &map->dso->symbols[map->type];
|
|
@@ -418,48 +428,61 @@ u64 map__objdump_2mem(struct map *map, u64 ip)
|
|
|
return ip + map->reloc;
|
|
|
}
|
|
|
|
|
|
+static void maps__init(struct maps *maps)
|
|
|
+{
|
|
|
+ maps->entries = RB_ROOT;
|
|
|
+ pthread_rwlock_init(&maps->lock, NULL);
|
|
|
+ INIT_LIST_HEAD(&maps->removed_maps);
|
|
|
+}
|
|
|
+
|
|
|
void map_groups__init(struct map_groups *mg, struct machine *machine)
|
|
|
{
|
|
|
int i;
|
|
|
for (i = 0; i < MAP__NR_TYPES; ++i) {
|
|
|
- mg->maps[i] = RB_ROOT;
|
|
|
- INIT_LIST_HEAD(&mg->removed_maps[i]);
|
|
|
+ maps__init(&mg->maps[i]);
|
|
|
}
|
|
|
mg->machine = machine;
|
|
|
atomic_set(&mg->refcnt, 1);
|
|
|
}
|
|
|
|
|
|
-static void maps__delete(struct rb_root *maps)
|
|
|
+static void __maps__purge(struct maps *maps)
|
|
|
{
|
|
|
- struct rb_node *next = rb_first(maps);
|
|
|
+ struct rb_root *root = &maps->entries;
|
|
|
+ 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, maps);
|
|
|
- map__delete(pos);
|
|
|
+ rb_erase_init(&pos->rb_node, root);
|
|
|
+ map__put(pos);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-static void maps__delete_removed(struct list_head *maps)
|
|
|
+static void __maps__purge_removed_maps(struct maps *maps)
|
|
|
{
|
|
|
struct map *pos, *n;
|
|
|
|
|
|
- list_for_each_entry_safe(pos, n, maps, node) {
|
|
|
- list_del(&pos->node);
|
|
|
- map__delete(pos);
|
|
|
+ list_for_each_entry_safe(pos, n, &maps->removed_maps, node) {
|
|
|
+ list_del_init(&pos->node);
|
|
|
+ map__put(pos);
|
|
|
}
|
|
|
}
|
|
|
|
|
|
+static void maps__exit(struct maps *maps)
|
|
|
+{
|
|
|
+ pthread_rwlock_wrlock(&maps->lock);
|
|
|
+ __maps__purge(maps);
|
|
|
+ __maps__purge_removed_maps(maps);
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+}
|
|
|
+
|
|
|
void map_groups__exit(struct map_groups *mg)
|
|
|
{
|
|
|
int i;
|
|
|
|
|
|
- for (i = 0; i < MAP__NR_TYPES; ++i) {
|
|
|
- maps__delete(&mg->maps[i]);
|
|
|
- maps__delete_removed(&mg->removed_maps[i]);
|
|
|
- }
|
|
|
+ for (i = 0; i < MAP__NR_TYPES; ++i)
|
|
|
+ maps__exit(&mg->maps[i]);
|
|
|
}
|
|
|
|
|
|
bool map_groups__empty(struct map_groups *mg)
|
|
@@ -469,7 +492,7 @@ bool map_groups__empty(struct map_groups *mg)
|
|
|
for (i = 0; i < MAP__NR_TYPES; ++i) {
|
|
|
if (maps__first(&mg->maps[i]))
|
|
|
return false;
|
|
|
- if (!list_empty(&mg->removed_maps[i]))
|
|
|
+ if (!list_empty(&mg->maps[i].removed_maps))
|
|
|
return false;
|
|
|
}
|
|
|
|
|
@@ -521,20 +544,28 @@ struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
|
|
|
struct map **mapp,
|
|
|
symbol_filter_t filter)
|
|
|
{
|
|
|
+ struct maps *maps = &mg->maps[type];
|
|
|
+ struct symbol *sym;
|
|
|
struct rb_node *nd;
|
|
|
|
|
|
- for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
|
|
|
+ pthread_rwlock_rdlock(&maps->lock);
|
|
|
+
|
|
|
+ for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
|
|
|
struct map *pos = rb_entry(nd, struct map, rb_node);
|
|
|
- struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
|
|
|
+
|
|
|
+ sym = map__find_symbol_by_name(pos, name, filter);
|
|
|
|
|
|
if (sym == NULL)
|
|
|
continue;
|
|
|
if (mapp != NULL)
|
|
|
*mapp = pos;
|
|
|
- return sym;
|
|
|
+ goto out;
|
|
|
}
|
|
|
|
|
|
- return NULL;
|
|
|
+ sym = NULL;
|
|
|
+out:
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+ return sym;
|
|
|
}
|
|
|
|
|
|
int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
|
|
@@ -554,25 +585,35 @@ int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
|
|
|
return ams->sym ? 0 : -1;
|
|
|
}
|
|
|
|
|
|
-size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
|
|
|
- FILE *fp)
|
|
|
+static size_t maps__fprintf(struct maps *maps, FILE *fp)
|
|
|
{
|
|
|
- size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
|
|
|
+ size_t printed = 0;
|
|
|
struct rb_node *nd;
|
|
|
|
|
|
- for (nd = rb_first(&mg->maps[type]); nd; nd = rb_next(nd)) {
|
|
|
+ pthread_rwlock_rdlock(&maps->lock);
|
|
|
+
|
|
|
+ for (nd = rb_first(&maps->entries); 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 += dso__fprintf(pos->dso, pos->type, fp);
|
|
|
printed += fprintf(fp, "--\n");
|
|
|
}
|
|
|
}
|
|
|
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+
|
|
|
return printed;
|
|
|
}
|
|
|
|
|
|
+size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
|
|
|
+ FILE *fp)
|
|
|
+{
|
|
|
+ size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
|
|
|
+ return printed += maps__fprintf(&mg->maps[type], fp);
|
|
|
+}
|
|
|
+
|
|
|
static size_t map_groups__fprintf_maps(struct map_groups *mg, FILE *fp)
|
|
|
{
|
|
|
size_t printed = 0, i;
|
|
@@ -587,7 +628,7 @@ static size_t __map_groups__fprintf_removed_maps(struct map_groups *mg,
|
|
|
struct map *pos;
|
|
|
size_t printed = 0;
|
|
|
|
|
|
- list_for_each_entry(pos, &mg->removed_maps[type], node) {
|
|
|
+ list_for_each_entry(pos, &mg->maps[type].removed_maps, node) {
|
|
|
printed += fprintf(fp, "Map:");
|
|
|
printed += map__fprintf(pos, fp);
|
|
|
if (verbose > 1) {
|
|
@@ -614,13 +655,17 @@ size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
|
|
|
return printed + map_groups__fprintf_removed_maps(mg, fp);
|
|
|
}
|
|
|
|
|
|
-int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
|
|
|
- FILE *fp)
|
|
|
+static int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
|
|
|
{
|
|
|
- struct rb_root *root = &mg->maps[map->type];
|
|
|
- struct rb_node *next = rb_first(root);
|
|
|
+ struct rb_root *root;
|
|
|
+ struct rb_node *next;
|
|
|
int err = 0;
|
|
|
|
|
|
+ pthread_rwlock_wrlock(&maps->lock);
|
|
|
+
|
|
|
+ root = &maps->entries;
|
|
|
+ next = rb_first(root);
|
|
|
+
|
|
|
while (next) {
|
|
|
struct map *pos = rb_entry(next, struct map, rb_node);
|
|
|
next = rb_next(&pos->rb_node);
|
|
@@ -634,7 +679,7 @@ int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
|
|
|
map__fprintf(pos, fp);
|
|
|
}
|
|
|
|
|
|
- rb_erase(&pos->rb_node, root);
|
|
|
+ rb_erase_init(&pos->rb_node, root);
|
|
|
/*
|
|
|
* Now check if we need to create new maps for areas not
|
|
|
* overlapped by the new map:
|
|
@@ -644,11 +689,11 @@ int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
|
|
|
|
|
|
if (before == NULL) {
|
|
|
err = -ENOMEM;
|
|
|
- goto move_map;
|
|
|
+ goto put_map;
|
|
|
}
|
|
|
|
|
|
before->end = map->start;
|
|
|
- map_groups__insert(mg, before);
|
|
|
+ __maps__insert(maps, before);
|
|
|
if (verbose >= 2)
|
|
|
map__fprintf(before, fp);
|
|
|
}
|
|
@@ -658,28 +703,37 @@ int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
|
|
|
|
|
|
if (after == NULL) {
|
|
|
err = -ENOMEM;
|
|
|
- goto move_map;
|
|
|
+ goto put_map;
|
|
|
}
|
|
|
|
|
|
after->start = map->end;
|
|
|
- map_groups__insert(mg, after);
|
|
|
+ __maps__insert(maps, after);
|
|
|
if (verbose >= 2)
|
|
|
map__fprintf(after, fp);
|
|
|
}
|
|
|
-move_map:
|
|
|
+put_map:
|
|
|
/*
|
|
|
* If we have references, just move them to a separate list.
|
|
|
*/
|
|
|
if (pos->referenced)
|
|
|
- list_add_tail(&pos->node, &mg->removed_maps[map->type]);
|
|
|
+ list_add_tail(&pos->node, &maps->removed_maps);
|
|
|
else
|
|
|
- map__delete(pos);
|
|
|
+ map__put(pos);
|
|
|
|
|
|
if (err)
|
|
|
- return err;
|
|
|
+ goto out;
|
|
|
}
|
|
|
|
|
|
- return 0;
|
|
|
+ err = 0;
|
|
|
+out:
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+ return err;
|
|
|
+}
|
|
|
+
|
|
|
+int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
|
|
|
+ FILE *fp)
|
|
|
+{
|
|
|
+ return maps__fixup_overlappings(&mg->maps[map->type], map, fp);
|
|
|
}
|
|
|
|
|
|
/*
|
|
@@ -688,21 +742,28 @@ move_map:
|
|
|
int map_groups__clone(struct map_groups *mg,
|
|
|
struct map_groups *parent, enum map_type type)
|
|
|
{
|
|
|
+ int err = -ENOMEM;
|
|
|
struct map *map;
|
|
|
- struct rb_root *maps = &parent->maps[type];
|
|
|
+ struct maps *maps = &parent->maps[type];
|
|
|
+
|
|
|
+ pthread_rwlock_rdlock(&maps->lock);
|
|
|
|
|
|
for (map = maps__first(maps); map; map = map__next(map)) {
|
|
|
struct map *new = map__clone(map);
|
|
|
if (new == NULL)
|
|
|
- return -ENOMEM;
|
|
|
+ goto out_unlock;
|
|
|
map_groups__insert(mg, new);
|
|
|
}
|
|
|
- return 0;
|
|
|
+
|
|
|
+ err = 0;
|
|
|
+out_unlock:
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+ return err;
|
|
|
}
|
|
|
|
|
|
-void maps__insert(struct rb_root *maps, struct map *map)
|
|
|
+static void __maps__insert(struct maps *maps, struct map *map)
|
|
|
{
|
|
|
- struct rb_node **p = &maps->rb_node;
|
|
|
+ struct rb_node **p = &maps->entries.rb_node;
|
|
|
struct rb_node *parent = NULL;
|
|
|
const u64 ip = map->start;
|
|
|
struct map *m;
|
|
@@ -717,20 +778,38 @@ void maps__insert(struct rb_root *maps, struct map *map)
|
|
|
}
|
|
|
|
|
|
rb_link_node(&map->rb_node, parent, p);
|
|
|
- rb_insert_color(&map->rb_node, maps);
|
|
|
+ rb_insert_color(&map->rb_node, &maps->entries);
|
|
|
+ map__get(map);
|
|
|
}
|
|
|
|
|
|
-void maps__remove(struct rb_root *maps, struct map *map)
|
|
|
+void maps__insert(struct maps *maps, struct map *map)
|
|
|
{
|
|
|
- rb_erase(&map->rb_node, maps);
|
|
|
+ pthread_rwlock_wrlock(&maps->lock);
|
|
|
+ __maps__insert(maps, map);
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
}
|
|
|
|
|
|
-struct map *maps__find(struct rb_root *maps, u64 ip)
|
|
|
+static void __maps__remove(struct maps *maps, struct map *map)
|
|
|
{
|
|
|
- struct rb_node **p = &maps->rb_node;
|
|
|
- struct rb_node *parent = NULL;
|
|
|
+ rb_erase_init(&map->rb_node, &maps->entries);
|
|
|
+ map__put(map);
|
|
|
+}
|
|
|
+
|
|
|
+void maps__remove(struct maps *maps, struct map *map)
|
|
|
+{
|
|
|
+ pthread_rwlock_wrlock(&maps->lock);
|
|
|
+ __maps__remove(maps, map);
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+}
|
|
|
+
|
|
|
+struct map *maps__find(struct maps *maps, u64 ip)
|
|
|
+{
|
|
|
+ struct rb_node **p, *parent = NULL;
|
|
|
struct map *m;
|
|
|
|
|
|
+ pthread_rwlock_rdlock(&maps->lock);
|
|
|
+
|
|
|
+ p = &maps->entries.rb_node;
|
|
|
while (*p != NULL) {
|
|
|
parent = *p;
|
|
|
m = rb_entry(parent, struct map, rb_node);
|
|
@@ -739,15 +818,18 @@ struct map *maps__find(struct rb_root *maps, u64 ip)
|
|
|
else if (ip >= m->end)
|
|
|
p = &(*p)->rb_right;
|
|
|
else
|
|
|
- return m;
|
|
|
+ goto out;
|
|
|
}
|
|
|
|
|
|
- return NULL;
|
|
|
+ m = NULL;
|
|
|
+out:
|
|
|
+ pthread_rwlock_unlock(&maps->lock);
|
|
|
+ return m;
|
|
|
}
|
|
|
|
|
|
-struct map *maps__first(struct rb_root *maps)
|
|
|
+struct map *maps__first(struct maps *maps)
|
|
|
{
|
|
|
- struct rb_node *first = rb_first(maps);
|
|
|
+ struct rb_node *first = rb_first(&maps->entries);
|
|
|
|
|
|
if (first)
|
|
|
return rb_entry(first, struct map, rb_node);
|