sort.c 64 KB

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