map.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682
  1. #include "symbol.h"
  2. #include <errno.h>
  3. #include <limits.h>
  4. #include <stdlib.h>
  5. #include <string.h>
  6. #include <stdio.h>
  7. #include <unistd.h>
  8. #include "map.h"
  9. const char *map_type__name[MAP__NR_TYPES] = {
  10. [MAP__FUNCTION] = "Functions",
  11. [MAP__VARIABLE] = "Variables",
  12. };
  13. static inline int is_anon_memory(const char *filename)
  14. {
  15. return strcmp(filename, "//anon") == 0;
  16. }
  17. void map__init(struct map *self, enum map_type type,
  18. u64 start, u64 end, u64 pgoff, struct dso *dso)
  19. {
  20. self->type = type;
  21. self->start = start;
  22. self->end = end;
  23. self->pgoff = pgoff;
  24. self->dso = dso;
  25. self->map_ip = map__map_ip;
  26. self->unmap_ip = map__unmap_ip;
  27. RB_CLEAR_NODE(&self->rb_node);
  28. self->groups = NULL;
  29. self->referenced = false;
  30. }
  31. struct map *map__new(struct list_head *dsos__list, u64 start, u64 len,
  32. u64 pgoff, u32 pid, char *filename,
  33. enum map_type type)
  34. {
  35. struct map *self = malloc(sizeof(*self));
  36. if (self != NULL) {
  37. char newfilename[PATH_MAX];
  38. struct dso *dso;
  39. int anon;
  40. anon = is_anon_memory(filename);
  41. if (anon) {
  42. snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
  43. filename = newfilename;
  44. }
  45. dso = __dsos__findnew(dsos__list, filename);
  46. if (dso == NULL)
  47. goto out_delete;
  48. map__init(self, type, start, start + len, pgoff, dso);
  49. if (anon) {
  50. set_identity:
  51. self->map_ip = self->unmap_ip = identity__map_ip;
  52. } else if (strcmp(filename, "[vdso]") == 0) {
  53. dso__set_loaded(dso, self->type);
  54. goto set_identity;
  55. }
  56. }
  57. return self;
  58. out_delete:
  59. free(self);
  60. return NULL;
  61. }
  62. void map__delete(struct map *self)
  63. {
  64. free(self);
  65. }
  66. void map__fixup_start(struct map *self)
  67. {
  68. struct rb_root *symbols = &self->dso->symbols[self->type];
  69. struct rb_node *nd = rb_first(symbols);
  70. if (nd != NULL) {
  71. struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  72. self->start = sym->start;
  73. }
  74. }
  75. void map__fixup_end(struct map *self)
  76. {
  77. struct rb_root *symbols = &self->dso->symbols[self->type];
  78. struct rb_node *nd = rb_last(symbols);
  79. if (nd != NULL) {
  80. struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  81. self->end = sym->end;
  82. }
  83. }
  84. #define DSO__DELETED "(deleted)"
  85. int map__load(struct map *self, symbol_filter_t filter)
  86. {
  87. const char *name = self->dso->long_name;
  88. int nr;
  89. if (dso__loaded(self->dso, self->type))
  90. return 0;
  91. nr = dso__load(self->dso, self, filter);
  92. if (nr < 0) {
  93. if (self->dso->has_build_id) {
  94. char sbuild_id[BUILD_ID_SIZE * 2 + 1];
  95. build_id__sprintf(self->dso->build_id,
  96. sizeof(self->dso->build_id),
  97. sbuild_id);
  98. pr_warning("%s with build id %s not found",
  99. name, sbuild_id);
  100. } else
  101. pr_warning("Failed to open %s", name);
  102. pr_warning(", continuing without symbols\n");
  103. return -1;
  104. } else if (nr == 0) {
  105. const size_t len = strlen(name);
  106. const size_t real_len = len - sizeof(DSO__DELETED);
  107. if (len > sizeof(DSO__DELETED) &&
  108. strcmp(name + real_len + 1, DSO__DELETED) == 0) {
  109. pr_warning("%.*s was updated, restart the long "
  110. "running apps that use it!\n",
  111. (int)real_len, name);
  112. } else {
  113. pr_warning("no symbols found in %s, maybe install "
  114. "a debug package?\n", name);
  115. }
  116. return -1;
  117. }
  118. /*
  119. * Only applies to the kernel, as its symtabs aren't relative like the
  120. * module ones.
  121. */
  122. if (self->dso->kernel)
  123. map__reloc_vmlinux(self);
  124. return 0;
  125. }
  126. struct symbol *map__find_symbol(struct map *self, u64 addr,
  127. symbol_filter_t filter)
  128. {
  129. if (map__load(self, filter) < 0)
  130. return NULL;
  131. return dso__find_symbol(self->dso, self->type, addr);
  132. }
  133. struct symbol *map__find_symbol_by_name(struct map *self, const char *name,
  134. symbol_filter_t filter)
  135. {
  136. if (map__load(self, filter) < 0)
  137. return NULL;
  138. if (!dso__sorted_by_name(self->dso, self->type))
  139. dso__sort_by_name(self->dso, self->type);
  140. return dso__find_symbol_by_name(self->dso, self->type, name);
  141. }
  142. struct map *map__clone(struct map *self)
  143. {
  144. struct map *map = malloc(sizeof(*self));
  145. if (!map)
  146. return NULL;
  147. memcpy(map, self, sizeof(*self));
  148. return map;
  149. }
  150. int map__overlap(struct map *l, struct map *r)
  151. {
  152. if (l->start > r->start) {
  153. struct map *t = l;
  154. l = r;
  155. r = t;
  156. }
  157. if (l->end > r->start)
  158. return 1;
  159. return 0;
  160. }
  161. size_t map__fprintf(struct map *self, FILE *fp)
  162. {
  163. return fprintf(fp, " %Lx-%Lx %Lx %s\n",
  164. self->start, self->end, self->pgoff, self->dso->name);
  165. }
  166. /*
  167. * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
  168. * map->dso->adjust_symbols==1 for ET_EXEC-like cases.
  169. */
  170. u64 map__rip_2objdump(struct map *map, u64 rip)
  171. {
  172. u64 addr = map->dso->adjust_symbols ?
  173. map->unmap_ip(map, rip) : /* RIP -> IP */
  174. rip;
  175. return addr;
  176. }
  177. u64 map__objdump_2ip(struct map *map, u64 addr)
  178. {
  179. u64 ip = map->dso->adjust_symbols ?
  180. addr :
  181. map->unmap_ip(map, addr); /* RIP -> IP */
  182. return ip;
  183. }
  184. void map_groups__init(struct map_groups *self)
  185. {
  186. int i;
  187. for (i = 0; i < MAP__NR_TYPES; ++i) {
  188. self->maps[i] = RB_ROOT;
  189. INIT_LIST_HEAD(&self->removed_maps[i]);
  190. }
  191. self->machine = NULL;
  192. }
  193. static void maps__delete(struct rb_root *self)
  194. {
  195. struct rb_node *next = rb_first(self);
  196. while (next) {
  197. struct map *pos = rb_entry(next, struct map, rb_node);
  198. next = rb_next(&pos->rb_node);
  199. rb_erase(&pos->rb_node, self);
  200. map__delete(pos);
  201. }
  202. }
  203. static void maps__delete_removed(struct list_head *self)
  204. {
  205. struct map *pos, *n;
  206. list_for_each_entry_safe(pos, n, self, node) {
  207. list_del(&pos->node);
  208. map__delete(pos);
  209. }
  210. }
  211. void map_groups__exit(struct map_groups *self)
  212. {
  213. int i;
  214. for (i = 0; i < MAP__NR_TYPES; ++i) {
  215. maps__delete(&self->maps[i]);
  216. maps__delete_removed(&self->removed_maps[i]);
  217. }
  218. }
  219. void map_groups__flush(struct map_groups *self)
  220. {
  221. int type;
  222. for (type = 0; type < MAP__NR_TYPES; type++) {
  223. struct rb_root *root = &self->maps[type];
  224. struct rb_node *next = rb_first(root);
  225. while (next) {
  226. struct map *pos = rb_entry(next, struct map, rb_node);
  227. next = rb_next(&pos->rb_node);
  228. rb_erase(&pos->rb_node, root);
  229. /*
  230. * We may have references to this map, for
  231. * instance in some hist_entry instances, so
  232. * just move them to a separate list.
  233. */
  234. list_add_tail(&pos->node, &self->removed_maps[pos->type]);
  235. }
  236. }
  237. }
  238. struct symbol *map_groups__find_symbol(struct map_groups *self,
  239. enum map_type type, u64 addr,
  240. struct map **mapp,
  241. symbol_filter_t filter)
  242. {
  243. struct map *map = map_groups__find(self, type, addr);
  244. if (map != NULL) {
  245. if (mapp != NULL)
  246. *mapp = map;
  247. return map__find_symbol(map, map->map_ip(map, addr), filter);
  248. }
  249. return NULL;
  250. }
  251. struct symbol *map_groups__find_symbol_by_name(struct map_groups *self,
  252. enum map_type type,
  253. const char *name,
  254. struct map **mapp,
  255. symbol_filter_t filter)
  256. {
  257. struct rb_node *nd;
  258. for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
  259. struct map *pos = rb_entry(nd, struct map, rb_node);
  260. struct symbol *sym = map__find_symbol_by_name(pos, name, filter);
  261. if (sym == NULL)
  262. continue;
  263. if (mapp != NULL)
  264. *mapp = pos;
  265. return sym;
  266. }
  267. return NULL;
  268. }
  269. size_t __map_groups__fprintf_maps(struct map_groups *self,
  270. enum map_type type, int verbose, FILE *fp)
  271. {
  272. size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
  273. struct rb_node *nd;
  274. for (nd = rb_first(&self->maps[type]); nd; nd = rb_next(nd)) {
  275. struct map *pos = rb_entry(nd, struct map, rb_node);
  276. printed += fprintf(fp, "Map:");
  277. printed += map__fprintf(pos, fp);
  278. if (verbose > 2) {
  279. printed += dso__fprintf(pos->dso, type, fp);
  280. printed += fprintf(fp, "--\n");
  281. }
  282. }
  283. return printed;
  284. }
  285. size_t map_groups__fprintf_maps(struct map_groups *self, int verbose, FILE *fp)
  286. {
  287. size_t printed = 0, i;
  288. for (i = 0; i < MAP__NR_TYPES; ++i)
  289. printed += __map_groups__fprintf_maps(self, i, verbose, fp);
  290. return printed;
  291. }
  292. static size_t __map_groups__fprintf_removed_maps(struct map_groups *self,
  293. enum map_type type,
  294. int verbose, FILE *fp)
  295. {
  296. struct map *pos;
  297. size_t printed = 0;
  298. list_for_each_entry(pos, &self->removed_maps[type], node) {
  299. printed += fprintf(fp, "Map:");
  300. printed += map__fprintf(pos, fp);
  301. if (verbose > 1) {
  302. printed += dso__fprintf(pos->dso, type, fp);
  303. printed += fprintf(fp, "--\n");
  304. }
  305. }
  306. return printed;
  307. }
  308. static size_t map_groups__fprintf_removed_maps(struct map_groups *self,
  309. int verbose, FILE *fp)
  310. {
  311. size_t printed = 0, i;
  312. for (i = 0; i < MAP__NR_TYPES; ++i)
  313. printed += __map_groups__fprintf_removed_maps(self, i, verbose, fp);
  314. return printed;
  315. }
  316. size_t map_groups__fprintf(struct map_groups *self, int verbose, FILE *fp)
  317. {
  318. size_t printed = map_groups__fprintf_maps(self, verbose, fp);
  319. printed += fprintf(fp, "Removed maps:\n");
  320. return printed + map_groups__fprintf_removed_maps(self, verbose, fp);
  321. }
  322. int map_groups__fixup_overlappings(struct map_groups *self, struct map *map,
  323. int verbose, FILE *fp)
  324. {
  325. struct rb_root *root = &self->maps[map->type];
  326. struct rb_node *next = rb_first(root);
  327. int err = 0;
  328. while (next) {
  329. struct map *pos = rb_entry(next, struct map, rb_node);
  330. next = rb_next(&pos->rb_node);
  331. if (!map__overlap(pos, map))
  332. continue;
  333. if (verbose >= 2) {
  334. fputs("overlapping maps:\n", fp);
  335. map__fprintf(map, fp);
  336. map__fprintf(pos, fp);
  337. }
  338. rb_erase(&pos->rb_node, root);
  339. /*
  340. * Now check if we need to create new maps for areas not
  341. * overlapped by the new map:
  342. */
  343. if (map->start > pos->start) {
  344. struct map *before = map__clone(pos);
  345. if (before == NULL) {
  346. err = -ENOMEM;
  347. goto move_map;
  348. }
  349. before->end = map->start - 1;
  350. map_groups__insert(self, before);
  351. if (verbose >= 2)
  352. map__fprintf(before, fp);
  353. }
  354. if (map->end < pos->end) {
  355. struct map *after = map__clone(pos);
  356. if (after == NULL) {
  357. err = -ENOMEM;
  358. goto move_map;
  359. }
  360. after->start = map->end + 1;
  361. map_groups__insert(self, after);
  362. if (verbose >= 2)
  363. map__fprintf(after, fp);
  364. }
  365. move_map:
  366. /*
  367. * If we have references, just move them to a separate list.
  368. */
  369. if (pos->referenced)
  370. list_add_tail(&pos->node, &self->removed_maps[map->type]);
  371. else
  372. map__delete(pos);
  373. if (err)
  374. return err;
  375. }
  376. return 0;
  377. }
  378. /*
  379. * XXX This should not really _copy_ te maps, but refcount them.
  380. */
  381. int map_groups__clone(struct map_groups *self,
  382. struct map_groups *parent, enum map_type type)
  383. {
  384. struct rb_node *nd;
  385. for (nd = rb_first(&parent->maps[type]); nd; nd = rb_next(nd)) {
  386. struct map *map = rb_entry(nd, struct map, rb_node);
  387. struct map *new = map__clone(map);
  388. if (new == NULL)
  389. return -ENOMEM;
  390. map_groups__insert(self, new);
  391. }
  392. return 0;
  393. }
  394. static u64 map__reloc_map_ip(struct map *map, u64 ip)
  395. {
  396. return ip + (s64)map->pgoff;
  397. }
  398. static u64 map__reloc_unmap_ip(struct map *map, u64 ip)
  399. {
  400. return ip - (s64)map->pgoff;
  401. }
  402. void map__reloc_vmlinux(struct map *self)
  403. {
  404. struct kmap *kmap = map__kmap(self);
  405. s64 reloc;
  406. if (!kmap->ref_reloc_sym || !kmap->ref_reloc_sym->unrelocated_addr)
  407. return;
  408. reloc = (kmap->ref_reloc_sym->unrelocated_addr -
  409. kmap->ref_reloc_sym->addr);
  410. if (!reloc)
  411. return;
  412. self->map_ip = map__reloc_map_ip;
  413. self->unmap_ip = map__reloc_unmap_ip;
  414. self->pgoff = reloc;
  415. }
  416. void maps__insert(struct rb_root *maps, struct map *map)
  417. {
  418. struct rb_node **p = &maps->rb_node;
  419. struct rb_node *parent = NULL;
  420. const u64 ip = map->start;
  421. struct map *m;
  422. while (*p != NULL) {
  423. parent = *p;
  424. m = rb_entry(parent, struct map, rb_node);
  425. if (ip < m->start)
  426. p = &(*p)->rb_left;
  427. else
  428. p = &(*p)->rb_right;
  429. }
  430. rb_link_node(&map->rb_node, parent, p);
  431. rb_insert_color(&map->rb_node, maps);
  432. }
  433. void maps__remove(struct rb_root *self, struct map *map)
  434. {
  435. rb_erase(&map->rb_node, self);
  436. }
  437. struct map *maps__find(struct rb_root *maps, u64 ip)
  438. {
  439. struct rb_node **p = &maps->rb_node;
  440. struct rb_node *parent = NULL;
  441. struct map *m;
  442. while (*p != NULL) {
  443. parent = *p;
  444. m = rb_entry(parent, struct map, rb_node);
  445. if (ip < m->start)
  446. p = &(*p)->rb_left;
  447. else if (ip > m->end)
  448. p = &(*p)->rb_right;
  449. else
  450. return m;
  451. }
  452. return NULL;
  453. }
  454. int machine__init(struct machine *self, const char *root_dir, pid_t pid)
  455. {
  456. map_groups__init(&self->kmaps);
  457. RB_CLEAR_NODE(&self->rb_node);
  458. INIT_LIST_HEAD(&self->user_dsos);
  459. INIT_LIST_HEAD(&self->kernel_dsos);
  460. self->kmaps.machine = self;
  461. self->pid = pid;
  462. self->root_dir = strdup(root_dir);
  463. return self->root_dir == NULL ? -ENOMEM : 0;
  464. }
  465. static void dsos__delete(struct list_head *self)
  466. {
  467. struct dso *pos, *n;
  468. list_for_each_entry_safe(pos, n, self, node) {
  469. list_del(&pos->node);
  470. dso__delete(pos);
  471. }
  472. }
  473. void machine__exit(struct machine *self)
  474. {
  475. map_groups__exit(&self->kmaps);
  476. dsos__delete(&self->user_dsos);
  477. dsos__delete(&self->kernel_dsos);
  478. free(self->root_dir);
  479. self->root_dir = NULL;
  480. }
  481. void machine__delete(struct machine *self)
  482. {
  483. machine__exit(self);
  484. free(self);
  485. }
  486. struct machine *machines__add(struct rb_root *self, pid_t pid,
  487. const char *root_dir)
  488. {
  489. struct rb_node **p = &self->rb_node;
  490. struct rb_node *parent = NULL;
  491. struct machine *pos, *machine = malloc(sizeof(*machine));
  492. if (!machine)
  493. return NULL;
  494. if (machine__init(machine, root_dir, pid) != 0) {
  495. free(machine);
  496. return NULL;
  497. }
  498. while (*p != NULL) {
  499. parent = *p;
  500. pos = rb_entry(parent, struct machine, rb_node);
  501. if (pid < pos->pid)
  502. p = &(*p)->rb_left;
  503. else
  504. p = &(*p)->rb_right;
  505. }
  506. rb_link_node(&machine->rb_node, parent, p);
  507. rb_insert_color(&machine->rb_node, self);
  508. return machine;
  509. }
  510. struct machine *machines__find(struct rb_root *self, pid_t pid)
  511. {
  512. struct rb_node **p = &self->rb_node;
  513. struct rb_node *parent = NULL;
  514. struct machine *machine;
  515. struct machine *default_machine = NULL;
  516. while (*p != NULL) {
  517. parent = *p;
  518. machine = rb_entry(parent, struct machine, rb_node);
  519. if (pid < machine->pid)
  520. p = &(*p)->rb_left;
  521. else if (pid > machine->pid)
  522. p = &(*p)->rb_right;
  523. else
  524. return machine;
  525. if (!machine->pid)
  526. default_machine = machine;
  527. }
  528. return default_machine;
  529. }
  530. struct machine *machines__findnew(struct rb_root *self, pid_t pid)
  531. {
  532. char path[PATH_MAX];
  533. const char *root_dir;
  534. struct machine *machine = machines__find(self, pid);
  535. if (!machine || machine->pid != pid) {
  536. if (pid == HOST_KERNEL_ID || pid == DEFAULT_GUEST_KERNEL_ID)
  537. root_dir = "";
  538. else {
  539. if (!symbol_conf.guestmount)
  540. goto out;
  541. sprintf(path, "%s/%d", symbol_conf.guestmount, pid);
  542. if (access(path, R_OK)) {
  543. pr_err("Can't access file %s\n", path);
  544. goto out;
  545. }
  546. root_dir = path;
  547. }
  548. machine = machines__add(self, pid, root_dir);
  549. }
  550. out:
  551. return machine;
  552. }
  553. void machines__process(struct rb_root *self, machine__process_t process, void *data)
  554. {
  555. struct rb_node *nd;
  556. for (nd = rb_first(self); nd; nd = rb_next(nd)) {
  557. struct machine *pos = rb_entry(nd, struct machine, rb_node);
  558. process(pos, data);
  559. }
  560. }
  561. char *machine__mmap_name(struct machine *self, char *bf, size_t size)
  562. {
  563. if (machine__is_host(self))
  564. snprintf(bf, size, "[%s]", "kernel.kallsyms");
  565. else if (machine__is_default_guest(self))
  566. snprintf(bf, size, "[%s]", "guest.kernel.kallsyms");
  567. else
  568. snprintf(bf, size, "[%s.%d]", "guest.kernel.kallsyms", self->pid);
  569. return bf;
  570. }