2005-01-06 23:35:40 +00:00
|
|
|
/*-
|
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.
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
2003-06-11 00:56:59 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
2002-11-03 02:39:42 +00:00
|
|
|
#include "opt_mac.h"
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
1999-06-27 11:44:22 +00:00
|
|
|
#include <sys/systm.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
#include <sys/lock.h>
|
|
|
|
#include <sys/mutex.h>
|
1995-11-12 06:43:28 +00:00
|
|
|
#include <sys/sysproto.h>
|
2005-12-09 05:43:26 +00:00
|
|
|
#include <sys/eventhandler.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>
|
2002-11-03 02:39:42 +00:00
|
|
|
#include <sys/mac.h>
|
2005-01-19 18:09:50 +00:00
|
|
|
#include <sys/syscallsubr.h>
|
2005-12-01 07:56:15 +00:00
|
|
|
#include <sys/sysctl.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>
|
2005-10-23 04:22:56 +00:00
|
|
|
#include <sys/timers.h>
|
2000-03-20 14:09:06 +00:00
|
|
|
#include <sys/timetc.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/vnode.h>
|
2001-05-01 08:13:21 +00:00
|
|
|
|
2005-12-01 07:56:15 +00:00
|
|
|
#include <posix4/posix4.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
|
|
|
|
2005-10-23 04:22:56 +00:00
|
|
|
#define MAX_CLOCKS (CLOCK_MONOTONIC+1)
|
|
|
|
|
2003-02-03 19:49:35 +00:00
|
|
|
int tz_minuteswest;
|
|
|
|
int tz_dsttime;
|
1995-06-29 07:07:00 +00:00
|
|
|
|
2005-10-23 04:22:56 +00:00
|
|
|
static struct kclock posix_clocks[MAX_CLOCKS];
|
|
|
|
static uma_zone_t itimer_zone = NULL;
|
|
|
|
|
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.
|
|
|
|
*/
|
|
|
|
|
2002-04-10 04:09:07 +00:00
|
|
|
static int settime(struct thread *, struct timeval *);
|
2002-03-19 21:25:46 +00:00
|
|
|
static void timevalfix(struct timeval *);
|
|
|
|
static void no_lease_updatetime(int);
|
1997-05-08 14:16:25 +00:00
|
|
|
|
2005-10-23 04:22:56 +00:00
|
|
|
static void itimer_start(void);
|
|
|
|
static int itimer_init(void *, int, int);
|
|
|
|
static void itimer_fini(void *, int);
|
|
|
|
static void itimer_enter(struct itimer *);
|
|
|
|
static void itimer_leave(struct itimer *);
|
2006-03-01 06:29:34 +00:00
|
|
|
static struct itimer *itimer_find(struct proc *, int, int);
|
2005-10-23 04:22:56 +00:00
|
|
|
static void itimers_alloc(struct proc *);
|
2005-12-09 05:43:26 +00:00
|
|
|
static void itimers_event_hook(void *arg, struct proc *p);
|
2005-10-23 04:22:56 +00:00
|
|
|
static int realtimer_create(struct itimer *);
|
|
|
|
static int realtimer_gettime(struct itimer *, struct itimerspec *);
|
|
|
|
static int realtimer_settime(struct itimer *, int,
|
|
|
|
struct itimerspec *, struct itimerspec *);
|
|
|
|
static int realtimer_delete(struct itimer *);
|
2005-10-30 02:56:08 +00:00
|
|
|
static void realtimer_clocktime(clockid_t, struct timespec *);
|
2005-10-23 04:22:56 +00:00
|
|
|
static void realtimer_expire(void *);
|
|
|
|
static void realtimer_event_hook(struct proc *, clockid_t, int event);
|
|
|
|
static int kern_timer_create(struct thread *, clockid_t,
|
2006-03-01 06:29:34 +00:00
|
|
|
struct sigevent *, int *, int);
|
|
|
|
static int kern_timer_delete(struct thread *, int);
|
2005-10-23 04:22:56 +00:00
|
|
|
|
|
|
|
int register_posix_clock(int, struct kclock *);
|
|
|
|
void itimer_fire(struct itimer *it);
|
2005-10-30 02:56:08 +00:00
|
|
|
int itimespecfix(struct timespec *ts);
|
2005-10-23 04:22:56 +00:00
|
|
|
|
|
|
|
#define CLOCK_CALL(clock, call, arglist) \
|
|
|
|
((*posix_clocks[clock].call) arglist)
|
|
|
|
|
|
|
|
SYSINIT(posix_timer, SI_SUB_P1003_1B, SI_ORDER_FIRST+4, itimer_start, NULL);
|
|
|
|
|
|
|
|
|
1997-10-26 20:26:33 +00:00
|
|
|
static void
|
|
|
|
no_lease_updatetime(deltat)
|
|
|
|
int deltat;
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2002-03-19 21:25:46 +00:00
|
|
|
void (*lease_updatetime)(int) = no_lease_updatetime;
|
1997-10-26 20:26:33 +00:00
|
|
|
|
1997-05-08 14:16:25 +00:00
|
|
|
static int
|
2002-08-18 21:24:22 +00:00
|
|
|
settime(struct thread *td, struct timeval *tv)
|
1997-05-08 14:16:25 +00:00
|
|
|
{
|
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
|
|
|
*/
|
2002-04-10 04:09:07 +00:00
|
|
|
if (securelevel_gt(td->td_ucred, 1) != 0) {
|
1999-04-07 16:36:56 +00:00
|
|
|
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;
|
2002-04-10 04:09:07 +00:00
|
|
|
mtx_lock(&Giant);
|
2000-03-20 14:09:06 +00:00
|
|
|
tc_setclock(&ts);
|
1997-05-08 14:16:25 +00:00
|
|
|
(void) splsoftclock();
|
|
|
|
lease_updatetime(delta.tv_sec);
|
|
|
|
splx(s);
|
|
|
|
resettodr();
|
2002-04-10 04:09:07 +00:00
|
|
|
mtx_unlock(&Giant);
|
1997-05-08 14:16:25 +00:00
|
|
|
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
|
|
|
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1997-05-08 14:16:25 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
clock_gettime(struct thread *td, struct clock_gettime_args *uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
{
|
|
|
|
struct timespec ats;
|
2005-10-15 02:54:18 +00:00
|
|
|
int error;
|
|
|
|
|
|
|
|
error = kern_clock_gettime(td, uap->clock_id, &ats);
|
|
|
|
if (error == 0)
|
|
|
|
error = copyout(&ats, uap->tp, sizeof(ats));
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
kern_clock_gettime(struct thread *td, clockid_t clock_id, struct timespec *ats)
|
|
|
|
{
|
2004-06-21 22:34:57 +00:00
|
|
|
struct timeval sys, user;
|
2004-10-05 18:51:11 +00:00
|
|
|
struct proc *p;
|
1997-05-08 14:16:25 +00:00
|
|
|
|
2004-10-05 18:51:11 +00:00
|
|
|
p = td->td_proc;
|
2005-10-15 02:54:18 +00:00
|
|
|
switch (clock_id) {
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_REALTIME: /* Default to precise. */
|
|
|
|
case CLOCK_REALTIME_PRECISE:
|
2005-10-15 02:54:18 +00:00
|
|
|
nanotime(ats);
|
2004-06-17 23:12:12 +00:00
|
|
|
break;
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_REALTIME_FAST:
|
|
|
|
getnanotime(ats);
|
|
|
|
break;
|
2004-06-17 23:12:12 +00:00
|
|
|
case CLOCK_VIRTUAL:
|
2004-10-05 18:51:11 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
calcru(p, &user, &sys);
|
|
|
|
PROC_UNLOCK(p);
|
2005-10-15 02:54:18 +00:00
|
|
|
TIMEVAL_TO_TIMESPEC(&user, ats);
|
2004-06-17 23:12:12 +00:00
|
|
|
break;
|
|
|
|
case CLOCK_PROF:
|
2004-10-05 18:51:11 +00:00
|
|
|
PROC_LOCK(p);
|
|
|
|
calcru(p, &user, &sys);
|
|
|
|
PROC_UNLOCK(p);
|
2004-06-21 22:34:57 +00:00
|
|
|
timevaladd(&user, &sys);
|
2005-10-15 02:54:18 +00:00
|
|
|
TIMEVAL_TO_TIMESPEC(&user, ats);
|
2004-06-21 22:34:57 +00:00
|
|
|
break;
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_MONOTONIC: /* Default to precise. */
|
|
|
|
case CLOCK_MONOTONIC_PRECISE:
|
2005-11-18 16:51:13 +00:00
|
|
|
case CLOCK_UPTIME:
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_UPTIME_PRECISE:
|
2005-10-15 02:54:18 +00:00
|
|
|
nanouptime(ats);
|
2004-06-17 23:12:12 +00:00
|
|
|
break;
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_UPTIME_FAST:
|
|
|
|
case CLOCK_MONOTONIC_FAST:
|
|
|
|
getnanouptime(ats);
|
|
|
|
break;
|
|
|
|
case CLOCK_SECOND:
|
|
|
|
ats->tv_sec = time_second;
|
|
|
|
ats->tv_nsec = 0;
|
|
|
|
break;
|
2004-06-17 23:12:12 +00:00
|
|
|
default:
|
2003-02-23 13:45:55 +00:00
|
|
|
return (EINVAL);
|
2004-06-17 23:12:12 +00:00
|
|
|
}
|
2005-10-15 02:54:18 +00:00
|
|
|
return (0);
|
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
|
|
|
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1997-05-08 14:16:25 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
clock_settime(struct thread *td, struct clock_settime_args *uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
{
|
|
|
|
struct timespec ats;
|
|
|
|
int error;
|
|
|
|
|
2005-10-15 02:54:18 +00:00
|
|
|
if ((error = copyin(uap->tp, &ats, sizeof(ats))) != 0)
|
|
|
|
return (error);
|
|
|
|
return (kern_clock_settime(td, uap->clock_id, &ats));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
kern_clock_settime(struct thread *td, clockid_t clock_id, struct timespec *ats)
|
|
|
|
{
|
|
|
|
struct timeval atv;
|
|
|
|
int error;
|
|
|
|
|
2002-11-03 02:39:42 +00:00
|
|
|
#ifdef MAC
|
|
|
|
error = mac_check_system_settime(td->td_ucred);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
#endif
|
2002-04-01 21:31:13 +00:00
|
|
|
if ((error = suser(td)) != 0)
|
2002-04-10 04:09:07 +00:00
|
|
|
return (error);
|
2005-10-15 02:54:18 +00:00
|
|
|
if (clock_id != CLOCK_REALTIME)
|
2002-04-10 04:09:07 +00:00
|
|
|
return (EINVAL);
|
2005-10-15 02:54:18 +00:00
|
|
|
if (ats->tv_nsec < 0 || ats->tv_nsec >= 1000000000)
|
2002-04-10 04:09:07 +00:00
|
|
|
return (EINVAL);
|
1998-03-26 20:54:05 +00:00
|
|
|
/* XXX Don't convert nsec->usec and back */
|
2005-10-15 02:54:18 +00:00
|
|
|
TIMESPEC_TO_TIMEVAL(&atv, ats);
|
2002-04-10 04:09:07 +00:00
|
|
|
error = settime(td, &atv);
|
2001-09-01 18:19:21 +00:00
|
|
|
return (error);
|
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
|
2002-08-18 21:24:22 +00:00
|
|
|
clock_getres(struct thread *td, struct clock_getres_args *uap)
|
1997-05-08 14:16:25 +00:00
|
|
|
{
|
|
|
|
struct timespec ts;
|
2005-10-15 02:54:18 +00:00
|
|
|
int error;
|
1997-05-08 14:16:25 +00:00
|
|
|
|
2005-10-15 02:54:18 +00:00
|
|
|
if (uap->tp == NULL)
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
error = kern_clock_getres(td, uap->clock_id, &ts);
|
|
|
|
if (error == 0)
|
|
|
|
error = copyout(&ts, uap->tp, sizeof(ts));
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
kern_clock_getres(struct thread *td, clockid_t clock_id, struct timespec *ts)
|
|
|
|
{
|
|
|
|
|
|
|
|
ts->tv_sec = 0;
|
|
|
|
switch (clock_id) {
|
2004-06-17 23:12:12 +00:00
|
|
|
case CLOCK_REALTIME:
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_REALTIME_FAST:
|
|
|
|
case CLOCK_REALTIME_PRECISE:
|
2004-06-17 23:12:12 +00:00
|
|
|
case CLOCK_MONOTONIC:
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_MONOTONIC_FAST:
|
|
|
|
case CLOCK_MONOTONIC_PRECISE:
|
2005-11-18 16:51:13 +00:00
|
|
|
case CLOCK_UPTIME:
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_UPTIME_FAST:
|
|
|
|
case CLOCK_UPTIME_PRECISE:
|
2002-09-25 12:00:38 +00:00
|
|
|
/*
|
|
|
|
* Round up the result of the division cheaply by adding 1.
|
|
|
|
* Rounding up is especially important if rounding down
|
|
|
|
* would give 0. Perfect rounding is unimportant.
|
|
|
|
*/
|
2005-10-15 02:54:18 +00:00
|
|
|
ts->tv_nsec = 1000000000 / tc_getfrequency() + 1;
|
2004-06-17 23:12:12 +00:00
|
|
|
break;
|
|
|
|
case CLOCK_VIRTUAL:
|
|
|
|
case CLOCK_PROF:
|
|
|
|
/* Accurately round up here because we can do so cheaply. */
|
2005-10-15 02:54:18 +00:00
|
|
|
ts->tv_nsec = (1000000000 + hz - 1) / hz;
|
2004-06-17 23:12:12 +00:00
|
|
|
break;
|
Add several aliases for existing clockid_t names to indicate that the
application wishes to request high precision time stamps be returned:
Alias Existing
CLOCK_REALTIME_PRECISE CLOCK_REALTIME
CLOCK_MONOTONIC_PRECISE CLOCK_MONOTONIC
CLOCK_UPTIME_PRECISE CLOCK_UPTIME
Add experimental low-precision clockid_t names corresponding to these
clocks, but implemented using cached timestamps in kernel rather than
a full time counter query. This offers a minimum update rate of 1/HZ,
but in practice will often be more frequent due to the frequency of
time stamping in the kernel:
New clockid_t name Approximates existing clockid_t
CLOCK_REALTIME_FAST CLOCK_REALTIME
CLOCK_MONOTONIC_FAST CLOCK_MONOTONIC
CLOCK_UPTIME_FAST CLOCK_UPTIME
Add one additional new clockid_t, CLOCK_SECOND, which returns the
current second without performing a full time counter query or cache
lookup overhead to make sure the cached timestamp is stable. This is
intended to support very low granularity consumers, such as time(3).
The names, visibility, and implementation of the above are subject
to change, and will not be MFC'd any time soon. The goal is to
expose lower quality time measurement to applications willing to
sacrifice accuracy in performance critical paths, such as when taking
time stamps for the purpose of rescheduling select() and poll()
timeouts. Future changes might include retrofitting the time counter
infrastructure to allow the "fast" time query mechanisms to use a
different time counter, rather than a cached time counter (i.e.,
TSC).
NOTE: With different underlying time mechanisms exposed, using
different time query mechanisms in the same application may result in
relative non-monoticity or the appearance of clock stalling for a
single clockid_t, as a cached time stamp queried after a precision
time stamp lookup may be "before" the time returned by the earlier
live time counter query.
2005-11-27 00:55:18 +00:00
|
|
|
case CLOCK_SECOND:
|
|
|
|
ts->tv_sec = 1;
|
|
|
|
ts->tv_nsec = 0;
|
|
|
|
break;
|
2004-06-17 23:12:12 +00:00
|
|
|
default:
|
|
|
|
return (EINVAL);
|
1997-05-08 14:16:25 +00:00
|
|
|
}
|
2005-10-15 02:54:18 +00:00
|
|
|
return (0);
|
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
|
|
|
|
2005-01-19 17:44:59 +00:00
|
|
|
int
|
|
|
|
kern_nanosleep(struct thread *td, struct timespec *rqt, struct timespec *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
|
|
|
|
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1997-06-01 09:01:07 +00:00
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
nanosleep(struct thread *td, struct nanosleep_args *uap)
|
1997-06-01 09:01:07 +00:00
|
|
|
{
|
|
|
|
struct timespec rmt, rqt;
|
2001-09-01 18:19:21 +00:00
|
|
|
int error;
|
1997-06-01 09:01:07 +00:00
|
|
|
|
2002-12-14 01:56:26 +00:00
|
|
|
error = copyin(uap->rqtp, &rqt, sizeof(rqt));
|
1997-06-01 09:01:07 +00:00
|
|
|
if (error)
|
|
|
|
return (error);
|
2001-09-01 18:19:21 +00:00
|
|
|
|
2003-01-19 06:51:10 +00:00
|
|
|
if (uap->rmtp &&
|
|
|
|
!useracc((caddr_t)uap->rmtp, sizeof(rmt), VM_PROT_WRITE))
|
|
|
|
return (EFAULT);
|
2005-01-19 17:44:59 +00:00
|
|
|
error = kern_nanosleep(td, &rqt, &rmt);
|
2002-12-14 01:56:26 +00:00
|
|
|
if (error && uap->rmtp) {
|
2001-09-01 18:19:21 +00:00
|
|
|
int error2;
|
|
|
|
|
2002-12-14 01:56:26 +00:00
|
|
|
error2 = copyout(&rmt, uap->rmtp, sizeof(rmt));
|
2003-01-19 06:51:10 +00:00
|
|
|
if (error2)
|
2001-09-01 18:19:21 +00:00
|
|
|
error = error2;
|
1997-05-10 12:00:03 +00:00
|
|
|
}
|
|
|
|
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
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
gettimeofday(struct thread *td, struct gettimeofday_args *uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
struct timeval atv;
|
2003-02-03 14:47:22 +00:00
|
|
|
struct timezone rtz;
|
1994-05-24 10:09:53 +00:00
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
if (uap->tp) {
|
|
|
|
microtime(&atv);
|
2002-06-29 02:00:02 +00:00
|
|
|
error = copyout(&atv, uap->tp, sizeof (atv));
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2002-02-18 08:40:28 +00:00
|
|
|
if (error == 0 && uap->tzp != NULL) {
|
2003-02-03 19:49:35 +00:00
|
|
|
rtz.tz_minuteswest = tz_minuteswest;
|
|
|
|
rtz.tz_dsttime = tz_dsttime;
|
2003-02-03 14:47:22 +00:00
|
|
|
error = copyout(&rtz, uap->tzp, sizeof (rtz));
|
2001-09-01 18:19:21 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
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
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-24 10:09:53 +00:00
|
|
|
/* ARGSUSED */
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
settimeofday(struct thread *td, struct settimeofday_args *uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2005-03-31 22:51:18 +00:00
|
|
|
struct timeval atv, *tvp;
|
|
|
|
struct timezone atz, *tzp;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if (uap->tv) {
|
|
|
|
error = copyin(uap->tv, &atv, sizeof(atv));
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
tvp = &atv;
|
|
|
|
} else
|
|
|
|
tvp = NULL;
|
|
|
|
if (uap->tzp) {
|
|
|
|
error = copyin(uap->tzp, &atz, sizeof(atz));
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
tzp = &atz;
|
|
|
|
} else
|
|
|
|
tzp = NULL;
|
|
|
|
return (kern_settimeofday(td, tvp, tzp));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
kern_settimeofday(struct thread *td, struct timeval *tv, struct timezone *tzp)
|
|
|
|
{
|
|
|
|
int error;
|
2001-09-01 18:19:21 +00:00
|
|
|
|
2002-11-03 02:39:42 +00:00
|
|
|
#ifdef MAC
|
|
|
|
error = mac_check_system_settime(td->td_ucred);
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
#endif
|
2005-03-31 22:51:18 +00:00
|
|
|
error = suser(td);
|
|
|
|
if (error)
|
2002-04-10 04:09:07 +00:00
|
|
|
return (error);
|
1994-05-24 10:09:53 +00:00
|
|
|
/* Verify all parameters before changing time. */
|
2005-03-31 22:51:18 +00:00
|
|
|
if (tv) {
|
|
|
|
if (tv->tv_usec < 0 || tv->tv_usec >= 1000000)
|
2002-04-10 04:09:07 +00:00
|
|
|
return (EINVAL);
|
2005-03-31 22:51:18 +00:00
|
|
|
error = settime(td, tv);
|
1997-05-10 12:00:03 +00:00
|
|
|
}
|
2005-03-31 22:51:18 +00:00
|
|
|
if (tzp && error == 0) {
|
|
|
|
tz_minuteswest = tzp->tz_minuteswest;
|
|
|
|
tz_dsttime = tzp->tz_dsttime;
|
2002-04-10 04:09:07 +00:00
|
|
|
}
|
2001-09-01 18:19:21 +00:00
|
|
|
return (error);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2005-03-31 22:51:18 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* 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
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
getitimer(struct thread *td, struct getitimer_args *uap)
|
2005-01-25 21:28:28 +00:00
|
|
|
{
|
|
|
|
struct itimerval aitv;
|
2005-02-07 18:38:29 +00:00
|
|
|
int error;
|
2005-01-25 21:28:28 +00:00
|
|
|
|
|
|
|
error = kern_getitimer(td, uap->which, &aitv);
|
|
|
|
if (error != 0)
|
|
|
|
return (error);
|
|
|
|
return (copyout(&aitv, uap->itv, sizeof (struct itimerval)));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
kern_getitimer(struct thread *td, u_int which, struct itimerval *aitv)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-09-12 08:38:13 +00:00
|
|
|
struct proc *p = td->td_proc;
|
1998-03-30 09:56:58 +00:00
|
|
|
struct timeval ctv;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2005-01-25 21:28:28 +00:00
|
|
|
if (which > ITIMER_PROF)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (EINVAL);
|
2001-09-01 18:19:21 +00:00
|
|
|
|
2005-01-25 21:28:28 +00:00
|
|
|
if (which == ITIMER_REAL) {
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
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.
|
|
|
|
*/
|
2003-02-17 10:03:02 +00:00
|
|
|
PROC_LOCK(p);
|
2005-01-25 21:28:28 +00:00
|
|
|
*aitv = p->p_realtimer;
|
2003-02-17 10:03:02 +00:00
|
|
|
PROC_UNLOCK(p);
|
2005-01-25 21:28:28 +00:00
|
|
|
if (timevalisset(&aitv->it_value)) {
|
1998-05-17 11:53:46 +00:00
|
|
|
getmicrouptime(&ctv);
|
2005-01-25 21:28:28 +00:00
|
|
|
if (timevalcmp(&aitv->it_value, &ctv, <))
|
|
|
|
timevalclear(&aitv->it_value);
|
1994-05-24 10:09:53 +00:00
|
|
|
else
|
2005-01-25 21:28:28 +00:00
|
|
|
timevalsub(&aitv->it_value, &ctv);
|
1998-03-30 09:56:58 +00:00
|
|
|
}
|
2001-09-01 18:19:21 +00:00
|
|
|
} else {
|
2003-02-17 10:03:02 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2005-01-25 21:28:28 +00:00
|
|
|
*aitv = p->p_stats->p_timer[which];
|
2003-02-17 10:03:02 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
2001-09-01 18:19:21 +00:00
|
|
|
}
|
2005-01-25 21:28:28 +00:00
|
|
|
return (0);
|
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 setitimer_args {
|
|
|
|
u_int which;
|
|
|
|
struct itimerval *itv, *oitv;
|
|
|
|
};
|
1995-11-12 06:43:28 +00:00
|
|
|
#endif
|
2005-01-25 21:28:28 +00:00
|
|
|
|
2001-09-01 18:19:21 +00:00
|
|
|
/*
|
|
|
|
* MPSAFE
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
2002-08-18 21:24:22 +00:00
|
|
|
setitimer(struct thread *td, struct setitimer_args *uap)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2005-01-25 21:28:28 +00:00
|
|
|
struct itimerval aitv, oitv;
|
2005-02-07 18:38:29 +00:00
|
|
|
int error;
|
2003-02-17 10:03:02 +00:00
|
|
|
|
|
|
|
if (uap->itv == NULL) {
|
|
|
|
uap->itv = uap->oitv;
|
|
|
|
return (getitimer(td, (struct getitimer_args *)uap));
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-02-17 10:03:02 +00:00
|
|
|
if ((error = copyin(uap->itv, &aitv, sizeof(struct itimerval))))
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
2005-01-25 21:28:28 +00:00
|
|
|
error = kern_setitimer(td, uap->which, &aitv, &oitv);
|
|
|
|
if (error != 0 || uap->oitv == NULL)
|
|
|
|
return (error);
|
|
|
|
return (copyout(&oitv, uap->oitv, sizeof(struct itimerval)));
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2005-02-07 18:38:29 +00:00
|
|
|
kern_setitimer(struct thread *td, u_int which, struct itimerval *aitv,
|
|
|
|
struct itimerval *oitv)
|
2005-01-25 21:28:28 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct timeval ctv;
|
|
|
|
|
2005-02-07 21:45:48 +00:00
|
|
|
if (aitv == NULL)
|
|
|
|
return (kern_getitimer(td, which, oitv));
|
|
|
|
|
2005-01-25 21:28:28 +00:00
|
|
|
if (which > ITIMER_PROF)
|
2003-02-17 10:03:02 +00:00
|
|
|
return (EINVAL);
|
2005-01-25 21:28:28 +00:00
|
|
|
if (itimerfix(&aitv->it_value))
|
|
|
|
return (EINVAL);
|
|
|
|
if (!timevalisset(&aitv->it_value))
|
|
|
|
timevalclear(&aitv->it_interval);
|
|
|
|
else if (itimerfix(&aitv->it_interval))
|
2003-02-17 10:03:02 +00:00
|
|
|
return (EINVAL);
|
|
|
|
|
2005-01-25 21:28:28 +00:00
|
|
|
if (which == ITIMER_REAL) {
|
2003-02-17 10:03:02 +00:00
|
|
|
PROC_LOCK(p);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (timevalisset(&p->p_realtimer.it_value))
|
2000-11-27 22:52:31 +00:00
|
|
|
callout_stop(&p->p_itcallout);
|
2003-05-13 19:21:46 +00:00
|
|
|
getmicrouptime(&ctv);
|
2005-01-25 21:28:28 +00:00
|
|
|
if (timevalisset(&aitv->it_value)) {
|
|
|
|
callout_reset(&p->p_itcallout, tvtohz(&aitv->it_value),
|
2000-11-27 22:52:31 +00:00
|
|
|
realitexpire, p);
|
2005-01-25 21:28:28 +00:00
|
|
|
timevaladd(&aitv->it_value, &ctv);
|
2003-05-13 19:21:46 +00:00
|
|
|
}
|
2005-01-25 21:28:28 +00:00
|
|
|
*oitv = p->p_realtimer;
|
|
|
|
p->p_realtimer = *aitv;
|
2003-02-17 10:03:02 +00:00
|
|
|
PROC_UNLOCK(p);
|
2005-01-25 21:28:28 +00:00
|
|
|
if (timevalisset(&oitv->it_value)) {
|
|
|
|
if (timevalcmp(&oitv->it_value, &ctv, <))
|
|
|
|
timevalclear(&oitv->it_value);
|
2003-02-17 10:03:02 +00:00
|
|
|
else
|
2005-01-25 21:28:28 +00:00
|
|
|
timevalsub(&oitv->it_value, &ctv);
|
2003-02-17 10:03:02 +00:00
|
|
|
}
|
2001-09-01 18:19:21 +00:00
|
|
|
} else {
|
2003-02-17 10:03:02 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2005-01-25 21:28:28 +00:00
|
|
|
*oitv = p->p_stats->p_timer[which];
|
|
|
|
p->p_stats->p_timer[which] = *aitv;
|
2003-02-17 10:03:02 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
2001-09-01 18:19:21 +00:00
|
|
|
}
|
2005-01-25 21:28:28 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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
|
2002-08-18 21:24:22 +00:00
|
|
|
realitexpire(void *arg)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2002-08-18 21:24:22 +00:00
|
|
|
struct proc *p;
|
1998-04-05 11:49:36 +00:00
|
|
|
struct timeval ctv, ntv;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
p = (struct proc *)arg;
|
2001-03-07 03:02:56 +00:00
|
|
|
PROC_LOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
psignal(p, SIGALRM);
|
1998-04-06 08:26:08 +00:00
|
|
|
if (!timevalisset(&p->p_realtimer.it_interval)) {
|
|
|
|
timevalclear(&p->p_realtimer.it_value);
|
2003-06-09 21:46:22 +00:00
|
|
|
if (p->p_flag & P_WEXIT)
|
|
|
|
wakeup(&p->p_itcallout);
|
2001-03-07 03:02:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
for (;;) {
|
|
|
|
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);
|
2000-11-27 22:52:31 +00:00
|
|
|
callout_reset(&p->p_itcallout, tvtohz(&ntv) - 1,
|
|
|
|
realitexpire, p);
|
2001-03-07 03:02:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2001-03-07 03:02:56 +00:00
|
|
|
/*NOTREACHED*/
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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
|
2002-08-18 21:24:22 +00:00
|
|
|
itimerfix(struct timeval *tv)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
|
2005-10-23 04:22:56 +00:00
|
|
|
if (tv->tv_sec < 0 || tv->tv_usec < 0 || tv->tv_usec >= 1000000)
|
1994-05-24 10:09:53 +00:00
|
|
|
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
|
2002-08-18 21:24:22 +00:00
|
|
|
itimerdecr(struct itimerval *itp, int usec)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
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
|
2003-10-26 02:19:00 +00:00
|
|
|
timevaladd(struct timeval *t1, const struct timeval *t2)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
t1->tv_sec += t2->tv_sec;
|
|
|
|
t1->tv_usec += t2->tv_usec;
|
|
|
|
timevalfix(t1);
|
|
|
|
}
|
|
|
|
|
1994-05-25 09:21:21 +00:00
|
|
|
void
|
2003-10-26 02:19:00 +00:00
|
|
|
timevalsub(struct timeval *t1, const struct timeval *t2)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
t1->tv_sec -= t2->tv_sec;
|
|
|
|
t1->tv_usec -= t2->tv_usec;
|
|
|
|
timevalfix(t1);
|
|
|
|
}
|
|
|
|
|
1995-12-14 08:32:45 +00:00
|
|
|
static void
|
2002-08-18 21:24:22 +00:00
|
|
|
timevalfix(struct timeval *t1)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
if (t1->tv_usec < 0) {
|
|
|
|
t1->tv_sec--;
|
|
|
|
t1->tv_usec += 1000000;
|
|
|
|
}
|
|
|
|
if (t1->tv_usec >= 1000000) {
|
|
|
|
t1->tv_sec++;
|
|
|
|
t1->tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
}
|
2002-12-20 23:54:47 +00:00
|
|
|
|
|
|
|
/*
|
2002-12-31 18:22:12 +00:00
|
|
|
* ratecheck(): simple time-based rate-limit checking.
|
2002-12-20 23:54:47 +00:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
ratecheck(struct timeval *lasttime, const struct timeval *mininterval)
|
|
|
|
{
|
|
|
|
struct timeval tv, delta;
|
|
|
|
int rv = 0;
|
|
|
|
|
2002-12-31 18:22:12 +00:00
|
|
|
getmicrouptime(&tv); /* NB: 10ms precision */
|
|
|
|
delta = tv;
|
|
|
|
timevalsub(&delta, lasttime);
|
2002-12-20 23:54:47 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* check for 0,0 is so that the message will be seen at least once,
|
|
|
|
* even if interval is huge.
|
|
|
|
*/
|
|
|
|
if (timevalcmp(&delta, mininterval, >=) ||
|
|
|
|
(lasttime->tv_sec == 0 && lasttime->tv_usec == 0)) {
|
|
|
|
*lasttime = tv;
|
|
|
|
rv = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (rv);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ppsratecheck(): packets (or events) per second limitation.
|
2002-12-31 18:22:12 +00:00
|
|
|
*
|
|
|
|
* Return 0 if the limit is to be enforced (e.g. the caller
|
|
|
|
* should drop a packet because of the rate limitation).
|
|
|
|
*
|
2003-02-26 17:16:38 +00:00
|
|
|
* maxpps of 0 always causes zero to be returned. maxpps of -1
|
|
|
|
* always causes 1 to be returned; this effectively defeats rate
|
|
|
|
* limiting.
|
|
|
|
*
|
2002-12-31 18:22:12 +00:00
|
|
|
* Note that we maintain the struct timeval for compatibility
|
|
|
|
* with other bsd systems. We reuse the storage and just monitor
|
|
|
|
* clock ticks for minimal overhead.
|
2002-12-20 23:54:47 +00:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
ppsratecheck(struct timeval *lasttime, int *curpps, int maxpps)
|
|
|
|
{
|
2002-12-31 18:22:12 +00:00
|
|
|
int now;
|
2002-12-20 23:54:47 +00:00
|
|
|
|
|
|
|
/*
|
2002-12-31 18:22:12 +00:00
|
|
|
* Reset the last time and counter if this is the first call
|
|
|
|
* or more than a second has passed since the last update of
|
|
|
|
* lasttime.
|
2002-12-20 23:54:47 +00:00
|
|
|
*/
|
2002-12-31 18:22:12 +00:00
|
|
|
now = ticks;
|
|
|
|
if (lasttime->tv_sec == 0 || (u_int)(now - lasttime->tv_sec) >= hz) {
|
|
|
|
lasttime->tv_sec = now;
|
|
|
|
*curpps = 1;
|
2003-02-26 17:16:38 +00:00
|
|
|
return (maxpps != 0);
|
2002-12-31 18:22:12 +00:00
|
|
|
} else {
|
|
|
|
(*curpps)++; /* NB: ignore potential overflow */
|
|
|
|
return (maxpps < 0 || *curpps < maxpps);
|
|
|
|
}
|
2002-12-20 23:54:47 +00:00
|
|
|
}
|
2005-10-23 04:22:56 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
itimer_start(void)
|
|
|
|
{
|
|
|
|
struct kclock rt_clock = {
|
|
|
|
.timer_create = realtimer_create,
|
|
|
|
.timer_delete = realtimer_delete,
|
|
|
|
.timer_settime = realtimer_settime,
|
|
|
|
.timer_gettime = realtimer_gettime,
|
|
|
|
.event_hook = realtimer_event_hook
|
|
|
|
};
|
|
|
|
|
|
|
|
itimer_zone = uma_zcreate("itimer", sizeof(struct itimer),
|
|
|
|
NULL, NULL, itimer_init, itimer_fini, UMA_ALIGN_PTR, 0);
|
|
|
|
register_posix_clock(CLOCK_REALTIME, &rt_clock);
|
|
|
|
register_posix_clock(CLOCK_MONOTONIC, &rt_clock);
|
2005-12-01 07:56:15 +00:00
|
|
|
p31b_setcfg(CTL_P1003_1B_TIMERS, 200112L);
|
|
|
|
p31b_setcfg(CTL_P1003_1B_DELAYTIMER_MAX, INT_MAX);
|
|
|
|
p31b_setcfg(CTL_P1003_1B_TIMER_MAX, TIMER_MAX);
|
2005-12-09 05:43:26 +00:00
|
|
|
EVENTHANDLER_REGISTER(process_exit, itimers_event_hook,
|
|
|
|
(void *)ITIMER_EV_EXIT, EVENTHANDLER_PRI_ANY);
|
|
|
|
EVENTHANDLER_REGISTER(process_exec, itimers_event_hook,
|
|
|
|
(void *)ITIMER_EV_EXEC, EVENTHANDLER_PRI_ANY);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
register_posix_clock(int clockid, struct kclock *clk)
|
|
|
|
{
|
|
|
|
if ((unsigned)clockid >= MAX_CLOCKS) {
|
|
|
|
printf("%s: invalid clockid\n", __func__);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
posix_clocks[clockid] = *clk;
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
itimer_init(void *mem, int size, int flags)
|
|
|
|
{
|
|
|
|
struct itimer *it;
|
|
|
|
|
|
|
|
it = (struct itimer *)mem;
|
|
|
|
mtx_init(&it->it_mtx, "itimer lock", NULL, MTX_DEF);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
itimer_fini(void *mem, int size)
|
|
|
|
{
|
|
|
|
struct itimer *it;
|
|
|
|
|
|
|
|
it = (struct itimer *)mem;
|
|
|
|
mtx_destroy(&it->it_mtx);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
itimer_enter(struct itimer *it)
|
|
|
|
{
|
|
|
|
|
|
|
|
mtx_assert(&it->it_mtx, MA_OWNED);
|
|
|
|
it->it_usecount++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
itimer_leave(struct itimer *it)
|
|
|
|
{
|
|
|
|
|
|
|
|
mtx_assert(&it->it_mtx, MA_OWNED);
|
|
|
|
KASSERT(it->it_usecount > 0, ("invalid it_usecount"));
|
|
|
|
|
|
|
|
if (--it->it_usecount == 0 && (it->it_flags & ITF_WANTED) != 0)
|
|
|
|
wakeup(it);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
2006-03-01 06:29:34 +00:00
|
|
|
struct ktimer_create_args {
|
2005-10-23 04:22:56 +00:00
|
|
|
clockid_t clock_id;
|
|
|
|
struct sigevent * evp;
|
2006-03-01 06:29:34 +00:00
|
|
|
int * timerid;
|
2005-10-23 04:22:56 +00:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
ktimer_create(struct thread *td, struct ktimer_create_args *uap)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct sigevent *evp1, ev;
|
2006-03-01 06:29:34 +00:00
|
|
|
int id;
|
2005-10-23 04:22:56 +00:00
|
|
|
int error;
|
|
|
|
|
|
|
|
if (uap->evp != NULL) {
|
|
|
|
error = copyin(uap->evp, &ev, sizeof(ev));
|
|
|
|
if (error != 0)
|
|
|
|
return (error);
|
|
|
|
evp1 = &ev;
|
|
|
|
} else
|
|
|
|
evp1 = NULL;
|
|
|
|
|
|
|
|
error = kern_timer_create(td, uap->clock_id, evp1, &id, -1);
|
|
|
|
|
|
|
|
if (error == 0) {
|
2006-03-01 06:29:34 +00:00
|
|
|
error = copyout(&id, uap->timerid, sizeof(int));
|
2005-10-23 04:22:56 +00:00
|
|
|
if (error != 0)
|
|
|
|
kern_timer_delete(td, id);
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
kern_timer_create(struct thread *td, clockid_t clock_id,
|
2006-03-01 06:29:34 +00:00
|
|
|
struct sigevent *evp, int *timerid, int preset_id)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct itimer *it;
|
|
|
|
int id;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
if (clock_id < 0 || clock_id >= MAX_CLOCKS)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
if (posix_clocks[clock_id].timer_create == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
if (evp != NULL) {
|
|
|
|
if (evp->sigev_notify != SIGEV_NONE &&
|
2005-10-30 02:56:08 +00:00
|
|
|
evp->sigev_notify != SIGEV_SIGNAL &&
|
|
|
|
evp->sigev_notify != SIGEV_THREAD_ID)
|
2005-10-23 04:22:56 +00:00
|
|
|
return (EINVAL);
|
2005-10-30 02:56:08 +00:00
|
|
|
if ((evp->sigev_notify == SIGEV_SIGNAL ||
|
|
|
|
evp->sigev_notify == SIGEV_THREAD_ID) &&
|
2005-10-23 04:22:56 +00:00
|
|
|
!_SIG_VALID(evp->sigev_signo))
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
2005-10-23 12:19:08 +00:00
|
|
|
if (p->p_itimers == NULL)
|
2005-10-23 04:22:56 +00:00
|
|
|
itimers_alloc(p);
|
|
|
|
|
|
|
|
it = uma_zalloc(itimer_zone, M_WAITOK);
|
|
|
|
it->it_flags = 0;
|
|
|
|
it->it_usecount = 0;
|
|
|
|
it->it_active = 0;
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecclear(&it->it_time.it_value);
|
|
|
|
timespecclear(&it->it_time.it_interval);
|
2005-10-23 04:22:56 +00:00
|
|
|
it->it_overrun = 0;
|
|
|
|
it->it_overrun_last = 0;
|
|
|
|
it->it_clockid = clock_id;
|
|
|
|
it->it_timerid = -1;
|
|
|
|
it->it_proc = p;
|
|
|
|
ksiginfo_init(&it->it_ksi);
|
|
|
|
it->it_ksi.ksi_flags |= KSI_INS | KSI_EXT;
|
|
|
|
error = CLOCK_CALL(clock_id, timer_create, (it));
|
|
|
|
if (error != 0)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (preset_id != -1) {
|
|
|
|
KASSERT(preset_id >= 0 && preset_id < 3, ("invalid preset_id"));
|
|
|
|
id = preset_id;
|
2005-10-23 12:19:08 +00:00
|
|
|
if (p->p_itimers->its_timers[id] != NULL) {
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
|
|
|
error = 0;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Find a free timer slot, skipping those reserved
|
|
|
|
* for setitimer().
|
|
|
|
*/
|
|
|
|
for (id = 3; id < TIMER_MAX; id++)
|
2005-10-23 12:19:08 +00:00
|
|
|
if (p->p_itimers->its_timers[id] == NULL)
|
2005-10-23 04:22:56 +00:00
|
|
|
break;
|
|
|
|
if (id == TIMER_MAX) {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
error = EAGAIN;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
it->it_timerid = id;
|
2005-10-23 12:19:08 +00:00
|
|
|
p->p_itimers->its_timers[id] = it;
|
2005-10-23 04:22:56 +00:00
|
|
|
if (evp != NULL)
|
|
|
|
it->it_sigev = *evp;
|
|
|
|
else {
|
|
|
|
it->it_sigev.sigev_notify = SIGEV_SIGNAL;
|
|
|
|
switch (clock_id) {
|
|
|
|
default:
|
|
|
|
case CLOCK_REALTIME:
|
|
|
|
it->it_sigev.sigev_signo = SIGALRM;
|
|
|
|
break;
|
|
|
|
case CLOCK_VIRTUAL:
|
|
|
|
it->it_sigev.sigev_signo = SIGVTALRM;
|
|
|
|
break;
|
|
|
|
case CLOCK_PROF:
|
|
|
|
it->it_sigev.sigev_signo = SIGPROF;
|
|
|
|
break;
|
|
|
|
}
|
2005-11-04 09:41:00 +00:00
|
|
|
it->it_sigev.sigev_value.sival_int = id;
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
if (it->it_sigev.sigev_notify == SIGEV_SIGNAL ||
|
|
|
|
it->it_sigev.sigev_notify == SIGEV_THREAD_ID) {
|
2005-10-23 04:22:56 +00:00
|
|
|
it->it_ksi.ksi_signo = it->it_sigev.sigev_signo;
|
|
|
|
it->it_ksi.ksi_code = SI_TIMER;
|
|
|
|
it->it_ksi.ksi_value = it->it_sigev.sigev_value;
|
|
|
|
it->it_ksi.ksi_timerid = id;
|
|
|
|
}
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
*timerid = id;
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
out:
|
|
|
|
ITIMER_LOCK(it);
|
|
|
|
CLOCK_CALL(it->it_clockid, timer_delete, (it));
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
uma_zfree(itimer_zone, it);
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
2006-03-01 06:29:34 +00:00
|
|
|
struct ktimer_delete_args {
|
|
|
|
int timerid;
|
2005-10-23 04:22:56 +00:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
ktimer_delete(struct thread *td, struct ktimer_delete_args *uap)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
return (kern_timer_delete(td, uap->timerid));
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct itimer *
|
2006-03-01 06:29:34 +00:00
|
|
|
itimer_find(struct proc *p, int timerid, int include_deleting)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct itimer *it;
|
|
|
|
|
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
2005-10-23 12:19:08 +00:00
|
|
|
if ((p->p_itimers == NULL) || (timerid >= TIMER_MAX) ||
|
|
|
|
(it = p->p_itimers->its_timers[timerid]) == NULL) {
|
2005-10-23 04:22:56 +00:00
|
|
|
return (NULL);
|
|
|
|
}
|
|
|
|
ITIMER_LOCK(it);
|
|
|
|
if (!include_deleting && (it->it_flags & ITF_DELETING) != 0) {
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
it = NULL;
|
|
|
|
}
|
|
|
|
return (it);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2006-03-01 06:29:34 +00:00
|
|
|
kern_timer_delete(struct thread *td, int timerid)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct itimer *it;
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
it = itimer_find(p, timerid, 0);
|
|
|
|
if (it == NULL) {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
|
|
|
|
it->it_flags |= ITF_DELETING;
|
|
|
|
while (it->it_usecount > 0) {
|
|
|
|
it->it_flags |= ITF_WANTED;
|
|
|
|
msleep(it, &it->it_mtx, PPAUSE, "itimer", 0);
|
|
|
|
}
|
|
|
|
it->it_flags &= ~ITF_WANTED;
|
|
|
|
CLOCK_CALL(it->it_clockid, timer_delete, (it));
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (KSI_ONQ(&it->it_ksi))
|
|
|
|
sigqueue_take(&it->it_ksi);
|
2005-10-23 12:19:08 +00:00
|
|
|
p->p_itimers->its_timers[timerid] = NULL;
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
|
|
|
uma_zfree(itimer_zone, it);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
2006-03-01 06:29:34 +00:00
|
|
|
struct ktimer_settime_args {
|
|
|
|
int timerid;
|
2005-10-23 04:22:56 +00:00
|
|
|
int flags;
|
|
|
|
const struct itimerspec * value;
|
|
|
|
struct itimerspec * ovalue;
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
ktimer_settime(struct thread *td, struct ktimer_settime_args *uap)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct itimer *it;
|
|
|
|
struct itimerspec val, oval, *ovalp;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
error = copyin(uap->value, &val, sizeof(val));
|
|
|
|
if (error != 0)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
if (uap->ovalue != NULL)
|
|
|
|
ovalp = &oval;
|
|
|
|
else
|
|
|
|
ovalp = NULL;
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (uap->timerid < 3 ||
|
|
|
|
(it = itimer_find(p, uap->timerid, 0)) == NULL) {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
error = EINVAL;
|
|
|
|
} else {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
itimer_enter(it);
|
|
|
|
error = CLOCK_CALL(it->it_clockid, timer_settime,
|
|
|
|
(it, uap->flags, &val, ovalp));
|
|
|
|
itimer_leave(it);
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
}
|
|
|
|
if (error == 0 && uap->ovalue != NULL)
|
|
|
|
error = copyout(ovalp, uap->ovalue, sizeof(*ovalp));
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
2006-03-01 06:29:34 +00:00
|
|
|
struct ktimer_gettime_args {
|
|
|
|
int timerid;
|
2005-10-23 04:22:56 +00:00
|
|
|
struct itimerspec * value;
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
ktimer_gettime(struct thread *td, struct ktimer_gettime_args *uap)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct itimer *it;
|
|
|
|
struct itimerspec val;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (uap->timerid < 3 ||
|
|
|
|
(it = itimer_find(p, uap->timerid, 0)) == NULL) {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
error = EINVAL;
|
|
|
|
} else {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
itimer_enter(it);
|
|
|
|
error = CLOCK_CALL(it->it_clockid, timer_gettime,
|
|
|
|
(it, &val));
|
|
|
|
itimer_leave(it);
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
}
|
|
|
|
if (error == 0)
|
|
|
|
error = copyout(&val, uap->value, sizeof(val));
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
|
|
struct timer_getoverrun_args {
|
2006-03-01 06:29:34 +00:00
|
|
|
int timerid;
|
2005-10-23 04:22:56 +00:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
ktimer_getoverrun(struct thread *td, struct ktimer_getoverrun_args *uap)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct proc *p = td->td_proc;
|
|
|
|
struct itimer *it;
|
|
|
|
int error ;
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (uap->timerid < 3 ||
|
|
|
|
(it = itimer_find(p, uap->timerid, 0)) == NULL) {
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
error = EINVAL;
|
|
|
|
} else {
|
|
|
|
td->td_retval[0] = it->it_overrun_last;
|
|
|
|
ITIMER_UNLOCK(it);
|
2005-10-30 02:56:08 +00:00
|
|
|
PROC_UNLOCK(p);
|
2005-10-23 04:22:56 +00:00
|
|
|
error = 0;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
realtimer_create(struct itimer *it)
|
|
|
|
{
|
|
|
|
callout_init_mtx(&it->it_callout, &it->it_mtx, 0);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
realtimer_delete(struct itimer *it)
|
|
|
|
{
|
|
|
|
mtx_assert(&it->it_mtx, MA_OWNED);
|
|
|
|
callout_stop(&it->it_callout);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
realtimer_gettime(struct itimer *it, struct itimerspec *ovalue)
|
|
|
|
{
|
2005-10-30 02:56:08 +00:00
|
|
|
struct timespec cts;
|
2005-10-23 04:22:56 +00:00
|
|
|
|
|
|
|
mtx_assert(&it->it_mtx, MA_OWNED);
|
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
realtimer_clocktime(it->it_clockid, &cts);
|
|
|
|
*ovalue = it->it_time;
|
2005-10-23 04:22:56 +00:00
|
|
|
if (ovalue->it_value.tv_sec != 0 || ovalue->it_value.tv_nsec != 0) {
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecsub(&ovalue->it_value, &cts);
|
2005-10-23 04:22:56 +00:00
|
|
|
if (ovalue->it_value.tv_sec < 0 ||
|
|
|
|
(ovalue->it_value.tv_sec == 0 &&
|
|
|
|
ovalue->it_value.tv_nsec == 0)) {
|
|
|
|
ovalue->it_value.tv_sec = 0;
|
|
|
|
ovalue->it_value.tv_nsec = 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
realtimer_settime(struct itimer *it, int flags,
|
|
|
|
struct itimerspec *value, struct itimerspec *ovalue)
|
|
|
|
{
|
2005-10-30 02:56:08 +00:00
|
|
|
struct timespec cts, ts;
|
|
|
|
struct timeval tv;
|
|
|
|
struct itimerspec val;
|
2005-10-23 04:22:56 +00:00
|
|
|
|
|
|
|
mtx_assert(&it->it_mtx, MA_OWNED);
|
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
val = *value;
|
|
|
|
if (itimespecfix(&val.it_value))
|
2005-10-23 04:22:56 +00:00
|
|
|
return (EINVAL);
|
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
if (timespecisset(&val.it_value)) {
|
|
|
|
if (itimespecfix(&val.it_interval))
|
2005-10-23 04:22:56 +00:00
|
|
|
return (EINVAL);
|
|
|
|
} else {
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecclear(&val.it_interval);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ovalue != NULL)
|
|
|
|
realtimer_gettime(it, ovalue);
|
|
|
|
|
|
|
|
it->it_time = val;
|
2005-10-30 02:56:08 +00:00
|
|
|
if (timespecisset(&val.it_value)) {
|
|
|
|
realtimer_clocktime(it->it_clockid, &cts);
|
|
|
|
ts = val.it_value;
|
2005-10-23 04:22:56 +00:00
|
|
|
if ((flags & TIMER_ABSTIME) == 0) {
|
|
|
|
/* Convert to absolute time. */
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecadd(&it->it_time.it_value, &cts);
|
2005-10-23 04:22:56 +00:00
|
|
|
} else {
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecsub(&ts, &cts);
|
2005-10-23 04:22:56 +00:00
|
|
|
/*
|
2005-10-30 02:56:08 +00:00
|
|
|
* We don't care if ts is negative, tztohz will
|
2005-10-23 04:22:56 +00:00
|
|
|
* fix it.
|
|
|
|
*/
|
|
|
|
}
|
2005-10-30 02:56:08 +00:00
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, &ts);
|
|
|
|
callout_reset(&it->it_callout, tvtohz(&tv),
|
2005-10-23 04:22:56 +00:00
|
|
|
realtimer_expire, it);
|
|
|
|
} else {
|
|
|
|
callout_stop(&it->it_callout);
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2005-10-30 02:56:08 +00:00
|
|
|
realtimer_clocktime(clockid_t id, struct timespec *ts)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
if (id == CLOCK_REALTIME)
|
2005-10-30 02:56:08 +00:00
|
|
|
getnanotime(ts);
|
2005-10-23 04:22:56 +00:00
|
|
|
else /* CLOCK_MONOTONIC */
|
2005-10-30 02:56:08 +00:00
|
|
|
getnanouptime(ts);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
2006-03-01 06:29:34 +00:00
|
|
|
itimer_accept(struct proc *p, int timerid, ksiginfo_t *ksi)
|
2005-10-30 02:56:08 +00:00
|
|
|
{
|
|
|
|
struct itimer *it;
|
|
|
|
|
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
|
|
|
it = itimer_find(p, timerid, 0);
|
|
|
|
if (it != NULL) {
|
|
|
|
ksi->ksi_overrun = it->it_overrun;
|
|
|
|
it->it_overrun_last = it->it_overrun;
|
|
|
|
it->it_overrun = 0;
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
itimespecfix(struct timespec *ts)
|
|
|
|
{
|
|
|
|
|
|
|
|
if (ts->tv_sec < 0 || ts->tv_nsec < 0 || ts->tv_nsec >= 1000000000)
|
|
|
|
return (EINVAL);
|
|
|
|
if (ts->tv_sec == 0 && ts->tv_nsec != 0 && ts->tv_nsec < tick * 1000)
|
|
|
|
ts->tv_nsec = tick * 1000;
|
|
|
|
return (0);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
realtimer_event_hook(struct proc *p, clockid_t clock_id, int event)
|
|
|
|
{
|
|
|
|
struct itimers *its;
|
|
|
|
struct itimer *it;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Timer 0 (ITIMER_REAL) is XSI interval timer, according to POSIX
|
|
|
|
* specification, it should be inherited by new process image.
|
|
|
|
*/
|
|
|
|
if (event == ITIMER_EV_EXEC)
|
|
|
|
i = 1;
|
|
|
|
else
|
|
|
|
i = 0;
|
2005-10-23 12:19:08 +00:00
|
|
|
its = p->p_itimers;
|
2005-10-23 04:22:56 +00:00
|
|
|
for (; i < TIMER_MAX; i++) {
|
|
|
|
if ((it = its->its_timers[i]) != NULL &&
|
|
|
|
it->it_clockid == clock_id) {
|
|
|
|
ITIMER_LOCK(it);
|
|
|
|
callout_stop(&it->it_callout);
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Timeout callback for realtime timer */
|
|
|
|
static void
|
|
|
|
realtimer_expire(void *arg)
|
|
|
|
{
|
2005-10-30 02:56:08 +00:00
|
|
|
struct timespec cts, ts;
|
|
|
|
struct timeval tv;
|
2005-10-23 04:22:56 +00:00
|
|
|
struct itimer *it;
|
|
|
|
struct proc *p;
|
|
|
|
|
|
|
|
it = (struct itimer *)arg;
|
|
|
|
p = it->it_proc;
|
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
realtimer_clocktime(it->it_clockid, &cts);
|
2005-10-23 04:22:56 +00:00
|
|
|
/* Only fire if time is reached. */
|
2005-10-30 02:56:08 +00:00
|
|
|
if (timespeccmp(&cts, &it->it_time.it_value, >=)) {
|
|
|
|
if (timespecisset(&it->it_time.it_interval)) {
|
|
|
|
timespecadd(&it->it_time.it_value,
|
|
|
|
&it->it_time.it_interval);
|
|
|
|
while (timespeccmp(&cts, &it->it_time.it_value, >=)) {
|
2005-12-01 07:56:15 +00:00
|
|
|
if (it->it_overrun < INT_MAX)
|
|
|
|
it->it_overrun++;
|
|
|
|
else
|
|
|
|
it->it_ksi.ksi_errno = ERANGE;
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecadd(&it->it_time.it_value,
|
|
|
|
&it->it_time.it_interval);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* single shot timer ? */
|
2005-10-30 02:56:08 +00:00
|
|
|
timespecclear(&it->it_time.it_value);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
2005-10-30 02:56:08 +00:00
|
|
|
if (timespecisset(&it->it_time.it_value)) {
|
|
|
|
ts = it->it_time.it_value;
|
|
|
|
timespecsub(&ts, &cts);
|
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, &ts);
|
|
|
|
callout_reset(&it->it_callout, tvtohz(&tv),
|
2005-10-23 04:22:56 +00:00
|
|
|
realtimer_expire, it);
|
|
|
|
}
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
itimer_fire(it);
|
|
|
|
ITIMER_LOCK(it);
|
2005-10-30 02:56:08 +00:00
|
|
|
} else if (timespecisset(&it->it_time.it_value)) {
|
|
|
|
ts = it->it_time.it_value;
|
|
|
|
timespecsub(&ts, &cts);
|
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, &ts);
|
|
|
|
callout_reset(&it->it_callout, tvtohz(&tv), realtimer_expire,
|
2005-10-23 04:22:56 +00:00
|
|
|
it);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
itimer_fire(struct itimer *it)
|
|
|
|
{
|
|
|
|
struct proc *p = it->it_proc;
|
2005-11-03 04:49:16 +00:00
|
|
|
int ret;
|
2005-10-23 04:22:56 +00:00
|
|
|
|
2005-10-30 02:56:08 +00:00
|
|
|
if (it->it_sigev.sigev_notify == SIGEV_SIGNAL ||
|
|
|
|
it->it_sigev.sigev_notify == SIGEV_THREAD_ID) {
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_LOCK(p);
|
2005-11-03 04:49:16 +00:00
|
|
|
if (!KSI_ONQ(&it->it_ksi)) {
|
2005-12-01 07:56:15 +00:00
|
|
|
it->it_ksi.ksi_errno = 0;
|
2005-11-03 04:49:16 +00:00
|
|
|
ret = psignal_event(p, &it->it_sigev, &it->it_ksi);
|
|
|
|
if (__predict_false(ret != 0)) {
|
|
|
|
it->it_overrun++;
|
|
|
|
/*
|
|
|
|
* Broken userland code, thread went
|
|
|
|
* away, disarm the timer.
|
2005-10-30 02:56:08 +00:00
|
|
|
*/
|
2005-11-03 04:49:16 +00:00
|
|
|
if (ret == ESRCH) {
|
2005-10-30 02:56:08 +00:00
|
|
|
ITIMER_LOCK(it);
|
|
|
|
timespecclear(&it->it_time.it_value);
|
|
|
|
timespecclear(&it->it_time.it_interval);
|
|
|
|
callout_stop(&it->it_callout);
|
|
|
|
ITIMER_UNLOCK(it);
|
|
|
|
}
|
|
|
|
}
|
2005-11-03 04:49:16 +00:00
|
|
|
} else {
|
2005-12-01 07:56:15 +00:00
|
|
|
if (it->it_overrun < INT_MAX)
|
|
|
|
it->it_overrun++;
|
|
|
|
else
|
|
|
|
it->it_ksi.ksi_errno = ERANGE;
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
itimers_alloc(struct proc *p)
|
|
|
|
{
|
2005-10-23 12:19:08 +00:00
|
|
|
struct itimers *its;
|
|
|
|
int i;
|
2005-10-23 04:22:56 +00:00
|
|
|
|
2005-10-23 12:19:08 +00:00
|
|
|
its = malloc(sizeof (struct itimers), M_SUBPROC, M_WAITOK | M_ZERO);
|
|
|
|
LIST_INIT(&its->its_virtual);
|
|
|
|
LIST_INIT(&its->its_prof);
|
|
|
|
TAILQ_INIT(&its->its_worklist);
|
|
|
|
for (i = 0; i < TIMER_MAX; i++)
|
|
|
|
its->its_timers[i] = NULL;
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_LOCK(p);
|
2005-10-23 12:19:08 +00:00
|
|
|
if (p->p_itimers == NULL) {
|
|
|
|
p->p_itimers = its;
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
2005-10-23 12:19:08 +00:00
|
|
|
}
|
|
|
|
else {
|
2005-10-23 04:22:56 +00:00
|
|
|
PROC_UNLOCK(p);
|
2005-10-23 12:19:08 +00:00
|
|
|
free(its, M_SUBPROC);
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clean up timers when some process events are being triggered. */
|
2005-12-09 05:43:26 +00:00
|
|
|
static void
|
|
|
|
itimers_event_hook(void *arg, struct proc *p)
|
2005-10-23 04:22:56 +00:00
|
|
|
{
|
|
|
|
struct itimers *its;
|
|
|
|
struct itimer *it;
|
2005-12-09 13:16:48 +00:00
|
|
|
int event = (int)(intptr_t)arg;
|
2005-10-23 04:22:56 +00:00
|
|
|
int i;
|
|
|
|
|
2005-10-23 12:19:08 +00:00
|
|
|
if (p->p_itimers != NULL) {
|
|
|
|
its = p->p_itimers;
|
2005-10-23 04:22:56 +00:00
|
|
|
for (i = 0; i < MAX_CLOCKS; ++i) {
|
|
|
|
if (posix_clocks[i].event_hook != NULL)
|
|
|
|
CLOCK_CALL(i, event_hook, (p, i, event));
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* According to susv3, XSI interval timers should be inherited
|
|
|
|
* by new image.
|
|
|
|
*/
|
|
|
|
if (event == ITIMER_EV_EXEC)
|
|
|
|
i = 3;
|
|
|
|
else if (event == ITIMER_EV_EXIT)
|
|
|
|
i = 0;
|
|
|
|
else
|
|
|
|
panic("unhandled event");
|
|
|
|
for (; i < TIMER_MAX; ++i) {
|
|
|
|
if ((it = its->its_timers[i]) != NULL) {
|
|
|
|
PROC_LOCK(p);
|
|
|
|
if (KSI_ONQ(&it->it_ksi))
|
|
|
|
sigqueue_take(&it->it_ksi);
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
uma_zfree(itimer_zone, its->its_timers[i]);
|
|
|
|
its->its_timers[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (its->its_timers[0] == NULL &&
|
|
|
|
its->its_timers[1] == NULL &&
|
|
|
|
its->its_timers[2] == NULL) {
|
2005-10-23 12:19:08 +00:00
|
|
|
free(its, M_SUBPROC);
|
|
|
|
p->p_itimers = NULL;
|
2005-10-23 04:22:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|