usr.bin/gprof/gprof.h

   1 /*
   2  * Copyright (c) 1983, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  * 3. All advertising materials mentioning features or use of this software
  14  *    must display the following acknowledgement:
  15  *      This product includes software developed by the University of
  16  *      California, Berkeley and its contributors.
  17  * 4. Neither the name of the University nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  *
  33  *      @(#)gprof.h     8.1 (Berkeley) 6/6/93
  34  * $DragonFly: src/usr.bin/gprof/gprof.h,v 1.3 2006/08/25 22:37:09 swildner Exp $
  35  */
  36
  37 #include <sys/types.h>
  38 #include <sys/stat.h>
  39 #include <sys/gmon.h>
  40
  41 #include <stdio.h>
  42 #include <stdlib.h>
  43
  44 #if vax
  45 #   include "vax.h"
  46 #endif
  47 #if sparc
  48 #   include "sparc.h"
  49 #endif
  50 #if tahoe
  51 #   include "tahoe.h"
  52 #endif
  53 #if hp300
  54 #   include "hp300.h"
  55 #endif
  56 #if luna68k
  57 #   include "luna68k.h"
  58 #endif
  59 #if i386
  60 #   include "i386.h"
  61 #endif
  62 #if mips
  63 #   include "mips.h"
  64 #endif
  65 #if __amd64__
  66 #   include "amd64.h"
  67 #endif
  68
  69
  70     /*
  71      * booleans
  72      */
  73 typedef int     bool;
  74 #define FALSE   0
  75 #define TRUE    1
  76
  77     /*
  78      *  ticks per second
  79      */
  80 long    hz;
  81
  82 #ifdef GPROF4
  83 typedef int64_t UNIT;
  84 #else
  85 typedef u_short UNIT;           /* unit of profiling */
  86 #endif
  87 #define UNITS_TO_CODE   (OFFSET_OF_CODE / sizeof(UNIT))
  88
  89 char    *a_outname;
  90 #define A_OUTNAME               "a.out"
  91
  92 char    *gmonname;
  93 #define GMONSUM                 "gmon.sum"
  94
  95     /*
  96      *  a constructed arc,
  97      *      with pointers to the namelist entry of the parent and the child,
  98      *      a count of how many times this arc was traversed,
  99      *      and pointers to the next parent of this child and
 100      *          the next child of this parent.
 101      */
 102 struct arcstruct {
 103     struct nl           *arc_parentp;   /* pointer to parent's nl entry */
 104     struct nl           *arc_childp;    /* pointer to child's nl entry */
 105     long                arc_count;      /* num calls from parent to child */
 106     double              arc_time;       /* time inherited along arc */
 107     double              arc_childtime;  /* childtime inherited along arc */
 108     struct arcstruct    *arc_parentlist; /* parents-of-this-child list */
 109     struct arcstruct    *arc_childlist; /* children-of-this-parent list */
 110     struct arcstruct    *arc_next;      /* list of arcs on cycle */
 111     unsigned short      arc_cyclecnt;   /* num cycles involved in */
 112     unsigned short      arc_flags;      /* see below */
 113 };
 114 typedef struct arcstruct        arctype;
 115
 116     /*
 117      * arc flags
 118      */
 119 #define DEADARC 0x01    /* time should not propagate across the arc */
 120 #define ONLIST  0x02    /* arc is on list of arcs in cycles */
 121
 122     /*
 123      * The symbol table;
 124      * for each external in the specified file we gather
 125      * its address, the number of calls and compute its share of cpu time.
 126      */
 127 struct nl {
 128     const char          *name;          /* the name */
 129     unsigned long       value;          /* the pc entry point */
 130     unsigned long       svalue;         /* entry point aligned to histograms */
 131     double              time;           /* ticks in this routine */
 132     double              childtime;      /* cumulative ticks in children */
 133     long                ncall;          /* how many times called */
 134     long                npropcall;      /* times called by live arcs */
 135     long                selfcalls;      /* how many calls to self */
 136     double              propfraction;   /* what % of time propagates */
 137     double              propself;       /* how much self time propagates */
 138     double              propchild;      /* how much child time propagates */
 139     short               printflag;      /* should this be printed? */
 140     short               flags;          /* see below */
 141     int                 index;          /* index in the graph list */
 142     int                 toporder;       /* graph call chain top-sort order */
 143     int                 cycleno;        /* internal number of cycle on */
 144     int                 parentcnt;      /* number of live parent arcs */
 145     struct nl           *cyclehead;     /* pointer to head of cycle */
 146     struct nl           *cnext;         /* pointer to next member of cycle */
 147     arctype             *parents;       /* list of caller arcs */
 148     arctype             *children;      /* list of callee arcs */
 149 };
 150 typedef struct nl       nltype;
 151
 152 nltype  *nl;                    /* the whole namelist */
 153 nltype  *npe;                   /* the virtual end of the namelist */
 154 int     nname;                  /* the number of function names */
 155
 156 #define HASCYCLEXIT     0x08    /* node has arc exiting from cycle */
 157 #define CYCLEHEAD       0x10    /* node marked as head of a cycle */
 158 #define VISITED         0x20    /* node visited during a cycle */
 159
 160     /*
 161      * The cycle list.
 162      * for each subcycle within an identified cycle, we gather
 163      * its size and the list of included arcs.
 164      */
 165 struct cl {
 166     int         size;           /* length of cycle */
 167     struct cl   *next;          /* next member of list */
 168     arctype     *list[1];       /* list of arcs in cycle */
 169     /* actually longer */
 170 };
 171 typedef struct cl cltype;
 172
 173 arctype *archead;               /* the head of arcs in current cycle list */
 174 cltype  *cyclehead;             /* the head of the list */
 175 int     cyclecnt;               /* the number of cycles found */
 176 #define CYCLEMAX        100     /* maximum cycles before cutting one of them */
 177
 178     /*
 179      *  flag which marks a nl entry as topologically ``busy''
 180      *  flag which marks a nl entry as topologically ``not_numbered''
 181      */
 182 #define DFN_BUSY        -1
 183 #define DFN_NAN         0
 184
 185     /*
 186      *  namelist entries for cycle headers.
 187      *  the number of discovered cycles.
 188      */
 189 nltype  *cyclenl;               /* cycle header namelist */
 190 int     ncycle;                 /* number of cycles discovered */
 191
 192     /*
 193      * The header on the gmon.out file.
 194      * gmon.out consists of a struct phdr (defined in gmon.h)
 195      * and then an array of ncnt samples representing the
 196      * discretized program counter values.
 197      *
 198      *  Backward compatible old style header
 199      */
 200 struct ophdr {
 201     UNIT        *lpc;
 202     UNIT        *hpc;
 203     int         ncnt;
 204 };
 205
 206 int     debug;
 207
 208     /*
 209      * Each discretized pc sample has
 210      * a count of the number of samples in its range
 211      */
 212 UNIT    *samples;
 213
 214 unsigned long   s_lowpc;        /* lowpc from the profile file */
 215 unsigned long   s_highpc;       /* highpc from the profile file */
 216 unsigned long   lowpc, highpc;  /* range profiled, in UNIT's */
 217 unsigned sampbytes;             /* number of bytes of samples */
 218 int     nsamples;               /* number of samples */
 219 double  actime;                 /* accumulated time thus far for putprofline */
 220 double  totime;                 /* total time for all routines */
 221 double  printtime;              /* total of time being printed */
 222 double  scale;                  /* scale factor converting samples to pc
 223                                    values: each sample covers scale bytes */
 224 unsigned char   *textspace;     /* text space of a.out in core */
 225 int     cyclethreshold;         /* with -C, minimum cycle size to ignore */
 226
 227     /*
 228      *  option flags, from a to z.
 229      */
 230 bool    aflag;                          /* suppress static functions */
 231 bool    bflag;                          /* blurbs, too */
 232 bool    cflag;                          /* discovered call graph, too */
 233 bool    Cflag;                          /* find cut-set to eliminate cycles */
 234 bool    dflag;                          /* debugging options */
 235 bool    eflag;                          /* specific functions excluded */
 236 bool    Eflag;                          /* functions excluded with time */
 237 bool    fflag;                          /* specific functions requested */
 238 bool    Fflag;                          /* functions requested with time */
 239 bool    kflag;                          /* arcs to be deleted */
 240 bool    sflag;                          /* sum multiple gmon.out files */
 241 bool    uflag;                          /* suppress symbols hidden from C */
 242 bool    zflag;                          /* zero time/called functions, too */
 243
 244     /*
 245      *  structure for various string lists
 246      */
 247 struct stringlist {
 248     struct stringlist   *next;
 249     char                *string;
 250 };
 251 struct stringlist       *elist;
 252 struct stringlist       *Elist;
 253 struct stringlist       *flist;
 254 struct stringlist       *Flist;
 255 struct stringlist       *kfromlist;
 256 struct stringlist       *ktolist;
 257
 258     /*
 259      *  function declarations
 260      */
 261 /*
 262                 addarc();
 263 */
 264 int             aout_getnfile(const char *, char ***);
 265 int             arccmp();
 266 arctype         *arclookup();
 267 /*
 268                 asgnsamples();
 269                 printblurb();
 270                 cyclelink();
 271                 dfn();
 272 */
 273 bool            dfn_busy();
 274 /*
 275                 dfn_findcycle();
 276 */
 277 bool            dfn_numbered();
 278 /*
 279                 dfn_post_visit();
 280                 dfn_pre_visit();
 281                 dfn_self_cycle();
 282 */
 283 nltype          **doarcs();
 284 /*
 285                 done();
 286 */
 287 int             elf_getnfile(const char *, char ***);
 288 /*
 289                 findcalls();
 290                 flatprofheader();
 291                 flatprofline();
 292 */
 293 /*
 294                 getpfile();
 295                 gprofheader();
 296                 gprofline();
 297                 main();
 298 */
 299 unsigned long   max();
 300 int             membercmp();
 301 unsigned long   min();
 302 nltype          *nllookup();
 303 FILE            *openpfile();
 304 long            operandlength();
 305 operandenum     operandmode();
 306 char            *operandname();
 307 /*
 308                 printchildren();
 309                 printcycle();
 310                 printgprof();
 311                 printmembers();
 312                 printname();
 313                 printparents();
 314                 printprof();
 315                 readsamples();
 316 */
 317 unsigned long   reladdr();
 318 /*
 319                 sortchildren();
 320                 sortmembers();
 321                 sortparents();
 322                 tally();
 323                 timecmp();
 324                 topcmp();
 325 */
 326 int             totalcmp();
 327 /*
 328                 valcmp();
 329 */
 330
 331 #define LESSTHAN        -1
 332 #define EQUALTO         0
 333 #define GREATERTHAN     1
 334
 335 #define DFNDEBUG        1
 336 #define CYCLEDEBUG      2
 337 #define ARCDEBUG        4
 338 #define TALLYDEBUG      8
 339 #define TIMEDEBUG       16
 340 #define SAMPLEDEBUG     32
 341 #define AOUTDEBUG       64
 342 #define CALLDEBUG       128
 343 #define LOOKUPDEBUG     256
 344 #define PROPDEBUG       512
 345 #define BREAKCYCLE      1024
 346 #define SUBCYCLELIST    2048
 347 #define ANYDEBUG        4096