/*-
|
/*-
|
* Copyright (c) 1991 The Regents of the University of California.
|
* Copyright (c) 1991 The Regents of the University of California.
|
* All rights reserved.
|
* All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. [rescinded 22 July 1999]
|
* 3. [rescinded 22 July 1999]
|
* 4. Neither the name of the University nor the names of its contributors
|
* 4. Neither the name of the University nor the names of its contributors
|
* may be used to endorse or promote products derived from this software
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*/
|
*/
|
|
|
/* Mangled into a form that works on SPARC Solaris 2 by Mark Eichin
|
/* Mangled into a form that works on SPARC Solaris 2 by Mark Eichin
|
* for Cygnus Support, July 1992.
|
* for Cygnus Support, July 1992.
|
*/
|
*/
|
|
|
#include "tconfig.h"
|
#include "tconfig.h"
|
#include "tsystem.h"
|
#include "tsystem.h"
|
#include <fcntl.h> /* for creat() */
|
#include <fcntl.h> /* for creat() */
|
#include "coretypes.h"
|
#include "coretypes.h"
|
#include "tm.h"
|
#include "tm.h"
|
|
|
#if 0
|
#if 0
|
#include "sparc/gmon.h"
|
#include "sparc/gmon.h"
|
#else
|
#else
|
struct phdr {
|
struct phdr {
|
char *lpc;
|
char *lpc;
|
char *hpc;
|
char *hpc;
|
int ncnt;
|
int ncnt;
|
};
|
};
|
#define HISTFRACTION 2
|
#define HISTFRACTION 2
|
#define HISTCOUNTER unsigned short
|
#define HISTCOUNTER unsigned short
|
#define HASHFRACTION 1
|
#define HASHFRACTION 1
|
#define ARCDENSITY 2
|
#define ARCDENSITY 2
|
#define MINARCS 50
|
#define MINARCS 50
|
struct tostruct {
|
struct tostruct {
|
char *selfpc;
|
char *selfpc;
|
long count;
|
long count;
|
unsigned short link;
|
unsigned short link;
|
};
|
};
|
struct rawarc {
|
struct rawarc {
|
unsigned long raw_frompc;
|
unsigned long raw_frompc;
|
unsigned long raw_selfpc;
|
unsigned long raw_selfpc;
|
long raw_count;
|
long raw_count;
|
};
|
};
|
#define ROUNDDOWN(x,y) (((x)/(y))*(y))
|
#define ROUNDDOWN(x,y) (((x)/(y))*(y))
|
#define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
|
#define ROUNDUP(x,y) ((((x)+(y)-1)/(y))*(y))
|
|
|
#endif
|
#endif
|
|
|
/* extern mcount() asm ("mcount"); */
|
/* extern mcount() asm ("mcount"); */
|
/*extern*/ char *minbrk /* asm ("minbrk") */;
|
/*extern*/ char *minbrk /* asm ("minbrk") */;
|
|
|
/*
|
/*
|
* froms is actually a bunch of unsigned shorts indexing tos
|
* froms is actually a bunch of unsigned shorts indexing tos
|
*/
|
*/
|
static int profiling = 3;
|
static int profiling = 3;
|
static unsigned short *froms;
|
static unsigned short *froms;
|
static struct tostruct *tos = 0;
|
static struct tostruct *tos = 0;
|
static long tolimit = 0;
|
static long tolimit = 0;
|
static char *s_lowpc = 0;
|
static char *s_lowpc = 0;
|
static char *s_highpc = 0;
|
static char *s_highpc = 0;
|
static unsigned long s_textsize = 0;
|
static unsigned long s_textsize = 0;
|
|
|
static int ssiz;
|
static int ssiz;
|
static char *sbuf;
|
static char *sbuf;
|
static int s_scale;
|
static int s_scale;
|
/* see profil(2) where this is describe (incorrectly) */
|
/* see profil(2) where this is describe (incorrectly) */
|
#define SCALE_1_TO_1 0x10000L
|
#define SCALE_1_TO_1 0x10000L
|
|
|
#define MSG "No space for profiling buffer(s)\n"
|
#define MSG "No space for profiling buffer(s)\n"
|
|
|
static void moncontrol (int);
|
static void moncontrol (int);
|
extern void monstartup (char *, char *);
|
extern void monstartup (char *, char *);
|
extern void _mcleanup (void);
|
extern void _mcleanup (void);
|
|
|
void monstartup(char *lowpc, char *highpc)
|
void monstartup(char *lowpc, char *highpc)
|
{
|
{
|
int monsize;
|
int monsize;
|
char *buffer;
|
char *buffer;
|
register int o;
|
register int o;
|
|
|
/*
|
/*
|
* round lowpc and highpc to multiples of the density we're using
|
* round lowpc and highpc to multiples of the density we're using
|
* so the rest of the scaling (here and in gprof) stays in ints.
|
* so the rest of the scaling (here and in gprof) stays in ints.
|
*/
|
*/
|
lowpc = (char *)
|
lowpc = (char *)
|
ROUNDDOWN((unsigned long)lowpc, HISTFRACTION*sizeof(HISTCOUNTER));
|
ROUNDDOWN((unsigned long)lowpc, HISTFRACTION*sizeof(HISTCOUNTER));
|
s_lowpc = lowpc;
|
s_lowpc = lowpc;
|
highpc = (char *)
|
highpc = (char *)
|
ROUNDUP((unsigned long)highpc, HISTFRACTION*sizeof(HISTCOUNTER));
|
ROUNDUP((unsigned long)highpc, HISTFRACTION*sizeof(HISTCOUNTER));
|
s_highpc = highpc;
|
s_highpc = highpc;
|
s_textsize = highpc - lowpc;
|
s_textsize = highpc - lowpc;
|
monsize = (s_textsize / HISTFRACTION) + sizeof(struct phdr);
|
monsize = (s_textsize / HISTFRACTION) + sizeof(struct phdr);
|
buffer = sbrk( monsize );
|
buffer = sbrk( monsize );
|
if ( buffer == (char *) -1 ) {
|
if ( buffer == (char *) -1 ) {
|
write( 2 , MSG , sizeof(MSG) );
|
write( 2 , MSG , sizeof(MSG) );
|
return;
|
return;
|
}
|
}
|
froms = (unsigned short *) sbrk( s_textsize / HASHFRACTION );
|
froms = (unsigned short *) sbrk( s_textsize / HASHFRACTION );
|
if ( froms == (unsigned short *) -1 ) {
|
if ( froms == (unsigned short *) -1 ) {
|
write( 2 , MSG , sizeof(MSG) );
|
write( 2 , MSG , sizeof(MSG) );
|
froms = 0;
|
froms = 0;
|
return;
|
return;
|
}
|
}
|
tolimit = s_textsize * ARCDENSITY / 100;
|
tolimit = s_textsize * ARCDENSITY / 100;
|
if ( tolimit < MINARCS ) {
|
if ( tolimit < MINARCS ) {
|
tolimit = MINARCS;
|
tolimit = MINARCS;
|
} else if ( tolimit > 65534 ) {
|
} else if ( tolimit > 65534 ) {
|
tolimit = 65534;
|
tolimit = 65534;
|
}
|
}
|
tos = (struct tostruct *) sbrk( tolimit * sizeof( struct tostruct ) );
|
tos = (struct tostruct *) sbrk( tolimit * sizeof( struct tostruct ) );
|
if ( tos == (struct tostruct *) -1 ) {
|
if ( tos == (struct tostruct *) -1 ) {
|
write( 2 , MSG , sizeof(MSG) );
|
write( 2 , MSG , sizeof(MSG) );
|
froms = 0;
|
froms = 0;
|
tos = 0;
|
tos = 0;
|
return;
|
return;
|
}
|
}
|
minbrk = sbrk(0);
|
minbrk = sbrk(0);
|
tos[0].link = 0;
|
tos[0].link = 0;
|
sbuf = buffer;
|
sbuf = buffer;
|
ssiz = monsize;
|
ssiz = monsize;
|
( (struct phdr *) buffer ) -> lpc = lowpc;
|
( (struct phdr *) buffer ) -> lpc = lowpc;
|
( (struct phdr *) buffer ) -> hpc = highpc;
|
( (struct phdr *) buffer ) -> hpc = highpc;
|
( (struct phdr *) buffer ) -> ncnt = ssiz;
|
( (struct phdr *) buffer ) -> ncnt = ssiz;
|
monsize -= sizeof(struct phdr);
|
monsize -= sizeof(struct phdr);
|
if ( monsize <= 0 )
|
if ( monsize <= 0 )
|
return;
|
return;
|
o = highpc - lowpc;
|
o = highpc - lowpc;
|
if( monsize < o )
|
if( monsize < o )
|
#ifndef hp300
|
#ifndef hp300
|
s_scale = ( (float) monsize / o ) * SCALE_1_TO_1;
|
s_scale = ( (float) monsize / o ) * SCALE_1_TO_1;
|
#else /* avoid floating point */
|
#else /* avoid floating point */
|
{
|
{
|
int quot = o / monsize;
|
int quot = o / monsize;
|
|
|
if (quot >= 0x10000)
|
if (quot >= 0x10000)
|
s_scale = 1;
|
s_scale = 1;
|
else if (quot >= 0x100)
|
else if (quot >= 0x100)
|
s_scale = 0x10000 / quot;
|
s_scale = 0x10000 / quot;
|
else if (o >= 0x800000)
|
else if (o >= 0x800000)
|
s_scale = 0x1000000 / (o / (monsize >> 8));
|
s_scale = 0x1000000 / (o / (monsize >> 8));
|
else
|
else
|
s_scale = 0x1000000 / ((o << 8) / monsize);
|
s_scale = 0x1000000 / ((o << 8) / monsize);
|
}
|
}
|
#endif
|
#endif
|
else
|
else
|
s_scale = SCALE_1_TO_1;
|
s_scale = SCALE_1_TO_1;
|
moncontrol(1);
|
moncontrol(1);
|
}
|
}
|
|
|
void
|
void
|
_mcleanup(void)
|
_mcleanup(void)
|
{
|
{
|
int fd;
|
int fd;
|
int fromindex;
|
int fromindex;
|
int endfrom;
|
int endfrom;
|
char *frompc;
|
char *frompc;
|
int toindex;
|
int toindex;
|
struct rawarc rawarc;
|
struct rawarc rawarc;
|
char *profdir;
|
char *profdir;
|
const char *proffile;
|
const char *proffile;
|
char *progname;
|
char *progname;
|
char buf[PATH_MAX];
|
char buf[PATH_MAX];
|
extern char **___Argv;
|
extern char **___Argv;
|
|
|
moncontrol(0);
|
moncontrol(0);
|
|
|
if ((profdir = getenv("PROFDIR")) != NULL) {
|
if ((profdir = getenv("PROFDIR")) != NULL) {
|
/* If PROFDIR contains a null value, no profiling output is produced */
|
/* If PROFDIR contains a null value, no profiling output is produced */
|
if (*profdir == '\0') {
|
if (*profdir == '\0') {
|
return;
|
return;
|
}
|
}
|
|
|
progname=strrchr(___Argv[0], '/');
|
progname=strrchr(___Argv[0], '/');
|
if (progname == NULL)
|
if (progname == NULL)
|
progname=___Argv[0];
|
progname=___Argv[0];
|
else
|
else
|
progname++;
|
progname++;
|
|
|
sprintf(buf, "%s/%ld.%s", profdir, (long) getpid(), progname);
|
sprintf(buf, "%s/%ld.%s", profdir, (long) getpid(), progname);
|
proffile = buf;
|
proffile = buf;
|
} else {
|
} else {
|
proffile = "gmon.out";
|
proffile = "gmon.out";
|
}
|
}
|
|
|
fd = creat( proffile, 0666 );
|
fd = creat( proffile, 0666 );
|
if ( fd < 0 ) {
|
if ( fd < 0 ) {
|
perror( proffile );
|
perror( proffile );
|
return;
|
return;
|
}
|
}
|
# ifdef DEBUG
|
# ifdef DEBUG
|
fprintf( stderr , "[mcleanup] sbuf 0x%x ssiz %d\n" , sbuf , ssiz );
|
fprintf( stderr , "[mcleanup] sbuf 0x%x ssiz %d\n" , sbuf , ssiz );
|
# endif /* DEBUG */
|
# endif /* DEBUG */
|
write( fd , sbuf , ssiz );
|
write( fd , sbuf , ssiz );
|
endfrom = s_textsize / (HASHFRACTION * sizeof(*froms));
|
endfrom = s_textsize / (HASHFRACTION * sizeof(*froms));
|
for ( fromindex = 0 ; fromindex < endfrom ; fromindex++ ) {
|
for ( fromindex = 0 ; fromindex < endfrom ; fromindex++ ) {
|
if ( froms[fromindex] == 0 ) {
|
if ( froms[fromindex] == 0 ) {
|
continue;
|
continue;
|
}
|
}
|
frompc = s_lowpc + (fromindex * HASHFRACTION * sizeof(*froms));
|
frompc = s_lowpc + (fromindex * HASHFRACTION * sizeof(*froms));
|
for (toindex=froms[fromindex]; toindex!=0; toindex=tos[toindex].link) {
|
for (toindex=froms[fromindex]; toindex!=0; toindex=tos[toindex].link) {
|
# ifdef DEBUG
|
# ifdef DEBUG
|
fprintf( stderr ,
|
fprintf( stderr ,
|
"[mcleanup] frompc 0x%x selfpc 0x%x count %d\n" ,
|
"[mcleanup] frompc 0x%x selfpc 0x%x count %d\n" ,
|
frompc , tos[toindex].selfpc , tos[toindex].count );
|
frompc , tos[toindex].selfpc , tos[toindex].count );
|
# endif /* DEBUG */
|
# endif /* DEBUG */
|
rawarc.raw_frompc = (unsigned long) frompc;
|
rawarc.raw_frompc = (unsigned long) frompc;
|
rawarc.raw_selfpc = (unsigned long) tos[toindex].selfpc;
|
rawarc.raw_selfpc = (unsigned long) tos[toindex].selfpc;
|
rawarc.raw_count = tos[toindex].count;
|
rawarc.raw_count = tos[toindex].count;
|
write( fd , &rawarc , sizeof rawarc );
|
write( fd , &rawarc , sizeof rawarc );
|
}
|
}
|
}
|
}
|
close( fd );
|
close( fd );
|
}
|
}
|
|
|
/*
|
/*
|
* The SPARC stack frame is only held together by the frame pointers
|
* The SPARC stack frame is only held together by the frame pointers
|
* in the register windows. According to the SVR4 SPARC ABI
|
* in the register windows. According to the SVR4 SPARC ABI
|
* Supplement, Low Level System Information/Operating System
|
* Supplement, Low Level System Information/Operating System
|
* Interface/Software Trap Types, a type 3 trap will flush all of the
|
* Interface/Software Trap Types, a type 3 trap will flush all of the
|
* register windows to the stack, which will make it possible to walk
|
* register windows to the stack, which will make it possible to walk
|
* the frames and find the return addresses.
|
* the frames and find the return addresses.
|
* However, it seems awfully expensive to incur a trap (system
|
* However, it seems awfully expensive to incur a trap (system
|
* call) for every function call. It turns out that "call" simply puts
|
* call) for every function call. It turns out that "call" simply puts
|
* the return address in %o7 expecting the "save" in the procedure to
|
* the return address in %o7 expecting the "save" in the procedure to
|
* shift it into %i7; this means that before the "save" occurs, %o7
|
* shift it into %i7; this means that before the "save" occurs, %o7
|
* contains the address of the call to mcount, and %i7 still contains
|
* contains the address of the call to mcount, and %i7 still contains
|
* the caller above that. The asm mcount here simply saves those
|
* the caller above that. The asm mcount here simply saves those
|
* registers in argument registers and branches to internal_mcount,
|
* registers in argument registers and branches to internal_mcount,
|
* simulating a call with arguments.
|
* simulating a call with arguments.
|
* Kludges:
|
* Kludges:
|
* 1) the branch to internal_mcount is hard coded; it should be
|
* 1) the branch to internal_mcount is hard coded; it should be
|
* possible to tell asm to use the assembler-name of a symbol.
|
* possible to tell asm to use the assembler-name of a symbol.
|
* 2) in theory, the function calling mcount could have saved %i7
|
* 2) in theory, the function calling mcount could have saved %i7
|
* somewhere and reused the register; in practice, I *think* this will
|
* somewhere and reused the register; in practice, I *think* this will
|
* break longjmp (and maybe the debugger) but I'm not certain. (I take
|
* break longjmp (and maybe the debugger) but I'm not certain. (I take
|
* some comfort in the knowledge that it will break the native mcount
|
* some comfort in the knowledge that it will break the native mcount
|
* as well.)
|
* as well.)
|
* 3) if builtin_return_address worked, this could be portable.
|
* 3) if builtin_return_address worked, this could be portable.
|
* However, it would really have to be optimized for arguments of 0
|
* However, it would really have to be optimized for arguments of 0
|
* and 1 and do something like what we have here in order to avoid the
|
* and 1 and do something like what we have here in order to avoid the
|
* trap per function call performance hit.
|
* trap per function call performance hit.
|
* 4) the atexit and monsetup calls prevent this from simply
|
* 4) the atexit and monsetup calls prevent this from simply
|
* being a leaf routine that doesn't do a "save" (and would thus have
|
* being a leaf routine that doesn't do a "save" (and would thus have
|
* access to %o7 and %i7 directly) but the call to write() at the end
|
* access to %o7 and %i7 directly) but the call to write() at the end
|
* would have also prevented this.
|
* would have also prevented this.
|
*
|
*
|
* -- [eichin:19920702.1107EST]
|
* -- [eichin:19920702.1107EST]
|
*/
|
*/
|
|
|
static void internal_mcount (char *, unsigned short *) __attribute__ ((used));
|
static void internal_mcount (char *, unsigned short *) __attribute__ ((used));
|
|
|
/* i7 == last ret, -> frompcindex */
|
/* i7 == last ret, -> frompcindex */
|
/* o7 == current ret, -> selfpc */
|
/* o7 == current ret, -> selfpc */
|
/* Solaris 2 libraries use _mcount. */
|
/* Solaris 2 libraries use _mcount. */
|
asm(".global _mcount; _mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
|
asm(".global _mcount; _mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
|
/* This is for compatibility with old versions of gcc which used mcount. */
|
/* This is for compatibility with old versions of gcc which used mcount. */
|
asm(".global mcount; mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
|
asm(".global mcount; mcount: mov %i7,%o1; mov %o7,%o0;b,a internal_mcount");
|
|
|
static void internal_mcount(char *selfpc, unsigned short *frompcindex)
|
static void internal_mcount(char *selfpc, unsigned short *frompcindex)
|
{
|
{
|
register struct tostruct *top;
|
register struct tostruct *top;
|
register struct tostruct *prevtop;
|
register struct tostruct *prevtop;
|
register long toindex;
|
register long toindex;
|
static char already_setup;
|
static char already_setup;
|
|
|
/*
|
/*
|
* find the return address for mcount,
|
* find the return address for mcount,
|
* and the return address for mcount's caller.
|
* and the return address for mcount's caller.
|
*/
|
*/
|
|
|
if(!already_setup) {
|
if(!already_setup) {
|
extern char etext[];
|
extern char etext[];
|
extern char _start[];
|
extern char _start[];
|
extern char _init[];
|
extern char _init[];
|
already_setup = 1;
|
already_setup = 1;
|
monstartup(_start < _init ? _start : _init, etext);
|
monstartup(_start < _init ? _start : _init, etext);
|
#ifdef USE_ONEXIT
|
#ifdef USE_ONEXIT
|
on_exit(_mcleanup, 0);
|
on_exit(_mcleanup, 0);
|
#else
|
#else
|
atexit(_mcleanup);
|
atexit(_mcleanup);
|
#endif
|
#endif
|
}
|
}
|
/*
|
/*
|
* check that we are profiling
|
* check that we are profiling
|
* and that we aren't recursively invoked.
|
* and that we aren't recursively invoked.
|
*/
|
*/
|
if (profiling) {
|
if (profiling) {
|
goto out;
|
goto out;
|
}
|
}
|
profiling++;
|
profiling++;
|
/*
|
/*
|
* check that frompcindex is a reasonable pc value.
|
* check that frompcindex is a reasonable pc value.
|
* for example: signal catchers get called from the stack,
|
* for example: signal catchers get called from the stack,
|
* not from text space. too bad.
|
* not from text space. too bad.
|
*/
|
*/
|
frompcindex = (unsigned short *)((long)frompcindex - (long)s_lowpc);
|
frompcindex = (unsigned short *)((long)frompcindex - (long)s_lowpc);
|
if ((unsigned long)frompcindex > s_textsize) {
|
if ((unsigned long)frompcindex > s_textsize) {
|
goto done;
|
goto done;
|
}
|
}
|
frompcindex =
|
frompcindex =
|
&froms[((long)frompcindex) / (HASHFRACTION * sizeof(*froms))];
|
&froms[((long)frompcindex) / (HASHFRACTION * sizeof(*froms))];
|
toindex = *frompcindex;
|
toindex = *frompcindex;
|
if (toindex == 0) {
|
if (toindex == 0) {
|
/*
|
/*
|
* first time traversing this arc
|
* first time traversing this arc
|
*/
|
*/
|
toindex = ++tos[0].link;
|
toindex = ++tos[0].link;
|
if (toindex >= tolimit) {
|
if (toindex >= tolimit) {
|
goto overflow;
|
goto overflow;
|
}
|
}
|
*frompcindex = toindex;
|
*frompcindex = toindex;
|
top = &tos[toindex];
|
top = &tos[toindex];
|
top->selfpc = selfpc;
|
top->selfpc = selfpc;
|
top->count = 1;
|
top->count = 1;
|
top->link = 0;
|
top->link = 0;
|
goto done;
|
goto done;
|
}
|
}
|
top = &tos[toindex];
|
top = &tos[toindex];
|
if (top->selfpc == selfpc) {
|
if (top->selfpc == selfpc) {
|
/*
|
/*
|
* arc at front of chain; usual case.
|
* arc at front of chain; usual case.
|
*/
|
*/
|
top->count++;
|
top->count++;
|
goto done;
|
goto done;
|
}
|
}
|
/*
|
/*
|
* have to go looking down chain for it.
|
* have to go looking down chain for it.
|
* top points to what we are looking at,
|
* top points to what we are looking at,
|
* prevtop points to previous top.
|
* prevtop points to previous top.
|
* we know it is not at the head of the chain.
|
* we know it is not at the head of the chain.
|
*/
|
*/
|
for (; /* goto done */; ) {
|
for (; /* goto done */; ) {
|
if (top->link == 0) {
|
if (top->link == 0) {
|
/*
|
/*
|
* top is end of the chain and none of the chain
|
* top is end of the chain and none of the chain
|
* had top->selfpc == selfpc.
|
* had top->selfpc == selfpc.
|
* so we allocate a new tostruct
|
* so we allocate a new tostruct
|
* and link it to the head of the chain.
|
* and link it to the head of the chain.
|
*/
|
*/
|
toindex = ++tos[0].link;
|
toindex = ++tos[0].link;
|
if (toindex >= tolimit) {
|
if (toindex >= tolimit) {
|
goto overflow;
|
goto overflow;
|
}
|
}
|
top = &tos[toindex];
|
top = &tos[toindex];
|
top->selfpc = selfpc;
|
top->selfpc = selfpc;
|
top->count = 1;
|
top->count = 1;
|
top->link = *frompcindex;
|
top->link = *frompcindex;
|
*frompcindex = toindex;
|
*frompcindex = toindex;
|
goto done;
|
goto done;
|
}
|
}
|
/*
|
/*
|
* otherwise, check the next arc on the chain.
|
* otherwise, check the next arc on the chain.
|
*/
|
*/
|
prevtop = top;
|
prevtop = top;
|
top = &tos[top->link];
|
top = &tos[top->link];
|
if (top->selfpc == selfpc) {
|
if (top->selfpc == selfpc) {
|
/*
|
/*
|
* there it is.
|
* there it is.
|
* increment its count
|
* increment its count
|
* move it to the head of the chain.
|
* move it to the head of the chain.
|
*/
|
*/
|
top->count++;
|
top->count++;
|
toindex = prevtop->link;
|
toindex = prevtop->link;
|
prevtop->link = top->link;
|
prevtop->link = top->link;
|
top->link = *frompcindex;
|
top->link = *frompcindex;
|
*frompcindex = toindex;
|
*frompcindex = toindex;
|
goto done;
|
goto done;
|
}
|
}
|
|
|
}
|
}
|
done:
|
done:
|
profiling--;
|
profiling--;
|
/* and fall through */
|
/* and fall through */
|
out:
|
out:
|
return; /* normal return restores saved registers */
|
return; /* normal return restores saved registers */
|
|
|
overflow:
|
overflow:
|
profiling++; /* halt further profiling */
|
profiling++; /* halt further profiling */
|
# define TOLIMIT "mcount: tos overflow\n"
|
# define TOLIMIT "mcount: tos overflow\n"
|
write(2, TOLIMIT, sizeof(TOLIMIT));
|
write(2, TOLIMIT, sizeof(TOLIMIT));
|
goto out;
|
goto out;
|
}
|
}
|
|
|
/*
|
/*
|
* Control profiling
|
* Control profiling
|
* profiling is what mcount checks to see if
|
* profiling is what mcount checks to see if
|
* all the data structures are ready.
|
* all the data structures are ready.
|
*/
|
*/
|
static void moncontrol(int mode)
|
static void moncontrol(int mode)
|
{
|
{
|
if (mode) {
|
if (mode) {
|
/* start */
|
/* start */
|
profil((unsigned short *)(sbuf + sizeof(struct phdr)),
|
profil((unsigned short *)(sbuf + sizeof(struct phdr)),
|
ssiz - sizeof(struct phdr),
|
ssiz - sizeof(struct phdr),
|
(long)s_lowpc, s_scale);
|
(long)s_lowpc, s_scale);
|
profiling = 0;
|
profiling = 0;
|
} else {
|
} else {
|
/* stop */
|
/* stop */
|
profil((unsigned short *)0, 0, 0, 0);
|
profil((unsigned short *)0, 0, 0, 0);
|
profiling = 3;
|
profiling = 3;
|
}
|
}
|
}
|
}
|
|
|
