Commit | Line | Data |
---|---|---|
3d6c6501 SEF |
1 | /*- |
2 | * Copyright (c) 1991 The Regents of the University of California. | |
3 | * 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 | * @(#)gmon.h 5.2 (Berkeley) 5/6/91 | |
34 | */ | |
5489fcc3 KR |
35 | #ifndef gmon_h |
36 | #define gmon_h | |
3d6c6501 | 37 | |
12516a37 KR |
38 | struct raw_phdr |
39 | { | |
c3de2a19 ILT |
40 | /* FIXME: Checking a host compiler define means that we can't use |
41 | a cross gprof to the alpha. */ | |
42 | #ifdef __alpha__ | |
9537b1d0 ILT |
43 | char low_pc[8]; /* base pc address of sample buffer */ |
44 | char high_pc[8]; /* max pc address of sampled buffer */ | |
45 | #else | |
46 | char low_pc[4]; /* base pc address of sample buffer */ | |
47 | char high_pc[4]; /* max pc address of sampled buffer */ | |
48 | #endif | |
5489fcc3 | 49 | char ncnt[4]; /* size of sample buffer (plus this header) */ |
0f579087 | 50 | |
c3de2a19 ILT |
51 | /* FIXME: Checking host compiler defines here means that we can't |
52 | use a cross gprof alpha OSF. */ | |
0f579087 | 53 | #if defined (__alpha__) && defined (__osf__) |
3d6c6501 | 54 | /* |
5489fcc3 KR |
55 | * DEC's OSF v3.0 uses 4 bytes of padding to bring the header to |
56 | * a size that is a multiple of 8. | |
3d6c6501 | 57 | */ |
5489fcc3 | 58 | char pad[4]; |
76a61985 ILT |
59 | #else |
60 | #ifdef BSD44_FORMAT | |
0f579087 ILT |
61 | char version[4]; /* version number */ |
62 | char profrate[4]; /* profiling clock rate */ | |
63 | char spare[3*4]; /* reserved */ | |
76a61985 | 64 | #endif |
5489fcc3 | 65 | #endif |
12516a37 | 66 | }; |
3d6c6501 | 67 | |
5489fcc3 KR |
68 | /* |
69 | * Histogram counters are unsigned shorts: | |
70 | */ | |
71 | #define HISTCOUNTER unsigned short | |
72 | ||
73 | /* | |
74 | * Fraction of text space to allocate for histogram counters here, 1/2: | |
75 | */ | |
3d6c6501 SEF |
76 | #define HISTFRACTION 2 |
77 | ||
5489fcc3 KR |
78 | /* |
79 | * Fraction of text space to allocate for from hash buckets. The | |
80 | * value of HASHFRACTION is based on the minimum number of bytes of | |
81 | * separation between two subroutine call points in the object code. | |
82 | * Given MIN_SUBR_SEPARATION bytes of separation the value of | |
83 | * HASHFRACTION is calculated as: | |
84 | * | |
12516a37 | 85 | * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1); |
5489fcc3 KR |
86 | * |
87 | * For the VAX, the shortest two call sequence is: | |
88 | * | |
12516a37 KR |
89 | * calls $0,(r0) |
90 | * calls $0,(r0) | |
5489fcc3 KR |
91 | * |
92 | * which is separated by only three bytes, thus HASHFRACTION is | |
93 | * calculated as: | |
94 | * | |
12516a37 | 95 | * HASHFRACTION = 3 / (2 * 2 - 1) = 1 |
5489fcc3 KR |
96 | * |
97 | * Note that the division above rounds down, thus if MIN_SUBR_FRACTION | |
98 | * is less than three, this algorithm will not work! | |
99 | */ | |
100 | #define HASHFRACTION 1 | |
3d6c6501 | 101 | |
5489fcc3 KR |
102 | /* |
103 | * Percent of text space to allocate for tostructs with a minimum: | |
104 | */ | |
3d6c6501 SEF |
105 | #define ARCDENSITY 2 |
106 | #define MINARCS 50 | |
107 | ||
12516a37 KR |
108 | struct tostruct |
109 | { | |
110 | char *selfpc; | |
111 | int count; | |
112 | unsigned short link; | |
113 | }; | |
3d6c6501 | 114 | |
5489fcc3 KR |
115 | /* |
116 | * A raw arc, with pointers to the calling site and the called site | |
117 | * and a count. Everything is defined in terms of characters so | |
118 | * as to get a packed representation (otherwise, different compilers | |
119 | * might introduce different padding): | |
120 | */ | |
12516a37 KR |
121 | struct raw_arc |
122 | { | |
c3de2a19 ILT |
123 | /* FIXME: Checking a host compiler define means that we can't use |
124 | a cross gprof to the alpha. */ | |
125 | #ifdef __alpha__ | |
9537b1d0 ILT |
126 | char from_pc[8]; |
127 | char self_pc[8]; | |
128 | char count[8]; | |
129 | #else | |
130 | char from_pc[4]; | |
131 | char self_pc[4]; | |
132 | char count[4]; | |
133 | #endif | |
12516a37 | 134 | }; |
73fbbeea | 135 | |
5489fcc3 KR |
136 | /* |
137 | * General rounding functions: | |
138 | */ | |
3d6c6501 SEF |
139 | #define ROUNDDOWN(x,y) (((x)/(y))*(y)) |
140 | #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y)) | |
5489fcc3 KR |
141 | |
142 | #endif /* gmon_h */ |