Commit | Line | Data |
---|---|---|
5489fcc3 KR |
1 | /* |
2 | * Histogram related operations. | |
3 | */ | |
4 | #include <stdio.h> | |
5 | #include "libiberty.h" | |
6 | #include "gprof.h" | |
7 | #include "core.h" | |
8 | #include "gmon_io.h" | |
9 | #include "gmon_out.h" | |
10 | #include "hist.h" | |
11 | #include "symtab.h" | |
12 | #include "sym_ids.h" | |
13 | #include "utils.h" | |
14 | ||
c3de2a19 ILT |
15 | #define UNITS_TO_CODE (offset_to_code / sizeof(UNIT)) |
16 | ||
1eb9fa9e ILT |
17 | static void scale_and_align_entries PARAMS ((void)); |
18 | ||
5489fcc3 | 19 | /* declarations of automatically generated functions to output blurbs: */ |
12516a37 | 20 | extern void flat_blurb PARAMS ((FILE * fp)); |
5489fcc3 KR |
21 | |
22 | bfd_vma s_lowpc; /* lowest address in .text */ | |
23 | bfd_vma s_highpc = 0; /* highest address in .text */ | |
24 | bfd_vma lowpc, highpc; /* same, but expressed in UNITs */ | |
25 | int hist_num_bins = 0; /* number of histogram samples */ | |
26 | int *hist_sample = 0; /* histogram samples (shorts in the file!) */ | |
27 | double hist_scale; | |
12516a37 KR |
28 | char hist_dimension[sizeof (((struct gmon_hist_hdr *) 0)->dimen) + 1] = |
29 | "seconds"; | |
5489fcc3 KR |
30 | char hist_dimension_abbrev = 's'; |
31 | ||
32 | static double accum_time; /* accumulated time so far for print_line() */ | |
33 | static double total_time; /* total time for all routines */ | |
34 | /* | |
35 | * Table of SI prefixes for powers of 10 (used to automatically | |
36 | * scale some of the values in the flat profile). | |
37 | */ | |
12516a37 KR |
38 | const struct |
39 | { | |
5489fcc3 KR |
40 | char prefix; |
41 | double scale; | |
12516a37 KR |
42 | } |
43 | SItab[] = | |
44 | { | |
45 | { | |
46 | 'T', 1e-12 | |
47 | } | |
48 | , /* tera */ | |
49 | { | |
50 | 'G', 1e-09 | |
51 | } | |
52 | , /* giga */ | |
53 | { | |
54 | 'M', 1e-06 | |
55 | } | |
56 | , /* mega */ | |
57 | { | |
58 | 'K', 1e-03 | |
59 | } | |
60 | , /* kilo */ | |
61 | { | |
62 | ' ', 1e-00 | |
63 | } | |
64 | , | |
65 | { | |
66 | 'm', 1e+03 | |
67 | } | |
68 | , /* milli */ | |
69 | { | |
70 | 'u', 1e+06 | |
71 | } | |
72 | , /* micro */ | |
73 | { | |
74 | 'n', 1e+09 | |
75 | } | |
76 | , /* nano */ | |
77 | { | |
78 | 'p', 1e+12 | |
79 | } | |
80 | , /* pico */ | |
81 | { | |
82 | 'f', 1e+15 | |
83 | } | |
84 | , /* femto */ | |
85 | { | |
86 | 'a', 1e+18 | |
87 | } | |
88 | , /* ato */ | |
5489fcc3 KR |
89 | }; |
90 | ||
91 | /* | |
92 | * Read the histogram from file IFP. FILENAME is the name of IFP and | |
93 | * is provided for formatting error messages only. | |
94 | */ | |
95 | void | |
12516a37 | 96 | DEFUN (hist_read_rec, (ifp, filename), FILE * ifp AND const char *filename) |
5489fcc3 | 97 | { |
12516a37 KR |
98 | struct gmon_hist_hdr hdr; |
99 | bfd_vma n_lowpc, n_highpc; | |
100 | int i, ncnt, profrate; | |
101 | UNIT count; | |
102 | ||
103 | if (fread (&hdr, sizeof (hdr), 1, ifp) != 1) | |
104 | { | |
105 | fprintf (stderr, "%s: %s: unexpected end of file\n", | |
106 | whoami, filename); | |
107 | done (1); | |
03c35bcb | 108 | } |
12516a37 KR |
109 | |
110 | n_lowpc = (bfd_vma) get_vma (core_bfd, (bfd_byte *) hdr.low_pc); | |
111 | n_highpc = (bfd_vma) get_vma (core_bfd, (bfd_byte *) hdr.high_pc); | |
112 | ncnt = bfd_get_32 (core_bfd, (bfd_byte *) hdr.hist_size); | |
113 | profrate = bfd_get_32 (core_bfd, (bfd_byte *) hdr.prof_rate); | |
114 | strncpy (hist_dimension, hdr.dimen, sizeof (hdr.dimen)); | |
115 | hist_dimension[sizeof (hdr.dimen)] = '\0'; | |
116 | hist_dimension_abbrev = hdr.dimen_abbrev; | |
117 | ||
118 | if (!s_highpc) | |
119 | { | |
120 | ||
121 | /* this is the first histogram record: */ | |
122 | ||
123 | s_lowpc = n_lowpc; | |
124 | s_highpc = n_highpc; | |
125 | lowpc = (bfd_vma) n_lowpc / sizeof (UNIT); | |
126 | highpc = (bfd_vma) n_highpc / sizeof (UNIT); | |
127 | hist_num_bins = ncnt; | |
128 | hz = profrate; | |
03c35bcb | 129 | } |
12516a37 KR |
130 | |
131 | DBG (SAMPLEDEBUG, | |
132 | printf ("[hist_read_rec] n_lowpc 0x%lx n_highpc 0x%lx ncnt %d\n", | |
5489fcc3 | 133 | n_lowpc, n_highpc, ncnt); |
12516a37 | 134 | printf ("[hist_read_rec] s_lowpc 0x%lx s_highpc 0x%lx nsamples %d\n", |
5489fcc3 | 135 | s_lowpc, s_highpc, hist_num_bins); |
12516a37 | 136 | printf ("[hist_read_rec] lowpc 0x%lx highpc 0x%lx\n", |
5489fcc3 KR |
137 | lowpc, highpc)); |
138 | ||
12516a37 KR |
139 | if (n_lowpc != s_lowpc || n_highpc != s_highpc |
140 | || ncnt != hist_num_bins || hz != profrate) | |
5489fcc3 | 141 | { |
12516a37 KR |
142 | fprintf (stderr, "%s: `%s' is incompatible with first gmon file\n", |
143 | whoami, filename); | |
144 | done (1); | |
03c35bcb | 145 | } |
5489fcc3 | 146 | |
12516a37 KR |
147 | if (!hist_sample) |
148 | { | |
149 | hist_sample = (int *) xmalloc (hist_num_bins * sizeof (hist_sample[0])); | |
150 | memset (hist_sample, 0, hist_num_bins * sizeof (hist_sample[0])); | |
03c35bcb | 151 | } |
5489fcc3 | 152 | |
12516a37 KR |
153 | for (i = 0; i < hist_num_bins; ++i) |
154 | { | |
155 | if (fread (&count[0], sizeof (count), 1, ifp) != 1) | |
156 | { | |
157 | fprintf (stderr, | |
158 | "%s: %s: unexpected EOF after reading %d of %d samples\n", | |
159 | whoami, filename, i, hist_num_bins); | |
160 | done (1); | |
03c35bcb | 161 | } |
12516a37 | 162 | hist_sample[i] += bfd_get_16 (core_bfd, (bfd_byte *) & count[0]); |
03c35bcb KR |
163 | } |
164 | } | |
5489fcc3 KR |
165 | |
166 | ||
167 | /* | |
168 | * Write execution histogram to file OFP. FILENAME is the name | |
169 | * of OFP and is provided for formatting error-messages only. | |
170 | */ | |
171 | void | |
12516a37 | 172 | DEFUN (hist_write_hist, (ofp, filename), FILE * ofp AND const char *filename) |
5489fcc3 | 173 | { |
12516a37 KR |
174 | struct gmon_hist_hdr hdr; |
175 | unsigned char tag; | |
176 | UNIT count; | |
177 | int i; | |
178 | ||
179 | /* write header: */ | |
180 | ||
181 | tag = GMON_TAG_TIME_HIST; | |
182 | put_vma (core_bfd, s_lowpc, (bfd_byte *) hdr.low_pc); | |
183 | put_vma (core_bfd, s_highpc, (bfd_byte *) hdr.high_pc); | |
184 | bfd_put_32 (core_bfd, hist_num_bins, (bfd_byte *) hdr.hist_size); | |
185 | bfd_put_32 (core_bfd, hz, (bfd_byte *) hdr.prof_rate); | |
186 | strncpy (hdr.dimen, hist_dimension, sizeof (hdr.dimen)); | |
187 | hdr.dimen_abbrev = hist_dimension_abbrev; | |
188 | ||
189 | if (fwrite (&tag, sizeof (tag), 1, ofp) != 1 | |
190 | || fwrite (&hdr, sizeof (hdr), 1, ofp) != 1) | |
191 | { | |
192 | perror (filename); | |
193 | done (1); | |
03c35bcb | 194 | } |
12516a37 KR |
195 | |
196 | for (i = 0; i < hist_num_bins; ++i) | |
197 | { | |
198 | bfd_put_16 (core_bfd, hist_sample[i], (bfd_byte *) & count[0]); | |
199 | if (fwrite (&count[0], sizeof (count), 1, ofp) != 1) | |
200 | { | |
201 | perror (filename); | |
202 | done (1); | |
03c35bcb KR |
203 | } |
204 | } | |
205 | } | |
5489fcc3 KR |
206 | |
207 | ||
208 | /* | |
209 | * Calculate scaled entry point addresses (to save time in | |
210 | * hist_assign_samples), and, on architectures that have procedure | |
211 | * entry masks at the start of a function, possibly push the scaled | |
212 | * entry points over the procedure entry mask, if it turns out that | |
213 | * the entry point is in one bin and the code for a routine is in the | |
214 | * next bin. | |
215 | */ | |
216 | static void | |
fcc14c40 | 217 | scale_and_align_entries () |
5489fcc3 | 218 | { |
12516a37 | 219 | Sym *sym; |
12516a37 KR |
220 | bfd_vma bin_of_entry; |
221 | bfd_vma bin_of_code; | |
5489fcc3 | 222 | |
12516a37 KR |
223 | for (sym = symtab.base; sym < symtab.limit; sym++) |
224 | { | |
225 | sym->hist.scaled_addr = sym->addr / sizeof (UNIT); | |
12516a37 KR |
226 | bin_of_entry = (sym->hist.scaled_addr - lowpc) / hist_scale; |
227 | bin_of_code = (sym->hist.scaled_addr + UNITS_TO_CODE - lowpc) / hist_scale; | |
228 | if (bin_of_entry < bin_of_code) | |
229 | { | |
230 | DBG (SAMPLEDEBUG, | |
231 | printf ("[scale_and_align_entries] pushing 0x%lx to 0x%lx\n", | |
c446c25a KR |
232 | sym->hist.scaled_addr, |
233 | sym->hist.scaled_addr + UNITS_TO_CODE)); | |
234 | sym->hist.scaled_addr += UNITS_TO_CODE; | |
03c35bcb | 235 | } |
03c35bcb KR |
236 | } |
237 | } | |
5489fcc3 KR |
238 | |
239 | ||
240 | /* | |
241 | * Assign samples to the symbol to which they belong. | |
242 | * | |
243 | * Histogram bin I covers some address range [BIN_LOWPC,BIN_HIGH_PC) | |
244 | * which may overlap one more symbol address ranges. If a symbol | |
245 | * overlaps with the bin's address range by O percent, then O percent | |
246 | * of the bin's count is credited to that symbol. | |
247 | * | |
248 | * There are three cases as to where BIN_LOW_PC and BIN_HIGH_PC can be | |
249 | * with respect to the symbol's address range [SYM_LOW_PC, | |
250 | * SYM_HIGH_PC) as shown in the following diagram. OVERLAP computes | |
251 | * the distance (in UNITs) between the arrows, the fraction of the | |
252 | * sample that is to be credited to the symbol which starts at | |
253 | * SYM_LOW_PC. | |
254 | * | |
12516a37 KR |
255 | * sym_low_pc sym_high_pc |
256 | * | | | |
257 | * v v | |
5489fcc3 | 258 | * |
12516a37 KR |
259 | * +-----------------------------------------------+ |
260 | * | | | |
261 | * | ->| |<- ->| |<- ->| |<- | | |
262 | * | | | | | | | |
263 | * +---------+ +---------+ +---------+ | |
5489fcc3 | 264 | * |
12516a37 KR |
265 | * ^ ^ ^ ^ ^ ^ |
266 | * | | | | | | | |
5489fcc3 KR |
267 | * bin_low_pc bin_high_pc bin_low_pc bin_high_pc bin_low_pc bin_high_pc |
268 | * | |
269 | * For the VAX we assert that samples will never fall in the first two | |
270 | * bytes of any routine, since that is the entry mask, thus we call | |
271 | * scale_and_align_entries() to adjust the entry points if the entry | |
272 | * mask falls in one bin but the code for the routine doesn't start | |
273 | * until the next bin. In conjunction with the alignment of routine | |
274 | * addresses, this should allow us to have only one sample for every | |
275 | * four bytes of text space and never have any overlap (the two end | |
276 | * cases, above). | |
277 | */ | |
278 | void | |
12516a37 | 279 | DEFUN_VOID (hist_assign_samples) |
5489fcc3 | 280 | { |
12516a37 KR |
281 | bfd_vma bin_low_pc, bin_high_pc; |
282 | bfd_vma sym_low_pc, sym_high_pc; | |
283 | bfd_vma overlap, addr; | |
284 | int bin_count, i, j; | |
285 | double time, credit; | |
286 | ||
287 | /* read samples and assign to symbols: */ | |
288 | hist_scale = highpc - lowpc; | |
289 | hist_scale /= hist_num_bins; | |
290 | scale_and_align_entries (); | |
291 | ||
292 | /* iterate over all sample bins: */ | |
293 | ||
294 | for (i = 0, j = 1; i < hist_num_bins; ++i) | |
295 | { | |
296 | bin_count = hist_sample[i]; | |
297 | if (!bin_count) | |
298 | { | |
299 | continue; | |
03c35bcb | 300 | } |
12516a37 KR |
301 | bin_low_pc = lowpc + (bfd_vma) (hist_scale * i); |
302 | bin_high_pc = lowpc + (bfd_vma) (hist_scale * (i + 1)); | |
303 | time = bin_count; | |
304 | DBG (SAMPLEDEBUG, | |
305 | printf ( | |
306 | "[assign_samples] bin_low_pc=0x%lx, bin_high_pc=0x%lx, bin_count=%d\n", | |
307 | sizeof (UNIT) * bin_low_pc, sizeof (UNIT) * bin_high_pc, | |
308 | bin_count)); | |
309 | total_time += time; | |
310 | ||
311 | /* credit all symbols that are covered by bin I: */ | |
312 | ||
313 | for (j = j - 1; j < symtab.len; ++j) | |
314 | { | |
315 | sym_low_pc = symtab.base[j].hist.scaled_addr; | |
316 | sym_high_pc = symtab.base[j + 1].hist.scaled_addr; | |
317 | /* | |
318 | * If high end of bin is below entry address, go for next | |
319 | * bin: | |
320 | */ | |
321 | if (bin_high_pc < sym_low_pc) | |
322 | { | |
323 | break; | |
03c35bcb | 324 | } |
12516a37 KR |
325 | /* |
326 | * If low end of bin is above high end of symbol, go for | |
327 | * next symbol. | |
328 | */ | |
329 | if (bin_low_pc >= sym_high_pc) | |
330 | { | |
331 | continue; | |
03c35bcb | 332 | } |
12516a37 KR |
333 | overlap = |
334 | MIN (bin_high_pc, sym_high_pc) - MAX (bin_low_pc, sym_low_pc); | |
335 | if (overlap > 0) | |
336 | { | |
337 | DBG (SAMPLEDEBUG, | |
338 | printf ( | |
339 | "[assign_samples] [0x%lx,0x%lx) %s gets %f ticks %ld overlap\n", | |
340 | symtab.base[j].addr, sizeof (UNIT) * sym_high_pc, | |
341 | symtab.base[j].name, overlap * time / hist_scale, | |
342 | overlap)); | |
343 | addr = symtab.base[j].addr; | |
344 | credit = overlap * time / hist_scale; | |
345 | /* | |
346 | * Credit symbol if it appears in INCL_FLAT or that | |
347 | * table is empty and it does not appear it in | |
348 | * EXCL_FLAT. | |
349 | */ | |
350 | if (sym_lookup (&syms[INCL_FLAT], addr) | |
351 | || (syms[INCL_FLAT].len == 0 | |
352 | && !sym_lookup (&syms[EXCL_FLAT], addr))) | |
5489fcc3 | 353 | { |
12516a37 KR |
354 | symtab.base[j].hist.time += credit; |
355 | } | |
356 | else | |
357 | { | |
358 | total_time -= credit; | |
03c35bcb KR |
359 | } |
360 | } | |
361 | } | |
362 | } | |
12516a37 | 363 | DBG (SAMPLEDEBUG, printf ("[assign_samples] total_time %f\n", |
5489fcc3 | 364 | total_time)); |
03c35bcb | 365 | } |
5489fcc3 KR |
366 | |
367 | ||
368 | /* | |
369 | * Print header for flag histogram profile: | |
370 | */ | |
371 | static void | |
12516a37 | 372 | DEFUN (print_header, (prefix), const char prefix) |
5489fcc3 | 373 | { |
12516a37 KR |
374 | char unit[64]; |
375 | ||
376 | sprintf (unit, "%c%c/call", prefix, hist_dimension_abbrev); | |
377 | ||
378 | if (bsd_style_output) | |
379 | { | |
380 | printf ("\ngranularity: each sample hit covers %ld byte(s)", | |
381 | (long) hist_scale * sizeof (UNIT)); | |
382 | if (total_time > 0.0) | |
383 | { | |
384 | printf (" for %.2f%% of %.2f %s\n\n", | |
385 | 100.0 / total_time, total_time / hz, hist_dimension); | |
03c35bcb | 386 | } |
12516a37 KR |
387 | } |
388 | else | |
389 | { | |
390 | printf ("\nEach sample counts as %g %s.\n", 1.0 / hz, hist_dimension); | |
03c35bcb | 391 | } |
12516a37 KR |
392 | |
393 | if (total_time <= 0.0) | |
394 | { | |
395 | printf (" no time accumulated\n\n"); | |
396 | /* this doesn't hurt since all the numerators will be zero: */ | |
397 | total_time = 1.0; | |
03c35bcb | 398 | } |
12516a37 KR |
399 | |
400 | printf ("%5.5s %10.10s %8.8s %8.8s %8.8s %8.8s %-8.8s\n", | |
401 | "% ", "cumulative", "self ", "", "self ", "total ", ""); | |
402 | printf ("%5.5s %9.9s %8.8s %8.8s %8.8s %8.8s %-8.8s\n", | |
403 | "time", hist_dimension, hist_dimension, "calls", unit, unit, | |
404 | "name"); | |
03c35bcb | 405 | } |
5489fcc3 KR |
406 | |
407 | ||
408 | static void | |
12516a37 | 409 | DEFUN (print_line, (sym, scale), Sym * sym AND double scale) |
5489fcc3 | 410 | { |
12516a37 KR |
411 | if (ignore_zeros && sym->ncalls == 0 && sym->hist.time == 0) |
412 | { | |
413 | return; | |
03c35bcb | 414 | } |
12516a37 KR |
415 | |
416 | accum_time += sym->hist.time; | |
417 | if (bsd_style_output) | |
418 | { | |
419 | printf ("%5.1f %10.2f %8.2f", | |
420 | total_time > 0.0 ? 100 * sym->hist.time / total_time : 0.0, | |
421 | accum_time / hz, sym->hist.time / hz); | |
422 | } | |
423 | else | |
424 | { | |
425 | printf ("%6.2f %9.2f %8.2f", | |
426 | total_time > 0.0 ? 100 * sym->hist.time / total_time : 0.0, | |
427 | accum_time / hz, sym->hist.time / hz); | |
03c35bcb | 428 | } |
12516a37 KR |
429 | if (sym->ncalls) |
430 | { | |
431 | printf (" %8d %8.2f %8.2f ", | |
432 | sym->ncalls, scale * sym->hist.time / hz / sym->ncalls, | |
433 | scale * (sym->hist.time + sym->cg.child_time) / hz / sym->ncalls); | |
434 | } | |
435 | else | |
436 | { | |
437 | printf (" %8.8s %8.8s %8.8s ", "", "", ""); | |
03c35bcb | 438 | } |
12516a37 KR |
439 | if (bsd_style_output) |
440 | { | |
441 | print_name (sym); | |
442 | } | |
443 | else | |
444 | { | |
445 | print_name_only (sym); | |
03c35bcb | 446 | } |
12516a37 | 447 | printf ("\n"); |
03c35bcb | 448 | } |
5489fcc3 KR |
449 | |
450 | ||
451 | /* | |
452 | * Compare LP and RP. The primary comparison key is execution time, | |
453 | * the secondary is number of invocation, and the tertiary is the | |
454 | * lexicographic order of the function names. | |
455 | */ | |
456 | static int | |
12516a37 | 457 | DEFUN (cmp_time, (lp, rp), const PTR lp AND const PTR rp) |
5489fcc3 | 458 | { |
12516a37 KR |
459 | const Sym *left = *(const Sym **) lp; |
460 | const Sym *right = *(const Sym **) rp; | |
461 | double time_diff; | |
462 | long call_diff; | |
463 | ||
464 | time_diff = right->hist.time - left->hist.time; | |
465 | if (time_diff > 0.0) | |
466 | { | |
467 | return 1; | |
03c35bcb | 468 | } |
12516a37 KR |
469 | if (time_diff < 0.0) |
470 | { | |
471 | return -1; | |
03c35bcb | 472 | } |
12516a37 KR |
473 | |
474 | call_diff = right->ncalls - left->ncalls; | |
475 | if (call_diff > 0) | |
476 | { | |
477 | return 1; | |
03c35bcb | 478 | } |
12516a37 KR |
479 | if (call_diff < 0) |
480 | { | |
481 | return -1; | |
03c35bcb | 482 | } |
12516a37 KR |
483 | |
484 | return strcmp (left->name, right->name); | |
03c35bcb | 485 | } |
5489fcc3 KR |
486 | |
487 | ||
488 | /* | |
489 | * Print the flat histogram profile. | |
490 | */ | |
491 | void | |
12516a37 | 492 | DEFUN_VOID (hist_print) |
5489fcc3 | 493 | { |
12516a37 KR |
494 | Sym **time_sorted_syms, *top_dog, *sym; |
495 | int index, log_scale; | |
496 | double top_time, time; | |
497 | bfd_vma addr; | |
498 | ||
499 | if (first_output) | |
500 | { | |
501 | first_output = FALSE; | |
502 | } | |
503 | else | |
504 | { | |
505 | printf ("\f\n"); | |
03c35bcb | 506 | } |
12516a37 KR |
507 | |
508 | accum_time = 0.0; | |
509 | if (bsd_style_output) | |
510 | { | |
511 | if (print_descriptions) | |
512 | { | |
513 | printf ("\n\n\nflat profile:\n"); | |
514 | flat_blurb (stdout); | |
03c35bcb | 515 | } |
12516a37 KR |
516 | } |
517 | else | |
518 | { | |
519 | printf ("Flat profile:\n"); | |
03c35bcb | 520 | } |
12516a37 KR |
521 | /* |
522 | * Sort the symbol table by time (call-count and name as secondary | |
523 | * and tertiary keys): | |
524 | */ | |
525 | time_sorted_syms = (Sym **) xmalloc (symtab.len * sizeof (Sym *)); | |
526 | for (index = 0; index < symtab.len; ++index) | |
527 | { | |
528 | time_sorted_syms[index] = &symtab.base[index]; | |
03c35bcb | 529 | } |
12516a37 KR |
530 | qsort (time_sorted_syms, symtab.len, sizeof (Sym *), cmp_time); |
531 | ||
532 | if (bsd_style_output) | |
533 | { | |
534 | log_scale = 5; /* milli-seconds is BSD-default */ | |
535 | } | |
536 | else | |
537 | { | |
538 | /* | |
539 | * Search for symbol with highest per-call execution time and | |
540 | * scale accordingly: | |
541 | */ | |
542 | log_scale = 0; | |
543 | top_dog = 0; | |
544 | top_time = 0.0; | |
545 | for (index = 0; index < symtab.len; ++index) | |
546 | { | |
547 | sym = time_sorted_syms[index]; | |
548 | if (sym->ncalls) | |
549 | { | |
550 | time = (sym->hist.time + sym->cg.child_time) / sym->ncalls; | |
551 | if (time > top_time) | |
552 | { | |
553 | top_dog = sym; | |
554 | top_time = time; | |
03c35bcb KR |
555 | } |
556 | } | |
557 | } | |
12516a37 KR |
558 | if (top_dog && top_dog->ncalls && top_time > 0.0) |
559 | { | |
560 | top_time /= hz; | |
561 | while (SItab[log_scale].scale * top_time < 1000.0 | |
562 | && log_scale < sizeof (SItab) / sizeof (SItab[0]) - 1) | |
5489fcc3 | 563 | { |
12516a37 | 564 | ++log_scale; |
03c35bcb KR |
565 | } |
566 | } | |
567 | } | |
12516a37 KR |
568 | |
569 | /* | |
570 | * For now, the dimension is always seconds. In the future, we | |
571 | * may also want to support other (pseudo-)dimensions (such as | |
572 | * I-cache misses etc.). | |
573 | */ | |
574 | print_header (SItab[log_scale].prefix); | |
575 | for (index = 0; index < symtab.len; ++index) | |
576 | { | |
577 | addr = time_sorted_syms[index]->addr; | |
578 | /* | |
579 | * Print symbol if its in INCL_FLAT table or that table | |
580 | * is empty and the symbol is not in EXCL_FLAT. | |
581 | */ | |
582 | if (sym_lookup (&syms[INCL_FLAT], addr) | |
583 | || (syms[INCL_FLAT].len == 0 | |
584 | && !sym_lookup (&syms[EXCL_FLAT], addr))) | |
5489fcc3 | 585 | { |
12516a37 | 586 | print_line (time_sorted_syms[index], SItab[log_scale].scale); |
03c35bcb KR |
587 | } |
588 | } | |
12516a37 | 589 | free (time_sorted_syms); |
5489fcc3 | 590 | |
12516a37 KR |
591 | if (print_descriptions && !bsd_style_output) |
592 | { | |
593 | flat_blurb (stdout); | |
03c35bcb KR |
594 | } |
595 | } |