2 * Copyright (c) 1983 Regents of the University of California.
5 * Redistribution and use in source and binary forms are permitted
6 * provided that: (1) source distributions retain this entire copyright
7 * notice and comment, and (2) distributions including binaries display
8 * the following acknowledgement: ``This product includes software
9 * developed by the University of California, Berkeley and its contributors''
10 * in the documentation or other materials provided with the distribution
11 * and in all advertising materials mentioning features or use of this
12 * software. Neither the name of the University nor the names of its
13 * contributors may be used to endorse or promote products derived
14 * from this software without specific prior written permission.
15 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19 * @(#)gprof.h 5.9 (Berkeley) 6/1/90
43 * who am i, for error messages.
59 typedef unsigned short UNIT; /* unit of profiling */
61 #define A_OUTNAME "a.out"
64 #define GMONNAME "gmon.out"
65 #define GMONSUM "gmon.sum"
67 extern int bsd_style_output;
68 extern int discard_underscores;
72 * with pointers to the namelist entry of the parent and the child,
73 * a count of how many times this arc was traversed,
74 * and pointers to the next parent of this child and
75 * the next child of this parent.
78 struct nl *arc_parentp; /* pointer to parent's nl entry */
79 struct nl *arc_childp; /* pointer to child's nl entry */
80 long arc_count; /* how calls from parent to child */
81 double arc_time; /* time inherited along arc */
82 double arc_childtime; /* childtime inherited along arc */
83 struct arcstruct *arc_parentlist; /* parents-of-this-child list */
84 struct arcstruct *arc_childlist; /* children-of-this-parent list */
86 typedef struct arcstruct arctype;
90 * for each external in the specified file we gather
91 * its address, the number of calls and compute its share of cpu time.
94 CONST char *name; /* the name */
95 unsigned long value; /* the pc entry point */
96 unsigned long svalue; /* entry point aligned to histograms */
97 double time; /* ticks in this routine */
98 double childtime; /* cumulative ticks in children */
99 long ncall; /* how many times called */
100 long selfcalls; /* how many calls to self */
101 double propfraction; /* what % of time propagates */
102 double propself; /* how much self time propagates */
103 double propchild; /* how much child time propagates */
104 bool printflag; /* should this be printed? */
105 int index; /* index in the graph list */
106 int toporder; /* graph call chain top-sort order */
107 int cycleno; /* internal number of cycle on */
108 struct nl *cyclehead; /* pointer to head of cycle */
109 struct nl *cnext; /* pointer to next member of cycle */
110 arctype *parents; /* list of caller arcs */
111 arctype *children; /* list of callee arcs */
113 typedef struct nl nltype;
115 nltype *nl; /* the whole namelist */
116 nltype *npe; /* the virtual end of the namelist */
117 int nname; /* the number of function names */
120 * flag which marks a nl entry as topologically ``busy''
121 * flag which marks a nl entry as topologically ``not_numbered''
127 * namelist entries for cycle headers.
128 * the number of discovered cycles.
130 nltype *cyclenl; /* cycle header namelist */
131 int ncycle; /* number of cycles discovered */
134 * The header on the gmon.out file.
135 * gmon.out consists of one of these headers,
136 * and then an array of ncnt samples
137 * representing the discretized program counter values.
138 * this should be a struct phdr, but since everything is done
139 * as UNITs, this is in UNITs too.
152 * Each discretized pc sample has
153 * a count of the number of samples in its range
157 unsigned long s_lowpc; /* lowpc from the profile file */
158 unsigned long s_highpc; /* highpc from the profile file */
159 unsigned lowpc, highpc; /* range profiled, in UNIT's */
160 unsigned sampbytes; /* number of bytes of samples */
161 int nsamples; /* number of samples */
162 double actime; /* accumulated time thus far for putprofline */
163 double totime; /* total time for all routines */
164 double printtime; /* total of time being printed */
165 double scale; /* scale factor converting samples to pc
166 values: each sample covers scale bytes */
167 char *strtab; /* string table in core */
168 off_t ssiz; /* size of the string table */
169 unsigned char *textspace; /* text space of a.out in core */
172 * option flags, from a to z.
174 bool aflag; /* suppress static functions */
175 bool bflag; /* blurbs, too */
176 bool cflag; /* discovered call graph, too */
177 bool dflag; /* debugging options */
178 bool eflag; /* specific functions excluded */
179 bool Eflag; /* functions excluded with time */
180 bool fflag; /* specific functions requested */
181 bool Fflag; /* functions requested with time */
182 bool kflag; /* arcs to be deleted */
183 bool sflag; /* sum multiple gmon.out files */
184 bool zflag; /* zero time/called functions, too */
187 * structure for various string lists
190 struct stringlist *next;
193 struct stringlist *elist;
194 struct stringlist *Elist;
195 struct stringlist *flist;
196 struct stringlist *Flist;
197 struct stringlist *kfromlist;
198 struct stringlist *ktolist;
201 * function declarations
207 arctype *arclookup();
258 unsigned long reladdr();
274 #define GREATERTHAN 1
281 #define SAMPLEDEBUG 32
283 #define CALLDEBUG 128
284 #define LOOKUPDEBUG 256
285 #define PROPDEBUG 512
286 #define ANYDEBUG 1024