kern_time.c revision 1.9 1 1.9 cgd /* $NetBSD: kern_time.c,v 1.9 1994/06/29 06:32:48 cgd Exp $ */
2 1.9 cgd
3 1.1 cgd /*
4 1.8 cgd * Copyright (c) 1982, 1986, 1989, 1993
5 1.8 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd *
35 1.9 cgd * @(#)kern_time.c 8.1 (Berkeley) 6/10/93
36 1.1 cgd */
37 1.1 cgd
38 1.5 mycroft #include <sys/param.h>
39 1.5 mycroft #include <sys/resourcevar.h>
40 1.5 mycroft #include <sys/kernel.h>
41 1.8 cgd #include <sys/systm.h>
42 1.5 mycroft #include <sys/proc.h>
43 1.8 cgd #include <sys/vnode.h>
44 1.1 cgd
45 1.5 mycroft #include <machine/cpu.h>
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * Time of day and interval timer support.
49 1.1 cgd *
50 1.1 cgd * These routines provide the kernel entry points to get and set
51 1.1 cgd * the time-of-day and per-process interval timers. Subroutines
52 1.1 cgd * here provide support for adding and subtracting timeval structures
53 1.1 cgd * and decrementing interval timers, optionally reloading the interval
54 1.1 cgd * timers when they expire.
55 1.1 cgd */
56 1.1 cgd
57 1.4 cgd struct gettimeofday_args {
58 1.4 cgd struct timeval *tp;
59 1.4 cgd struct timezone *tzp;
60 1.4 cgd };
61 1.1 cgd /* ARGSUSED */
62 1.3 andrew int
63 1.1 cgd gettimeofday(p, uap, retval)
64 1.1 cgd struct proc *p;
65 1.4 cgd register struct gettimeofday_args *uap;
66 1.1 cgd int *retval;
67 1.1 cgd {
68 1.1 cgd struct timeval atv;
69 1.1 cgd int error = 0;
70 1.1 cgd
71 1.1 cgd if (uap->tp) {
72 1.1 cgd microtime(&atv);
73 1.1 cgd if (error = copyout((caddr_t)&atv, (caddr_t)uap->tp,
74 1.1 cgd sizeof (atv)))
75 1.1 cgd return (error);
76 1.1 cgd }
77 1.1 cgd if (uap->tzp)
78 1.1 cgd error = copyout((caddr_t)&tz, (caddr_t)uap->tzp,
79 1.1 cgd sizeof (tz));
80 1.1 cgd return (error);
81 1.1 cgd }
82 1.1 cgd
83 1.4 cgd struct settimeofday_args {
84 1.4 cgd struct timeval *tv;
85 1.4 cgd struct timezone *tzp;
86 1.4 cgd };
87 1.1 cgd /* ARGSUSED */
88 1.3 andrew int
89 1.1 cgd settimeofday(p, uap, retval)
90 1.1 cgd struct proc *p;
91 1.4 cgd struct settimeofday_args *uap;
92 1.1 cgd int *retval;
93 1.1 cgd {
94 1.8 cgd struct timeval atv, delta;
95 1.1 cgd struct timezone atz;
96 1.1 cgd int error, s;
97 1.1 cgd
98 1.1 cgd if (error = suser(p->p_ucred, &p->p_acflag))
99 1.1 cgd return (error);
100 1.8 cgd /* Verify all parameters before changing time. */
101 1.8 cgd if (uap->tv &&
102 1.8 cgd (error = copyin((caddr_t)uap->tv, (caddr_t)&atv, sizeof(atv))))
103 1.8 cgd return (error);
104 1.8 cgd if (uap->tzp &&
105 1.8 cgd (error = copyin((caddr_t)uap->tzp, (caddr_t)&atz, sizeof(atz))))
106 1.8 cgd return (error);
107 1.1 cgd if (uap->tv) {
108 1.1 cgd /* WHAT DO WE DO ABOUT PENDING REAL-TIME TIMEOUTS??? */
109 1.8 cgd s = splclock();
110 1.8 cgd /* nb. delta.tv_usec may be < 0, but this is OK here */
111 1.8 cgd delta.tv_sec = atv.tv_sec - time.tv_sec;
112 1.8 cgd delta.tv_usec = atv.tv_usec - time.tv_usec;
113 1.8 cgd time = atv;
114 1.8 cgd (void) splsoftclock();
115 1.8 cgd timevaladd(&boottime, &delta);
116 1.8 cgd timevalfix(&boottime);
117 1.8 cgd timevaladd(&runtime, &delta);
118 1.8 cgd timevalfix(&runtime);
119 1.8 cgd LEASE_UPDATETIME(delta.tv_sec);
120 1.8 cgd splx(s);
121 1.1 cgd resettodr();
122 1.1 cgd }
123 1.8 cgd if (uap->tzp)
124 1.1 cgd tz = atz;
125 1.8 cgd return (0);
126 1.1 cgd }
127 1.1 cgd
128 1.1 cgd extern int tickadj; /* "standard" clock skew, us./tick */
129 1.1 cgd int tickdelta; /* current clock skew, us. per tick */
130 1.1 cgd long timedelta; /* unapplied time correction, us. */
131 1.1 cgd long bigadj = 1000000; /* use 10x skew above bigadj us. */
132 1.1 cgd
133 1.4 cgd struct adjtime_args {
134 1.4 cgd struct timeval *delta;
135 1.4 cgd struct timeval *olddelta;
136 1.4 cgd };
137 1.1 cgd /* ARGSUSED */
138 1.3 andrew int
139 1.1 cgd adjtime(p, uap, retval)
140 1.1 cgd struct proc *p;
141 1.4 cgd register struct adjtime_args *uap;
142 1.1 cgd int *retval;
143 1.1 cgd {
144 1.8 cgd struct timeval atv;
145 1.8 cgd register long ndelta, ntickdelta, odelta;
146 1.1 cgd int s, error;
147 1.1 cgd
148 1.1 cgd if (error = suser(p->p_ucred, &p->p_acflag))
149 1.1 cgd return (error);
150 1.1 cgd if (error =
151 1.8 cgd copyin((caddr_t)uap->delta, (caddr_t)&atv, sizeof(struct timeval)))
152 1.1 cgd return (error);
153 1.8 cgd
154 1.8 cgd /*
155 1.8 cgd * Compute the total correction and the rate at which to apply it.
156 1.8 cgd * Round the adjustment down to a whole multiple of the per-tick
157 1.8 cgd * delta, so that after some number of incremental changes in
158 1.8 cgd * hardclock(), tickdelta will become zero, lest the correction
159 1.8 cgd * overshoot and start taking us away from the desired final time.
160 1.8 cgd */
161 1.1 cgd ndelta = atv.tv_sec * 1000000 + atv.tv_usec;
162 1.8 cgd if (ndelta > bigadj)
163 1.8 cgd ntickdelta = 10 * tickadj;
164 1.8 cgd else
165 1.8 cgd ntickdelta = tickadj;
166 1.8 cgd if (ndelta % ntickdelta)
167 1.8 cgd ndelta = ndelta / ntickdelta * ntickdelta;
168 1.8 cgd
169 1.8 cgd /*
170 1.8 cgd * To make hardclock()'s job easier, make the per-tick delta negative
171 1.8 cgd * if we want time to run slower; then hardclock can simply compute
172 1.8 cgd * tick + tickdelta, and subtract tickdelta from timedelta.
173 1.8 cgd */
174 1.8 cgd if (ndelta < 0)
175 1.8 cgd ntickdelta = -ntickdelta;
176 1.1 cgd s = splclock();
177 1.8 cgd odelta = timedelta;
178 1.1 cgd timedelta = ndelta;
179 1.8 cgd tickdelta = ntickdelta;
180 1.1 cgd splx(s);
181 1.1 cgd
182 1.8 cgd if (uap->olddelta) {
183 1.8 cgd atv.tv_sec = odelta / 1000000;
184 1.8 cgd atv.tv_usec = odelta % 1000000;
185 1.8 cgd (void) copyout((caddr_t)&atv, (caddr_t)uap->olddelta,
186 1.8 cgd sizeof(struct timeval));
187 1.8 cgd }
188 1.1 cgd return (0);
189 1.1 cgd }
190 1.1 cgd
191 1.1 cgd /*
192 1.1 cgd * Get value of an interval timer. The process virtual and
193 1.1 cgd * profiling virtual time timers are kept in the p_stats area, since
194 1.1 cgd * they can be swapped out. These are kept internally in the
195 1.1 cgd * way they are specified externally: in time until they expire.
196 1.1 cgd *
197 1.1 cgd * The real time interval timer is kept in the process table slot
198 1.1 cgd * for the process, and its value (it_value) is kept as an
199 1.1 cgd * absolute time rather than as a delta, so that it is easy to keep
200 1.1 cgd * periodic real-time signals from drifting.
201 1.1 cgd *
202 1.1 cgd * Virtual time timers are processed in the hardclock() routine of
203 1.1 cgd * kern_clock.c. The real time timer is processed by a timeout
204 1.1 cgd * routine, called from the softclock() routine. Since a callout
205 1.1 cgd * may be delayed in real time due to interrupt processing in the system,
206 1.1 cgd * it is possible for the real time timeout routine (realitexpire, given below),
207 1.1 cgd * to be delayed in real time past when it is supposed to occur. It
208 1.1 cgd * does not suffice, therefore, to reload the real timer .it_value from the
209 1.1 cgd * real time timers .it_interval. Rather, we compute the next time in
210 1.1 cgd * absolute time the timer should go off.
211 1.1 cgd */
212 1.4 cgd struct getitimer_args {
213 1.4 cgd u_int which;
214 1.4 cgd struct itimerval *itv;
215 1.4 cgd };
216 1.1 cgd /* ARGSUSED */
217 1.3 andrew int
218 1.1 cgd getitimer(p, uap, retval)
219 1.1 cgd struct proc *p;
220 1.4 cgd register struct getitimer_args *uap;
221 1.1 cgd int *retval;
222 1.1 cgd {
223 1.1 cgd struct itimerval aitv;
224 1.1 cgd int s;
225 1.1 cgd
226 1.1 cgd if (uap->which > ITIMER_PROF)
227 1.1 cgd return (EINVAL);
228 1.1 cgd s = splclock();
229 1.1 cgd if (uap->which == ITIMER_REAL) {
230 1.1 cgd /*
231 1.1 cgd * Convert from absoulte to relative time in .it_value
232 1.1 cgd * part of real time timer. If time for real time timer
233 1.1 cgd * has passed return 0, else return difference between
234 1.1 cgd * current time and time for the timer to go off.
235 1.1 cgd */
236 1.1 cgd aitv = p->p_realtimer;
237 1.1 cgd if (timerisset(&aitv.it_value))
238 1.1 cgd if (timercmp(&aitv.it_value, &time, <))
239 1.1 cgd timerclear(&aitv.it_value);
240 1.1 cgd else
241 1.6 cgd timevalsub(&aitv.it_value,
242 1.6 cgd (struct timeval *)&time);
243 1.1 cgd } else
244 1.1 cgd aitv = p->p_stats->p_timer[uap->which];
245 1.1 cgd splx(s);
246 1.1 cgd return (copyout((caddr_t)&aitv, (caddr_t)uap->itv,
247 1.1 cgd sizeof (struct itimerval)));
248 1.1 cgd }
249 1.1 cgd
250 1.4 cgd struct setitimer_args {
251 1.4 cgd u_int which;
252 1.4 cgd struct itimerval *itv, *oitv;
253 1.4 cgd };
254 1.1 cgd /* ARGSUSED */
255 1.3 andrew int
256 1.1 cgd setitimer(p, uap, retval)
257 1.1 cgd struct proc *p;
258 1.4 cgd register struct setitimer_args *uap;
259 1.1 cgd int *retval;
260 1.1 cgd {
261 1.1 cgd struct itimerval aitv;
262 1.1 cgd register struct itimerval *itvp;
263 1.1 cgd int s, error;
264 1.1 cgd
265 1.1 cgd if (uap->which > ITIMER_PROF)
266 1.1 cgd return (EINVAL);
267 1.1 cgd itvp = uap->itv;
268 1.1 cgd if (itvp && (error = copyin((caddr_t)itvp, (caddr_t)&aitv,
269 1.1 cgd sizeof(struct itimerval))))
270 1.1 cgd return (error);
271 1.1 cgd if ((uap->itv = uap->oitv) && (error = getitimer(p, uap, retval)))
272 1.1 cgd return (error);
273 1.1 cgd if (itvp == 0)
274 1.1 cgd return (0);
275 1.1 cgd if (itimerfix(&aitv.it_value) || itimerfix(&aitv.it_interval))
276 1.1 cgd return (EINVAL);
277 1.1 cgd s = splclock();
278 1.1 cgd if (uap->which == ITIMER_REAL) {
279 1.7 mycroft untimeout(realitexpire, p);
280 1.1 cgd if (timerisset(&aitv.it_value)) {
281 1.6 cgd timevaladd(&aitv.it_value, (struct timeval *)&time);
282 1.7 mycroft timeout(realitexpire, p, hzto(&aitv.it_value));
283 1.1 cgd }
284 1.1 cgd p->p_realtimer = aitv;
285 1.1 cgd } else
286 1.1 cgd p->p_stats->p_timer[uap->which] = aitv;
287 1.1 cgd splx(s);
288 1.1 cgd return (0);
289 1.1 cgd }
290 1.1 cgd
291 1.1 cgd /*
292 1.1 cgd * Real interval timer expired:
293 1.1 cgd * send process whose timer expired an alarm signal.
294 1.1 cgd * If time is not set up to reload, then just return.
295 1.1 cgd * Else compute next time timer should go off which is > current time.
296 1.1 cgd * This is where delay in processing this timeout causes multiple
297 1.1 cgd * SIGALRM calls to be compressed into one.
298 1.1 cgd */
299 1.3 andrew void
300 1.6 cgd realitexpire(arg)
301 1.6 cgd void *arg;
302 1.6 cgd {
303 1.1 cgd register struct proc *p;
304 1.1 cgd int s;
305 1.1 cgd
306 1.6 cgd p = (struct proc *)arg;
307 1.1 cgd psignal(p, SIGALRM);
308 1.1 cgd if (!timerisset(&p->p_realtimer.it_interval)) {
309 1.1 cgd timerclear(&p->p_realtimer.it_value);
310 1.1 cgd return;
311 1.1 cgd }
312 1.1 cgd for (;;) {
313 1.1 cgd s = splclock();
314 1.1 cgd timevaladd(&p->p_realtimer.it_value,
315 1.1 cgd &p->p_realtimer.it_interval);
316 1.1 cgd if (timercmp(&p->p_realtimer.it_value, &time, >)) {
317 1.7 mycroft timeout(realitexpire, p,
318 1.1 cgd hzto(&p->p_realtimer.it_value));
319 1.1 cgd splx(s);
320 1.1 cgd return;
321 1.1 cgd }
322 1.1 cgd splx(s);
323 1.1 cgd }
324 1.1 cgd }
325 1.1 cgd
326 1.1 cgd /*
327 1.1 cgd * Check that a proposed value to load into the .it_value or
328 1.1 cgd * .it_interval part of an interval timer is acceptable, and
329 1.1 cgd * fix it to have at least minimal value (i.e. if it is less
330 1.1 cgd * than the resolution of the clock, round it up.)
331 1.1 cgd */
332 1.3 andrew int
333 1.1 cgd itimerfix(tv)
334 1.1 cgd struct timeval *tv;
335 1.1 cgd {
336 1.1 cgd
337 1.1 cgd if (tv->tv_sec < 0 || tv->tv_sec > 100000000 ||
338 1.1 cgd tv->tv_usec < 0 || tv->tv_usec >= 1000000)
339 1.1 cgd return (EINVAL);
340 1.1 cgd if (tv->tv_sec == 0 && tv->tv_usec != 0 && tv->tv_usec < tick)
341 1.1 cgd tv->tv_usec = tick;
342 1.1 cgd return (0);
343 1.1 cgd }
344 1.1 cgd
345 1.1 cgd /*
346 1.1 cgd * Decrement an interval timer by a specified number
347 1.1 cgd * of microseconds, which must be less than a second,
348 1.1 cgd * i.e. < 1000000. If the timer expires, then reload
349 1.1 cgd * it. In this case, carry over (usec - old value) to
350 1.8 cgd * reduce the value reloaded into the timer so that
351 1.1 cgd * the timer does not drift. This routine assumes
352 1.1 cgd * that it is called in a context where the timers
353 1.1 cgd * on which it is operating cannot change in value.
354 1.1 cgd */
355 1.3 andrew int
356 1.1 cgd itimerdecr(itp, usec)
357 1.1 cgd register struct itimerval *itp;
358 1.1 cgd int usec;
359 1.1 cgd {
360 1.1 cgd
361 1.1 cgd if (itp->it_value.tv_usec < usec) {
362 1.1 cgd if (itp->it_value.tv_sec == 0) {
363 1.1 cgd /* expired, and already in next interval */
364 1.1 cgd usec -= itp->it_value.tv_usec;
365 1.1 cgd goto expire;
366 1.1 cgd }
367 1.1 cgd itp->it_value.tv_usec += 1000000;
368 1.1 cgd itp->it_value.tv_sec--;
369 1.1 cgd }
370 1.1 cgd itp->it_value.tv_usec -= usec;
371 1.1 cgd usec = 0;
372 1.1 cgd if (timerisset(&itp->it_value))
373 1.1 cgd return (1);
374 1.1 cgd /* expired, exactly at end of interval */
375 1.1 cgd expire:
376 1.1 cgd if (timerisset(&itp->it_interval)) {
377 1.1 cgd itp->it_value = itp->it_interval;
378 1.1 cgd itp->it_value.tv_usec -= usec;
379 1.1 cgd if (itp->it_value.tv_usec < 0) {
380 1.1 cgd itp->it_value.tv_usec += 1000000;
381 1.1 cgd itp->it_value.tv_sec--;
382 1.1 cgd }
383 1.1 cgd } else
384 1.1 cgd itp->it_value.tv_usec = 0; /* sec is already 0 */
385 1.1 cgd return (0);
386 1.1 cgd }
387 1.1 cgd
388 1.1 cgd /*
389 1.1 cgd * Add and subtract routines for timevals.
390 1.1 cgd * N.B.: subtract routine doesn't deal with
391 1.1 cgd * results which are before the beginning,
392 1.1 cgd * it just gets very confused in this case.
393 1.1 cgd * Caveat emptor.
394 1.1 cgd */
395 1.3 andrew void
396 1.1 cgd timevaladd(t1, t2)
397 1.1 cgd struct timeval *t1, *t2;
398 1.1 cgd {
399 1.1 cgd
400 1.1 cgd t1->tv_sec += t2->tv_sec;
401 1.1 cgd t1->tv_usec += t2->tv_usec;
402 1.1 cgd timevalfix(t1);
403 1.1 cgd }
404 1.1 cgd
405 1.3 andrew void
406 1.1 cgd timevalsub(t1, t2)
407 1.1 cgd struct timeval *t1, *t2;
408 1.1 cgd {
409 1.1 cgd
410 1.1 cgd t1->tv_sec -= t2->tv_sec;
411 1.1 cgd t1->tv_usec -= t2->tv_usec;
412 1.1 cgd timevalfix(t1);
413 1.1 cgd }
414 1.1 cgd
415 1.3 andrew void
416 1.1 cgd timevalfix(t1)
417 1.1 cgd struct timeval *t1;
418 1.1 cgd {
419 1.1 cgd
420 1.1 cgd if (t1->tv_usec < 0) {
421 1.1 cgd t1->tv_sec--;
422 1.1 cgd t1->tv_usec += 1000000;
423 1.1 cgd }
424 1.1 cgd if (t1->tv_usec >= 1000000) {
425 1.1 cgd t1->tv_sec++;
426 1.1 cgd t1->tv_usec -= 1000000;
427 1.1 cgd }
428 1.1 cgd }
429