1#include <elf.h>
2#include <inttypes.h>
3#include <sys/ttydefaults.h>
4#include <string.h>
5#include <linux/bitops.h>
6#include "../../util/util.h"
7#include "../../util/debug.h"
8#include "../../util/symbol.h"
9#include "../browser.h"
10#include "../helpline.h"
11#include "../keysyms.h"
12#include "map.h"
13
14struct map_browser {
15 struct ui_browser b;
16 struct map *map;
17 u8 addrlen;
18};
19
20static void map_browser__write(struct ui_browser *browser, void *nd, int row)
21{
22 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
23 struct map_browser *mb = container_of(browser, struct map_browser, b);
24 bool current_entry = ui_browser__is_current_entry(browser, row);
25 int width;
26
27 ui_browser__set_percent_color(browser, 0, current_entry);
28 ui_browser__printf(browser, "%*" PRIx64 " %*" PRIx64 " %c ",
29 mb->addrlen, sym->start, mb->addrlen, sym->end,
30 sym->binding == STB_GLOBAL ? 'g' :
31 sym->binding == STB_LOCAL ? 'l' : 'w');
32 width = browser->width - ((mb->addrlen * 2) + 4);
33 if (width > 0)
34 ui_browser__write_nstring(browser, sym->name, width);
35}
36
37
38static u32 *symbol__browser_index(struct symbol *browser)
39{
40 return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32);
41}
42
43static int map_browser__search(struct map_browser *browser)
44{
45 char target[512];
46 struct symbol *sym;
47 int err = ui_browser__input_window("Search by name/addr",
48 "Prefix with 0x to search by address",
49 target, "ENTER: OK, ESC: Cancel", 0);
50 if (err != K_ENTER)
51 return -1;
52
53 if (target[0] == '0' && tolower(target[1]) == 'x') {
54 u64 addr = strtoull(target, NULL, 16);
55 sym = map__find_symbol(browser->map, addr, NULL);
56 } else
57 sym = map__find_symbol_by_name(browser->map, target, NULL);
58
59 if (sym != NULL) {
60 u32 *idx = symbol__browser_index(sym);
61
62 browser->b.top = &sym->rb_node;
63 browser->b.index = browser->b.top_idx = *idx;
64 } else
65 ui_helpline__fpush("%s not found!", target);
66
67 return 0;
68}
69
70static int map_browser__run(struct map_browser *browser)
71{
72 int key;
73
74 if (ui_browser__show(&browser->b, browser->map->dso->long_name,
75 "Press ESC to exit, %s / to search",
76 verbose ? "" : "restart with -v to use") < 0)
77 return -1;
78
79 while (1) {
80 key = ui_browser__run(&browser->b, 0);
81
82 switch (key) {
83 case '/':
84 if (verbose)
85 map_browser__search(browser);
86 default:
87 break;
88 case K_LEFT:
89 case K_ESC:
90 case 'q':
91 case CTRL('c'):
92 goto out;
93 }
94 }
95out:
96 ui_browser__hide(&browser->b);
97 return key;
98}
99
100int map__browse(struct map *map)
101{
102 struct map_browser mb = {
103 .b = {
104 .entries = &map->dso->symbols[map->type],
105 .refresh = ui_browser__rb_tree_refresh,
106 .seek = ui_browser__rb_tree_seek,
107 .write = map_browser__write,
108 },
109 .map = map,
110 };
111 struct rb_node *nd;
112 char tmp[BITS_PER_LONG / 4];
113 u64 maxaddr = 0;
114
115 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) {
116 struct symbol *pos = rb_entry(nd, struct symbol, rb_node);
117
118 if (maxaddr < pos->end)
119 maxaddr = pos->end;
120 if (verbose) {
121 u32 *idx = symbol__browser_index(pos);
122 *idx = mb.b.nr_entries;
123 }
124 ++mb.b.nr_entries;
125 }
126
127 mb.addrlen = snprintf(tmp, sizeof(tmp), "%" PRIx64, maxaddr);
128 return map_browser__run(&mb);
129}
130
