Commit | Line | Data |
---|---|---|
15637ed4 RG |
1 | /*- |
2 | * Copyright (c) 1982, 1986 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 | * | |
78ed81a3 | 33 | * from: @(#)gprof.h 7.2 (Berkeley) 2/15/91 |
34 | * $Id$ | |
15637ed4 RG |
35 | */ |
36 | ||
37 | struct phdr { | |
38 | char *lpc; | |
39 | char *hpc; | |
40 | int ncnt; | |
41 | }; | |
42 | ||
43 | /* | |
44 | * histogram counters are unsigned shorts (according to the kernel). | |
45 | */ | |
46 | #define HISTCOUNTER unsigned short | |
47 | ||
48 | /* | |
49 | * fraction of text space to allocate for histogram counters | |
50 | * here, 1/2 | |
51 | */ | |
52 | #define HISTFRACTION 2 | |
53 | ||
54 | /* | |
55 | * Fraction of text space to allocate for from hash buckets. | |
56 | * The value of HASHFRACTION is based on the minimum number of bytes | |
57 | * of separation between two subroutine call points in the object code. | |
58 | * Given MIN_SUBR_SEPARATION bytes of separation the value of | |
59 | * HASHFRACTION is calculated as: | |
60 | * | |
61 | * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1); | |
62 | * | |
63 | * For the VAX, the shortest two call sequence is: | |
64 | * | |
65 | * calls $0,(r0) | |
66 | * calls $0,(r0) | |
67 | * | |
68 | * which is separated by only three bytes, thus HASHFRACTION is | |
69 | * calculated as: | |
70 | * | |
71 | * HASHFRACTION = 3 / (2 * 2 - 1) = 1 | |
72 | * | |
73 | * Note that the division above rounds down, thus if MIN_SUBR_FRACTION | |
74 | * is less than three, this algorithm will not work! | |
75 | * | |
76 | * NB: for the kernel we assert that the shortest two call sequence is: | |
77 | * | |
78 | * calls $0,_name | |
79 | * calls $0,_name | |
80 | * | |
81 | * which is separated by seven bytes, thus HASHFRACTION is calculated as: | |
82 | * | |
83 | * HASHFRACTION = 7 / (2 * 2 - 1) = 2 | |
84 | */ | |
85 | #define HASHFRACTION 2 | |
86 | ||
87 | /* | |
88 | * percent of text space to allocate for tostructs | |
89 | * with a minimum. | |
90 | */ | |
91 | #define ARCDENSITY 2 | |
92 | #define MINARCS 50 | |
93 | ||
94 | struct tostruct { | |
95 | char *selfpc; | |
96 | long count; | |
97 | unsigned short link; | |
98 | }; | |
99 | ||
100 | /* | |
101 | * a raw arc, | |
102 | * with pointers to the calling site and the called site | |
103 | * and a count. | |
104 | */ | |
105 | struct rawarc { | |
106 | unsigned long raw_frompc; | |
107 | unsigned long raw_selfpc; | |
108 | long raw_count; | |
109 | }; | |
110 | ||
111 | /* | |
112 | * general rounding functions. | |
113 | */ | |
114 | #define ROUNDDOWN(x,y) (((x)/(y))*(y)) | |
115 | #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y)) |