2 * Copyright (c) 2003,2004 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * Copyright (c) 1997, 1998 Poul-Henning Kamp <phk@FreeBSD.org>
35 * Copyright (c) 1982, 1986, 1991, 1993
36 * The Regents of the University of California. All rights reserved.
37 * (c) UNIX System Laboratories, Inc.
38 * All or some portions of this file are derived from material licensed
39 * to the University of California by American Telephone and Telegraph
40 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
41 * the permission of UNIX System Laboratories, Inc.
43 * Redistribution and use in source and binary forms, with or without
44 * modification, are permitted provided that the following conditions
46 * 1. Redistributions of source code must retain the above copyright
47 * notice, this list of conditions and the following disclaimer.
48 * 2. Redistributions in binary form must reproduce the above copyright
49 * notice, this list of conditions and the following disclaimer in the
50 * documentation and/or other materials provided with the distribution.
51 * 3. All advertising materials mentioning features or use of this software
52 * must display the following acknowledgement:
53 * This product includes software developed by the University of
54 * California, Berkeley and its contributors.
55 * 4. Neither the name of the University nor the names of its contributors
56 * may be used to endorse or promote products derived from this software
57 * without specific prior written permission.
59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
71 * @(#)kern_clock.c 8.5 (Berkeley) 1/21/94
72 * $FreeBSD: src/sys/kern/kern_clock.c,v 1.105.2.10 2002/10/17 13:19:40 maxim Exp $
73 * $DragonFly: src/sys/kern/kern_clock.c,v 1.62 2008/09/09 04:06:13 dillon Exp $
77 #include "opt_polling.h"
78 #include "opt_ifpoll.h"
79 #include "opt_pctrack.h"
81 #include <sys/param.h>
82 #include <sys/systm.h>
83 #include <sys/callout.h>
84 #include <sys/kernel.h>
85 #include <sys/kinfo.h>
87 #include <sys/malloc.h>
88 #include <sys/resource.h>
89 #include <sys/resourcevar.h>
90 #include <sys/signalvar.h>
91 #include <sys/timex.h>
92 #include <sys/timepps.h>
96 #include <vm/vm_map.h>
97 #include <vm/vm_extern.h>
98 #include <sys/sysctl.h>
100 #include <sys/thread2.h>
102 #include <machine/cpu.h>
103 #include <machine/limits.h>
104 #include <machine/smp.h>
105 #include <machine/cpufunc.h>
106 #include <machine/specialreg.h>
107 #include <machine/clock.h>
110 #include <sys/gmon.h>
113 #ifdef DEVICE_POLLING
114 extern void init_device_poll_pcpu(int);
118 extern void ifpoll_init_pcpu(int);
122 static void do_pctrack(struct intrframe *frame, int which);
125 static void initclocks (void *dummy);
126 SYSINIT(clocks, SI_BOOT2_CLOCKS, SI_ORDER_FIRST, initclocks, NULL)
129 * Some of these don't belong here, but it's easiest to concentrate them.
130 * Note that cpu_time counts in microseconds, but most userland programs
131 * just compare relative times against the total by delta.
133 struct kinfo_cputime cputime_percpu[MAXCPU];
135 struct kinfo_pcheader cputime_pcheader = { PCTRACK_SIZE, PCTRACK_ARYSIZE };
136 struct kinfo_pctrack cputime_pctrack[MAXCPU][PCTRACK_SIZE];
141 sysctl_cputime(SYSCTL_HANDLER_ARGS)
144 size_t size = sizeof(struct kinfo_cputime);
146 for (cpu = 0; cpu < ncpus; ++cpu) {
147 if ((error = SYSCTL_OUT(req, &cputime_percpu[cpu], size)))
153 SYSCTL_PROC(_kern, OID_AUTO, cputime, (CTLTYPE_OPAQUE|CTLFLAG_RD), 0, 0,
154 sysctl_cputime, "S,kinfo_cputime", "CPU time statistics");
156 SYSCTL_STRUCT(_kern, OID_AUTO, cputime, CTLFLAG_RD, &cpu_time, kinfo_cputime,
157 "CPU time statistics");
161 sysctl_cp_time(SYSCTL_HANDLER_ARGS)
163 long cpu_states[5] = {0};
165 size_t size = sizeof(cpu_states);
167 for (cpu = 0; cpu < ncpus; ++cpu) {
168 cpu_states[CP_USER] += cputime_percpu[cpu].cp_user;
169 cpu_states[CP_NICE] += cputime_percpu[cpu].cp_nice;
170 cpu_states[CP_SYS] += cputime_percpu[cpu].cp_sys;
171 cpu_states[CP_INTR] += cputime_percpu[cpu].cp_intr;
172 cpu_states[CP_IDLE] += cputime_percpu[cpu].cp_idle;
175 error = SYSCTL_OUT(req, cpu_states, size);
180 SYSCTL_PROC(_kern, OID_AUTO, cp_time, (CTLTYPE_LONG|CTLFLAG_RD), 0, 0,
181 sysctl_cp_time, "LU", "CPU time statistics");
184 * boottime is used to calculate the 'real' uptime. Do not confuse this with
185 * microuptime(). microtime() is not drift compensated. The real uptime
186 * with compensation is nanotime() - bootime. boottime is recalculated
187 * whenever the real time is set based on the compensated elapsed time
188 * in seconds (gd->gd_time_seconds).
190 * The gd_time_seconds and gd_cpuclock_base fields remain fairly monotonic.
191 * Slight adjustments to gd_cpuclock_base are made to phase-lock it to
194 struct timespec boottime; /* boot time (realtime) for reference only */
195 time_t time_second; /* read-only 'passive' uptime in seconds */
198 * basetime is used to calculate the compensated real time of day. The
199 * basetime can be modified on a per-tick basis by the adjtime(),
200 * ntp_adjtime(), and sysctl-based time correction APIs.
202 * Note that frequency corrections can also be made by adjusting
205 * basetime is a tail-chasing FIFO, updated only by cpu #0. The FIFO is
206 * used on both SMP and UP systems to avoid MP races between cpu's and
207 * interrupt races on UP systems.
209 #define BASETIME_ARYSIZE 16
210 #define BASETIME_ARYMASK (BASETIME_ARYSIZE - 1)
211 static struct timespec basetime[BASETIME_ARYSIZE];
212 static volatile int basetime_index;
215 sysctl_get_basetime(SYSCTL_HANDLER_ARGS)
222 * Because basetime data and index may be updated by another cpu,
223 * a load fence is required to ensure that the data we read has
224 * not been speculatively read relative to a possibly updated index.
226 index = basetime_index;
228 bt = &basetime[index];
229 error = SYSCTL_OUT(req, bt, sizeof(*bt));
233 SYSCTL_STRUCT(_kern, KERN_BOOTTIME, boottime, CTLFLAG_RD,
234 &boottime, timespec, "System boottime");
235 SYSCTL_PROC(_kern, OID_AUTO, basetime, CTLTYPE_STRUCT|CTLFLAG_RD, 0, 0,
236 sysctl_get_basetime, "S,timespec", "System basetime");
238 static void hardclock(systimer_t info, int, struct intrframe *frame);
239 static void statclock(systimer_t info, int, struct intrframe *frame);
240 static void schedclock(systimer_t info, int, struct intrframe *frame);
241 static void getnanotime_nbt(struct timespec *nbt, struct timespec *tsp);
243 int ticks; /* system master ticks at hz */
244 int clocks_running; /* tsleep/timeout clocks operational */
245 int64_t nsec_adj; /* ntpd per-tick adjustment in nsec << 32 */
246 int64_t nsec_acc; /* accumulator */
247 int sched_ticks; /* global schedule clock ticks */
249 /* NTPD time correction fields */
250 int64_t ntp_tick_permanent; /* per-tick adjustment in nsec << 32 */
251 int64_t ntp_tick_acc; /* accumulator for per-tick adjustment */
252 int64_t ntp_delta; /* one-time correction in nsec */
253 int64_t ntp_big_delta = 1000000000;
254 int32_t ntp_tick_delta; /* current adjustment rate */
255 int32_t ntp_default_tick_delta; /* adjustment rate for ntp_delta */
256 time_t ntp_leap_second; /* time of next leap second */
257 int ntp_leap_insert; /* whether to insert or remove a second */
260 * Finish initializing clock frequencies and start all clocks running.
264 initclocks(void *dummy)
266 /*psratio = profhz / stathz;*/
272 * Called on a per-cpu basis
275 initclocks_pcpu(void)
277 struct globaldata *gd = mycpu;
280 if (gd->gd_cpuid == 0) {
281 gd->gd_time_seconds = 1;
282 gd->gd_cpuclock_base = sys_cputimer->count();
285 gd->gd_time_seconds = globaldata_find(0)->gd_time_seconds;
286 gd->gd_cpuclock_base = globaldata_find(0)->gd_cpuclock_base;
289 systimer_intr_enable();
291 #ifdef DEVICE_POLLING
292 init_device_poll_pcpu(gd->gd_cpuid);
296 ifpoll_init_pcpu(gd->gd_cpuid);
300 * Use a non-queued periodic systimer to prevent multiple ticks from
301 * building up if the sysclock jumps forward (8254 gets reset). The
302 * sysclock will never jump backwards. Our time sync is based on
303 * the actual sysclock, not the ticks count.
305 systimer_init_periodic_nq(&gd->gd_hardclock, hardclock, NULL, hz);
306 systimer_init_periodic_nq(&gd->gd_statclock, statclock, NULL, stathz);
307 /* XXX correct the frequency for scheduler / estcpu tests */
308 systimer_init_periodic_nq(&gd->gd_schedclock, schedclock,
314 * This sets the current real time of day. Timespecs are in seconds and
315 * nanoseconds. We do not mess with gd_time_seconds and gd_cpuclock_base,
316 * instead we adjust basetime so basetime + gd_* results in the current
317 * time of day. This way the gd_* fields are guarenteed to represent
318 * a monotonically increasing 'uptime' value.
320 * When set_timeofday() is called from userland, the system call forces it
321 * onto cpu #0 since only cpu #0 can update basetime_index.
324 set_timeofday(struct timespec *ts)
326 struct timespec *nbt;
330 * XXX SMP / non-atomic basetime updates
333 ni = (basetime_index + 1) & BASETIME_ARYMASK;
336 nbt->tv_sec = ts->tv_sec - nbt->tv_sec;
337 nbt->tv_nsec = ts->tv_nsec - nbt->tv_nsec;
338 if (nbt->tv_nsec < 0) {
339 nbt->tv_nsec += 1000000000;
344 * Note that basetime diverges from boottime as the clock drift is
345 * compensated for, so we cannot do away with boottime. When setting
346 * the absolute time of day the drift is 0 (for an instant) and we
347 * can simply assign boottime to basetime.
349 * Note that nanouptime() is based on gd_time_seconds which is drift
350 * compensated up to a point (it is guarenteed to remain monotonically
351 * increasing). gd_time_seconds is thus our best uptime guess and
352 * suitable for use in the boottime calculation. It is already taken
353 * into account in the basetime calculation above.
355 boottime.tv_sec = nbt->tv_sec;
359 * We now have a new basetime, make sure all other cpus have it,
360 * then update the index.
369 * Each cpu has its own hardclock, but we only increments ticks and softticks
372 * NOTE! systimer! the MP lock might not be held here. We can only safely
373 * manipulate objects owned by the current cpu.
376 hardclock(systimer_t info, int in_ipi __unused, struct intrframe *frame)
380 struct globaldata *gd = mycpu;
383 * Realtime updates are per-cpu. Note that timer corrections as
384 * returned by microtime() and friends make an additional adjustment
385 * using a system-wise 'basetime', but the running time is always
386 * taken from the per-cpu globaldata area. Since the same clock
387 * is distributing (XXX SMP) to all cpus, the per-cpu timebases
390 * Note that we never allow info->time (aka gd->gd_hardclock.time)
391 * to reverse index gd_cpuclock_base, but that it is possible for
392 * it to temporarily get behind in the seconds if something in the
393 * system locks interrupts for a long period of time. Since periodic
394 * timers count events, though everything should resynch again
397 cputicks = info->time - gd->gd_cpuclock_base;
398 if (cputicks >= sys_cputimer->freq) {
399 ++gd->gd_time_seconds;
400 gd->gd_cpuclock_base += sys_cputimer->freq;
404 * The system-wide ticks counter and NTP related timedelta/tickdelta
405 * adjustments only occur on cpu #0. NTP adjustments are accomplished
406 * by updating basetime.
408 if (gd->gd_cpuid == 0) {
409 struct timespec *nbt;
417 if (tco->tc_poll_pps)
418 tco->tc_poll_pps(tco);
422 * Calculate the new basetime index. We are in a critical section
423 * on cpu #0 and can safely play with basetime_index. Start
424 * with the current basetime and then make adjustments.
426 ni = (basetime_index + 1) & BASETIME_ARYMASK;
428 *nbt = basetime[basetime_index];
431 * Apply adjtime corrections. (adjtime() API)
433 * adjtime() only runs on cpu #0 so our critical section is
434 * sufficient to access these variables.
436 if (ntp_delta != 0) {
437 nbt->tv_nsec += ntp_tick_delta;
438 ntp_delta -= ntp_tick_delta;
439 if ((ntp_delta > 0 && ntp_delta < ntp_tick_delta) ||
440 (ntp_delta < 0 && ntp_delta > ntp_tick_delta)) {
441 ntp_tick_delta = ntp_delta;
446 * Apply permanent frequency corrections. (sysctl API)
448 if (ntp_tick_permanent != 0) {
449 ntp_tick_acc += ntp_tick_permanent;
450 if (ntp_tick_acc >= (1LL << 32)) {
451 nbt->tv_nsec += ntp_tick_acc >> 32;
452 ntp_tick_acc -= (ntp_tick_acc >> 32) << 32;
453 } else if (ntp_tick_acc <= -(1LL << 32)) {
454 /* Negate ntp_tick_acc to avoid shifting the sign bit. */
455 nbt->tv_nsec -= (-ntp_tick_acc) >> 32;
456 ntp_tick_acc += ((-ntp_tick_acc) >> 32) << 32;
460 if (nbt->tv_nsec >= 1000000000) {
462 nbt->tv_nsec -= 1000000000;
463 } else if (nbt->tv_nsec < 0) {
465 nbt->tv_nsec += 1000000000;
469 * Another per-tick compensation. (for ntp_adjtime() API)
472 nsec_acc += nsec_adj;
473 if (nsec_acc >= 0x100000000LL) {
474 nbt->tv_nsec += nsec_acc >> 32;
475 nsec_acc = (nsec_acc & 0xFFFFFFFFLL);
476 } else if (nsec_acc <= -0x100000000LL) {
477 nbt->tv_nsec -= -nsec_acc >> 32;
478 nsec_acc = -(-nsec_acc & 0xFFFFFFFFLL);
480 if (nbt->tv_nsec >= 1000000000) {
481 nbt->tv_nsec -= 1000000000;
483 } else if (nbt->tv_nsec < 0) {
484 nbt->tv_nsec += 1000000000;
489 /************************************************************
490 * LEAP SECOND CORRECTION *
491 ************************************************************
493 * Taking into account all the corrections made above, figure
494 * out the new real time. If the seconds field has changed
495 * then apply any pending leap-second corrections.
497 getnanotime_nbt(nbt, &nts);
499 if (time_second != nts.tv_sec) {
501 * Apply leap second (sysctl API). Adjust nts for changes
502 * so we do not have to call getnanotime_nbt again.
504 if (ntp_leap_second) {
505 if (ntp_leap_second == nts.tv_sec) {
506 if (ntp_leap_insert) {
518 * Apply leap second (ntp_adjtime() API), calculate a new
519 * nsec_adj field. ntp_update_second() returns nsec_adj
520 * as a per-second value but we need it as a per-tick value.
522 leap = ntp_update_second(time_second, &nsec_adj);
528 * Update the time_second 'approximate time' global.
530 time_second = nts.tv_sec;
534 * Finally, our new basetime is ready to go live!
541 * lwkt thread scheduler fair queueing
543 lwkt_schedulerclock(curthread);
546 * softticks are handled for all cpus
548 hardclock_softtick(gd);
551 * ITimer handling is per-tick, per-cpu.
553 * We must acquire the per-process token in order for ksignal()
554 * to be non-blocking. For the moment this requires an AST fault,
555 * the ksignal() cannot be safely issued from this hard interrupt.
557 * XXX Even the trytoken here isn't right, and itimer operation in
558 * a multi threaded environment is going to be weird at the
561 if ((p = curproc) != NULL && lwkt_trytoken(&p->p_token)) {
563 if (frame && CLKF_USERMODE(frame) &&
564 timevalisset(&p->p_timer[ITIMER_VIRTUAL].it_value) &&
565 itimerdecr(&p->p_timer[ITIMER_VIRTUAL], ustick) == 0) {
566 p->p_flags |= P_SIGVTALRM;
569 if (timevalisset(&p->p_timer[ITIMER_PROF].it_value) &&
570 itimerdecr(&p->p_timer[ITIMER_PROF], ustick) == 0) {
571 p->p_flags |= P_SIGPROF;
575 lwkt_reltoken(&p->p_token);
581 * The statistics clock typically runs at a 125Hz rate, and is intended
582 * to be frequency offset from the hardclock (typ 100Hz). It is per-cpu.
584 * NOTE! systimer! the MP lock might not be held here. We can only safely
585 * manipulate objects owned by the current cpu.
587 * The stats clock is responsible for grabbing a profiling sample.
588 * Most of the statistics are only used by user-level statistics programs.
589 * The main exceptions are p->p_uticks, p->p_sticks, p->p_iticks, and
592 * Like the other clocks, the stat clock is called from what is effectively
593 * a fast interrupt, so the context should be the thread/process that got
597 statclock(systimer_t info, int in_ipi, struct intrframe *frame)
610 * How big was our timeslice relative to the last time?
612 microuptime(&tv); /* mpsafe */
613 stv = &mycpu->gd_stattv;
614 if (stv->tv_sec == 0) {
617 bump = tv.tv_usec - stv->tv_usec +
618 (tv.tv_sec - stv->tv_sec) * 1000000;
629 if (frame && CLKF_USERMODE(frame)) {
631 * Came from userland, handle user time and deal with
634 if (p && (p->p_flags & P_PROFIL))
635 addupc_intr(p, CLKF_PC(frame), 1);
636 td->td_uticks += bump;
639 * Charge the time as appropriate
641 if (p && p->p_nice > NZERO)
642 cpu_time.cp_nice += bump;
644 cpu_time.cp_user += bump;
646 int intr_nest = mycpu->gd_intr_nesting_level;
650 * IPI processing code will bump gd_intr_nesting_level
651 * up by one, which breaks following CLKF_INTR testing,
652 * so we substract it by one here.
658 * Kernel statistics are just like addupc_intr, only easier.
661 if (g->state == GMON_PROF_ON && frame) {
662 i = CLKF_PC(frame) - g->lowpc;
663 if (i < g->textsize) {
664 i /= HISTFRACTION * sizeof(*g->kcount);
670 #define IS_INTR_RUNNING ((frame && CLKF_INTR(intr_nest)) || CLKF_INTR_TD(td))
673 * Came from kernel mode, so we were:
674 * - handling an interrupt,
675 * - doing syscall or trap work on behalf of the current
677 * - spinning in the idle loop.
678 * Whichever it is, charge the time as appropriate.
679 * Note that we charge interrupts to the current process,
680 * regardless of whether they are ``for'' that process,
681 * so that we know how much of its real time was spent
682 * in ``non-process'' (i.e., interrupt) work.
684 * XXX assume system if frame is NULL. A NULL frame
685 * can occur if ipi processing is done from a crit_exit().
688 td->td_iticks += bump;
690 td->td_sticks += bump;
692 if (IS_INTR_RUNNING) {
695 do_pctrack(frame, PCTRACK_INT);
697 cpu_time.cp_intr += bump;
699 if (td == &mycpu->gd_idlethread) {
700 cpu_time.cp_idle += bump;
704 do_pctrack(frame, PCTRACK_SYS);
706 cpu_time.cp_sys += bump;
710 #undef IS_INTR_RUNNING
716 * Sample the PC when in the kernel or in an interrupt. User code can
717 * retrieve the information and generate a histogram or other output.
721 do_pctrack(struct intrframe *frame, int which)
723 struct kinfo_pctrack *pctrack;
725 pctrack = &cputime_pctrack[mycpu->gd_cpuid][which];
726 pctrack->pc_array[pctrack->pc_index & PCTRACK_ARYMASK] =
727 (void *)CLKF_PC(frame);
732 sysctl_pctrack(SYSCTL_HANDLER_ARGS)
734 struct kinfo_pcheader head;
739 head.pc_ntrack = PCTRACK_SIZE;
740 head.pc_arysize = PCTRACK_ARYSIZE;
742 if ((error = SYSCTL_OUT(req, &head, sizeof(head))) != 0)
745 for (cpu = 0; cpu < ncpus; ++cpu) {
746 for (ntrack = 0; ntrack < PCTRACK_SIZE; ++ntrack) {
747 error = SYSCTL_OUT(req, &cputime_pctrack[cpu][ntrack],
748 sizeof(struct kinfo_pctrack));
757 SYSCTL_PROC(_kern, OID_AUTO, pctrack, (CTLTYPE_OPAQUE|CTLFLAG_RD), 0, 0,
758 sysctl_pctrack, "S,kinfo_pcheader", "CPU PC tracking");
763 * The scheduler clock typically runs at a 50Hz rate. NOTE! systimer,
764 * the MP lock might not be held. We can safely manipulate parts of curproc
765 * but that's about it.
767 * Each cpu has its own scheduler clock.
770 schedclock(systimer_t info, int in_ipi __unused, struct intrframe *frame)
777 if ((lp = lwkt_preempted_proc()) != NULL) {
779 * Account for cpu time used and hit the scheduler. Note
780 * that this call MUST BE MP SAFE, and the BGL IS NOT HELD
784 usched_schedulerclock(lp, info->periodic, info->time);
786 usched_schedulerclock(NULL, info->periodic, info->time);
788 if ((lp = curthread->td_lwp) != NULL) {
790 * Update resource usage integrals and maximums.
792 if ((ru = &lp->lwp_proc->p_ru) &&
793 (vm = lp->lwp_proc->p_vmspace) != NULL) {
794 ru->ru_ixrss += pgtok(vm->vm_tsize);
795 ru->ru_idrss += pgtok(vm->vm_dsize);
796 ru->ru_isrss += pgtok(vm->vm_ssize);
797 if (lwkt_trytoken(&vm->vm_map.token)) {
798 rss = pgtok(vmspace_resident_count(vm));
799 if (ru->ru_maxrss < rss)
801 lwkt_reltoken(&vm->vm_map.token);
805 /* Increment the global sched_ticks */
806 if (mycpu->gd_cpuid == 0)
811 * Compute number of ticks for the specified amount of time. The
812 * return value is intended to be used in a clock interrupt timed
813 * operation and guarenteed to meet or exceed the requested time.
814 * If the representation overflows, return INT_MAX. The minimum return
815 * value is 1 ticks and the function will average the calculation up.
816 * If any value greater then 0 microseconds is supplied, a value
817 * of at least 2 will be returned to ensure that a near-term clock
818 * interrupt does not cause the timeout to occur (degenerately) early.
820 * Note that limit checks must take into account microseconds, which is
821 * done simply by using the smaller signed long maximum instead of
822 * the unsigned long maximum.
824 * If ints have 32 bits, then the maximum value for any timeout in
825 * 10ms ticks is 248 days.
828 tvtohz_high(struct timeval *tv)
845 kprintf("tvtohz_high: negative time difference "
846 "%ld sec %ld usec\n",
850 } else if (sec <= INT_MAX / hz) {
851 ticks = (int)(sec * hz +
852 ((u_long)usec + (ustick - 1)) / ustick) + 1;
860 tstohz_high(struct timespec *ts)
877 kprintf("tstohz_high: negative time difference "
878 "%ld sec %ld nsec\n",
882 } else if (sec <= INT_MAX / hz) {
883 ticks = (int)(sec * hz +
884 ((u_long)nsec + (nstick - 1)) / nstick) + 1;
893 * Compute number of ticks for the specified amount of time, erroring on
894 * the side of it being too low to ensure that sleeping the returned number
895 * of ticks will not result in a late return.
897 * The supplied timeval may not be negative and should be normalized. A
898 * return value of 0 is possible if the timeval converts to less then
901 * If ints have 32 bits, then the maximum value for any timeout in
902 * 10ms ticks is 248 days.
905 tvtohz_low(struct timeval *tv)
911 if (sec <= INT_MAX / hz)
912 ticks = (int)(sec * hz + (u_long)tv->tv_usec / ustick);
919 tstohz_low(struct timespec *ts)
925 if (sec <= INT_MAX / hz)
926 ticks = (int)(sec * hz + (u_long)ts->tv_nsec / nstick);
933 * Start profiling on a process.
935 * Kernel profiling passes proc0 which never exits and hence
936 * keeps the profile clock running constantly.
939 startprofclock(struct proc *p)
941 if ((p->p_flags & P_PROFIL) == 0) {
942 p->p_flags |= P_PROFIL;
944 if (++profprocs == 1 && stathz != 0) {
947 setstatclockrate(profhz);
955 * Stop profiling on a process.
957 * caller must hold p->p_token
960 stopprofclock(struct proc *p)
962 if (p->p_flags & P_PROFIL) {
963 p->p_flags &= ~P_PROFIL;
965 if (--profprocs == 0 && stathz != 0) {
968 setstatclockrate(stathz);
976 * Return information about system clocks.
979 sysctl_kern_clockrate(SYSCTL_HANDLER_ARGS)
981 struct kinfo_clockinfo clkinfo;
983 * Construct clockinfo structure.
986 clkinfo.ci_tick = ustick;
987 clkinfo.ci_tickadj = ntp_default_tick_delta / 1000;
988 clkinfo.ci_profhz = profhz;
989 clkinfo.ci_stathz = stathz ? stathz : hz;
990 return (sysctl_handle_opaque(oidp, &clkinfo, sizeof clkinfo, req));
993 SYSCTL_PROC(_kern, KERN_CLOCKRATE, clockrate, CTLTYPE_STRUCT|CTLFLAG_RD,
994 0, 0, sysctl_kern_clockrate, "S,clockinfo","");
997 * We have eight functions for looking at the clock, four for
998 * microseconds and four for nanoseconds. For each there is fast
999 * but less precise version "get{nano|micro}[up]time" which will
1000 * return a time which is up to 1/HZ previous to the call, whereas
1001 * the raw version "{nano|micro}[up]time" will return a timestamp
1002 * which is as precise as possible. The "up" variants return the
1003 * time relative to system boot, these are well suited for time
1004 * interval measurements.
1006 * Each cpu independantly maintains the current time of day, so all
1007 * we need to do to protect ourselves from changes is to do a loop
1008 * check on the seconds field changing out from under us.
1010 * The system timer maintains a 32 bit count and due to various issues
1011 * it is possible for the calculated delta to occassionally exceed
1012 * sys_cputimer->freq. If this occurs the sys_cputimer->freq64_nsec
1013 * multiplication can easily overflow, so we deal with the case. For
1014 * uniformity we deal with the case in the usec case too.
1016 * All the [get][micro,nano][time,uptime]() routines are MPSAFE.
1019 getmicrouptime(struct timeval *tvp)
1021 struct globaldata *gd = mycpu;
1025 tvp->tv_sec = gd->gd_time_seconds;
1026 delta = gd->gd_hardclock.time - gd->gd_cpuclock_base;
1027 } while (tvp->tv_sec != gd->gd_time_seconds);
1029 if (delta >= sys_cputimer->freq) {
1030 tvp->tv_sec += delta / sys_cputimer->freq;
1031 delta %= sys_cputimer->freq;
1033 tvp->tv_usec = (sys_cputimer->freq64_usec * delta) >> 32;
1034 if (tvp->tv_usec >= 1000000) {
1035 tvp->tv_usec -= 1000000;
1041 getnanouptime(struct timespec *tsp)
1043 struct globaldata *gd = mycpu;
1047 tsp->tv_sec = gd->gd_time_seconds;
1048 delta = gd->gd_hardclock.time - gd->gd_cpuclock_base;
1049 } while (tsp->tv_sec != gd->gd_time_seconds);
1051 if (delta >= sys_cputimer->freq) {
1052 tsp->tv_sec += delta / sys_cputimer->freq;
1053 delta %= sys_cputimer->freq;
1055 tsp->tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1059 microuptime(struct timeval *tvp)
1061 struct globaldata *gd = mycpu;
1065 tvp->tv_sec = gd->gd_time_seconds;
1066 delta = sys_cputimer->count() - gd->gd_cpuclock_base;
1067 } while (tvp->tv_sec != gd->gd_time_seconds);
1069 if (delta >= sys_cputimer->freq) {
1070 tvp->tv_sec += delta / sys_cputimer->freq;
1071 delta %= sys_cputimer->freq;
1073 tvp->tv_usec = (sys_cputimer->freq64_usec * delta) >> 32;
1077 nanouptime(struct timespec *tsp)
1079 struct globaldata *gd = mycpu;
1083 tsp->tv_sec = gd->gd_time_seconds;
1084 delta = sys_cputimer->count() - gd->gd_cpuclock_base;
1085 } while (tsp->tv_sec != gd->gd_time_seconds);
1087 if (delta >= sys_cputimer->freq) {
1088 tsp->tv_sec += delta / sys_cputimer->freq;
1089 delta %= sys_cputimer->freq;
1091 tsp->tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1098 getmicrotime(struct timeval *tvp)
1100 struct globaldata *gd = mycpu;
1101 struct timespec *bt;
1105 tvp->tv_sec = gd->gd_time_seconds;
1106 delta = gd->gd_hardclock.time - gd->gd_cpuclock_base;
1107 } while (tvp->tv_sec != gd->gd_time_seconds);
1109 if (delta >= sys_cputimer->freq) {
1110 tvp->tv_sec += delta / sys_cputimer->freq;
1111 delta %= sys_cputimer->freq;
1113 tvp->tv_usec = (sys_cputimer->freq64_usec * delta) >> 32;
1115 bt = &basetime[basetime_index];
1116 tvp->tv_sec += bt->tv_sec;
1117 tvp->tv_usec += bt->tv_nsec / 1000;
1118 while (tvp->tv_usec >= 1000000) {
1119 tvp->tv_usec -= 1000000;
1125 getnanotime(struct timespec *tsp)
1127 struct globaldata *gd = mycpu;
1128 struct timespec *bt;
1132 tsp->tv_sec = gd->gd_time_seconds;
1133 delta = gd->gd_hardclock.time - gd->gd_cpuclock_base;
1134 } while (tsp->tv_sec != gd->gd_time_seconds);
1136 if (delta >= sys_cputimer->freq) {
1137 tsp->tv_sec += delta / sys_cputimer->freq;
1138 delta %= sys_cputimer->freq;
1140 tsp->tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1142 bt = &basetime[basetime_index];
1143 tsp->tv_sec += bt->tv_sec;
1144 tsp->tv_nsec += bt->tv_nsec;
1145 while (tsp->tv_nsec >= 1000000000) {
1146 tsp->tv_nsec -= 1000000000;
1152 getnanotime_nbt(struct timespec *nbt, struct timespec *tsp)
1154 struct globaldata *gd = mycpu;
1158 tsp->tv_sec = gd->gd_time_seconds;
1159 delta = gd->gd_hardclock.time - gd->gd_cpuclock_base;
1160 } while (tsp->tv_sec != gd->gd_time_seconds);
1162 if (delta >= sys_cputimer->freq) {
1163 tsp->tv_sec += delta / sys_cputimer->freq;
1164 delta %= sys_cputimer->freq;
1166 tsp->tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1168 tsp->tv_sec += nbt->tv_sec;
1169 tsp->tv_nsec += nbt->tv_nsec;
1170 while (tsp->tv_nsec >= 1000000000) {
1171 tsp->tv_nsec -= 1000000000;
1178 microtime(struct timeval *tvp)
1180 struct globaldata *gd = mycpu;
1181 struct timespec *bt;
1185 tvp->tv_sec = gd->gd_time_seconds;
1186 delta = sys_cputimer->count() - gd->gd_cpuclock_base;
1187 } while (tvp->tv_sec != gd->gd_time_seconds);
1189 if (delta >= sys_cputimer->freq) {
1190 tvp->tv_sec += delta / sys_cputimer->freq;
1191 delta %= sys_cputimer->freq;
1193 tvp->tv_usec = (sys_cputimer->freq64_usec * delta) >> 32;
1195 bt = &basetime[basetime_index];
1196 tvp->tv_sec += bt->tv_sec;
1197 tvp->tv_usec += bt->tv_nsec / 1000;
1198 while (tvp->tv_usec >= 1000000) {
1199 tvp->tv_usec -= 1000000;
1205 nanotime(struct timespec *tsp)
1207 struct globaldata *gd = mycpu;
1208 struct timespec *bt;
1212 tsp->tv_sec = gd->gd_time_seconds;
1213 delta = sys_cputimer->count() - gd->gd_cpuclock_base;
1214 } while (tsp->tv_sec != gd->gd_time_seconds);
1216 if (delta >= sys_cputimer->freq) {
1217 tsp->tv_sec += delta / sys_cputimer->freq;
1218 delta %= sys_cputimer->freq;
1220 tsp->tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1222 bt = &basetime[basetime_index];
1223 tsp->tv_sec += bt->tv_sec;
1224 tsp->tv_nsec += bt->tv_nsec;
1225 while (tsp->tv_nsec >= 1000000000) {
1226 tsp->tv_nsec -= 1000000000;
1232 * note: this is not exactly synchronized with real time. To do that we
1233 * would have to do what microtime does and check for a nanoseconds overflow.
1236 get_approximate_time_t(void)
1238 struct globaldata *gd = mycpu;
1239 struct timespec *bt;
1241 bt = &basetime[basetime_index];
1242 return(gd->gd_time_seconds + bt->tv_sec);
1246 pps_ioctl(u_long cmd, caddr_t data, struct pps_state *pps)
1249 struct pps_fetch_args *fapi;
1251 struct pps_kcbind_args *kapi;
1255 case PPS_IOC_CREATE:
1257 case PPS_IOC_DESTROY:
1259 case PPS_IOC_SETPARAMS:
1260 app = (pps_params_t *)data;
1261 if (app->mode & ~pps->ppscap)
1263 pps->ppsparam = *app;
1265 case PPS_IOC_GETPARAMS:
1266 app = (pps_params_t *)data;
1267 *app = pps->ppsparam;
1268 app->api_version = PPS_API_VERS_1;
1270 case PPS_IOC_GETCAP:
1271 *(int*)data = pps->ppscap;
1274 fapi = (struct pps_fetch_args *)data;
1275 if (fapi->tsformat && fapi->tsformat != PPS_TSFMT_TSPEC)
1277 if (fapi->timeout.tv_sec || fapi->timeout.tv_nsec)
1278 return (EOPNOTSUPP);
1279 pps->ppsinfo.current_mode = pps->ppsparam.mode;
1280 fapi->pps_info_buf = pps->ppsinfo;
1282 case PPS_IOC_KCBIND:
1284 kapi = (struct pps_kcbind_args *)data;
1285 /* XXX Only root should be able to do this */
1286 if (kapi->tsformat && kapi->tsformat != PPS_TSFMT_TSPEC)
1288 if (kapi->kernel_consumer != PPS_KC_HARDPPS)
1290 if (kapi->edge & ~pps->ppscap)
1292 pps->kcmode = kapi->edge;
1295 return (EOPNOTSUPP);
1303 pps_init(struct pps_state *pps)
1305 pps->ppscap |= PPS_TSFMT_TSPEC;
1306 if (pps->ppscap & PPS_CAPTUREASSERT)
1307 pps->ppscap |= PPS_OFFSETASSERT;
1308 if (pps->ppscap & PPS_CAPTURECLEAR)
1309 pps->ppscap |= PPS_OFFSETCLEAR;
1313 pps_event(struct pps_state *pps, sysclock_t count, int event)
1315 struct globaldata *gd;
1316 struct timespec *tsp;
1317 struct timespec *osp;
1318 struct timespec *bt;
1331 /* Things would be easier with arrays... */
1332 if (event == PPS_CAPTUREASSERT) {
1333 tsp = &pps->ppsinfo.assert_timestamp;
1334 osp = &pps->ppsparam.assert_offset;
1335 foff = pps->ppsparam.mode & PPS_OFFSETASSERT;
1336 fhard = pps->kcmode & PPS_CAPTUREASSERT;
1337 pcount = &pps->ppscount[0];
1338 pseq = &pps->ppsinfo.assert_sequence;
1340 tsp = &pps->ppsinfo.clear_timestamp;
1341 osp = &pps->ppsparam.clear_offset;
1342 foff = pps->ppsparam.mode & PPS_OFFSETCLEAR;
1343 fhard = pps->kcmode & PPS_CAPTURECLEAR;
1344 pcount = &pps->ppscount[1];
1345 pseq = &pps->ppsinfo.clear_sequence;
1348 /* Nothing really happened */
1349 if (*pcount == count)
1355 ts.tv_sec = gd->gd_time_seconds;
1356 delta = count - gd->gd_cpuclock_base;
1357 } while (ts.tv_sec != gd->gd_time_seconds);
1359 if (delta >= sys_cputimer->freq) {
1360 ts.tv_sec += delta / sys_cputimer->freq;
1361 delta %= sys_cputimer->freq;
1363 ts.tv_nsec = (sys_cputimer->freq64_nsec * delta) >> 32;
1364 bt = &basetime[basetime_index];
1365 ts.tv_sec += bt->tv_sec;
1366 ts.tv_nsec += bt->tv_nsec;
1367 while (ts.tv_nsec >= 1000000000) {
1368 ts.tv_nsec -= 1000000000;
1376 timespecadd(tsp, osp);
1377 if (tsp->tv_nsec < 0) {
1378 tsp->tv_nsec += 1000000000;
1384 /* magic, at its best... */
1385 tcount = count - pps->ppscount[2];
1386 pps->ppscount[2] = count;
1387 if (tcount >= sys_cputimer->freq) {
1388 delta = (1000000000 * (tcount / sys_cputimer->freq) +
1389 sys_cputimer->freq64_nsec *
1390 (tcount % sys_cputimer->freq)) >> 32;
1392 delta = (sys_cputimer->freq64_nsec * tcount) >> 32;
1394 hardpps(tsp, delta);
1400 * Return the tsc target value for a delay of (ns).
1402 * Returns -1 if the TSC is not supported.
1405 tsc_get_target(int ns)
1407 #if defined(_RDTSC_SUPPORTED_)
1408 if (cpu_feature & CPUID_TSC) {
1409 return (rdtsc() + tsc_frequency * ns / (int64_t)1000000000);
1416 * Compare the tsc against the passed target
1418 * Returns +1 if the target has been reached
1419 * Returns 0 if the target has not yet been reached
1420 * Returns -1 if the TSC is not supported.
1422 * Typical use: while (tsc_test_target(target) == 0) { ...poll... }
1425 tsc_test_target(int64_t target)
1427 #if defined(_RDTSC_SUPPORTED_)
1428 if (cpu_feature & CPUID_TSC) {
1429 if ((int64_t)(target - rdtsc()) <= 0)
1438 * Delay the specified number of nanoseconds using the tsc. This function
1439 * returns immediately if the TSC is not supported. At least one cpu_pause()
1447 clk = tsc_get_target(ns);
1449 while (tsc_test_target(clk) == 0)