annotate.c 44 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926
  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. static void ins__delete(struct ins_operands *ops)
  117. {
  118. if (ops == NULL)
  119. return;
  120. zfree(&ops->source.raw);
  121. zfree(&ops->source.name);
  122. zfree(&ops->target.raw);
  123. zfree(&ops->target.name);
  124. }
  125. static int ins__raw_scnprintf(struct ins *ins, char *bf, size_t size,
  126. struct ins_operands *ops)
  127. {
  128. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->raw);
  129. }
  130. int ins__scnprintf(struct ins *ins, char *bf, size_t size,
  131. struct ins_operands *ops)
  132. {
  133. if (ins->ops->scnprintf)
  134. return ins->ops->scnprintf(ins, bf, size, ops);
  135. return ins__raw_scnprintf(ins, bf, size, ops);
  136. }
  137. static int call__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  138. {
  139. char *endptr, *tok, *name;
  140. ops->target.addr = strtoull(ops->raw, &endptr, 16);
  141. name = strchr(endptr, '<');
  142. if (name == NULL)
  143. goto indirect_call;
  144. name++;
  145. if (arch->objdump.skip_functions_char &&
  146. strchr(name, arch->objdump.skip_functions_char))
  147. return -1;
  148. tok = strchr(name, '>');
  149. if (tok == NULL)
  150. return -1;
  151. *tok = '\0';
  152. ops->target.name = strdup(name);
  153. *tok = '>';
  154. return ops->target.name == NULL ? -1 : 0;
  155. indirect_call:
  156. tok = strchr(endptr, '*');
  157. if (tok == NULL) {
  158. struct symbol *sym = map__find_symbol(map, map->map_ip(map, ops->target.addr));
  159. if (sym != NULL)
  160. ops->target.name = strdup(sym->name);
  161. else
  162. ops->target.addr = 0;
  163. return 0;
  164. }
  165. ops->target.addr = strtoull(tok + 1, NULL, 16);
  166. return 0;
  167. }
  168. static int call__scnprintf(struct ins *ins, char *bf, size_t size,
  169. struct ins_operands *ops)
  170. {
  171. if (ops->target.name)
  172. return scnprintf(bf, size, "%-6.6s %s", ins->name, ops->target.name);
  173. if (ops->target.addr == 0)
  174. return ins__raw_scnprintf(ins, bf, size, ops);
  175. return scnprintf(bf, size, "%-6.6s *%" PRIx64, ins->name, ops->target.addr);
  176. }
  177. static struct ins_ops call_ops = {
  178. .parse = call__parse,
  179. .scnprintf = call__scnprintf,
  180. };
  181. bool ins__is_call(const struct ins *ins)
  182. {
  183. return ins->ops == &call_ops;
  184. }
  185. static int jump__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  186. {
  187. const char *s = strchr(ops->raw, '+');
  188. const char *c = strchr(ops->raw, ',');
  189. if (c++ != NULL)
  190. ops->target.addr = strtoull(c, NULL, 16);
  191. else
  192. ops->target.addr = strtoull(ops->raw, NULL, 16);
  193. if (s++ != NULL) {
  194. ops->target.offset = strtoull(s, NULL, 16);
  195. ops->target.offset_avail = true;
  196. } else {
  197. ops->target.offset_avail = false;
  198. }
  199. return 0;
  200. }
  201. static int jump__scnprintf(struct ins *ins, char *bf, size_t size,
  202. struct ins_operands *ops)
  203. {
  204. if (!ops->target.addr || ops->target.offset < 0)
  205. return ins__raw_scnprintf(ins, bf, size, ops);
  206. return scnprintf(bf, size, "%-6.6s %" PRIx64, ins->name, ops->target.offset);
  207. }
  208. static struct ins_ops jump_ops = {
  209. .parse = jump__parse,
  210. .scnprintf = jump__scnprintf,
  211. };
  212. bool ins__is_jump(const struct ins *ins)
  213. {
  214. return ins->ops == &jump_ops;
  215. }
  216. static int comment__symbol(char *raw, char *comment, u64 *addrp, char **namep)
  217. {
  218. char *endptr, *name, *t;
  219. if (strstr(raw, "(%rip)") == NULL)
  220. return 0;
  221. *addrp = strtoull(comment, &endptr, 16);
  222. name = strchr(endptr, '<');
  223. if (name == NULL)
  224. return -1;
  225. name++;
  226. t = strchr(name, '>');
  227. if (t == NULL)
  228. return 0;
  229. *t = '\0';
  230. *namep = strdup(name);
  231. *t = '>';
  232. return 0;
  233. }
  234. static int lock__parse(struct arch *arch, struct ins_operands *ops, struct map *map)
  235. {
  236. ops->locked.ops = zalloc(sizeof(*ops->locked.ops));
  237. if (ops->locked.ops == NULL)
  238. return 0;
  239. if (disasm_line__parse(ops->raw, &ops->locked.ins.name, &ops->locked.ops->raw) < 0)
  240. goto out_free_ops;
  241. ops->locked.ins.ops = ins__find(arch, ops->locked.ins.name);
  242. if (ops->locked.ins.ops == NULL)
  243. goto out_free_ops;
  244. if (ops->locked.ins.ops->parse &&
  245. ops->locked.ins.ops->parse(arch, ops->locked.ops, map) < 0)
  246. goto out_free_ops;
  247. return 0;
  248. out_free_ops:
  249. zfree(&ops->locked.ops);
  250. return 0;
  251. }
  252. static int lock__scnprintf(struct ins *ins, char *bf, size_t size,
  253. struct ins_operands *ops)
  254. {
  255. int printed;
  256. if (ops->locked.ins.ops == NULL)
  257. return ins__raw_scnprintf(ins, bf, size, ops);
  258. printed = scnprintf(bf, size, "%-6.6s ", ins->name);
  259. return printed + ins__scnprintf(&ops->locked.ins, bf + printed,
  260. size - printed, ops->locked.ops);
  261. }
  262. static void lock__delete(struct ins_operands *ops)
  263. {
  264. struct ins *ins = &ops->locked.ins;
  265. if (ins->ops && ins->ops->free)
  266. ins->ops->free(ops->locked.ops);
  267. else
  268. ins__delete(ops->locked.ops);
  269. zfree(&ops->locked.ops);
  270. zfree(&ops->target.raw);
  271. zfree(&ops->target.name);
  272. }
  273. static struct ins_ops lock_ops = {
  274. .free = lock__delete,
  275. .parse = lock__parse,
  276. .scnprintf = lock__scnprintf,
  277. };
  278. static int mov__parse(struct arch *arch, struct ins_operands *ops, struct map *map __maybe_unused)
  279. {
  280. char *s = strchr(ops->raw, ','), *target, *comment, prev;
  281. if (s == NULL)
  282. return -1;
  283. *s = '\0';
  284. ops->source.raw = strdup(ops->raw);
  285. *s = ',';
  286. if (ops->source.raw == NULL)
  287. return -1;
  288. target = ++s;
  289. comment = strchr(s, arch->objdump.comment_char);
  290. if (comment != NULL)
  291. s = comment - 1;
  292. else
  293. s = strchr(s, '\0') - 1;
  294. while (s > target && isspace(s[0]))
  295. --s;
  296. s++;
  297. prev = *s;
  298. *s = '\0';
  299. ops->target.raw = strdup(target);
  300. *s = prev;
  301. if (ops->target.raw == NULL)
  302. goto out_free_source;
  303. if (comment == NULL)
  304. return 0;
  305. while (comment[0] != '\0' && isspace(comment[0]))
  306. ++comment;
  307. comment__symbol(ops->source.raw, comment, &ops->source.addr, &ops->source.name);
  308. comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
  309. return 0;
  310. out_free_source:
  311. zfree(&ops->source.raw);
  312. return -1;
  313. }
  314. static int mov__scnprintf(struct ins *ins, char *bf, size_t size,
  315. struct ins_operands *ops)
  316. {
  317. return scnprintf(bf, size, "%-6.6s %s,%s", ins->name,
  318. ops->source.name ?: ops->source.raw,
  319. ops->target.name ?: ops->target.raw);
  320. }
  321. static struct ins_ops mov_ops = {
  322. .parse = mov__parse,
  323. .scnprintf = mov__scnprintf,
  324. };
  325. static int dec__parse(struct arch *arch __maybe_unused, struct ins_operands *ops, struct map *map __maybe_unused)
  326. {
  327. char *target, *comment, *s, prev;
  328. target = s = ops->raw;
  329. while (s[0] != '\0' && !isspace(s[0]))
  330. ++s;
  331. prev = *s;
  332. *s = '\0';
  333. ops->target.raw = strdup(target);
  334. *s = prev;
  335. if (ops->target.raw == NULL)
  336. return -1;
  337. comment = strchr(s, arch->objdump.comment_char);
  338. if (comment == NULL)
  339. return 0;
  340. while (comment[0] != '\0' && isspace(comment[0]))
  341. ++comment;
  342. comment__symbol(ops->target.raw, comment, &ops->target.addr, &ops->target.name);
  343. return 0;
  344. }
  345. static int dec__scnprintf(struct ins *ins, char *bf, size_t size,
  346. struct ins_operands *ops)
  347. {
  348. return scnprintf(bf, size, "%-6.6s %s", ins->name,
  349. ops->target.name ?: ops->target.raw);
  350. }
  351. static struct ins_ops dec_ops = {
  352. .parse = dec__parse,
  353. .scnprintf = dec__scnprintf,
  354. };
  355. static int nop__scnprintf(struct ins *ins __maybe_unused, char *bf, size_t size,
  356. struct ins_operands *ops __maybe_unused)
  357. {
  358. return scnprintf(bf, size, "%-6.6s", "nop");
  359. }
  360. static struct ins_ops nop_ops = {
  361. .scnprintf = nop__scnprintf,
  362. };
  363. static struct ins_ops ret_ops = {
  364. .scnprintf = ins__raw_scnprintf,
  365. };
  366. bool ins__is_ret(const struct ins *ins)
  367. {
  368. return ins->ops == &ret_ops;
  369. }
  370. static int ins__key_cmp(const void *name, const void *insp)
  371. {
  372. const struct ins *ins = insp;
  373. return strcmp(name, ins->name);
  374. }
  375. static int ins__cmp(const void *a, const void *b)
  376. {
  377. const struct ins *ia = a;
  378. const struct ins *ib = b;
  379. return strcmp(ia->name, ib->name);
  380. }
  381. static void ins__sort(struct arch *arch)
  382. {
  383. const int nmemb = arch->nr_instructions;
  384. qsort(arch->instructions, nmemb, sizeof(struct ins), ins__cmp);
  385. }
  386. static struct ins_ops *__ins__find(struct arch *arch, const char *name)
  387. {
  388. struct ins *ins;
  389. const int nmemb = arch->nr_instructions;
  390. if (!arch->sorted_instructions) {
  391. ins__sort(arch);
  392. arch->sorted_instructions = true;
  393. }
  394. ins = bsearch(name, arch->instructions, nmemb, sizeof(struct ins), ins__key_cmp);
  395. return ins ? ins->ops : NULL;
  396. }
  397. static struct ins_ops *ins__find(struct arch *arch, const char *name)
  398. {
  399. struct ins_ops *ops = __ins__find(arch, name);
  400. if (!ops && arch->associate_instruction_ops)
  401. ops = arch->associate_instruction_ops(arch, name);
  402. return ops;
  403. }
  404. static int arch__key_cmp(const void *name, const void *archp)
  405. {
  406. const struct arch *arch = archp;
  407. return strcmp(name, arch->name);
  408. }
  409. static int arch__cmp(const void *a, const void *b)
  410. {
  411. const struct arch *aa = a;
  412. const struct arch *ab = b;
  413. return strcmp(aa->name, ab->name);
  414. }
  415. static void arch__sort(void)
  416. {
  417. const int nmemb = ARRAY_SIZE(architectures);
  418. qsort(architectures, nmemb, sizeof(struct arch), arch__cmp);
  419. }
  420. static struct arch *arch__find(const char *name)
  421. {
  422. const int nmemb = ARRAY_SIZE(architectures);
  423. static bool sorted;
  424. if (!sorted) {
  425. arch__sort();
  426. sorted = true;
  427. }
  428. return bsearch(name, architectures, nmemb, sizeof(struct arch), arch__key_cmp);
  429. }
  430. int symbol__alloc_hist(struct symbol *sym)
  431. {
  432. struct annotation *notes = symbol__annotation(sym);
  433. const size_t size = symbol__size(sym);
  434. size_t sizeof_sym_hist;
  435. /* Check for overflow when calculating sizeof_sym_hist */
  436. if (size > (SIZE_MAX - sizeof(struct sym_hist)) / sizeof(u64))
  437. return -1;
  438. sizeof_sym_hist = (sizeof(struct sym_hist) + size * sizeof(u64));
  439. /* Check for overflow in zalloc argument */
  440. if (sizeof_sym_hist > (SIZE_MAX - sizeof(*notes->src))
  441. / symbol_conf.nr_events)
  442. return -1;
  443. notes->src = zalloc(sizeof(*notes->src) + symbol_conf.nr_events * sizeof_sym_hist);
  444. if (notes->src == NULL)
  445. return -1;
  446. notes->src->sizeof_sym_hist = sizeof_sym_hist;
  447. notes->src->nr_histograms = symbol_conf.nr_events;
  448. INIT_LIST_HEAD(&notes->src->source);
  449. return 0;
  450. }
  451. /* The cycles histogram is lazily allocated. */
  452. static int symbol__alloc_hist_cycles(struct symbol *sym)
  453. {
  454. struct annotation *notes = symbol__annotation(sym);
  455. const size_t size = symbol__size(sym);
  456. notes->src->cycles_hist = calloc(size, sizeof(struct cyc_hist));
  457. if (notes->src->cycles_hist == NULL)
  458. return -1;
  459. return 0;
  460. }
  461. void symbol__annotate_zero_histograms(struct symbol *sym)
  462. {
  463. struct annotation *notes = symbol__annotation(sym);
  464. pthread_mutex_lock(&notes->lock);
  465. if (notes->src != NULL) {
  466. memset(notes->src->histograms, 0,
  467. notes->src->nr_histograms * notes->src->sizeof_sym_hist);
  468. if (notes->src->cycles_hist)
  469. memset(notes->src->cycles_hist, 0,
  470. symbol__size(sym) * sizeof(struct cyc_hist));
  471. }
  472. pthread_mutex_unlock(&notes->lock);
  473. }
  474. static int __symbol__account_cycles(struct annotation *notes,
  475. u64 start,
  476. unsigned offset, unsigned cycles,
  477. unsigned have_start)
  478. {
  479. struct cyc_hist *ch;
  480. ch = notes->src->cycles_hist;
  481. /*
  482. * For now we can only account one basic block per
  483. * final jump. But multiple could be overlapping.
  484. * Always account the longest one. So when
  485. * a shorter one has been already seen throw it away.
  486. *
  487. * We separately always account the full cycles.
  488. */
  489. ch[offset].num_aggr++;
  490. ch[offset].cycles_aggr += cycles;
  491. if (!have_start && ch[offset].have_start)
  492. return 0;
  493. if (ch[offset].num) {
  494. if (have_start && (!ch[offset].have_start ||
  495. ch[offset].start > start)) {
  496. ch[offset].have_start = 0;
  497. ch[offset].cycles = 0;
  498. ch[offset].num = 0;
  499. if (ch[offset].reset < 0xffff)
  500. ch[offset].reset++;
  501. } else if (have_start &&
  502. ch[offset].start < start)
  503. return 0;
  504. }
  505. ch[offset].have_start = have_start;
  506. ch[offset].start = start;
  507. ch[offset].cycles += cycles;
  508. ch[offset].num++;
  509. return 0;
  510. }
  511. static int __symbol__inc_addr_samples(struct symbol *sym, struct map *map,
  512. struct annotation *notes, int evidx, u64 addr)
  513. {
  514. unsigned offset;
  515. struct sym_hist *h;
  516. pr_debug3("%s: addr=%#" PRIx64 "\n", __func__, map->unmap_ip(map, addr));
  517. if ((addr < sym->start || addr >= sym->end) &&
  518. (addr != sym->end || sym->start != sym->end)) {
  519. pr_debug("%s(%d): ERANGE! sym->name=%s, start=%#" PRIx64 ", addr=%#" PRIx64 ", end=%#" PRIx64 "\n",
  520. __func__, __LINE__, sym->name, sym->start, addr, sym->end);
  521. return -ERANGE;
  522. }
  523. offset = addr - sym->start;
  524. h = annotation__histogram(notes, evidx);
  525. h->sum++;
  526. h->addr[offset]++;
  527. pr_debug3("%#" PRIx64 " %s: period++ [addr: %#" PRIx64 ", %#" PRIx64
  528. ", evidx=%d] => %" PRIu64 "\n", sym->start, sym->name,
  529. addr, addr - sym->start, evidx, h->addr[offset]);
  530. return 0;
  531. }
  532. static struct annotation *symbol__get_annotation(struct symbol *sym, bool cycles)
  533. {
  534. struct annotation *notes = symbol__annotation(sym);
  535. if (notes->src == NULL) {
  536. if (symbol__alloc_hist(sym) < 0)
  537. return NULL;
  538. }
  539. if (!notes->src->cycles_hist && cycles) {
  540. if (symbol__alloc_hist_cycles(sym) < 0)
  541. return NULL;
  542. }
  543. return notes;
  544. }
  545. static int symbol__inc_addr_samples(struct symbol *sym, struct map *map,
  546. int evidx, u64 addr)
  547. {
  548. struct annotation *notes;
  549. if (sym == NULL)
  550. return 0;
  551. notes = symbol__get_annotation(sym, false);
  552. if (notes == NULL)
  553. return -ENOMEM;
  554. return __symbol__inc_addr_samples(sym, map, notes, evidx, addr);
  555. }
  556. static int symbol__account_cycles(u64 addr, u64 start,
  557. struct symbol *sym, unsigned cycles)
  558. {
  559. struct annotation *notes;
  560. unsigned offset;
  561. if (sym == NULL)
  562. return 0;
  563. notes = symbol__get_annotation(sym, true);
  564. if (notes == NULL)
  565. return -ENOMEM;
  566. if (addr < sym->start || addr >= sym->end)
  567. return -ERANGE;
  568. if (start) {
  569. if (start < sym->start || start >= sym->end)
  570. return -ERANGE;
  571. if (start >= addr)
  572. start = 0;
  573. }
  574. offset = addr - sym->start;
  575. return __symbol__account_cycles(notes,
  576. start ? start - sym->start : 0,
  577. offset, cycles,
  578. !!start);
  579. }
  580. int addr_map_symbol__account_cycles(struct addr_map_symbol *ams,
  581. struct addr_map_symbol *start,
  582. unsigned cycles)
  583. {
  584. u64 saddr = 0;
  585. int err;
  586. if (!cycles)
  587. return 0;
  588. /*
  589. * Only set start when IPC can be computed. We can only
  590. * compute it when the basic block is completely in a single
  591. * function.
  592. * Special case the case when the jump is elsewhere, but
  593. * it starts on the function start.
  594. */
  595. if (start &&
  596. (start->sym == ams->sym ||
  597. (ams->sym &&
  598. start->addr == ams->sym->start + ams->map->start)))
  599. saddr = start->al_addr;
  600. if (saddr == 0)
  601. pr_debug2("BB with bad start: addr %"PRIx64" start %"PRIx64" sym %"PRIx64" saddr %"PRIx64"\n",
  602. ams->addr,
  603. start ? start->addr : 0,
  604. ams->sym ? ams->sym->start + ams->map->start : 0,
  605. saddr);
  606. err = symbol__account_cycles(ams->al_addr, saddr, ams->sym, cycles);
  607. if (err)
  608. pr_debug2("account_cycles failed %d\n", err);
  609. return err;
  610. }
  611. int addr_map_symbol__inc_samples(struct addr_map_symbol *ams, int evidx)
  612. {
  613. return symbol__inc_addr_samples(ams->sym, ams->map, evidx, ams->al_addr);
  614. }
  615. int hist_entry__inc_addr_samples(struct hist_entry *he, int evidx, u64 ip)
  616. {
  617. return symbol__inc_addr_samples(he->ms.sym, he->ms.map, evidx, ip);
  618. }
  619. static void disasm_line__init_ins(struct disasm_line *dl, struct arch *arch, struct map *map)
  620. {
  621. dl->ins.ops = ins__find(arch, dl->ins.name);
  622. if (!dl->ins.ops)
  623. return;
  624. if (dl->ins.ops->parse && dl->ins.ops->parse(arch, &dl->ops, map) < 0)
  625. dl->ins.ops = NULL;
  626. }
  627. static int disasm_line__parse(char *line, const char **namep, char **rawp)
  628. {
  629. char *name = line, tmp;
  630. while (isspace(name[0]))
  631. ++name;
  632. if (name[0] == '\0')
  633. return -1;
  634. *rawp = name + 1;
  635. while ((*rawp)[0] != '\0' && !isspace((*rawp)[0]))
  636. ++*rawp;
  637. tmp = (*rawp)[0];
  638. (*rawp)[0] = '\0';
  639. *namep = strdup(name);
  640. if (*namep == NULL)
  641. goto out_free_name;
  642. (*rawp)[0] = tmp;
  643. if ((*rawp)[0] != '\0') {
  644. (*rawp)++;
  645. while (isspace((*rawp)[0]))
  646. ++(*rawp);
  647. }
  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, *c;
  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. while (line_len != 0 && isspace(line[line_len - 1]))
  939. line[--line_len] = '\0';
  940. c = strchr(line, '\n');
  941. if (c)
  942. *c = 0;
  943. line_ip = -1;
  944. parsed_line = line;
  945. /* /filename:linenr ? Save line number and ignore. */
  946. if (regexec(&file_lineno, line, 2, match, 0) == 0) {
  947. *line_nr = atoi(line + match[1].rm_so);
  948. return 0;
  949. }
  950. /*
  951. * Strip leading spaces:
  952. */
  953. tmp = line;
  954. while (*tmp) {
  955. if (*tmp != ' ')
  956. break;
  957. tmp++;
  958. }
  959. if (*tmp) {
  960. /*
  961. * Parse hexa addresses followed by ':'
  962. */
  963. line_ip = strtoull(tmp, &tmp2, 16);
  964. if (*tmp2 != ':' || tmp == tmp2 || tmp2[1] == '\0')
  965. line_ip = -1;
  966. }
  967. if (line_ip != -1) {
  968. u64 start = map__rip_2objdump(map, sym->start),
  969. end = map__rip_2objdump(map, sym->end);
  970. offset = line_ip - start;
  971. if ((u64)line_ip < start || (u64)line_ip >= end)
  972. offset = -1;
  973. else
  974. parsed_line = tmp2 + 1;
  975. }
  976. dl = disasm_line__new(offset, parsed_line, privsize, *line_nr, arch, map);
  977. free(line);
  978. (*line_nr)++;
  979. if (dl == NULL)
  980. return -1;
  981. if (!disasm_line__has_offset(dl)) {
  982. dl->ops.target.offset = dl->ops.target.addr -
  983. map__rip_2objdump(map, sym->start);
  984. dl->ops.target.offset_avail = true;
  985. }
  986. /* kcore has no symbols, so add the call target name */
  987. if (dl->ins.ops && ins__is_call(&dl->ins) && !dl->ops.target.name) {
  988. struct addr_map_symbol target = {
  989. .map = map,
  990. .addr = dl->ops.target.addr,
  991. };
  992. if (!map_groups__find_ams(&target) &&
  993. target.sym->start == target.al_addr)
  994. dl->ops.target.name = strdup(target.sym->name);
  995. }
  996. disasm__add(&notes->src->source, dl);
  997. return 0;
  998. }
  999. static __attribute__((constructor)) void symbol__init_regexpr(void)
  1000. {
  1001. regcomp(&file_lineno, "^/[^:]+:([0-9]+)", REG_EXTENDED);
  1002. }
  1003. static void delete_last_nop(struct symbol *sym)
  1004. {
  1005. struct annotation *notes = symbol__annotation(sym);
  1006. struct list_head *list = &notes->src->source;
  1007. struct disasm_line *dl;
  1008. while (!list_empty(list)) {
  1009. dl = list_entry(list->prev, struct disasm_line, node);
  1010. if (dl->ins.ops) {
  1011. if (dl->ins.ops != &nop_ops)
  1012. return;
  1013. } else {
  1014. if (!strstr(dl->line, " nop ") &&
  1015. !strstr(dl->line, " nopl ") &&
  1016. !strstr(dl->line, " nopw "))
  1017. return;
  1018. }
  1019. list_del(&dl->node);
  1020. disasm_line__free(dl);
  1021. }
  1022. }
  1023. int symbol__strerror_disassemble(struct symbol *sym __maybe_unused, struct map *map,
  1024. int errnum, char *buf, size_t buflen)
  1025. {
  1026. struct dso *dso = map->dso;
  1027. BUG_ON(buflen == 0);
  1028. if (errnum >= 0) {
  1029. str_error_r(errnum, buf, buflen);
  1030. return 0;
  1031. }
  1032. switch (errnum) {
  1033. case SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX: {
  1034. char bf[SBUILD_ID_SIZE + 15] = " with build id ";
  1035. char *build_id_msg = NULL;
  1036. if (dso->has_build_id) {
  1037. build_id__sprintf(dso->build_id,
  1038. sizeof(dso->build_id), bf + 15);
  1039. build_id_msg = bf;
  1040. }
  1041. scnprintf(buf, buflen,
  1042. "No vmlinux file%s\nwas found in the path.\n\n"
  1043. "Note that annotation using /proc/kcore requires CAP_SYS_RAWIO capability.\n\n"
  1044. "Please use:\n\n"
  1045. " perf buildid-cache -vu vmlinux\n\n"
  1046. "or:\n\n"
  1047. " --vmlinux vmlinux\n", build_id_msg ?: "");
  1048. }
  1049. break;
  1050. default:
  1051. scnprintf(buf, buflen, "Internal error: Invalid %d error code\n", errnum);
  1052. break;
  1053. }
  1054. return 0;
  1055. }
  1056. static int dso__disassemble_filename(struct dso *dso, char *filename, size_t filename_size)
  1057. {
  1058. char linkname[PATH_MAX];
  1059. char *build_id_filename;
  1060. char *build_id_path = NULL;
  1061. if (dso->symtab_type == DSO_BINARY_TYPE__KALLSYMS &&
  1062. !dso__is_kcore(dso))
  1063. return SYMBOL_ANNOTATE_ERRNO__NO_VMLINUX;
  1064. build_id_filename = dso__build_id_filename(dso, NULL, 0);
  1065. if (build_id_filename) {
  1066. __symbol__join_symfs(filename, filename_size, build_id_filename);
  1067. free(build_id_filename);
  1068. } else {
  1069. if (dso->has_build_id)
  1070. return ENOMEM;
  1071. goto fallback;
  1072. }
  1073. build_id_path = strdup(filename);
  1074. if (!build_id_path)
  1075. return -1;
  1076. dirname(build_id_path);
  1077. if (dso__is_kcore(dso) ||
  1078. readlink(build_id_path, linkname, sizeof(linkname)) < 0 ||
  1079. strstr(linkname, DSO__NAME_KALLSYMS) ||
  1080. access(filename, R_OK)) {
  1081. fallback:
  1082. /*
  1083. * If we don't have build-ids or the build-id file isn't in the
  1084. * cache, or is just a kallsyms file, well, lets hope that this
  1085. * DSO is the same as when 'perf record' ran.
  1086. */
  1087. __symbol__join_symfs(filename, filename_size, dso->long_name);
  1088. }
  1089. free(build_id_path);
  1090. return 0;
  1091. }
  1092. static const char *annotate__norm_arch(const char *arch_name)
  1093. {
  1094. struct utsname uts;
  1095. if (!arch_name) { /* Assume we are annotating locally. */
  1096. if (uname(&uts) < 0)
  1097. return NULL;
  1098. arch_name = uts.machine;
  1099. }
  1100. return normalize_arch((char *)arch_name);
  1101. }
  1102. int symbol__disassemble(struct symbol *sym, struct map *map, const char *arch_name, size_t privsize)
  1103. {
  1104. struct dso *dso = map->dso;
  1105. char command[PATH_MAX * 2];
  1106. struct arch *arch = NULL;
  1107. FILE *file;
  1108. char symfs_filename[PATH_MAX];
  1109. struct kcore_extract kce;
  1110. bool delete_extract = false;
  1111. int stdout_fd[2];
  1112. int lineno = 0;
  1113. int nline;
  1114. pid_t pid;
  1115. int err = dso__disassemble_filename(dso, symfs_filename, sizeof(symfs_filename));
  1116. if (err)
  1117. return err;
  1118. arch_name = annotate__norm_arch(arch_name);
  1119. if (!arch_name)
  1120. return -1;
  1121. arch = arch__find(arch_name);
  1122. if (arch == NULL)
  1123. return -ENOTSUP;
  1124. if (arch->init) {
  1125. err = arch->init(arch);
  1126. if (err) {
  1127. pr_err("%s: failed to initialize %s arch priv area\n", __func__, arch->name);
  1128. return err;
  1129. }
  1130. }
  1131. pr_debug("%s: filename=%s, sym=%s, start=%#" PRIx64 ", end=%#" PRIx64 "\n", __func__,
  1132. symfs_filename, sym->name, map->unmap_ip(map, sym->start),
  1133. map->unmap_ip(map, sym->end));
  1134. pr_debug("annotating [%p] %30s : [%p] %30s\n",
  1135. dso, dso->long_name, sym, sym->name);
  1136. if (dso__is_kcore(dso)) {
  1137. kce.kcore_filename = symfs_filename;
  1138. kce.addr = map__rip_2objdump(map, sym->start);
  1139. kce.offs = sym->start;
  1140. kce.len = sym->end - sym->start;
  1141. if (!kcore_extract__create(&kce)) {
  1142. delete_extract = true;
  1143. strlcpy(symfs_filename, kce.extract_filename,
  1144. sizeof(symfs_filename));
  1145. }
  1146. } else if (dso__needs_decompress(dso)) {
  1147. char tmp[PATH_MAX];
  1148. struct kmod_path m;
  1149. int fd;
  1150. bool ret;
  1151. if (kmod_path__parse_ext(&m, symfs_filename))
  1152. goto out;
  1153. snprintf(tmp, PATH_MAX, "/tmp/perf-kmod-XXXXXX");
  1154. fd = mkstemp(tmp);
  1155. if (fd < 0) {
  1156. free(m.ext);
  1157. goto out;
  1158. }
  1159. ret = decompress_to_file(m.ext, symfs_filename, fd);
  1160. if (ret)
  1161. pr_err("Cannot decompress %s %s\n", m.ext, symfs_filename);
  1162. free(m.ext);
  1163. close(fd);
  1164. if (!ret)
  1165. goto out;
  1166. strcpy(symfs_filename, tmp);
  1167. }
  1168. snprintf(command, sizeof(command),
  1169. "%s %s%s --start-address=0x%016" PRIx64
  1170. " --stop-address=0x%016" PRIx64
  1171. " -l -d %s %s -C %s 2>/dev/null|grep -v %s:|expand",
  1172. objdump_path ? objdump_path : "objdump",
  1173. disassembler_style ? "-M " : "",
  1174. disassembler_style ? disassembler_style : "",
  1175. map__rip_2objdump(map, sym->start),
  1176. map__rip_2objdump(map, sym->end),
  1177. symbol_conf.annotate_asm_raw ? "" : "--no-show-raw",
  1178. symbol_conf.annotate_src ? "-S" : "",
  1179. symfs_filename, symfs_filename);
  1180. pr_debug("Executing: %s\n", command);
  1181. err = -1;
  1182. if (pipe(stdout_fd) < 0) {
  1183. pr_err("Failure creating the pipe to run %s\n", command);
  1184. goto out_remove_tmp;
  1185. }
  1186. pid = fork();
  1187. if (pid < 0) {
  1188. pr_err("Failure forking to run %s\n", command);
  1189. goto out_close_stdout;
  1190. }
  1191. if (pid == 0) {
  1192. close(stdout_fd[0]);
  1193. dup2(stdout_fd[1], 1);
  1194. close(stdout_fd[1]);
  1195. execl("/bin/sh", "sh", "-c", command, NULL);
  1196. perror(command);
  1197. exit(-1);
  1198. }
  1199. close(stdout_fd[1]);
  1200. file = fdopen(stdout_fd[0], "r");
  1201. if (!file) {
  1202. pr_err("Failure creating FILE stream for %s\n", command);
  1203. /*
  1204. * If we were using debug info should retry with
  1205. * original binary.
  1206. */
  1207. goto out_remove_tmp;
  1208. }
  1209. nline = 0;
  1210. while (!feof(file)) {
  1211. /*
  1212. * The source code line number (lineno) needs to be kept in
  1213. * accross calls to symbol__parse_objdump_line(), so that it
  1214. * can associate it with the instructions till the next one.
  1215. * See disasm_line__new() and struct disasm_line::line_nr.
  1216. */
  1217. if (symbol__parse_objdump_line(sym, map, arch, file, privsize,
  1218. &lineno) < 0)
  1219. break;
  1220. nline++;
  1221. }
  1222. if (nline == 0)
  1223. pr_err("No output from %s\n", command);
  1224. /*
  1225. * kallsyms does not have symbol sizes so there may a nop at the end.
  1226. * Remove it.
  1227. */
  1228. if (dso__is_kcore(dso))
  1229. delete_last_nop(sym);
  1230. fclose(file);
  1231. err = 0;
  1232. out_remove_tmp:
  1233. close(stdout_fd[0]);
  1234. if (dso__needs_decompress(dso))
  1235. unlink(symfs_filename);
  1236. if (delete_extract)
  1237. kcore_extract__delete(&kce);
  1238. out:
  1239. return err;
  1240. out_close_stdout:
  1241. close(stdout_fd[1]);
  1242. goto out_remove_tmp;
  1243. }
  1244. static void insert_source_line(struct rb_root *root, struct source_line *src_line)
  1245. {
  1246. struct source_line *iter;
  1247. struct rb_node **p = &root->rb_node;
  1248. struct rb_node *parent = NULL;
  1249. int i, ret;
  1250. while (*p != NULL) {
  1251. parent = *p;
  1252. iter = rb_entry(parent, struct source_line, node);
  1253. ret = strcmp(iter->path, src_line->path);
  1254. if (ret == 0) {
  1255. for (i = 0; i < src_line->nr_pcnt; i++)
  1256. iter->samples[i].percent_sum += src_line->samples[i].percent;
  1257. return;
  1258. }
  1259. if (ret < 0)
  1260. p = &(*p)->rb_left;
  1261. else
  1262. p = &(*p)->rb_right;
  1263. }
  1264. for (i = 0; i < src_line->nr_pcnt; i++)
  1265. src_line->samples[i].percent_sum = src_line->samples[i].percent;
  1266. rb_link_node(&src_line->node, parent, p);
  1267. rb_insert_color(&src_line->node, root);
  1268. }
  1269. static int cmp_source_line(struct source_line *a, struct source_line *b)
  1270. {
  1271. int i;
  1272. for (i = 0; i < a->nr_pcnt; i++) {
  1273. if (a->samples[i].percent_sum == b->samples[i].percent_sum)
  1274. continue;
  1275. return a->samples[i].percent_sum > b->samples[i].percent_sum;
  1276. }
  1277. return 0;
  1278. }
  1279. static void __resort_source_line(struct rb_root *root, struct source_line *src_line)
  1280. {
  1281. struct source_line *iter;
  1282. struct rb_node **p = &root->rb_node;
  1283. struct rb_node *parent = NULL;
  1284. while (*p != NULL) {
  1285. parent = *p;
  1286. iter = rb_entry(parent, struct source_line, node);
  1287. if (cmp_source_line(src_line, iter))
  1288. p = &(*p)->rb_left;
  1289. else
  1290. p = &(*p)->rb_right;
  1291. }
  1292. rb_link_node(&src_line->node, parent, p);
  1293. rb_insert_color(&src_line->node, root);
  1294. }
  1295. static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
  1296. {
  1297. struct source_line *src_line;
  1298. struct rb_node *node;
  1299. node = rb_first(src_root);
  1300. while (node) {
  1301. struct rb_node *next;
  1302. src_line = rb_entry(node, struct source_line, node);
  1303. next = rb_next(node);
  1304. rb_erase(node, src_root);
  1305. __resort_source_line(dest_root, src_line);
  1306. node = next;
  1307. }
  1308. }
  1309. static void symbol__free_source_line(struct symbol *sym, int len)
  1310. {
  1311. struct annotation *notes = symbol__annotation(sym);
  1312. struct source_line *src_line = notes->src->lines;
  1313. size_t sizeof_src_line;
  1314. int i;
  1315. sizeof_src_line = sizeof(*src_line) +
  1316. (sizeof(src_line->samples) * (src_line->nr_pcnt - 1));
  1317. for (i = 0; i < len; i++) {
  1318. free_srcline(src_line->path);
  1319. src_line = (void *)src_line + sizeof_src_line;
  1320. }
  1321. zfree(&notes->src->lines);
  1322. }
  1323. /* Get the filename:line for the colored entries */
  1324. static int symbol__get_source_line(struct symbol *sym, struct map *map,
  1325. struct perf_evsel *evsel,
  1326. struct rb_root *root, int len)
  1327. {
  1328. u64 start;
  1329. int i, k;
  1330. int evidx = evsel->idx;
  1331. struct source_line *src_line;
  1332. struct annotation *notes = symbol__annotation(sym);
  1333. struct sym_hist *h = annotation__histogram(notes, evidx);
  1334. struct rb_root tmp_root = RB_ROOT;
  1335. int nr_pcnt = 1;
  1336. u64 h_sum = h->sum;
  1337. size_t sizeof_src_line = sizeof(struct source_line);
  1338. if (perf_evsel__is_group_event(evsel)) {
  1339. for (i = 1; i < evsel->nr_members; i++) {
  1340. h = annotation__histogram(notes, evidx + i);
  1341. h_sum += h->sum;
  1342. }
  1343. nr_pcnt = evsel->nr_members;
  1344. sizeof_src_line += (nr_pcnt - 1) * sizeof(src_line->samples);
  1345. }
  1346. if (!h_sum)
  1347. return 0;
  1348. src_line = notes->src->lines = calloc(len, sizeof_src_line);
  1349. if (!notes->src->lines)
  1350. return -1;
  1351. start = map__rip_2objdump(map, sym->start);
  1352. for (i = 0; i < len; i++) {
  1353. u64 offset;
  1354. double percent_max = 0.0;
  1355. src_line->nr_pcnt = nr_pcnt;
  1356. for (k = 0; k < nr_pcnt; k++) {
  1357. double percent = 0.0;
  1358. h = annotation__histogram(notes, evidx + k);
  1359. if (h->sum)
  1360. percent = 100.0 * h->addr[i] / h->sum;
  1361. if (percent > percent_max)
  1362. percent_max = percent;
  1363. src_line->samples[k].percent = percent;
  1364. }
  1365. if (percent_max <= 0.5)
  1366. goto next;
  1367. offset = start + i;
  1368. src_line->path = get_srcline(map->dso, offset, NULL,
  1369. false, true);
  1370. insert_source_line(&tmp_root, src_line);
  1371. next:
  1372. src_line = (void *)src_line + sizeof_src_line;
  1373. }
  1374. resort_source_line(root, &tmp_root);
  1375. return 0;
  1376. }
  1377. static void print_summary(struct rb_root *root, const char *filename)
  1378. {
  1379. struct source_line *src_line;
  1380. struct rb_node *node;
  1381. printf("\nSorted summary for file %s\n", filename);
  1382. printf("----------------------------------------------\n\n");
  1383. if (RB_EMPTY_ROOT(root)) {
  1384. printf(" Nothing higher than %1.1f%%\n", MIN_GREEN);
  1385. return;
  1386. }
  1387. node = rb_first(root);
  1388. while (node) {
  1389. double percent, percent_max = 0.0;
  1390. const char *color;
  1391. char *path;
  1392. int i;
  1393. src_line = rb_entry(node, struct source_line, node);
  1394. for (i = 0; i < src_line->nr_pcnt; i++) {
  1395. percent = src_line->samples[i].percent_sum;
  1396. color = get_percent_color(percent);
  1397. color_fprintf(stdout, color, " %7.2f", percent);
  1398. if (percent > percent_max)
  1399. percent_max = percent;
  1400. }
  1401. path = src_line->path;
  1402. color = get_percent_color(percent_max);
  1403. color_fprintf(stdout, color, " %s\n", path);
  1404. node = rb_next(node);
  1405. }
  1406. }
  1407. static void symbol__annotate_hits(struct symbol *sym, struct perf_evsel *evsel)
  1408. {
  1409. struct annotation *notes = symbol__annotation(sym);
  1410. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1411. u64 len = symbol__size(sym), offset;
  1412. for (offset = 0; offset < len; ++offset)
  1413. if (h->addr[offset] != 0)
  1414. printf("%*" PRIx64 ": %" PRIu64 "\n", BITS_PER_LONG / 2,
  1415. sym->start + offset, h->addr[offset]);
  1416. printf("%*s: %" PRIu64 "\n", BITS_PER_LONG / 2, "h->sum", h->sum);
  1417. }
  1418. int symbol__annotate_printf(struct symbol *sym, struct map *map,
  1419. struct perf_evsel *evsel, bool full_paths,
  1420. int min_pcnt, int max_lines, int context)
  1421. {
  1422. struct dso *dso = map->dso;
  1423. char *filename;
  1424. const char *d_filename;
  1425. const char *evsel_name = perf_evsel__name(evsel);
  1426. struct annotation *notes = symbol__annotation(sym);
  1427. struct sym_hist *h = annotation__histogram(notes, evsel->idx);
  1428. struct disasm_line *pos, *queue = NULL;
  1429. u64 start = map__rip_2objdump(map, sym->start);
  1430. int printed = 2, queue_len = 0;
  1431. int more = 0;
  1432. u64 len;
  1433. int width = 8;
  1434. int graph_dotted_len;
  1435. filename = strdup(dso->long_name);
  1436. if (!filename)
  1437. return -ENOMEM;
  1438. if (full_paths)
  1439. d_filename = filename;
  1440. else
  1441. d_filename = basename(filename);
  1442. len = symbol__size(sym);
  1443. if (perf_evsel__is_group_event(evsel))
  1444. width *= evsel->nr_members;
  1445. graph_dotted_len = printf(" %-*.*s| Source code & Disassembly of %s for %s (%" PRIu64 " samples)\n",
  1446. width, width, "Percent", d_filename, evsel_name, h->sum);
  1447. printf("%-*.*s----\n",
  1448. graph_dotted_len, graph_dotted_len, graph_dotted_line);
  1449. if (verbose > 0)
  1450. symbol__annotate_hits(sym, evsel);
  1451. list_for_each_entry(pos, &notes->src->source, node) {
  1452. if (context && queue == NULL) {
  1453. queue = pos;
  1454. queue_len = 0;
  1455. }
  1456. switch (disasm_line__print(pos, sym, start, evsel, len,
  1457. min_pcnt, printed, max_lines,
  1458. queue)) {
  1459. case 0:
  1460. ++printed;
  1461. if (context) {
  1462. printed += queue_len;
  1463. queue = NULL;
  1464. queue_len = 0;
  1465. }
  1466. break;
  1467. case 1:
  1468. /* filtered by max_lines */
  1469. ++more;
  1470. break;
  1471. case -1:
  1472. default:
  1473. /*
  1474. * Filtered by min_pcnt or non IP lines when
  1475. * context != 0
  1476. */
  1477. if (!context)
  1478. break;
  1479. if (queue_len == context)
  1480. queue = list_entry(queue->node.next, typeof(*queue), node);
  1481. else
  1482. ++queue_len;
  1483. break;
  1484. }
  1485. }
  1486. free(filename);
  1487. return more;
  1488. }
  1489. void symbol__annotate_zero_histogram(struct symbol *sym, int evidx)
  1490. {
  1491. struct annotation *notes = symbol__annotation(sym);
  1492. struct sym_hist *h = annotation__histogram(notes, evidx);
  1493. memset(h, 0, notes->src->sizeof_sym_hist);
  1494. }
  1495. void symbol__annotate_decay_histogram(struct symbol *sym, int evidx)
  1496. {
  1497. struct annotation *notes = symbol__annotation(sym);
  1498. struct sym_hist *h = annotation__histogram(notes, evidx);
  1499. int len = symbol__size(sym), offset;
  1500. h->sum = 0;
  1501. for (offset = 0; offset < len; ++offset) {
  1502. h->addr[offset] = h->addr[offset] * 7 / 8;
  1503. h->sum += h->addr[offset];
  1504. }
  1505. }
  1506. void disasm__purge(struct list_head *head)
  1507. {
  1508. struct disasm_line *pos, *n;
  1509. list_for_each_entry_safe(pos, n, head, node) {
  1510. list_del(&pos->node);
  1511. disasm_line__free(pos);
  1512. }
  1513. }
  1514. static size_t disasm_line__fprintf(struct disasm_line *dl, FILE *fp)
  1515. {
  1516. size_t printed;
  1517. if (dl->offset == -1)
  1518. return fprintf(fp, "%s\n", dl->line);
  1519. printed = fprintf(fp, "%#" PRIx64 " %s", dl->offset, dl->ins.name);
  1520. if (dl->ops.raw[0] != '\0') {
  1521. printed += fprintf(fp, "%.*s %s\n", 6 - (int)printed, " ",
  1522. dl->ops.raw);
  1523. }
  1524. return printed + fprintf(fp, "\n");
  1525. }
  1526. size_t disasm__fprintf(struct list_head *head, FILE *fp)
  1527. {
  1528. struct disasm_line *pos;
  1529. size_t printed = 0;
  1530. list_for_each_entry(pos, head, node)
  1531. printed += disasm_line__fprintf(pos, fp);
  1532. return printed;
  1533. }
  1534. int symbol__tty_annotate(struct symbol *sym, struct map *map,
  1535. struct perf_evsel *evsel, bool print_lines,
  1536. bool full_paths, int min_pcnt, int max_lines)
  1537. {
  1538. struct dso *dso = map->dso;
  1539. struct rb_root source_line = RB_ROOT;
  1540. u64 len;
  1541. if (symbol__disassemble(sym, map, perf_evsel__env_arch(evsel), 0) < 0)
  1542. return -1;
  1543. len = symbol__size(sym);
  1544. if (print_lines) {
  1545. srcline_full_filename = full_paths;
  1546. symbol__get_source_line(sym, map, evsel, &source_line, len);
  1547. print_summary(&source_line, dso->long_name);
  1548. }
  1549. symbol__annotate_printf(sym, map, evsel, full_paths,
  1550. min_pcnt, max_lines, 0);
  1551. if (print_lines)
  1552. symbol__free_source_line(sym, len);
  1553. disasm__purge(&symbol__annotation(sym)->src->source);
  1554. return 0;
  1555. }
  1556. bool ui__has_annotation(void)
  1557. {
  1558. return use_browser == 1 && perf_hpp_list.sym;
  1559. }