[binutils.git] / gprof / gprof.h

/*
 * Copyright (c) 1983 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms are permitted
 * provided that: (1) source distributions retain this entire copyright
 * notice and comment, and (2) distributions including binaries display
 * the following acknowledgement:  ``This product includes software
 * developed by the University of California, Berkeley and its contributors''
 * in the documentation or other materials provided with the distribution
 * and in all advertising materials mentioning features or use of this
 * software. Neither the name of the University nor the names of its
 * contributors may be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *	@(#)gprof.h	5.9 (Berkeley) 6/1/90
 */

#include <stdio.h>
#ifdef	__STDC__
#include <stdlib.h>
#endif	/* __STDC__ */
#include <sys/types.h>
#include <sys/stat.h>
#include "bfd.h"
#include "gmon.h"

#ifdef	MACHINE_H
#	include	MACHINE_H
#else
#	if vax
#	   include "vax.h"
#	endif
#	if sun
#		include "sun.h"
#	endif
#	if tahoe
#		include "tahoe.h"
#	endif
#endif


    /*
     *	who am i, for error messages.
     */
char	*whoami;

    /*
     * booleans
     */
typedef int	bool;
#define	FALSE	0
#define	TRUE	1

    /*
     *	ticks per second
     */
long	hz;

typedef	u_short UNIT;		/* unit of profiling */
char	*a_outname;
#define	A_OUTNAME		"a.out"

char	*gmonname;
#define	GMONNAME		"gmon.out"
#define	GMONSUM			"gmon.sum"

    /*
     *	a constructed arc,
     *	    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 arcstruct {
    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;

    /*
     * The symbol table;
     * for each external in the specified file we gather
     * its address, the number of calls and compute its share of cpu time.
     */
struct nl {
    char		*name;		/* the name */
    unsigned long	value;		/* the pc entry point */
    unsigned long	svalue;		/* entry point aligned to histograms */
    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 */
    double		propfraction;	/* what % of time propagates */
    double		propself;	/* how much self time propagates */
    double		propchild;	/* how much child time propagates */
    bool		printflag;	/* should this be printed? */
    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''
     *	flag which marks a nl entry as topologically ``not_numbered''
     */
#define	DFN_BUSY	-1
#define	DFN_NAN		0

    /* 
     *	namelist entries for cycle headers.
     *	the number of discovered cycles.
     */
nltype	*cyclenl;		/* cycle header namelist */
int	ncycle;			/* 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.
     */
struct hdr {
    UNIT	*lowpc;
    UNIT	*highpc;
    int	ncnt;
};

struct hdr	h;

int	debug;

    /*
     * Each discretized pc sample has
     * a count of the number of samples in its range
     */
UNIT	*samples;

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	printtime;		/* total of time being printed */
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 */
unsigned char	*textspace;		/* text space of a.out in core */

    /*
     *	option flags, from a to z.
     */
bool	aflag;				/* suppress static functions */
bool	bflag;				/* blurbs, too */
bool	cflag;				/* discovered call graph, too */
bool	dflag;				/* debugging options */
bool	eflag;				/* specific functions excluded */
bool	Eflag;				/* functions excluded with time */
bool	fflag;				/* specific functions requested */
bool	Fflag;				/* functions requested with time */
bool	kflag;				/* arcs to be deleted */
bool	sflag;				/* sum multiple gmon.out files */
bool	zflag;				/* zero time/called functions, too */

    /*
     *	structure for various string lists
     */
struct stringlist {
    struct stringlist	*next;
    char		*string;
};
struct stringlist	*elist;
struct stringlist	*Elist;
struct stringlist	*flist;
struct stringlist	*Flist;
struct stringlist	*kfromlist;
struct stringlist	*ktolist;

    /*
     *	function declarations
     */
/*
		addarc();
*/
int		arccmp();
arctype		*arclookup();
/*
		asgnsamples();
		printblurb();
		cyclelink();
		dfn();
*/
bool		dfn_busy();
/*
		dfn_findcycle();
*/
bool		dfn_numbered();
/*
		dfn_post_visit();
		dfn_pre_visit();
		dfn_self_cycle();
*/
nltype		**doarcs();
/*
		done();
		findcalls();
		flatprofheader();
		flatprofline();
*/
bool		funcsymbol();
/*
		getnfile();
		getpfile();
		getstrtab();
		getsymtab();
		gettextspace();
		gprofheader();
		gprofline();
		main();
*/
unsigned long	max();
int		membercmp();
unsigned long	min();
nltype		*nllookup();
FILE		*openpfile();
/*
		printchildren();
		printcycle();
		printgprof();
		printmembers();
		printname();
		printparents();
		printprof();
		readsamples();
*/
unsigned long	reladdr();
/*
		sortchildren();
		sortmembers();
		sortparents();
		tally();
		timecmp();
		topcmp();
*/
int		totalcmp();
/*
		valcmp();
*/

#define	LESSTHAN	-1
#define	EQUALTO		0
#define	GREATERTHAN	1

#define	DFNDEBUG	1
#define	CYCLEDEBUG	2
#define	ARCDEBUG	4
#define	TALLYDEBUG	8
#define	TIMEDEBUG	16
#define	SAMPLEDEBUG	32
#define	AOUTDEBUG	64
#define	CALLDEBUG	128
#define	LOOKUPDEBUG	256
#define	PROPDEBUG	512
#define	ANYDEBUG	1024
Commit	Line	Data
3d6c6501 SEF	1	/*
	2	* Copyright (c) 1983 Regents of the University of California.
	3	* All rights reserved.
	4	*
	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.
	18	*
	19	* @(#)gprof.h 5.9 (Berkeley) 6/1/90
	20	*/
	21
811e3c6a	22	#include <stdio.h>
77c9b2c3	23	#ifdef __STDC__
811e3c6a	24	#include <stdlib.h>
77c9b2c3	25	#endif /* __STDC__ */
3d6c6501 SEF	26	#include <sys/types.h>
3d6c6501 SEF	27	#include <sys/stat.h>
811e3c6a	28	#include "bfd.h"
3d6c6501 SEF	29	#include "gmon.h"
	30
	31	#ifdef MACHINE_H
	32	# include MACHINE_H
	33	#else
	34	# if vax
	35	# include "vax.h"
	36	# endif
	37	# if sun
	38	# include "sun.h"
	39	# endif
	40	# if tahoe
	41	# include "tahoe.h"
	42	# endif
	43	#endif
	44
	45
	46	/*
	47	* who am i, for error messages.
	48	*/
	49	char *whoami;
	50
	51	/*
	52	* booleans
	53	*/
	54	typedef int bool;
	55	#define FALSE 0
	56	#define TRUE 1
	57
	58	/*
	59	* ticks per second
	60	*/
	61	long hz;
	62
	63	typedef u_short UNIT; /* unit of profiling */
	64	char *a_outname;
	65	#define A_OUTNAME "a.out"
	66
	67	char *gmonname;
	68	#define GMONNAME "gmon.out"
	69	#define GMONSUM "gmon.sum"
	70
	71	/*
	72	* a constructed arc,
	73	* with pointers to the namelist entry of the parent and the child,
	74	* a count of how many times this arc was traversed,
	75	* and pointers to the next parent of this child and
	76	* the next child of this parent.
	77	*/
	78	struct arcstruct {
	79	struct nl arc_parentp; / pointer to parent's nl entry */
	80	struct nl arc_childp; / pointer to child's nl entry */
	81	long arc_count; /* how calls from parent to child */
	82	double arc_time; /* time inherited along arc */
	83	double arc_childtime; /* childtime inherited along arc */
	84	struct arcstruct arc_parentlist; / parents-of-this-child list */
	85	struct arcstruct arc_childlist; / children-of-this-parent list */
	86	};
	87	typedef struct arcstruct arctype;
	88
	89	/*
	90	* The symbol table;
	91	* for each external in the specified file we gather
	92	* its address, the number of calls and compute its share of cpu time.
93	*/
94	struct nl {
95	char name; / the name */
96	unsigned long value; /* the pc entry point */
97	unsigned long svalue; /* entry point aligned to histograms */
98	double time; /* ticks in this routine */
99	double childtime; /* cumulative ticks in children */
100	long ncall; /* how many times called */
101	long selfcalls; /* how many calls to self */
102	double propfraction; /* what % of time propagates */
103	double propself; /* how much self time propagates */
104	double propchild; /* how much child time propagates */
105	bool printflag; /* should this be printed? */
106	int index; /* index in the graph list */
107	int toporder; /* graph call chain top-sort order */
108	int cycleno; /* internal number of cycle on */
109	struct nl cyclehead; / pointer to head of cycle */
110	struct nl cnext; / pointer to next member of cycle */
111	arctype parents; / list of caller arcs */
112	arctype children; / list of callee arcs */
113	};
114	typedef struct nl nltype;
115
116	nltype nl; / the whole namelist */
117	nltype npe; / the virtual end of the namelist */
118	int nname; /* the number of function names */
119
120	/*
121	* flag which marks a nl entry as topologically ``busy''
122	* flag which marks a nl entry as topologically ``not_numbered''
123	*/
124	#define DFN_BUSY -1
125	#define DFN_NAN 0
126
127	/*
128	* namelist entries for cycle headers.
129	* the number of discovered cycles.
130	*/
131	nltype cyclenl; / cycle header namelist */
132	int ncycle; /* number of cycles discovered */
133
134	/*
135	* The header on the gmon.out file.
136	* gmon.out consists of one of these headers,
137	* and then an array of ncnt samples
138	* representing the discretized program counter values.
139	* this should be a struct phdr, but since everything is done
140	* as UNITs, this is in UNITs too.
141	*/
142	struct hdr {
143	UNIT *lowpc;
144	UNIT *highpc;
145	int ncnt;
146	};
147
148	struct hdr h;
149
150	int debug;
151
152	/*
153	* Each discretized pc sample has
154	* a count of the number of samples in its range
155	*/
156	UNIT *samples;
157
158	unsigned long s_lowpc; /* lowpc from the profile file */
159	unsigned long s_highpc; /* highpc from the profile file */
160	unsigned lowpc, highpc; /* range profiled, in UNIT's */
161	unsigned sampbytes; /* number of bytes of samples */
162	int nsamples; /* number of samples */
163	double actime; /* accumulated time thus far for putprofline */
164	double totime; /* total time for all routines */
165	double printtime; /* total of time being printed */
166	double scale; /* scale factor converting samples to pc
167	values: each sample covers scale bytes */
168	char strtab; / string table in core */
169	off_t ssiz; /* size of the string table */
3d6c6501 SEF	170	unsigned char textspace; / text space of a.out in core */
	171
	172	/*
	173	* option flags, from a to z.
	174	*/
	175	bool aflag; /* suppress static functions */
	176	bool bflag; /* blurbs, too */
	177	bool cflag; /* discovered call graph, too */
	178	bool dflag; /* debugging options */
	179	bool eflag; /* specific functions excluded */
	180	bool Eflag; /* functions excluded with time */
	181	bool fflag; /* specific functions requested */
	182	bool Fflag; /* functions requested with time */
	183	bool kflag; /* arcs to be deleted */
	184	bool sflag; /* sum multiple gmon.out files */
	185	bool zflag; /* zero time/called functions, too */
	186
	187	/*
	188	* structure for various string lists
	189	*/
	190	struct stringlist {
	191	struct stringlist *next;
	192	char *string;
	193	};
	194	struct stringlist *elist;
	195	struct stringlist *Elist;
	196	struct stringlist *flist;
	197	struct stringlist *Flist;
	198	struct stringlist *kfromlist;
	199	struct stringlist *ktolist;
	200
	201	/*
	202	* function declarations
	203	*/
	204	/*
	205	addarc();
	206	*/
	207	int arccmp();
	208	arctype *arclookup();
	209	/*
	210	asgnsamples();
	211	printblurb();
	212	cyclelink();
	213	dfn();
	214	*/
	215	bool dfn_busy();
	216	/*
	217	dfn_findcycle();
	218	*/
	219	bool dfn_numbered();
	220	/*
	221	dfn_post_visit();
	222	dfn_pre_visit();
	223	dfn_self_cycle();
	224	*/
	225	nltype **doarcs();
	226	/*
	227	done();
	228	findcalls();
	229	flatprofheader();
	230	flatprofline();
	231	*/
	232	bool funcsymbol();
	233	/*
234	getnfile();
235	getpfile();
236	getstrtab();
237	getsymtab();
238	gettextspace();
239	gprofheader();
240	gprofline();
241	main();
242	*/
243	unsigned long max();
244	int membercmp();
245	unsigned long min();
246	nltype *nllookup();
247	FILE *openpfile();
248	/*
249	printchildren();
250	printcycle();
251	printgprof();
252	printmembers();
253	printname();
254	printparents();
255	printprof();
256	readsamples();
257	*/
258	unsigned long reladdr();
259	/*
260	sortchildren();
261	sortmembers();
262	sortparents();
263	tally();
264	timecmp();
265	topcmp();
266	*/
267	int totalcmp();
268	/*
269	valcmp();
270	*/
271
272	#define LESSTHAN -1
273	#define EQUALTO 0
274	#define GREATERTHAN 1
275
276	#define DFNDEBUG 1
277	#define CYCLEDEBUG 2
278	#define ARCDEBUG 4
279	#define TALLYDEBUG 8
280	#define TIMEDEBUG 16
281	#define SAMPLEDEBUG 32
282	#define AOUTDEBUG 64
283	#define CALLDEBUG 128
284	#define LOOKUPDEBUG 256
285	#define PROPDEBUG 512
286	#define ANYDEBUG 1024