[apple/xnu.git] / bsd / kern / subr_prof.c

/*
 * Copyright (c) 2000-2004 Apple Computer, Inc. All rights reserved.
 *
 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. The rights granted to you under the License
 * may not be used to create, or enable the creation or redistribution of,
 * unlawful or unlicensed copies of an Apple operating system, or to
 * circumvent, violate, or enable the circumvention or violation of, any
 * terms of an Apple operating system software license agreement.
 * 
 * Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
 */
/* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
/*-
 * Copyright (c) 1982, 1986, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and 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
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * 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
 * SUCH DAMAGE.
 *
 *	@(#)subr_prof.c	8.3 (Berkeley) 9/23/93
 */

#include <sys/param.h>
#include <sys/systm.h>
#include <sys/kernel.h>
#include <sys/proc_internal.h>
#include <sys/user.h>
#include <machine/spl.h>
#include <machine/machine_routines.h>

#include <sys/mount_internal.h>
#include <sys/sysproto.h>

#include <mach/mach_types.h>
#include <kern/kern_types.h>
#include <kern/cpu_number.h>
#include <kern/kalloc.h>

extern boolean_t ml_set_interrupts_enabled(boolean_t enable);

#ifdef GPROF
#include <sys/malloc.h>
#include <sys/gmon.h>
#include <kern/mach_header.h>
#include <machine/profile.h>

lck_spin_t * mcount_lock;
lck_grp_t * mcount_lock_grp;
lck_attr_t * mcount_lock_attr;

/*
 * Froms is actually a bunch of unsigned shorts indexing tos
 */
struct gmonparam _gmonparam = { GMON_PROF_OFF };

/*
 * This code uses 32 bit mach object segment information from the currently
 * running kernel.
 */
void
kmstartup(void)
{
	char *cp;
	u_long	fromssize, tossize;
	struct segment_command	*sgp;	/* 32 bit mach object file segment */
	struct gmonparam *p = &_gmonparam;
	
	sgp = getsegbyname("__TEXT");
	p->lowpc = (u_long)sgp->vmaddr;
	p->highpc = (u_long)(sgp->vmaddr + sgp->vmsize);
	
	/*
	 * 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.
	 */
	p->lowpc = ROUNDDOWN(p->lowpc, HISTFRACTION * sizeof(HISTCOUNTER));
	p->highpc = ROUNDUP(p->highpc, HISTFRACTION * sizeof(HISTCOUNTER));
	p->textsize = p->highpc - p->lowpc;
	printf("Profiling kernel, textsize=%d [0x%08x..0x%08x]\n",
	       p->textsize, p->lowpc, p->highpc);
	p->kcountsize = p->textsize / HISTFRACTION;
	p->hashfraction = HASHFRACTION;
	p->fromssize = p->textsize / HASHFRACTION;
	p->tolimit = p->textsize * ARCDENSITY / 100;
	if (p->tolimit < MINARCS)
		p->tolimit = MINARCS;
	else if (p->tolimit > MAXARCS)
		p->tolimit = MAXARCS;
	p->tossize = p->tolimit * sizeof(struct tostruct);
	/* Why not use MALLOC with M_GPROF ? */
	cp = (char *)kalloc(p->kcountsize + p->fromssize + p->tossize);
	if (cp == 0) {
		printf("No memory for profiling.\n");
		return;
	}
	bzero(cp, p->kcountsize + p->tossize + p->fromssize);
	p->tos = (struct tostruct *)cp;
	cp += p->tossize;
	p->kcount = (u_short *)cp;
	cp += p->kcountsize;
	p->froms = (u_short *)cp;
	
	mcount_lock_grp = lck_grp_alloc_init("MCOUNT", LCK_GRP_ATTR_NULL);
	mcount_lock_attr = lck_attr_alloc_init();
	//lck_attr_setdebug(mcount_lock_attr);
	mcount_lock = lck_spin_alloc_init(mcount_lock_grp, mcount_lock_attr);

}

/*
 * Return kernel profiling information.
 */
int
sysctl_doprof(int *name, u_int namelen, user_addr_t oldp, size_t *oldlenp, 
              user_addr_t newp, size_t newlen)
{
	struct gmonparam *gp = &_gmonparam;
	int error;

	/* all sysctl names at this level are terminal */
	if (namelen != 1)
		return (ENOTDIR);		/* overloaded */

	switch (name[0]) {
	case GPROF_STATE:
		error = sysctl_int(oldp, oldlenp, newp, newlen, &gp->state);
		if (error)
			return (error);
		if (gp->state == GMON_PROF_OFF)
			stopprofclock(kernproc);
		else
			startprofclock(kernproc);
		return (0);
	case GPROF_COUNT:
		return (sysctl_struct(oldp, oldlenp, newp, newlen, 
		                      gp->kcount, gp->kcountsize));
	case GPROF_FROMS:
		return (sysctl_struct(oldp, oldlenp, newp, newlen,
		                      gp->froms, gp->fromssize));
	case GPROF_TOS:
		return (sysctl_struct(oldp, oldlenp, newp, newlen,
		                      gp->tos, gp->tossize));
	case GPROF_GMONPARAM:
		return (sysctl_rdstruct(oldp, oldlenp, newp, gp, sizeof *gp));
	default:
		return (ENOTSUP);
	}
	/* NOTREACHED */
}


/*
 * mcount() called with interrupts disabled.
 */
void
mcount(
    register u_long frompc,
    register u_long selfpc
)
{
    unsigned short *frompcindex;
	register struct tostruct *top, *prevtop;
	struct gmonparam *p = &_gmonparam;
	register long toindex;

    /*
     * check that we are profiling
     * and that we aren't recursively invoked.
     */
    if (p->state != GMON_PROF_ON)
        return;

	lck_spin_lock(mcount_lock);

	/*
	 *	check that frompcindex is a reasonable pc value.
	 *	for example:	signal catchers get called from the stack,
	 *			not from text space.  too bad.
	 */
	frompc -= p->lowpc;
	if (frompc > p->textsize)
		goto done;

	frompcindex = &p->froms[frompc / (p->hashfraction * sizeof(*p->froms))];
	toindex = *frompcindex;
	if (toindex == 0) {
		/*
		 *	first time traversing this arc
		 */
		toindex = ++p->tos[0].link;
		if (toindex >= p->tolimit) {
            /* halt further profiling */
			goto overflow;
		}
		*frompcindex = toindex;
		top = &p->tos[toindex];
		top->selfpc = selfpc;
		top->count = 1;
		top->link = 0;
		goto done;
	}
	top = &p->tos[toindex];
	if (top->selfpc == selfpc) {
		/*
		 *	arc at front of chain; usual case.
		 */
		top->count++;
		goto done;
	}
	/*
	 *	have to go looking down chain for it.
	 *	top points to what we are looking at,
	 *	prevtop points to previous top.
	 *	we know it is not at the head of the chain.
	 */
	for (; /* goto done */; ) {
		if (top->link == 0) {
			/*
			 *	top is end of the chain and none of the chain
			 *	had top->selfpc == selfpc.
			 *	so we allocate a new tostruct
			 *	and link it to the head of the chain.
			 */
			toindex = ++p->tos[0].link;
			if (toindex >= p->tolimit) {
				goto overflow;
			}
			top = &p->tos[toindex];
			top->selfpc = selfpc;
			top->count = 1;
			top->link = *frompcindex;
			*frompcindex = toindex;
			goto done;
		}
		/*
		 *	otherwise, check the next arc on the chain.
		 */
		prevtop = top;
		top = &p->tos[top->link];
		if (top->selfpc == selfpc) {
			/*
			 *	there it is.
			 *	increment its count
			 *	move it to the head of the chain.
			 */
			top->count++;
			toindex = prevtop->link;
			prevtop->link = top->link;
			top->link = *frompcindex;
			*frompcindex = toindex;
			goto done;
		}

	}
done:
	lck_spin_unlock(mcount_lock);
	return;

overflow:
    p->state = GMON_PROF_ERROR;
        lck_spin_unlock(mcount_lock);
	printf("mcount: tos overflow\n");
	return;
}

#endif /* GPROF */

#define PROFILE_LOCK(x)
#define PROFILE_UNLOCK(x)

int
profil(struct proc *p, register struct profil_args *uap, __unused register_t *retval)
{
    struct uprof *upp = &p->p_stats->p_prof;
    int s;

	if (uap->pcscale > (1 << 16))
		return (EINVAL);
	if (uap->pcscale == 0) {
		stopprofclock(p);
		return (0);
	}

	/* Block profile interrupts while changing state. */
    s = ml_set_interrupts_enabled(FALSE);	

	if (proc_is64bit(p)) {
        struct user_uprof *user_upp = &p->p_stats->user_p_prof;
    	struct user_uprof *upc, *nupc;
	
	    PROFILE_LOCK(&user_upp->pr_lock);
        user_upp->pr_base = uap->bufbase;
        user_upp->pr_size = uap->bufsize;
        user_upp->pr_off = uap->pcoffset;
	    user_upp->pr_scale = uap->pcscale;
        upp->pr_base = NULL;
        upp->pr_size = 0;
        upp->pr_scale = 0;

        /* remove buffers previously allocated with add_profil() */
        for (upc = user_upp->pr_next; upc; upc = nupc) {
            nupc = upc->pr_next;
            kfree(upc, sizeof (*upc));
        }
        user_upp->pr_next = 0;
	    PROFILE_UNLOCK(&user_upp->pr_lock);
	}
	else {
    	struct uprof *upc, *nupc;
	    
	    PROFILE_LOCK(&upp->pr_lock);
        upp->pr_base = CAST_DOWN(caddr_t, uap->bufbase);
        upp->pr_size = uap->bufsize;
        upp->pr_off = uap->pcoffset;
	    upp->pr_scale = uap->pcscale;

        /* remove buffers previously allocated with add_profil() */
        for (upc = upp->pr_next; upc; upc = nupc) {
            nupc = upc->pr_next;
            kfree(upc, sizeof (struct uprof));
        }
        upp->pr_next = 0;
	    PROFILE_UNLOCK(&upp->pr_lock);
	}

	startprofclock(p);
	ml_set_interrupts_enabled(s);
	return(0);
}

int
add_profil(struct proc *p, register struct add_profil_args *uap, __unused register_t *retval)
{
	struct uprof *upp = &p->p_stats->p_prof, *upc;
	struct user_uprof *user_upp = NULL, *user_upc;
	int s;
	boolean_t is64bit = proc_is64bit(p);

	if (is64bit) {
       user_upp = &p->p_stats->user_p_prof;
       if (user_upp->pr_scale == 0)
            return (0);
    }
    else {
        if (upp->pr_scale == 0)
            return (0);
    }

    s = ml_set_interrupts_enabled(FALSE);	
    
	if (is64bit) {
        user_upc = (struct user_uprof *) kalloc(sizeof (struct user_uprof));
        user_upc->pr_base = uap->bufbase;
        user_upc->pr_size = uap->bufsize;
        user_upc->pr_off = uap->pcoffset;
        user_upc->pr_scale = uap->pcscale;
        PROFILE_LOCK(&user_upp->pr_lock);
        user_upc->pr_next = user_upp->pr_next;
        user_upp->pr_next = user_upc;
        PROFILE_UNLOCK(&user_upp->pr_lock);
    }
    else {
        upc = (struct uprof *) kalloc(sizeof (struct uprof));
        upc->pr_base = CAST_DOWN(caddr_t, uap->bufbase);
        upc->pr_size = uap->bufsize;
        upc->pr_off = uap->pcoffset;
        upc->pr_scale = uap->pcscale;
        PROFILE_LOCK(&upp->pr_lock);
        upc->pr_next = upp->pr_next;
        upp->pr_next = upc;
        PROFILE_UNLOCK(&upp->pr_lock);
    }
    
	ml_set_interrupts_enabled(s);		
	return(0);
}

/*
 * Scale is a fixed-point number with the binary point 16 bits
 * into the value, and is <= 1.0.  pc is at most 32 bits, so the
 * intermediate result is at most 48 bits.
 */
#define PC_TO_INDEX(pc, prof) \
	((int)(((u_quad_t)((pc) - (prof)->pr_off) * \
			(u_quad_t)((prof)->pr_scale)) >> 16) & ~1)

/*
 * Collect user-level profiling statistics; called on a profiling tick,
 * when a process is running in user-mode. We use
 * an AST that will vector us to trap() with a context in which copyin
 * and copyout will work.  Trap will then call addupc_task().
 *
 * Note that we may (rarely) not get around to the AST soon enough, and
 * lose profile ticks when the next tick overwrites this one, but in this
 * case the system is overloaded and the profile is probably already
 * inaccurate.
 *
 * We can afford to take faults here.  If the
 * update fails, we simply turn off profiling.
 */
void
addupc_task(p, pc, ticks)
	register struct proc *p;
	user_addr_t pc;
	u_int ticks;
{
	register u_int off;
	u_short count;

	/* Testing P_PROFIL may be unnecessary, but is certainly safe. */
	if ((p->p_flag & P_PROFIL) == 0 || ticks == 0)
		return;

	if (proc_is64bit(p)) {
        struct user_uprof *prof;
        user_addr_t cell;

        for (prof = &p->p_stats->user_p_prof; prof; prof = prof->pr_next) {
            off = PC_TO_INDEX(pc, prof);
            cell = (prof->pr_base + off);
            if (cell >= prof->pr_base &&
                cell < (prof->pr_size + prof->pr_base)) {
                if (copyin(cell, (caddr_t) &count, sizeof(count)) == 0) {
                    count += ticks;
                    if(copyout((caddr_t) &count, cell, sizeof(count)) == 0)
                        return;
                }
                p->p_stats->user_p_prof.pr_scale = 0;
                stopprofclock(p);
                break;
            }
        }
	}
	else {
        struct uprof *prof;
        short *cell;

        for (prof = &p->p_stats->p_prof; prof; prof = prof->pr_next) {
            off = PC_TO_INDEX(CAST_DOWN(uint, pc),prof);
            cell = (short *)(prof->pr_base + off);
            if (cell >= (short *)prof->pr_base &&
                cell < (short*)(prof->pr_size + (int) prof->pr_base)) {
                if (copyin(CAST_USER_ADDR_T(cell), (caddr_t) &count, sizeof(count)) == 0) {
                    count += ticks;
                    if(copyout((caddr_t) &count, CAST_USER_ADDR_T(cell), sizeof(count)) == 0)
                        return;
                }
                p->p_stats->p_prof.pr_scale = 0;
                stopprofclock(p);
                break;
            }
        }
	}
}
Commit	Line	Data
1c79356b	1	/*
5d5c5d0d A	2	* Copyright (c) 2000-2004 Apple Computer, Inc. All rights reserved.
5d5c5d0d A	3	*
8f6c56a5	4	* @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b	5	*
8f6c56a5 A	6	* This file contains Original Code and/or Modifications of Original Code
	7	* as defined in and that are subject to the Apple Public Source License
	8	* Version 2.0 (the 'License'). You may not use this file except in
	9	* compliance with the License. The rights granted to you under the License
	10	* may not be used to create, or enable the creation or redistribution of,
	11	* unlawful or unlicensed copies of an Apple operating system, or to
	12	* circumvent, violate, or enable the circumvention or violation of, any
	13	* terms of an Apple operating system software license agreement.
	14	*
	15	* Please obtain a copy of the License at
	16	* http://www.opensource.apple.com/apsl/ and read it before using this file.
	17	*
	18	* The Original Code and all software distributed under the License are
	19	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
	20	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
	21	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
	22	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	23	* Please see the License for the specific language governing rights and
8ad349bb	24	* limitations under the License.
8f6c56a5 A	25	*
8f6c56a5 A	26	* @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b A	27	*/
	28	/* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */
	29	/*-
	30	* Copyright (c) 1982, 1986, 1993
	31	* The Regents of the University of California. All rights reserved.
	32	*
	33	* Redistribution and use in source and binary forms, with or without
	34	* modification, are permitted provided that the following conditions
	35	* are met:
	36	* 1. Redistributions of source code must retain the above copyright
	37	* notice, this list of conditions and the following disclaimer.
	38	* 2. Redistributions in binary form must reproduce the above copyright
	39	* notice, this list of conditions and the following disclaimer in the
	40	* documentation and/or other materials provided with the distribution.
	41	* 3. All advertising materials mentioning features or use of this software
	42	* must display the following acknowledgement:
	43	* This product includes software developed by the University of
	44	* California, Berkeley and its contributors.
	45	* 4. Neither the name of the University nor the names of its contributors
	46	* may be used to endorse or promote products derived from this software
	47	* without specific prior written permission.
	48	*
	49	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	50	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	51	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	52	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	53	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	54	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	55	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	56	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	57	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	58	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	59	* SUCH DAMAGE.
	60	*
	61	* @(#)subr_prof.c 8.3 (Berkeley) 9/23/93
	62	*/
	63
	64	#include <sys/param.h>
	65	#include <sys/systm.h>
	66	#include <sys/kernel.h>
91447636	67	#include <sys/proc_internal.h>
1c79356b A	68	#include <sys/user.h>
1c79356b A	69	#include <machine/spl.h>
91447636	70	#include <machine/machine_routines.h>
1c79356b	71
91447636 A	72	#include <sys/mount_internal.h>
91447636 A	73	#include <sys/sysproto.h>
1c79356b	74
91447636 A	75	#include <mach/mach_types.h>
91447636 A	76	#include <kern/kern_types.h>
1c79356b	77	#include <kern/cpu_number.h>
91447636 A	78	#include <kern/kalloc.h>
	79
	80	extern boolean_t ml_set_interrupts_enabled(boolean_t enable);
1c79356b A	81
	82	#ifdef GPROF
	83	#include <sys/malloc.h>
	84	#include <sys/gmon.h>
	85	#include <kern/mach_header.h>
	86	#include <machine/profile.h>
	87
91447636 A	88	lck_spin_t * mcount_lock;
	89	lck_grp_t * mcount_lock_grp;
	90	lck_attr_t * mcount_lock_attr;
55e303ae	91
1c79356b A	92	/*
	93	* Froms is actually a bunch of unsigned shorts indexing tos
	94	*/
	95	struct gmonparam _gmonparam = { GMON_PROF_OFF };
	96
91447636 A	97	/*
	98	* This code uses 32 bit mach object segment information from the currently
	99	* running kernel.
	100	*/
	101	void
	102	kmstartup(void)
1c79356b A	103	{
	104	char *cp;
	105	u_long fromssize, tossize;
91447636	106	struct segment_command sgp; / 32 bit mach object file segment */
1c79356b A	107	struct gmonparam *p = &_gmonparam;
	108
	109	sgp = getsegbyname("__TEXT");
	110	p->lowpc = (u_long)sgp->vmaddr;
	111	p->highpc = (u_long)(sgp->vmaddr + sgp->vmsize);
	112
	113	/*
	114	* Round lowpc and highpc to multiples of the density we're using
	115	* so the rest of the scaling (here and in gprof) stays in ints.
	116	*/
	117	p->lowpc = ROUNDDOWN(p->lowpc, HISTFRACTION * sizeof(HISTCOUNTER));
	118	p->highpc = ROUNDUP(p->highpc, HISTFRACTION * sizeof(HISTCOUNTER));
	119	p->textsize = p->highpc - p->lowpc;
	120	printf("Profiling kernel, textsize=%d [0x%08x..0x%08x]\n",
	121	p->textsize, p->lowpc, p->highpc);
	122	p->kcountsize = p->textsize / HISTFRACTION;
	123	p->hashfraction = HASHFRACTION;
	124	p->fromssize = p->textsize / HASHFRACTION;
	125	p->tolimit = p->textsize * ARCDENSITY / 100;
	126	if (p->tolimit < MINARCS)
	127	p->tolimit = MINARCS;
	128	else if (p->tolimit > MAXARCS)
	129	p->tolimit = MAXARCS;
	130	p->tossize = p->tolimit * sizeof(struct tostruct);
	131	/* Why not use MALLOC with M_GPROF ? */
	132	cp = (char *)kalloc(p->kcountsize + p->fromssize + p->tossize);
	133	if (cp == 0) {
	134	printf("No memory for profiling.\n");
	135	return;
	136	}
	137	bzero(cp, p->kcountsize + p->tossize + p->fromssize);
	138	p->tos = (struct tostruct *)cp;
	139	cp += p->tossize;
	140	p->kcount = (u_short *)cp;
	141	cp += p->kcountsize;
	142	p->froms = (u_short *)cp;
91447636 A	143
	144	mcount_lock_grp = lck_grp_alloc_init("MCOUNT", LCK_GRP_ATTR_NULL);
	145	mcount_lock_attr = lck_attr_alloc_init();
21362eb3	146	//lck_attr_setdebug(mcount_lock_attr);
91447636 A	147	mcount_lock = lck_spin_alloc_init(mcount_lock_grp, mcount_lock_attr);
91447636 A	148
1c79356b A	149	}
	150
	151	/*
	152	* Return kernel profiling information.
	153	*/
9bccf70c	154	int
91447636 A	155	sysctl_doprof(int name, u_int namelen, user_addr_t oldp, size_t oldlenp,
91447636 A	156	user_addr_t newp, size_t newlen)
1c79356b A	157	{
	158	struct gmonparam *gp = &_gmonparam;
	159	int error;
	160
	161	/* all sysctl names at this level are terminal */
	162	if (namelen != 1)
	163	return (ENOTDIR); /* overloaded */
	164
	165	switch (name[0]) {
	166	case GPROF_STATE:
	167	error = sysctl_int(oldp, oldlenp, newp, newlen, &gp->state);
	168	if (error)
	169	return (error);
	170	if (gp->state == GMON_PROF_OFF)
	171	stopprofclock(kernproc);
	172	else
	173	startprofclock(kernproc);
	174	return (0);
	175	case GPROF_COUNT:
91447636 A	176	return (sysctl_struct(oldp, oldlenp, newp, newlen,
91447636 A	177	gp->kcount, gp->kcountsize));
1c79356b A	178	case GPROF_FROMS:
1c79356b A	179	return (sysctl_struct(oldp, oldlenp, newp, newlen,
91447636	180	gp->froms, gp->fromssize));
1c79356b A	181	case GPROF_TOS:
1c79356b A	182	return (sysctl_struct(oldp, oldlenp, newp, newlen,
91447636	183	gp->tos, gp->tossize));
1c79356b A	184	case GPROF_GMONPARAM:
	185	return (sysctl_rdstruct(oldp, oldlenp, newp, gp, sizeof *gp));
	186	default:
91447636	187	return (ENOTSUP);
1c79356b A	188	}
	189	/* NOTREACHED */
	190	}
	191
	192
	193	/*
	194	* mcount() called with interrupts disabled.
	195	*/
	196	void
	197	mcount(
	198	register u_long frompc,
	199	register u_long selfpc
	200	)
	201	{
	202	unsigned short *frompcindex;
	203	register struct tostruct top, prevtop;
	204	struct gmonparam *p = &_gmonparam;
	205	register long toindex;
1c79356b A	206
	207	/*
	208	* check that we are profiling
	209	* and that we aren't recursively invoked.
	210	*/
	211	if (p->state != GMON_PROF_ON)
	212	return;
	213
91447636	214	lck_spin_lock(mcount_lock);
1c79356b A	215
	216	/*
	217	* check that frompcindex is a reasonable pc value.
	218	* for example: signal catchers get called from the stack,
	219	* not from text space. too bad.
	220	*/
	221	frompc -= p->lowpc;
	222	if (frompc > p->textsize)
	223	goto done;
	224
	225	frompcindex = &p->froms[frompc / (p->hashfraction * sizeof(*p->froms))];
	226	toindex = *frompcindex;
	227	if (toindex == 0) {
	228	/*
	229	* first time traversing this arc
	230	*/
	231	toindex = ++p->tos[0].link;
	232	if (toindex >= p->tolimit) {
	233	/* halt further profiling */
	234	goto overflow;
	235	}
	236	*frompcindex = toindex;
	237	top = &p->tos[toindex];
	238	top->selfpc = selfpc;
	239	top->count = 1;
	240	top->link = 0;
	241	goto done;
	242	}
	243	top = &p->tos[toindex];
	244	if (top->selfpc == selfpc) {
	245	/*
	246	* arc at front of chain; usual case.
	247	*/
	248	top->count++;
	249	goto done;
	250	}
	251	/*
	252	* have to go looking down chain for it.
	253	* top points to what we are looking at,
	254	* prevtop points to previous top.
	255	* we know it is not at the head of the chain.
	256	*/
	257	for (; /* goto done */; ) {
	258	if (top->link == 0) {
	259	/*
	260	* top is end of the chain and none of the chain
	261	* had top->selfpc == selfpc.
	262	* so we allocate a new tostruct
	263	* and link it to the head of the chain.
	264	*/
	265	toindex = ++p->tos[0].link;
	266	if (toindex >= p->tolimit) {
	267	goto overflow;
	268	}
	269	top = &p->tos[toindex];
	270	top->selfpc = selfpc;
	271	top->count = 1;
	272	top->link = *frompcindex;
	273	*frompcindex = toindex;
	274	goto done;
	275	}
	276	/*
	277	* otherwise, check the next arc on the chain.
	278	*/
279	prevtop = top;
280	top = &p->tos[top->link];
281	if (top->selfpc == selfpc) {
282	/*
283	* there it is.
284	* increment its count
285	* move it to the head of the chain.
286	*/
287	top->count++;
288	toindex = prevtop->link;
289	prevtop->link = top->link;
290	top->link = *frompcindex;
291	*frompcindex = toindex;
292	goto done;
293	}
294
295	}
296	done:
91447636	297	lck_spin_unlock(mcount_lock);
1c79356b A	298	return;
	299
	300	overflow:
	301	p->state = GMON_PROF_ERROR;
91447636	302	lck_spin_unlock(mcount_lock);
1c79356b A	303	printf("mcount: tos overflow\n");
	304	return;
	305	}
	306
	307	#endif /* GPROF */
	308
91447636 A	309	#define PROFILE_LOCK(x)
91447636 A	310	#define PROFILE_UNLOCK(x)
1c79356b	311
1c79356b	312	int
91447636	313	profil(struct proc p, register struct profil_args uap, __unused register_t *retval)
1c79356b	314	{
91447636 A	315	struct uprof *upp = &p->p_stats->p_prof;
91447636 A	316	int s;
1c79356b A	317
	318	if (uap->pcscale > (1 << 16))
	319	return (EINVAL);
	320	if (uap->pcscale == 0) {
	321	stopprofclock(p);
	322	return (0);
	323	}
	324
	325	/* Block profile interrupts while changing state. */
91447636 A	326	s = ml_set_interrupts_enabled(FALSE);
	327
	328	if (proc_is64bit(p)) {
	329	struct user_uprof *user_upp = &p->p_stats->user_p_prof;
	330	struct user_uprof upc, nupc;
	331
	332	PROFILE_LOCK(&user_upp->pr_lock);
	333	user_upp->pr_base = uap->bufbase;
	334	user_upp->pr_size = uap->bufsize;
	335	user_upp->pr_off = uap->pcoffset;
	336	user_upp->pr_scale = uap->pcscale;
	337	upp->pr_base = NULL;
	338	upp->pr_size = 0;
	339	upp->pr_scale = 0;
	340
	341	/* remove buffers previously allocated with add_profil() */
	342	for (upc = user_upp->pr_next; upc; upc = nupc) {
	343	nupc = upc->pr_next;
	344	kfree(upc, sizeof (*upc));
	345	}
	346	user_upp->pr_next = 0;
	347	PROFILE_UNLOCK(&user_upp->pr_lock);
	348	}
	349	else {
	350	struct uprof upc, nupc;
	351
	352	PROFILE_LOCK(&upp->pr_lock);
	353	upp->pr_base = CAST_DOWN(caddr_t, uap->bufbase);
	354	upp->pr_size = uap->bufsize;
	355	upp->pr_off = uap->pcoffset;
	356	upp->pr_scale = uap->pcscale;
	357
	358	/* remove buffers previously allocated with add_profil() */
	359	for (upc = upp->pr_next; upc; upc = nupc) {
	360	nupc = upc->pr_next;
	361	kfree(upc, sizeof (struct uprof));
	362	}
	363	upp->pr_next = 0;
	364	PROFILE_UNLOCK(&upp->pr_lock);
1c79356b A	365	}
1c79356b A	366
1c79356b	367	startprofclock(p);
55e303ae	368	ml_set_interrupts_enabled(s);
1c79356b A	369	return(0);
	370	}
	371
1c79356b	372	int
91447636	373	add_profil(struct proc p, register struct add_profil_args uap, __unused register_t *retval)
1c79356b A	374	{
1c79356b A	375	struct uprof upp = &p->p_stats->p_prof, upc;
91447636	376	struct user_uprof user_upp = NULL, user_upc;
1c79356b	377	int s;
91447636	378	boolean_t is64bit = proc_is64bit(p);
1c79356b	379
91447636 A	380	if (is64bit) {
	381	user_upp = &p->p_stats->user_p_prof;
	382	if (user_upp->pr_scale == 0)
	383	return (0);
	384	}
	385	else {
	386	if (upp->pr_scale == 0)
	387	return (0);
	388	}
	389
	390	s = ml_set_interrupts_enabled(FALSE);
	391
	392	if (is64bit) {
	393	user_upc = (struct user_uprof *) kalloc(sizeof (struct user_uprof));
	394	user_upc->pr_base = uap->bufbase;
	395	user_upc->pr_size = uap->bufsize;
	396	user_upc->pr_off = uap->pcoffset;
	397	user_upc->pr_scale = uap->pcscale;
	398	PROFILE_LOCK(&user_upp->pr_lock);
	399	user_upc->pr_next = user_upp->pr_next;
	400	user_upp->pr_next = user_upc;
	401	PROFILE_UNLOCK(&user_upp->pr_lock);
	402	}
	403	else {
	404	upc = (struct uprof *) kalloc(sizeof (struct uprof));
	405	upc->pr_base = CAST_DOWN(caddr_t, uap->bufbase);
	406	upc->pr_size = uap->bufsize;
	407	upc->pr_off = uap->pcoffset;
	408	upc->pr_scale = uap->pcscale;
	409	PROFILE_LOCK(&upp->pr_lock);
	410	upc->pr_next = upp->pr_next;
	411	upp->pr_next = upc;
	412	PROFILE_UNLOCK(&upp->pr_lock);
	413	}
	414
55e303ae	415	ml_set_interrupts_enabled(s);
1c79356b A	416	return(0);
	417	}
	418
	419	/*
	420	* Scale is a fixed-point number with the binary point 16 bits
	421	* into the value, and is <= 1.0. pc is at most 32 bits, so the
	422	* intermediate result is at most 48 bits.
	423	*/
	424	#define PC_TO_INDEX(pc, prof) \
	425	((int)(((u_quad_t)((pc) - (prof)->pr_off) * \
	426	(u_quad_t)((prof)->pr_scale)) >> 16) & ~1)
	427
	428	/*
	429	* Collect user-level profiling statistics; called on a profiling tick,
	430	* when a process is running in user-mode. We use
	431	* an AST that will vector us to trap() with a context in which copyin
	432	* and copyout will work. Trap will then call addupc_task().
	433	*
	434	* Note that we may (rarely) not get around to the AST soon enough, and
	435	* lose profile ticks when the next tick overwrites this one, but in this
	436	* case the system is overloaded and the profile is probably already
	437	* inaccurate.
	438	*
	439	* We can afford to take faults here. If the
	440	* update fails, we simply turn off profiling.
	441	*/
	442	void
	443	addupc_task(p, pc, ticks)
	444	register struct proc *p;
91447636	445	user_addr_t pc;
1c79356b A	446	u_int ticks;
1c79356b A	447	{
1c79356b A	448	register u_int off;
	449	u_short count;
	450
	451	/* Testing P_PROFIL may be unnecessary, but is certainly safe. */
	452	if ((p->p_flag & P_PROFIL) == 0 \|\| ticks == 0)
	453	return;
	454
91447636 A	455	if (proc_is64bit(p)) {
	456	struct user_uprof *prof;
	457	user_addr_t cell;
	458
	459	for (prof = &p->p_stats->user_p_prof; prof; prof = prof->pr_next) {
	460	off = PC_TO_INDEX(pc, prof);
	461	cell = (prof->pr_base + off);
	462	if (cell >= prof->pr_base &&
	463	cell < (prof->pr_size + prof->pr_base)) {
	464	if (copyin(cell, (caddr_t) &count, sizeof(count)) == 0) {
	465	count += ticks;
	466	if(copyout((caddr_t) &count, cell, sizeof(count)) == 0)
	467	return;
	468	}
	469	p->p_stats->user_p_prof.pr_scale = 0;
	470	stopprofclock(p);
	471	break;
	472	}
	473	}
	474	}
	475	else {
	476	struct uprof *prof;
	477	short *cell;
	478
	479	for (prof = &p->p_stats->p_prof; prof; prof = prof->pr_next) {
	480	off = PC_TO_INDEX(CAST_DOWN(uint, pc),prof);
	481	cell = (short *)(prof->pr_base + off);
	482	if (cell >= (short *)prof->pr_base &&
	483	cell < (short*)(prof->pr_size + (int) prof->pr_base)) {
	484	if (copyin(CAST_USER_ADDR_T(cell), (caddr_t) &count, sizeof(count)) == 0) {
	485	count += ticks;
	486	if(copyout((caddr_t) &count, CAST_USER_ADDR_T(cell), sizeof(count)) == 0)
	487	return;
	488	}
	489	p->p_stats->p_prof.pr_scale = 0;
	490	stopprofclock(p);
	491	break;
	492	}
	493	}
1c79356b A	494	}
1c79356b A	495	}