sort.c 67 KB

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