1994-05-24 10:09:53 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1982, 1986, 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
* (c) UNIX System Laboratories, Inc.
|
|
|
|
* All or some portions of this file are derived from material licensed
|
|
|
|
* to the University of California by American Telephone and Telegraph
|
|
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* @(#)kern_clock.c 8.5 (Berkeley) 1/21/94
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
1999-03-11 15:09:51 +00:00
|
|
|
#include "opt_ntp.h"
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/dkstat.h>
|
|
|
|
#include <sys/callout.h>
|
|
|
|
#include <sys/kernel.h>
|
2001-03-28 09:17:56 +00:00
|
|
|
#include <sys/lock.h>
|
2000-10-20 07:58:15 +00:00
|
|
|
#include <sys/mutex.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/resourcevar.h>
|
1994-10-02 17:35:40 +00:00
|
|
|
#include <sys/signalvar.h>
|
2001-04-27 19:28:25 +00:00
|
|
|
#include <sys/smp.h>
|
2000-03-20 14:09:06 +00:00
|
|
|
#include <sys/timetc.h>
|
1999-03-11 15:09:51 +00:00
|
|
|
#include <sys/timepps.h>
|
1994-08-27 16:14:39 +00:00
|
|
|
#include <vm/vm.h>
|
1995-12-07 12:48:31 +00:00
|
|
|
#include <vm/pmap.h>
|
|
|
|
#include <vm/vm_map.h>
|
1994-10-02 17:35:40 +00:00
|
|
|
#include <sys/sysctl.h>
|
2000-10-25 05:19:40 +00:00
|
|
|
#include <sys/bus.h>
|
|
|
|
#include <sys/interrupt.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
#include <machine/cpu.h>
|
1997-08-21 20:33:42 +00:00
|
|
|
#include <machine/limits.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
#ifdef GPROF
|
|
|
|
#include <sys/gmon.h>
|
|
|
|
#endif
|
|
|
|
|
1997-12-08 23:00:24 +00:00
|
|
|
|
1995-12-02 17:11:20 +00:00
|
|
|
static void initclocks __P((void *dummy));
|
1995-08-28 09:19:25 +00:00
|
|
|
SYSINIT(clocks, SI_SUB_CLOCKS, SI_ORDER_FIRST, initclocks, NULL)
|
|
|
|
|
1994-08-18 22:36:09 +00:00
|
|
|
/* Some of these don't belong here, but it's easiest to concentrate them. */
|
1997-12-08 23:00:24 +00:00
|
|
|
long cp_time[CPUSTATES];
|
1994-08-18 22:36:09 +00:00
|
|
|
|
2000-11-20 00:44:58 +00:00
|
|
|
SYSCTL_OPAQUE(_kern, OID_AUTO, cp_time, CTLFLAG_RD, &cp_time, sizeof(cp_time),
|
|
|
|
"LU", "CPU time statistics");
|
|
|
|
|
1994-08-18 22:36:09 +00:00
|
|
|
long tk_cancc;
|
|
|
|
long tk_nin;
|
|
|
|
long tk_nout;
|
|
|
|
long tk_rawcc;
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Clock handling routines.
|
|
|
|
*
|
1998-03-16 10:19:12 +00:00
|
|
|
* This code is written to operate with two timers that run independently of
|
|
|
|
* each other.
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
1998-03-16 10:19:12 +00:00
|
|
|
* The main timer, running hz times per second, is used to trigger interval
|
|
|
|
* timers, timeouts and rescheduling as needed.
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
1998-03-16 10:19:12 +00:00
|
|
|
* The second timer handles kernel and user profiling,
|
|
|
|
* and does resource use estimation. If the second timer is programmable,
|
|
|
|
* it is randomized to avoid aliasing between the two clocks. For example,
|
|
|
|
* the randomization prevents an adversary from always giving up the cpu
|
1998-02-20 16:36:17 +00:00
|
|
|
* just before its quantum expires. Otherwise, it would never accumulate
|
|
|
|
* cpu ticks. The mean frequency of the second timer is stathz.
|
1998-03-16 10:19:12 +00:00
|
|
|
*
|
|
|
|
* If no second timer exists, stathz will be zero; in this case we drive
|
|
|
|
* profiling and statistics off the main clock. This WILL NOT be accurate;
|
|
|
|
* do not do it unless absolutely necessary.
|
|
|
|
*
|
1994-05-24 10:09:53 +00:00
|
|
|
* The statistics clock may (or may not) be run at a higher rate while
|
1998-03-16 10:19:12 +00:00
|
|
|
* profiling. This profile clock runs at profhz. We require that profhz
|
|
|
|
* be an integral multiple of stathz.
|
|
|
|
*
|
|
|
|
* If the statistics clock is running fast, it must be divided by the ratio
|
|
|
|
* profhz/stathz for statistics. (For profiling, every tick counts.)
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
1998-02-20 16:36:17 +00:00
|
|
|
* Time-of-day is maintained using a "timecounter", which may or may
|
|
|
|
* not be related to the hardware generating the above mentioned
|
|
|
|
* interrupts.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
int stathz;
|
|
|
|
int profhz;
|
1996-06-23 17:40:47 +00:00
|
|
|
static int profprocs;
|
1994-05-24 10:09:53 +00:00
|
|
|
int ticks;
|
1997-09-21 22:00:25 +00:00
|
|
|
static int psdiv, pscnt; /* prof => stat divider */
|
1998-02-20 16:36:17 +00:00
|
|
|
int psratio; /* ratio: prof / stat */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize clock frequencies and start both clocks running.
|
|
|
|
*/
|
1995-08-28 09:19:25 +00:00
|
|
|
/* ARGSUSED*/
|
|
|
|
static void
|
1995-12-02 17:11:20 +00:00
|
|
|
initclocks(dummy)
|
|
|
|
void *dummy;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
register int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set divisors to 1 (normal case) and let the machine-specific
|
|
|
|
* code do its bit.
|
|
|
|
*/
|
|
|
|
psdiv = pscnt = 1;
|
|
|
|
cpu_initclocks();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute profhz/stathz, and fix profhz if needed.
|
|
|
|
*/
|
|
|
|
i = stathz ? stathz : hz;
|
|
|
|
if (profhz == 0)
|
|
|
|
profhz = i;
|
|
|
|
psratio = profhz / i;
|
|
|
|
}
|
|
|
|
|
2001-04-27 19:28:25 +00:00
|
|
|
/*
|
|
|
|
* Each time the real-time timer fires, this function is called on all CPUs
|
|
|
|
* with each CPU passing in its curproc as the first argument. If possible
|
|
|
|
* a nice optimization in the future would be to allow the CPU receiving the
|
|
|
|
* actual real-time timer interrupt to call this function on behalf of the
|
|
|
|
* other CPUs rather than sending an IPI to all other CPUs so that they
|
|
|
|
* can call this function. Note that hardclock() calls hardclock_process()
|
|
|
|
* for the CPU receiving the timer interrupt, so only the other CPUs in the
|
|
|
|
* system need to call this function (or have it called on their behalf.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
hardclock_process(p, user)
|
|
|
|
struct proc *p;
|
|
|
|
int user;
|
|
|
|
{
|
|
|
|
struct pstats *pstats;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Run current process's virtual and profile time, as needed.
|
|
|
|
*/
|
|
|
|
mtx_assert(&sched_lock, MA_OWNED);
|
|
|
|
pstats = p->p_stats;
|
|
|
|
if (user &&
|
|
|
|
timevalisset(&pstats->p_timer[ITIMER_VIRTUAL].it_value) &&
|
|
|
|
itimerdecr(&pstats->p_timer[ITIMER_VIRTUAL], tick) == 0) {
|
|
|
|
p->p_sflag |= PS_ALRMPEND;
|
|
|
|
aston(p);
|
|
|
|
}
|
|
|
|
if (timevalisset(&pstats->p_timer[ITIMER_PROF].it_value) &&
|
|
|
|
itimerdecr(&pstats->p_timer[ITIMER_PROF], tick) == 0) {
|
|
|
|
p->p_sflag |= PS_PROFPEND;
|
|
|
|
aston(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* The real-time timer, interrupting hz times per second.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
hardclock(frame)
|
|
|
|
register struct clockframe *frame;
|
|
|
|
{
|
2000-11-19 06:02:32 +00:00
|
|
|
int need_softclock = 0;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2001-04-27 19:28:25 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
|
|
|
hardclock_process(curproc, CLKF_USERMODE(frame));
|
|
|
|
mtx_unlock_spin(&sched_lock);
|
1998-03-16 10:19:12 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* If no separate statistics clock is available, run it from here.
|
2001-04-27 19:28:25 +00:00
|
|
|
*
|
|
|
|
* XXX: this only works for UP
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
if (stathz == 0)
|
|
|
|
statclock(frame);
|
|
|
|
|
2000-03-20 14:09:06 +00:00
|
|
|
tc_windup();
|
1998-01-14 20:48:16 +00:00
|
|
|
|
1998-03-16 10:19:12 +00:00
|
|
|
/*
|
|
|
|
* Process callouts at a very low cpu priority, so we don't keep the
|
|
|
|
* relatively high clock interrupt priority any longer than necessary.
|
|
|
|
*/
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock_spin(&callout_lock);
|
2000-11-19 06:02:32 +00:00
|
|
|
ticks++;
|
1998-03-16 10:19:12 +00:00
|
|
|
if (TAILQ_FIRST(&callwheel[ticks & callwheelmask]) != NULL) {
|
2000-11-19 06:02:32 +00:00
|
|
|
need_softclock = 1;
|
1998-03-16 10:19:12 +00:00
|
|
|
} else if (softticks + 1 == ticks)
|
|
|
|
++softticks;
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&callout_lock);
|
2000-11-19 06:02:32 +00:00
|
|
|
|
|
|
|
/*
|
2001-02-09 17:46:35 +00:00
|
|
|
* swi_sched acquires sched_lock, so we don't want to call it with
|
2000-11-19 06:02:32 +00:00
|
|
|
* callout_lock held; incorrect locking order.
|
|
|
|
*/
|
|
|
|
if (need_softclock)
|
2001-02-09 17:46:35 +00:00
|
|
|
swi_sched(softclock_ih, SWI_NOSWITCH);
|
1997-09-21 22:00:25 +00:00
|
|
|
}
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1998-03-30 09:56:58 +00:00
|
|
|
* Compute number of ticks in the specified amount of time.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
int
|
1998-03-30 09:56:58 +00:00
|
|
|
tvtohz(tv)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct timeval *tv;
|
|
|
|
{
|
1994-12-12 11:58:46 +00:00
|
|
|
register unsigned long ticks;
|
|
|
|
register long sec, usec;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
1994-12-12 11:58:46 +00:00
|
|
|
* If the number of usecs in the whole seconds part of the time
|
|
|
|
* difference fits in a long, then the total number of usecs will
|
|
|
|
* fit in an unsigned long. Compute the total and convert it to
|
|
|
|
* ticks, rounding up and adding 1 to allow for the current tick
|
|
|
|
* to expire. Rounding also depends on unsigned long arithmetic
|
|
|
|
* to avoid overflow.
|
1994-05-24 10:09:53 +00:00
|
|
|
*
|
1994-12-12 11:58:46 +00:00
|
|
|
* Otherwise, if the number of ticks in the whole seconds part of
|
|
|
|
* the time difference fits in a long, then convert the parts to
|
|
|
|
* ticks separately and add, using similar rounding methods and
|
|
|
|
* overflow avoidance. This method would work in the previous
|
|
|
|
* case but it is slightly slower and assumes that hz is integral.
|
|
|
|
*
|
|
|
|
* Otherwise, round the time difference down to the maximum
|
|
|
|
* representable value.
|
|
|
|
*
|
|
|
|
* If ints have 32 bits, then the maximum value for any timeout in
|
|
|
|
* 10ms ticks is 248 days.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
1998-03-30 09:56:58 +00:00
|
|
|
sec = tv->tv_sec;
|
|
|
|
usec = tv->tv_usec;
|
1994-12-12 11:58:46 +00:00
|
|
|
if (usec < 0) {
|
|
|
|
sec--;
|
|
|
|
usec += 1000000;
|
|
|
|
}
|
|
|
|
if (sec < 0) {
|
|
|
|
#ifdef DIAGNOSTIC
|
1998-03-16 10:19:12 +00:00
|
|
|
if (usec > 0) {
|
1998-02-20 16:36:17 +00:00
|
|
|
sec++;
|
|
|
|
usec -= 1000000;
|
|
|
|
}
|
1998-03-30 09:56:58 +00:00
|
|
|
printf("tvotohz: negative time difference %ld sec %ld usec\n",
|
1994-12-12 11:58:46 +00:00
|
|
|
sec, usec);
|
|
|
|
#endif
|
|
|
|
ticks = 1;
|
|
|
|
} else if (sec <= LONG_MAX / 1000000)
|
|
|
|
ticks = (sec * 1000000 + (unsigned long)usec + (tick - 1))
|
|
|
|
/ tick + 1;
|
|
|
|
else if (sec <= LONG_MAX / hz)
|
|
|
|
ticks = sec * hz
|
|
|
|
+ ((unsigned long)usec + (tick - 1)) / tick + 1;
|
|
|
|
else
|
|
|
|
ticks = LONG_MAX;
|
|
|
|
if (ticks > INT_MAX)
|
|
|
|
ticks = INT_MAX;
|
1998-10-06 23:17:44 +00:00
|
|
|
return ((int)ticks);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Start profiling on a process.
|
|
|
|
*
|
|
|
|
* Kernel profiling passes proc0 which never exits and hence
|
|
|
|
* keeps the profile clock running constantly.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
startprofclock(p)
|
|
|
|
register struct proc *p;
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
|
2001-01-24 10:43:25 +00:00
|
|
|
/*
|
|
|
|
* XXX; Right now sched_lock protects statclock(), but perhaps
|
|
|
|
* it should be protected later on by a time_lock, which would
|
|
|
|
* cover psdiv, etc. as well.
|
|
|
|
*/
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2001-01-24 10:43:25 +00:00
|
|
|
if ((p->p_sflag & PS_PROFIL) == 0) {
|
|
|
|
p->p_sflag |= PS_PROFIL;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (++profprocs == 1 && stathz != 0) {
|
|
|
|
s = splstatclock();
|
|
|
|
psdiv = pscnt = psratio;
|
|
|
|
setstatclockrate(profhz);
|
|
|
|
splx(s);
|
|
|
|
}
|
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Stop profiling on a process.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
stopprofclock(p)
|
|
|
|
register struct proc *p;
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2001-01-24 10:43:25 +00:00
|
|
|
if (p->p_sflag & PS_PROFIL) {
|
|
|
|
p->p_sflag &= ~PS_PROFIL;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (--profprocs == 0 && stathz != 0) {
|
|
|
|
s = splstatclock();
|
|
|
|
psdiv = pscnt = 1;
|
|
|
|
setstatclockrate(stathz);
|
|
|
|
splx(s);
|
|
|
|
}
|
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2001-04-27 19:28:25 +00:00
|
|
|
* Do process and kernel statistics. Most of the statistics are only
|
1999-11-27 14:37:34 +00:00
|
|
|
* used by user-level statistics programs. The main exceptions are
|
2001-04-27 19:28:25 +00:00
|
|
|
* p->p_uticks, p->p_sticks, p->p_iticks, and p->p_estcpu. This function
|
|
|
|
* should be called by all CPUs in the system for each statistics clock
|
|
|
|
* interrupt. See the description of hardclock_process for more detail on
|
|
|
|
* this function's relationship to statclock.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
void
|
2001-04-27 19:28:25 +00:00
|
|
|
statclock_process(p, pc, user)
|
|
|
|
struct proc *p;
|
|
|
|
register_t pc;
|
|
|
|
int user;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
#ifdef GPROF
|
2001-04-27 19:28:25 +00:00
|
|
|
struct gmonparam *g;
|
1998-10-26 06:13:18 +00:00
|
|
|
int i;
|
1994-05-24 10:09:53 +00:00
|
|
|
#endif
|
1996-07-30 16:59:22 +00:00
|
|
|
struct pstats *pstats;
|
|
|
|
long rss;
|
|
|
|
struct rusage *ru;
|
|
|
|
struct vmspace *vm;
|
1994-08-27 16:14:39 +00:00
|
|
|
|
2001-04-27 19:28:25 +00:00
|
|
|
KASSERT(p == curproc, ("statclock_process: p != curproc"));
|
|
|
|
mtx_assert(&sched_lock, MA_OWNED);
|
|
|
|
if (user) {
|
1999-11-27 14:37:34 +00:00
|
|
|
/*
|
|
|
|
* Came from user mode; CPU was in user state.
|
|
|
|
* If this process is being profiled, record the tick.
|
|
|
|
*/
|
2001-01-24 10:43:25 +00:00
|
|
|
if (p->p_sflag & PS_PROFIL)
|
2001-04-27 19:28:25 +00:00
|
|
|
addupc_intr(p, pc, 1);
|
|
|
|
if (pscnt < psdiv)
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
/*
|
1999-11-27 14:37:34 +00:00
|
|
|
* Charge the time as appropriate.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
p->p_uticks++;
|
|
|
|
if (p->p_nice > NZERO)
|
|
|
|
cp_time[CP_NICE]++;
|
|
|
|
else
|
|
|
|
cp_time[CP_USER]++;
|
|
|
|
} else {
|
|
|
|
#ifdef GPROF
|
|
|
|
/*
|
|
|
|
* Kernel statistics are just like addupc_intr, only easier.
|
|
|
|
*/
|
|
|
|
g = &_gmonparam;
|
|
|
|
if (g->state == GMON_PROF_ON) {
|
2001-04-27 19:28:25 +00:00
|
|
|
i = pc - g->lowpc;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (i < g->textsize) {
|
|
|
|
i /= HISTFRACTION * sizeof(*g->kcount);
|
|
|
|
g->kcount[i]++;
|
|
|
|
}
|
|
|
|
}
|
1997-12-08 23:00:24 +00:00
|
|
|
#endif
|
2001-04-27 19:28:25 +00:00
|
|
|
if (pscnt < psdiv)
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
/*
|
|
|
|
* Came from kernel mode, so we were:
|
|
|
|
* - handling an interrupt,
|
|
|
|
* - doing syscall or trap work on behalf of the current
|
|
|
|
* user process, or
|
|
|
|
* - spinning in the idle loop.
|
|
|
|
* Whichever it is, charge the time as appropriate.
|
|
|
|
* Note that we charge interrupts to the current process,
|
|
|
|
* regardless of whether they are ``for'' that process,
|
|
|
|
* so that we know how much of its real time was spent
|
|
|
|
* in ``non-process'' (i.e., interrupt) work.
|
|
|
|
*/
|
2001-04-27 19:28:25 +00:00
|
|
|
if ((p->p_ithd != NULL) || p->p_intr_nesting_level >= 2) {
|
2000-09-07 01:33:02 +00:00
|
|
|
p->p_iticks++;
|
1994-05-24 10:09:53 +00:00
|
|
|
cp_time[CP_INTR]++;
|
2000-09-07 01:33:02 +00:00
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
p->p_sticks++;
|
2001-01-10 04:43:51 +00:00
|
|
|
if (p != PCPU_GET(idleproc))
|
2000-09-07 01:33:02 +00:00
|
|
|
cp_time[CP_SYS]++;
|
|
|
|
else
|
|
|
|
cp_time[CP_IDLE]++;
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
2000-09-12 18:57:59 +00:00
|
|
|
schedclock(p);
|
|
|
|
|
|
|
|
/* Update resource usage integrals and maximums. */
|
|
|
|
if ((pstats = p->p_stats) != NULL &&
|
|
|
|
(ru = &pstats->p_ru) != NULL &&
|
|
|
|
(vm = p->p_vmspace) != NULL) {
|
|
|
|
ru->ru_ixrss += pgtok(vm->vm_tsize);
|
|
|
|
ru->ru_idrss += pgtok(vm->vm_dsize);
|
|
|
|
ru->ru_isrss += pgtok(vm->vm_ssize);
|
|
|
|
rss = pgtok(vmspace_resident_count(vm));
|
|
|
|
if (ru->ru_maxrss < rss)
|
|
|
|
ru->ru_maxrss = rss;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-04-27 19:28:25 +00:00
|
|
|
}
|
2000-10-06 02:20:21 +00:00
|
|
|
|
2001-04-27 19:28:25 +00:00
|
|
|
/*
|
|
|
|
* Statistics clock. Grab profile sample, and if divider reaches 0,
|
|
|
|
* do process and kernel statistics. Most of the statistics are only
|
|
|
|
* used by user-level statistics programs. The main exceptions are
|
|
|
|
* p->p_uticks, p->p_sticks, p->p_iticks, and p->p_estcpu.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
statclock(frame)
|
|
|
|
register struct clockframe *frame;
|
|
|
|
{
|
|
|
|
|
|
|
|
mtx_lock_spin(&sched_lock);
|
|
|
|
if (--pscnt == 0)
|
|
|
|
pscnt = psdiv;
|
|
|
|
statclock_process(curproc, CLKF_PC(frame), CLKF_USERMODE(frame));
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return information about system clocks.
|
|
|
|
*/
|
1995-11-08 08:48:36 +00:00
|
|
|
static int
|
2000-07-04 11:25:35 +00:00
|
|
|
sysctl_kern_clockrate(SYSCTL_HANDLER_ARGS)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
struct clockinfo clkinfo;
|
|
|
|
/*
|
|
|
|
* Construct clockinfo structure.
|
|
|
|
*/
|
|
|
|
clkinfo.hz = hz;
|
|
|
|
clkinfo.tick = tick;
|
1997-06-24 18:21:09 +00:00
|
|
|
clkinfo.tickadj = tickadj;
|
1994-05-24 10:09:53 +00:00
|
|
|
clkinfo.profhz = profhz;
|
|
|
|
clkinfo.stathz = stathz ? stathz : hz;
|
1995-11-12 19:52:09 +00:00
|
|
|
return (sysctl_handle_opaque(oidp, &clkinfo, sizeof clkinfo, req));
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1994-09-18 20:40:01 +00:00
|
|
|
|
1995-12-04 16:48:58 +00:00
|
|
|
SYSCTL_PROC(_kern, KERN_CLOCKRATE, clockrate, CTLTYPE_STRUCT|CTLFLAG_RD,
|
1995-12-06 13:27:39 +00:00
|
|
|
0, 0, sysctl_kern_clockrate, "S,clockinfo","");
|