usr.sbin/pmcstat/pmcpl_callgraph.c

   1 /*-
   2  * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
   3  *
   4  * Copyright (c) 2005-2007, Joseph Koshy
   5  * Copyright (c) 2007 The FreeBSD Foundation
   6  * All rights reserved.
   7  *
   8  * Portions of this software were developed by A. Joseph Koshy under
   9  * sponsorship from the FreeBSD Foundation and Google, Inc.
  10  *
  11  * Redistribution and use in source and binary forms, with or without
  12  * modification, are permitted provided that the following conditions
  13  * are met:
  14  * 1. Redistributions of source code must retain the above copyright
  15  *    notice, this list of conditions and the following disclaimer.
  16  * 2. Redistributions in binary form must reproduce the above copyright
  17  *    notice, this list of conditions and the following disclaimer in the
  18  *    documentation and/or other materials provided with the distribution.
  19  *
  20  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  30  * SUCH DAMAGE.
  31  */
  32
  33 /*
  34  * Transform a hwpmc(4) log into human readable form, and into
  35  * gprof(1) compatible profiles.
  36  */
  37
  38 #include <sys/cdefs.h>
  39 __FBSDID("$FreeBSD$");
  40
  41 #include <sys/param.h>
  42 #include <sys/endian.h>
  43 #include <sys/gmon.h>
  44 #include <sys/imgact_aout.h>
  45 #include <sys/imgact_elf.h>
  46 #include <sys/mman.h>
  47 #include <sys/pmc.h>
  48 #include <sys/queue.h>
  49 #include <sys/socket.h>
  50 #include <sys/stat.h>
  51 #include <sys/wait.h>
  52
  53 #include <netinet/in.h>
  54
  55 #include <assert.h>
  56 #include <curses.h>
  57 #include <err.h>
  58 #include <errno.h>
  59 #include <fcntl.h>
  60 #include <gelf.h>
  61 #include <libgen.h>
  62 #include <limits.h>
  63 #include <netdb.h>
  64 #include <pmc.h>
  65 #include <pmclog.h>
  66 #include <sysexits.h>
  67 #include <stdint.h>
  68 #include <stdio.h>
  69 #include <stdlib.h>
  70 #include <string.h>
  71 #include <unistd.h>
  72
  73 #include "pmcstat.h"
  74 #include "pmcstat_log.h"
  75 #include "pmcstat_top.h"
  76 #include "pmcpl_callgraph.h"
  77
  78 #define min(A,B)                ((A) < (B) ? (A) : (B))
  79 #define max(A,B)                ((A) > (B) ? (A) : (B))
  80
  81 /* Get the sample value in percent related to nsamples. */
  82 #define PMCPL_CG_COUNTP(a) \
  83         ((a)->pcg_count * 100.0 / nsamples)
  84
  85 /*
  86  * The toplevel CG nodes (i.e., with rank == 0) are placed in a hash table.
  87  */
  88
  89 struct pmcstat_cgnode_hash_list pmcstat_cgnode_hash[PMCSTAT_NHASH];
  90 int pmcstat_cgnode_hash_count;
  91
  92 static pmcstat_interned_string pmcstat_previous_filename_printed;
  93
  94 static struct pmcstat_cgnode *
  95 pmcstat_cgnode_allocate(struct pmcstat_image *image, uintfptr_t pc)
  96 {
  97         struct pmcstat_cgnode *cg;
  98
  99         if ((cg = malloc(sizeof(*cg))) == NULL)
 100                 err(EX_OSERR, "ERROR: Cannot allocate callgraph node");
 101
 102         cg->pcg_image = image;
 103         cg->pcg_func = pc;
 104
 105         cg->pcg_count = 0;
 106         cg->pcg_nchildren = 0;
 107         LIST_INIT(&cg->pcg_children);
 108
 109         return (cg);
 110 }
 111
 112 /*
 113  * Free a node and its children.
 114  */
 115 static void
 116 pmcstat_cgnode_free(struct pmcstat_cgnode *cg)
 117 {
 118         struct pmcstat_cgnode *cgc, *cgtmp;
 119
 120         LIST_FOREACH_SAFE(cgc, &cg->pcg_children, pcg_sibling, cgtmp)
 121                 pmcstat_cgnode_free(cgc);
 122         free(cg);
 123 }
 124
 125 /*
 126  * Look for a callgraph node associated with pmc `pmcid' in the global
 127  * hash table that corresponds to the given `pc' value in the process
 128  * `pp'.
 129  */
 130 static struct pmcstat_cgnode *
 131 pmcstat_cgnode_hash_lookup_pc(struct pmcstat_process *pp, pmc_id_t pmcid,
 132     uintfptr_t pc, int usermode)
 133 {
 134         struct pmcstat_pcmap *ppm;
 135         struct pmcstat_symbol *sym;
 136         struct pmcstat_image *image;
 137         struct pmcstat_cgnode *cg;
 138         struct pmcstat_cgnode_hash *h;
 139         uintfptr_t loadaddress;
 140         unsigned int i, hash;
 141
 142         ppm = pmcstat_process_find_map(usermode ? pp : pmcstat_kernproc, pc);
 143         if (ppm == NULL)
 144                 return (NULL);
 145
 146         image = ppm->ppm_image;
 147
 148         loadaddress = ppm->ppm_lowpc + image->pi_vaddr - image->pi_start;
 149         pc -= loadaddress;      /* Convert to an offset in the image. */
 150
 151         /*
 152          * Try determine the function at this offset.  If we can't
 153          * find a function round leave the `pc' value alone.
 154          */
 155         if ((sym = pmcstat_symbol_search(image, pc)) != NULL)
 156                 pc = sym->ps_start;
 157         else
 158                 pmcstat_stats.ps_samples_unknown_function++;
 159
 160         for (hash = i = 0; i < sizeof(uintfptr_t); i++)
 161                 hash += (pc >> i) & 0xFF;
 162
 163         hash &= PMCSTAT_HASH_MASK;
 164
 165         cg = NULL;
 166         LIST_FOREACH(h, &pmcstat_cgnode_hash[hash], pch_next)
 167         {
 168                 if (h->pch_pmcid != pmcid)
 169                         continue;
 170
 171                 cg = h->pch_cgnode;
 172
 173                 assert(cg != NULL);
 174
 175                 if (cg->pcg_image == image && cg->pcg_func == pc)
 176                         return (cg);
 177         }
 178
 179         /*
 180          * We haven't seen this (pmcid, pc) tuple yet, so allocate a
 181          * new callgraph node and a new hash table entry for it.
 182          */
 183         cg = pmcstat_cgnode_allocate(image, pc);
 184         if ((h = malloc(sizeof(*h))) == NULL)
 185                 err(EX_OSERR, "ERROR: Could not allocate callgraph node");
 186
 187         h->pch_pmcid = pmcid;
 188         h->pch_cgnode = cg;
 189         LIST_INSERT_HEAD(&pmcstat_cgnode_hash[hash], h, pch_next);
 190
 191         pmcstat_cgnode_hash_count++;
 192
 193         return (cg);
 194 }
 195
 196 /*
 197  * Compare two callgraph nodes for sorting.
 198  */
 199 static int
 200 pmcstat_cgnode_compare(const void *a, const void *b)
 201 {
 202         const struct pmcstat_cgnode *const *pcg1, *const *pcg2, *cg1, *cg2;
 203
 204         pcg1 = (const struct pmcstat_cgnode *const *) a;
 205         cg1 = *pcg1;
 206         pcg2 = (const struct pmcstat_cgnode *const *) b;
 207         cg2 = *pcg2;
 208
 209         /* Sort in reverse order */
 210         if (cg1->pcg_count < cg2->pcg_count)
 211                 return (1);
 212         if (cg1->pcg_count > cg2->pcg_count)
 213                 return (-1);
 214         return (0);
 215 }
 216
 217 /*
 218  * Find (allocating if a needed) a callgraph node in the given
 219  * parent with the same (image, pcoffset) pair.
 220  */
 221
 222 static struct pmcstat_cgnode *
 223 pmcstat_cgnode_find(struct pmcstat_cgnode *parent, struct pmcstat_image *image,
 224     uintfptr_t pcoffset)
 225 {
 226         struct pmcstat_cgnode *child;
 227
 228         LIST_FOREACH(child, &parent->pcg_children, pcg_sibling) {
 229                 if (child->pcg_image == image &&
 230                     child->pcg_func == pcoffset)
 231                         return (child);
 232         }
 233
 234         /*
 235          * Allocate a new structure.
 236          */
 237
 238         child = pmcstat_cgnode_allocate(image, pcoffset);
 239
 240         /*
 241          * Link it into the parent.
 242          */
 243         LIST_INSERT_HEAD(&parent->pcg_children, child, pcg_sibling);
 244         parent->pcg_nchildren++;
 245
 246         return (child);
 247 }
 248
 249 /*
 250  * Print one callgraph node.  The output format is:
 251  *
 252  * indentation %(parent's samples) #nsamples function@object
 253  */
 254 static void
 255 pmcstat_cgnode_print(struct pmcstat_cgnode *cg, int depth, uint32_t total)
 256 {
 257         uint32_t n;
 258         const char *space;
 259         struct pmcstat_symbol *sym;
 260         struct pmcstat_cgnode **sortbuffer, **cgn, *pcg;
 261
 262         space = " ";
 263
 264         if (depth > 0)
 265                 (void) fprintf(args.pa_graphfile, "%*s", depth, space);
 266
 267         if (cg->pcg_count == total)
 268                 (void) fprintf(args.pa_graphfile, "100.0%% ");
 269         else
 270                 (void) fprintf(args.pa_graphfile, "%05.2f%% ",
 271                     100.0 * cg->pcg_count / total);
 272
 273         n = fprintf(args.pa_graphfile, " [%u] ", cg->pcg_count);
 274
 275         /* #samples is a 12 character wide field. */
 276         if (n < 12)
 277                 (void) fprintf(args.pa_graphfile, "%*s", 12 - n, space);
 278
 279         if (depth > 0)
 280                 (void) fprintf(args.pa_graphfile, "%*s", depth, space);
 281
 282         sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
 283         if (sym)
 284                 (void) fprintf(args.pa_graphfile, "%s",
 285                     pmcstat_string_unintern(sym->ps_name));
 286         else
 287                 (void) fprintf(args.pa_graphfile, "%p",
 288                     (void *) (cg->pcg_image->pi_vaddr + cg->pcg_func));
 289
 290         if (pmcstat_previous_filename_printed !=
 291             cg->pcg_image->pi_fullpath) {
 292                 pmcstat_previous_filename_printed = cg->pcg_image->pi_fullpath;
 293                 (void) fprintf(args.pa_graphfile, " @ %s\n",
 294                     pmcstat_string_unintern(
 295                     pmcstat_previous_filename_printed));
 296         } else
 297                 (void) fprintf(args.pa_graphfile, "\n");
 298
 299         if (cg->pcg_nchildren == 0)
 300                 return;
 301
 302         if ((sortbuffer = (struct pmcstat_cgnode **)
 303                 malloc(sizeof(struct pmcstat_cgnode *) *
 304                     cg->pcg_nchildren)) == NULL)
 305                 err(EX_OSERR, "ERROR: Cannot print callgraph");
 306         cgn = sortbuffer;
 307
 308         LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)
 309             *cgn++ = pcg;
 310
 311         assert(cgn - sortbuffer == (int) cg->pcg_nchildren);
 312
 313         qsort(sortbuffer, cg->pcg_nchildren, sizeof(struct pmcstat_cgnode *),
 314             pmcstat_cgnode_compare);
 315
 316         for (cgn = sortbuffer, n = 0; n < cg->pcg_nchildren; n++, cgn++)
 317                 pmcstat_cgnode_print(*cgn, depth+1, cg->pcg_count);
 318
 319         free(sortbuffer);
 320 }
 321
 322 /*
 323  * Record a callchain.
 324  */
 325
 326 void
 327 pmcpl_cg_process(struct pmcstat_process *pp, struct pmcstat_pmcrecord *pmcr,
 328     uint32_t nsamples, uintfptr_t *cc, int usermode, uint32_t cpu)
 329 {
 330         uintfptr_t pc, loadaddress;
 331         uint32_t n;
 332         struct pmcstat_image *image;
 333         struct pmcstat_pcmap *ppm;
 334         struct pmcstat_symbol *sym;
 335         struct pmcstat_cgnode *parent, *child;
 336         struct pmcstat_process *km;
 337         pmc_id_t pmcid;
 338
 339         (void) cpu;
 340
 341         /*
 342          * Find the callgraph node recorded in the global hash table
 343          * for this (pmcid, pc).
 344          */
 345
 346         pc = cc[0];
 347         pmcid = pmcr->pr_pmcid;
 348         child = parent = pmcstat_cgnode_hash_lookup_pc(pp, pmcid, pc, usermode);
 349         if (parent == NULL) {
 350                 pmcstat_stats.ps_callchain_dubious_frames++;
 351                 pmcr->pr_dubious_frames++;
 352                 return;
 353         }
 354
 355         parent->pcg_count++;
 356
 357         /*
 358          * For each return address in the call chain record, subject
 359          * to the maximum depth desired.
 360          * - Find the image associated with the sample.  Stop if there
 361          *   there is no valid image at that address.
 362          * - Find the function that overlaps the return address.
 363          * - If found: use the start address of the function.
 364          *   If not found (say an object's symbol table is not present or
 365          *   is incomplete), round down to th gprof bucket granularity.
 366          * - Convert return virtual address to an offset in the image.
 367          * - Look for a child with the same {offset,image} tuple,
 368          *   inserting one if needed.
 369          * - Increment the count of occurrences of the child.
 370          */
 371         km = pmcstat_kernproc;
 372
 373         for (n = 1; n < (uint32_t) args.pa_graphdepth && n < nsamples; n++,
 374             parent = child) {
 375                 pc = cc[n];
 376
 377                 ppm = pmcstat_process_find_map(usermode ? pp : km, pc);
 378                 if (ppm == NULL) {
 379                         /* Detect full frame capture (kernel + user). */
 380                         if (!usermode) {
 381                                 ppm = pmcstat_process_find_map(pp, pc);
 382                                 if (ppm != NULL)
 383                                         km = pp;
 384                         }
 385                 }
 386                 if (ppm == NULL)
 387                         continue;
 388
 389                 image = ppm->ppm_image;
 390                 loadaddress = ppm->ppm_lowpc + image->pi_vaddr -
 391                     image->pi_start;
 392                 pc -= loadaddress;
 393
 394                 if ((sym = pmcstat_symbol_search(image, pc)) != NULL)
 395                         pc = sym->ps_start;
 396
 397                 child = pmcstat_cgnode_find(parent, image, pc);
 398                 child->pcg_count++;
 399         }
 400 }
 401
 402 /*
 403  * Printing a callgraph for a PMC.
 404  */
 405 static void
 406 pmcstat_callgraph_print_for_pmcid(struct pmcstat_pmcrecord *pmcr)
 407 {
 408         int n, nentries;
 409         uint32_t nsamples;
 410         pmc_id_t pmcid;
 411         struct pmcstat_cgnode **sortbuffer, **cgn;
 412         struct pmcstat_cgnode_hash *pch;
 413
 414         /*
 415          * We pull out all callgraph nodes in the top-level hash table
 416          * with a matching PMC id.  We then sort these based on the
 417          * frequency of occurrence.  Each callgraph node is then
 418          * printed.
 419          */
 420
 421         nsamples = 0;
 422         pmcid = pmcr->pr_pmcid;
 423         if ((sortbuffer = (struct pmcstat_cgnode **)
 424             malloc(sizeof(struct pmcstat_cgnode *) *
 425             pmcstat_cgnode_hash_count)) == NULL)
 426                 err(EX_OSERR, "ERROR: Cannot sort callgraph");
 427         cgn = sortbuffer;
 428
 429         for (n = 0; n < PMCSTAT_NHASH; n++)
 430                 LIST_FOREACH(pch, &pmcstat_cgnode_hash[n], pch_next)
 431                     if (pch->pch_pmcid == pmcid) {
 432                             nsamples += pch->pch_cgnode->pcg_count;
 433                             *cgn++ = pch->pch_cgnode;
 434                     }
 435
 436         nentries = cgn - sortbuffer;
 437         assert(nentries <= pmcstat_cgnode_hash_count);
 438
 439         if (nentries == 0) {
 440                 free(sortbuffer);
 441                 return;
 442         }
 443
 444         qsort(sortbuffer, nentries, sizeof(struct pmcstat_cgnode *),
 445             pmcstat_cgnode_compare);
 446
 447         (void) fprintf(args.pa_graphfile,
 448             "@ %s [%u samples]\n\n",
 449             pmcstat_string_unintern(pmcr->pr_pmcname),
 450             nsamples);
 451
 452         for (cgn = sortbuffer, n = 0; n < nentries; n++, cgn++) {
 453                 pmcstat_previous_filename_printed = NULL;
 454                 pmcstat_cgnode_print(*cgn, 0, nsamples);
 455                 (void) fprintf(args.pa_graphfile, "\n");
 456         }
 457
 458         free(sortbuffer);
 459 }
 460
 461 /*
 462  * Print out callgraphs.
 463  */
 464
 465 static void
 466 pmcstat_callgraph_print(void)
 467 {
 468         struct pmcstat_pmcrecord *pmcr;
 469
 470         LIST_FOREACH(pmcr, &pmcstat_pmcs, pr_next)
 471             pmcstat_callgraph_print_for_pmcid(pmcr);
 472 }
 473
 474 static void
 475 pmcstat_cgnode_topprint(struct pmcstat_cgnode *cg,
 476     int depth __unused, uint32_t nsamples)
 477 {
 478         int v_attrs, vs_len, ns_len, width, len, n, nchildren;
 479         float v;
 480         char ns[30], vs[10];
 481         struct pmcstat_symbol *sym;
 482         struct pmcstat_cgnode **sortbuffer, **cgn, *pcg;
 483
 484         /* Format value. */
 485         v = PMCPL_CG_COUNTP(cg);
 486         snprintf(vs, sizeof(vs), "%.1f", v);
 487         v_attrs = PMCSTAT_ATTRPERCENT(v);
 488         sym = NULL;
 489
 490         /* Format name. */
 491         if (!(args.pa_flags & FLAG_SKIP_TOP_FN_RES))
 492                 sym = pmcstat_symbol_search(cg->pcg_image, cg->pcg_func);
 493         if (sym != NULL) {
 494                 snprintf(ns, sizeof(ns), "%s",
 495                     pmcstat_string_unintern(sym->ps_name));
 496         } else
 497                 snprintf(ns, sizeof(ns), "%p",
 498                     (void *)(cg->pcg_image->pi_vaddr + cg->pcg_func));
 499
 500         PMCSTAT_ATTRON(v_attrs);
 501         PMCSTAT_PRINTW("%5.5s", vs);
 502         PMCSTAT_ATTROFF(v_attrs);
 503         PMCSTAT_PRINTW(" %-10.10s %-20.20s",
 504             pmcstat_string_unintern(cg->pcg_image->pi_name),
 505             ns);
 506
 507         nchildren = cg->pcg_nchildren;
 508         if (nchildren == 0) {
 509                 PMCSTAT_PRINTW("\n");
 510                 return;
 511         }
 512
 513         width = pmcstat_displaywidth - 40;
 514
 515         if ((sortbuffer = (struct pmcstat_cgnode **)
 516                 malloc(sizeof(struct pmcstat_cgnode *) *
 517                     nchildren)) == NULL)
 518                 err(EX_OSERR, "ERROR: Cannot print callgraph");
 519         cgn = sortbuffer;
 520
 521         LIST_FOREACH(pcg, &cg->pcg_children, pcg_sibling)
 522             *cgn++ = pcg;
 523
 524         assert(cgn - sortbuffer == (int)nchildren);
 525
 526         qsort(sortbuffer, nchildren, sizeof(struct pmcstat_cgnode *),
 527             pmcstat_cgnode_compare);
 528
 529         /* Count how many callers. */
 530         for (cgn = sortbuffer, n = 0; n < nchildren; n++, cgn++) {
 531                 pcg = *cgn;
 532
 533                 v = PMCPL_CG_COUNTP(pcg);
 534                 if (v < pmcstat_threshold)
 535                         break;
 536         }
 537         nchildren = n;
 538
 539         for (cgn = sortbuffer, n = 0; n < nchildren; n++, cgn++) {
 540                 pcg = *cgn;
 541
 542                 /* Format value. */
 543                 if (nchildren > 1) {
 544                         v = PMCPL_CG_COUNTP(pcg);
 545                         vs_len = snprintf(vs, sizeof(vs), ":%.1f", v);
 546                         v_attrs = PMCSTAT_ATTRPERCENT(v);
 547                 } else
 548                         vs_len = 0;
 549
 550                 /* Format name. */
 551                 sym = pmcstat_symbol_search(pcg->pcg_image, pcg->pcg_func);
 552                 if (sym != NULL) {
 553                         ns_len = snprintf(ns, sizeof(ns), "%s",
 554                             pmcstat_string_unintern(sym->ps_name));
 555                 } else
 556                         ns_len = snprintf(ns, sizeof(ns), "%p",
 557                             (void *)pcg->pcg_func);
 558
 559                 len = ns_len + vs_len + 1;
 560                 if (width - len < 0) {
 561                         PMCSTAT_PRINTW(" ...");
 562                         break;
 563                 }
 564                 width -= len;
 565
 566                 PMCSTAT_PRINTW(" %s", ns);
 567                 if (nchildren > 1) {
 568                         PMCSTAT_ATTRON(v_attrs);
 569                         PMCSTAT_PRINTW("%s", vs);
 570                         PMCSTAT_ATTROFF(v_attrs);
 571                 }
 572         }
 573         PMCSTAT_PRINTW("\n");
 574         free(sortbuffer);
 575 }
 576
 577 /*
 578  * Top mode display.
 579  */
 580
 581 void
 582 pmcpl_cg_topdisplay(void)
 583 {
 584         int n, nentries;
 585         uint32_t nsamples;
 586         struct pmcstat_cgnode **sortbuffer, **cgn;
 587         struct pmcstat_cgnode_hash *pch;
 588         struct pmcstat_pmcrecord *pmcr;
 589
 590         pmcr = pmcstat_pmcindex_to_pmcr(pmcstat_pmcinfilter);
 591         if (!pmcr)
 592                 err(EX_SOFTWARE, "ERROR: invalid pmcindex");
 593
 594         /*
 595          * We pull out all callgraph nodes in the top-level hash table
 596          * with a matching PMC index.  We then sort these based on the
 597          * frequency of occurrence.  Each callgraph node is then
 598          * printed.
 599          */
 600
 601         nsamples = 0;
 602
 603         if ((sortbuffer = (struct pmcstat_cgnode **)
 604             malloc(sizeof(struct pmcstat_cgnode *) *
 605             pmcstat_cgnode_hash_count)) == NULL)
 606                 err(EX_OSERR, "ERROR: Cannot sort callgraph");
 607         cgn = sortbuffer;
 608
 609         for (n = 0; n < PMCSTAT_NHASH; n++)
 610                 LIST_FOREACH(pch, &pmcstat_cgnode_hash[n], pch_next)
 611                     if (pmcr == NULL || pch->pch_pmcid == pmcr->pr_pmcid) {
 612                             nsamples += pch->pch_cgnode->pcg_count;
 613                             *cgn++ = pch->pch_cgnode;
 614                     }
 615
 616         nentries = cgn - sortbuffer;
 617         assert(nentries <= pmcstat_cgnode_hash_count);
 618
 619         if (nentries == 0) {
 620                 free(sortbuffer);
 621                 return;
 622         }
 623
 624         qsort(sortbuffer, nentries, sizeof(struct pmcstat_cgnode *),
 625             pmcstat_cgnode_compare);
 626
 627         PMCSTAT_PRINTW("%5.5s %-10.10s %-20.20s %s\n",
 628             "%SAMP", "IMAGE", "FUNCTION", "CALLERS");
 629
 630         nentries = min(pmcstat_displayheight - 2, nentries);
 631
 632         for (cgn = sortbuffer, n = 0; n < nentries; n++, cgn++) {
 633                 if (PMCPL_CG_COUNTP(*cgn) < pmcstat_threshold)
 634                         break;
 635                 pmcstat_cgnode_topprint(*cgn, 0, nsamples);
 636         }
 637
 638         free(sortbuffer);
 639 }
 640
 641 /*
 642  * Handle top mode keypress.
 643  */
 644
 645 int
 646 pmcpl_cg_topkeypress(int c, void *arg)
 647 {
 648         WINDOW *w;
 649
 650         w = (WINDOW *)arg;
 651
 652         (void) c; (void) w;
 653
 654         return 0;
 655 }
 656
 657 int
 658 pmcpl_cg_init(void)
 659 {
 660         int i;
 661
 662         pmcstat_cgnode_hash_count = 0;
 663         pmcstat_previous_filename_printed = NULL;
 664
 665         for (i = 0; i < PMCSTAT_NHASH; i++) {
 666                 LIST_INIT(&pmcstat_cgnode_hash[i]);
 667         }
 668
 669         return (0);
 670 }
 671
 672 void
 673 pmcpl_cg_shutdown(FILE *mf)
 674 {
 675         int i;
 676         struct pmcstat_cgnode_hash *pch, *pchtmp;
 677
 678         (void) mf;
 679
 680         if (args.pa_flags & FLAG_DO_CALLGRAPHS)
 681                 pmcstat_callgraph_print();
 682
 683         /*
 684          * Free memory.
 685          */
 686         for (i = 0; i < PMCSTAT_NHASH; i++) {
 687                 LIST_FOREACH_SAFE(pch, &pmcstat_cgnode_hash[i], pch_next,
 688                     pchtmp) {
 689                         pmcstat_cgnode_free(pch->pch_cgnode);
 690                         LIST_REMOVE(pch, pch_next);
 691                         free(pch);
 692                 }
 693         }
 694 }
 695