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
34 * $DragonFly: src/usr.bin/gprof/gprof.h,v 1.2 2006/07/31 12:12:08 corecode Exp $
37 #include <sys/types.h>
88 typedef u_short UNIT; /* unit of profiling */
90 #define UNITS_TO_CODE (OFFSET_OF_CODE / sizeof(UNIT))
93 #define A_OUTNAME "a.out"
96 #define GMONSUM "gmon.sum"
100 * with pointers to the namelist entry of the parent and the child,
101 * a count of how many times this arc was traversed,
102 * and pointers to the next parent of this child and
103 * the next child of this parent.
106 struct nl *arc_parentp; /* pointer to parent's nl entry */
107 struct nl *arc_childp; /* pointer to child's nl entry */
108 long arc_count; /* num calls from parent to child */
109 double arc_time; /* time inherited along arc */
110 double arc_childtime; /* childtime inherited along arc */
111 struct arcstruct *arc_parentlist; /* parents-of-this-child list */
112 struct arcstruct *arc_childlist; /* children-of-this-parent list */
113 struct arcstruct *arc_next; /* list of arcs on cycle */
114 unsigned short arc_cyclecnt; /* num cycles involved in */
115 unsigned short arc_flags; /* see below */
117 typedef struct arcstruct arctype;
122 #define DEADARC 0x01 /* time should not propagate across the arc */
123 #define ONLIST 0x02 /* arc is on list of arcs in cycles */
127 * for each external in the specified file we gather
128 * its address, the number of calls and compute its share of cpu time.
131 const char *name; /* the name */
132 unsigned long value; /* the pc entry point */
133 unsigned long svalue; /* entry point aligned to histograms */
134 double time; /* ticks in this routine */
135 double childtime; /* cumulative ticks in children */
136 long ncall; /* how many times called */
137 long npropcall; /* times called by live arcs */
138 long selfcalls; /* how many calls to self */
139 double propfraction; /* what % of time propagates */
140 double propself; /* how much self time propagates */
141 double propchild; /* how much child time propagates */
142 short printflag; /* should this be printed? */
143 short flags; /* see below */
144 int index; /* index in the graph list */
145 int toporder; /* graph call chain top-sort order */
146 int cycleno; /* internal number of cycle on */
147 int parentcnt; /* number of live parent arcs */
148 struct nl *cyclehead; /* pointer to head of cycle */
149 struct nl *cnext; /* pointer to next member of cycle */
150 arctype *parents; /* list of caller arcs */
151 arctype *children; /* list of callee arcs */
153 typedef struct nl nltype;
155 nltype *nl; /* the whole namelist */
156 nltype *npe; /* the virtual end of the namelist */
157 int nname; /* the number of function names */
159 #define HASCYCLEXIT 0x08 /* node has arc exiting from cycle */
160 #define CYCLEHEAD 0x10 /* node marked as head of a cycle */
161 #define VISITED 0x20 /* node visited during a cycle */
165 * for each subcycle within an identified cycle, we gather
166 * its size and the list of included arcs.
169 int size; /* length of cycle */
170 struct cl *next; /* next member of list */
171 arctype *list[1]; /* list of arcs in cycle */
172 /* actually longer */
174 typedef struct cl cltype;
176 arctype *archead; /* the head of arcs in current cycle list */
177 cltype *cyclehead; /* the head of the list */
178 int cyclecnt; /* the number of cycles found */
179 #define CYCLEMAX 100 /* maximum cycles before cutting one of them */
182 * flag which marks a nl entry as topologically ``busy''
183 * flag which marks a nl entry as topologically ``not_numbered''
189 * namelist entries for cycle headers.
190 * the number of discovered cycles.
192 nltype *cyclenl; /* cycle header namelist */
193 int ncycle; /* number of cycles discovered */
196 * The header on the gmon.out file.
197 * gmon.out consists of a struct phdr (defined in gmon.h)
198 * and then an array of ncnt samples representing the
199 * discretized program counter values.
201 * Backward compatible old style header
212 * Each discretized pc sample has
213 * a count of the number of samples in its range
217 unsigned long s_lowpc; /* lowpc from the profile file */
218 unsigned long s_highpc; /* highpc from the profile file */
219 unsigned long lowpc, highpc; /* range profiled, in UNIT's */
220 unsigned sampbytes; /* number of bytes of samples */
221 int nsamples; /* number of samples */
222 double actime; /* accumulated time thus far for putprofline */
223 double totime; /* total time for all routines */
224 double printtime; /* total of time being printed */
225 double scale; /* scale factor converting samples to pc
226 values: each sample covers scale bytes */
227 unsigned char *textspace; /* text space of a.out in core */
228 int cyclethreshold; /* with -C, minimum cycle size to ignore */
231 * option flags, from a to z.
233 bool aflag; /* suppress static functions */
234 bool bflag; /* blurbs, too */
235 bool cflag; /* discovered call graph, too */
236 bool Cflag; /* find cut-set to eliminate cycles */
237 bool dflag; /* debugging options */
238 bool eflag; /* specific functions excluded */
239 bool Eflag; /* functions excluded with time */
240 bool fflag; /* specific functions requested */
241 bool Fflag; /* functions requested with time */
242 bool kflag; /* arcs to be deleted */
243 bool sflag; /* sum multiple gmon.out files */
244 bool uflag; /* suppress symbols hidden from C */
245 bool zflag; /* zero time/called functions, too */
248 * structure for various string lists
251 struct stringlist *next;
254 struct stringlist *elist;
255 struct stringlist *Elist;
256 struct stringlist *flist;
257 struct stringlist *Flist;
258 struct stringlist *kfromlist;
259 struct stringlist *ktolist;
262 * function declarations
267 int aout_getnfile(const char *, char ***);
269 arctype *arclookup();
290 int elf_getnfile(const char *, char ***);
307 long operandlength();
308 operandenum operandmode();
320 unsigned long reladdr();
336 #define GREATERTHAN 1
343 #define SAMPLEDEBUG 32
345 #define CALLDEBUG 128
346 #define LOOKUPDEBUG 256
347 #define PROPDEBUG 512
348 #define BREAKCYCLE 1024
349 #define SUBCYCLELIST 2048
350 #define ANYDEBUG 4096