1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1989, 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.
|
|
|
|
*
|
|
|
|
* @(#)kern_time.c 8.1 (Berkeley) 6/10/93
|
1999-04-07 19:48:09 +00:00
|
|
|
* $Id: kern_time.c,v 1.63 1999/04/07 17:32:21 mjacob Exp $
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
1999-02-25 15:54:06 +00:00
|
|
|
#include <sys/buf.h>
|
1995-11-12 06:43:28 +00:00
|
|
|
#include <sys/sysproto.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/resourcevar.h>
|
1994-10-02 17:35:40 +00:00
|
|
|
#include <sys/signalvar.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/systm.h>
|
1997-05-08 14:16:25 +00:00
|
|
|
#include <sys/sysent.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/proc.h>
|
1997-05-10 12:00:03 +00:00
|
|
|
#include <sys/time.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/vnode.h>
|
1997-06-01 09:01:07 +00:00
|
|
|
#include <vm/vm.h>
|
|
|
|
#include <vm/vm_extern.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-06-29 07:07:00 +00:00
|
|
|
struct timezone tz;
|
|
|
|
|
1995-05-30 08:16:23 +00:00
|
|
|
/*
|
1994-05-24 10:09:53 +00:00
|
|
|
* Time of day and interval timer support.
|
|
|
|
*
|
|
|
|
* These routines provide the kernel entry points to get and set
|
|
|
|
* the time-of-day and per-process interval timers. Subroutines
|
|
|
|
* here provide support for adding and subtracting timeval structures
|
|
|
|
* and decrementing interval timers, optionally reloading the interval
|
|
|
|
* timers when they expire.
|
|
|
|
*/
|
|
|
|
|
1997-06-01 09:01:07 +00:00
|
|
|
static int nanosleep1 __P((struct proc *p, struct timespec *rqt,
|
|
|
|
struct timespec *rmt));
|
1997-08-26 00:40:04 +00:00
|
|
|
static int settime __P((struct timeval *));
|
|
|
|
static void timevalfix __P((struct timeval *));
|
1997-11-06 19:29:57 +00:00
|
|
|
static void no_lease_updatetime __P((int));
|
1997-05-08 14:16:25 +00:00
|
|
|
|
1997-10-26 20:26:33 +00:00
|
|
|
static void
|
|
|
|
no_lease_updatetime(deltat)
|
|
|
|
int deltat;
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void (*lease_updatetime) __P((int)) = no_lease_updatetime;
|
|
|
|
|
1997-05-08 14:16:25 +00:00
|
|
|
static int
|
|
|
|
settime(tv)
|
|
|
|
struct timeval *tv;
|
|
|
|
{
|
1999-04-07 16:36:56 +00:00
|
|
|
struct timeval delta, tv1, tv2;
|
1999-04-07 19:48:09 +00:00
|
|
|
static struct timeval maxtime, laststep;
|
1998-02-20 16:36:17 +00:00
|
|
|
struct timespec ts;
|
1997-05-08 14:16:25 +00:00
|
|
|
int s;
|
|
|
|
|
1997-05-10 12:00:03 +00:00
|
|
|
s = splclock();
|
1998-02-25 04:10:32 +00:00
|
|
|
microtime(&tv1);
|
1998-04-04 13:26:20 +00:00
|
|
|
delta = *tv;
|
|
|
|
timevalsub(&delta, &tv1);
|
1997-05-08 14:16:25 +00:00
|
|
|
|
|
|
|
/*
|
1998-02-25 04:10:32 +00:00
|
|
|
* If the system is secure, we do not allow the time to be
|
1999-04-07 16:36:56 +00:00
|
|
|
* set to a value earlier than 1 second less than the highest
|
|
|
|
* time we have yet seen. The worst a miscreant can do in
|
|
|
|
* this circumstance is "freeze" time. He couldn't go
|
|
|
|
* back to the past.
|
1999-04-07 19:48:09 +00:00
|
|
|
*
|
|
|
|
* We similarly do not allow the clock to be stepped more
|
|
|
|
* than one second, nor more than once per second. This allows
|
|
|
|
* a miscreant to make the clock march double-time, but no worse.
|
1997-05-08 14:16:25 +00:00
|
|
|
*/
|
1999-04-07 16:36:56 +00:00
|
|
|
if (securelevel > 1) {
|
|
|
|
if (delta.tv_sec < 0 || delta.tv_usec < 0) {
|
1999-04-07 17:32:21 +00:00
|
|
|
/*
|
1999-04-07 19:48:09 +00:00
|
|
|
* Update maxtime to latest time we've seen.
|
1999-04-07 17:32:21 +00:00
|
|
|
*/
|
|
|
|
if (tv1.tv_sec > maxtime.tv_sec)
|
|
|
|
maxtime = tv1;
|
|
|
|
tv2 = *tv;
|
|
|
|
timevalsub(&tv2, &maxtime);
|
|
|
|
if (tv2.tv_sec < -1) {
|
|
|
|
tv->tv_sec = maxtime.tv_sec - 1;
|
1999-04-07 16:36:56 +00:00
|
|
|
printf("Time adjustment clamped to -1 second\n");
|
|
|
|
}
|
1999-04-07 17:32:21 +00:00
|
|
|
} else {
|
1999-04-07 19:48:09 +00:00
|
|
|
if (tv1.tv_sec == laststep.tv_sec) {
|
|
|
|
splx(s);
|
|
|
|
return (EPERM);
|
|
|
|
}
|
|
|
|
if (delta.tv_sec > 1) {
|
|
|
|
tv->tv_sec = tv1.tv_sec + 1;
|
|
|
|
printf("Time adjustment clamped to +1 second\n");
|
|
|
|
}
|
|
|
|
laststep = *tv;
|
1999-04-07 16:36:56 +00:00
|
|
|
}
|
1998-02-25 04:10:32 +00:00
|
|
|
}
|
|
|
|
|
1998-02-20 16:36:17 +00:00
|
|
|
ts.tv_sec = tv->tv_sec;
|
|
|
|
ts.tv_nsec = tv->tv_usec * 1000;
|
|
|
|
set_timecounter(&ts);
|
1997-05-08 14:16:25 +00:00
|
|
|
(void) splsoftclock();
|
|
|
|
lease_updatetime(delta.tv_sec);
|
|
|
|
splx(s);
|
|
|
|
resettodr();
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
|
|
struct clock_gettime_args {
|
|
|
|
clockid_t clock_id;
|
|
|
|
struct timespec *tp;
|
|
|
|
};
|
|
|
|
#endif
|
1997-05-10 12:00:03 +00:00
|
|
|
|
1997-05-08 14:16:25 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
clock_gettime(p, uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
struct proc *p;
|
|
|
|
struct clock_gettime_args *uap;
|
|
|
|
{
|
|
|
|
struct timespec ats;
|
|
|
|
|
1997-05-10 12:00:03 +00:00
|
|
|
if (SCARG(uap, clock_id) != CLOCK_REALTIME)
|
1997-05-08 14:16:25 +00:00
|
|
|
return (EINVAL);
|
1998-02-20 16:36:17 +00:00
|
|
|
nanotime(&ats);
|
1997-05-10 12:00:03 +00:00
|
|
|
return (copyout(&ats, SCARG(uap, tp), sizeof(ats)));
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
|
|
struct clock_settime_args {
|
|
|
|
clockid_t clock_id;
|
|
|
|
const struct timespec *tp;
|
|
|
|
};
|
|
|
|
#endif
|
1997-05-10 12:00:03 +00:00
|
|
|
|
1997-05-08 14:16:25 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
clock_settime(p, uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
struct proc *p;
|
|
|
|
struct clock_settime_args *uap;
|
|
|
|
{
|
|
|
|
struct timeval atv;
|
|
|
|
struct timespec ats;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
|
|
|
|
return (error);
|
1997-05-10 12:00:03 +00:00
|
|
|
if (SCARG(uap, clock_id) != CLOCK_REALTIME)
|
1997-05-08 14:16:25 +00:00
|
|
|
return (EINVAL);
|
|
|
|
if ((error = copyin(SCARG(uap, tp), &ats, sizeof(ats))) != 0)
|
|
|
|
return (error);
|
1997-08-03 07:26:50 +00:00
|
|
|
if (ats.tv_nsec < 0 || ats.tv_nsec >= 1000000000)
|
1997-05-10 12:00:03 +00:00
|
|
|
return (EINVAL);
|
1998-03-26 20:54:05 +00:00
|
|
|
/* XXX Don't convert nsec->usec and back */
|
1997-05-08 14:16:25 +00:00
|
|
|
TIMESPEC_TO_TIMEVAL(&atv, &ats);
|
|
|
|
if ((error = settime(&atv)))
|
|
|
|
return (error);
|
1997-05-10 12:00:03 +00:00
|
|
|
return (0);
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
|
|
struct clock_getres_args {
|
|
|
|
clockid_t clock_id;
|
|
|
|
struct timespec *tp;
|
|
|
|
};
|
|
|
|
#endif
|
1997-05-10 12:00:03 +00:00
|
|
|
|
1997-05-08 14:16:25 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
clock_getres(p, uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
struct proc *p;
|
|
|
|
struct clock_getres_args *uap;
|
|
|
|
{
|
|
|
|
struct timespec ts;
|
1997-05-10 12:00:03 +00:00
|
|
|
int error;
|
1997-05-08 14:16:25 +00:00
|
|
|
|
1997-05-10 12:00:03 +00:00
|
|
|
if (SCARG(uap, clock_id) != CLOCK_REALTIME)
|
1997-05-08 14:16:25 +00:00
|
|
|
return (EINVAL);
|
1997-05-10 12:00:03 +00:00
|
|
|
error = 0;
|
1997-05-08 14:16:25 +00:00
|
|
|
if (SCARG(uap, tp)) {
|
|
|
|
ts.tv_sec = 0;
|
1998-06-09 13:10:54 +00:00
|
|
|
ts.tv_nsec = 1000000000 / timecounter->tc_frequency;
|
1997-05-10 12:00:03 +00:00
|
|
|
error = copyout(&ts, SCARG(uap, tp), sizeof(ts));
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
1997-05-10 12:00:03 +00:00
|
|
|
return (error);
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
|
|
|
|
1997-06-01 09:01:07 +00:00
|
|
|
static int nanowait;
|
1997-05-10 12:00:03 +00:00
|
|
|
|
1997-06-01 09:01:07 +00:00
|
|
|
static int
|
|
|
|
nanosleep1(p, rqt, rmt)
|
1997-05-08 14:16:25 +00:00
|
|
|
struct proc *p;
|
1997-06-01 09:01:07 +00:00
|
|
|
struct timespec *rqt, *rmt;
|
1997-05-08 14:16:25 +00:00
|
|
|
{
|
1998-04-05 12:10:41 +00:00
|
|
|
struct timespec ts, ts2, ts3;
|
1998-04-05 10:28:01 +00:00
|
|
|
struct timeval tv;
|
|
|
|
int error;
|
1997-05-08 14:16:25 +00:00
|
|
|
|
1997-08-26 00:40:04 +00:00
|
|
|
if (rqt->tv_nsec < 0 || rqt->tv_nsec >= 1000000000)
|
1997-05-10 12:00:03 +00:00
|
|
|
return (EINVAL);
|
1999-01-27 21:50:00 +00:00
|
|
|
if (rqt->tv_sec < 0 || (rqt->tv_sec == 0 && rqt->tv_nsec == 0))
|
1997-08-26 00:40:04 +00:00
|
|
|
return (0);
|
1998-05-17 11:53:46 +00:00
|
|
|
getnanouptime(&ts);
|
1998-04-04 13:26:20 +00:00
|
|
|
timespecadd(&ts, rqt);
|
1998-04-05 10:28:01 +00:00
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, rqt);
|
|
|
|
for (;;) {
|
|
|
|
error = tsleep(&nanowait, PWAIT | PCATCH, "nanslp",
|
|
|
|
tvtohz(&tv));
|
1998-05-17 11:53:46 +00:00
|
|
|
getnanouptime(&ts2);
|
1998-04-05 10:28:01 +00:00
|
|
|
if (error != EWOULDBLOCK) {
|
|
|
|
if (error == ERESTART)
|
|
|
|
error = EINTR;
|
|
|
|
if (rmt != NULL) {
|
|
|
|
timespecsub(&ts, &ts2);
|
|
|
|
if (ts.tv_sec < 0)
|
|
|
|
timespecclear(&ts);
|
|
|
|
*rmt = ts;
|
|
|
|
}
|
|
|
|
return (error);
|
1997-08-13 17:55:11 +00:00
|
|
|
}
|
1998-04-05 10:28:01 +00:00
|
|
|
if (timespeccmp(&ts2, &ts, >=))
|
|
|
|
return (0);
|
1998-04-05 12:10:41 +00:00
|
|
|
ts3 = ts;
|
|
|
|
timespecsub(&ts3, &ts2);
|
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, &ts3);
|
1998-04-04 13:26:20 +00:00
|
|
|
}
|
1997-06-01 09:01:07 +00:00
|
|
|
}
|
1997-05-08 14:16:25 +00:00
|
|
|
|
1997-06-01 09:01:07 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
|
|
struct nanosleep_args {
|
|
|
|
struct timespec *rqtp;
|
|
|
|
struct timespec *rmtp;
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
nanosleep(p, uap)
|
1997-06-01 09:01:07 +00:00
|
|
|
struct proc *p;
|
|
|
|
struct nanosleep_args *uap;
|
|
|
|
{
|
|
|
|
struct timespec rmt, rqt;
|
|
|
|
int error, error2;
|
|
|
|
|
|
|
|
error = copyin(SCARG(uap, rqtp), &rqt, sizeof(rqt));
|
|
|
|
if (error)
|
|
|
|
return (error);
|
1997-06-01 09:05:19 +00:00
|
|
|
if (SCARG(uap, rmtp))
|
|
|
|
if (!useracc((caddr_t)SCARG(uap, rmtp), sizeof(rmt), B_WRITE))
|
|
|
|
return (EFAULT);
|
1997-06-01 09:01:07 +00:00
|
|
|
error = nanosleep1(p, &rqt, &rmt);
|
1998-04-05 11:17:19 +00:00
|
|
|
if (error && SCARG(uap, rmtp)) {
|
1997-05-10 12:00:03 +00:00
|
|
|
error2 = copyout(&rmt, SCARG(uap, rmtp), sizeof(rmt));
|
1997-06-01 09:01:07 +00:00
|
|
|
if (error2) /* XXX shouldn't happen, did useracc() above */
|
1997-05-10 12:00:03 +00:00
|
|
|
return (error2);
|
|
|
|
}
|
|
|
|
return (error);
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct gettimeofday_args {
|
|
|
|
struct timeval *tp;
|
|
|
|
struct timezone *tzp;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
gettimeofday(p, uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *p;
|
|
|
|
register struct gettimeofday_args *uap;
|
|
|
|
{
|
|
|
|
struct timeval atv;
|
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if (uap->tp) {
|
|
|
|
microtime(&atv);
|
1994-09-25 19:34:02 +00:00
|
|
|
if ((error = copyout((caddr_t)&atv, (caddr_t)uap->tp,
|
|
|
|
sizeof (atv))))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
if (uap->tzp)
|
|
|
|
error = copyout((caddr_t)&tz, (caddr_t)uap->tzp,
|
|
|
|
sizeof (tz));
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct settimeofday_args {
|
|
|
|
struct timeval *tv;
|
|
|
|
struct timezone *tzp;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
settimeofday(p, uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *p;
|
|
|
|
struct settimeofday_args *uap;
|
|
|
|
{
|
1997-05-10 12:00:03 +00:00
|
|
|
struct timeval atv;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct timezone atz;
|
1997-05-10 12:00:03 +00:00
|
|
|
int error;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1994-09-25 19:34:02 +00:00
|
|
|
if ((error = suser(p->p_ucred, &p->p_acflag)))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
/* Verify all parameters before changing time. */
|
1997-05-10 12:00:03 +00:00
|
|
|
if (uap->tv) {
|
|
|
|
if ((error = copyin((caddr_t)uap->tv, (caddr_t)&atv,
|
|
|
|
sizeof(atv))))
|
|
|
|
return (error);
|
|
|
|
if (atv.tv_usec < 0 || atv.tv_usec >= 1000000)
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
if (uap->tzp &&
|
|
|
|
(error = copyin((caddr_t)uap->tzp, (caddr_t)&atz, sizeof(atz))))
|
|
|
|
return (error);
|
1997-05-08 14:16:25 +00:00
|
|
|
if (uap->tv && (error = settime(&atv)))
|
|
|
|
return (error);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (uap->tzp)
|
|
|
|
tz = atz;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int tickdelta; /* current clock skew, us. per tick */
|
|
|
|
long timedelta; /* unapplied time correction, us. */
|
1995-12-14 08:32:45 +00:00
|
|
|
static long bigadj = 1000000; /* use 10x skew above bigadj us. */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct adjtime_args {
|
|
|
|
struct timeval *delta;
|
|
|
|
struct timeval *olddelta;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
adjtime(p, uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *p;
|
|
|
|
register struct adjtime_args *uap;
|
|
|
|
{
|
|
|
|
struct timeval atv;
|
|
|
|
register long ndelta, ntickdelta, odelta;
|
|
|
|
int s, error;
|
|
|
|
|
1994-09-25 19:34:02 +00:00
|
|
|
if ((error = suser(p->p_ucred, &p->p_acflag)))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
1994-09-25 19:34:02 +00:00
|
|
|
if ((error =
|
|
|
|
copyin((caddr_t)uap->delta, (caddr_t)&atv, sizeof(struct timeval))))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute the total correction and the rate at which to apply it.
|
|
|
|
* Round the adjustment down to a whole multiple of the per-tick
|
|
|
|
* delta, so that after some number of incremental changes in
|
|
|
|
* hardclock(), tickdelta will become zero, lest the correction
|
|
|
|
* overshoot and start taking us away from the desired final time.
|
|
|
|
*/
|
|
|
|
ndelta = atv.tv_sec * 1000000 + atv.tv_usec;
|
1996-07-12 07:55:35 +00:00
|
|
|
if (ndelta > bigadj || ndelta < -bigadj)
|
1994-05-24 10:09:53 +00:00
|
|
|
ntickdelta = 10 * tickadj;
|
|
|
|
else
|
|
|
|
ntickdelta = tickadj;
|
|
|
|
if (ndelta % ntickdelta)
|
|
|
|
ndelta = ndelta / ntickdelta * ntickdelta;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* To make hardclock()'s job easier, make the per-tick delta negative
|
|
|
|
* if we want time to run slower; then hardclock can simply compute
|
|
|
|
* tick + tickdelta, and subtract tickdelta from timedelta.
|
|
|
|
*/
|
|
|
|
if (ndelta < 0)
|
|
|
|
ntickdelta = -ntickdelta;
|
|
|
|
s = splclock();
|
|
|
|
odelta = timedelta;
|
|
|
|
timedelta = ndelta;
|
|
|
|
tickdelta = ntickdelta;
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
if (uap->olddelta) {
|
|
|
|
atv.tv_sec = odelta / 1000000;
|
|
|
|
atv.tv_usec = odelta % 1000000;
|
|
|
|
(void) copyout((caddr_t)&atv, (caddr_t)uap->olddelta,
|
|
|
|
sizeof(struct timeval));
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get value of an interval timer. The process virtual and
|
|
|
|
* profiling virtual time timers are kept in the p_stats area, since
|
|
|
|
* they can be swapped out. These are kept internally in the
|
|
|
|
* way they are specified externally: in time until they expire.
|
|
|
|
*
|
|
|
|
* The real time interval timer is kept in the process table slot
|
|
|
|
* for the process, and its value (it_value) is kept as an
|
|
|
|
* absolute time rather than as a delta, so that it is easy to keep
|
|
|
|
* periodic real-time signals from drifting.
|
|
|
|
*
|
|
|
|
* Virtual time timers are processed in the hardclock() routine of
|
|
|
|
* kern_clock.c. The real time timer is processed by a timeout
|
|
|
|
* routine, called from the softclock() routine. Since a callout
|
|
|
|
* may be delayed in real time due to interrupt processing in the system,
|
|
|
|
* it is possible for the real time timeout routine (realitexpire, given below),
|
|
|
|
* to be delayed in real time past when it is supposed to occur. It
|
|
|
|
* does not suffice, therefore, to reload the real timer .it_value from the
|
|
|
|
* real time timers .it_interval. Rather, we compute the next time in
|
|
|
|
* absolute time the timer should go off.
|
|
|
|
*/
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct getitimer_args {
|
|
|
|
u_int which;
|
|
|
|
struct itimerval *itv;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
getitimer(p, uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *p;
|
|
|
|
register struct getitimer_args *uap;
|
|
|
|
{
|
1998-03-30 09:56:58 +00:00
|
|
|
struct timeval ctv;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct itimerval aitv;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
if (uap->which > ITIMER_PROF)
|
|
|
|
return (EINVAL);
|
1998-03-30 09:56:58 +00:00
|
|
|
s = splclock(); /* XXX still needed ? */
|
1994-05-24 10:09:53 +00:00
|
|
|
if (uap->which == ITIMER_REAL) {
|
|
|
|
/*
|
1998-05-17 20:13:01 +00:00
|
|
|
* Convert from absolute to relative time in .it_value
|
1994-05-24 10:09:53 +00:00
|
|
|
* part of real time timer. If time for real time timer
|
|
|
|
* has passed return 0, else return difference between
|
|
|
|
* current time and time for the timer to go off.
|
|
|
|
*/
|
|
|
|
aitv = p->p_realtimer;
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&aitv.it_value)) {
|
1998-05-17 11:53:46 +00:00
|
|
|
getmicrouptime(&ctv);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalcmp(&aitv.it_value, &ctv, <))
|
|
|
|
timevalclear(&aitv.it_value);
|
1994-05-24 10:09:53 +00:00
|
|
|
else
|
1998-03-30 09:56:58 +00:00
|
|
|
timevalsub(&aitv.it_value, &ctv);
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
} else
|
|
|
|
aitv = p->p_stats->p_timer[uap->which];
|
|
|
|
splx(s);
|
|
|
|
return (copyout((caddr_t)&aitv, (caddr_t)uap->itv,
|
|
|
|
sizeof (struct itimerval)));
|
|
|
|
}
|
|
|
|
|
1995-11-12 06:43:28 +00:00
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
1994-05-24 10:09:53 +00:00
|
|
|
struct setitimer_args {
|
|
|
|
u_int which;
|
|
|
|
struct itimerval *itv, *oitv;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1997-11-06 19:29:57 +00:00
|
|
|
setitimer(p, uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct proc *p;
|
|
|
|
register struct setitimer_args *uap;
|
|
|
|
{
|
|
|
|
struct itimerval aitv;
|
1998-03-30 09:56:58 +00:00
|
|
|
struct timeval ctv;
|
1994-05-24 10:09:53 +00:00
|
|
|
register struct itimerval *itvp;
|
|
|
|
int s, error;
|
|
|
|
|
|
|
|
if (uap->which > ITIMER_PROF)
|
|
|
|
return (EINVAL);
|
|
|
|
itvp = uap->itv;
|
|
|
|
if (itvp && (error = copyin((caddr_t)itvp, (caddr_t)&aitv,
|
|
|
|
sizeof(struct itimerval))))
|
|
|
|
return (error);
|
1995-11-19 00:59:22 +00:00
|
|
|
if ((uap->itv = uap->oitv) &&
|
1997-11-06 19:29:57 +00:00
|
|
|
(error = getitimer(p, (struct getitimer_args *)uap)))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
if (itvp == 0)
|
|
|
|
return (0);
|
1997-08-14 08:15:12 +00:00
|
|
|
if (itimerfix(&aitv.it_value))
|
|
|
|
return (EINVAL);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (!timevalisset(&aitv.it_value))
|
|
|
|
timevalclear(&aitv.it_interval);
|
1997-08-14 08:15:12 +00:00
|
|
|
else if (itimerfix(&aitv.it_interval))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (EINVAL);
|
1998-03-30 09:56:58 +00:00
|
|
|
s = splclock(); /* XXX: still needed ? */
|
1994-05-24 10:09:53 +00:00
|
|
|
if (uap->which == ITIMER_REAL) {
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&p->p_realtimer.it_value))
|
1997-09-21 22:00:25 +00:00
|
|
|
untimeout(realitexpire, (caddr_t)p, p->p_ithandle);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&aitv.it_value))
|
1997-09-21 22:00:25 +00:00
|
|
|
p->p_ithandle = timeout(realitexpire, (caddr_t)p,
|
1998-04-04 18:46:13 +00:00
|
|
|
tvtohz(&aitv.it_value));
|
1998-05-17 11:53:46 +00:00
|
|
|
getmicrouptime(&ctv);
|
1998-04-05 11:49:36 +00:00
|
|
|
timevaladd(&aitv.it_value, &ctv);
|
1994-05-24 10:09:53 +00:00
|
|
|
p->p_realtimer = aitv;
|
|
|
|
} else
|
|
|
|
p->p_stats->p_timer[uap->which] = aitv;
|
|
|
|
splx(s);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Real interval timer expired:
|
|
|
|
* send process whose timer expired an alarm signal.
|
|
|
|
* If time is not set up to reload, then just return.
|
|
|
|
* Else compute next time timer should go off which is > current time.
|
|
|
|
* This is where delay in processing this timeout causes multiple
|
|
|
|
* SIGALRM calls to be compressed into one.
|
1998-05-17 20:08:05 +00:00
|
|
|
* tvtohz() always adds 1 to allow for the time until the next clock
|
1995-06-26 07:48:50 +00:00
|
|
|
* interrupt being strictly less than 1 clock tick, but we don't want
|
|
|
|
* that here since we want to appear to be in sync with the clock
|
|
|
|
* interrupt even when we're delayed.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
void
|
|
|
|
realitexpire(arg)
|
|
|
|
void *arg;
|
|
|
|
{
|
|
|
|
register struct proc *p;
|
1998-04-05 11:49:36 +00:00
|
|
|
struct timeval ctv, ntv;
|
1994-05-24 10:09:53 +00:00
|
|
|
int s;
|
|
|
|
|
|
|
|
p = (struct proc *)arg;
|
|
|
|
psignal(p, SIGALRM);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (!timevalisset(&p->p_realtimer.it_interval)) {
|
|
|
|
timevalclear(&p->p_realtimer.it_value);
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
for (;;) {
|
1998-03-30 09:56:58 +00:00
|
|
|
s = splclock(); /* XXX: still neeeded ? */
|
1994-05-24 10:09:53 +00:00
|
|
|
timevaladd(&p->p_realtimer.it_value,
|
|
|
|
&p->p_realtimer.it_interval);
|
1998-05-17 11:53:46 +00:00
|
|
|
getmicrouptime(&ctv);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalcmp(&p->p_realtimer.it_value, &ctv, >)) {
|
1998-04-05 11:49:36 +00:00
|
|
|
ntv = p->p_realtimer.it_value;
|
|
|
|
timevalsub(&ntv, &ctv);
|
1998-05-17 20:13:01 +00:00
|
|
|
p->p_ithandle = timeout(realitexpire, (caddr_t)p,
|
|
|
|
tvtohz(&ntv) - 1);
|
1994-05-24 10:09:53 +00:00
|
|
|
splx(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that a proposed value to load into the .it_value or
|
|
|
|
* .it_interval part of an interval timer is acceptable, and
|
|
|
|
* fix it to have at least minimal value (i.e. if it is less
|
|
|
|
* than the resolution of the clock, round it up.)
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1994-05-24 10:09:53 +00:00
|
|
|
itimerfix(tv)
|
|
|
|
struct timeval *tv;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (tv->tv_sec < 0 || tv->tv_sec > 100000000 ||
|
|
|
|
tv->tv_usec < 0 || tv->tv_usec >= 1000000)
|
|
|
|
return (EINVAL);
|
|
|
|
if (tv->tv_sec == 0 && tv->tv_usec != 0 && tv->tv_usec < tick)
|
|
|
|
tv->tv_usec = tick;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Decrement an interval timer by a specified number
|
|
|
|
* of microseconds, which must be less than a second,
|
|
|
|
* i.e. < 1000000. If the timer expires, then reload
|
|
|
|
* it. In this case, carry over (usec - old value) to
|
|
|
|
* reduce the value reloaded into the timer so that
|
|
|
|
* the timer does not drift. This routine assumes
|
|
|
|
* that it is called in a context where the timers
|
|
|
|
* on which it is operating cannot change in value.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1994-05-24 10:09:53 +00:00
|
|
|
itimerdecr(itp, usec)
|
|
|
|
register struct itimerval *itp;
|
|
|
|
int usec;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (itp->it_value.tv_usec < usec) {
|
|
|
|
if (itp->it_value.tv_sec == 0) {
|
|
|
|
/* expired, and already in next interval */
|
|
|
|
usec -= itp->it_value.tv_usec;
|
|
|
|
goto expire;
|
|
|
|
}
|
|
|
|
itp->it_value.tv_usec += 1000000;
|
|
|
|
itp->it_value.tv_sec--;
|
|
|
|
}
|
|
|
|
itp->it_value.tv_usec -= usec;
|
|
|
|
usec = 0;
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&itp->it_value))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (1);
|
|
|
|
/* expired, exactly at end of interval */
|
|
|
|
expire:
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&itp->it_interval)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
itp->it_value = itp->it_interval;
|
|
|
|
itp->it_value.tv_usec -= usec;
|
|
|
|
if (itp->it_value.tv_usec < 0) {
|
|
|
|
itp->it_value.tv_usec += 1000000;
|
|
|
|
itp->it_value.tv_sec--;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
itp->it_value.tv_usec = 0; /* sec is already 0 */
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add and subtract routines for timevals.
|
|
|
|
* N.B.: subtract routine doesn't deal with
|
|
|
|
* results which are before the beginning,
|
|
|
|
* it just gets very confused in this case.
|
|
|
|
* Caveat emptor.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
void
|
1994-05-24 10:09:53 +00:00
|
|
|
timevaladd(t1, t2)
|
|
|
|
struct timeval *t1, *t2;
|
|
|
|
{
|
|
|
|
|
|
|
|
t1->tv_sec += t2->tv_sec;
|
|
|
|
t1->tv_usec += t2->tv_usec;
|
|
|
|
timevalfix(t1);
|
|
|
|
}
|
|
|
|
|
1994-05-25 09:21:21 +00:00
|
|
|
void
|
1994-05-24 10:09:53 +00:00
|
|
|
timevalsub(t1, t2)
|
|
|
|
struct timeval *t1, *t2;
|
|
|
|
{
|
|
|
|
|
|
|
|
t1->tv_sec -= t2->tv_sec;
|
|
|
|
t1->tv_usec -= t2->tv_usec;
|
|
|
|
timevalfix(t1);
|
|
|
|
}
|
|
|
|
|
1995-12-14 08:32:45 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
timevalfix(t1)
|
|
|
|
struct timeval *t1;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (t1->tv_usec < 0) {
|
|
|
|
t1->tv_sec--;
|
|
|
|
t1->tv_usec += 1000000;
|
|
|
|
}
|
|
|
|
if (t1->tv_usec >= 1000000) {
|
|
|
|
t1->tv_sec++;
|
|
|
|
t1->tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
}
|