sort.c 66 KB

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