sort.c 64 KB

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