/* sccsid: @(#)gprof.h 1.8 (Berkeley) %G% */
typedef short UNIT
; /* unit of profiling */
#define A_OUTNAME "a.out"
#define GMONNAME "gmon.out"
#define GMONSUM "gmon.sum"
* with pointers to the namelist entry of the parent and the child,
* a count of how many times this arc was traversed,
* and pointers to the next parent of this child and
* the next child of this parent.
struct nl
*arc_parentp
; /* pointer to parent's nl entry */
struct nl
*arc_childp
; /* pointer to child's nl entry */
long arc_count
; /* how calls from parent to child */
double arc_time
; /* time inherited along arc */
double arc_childtime
; /* childtime inherited along arc */
struct arcstruct
*arc_parentlist
; /* parents-of-this-child list */
struct arcstruct
*arc_childlist
; /* children-of-this-parent list */
typedef struct arcstruct arctype
;
* with pointers to the calling site and the called site
unsigned long raw_frompc
;
unsigned long raw_selfpc
;
* for each external in the specified file we gather
* its address, the number of calls and compute its share of cpu time.
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 */
typedef struct nl nltype
;
nltype
*nl
; /* the whole namelist */
nltype
*npe
; /* the virtual end of the namelist */
int nname
; /* the number of function names */
* flag which marks a nl entry as topologically ``busy''
* 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.
#define CYCLEFRACTION ( 0.10 )
int ncycles
; /* maximum allocated cycle headers */
int cyclemax
; /* 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.
* Each discretized pc sample has
* a count of the number of samples in its range
unsigned long s_lowpc
; /* lowpc from the profile file */
unsigned long s_highpc
; /* highpc from the profile file */
unsigned lowpc
, highpc
; /* range profiled, in UNIT's */
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 */
double scale
; /* scale factor converting samples to pc
values: each sample covers scale bytes */
char *strtab
; /* string table in core */
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 */
* option flags, from a to z.
int aflag
; /* static functions, too */
int bflag
; /* blurbs, too */
int cflag
; /* discovered call graph, too */
int sflag
; /* sum multiple gmon.out files */
int zflag
; /* zero time/called functions, too */
* opcode of the `calls' instruction
* register for pc relative addressing
literal
, indexed
, reg
, regdef
, autodec
, autoinc
, autoincdef
,
bytedisp
, bytedispdef
, worddisp
, worddispdef
, longdisp
, longdispdef
,
immediate
, absolute
, byterel
, bytereldef
, wordrel
, wordreldef
,
typedef enum opermodes operandenum
;
unsigned int modefield
:4;
operandenum
operandmode();