Update.
[glibc.git] / gmon / sys / gmon.h
blobbb17b75681510dff0c7aad72d7bbae8263c63a98
1 /*-
2 * Copyright (c) 1982, 1986, 1992, 1993
3 * The Regents of the University of California. All rights reserved.
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
29 * @(#)gmon.h 8.2 (Berkeley) 1/4/94
32 #ifndef _SYS_GMON_H
33 #define _SYS_GMON_H 1
35 #include <features.h>
37 #include <sys/types.h>
40 * See gmon_out.h for gmon.out format.
43 /* structure emitted by "gcc -a". This must match struct bb in
44 gcc/libgcc2.c. It is OK for gcc to declare a longer structure as
45 long as the members below are present. */
46 struct __bb
48 long zero_word;
49 const char *filename;
50 long *counts;
51 long ncounts;
52 struct __bb *next;
53 const unsigned long *addresses;
56 extern struct __bb *__bb_head;
59 * histogram counters are unsigned shorts (according to the kernel).
61 #define HISTCOUNTER unsigned short
64 * fraction of text space to allocate for histogram counters here, 1/2
66 #define HISTFRACTION 2
69 * Fraction of text space to allocate for from hash buckets.
70 * The value of HASHFRACTION is based on the minimum number of bytes
71 * of separation between two subroutine call points in the object code.
72 * Given MIN_SUBR_SEPARATION bytes of separation the value of
73 * HASHFRACTION is calculated as:
75 * HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
77 * For example, on the VAX, the shortest two call sequence is:
79 * calls $0,(r0)
80 * calls $0,(r0)
82 * which is separated by only three bytes, thus HASHFRACTION is
83 * calculated as:
85 * HASHFRACTION = 3 / (2 * 2 - 1) = 1
87 * Note that the division above rounds down, thus if MIN_SUBR_FRACTION
88 * is less than three, this algorithm will not work!
90 * In practice, however, call instructions are rarely at a minimal
91 * distance. Hence, we will define HASHFRACTION to be 2 across all
92 * architectures. This saves a reasonable amount of space for
93 * profiling data structures without (in practice) sacrificing
94 * any granularity.
96 #define HASHFRACTION 2
99 * percent of text space to allocate for tostructs with a minimum.
101 #define ARCDENSITY 2
102 #define MINARCS 50
103 #define MAXARCS ((1 << (8 * sizeof(HISTCOUNTER))) - 2)
105 struct tostruct {
106 u_long selfpc;
107 long count;
108 u_short link;
109 u_short pad;
113 * a raw arc, with pointers to the calling site and
114 * the called site and a count.
116 struct rawarc {
117 u_long raw_frompc;
118 u_long raw_selfpc;
119 long raw_count;
123 * general rounding functions.
125 #define ROUNDDOWN(x,y) (((x)/(y))*(y))
126 #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
129 * The profiling data structures are housed in this structure.
131 struct gmonparam {
132 long int state;
133 u_short *kcount;
134 u_long kcountsize;
135 u_short *froms;
136 u_long fromssize;
137 struct tostruct *tos;
138 u_long tossize;
139 long tolimit;
140 u_long lowpc;
141 u_long highpc;
142 u_long textsize;
143 u_long hashfraction;
144 long log_hashfraction;
146 extern struct gmonparam _gmonparam;
149 * Possible states of profiling.
151 #define GMON_PROF_ON 0
152 #define GMON_PROF_BUSY 1
153 #define GMON_PROF_ERROR 2
154 #define GMON_PROF_OFF 3
157 * Sysctl definitions for extracting profiling information from the kernel.
159 #define GPROF_STATE 0 /* int: profiling enabling variable */
160 #define GPROF_COUNT 1 /* struct: profile tick count buffer */
161 #define GPROF_FROMS 2 /* struct: from location hash bucket */
162 #define GPROF_TOS 3 /* struct: destination/count structure */
163 #define GPROF_GMONPARAM 4 /* struct: profiling parameters (see above) */
165 __BEGIN_DECLS
167 /* Set up data structures and start profiling. */
168 extern void __monstartup (u_long __lowpc, u_long __highpc) __THROW;
169 extern void monstartup (u_long __lowpc, u_long __highpc) __THROW;
171 /* Clean up profiling and write out gmon.out. */
172 extern void _mcleanup (void) __THROW;
174 __END_DECLS
176 #endif /* sys/gmon.h */