1 /* 2 * Copyright (c) 1983, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 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. 20 * 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 31 * SUCH DAMAGE. 32 * 33 * @(#)gprof.h 8.1 (Berkeley) 6/6/93 34 */ 35 36 #include <sys/types.h> 37 #include <sys/stat.h> 38 #include <sys/gmon.h> 39 40 #include <stdio.h> 41 #include <stdlib.h> 42 43 #if __alpha__ 44 # include "alpha.h" 45 #endif 46 #if vax 47 # include "vax.h" 48 #endif 49 #if sparc 50 # include "sparc.h" 51 #endif 52 #if tahoe 53 # include "tahoe.h" 54 #endif 55 #if hp300 56 # include "hp300.h" 57 #endif 58 #if luna68k 59 # include "luna68k.h" 60 #endif 61 #if i386 62 # include "i386.h" 63 #endif 64 #if mips 65 # include "mips.h" 66 #endif 67 68 69 /* 70 * booleans 71 */ 72 typedef int bool; 73 #define FALSE 0 74 #define TRUE 1 75 76 /* 77 * ticks per second 78 */ 79 long hz; 80 81 #ifdef GPROF4 82 typedef int64_t UNIT; 83 #else 84 typedef u_short UNIT; /* unit of profiling */ 85 #endif 86 char *a_outname; 87 #define A_OUTNAME "a.out" 88 89 char *gmonname; 90 #define GMONSUM "gmon.sum" 91 92 /* 93 * a constructed arc, 94 * with pointers to the namelist entry of the parent and the child, 95 * a count of how many times this arc was traversed, 96 * and pointers to the next parent of this child and 97 * the next child of this parent. 98 */ 99 struct arcstruct { 100 struct nl *arc_parentp; /* pointer to parent's nl entry */ 101 struct nl *arc_childp; /* pointer to child's nl entry */ 102 long arc_count; /* num calls from parent to child */ 103 double arc_time; /* time inherited along arc */ 104 double arc_childtime; /* childtime inherited along arc */ 105 struct arcstruct *arc_parentlist; /* parents-of-this-child list */ 106 struct arcstruct *arc_childlist; /* children-of-this-parent list */ 107 struct arcstruct *arc_next; /* list of arcs on cycle */ 108 unsigned short arc_cyclecnt; /* num cycles involved in */ 109 unsigned short arc_flags; /* see below */ 110 }; 111 typedef struct arcstruct arctype; 112 113 /* 114 * arc flags 115 */ 116 #define DEADARC 0x01 /* time should not propagate across the arc */ 117 #define ONLIST 0x02 /* arc is on list of arcs in cycles */ 118 119 /* 120 * The symbol table; 121 * for each external in the specified file we gather 122 * its address, the number of calls and compute its share of cpu time. 123 */ 124 struct nl { 125 const char *name; /* the name */ 126 unsigned long value; /* the pc entry point */ 127 unsigned long svalue; /* entry point aligned to histograms */ 128 double time; /* ticks in this routine */ 129 double childtime; /* cumulative ticks in children */ 130 long ncall; /* how many times called */ 131 long npropcall; /* times called by live arcs */ 132 long selfcalls; /* how many calls to self */ 133 double propfraction; /* what % of time propagates */ 134 double propself; /* how much self time propagates */ 135 double propchild; /* how much child time propagates */ 136 short printflag; /* should this be printed? */ 137 short flags; /* see below */ 138 int index; /* index in the graph list */ 139 int toporder; /* graph call chain top-sort order */ 140 int cycleno; /* internal number of cycle on */ 141 int parentcnt; /* number of live parent arcs */ 142 struct nl *cyclehead; /* pointer to head of cycle */ 143 struct nl *cnext; /* pointer to next member of cycle */ 144 arctype *parents; /* list of caller arcs */ 145 arctype *children; /* list of callee arcs */ 146 }; 147 typedef struct nl nltype; 148 149 nltype *nl; /* the whole namelist */ 150 nltype *npe; /* the virtual end of the namelist */ 151 int nname; /* the number of function names */ 152 153 #define HASCYCLEXIT 0x08 /* node has arc exiting from cycle */ 154 #define CYCLEHEAD 0x10 /* node marked as head of a cycle */ 155 #define VISITED 0x20 /* node visited during a cycle */ 156 157 /* 158 * The cycle list. 159 * for each subcycle within an identified cycle, we gather 160 * its size and the list of included arcs. 161 */ 162 struct cl { 163 int size; /* length of cycle */ 164 struct cl *next; /* next member of list */ 165 arctype *list[1]; /* list of arcs in cycle */ 166 /* actually longer */ 167 }; 168 typedef struct cl cltype; 169 170 arctype *archead; /* the head of arcs in current cycle list */ 171 cltype *cyclehead; /* the head of the list */ 172 int cyclecnt; /* the number of cycles found */ 173 #define CYCLEMAX 100 /* maximum cycles before cutting one of them */ 174 175 /* 176 * flag which marks a nl entry as topologically ``busy'' 177 * flag which marks a nl entry as topologically ``not_numbered'' 178 */ 179 #define DFN_BUSY -1 180 #define DFN_NAN 0 181 182 /* 183 * namelist entries for cycle headers. 184 * the number of discovered cycles. 185 */ 186 nltype *cyclenl; /* cycle header namelist */ 187 int ncycle; /* number of cycles discovered */ 188 189 /* 190 * The header on the gmon.out file. 191 * gmon.out consists of a struct phdr (defined in gmon.h) 192 * and then an array of ncnt samples representing the 193 * discretized program counter values. 194 * 195 * Backward compatible old style header 196 */ 197 struct ophdr { 198 UNIT *lpc; 199 UNIT *hpc; 200 int ncnt; 201 }; 202 203 int debug; 204 205 /* 206 * Each discretized pc sample has 207 * a count of the number of samples in its range 208 */ 209 UNIT *samples; 210 211 unsigned long s_lowpc; /* lowpc from the profile file */ 212 unsigned long s_highpc; /* highpc from the profile file */ 213 unsigned long lowpc, highpc; /* range profiled, in UNIT's */ 214 unsigned sampbytes; /* number of bytes of samples */ 215 int nsamples; /* number of samples */ 216 double actime; /* accumulated time thus far for putprofline */ 217 double totime; /* total time for all routines */ 218 double printtime; /* total of time being printed */ 219 double scale; /* scale factor converting samples to pc 220 values: each sample covers scale bytes */ 221 unsigned char *textspace; /* text space of a.out in core */ 222 int cyclethreshold; /* with -C, minimum cycle size to ignore */ 223 224 /* 225 * option flags, from a to z. 226 */ 227 bool aflag; /* suppress static functions */ 228 bool bflag; /* blurbs, too */ 229 bool cflag; /* discovered call graph, too */ 230 bool Cflag; /* find cut-set to eliminate cycles */ 231 bool dflag; /* debugging options */ 232 bool eflag; /* specific functions excluded */ 233 bool Eflag; /* functions excluded with time */ 234 bool fflag; /* specific functions requested */ 235 bool Fflag; /* functions requested with time */ 236 bool kflag; /* arcs to be deleted */ 237 bool sflag; /* sum multiple gmon.out files */ 238 bool uflag; /* suppress symbols hidden from C */ 239 bool zflag; /* zero time/called functions, too */ 240 241 /* 242 * structure for various string lists 243 */ 244 struct stringlist { 245 struct stringlist *next; 246 char *string; 247 }; 248 struct stringlist *elist; 249 struct stringlist *Elist; 250 struct stringlist *flist; 251 struct stringlist *Flist; 252 struct stringlist *kfromlist; 253 struct stringlist *ktolist; 254 255 /* 256 * function declarations 257 */ 258 /* 259 addarc(); 260 */ 261 int aout_getnfile(const char *, char ***); 262 int arccmp(); 263 arctype *arclookup(); 264 /* 265 asgnsamples(); 266 printblurb(); 267 cyclelink(); 268 dfn(); 269 */ 270 bool dfn_busy(); 271 /* 272 dfn_findcycle(); 273 */ 274 bool dfn_numbered(); 275 /* 276 dfn_post_visit(); 277 dfn_pre_visit(); 278 dfn_self_cycle(); 279 */ 280 nltype **doarcs(); 281 /* 282 done(); 283 */ 284 int elf_getnfile(const char *, char ***); 285 /* 286 findcalls(); 287 flatprofheader(); 288 flatprofline(); 289 */ 290 /* 291 getpfile(); 292 gprofheader(); 293 gprofline(); 294 main(); 295 */ 296 unsigned long max(); 297 int membercmp(); 298 unsigned long min(); 299 nltype *nllookup(); 300 FILE *openpfile(); 301 long operandlength(); 302 operandenum operandmode(); 303 char *operandname(); 304 /* 305 printchildren(); 306 printcycle(); 307 printgprof(); 308 printmembers(); 309 printname(); 310 printparents(); 311 printprof(); 312 readsamples(); 313 */ 314 unsigned long reladdr(); 315 /* 316 sortchildren(); 317 sortmembers(); 318 sortparents(); 319 tally(); 320 timecmp(); 321 topcmp(); 322 */ 323 int totalcmp(); 324 /* 325 valcmp(); 326 */ 327 328 #define LESSTHAN -1 329 #define EQUALTO 0 330 #define GREATERTHAN 1 331 332 #define DFNDEBUG 1 333 #define CYCLEDEBUG 2 334 #define ARCDEBUG 4 335 #define TALLYDEBUG 8 336 #define TIMEDEBUG 16 337 #define SAMPLEDEBUG 32 338 #define AOUTDEBUG 64 339 #define CALLDEBUG 128 340 #define LOOKUPDEBUG 256 341 #define PROPDEBUG 512 342 #define BREAKCYCLE 1024 343 #define SUBCYCLELIST 2048 344 #define ANYDEBUG 4096 345