sort.c 59 KB

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