2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1982, 1986, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)subr_prof.c 8.3 (Berkeley) 9/23/93
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
37 #include <sys/param.h>
38 #include <sys/systm.h>
39 #include <sys/sysproto.h>
40 #include <sys/kernel.h>
42 #include <sys/mutex.h>
44 #include <sys/resourcevar.h>
45 #include <sys/sysctl.h>
47 #include <machine/cpu.h>
50 #include <sys/malloc.h>
54 static MALLOC_DEFINE(M_GPROF, "gprof", "kernel profiling buffer");
56 static void kmstartup(void *);
57 SYSINIT(kmem, SI_SUB_KPROF, SI_ORDER_FIRST, kmstartup, NULL);
59 struct gmonparam _gmonparam = { GMON_PROF_OFF };
63 nullfunc_loop_profiled()
67 for (i = 0; i < CALIB_SCALE; i++)
71 #define nullfunc_loop_profiled_end nullfunc_profiled /* XXX */
80 * Update the histograms to support extending the text region arbitrarily.
81 * This is done slightly naively (no sparse regions), so will waste slight
82 * amounts of memory, but will overall work nicely enough to allow profiling
86 kmupetext(uintfptr_t nhighpc)
88 struct gmonparam np; /* slightly large */
89 struct gmonparam *p = &_gmonparam;
93 bcopy(p, &np, sizeof(*p));
94 np.highpc = ROUNDUP(nhighpc, HISTFRACTION * sizeof(HISTCOUNTER));
95 if (np.highpc <= p->highpc)
97 np.textsize = np.highpc - p->lowpc;
98 np.kcountsize = np.textsize / HISTFRACTION;
99 np.hashfraction = HASHFRACTION;
100 np.fromssize = np.textsize / HASHFRACTION;
101 np.tolimit = np.textsize * ARCDENSITY / 100;
102 if (np.tolimit < MINARCS)
103 np.tolimit = MINARCS;
104 else if (np.tolimit > MAXARCS)
105 np.tolimit = MAXARCS;
106 np.tossize = np.tolimit * sizeof(struct tostruct);
107 cp = malloc(np.kcountsize + np.fromssize + np.tossize,
110 * Check for something else extending highpc while we slept.
112 if (np.highpc <= p->highpc) {
116 np.tos = (struct tostruct *)cp;
118 np.kcount = (HISTCOUNTER *)cp;
120 np.froms = (u_short *)cp;
122 /* Reinitialize pointers to overhead counters. */
123 np.cputime_count = &KCOUNT(&np, PC_TO_I(&np, cputime));
124 np.mcount_count = &KCOUNT(&np, PC_TO_I(&np, mcount));
125 np.mexitcount_count = &KCOUNT(&np, PC_TO_I(&np, mexitcount));
128 bcopy(p->tos, np.tos, p->tossize);
129 bzero((char *)np.tos + p->tossize, np.tossize - p->tossize);
130 bcopy(p->kcount, np.kcount, p->kcountsize);
131 bzero((char *)np.kcount + p->kcountsize, np.kcountsize -
133 bcopy(p->froms, np.froms, p->fromssize);
134 bzero((char *)np.froms + p->fromssize, np.fromssize - p->fromssize);
136 bcopy(&np, p, sizeof(*p));
146 struct gmonparam *p = &_gmonparam;
148 int cputime_overhead;
152 int mexitcount_overhead;
153 int nullfunc_loop_overhead;
154 int nullfunc_loop_profiled_time;
159 * Round lowpc and highpc to multiples of the density we're using
160 * so the rest of the scaling (here and in gprof) stays in ints.
162 p->lowpc = ROUNDDOWN((u_long)btext, HISTFRACTION * sizeof(HISTCOUNTER));
163 p->highpc = ROUNDUP((u_long)etext, HISTFRACTION * sizeof(HISTCOUNTER));
164 p->textsize = p->highpc - p->lowpc;
165 printf("Profiling kernel, textsize=%lu [%jx..%jx]\n",
166 p->textsize, (uintmax_t)p->lowpc, (uintmax_t)p->highpc);
167 p->kcountsize = p->textsize / HISTFRACTION;
168 p->hashfraction = HASHFRACTION;
169 p->fromssize = p->textsize / HASHFRACTION;
170 p->tolimit = p->textsize * ARCDENSITY / 100;
171 if (p->tolimit < MINARCS)
172 p->tolimit = MINARCS;
173 else if (p->tolimit > MAXARCS)
174 p->tolimit = MAXARCS;
175 p->tossize = p->tolimit * sizeof(struct tostruct);
176 cp = (char *)malloc(p->kcountsize + p->fromssize + p->tossize,
177 M_GPROF, M_WAITOK | M_ZERO);
178 p->tos = (struct tostruct *)cp;
180 p->kcount = (HISTCOUNTER *)cp;
182 p->froms = (u_short *)cp;
183 p->histcounter_type = FUNCTION_ALIGNMENT / HISTFRACTION * NBBY;
186 /* Signed counters. */
187 p->histcounter_type = -p->histcounter_type;
189 /* Initialize pointers to overhead counters. */
190 p->cputime_count = &KCOUNT(p, PC_TO_I(p, cputime));
191 p->mcount_count = &KCOUNT(p, PC_TO_I(p, mcount));
192 p->mexitcount_count = &KCOUNT(p, PC_TO_I(p, mexitcount));
195 * Disable interrupts to avoid interference while we calibrate
201 * Determine overheads.
202 * XXX this needs to be repeated for each useful timer/counter.
204 cputime_overhead = 0;
206 for (i = 0; i < CALIB_SCALE; i++)
207 cputime_overhead += cputime();
212 empty_loop_time = cputime();
214 nullfunc_loop_profiled();
217 * Start profiling. There won't be any normal function calls since
218 * interrupts are disabled, but we will call the profiling routines
219 * directly to determine their overheads.
221 p->state = GMON_PROF_HIRES;
224 nullfunc_loop_profiled();
227 for (i = 0; i < CALIB_SCALE; i++)
228 MCOUNT_OVERHEAD(sys_profil);
229 mcount_overhead = KCOUNT(p, PC_TO_I(p, sys_profil));
232 for (i = 0; i < CALIB_SCALE; i++)
233 MEXITCOUNT_OVERHEAD();
234 MEXITCOUNT_OVERHEAD_GETLABEL(tmp_addr);
235 mexitcount_overhead = KCOUNT(p, PC_TO_I(p, tmp_addr));
237 p->state = GMON_PROF_OFF;
242 nullfunc_loop_profiled_time = 0;
243 for (tmp_addr = (uintfptr_t)nullfunc_loop_profiled;
244 tmp_addr < (uintfptr_t)nullfunc_loop_profiled_end;
245 tmp_addr += HISTFRACTION * sizeof(HISTCOUNTER))
246 nullfunc_loop_profiled_time += KCOUNT(p, PC_TO_I(p, tmp_addr));
247 #define CALIB_DOSCALE(count) (((count) + CALIB_SCALE / 3) / CALIB_SCALE)
248 #define c2n(count, freq) ((int)((count) * 1000000000LL / freq))
249 printf("cputime %d, empty_loop %d, nullfunc_loop_profiled %d, mcount %d, mexitcount %d\n",
250 CALIB_DOSCALE(c2n(cputime_overhead, p->profrate)),
251 CALIB_DOSCALE(c2n(empty_loop_time, p->profrate)),
252 CALIB_DOSCALE(c2n(nullfunc_loop_profiled_time, p->profrate)),
253 CALIB_DOSCALE(c2n(mcount_overhead, p->profrate)),
254 CALIB_DOSCALE(c2n(mexitcount_overhead, p->profrate)));
255 cputime_overhead -= empty_loop_time;
256 mcount_overhead -= empty_loop_time;
257 mexitcount_overhead -= empty_loop_time;
260 * Profiling overheads are determined by the times between the
262 * MC1: mcount() is called
263 * MC2: cputime() (called from mcount()) latches the timer
264 * MC3: mcount() completes
265 * ME1: mexitcount() is called
266 * ME2: cputime() (called from mexitcount()) latches the timer
267 * ME3: mexitcount() completes.
268 * The times between the events vary slightly depending on instruction
269 * combination and cache misses, etc. Attempt to determine the
270 * minimum times. These can be subtracted from the profiling times
271 * without much risk of reducing the profiling times below what they
272 * would be when profiling is not configured. Abbreviate:
273 * ab = minimum time between MC1 and MC3
274 * a = minimum time between MC1 and MC2
275 * b = minimum time between MC2 and MC3
276 * cd = minimum time between ME1 and ME3
277 * c = minimum time between ME1 and ME2
278 * d = minimum time between ME2 and ME3.
279 * These satisfy the relations:
280 * ab <= mcount_overhead (just measured)
282 * cd <= mexitcount_overhead (just measured)
284 * a + d <= nullfunc_loop_profiled_time (just measured)
285 * a >= 0, b >= 0, c >= 0, d >= 0.
286 * Assume that ab and cd are equal to the minimums.
288 p->cputime_overhead = CALIB_DOSCALE(cputime_overhead);
289 p->mcount_overhead = CALIB_DOSCALE(mcount_overhead - cputime_overhead);
290 p->mexitcount_overhead = CALIB_DOSCALE(mexitcount_overhead
292 nullfunc_loop_overhead = nullfunc_loop_profiled_time - empty_loop_time;
293 p->mexitcount_post_overhead = CALIB_DOSCALE((mcount_overhead
294 - nullfunc_loop_overhead)
296 p->mexitcount_pre_overhead = p->mexitcount_overhead
297 + p->cputime_overhead
298 - p->mexitcount_post_overhead;
299 p->mcount_pre_overhead = CALIB_DOSCALE(nullfunc_loop_overhead)
300 - p->mexitcount_post_overhead;
301 p->mcount_post_overhead = p->mcount_overhead
302 + p->cputime_overhead
303 - p->mcount_pre_overhead;
305 "Profiling overheads: mcount: %d+%d, %d+%d; mexitcount: %d+%d, %d+%d nsec\n",
306 c2n(p->cputime_overhead, p->profrate),
307 c2n(p->mcount_overhead, p->profrate),
308 c2n(p->mcount_pre_overhead, p->profrate),
309 c2n(p->mcount_post_overhead, p->profrate),
310 c2n(p->cputime_overhead, p->profrate),
311 c2n(p->mexitcount_overhead, p->profrate),
312 c2n(p->mexitcount_pre_overhead, p->profrate),
313 c2n(p->mexitcount_post_overhead, p->profrate));
315 "Profiling overheads: mcount: %d+%d, %d+%d; mexitcount: %d+%d, %d+%d cycles\n",
316 p->cputime_overhead, p->mcount_overhead,
317 p->mcount_pre_overhead, p->mcount_post_overhead,
318 p->cputime_overhead, p->mexitcount_overhead,
319 p->mexitcount_pre_overhead, p->mexitcount_post_overhead);
324 * Return kernel profiling information.
327 sysctl_kern_prof(SYSCTL_HANDLER_ARGS)
329 int *name = (int *) arg1;
330 u_int namelen = arg2;
331 struct gmonparam *gp = &_gmonparam;
335 /* all sysctl names at this level are terminal */
337 return (ENOTDIR); /* overloaded */
342 error = sysctl_handle_int(oidp, &state, 0, req);
347 if (state == GMON_PROF_OFF) {
350 stopprofclock(&proc0);
353 } else if (state == GMON_PROF_ON) {
354 gp->state = GMON_PROF_OFF;
356 gp->profrate = profhz;
358 startprofclock(&proc0);
362 } else if (state == GMON_PROF_HIRES) {
363 gp->state = GMON_PROF_OFF;
365 stopprofclock(&proc0);
370 } else if (state != gp->state)
374 return (sysctl_handle_opaque(oidp,
375 gp->kcount, gp->kcountsize, req));
377 return (sysctl_handle_opaque(oidp,
378 gp->froms, gp->fromssize, req));
380 return (sysctl_handle_opaque(oidp,
381 gp->tos, gp->tossize, req));
382 case GPROF_GMONPARAM:
383 return (sysctl_handle_opaque(oidp, gp, sizeof *gp, req));
390 static SYSCTL_NODE(_kern, KERN_PROF, prof, CTLFLAG_RW, sysctl_kern_prof, "");
394 * Profiling system call.
396 * The scale factor is a fixed point number with 16 bits of fraction, so that
397 * 1.0 is represented as 0x10000. A scale factor of 0 turns off profiling.
399 #ifndef _SYS_SYSPROTO_H_
409 sys_profil(struct thread *td, struct profil_args *uap)
414 if (uap->scale > (1 << 16))
418 if (uap->scale == 0) {
425 upp = &td->td_proc->p_stats->p_prof;
427 upp->pr_off = uap->offset;
428 upp->pr_scale = uap->scale;
429 upp->pr_base = uap->samples;
430 upp->pr_size = uap->size;
439 * Scale is a fixed-point number with the binary point 16 bits
440 * into the value, and is <= 1.0. pc is at most 32 bits, so the
441 * intermediate result is at most 48 bits.
443 #define PC_TO_INDEX(pc, prof) \
444 ((int)(((u_quad_t)((pc) - (prof)->pr_off) * \
445 (u_quad_t)((prof)->pr_scale)) >> 16) & ~1)
448 * Collect user-level profiling statistics; called on a profiling tick,
449 * when a process is running in user-mode. This routine may be called
450 * from an interrupt context. We perform the update with an AST
451 * that will vector us to trap() with a context in which copyin and
452 * copyout will work. Trap will then call addupc_task().
454 * Note that we may (rarely) not get around to the AST soon enough, and
455 * lose profile ticks when the next tick overwrites this one, but in this
456 * case the system is overloaded and the profile is probably already
460 addupc_intr(struct thread *td, uintfptr_t pc, u_int ticks)
466 prof = &td->td_proc->p_stats->p_prof;
467 PROC_PROFLOCK(td->td_proc);
468 if (pc < prof->pr_off || PC_TO_INDEX(pc, prof) >= prof->pr_size) {
469 PROC_PROFUNLOCK(td->td_proc);
470 return; /* out of range; ignore */
473 PROC_PROFUNLOCK(td->td_proc);
474 td->td_profil_addr = pc;
475 td->td_profil_ticks = ticks;
476 td->td_pflags |= TDP_OWEUPC;
478 td->td_flags |= TDF_ASTPENDING;
483 * Actually update the profiling statistics. If the update fails, we
484 * simply turn off profiling.
487 addupc_task(struct thread *td, uintfptr_t pc, u_int ticks)
489 struct proc *p = td->td_proc;
500 if (!(p->p_flag & P_PROFIL)) {
505 prof = &p->p_stats->p_prof;
507 if (pc < prof->pr_off ||
508 (i = PC_TO_INDEX(pc, prof)) >= prof->pr_size) {
513 addr = prof->pr_base + i;
516 if (copyin(addr, &v, sizeof(v)) == 0) {
518 if (copyout(&v, addr, sizeof(v)) == 0) {
527 if (--p->p_profthreads == 0) {
528 if (p->p_flag & P_STOPPROF) {
529 wakeup(&p->p_profthreads);
530 p->p_flag &= ~P_STOPPROF;