kern_clock.c revision 1.135 1 1.135 maxv /* $NetBSD: kern_clock.c,v 1.135 2017/02/12 18:43:56 maxv Exp $ */
2 1.52 thorpej
3 1.52 thorpej /*-
4 1.118 ad * Copyright (c) 2000, 2004, 2006, 2007, 2008 The NetBSD Foundation, Inc.
5 1.52 thorpej * All rights reserved.
6 1.52 thorpej *
7 1.52 thorpej * This code is derived from software contributed to The NetBSD Foundation
8 1.52 thorpej * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
9 1.52 thorpej * NASA Ames Research Center.
10 1.94 mycroft * This code is derived from software contributed to The NetBSD Foundation
11 1.94 mycroft * by Charles M. Hannum.
12 1.52 thorpej *
13 1.52 thorpej * Redistribution and use in source and binary forms, with or without
14 1.52 thorpej * modification, are permitted provided that the following conditions
15 1.52 thorpej * are met:
16 1.52 thorpej * 1. Redistributions of source code must retain the above copyright
17 1.52 thorpej * notice, this list of conditions and the following disclaimer.
18 1.52 thorpej * 2. Redistributions in binary form must reproduce the above copyright
19 1.52 thorpej * notice, this list of conditions and the following disclaimer in the
20 1.52 thorpej * documentation and/or other materials provided with the distribution.
21 1.52 thorpej *
22 1.52 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
23 1.52 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
24 1.52 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
25 1.52 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
26 1.52 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
27 1.52 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
28 1.52 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
29 1.52 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
30 1.52 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
31 1.52 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
32 1.52 thorpej * POSSIBILITY OF SUCH DAMAGE.
33 1.52 thorpej */
34 1.19 cgd
35 1.19 cgd /*-
36 1.19 cgd * Copyright (c) 1982, 1986, 1991, 1993
37 1.19 cgd * The Regents of the University of California. All rights reserved.
38 1.19 cgd * (c) UNIX System Laboratories, Inc.
39 1.19 cgd * All or some portions of this file are derived from material licensed
40 1.19 cgd * to the University of California by American Telephone and Telegraph
41 1.19 cgd * Co. or Unix System Laboratories, Inc. and are reproduced herein with
42 1.19 cgd * the permission of UNIX System Laboratories, Inc.
43 1.19 cgd *
44 1.19 cgd * Redistribution and use in source and binary forms, with or without
45 1.19 cgd * modification, are permitted provided that the following conditions
46 1.19 cgd * are met:
47 1.19 cgd * 1. Redistributions of source code must retain the above copyright
48 1.19 cgd * notice, this list of conditions and the following disclaimer.
49 1.19 cgd * 2. Redistributions in binary form must reproduce the above copyright
50 1.19 cgd * notice, this list of conditions and the following disclaimer in the
51 1.19 cgd * documentation and/or other materials provided with the distribution.
52 1.87 agc * 3. Neither the name of the University nor the names of its contributors
53 1.19 cgd * may be used to endorse or promote products derived from this software
54 1.19 cgd * without specific prior written permission.
55 1.19 cgd *
56 1.19 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
57 1.19 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 1.19 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
59 1.19 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
60 1.19 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
61 1.19 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
62 1.19 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 1.19 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
64 1.19 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 1.19 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 1.19 cgd * SUCH DAMAGE.
67 1.19 cgd *
68 1.19 cgd * @(#)kern_clock.c 8.5 (Berkeley) 1/21/94
69 1.19 cgd */
70 1.78 lukem
71 1.78 lukem #include <sys/cdefs.h>
72 1.135 maxv __KERNEL_RCSID(0, "$NetBSD: kern_clock.c,v 1.135 2017/02/12 18:43:56 maxv Exp $");
73 1.44 jonathan
74 1.133 pooka #ifdef _KERNEL_OPT
75 1.131 chs #include "opt_dtrace.h"
76 1.80 briggs #include "opt_perfctrs.h"
77 1.133 pooka #endif
78 1.19 cgd
79 1.19 cgd #include <sys/param.h>
80 1.19 cgd #include <sys/systm.h>
81 1.19 cgd #include <sys/callout.h>
82 1.19 cgd #include <sys/kernel.h>
83 1.19 cgd #include <sys/proc.h>
84 1.19 cgd #include <sys/resourcevar.h>
85 1.25 christos #include <sys/signalvar.h>
86 1.26 christos #include <sys/sysctl.h>
87 1.27 jonathan #include <sys/timex.h>
88 1.45 ross #include <sys/sched.h>
89 1.82 thorpej #include <sys/time.h>
90 1.99 kardel #include <sys/timetc.h>
91 1.109 ad #include <sys/cpu.h>
92 1.118 ad #include <sys/atomic.h>
93 1.118 ad
94 1.19 cgd #ifdef GPROF
95 1.19 cgd #include <sys/gmon.h>
96 1.19 cgd #endif
97 1.19 cgd
98 1.131 chs #ifdef KDTRACE_HOOKS
99 1.131 chs #include <sys/dtrace_bsd.h>
100 1.131 chs #include <sys/cpu.h>
101 1.131 chs
102 1.131 chs cyclic_clock_func_t cyclic_clock_func[MAXCPUS];
103 1.131 chs #endif
104 1.131 chs
105 1.132 pooka static int sysctl_kern_clockrate(SYSCTLFN_PROTO);
106 1.132 pooka
107 1.19 cgd /*
108 1.19 cgd * Clock handling routines.
109 1.19 cgd *
110 1.19 cgd * This code is written to operate with two timers that run independently of
111 1.19 cgd * each other. The main clock, running hz times per second, is used to keep
112 1.19 cgd * track of real time. The second timer handles kernel and user profiling,
113 1.19 cgd * and does resource use estimation. If the second timer is programmable,
114 1.19 cgd * it is randomized to avoid aliasing between the two clocks. For example,
115 1.90 wiz * the randomization prevents an adversary from always giving up the CPU
116 1.19 cgd * just before its quantum expires. Otherwise, it would never accumulate
117 1.90 wiz * CPU ticks. The mean frequency of the second timer is stathz.
118 1.19 cgd *
119 1.19 cgd * If no second timer exists, stathz will be zero; in this case we drive
120 1.19 cgd * profiling and statistics off the main clock. This WILL NOT be accurate;
121 1.19 cgd * do not do it unless absolutely necessary.
122 1.19 cgd *
123 1.19 cgd * The statistics clock may (or may not) be run at a higher rate while
124 1.19 cgd * profiling. This profile clock runs at profhz. We require that profhz
125 1.19 cgd * be an integral multiple of stathz.
126 1.19 cgd *
127 1.19 cgd * If the statistics clock is running fast, it must be divided by the ratio
128 1.19 cgd * profhz/stathz for statistics. (For profiling, every tick counts.)
129 1.19 cgd */
130 1.19 cgd
131 1.19 cgd int stathz;
132 1.19 cgd int profhz;
133 1.80 briggs int profsrc;
134 1.75 simonb int schedhz;
135 1.19 cgd int profprocs;
136 1.100 drochner int hardclock_ticks;
137 1.114 ad static int hardscheddiv; /* hard => sched divider (used if schedhz == 0) */
138 1.70 sommerfe static int psdiv; /* prof => stat divider */
139 1.22 cgd int psratio; /* ratio: prof / stat */
140 1.19 cgd
141 1.99 kardel static u_int get_intr_timecount(struct timecounter *);
142 1.99 kardel
143 1.99 kardel static struct timecounter intr_timecounter = {
144 1.99 kardel get_intr_timecount, /* get_timecount */
145 1.99 kardel 0, /* no poll_pps */
146 1.99 kardel ~0u, /* counter_mask */
147 1.99 kardel 0, /* frequency */
148 1.99 kardel "clockinterrupt", /* name */
149 1.102 christos 0, /* quality - minimum implementation level for a clock */
150 1.102 christos NULL, /* prev */
151 1.102 christos NULL, /* next */
152 1.99 kardel };
153 1.99 kardel
154 1.99 kardel static u_int
155 1.104 yamt get_intr_timecount(struct timecounter *tc)
156 1.99 kardel {
157 1.104 yamt
158 1.100 drochner return (u_int)hardclock_ticks;
159 1.99 kardel }
160 1.73 thorpej
161 1.66 thorpej /*
162 1.19 cgd * Initialize clock frequencies and start both clocks running.
163 1.19 cgd */
164 1.19 cgd void
165 1.63 thorpej initclocks(void)
166 1.19 cgd {
167 1.132 pooka static struct sysctllog *clog;
168 1.55 augustss int i;
169 1.19 cgd
170 1.19 cgd /*
171 1.19 cgd * Set divisors to 1 (normal case) and let the machine-specific
172 1.19 cgd * code do its bit.
173 1.19 cgd */
174 1.70 sommerfe psdiv = 1;
175 1.99 kardel /*
176 1.99 kardel * provide minimum default time counter
177 1.99 kardel * will only run at interrupt resolution
178 1.99 kardel */
179 1.99 kardel intr_timecounter.tc_frequency = hz;
180 1.99 kardel tc_init(&intr_timecounter);
181 1.19 cgd cpu_initclocks();
182 1.19 cgd
183 1.19 cgd /*
184 1.108 yamt * Compute profhz and stathz, fix profhz if needed.
185 1.19 cgd */
186 1.19 cgd i = stathz ? stathz : hz;
187 1.19 cgd if (profhz == 0)
188 1.19 cgd profhz = i;
189 1.19 cgd psratio = profhz / i;
190 1.91 yamt if (schedhz == 0) {
191 1.91 yamt /* 16Hz is best */
192 1.114 ad hardscheddiv = hz / 16;
193 1.114 ad if (hardscheddiv <= 0)
194 1.114 ad panic("hardscheddiv");
195 1.91 yamt }
196 1.31 mycroft
197 1.132 pooka sysctl_createv(&clog, 0, NULL, NULL,
198 1.132 pooka CTLFLAG_PERMANENT,
199 1.132 pooka CTLTYPE_STRUCT, "clockrate",
200 1.132 pooka SYSCTL_DESCR("Kernel clock rates"),
201 1.132 pooka sysctl_kern_clockrate, 0, NULL,
202 1.132 pooka sizeof(struct clockinfo),
203 1.132 pooka CTL_KERN, KERN_CLOCKRATE, CTL_EOL);
204 1.132 pooka sysctl_createv(&clog, 0, NULL, NULL,
205 1.132 pooka CTLFLAG_PERMANENT,
206 1.132 pooka CTLTYPE_INT, "hardclock_ticks",
207 1.132 pooka SYSCTL_DESCR("Number of hardclock ticks"),
208 1.132 pooka NULL, 0, &hardclock_ticks, sizeof(hardclock_ticks),
209 1.132 pooka CTL_KERN, KERN_HARDCLOCK_TICKS, CTL_EOL);
210 1.19 cgd }
211 1.19 cgd
212 1.19 cgd /*
213 1.19 cgd * The real-time timer, interrupting hz times per second.
214 1.19 cgd */
215 1.19 cgd void
216 1.63 thorpej hardclock(struct clockframe *frame)
217 1.19 cgd {
218 1.82 thorpej struct lwp *l;
219 1.120 ad struct cpu_info *ci;
220 1.19 cgd
221 1.120 ad ci = curcpu();
222 1.114 ad l = ci->ci_data.cpu_onproc;
223 1.120 ad
224 1.120 ad timer_tick(l, CLKF_USERMODE(frame));
225 1.19 cgd
226 1.19 cgd /*
227 1.19 cgd * If no separate statistics clock is available, run it from here.
228 1.19 cgd */
229 1.19 cgd if (stathz == 0)
230 1.19 cgd statclock(frame);
231 1.114 ad /*
232 1.114 ad * If no separate schedclock is provided, call it here
233 1.114 ad * at about 16 Hz.
234 1.114 ad */
235 1.114 ad if (schedhz == 0) {
236 1.114 ad if ((int)(--ci->ci_schedstate.spc_schedticks) <= 0) {
237 1.114 ad schedclock(l);
238 1.114 ad ci->ci_schedstate.spc_schedticks = hardscheddiv;
239 1.114 ad }
240 1.114 ad }
241 1.108 yamt if ((--ci->ci_schedstate.spc_ticks) <= 0)
242 1.108 yamt sched_tick(ci);
243 1.93 perry
244 1.123 ad if (CPU_IS_PRIMARY(ci)) {
245 1.121 ad hardclock_ticks++;
246 1.121 ad tc_ticktock();
247 1.121 ad }
248 1.19 cgd
249 1.19 cgd /*
250 1.126 pooka * Update real-time timeout queue.
251 1.106 ad */
252 1.109 ad callout_hardclock();
253 1.131 chs
254 1.131 chs #ifdef KDTRACE_HOOKS
255 1.131 chs cyclic_clock_func_t func = cyclic_clock_func[cpu_index(ci)];
256 1.131 chs if (func) {
257 1.131 chs (*func)((struct clockframe *)frame);
258 1.131 chs }
259 1.131 chs #endif
260 1.19 cgd }
261 1.19 cgd
262 1.19 cgd /*
263 1.19 cgd * Start profiling on a process.
264 1.19 cgd *
265 1.19 cgd * Kernel profiling passes proc0 which never exits and hence
266 1.19 cgd * keeps the profile clock running constantly.
267 1.19 cgd */
268 1.19 cgd void
269 1.63 thorpej startprofclock(struct proc *p)
270 1.19 cgd {
271 1.19 cgd
272 1.109 ad KASSERT(mutex_owned(&p->p_stmutex));
273 1.105 ad
274 1.105 ad if ((p->p_stflag & PST_PROFIL) == 0) {
275 1.105 ad p->p_stflag |= PST_PROFIL;
276 1.80 briggs /*
277 1.80 briggs * This is only necessary if using the clock as the
278 1.80 briggs * profiling source.
279 1.80 briggs */
280 1.70 sommerfe if (++profprocs == 1 && stathz != 0)
281 1.70 sommerfe psdiv = psratio;
282 1.19 cgd }
283 1.19 cgd }
284 1.19 cgd
285 1.19 cgd /*
286 1.19 cgd * Stop profiling on a process.
287 1.19 cgd */
288 1.19 cgd void
289 1.63 thorpej stopprofclock(struct proc *p)
290 1.19 cgd {
291 1.19 cgd
292 1.109 ad KASSERT(mutex_owned(&p->p_stmutex));
293 1.105 ad
294 1.105 ad if (p->p_stflag & PST_PROFIL) {
295 1.105 ad p->p_stflag &= ~PST_PROFIL;
296 1.80 briggs /*
297 1.80 briggs * This is only necessary if using the clock as the
298 1.80 briggs * profiling source.
299 1.80 briggs */
300 1.70 sommerfe if (--profprocs == 0 && stathz != 0)
301 1.70 sommerfe psdiv = 1;
302 1.19 cgd }
303 1.19 cgd }
304 1.19 cgd
305 1.80 briggs #if defined(PERFCTRS)
306 1.80 briggs /*
307 1.80 briggs * Independent profiling "tick" in case we're using a separate
308 1.80 briggs * clock or profiling event source. Currently, that's just
309 1.80 briggs * performance counters--hence the wrapper.
310 1.80 briggs */
311 1.80 briggs void
312 1.80 briggs proftick(struct clockframe *frame)
313 1.80 briggs {
314 1.80 briggs #ifdef GPROF
315 1.93 perry struct gmonparam *g;
316 1.93 perry intptr_t i;
317 1.80 briggs #endif
318 1.105 ad struct lwp *l;
319 1.80 briggs struct proc *p;
320 1.80 briggs
321 1.114 ad l = curcpu()->ci_data.cpu_onproc;
322 1.105 ad p = (l ? l->l_proc : NULL);
323 1.80 briggs if (CLKF_USERMODE(frame)) {
324 1.105 ad mutex_spin_enter(&p->p_stmutex);
325 1.105 ad if (p->p_stflag & PST_PROFIL)
326 1.105 ad addupc_intr(l, CLKF_PC(frame));
327 1.105 ad mutex_spin_exit(&p->p_stmutex);
328 1.80 briggs } else {
329 1.80 briggs #ifdef GPROF
330 1.80 briggs g = &_gmonparam;
331 1.80 briggs if (g->state == GMON_PROF_ON) {
332 1.80 briggs i = CLKF_PC(frame) - g->lowpc;
333 1.80 briggs if (i < g->textsize) {
334 1.80 briggs i /= HISTFRACTION * sizeof(*g->kcount);
335 1.80 briggs g->kcount[i]++;
336 1.80 briggs }
337 1.80 briggs }
338 1.80 briggs #endif
339 1.111 ad #ifdef LWP_PC
340 1.111 ad if (p != NULL && (p->p_stflag & PST_PROFIL) != 0)
341 1.112 ad addupc_intr(l, LWP_PC(l));
342 1.93 perry #endif
343 1.80 briggs }
344 1.80 briggs }
345 1.80 briggs #endif
346 1.80 briggs
347 1.108 yamt void
348 1.108 yamt schedclock(struct lwp *l)
349 1.108 yamt {
350 1.108 yamt if ((l->l_flag & LW_IDLE) != 0)
351 1.108 yamt return;
352 1.108 yamt
353 1.108 yamt sched_schedclock(l);
354 1.108 yamt }
355 1.108 yamt
356 1.19 cgd /*
357 1.19 cgd * Statistics clock. Grab profile sample, and if divider reaches 0,
358 1.19 cgd * do process and kernel statistics.
359 1.19 cgd */
360 1.19 cgd void
361 1.63 thorpej statclock(struct clockframe *frame)
362 1.19 cgd {
363 1.19 cgd #ifdef GPROF
364 1.55 augustss struct gmonparam *g;
365 1.68 eeh intptr_t i;
366 1.19 cgd #endif
367 1.60 thorpej struct cpu_info *ci = curcpu();
368 1.60 thorpej struct schedstate_percpu *spc = &ci->ci_schedstate;
369 1.55 augustss struct proc *p;
370 1.98 christos struct lwp *l;
371 1.19 cgd
372 1.70 sommerfe /*
373 1.70 sommerfe * Notice changes in divisor frequency, and adjust clock
374 1.70 sommerfe * frequency accordingly.
375 1.70 sommerfe */
376 1.70 sommerfe if (spc->spc_psdiv != psdiv) {
377 1.70 sommerfe spc->spc_psdiv = psdiv;
378 1.70 sommerfe spc->spc_pscnt = psdiv;
379 1.70 sommerfe if (psdiv == 1) {
380 1.70 sommerfe setstatclockrate(stathz);
381 1.70 sommerfe } else {
382 1.93 perry setstatclockrate(profhz);
383 1.70 sommerfe }
384 1.70 sommerfe }
385 1.114 ad l = ci->ci_data.cpu_onproc;
386 1.108 yamt if ((l->l_flag & LW_IDLE) != 0) {
387 1.108 yamt /*
388 1.108 yamt * don't account idle lwps as swapper.
389 1.108 yamt */
390 1.108 yamt p = NULL;
391 1.108 yamt } else {
392 1.108 yamt p = l->l_proc;
393 1.105 ad mutex_spin_enter(&p->p_stmutex);
394 1.108 yamt }
395 1.108 yamt
396 1.19 cgd if (CLKF_USERMODE(frame)) {
397 1.135 maxv KASSERT(p != NULL);
398 1.105 ad if ((p->p_stflag & PST_PROFIL) && profsrc == PROFSRC_CLOCK)
399 1.105 ad addupc_intr(l, CLKF_PC(frame));
400 1.105 ad if (--spc->spc_pscnt > 0) {
401 1.105 ad mutex_spin_exit(&p->p_stmutex);
402 1.19 cgd return;
403 1.105 ad }
404 1.105 ad
405 1.19 cgd /*
406 1.19 cgd * Came from user mode; CPU was in user state.
407 1.19 cgd * If this process is being profiled record the tick.
408 1.19 cgd */
409 1.19 cgd p->p_uticks++;
410 1.19 cgd if (p->p_nice > NZERO)
411 1.60 thorpej spc->spc_cp_time[CP_NICE]++;
412 1.19 cgd else
413 1.60 thorpej spc->spc_cp_time[CP_USER]++;
414 1.19 cgd } else {
415 1.19 cgd #ifdef GPROF
416 1.19 cgd /*
417 1.19 cgd * Kernel statistics are just like addupc_intr, only easier.
418 1.19 cgd */
419 1.19 cgd g = &_gmonparam;
420 1.80 briggs if (profsrc == PROFSRC_CLOCK && g->state == GMON_PROF_ON) {
421 1.19 cgd i = CLKF_PC(frame) - g->lowpc;
422 1.19 cgd if (i < g->textsize) {
423 1.19 cgd i /= HISTFRACTION * sizeof(*g->kcount);
424 1.19 cgd g->kcount[i]++;
425 1.19 cgd }
426 1.19 cgd }
427 1.19 cgd #endif
428 1.82 thorpej #ifdef LWP_PC
429 1.108 yamt if (p != NULL && profsrc == PROFSRC_CLOCK &&
430 1.108 yamt (p->p_stflag & PST_PROFIL)) {
431 1.105 ad addupc_intr(l, LWP_PC(l));
432 1.108 yamt }
433 1.72 mycroft #endif
434 1.105 ad if (--spc->spc_pscnt > 0) {
435 1.105 ad if (p != NULL)
436 1.105 ad mutex_spin_exit(&p->p_stmutex);
437 1.19 cgd return;
438 1.105 ad }
439 1.19 cgd /*
440 1.19 cgd * Came from kernel mode, so we were:
441 1.19 cgd * - handling an interrupt,
442 1.19 cgd * - doing syscall or trap work on behalf of the current
443 1.19 cgd * user process, or
444 1.19 cgd * - spinning in the idle loop.
445 1.19 cgd * Whichever it is, charge the time as appropriate.
446 1.19 cgd * Note that we charge interrupts to the current process,
447 1.19 cgd * regardless of whether they are ``for'' that process,
448 1.19 cgd * so that we know how much of its real time was spent
449 1.19 cgd * in ``non-process'' (i.e., interrupt) work.
450 1.19 cgd */
451 1.114 ad if (CLKF_INTR(frame) || (curlwp->l_pflag & LP_INTR) != 0) {
452 1.108 yamt if (p != NULL) {
453 1.19 cgd p->p_iticks++;
454 1.108 yamt }
455 1.60 thorpej spc->spc_cp_time[CP_INTR]++;
456 1.19 cgd } else if (p != NULL) {
457 1.19 cgd p->p_sticks++;
458 1.60 thorpej spc->spc_cp_time[CP_SYS]++;
459 1.108 yamt } else {
460 1.60 thorpej spc->spc_cp_time[CP_IDLE]++;
461 1.108 yamt }
462 1.19 cgd }
463 1.70 sommerfe spc->spc_pscnt = psdiv;
464 1.19 cgd
465 1.97 elad if (p != NULL) {
466 1.125 rmind atomic_inc_uint(&l->l_cpticks);
467 1.105 ad mutex_spin_exit(&p->p_stmutex);
468 1.108 yamt }
469 1.19 cgd }
470 1.132 pooka
471 1.132 pooka /*
472 1.132 pooka * sysctl helper routine for kern.clockrate. Assembles a struct on
473 1.132 pooka * the fly to be returned to the caller.
474 1.132 pooka */
475 1.132 pooka static int
476 1.132 pooka sysctl_kern_clockrate(SYSCTLFN_ARGS)
477 1.132 pooka {
478 1.132 pooka struct clockinfo clkinfo;
479 1.132 pooka struct sysctlnode node;
480 1.132 pooka
481 1.132 pooka clkinfo.tick = tick;
482 1.132 pooka clkinfo.tickadj = tickadj;
483 1.132 pooka clkinfo.hz = hz;
484 1.132 pooka clkinfo.profhz = profhz;
485 1.132 pooka clkinfo.stathz = stathz ? stathz : hz;
486 1.132 pooka
487 1.132 pooka node = *rnode;
488 1.132 pooka node.sysctl_data = &clkinfo;
489 1.132 pooka return (sysctl_lookup(SYSCTLFN_CALL(&node)));
490 1.132 pooka }
491