2 * Copyright (c) 1991 The Regents of the University of California.
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 * @(#)gmon.h 5.2 (Berkeley) 5/6/91
41 char low_pc
[8]; /* base pc address of sample buffer */
42 char high_pc
[8]; /* max pc address of sampled buffer */
44 char low_pc
[4]; /* base pc address of sample buffer */
45 char high_pc
[4]; /* max pc address of sampled buffer */
47 char ncnt
[4]; /* size of sample buffer (plus this header) */
49 #if defined (__alpha__) && defined (__osf__)
51 * DEC's OSF v3.0 uses 4 bytes of padding to bring the header to
52 * a size that is a multiple of 8.
57 char version
[4]; /* version number */
58 char profrate
[4]; /* profiling clock rate */
59 char spare
[3*4]; /* reserved */
65 * Histogram counters are unsigned shorts:
67 #define HISTCOUNTER unsigned short
70 * Fraction of text space to allocate for histogram counters here, 1/2:
72 #define HISTFRACTION 2
75 * Fraction of text space to allocate for from hash buckets. The
76 * value of HASHFRACTION is based on the minimum number of bytes of
77 * separation between two subroutine call points in the object code.
78 * Given MIN_SUBR_SEPARATION bytes of separation the value of
79 * HASHFRACTION is calculated as:
81 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
83 * For the VAX, the shortest two call sequence is:
88 * which is separated by only three bytes, thus HASHFRACTION is
91 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
93 * Note that the division above rounds down, thus if MIN_SUBR_FRACTION
94 * is less than three, this algorithm will not work!
96 #define HASHFRACTION 1
99 * Percent of text space to allocate for tostructs with a minimum:
112 * A raw arc, with pointers to the calling site and the called site
113 * and a count. Everything is defined in terms of characters so
114 * as to get a packed representation (otherwise, different compilers
115 * might introduce different padding):
131 * General rounding functions:
133 #define ROUNDDOWN(x,y) (((x)/(y))*(y))
134 #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
This page took 0.045807 seconds and 4 git commands to generate.