annotate.c 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908
  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. #include "arch/s390/annotate/instructions.c"
  95. static struct arch architectures[] = {
  96. {
  97. .name = "arm",
  98. .init = arm__annotate_init,
  99. },
  100. {
  101. .name = "arm64",
  102. .init = arm64__annotate_init,
  103. },
  104. {
  105. .name = "x86",
  106. .instructions = x86__instructions,
  107. .nr_instructions = ARRAY_SIZE(x86__instructions),
  108. .objdump = {
  109. .comment_char = '#',
  110. },
  111. },
  112. {
  113. .name = "powerpc",
  114. .init = powerpc__annotate_init,
  115. },
  116. {
  117. .name = "s390",
  118. .init = s390__annotate_init,
  119. .objdump = {
  120. .comment_char = '#',
  121. },
  122. },
  123. };
  124. static void ins__delete(struct ins_operands *ops)
  125. {
  126. if (ops == NULL)
  127. return;
  128. zfree(&ops->source.raw);
  129. zfree(&ops->source.name);
  130. zfree(&ops->target.raw);
  131. zfree(&ops->target.name);
  132. }
  133. static int ins__raw_scnprintf(struct ins *ins, char *bf, size_t size,
  134. struct ins_operands *ops)
  135. {
  136. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->raw);
  137. }
  138. int ins__scnprintf(struct ins *ins, char *bf, size_t size,
  139. struct ins_operands *ops)
  140. {
  141. if (ins->ops->scnprintf)
  142. return ins->ops->scnprintf(ins, bf, size, ops);
  143. return ins__raw_scnprintf(ins, bf, size, ops);
  144. }
  145. static int call__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  146. {
  147. char *endptr, *tok, *name;
  148. ops->target.addr = strtoull(ops->raw, &endptr, 16);
  149. name = strchr(endptr, '<');
  150. if (name == NULL)
  151. goto indirect_call;
  152. name++;
  153. if (arch->objdump.skip_functions_char &&
  154. strchr(name, arch->objdump.skip_functions_char))
  155. return -1;
  156. tok = strchr(name, '>');
  157. if (tok == NULL)
  158. return -1;
  159. *tok = '\0';
  160. ops->target.name = strdup(name);
  161. *tok = '>';
  162. return ops->target.name == NULL ? -1 : 0;
  163. indirect_call:
  164. tok = strchr(endptr, '*');
  165. if (tok == NULL) {
  166. struct symbol *sym = map__find_symbol(map, map->map_ip(map, ops->target.addr));
  167. if (sym != NULL)
  168. ops->target.name = strdup(sym->name);
  169. else
  170. ops->target.addr = 0;
  171. return 0;
  172. }
  173. ops->target.addr = strtoull(tok + 1, NULL, 16);
  174. return 0;
  175. }
  176. static int call__scnprintf(struct ins *ins, char *bf, size_t size,
  177. struct ins_operands *ops)
  178. {
  179. if (ops->target.name)
  180. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->target.name);
  181. if (ops->target.addr == 0)
  182. return ins__raw_scnprintf(ins, bf, size, ops);
  183. return scnprintf(bf, size, "%-6.6s *%" PRIx64, ins->name, ops->target.addr);
  184. }
  185. static struct ins_ops call_ops = {
  186. .parse = call__parse,
  187. .scnprintf = call__scnprintf,
  188. };
  189. bool ins__is_call(const struct ins *ins)
  190. {
  191. return ins->ops == &call_ops;
  192. }
  193. static int jump__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  194. {
  195. const char *s = strchr(ops->raw, '+');
  196. const char *c = strchr(ops->raw, ',');
  197. if (c++ != NULL)
  198. ops->target.addr = strtoull(c, NULL, 16);
  199. else
  200. ops->target.addr = strtoull(ops->raw, NULL, 16);
  201. if (s++ != NULL) {
  202. ops->target.offset = strtoull(s, NULL, 16);
  203. ops->target.offset_avail = true;
  204. } else {
  205. ops->target.offset_avail = false;
  206. }
  207. return 0;
  208. }
  209. static int jump__scnprintf(struct ins *ins, char *bf, size_t size,
  210. struct ins_operands *ops)
  211. {
  212. if (!ops->target.addr || ops->target.offset < 0)
  213. return ins__raw_scnprintf(ins, bf, size, ops);
  214. return scnprintf(bf, size, "%-6.6s %" PRIx64, ins->name, ops->target.offset);
  215. }
  216. static struct ins_ops jump_ops = {
  217. .parse = jump__parse,
  218. .scnprintf = jump__scnprintf,
  219. };
  220. bool ins__is_jump(const struct ins *ins)
  221. {
  222. return ins->ops == &jump_ops;
  223. }
  224. static int comment__symbol(char *raw, char *comment, u64 *addrp, char **namep)
  225. {
  226. char *endptr, *name, *t;
  227. if (strstr(raw, "(%rip)") == NULL)
  228. return 0;
  229. *addrp = strtoull(comment, &endptr, 16);
  230. name = strchr(endptr, '<');
  231. if (name == NULL)
  232. return -1;
  233. name++;
  234. t = strchr(name, '>');
  235. if (t == NULL)
  236. return 0;
  237. *t = '\0';
  238. *namep = strdup(name);
  239. *t = '>';
  240. return 0;
  241. }
  242. static int lock__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  243. {
  244. ops->locked.ops = zalloc(sizeof(*ops->locked.ops));
  245. if (ops->locked.ops == NULL)
  246. return 0;
  247. if (disasm_line__parse(ops->raw, &ops->locked.ins.name, &ops->locked.ops->raw) < 0)
  248. goto out_free_ops;
  249. ops->locked.ins.ops = ins__find(arch, ops->locked.ins.name);
  250. if (ops->locked.ins.ops == NULL)
  251. goto out_free_ops;
  252. if (ops->locked.ins.ops->parse &&
  253. ops->locked.ins.ops->parse(arch, ops->locked.ops, map) < 0)
  254. goto out_free_ops;
  255. return 0;
  256. out_free_ops:
  257. zfree(&ops->locked.ops);
  258. return 0;
  259. }
  260. static int lock__scnprintf(struct ins *ins, char *bf, size_t size,
  261. struct ins_operands *ops)
  262. {
  263. int printed;
  264. if (ops->locked.ins.ops == NULL)
  265. return ins__raw_scnprintf(ins, bf, size, ops);
  266. printed = scnprintf(bf, size, "%-6.6s ", ins->name);
  267. return printed + ins__scnprintf(&ops->locked.ins, bf + printed,
  268. size - printed, ops->locked.ops);
  269. }
  270. static void lock__delete(struct ins_operands *ops)
  271. {
  272. struct ins *ins = &ops->locked.ins;
  273. if (ins->ops && ins->ops->free)
  274. ins->ops->free(ops->locked.ops);
  275. else
  276. ins__delete(ops->locked.ops);
  277. zfree(&ops->locked.ops);
  278. zfree(&ops->target.raw);
  279. zfree(&ops->target.name);
  280. }
  281. static struct ins_ops lock_ops = {
  282. .free = lock__delete,
  283. .parse = lock__parse,
  284. .scnprintf = lock__scnprintf,
  285. };
  286. static int mov__parse(struct arch *arch, struct ins_operands *ops, struct map *map __maybe_unused)
  287. {
  288. char *s = strchr(ops->raw, ','), *target, *comment, prev;
  289. if (s == NULL)
  290. return -1;
  291. *s = '\0';
  292. ops->source.raw = strdup(ops->raw);
  293. *s = ',';
  294. if (ops->source.raw == NULL)
  295. return -1;
  296. target = ++s;
  297. comment = strchr(s, arch->objdump.comment_char);
  298. if (comment != NULL)
  299. s = comment - 1;
  300. else
  301. s = strchr(s, '\0') - 1;
  302. while (s > target && isspace(s[0]))
  303. --s;
  304. s++;
  305. prev = *s;
  306. *s = '\0';
  307. ops->target.raw = strdup(target);
  308. *s = prev;
  309. if (ops->target.raw == NULL)
  310. goto out_free_source;
  311. if (comment == NULL)
  312. return 0;
  313. comment = ltrim(comment);
  314. comment__symbol(ops->source.raw, comment, &ops->source.addr, &ops->source.name);
  315. comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
  316. return 0;
  317. out_free_source:
  318. zfree(&ops->source.raw);
  319. return -1;
  320. }
  321. static int mov__scnprintf(struct ins *ins, char *bf, size_t size,
  322. struct ins_operands *ops)
  323. {
  324. return scnprintf(bf, size, "%-6.6s %s,%s", ins->name,
  325. ops->source.name ?: ops->source.raw,
  326. ops->target.name ?: ops->target.raw);
  327. }
  328. static struct ins_ops mov_ops = {
  329. .parse = mov__parse,
  330. .scnprintf = mov__scnprintf,
  331. };
  332. static int dec__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  333. {
  334. char *target, *comment, *s, prev;
  335. target = s = ops->raw;
  336. while (s[0] != '\0' && !isspace(s[0]))
  337. ++s;
  338. prev = *s;
  339. *s = '\0';
  340. ops->target.raw = strdup(target);
  341. *s = prev;
  342. if (ops->target.raw == NULL)
  343. return -1;
  344. comment = strchr(s, arch->objdump.comment_char);
  345. if (comment == NULL)
  346. return 0;
  347. comment = ltrim(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 tmp, *name = ltrim(line);
  636. if (name[0] == '\0')
  637. return -1;
  638. *rawp = name + 1;
  639. while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
  640. ++*rawp;
  641. tmp = (*rawp)[0];
  642. (*rawp)[0] = '\0';
  643. *namep = strdup(name);
  644. if (*namep == NULL)
  645. goto out_free_name;
  646. (*rawp)[0] = tmp;
  647. *rawp = ltrim(*rawp);
  648. return 0;
  649. out_free_name:
  650. free((void *)namep);
  651. *namep = NULL;
  652. return -1;
  653. }
  654. static struct disasm_line *disasm_line__new(s64 offset, char *line,
  655. size_t privsize, int line_nr,
  656. struct arch *arch,
  657. struct map *map)
  658. {
  659. struct disasm_line *dl = zalloc(sizeof(*dl) + privsize);
  660. if (dl != NULL) {
  661. dl->offset = offset;
  662. dl->line = strdup(line);
  663. dl->line_nr = line_nr;
  664. if (dl->line == NULL)
  665. goto out_delete;
  666. if (offset != -1) {
  667. if (disasm_line__parse(dl->line, &dl->ins.name, &dl->ops.raw) < 0)
  668. goto out_free_line;
  669. disasm_line__init_ins(dl, arch, map);
  670. }
  671. }
  672. return dl;
  673. out_free_line:
  674. zfree(&dl->line);
  675. out_delete:
  676. free(dl);
  677. return NULL;
  678. }
  679. void disasm_line__free(struct disasm_line *dl)
  680. {
  681. zfree(&dl->line);
  682. if (dl->ins.ops && dl->ins.ops->free)
  683. dl->ins.ops->free(&dl->ops);
  684. else
  685. ins__delete(&dl->ops);
  686. free((void *)dl->ins.name);
  687. dl->ins.name = NULL;
  688. free(dl);
  689. }
  690. int disasm_line__scnprintf(struct disasm_line *dl, char *bf, size_t size, bool raw)
  691. {
  692. if (raw || !dl->ins.ops)
  693. return scnprintf(bf, size, "%-6.6s %s", dl->ins.name, dl->ops.raw);
  694. return ins__scnprintf(&dl->ins, bf, size, &dl->ops);
  695. }
  696. static void disasm__add(struct list_head *head, struct disasm_line *line)
  697. {
  698. list_add_tail(&line->node, head);
  699. }
  700. struct disasm_line *disasm__get_next_ip_line(struct list_head *head, struct disasm_line *pos)
  701. {
  702. list_for_each_entry_continue(pos, head, node)
  703. if (pos->offset >= 0)
  704. return pos;
  705. return NULL;
  706. }
  707. double disasm__calc_percent(struct annotation *notes, int evidx, s64 offset,
  708. s64 end, const char **path, u64 *nr_samples)
  709. {
  710. struct source_line *src_line = notes->src->lines;
  711. double percent = 0.0;
  712. *nr_samples = 0;
  713. if (src_line) {
  714. size_t sizeof_src_line = sizeof(*src_line) +
  715. sizeof(src_line->samples) * (src_line->nr_pcnt - 1);
  716. while (offset < end) {
  717. src_line = (void *)notes->src->lines +
  718. (sizeof_src_line * offset);
  719. if (*path == NULL)
  720. *path = src_line->path;
  721. percent += src_line->samples[evidx].percent;
  722. *nr_samples += src_line->samples[evidx].nr;
  723. offset++;
  724. }
  725. } else {
  726. struct sym_hist *h = annotation__histogram(notes, evidx);
  727. unsigned int hits = 0;
  728. while (offset < end)
  729. hits += h->addr[offset++];
  730. if (h->sum) {
  731. *nr_samples = hits;
  732. percent = 100.0 * hits / h->sum;
  733. }
  734. }
  735. return percent;
  736. }
  737. static const char *annotate__address_color(struct block_range *br)
  738. {
  739. double cov = block_range__coverage(br);
  740. if (cov >= 0) {
  741. /* mark red for >75% coverage */
  742. if (cov > 0.75)
  743. return PERF_COLOR_RED;
  744. /* mark dull for <1% coverage */
  745. if (cov < 0.01)
  746. return PERF_COLOR_NORMAL;
  747. }
  748. return PERF_COLOR_MAGENTA;
  749. }
  750. static const char *annotate__asm_color(struct block_range *br)
  751. {
  752. double cov = block_range__coverage(br);
  753. if (cov >= 0) {
  754. /* mark dull for <1% coverage */
  755. if (cov < 0.01)
  756. return PERF_COLOR_NORMAL;
  757. }
  758. return PERF_COLOR_BLUE;
  759. }
  760. static void annotate__branch_printf(struct block_range *br, u64 addr)
  761. {
  762. bool emit_comment = true;
  763. if (!br)
  764. return;
  765. #if 1
  766. if (br->is_target && br->start == addr) {
  767. struct block_range *branch = br;
  768. double p;
  769. /*
  770. * Find matching branch to our target.
  771. */
  772. while (!branch->is_branch)
  773. branch = block_range__next(branch);
  774. p = 100 *(double)br->entry / branch->coverage;
  775. if (p > 0.1) {
  776. if (emit_comment) {
  777. emit_comment = false;
  778. printf("\t#");
  779. }
  780. /*
  781. * The percentage of coverage joined at this target in relation
  782. * to the next branch.
  783. */
  784. printf(" +%.2f%%", p);
  785. }
  786. }
  787. #endif
  788. if (br->is_branch && br->end == addr) {
  789. double p = 100*(double)br->taken / br->coverage;
  790. if (p > 0.1) {
  791. if (emit_comment) {
  792. emit_comment = false;
  793. printf("\t#");
  794. }
  795. /*
  796. * The percentage of coverage leaving at this branch, and
  797. * its prediction ratio.
  798. */
  799. printf(" -%.2f%% (p:%.2f%%)", p, 100*(double)br->pred / br->taken);
  800. }
  801. }
  802. }
  803. static int disasm_line__print(struct disasm_line *dl, struct symbol *sym, u64 start,
  804. struct perf_evsel *evsel, u64 len, int min_pcnt, int printed,
  805. int max_lines, struct disasm_line *queue)
  806. {
  807. static const char *prev_line;
  808. static const char *prev_color;
  809. if (dl->offset != -1) {
  810. const char *path = NULL;
  811. u64 nr_samples;
  812. double percent, max_percent = 0.0;
  813. double *ppercents = &percent;
  814. u64 *psamples = &nr_samples;
  815. int i, nr_percent = 1;
  816. const char *color;
  817. struct annotation *notes = symbol__annotation(sym);
  818. s64 offset = dl->offset;
  819. const u64 addr = start + offset;
  820. struct disasm_line *next;
  821. struct block_range *br;
  822. next = disasm__get_next_ip_line(&notes->src->source, dl);
  823. if (perf_evsel__is_group_event(evsel)) {
  824. nr_percent = evsel->nr_members;
  825. ppercents = calloc(nr_percent, sizeof(double));
  826. psamples = calloc(nr_percent, sizeof(u64));
  827. if (ppercents == NULL || psamples == NULL) {
  828. return -1;
  829. }
  830. }
  831. for (i = 0; i < nr_percent; i++) {
  832. percent = disasm__calc_percent(notes,
  833. notes->src->lines ? i : evsel->idx + i,
  834. offset,
  835. next ? next->offset : (s64) len,
  836. &path, &nr_samples);
  837. ppercents[i] = percent;
  838. psamples[i] = nr_samples;
  839. if (percent > max_percent)
  840. max_percent = percent;
  841. }
  842. if (max_percent < min_pcnt)
  843. return -1;
  844. if (max_lines && printed >= max_lines)
  845. return 1;
  846. if (queue != NULL) {
  847. list_for_each_entry_from(queue, &notes->src->source, node) {
  848. if (queue == dl)
  849. break;
  850. disasm_line__print(queue, sym, start, evsel, len,
  851. 0, 0, 1, NULL);
  852. }
  853. }
  854. color = get_percent_color(max_percent);
  855. /*
  856. * Also color the filename and line if needed, with
  857. * the same color than the percentage. Don't print it
  858. * twice for close colored addr with the same filename:line
  859. */
  860. if (path) {
  861. if (!prev_line || strcmp(prev_line, path)
  862. || color != prev_color) {
  863. color_fprintf(stdout, color, " %s", path);
  864. prev_line = path;
  865. prev_color = color;
  866. }
  867. }
  868. for (i = 0; i < nr_percent; i++) {
  869. percent = ppercents[i];
  870. nr_samples = psamples[i];
  871. color = get_percent_color(percent);
  872. if (symbol_conf.show_total_period)
  873. color_fprintf(stdout, color, " %7" PRIu64,
  874. nr_samples);
  875. else
  876. color_fprintf(stdout, color, " %7.2f", percent);
  877. }
  878. printf(" : ");
  879. br = block_range__find(addr);
  880. color_fprintf(stdout, annotate__address_color(br), " %" PRIx64 ":", addr);
  881. color_fprintf(stdout, annotate__asm_color(br), "%s", dl->line);
  882. annotate__branch_printf(br, addr);
  883. printf("\n");
  884. if (ppercents != &percent)
  885. free(ppercents);
  886. if (psamples != &nr_samples)
  887. free(psamples);
  888. } else if (max_lines && printed >= max_lines)
  889. return 1;
  890. else {
  891. int width = 8;
  892. if (queue)
  893. return -1;
  894. if (perf_evsel__is_group_event(evsel))
  895. width *= evsel->nr_members;
  896. if (!*dl->line)
  897. printf(" %*s:\n", width, " ");
  898. else
  899. printf(" %*s: %s\n", width, " ", dl->line);
  900. }
  901. return 0;
  902. }
  903. /*
  904. * symbol__parse_objdump_line() parses objdump output (with -d --no-show-raw)
  905. * which looks like following
  906. *
  907. * 0000000000415500 <_init>:
  908. * 415500: sub $0x8,%rsp
  909. * 415504: mov 0x2f5ad5(%rip),%rax # 70afe0 <_DYNAMIC+0x2f8>
  910. * 41550b: test %rax,%rax
  911. * 41550e: je 415515 <_init+0x15>
  912. * 415510: callq 416e70 <__gmon_start__@plt>
  913. * 415515: add $0x8,%rsp
  914. * 415519: retq
  915. *
  916. * it will be parsed and saved into struct disasm_line as
  917. * <offset> <name> <ops.raw>
  918. *
  919. * The offset will be a relative offset from the start of the symbol and -1
  920. * means that it's not a disassembly line so should be treated differently.
  921. * The ops.raw part will be parsed further according to type of the instruction.
  922. */
  923. static int symbol__parse_objdump_line(struct symbol *sym, struct map *map,
  924. struct arch *arch,
  925. FILE *file, size_t privsize,
  926. int *line_nr)
  927. {
  928. struct annotation *notes = symbol__annotation(sym);
  929. struct disasm_line *dl;
  930. char *line = NULL, *parsed_line, *tmp, *tmp2;
  931. size_t line_len;
  932. s64 line_ip, offset = -1;
  933. regmatch_t match[2];
  934. if (getline(&line, &line_len, file) < 0)
  935. return -1;
  936. if (!line)
  937. return -1;
  938. line_ip = -1;
  939. parsed_line = rtrim(line);
  940. /* /filename:linenr ? Save line number and ignore. */
  941. if (regexec(&file_lineno, parsed_line, 2, match, 0) == 0) {
  942. *line_nr = atoi(parsed_line + match[1].rm_so);
  943. return 0;
  944. }
  945. tmp = ltrim(parsed_line);
  946. if (*tmp) {
  947. /*
  948. * Parse hexa addresses followed by ':'
  949. */
  950. line_ip = strtoull(tmp, &tmp2, 16);
  951. if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
  952. line_ip = -1;
  953. }
  954. if (line_ip != -1) {
  955. u64 start = map__rip_2objdump(map, sym->start),
  956. end = map__rip_2objdump(map, sym->end);
  957. offset = line_ip - start;
  958. if ((u64)line_ip < start || (u64)line_ip >= end)
  959. offset = -1;
  960. else
  961. parsed_line = tmp2 + 1;
  962. }
  963. dl = disasm_line__new(offset, parsed_line, privsize, *line_nr, arch, map);
  964. free(line);
  965. (*line_nr)++;
  966. if (dl == NULL)
  967. return -1;
  968. if (!disasm_line__has_offset(dl)) {
  969. dl->ops.target.offset = dl->ops.target.addr -
  970. map__rip_2objdump(map, sym->start);
  971. dl->ops.target.offset_avail = true;
  972. }
  973. /* kcore has no symbols, so add the call target name */
  974. if (dl->ins.ops && ins__is_call(&dl->ins) && !dl->ops.target.name) {
  975. struct addr_map_symbol target = {
  976. .map = map,
  977. .addr = dl->ops.target.addr,
  978. };
  979. if (!map_groups__find_ams(&target) &&
  980. target.sym->start == target.al_addr)
  981. dl->ops.target.name = strdup(target.sym->name);
  982. }
  983. disasm__add(&notes->src->source, dl);
  984. return 0;
  985. }
  986. static __attribute__((constructor)) void symbol__init_regexpr(void)
  987. {
  988. regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
  989. }
  990. static void delete_last_nop(struct symbol *sym)
  991. {
  992. struct annotation *notes = symbol__annotation(sym);
  993. struct list_head *list = &notes->src->source;
  994. struct disasm_line *dl;
  995. while (!list_empty(list)) {
  996. dl = list_entry(list->prev, struct disasm_line, node);
  997. if (dl->ins.ops) {
  998. if (dl->ins.ops != &nop_ops)
  999. return;
  1000. } else {
  1001. if (!strstr(dl->line, " nop ") &&
  1002. !strstr(dl->line, " nopl ") &&
  1003. !strstr(dl->line, " nopw "))
  1004. return;
  1005. }
  1006. list_del(&dl->node);
  1007. disasm_line__free(dl);
  1008. }
  1009. }
  1010. int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
  1011. int errnum, char *buf, size_t buflen)
  1012. {
  1013. struct dso *dso = map->dso;
  1014. BUG_ON(buflen == 0);
  1015. if (errnum >= 0) {
  1016. str_error_r(errnum, buf, buflen);
  1017. return 0;
  1018. }
  1019. switch (errnum) {
  1020. case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
  1021. char bf[SBUILD_ID_SIZE + 15] = " with build id ";
  1022. char *build_id_msg = NULL;
  1023. if (dso->has_build_id) {
  1024. build_id__sprintf(dso->build_id,
  1025. sizeof(dso->build_id), bf + 15);
  1026. build_id_msg = bf;
  1027. }
  1028. scnprintf(buf, buflen,
  1029. "No vmlinux file%s\nwas found in the path.\n\n"
  1030. "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
  1031. "Please use:\n\n"
  1032. " perf buildid-cache -vu vmlinux\n\n"
  1033. "or:\n\n"
  1034. " --vmlinux vmlinux\n", build_id_msg ?: "");
  1035. }
  1036. break;
  1037. default:
  1038. scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
  1039. break;
  1040. }
  1041. return 0;
  1042. }
  1043. static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
  1044. {
  1045. char linkname[PATH_MAX];
  1046. char *build_id_filename;
  1047. char *build_id_path = NULL;
  1048. if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
  1049. !dso__is_kcore(dso))
  1050. return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
  1051. build_id_filename = dso__build_id_filename(dso, NULL, 0);
  1052. if (build_id_filename) {
  1053. __symbol__join_symfs(filename, filename_size, build_id_filename);
  1054. free(build_id_filename);
  1055. } else {
  1056. if (dso->has_build_id)
  1057. return ENOMEM;
  1058. goto fallback;
  1059. }
  1060. build_id_path = strdup(filename);
  1061. if (!build_id_path)
  1062. return -1;
  1063. dirname(build_id_path);
  1064. if (dso__is_kcore(dso) ||
  1065. readlink(build_id_path, linkname, sizeof(linkname)) < 0 ||
  1066. strstr(linkname, DSO__NAME_KALLSYMS) ||
  1067. access(filename, R_OK)) {
  1068. fallback:
  1069. /*
  1070. * If we don't have build-ids or the build-id file isn't in the
  1071. * cache, or is just a kallsyms file, well, lets hope that this
  1072. * DSO is the same as when 'perf record' ran.
  1073. */
  1074. __symbol__join_symfs(filename, filename_size, dso->long_name);
  1075. }
  1076. free(build_id_path);
  1077. return 0;
  1078. }
  1079. static const char *annotate__norm_arch(const char *arch_name)
  1080. {
  1081. struct utsname uts;
  1082. if (!arch_name) { /* Assume we are annotating locally. */
  1083. if (uname(&uts) < 0)
  1084. return NULL;
  1085. arch_name = uts.machine;
  1086. }
  1087. return normalize_arch((char *)arch_name);
  1088. }
  1089. int symbol__disassemble(struct symbol *sym, struct map *map, const char *arch_name, size_t privsize)
  1090. {
  1091. struct dso *dso = map->dso;
  1092. char command[PATH_MAX * 2];
  1093. struct arch *arch = NULL;
  1094. FILE *file;
  1095. char symfs_filename[PATH_MAX];
  1096. struct kcore_extract kce;
  1097. bool delete_extract = false;
  1098. int stdout_fd[2];
  1099. int lineno = 0;
  1100. int nline;
  1101. pid_t pid;
  1102. int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
  1103. if (err)
  1104. return err;
  1105. arch_name = annotate__norm_arch(arch_name);
  1106. if (!arch_name)
  1107. return -1;
  1108. arch = arch__find(arch_name);
  1109. if (arch == NULL)
  1110. return -ENOTSUP;
  1111. if (arch->init) {
  1112. err = arch->init(arch);
  1113. if (err) {
  1114. pr_err("%s: failed to initialize %s arch priv area\n", __func__, arch->name);
  1115. return err;
  1116. }
  1117. }
  1118. pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
  1119. symfs_filename, sym->name, map->unmap_ip(map, sym->start),
  1120. map->unmap_ip(map, sym->end));
  1121. pr_debug("annotating [%p] %30s : [%p] %30s\n",
  1122. dso, dso->long_name, sym, sym->name);
  1123. if (dso__is_kcore(dso)) {
  1124. kce.kcore_filename = symfs_filename;
  1125. kce.addr = map__rip_2objdump(map, sym->start);
  1126. kce.offs = sym->start;
  1127. kce.len = sym->end - sym->start;
  1128. if (!kcore_extract__create(&kce)) {
  1129. delete_extract = true;
  1130. strlcpy(symfs_filename, kce.extract_filename,
  1131. sizeof(symfs_filename));
  1132. }
  1133. } else if (dso__needs_decompress(dso)) {
  1134. char tmp[PATH_MAX];
  1135. struct kmod_path m;
  1136. int fd;
  1137. bool ret;
  1138. if (kmod_path__parse_ext(&m, symfs_filename))
  1139. goto out;
  1140. snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
  1141. fd = mkstemp(tmp);
  1142. if (fd < 0) {
  1143. free(m.ext);
  1144. goto out;
  1145. }
  1146. ret = decompress_to_file(m.ext, symfs_filename, fd);
  1147. if (ret)
  1148. pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
  1149. free(m.ext);
  1150. close(fd);
  1151. if (!ret)
  1152. goto out;
  1153. strcpy(symfs_filename, tmp);
  1154. }
  1155. snprintf(command, sizeof(command),
  1156. "%s %s%s --start-address=0x%016" PRIx64
  1157. " --stop-address=0x%016" PRIx64
  1158. " -l -d %s %s -C %s 2>/dev/null|grep -v %s:|expand",
  1159. objdump_path ? objdump_path : "objdump",
  1160. disassembler_style ? "-M " : "",
  1161. disassembler_style ? disassembler_style : "",
  1162. map__rip_2objdump(map, sym->start),
  1163. map__rip_2objdump(map, sym->end),
  1164. symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
  1165. symbol_conf.annotate_src ? "-S" : "",
  1166. symfs_filename, symfs_filename);
  1167. pr_debug("Executing: %s\n", command);
  1168. err = -1;
  1169. if (pipe(stdout_fd) < 0) {
  1170. pr_err("Failure creating the pipe to run %s\n", command);
  1171. goto out_remove_tmp;
  1172. }
  1173. pid = fork();
  1174. if (pid < 0) {
  1175. pr_err("Failure forking to run %s\n", command);
  1176. goto out_close_stdout;
  1177. }
  1178. if (pid == 0) {
  1179. close(stdout_fd[0]);
  1180. dup2(stdout_fd[1], 1);
  1181. close(stdout_fd[1]);
  1182. execl("/bin/sh", "sh", "-c", command, NULL);
  1183. perror(command);
  1184. exit(-1);
  1185. }
  1186. close(stdout_fd[1]);
  1187. file = fdopen(stdout_fd[0], "r");
  1188. if (!file) {
  1189. pr_err("Failure creating FILE stream for %s\n", command);
  1190. /*
  1191. * If we were using debug info should retry with
  1192. * original binary.
  1193. */
  1194. goto out_remove_tmp;
  1195. }
  1196. nline = 0;
  1197. while (!feof(file)) {
  1198. /*
  1199. * The source code line number (lineno) needs to be kept in
  1200. * accross calls to symbol__parse_objdump_line(), so that it
  1201. * can associate it with the instructions till the next one.
  1202. * See disasm_line__new() and struct disasm_line::line_nr.
  1203. */
  1204. if (symbol__parse_objdump_line(sym, map, arch, file, privsize,
  1205. &lineno) < 0)
  1206. break;
  1207. nline++;
  1208. }
  1209. if (nline == 0)
  1210. pr_err("No output from %s\n", command);
  1211. /*
  1212. * kallsyms does not have symbol sizes so there may a nop at the end.
  1213. * Remove it.
  1214. */
  1215. if (dso__is_kcore(dso))
  1216. delete_last_nop(sym);
  1217. fclose(file);
  1218. err = 0;
  1219. out_remove_tmp:
  1220. close(stdout_fd[0]);
  1221. if (dso__needs_decompress(dso))
  1222. unlink(symfs_filename);
  1223. if (delete_extract)
  1224. kcore_extract__delete(&kce);
  1225. out:
  1226. return err;
  1227. out_close_stdout:
  1228. close(stdout_fd[1]);
  1229. goto out_remove_tmp;
  1230. }
  1231. static void insert_source_line(struct rb_root *root, struct source_line *src_line)
  1232. {
  1233. struct source_line *iter;
  1234. struct rb_node **p = &root->rb_node;
  1235. struct rb_node *parent = NULL;
  1236. int i, ret;
  1237. while (*p != NULL) {
  1238. parent = *p;
  1239. iter = rb_entry(parent, struct source_line, node);
  1240. ret = strcmp(iter->path, src_line->path);
  1241. if (ret == 0) {
  1242. for (i = 0; i < src_line->nr_pcnt; i++)
  1243. iter->samples[i].percent_sum += src_line->samples[i].percent;
  1244. return;
  1245. }
  1246. if (ret < 0)
  1247. p = &(*p)->rb_left;
  1248. else
  1249. p = &(*p)->rb_right;
  1250. }
  1251. for (i = 0; i < src_line->nr_pcnt; i++)
  1252. src_line->samples[i].percent_sum = src_line->samples[i].percent;
  1253. rb_link_node(&src_line->node, parent, p);
  1254. rb_insert_color(&src_line->node, root);
  1255. }
  1256. static int cmp_source_line(struct source_line *a, struct source_line *b)
  1257. {
  1258. int i;
  1259. for (i = 0; i < a->nr_pcnt; i++) {
  1260. if (a->samples[i].percent_sum == b->samples[i].percent_sum)
  1261. continue;
  1262. return a->samples[i].percent_sum > b->samples[i].percent_sum;
  1263. }
  1264. return 0;
  1265. }
  1266. static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
  1267. {
  1268. struct source_line *iter;
  1269. struct rb_node **p = &root->rb_node;
  1270. struct rb_node *parent = NULL;
  1271. while (*p != NULL) {
  1272. parent = *p;
  1273. iter = rb_entry(parent, struct source_line, node);
  1274. if (cmp_source_line(src_line, iter))
  1275. p = &(*p)->rb_left;
  1276. else
  1277. p = &(*p)->rb_right;
  1278. }
  1279. rb_link_node(&src_line->node, parent, p);
  1280. rb_insert_color(&src_line->node, root);
  1281. }
  1282. static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
  1283. {
  1284. struct source_line *src_line;
  1285. struct rb_node *node;
  1286. node = rb_first(src_root);
  1287. while (node) {
  1288. struct rb_node *next;
  1289. src_line = rb_entry(node, struct source_line, node);
  1290. next = rb_next(node);
  1291. rb_erase(node, src_root);
  1292. __resort_source_line(dest_root, src_line);
  1293. node = next;
  1294. }
  1295. }
  1296. static void symbol__free_source_line(struct symbol *sym, int len)
  1297. {
  1298. struct annotation *notes = symbol__annotation(sym);
  1299. struct source_line *src_line = notes->src->lines;
  1300. size_t sizeof_src_line;
  1301. int i;
  1302. sizeof_src_line = sizeof(*src_line) +
  1303. (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
  1304. for (i = 0; i < len; i++) {
  1305. free_srcline(src_line->path);
  1306. src_line = (void *)src_line + sizeof_src_line;
  1307. }
  1308. zfree(&notes->src->lines);
  1309. }
  1310. /* Get the filename:line for the colored entries */
  1311. static int symbol__get_source_line(struct symbol *sym, struct map *map,
  1312. struct perf_evsel *evsel,
  1313. struct rb_root *root, int len)
  1314. {
  1315. u64 start;
  1316. int i, k;
  1317. int evidx = evsel->idx;
  1318. struct source_line *src_line;
  1319. struct annotation *notes = symbol__annotation(sym);
  1320. struct sym_hist *h = annotation__histogram(notes, evidx);
  1321. struct rb_root tmp_root = RB_ROOT;
  1322. int nr_pcnt = 1;
  1323. u64 h_sum = h->sum;
  1324. size_t sizeof_src_line = sizeof(struct source_line);
  1325. if (perf_evsel__is_group_event(evsel)) {
  1326. for (i = 1; i < evsel->nr_members; i++) {
  1327. h = annotation__histogram(notes, evidx + i);
  1328. h_sum += h->sum;
  1329. }
  1330. nr_pcnt = evsel->nr_members;
  1331. sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
  1332. }
  1333. if (!h_sum)
  1334. return 0;
  1335. src_line = notes->src->lines = calloc(len, sizeof_src_line);
  1336. if (!notes->src->lines)
  1337. return -1;
  1338. start = map__rip_2objdump(map, sym->start);
  1339. for (i = 0; i < len; i++) {
  1340. u64 offset, nr_samples;
  1341. double percent_max = 0.0;
  1342. src_line->nr_pcnt = nr_pcnt;
  1343. for (k = 0; k < nr_pcnt; k++) {
  1344. double percent = 0.0;
  1345. h = annotation__histogram(notes, evidx + k);
  1346. nr_samples = h->addr[i];
  1347. if (h->sum)
  1348. percent = 100.0 * nr_samples / h->sum;
  1349. if (percent > percent_max)
  1350. percent_max = percent;
  1351. src_line->samples[k].percent = percent;
  1352. src_line->samples[k].nr = nr_samples;
  1353. }
  1354. if (percent_max <= 0.5)
  1355. goto next;
  1356. offset = start + i;
  1357. src_line->path = get_srcline(map->dso, offset, NULL,
  1358. false, true);
  1359. insert_source_line(&tmp_root, src_line);
  1360. next:
  1361. src_line = (void *)src_line + sizeof_src_line;
  1362. }
  1363. resort_source_line(root, &tmp_root);
  1364. return 0;
  1365. }
  1366. static void print_summary(struct rb_root *root, const char *filename)
  1367. {
  1368. struct source_line *src_line;
  1369. struct rb_node *node;
  1370. printf("\nSorted summary for file %s\n", filename);
  1371. printf("----------------------------------------------\n\n");
  1372. if (RB_EMPTY_ROOT(root)) {
  1373. printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
  1374. return;
  1375. }
  1376. node = rb_first(root);
  1377. while (node) {
  1378. double percent, percent_max = 0.0;
  1379. const char *color;
  1380. char *path;
  1381. int i;
  1382. src_line = rb_entry(node, struct source_line, node);
  1383. for (i = 0; i < src_line->nr_pcnt; i++) {
  1384. percent = src_line->samples[i].percent_sum;
  1385. color = get_percent_color(percent);
  1386. color_fprintf(stdout, color, " %7.2f", percent);
  1387. if (percent > percent_max)
  1388. percent_max = percent;
  1389. }
  1390. path = src_line->path;
  1391. color = get_percent_color(percent_max);
  1392. color_fprintf(stdout, color, " %s\n", path);
  1393. node = rb_next(node);
  1394. }
  1395. }
  1396. static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
  1397. {
  1398. struct annotation *notes = symbol__annotation(sym);
  1399. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1400. u64 len = symbol__size(sym), offset;
  1401. for (offset = 0; offset < len; ++offset)
  1402. if (h->addr[offset] != 0)
  1403. printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
  1404. sym->start + offset, h->addr[offset]);
  1405. printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
  1406. }
  1407. int symbol__annotate_printf(struct symbol *sym, struct map *map,
  1408. struct perf_evsel *evsel, bool full_paths,
  1409. int min_pcnt, int max_lines, int context)
  1410. {
  1411. struct dso *dso = map->dso;
  1412. char *filename;
  1413. const char *d_filename;
  1414. const char *evsel_name = perf_evsel__name(evsel);
  1415. struct annotation *notes = symbol__annotation(sym);
  1416. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1417. struct disasm_line *pos, *queue = NULL;
  1418. u64 start = map__rip_2objdump(map, sym->start);
  1419. int printed = 2, queue_len = 0;
  1420. int more = 0;
  1421. u64 len;
  1422. int width = 8;
  1423. int graph_dotted_len;
  1424. filename = strdup(dso->long_name);
  1425. if (!filename)
  1426. return -ENOMEM;
  1427. if (full_paths)
  1428. d_filename = filename;
  1429. else
  1430. d_filename = basename(filename);
  1431. len = symbol__size(sym);
  1432. if (perf_evsel__is_group_event(evsel))
  1433. width *= evsel->nr_members;
  1434. graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
  1435. width, width, "Percent", d_filename, evsel_name, h->sum);
  1436. printf("%-*.*s----\n",
  1437. graph_dotted_len, graph_dotted_len, graph_dotted_line);
  1438. if (verbose > 0)
  1439. symbol__annotate_hits(sym, evsel);
  1440. list_for_each_entry(pos, &notes->src->source, node) {
  1441. if (context && queue == NULL) {
  1442. queue = pos;
  1443. queue_len = 0;
  1444. }
  1445. switch (disasm_line__print(pos, sym, start, evsel, len,
  1446. min_pcnt, printed, max_lines,
  1447. queue)) {
  1448. case 0:
  1449. ++printed;
  1450. if (context) {
  1451. printed += queue_len;
  1452. queue = NULL;
  1453. queue_len = 0;
  1454. }
  1455. break;
  1456. case 1:
  1457. /* filtered by max_lines */
  1458. ++more;
  1459. break;
  1460. case -1:
  1461. default:
  1462. /*
  1463. * Filtered by min_pcnt or non IP lines when
  1464. * context != 0
  1465. */
  1466. if (!context)
  1467. break;
  1468. if (queue_len == context)
  1469. queue = list_entry(queue->node.next, typeof(*queue), node);
  1470. else
  1471. ++queue_len;
  1472. break;
  1473. }
  1474. }
  1475. free(filename);
  1476. return more;
  1477. }
  1478. void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
  1479. {
  1480. struct annotation *notes = symbol__annotation(sym);
  1481. struct sym_hist *h = annotation__histogram(notes, evidx);
  1482. memset(h, 0, notes->src->sizeof_sym_hist);
  1483. }
  1484. void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
  1485. {
  1486. struct annotation *notes = symbol__annotation(sym);
  1487. struct sym_hist *h = annotation__histogram(notes, evidx);
  1488. int len = symbol__size(sym), offset;
  1489. h->sum = 0;
  1490. for (offset = 0; offset < len; ++offset) {
  1491. h->addr[offset] = h->addr[offset] * 7 / 8;
  1492. h->sum += h->addr[offset];
  1493. }
  1494. }
  1495. void disasm__purge(struct list_head *head)
  1496. {
  1497. struct disasm_line *pos, *n;
  1498. list_for_each_entry_safe(pos, n, head, node) {
  1499. list_del(&pos->node);
  1500. disasm_line__free(pos);
  1501. }
  1502. }
  1503. static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
  1504. {
  1505. size_t printed;
  1506. if (dl->offset == -1)
  1507. return fprintf(fp, "%s\n", dl->line);
  1508. printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->ins.name);
  1509. if (dl->ops.raw[0] != '\0') {
  1510. printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
  1511. dl->ops.raw);
  1512. }
  1513. return printed + fprintf(fp, "\n");
  1514. }
  1515. size_t disasm__fprintf(struct list_head *head, FILE *fp)
  1516. {
  1517. struct disasm_line *pos;
  1518. size_t printed = 0;
  1519. list_for_each_entry(pos, head, node)
  1520. printed += disasm_line__fprintf(pos, fp);
  1521. return printed;
  1522. }
  1523. int symbol__tty_annotate(struct symbol *sym, struct map *map,
  1524. struct perf_evsel *evsel, bool print_lines,
  1525. bool full_paths, int min_pcnt, int max_lines)
  1526. {
  1527. struct dso *dso = map->dso;
  1528. struct rb_root source_line = RB_ROOT;
  1529. u64 len;
  1530. if (symbol__disassemble(sym, map, perf_evsel__env_arch(evsel), 0) < 0)
  1531. return -1;
  1532. len = symbol__size(sym);
  1533. if (print_lines) {
  1534. srcline_full_filename = full_paths;
  1535. symbol__get_source_line(sym, map, evsel, &source_line, len);
  1536. print_summary(&source_line, dso->long_name);
  1537. }
  1538. symbol__annotate_printf(sym, map, evsel, full_paths,
  1539. min_pcnt, max_lines, 0);
  1540. if (print_lines)
  1541. symbol__free_source_line(sym, len);
  1542. disasm__purge(&symbol__annotation(sym)->src->source);
  1543. return 0;
  1544. }
  1545. bool ui__has_annotation(void)
  1546. {
  1547. return use_browser == 1 && perf_hpp_list.sym;
  1548. }