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. [rescinded 22 July 1999]
14 * 4. Neither the name of the University nor the names of its contributors
15 * may be used to endorse or promote products derived from this software
16 * without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 /* Mangled into a form that works on SPARC Solaris 2 by Mark Eichin
32 * for Cygnus Support, July 1992.
37 #include <fcntl.h> /* for creat() */
38 #include "coretypes.h"
42 #include "sparc/gmon.h"
49 #define HISTFRACTION 2
50 #define HISTCOUNTER unsigned short
51 #define HASHFRACTION 1
60 unsigned long raw_frompc
;
61 unsigned long raw_selfpc
;
64 #define ROUNDDOWN(x,y) (((x)/(y))*(y))
65 #define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
69 /* extern mcount() asm ("mcount"); */
70 /*extern*/ char *minbrk
/* asm ("minbrk") */;
73 * froms is actually a bunch of unsigned shorts indexing tos
75 static int profiling
= 3;
76 static unsigned short *froms
;
77 static struct tostruct
*tos
= 0;
78 static long tolimit
= 0;
79 static char *s_lowpc
= 0;
80 static char *s_highpc
= 0;
81 static unsigned long s_textsize
= 0;
86 /* see profil(2) where this is describe (incorrectly) */
87 #define SCALE_1_TO_1 0x10000L
89 #define MSG "No space for profiling buffer(s)\n"
91 static void moncontrol (int);
92 extern void monstartup (char *, char *);
93 extern void _mcleanup (void);
95 void monstartup(char *lowpc
, char *highpc
)
102 * round lowpc and highpc to multiples of the density we're using
103 * so the rest of the scaling (here and in gprof) stays in ints.
106 ROUNDDOWN((unsigned long)lowpc
, HISTFRACTION
*sizeof(HISTCOUNTER
));
109 ROUNDUP((unsigned long)highpc
, HISTFRACTION
*sizeof(HISTCOUNTER
));
111 s_textsize
= highpc
- lowpc
;
112 monsize
= (s_textsize
/ HISTFRACTION
) + sizeof(struct phdr
);
113 buffer
= sbrk( monsize
);
114 if ( buffer
== (char *) -1 ) {
115 write( 2 , MSG
, sizeof(MSG
) );
118 froms
= (unsigned short *) sbrk( s_textsize
/ HASHFRACTION
);
119 if ( froms
== (unsigned short *) -1 ) {
120 write( 2 , MSG
, sizeof(MSG
) );
124 tolimit
= s_textsize
* ARCDENSITY
/ 100;
125 if ( tolimit
< MINARCS
) {
127 } else if ( tolimit
> 65534 ) {
130 tos
= (struct tostruct
*) sbrk( tolimit
* sizeof( struct tostruct
) );
131 if ( tos
== (struct tostruct
*) -1 ) {
132 write( 2 , MSG
, sizeof(MSG
) );
141 ( (struct phdr
*) buffer
) -> lpc
= lowpc
;
142 ( (struct phdr
*) buffer
) -> hpc
= highpc
;
143 ( (struct phdr
*) buffer
) -> ncnt
= ssiz
;
144 monsize
-= sizeof(struct phdr
);
150 s_scale
= ( (float) monsize
/ o
) * SCALE_1_TO_1
;
151 #else /* avoid floating point */
153 int quot
= o
/ monsize
;
157 else if (quot
>= 0x100)
158 s_scale
= 0x10000 / quot
;
159 else if (o
>= 0x800000)
160 s_scale
= 0x1000000 / (o
/ (monsize
>> 8));
162 s_scale
= 0x1000000 / ((o
<< 8) / monsize
);
166 s_scale
= SCALE_1_TO_1
;
178 struct rawarc rawarc
;
180 const char *proffile
;
183 extern char **___Argv
;
187 if ((profdir
= getenv("PROFDIR")) != NULL
) {
188 /* If PROFDIR contains a null value, no profiling output is produced */
189 if (*profdir
== '\0') {
193 progname
=strrchr(___Argv
[0], '/');
194 if (progname
== NULL
)
199 sprintf(buf
, "%s/%ld.%s", profdir
, (long) getpid(), progname
);
202 proffile
= "gmon.out";
205 fd
= creat( proffile
, 0666 );
211 fprintf( stderr
, "[mcleanup] sbuf 0x%x ssiz %d\n" , sbuf
, ssiz
);
213 write( fd
, sbuf
, ssiz
);
214 endfrom
= s_textsize
/ (HASHFRACTION
* sizeof(*froms
));
215 for ( fromindex
= 0 ; fromindex
< endfrom
; fromindex
++ ) {
216 if ( froms
[fromindex
] == 0 ) {
219 frompc
= s_lowpc
+ (fromindex
* HASHFRACTION
* sizeof(*froms
));
220 for (toindex
=froms
[fromindex
]; toindex
!=0; toindex
=tos
[toindex
].link
) {
223 "[mcleanup] frompc 0x%x selfpc 0x%x count %d\n" ,
224 frompc
, tos
[toindex
].selfpc
, tos
[toindex
].count
);
226 rawarc
.raw_frompc
= (unsigned long) frompc
;
227 rawarc
.raw_selfpc
= (unsigned long) tos
[toindex
].selfpc
;
228 rawarc
.raw_count
= tos
[toindex
].count
;
229 write( fd
, &rawarc
, sizeof rawarc
);
236 * The SPARC stack frame is only held together by the frame pointers
237 * in the register windows. According to the SVR4 SPARC ABI
238 * Supplement, Low Level System Information/Operating System
239 * Interface/Software Trap Types, a type 3 trap will flush all of the
240 * register windows to the stack, which will make it possible to walk
241 * the frames and find the return addresses.
242 * However, it seems awfully expensive to incur a trap (system
243 * call) for every function call. It turns out that "call" simply puts
244 * the return address in %o7 expecting the "save" in the procedure to
245 * shift it into %i7; this means that before the "save" occurs, %o7
246 * contains the address of the call to mcount, and %i7 still contains
247 * the caller above that. The asm mcount here simply saves those
248 * registers in argument registers and branches to internal_mcount,
249 * simulating a call with arguments.
251 * 1) the branch to internal_mcount is hard coded; it should be
252 * possible to tell asm to use the assembler-name of a symbol.
253 * 2) in theory, the function calling mcount could have saved %i7
254 * somewhere and reused the register; in practice, I *think* this will
255 * break longjmp (and maybe the debugger) but I'm not certain. (I take
256 * some comfort in the knowledge that it will break the native mcount
258 * 3) if builtin_return_address worked, this could be portable.
259 * However, it would really have to be optimized for arguments of 0
260 * and 1 and do something like what we have here in order to avoid the
261 * trap per function call performance hit.
262 * 4) the atexit and monsetup calls prevent this from simply
263 * being a leaf routine that doesn't do a "save" (and would thus have
264 * access to %o7 and %i7 directly) but the call to write() at the end
265 * would have also prevented this.
267 * -- [eichin:19920702.1107EST]
270 static void internal_mcount (char *, unsigned short *) __attribute__ ((used
));
272 /* i7 == last ret, -> frompcindex */
273 /* o7 == current ret, -> selfpc */
274 /* Solaris 2 libraries use _mcount. */
275 asm(".global _mcount; _mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
276 /* This is for compatibility with old versions of gcc which used mcount. */
277 asm(".global mcount; mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
279 static void internal_mcount(char *selfpc
, unsigned short *frompcindex
)
281 register struct tostruct
*top
;
282 register struct tostruct
*prevtop
;
283 register long toindex
;
284 static char already_setup
;
287 * find the return address for mcount,
288 * and the return address for mcount's caller.
293 extern char _start
[];
296 monstartup(_start
< _init
? _start
: _init
, etext
);
298 on_exit(_mcleanup
, 0);
304 * check that we are profiling
305 * and that we aren't recursively invoked.
312 * check that frompcindex is a reasonable pc value.
313 * for example: signal catchers get called from the stack,
314 * not from text space. too bad.
316 frompcindex
= (unsigned short *)((long)frompcindex
- (long)s_lowpc
);
317 if ((unsigned long)frompcindex
> s_textsize
) {
321 &froms
[((long)frompcindex
) / (HASHFRACTION
* sizeof(*froms
))];
322 toindex
= *frompcindex
;
325 * first time traversing this arc
327 toindex
= ++tos
[0].link
;
328 if (toindex
>= tolimit
) {
331 *frompcindex
= toindex
;
333 top
->selfpc
= selfpc
;
339 if (top
->selfpc
== selfpc
) {
341 * arc at front of chain; usual case.
347 * have to go looking down chain for it.
348 * top points to what we are looking at,
349 * prevtop points to previous top.
350 * we know it is not at the head of the chain.
352 for (; /* goto done */; ) {
353 if (top
->link
== 0) {
355 * top is end of the chain and none of the chain
356 * had top->selfpc == selfpc.
357 * so we allocate a new tostruct
358 * and link it to the head of the chain.
360 toindex
= ++tos
[0].link
;
361 if (toindex
>= tolimit
) {
365 top
->selfpc
= selfpc
;
367 top
->link
= *frompcindex
;
368 *frompcindex
= toindex
;
372 * otherwise, check the next arc on the chain.
375 top
= &tos
[top
->link
];
376 if (top
->selfpc
== selfpc
) {
379 * increment its count
380 * move it to the head of the chain.
383 toindex
= prevtop
->link
;
384 prevtop
->link
= top
->link
;
385 top
->link
= *frompcindex
;
386 *frompcindex
= toindex
;
393 /* and fall through */
395 return; /* normal return restores saved registers */
398 profiling
++; /* halt further profiling */
399 # define TOLIMIT "mcount: tos overflow\n"
400 write(2, TOLIMIT
, sizeof(TOLIMIT
));
406 * profiling is what mcount checks to see if
407 * all the data structures are ready.
409 static void moncontrol(int mode
)
413 profil((unsigned short *)(sbuf
+ sizeof(struct phdr
)),
414 ssiz
- sizeof(struct phdr
),
415 (long)s_lowpc
, s_scale
);
419 profil((unsigned short *)0, 0, 0, 0);