annotate.c 44 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934
  1. /*
  2. * Copyright (C) 2011, Red Hat Inc, Arnaldo Carvalho de Melo <acme@redhat.com>
  3. *
  4. * Parts came from builtin-annotate.c, see those files for further
  5. * copyright notes.
  6. *
  7. * Released under the GPL v2. (and only v2, not any later version)
  8. */
  9. #include "util.h"
  10. #include "ui/ui.h"
  11. #include "sort.h"
  12. #include "build-id.h"
  13. #include "color.h"
  14. #include "cache.h"
  15. #include "symbol.h"
  16. #include "debug.h"
  17. #include "annotate.h"
  18. #include "evsel.h"
  19. #include "block-range.h"
  20. #include "arch/common.h"
  21. #include <regex.h>
  22. #include <pthread.h>
  23. #include <linux/bitops.h>
  24. #include <sys/utsname.h>
  25. const char *disassembler_style;
  26. const char *objdump_path;
  27. static regex_t file_lineno;
  28. static struct ins_ops *ins__find(struct arch *arch, const char *name);
  29. static void ins__sort(struct arch *arch);
  30. static int disasm_line__parse(char *line, const char **namep, char **rawp);
  31. struct arch {
  32. const char *name;
  33. struct ins *instructions;
  34. size_t nr_instructions;
  35. size_t nr_instructions_allocated;
  36. struct ins_ops *(*associate_instruction_ops)(struct arch *arch, const char *name);
  37. bool sorted_instructions;
  38. bool initialized;
  39. void *priv;
  40. int (*init)(struct arch *arch);
  41. struct {
  42. char comment_char;
  43. char skip_functions_char;
  44. } objdump;
  45. };
  46. static struct ins_ops call_ops;
  47. static struct ins_ops dec_ops;
  48. static struct ins_ops jump_ops;
  49. static struct ins_ops mov_ops;
  50. static struct ins_ops nop_ops;
  51. static struct ins_ops lock_ops;
  52. static struct ins_ops ret_ops;
  53. static int arch__grow_instructions(struct arch *arch)
  54. {
  55. struct ins *new_instructions;
  56. size_t new_nr_allocated;
  57. if (arch->nr_instructions_allocated == 0 && arch->instructions)
  58. goto grow_from_non_allocated_table;
  59. new_nr_allocated = arch->nr_instructions_allocated + 128;
  60. new_instructions = realloc(arch->instructions, new_nr_allocated * sizeof(struct ins));
  61. if (new_instructions == NULL)
  62. return -1;
  63. out_update_instructions:
  64. arch->instructions = new_instructions;
  65. arch->nr_instructions_allocated = new_nr_allocated;
  66. return 0;
  67. grow_from_non_allocated_table:
  68. new_nr_allocated = arch->nr_instructions + 128;
  69. new_instructions = calloc(new_nr_allocated, sizeof(struct ins));
  70. if (new_instructions == NULL)
  71. return -1;
  72. memcpy(new_instructions, arch->instructions, arch->nr_instructions);
  73. goto out_update_instructions;
  74. }
  75. static int arch__associate_ins_ops(struct arch* arch, const char *name, struct ins_ops *ops)
  76. {
  77. struct ins *ins;
  78. if (arch->nr_instructions == arch->nr_instructions_allocated &&
  79. arch__grow_instructions(arch))
  80. return -1;
  81. ins = &arch->instructions[arch->nr_instructions];
  82. ins->name = strdup(name);
  83. if (!ins->name)
  84. return -1;
  85. ins->ops = ops;
  86. arch->nr_instructions++;
  87. ins__sort(arch);
  88. return 0;
  89. }
  90. #include "arch/arm/annotate/instructions.c"
  91. #include "arch/arm64/annotate/instructions.c"
  92. #include "arch/x86/annotate/instructions.c"
  93. #include "arch/powerpc/annotate/instructions.c"
  94. static struct arch architectures[] = {
  95. {
  96. .name = "arm",
  97. .init = arm__annotate_init,
  98. },
  99. {
  100. .name = "arm64",
  101. .init = arm64__annotate_init,
  102. },
  103. {
  104. .name = "x86",
  105. .instructions = x86__instructions,
  106. .nr_instructions = ARRAY_SIZE(x86__instructions),
  107. .objdump = {
  108. .comment_char = '#',
  109. },
  110. },
  111. {
  112. .name = "powerpc",
  113. .init = powerpc__annotate_init,
  114. },
  115. {
  116. .name = "s390",
  117. .objdump = {
  118. .comment_char = '#',
  119. },
  120. },
  121. };
  122. static void ins__delete(struct ins_operands *ops)
  123. {
  124. if (ops == NULL)
  125. return;
  126. zfree(&ops->source.raw);
  127. zfree(&ops->source.name);
  128. zfree(&ops->target.raw);
  129. zfree(&ops->target.name);
  130. }
  131. static int ins__raw_scnprintf(struct ins *ins, char *bf, size_t size,
  132. struct ins_operands *ops)
  133. {
  134. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->raw);
  135. }
  136. int ins__scnprintf(struct ins *ins, char *bf, size_t size,
  137. struct ins_operands *ops)
  138. {
  139. if (ins->ops->scnprintf)
  140. return ins->ops->scnprintf(ins, bf, size, ops);
  141. return ins__raw_scnprintf(ins, bf, size, ops);
  142. }
  143. static int call__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  144. {
  145. char *endptr, *tok, *name;
  146. ops->target.addr = strtoull(ops->raw, &endptr, 16);
  147. name = strchr(endptr, '<');
  148. if (name == NULL)
  149. goto indirect_call;
  150. name++;
  151. if (arch->objdump.skip_functions_char &&
  152. strchr(name, arch->objdump.skip_functions_char))
  153. return -1;
  154. tok = strchr(name, '>');
  155. if (tok == NULL)
  156. return -1;
  157. *tok = '\0';
  158. ops->target.name = strdup(name);
  159. *tok = '>';
  160. return ops->target.name == NULL ? -1 : 0;
  161. indirect_call:
  162. tok = strchr(endptr, '*');
  163. if (tok == NULL) {
  164. struct symbol *sym = map__find_symbol(map, map->map_ip(map, ops->target.addr));
  165. if (sym != NULL)
  166. ops->target.name = strdup(sym->name);
  167. else
  168. ops->target.addr = 0;
  169. return 0;
  170. }
  171. ops->target.addr = strtoull(tok + 1, NULL, 16);
  172. return 0;
  173. }
  174. static int call__scnprintf(struct ins *ins, char *bf, size_t size,
  175. struct ins_operands *ops)
  176. {
  177. if (ops->target.name)
  178. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->target.name);
  179. if (ops->target.addr == 0)
  180. return ins__raw_scnprintf(ins, bf, size, ops);
  181. return scnprintf(bf, size, "%-6.6s *%" PRIx64, ins->name, ops->target.addr);
  182. }
  183. static struct ins_ops call_ops = {
  184. .parse = call__parse,
  185. .scnprintf = call__scnprintf,
  186. };
  187. bool ins__is_call(const struct ins *ins)
  188. {
  189. return ins->ops == &call_ops;
  190. }
  191. static int jump__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  192. {
  193. const char *s = strchr(ops->raw, '+');
  194. const char *c = strchr(ops->raw, ',');
  195. if (c++ != NULL)
  196. ops->target.addr = strtoull(c, NULL, 16);
  197. else
  198. ops->target.addr = strtoull(ops->raw, NULL, 16);
  199. if (s++ != NULL) {
  200. ops->target.offset = strtoull(s, NULL, 16);
  201. ops->target.offset_avail = true;
  202. } else {
  203. ops->target.offset_avail = false;
  204. }
  205. return 0;
  206. }
  207. static int jump__scnprintf(struct ins *ins, char *bf, size_t size,
  208. struct ins_operands *ops)
  209. {
  210. if (!ops->target.addr || ops->target.offset < 0)
  211. return ins__raw_scnprintf(ins, bf, size, ops);
  212. return scnprintf(bf, size, "%-6.6s %" PRIx64, ins->name, ops->target.offset);
  213. }
  214. static struct ins_ops jump_ops = {
  215. .parse = jump__parse,
  216. .scnprintf = jump__scnprintf,
  217. };
  218. bool ins__is_jump(const struct ins *ins)
  219. {
  220. return ins->ops == &jump_ops;
  221. }
  222. static int comment__symbol(char *raw, char *comment, u64 *addrp, char **namep)
  223. {
  224. char *endptr, *name, *t;
  225. if (strstr(raw, "(%rip)") == NULL)
  226. return 0;
  227. *addrp = strtoull(comment, &endptr, 16);
  228. name = strchr(endptr, '<');
  229. if (name == NULL)
  230. return -1;
  231. name++;
  232. t = strchr(name, '>');
  233. if (t == NULL)
  234. return 0;
  235. *t = '\0';
  236. *namep = strdup(name);
  237. *t = '>';
  238. return 0;
  239. }
  240. static int lock__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  241. {
  242. ops->locked.ops = zalloc(sizeof(*ops->locked.ops));
  243. if (ops->locked.ops == NULL)
  244. return 0;
  245. if (disasm_line__parse(ops->raw, &ops->locked.ins.name, &ops->locked.ops->raw) < 0)
  246. goto out_free_ops;
  247. ops->locked.ins.ops = ins__find(arch, ops->locked.ins.name);
  248. if (ops->locked.ins.ops == NULL)
  249. goto out_free_ops;
  250. if (ops->locked.ins.ops->parse &&
  251. ops->locked.ins.ops->parse(arch, ops->locked.ops, map) < 0)
  252. goto out_free_ops;
  253. return 0;
  254. out_free_ops:
  255. zfree(&ops->locked.ops);
  256. return 0;
  257. }
  258. static int lock__scnprintf(struct ins *ins, char *bf, size_t size,
  259. struct ins_operands *ops)
  260. {
  261. int printed;
  262. if (ops->locked.ins.ops == NULL)
  263. return ins__raw_scnprintf(ins, bf, size, ops);
  264. printed = scnprintf(bf, size, "%-6.6s ", ins->name);
  265. return printed + ins__scnprintf(&ops->locked.ins, bf + printed,
  266. size - printed, ops->locked.ops);
  267. }
  268. static void lock__delete(struct ins_operands *ops)
  269. {
  270. struct ins *ins = &ops->locked.ins;
  271. if (ins->ops && ins->ops->free)
  272. ins->ops->free(ops->locked.ops);
  273. else
  274. ins__delete(ops->locked.ops);
  275. zfree(&ops->locked.ops);
  276. zfree(&ops->target.raw);
  277. zfree(&ops->target.name);
  278. }
  279. static struct ins_ops lock_ops = {
  280. .free = lock__delete,
  281. .parse = lock__parse,
  282. .scnprintf = lock__scnprintf,
  283. };
  284. static int mov__parse(struct arch *arch, struct ins_operands *ops, struct map *map __maybe_unused)
  285. {
  286. char *s = strchr(ops->raw, ','), *target, *comment, prev;
  287. if (s == NULL)
  288. return -1;
  289. *s = '\0';
  290. ops->source.raw = strdup(ops->raw);
  291. *s = ',';
  292. if (ops->source.raw == NULL)
  293. return -1;
  294. target = ++s;
  295. comment = strchr(s, arch->objdump.comment_char);
  296. if (comment != NULL)
  297. s = comment - 1;
  298. else
  299. s = strchr(s, '\0') - 1;
  300. while (s > target && isspace(s[0]))
  301. --s;
  302. s++;
  303. prev = *s;
  304. *s = '\0';
  305. ops->target.raw = strdup(target);
  306. *s = prev;
  307. if (ops->target.raw == NULL)
  308. goto out_free_source;
  309. if (comment == NULL)
  310. return 0;
  311. while (comment[0] != '\0' && isspace(comment[0]))
  312. ++comment;
  313. comment__symbol(ops->source.raw, comment, &ops->source.addr, &ops->source.name);
  314. comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
  315. return 0;
  316. out_free_source:
  317. zfree(&ops->source.raw);
  318. return -1;
  319. }
  320. static int mov__scnprintf(struct ins *ins, char *bf, size_t size,
  321. struct ins_operands *ops)
  322. {
  323. return scnprintf(bf, size, "%-6.6s %s,%s", ins->name,
  324. ops->source.name ?: ops->source.raw,
  325. ops->target.name ?: ops->target.raw);
  326. }
  327. static struct ins_ops mov_ops = {
  328. .parse = mov__parse,
  329. .scnprintf = mov__scnprintf,
  330. };
  331. static int dec__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  332. {
  333. char *target, *comment, *s, prev;
  334. target = s = ops->raw;
  335. while (s[0] != '\0' && !isspace(s[0]))
  336. ++s;
  337. prev = *s;
  338. *s = '\0';
  339. ops->target.raw = strdup(target);
  340. *s = prev;
  341. if (ops->target.raw == NULL)
  342. return -1;
  343. comment = strchr(s, arch->objdump.comment_char);
  344. if (comment == NULL)
  345. return 0;
  346. while (comment[0] != '\0' && isspace(comment[0]))
  347. ++comment;
  348. comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
  349. return 0;
  350. }
  351. static int dec__scnprintf(struct ins *ins, char *bf, size_t size,
  352. struct ins_operands *ops)
  353. {
  354. return scnprintf(bf, size, "%-6.6s %s", ins->name,
  355. ops->target.name ?: ops->target.raw);
  356. }
  357. static struct ins_ops dec_ops = {
  358. .parse = dec__parse,
  359. .scnprintf = dec__scnprintf,
  360. };
  361. static int nop__scnprintf(struct ins *ins __maybe_unused, char *bf, size_t size,
  362. struct ins_operands *ops __maybe_unused)
  363. {
  364. return scnprintf(bf, size, "%-6.6s", "nop");
  365. }
  366. static struct ins_ops nop_ops = {
  367. .scnprintf = nop__scnprintf,
  368. };
  369. static struct ins_ops ret_ops = {
  370. .scnprintf = ins__raw_scnprintf,
  371. };
  372. bool ins__is_ret(const struct ins *ins)
  373. {
  374. return ins->ops == &ret_ops;
  375. }
  376. static int ins__key_cmp(const void *name, const void *insp)
  377. {
  378. const struct ins *ins = insp;
  379. return strcmp(name, ins->name);
  380. }
  381. static int ins__cmp(const void *a, const void *b)
  382. {
  383. const struct ins *ia = a;
  384. const struct ins *ib = b;
  385. return strcmp(ia->name, ib->name);
  386. }
  387. static void ins__sort(struct arch *arch)
  388. {
  389. const int nmemb = arch->nr_instructions;
  390. qsort(arch->instructions, nmemb, sizeof(struct ins), ins__cmp);
  391. }
  392. static struct ins_ops *__ins__find(struct arch *arch, const char *name)
  393. {
  394. struct ins *ins;
  395. const int nmemb = arch->nr_instructions;
  396. if (!arch->sorted_instructions) {
  397. ins__sort(arch);
  398. arch->sorted_instructions = true;
  399. }
  400. ins = bsearch(name, arch->instructions, nmemb, sizeof(struct ins), ins__key_cmp);
  401. return ins ? ins->ops : NULL;
  402. }
  403. static struct ins_ops *ins__find(struct arch *arch, const char *name)
  404. {
  405. struct ins_ops *ops = __ins__find(arch, name);
  406. if (!ops && arch->associate_instruction_ops)
  407. ops = arch->associate_instruction_ops(arch, name);
  408. return ops;
  409. }
  410. static int arch__key_cmp(const void *name, const void *archp)
  411. {
  412. const struct arch *arch = archp;
  413. return strcmp(name, arch->name);
  414. }
  415. static int arch__cmp(const void *a, const void *b)
  416. {
  417. const struct arch *aa = a;
  418. const struct arch *ab = b;
  419. return strcmp(aa->name, ab->name);
  420. }
  421. static void arch__sort(void)
  422. {
  423. const int nmemb = ARRAY_SIZE(architectures);
  424. qsort(architectures, nmemb, sizeof(struct arch), arch__cmp);
  425. }
  426. static struct arch *arch__find(const char *name)
  427. {
  428. const int nmemb = ARRAY_SIZE(architectures);
  429. static bool sorted;
  430. if (!sorted) {
  431. arch__sort();
  432. sorted = true;
  433. }
  434. return bsearch(name, architectures, nmemb, sizeof(struct arch), arch__key_cmp);
  435. }
  436. int symbol__alloc_hist(struct symbol *sym)
  437. {
  438. struct annotation *notes = symbol__annotation(sym);
  439. const size_t size = symbol__size(sym);
  440. size_t sizeof_sym_hist;
  441. /* Check for overflow when calculating sizeof_sym_hist */
  442. if (size > (SIZE_MAX - sizeof(struct sym_hist)) / sizeof(u64))
  443. return -1;
  444. sizeof_sym_hist = (sizeof(struct sym_hist) + size * sizeof(u64));
  445. /* Check for overflow in zalloc argument */
  446. if (sizeof_sym_hist > (SIZE_MAX - sizeof(*notes->src))
  447. / symbol_conf.nr_events)
  448. return -1;
  449. notes->src = zalloc(sizeof(*notes->src) + symbol_conf.nr_events * sizeof_sym_hist);
  450. if (notes->src == NULL)
  451. return -1;
  452. notes->src->sizeof_sym_hist = sizeof_sym_hist;
  453. notes->src->nr_histograms = symbol_conf.nr_events;
  454. INIT_LIST_HEAD(&notes->src->source);
  455. return 0;
  456. }
  457. /* The cycles histogram is lazily allocated. */
  458. static int symbol__alloc_hist_cycles(struct symbol *sym)
  459. {
  460. struct annotation *notes = symbol__annotation(sym);
  461. const size_t size = symbol__size(sym);
  462. notes->src->cycles_hist = calloc(size, sizeof(struct cyc_hist));
  463. if (notes->src->cycles_hist == NULL)
  464. return -1;
  465. return 0;
  466. }
  467. void symbol__annotate_zero_histograms(struct symbol *sym)
  468. {
  469. struct annotation *notes = symbol__annotation(sym);
  470. pthread_mutex_lock(&notes->lock);
  471. if (notes->src != NULL) {
  472. memset(notes->src->histograms, 0,
  473. notes->src->nr_histograms * notes->src->sizeof_sym_hist);
  474. if (notes->src->cycles_hist)
  475. memset(notes->src->cycles_hist, 0,
  476. symbol__size(sym) * sizeof(struct cyc_hist));
  477. }
  478. pthread_mutex_unlock(&notes->lock);
  479. }
  480. static int __symbol__account_cycles(struct annotation *notes,
  481. u64 start,
  482. unsigned offset, unsigned cycles,
  483. unsigned have_start)
  484. {
  485. struct cyc_hist *ch;
  486. ch = notes->src->cycles_hist;
  487. /*
  488. * For now we can only account one basic block per
  489. * final jump. But multiple could be overlapping.
  490. * Always account the longest one. So when
  491. * a shorter one has been already seen throw it away.
  492. *
  493. * We separately always account the full cycles.
  494. */
  495. ch[offset].num_aggr++;
  496. ch[offset].cycles_aggr += cycles;
  497. if (!have_start && ch[offset].have_start)
  498. return 0;
  499. if (ch[offset].num) {
  500. if (have_start && (!ch[offset].have_start ||
  501. ch[offset].start > start)) {
  502. ch[offset].have_start = 0;
  503. ch[offset].cycles = 0;
  504. ch[offset].num = 0;
  505. if (ch[offset].reset < 0xffff)
  506. ch[offset].reset++;
  507. } else if (have_start &&
  508. ch[offset].start < start)
  509. return 0;
  510. }
  511. ch[offset].have_start = have_start;
  512. ch[offset].start = start;
  513. ch[offset].cycles += cycles;
  514. ch[offset].num++;
  515. return 0;
  516. }
  517. static int __symbol__inc_addr_samples(struct symbol *sym, struct map *map,
  518. struct annotation *notes, int evidx, u64 addr)
  519. {
  520. unsigned offset;
  521. struct sym_hist *h;
  522. pr_debug3("%s: addr=%#" PRIx64 "\n", __func__, map->unmap_ip(map, addr));
  523. if ((addr < sym->start || addr >= sym->end) &&
  524. (addr != sym->end || sym->start != sym->end)) {
  525. pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
  526. __func__, __LINE__, sym->name, sym->start, addr, sym->end);
  527. return -ERANGE;
  528. }
  529. offset = addr - sym->start;
  530. h = annotation__histogram(notes, evidx);
  531. h->sum++;
  532. h->addr[offset]++;
  533. pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
  534. ", evidx=%d] => %" PRIu64 "\n", sym->start, sym->name,
  535. addr, addr - sym->start, evidx, h->addr[offset]);
  536. return 0;
  537. }
  538. static struct annotation *symbol__get_annotation(struct symbol *sym, bool cycles)
  539. {
  540. struct annotation *notes = symbol__annotation(sym);
  541. if (notes->src == NULL) {
  542. if (symbol__alloc_hist(sym) < 0)
  543. return NULL;
  544. }
  545. if (!notes->src->cycles_hist && cycles) {
  546. if (symbol__alloc_hist_cycles(sym) < 0)
  547. return NULL;
  548. }
  549. return notes;
  550. }
  551. static int symbol__inc_addr_samples(struct symbol *sym, struct map *map,
  552. int evidx, u64 addr)
  553. {
  554. struct annotation *notes;
  555. if (sym == NULL)
  556. return 0;
  557. notes = symbol__get_annotation(sym, false);
  558. if (notes == NULL)
  559. return -ENOMEM;
  560. return __symbol__inc_addr_samples(sym, map, notes, evidx, addr);
  561. }
  562. static int symbol__account_cycles(u64 addr, u64 start,
  563. struct symbol *sym, unsigned cycles)
  564. {
  565. struct annotation *notes;
  566. unsigned offset;
  567. if (sym == NULL)
  568. return 0;
  569. notes = symbol__get_annotation(sym, true);
  570. if (notes == NULL)
  571. return -ENOMEM;
  572. if (addr < sym->start || addr >= sym->end)
  573. return -ERANGE;
  574. if (start) {
  575. if (start < sym->start || start >= sym->end)
  576. return -ERANGE;
  577. if (start >= addr)
  578. start = 0;
  579. }
  580. offset = addr - sym->start;
  581. return __symbol__account_cycles(notes,
  582. start ? start - sym->start : 0,
  583. offset, cycles,
  584. !!start);
  585. }
  586. int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
  587. struct addr_map_symbol *start,
  588. unsigned cycles)
  589. {
  590. u64 saddr = 0;
  591. int err;
  592. if (!cycles)
  593. return 0;
  594. /*
  595. * Only set start when IPC can be computed. We can only
  596. * compute it when the basic block is completely in a single
  597. * function.
  598. * Special case the case when the jump is elsewhere, but
  599. * it starts on the function start.
  600. */
  601. if (start &&
  602. (start->sym == ams->sym ||
  603. (ams->sym &&
  604. start->addr == ams->sym->start + ams->map->start)))
  605. saddr = start->al_addr;
  606. if (saddr == 0)
  607. pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
  608. ams->addr,
  609. start ? start->addr : 0,
  610. ams->sym ? ams->sym->start + ams->map->start : 0,
  611. saddr);
  612. err = symbol__account_cycles(ams->al_addr, saddr, ams->sym, cycles);
  613. if (err)
  614. pr_debug2("account_cycles failed %d\n", err);
  615. return err;
  616. }
  617. int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, int evidx)
  618. {
  619. return symbol__inc_addr_samples(ams->sym, ams->map, evidx, ams->al_addr);
  620. }
  621. int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
  622. {
  623. return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
  624. }
  625. static void disasm_line__init_ins(struct disasm_line *dl, struct arch *arch, struct map *map)
  626. {
  627. dl->ins.ops = ins__find(arch, dl->ins.name);
  628. if (!dl->ins.ops)
  629. return;
  630. if (dl->ins.ops->parse && dl->ins.ops->parse(arch, &dl->ops, map) < 0)
  631. dl->ins.ops = NULL;
  632. }
  633. static int disasm_line__parse(char *line, const char **namep, char **rawp)
  634. {
  635. char *name = line, tmp;
  636. while (isspace(name[0]))
  637. ++name;
  638. if (name[0] == '\0')
  639. return -1;
  640. *rawp = name + 1;
  641. while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
  642. ++*rawp;
  643. tmp = (*rawp)[0];
  644. (*rawp)[0] = '\0';
  645. *namep = strdup(name);
  646. if (*namep == NULL)
  647. goto out_free_name;
  648. (*rawp)[0] = tmp;
  649. if ((*rawp)[0] != '\0') {
  650. (*rawp)++;
  651. while (isspace((*rawp)[0]))
  652. ++(*rawp);
  653. }
  654. return 0;
  655. out_free_name:
  656. free((void *)namep);
  657. *namep = NULL;
  658. return -1;
  659. }
  660. static struct disasm_line *disasm_line__new(s64 offset, char *line,
  661. size_t privsize, int line_nr,
  662. struct arch *arch,
  663. struct map *map)
  664. {
  665. struct disasm_line *dl = zalloc(sizeof(*dl) + privsize);
  666. if (dl != NULL) {
  667. dl->offset = offset;
  668. dl->line = strdup(line);
  669. dl->line_nr = line_nr;
  670. if (dl->line == NULL)
  671. goto out_delete;
  672. if (offset != -1) {
  673. if (disasm_line__parse(dl->line, &dl->ins.name, &dl->ops.raw) < 0)
  674. goto out_free_line;
  675. disasm_line__init_ins(dl, arch, map);
  676. }
  677. }
  678. return dl;
  679. out_free_line:
  680. zfree(&dl->line);
  681. out_delete:
  682. free(dl);
  683. return NULL;
  684. }
  685. void disasm_line__free(struct disasm_line *dl)
  686. {
  687. zfree(&dl->line);
  688. if (dl->ins.ops && dl->ins.ops->free)
  689. dl->ins.ops->free(&dl->ops);
  690. else
  691. ins__delete(&dl->ops);
  692. free((void *)dl->ins.name);
  693. dl->ins.name = NULL;
  694. free(dl);
  695. }
  696. int disasm_line__scnprintf(struct disasm_line *dl, char *bf, size_t size, bool raw)
  697. {
  698. if (raw || !dl->ins.ops)
  699. return scnprintf(bf, size, "%-6.6s %s", dl->ins.name, dl->ops.raw);
  700. return ins__scnprintf(&dl->ins, bf, size, &dl->ops);
  701. }
  702. static void disasm__add(struct list_head *head, struct disasm_line *line)
  703. {
  704. list_add_tail(&line->node, head);
  705. }
  706. struct disasm_line *disasm__get_next_ip_line(struct list_head *head, struct disasm_line *pos)
  707. {
  708. list_for_each_entry_continue(pos, head, node)
  709. if (pos->offset >= 0)
  710. return pos;
  711. return NULL;
  712. }
  713. double disasm__calc_percent(struct annotation *notes, int evidx, s64 offset,
  714. s64 end, const char **path, u64 *nr_samples)
  715. {
  716. struct source_line *src_line = notes->src->lines;
  717. double percent = 0.0;
  718. *nr_samples = 0;
  719. if (src_line) {
  720. size_t sizeof_src_line = sizeof(*src_line) +
  721. sizeof(src_line->samples) * (src_line->nr_pcnt - 1);
  722. while (offset < end) {
  723. src_line = (void *)notes->src->lines +
  724. (sizeof_src_line * offset);
  725. if (*path == NULL)
  726. *path = src_line->path;
  727. percent += src_line->samples[evidx].percent;
  728. *nr_samples += src_line->samples[evidx].nr;
  729. offset++;
  730. }
  731. } else {
  732. struct sym_hist *h = annotation__histogram(notes, evidx);
  733. unsigned int hits = 0;
  734. while (offset < end)
  735. hits += h->addr[offset++];
  736. if (h->sum) {
  737. *nr_samples = hits;
  738. percent = 100.0 * hits / h->sum;
  739. }
  740. }
  741. return percent;
  742. }
  743. static const char *annotate__address_color(struct block_range *br)
  744. {
  745. double cov = block_range__coverage(br);
  746. if (cov >= 0) {
  747. /* mark red for >75% coverage */
  748. if (cov > 0.75)
  749. return PERF_COLOR_RED;
  750. /* mark dull for <1% coverage */
  751. if (cov < 0.01)
  752. return PERF_COLOR_NORMAL;
  753. }
  754. return PERF_COLOR_MAGENTA;
  755. }
  756. static const char *annotate__asm_color(struct block_range *br)
  757. {
  758. double cov = block_range__coverage(br);
  759. if (cov >= 0) {
  760. /* mark dull for <1% coverage */
  761. if (cov < 0.01)
  762. return PERF_COLOR_NORMAL;
  763. }
  764. return PERF_COLOR_BLUE;
  765. }
  766. static void annotate__branch_printf(struct block_range *br, u64 addr)
  767. {
  768. bool emit_comment = true;
  769. if (!br)
  770. return;
  771. #if 1
  772. if (br->is_target && br->start == addr) {
  773. struct block_range *branch = br;
  774. double p;
  775. /*
  776. * Find matching branch to our target.
  777. */
  778. while (!branch->is_branch)
  779. branch = block_range__next(branch);
  780. p = 100 *(double)br->entry / branch->coverage;
  781. if (p > 0.1) {
  782. if (emit_comment) {
  783. emit_comment = false;
  784. printf("\t#");
  785. }
  786. /*
  787. * The percentage of coverage joined at this target in relation
  788. * to the next branch.
  789. */
  790. printf(" +%.2f%%", p);
  791. }
  792. }
  793. #endif
  794. if (br->is_branch && br->end == addr) {
  795. double p = 100*(double)br->taken / br->coverage;
  796. if (p > 0.1) {
  797. if (emit_comment) {
  798. emit_comment = false;
  799. printf("\t#");
  800. }
  801. /*
  802. * The percentage of coverage leaving at this branch, and
  803. * its prediction ratio.
  804. */
  805. printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
  806. }
  807. }
  808. }
  809. static int disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start,
  810. struct perf_evsel *evsel, u64 len, int min_pcnt, int printed,
  811. int max_lines, struct disasm_line *queue)
  812. {
  813. static const char *prev_line;
  814. static const char *prev_color;
  815. if (dl->offset != -1) {
  816. const char *path = NULL;
  817. u64 nr_samples;
  818. double percent, max_percent = 0.0;
  819. double *ppercents = &percent;
  820. u64 *psamples = &nr_samples;
  821. int i, nr_percent = 1;
  822. const char *color;
  823. struct annotation *notes = symbol__annotation(sym);
  824. s64 offset = dl->offset;
  825. const u64 addr = start + offset;
  826. struct disasm_line *next;
  827. struct block_range *br;
  828. next = disasm__get_next_ip_line(&notes->src->source, dl);
  829. if (perf_evsel__is_group_event(evsel)) {
  830. nr_percent = evsel->nr_members;
  831. ppercents = calloc(nr_percent, sizeof(double));
  832. psamples = calloc(nr_percent, sizeof(u64));
  833. if (ppercents == NULL || psamples == NULL) {
  834. return -1;
  835. }
  836. }
  837. for (i = 0; i < nr_percent; i++) {
  838. percent = disasm__calc_percent(notes,
  839. notes->src->lines ? i : evsel->idx + i,
  840. offset,
  841. next ? next->offset : (s64) len,
  842. &path, &nr_samples);
  843. ppercents[i] = percent;
  844. psamples[i] = nr_samples;
  845. if (percent > max_percent)
  846. max_percent = percent;
  847. }
  848. if (max_percent < min_pcnt)
  849. return -1;
  850. if (max_lines && printed >= max_lines)
  851. return 1;
  852. if (queue != NULL) {
  853. list_for_each_entry_from(queue, &notes->src->source, node) {
  854. if (queue == dl)
  855. break;
  856. disasm_line__print(queue, sym, start, evsel, len,
  857. 0, 0, 1, NULL);
  858. }
  859. }
  860. color = get_percent_color(max_percent);
  861. /*
  862. * Also color the filename and line if needed, with
  863. * the same color than the percentage. Don't print it
  864. * twice for close colored addr with the same filename:line
  865. */
  866. if (path) {
  867. if (!prev_line || strcmp(prev_line, path)
  868. || color != prev_color) {
  869. color_fprintf(stdout, color, " %s", path);
  870. prev_line = path;
  871. prev_color = color;
  872. }
  873. }
  874. for (i = 0; i < nr_percent; i++) {
  875. percent = ppercents[i];
  876. nr_samples = psamples[i];
  877. color = get_percent_color(percent);
  878. if (symbol_conf.show_total_period)
  879. color_fprintf(stdout, color, " %7" PRIu64,
  880. nr_samples);
  881. else
  882. color_fprintf(stdout, color, " %7.2f", percent);
  883. }
  884. printf(" : ");
  885. br = block_range__find(addr);
  886. color_fprintf(stdout, annotate__address_color(br), " %" PRIx64 ":", addr);
  887. color_fprintf(stdout, annotate__asm_color(br), "%s", dl->line);
  888. annotate__branch_printf(br, addr);
  889. printf("\n");
  890. if (ppercents != &percent)
  891. free(ppercents);
  892. if (psamples != &nr_samples)
  893. free(psamples);
  894. } else if (max_lines && printed >= max_lines)
  895. return 1;
  896. else {
  897. int width = 8;
  898. if (queue)
  899. return -1;
  900. if (perf_evsel__is_group_event(evsel))
  901. width *= evsel->nr_members;
  902. if (!*dl->line)
  903. printf(" %*s:\n", width, " ");
  904. else
  905. printf(" %*s: %s\n", width, " ", dl->line);
  906. }
  907. return 0;
  908. }
  909. /*
  910. * symbol__parse_objdump_line() parses objdump output (with -d --no-show-raw)
  911. * which looks like following
  912. *
  913. * 0000000000415500 <_init>:
  914. * 415500: sub $0x8,%rsp
  915. * 415504: mov 0x2f5ad5(%rip),%rax # 70afe0 <_DYNAMIC+0x2f8>
  916. * 41550b: test %rax,%rax
  917. * 41550e: je 415515 <_init+0x15>
  918. * 415510: callq 416e70 <__gmon_start__@plt>
  919. * 415515: add $0x8,%rsp
  920. * 415519: retq
  921. *
  922. * it will be parsed and saved into struct disasm_line as
  923. * <offset> <name> <ops.raw>
  924. *
  925. * The offset will be a relative offset from the start of the symbol and -1
  926. * means that it's not a disassembly line so should be treated differently.
  927. * The ops.raw part will be parsed further according to type of the instruction.
  928. */
  929. static int symbol__parse_objdump_line(struct symbol *sym, struct map *map,
  930. struct arch *arch,
  931. FILE *file, size_t privsize,
  932. int *line_nr)
  933. {
  934. struct annotation *notes = symbol__annotation(sym);
  935. struct disasm_line *dl;
  936. char *line = NULL, *parsed_line, *tmp, *tmp2, *c;
  937. size_t line_len;
  938. s64 line_ip, offset = -1;
  939. regmatch_t match[2];
  940. if (getline(&line, &line_len, file) < 0)
  941. return -1;
  942. if (!line)
  943. return -1;
  944. while (line_len != 0 && isspace(line[line_len - 1]))
  945. line[--line_len] = '\0';
  946. c = strchr(line, '\n');
  947. if (c)
  948. *c = 0;
  949. line_ip = -1;
  950. parsed_line = line;
  951. /* /filename:linenr ? Save line number and ignore. */
  952. if (regexec(&file_lineno, line, 2, match, 0) == 0) {
  953. *line_nr = atoi(line + match[1].rm_so);
  954. return 0;
  955. }
  956. /*
  957. * Strip leading spaces:
  958. */
  959. tmp = line;
  960. while (*tmp) {
  961. if (*tmp != ' ')
  962. break;
  963. tmp++;
  964. }
  965. if (*tmp) {
  966. /*
  967. * Parse hexa addresses followed by ':'
  968. */
  969. line_ip = strtoull(tmp, &tmp2, 16);
  970. if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
  971. line_ip = -1;
  972. }
  973. if (line_ip != -1) {
  974. u64 start = map__rip_2objdump(map, sym->start),
  975. end = map__rip_2objdump(map, sym->end);
  976. offset = line_ip - start;
  977. if ((u64)line_ip < start || (u64)line_ip >= end)
  978. offset = -1;
  979. else
  980. parsed_line = tmp2 + 1;
  981. }
  982. dl = disasm_line__new(offset, parsed_line, privsize, *line_nr, arch, map);
  983. free(line);
  984. (*line_nr)++;
  985. if (dl == NULL)
  986. return -1;
  987. if (!disasm_line__has_offset(dl)) {
  988. dl->ops.target.offset = dl->ops.target.addr -
  989. map__rip_2objdump(map, sym->start);
  990. dl->ops.target.offset_avail = true;
  991. }
  992. /* kcore has no symbols, so add the call target name */
  993. if (dl->ins.ops && ins__is_call(&dl->ins) && !dl->ops.target.name) {
  994. struct addr_map_symbol target = {
  995. .map = map,
  996. .addr = dl->ops.target.addr,
  997. };
  998. if (!map_groups__find_ams(&target) &&
  999. target.sym->start == target.al_addr)
  1000. dl->ops.target.name = strdup(target.sym->name);
  1001. }
  1002. disasm__add(&notes->src->source, dl);
  1003. return 0;
  1004. }
  1005. static __attribute__((constructor)) void symbol__init_regexpr(void)
  1006. {
  1007. regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
  1008. }
  1009. static void delete_last_nop(struct symbol *sym)
  1010. {
  1011. struct annotation *notes = symbol__annotation(sym);
  1012. struct list_head *list = &notes->src->source;
  1013. struct disasm_line *dl;
  1014. while (!list_empty(list)) {
  1015. dl = list_entry(list->prev, struct disasm_line, node);
  1016. if (dl->ins.ops) {
  1017. if (dl->ins.ops != &nop_ops)
  1018. return;
  1019. } else {
  1020. if (!strstr(dl->line, " nop ") &&
  1021. !strstr(dl->line, " nopl ") &&
  1022. !strstr(dl->line, " nopw "))
  1023. return;
  1024. }
  1025. list_del(&dl->node);
  1026. disasm_line__free(dl);
  1027. }
  1028. }
  1029. int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
  1030. int errnum, char *buf, size_t buflen)
  1031. {
  1032. struct dso *dso = map->dso;
  1033. BUG_ON(buflen == 0);
  1034. if (errnum >= 0) {
  1035. str_error_r(errnum, buf, buflen);
  1036. return 0;
  1037. }
  1038. switch (errnum) {
  1039. case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
  1040. char bf[SBUILD_ID_SIZE + 15] = " with build id ";
  1041. char *build_id_msg = NULL;
  1042. if (dso->has_build_id) {
  1043. build_id__sprintf(dso->build_id,
  1044. sizeof(dso->build_id), bf + 15);
  1045. build_id_msg = bf;
  1046. }
  1047. scnprintf(buf, buflen,
  1048. "No vmlinux file%s\nwas found in the path.\n\n"
  1049. "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
  1050. "Please use:\n\n"
  1051. " perf buildid-cache -vu vmlinux\n\n"
  1052. "or:\n\n"
  1053. " --vmlinux vmlinux\n", build_id_msg ?: "");
  1054. }
  1055. break;
  1056. default:
  1057. scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
  1058. break;
  1059. }
  1060. return 0;
  1061. }
  1062. static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
  1063. {
  1064. char linkname[PATH_MAX];
  1065. char *build_id_filename;
  1066. char *build_id_path = NULL;
  1067. if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
  1068. !dso__is_kcore(dso))
  1069. return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
  1070. build_id_filename = dso__build_id_filename(dso, NULL, 0);
  1071. if (build_id_filename) {
  1072. __symbol__join_symfs(filename, filename_size, build_id_filename);
  1073. free(build_id_filename);
  1074. } else {
  1075. if (dso->has_build_id)
  1076. return ENOMEM;
  1077. goto fallback;
  1078. }
  1079. build_id_path = strdup(filename);
  1080. if (!build_id_path)
  1081. return -1;
  1082. dirname(build_id_path);
  1083. if (dso__is_kcore(dso) ||
  1084. readlink(build_id_path, linkname, sizeof(linkname)) < 0 ||
  1085. strstr(linkname, DSO__NAME_KALLSYMS) ||
  1086. access(filename, R_OK)) {
  1087. fallback:
  1088. /*
  1089. * If we don't have build-ids or the build-id file isn't in the
  1090. * cache, or is just a kallsyms file, well, lets hope that this
  1091. * DSO is the same as when 'perf record' ran.
  1092. */
  1093. __symbol__join_symfs(filename, filename_size, dso->long_name);
  1094. }
  1095. free(build_id_path);
  1096. return 0;
  1097. }
  1098. static const char *annotate__norm_arch(const char *arch_name)
  1099. {
  1100. struct utsname uts;
  1101. if (!arch_name) { /* Assume we are annotating locally. */
  1102. if (uname(&uts) < 0)
  1103. return NULL;
  1104. arch_name = uts.machine;
  1105. }
  1106. return normalize_arch((char *)arch_name);
  1107. }
  1108. int symbol__disassemble(struct symbol *sym, struct map *map, const char *arch_name, size_t privsize)
  1109. {
  1110. struct dso *dso = map->dso;
  1111. char command[PATH_MAX * 2];
  1112. struct arch *arch = NULL;
  1113. FILE *file;
  1114. char symfs_filename[PATH_MAX];
  1115. struct kcore_extract kce;
  1116. bool delete_extract = false;
  1117. int stdout_fd[2];
  1118. int lineno = 0;
  1119. int nline;
  1120. pid_t pid;
  1121. int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
  1122. if (err)
  1123. return err;
  1124. arch_name = annotate__norm_arch(arch_name);
  1125. if (!arch_name)
  1126. return -1;
  1127. arch = arch__find(arch_name);
  1128. if (arch == NULL)
  1129. return -ENOTSUP;
  1130. if (arch->init) {
  1131. err = arch->init(arch);
  1132. if (err) {
  1133. pr_err("%s: failed to initialize %s arch priv area\n", __func__, arch->name);
  1134. return err;
  1135. }
  1136. }
  1137. pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
  1138. symfs_filename, sym->name, map->unmap_ip(map, sym->start),
  1139. map->unmap_ip(map, sym->end));
  1140. pr_debug("annotating [%p] %30s : [%p] %30s\n",
  1141. dso, dso->long_name, sym, sym->name);
  1142. if (dso__is_kcore(dso)) {
  1143. kce.kcore_filename = symfs_filename;
  1144. kce.addr = map__rip_2objdump(map, sym->start);
  1145. kce.offs = sym->start;
  1146. kce.len = sym->end - sym->start;
  1147. if (!kcore_extract__create(&kce)) {
  1148. delete_extract = true;
  1149. strlcpy(symfs_filename, kce.extract_filename,
  1150. sizeof(symfs_filename));
  1151. }
  1152. } else if (dso__needs_decompress(dso)) {
  1153. char tmp[PATH_MAX];
  1154. struct kmod_path m;
  1155. int fd;
  1156. bool ret;
  1157. if (kmod_path__parse_ext(&m, symfs_filename))
  1158. goto out;
  1159. snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
  1160. fd = mkstemp(tmp);
  1161. if (fd < 0) {
  1162. free(m.ext);
  1163. goto out;
  1164. }
  1165. ret = decompress_to_file(m.ext, symfs_filename, fd);
  1166. if (ret)
  1167. pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
  1168. free(m.ext);
  1169. close(fd);
  1170. if (!ret)
  1171. goto out;
  1172. strcpy(symfs_filename, tmp);
  1173. }
  1174. snprintf(command, sizeof(command),
  1175. "%s %s%s --start-address=0x%016" PRIx64
  1176. " --stop-address=0x%016" PRIx64
  1177. " -l -d %s %s -C %s 2>/dev/null|grep -v %s:|expand",
  1178. objdump_path ? objdump_path : "objdump",
  1179. disassembler_style ? "-M " : "",
  1180. disassembler_style ? disassembler_style : "",
  1181. map__rip_2objdump(map, sym->start),
  1182. map__rip_2objdump(map, sym->end),
  1183. symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
  1184. symbol_conf.annotate_src ? "-S" : "",
  1185. symfs_filename, symfs_filename);
  1186. pr_debug("Executing: %s\n", command);
  1187. err = -1;
  1188. if (pipe(stdout_fd) < 0) {
  1189. pr_err("Failure creating the pipe to run %s\n", command);
  1190. goto out_remove_tmp;
  1191. }
  1192. pid = fork();
  1193. if (pid < 0) {
  1194. pr_err("Failure forking to run %s\n", command);
  1195. goto out_close_stdout;
  1196. }
  1197. if (pid == 0) {
  1198. close(stdout_fd[0]);
  1199. dup2(stdout_fd[1], 1);
  1200. close(stdout_fd[1]);
  1201. execl("/bin/sh", "sh", "-c", command, NULL);
  1202. perror(command);
  1203. exit(-1);
  1204. }
  1205. close(stdout_fd[1]);
  1206. file = fdopen(stdout_fd[0], "r");
  1207. if (!file) {
  1208. pr_err("Failure creating FILE stream for %s\n", command);
  1209. /*
  1210. * If we were using debug info should retry with
  1211. * original binary.
  1212. */
  1213. goto out_remove_tmp;
  1214. }
  1215. nline = 0;
  1216. while (!feof(file)) {
  1217. /*
  1218. * The source code line number (lineno) needs to be kept in
  1219. * accross calls to symbol__parse_objdump_line(), so that it
  1220. * can associate it with the instructions till the next one.
  1221. * See disasm_line__new() and struct disasm_line::line_nr.
  1222. */
  1223. if (symbol__parse_objdump_line(sym, map, arch, file, privsize,
  1224. &lineno) < 0)
  1225. break;
  1226. nline++;
  1227. }
  1228. if (nline == 0)
  1229. pr_err("No output from %s\n", command);
  1230. /*
  1231. * kallsyms does not have symbol sizes so there may a nop at the end.
  1232. * Remove it.
  1233. */
  1234. if (dso__is_kcore(dso))
  1235. delete_last_nop(sym);
  1236. fclose(file);
  1237. err = 0;
  1238. out_remove_tmp:
  1239. close(stdout_fd[0]);
  1240. if (dso__needs_decompress(dso))
  1241. unlink(symfs_filename);
  1242. if (delete_extract)
  1243. kcore_extract__delete(&kce);
  1244. out:
  1245. return err;
  1246. out_close_stdout:
  1247. close(stdout_fd[1]);
  1248. goto out_remove_tmp;
  1249. }
  1250. static void insert_source_line(struct rb_root *root, struct source_line *src_line)
  1251. {
  1252. struct source_line *iter;
  1253. struct rb_node **p = &root->rb_node;
  1254. struct rb_node *parent = NULL;
  1255. int i, ret;
  1256. while (*p != NULL) {
  1257. parent = *p;
  1258. iter = rb_entry(parent, struct source_line, node);
  1259. ret = strcmp(iter->path, src_line->path);
  1260. if (ret == 0) {
  1261. for (i = 0; i < src_line->nr_pcnt; i++)
  1262. iter->samples[i].percent_sum += src_line->samples[i].percent;
  1263. return;
  1264. }
  1265. if (ret < 0)
  1266. p = &(*p)->rb_left;
  1267. else
  1268. p = &(*p)->rb_right;
  1269. }
  1270. for (i = 0; i < src_line->nr_pcnt; i++)
  1271. src_line->samples[i].percent_sum = src_line->samples[i].percent;
  1272. rb_link_node(&src_line->node, parent, p);
  1273. rb_insert_color(&src_line->node, root);
  1274. }
  1275. static int cmp_source_line(struct source_line *a, struct source_line *b)
  1276. {
  1277. int i;
  1278. for (i = 0; i < a->nr_pcnt; i++) {
  1279. if (a->samples[i].percent_sum == b->samples[i].percent_sum)
  1280. continue;
  1281. return a->samples[i].percent_sum > b->samples[i].percent_sum;
  1282. }
  1283. return 0;
  1284. }
  1285. static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
  1286. {
  1287. struct source_line *iter;
  1288. struct rb_node **p = &root->rb_node;
  1289. struct rb_node *parent = NULL;
  1290. while (*p != NULL) {
  1291. parent = *p;
  1292. iter = rb_entry(parent, struct source_line, node);
  1293. if (cmp_source_line(src_line, iter))
  1294. p = &(*p)->rb_left;
  1295. else
  1296. p = &(*p)->rb_right;
  1297. }
  1298. rb_link_node(&src_line->node, parent, p);
  1299. rb_insert_color(&src_line->node, root);
  1300. }
  1301. static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
  1302. {
  1303. struct source_line *src_line;
  1304. struct rb_node *node;
  1305. node = rb_first(src_root);
  1306. while (node) {
  1307. struct rb_node *next;
  1308. src_line = rb_entry(node, struct source_line, node);
  1309. next = rb_next(node);
  1310. rb_erase(node, src_root);
  1311. __resort_source_line(dest_root, src_line);
  1312. node = next;
  1313. }
  1314. }
  1315. static void symbol__free_source_line(struct symbol *sym, int len)
  1316. {
  1317. struct annotation *notes = symbol__annotation(sym);
  1318. struct source_line *src_line = notes->src->lines;
  1319. size_t sizeof_src_line;
  1320. int i;
  1321. sizeof_src_line = sizeof(*src_line) +
  1322. (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
  1323. for (i = 0; i < len; i++) {
  1324. free_srcline(src_line->path);
  1325. src_line = (void *)src_line + sizeof_src_line;
  1326. }
  1327. zfree(&notes->src->lines);
  1328. }
  1329. /* Get the filename:line for the colored entries */
  1330. static int symbol__get_source_line(struct symbol *sym, struct map *map,
  1331. struct perf_evsel *evsel,
  1332. struct rb_root *root, int len)
  1333. {
  1334. u64 start;
  1335. int i, k;
  1336. int evidx = evsel->idx;
  1337. struct source_line *src_line;
  1338. struct annotation *notes = symbol__annotation(sym);
  1339. struct sym_hist *h = annotation__histogram(notes, evidx);
  1340. struct rb_root tmp_root = RB_ROOT;
  1341. int nr_pcnt = 1;
  1342. u64 h_sum = h->sum;
  1343. size_t sizeof_src_line = sizeof(struct source_line);
  1344. if (perf_evsel__is_group_event(evsel)) {
  1345. for (i = 1; i < evsel->nr_members; i++) {
  1346. h = annotation__histogram(notes, evidx + i);
  1347. h_sum += h->sum;
  1348. }
  1349. nr_pcnt = evsel->nr_members;
  1350. sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
  1351. }
  1352. if (!h_sum)
  1353. return 0;
  1354. src_line = notes->src->lines = calloc(len, sizeof_src_line);
  1355. if (!notes->src->lines)
  1356. return -1;
  1357. start = map__rip_2objdump(map, sym->start);
  1358. for (i = 0; i < len; i++) {
  1359. u64 offset, nr_samples;
  1360. double percent_max = 0.0;
  1361. src_line->nr_pcnt = nr_pcnt;
  1362. for (k = 0; k < nr_pcnt; k++) {
  1363. double percent = 0.0;
  1364. h = annotation__histogram(notes, evidx + k);
  1365. nr_samples = h->addr[i];
  1366. if (h->sum)
  1367. percent = 100.0 * nr_samples / h->sum;
  1368. if (percent > percent_max)
  1369. percent_max = percent;
  1370. src_line->samples[k].percent = percent;
  1371. src_line->samples[k].nr = nr_samples;
  1372. }
  1373. if (percent_max <= 0.5)
  1374. goto next;
  1375. offset = start + i;
  1376. src_line->path = get_srcline(map->dso, offset, NULL,
  1377. false, true);
  1378. insert_source_line(&tmp_root, src_line);
  1379. next:
  1380. src_line = (void *)src_line + sizeof_src_line;
  1381. }
  1382. resort_source_line(root, &tmp_root);
  1383. return 0;
  1384. }
  1385. static void print_summary(struct rb_root *root, const char *filename)
  1386. {
  1387. struct source_line *src_line;
  1388. struct rb_node *node;
  1389. printf("\nSorted summary for file %s\n", filename);
  1390. printf("----------------------------------------------\n\n");
  1391. if (RB_EMPTY_ROOT(root)) {
  1392. printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
  1393. return;
  1394. }
  1395. node = rb_first(root);
  1396. while (node) {
  1397. double percent, percent_max = 0.0;
  1398. const char *color;
  1399. char *path;
  1400. int i;
  1401. src_line = rb_entry(node, struct source_line, node);
  1402. for (i = 0; i < src_line->nr_pcnt; i++) {
  1403. percent = src_line->samples[i].percent_sum;
  1404. color = get_percent_color(percent);
  1405. color_fprintf(stdout, color, " %7.2f", percent);
  1406. if (percent > percent_max)
  1407. percent_max = percent;
  1408. }
  1409. path = src_line->path;
  1410. color = get_percent_color(percent_max);
  1411. color_fprintf(stdout, color, " %s\n", path);
  1412. node = rb_next(node);
  1413. }
  1414. }
  1415. static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
  1416. {
  1417. struct annotation *notes = symbol__annotation(sym);
  1418. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1419. u64 len = symbol__size(sym), offset;
  1420. for (offset = 0; offset < len; ++offset)
  1421. if (h->addr[offset] != 0)
  1422. printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
  1423. sym->start + offset, h->addr[offset]);
  1424. printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
  1425. }
  1426. int symbol__annotate_printf(struct symbol *sym, struct map *map,
  1427. struct perf_evsel *evsel, bool full_paths,
  1428. int min_pcnt, int max_lines, int context)
  1429. {
  1430. struct dso *dso = map->dso;
  1431. char *filename;
  1432. const char *d_filename;
  1433. const char *evsel_name = perf_evsel__name(evsel);
  1434. struct annotation *notes = symbol__annotation(sym);
  1435. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1436. struct disasm_line *pos, *queue = NULL;
  1437. u64 start = map__rip_2objdump(map, sym->start);
  1438. int printed = 2, queue_len = 0;
  1439. int more = 0;
  1440. u64 len;
  1441. int width = 8;
  1442. int graph_dotted_len;
  1443. filename = strdup(dso->long_name);
  1444. if (!filename)
  1445. return -ENOMEM;
  1446. if (full_paths)
  1447. d_filename = filename;
  1448. else
  1449. d_filename = basename(filename);
  1450. len = symbol__size(sym);
  1451. if (perf_evsel__is_group_event(evsel))
  1452. width *= evsel->nr_members;
  1453. graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
  1454. width, width, "Percent", d_filename, evsel_name, h->sum);
  1455. printf("%-*.*s----\n",
  1456. graph_dotted_len, graph_dotted_len, graph_dotted_line);
  1457. if (verbose > 0)
  1458. symbol__annotate_hits(sym, evsel);
  1459. list_for_each_entry(pos, &notes->src->source, node) {
  1460. if (context && queue == NULL) {
  1461. queue = pos;
  1462. queue_len = 0;
  1463. }
  1464. switch (disasm_line__print(pos, sym, start, evsel, len,
  1465. min_pcnt, printed, max_lines,
  1466. queue)) {
  1467. case 0:
  1468. ++printed;
  1469. if (context) {
  1470. printed += queue_len;
  1471. queue = NULL;
  1472. queue_len = 0;
  1473. }
  1474. break;
  1475. case 1:
  1476. /* filtered by max_lines */
  1477. ++more;
  1478. break;
  1479. case -1:
  1480. default:
  1481. /*
  1482. * Filtered by min_pcnt or non IP lines when
  1483. * context != 0
  1484. */
  1485. if (!context)
  1486. break;
  1487. if (queue_len == context)
  1488. queue = list_entry(queue->node.next, typeof(*queue), node);
  1489. else
  1490. ++queue_len;
  1491. break;
  1492. }
  1493. }
  1494. free(filename);
  1495. return more;
  1496. }
  1497. void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
  1498. {
  1499. struct annotation *notes = symbol__annotation(sym);
  1500. struct sym_hist *h = annotation__histogram(notes, evidx);
  1501. memset(h, 0, notes->src->sizeof_sym_hist);
  1502. }
  1503. void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
  1504. {
  1505. struct annotation *notes = symbol__annotation(sym);
  1506. struct sym_hist *h = annotation__histogram(notes, evidx);
  1507. int len = symbol__size(sym), offset;
  1508. h->sum = 0;
  1509. for (offset = 0; offset < len; ++offset) {
  1510. h->addr[offset] = h->addr[offset] * 7 / 8;
  1511. h->sum += h->addr[offset];
  1512. }
  1513. }
  1514. void disasm__purge(struct list_head *head)
  1515. {
  1516. struct disasm_line *pos, *n;
  1517. list_for_each_entry_safe(pos, n, head, node) {
  1518. list_del(&pos->node);
  1519. disasm_line__free(pos);
  1520. }
  1521. }
  1522. static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
  1523. {
  1524. size_t printed;
  1525. if (dl->offset == -1)
  1526. return fprintf(fp, "%s\n", dl->line);
  1527. printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->ins.name);
  1528. if (dl->ops.raw[0] != '\0') {
  1529. printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
  1530. dl->ops.raw);
  1531. }
  1532. return printed + fprintf(fp, "\n");
  1533. }
  1534. size_t disasm__fprintf(struct list_head *head, FILE *fp)
  1535. {
  1536. struct disasm_line *pos;
  1537. size_t printed = 0;
  1538. list_for_each_entry(pos, head, node)
  1539. printed += disasm_line__fprintf(pos, fp);
  1540. return printed;
  1541. }
  1542. int symbol__tty_annotate(struct symbol *sym, struct map *map,
  1543. struct perf_evsel *evsel, bool print_lines,
  1544. bool full_paths, int min_pcnt, int max_lines)
  1545. {
  1546. struct dso *dso = map->dso;
  1547. struct rb_root source_line = RB_ROOT;
  1548. u64 len;
  1549. if (symbol__disassemble(sym, map, perf_evsel__env_arch(evsel), 0) < 0)
  1550. return -1;
  1551. len = symbol__size(sym);
  1552. if (print_lines) {
  1553. srcline_full_filename = full_paths;
  1554. symbol__get_source_line(sym, map, evsel, &source_line, len);
  1555. print_summary(&source_line, dso->long_name);
  1556. }
  1557. symbol__annotate_printf(sym, map, evsel, full_paths,
  1558. min_pcnt, max_lines, 0);
  1559. if (print_lines)
  1560. symbol__free_source_line(sym, len);
  1561. disasm__purge(&symbol__annotation(sym)->src->source);
  1562. return 0;
  1563. }
  1564. bool ui__has_annotation(void)
  1565. {
  1566. return use_browser == 1 && perf_hpp_list.sym;
  1567. }