2 * Copyright (c) 1991 The Regents of the University of California.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
35 * This is a modified gmon.c by J.W.Hawtin <oolon@ankh.org>,
36 * 14/8/96 based on the original gmon.c in GCC and the hacked version
37 * solaris 2 sparc version (config/sparc/gmon-sol.c) by Mark Eichin. To do
38 * process profiling on solaris 2.X X86
40 * It must be used in conjunction with sol2-gc1.asm, which is used to start
41 * and stop process monitoring.
45 * On Solaris 2 _mcount is called by library functions not mcount, so support
46 * has been added for both.
48 * Also the prototype for profil() is different
50 * Solaris 2 does not seem to have char *minbrk whcih allows the setting of
51 * the minimum SBRK region so this code has been removed and lets pray malloc
52 * does not mess it up.
56 * This code could easily be integrated with the original gmon.c and perhaps
61 static char sccsid[] = "@(#)gmon.c 5.3 (Berkeley) 5/22/91";
73 #include "i386/gmon.h"
83 #define HISTFRACTION 2
84 #define HISTCOUNTER unsigned short
85 #define HASHFRACTION 1
88 #define BASEADDRESS 0x8000000 /* On Solaris 2 X86 all executables start here
97 unsigned long raw_frompc;
98 unsigned long raw_selfpc;
101 #define ROUNDDOWN(x,y) (((x)/(y))*(y))
102 #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
108 extern char *sbrk ();
112 * froms is actually a bunch of unsigned shorts indexing tos
114 static int profiling = 3;
115 static unsigned short *froms;
116 static struct tostruct *tos = 0;
117 static long tolimit = 0;
118 static char *s_lowpc = 0;
119 static char *s_highpc = 0;
120 static unsigned long s_textsize = 0;
125 /* see profil(2) where this is describe (incorrectly) */
126 #define SCALE_1_TO_1 0x10000L
128 #define MSG "No space for profiling buffer(s)\n"
132 monstartup(lowpc, highpc)
141 * round lowpc and highpc to multiples of the density we're using
142 * so the rest of the scaling (here and in gprof) stays in ints.
145 ROUNDDOWN((unsigned)lowpc, HISTFRACTION*sizeof(HISTCOUNTER));
148 ROUNDUP((unsigned)highpc, HISTFRACTION*sizeof(HISTCOUNTER));
150 s_textsize = highpc - lowpc;
151 monsize = (s_textsize / HISTFRACTION) + sizeof(struct phdr);
152 buffer = (char *) sbrk( monsize );
153 if ( buffer == (char *) -1 ) {
154 write( 2 , MSG , sizeof(MSG) );
157 froms = (unsigned short *) sbrk( s_textsize / HASHFRACTION );
158 if ( froms == (unsigned short *) -1 ) {
159 write( 2 , MSG , sizeof(MSG) );
163 tolimit = s_textsize * ARCDENSITY / 100;
164 if ( tolimit < MINARCS ) {
166 } else if ( tolimit > 65534 ) {
169 tos = (struct tostruct *) sbrk( tolimit * sizeof( struct tostruct ) );
170 if ( tos == (struct tostruct *) -1 ) {
171 write( 2 , MSG , sizeof(MSG) );
176 /* minbrk = (char *) sbrk(0);*/
180 ( (struct phdr *) buffer ) -> lpc = lowpc;
181 ( (struct phdr *) buffer ) -> hpc = highpc;
182 ( (struct phdr *) buffer ) -> ncnt = ssiz;
183 monsize -= sizeof(struct phdr);
189 s_scale = ( (float) monsize / o ) * SCALE_1_TO_1;
190 #else /* avoid floating point */
192 int quot = o / monsize;
196 else if (quot >= 0x100)
197 s_scale = 0x10000 / quot;
198 else if (o >= 0x800000)
199 s_scale = 0x1000000 / (o / (monsize >> 8));
201 s_scale = 0x1000000 / ((o << 8) / monsize);
205 s_scale = SCALE_1_TO_1;
216 struct rawarc rawarc;
219 fd = creat( "gmon.out" , 0666 );
221 perror( "mcount: gmon.out" );
225 fprintf( stderr , "[mcleanup] sbuf 0x%x ssiz %d\n" , sbuf , ssiz );
228 write( fd , sbuf , ssiz );
229 endfrom = s_textsize / (HASHFRACTION * sizeof(*froms));
230 for ( fromindex = 0 ; fromindex < endfrom ; fromindex++ ) {
231 if ( froms[fromindex] == 0 ) {
234 frompc = s_lowpc + (fromindex * HASHFRACTION * sizeof(*froms));
235 for (toindex=froms[fromindex]; toindex!=0; toindex=tos[toindex].link) {
238 "[mcleanup] frompc 0x%x selfpc 0x%x count %d\n" ,
239 frompc , tos[toindex].selfpc , tos[toindex].count );
241 rawarc.raw_frompc = (unsigned long) frompc;
242 rawarc.raw_selfpc = (unsigned long) tos[toindex].selfpc;
243 rawarc.raw_count = tos[toindex].count;
244 write( fd , &rawarc , sizeof rawarc );
250 /* Solaris 2 libraries use _mcount. */
251 asm(".globl _mcount; _mcount: jmp internal_mcount");
252 /* This is for compatibility with old versions of gcc which used mcount. */
253 asm(".globl mcount; mcount: jmp internal_mcount");
257 register char *selfpc;
258 register unsigned short *frompcindex;
259 register struct tostruct *top;
260 register struct tostruct *prevtop;
261 register long toindex;
262 static char already_setup;
265 * find the return address for mcount,
266 * and the return address for mcount's caller.
269 /* selfpc = pc pushed by mcount call.
270 This identifies the function that was just entered. */
271 selfpc = (void *) __builtin_return_address (0);
272 /* frompcindex = pc in preceding frame.
273 This identifies the caller of the function just entered. */
274 frompcindex = (void *) __builtin_return_address (1);
279 /* monstartup(0, etext); */
280 monstartup(0x08040000, etext);
282 on_exit(_mcleanup, 0);
288 * check that we are profiling
289 * and that we aren't recursively invoked.
296 * check that frompcindex is a reasonable pc value.
297 * for example: signal catchers get called from the stack,
298 * not from text space. too bad.
300 frompcindex = (unsigned short *)((long)frompcindex - (long)s_lowpc);
301 if ((unsigned long)frompcindex > s_textsize) {
305 &froms[((long)frompcindex) / (HASHFRACTION * sizeof(*froms))];
306 toindex = *frompcindex;
309 * first time traversing this arc
311 toindex = ++tos[0].link;
312 if (toindex >= tolimit) {
315 *frompcindex = toindex;
317 top->selfpc = selfpc;
323 if (top->selfpc == selfpc) {
325 * arc at front of chain; usual case.
331 * have to go looking down chain for it.
332 * top points to what we are looking at,
333 * prevtop points to previous top.
334 * we know it is not at the head of the chain.
336 for (; /* goto done */; ) {
337 if (top->link == 0) {
339 * top is end of the chain and none of the chain
340 * had top->selfpc == selfpc.
341 * so we allocate a new tostruct
342 * and link it to the head of the chain.
344 toindex = ++tos[0].link;
345 if (toindex >= tolimit) {
349 top->selfpc = selfpc;
351 top->link = *frompcindex;
352 *frompcindex = toindex;
356 * otherwise, check the next arc on the chain.
359 top = &tos[top->link];
360 if (top->selfpc == selfpc) {
363 * increment its count
364 * move it to the head of the chain.
367 toindex = prevtop->link;
368 prevtop->link = top->link;
369 top->link = *frompcindex;
370 *frompcindex = toindex;
377 /* and fall through */
379 return; /* normal return restores saved registers */
382 profiling++; /* halt further profiling */
383 # define TOLIMIT "mcount: tos overflow\n"
384 write(2, TOLIMIT, sizeof(TOLIMIT));
390 * profiling is what mcount checks to see if
391 * all the data structures are ready.
399 profil((unsigned short *)(sbuf + sizeof(struct phdr)),
400 ssiz - sizeof(struct phdr),
401 (int)s_lowpc, s_scale);
406 profil((unsigned short *)0, 0, 0, 0);