Linux kernel mirror (for testing) git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux.git
kernel os linux

perf report: Refactor the branch info printing code

The branch info such as predicted/cycles/... are printed at the
callchain entries.

For example: perf report --branch-history --no-children --stdio

--1.07%--main div.c:39 (predicted:52.4% cycles:1 iterations:17)
main div.c:44 (predicted:52.4% cycles:1)
main div.c:42 (cycles:2)
compute_flag div.c:28 (cycles:2)
compute_flag div.c:27 (cycles:1)
rand rand.c:28 (cycles:1)
rand rand.c:28 (cycles:1)
__random random.c:298 (cycles:1)
__random random.c:297 (cycles:1)
__random random.c:295 (cycles:1)
__random random.c:295 (cycles:1)
__random random.c:295 (cycles:1)

But the current code is difficult to maintain and extend. This patch
refactors the code for easy maintenance.

Change log:

v6: 1. Put the multiline condition code into {} brackets in
counts_str_build()

2. Keep the original display order, that is:
predicted, abort, cycles, iterations

v5: It's a new patch in v5 patch series.

Signed-off-by: Yao Jin <yao.jin@linux.intel.com>
Acked-by: Jiri Olsa <jolsa@kernel.org>
Cc: Alexander Shishkin <alexander.shishkin@linux.intel.com>
Cc: Andi Kleen <ak@linux.intel.com>
Cc: Kan Liang <kan.liang@intel.com>
Cc: Michael Ellerman <mpe@ellerman.id.au>
Cc: Peter Zijlstra <peterz@infradead.org>
Link: http://lkml.kernel.org/r/1500379995-6449-5-git-send-email-yao.jin@linux.intel.com
[ Don't use 'index' as a name for a variable, it shadows a globa decl in older distros ]
Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>

authored by

Jin Yao and committed by
Arnaldo Carvalho de Melo
8d51735f 60f83fa6

+43 -61
+43 -61
tools/perf/util/callchain.c
··· 1214 1214 cycles_count); 1215 1215 } 1216 1216 1217 + static int count_pri64_printf(int idx, const char *str, u64 value, char *bf, int bfsize) 1218 + { 1219 + int printed; 1220 + 1221 + printed = scnprintf(bf, bfsize, "%s%s:%" PRId64 "", (idx) ? " " : " (", str, value); 1222 + 1223 + return printed; 1224 + } 1225 + 1226 + static int count_float_printf(int idx, const char *str, float value, char *bf, int bfsize) 1227 + { 1228 + int printed; 1229 + 1230 + printed = scnprintf(bf, bfsize, "%s%s:%.1f%%", (idx) ? " " : " (", str, value); 1231 + 1232 + return printed; 1233 + } 1234 + 1217 1235 static int counts_str_build(char *bf, int bfsize, 1218 1236 u64 branch_count, u64 predicted_count, 1219 1237 u64 abort_count, u64 cycles_count, 1220 1238 u64 iter_count, u64 samples_count) 1221 1239 { 1222 - double predicted_percent = 0.0; 1223 - const char *null_str = ""; 1224 - char iter_str[32]; 1225 - char cycle_str[32]; 1226 - char *istr, *cstr; 1227 1240 u64 cycles; 1241 + int printed = 0, i = 0; 1228 1242 1229 1243 if (branch_count == 0) 1230 1244 return scnprintf(bf, bfsize, " (calltrace)"); 1231 1245 1246 + if (predicted_count < branch_count) { 1247 + printed += count_float_printf(i++, "predicted", 1248 + predicted_count * 100.0 / branch_count, 1249 + bf + printed, bfsize - printed); 1250 + } 1251 + 1252 + if (abort_count) { 1253 + printed += count_float_printf(i++, "abort", 1254 + abort_count * 100.0 / branch_count, 1255 + bf + printed, bfsize - printed); 1256 + } 1257 + 1232 1258 cycles = cycles_count / branch_count; 1259 + if (cycles) { 1260 + printed += count_pri64_printf(i++, "cycles", 1261 + cycles, 1262 + bf + printed, bfsize - printed); 1263 + } 1233 1264 1234 1265 if (iter_count && samples_count) { 1235 - if (cycles > 0) 1236 - scnprintf(iter_str, sizeof(iter_str), 1237 - " iterations:%" PRId64 "", 1238 - iter_count / samples_count); 1239 - else 1240 - scnprintf(iter_str, sizeof(iter_str), 1241 - "iterations:%" PRId64 "", 1242 - iter_count / samples_count); 1243 - istr = iter_str; 1244 - } else 1245 - istr = (char *)null_str; 1246 - 1247 - if (cycles > 0) { 1248 - scnprintf(cycle_str, sizeof(cycle_str), 1249 - "cycles:%" PRId64 "", cycles); 1250 - cstr = cycle_str; 1251 - } else 1252 - cstr = (char *)null_str; 1253 - 1254 - predicted_percent = predicted_count * 100.0 / branch_count; 1255 - 1256 - if ((predicted_count == branch_count) && (abort_count == 0)) { 1257 - if ((cycles > 0) || (istr != (char *)null_str)) 1258 - return scnprintf(bf, bfsize, " (%s%s)", cstr, istr); 1259 - else 1260 - return scnprintf(bf, bfsize, "%s", (char *)null_str); 1266 + printed += count_pri64_printf(i++, "iterations", 1267 + iter_count / samples_count, 1268 + bf + printed, bfsize - printed); 1261 1269 } 1262 1270 1263 - if ((predicted_count < branch_count) && (abort_count == 0)) { 1264 - if ((cycles > 0) || (istr != (char *)null_str)) 1265 - return scnprintf(bf, bfsize, 1266 - " (predicted:%.1f%% %s%s)", 1267 - predicted_percent, cstr, istr); 1268 - else { 1269 - return scnprintf(bf, bfsize, 1270 - " (predicted:%.1f%%)", 1271 - predicted_percent); 1272 - } 1273 - } 1271 + if (i) 1272 + return scnprintf(bf + printed, bfsize - printed, ")"); 1274 1273 1275 - if ((predicted_count == branch_count) && (abort_count > 0)) { 1276 - if ((cycles > 0) || (istr != (char *)null_str)) 1277 - return scnprintf(bf, bfsize, 1278 - " (abort:%" PRId64 " %s%s)", 1279 - abort_count, cstr, istr); 1280 - else 1281 - return scnprintf(bf, bfsize, 1282 - " (abort:%" PRId64 ")", 1283 - abort_count); 1284 - } 1285 - 1286 - if ((cycles > 0) || (istr != (char *)null_str)) 1287 - return scnprintf(bf, bfsize, 1288 - " (predicted:%.1f%% abort:%" PRId64 " %s%s)", 1289 - predicted_percent, abort_count, cstr, istr); 1290 - 1291 - return scnprintf(bf, bfsize, 1292 - " (predicted:%.1f%% abort:%" PRId64 ")", 1293 - predicted_percent, abort_count); 1274 + bf[0] = 0; 1275 + return 0; 1294 1276 } 1295 1277 1296 1278 static int callchain_counts_printf(FILE *fp, char *bf, int bfsize,