Home | History | Annotate | Line # | Download | only in gmon
mcount.c revision 1.1
      1  1.1  christos /*	$NetBSD: mcount.c,v 1.1 2005/12/20 19:28:51 christos Exp $	*/
      2  1.1  christos 
      3  1.1  christos /*
      4  1.1  christos  * Copyright (c) 2003, 2004 Wasabi Systems, Inc.
      5  1.1  christos  * All rights reserved.
      6  1.1  christos  *
      7  1.1  christos  * Written by Nathan J. Williams for Wasabi Systems, Inc.
      8  1.1  christos  *
      9  1.1  christos  * Redistribution and use in source and binary forms, with or without
     10  1.1  christos  * modification, are permitted provided that the following conditions
     11  1.1  christos  * are met:
     12  1.1  christos  * 1. Redistributions of source code must retain the above copyright
     13  1.1  christos  *    notice, this list of conditions and the following disclaimer.
     14  1.1  christos  * 2. Redistributions in binary form must reproduce the above copyright
     15  1.1  christos  *    notice, this list of conditions and the following disclaimer in the
     16  1.1  christos  *    documentation and/or other materials provided with the distribution.
     17  1.1  christos  * 3. All advertising materials mentioning features or use of this software
     18  1.1  christos  *    must display the following acknowledgement:
     19  1.1  christos  *	This product includes software developed for the NetBSD Project by
     20  1.1  christos  *	Wasabi Systems, Inc.
     21  1.1  christos  * 4. The name of Wasabi Systems, Inc. may not be used to endorse
     22  1.1  christos  *    or promote products derived from this software without specific prior
     23  1.1  christos  *    written permission.
     24  1.1  christos  *
     25  1.1  christos  * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND
     26  1.1  christos  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     27  1.1  christos  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     28  1.1  christos  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL WASABI SYSTEMS, INC
     29  1.1  christos  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     30  1.1  christos  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     31  1.1  christos  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     32  1.1  christos  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     33  1.1  christos  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     34  1.1  christos  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     35  1.1  christos  * POSSIBILITY OF SUCH DAMAGE.
     36  1.1  christos  */
     37  1.1  christos 
     38  1.1  christos /*-
     39  1.1  christos  * Copyright (c) 1983, 1992, 1993
     40  1.1  christos  *	The Regents of the University of California.  All rights reserved.
     41  1.1  christos  *
     42  1.1  christos  * Redistribution and use in source and binary forms, with or without
     43  1.1  christos  * modification, are permitted provided that the following conditions
     44  1.1  christos  * are met:
     45  1.1  christos  * 1. Redistributions of source code must retain the above copyright
     46  1.1  christos  *    notice, this list of conditions and the following disclaimer.
     47  1.1  christos  * 2. Redistributions in binary form must reproduce the above copyright
     48  1.1  christos  *    notice, this list of conditions and the following disclaimer in the
     49  1.1  christos  *    documentation and/or other materials provided with the distribution.
     50  1.1  christos  * 3. Neither the name of the University nor the names of its contributors
     51  1.1  christos  *    may be used to endorse or promote products derived from this software
     52  1.1  christos  *    without specific prior written permission.
     53  1.1  christos  *
     54  1.1  christos  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     55  1.1  christos  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     56  1.1  christos  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     57  1.1  christos  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     58  1.1  christos  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     59  1.1  christos  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     60  1.1  christos  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     61  1.1  christos  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     62  1.1  christos  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     63  1.1  christos  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     64  1.1  christos  * SUCH DAMAGE.
     65  1.1  christos  */
     66  1.1  christos 
     67  1.1  christos /* If building a standalone libkern, don't include mcount. */
     68  1.1  christos #if defined(GPROF) && !defined(_STANDALONE)
     69  1.1  christos 
     70  1.1  christos #ifdef _KERNEL_OPT
     71  1.1  christos #include "opt_multiprocessor.h"
     72  1.1  christos #endif
     73  1.1  christos 
     74  1.1  christos #include <sys/cdefs.h>
     75  1.1  christos #if !defined(lint) && !defined(_KERNEL) && defined(LIBC_SCCS)
     76  1.1  christos #if 0
     77  1.1  christos static char sccsid[] = "@(#)mcount.c	8.1 (Berkeley) 6/4/93";
     78  1.1  christos #else
     79  1.1  christos __RCSID("$NetBSD: mcount.c,v 1.1 2005/12/20 19:28:51 christos Exp $");
     80  1.1  christos #endif
     81  1.1  christos #endif
     82  1.1  christos 
     83  1.1  christos #include <sys/param.h>
     84  1.1  christos #include <sys/gmon.h>
     85  1.1  christos 
     86  1.1  christos #include "reentrant.h"
     87  1.1  christos 
     88  1.1  christos #ifdef _REENTRANT
     89  1.1  christos extern thread_key_t _gmonkey;
     90  1.1  christos extern struct gmonparam _gmondummy;
     91  1.1  christos struct gmonparam *_m_gmon_alloc(void);
     92  1.1  christos #endif
     93  1.1  christos 
     94  1.1  christos _MCOUNT_DECL __P((u_long, u_long))
     95  1.1  christos #ifdef _KERNEL
     96  1.1  christos 	__attribute__((__unused__,__no_instrument_function__));	/* see below. */
     97  1.1  christos #else
     98  1.1  christos #ifdef __vax__
     99  1.1  christos _MCOUNT_DECL __P((u_long, u_long)) __attribute__((__unused__));	/* see below. */
    100  1.1  christos #else
    101  1.1  christos _MCOUNT_DECL __P((u_long, u_long)) __attribute__((__used__));	/* see below. */
    102  1.1  christos #endif
    103  1.1  christos #endif
    104  1.1  christos 
    105  1.1  christos /*
    106  1.1  christos  * mcount is called on entry to each function compiled with the profiling
    107  1.1  christos  * switch set.  _mcount(), which is declared in a machine-dependent way
    108  1.1  christos  * with _MCOUNT_DECL, does the actual work and is either inlined into a
    109  1.1  christos  * C routine or called by an assembly stub.  In any case, this magic is
    110  1.1  christos  * taken care of by the MCOUNT definition in <machine/profile.h>.
    111  1.1  christos  *
    112  1.1  christos  * _mcount updates data structures that represent traversals of the
    113  1.1  christos  * program's call graph edges.  frompc and selfpc are the return
    114  1.1  christos  * address and function address that represents the given call graph edge.
    115  1.1  christos  *
    116  1.1  christos  * Note: the original BSD code used the same variable (frompcindex) for
    117  1.1  christos  * both frompcindex and frompc.  Any reasonable, modern compiler will
    118  1.1  christos  * perform this optimization.
    119  1.1  christos  */
    120  1.1  christos _MCOUNT_DECL(frompc, selfpc)	/* _mcount; may be static, inline, etc */
    121  1.1  christos 	u_long frompc, selfpc;
    122  1.1  christos {
    123  1.1  christos 	u_short *frompcindex;
    124  1.1  christos 	struct tostruct *top, *prevtop;
    125  1.1  christos 	struct gmonparam *p;
    126  1.1  christos 	long toindex;
    127  1.1  christos #ifdef _KERNEL
    128  1.1  christos 	int s;
    129  1.1  christos #endif
    130  1.1  christos 
    131  1.1  christos #if defined(_REENTRANT) && !defined(_KERNEL)
    132  1.1  christos 	if (__isthreaded) {
    133  1.1  christos 		p = thr_getspecific(_gmonkey);
    134  1.1  christos 		if (p == NULL) {
    135  1.1  christos 			/* Prevent recursive calls while allocating */
    136  1.1  christos 			thr_setspecific(_gmonkey, &_gmondummy);
    137  1.1  christos 			p = _m_gmon_alloc();
    138  1.1  christos 		}
    139  1.1  christos 	} else
    140  1.1  christos #endif
    141  1.1  christos 		p = &_gmonparam;
    142  1.1  christos 	/*
    143  1.1  christos 	 * check that we are profiling
    144  1.1  christos 	 * and that we aren't recursively invoked.
    145  1.1  christos 	 */
    146  1.1  christos 	if (p->state != GMON_PROF_ON)
    147  1.1  christos 		return;
    148  1.1  christos #ifdef _KERNEL
    149  1.1  christos 	MCOUNT_ENTER;
    150  1.1  christos #endif
    151  1.1  christos 	p->state = GMON_PROF_BUSY;
    152  1.1  christos 	/*
    153  1.1  christos 	 * check that frompcindex is a reasonable pc value.
    154  1.1  christos 	 * for example:	signal catchers get called from the stack,
    155  1.1  christos 	 *		not from text space.  too bad.
    156  1.1  christos 	 */
    157  1.1  christos 	frompc -= p->lowpc;
    158  1.1  christos 	if (frompc > p->textsize)
    159  1.1  christos 		goto done;
    160  1.1  christos 
    161  1.1  christos #if (HASHFRACTION & (HASHFRACTION - 1)) == 0
    162  1.1  christos 	if (p->hashfraction == HASHFRACTION)
    163  1.1  christos 		frompcindex =
    164  1.1  christos 		    &p->froms[
    165  1.1  christos 		    (size_t)(frompc / (HASHFRACTION * sizeof(*p->froms)))];
    166  1.1  christos 	else
    167  1.1  christos #endif
    168  1.1  christos 		frompcindex =
    169  1.1  christos 		    &p->froms[
    170  1.1  christos 		    (size_t)(frompc / (p->hashfraction * sizeof(*p->froms)))];
    171  1.1  christos 	toindex = *frompcindex;
    172  1.1  christos 	if (toindex == 0) {
    173  1.1  christos 		/*
    174  1.1  christos 		 *	first time traversing this arc
    175  1.1  christos 		 */
    176  1.1  christos 		toindex = ++p->tos[0].link;
    177  1.1  christos 		if (toindex >= p->tolimit)
    178  1.1  christos 			/* halt further profiling */
    179  1.1  christos 			goto overflow;
    180  1.1  christos 
    181  1.1  christos 		*frompcindex = (u_short)toindex;
    182  1.1  christos 		top = &p->tos[(size_t)toindex];
    183  1.1  christos 		top->selfpc = selfpc;
    184  1.1  christos 		top->count = 1;
    185  1.1  christos 		top->link = 0;
    186  1.1  christos 		goto done;
    187  1.1  christos 	}
    188  1.1  christos 	top = &p->tos[(size_t)toindex];
    189  1.1  christos 	if (top->selfpc == selfpc) {
    190  1.1  christos 		/*
    191  1.1  christos 		 * arc at front of chain; usual case.
    192  1.1  christos 		 */
    193  1.1  christos 		top->count++;
    194  1.1  christos 		goto done;
    195  1.1  christos 	}
    196  1.1  christos 	/*
    197  1.1  christos 	 * have to go looking down chain for it.
    198  1.1  christos 	 * top points to what we are looking at,
    199  1.1  christos 	 * prevtop points to previous top.
    200  1.1  christos 	 * we know it is not at the head of the chain.
    201  1.1  christos 	 */
    202  1.1  christos 	for (; /* goto done */; ) {
    203  1.1  christos 		if (top->link == 0) {
    204  1.1  christos 			/*
    205  1.1  christos 			 * top is end of the chain and none of the chain
    206  1.1  christos 			 * had top->selfpc == selfpc.
    207  1.1  christos 			 * so we allocate a new tostruct
    208  1.1  christos 			 * and link it to the head of the chain.
    209  1.1  christos 			 */
    210  1.1  christos 			toindex = ++p->tos[0].link;
    211  1.1  christos 			if (toindex >= p->tolimit)
    212  1.1  christos 				goto overflow;
    213  1.1  christos 
    214  1.1  christos 			top = &p->tos[(size_t)toindex];
    215  1.1  christos 			top->selfpc = selfpc;
    216  1.1  christos 			top->count = 1;
    217  1.1  christos 			top->link = *frompcindex;
    218  1.1  christos 			*frompcindex = (u_short)toindex;
    219  1.1  christos 			goto done;
    220  1.1  christos 		}
    221  1.1  christos 		/*
    222  1.1  christos 		 * otherwise, check the next arc on the chain.
    223  1.1  christos 		 */
    224  1.1  christos 		prevtop = top;
    225  1.1  christos 		top = &p->tos[top->link];
    226  1.1  christos 		if (top->selfpc == selfpc) {
    227  1.1  christos 			/*
    228  1.1  christos 			 * there it is.
    229  1.1  christos 			 * increment its count
    230  1.1  christos 			 * move it to the head of the chain.
    231  1.1  christos 			 */
    232  1.1  christos 			top->count++;
    233  1.1  christos 			toindex = prevtop->link;
    234  1.1  christos 			prevtop->link = top->link;
    235  1.1  christos 			top->link = *frompcindex;
    236  1.1  christos 			*frompcindex = (u_short)toindex;
    237  1.1  christos 			goto done;
    238  1.1  christos 		}
    239  1.1  christos 
    240  1.1  christos 	}
    241  1.1  christos done:
    242  1.1  christos 	p->state = GMON_PROF_ON;
    243  1.1  christos #ifdef _KERNEL
    244  1.1  christos 	MCOUNT_EXIT;
    245  1.1  christos #endif
    246  1.1  christos 	return;
    247  1.1  christos overflow:
    248  1.1  christos 	p->state = GMON_PROF_ERROR;
    249  1.1  christos #ifdef _KERNEL
    250  1.1  christos 	MCOUNT_EXIT;
    251  1.1  christos #endif
    252  1.1  christos 	return;
    253  1.1  christos }
    254  1.1  christos 
    255  1.1  christos #ifdef MCOUNT
    256  1.1  christos /*
    257  1.1  christos  * Actual definition of mcount function.  Defined in <machine/profile.h>,
    258  1.1  christos  * which is included by <sys/gmon.h>.
    259  1.1  christos  */
    260  1.1  christos MCOUNT
    261  1.1  christos #endif
    262  1.1  christos 
    263  1.1  christos #endif /* GPROF && !_STANDALONE */
    264