sort.c 60 KB

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