sort.c 69 KB

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