]>
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 | |
5489fcc3 KR |
38 | struct raw_phdr { |
39 | char low_pc[sizeof(bfd_vma)]; /* base pc address of sample buffer */ | |
40 | char high_pc[sizeof(bfd_vma)]; /* max pc address of sampled buffer */ | |
41 | char ncnt[4]; /* size of sample buffer (plus this header) */ | |
42 | #ifdef __osf__ | |
3d6c6501 | 43 | /* |
5489fcc3 KR |
44 | * DEC's OSF v3.0 uses 4 bytes of padding to bring the header to |
45 | * a size that is a multiple of 8. | |
3d6c6501 | 46 | */ |
5489fcc3 KR |
47 | char pad[4]; |
48 | #endif | |
49 | }; | |
3d6c6501 | 50 | |
5489fcc3 KR |
51 | /* |
52 | * Histogram counters are unsigned shorts: | |
53 | */ | |
54 | #define HISTCOUNTER unsigned short | |
55 | ||
56 | /* | |
57 | * Fraction of text space to allocate for histogram counters here, 1/2: | |
58 | */ | |
3d6c6501 SEF |
59 | #define HISTFRACTION 2 |
60 | ||
5489fcc3 KR |
61 | /* |
62 | * Fraction of text space to allocate for from hash buckets. The | |
63 | * value of HASHFRACTION is based on the minimum number of bytes of | |
64 | * separation between two subroutine call points in the object code. | |
65 | * Given MIN_SUBR_SEPARATION bytes of separation the value of | |
66 | * HASHFRACTION is calculated as: | |
67 | * | |
68 | * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1); | |
69 | * | |
70 | * For the VAX, the shortest two call sequence is: | |
71 | * | |
72 | * calls $0,(r0) | |
73 | * calls $0,(r0) | |
74 | * | |
75 | * which is separated by only three bytes, thus HASHFRACTION is | |
76 | * calculated as: | |
77 | * | |
78 | * HASHFRACTION = 3 / (2 * 2 - 1) = 1 | |
79 | * | |
80 | * Note that the division above rounds down, thus if MIN_SUBR_FRACTION | |
81 | * is less than three, this algorithm will not work! | |
82 | */ | |
83 | #define HASHFRACTION 1 | |
3d6c6501 | 84 | |
5489fcc3 KR |
85 | /* |
86 | * Percent of text space to allocate for tostructs with a minimum: | |
87 | */ | |
3d6c6501 SEF |
88 | #define ARCDENSITY 2 |
89 | #define MINARCS 50 | |
90 | ||
91 | struct tostruct { | |
92 | char *selfpc; | |
5489fcc3 | 93 | int count; |
3d6c6501 SEF |
94 | unsigned short link; |
95 | }; | |
96 | ||
5489fcc3 KR |
97 | /* |
98 | * A raw arc, with pointers to the calling site and the called site | |
99 | * and a count. Everything is defined in terms of characters so | |
100 | * as to get a packed representation (otherwise, different compilers | |
101 | * might introduce different padding): | |
102 | */ | |
103 | struct raw_arc { | |
104 | char from_pc[sizeof(bfd_vma)]; | |
105 | char self_pc[sizeof(bfd_vma)]; | |
106 | char count[sizeof(long)]; | |
73fbbeea SC |
107 | }; |
108 | ||
5489fcc3 KR |
109 | /* |
110 | * General rounding functions: | |
111 | */ | |
3d6c6501 SEF |
112 | #define ROUNDDOWN(x,y) (((x)/(y))*(y)) |
113 | #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y)) | |
5489fcc3 KR |
114 | |
115 | #endif /* gmon_h */ |