map.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820
  1. #include "symbol.h"
  2. #include <errno.h>
  3. #include <inttypes.h>
  4. #include <limits.h>
  5. #include <stdlib.h>
  6. #include <string.h>
  7. #include <stdio.h>
  8. #include <unistd.h>
  9. #include "map.h"
  10. #include "thread.h"
  11. #include "strlist.h"
  12. #include "vdso.h"
  13. #include "build-id.h"
  14. #include "util.h"
  15. #include "debug.h"
  16. #include "machine.h"
  17. #include <linux/string.h>
  18. static void __maps__insert(struct maps *maps, struct map *map);
  19. const char *map_type__name[MAP__NR_TYPES] = {
  20. [MAP__FUNCTION] = "Functions",
  21. [MAP__VARIABLE] = "Variables",
  22. };
  23. static inline int is_anon_memory(const char *filename)
  24. {
  25. return !strcmp(filename, "//anon") ||
  26. !strcmp(filename, "/dev/zero (deleted)") ||
  27. !strcmp(filename, "/anon_hugepage (deleted)");
  28. }
  29. static inline int is_no_dso_memory(const char *filename)
  30. {
  31. return !strncmp(filename, "[stack", 6) ||
  32. !strncmp(filename, "/SYSV",5) ||
  33. !strcmp(filename, "[heap]");
  34. }
  35. static inline int is_android_lib(const char *filename)
  36. {
  37. return !strncmp(filename, "/data/app-lib", 13) ||
  38. !strncmp(filename, "/system/lib", 11);
  39. }
  40. static inline bool replace_android_lib(const char *filename, char *newfilename)
  41. {
  42. const char *libname;
  43. char *app_abi;
  44. size_t app_abi_length, new_length;
  45. size_t lib_length = 0;
  46. libname = strrchr(filename, '/');
  47. if (libname)
  48. lib_length = strlen(libname);
  49. app_abi = getenv("APP_ABI");
  50. if (!app_abi)
  51. return false;
  52. app_abi_length = strlen(app_abi);
  53. if (!strncmp(filename, "/data/app-lib", 13)) {
  54. char *apk_path;
  55. if (!app_abi_length)
  56. return false;
  57. new_length = 7 + app_abi_length + lib_length;
  58. apk_path = getenv("APK_PATH");
  59. if (apk_path) {
  60. new_length += strlen(apk_path) + 1;
  61. if (new_length > PATH_MAX)
  62. return false;
  63. snprintf(newfilename, new_length,
  64. "%s/libs/%s/%s", apk_path, app_abi, libname);
  65. } else {
  66. if (new_length > PATH_MAX)
  67. return false;
  68. snprintf(newfilename, new_length,
  69. "libs/%s/%s", app_abi, libname);
  70. }
  71. return true;
  72. }
  73. if (!strncmp(filename, "/system/lib/", 11)) {
  74. char *ndk, *app;
  75. const char *arch;
  76. size_t ndk_length;
  77. size_t app_length;
  78. ndk = getenv("NDK_ROOT");
  79. app = getenv("APP_PLATFORM");
  80. if (!(ndk && app))
  81. return false;
  82. ndk_length = strlen(ndk);
  83. app_length = strlen(app);
  84. if (!(ndk_length && app_length && app_abi_length))
  85. return false;
  86. arch = !strncmp(app_abi, "arm", 3) ? "arm" :
  87. !strncmp(app_abi, "mips", 4) ? "mips" :
  88. !strncmp(app_abi, "x86", 3) ? "x86" : NULL;
  89. if (!arch)
  90. return false;
  91. new_length = 27 + ndk_length +
  92. app_length + lib_length
  93. + strlen(arch);
  94. if (new_length > PATH_MAX)
  95. return false;
  96. snprintf(newfilename, new_length,
  97. "%s/platforms/%s/arch-%s/usr/lib/%s",
  98. ndk, app, arch, libname);
  99. return true;
  100. }
  101. return false;
  102. }
  103. void map__init(struct map *map, enum map_type type,
  104. u64 start, u64 end, u64 pgoff, struct dso *dso)
  105. {
  106. map->type = type;
  107. map->start = start;
  108. map->end = end;
  109. map->pgoff = pgoff;
  110. map->reloc = 0;
  111. map->dso = dso__get(dso);
  112. map->map_ip = map__map_ip;
  113. map->unmap_ip = map__unmap_ip;
  114. RB_CLEAR_NODE(&map->rb_node);
  115. map->groups = NULL;
  116. map->erange_warned = false;
  117. atomic_set(&map->refcnt, 1);
  118. }
  119. struct map *map__new(struct machine *machine, u64 start, u64 len,
  120. u64 pgoff, u32 pid, u32 d_maj, u32 d_min, u64 ino,
  121. u64 ino_gen, u32 prot, u32 flags, char *filename,
  122. enum map_type type, struct thread *thread)
  123. {
  124. struct map *map = malloc(sizeof(*map));
  125. if (map != NULL) {
  126. char newfilename[PATH_MAX];
  127. struct dso *dso;
  128. int anon, no_dso, vdso, android;
  129. android = is_android_lib(filename);
  130. anon = is_anon_memory(filename);
  131. vdso = is_vdso_map(filename);
  132. no_dso = is_no_dso_memory(filename);
  133. map->maj = d_maj;
  134. map->min = d_min;
  135. map->ino = ino;
  136. map->ino_generation = ino_gen;
  137. map->prot = prot;
  138. map->flags = flags;
  139. if ((anon || no_dso) && type == MAP__FUNCTION) {
  140. snprintf(newfilename, sizeof(newfilename), "/tmp/perf-%d.map", pid);
  141. filename = newfilename;
  142. }
  143. if (android) {
  144. if (replace_android_lib(filename, newfilename))
  145. filename = newfilename;
  146. }
  147. if (vdso) {
  148. pgoff = 0;
  149. dso = machine__findnew_vdso(machine, thread);
  150. } else
  151. dso = machine__findnew_dso(machine, filename);
  152. if (dso == NULL)
  153. goto out_delete;
  154. map__init(map, type, start, start + len, pgoff, dso);
  155. if (anon || no_dso) {
  156. map->map_ip = map->unmap_ip = identity__map_ip;
  157. /*
  158. * Set memory without DSO as loaded. All map__find_*
  159. * functions still return NULL, and we avoid the
  160. * unnecessary map__load warning.
  161. */
  162. if (type != MAP__FUNCTION)
  163. dso__set_loaded(dso, map->type);
  164. }
  165. dso__put(dso);
  166. }
  167. return map;
  168. out_delete:
  169. free(map);
  170. return NULL;
  171. }
  172. /*
  173. * Constructor variant for modules (where we know from /proc/modules where
  174. * they are loaded) and for vmlinux, where only after we load all the
  175. * symbols we'll know where it starts and ends.
  176. */
  177. struct map *map__new2(u64 start, struct dso *dso, enum map_type type)
  178. {
  179. struct map *map = calloc(1, (sizeof(*map) +
  180. (dso->kernel ? sizeof(struct kmap) : 0)));
  181. if (map != NULL) {
  182. /*
  183. * ->end will be filled after we load all the symbols
  184. */
  185. map__init(map, type, start, 0, 0, dso);
  186. }
  187. return map;
  188. }
  189. static void map__exit(struct map *map)
  190. {
  191. BUG_ON(!RB_EMPTY_NODE(&map->rb_node));
  192. dso__zput(map->dso);
  193. }
  194. void map__delete(struct map *map)
  195. {
  196. map__exit(map);
  197. free(map);
  198. }
  199. void map__put(struct map *map)
  200. {
  201. if (map && atomic_dec_and_test(&map->refcnt))
  202. map__delete(map);
  203. }
  204. void map__fixup_start(struct map *map)
  205. {
  206. struct rb_root *symbols = &map->dso->symbols[map->type];
  207. struct rb_node *nd = rb_first(symbols);
  208. if (nd != NULL) {
  209. struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  210. map->start = sym->start;
  211. }
  212. }
  213. void map__fixup_end(struct map *map)
  214. {
  215. struct rb_root *symbols = &map->dso->symbols[map->type];
  216. struct rb_node *nd = rb_last(symbols);
  217. if (nd != NULL) {
  218. struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
  219. map->end = sym->end;
  220. }
  221. }
  222. #define DSO__DELETED "(deleted)"
  223. int map__load(struct map *map, symbol_filter_t filter)
  224. {
  225. const char *name = map->dso->long_name;
  226. int nr;
  227. if (dso__loaded(map->dso, map->type))
  228. return 0;
  229. nr = dso__load(map->dso, map, filter);
  230. if (nr < 0) {
  231. if (map->dso->has_build_id) {
  232. char sbuild_id[BUILD_ID_SIZE * 2 + 1];
  233. build_id__sprintf(map->dso->build_id,
  234. sizeof(map->dso->build_id),
  235. sbuild_id);
  236. pr_warning("%s with build id %s not found",
  237. name, sbuild_id);
  238. } else
  239. pr_warning("Failed to open %s", name);
  240. pr_warning(", continuing without symbols\n");
  241. return -1;
  242. } else if (nr == 0) {
  243. #ifdef HAVE_LIBELF_SUPPORT
  244. const size_t len = strlen(name);
  245. const size_t real_len = len - sizeof(DSO__DELETED);
  246. if (len > sizeof(DSO__DELETED) &&
  247. strcmp(name + real_len + 1, DSO__DELETED) == 0) {
  248. pr_warning("%.*s was updated (is prelink enabled?). "
  249. "Restart the long running apps that use it!\n",
  250. (int)real_len, name);
  251. } else {
  252. pr_warning("no symbols found in %s, maybe install "
  253. "a debug package?\n", name);
  254. }
  255. #endif
  256. return -1;
  257. }
  258. return 0;
  259. }
  260. int __weak arch__compare_symbol_names(const char *namea, const char *nameb)
  261. {
  262. return strcmp(namea, nameb);
  263. }
  264. struct symbol *map__find_symbol(struct map *map, u64 addr,
  265. symbol_filter_t filter)
  266. {
  267. if (map__load(map, filter) < 0)
  268. return NULL;
  269. return dso__find_symbol(map->dso, map->type, addr);
  270. }
  271. struct symbol *map__find_symbol_by_name(struct map *map, const char *name,
  272. symbol_filter_t filter)
  273. {
  274. if (map__load(map, filter) < 0)
  275. return NULL;
  276. if (!dso__sorted_by_name(map->dso, map->type))
  277. dso__sort_by_name(map->dso, map->type);
  278. return dso__find_symbol_by_name(map->dso, map->type, name);
  279. }
  280. struct map *map__clone(struct map *map)
  281. {
  282. return memdup(map, sizeof(*map));
  283. }
  284. int map__overlap(struct map *l, struct map *r)
  285. {
  286. if (l->start > r->start) {
  287. struct map *t = l;
  288. l = r;
  289. r = t;
  290. }
  291. if (l->end > r->start)
  292. return 1;
  293. return 0;
  294. }
  295. size_t map__fprintf(struct map *map, FILE *fp)
  296. {
  297. return fprintf(fp, " %" PRIx64 "-%" PRIx64 " %" PRIx64 " %s\n",
  298. map->start, map->end, map->pgoff, map->dso->name);
  299. }
  300. size_t map__fprintf_dsoname(struct map *map, FILE *fp)
  301. {
  302. const char *dsoname = "[unknown]";
  303. if (map && map->dso && (map->dso->name || map->dso->long_name)) {
  304. if (symbol_conf.show_kernel_path && map->dso->long_name)
  305. dsoname = map->dso->long_name;
  306. else if (map->dso->name)
  307. dsoname = map->dso->name;
  308. }
  309. return fprintf(fp, "%s", dsoname);
  310. }
  311. int map__fprintf_srcline(struct map *map, u64 addr, const char *prefix,
  312. FILE *fp)
  313. {
  314. char *srcline;
  315. int ret = 0;
  316. if (map && map->dso) {
  317. srcline = get_srcline(map->dso,
  318. map__rip_2objdump(map, addr), NULL, true);
  319. if (srcline != SRCLINE_UNKNOWN)
  320. ret = fprintf(fp, "%s%s", prefix, srcline);
  321. free_srcline(srcline);
  322. }
  323. return ret;
  324. }
  325. /**
  326. * map__rip_2objdump - convert symbol start address to objdump address.
  327. * @map: memory map
  328. * @rip: symbol start address
  329. *
  330. * objdump wants/reports absolute IPs for ET_EXEC, and RIPs for ET_DYN.
  331. * map->dso->adjust_symbols==1 for ET_EXEC-like cases except ET_REL which is
  332. * relative to section start.
  333. *
  334. * Return: Address suitable for passing to "objdump --start-address="
  335. */
  336. u64 map__rip_2objdump(struct map *map, u64 rip)
  337. {
  338. if (!map->dso->adjust_symbols)
  339. return rip;
  340. if (map->dso->rel)
  341. return rip - map->pgoff;
  342. return map->unmap_ip(map, rip) - map->reloc;
  343. }
  344. /**
  345. * map__objdump_2mem - convert objdump address to a memory address.
  346. * @map: memory map
  347. * @ip: objdump address
  348. *
  349. * Closely related to map__rip_2objdump(), this function takes an address from
  350. * objdump and converts it to a memory address. Note this assumes that @map
  351. * contains the address. To be sure the result is valid, check it forwards
  352. * e.g. map__rip_2objdump(map->map_ip(map, map__objdump_2mem(map, ip))) == ip
  353. *
  354. * Return: Memory address.
  355. */
  356. u64 map__objdump_2mem(struct map *map, u64 ip)
  357. {
  358. if (!map->dso->adjust_symbols)
  359. return map->unmap_ip(map, ip);
  360. if (map->dso->rel)
  361. return map->unmap_ip(map, ip + map->pgoff);
  362. return ip + map->reloc;
  363. }
  364. static void maps__init(struct maps *maps)
  365. {
  366. maps->entries = RB_ROOT;
  367. pthread_rwlock_init(&maps->lock, NULL);
  368. }
  369. void map_groups__init(struct map_groups *mg, struct machine *machine)
  370. {
  371. int i;
  372. for (i = 0; i < MAP__NR_TYPES; ++i) {
  373. maps__init(&mg->maps[i]);
  374. }
  375. mg->machine = machine;
  376. atomic_set(&mg->refcnt, 1);
  377. }
  378. static void __maps__purge(struct maps *maps)
  379. {
  380. struct rb_root *root = &maps->entries;
  381. struct rb_node *next = rb_first(root);
  382. while (next) {
  383. struct map *pos = rb_entry(next, struct map, rb_node);
  384. next = rb_next(&pos->rb_node);
  385. rb_erase_init(&pos->rb_node, root);
  386. map__put(pos);
  387. }
  388. }
  389. static void maps__exit(struct maps *maps)
  390. {
  391. pthread_rwlock_wrlock(&maps->lock);
  392. __maps__purge(maps);
  393. pthread_rwlock_unlock(&maps->lock);
  394. }
  395. void map_groups__exit(struct map_groups *mg)
  396. {
  397. int i;
  398. for (i = 0; i < MAP__NR_TYPES; ++i)
  399. maps__exit(&mg->maps[i]);
  400. }
  401. bool map_groups__empty(struct map_groups *mg)
  402. {
  403. int i;
  404. for (i = 0; i < MAP__NR_TYPES; ++i) {
  405. if (maps__first(&mg->maps[i]))
  406. return false;
  407. }
  408. return true;
  409. }
  410. struct map_groups *map_groups__new(struct machine *machine)
  411. {
  412. struct map_groups *mg = malloc(sizeof(*mg));
  413. if (mg != NULL)
  414. map_groups__init(mg, machine);
  415. return mg;
  416. }
  417. void map_groups__delete(struct map_groups *mg)
  418. {
  419. map_groups__exit(mg);
  420. free(mg);
  421. }
  422. void map_groups__put(struct map_groups *mg)
  423. {
  424. if (mg && atomic_dec_and_test(&mg->refcnt))
  425. map_groups__delete(mg);
  426. }
  427. struct symbol *map_groups__find_symbol(struct map_groups *mg,
  428. enum map_type type, u64 addr,
  429. struct map **mapp,
  430. symbol_filter_t filter)
  431. {
  432. struct map *map = map_groups__find(mg, type, addr);
  433. /* Ensure map is loaded before using map->map_ip */
  434. if (map != NULL && map__load(map, filter) >= 0) {
  435. if (mapp != NULL)
  436. *mapp = map;
  437. return map__find_symbol(map, map->map_ip(map, addr), filter);
  438. }
  439. return NULL;
  440. }
  441. struct symbol *map_groups__find_symbol_by_name(struct map_groups *mg,
  442. enum map_type type,
  443. const char *name,
  444. struct map **mapp,
  445. symbol_filter_t filter)
  446. {
  447. struct maps *maps = &mg->maps[type];
  448. struct symbol *sym;
  449. struct rb_node *nd;
  450. pthread_rwlock_rdlock(&maps->lock);
  451. for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
  452. struct map *pos = rb_entry(nd, struct map, rb_node);
  453. sym = map__find_symbol_by_name(pos, name, filter);
  454. if (sym == NULL)
  455. continue;
  456. if (mapp != NULL)
  457. *mapp = pos;
  458. goto out;
  459. }
  460. sym = NULL;
  461. out:
  462. pthread_rwlock_unlock(&maps->lock);
  463. return sym;
  464. }
  465. int map_groups__find_ams(struct addr_map_symbol *ams, symbol_filter_t filter)
  466. {
  467. if (ams->addr < ams->map->start || ams->addr >= ams->map->end) {
  468. if (ams->map->groups == NULL)
  469. return -1;
  470. ams->map = map_groups__find(ams->map->groups, ams->map->type,
  471. ams->addr);
  472. if (ams->map == NULL)
  473. return -1;
  474. }
  475. ams->al_addr = ams->map->map_ip(ams->map, ams->addr);
  476. ams->sym = map__find_symbol(ams->map, ams->al_addr, filter);
  477. return ams->sym ? 0 : -1;
  478. }
  479. static size_t maps__fprintf(struct maps *maps, FILE *fp)
  480. {
  481. size_t printed = 0;
  482. struct rb_node *nd;
  483. pthread_rwlock_rdlock(&maps->lock);
  484. for (nd = rb_first(&maps->entries); nd; nd = rb_next(nd)) {
  485. struct map *pos = rb_entry(nd, struct map, rb_node);
  486. printed += fprintf(fp, "Map:");
  487. printed += map__fprintf(pos, fp);
  488. if (verbose > 2) {
  489. printed += dso__fprintf(pos->dso, pos->type, fp);
  490. printed += fprintf(fp, "--\n");
  491. }
  492. }
  493. pthread_rwlock_unlock(&maps->lock);
  494. return printed;
  495. }
  496. size_t __map_groups__fprintf_maps(struct map_groups *mg, enum map_type type,
  497. FILE *fp)
  498. {
  499. size_t printed = fprintf(fp, "%s:\n", map_type__name[type]);
  500. return printed += maps__fprintf(&mg->maps[type], fp);
  501. }
  502. size_t map_groups__fprintf(struct map_groups *mg, FILE *fp)
  503. {
  504. size_t printed = 0, i;
  505. for (i = 0; i < MAP__NR_TYPES; ++i)
  506. printed += __map_groups__fprintf_maps(mg, i, fp);
  507. return printed;
  508. }
  509. static int maps__fixup_overlappings(struct maps *maps, struct map *map, FILE *fp)
  510. {
  511. struct rb_root *root;
  512. struct rb_node *next;
  513. int err = 0;
  514. pthread_rwlock_wrlock(&maps->lock);
  515. root = &maps->entries;
  516. next = rb_first(root);
  517. while (next) {
  518. struct map *pos = rb_entry(next, struct map, rb_node);
  519. next = rb_next(&pos->rb_node);
  520. if (!map__overlap(pos, map))
  521. continue;
  522. if (verbose >= 2) {
  523. fputs("overlapping maps:\n", fp);
  524. map__fprintf(map, fp);
  525. map__fprintf(pos, fp);
  526. }
  527. rb_erase_init(&pos->rb_node, root);
  528. /*
  529. * Now check if we need to create new maps for areas not
  530. * overlapped by the new map:
  531. */
  532. if (map->start > pos->start) {
  533. struct map *before = map__clone(pos);
  534. if (before == NULL) {
  535. err = -ENOMEM;
  536. goto put_map;
  537. }
  538. before->end = map->start;
  539. __maps__insert(maps, before);
  540. if (verbose >= 2)
  541. map__fprintf(before, fp);
  542. }
  543. if (map->end < pos->end) {
  544. struct map *after = map__clone(pos);
  545. if (after == NULL) {
  546. err = -ENOMEM;
  547. goto put_map;
  548. }
  549. after->start = map->end;
  550. __maps__insert(maps, after);
  551. if (verbose >= 2)
  552. map__fprintf(after, fp);
  553. }
  554. put_map:
  555. map__put(pos);
  556. if (err)
  557. goto out;
  558. }
  559. err = 0;
  560. out:
  561. pthread_rwlock_unlock(&maps->lock);
  562. return err;
  563. }
  564. int map_groups__fixup_overlappings(struct map_groups *mg, struct map *map,
  565. FILE *fp)
  566. {
  567. return maps__fixup_overlappings(&mg->maps[map->type], map, fp);
  568. }
  569. /*
  570. * XXX This should not really _copy_ te maps, but refcount them.
  571. */
  572. int map_groups__clone(struct map_groups *mg,
  573. struct map_groups *parent, enum map_type type)
  574. {
  575. int err = -ENOMEM;
  576. struct map *map;
  577. struct maps *maps = &parent->maps[type];
  578. pthread_rwlock_rdlock(&maps->lock);
  579. for (map = maps__first(maps); map; map = map__next(map)) {
  580. struct map *new = map__clone(map);
  581. if (new == NULL)
  582. goto out_unlock;
  583. map_groups__insert(mg, new);
  584. }
  585. err = 0;
  586. out_unlock:
  587. pthread_rwlock_unlock(&maps->lock);
  588. return err;
  589. }
  590. static void __maps__insert(struct maps *maps, struct map *map)
  591. {
  592. struct rb_node **p = &maps->entries.rb_node;
  593. struct rb_node *parent = NULL;
  594. const u64 ip = map->start;
  595. struct map *m;
  596. while (*p != NULL) {
  597. parent = *p;
  598. m = rb_entry(parent, struct map, rb_node);
  599. if (ip < m->start)
  600. p = &(*p)->rb_left;
  601. else
  602. p = &(*p)->rb_right;
  603. }
  604. rb_link_node(&map->rb_node, parent, p);
  605. rb_insert_color(&map->rb_node, &maps->entries);
  606. map__get(map);
  607. }
  608. void maps__insert(struct maps *maps, struct map *map)
  609. {
  610. pthread_rwlock_wrlock(&maps->lock);
  611. __maps__insert(maps, map);
  612. pthread_rwlock_unlock(&maps->lock);
  613. }
  614. static void __maps__remove(struct maps *maps, struct map *map)
  615. {
  616. rb_erase_init(&map->rb_node, &maps->entries);
  617. map__put(map);
  618. }
  619. void maps__remove(struct maps *maps, struct map *map)
  620. {
  621. pthread_rwlock_wrlock(&maps->lock);
  622. __maps__remove(maps, map);
  623. pthread_rwlock_unlock(&maps->lock);
  624. }
  625. struct map *maps__find(struct maps *maps, u64 ip)
  626. {
  627. struct rb_node **p, *parent = NULL;
  628. struct map *m;
  629. pthread_rwlock_rdlock(&maps->lock);
  630. p = &maps->entries.rb_node;
  631. while (*p != NULL) {
  632. parent = *p;
  633. m = rb_entry(parent, struct map, rb_node);
  634. if (ip < m->start)
  635. p = &(*p)->rb_left;
  636. else if (ip >= m->end)
  637. p = &(*p)->rb_right;
  638. else
  639. goto out;
  640. }
  641. m = NULL;
  642. out:
  643. pthread_rwlock_unlock(&maps->lock);
  644. return m;
  645. }
  646. struct map *maps__first(struct maps *maps)
  647. {
  648. struct rb_node *first = rb_first(&maps->entries);
  649. if (first)
  650. return rb_entry(first, struct map, rb_node);
  651. return NULL;
  652. }
  653. struct map *map__next(struct map *map)
  654. {
  655. struct rb_node *next = rb_next(&map->rb_node);
  656. if (next)
  657. return rb_entry(next, struct map, rb_node);
  658. return NULL;
  659. }
  660. struct kmap *map__kmap(struct map *map)
  661. {
  662. if (!map->dso || !map->dso->kernel) {
  663. pr_err("Internal error: map__kmap with a non-kernel map\n");
  664. return NULL;
  665. }
  666. return (struct kmap *)(map + 1);
  667. }
  668. struct map_groups *map__kmaps(struct map *map)
  669. {
  670. struct kmap *kmap = map__kmap(map);
  671. if (!kmap || !kmap->kmaps) {
  672. pr_err("Internal error: map__kmaps with a non-kernel map\n");
  673. return NULL;
  674. }
  675. return kmap->kmaps;
  676. }