sort.c 60 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620
  1. #include <sys/mman.h>
  2. #include "sort.h"
  3. #include "hist.h"
  4. #include "comm.h"
  5. #include "symbol.h"
  6. #include "evsel.h"
  7. #include "evlist.h"
  8. #include <traceevent/event-parse.h>
  9. #include "mem-events.h"
  10. regex_t parent_regex;
  11. const char default_parent_pattern[] = "^sys_|^do_page_fault";
  12. const char *parent_pattern = default_parent_pattern;
  13. const char default_sort_order[] = "comm,dso,symbol";
  14. const char default_branch_sort_order[] = "comm,dso_from,symbol_from,symbol_to,cycles";
  15. const char default_mem_sort_order[] = "local_weight,mem,sym,dso,symbol_daddr,dso_daddr,snoop,tlb,locked";
  16. const char default_top_sort_order[] = "dso,symbol";
  17. const char default_diff_sort_order[] = "dso,symbol";
  18. const char default_tracepoint_sort_order[] = "trace";
  19. const char *sort_order;
  20. const char *field_order;
  21. regex_t ignore_callees_regex;
  22. int have_ignore_callees = 0;
  23. int sort__need_collapse = 0;
  24. int sort__has_parent = 0;
  25. int sort__has_sym = 0;
  26. int sort__has_dso = 0;
  27. int sort__has_socket = 0;
  28. int sort__has_thread = 0;
  29. enum sort_mode sort__mode = SORT_MODE__NORMAL;
  30. /*
  31. * Replaces all occurrences of a char used with the:
  32. *
  33. * -t, --field-separator
  34. *
  35. * option, that uses a special separator character and don't pad with spaces,
  36. * replacing all occurances of this separator in symbol names (and other
  37. * output) with a '.' character, that thus it's the only non valid separator.
  38. */
  39. static int repsep_snprintf(char *bf, size_t size, const char *fmt, ...)
  40. {
  41. int n;
  42. va_list ap;
  43. va_start(ap, fmt);
  44. n = vsnprintf(bf, size, fmt, ap);
  45. if (symbol_conf.field_sep && n > 0) {
  46. char *sep = bf;
  47. while (1) {
  48. sep = strchr(sep, *symbol_conf.field_sep);
  49. if (sep == NULL)
  50. break;
  51. *sep = '.';
  52. }
  53. }
  54. va_end(ap);
  55. if (n >= (int)size)
  56. return size - 1;
  57. return n;
  58. }
  59. static int64_t cmp_null(const void *l, const void *r)
  60. {
  61. if (!l && !r)
  62. return 0;
  63. else if (!l)
  64. return -1;
  65. else
  66. return 1;
  67. }
  68. /* --sort pid */
  69. static int64_t
  70. sort__thread_cmp(struct hist_entry *left, struct hist_entry *right)
  71. {
  72. return right->thread->tid - left->thread->tid;
  73. }
  74. static int hist_entry__thread_snprintf(struct hist_entry *he, char *bf,
  75. size_t size, unsigned int width)
  76. {
  77. const char *comm = thread__comm_str(he->thread);
  78. width = max(7U, width) - 6;
  79. return repsep_snprintf(bf, size, "%5d:%-*.*s", he->thread->tid,
  80. width, width, comm ?: "");
  81. }
  82. struct sort_entry sort_thread = {
  83. .se_header = " Pid:Command",
  84. .se_cmp = sort__thread_cmp,
  85. .se_snprintf = hist_entry__thread_snprintf,
  86. .se_width_idx = HISTC_THREAD,
  87. };
  88. /* --sort comm */
  89. static int64_t
  90. sort__comm_cmp(struct hist_entry *left, struct hist_entry *right)
  91. {
  92. /* Compare the addr that should be unique among comm */
  93. return strcmp(comm__str(right->comm), comm__str(left->comm));
  94. }
  95. static int64_t
  96. sort__comm_collapse(struct hist_entry *left, struct hist_entry *right)
  97. {
  98. /* Compare the addr that should be unique among comm */
  99. return strcmp(comm__str(right->comm), comm__str(left->comm));
  100. }
  101. static int64_t
  102. sort__comm_sort(struct hist_entry *left, struct hist_entry *right)
  103. {
  104. return strcmp(comm__str(right->comm), comm__str(left->comm));
  105. }
  106. static int hist_entry__comm_snprintf(struct hist_entry *he, char *bf,
  107. size_t size, unsigned int width)
  108. {
  109. return repsep_snprintf(bf, size, "%-*.*s", width, width, comm__str(he->comm));
  110. }
  111. struct sort_entry sort_comm = {
  112. .se_header = "Command",
  113. .se_cmp = sort__comm_cmp,
  114. .se_collapse = sort__comm_collapse,
  115. .se_sort = sort__comm_sort,
  116. .se_snprintf = hist_entry__comm_snprintf,
  117. .se_width_idx = HISTC_COMM,
  118. };
  119. /* --sort dso */
  120. static int64_t _sort__dso_cmp(struct map *map_l, struct map *map_r)
  121. {
  122. struct dso *dso_l = map_l ? map_l->dso : NULL;
  123. struct dso *dso_r = map_r ? map_r->dso : NULL;
  124. const char *dso_name_l, *dso_name_r;
  125. if (!dso_l || !dso_r)
  126. return cmp_null(dso_r, dso_l);
  127. if (verbose) {
  128. dso_name_l = dso_l->long_name;
  129. dso_name_r = dso_r->long_name;
  130. } else {
  131. dso_name_l = dso_l->short_name;
  132. dso_name_r = dso_r->short_name;
  133. }
  134. return strcmp(dso_name_l, dso_name_r);
  135. }
  136. static int64_t
  137. sort__dso_cmp(struct hist_entry *left, struct hist_entry *right)
  138. {
  139. return _sort__dso_cmp(right->ms.map, left->ms.map);
  140. }
  141. static int _hist_entry__dso_snprintf(struct map *map, char *bf,
  142. size_t size, unsigned int width)
  143. {
  144. if (map && map->dso) {
  145. const char *dso_name = !verbose ? map->dso->short_name :
  146. map->dso->long_name;
  147. return repsep_snprintf(bf, size, "%-*.*s", width, width, dso_name);
  148. }
  149. return repsep_snprintf(bf, size, "%-*.*s", width, width, "[unknown]");
  150. }
  151. static int hist_entry__dso_snprintf(struct hist_entry *he, char *bf,
  152. size_t size, unsigned int width)
  153. {
  154. return _hist_entry__dso_snprintf(he->ms.map, bf, size, width);
  155. }
  156. struct sort_entry sort_dso = {
  157. .se_header = "Shared Object",
  158. .se_cmp = sort__dso_cmp,
  159. .se_snprintf = hist_entry__dso_snprintf,
  160. .se_width_idx = HISTC_DSO,
  161. };
  162. /* --sort symbol */
  163. static int64_t _sort__addr_cmp(u64 left_ip, u64 right_ip)
  164. {
  165. return (int64_t)(right_ip - left_ip);
  166. }
  167. static int64_t _sort__sym_cmp(struct symbol *sym_l, struct symbol *sym_r)
  168. {
  169. if (!sym_l || !sym_r)
  170. return cmp_null(sym_l, sym_r);
  171. if (sym_l == sym_r)
  172. return 0;
  173. if (sym_l->start != sym_r->start)
  174. return (int64_t)(sym_r->start - sym_l->start);
  175. return (int64_t)(sym_r->end - sym_l->end);
  176. }
  177. static int64_t
  178. sort__sym_cmp(struct hist_entry *left, struct hist_entry *right)
  179. {
  180. int64_t ret;
  181. if (!left->ms.sym && !right->ms.sym)
  182. return _sort__addr_cmp(left->ip, right->ip);
  183. /*
  184. * comparing symbol address alone is not enough since it's a
  185. * relative address within a dso.
  186. */
  187. if (!sort__has_dso) {
  188. ret = sort__dso_cmp(left, right);
  189. if (ret != 0)
  190. return ret;
  191. }
  192. return _sort__sym_cmp(left->ms.sym, right->ms.sym);
  193. }
  194. static int64_t
  195. sort__sym_sort(struct hist_entry *left, struct hist_entry *right)
  196. {
  197. if (!left->ms.sym || !right->ms.sym)
  198. return cmp_null(left->ms.sym, right->ms.sym);
  199. return strcmp(right->ms.sym->name, left->ms.sym->name);
  200. }
  201. static int _hist_entry__sym_snprintf(struct map *map, struct symbol *sym,
  202. u64 ip, char level, char *bf, size_t size,
  203. unsigned int width)
  204. {
  205. size_t ret = 0;
  206. if (verbose) {
  207. char o = map ? dso__symtab_origin(map->dso) : '!';
  208. ret += repsep_snprintf(bf, size, "%-#*llx %c ",
  209. BITS_PER_LONG / 4 + 2, ip, o);
  210. }
  211. ret += repsep_snprintf(bf + ret, size - ret, "[%c] ", level);
  212. if (sym && map) {
  213. if (map->type == MAP__VARIABLE) {
  214. ret += repsep_snprintf(bf + ret, size - ret, "%s", sym->name);
  215. ret += repsep_snprintf(bf + ret, size - ret, "+0x%llx",
  216. ip - map->unmap_ip(map, sym->start));
  217. } else {
  218. ret += repsep_snprintf(bf + ret, size - ret, "%.*s",
  219. width - ret,
  220. sym->name);
  221. }
  222. } else {
  223. size_t len = BITS_PER_LONG / 4;
  224. ret += repsep_snprintf(bf + ret, size - ret, "%-#.*llx",
  225. len, ip);
  226. }
  227. return ret;
  228. }
  229. static int hist_entry__sym_snprintf(struct hist_entry *he, char *bf,
  230. size_t size, unsigned int width)
  231. {
  232. return _hist_entry__sym_snprintf(he->ms.map, he->ms.sym, he->ip,
  233. he->level, bf, size, width);
  234. }
  235. struct sort_entry sort_sym = {
  236. .se_header = "Symbol",
  237. .se_cmp = sort__sym_cmp,
  238. .se_sort = sort__sym_sort,
  239. .se_snprintf = hist_entry__sym_snprintf,
  240. .se_width_idx = HISTC_SYMBOL,
  241. };
  242. /* --sort srcline */
  243. static char *hist_entry__get_srcline(struct hist_entry *he)
  244. {
  245. struct map *map = he->ms.map;
  246. if (!map)
  247. return SRCLINE_UNKNOWN;
  248. return get_srcline(map->dso, map__rip_2objdump(map, he->ip),
  249. he->ms.sym, true);
  250. }
  251. static int64_t
  252. sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right)
  253. {
  254. if (!left->srcline)
  255. left->srcline = hist_entry__get_srcline(left);
  256. if (!right->srcline)
  257. right->srcline = hist_entry__get_srcline(right);
  258. return strcmp(right->srcline, left->srcline);
  259. }
  260. static int hist_entry__srcline_snprintf(struct hist_entry *he, char *bf,
  261. size_t size, unsigned int width)
  262. {
  263. if (!he->srcline)
  264. he->srcline = hist_entry__get_srcline(he);
  265. return repsep_snprintf(bf, size, "%-.*s", width, he->srcline);
  266. }
  267. struct sort_entry sort_srcline = {
  268. .se_header = "Source:Line",
  269. .se_cmp = sort__srcline_cmp,
  270. .se_snprintf = hist_entry__srcline_snprintf,
  271. .se_width_idx = HISTC_SRCLINE,
  272. };
  273. /* --sort srcfile */
  274. static char no_srcfile[1];
  275. static char *hist_entry__get_srcfile(struct hist_entry *e)
  276. {
  277. char *sf, *p;
  278. struct map *map = e->ms.map;
  279. if (!map)
  280. return no_srcfile;
  281. sf = __get_srcline(map->dso, map__rip_2objdump(map, e->ip),
  282. e->ms.sym, false, true);
  283. if (!strcmp(sf, SRCLINE_UNKNOWN))
  284. return no_srcfile;
  285. p = strchr(sf, ':');
  286. if (p && *sf) {
  287. *p = 0;
  288. return sf;
  289. }
  290. free(sf);
  291. return no_srcfile;
  292. }
  293. static int64_t
  294. sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right)
  295. {
  296. if (!left->srcfile)
  297. left->srcfile = hist_entry__get_srcfile(left);
  298. if (!right->srcfile)
  299. right->srcfile = hist_entry__get_srcfile(right);
  300. return strcmp(right->srcfile, left->srcfile);
  301. }
  302. static int hist_entry__srcfile_snprintf(struct hist_entry *he, char *bf,
  303. size_t size, unsigned int width)
  304. {
  305. if (!he->srcfile)
  306. he->srcfile = hist_entry__get_srcfile(he);
  307. return repsep_snprintf(bf, size, "%-.*s", width, he->srcfile);
  308. }
  309. struct sort_entry sort_srcfile = {
  310. .se_header = "Source File",
  311. .se_cmp = sort__srcfile_cmp,
  312. .se_snprintf = hist_entry__srcfile_snprintf,
  313. .se_width_idx = HISTC_SRCFILE,
  314. };
  315. /* --sort parent */
  316. static int64_t
  317. sort__parent_cmp(struct hist_entry *left, struct hist_entry *right)
  318. {
  319. struct symbol *sym_l = left->parent;
  320. struct symbol *sym_r = right->parent;
  321. if (!sym_l || !sym_r)
  322. return cmp_null(sym_l, sym_r);
  323. return strcmp(sym_r->name, sym_l->name);
  324. }
  325. static int hist_entry__parent_snprintf(struct hist_entry *he, char *bf,
  326. size_t size, unsigned int width)
  327. {
  328. return repsep_snprintf(bf, size, "%-*.*s", width, width,
  329. he->parent ? he->parent->name : "[other]");
  330. }
  331. struct sort_entry sort_parent = {
  332. .se_header = "Parent symbol",
  333. .se_cmp = sort__parent_cmp,
  334. .se_snprintf = hist_entry__parent_snprintf,
  335. .se_width_idx = HISTC_PARENT,
  336. };
  337. /* --sort cpu */
  338. static int64_t
  339. sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right)
  340. {
  341. return right->cpu - left->cpu;
  342. }
  343. static int hist_entry__cpu_snprintf(struct hist_entry *he, char *bf,
  344. size_t size, unsigned int width)
  345. {
  346. return repsep_snprintf(bf, size, "%*.*d", width, width, he->cpu);
  347. }
  348. struct sort_entry sort_cpu = {
  349. .se_header = "CPU",
  350. .se_cmp = sort__cpu_cmp,
  351. .se_snprintf = hist_entry__cpu_snprintf,
  352. .se_width_idx = HISTC_CPU,
  353. };
  354. /* --sort socket */
  355. static int64_t
  356. sort__socket_cmp(struct hist_entry *left, struct hist_entry *right)
  357. {
  358. return right->socket - left->socket;
  359. }
  360. static int hist_entry__socket_snprintf(struct hist_entry *he, char *bf,
  361. size_t size, unsigned int width)
  362. {
  363. return repsep_snprintf(bf, size, "%*.*d", width, width-3, he->socket);
  364. }
  365. struct sort_entry sort_socket = {
  366. .se_header = "Socket",
  367. .se_cmp = sort__socket_cmp,
  368. .se_snprintf = hist_entry__socket_snprintf,
  369. .se_width_idx = HISTC_SOCKET,
  370. };
  371. /* --sort trace */
  372. static char *get_trace_output(struct hist_entry *he)
  373. {
  374. struct trace_seq seq;
  375. struct perf_evsel *evsel;
  376. struct pevent_record rec = {
  377. .data = he->raw_data,
  378. .size = he->raw_size,
  379. };
  380. evsel = hists_to_evsel(he->hists);
  381. trace_seq_init(&seq);
  382. if (symbol_conf.raw_trace) {
  383. pevent_print_fields(&seq, he->raw_data, he->raw_size,
  384. evsel->tp_format);
  385. } else {
  386. pevent_event_info(&seq, evsel->tp_format, &rec);
  387. }
  388. return seq.buffer;
  389. }
  390. static int64_t
  391. sort__trace_cmp(struct hist_entry *left, struct hist_entry *right)
  392. {
  393. struct perf_evsel *evsel;
  394. evsel = hists_to_evsel(left->hists);
  395. if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
  396. return 0;
  397. if (left->trace_output == NULL)
  398. left->trace_output = get_trace_output(left);
  399. if (right->trace_output == NULL)
  400. right->trace_output = get_trace_output(right);
  401. return strcmp(right->trace_output, left->trace_output);
  402. }
  403. static int hist_entry__trace_snprintf(struct hist_entry *he, char *bf,
  404. size_t size, unsigned int width)
  405. {
  406. struct perf_evsel *evsel;
  407. evsel = hists_to_evsel(he->hists);
  408. if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
  409. return scnprintf(bf, size, "%-.*s", width, "N/A");
  410. if (he->trace_output == NULL)
  411. he->trace_output = get_trace_output(he);
  412. return repsep_snprintf(bf, size, "%-.*s", width, he->trace_output);
  413. }
  414. struct sort_entry sort_trace = {
  415. .se_header = "Trace output",
  416. .se_cmp = sort__trace_cmp,
  417. .se_snprintf = hist_entry__trace_snprintf,
  418. .se_width_idx = HISTC_TRACE,
  419. };
  420. /* sort keys for branch stacks */
  421. static int64_t
  422. sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right)
  423. {
  424. if (!left->branch_info || !right->branch_info)
  425. return cmp_null(left->branch_info, right->branch_info);
  426. return _sort__dso_cmp(left->branch_info->from.map,
  427. right->branch_info->from.map);
  428. }
  429. static int hist_entry__dso_from_snprintf(struct hist_entry *he, char *bf,
  430. size_t size, unsigned int width)
  431. {
  432. if (he->branch_info)
  433. return _hist_entry__dso_snprintf(he->branch_info->from.map,
  434. bf, size, width);
  435. else
  436. return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
  437. }
  438. static int64_t
  439. sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right)
  440. {
  441. if (!left->branch_info || !right->branch_info)
  442. return cmp_null(left->branch_info, right->branch_info);
  443. return _sort__dso_cmp(left->branch_info->to.map,
  444. right->branch_info->to.map);
  445. }
  446. static int hist_entry__dso_to_snprintf(struct hist_entry *he, char *bf,
  447. size_t size, unsigned int width)
  448. {
  449. if (he->branch_info)
  450. return _hist_entry__dso_snprintf(he->branch_info->to.map,
  451. bf, size, width);
  452. else
  453. return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
  454. }
  455. static int64_t
  456. sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right)
  457. {
  458. struct addr_map_symbol *from_l = &left->branch_info->from;
  459. struct addr_map_symbol *from_r = &right->branch_info->from;
  460. if (!left->branch_info || !right->branch_info)
  461. return cmp_null(left->branch_info, right->branch_info);
  462. from_l = &left->branch_info->from;
  463. from_r = &right->branch_info->from;
  464. if (!from_l->sym && !from_r->sym)
  465. return _sort__addr_cmp(from_l->addr, from_r->addr);
  466. return _sort__sym_cmp(from_l->sym, from_r->sym);
  467. }
  468. static int64_t
  469. sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right)
  470. {
  471. struct addr_map_symbol *to_l, *to_r;
  472. if (!left->branch_info || !right->branch_info)
  473. return cmp_null(left->branch_info, right->branch_info);
  474. to_l = &left->branch_info->to;
  475. to_r = &right->branch_info->to;
  476. if (!to_l->sym && !to_r->sym)
  477. return _sort__addr_cmp(to_l->addr, to_r->addr);
  478. return _sort__sym_cmp(to_l->sym, to_r->sym);
  479. }
  480. static int hist_entry__sym_from_snprintf(struct hist_entry *he, char *bf,
  481. size_t size, unsigned int width)
  482. {
  483. if (he->branch_info) {
  484. struct addr_map_symbol *from = &he->branch_info->from;
  485. return _hist_entry__sym_snprintf(from->map, from->sym, from->addr,
  486. he->level, bf, size, width);
  487. }
  488. return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
  489. }
  490. static int hist_entry__sym_to_snprintf(struct hist_entry *he, char *bf,
  491. size_t size, unsigned int width)
  492. {
  493. if (he->branch_info) {
  494. struct addr_map_symbol *to = &he->branch_info->to;
  495. return _hist_entry__sym_snprintf(to->map, to->sym, to->addr,
  496. he->level, bf, size, width);
  497. }
  498. return repsep_snprintf(bf, size, "%-*.*s", width, width, "N/A");
  499. }
  500. struct sort_entry sort_dso_from = {
  501. .se_header = "Source Shared Object",
  502. .se_cmp = sort__dso_from_cmp,
  503. .se_snprintf = hist_entry__dso_from_snprintf,
  504. .se_width_idx = HISTC_DSO_FROM,
  505. };
  506. struct sort_entry sort_dso_to = {
  507. .se_header = "Target Shared Object",
  508. .se_cmp = sort__dso_to_cmp,
  509. .se_snprintf = hist_entry__dso_to_snprintf,
  510. .se_width_idx = HISTC_DSO_TO,
  511. };
  512. struct sort_entry sort_sym_from = {
  513. .se_header = "Source Symbol",
  514. .se_cmp = sort__sym_from_cmp,
  515. .se_snprintf = hist_entry__sym_from_snprintf,
  516. .se_width_idx = HISTC_SYMBOL_FROM,
  517. };
  518. struct sort_entry sort_sym_to = {
  519. .se_header = "Target Symbol",
  520. .se_cmp = sort__sym_to_cmp,
  521. .se_snprintf = hist_entry__sym_to_snprintf,
  522. .se_width_idx = HISTC_SYMBOL_TO,
  523. };
  524. static int64_t
  525. sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right)
  526. {
  527. unsigned char mp, p;
  528. if (!left->branch_info || !right->branch_info)
  529. return cmp_null(left->branch_info, right->branch_info);
  530. mp = left->branch_info->flags.mispred != right->branch_info->flags.mispred;
  531. p = left->branch_info->flags.predicted != right->branch_info->flags.predicted;
  532. return mp || p;
  533. }
  534. static int hist_entry__mispredict_snprintf(struct hist_entry *he, char *bf,
  535. size_t size, unsigned int width){
  536. static const char *out = "N/A";
  537. if (he->branch_info) {
  538. if (he->branch_info->flags.predicted)
  539. out = "N";
  540. else if (he->branch_info->flags.mispred)
  541. out = "Y";
  542. }
  543. return repsep_snprintf(bf, size, "%-*.*s", width, width, out);
  544. }
  545. static int64_t
  546. sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right)
  547. {
  548. return left->branch_info->flags.cycles -
  549. right->branch_info->flags.cycles;
  550. }
  551. static int hist_entry__cycles_snprintf(struct hist_entry *he, char *bf,
  552. size_t size, unsigned int width)
  553. {
  554. if (he->branch_info->flags.cycles == 0)
  555. return repsep_snprintf(bf, size, "%-*s", width, "-");
  556. return repsep_snprintf(bf, size, "%-*hd", width,
  557. he->branch_info->flags.cycles);
  558. }
  559. struct sort_entry sort_cycles = {
  560. .se_header = "Basic Block Cycles",
  561. .se_cmp = sort__cycles_cmp,
  562. .se_snprintf = hist_entry__cycles_snprintf,
  563. .se_width_idx = HISTC_CYCLES,
  564. };
  565. /* --sort daddr_sym */
  566. static int64_t
  567. sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right)
  568. {
  569. uint64_t l = 0, r = 0;
  570. if (left->mem_info)
  571. l = left->mem_info->daddr.addr;
  572. if (right->mem_info)
  573. r = right->mem_info->daddr.addr;
  574. return (int64_t)(r - l);
  575. }
  576. static int hist_entry__daddr_snprintf(struct hist_entry *he, char *bf,
  577. size_t size, unsigned int width)
  578. {
  579. uint64_t addr = 0;
  580. struct map *map = NULL;
  581. struct symbol *sym = NULL;
  582. if (he->mem_info) {
  583. addr = he->mem_info->daddr.addr;
  584. map = he->mem_info->daddr.map;
  585. sym = he->mem_info->daddr.sym;
  586. }
  587. return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
  588. width);
  589. }
  590. static int64_t
  591. sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right)
  592. {
  593. uint64_t l = 0, r = 0;
  594. if (left->mem_info)
  595. l = left->mem_info->iaddr.addr;
  596. if (right->mem_info)
  597. r = right->mem_info->iaddr.addr;
  598. return (int64_t)(r - l);
  599. }
  600. static int hist_entry__iaddr_snprintf(struct hist_entry *he, char *bf,
  601. size_t size, unsigned int width)
  602. {
  603. uint64_t addr = 0;
  604. struct map *map = NULL;
  605. struct symbol *sym = NULL;
  606. if (he->mem_info) {
  607. addr = he->mem_info->iaddr.addr;
  608. map = he->mem_info->iaddr.map;
  609. sym = he->mem_info->iaddr.sym;
  610. }
  611. return _hist_entry__sym_snprintf(map, sym, addr, he->level, bf, size,
  612. width);
  613. }
  614. static int64_t
  615. sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right)
  616. {
  617. struct map *map_l = NULL;
  618. struct map *map_r = NULL;
  619. if (left->mem_info)
  620. map_l = left->mem_info->daddr.map;
  621. if (right->mem_info)
  622. map_r = right->mem_info->daddr.map;
  623. return _sort__dso_cmp(map_l, map_r);
  624. }
  625. static int hist_entry__dso_daddr_snprintf(struct hist_entry *he, char *bf,
  626. size_t size, unsigned int width)
  627. {
  628. struct map *map = NULL;
  629. if (he->mem_info)
  630. map = he->mem_info->daddr.map;
  631. return _hist_entry__dso_snprintf(map, bf, size, width);
  632. }
  633. static int64_t
  634. sort__locked_cmp(struct hist_entry *left, struct hist_entry *right)
  635. {
  636. union perf_mem_data_src data_src_l;
  637. union perf_mem_data_src data_src_r;
  638. if (left->mem_info)
  639. data_src_l = left->mem_info->data_src;
  640. else
  641. data_src_l.mem_lock = PERF_MEM_LOCK_NA;
  642. if (right->mem_info)
  643. data_src_r = right->mem_info->data_src;
  644. else
  645. data_src_r.mem_lock = PERF_MEM_LOCK_NA;
  646. return (int64_t)(data_src_r.mem_lock - data_src_l.mem_lock);
  647. }
  648. static int hist_entry__locked_snprintf(struct hist_entry *he, char *bf,
  649. size_t size, unsigned int width)
  650. {
  651. const char *out;
  652. u64 mask = PERF_MEM_LOCK_NA;
  653. if (he->mem_info)
  654. mask = he->mem_info->data_src.mem_lock;
  655. if (mask & PERF_MEM_LOCK_NA)
  656. out = "N/A";
  657. else if (mask & PERF_MEM_LOCK_LOCKED)
  658. out = "Yes";
  659. else
  660. out = "No";
  661. return repsep_snprintf(bf, size, "%.*s", width, out);
  662. }
  663. static int64_t
  664. sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right)
  665. {
  666. union perf_mem_data_src data_src_l;
  667. union perf_mem_data_src data_src_r;
  668. if (left->mem_info)
  669. data_src_l = left->mem_info->data_src;
  670. else
  671. data_src_l.mem_dtlb = PERF_MEM_TLB_NA;
  672. if (right->mem_info)
  673. data_src_r = right->mem_info->data_src;
  674. else
  675. data_src_r.mem_dtlb = PERF_MEM_TLB_NA;
  676. return (int64_t)(data_src_r.mem_dtlb - data_src_l.mem_dtlb);
  677. }
  678. static int hist_entry__tlb_snprintf(struct hist_entry *he, char *bf,
  679. size_t size, unsigned int width)
  680. {
  681. char out[64];
  682. perf_mem__tlb_scnprintf(out, sizeof(out), he->mem_info);
  683. return repsep_snprintf(bf, size, "%-*s", width, out);
  684. }
  685. static int64_t
  686. sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right)
  687. {
  688. union perf_mem_data_src data_src_l;
  689. union perf_mem_data_src data_src_r;
  690. if (left->mem_info)
  691. data_src_l = left->mem_info->data_src;
  692. else
  693. data_src_l.mem_lvl = PERF_MEM_LVL_NA;
  694. if (right->mem_info)
  695. data_src_r = right->mem_info->data_src;
  696. else
  697. data_src_r.mem_lvl = PERF_MEM_LVL_NA;
  698. return (int64_t)(data_src_r.mem_lvl - data_src_l.mem_lvl);
  699. }
  700. static const char * const mem_lvl[] = {
  701. "N/A",
  702. "HIT",
  703. "MISS",
  704. "L1",
  705. "LFB",
  706. "L2",
  707. "L3",
  708. "Local RAM",
  709. "Remote RAM (1 hop)",
  710. "Remote RAM (2 hops)",
  711. "Remote Cache (1 hop)",
  712. "Remote Cache (2 hops)",
  713. "I/O",
  714. "Uncached",
  715. };
  716. static int hist_entry__lvl_snprintf(struct hist_entry *he, char *bf,
  717. size_t size, unsigned int width)
  718. {
  719. char out[64];
  720. size_t sz = sizeof(out) - 1; /* -1 for null termination */
  721. size_t i, l = 0;
  722. u64 m = PERF_MEM_LVL_NA;
  723. u64 hit, miss;
  724. if (he->mem_info)
  725. m = he->mem_info->data_src.mem_lvl;
  726. out[0] = '\0';
  727. hit = m & PERF_MEM_LVL_HIT;
  728. miss = m & PERF_MEM_LVL_MISS;
  729. /* already taken care of */
  730. m &= ~(PERF_MEM_LVL_HIT|PERF_MEM_LVL_MISS);
  731. for (i = 0; m && i < ARRAY_SIZE(mem_lvl); i++, m >>= 1) {
  732. if (!(m & 0x1))
  733. continue;
  734. if (l) {
  735. strcat(out, " or ");
  736. l += 4;
  737. }
  738. strncat(out, mem_lvl[i], sz - l);
  739. l += strlen(mem_lvl[i]);
  740. }
  741. if (*out == '\0')
  742. strcpy(out, "N/A");
  743. if (hit)
  744. strncat(out, " hit", sz - l);
  745. if (miss)
  746. strncat(out, " miss", sz - l);
  747. return repsep_snprintf(bf, size, "%-*s", width, out);
  748. }
  749. static int64_t
  750. sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right)
  751. {
  752. union perf_mem_data_src data_src_l;
  753. union perf_mem_data_src data_src_r;
  754. if (left->mem_info)
  755. data_src_l = left->mem_info->data_src;
  756. else
  757. data_src_l.mem_snoop = PERF_MEM_SNOOP_NA;
  758. if (right->mem_info)
  759. data_src_r = right->mem_info->data_src;
  760. else
  761. data_src_r.mem_snoop = PERF_MEM_SNOOP_NA;
  762. return (int64_t)(data_src_r.mem_snoop - data_src_l.mem_snoop);
  763. }
  764. static const char * const snoop_access[] = {
  765. "N/A",
  766. "None",
  767. "Miss",
  768. "Hit",
  769. "HitM",
  770. };
  771. static int hist_entry__snoop_snprintf(struct hist_entry *he, char *bf,
  772. size_t size, unsigned int width)
  773. {
  774. char out[64];
  775. size_t sz = sizeof(out) - 1; /* -1 for null termination */
  776. size_t i, l = 0;
  777. u64 m = PERF_MEM_SNOOP_NA;
  778. out[0] = '\0';
  779. if (he->mem_info)
  780. m = he->mem_info->data_src.mem_snoop;
  781. for (i = 0; m && i < ARRAY_SIZE(snoop_access); i++, m >>= 1) {
  782. if (!(m & 0x1))
  783. continue;
  784. if (l) {
  785. strcat(out, " or ");
  786. l += 4;
  787. }
  788. strncat(out, snoop_access[i], sz - l);
  789. l += strlen(snoop_access[i]);
  790. }
  791. if (*out == '\0')
  792. strcpy(out, "N/A");
  793. return repsep_snprintf(bf, size, "%-*s", width, out);
  794. }
  795. static int64_t
  796. sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right)
  797. {
  798. u64 l, r;
  799. struct map *l_map, *r_map;
  800. if (!left->mem_info) return -1;
  801. if (!right->mem_info) return 1;
  802. /* group event types together */
  803. if (left->cpumode > right->cpumode) return -1;
  804. if (left->cpumode < right->cpumode) return 1;
  805. l_map = left->mem_info->daddr.map;
  806. r_map = right->mem_info->daddr.map;
  807. /* if both are NULL, jump to sort on al_addr instead */
  808. if (!l_map && !r_map)
  809. goto addr;
  810. if (!l_map) return -1;
  811. if (!r_map) return 1;
  812. if (l_map->maj > r_map->maj) return -1;
  813. if (l_map->maj < r_map->maj) return 1;
  814. if (l_map->min > r_map->min) return -1;
  815. if (l_map->min < r_map->min) return 1;
  816. if (l_map->ino > r_map->ino) return -1;
  817. if (l_map->ino < r_map->ino) return 1;
  818. if (l_map->ino_generation > r_map->ino_generation) return -1;
  819. if (l_map->ino_generation < r_map->ino_generation) return 1;
  820. /*
  821. * Addresses with no major/minor numbers are assumed to be
  822. * anonymous in userspace. Sort those on pid then address.
  823. *
  824. * The kernel and non-zero major/minor mapped areas are
  825. * assumed to be unity mapped. Sort those on address.
  826. */
  827. if ((left->cpumode != PERF_RECORD_MISC_KERNEL) &&
  828. (!(l_map->flags & MAP_SHARED)) &&
  829. !l_map->maj && !l_map->min && !l_map->ino &&
  830. !l_map->ino_generation) {
  831. /* userspace anonymous */
  832. if (left->thread->pid_ > right->thread->pid_) return -1;
  833. if (left->thread->pid_ < right->thread->pid_) return 1;
  834. }
  835. addr:
  836. /* al_addr does all the right addr - start + offset calculations */
  837. l = cl_address(left->mem_info->daddr.al_addr);
  838. r = cl_address(right->mem_info->daddr.al_addr);
  839. if (l > r) return -1;
  840. if (l < r) return 1;
  841. return 0;
  842. }
  843. static int hist_entry__dcacheline_snprintf(struct hist_entry *he, char *bf,
  844. size_t size, unsigned int width)
  845. {
  846. uint64_t addr = 0;
  847. struct map *map = NULL;
  848. struct symbol *sym = NULL;
  849. char level = he->level;
  850. if (he->mem_info) {
  851. addr = cl_address(he->mem_info->daddr.al_addr);
  852. map = he->mem_info->daddr.map;
  853. sym = he->mem_info->daddr.sym;
  854. /* print [s] for shared data mmaps */
  855. if ((he->cpumode != PERF_RECORD_MISC_KERNEL) &&
  856. map && (map->type == MAP__VARIABLE) &&
  857. (map->flags & MAP_SHARED) &&
  858. (map->maj || map->min || map->ino ||
  859. map->ino_generation))
  860. level = 's';
  861. else if (!map)
  862. level = 'X';
  863. }
  864. return _hist_entry__sym_snprintf(map, sym, addr, level, bf, size,
  865. width);
  866. }
  867. struct sort_entry sort_mispredict = {
  868. .se_header = "Branch Mispredicted",
  869. .se_cmp = sort__mispredict_cmp,
  870. .se_snprintf = hist_entry__mispredict_snprintf,
  871. .se_width_idx = HISTC_MISPREDICT,
  872. };
  873. static u64 he_weight(struct hist_entry *he)
  874. {
  875. return he->stat.nr_events ? he->stat.weight / he->stat.nr_events : 0;
  876. }
  877. static int64_t
  878. sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right)
  879. {
  880. return he_weight(left) - he_weight(right);
  881. }
  882. static int hist_entry__local_weight_snprintf(struct hist_entry *he, char *bf,
  883. size_t size, unsigned int width)
  884. {
  885. return repsep_snprintf(bf, size, "%-*llu", width, he_weight(he));
  886. }
  887. struct sort_entry sort_local_weight = {
  888. .se_header = "Local Weight",
  889. .se_cmp = sort__local_weight_cmp,
  890. .se_snprintf = hist_entry__local_weight_snprintf,
  891. .se_width_idx = HISTC_LOCAL_WEIGHT,
  892. };
  893. static int64_t
  894. sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right)
  895. {
  896. return left->stat.weight - right->stat.weight;
  897. }
  898. static int hist_entry__global_weight_snprintf(struct hist_entry *he, char *bf,
  899. size_t size, unsigned int width)
  900. {
  901. return repsep_snprintf(bf, size, "%-*llu", width, he->stat.weight);
  902. }
  903. struct sort_entry sort_global_weight = {
  904. .se_header = "Weight",
  905. .se_cmp = sort__global_weight_cmp,
  906. .se_snprintf = hist_entry__global_weight_snprintf,
  907. .se_width_idx = HISTC_GLOBAL_WEIGHT,
  908. };
  909. struct sort_entry sort_mem_daddr_sym = {
  910. .se_header = "Data Symbol",
  911. .se_cmp = sort__daddr_cmp,
  912. .se_snprintf = hist_entry__daddr_snprintf,
  913. .se_width_idx = HISTC_MEM_DADDR_SYMBOL,
  914. };
  915. struct sort_entry sort_mem_iaddr_sym = {
  916. .se_header = "Code Symbol",
  917. .se_cmp = sort__iaddr_cmp,
  918. .se_snprintf = hist_entry__iaddr_snprintf,
  919. .se_width_idx = HISTC_MEM_IADDR_SYMBOL,
  920. };
  921. struct sort_entry sort_mem_daddr_dso = {
  922. .se_header = "Data Object",
  923. .se_cmp = sort__dso_daddr_cmp,
  924. .se_snprintf = hist_entry__dso_daddr_snprintf,
  925. .se_width_idx = HISTC_MEM_DADDR_SYMBOL,
  926. };
  927. struct sort_entry sort_mem_locked = {
  928. .se_header = "Locked",
  929. .se_cmp = sort__locked_cmp,
  930. .se_snprintf = hist_entry__locked_snprintf,
  931. .se_width_idx = HISTC_MEM_LOCKED,
  932. };
  933. struct sort_entry sort_mem_tlb = {
  934. .se_header = "TLB access",
  935. .se_cmp = sort__tlb_cmp,
  936. .se_snprintf = hist_entry__tlb_snprintf,
  937. .se_width_idx = HISTC_MEM_TLB,
  938. };
  939. struct sort_entry sort_mem_lvl = {
  940. .se_header = "Memory access",
  941. .se_cmp = sort__lvl_cmp,
  942. .se_snprintf = hist_entry__lvl_snprintf,
  943. .se_width_idx = HISTC_MEM_LVL,
  944. };
  945. struct sort_entry sort_mem_snoop = {
  946. .se_header = "Snoop",
  947. .se_cmp = sort__snoop_cmp,
  948. .se_snprintf = hist_entry__snoop_snprintf,
  949. .se_width_idx = HISTC_MEM_SNOOP,
  950. };
  951. struct sort_entry sort_mem_dcacheline = {
  952. .se_header = "Data Cacheline",
  953. .se_cmp = sort__dcacheline_cmp,
  954. .se_snprintf = hist_entry__dcacheline_snprintf,
  955. .se_width_idx = HISTC_MEM_DCACHELINE,
  956. };
  957. static int64_t
  958. sort__abort_cmp(struct hist_entry *left, struct hist_entry *right)
  959. {
  960. if (!left->branch_info || !right->branch_info)
  961. return cmp_null(left->branch_info, right->branch_info);
  962. return left->branch_info->flags.abort !=
  963. right->branch_info->flags.abort;
  964. }
  965. static int hist_entry__abort_snprintf(struct hist_entry *he, char *bf,
  966. size_t size, unsigned int width)
  967. {
  968. static const char *out = "N/A";
  969. if (he->branch_info) {
  970. if (he->branch_info->flags.abort)
  971. out = "A";
  972. else
  973. out = ".";
  974. }
  975. return repsep_snprintf(bf, size, "%-*s", width, out);
  976. }
  977. struct sort_entry sort_abort = {
  978. .se_header = "Transaction abort",
  979. .se_cmp = sort__abort_cmp,
  980. .se_snprintf = hist_entry__abort_snprintf,
  981. .se_width_idx = HISTC_ABORT,
  982. };
  983. static int64_t
  984. sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right)
  985. {
  986. if (!left->branch_info || !right->branch_info)
  987. return cmp_null(left->branch_info, right->branch_info);
  988. return left->branch_info->flags.in_tx !=
  989. right->branch_info->flags.in_tx;
  990. }
  991. static int hist_entry__in_tx_snprintf(struct hist_entry *he, char *bf,
  992. size_t size, unsigned int width)
  993. {
  994. static const char *out = "N/A";
  995. if (he->branch_info) {
  996. if (he->branch_info->flags.in_tx)
  997. out = "T";
  998. else
  999. out = ".";
  1000. }
  1001. return repsep_snprintf(bf, size, "%-*s", width, out);
  1002. }
  1003. struct sort_entry sort_in_tx = {
  1004. .se_header = "Branch in transaction",
  1005. .se_cmp = sort__in_tx_cmp,
  1006. .se_snprintf = hist_entry__in_tx_snprintf,
  1007. .se_width_idx = HISTC_IN_TX,
  1008. };
  1009. static int64_t
  1010. sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right)
  1011. {
  1012. return left->transaction - right->transaction;
  1013. }
  1014. static inline char *add_str(char *p, const char *str)
  1015. {
  1016. strcpy(p, str);
  1017. return p + strlen(str);
  1018. }
  1019. static struct txbit {
  1020. unsigned flag;
  1021. const char *name;
  1022. int skip_for_len;
  1023. } txbits[] = {
  1024. { PERF_TXN_ELISION, "EL ", 0 },
  1025. { PERF_TXN_TRANSACTION, "TX ", 1 },
  1026. { PERF_TXN_SYNC, "SYNC ", 1 },
  1027. { PERF_TXN_ASYNC, "ASYNC ", 0 },
  1028. { PERF_TXN_RETRY, "RETRY ", 0 },
  1029. { PERF_TXN_CONFLICT, "CON ", 0 },
  1030. { PERF_TXN_CAPACITY_WRITE, "CAP-WRITE ", 1 },
  1031. { PERF_TXN_CAPACITY_READ, "CAP-READ ", 0 },
  1032. { 0, NULL, 0 }
  1033. };
  1034. int hist_entry__transaction_len(void)
  1035. {
  1036. int i;
  1037. int len = 0;
  1038. for (i = 0; txbits[i].name; i++) {
  1039. if (!txbits[i].skip_for_len)
  1040. len += strlen(txbits[i].name);
  1041. }
  1042. len += 4; /* :XX<space> */
  1043. return len;
  1044. }
  1045. static int hist_entry__transaction_snprintf(struct hist_entry *he, char *bf,
  1046. size_t size, unsigned int width)
  1047. {
  1048. u64 t = he->transaction;
  1049. char buf[128];
  1050. char *p = buf;
  1051. int i;
  1052. buf[0] = 0;
  1053. for (i = 0; txbits[i].name; i++)
  1054. if (txbits[i].flag & t)
  1055. p = add_str(p, txbits[i].name);
  1056. if (t && !(t & (PERF_TXN_SYNC|PERF_TXN_ASYNC)))
  1057. p = add_str(p, "NEITHER ");
  1058. if (t & PERF_TXN_ABORT_MASK) {
  1059. sprintf(p, ":%" PRIx64,
  1060. (t & PERF_TXN_ABORT_MASK) >>
  1061. PERF_TXN_ABORT_SHIFT);
  1062. p += strlen(p);
  1063. }
  1064. return repsep_snprintf(bf, size, "%-*s", width, buf);
  1065. }
  1066. struct sort_entry sort_transaction = {
  1067. .se_header = "Transaction ",
  1068. .se_cmp = sort__transaction_cmp,
  1069. .se_snprintf = hist_entry__transaction_snprintf,
  1070. .se_width_idx = HISTC_TRANSACTION,
  1071. };
  1072. struct sort_dimension {
  1073. const char *name;
  1074. struct sort_entry *entry;
  1075. int taken;
  1076. };
  1077. #define DIM(d, n, func) [d] = { .name = n, .entry = &(func) }
  1078. static struct sort_dimension common_sort_dimensions[] = {
  1079. DIM(SORT_PID, "pid", sort_thread),
  1080. DIM(SORT_COMM, "comm", sort_comm),
  1081. DIM(SORT_DSO, "dso", sort_dso),
  1082. DIM(SORT_SYM, "symbol", sort_sym),
  1083. DIM(SORT_PARENT, "parent", sort_parent),
  1084. DIM(SORT_CPU, "cpu", sort_cpu),
  1085. DIM(SORT_SOCKET, "socket", sort_socket),
  1086. DIM(SORT_SRCLINE, "srcline", sort_srcline),
  1087. DIM(SORT_SRCFILE, "srcfile", sort_srcfile),
  1088. DIM(SORT_LOCAL_WEIGHT, "local_weight", sort_local_weight),
  1089. DIM(SORT_GLOBAL_WEIGHT, "weight", sort_global_weight),
  1090. DIM(SORT_TRANSACTION, "transaction", sort_transaction),
  1091. DIM(SORT_TRACE, "trace", sort_trace),
  1092. };
  1093. #undef DIM
  1094. #define DIM(d, n, func) [d - __SORT_BRANCH_STACK] = { .name = n, .entry = &(func) }
  1095. static struct sort_dimension bstack_sort_dimensions[] = {
  1096. DIM(SORT_DSO_FROM, "dso_from", sort_dso_from),
  1097. DIM(SORT_DSO_TO, "dso_to", sort_dso_to),
  1098. DIM(SORT_SYM_FROM, "symbol_from", sort_sym_from),
  1099. DIM(SORT_SYM_TO, "symbol_to", sort_sym_to),
  1100. DIM(SORT_MISPREDICT, "mispredict", sort_mispredict),
  1101. DIM(SORT_IN_TX, "in_tx", sort_in_tx),
  1102. DIM(SORT_ABORT, "abort", sort_abort),
  1103. DIM(SORT_CYCLES, "cycles", sort_cycles),
  1104. };
  1105. #undef DIM
  1106. #define DIM(d, n, func) [d - __SORT_MEMORY_MODE] = { .name = n, .entry = &(func) }
  1107. static struct sort_dimension memory_sort_dimensions[] = {
  1108. DIM(SORT_MEM_DADDR_SYMBOL, "symbol_daddr", sort_mem_daddr_sym),
  1109. DIM(SORT_MEM_IADDR_SYMBOL, "symbol_iaddr", sort_mem_iaddr_sym),
  1110. DIM(SORT_MEM_DADDR_DSO, "dso_daddr", sort_mem_daddr_dso),
  1111. DIM(SORT_MEM_LOCKED, "locked", sort_mem_locked),
  1112. DIM(SORT_MEM_TLB, "tlb", sort_mem_tlb),
  1113. DIM(SORT_MEM_LVL, "mem", sort_mem_lvl),
  1114. DIM(SORT_MEM_SNOOP, "snoop", sort_mem_snoop),
  1115. DIM(SORT_MEM_DCACHELINE, "dcacheline", sort_mem_dcacheline),
  1116. };
  1117. #undef DIM
  1118. struct hpp_dimension {
  1119. const char *name;
  1120. struct perf_hpp_fmt *fmt;
  1121. int taken;
  1122. };
  1123. #define DIM(d, n) { .name = n, .fmt = &perf_hpp__format[d], }
  1124. static struct hpp_dimension hpp_sort_dimensions[] = {
  1125. DIM(PERF_HPP__OVERHEAD, "overhead"),
  1126. DIM(PERF_HPP__OVERHEAD_SYS, "overhead_sys"),
  1127. DIM(PERF_HPP__OVERHEAD_US, "overhead_us"),
  1128. DIM(PERF_HPP__OVERHEAD_GUEST_SYS, "overhead_guest_sys"),
  1129. DIM(PERF_HPP__OVERHEAD_GUEST_US, "overhead_guest_us"),
  1130. DIM(PERF_HPP__OVERHEAD_ACC, "overhead_children"),
  1131. DIM(PERF_HPP__SAMPLES, "sample"),
  1132. DIM(PERF_HPP__PERIOD, "period"),
  1133. };
  1134. #undef DIM
  1135. struct hpp_sort_entry {
  1136. struct perf_hpp_fmt hpp;
  1137. struct sort_entry *se;
  1138. };
  1139. void perf_hpp__reset_sort_width(struct perf_hpp_fmt *fmt, struct hists *hists)
  1140. {
  1141. struct hpp_sort_entry *hse;
  1142. if (!perf_hpp__is_sort_entry(fmt))
  1143. return;
  1144. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1145. hists__new_col_len(hists, hse->se->se_width_idx, strlen(fmt->name));
  1146. }
  1147. static int __sort__hpp_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
  1148. struct perf_evsel *evsel)
  1149. {
  1150. struct hpp_sort_entry *hse;
  1151. size_t len = fmt->user_len;
  1152. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1153. if (!len)
  1154. len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
  1155. return scnprintf(hpp->buf, hpp->size, "%-*.*s", len, len, fmt->name);
  1156. }
  1157. static int __sort__hpp_width(struct perf_hpp_fmt *fmt,
  1158. struct perf_hpp *hpp __maybe_unused,
  1159. struct perf_evsel *evsel)
  1160. {
  1161. struct hpp_sort_entry *hse;
  1162. size_t len = fmt->user_len;
  1163. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1164. if (!len)
  1165. len = hists__col_len(evsel__hists(evsel), hse->se->se_width_idx);
  1166. return len;
  1167. }
  1168. static int __sort__hpp_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
  1169. struct hist_entry *he)
  1170. {
  1171. struct hpp_sort_entry *hse;
  1172. size_t len = fmt->user_len;
  1173. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1174. if (!len)
  1175. len = hists__col_len(he->hists, hse->se->se_width_idx);
  1176. return hse->se->se_snprintf(he, hpp->buf, hpp->size, len);
  1177. }
  1178. static int64_t __sort__hpp_cmp(struct perf_hpp_fmt *fmt,
  1179. struct hist_entry *a, struct hist_entry *b)
  1180. {
  1181. struct hpp_sort_entry *hse;
  1182. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1183. return hse->se->se_cmp(a, b);
  1184. }
  1185. static int64_t __sort__hpp_collapse(struct perf_hpp_fmt *fmt,
  1186. struct hist_entry *a, struct hist_entry *b)
  1187. {
  1188. struct hpp_sort_entry *hse;
  1189. int64_t (*collapse_fn)(struct hist_entry *, struct hist_entry *);
  1190. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1191. collapse_fn = hse->se->se_collapse ?: hse->se->se_cmp;
  1192. return collapse_fn(a, b);
  1193. }
  1194. static int64_t __sort__hpp_sort(struct perf_hpp_fmt *fmt,
  1195. struct hist_entry *a, struct hist_entry *b)
  1196. {
  1197. struct hpp_sort_entry *hse;
  1198. int64_t (*sort_fn)(struct hist_entry *, struct hist_entry *);
  1199. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1200. sort_fn = hse->se->se_sort ?: hse->se->se_cmp;
  1201. return sort_fn(a, b);
  1202. }
  1203. bool perf_hpp__is_sort_entry(struct perf_hpp_fmt *format)
  1204. {
  1205. return format->header == __sort__hpp_header;
  1206. }
  1207. static bool __sort__hpp_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
  1208. {
  1209. struct hpp_sort_entry *hse_a;
  1210. struct hpp_sort_entry *hse_b;
  1211. if (!perf_hpp__is_sort_entry(a) || !perf_hpp__is_sort_entry(b))
  1212. return false;
  1213. hse_a = container_of(a, struct hpp_sort_entry, hpp);
  1214. hse_b = container_of(b, struct hpp_sort_entry, hpp);
  1215. return hse_a->se == hse_b->se;
  1216. }
  1217. static void hse_free(struct perf_hpp_fmt *fmt)
  1218. {
  1219. struct hpp_sort_entry *hse;
  1220. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1221. free(hse);
  1222. }
  1223. static struct hpp_sort_entry *
  1224. __sort_dimension__alloc_hpp(struct sort_dimension *sd)
  1225. {
  1226. struct hpp_sort_entry *hse;
  1227. hse = malloc(sizeof(*hse));
  1228. if (hse == NULL) {
  1229. pr_err("Memory allocation failed\n");
  1230. return NULL;
  1231. }
  1232. hse->se = sd->entry;
  1233. hse->hpp.name = sd->entry->se_header;
  1234. hse->hpp.header = __sort__hpp_header;
  1235. hse->hpp.width = __sort__hpp_width;
  1236. hse->hpp.entry = __sort__hpp_entry;
  1237. hse->hpp.color = NULL;
  1238. hse->hpp.cmp = __sort__hpp_cmp;
  1239. hse->hpp.collapse = __sort__hpp_collapse;
  1240. hse->hpp.sort = __sort__hpp_sort;
  1241. hse->hpp.equal = __sort__hpp_equal;
  1242. hse->hpp.free = hse_free;
  1243. INIT_LIST_HEAD(&hse->hpp.list);
  1244. INIT_LIST_HEAD(&hse->hpp.sort_list);
  1245. hse->hpp.elide = false;
  1246. hse->hpp.len = 0;
  1247. hse->hpp.user_len = 0;
  1248. return hse;
  1249. }
  1250. static void hpp_free(struct perf_hpp_fmt *fmt)
  1251. {
  1252. free(fmt);
  1253. }
  1254. static struct perf_hpp_fmt *__hpp_dimension__alloc_hpp(struct hpp_dimension *hd)
  1255. {
  1256. struct perf_hpp_fmt *fmt;
  1257. fmt = memdup(hd->fmt, sizeof(*fmt));
  1258. if (fmt) {
  1259. INIT_LIST_HEAD(&fmt->list);
  1260. INIT_LIST_HEAD(&fmt->sort_list);
  1261. fmt->free = hpp_free;
  1262. }
  1263. return fmt;
  1264. }
  1265. static int __sort_dimension__add_hpp_sort(struct sort_dimension *sd)
  1266. {
  1267. struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);
  1268. if (hse == NULL)
  1269. return -1;
  1270. perf_hpp__register_sort_field(&hse->hpp);
  1271. return 0;
  1272. }
  1273. static int __sort_dimension__add_hpp_output(struct perf_hpp_list *list,
  1274. struct sort_dimension *sd)
  1275. {
  1276. struct hpp_sort_entry *hse = __sort_dimension__alloc_hpp(sd);
  1277. if (hse == NULL)
  1278. return -1;
  1279. perf_hpp_list__column_register(list, &hse->hpp);
  1280. return 0;
  1281. }
  1282. struct hpp_dynamic_entry {
  1283. struct perf_hpp_fmt hpp;
  1284. struct perf_evsel *evsel;
  1285. struct format_field *field;
  1286. unsigned dynamic_len;
  1287. bool raw_trace;
  1288. };
  1289. static int hde_width(struct hpp_dynamic_entry *hde)
  1290. {
  1291. if (!hde->hpp.len) {
  1292. int len = hde->dynamic_len;
  1293. int namelen = strlen(hde->field->name);
  1294. int fieldlen = hde->field->size;
  1295. if (namelen > len)
  1296. len = namelen;
  1297. if (!(hde->field->flags & FIELD_IS_STRING)) {
  1298. /* length for print hex numbers */
  1299. fieldlen = hde->field->size * 2 + 2;
  1300. }
  1301. if (fieldlen > len)
  1302. len = fieldlen;
  1303. hde->hpp.len = len;
  1304. }
  1305. return hde->hpp.len;
  1306. }
  1307. static void update_dynamic_len(struct hpp_dynamic_entry *hde,
  1308. struct hist_entry *he)
  1309. {
  1310. char *str, *pos;
  1311. struct format_field *field = hde->field;
  1312. size_t namelen;
  1313. bool last = false;
  1314. if (hde->raw_trace)
  1315. return;
  1316. /* parse pretty print result and update max length */
  1317. if (!he->trace_output)
  1318. he->trace_output = get_trace_output(he);
  1319. namelen = strlen(field->name);
  1320. str = he->trace_output;
  1321. while (str) {
  1322. pos = strchr(str, ' ');
  1323. if (pos == NULL) {
  1324. last = true;
  1325. pos = str + strlen(str);
  1326. }
  1327. if (!strncmp(str, field->name, namelen)) {
  1328. size_t len;
  1329. str += namelen + 1;
  1330. len = pos - str;
  1331. if (len > hde->dynamic_len)
  1332. hde->dynamic_len = len;
  1333. break;
  1334. }
  1335. if (last)
  1336. str = NULL;
  1337. else
  1338. str = pos + 1;
  1339. }
  1340. }
  1341. static int __sort__hde_header(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
  1342. struct perf_evsel *evsel __maybe_unused)
  1343. {
  1344. struct hpp_dynamic_entry *hde;
  1345. size_t len = fmt->user_len;
  1346. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1347. if (!len)
  1348. len = hde_width(hde);
  1349. return scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, hde->field->name);
  1350. }
  1351. static int __sort__hde_width(struct perf_hpp_fmt *fmt,
  1352. struct perf_hpp *hpp __maybe_unused,
  1353. struct perf_evsel *evsel __maybe_unused)
  1354. {
  1355. struct hpp_dynamic_entry *hde;
  1356. size_t len = fmt->user_len;
  1357. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1358. if (!len)
  1359. len = hde_width(hde);
  1360. return len;
  1361. }
  1362. bool perf_hpp__defined_dynamic_entry(struct perf_hpp_fmt *fmt, struct hists *hists)
  1363. {
  1364. struct hpp_dynamic_entry *hde;
  1365. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1366. return hists_to_evsel(hists) == hde->evsel;
  1367. }
  1368. static int __sort__hde_entry(struct perf_hpp_fmt *fmt, struct perf_hpp *hpp,
  1369. struct hist_entry *he)
  1370. {
  1371. struct hpp_dynamic_entry *hde;
  1372. size_t len = fmt->user_len;
  1373. char *str, *pos;
  1374. struct format_field *field;
  1375. size_t namelen;
  1376. bool last = false;
  1377. int ret;
  1378. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1379. if (!len)
  1380. len = hde_width(hde);
  1381. if (hde->raw_trace)
  1382. goto raw_field;
  1383. field = hde->field;
  1384. namelen = strlen(field->name);
  1385. str = he->trace_output;
  1386. while (str) {
  1387. pos = strchr(str, ' ');
  1388. if (pos == NULL) {
  1389. last = true;
  1390. pos = str + strlen(str);
  1391. }
  1392. if (!strncmp(str, field->name, namelen)) {
  1393. str += namelen + 1;
  1394. str = strndup(str, pos - str);
  1395. if (str == NULL)
  1396. return scnprintf(hpp->buf, hpp->size,
  1397. "%*.*s", len, len, "ERROR");
  1398. break;
  1399. }
  1400. if (last)
  1401. str = NULL;
  1402. else
  1403. str = pos + 1;
  1404. }
  1405. if (str == NULL) {
  1406. struct trace_seq seq;
  1407. raw_field:
  1408. trace_seq_init(&seq);
  1409. pevent_print_field(&seq, he->raw_data, hde->field);
  1410. str = seq.buffer;
  1411. }
  1412. ret = scnprintf(hpp->buf, hpp->size, "%*.*s", len, len, str);
  1413. free(str);
  1414. return ret;
  1415. }
  1416. static int64_t __sort__hde_cmp(struct perf_hpp_fmt *fmt,
  1417. struct hist_entry *a, struct hist_entry *b)
  1418. {
  1419. struct hpp_dynamic_entry *hde;
  1420. struct format_field *field;
  1421. unsigned offset, size;
  1422. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1423. field = hde->field;
  1424. if (field->flags & FIELD_IS_DYNAMIC) {
  1425. unsigned long long dyn;
  1426. pevent_read_number_field(field, a->raw_data, &dyn);
  1427. offset = dyn & 0xffff;
  1428. size = (dyn >> 16) & 0xffff;
  1429. /* record max width for output */
  1430. if (size > hde->dynamic_len)
  1431. hde->dynamic_len = size;
  1432. } else {
  1433. offset = field->offset;
  1434. size = field->size;
  1435. update_dynamic_len(hde, a);
  1436. update_dynamic_len(hde, b);
  1437. }
  1438. return memcmp(a->raw_data + offset, b->raw_data + offset, size);
  1439. }
  1440. bool perf_hpp__is_dynamic_entry(struct perf_hpp_fmt *fmt)
  1441. {
  1442. return fmt->cmp == __sort__hde_cmp;
  1443. }
  1444. static bool __sort__hde_equal(struct perf_hpp_fmt *a, struct perf_hpp_fmt *b)
  1445. {
  1446. struct hpp_dynamic_entry *hde_a;
  1447. struct hpp_dynamic_entry *hde_b;
  1448. if (!perf_hpp__is_dynamic_entry(a) || !perf_hpp__is_dynamic_entry(b))
  1449. return false;
  1450. hde_a = container_of(a, struct hpp_dynamic_entry, hpp);
  1451. hde_b = container_of(b, struct hpp_dynamic_entry, hpp);
  1452. return hde_a->field == hde_b->field;
  1453. }
  1454. static void hde_free(struct perf_hpp_fmt *fmt)
  1455. {
  1456. struct hpp_dynamic_entry *hde;
  1457. hde = container_of(fmt, struct hpp_dynamic_entry, hpp);
  1458. free(hde);
  1459. }
  1460. static struct hpp_dynamic_entry *
  1461. __alloc_dynamic_entry(struct perf_evsel *evsel, struct format_field *field)
  1462. {
  1463. struct hpp_dynamic_entry *hde;
  1464. hde = malloc(sizeof(*hde));
  1465. if (hde == NULL) {
  1466. pr_debug("Memory allocation failed\n");
  1467. return NULL;
  1468. }
  1469. hde->evsel = evsel;
  1470. hde->field = field;
  1471. hde->dynamic_len = 0;
  1472. hde->hpp.name = field->name;
  1473. hde->hpp.header = __sort__hde_header;
  1474. hde->hpp.width = __sort__hde_width;
  1475. hde->hpp.entry = __sort__hde_entry;
  1476. hde->hpp.color = NULL;
  1477. hde->hpp.cmp = __sort__hde_cmp;
  1478. hde->hpp.collapse = __sort__hde_cmp;
  1479. hde->hpp.sort = __sort__hde_cmp;
  1480. hde->hpp.equal = __sort__hde_equal;
  1481. hde->hpp.free = hde_free;
  1482. INIT_LIST_HEAD(&hde->hpp.list);
  1483. INIT_LIST_HEAD(&hde->hpp.sort_list);
  1484. hde->hpp.elide = false;
  1485. hde->hpp.len = 0;
  1486. hde->hpp.user_len = 0;
  1487. return hde;
  1488. }
  1489. static int parse_field_name(char *str, char **event, char **field, char **opt)
  1490. {
  1491. char *event_name, *field_name, *opt_name;
  1492. event_name = str;
  1493. field_name = strchr(str, '.');
  1494. if (field_name) {
  1495. *field_name++ = '\0';
  1496. } else {
  1497. event_name = NULL;
  1498. field_name = str;
  1499. }
  1500. opt_name = strchr(field_name, '/');
  1501. if (opt_name)
  1502. *opt_name++ = '\0';
  1503. *event = event_name;
  1504. *field = field_name;
  1505. *opt = opt_name;
  1506. return 0;
  1507. }
  1508. /* find match evsel using a given event name. The event name can be:
  1509. * 1. '%' + event index (e.g. '%1' for first event)
  1510. * 2. full event name (e.g. sched:sched_switch)
  1511. * 3. partial event name (should not contain ':')
  1512. */
  1513. static struct perf_evsel *find_evsel(struct perf_evlist *evlist, char *event_name)
  1514. {
  1515. struct perf_evsel *evsel = NULL;
  1516. struct perf_evsel *pos;
  1517. bool full_name;
  1518. /* case 1 */
  1519. if (event_name[0] == '%') {
  1520. int nr = strtol(event_name+1, NULL, 0);
  1521. if (nr > evlist->nr_entries)
  1522. return NULL;
  1523. evsel = perf_evlist__first(evlist);
  1524. while (--nr > 0)
  1525. evsel = perf_evsel__next(evsel);
  1526. return evsel;
  1527. }
  1528. full_name = !!strchr(event_name, ':');
  1529. evlist__for_each(evlist, pos) {
  1530. /* case 2 */
  1531. if (full_name && !strcmp(pos->name, event_name))
  1532. return pos;
  1533. /* case 3 */
  1534. if (!full_name && strstr(pos->name, event_name)) {
  1535. if (evsel) {
  1536. pr_debug("'%s' event is ambiguous: it can be %s or %s\n",
  1537. event_name, evsel->name, pos->name);
  1538. return NULL;
  1539. }
  1540. evsel = pos;
  1541. }
  1542. }
  1543. return evsel;
  1544. }
  1545. static int __dynamic_dimension__add(struct perf_evsel *evsel,
  1546. struct format_field *field,
  1547. bool raw_trace)
  1548. {
  1549. struct hpp_dynamic_entry *hde;
  1550. hde = __alloc_dynamic_entry(evsel, field);
  1551. if (hde == NULL)
  1552. return -ENOMEM;
  1553. hde->raw_trace = raw_trace;
  1554. perf_hpp__register_sort_field(&hde->hpp);
  1555. return 0;
  1556. }
  1557. static int add_evsel_fields(struct perf_evsel *evsel, bool raw_trace)
  1558. {
  1559. int ret;
  1560. struct format_field *field;
  1561. field = evsel->tp_format->format.fields;
  1562. while (field) {
  1563. ret = __dynamic_dimension__add(evsel, field, raw_trace);
  1564. if (ret < 0)
  1565. return ret;
  1566. field = field->next;
  1567. }
  1568. return 0;
  1569. }
  1570. static int add_all_dynamic_fields(struct perf_evlist *evlist, bool raw_trace)
  1571. {
  1572. int ret;
  1573. struct perf_evsel *evsel;
  1574. evlist__for_each(evlist, evsel) {
  1575. if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
  1576. continue;
  1577. ret = add_evsel_fields(evsel, raw_trace);
  1578. if (ret < 0)
  1579. return ret;
  1580. }
  1581. return 0;
  1582. }
  1583. static int add_all_matching_fields(struct perf_evlist *evlist,
  1584. char *field_name, bool raw_trace)
  1585. {
  1586. int ret = -ESRCH;
  1587. struct perf_evsel *evsel;
  1588. struct format_field *field;
  1589. evlist__for_each(evlist, evsel) {
  1590. if (evsel->attr.type != PERF_TYPE_TRACEPOINT)
  1591. continue;
  1592. field = pevent_find_any_field(evsel->tp_format, field_name);
  1593. if (field == NULL)
  1594. continue;
  1595. ret = __dynamic_dimension__add(evsel, field, raw_trace);
  1596. if (ret < 0)
  1597. break;
  1598. }
  1599. return ret;
  1600. }
  1601. static int add_dynamic_entry(struct perf_evlist *evlist, const char *tok)
  1602. {
  1603. char *str, *event_name, *field_name, *opt_name;
  1604. struct perf_evsel *evsel;
  1605. struct format_field *field;
  1606. bool raw_trace = symbol_conf.raw_trace;
  1607. int ret = 0;
  1608. if (evlist == NULL)
  1609. return -ENOENT;
  1610. str = strdup(tok);
  1611. if (str == NULL)
  1612. return -ENOMEM;
  1613. if (parse_field_name(str, &event_name, &field_name, &opt_name) < 0) {
  1614. ret = -EINVAL;
  1615. goto out;
  1616. }
  1617. if (opt_name) {
  1618. if (strcmp(opt_name, "raw")) {
  1619. pr_debug("unsupported field option %s\n", opt_name);
  1620. ret = -EINVAL;
  1621. goto out;
  1622. }
  1623. raw_trace = true;
  1624. }
  1625. if (!strcmp(field_name, "trace_fields")) {
  1626. ret = add_all_dynamic_fields(evlist, raw_trace);
  1627. goto out;
  1628. }
  1629. if (event_name == NULL) {
  1630. ret = add_all_matching_fields(evlist, field_name, raw_trace);
  1631. goto out;
  1632. }
  1633. evsel = find_evsel(evlist, event_name);
  1634. if (evsel == NULL) {
  1635. pr_debug("Cannot find event: %s\n", event_name);
  1636. ret = -ENOENT;
  1637. goto out;
  1638. }
  1639. if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
  1640. pr_debug("%s is not a tracepoint event\n", event_name);
  1641. ret = -EINVAL;
  1642. goto out;
  1643. }
  1644. if (!strcmp(field_name, "*")) {
  1645. ret = add_evsel_fields(evsel, raw_trace);
  1646. } else {
  1647. field = pevent_find_any_field(evsel->tp_format, field_name);
  1648. if (field == NULL) {
  1649. pr_debug("Cannot find event field for %s.%s\n",
  1650. event_name, field_name);
  1651. return -ENOENT;
  1652. }
  1653. ret = __dynamic_dimension__add(evsel, field, raw_trace);
  1654. }
  1655. out:
  1656. free(str);
  1657. return ret;
  1658. }
  1659. static int __sort_dimension__add(struct sort_dimension *sd)
  1660. {
  1661. if (sd->taken)
  1662. return 0;
  1663. if (__sort_dimension__add_hpp_sort(sd) < 0)
  1664. return -1;
  1665. if (sd->entry->se_collapse)
  1666. sort__need_collapse = 1;
  1667. sd->taken = 1;
  1668. return 0;
  1669. }
  1670. static int __hpp_dimension__add(struct hpp_dimension *hd)
  1671. {
  1672. struct perf_hpp_fmt *fmt;
  1673. if (hd->taken)
  1674. return 0;
  1675. fmt = __hpp_dimension__alloc_hpp(hd);
  1676. if (!fmt)
  1677. return -1;
  1678. hd->taken = 1;
  1679. perf_hpp__register_sort_field(fmt);
  1680. return 0;
  1681. }
  1682. static int __sort_dimension__add_output(struct perf_hpp_list *list,
  1683. struct sort_dimension *sd)
  1684. {
  1685. if (sd->taken)
  1686. return 0;
  1687. if (__sort_dimension__add_hpp_output(list, sd) < 0)
  1688. return -1;
  1689. sd->taken = 1;
  1690. return 0;
  1691. }
  1692. static int __hpp_dimension__add_output(struct perf_hpp_list *list,
  1693. struct hpp_dimension *hd)
  1694. {
  1695. struct perf_hpp_fmt *fmt;
  1696. if (hd->taken)
  1697. return 0;
  1698. fmt = __hpp_dimension__alloc_hpp(hd);
  1699. if (!fmt)
  1700. return -1;
  1701. hd->taken = 1;
  1702. perf_hpp_list__column_register(list, fmt);
  1703. return 0;
  1704. }
  1705. int hpp_dimension__add_output(unsigned col)
  1706. {
  1707. BUG_ON(col >= PERF_HPP__MAX_INDEX);
  1708. return __hpp_dimension__add_output(&perf_hpp_list, &hpp_sort_dimensions[col]);
  1709. }
  1710. static int sort_dimension__add(const char *tok,
  1711. struct perf_evlist *evlist __maybe_unused)
  1712. {
  1713. unsigned int i;
  1714. for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
  1715. struct sort_dimension *sd = &common_sort_dimensions[i];
  1716. if (strncasecmp(tok, sd->name, strlen(tok)))
  1717. continue;
  1718. if (sd->entry == &sort_parent) {
  1719. int ret = regcomp(&parent_regex, parent_pattern, REG_EXTENDED);
  1720. if (ret) {
  1721. char err[BUFSIZ];
  1722. regerror(ret, &parent_regex, err, sizeof(err));
  1723. pr_err("Invalid regex: %s\n%s", parent_pattern, err);
  1724. return -EINVAL;
  1725. }
  1726. sort__has_parent = 1;
  1727. } else if (sd->entry == &sort_sym) {
  1728. sort__has_sym = 1;
  1729. /*
  1730. * perf diff displays the performance difference amongst
  1731. * two or more perf.data files. Those files could come
  1732. * from different binaries. So we should not compare
  1733. * their ips, but the name of symbol.
  1734. */
  1735. if (sort__mode == SORT_MODE__DIFF)
  1736. sd->entry->se_collapse = sort__sym_sort;
  1737. } else if (sd->entry == &sort_dso) {
  1738. sort__has_dso = 1;
  1739. } else if (sd->entry == &sort_socket) {
  1740. sort__has_socket = 1;
  1741. } else if (sd->entry == &sort_thread) {
  1742. sort__has_thread = 1;
  1743. }
  1744. return __sort_dimension__add(sd);
  1745. }
  1746. for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
  1747. struct hpp_dimension *hd = &hpp_sort_dimensions[i];
  1748. if (strncasecmp(tok, hd->name, strlen(tok)))
  1749. continue;
  1750. return __hpp_dimension__add(hd);
  1751. }
  1752. for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) {
  1753. struct sort_dimension *sd = &bstack_sort_dimensions[i];
  1754. if (strncasecmp(tok, sd->name, strlen(tok)))
  1755. continue;
  1756. if (sort__mode != SORT_MODE__BRANCH)
  1757. return -EINVAL;
  1758. if (sd->entry == &sort_sym_from || sd->entry == &sort_sym_to)
  1759. sort__has_sym = 1;
  1760. __sort_dimension__add(sd);
  1761. return 0;
  1762. }
  1763. for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) {
  1764. struct sort_dimension *sd = &memory_sort_dimensions[i];
  1765. if (strncasecmp(tok, sd->name, strlen(tok)))
  1766. continue;
  1767. if (sort__mode != SORT_MODE__MEMORY)
  1768. return -EINVAL;
  1769. if (sd->entry == &sort_mem_daddr_sym)
  1770. sort__has_sym = 1;
  1771. __sort_dimension__add(sd);
  1772. return 0;
  1773. }
  1774. if (!add_dynamic_entry(evlist, tok))
  1775. return 0;
  1776. return -ESRCH;
  1777. }
  1778. static int setup_sort_list(char *str, struct perf_evlist *evlist)
  1779. {
  1780. char *tmp, *tok;
  1781. int ret = 0;
  1782. for (tok = strtok_r(str, ", ", &tmp);
  1783. tok; tok = strtok_r(NULL, ", ", &tmp)) {
  1784. ret = sort_dimension__add(tok, evlist);
  1785. if (ret == -EINVAL) {
  1786. error("Invalid --sort key: `%s'", tok);
  1787. break;
  1788. } else if (ret == -ESRCH) {
  1789. error("Unknown --sort key: `%s'", tok);
  1790. break;
  1791. }
  1792. }
  1793. return ret;
  1794. }
  1795. static const char *get_default_sort_order(struct perf_evlist *evlist)
  1796. {
  1797. const char *default_sort_orders[] = {
  1798. default_sort_order,
  1799. default_branch_sort_order,
  1800. default_mem_sort_order,
  1801. default_top_sort_order,
  1802. default_diff_sort_order,
  1803. default_tracepoint_sort_order,
  1804. };
  1805. bool use_trace = true;
  1806. struct perf_evsel *evsel;
  1807. BUG_ON(sort__mode >= ARRAY_SIZE(default_sort_orders));
  1808. if (evlist == NULL)
  1809. goto out_no_evlist;
  1810. evlist__for_each(evlist, evsel) {
  1811. if (evsel->attr.type != PERF_TYPE_TRACEPOINT) {
  1812. use_trace = false;
  1813. break;
  1814. }
  1815. }
  1816. if (use_trace) {
  1817. sort__mode = SORT_MODE__TRACEPOINT;
  1818. if (symbol_conf.raw_trace)
  1819. return "trace_fields";
  1820. }
  1821. out_no_evlist:
  1822. return default_sort_orders[sort__mode];
  1823. }
  1824. static int setup_sort_order(struct perf_evlist *evlist)
  1825. {
  1826. char *new_sort_order;
  1827. /*
  1828. * Append '+'-prefixed sort order to the default sort
  1829. * order string.
  1830. */
  1831. if (!sort_order || is_strict_order(sort_order))
  1832. return 0;
  1833. if (sort_order[1] == '\0') {
  1834. error("Invalid --sort key: `+'");
  1835. return -EINVAL;
  1836. }
  1837. /*
  1838. * We allocate new sort_order string, but we never free it,
  1839. * because it's checked over the rest of the code.
  1840. */
  1841. if (asprintf(&new_sort_order, "%s,%s",
  1842. get_default_sort_order(evlist), sort_order + 1) < 0) {
  1843. error("Not enough memory to set up --sort");
  1844. return -ENOMEM;
  1845. }
  1846. sort_order = new_sort_order;
  1847. return 0;
  1848. }
  1849. /*
  1850. * Adds 'pre,' prefix into 'str' is 'pre' is
  1851. * not already part of 'str'.
  1852. */
  1853. static char *prefix_if_not_in(const char *pre, char *str)
  1854. {
  1855. char *n;
  1856. if (!str || strstr(str, pre))
  1857. return str;
  1858. if (asprintf(&n, "%s,%s", pre, str) < 0)
  1859. return NULL;
  1860. free(str);
  1861. return n;
  1862. }
  1863. static char *setup_overhead(char *keys)
  1864. {
  1865. keys = prefix_if_not_in("overhead", keys);
  1866. if (symbol_conf.cumulate_callchain)
  1867. keys = prefix_if_not_in("overhead_children", keys);
  1868. return keys;
  1869. }
  1870. static int __setup_sorting(struct perf_evlist *evlist)
  1871. {
  1872. char *str;
  1873. const char *sort_keys;
  1874. int ret = 0;
  1875. ret = setup_sort_order(evlist);
  1876. if (ret)
  1877. return ret;
  1878. sort_keys = sort_order;
  1879. if (sort_keys == NULL) {
  1880. if (is_strict_order(field_order)) {
  1881. /*
  1882. * If user specified field order but no sort order,
  1883. * we'll honor it and not add default sort orders.
  1884. */
  1885. return 0;
  1886. }
  1887. sort_keys = get_default_sort_order(evlist);
  1888. }
  1889. str = strdup(sort_keys);
  1890. if (str == NULL) {
  1891. error("Not enough memory to setup sort keys");
  1892. return -ENOMEM;
  1893. }
  1894. /*
  1895. * Prepend overhead fields for backward compatibility.
  1896. */
  1897. if (!is_strict_order(field_order)) {
  1898. str = setup_overhead(str);
  1899. if (str == NULL) {
  1900. error("Not enough memory to setup overhead keys");
  1901. return -ENOMEM;
  1902. }
  1903. }
  1904. ret = setup_sort_list(str, evlist);
  1905. free(str);
  1906. return ret;
  1907. }
  1908. void perf_hpp__set_elide(int idx, bool elide)
  1909. {
  1910. struct perf_hpp_fmt *fmt;
  1911. struct hpp_sort_entry *hse;
  1912. perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
  1913. if (!perf_hpp__is_sort_entry(fmt))
  1914. continue;
  1915. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1916. if (hse->se->se_width_idx == idx) {
  1917. fmt->elide = elide;
  1918. break;
  1919. }
  1920. }
  1921. }
  1922. static bool __get_elide(struct strlist *list, const char *list_name, FILE *fp)
  1923. {
  1924. if (list && strlist__nr_entries(list) == 1) {
  1925. if (fp != NULL)
  1926. fprintf(fp, "# %s: %s\n", list_name,
  1927. strlist__entry(list, 0)->s);
  1928. return true;
  1929. }
  1930. return false;
  1931. }
  1932. static bool get_elide(int idx, FILE *output)
  1933. {
  1934. switch (idx) {
  1935. case HISTC_SYMBOL:
  1936. return __get_elide(symbol_conf.sym_list, "symbol", output);
  1937. case HISTC_DSO:
  1938. return __get_elide(symbol_conf.dso_list, "dso", output);
  1939. case HISTC_COMM:
  1940. return __get_elide(symbol_conf.comm_list, "comm", output);
  1941. default:
  1942. break;
  1943. }
  1944. if (sort__mode != SORT_MODE__BRANCH)
  1945. return false;
  1946. switch (idx) {
  1947. case HISTC_SYMBOL_FROM:
  1948. return __get_elide(symbol_conf.sym_from_list, "sym_from", output);
  1949. case HISTC_SYMBOL_TO:
  1950. return __get_elide(symbol_conf.sym_to_list, "sym_to", output);
  1951. case HISTC_DSO_FROM:
  1952. return __get_elide(symbol_conf.dso_from_list, "dso_from", output);
  1953. case HISTC_DSO_TO:
  1954. return __get_elide(symbol_conf.dso_to_list, "dso_to", output);
  1955. default:
  1956. break;
  1957. }
  1958. return false;
  1959. }
  1960. void sort__setup_elide(FILE *output)
  1961. {
  1962. struct perf_hpp_fmt *fmt;
  1963. struct hpp_sort_entry *hse;
  1964. perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
  1965. if (!perf_hpp__is_sort_entry(fmt))
  1966. continue;
  1967. hse = container_of(fmt, struct hpp_sort_entry, hpp);
  1968. fmt->elide = get_elide(hse->se->se_width_idx, output);
  1969. }
  1970. /*
  1971. * It makes no sense to elide all of sort entries.
  1972. * Just revert them to show up again.
  1973. */
  1974. perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
  1975. if (!perf_hpp__is_sort_entry(fmt))
  1976. continue;
  1977. if (!fmt->elide)
  1978. return;
  1979. }
  1980. perf_hpp_list__for_each_format(&perf_hpp_list, fmt) {
  1981. if (!perf_hpp__is_sort_entry(fmt))
  1982. continue;
  1983. fmt->elide = false;
  1984. }
  1985. }
  1986. static int output_field_add(struct perf_hpp_list *list, char *tok)
  1987. {
  1988. unsigned int i;
  1989. for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++) {
  1990. struct sort_dimension *sd = &common_sort_dimensions[i];
  1991. if (strncasecmp(tok, sd->name, strlen(tok)))
  1992. continue;
  1993. return __sort_dimension__add_output(list, sd);
  1994. }
  1995. for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++) {
  1996. struct hpp_dimension *hd = &hpp_sort_dimensions[i];
  1997. if (strncasecmp(tok, hd->name, strlen(tok)))
  1998. continue;
  1999. return __hpp_dimension__add_output(list, hd);
  2000. }
  2001. for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++) {
  2002. struct sort_dimension *sd = &bstack_sort_dimensions[i];
  2003. if (strncasecmp(tok, sd->name, strlen(tok)))
  2004. continue;
  2005. return __sort_dimension__add_output(list, sd);
  2006. }
  2007. for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++) {
  2008. struct sort_dimension *sd = &memory_sort_dimensions[i];
  2009. if (strncasecmp(tok, sd->name, strlen(tok)))
  2010. continue;
  2011. return __sort_dimension__add_output(list, sd);
  2012. }
  2013. return -ESRCH;
  2014. }
  2015. static int setup_output_list(struct perf_hpp_list *list, char *str)
  2016. {
  2017. char *tmp, *tok;
  2018. int ret = 0;
  2019. for (tok = strtok_r(str, ", ", &tmp);
  2020. tok; tok = strtok_r(NULL, ", ", &tmp)) {
  2021. ret = output_field_add(list, tok);
  2022. if (ret == -EINVAL) {
  2023. error("Invalid --fields key: `%s'", tok);
  2024. break;
  2025. } else if (ret == -ESRCH) {
  2026. error("Unknown --fields key: `%s'", tok);
  2027. break;
  2028. }
  2029. }
  2030. return ret;
  2031. }
  2032. static void reset_dimensions(void)
  2033. {
  2034. unsigned int i;
  2035. for (i = 0; i < ARRAY_SIZE(common_sort_dimensions); i++)
  2036. common_sort_dimensions[i].taken = 0;
  2037. for (i = 0; i < ARRAY_SIZE(hpp_sort_dimensions); i++)
  2038. hpp_sort_dimensions[i].taken = 0;
  2039. for (i = 0; i < ARRAY_SIZE(bstack_sort_dimensions); i++)
  2040. bstack_sort_dimensions[i].taken = 0;
  2041. for (i = 0; i < ARRAY_SIZE(memory_sort_dimensions); i++)
  2042. memory_sort_dimensions[i].taken = 0;
  2043. }
  2044. bool is_strict_order(const char *order)
  2045. {
  2046. return order && (*order != '+');
  2047. }
  2048. static int __setup_output_field(void)
  2049. {
  2050. char *str, *strp;
  2051. int ret = -EINVAL;
  2052. if (field_order == NULL)
  2053. return 0;
  2054. strp = str = strdup(field_order);
  2055. if (str == NULL) {
  2056. error("Not enough memory to setup output fields");
  2057. return -ENOMEM;
  2058. }
  2059. if (!is_strict_order(field_order))
  2060. strp++;
  2061. if (!strlen(strp)) {
  2062. error("Invalid --fields key: `+'");
  2063. goto out;
  2064. }
  2065. ret = setup_output_list(&perf_hpp_list, strp);
  2066. out:
  2067. free(str);
  2068. return ret;
  2069. }
  2070. int setup_sorting(struct perf_evlist *evlist)
  2071. {
  2072. int err;
  2073. err = __setup_sorting(evlist);
  2074. if (err < 0)
  2075. return err;
  2076. if (parent_pattern != default_parent_pattern) {
  2077. err = sort_dimension__add("parent", evlist);
  2078. if (err < 0)
  2079. return err;
  2080. }
  2081. reset_dimensions();
  2082. /*
  2083. * perf diff doesn't use default hpp output fields.
  2084. */
  2085. if (sort__mode != SORT_MODE__DIFF)
  2086. perf_hpp__init();
  2087. err = __setup_output_field();
  2088. if (err < 0)
  2089. return err;
  2090. /* copy sort keys to output fields */
  2091. perf_hpp__setup_output_field(&perf_hpp_list);
  2092. /* and then copy output fields to sort keys */
  2093. perf_hpp__append_sort_keys(&perf_hpp_list);
  2094. return 0;
  2095. }
  2096. void reset_output_field(void)
  2097. {
  2098. sort__need_collapse = 0;
  2099. sort__has_parent = 0;
  2100. sort__has_sym = 0;
  2101. sort__has_dso = 0;
  2102. field_order = NULL;
  2103. sort_order = NULL;
  2104. reset_dimensions();
  2105. perf_hpp__reset_output_field(&perf_hpp_list);
  2106. }