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
43 * histogram counters are unsigned shorts (according to the kernel).
45 #define HISTCOUNTER unsigned short
48 * fraction of text space to allocate for histogram counters
51 #define HISTFRACTION 2
54 * Fraction of text space to allocate for from hash buckets.
55 * The value of HASHFRACTION is based on the minimum number of bytes
56 * of separation between two subroutine call points in the object code.
57 * Given MIN_SUBR_SEPARATION bytes of separation the value of
58 * HASHFRACTION is calculated as:
60 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
62 * For the VAX, the shortest two call sequence is:
67 * which is separated by only three bytes, thus HASHFRACTION is
70 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
72 * Note that the division above rounds down, thus if MIN_SUBR_FRACTION
73 * is less than three, this algorithm will not work!
75 #define HASHFRACTION 1
78 * percent of text space to allocate for tostructs
92 * with pointers to the calling site and the called site
96 unsigned long raw_frompc
;
97 unsigned long raw_selfpc
;
108 * general rounding functions.
110 #define ROUNDDOWN(x,y) (((x)/(y))*(y))
111 #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
This page took 0.030521 seconds and 4 git commands to generate.