4 #include <linux/bitmap.h>
9 struct rb_node rb_node;
15 static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root)
17 struct rb_node **p = &root->rb_node;
18 struct rb_node *parent = NULL;
23 e = rb_entry(parent, struct phys_entry, rb_node);
25 if (entry->start < e->start)
31 rb_link_node(&entry->rb_node, parent, p);
32 rb_insert_color(&entry->rb_node, root);
36 phys_entry__init(struct phys_entry *entry, u64 start, u64 bsize, u64 node)
39 entry->end = start + bsize;
41 RB_CLEAR_NODE(&entry->rb_node);
44 int mem2node__init(struct mem2node *map, struct perf_env *env)
46 struct memory_node *n, *nodes = &env->memory_nodes[0];
47 struct phys_entry *entries, *tmp_entries;
48 u64 bsize = env->memory_bsize;
49 int i, j = 0, max = 0;
51 memset(map, 0x0, sizeof(*map));
54 for (i = 0; i < env->nr_memory_nodes; i++) {
56 max += bitmap_weight(n->set, n->size);
59 entries = zalloc(sizeof(*entries) * max);
63 for (i = 0; i < env->nr_memory_nodes; i++) {
68 for (bit = 0; bit < n->size; bit++) {
71 if (!test_bit(bit, n->set))
77 * Merge nearby areas, we walk in order
78 * through the bitmap, so no need to sort.
81 struct phys_entry *prev = &entries[j - 1];
83 if ((prev->end == start) &&
84 (prev->node == n->node)) {
90 phys_entry__init(&entries[j++], start, bsize, n->node);
94 /* Cut unused entries, due to merging. */
95 tmp_entries = realloc(entries, sizeof(*entries) * j);
96 if (tmp_entries || WARN_ON_ONCE(j == 0))
97 entries = tmp_entries;
99 for (i = 0; i < j; i++) {
100 pr_debug("mem2node %03" PRIu64 " [0x%016" PRIx64 "-0x%016" PRIx64 "]\n",
101 entries[i].node, entries[i].start, entries[i].end);
103 phys_entry__insert(&entries[i], &map->root);
106 map->entries = entries;
110 void mem2node__exit(struct mem2node *map)
112 zfree(&map->entries);
115 int mem2node__node(struct mem2node *map, u64 addr)
117 struct rb_node **p, *parent = NULL;
118 struct phys_entry *entry;
120 p = &map->root.rb_node;
123 entry = rb_entry(parent, struct phys_entry, rb_node);
124 if (addr < entry->start)
126 else if (addr >= entry->end)
134 return entry ? (int) entry->node : -1;