2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)gprof.h 8.1 (Berkeley) 6/6/93
37 #include <sys/types.h>
71 * Historical scale factor in profil(2)'s algorithm for converting
72 * pc addresses to bucket numbers. This now just complicates the
73 * scaling and makes bucket:pc densities of more than 1/2 useless.
75 #define HISTORICAL_SCALE_2 2
82 size_t histcounter_size;
86 #define A_OUTNAME "a.out"
89 #define GMONSUM "gmon.sum"
93 * with pointers to the namelist entry of the parent and the child,
94 * a count of how many times this arc was traversed,
95 * and pointers to the next parent of this child and
96 * the next child of this parent.
99 struct nl *arc_parentp; /* pointer to parent's nl entry */
100 struct nl *arc_childp; /* pointer to child's nl entry */
101 long arc_count; /* num calls from parent to child */
102 double arc_time; /* time inherited along arc */
103 double arc_childtime; /* childtime inherited along arc */
104 struct arcstruct *arc_parentlist; /* parents-of-this-child list */
105 struct arcstruct *arc_childlist; /* children-of-this-parent list */
106 struct arcstruct *arc_next; /* list of arcs on cycle */
107 unsigned short arc_cyclecnt; /* num cycles involved in */
108 unsigned short arc_flags; /* see below */
110 typedef struct arcstruct arctype;
115 #define DEADARC 0x01 /* time should not propagate across the arc */
116 #define ONLIST 0x02 /* arc is on list of arcs in cycles */
120 * for each external in the specified file we gather
121 * its address, the number of calls and compute its share of CPU time.
124 const char *name; /* the name */
125 unsigned long value; /* the pc entry point */
126 unsigned long svalue; /* entry point aligned to histograms */
127 double time; /* ticks in this routine */
128 double childtime; /* cumulative ticks in children */
129 long ncall; /* how many times called */
130 long npropcall; /* times called by live arcs */
131 long selfcalls; /* how many calls to self */
132 double propfraction; /* what % of time propagates */
133 double propself; /* how much self time propagates */
134 double propchild; /* how much child time propagates */
135 short printflag; /* should this be printed? */
136 short flags; /* see below */
137 int index; /* index in the graph list */
138 int toporder; /* graph call chain top-sort order */
139 int cycleno; /* internal number of cycle on */
140 int parentcnt; /* number of live parent arcs */
141 struct nl *cyclehead; /* pointer to head of cycle */
142 struct nl *cnext; /* pointer to next member of cycle */
143 arctype *parents; /* list of caller arcs */
144 arctype *children; /* list of callee arcs */
146 typedef struct nl nltype;
148 nltype *nl; /* the whole namelist */
149 nltype *npe; /* the virtual end of the namelist */
150 int nname; /* the number of function names */
152 #define HASCYCLEXIT 0x08 /* node has arc exiting from cycle */
153 #define CYCLEHEAD 0x10 /* node marked as head of a cycle */
154 #define VISITED 0x20 /* node visited during a cycle */
158 * for each subcycle within an identified cycle, we gather
159 * its size and the list of included arcs.
162 int size; /* length of cycle */
163 struct cl *next; /* next member of list */
164 arctype *list[1]; /* list of arcs in cycle */
165 /* actually longer */
167 typedef struct cl cltype;
169 arctype *archead; /* the head of arcs in current cycle list */
170 cltype *cyclehead; /* the head of the list */
171 int cyclecnt; /* the number of cycles found */
172 #define CYCLEMAX 100 /* maximum cycles before cutting one of them */
175 * flag which marks a nl entry as topologically ``busy''
176 * flag which marks a nl entry as topologically ``not_numbered''
182 * namelist entries for cycle headers.
183 * the number of discovered cycles.
185 nltype *cyclenl; /* cycle header namelist */
186 int ncycle; /* number of cycles discovered */
189 * The header on the gmon.out file.
190 * gmon.out consists of a struct phdr (defined in gmon.h)
191 * and then an array of ncnt samples representing the
192 * discretized program counter values.
194 * Backward compatible old style header
205 * Each discretized pc sample has
206 * a count of the number of samples in its range
210 unsigned long s_lowpc; /* lowpc from the profile file */
211 unsigned long s_highpc; /* highpc from the profile file */
212 unsigned long lowpc, highpc; /* range profiled, in historical units */
213 unsigned sampbytes; /* number of bytes of samples */
214 int nsamples; /* number of samples */
215 double actime; /* accumulated time thus far for putprofline */
216 double totime; /* total time for all routines */
217 double printtime; /* total of time being printed */
218 double scale; /* scale factor converting samples to pc
219 values: each sample covers scale bytes */
220 unsigned char *textspace; /* text space of a.out in core */
221 int cyclethreshold; /* with -C, minimum cycle size to ignore */
224 * option flags, from a to z.
226 bool aflag; /* suppress static functions */
227 bool bflag; /* blurbs, too */
228 bool Cflag; /* find cut-set to eliminate cycles */
229 bool dflag; /* debugging options */
230 bool eflag; /* specific functions excluded */
231 bool Eflag; /* functions excluded with time */
232 bool fflag; /* specific functions requested */
233 bool Fflag; /* functions requested with time */
234 bool kflag; /* arcs to be deleted */
235 bool Kflag; /* use the running kernel for symbols */
236 bool sflag; /* sum multiple gmon.out files */
237 bool uflag; /* suppress symbols hidden from C */
238 bool zflag; /* zero time/called functions, too */
241 * structure for various string lists
244 struct stringlist *next;
247 struct stringlist *elist;
248 struct stringlist *Elist;
249 struct stringlist *flist;
250 struct stringlist *Flist;
251 struct stringlist *kfromlist;
252 struct stringlist *ktolist;
255 * function declarations
257 void addarc(nltype *, nltype *, long);
258 bool addcycle(arctype **, arctype **);
259 void addlist(struct stringlist *, char *);
260 void alignentries(void);
261 int aout_getnfile(const char *, char ***);
263 arctype *arclookup();
264 void asgnsamples(void);
265 void compresslist(void);
266 bool cycleanalyze(void);
267 void cyclelink(void);
268 void cycletime(void);
269 bool descend(nltype *, arctype **, arctype **);
272 void dfn_findcycle(nltype *);
275 void dfn_post_visit(nltype *);
276 void dfn_pre_visit(nltype *);
277 void dfn_self_cycle(nltype *);
281 void dumpsum(char *);
282 int elf_getnfile(const char *, char ***);
283 void flatprofheader(void);
284 void flatprofline(nltype *);
285 void getpfile(char *);
291 void inheritflags(nltype *);
292 int kernel_getnfile(const char *, char ***);
300 bool onlist(struct stringlist *, const char *);
302 long operandlength();
303 operandenum operandmode();
305 void printblurb(char *);
306 void printchildren(nltype *);
307 void printcycle(nltype *);
308 void printgprof(nltype **);
309 void printindex(void);
310 void printmembers(nltype *);
311 void printname(nltype *);
312 void printparents(nltype *);
313 void printprof(void);
314 void printsubcycle(cltype *);
315 void readsamples(FILE *);
316 unsigned long reladdr();
317 void sortchildren(nltype *);
318 void sortmembers(nltype *);
319 void sortparents(nltype *);
320 void tally(struct rawarc *);
321 void timepropagate(nltype *);
326 #define GREATERTHAN 1
333 #define SAMPLEDEBUG 32
335 #define CALLDEBUG 128
336 #define LOOKUPDEBUG 256
337 #define PROPDEBUG 512
338 #define BREAKCYCLE 1024
339 #define SUBCYCLELIST 2048
340 #define ANYDEBUG 4096