[unix-history] / usr / src / sys / h / gprof.h

/*
 * Copyright (c) 1982, 1986 Regents of the University of California.
 * All rights reserved.  The Berkeley software License Agreement
 * specifies the terms and conditions for redistribution.
 *
 *	@(#)gprof.h	7.1 (Berkeley) 6/4/86
 */

struct phdr {
    char	*lpc;
    char	*hpc;
    int		ncnt;
};

    /*
     *	histogram counters are unsigned shorts (according to the kernel).
     */
#define	HISTCOUNTER	unsigned short

    /*
     *	fraction of text space to allocate for histogram counters
     *	here, 1/2
     */
#define	HISTFRACTION	2

    /*
     *	Fraction of text space to allocate for from hash buckets.
     *	The value of HASHFRACTION is based on the minimum number of bytes
     *	of separation between two subroutine call points in the object code.
     *	Given MIN_SUBR_SEPARATION bytes of separation the value of
     *	HASHFRACTION is calculated as:
     *
     *		HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
     *
     *	For the VAX, the shortest two call sequence is:
     *
     *		calls	$0,(r0)
     *		calls	$0,(r0)
     *
     *	which is separated by only three bytes, thus HASHFRACTION is 
     *	calculated as:
     *
     *		HASHFRACTION = 3 / (2 * 2 - 1) = 1
     *
     *	Note that the division above rounds down, thus if MIN_SUBR_FRACTION
     *	is less than three, this algorithm will not work!
     *
     *	NB: for the kernel we assert that the shortest two call sequence is:
     *
     *		calls	$0,_name
     *		calls	$0,_name
     *
     *	which is separated by seven bytes, thus HASHFRACTION is calculated as:
     *
     *		HASHFRACTION = 7 / (2 * 2 - 1) = 2
     */
#define	HASHFRACTION	2

    /*
     *	percent of text space to allocate for tostructs
     *	with a minimum.
     */
#define ARCDENSITY	2
#define MINARCS		50

struct tostruct {
    char		*selfpc;
    long		count;
    unsigned short	link;
};

    /*
     *	a raw arc,
     *	    with pointers to the calling site and the called site
     *	    and a count.
     */
struct rawarc {
    unsigned long	raw_frompc;
    unsigned long	raw_selfpc;
    long		raw_count;
};

    /*
     *	general rounding functions.
     */
#define ROUNDDOWN(x,y)	(((x)/(y))*(y))
#define ROUNDUP(x,y)	((((x)+(y)-1)/(y))*(y))
Commit	Line	Data
da7c5cc6	1	/*
1810611d	2	* Copyright (c) 1982, 1986 Regents of the University of California.
da7c5cc6 KM	3	* All rights reserved. The Berkeley software License Agreement
	4	* specifies the terms and conditions for redistribution.
	5	*
95f51977	6	* @(#)gprof.h 7.1 (Berkeley) 6/4/86
da7c5cc6	7	*/
d6afa536 SL	8
d6afa536 SL	9	struct phdr {
8487304f KM	10	char *lpc;
	11	char *hpc;
	12	int ncnt;
d6afa536 SL	13	};
d6afa536 SL	14
8487304f KM	15	/*
	16	* histogram counters are unsigned shorts (according to the kernel).
	17	*/
	18	#define HISTCOUNTER unsigned short
	19
	20	/*
	21	* fraction of text space to allocate for histogram counters
	22	* here, 1/2
	23	*/
	24	#define HISTFRACTION 2
	25
	26	/*
	27	* Fraction of text space to allocate for from hash buckets.
	28	* The value of HASHFRACTION is based on the minimum number of bytes
	29	* of separation between two subroutine call points in the object code.
	30	* Given MIN_SUBR_SEPARATION bytes of separation the value of
	31	* HASHFRACTION is calculated as:
	32	*
	33	* HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
	34	*
	35	* For the VAX, the shortest two call sequence is:
	36	*
	37	* calls $0,(r0)
	38	* calls $0,(r0)
	39	*
	40	* which is separated by only three bytes, thus HASHFRACTION is
	41	* calculated as:
	42	*
	43	* HASHFRACTION = 3 / (2 * 2 - 1) = 1
	44	*
	45	* Note that the division above rounds down, thus if MIN_SUBR_FRACTION
	46	* is less than three, this algorithm will not work!
	47	*
	48	* NB: for the kernel we assert that the shortest two call sequence is:
	49	*
	50	* calls $0,_name
	51	* calls $0,_name
	52	*
	53	* which is separated by seven bytes, thus HASHFRACTION is calculated as:
	54	*
	55	* HASHFRACTION = 7 / (2 * 2 - 1) = 2
	56	*/
	57	#define HASHFRACTION 2
	58
	59	/*
	60	* percent of text space to allocate for tostructs
	61	* with a minimum.
	62	*/
	63	#define ARCDENSITY 2
	64	#define MINARCS 50
	65
d6afa536	66	struct tostruct {
8487304f KM	67	char *selfpc;
	68	long count;
	69	unsigned short link;
d6afa536 SL	70	};
d6afa536 SL	71
8487304f KM	72	/*
	73	* a raw arc,
	74	* with pointers to the calling site and the called site
	75	* and a count.
	76	*/
d6afa536	77	struct rawarc {
8487304f KM	78	unsigned long raw_frompc;
	79	unsigned long raw_selfpc;
	80	long raw_count;
d6afa536	81	};
8487304f KM	82
	83	/*
	84	* general rounding functions.
	85	*/
	86	#define ROUNDDOWN(x,y) (((x)/(y))*(y))
	87	#define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))