BSD 4_3_Net_2 release

[unix-history] / usr / src / usr.bin / gprof / gprof.h

diff --git a/usr/src/usr.bin/gprof/gprof.h b/usr/src/usr.bin/gprof/gprof.h
index c97d27c..e34d570 100644 (file)
--- a/usr/src/usr.bin/gprof/gprof.h
+++ b/usr/src/usr.bin/gprof/gprof.h
@@ -1,23 +1,85 @@
-    /* sccsid:  @(#)gprof.h    1.4 (Berkeley) %G% */
+/*
+ * Copyright (c) 1983 Regents of the University of California.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *     This product includes software developed by the University of
+ *     California, Berkeley and its contributors.
+ * 4. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ *     @(#)gprof.h     5.10 (Berkeley) 4/24/91
+ */

 
 

-#include <stdio.h>

 #include <sys/types.h>
 #include <sys/stat.h>
 #include <a.out.h>
 #include <sys/types.h>
 #include <sys/stat.h>
 #include <a.out.h>

-#include <pagsiz.h>
-#include "monitor.h"
+#include <stdio.h>
+#include "gmon.h"
+
+#if vax
+#   include "vax.h"
+#endif
+#if sun
+#   include "sun.h"
+#endif
+#if tahoe
+#   include "tahoe.h"
+#endif
+#if hp300
+#   include "hp300.h"
+#endif
+#if i386
+#   include "i386.h"
+#endif
+
+
+    /*
+     * who am i, for error messages.
+     */
+char   *whoami;
+
+    /*
+     * booleans
+     */
+typedef int    bool;
+#define        FALSE   0
+#define        TRUE    1

 
     /*
      * ticks per second
      */
 
     /*
      * ticks per second
      */

-#define        HZ      60
+long   hz;

 
 

-typedef        short UNIT;             /* unit of profiling */
+typedef        u_short UNIT;           /* unit of profiling */

 char   *a_outname;
 #define        A_OUTNAME               "a.out"
 
 char   *gmonname;
 #define        GMONNAME                "gmon.out"
 char   *a_outname;
 #define        A_OUTNAME               "a.out"
 
 char   *gmonname;
 #define        GMONNAME                "gmon.out"

+#define        GMONSUM                 "gmon.sum"

 
     /*
      * a constructed arc,
 
     /*
      * a constructed arc,


@@ -38,78 +100,73 @@ struct arcstruct {
 typedef struct arcstruct       arctype;
 
     /*
 typedef struct arcstruct       arctype;
 
     /*

-     * a raw arc,
-     *     with pointers to the calling site and the called site
-     *     and a count.
+     * The symbol table;
+     * for each external in the specified file we gather
+     * its address, the number of calls and compute its share of cpu time.

      */
      */

-struct rawarc {
-    unsigned long      raw_frompc;
-    unsigned long      raw_selfpc;
-    long               raw_count;
-};
-/*
- * The symbol table;
- * for each external in the specified file we gather
- * its address, the number of calls and compute its share of cpu time.
- */

 struct nl {
 struct nl {

-       char            *name;          /* the name */
-       unsigned long   value;          /* the pc entry point */
-       double          time;           /* ticks in this routine */
-       double          childtime;      /* cumulative ticks in children */
-       long            ncall;          /* how many times called */
-       long            selfcalls;      /* how many calls to self */
-       int             index;          /* index in the graph list */
-       int             toporder;       /* graph call chain top-sort order */
-       int             cycleno;        /* internal number of cycle on */
-       struct nl       *cyclehead;     /* pointer to head of cycle */
-       struct nl       *cnext;         /* pointer to next member of cycle */
-       arctype         *parents;       /* list of caller arcs */
-       arctype         *children;      /* list of callee arcs */
+    char               *name;          /* the name */
+    unsigned long      value;          /* the pc entry point */
+    unsigned long      svalue;         /* entry point aligned to histograms */
+    double             time;           /* ticks in this routine */
+    double             childtime;      /* cumulative ticks in children */
+    long               ncall;          /* how many times called */
+    long               selfcalls;      /* how many calls to self */
+    double             propfraction;   /* what % of time propagates */
+    double             propself;       /* how much self time propagates */
+    double             propchild;      /* how much child time propagates */
+    bool               printflag;      /* should this be printed? */
+    int                        index;          /* index in the graph list */
+    int                        toporder;       /* graph call chain top-sort order */
+    int                        cycleno;        /* internal number of cycle on */
+    struct nl          *cyclehead;     /* pointer to head of cycle */
+    struct nl          *cnext;         /* pointer to next member of cycle */
+    arctype            *parents;       /* list of caller arcs */
+    arctype            *children;      /* list of callee arcs */

 };
 typedef struct nl      nltype;
 
 nltype *nl;                    /* the whole namelist */
 nltype *npe;                   /* the virtual end of the namelist */
 };
 typedef struct nl      nltype;
 
 nltype *nl;                    /* the whole namelist */
 nltype *npe;                   /* the virtual end of the namelist */

-int            nname;                  /* the number of function names */
+int    nname;                  /* the number of function names */

 
     /*
      * flag which marks a nl entry as topologically ``busy''
 
     /*
      * flag which marks a nl entry as topologically ``busy''

+     * flag which marks a nl entry as topologically ``not_numbered''

      */
 #define        DFN_BUSY        -1
      */
 #define        DFN_BUSY        -1

+#define        DFN_NAN         0

 
     /* 
 
     /* 

-     * the number of cycles is estimated as this fraction of nnames
-     * ncycles, the number of allocated cycle namelist entries,
-     * not to be confused with cyclemax, the number of discovered cycles.
+     * namelist entries for cycle headers.
+     * the number of discovered cycles.

      */
      */

-#define        CYCLEFRACTION   ( 0.10 )
-int    ncycles;                /* maximum allocated cycle headers */
-int    cyclemax;               /* number of cycles discovered */
+nltype *cyclenl;               /* cycle header namelist */
+int    ncycle;                 /* number of cycles discovered */

 
 

-/*
- * The header on the gmon.out file.
- * gmon.out consists of one of these headers,
- * and then an array of ncnt samples
- * representing the discretized program counter values.
- *     this should be a struct phdr, but since everything is done
- *     as UNITs, this is in UNITs too.
- */
+    /*
+     * The header on the gmon.out file.
+     * gmon.out consists of one of these headers,
+     * and then an array of ncnt samples
+     * representing the discretized program counter values.
+     * this should be a struct phdr, but since everything is done
+     * as UNITs, this is in UNITs too.
+     */

 struct hdr {
 struct hdr {

-       UNIT    *lowpc;
-       UNIT    *highpc;
-       int     ncnt;
+    UNIT       *lowpc;
+    UNIT       *highpc;
+    int        ncnt;

 };
 
 struct hdr     h;
 
 int    debug;
 
 };
 
 struct hdr     h;
 
 int    debug;
 

-/*
- * Each discretized pc sample has
- * a count of the number of samples in its range
- */
-unsigned UNIT  *samples;
+    /*
+     * Each discretized pc sample has
+     * a count of the number of samples in its range
+     */
+UNIT   *samples;

 
 unsigned long  s_lowpc;        /* lowpc from the profile file */
 unsigned long  s_highpc;       /* highpc from the profile file */
 
 unsigned long  s_lowpc;        /* lowpc from the profile file */
 unsigned long  s_highpc;       /* highpc from the profile file */


@@ -118,6 +175,7 @@ unsigned sampbytes;         /* number of bytes of samples */
 int    nsamples;               /* number of samples */
 double actime;                 /* accumulated time thus far for putprofline */
 double totime;                 /* total time for all routines */
 int    nsamples;               /* number of samples */
 double actime;                 /* accumulated time thus far for putprofline */
 double totime;                 /* total time for all routines */

+double printtime;              /* total of time being printed */

 double scale;                  /* scale factor converting samples to pc
                                   values: each sample covers scale bytes */
 char   *strtab;                /* string table in core */
 double scale;                  /* scale factor converting samples to pc
                                   values: each sample covers scale bytes */
 char   *strtab;                /* string table in core */


@@ -125,23 +183,108 @@ off_t    ssiz;                   /* size of the string table */
 struct exec xbuf;              /* exec header of a.out */
 unsigned char  *textspace;             /* text space of a.out in core */
 
 struct exec xbuf;              /* exec header of a.out */
 unsigned char  *textspace;             /* text space of a.out in core */
 

-int    zflg;
-int    cflag;
-

     /*
     /*

-     * booleans
+     * option flags, from a to z.

      */
      */

-typedef int    bool;
-#define        FALSE   0
-#define        TRUE    1
+bool   aflag;                          /* suppress static functions */
+bool   bflag;                          /* blurbs, too */
+bool   cflag;                          /* discovered call graph, too */
+bool   dflag;                          /* debugging options */
+bool   eflag;                          /* specific functions excluded */
+bool   Eflag;                          /* functions excluded with time */
+bool   fflag;                          /* specific functions requested */
+bool   Fflag;                          /* functions requested with time */
+bool   kflag;                          /* arcs to be deleted */
+bool   sflag;                          /* sum multiple gmon.out files */
+bool   zflag;                          /* zero time/called functions, too */

 
 

-int    timecmp();
-int    valcmp();
-int    totalcmp();
+    /*
+     * structure for various string lists
+     */
+struct stringlist {
+    struct stringlist  *next;
+    char               *string;
+};
+struct stringlist      *elist;
+struct stringlist      *Elist;
+struct stringlist      *flist;
+struct stringlist      *Flist;
+struct stringlist      *kfromlist;
+struct stringlist      *ktolist;

 
 

-nltype *nllookup();
+    /*
+     * function declarations
+     */
+/*
+               addarc();
+*/
+int            arccmp();

 arctype                *arclookup();
 arctype                *arclookup();

+/*
+               asgnsamples();
+               printblurb();
+               cyclelink();
+               dfn();
+*/

 bool           dfn_busy();
 bool           dfn_busy();

+/*
+               dfn_findcycle();
+*/
+bool           dfn_numbered();
+/*
+               dfn_post_visit();
+               dfn_pre_visit();
+               dfn_self_cycle();
+*/
+nltype         **doarcs();
+/*
+               done();
+               findcalls();
+               flatprofheader();
+               flatprofline();
+*/
+bool           funcsymbol();
+/*
+               getnfile();
+               getpfile();
+               getstrtab();
+               getsymtab();
+               gettextspace();
+               gprofheader();
+               gprofline();
+               main();
+*/
+unsigned long  max();
+int            membercmp();
+unsigned long  min();
+nltype         *nllookup();
+FILE           *openpfile();
+long           operandlength();
+operandenum    operandmode();
+char           *operandname();
+/*
+               printchildren();
+               printcycle();
+               printgprof();
+               printmembers();
+               printname();
+               printparents();
+               printprof();
+               readsamples();
+*/
+unsigned long  reladdr();
+/*
+               sortchildren();
+               sortmembers();
+               sortparents();
+               tally();
+               timecmp();
+               topcmp();
+*/
+int            totalcmp();
+/*
+               valcmp();
+*/

 
 #define        LESSTHAN        -1
 #define        EQUALTO         0
 
 #define        LESSTHAN        -1
 #define        EQUALTO         0


@@ -154,6 +297,7 @@ bool                dfn_busy();
 #define        TIMEDEBUG       16
 #define        SAMPLEDEBUG     32
 #define        AOUTDEBUG       64
 #define        TIMEDEBUG       16
 #define        SAMPLEDEBUG     32
 #define        AOUTDEBUG       64

-#define        CALLSDEBUG      128
+#define        CALLDEBUG       128

 #define        LOOKUPDEBUG     256
 #define        LOOKUPDEBUG     256

-#define        ANYDEBUG        512
+#define        PROPDEBUG       512
+#define        ANYDEBUG        1024