| 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 | */ |
| 35 | #ifndef gmon_h |
| 36 | #define gmon_h |
| 37 | |
| 38 | struct raw_phdr |
| 39 | { |
| 40 | #ifdef TARGET_alpha |
| 41 | char low_pc[8]; /* base pc address of sample buffer */ |
| 42 | char high_pc[8]; /* max pc address of sampled buffer */ |
| 43 | #else |
| 44 | char low_pc[4]; /* base pc address of sample buffer */ |
| 45 | char high_pc[4]; /* max pc address of sampled buffer */ |
| 46 | #endif |
| 47 | char ncnt[4]; /* size of sample buffer (plus this header) */ |
| 48 | |
| 49 | #if defined (__alpha__) && defined (__osf__) |
| 50 | /* |
| 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. |
| 53 | */ |
| 54 | char pad[4]; |
| 55 | #else |
| 56 | #ifdef BSD44_FORMAT |
| 57 | char version[4]; /* version number */ |
| 58 | char profrate[4]; /* profiling clock rate */ |
| 59 | char spare[3*4]; /* reserved */ |
| 60 | #endif |
| 61 | #endif |
| 62 | }; |
| 63 | |
| 64 | /* |
| 65 | * Histogram counters are unsigned shorts: |
| 66 | */ |
| 67 | #define HISTCOUNTER unsigned short |
| 68 | |
| 69 | /* |
| 70 | * Fraction of text space to allocate for histogram counters here, 1/2: |
| 71 | */ |
| 72 | #define HISTFRACTION 2 |
| 73 | |
| 74 | /* |
| 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: |
| 80 | * |
| 81 | * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1); |
| 82 | * |
| 83 | * For the VAX, the shortest two call sequence is: |
| 84 | * |
| 85 | * calls $0,(r0) |
| 86 | * calls $0,(r0) |
| 87 | * |
| 88 | * which is separated by only three bytes, thus HASHFRACTION is |
| 89 | * calculated as: |
| 90 | * |
| 91 | * HASHFRACTION = 3 / (2 * 2 - 1) = 1 |
| 92 | * |
| 93 | * Note that the division above rounds down, thus if MIN_SUBR_FRACTION |
| 94 | * is less than three, this algorithm will not work! |
| 95 | */ |
| 96 | #define HASHFRACTION 1 |
| 97 | |
| 98 | /* |
| 99 | * Percent of text space to allocate for tostructs with a minimum: |
| 100 | */ |
| 101 | #define ARCDENSITY 2 |
| 102 | #define MINARCS 50 |
| 103 | |
| 104 | struct tostruct |
| 105 | { |
| 106 | char *selfpc; |
| 107 | int count; |
| 108 | unsigned short link; |
| 109 | }; |
| 110 | |
| 111 | /* |
| 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): |
| 116 | */ |
| 117 | struct raw_arc |
| 118 | { |
| 119 | #ifdef TARGET_alpha |
| 120 | char from_pc[8]; |
| 121 | char self_pc[8]; |
| 122 | char count[8]; |
| 123 | #else |
| 124 | char from_pc[4]; |
| 125 | char self_pc[4]; |
| 126 | char count[4]; |
| 127 | #endif |
| 128 | }; |
| 129 | |
| 130 | /* |
| 131 | * General rounding functions: |
| 132 | */ |
| 133 | #define ROUNDDOWN(x,y) (((x)/(y))*(y)) |
| 134 | #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y)) |
| 135 | |
| 136 | #endif /* gmon_h */ |