subr_prof.c revision 1.22.2.1 1 1.22.2.1 nathanw /* $NetBSD: subr_prof.c,v 1.22.2.1 2001/03/05 22:49:44 nathanw Exp $ */
2 1.3 cgd
3 1.1 cgd /*-
4 1.1 cgd * Copyright (c) 1982, 1986, 1993
5 1.1 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.17 fvdl * @(#)subr_prof.c 8.4 (Berkeley) 2/14/95
36 1.1 cgd */
37 1.1 cgd
38 1.1 cgd #include <sys/param.h>
39 1.1 cgd #include <sys/systm.h>
40 1.1 cgd #include <sys/kernel.h>
41 1.22.2.1 nathanw #include <sys/lwp.h>
42 1.1 cgd #include <sys/proc.h>
43 1.1 cgd #include <sys/user.h>
44 1.4 cgd #include <sys/mount.h>
45 1.4 cgd #include <sys/syscallargs.h>
46 1.21 mrg #include <uvm/uvm_extern.h>
47 1.16 jonathan #include <sys/sysctl.h>
48 1.4 cgd
49 1.1 cgd #include <machine/cpu.h>
50 1.9 christos
51 1.1 cgd #ifdef GPROF
52 1.1 cgd #include <sys/malloc.h>
53 1.1 cgd #include <sys/gmon.h>
54 1.1 cgd
55 1.1 cgd /*
56 1.1 cgd * Froms is actually a bunch of unsigned shorts indexing tos
57 1.1 cgd */
58 1.1 cgd struct gmonparam _gmonparam = { GMON_PROF_OFF };
59 1.1 cgd
60 1.15 gwr /* Actual start of the kernel text segment. */
61 1.15 gwr extern char kernel_text[];
62 1.15 gwr
63 1.1 cgd extern char etext[];
64 1.1 cgd
65 1.9 christos
66 1.9 christos void
67 1.1 cgd kmstartup()
68 1.1 cgd {
69 1.1 cgd char *cp;
70 1.1 cgd struct gmonparam *p = &_gmonparam;
71 1.1 cgd /*
72 1.1 cgd * Round lowpc and highpc to multiples of the density we're using
73 1.1 cgd * so the rest of the scaling (here and in gprof) stays in ints.
74 1.1 cgd */
75 1.15 gwr p->lowpc = ROUNDDOWN(((u_long)kernel_text),
76 1.15 gwr HISTFRACTION * sizeof(HISTCOUNTER));
77 1.15 gwr p->highpc = ROUNDUP((u_long)etext,
78 1.15 gwr HISTFRACTION * sizeof(HISTCOUNTER));
79 1.1 cgd p->textsize = p->highpc - p->lowpc;
80 1.14 christos printf("Profiling kernel, textsize=%ld [%lx..%lx]\n",
81 1.1 cgd p->textsize, p->lowpc, p->highpc);
82 1.1 cgd p->kcountsize = p->textsize / HISTFRACTION;
83 1.1 cgd p->hashfraction = HASHFRACTION;
84 1.1 cgd p->fromssize = p->textsize / HASHFRACTION;
85 1.1 cgd p->tolimit = p->textsize * ARCDENSITY / 100;
86 1.1 cgd if (p->tolimit < MINARCS)
87 1.1 cgd p->tolimit = MINARCS;
88 1.1 cgd else if (p->tolimit > MAXARCS)
89 1.1 cgd p->tolimit = MAXARCS;
90 1.1 cgd p->tossize = p->tolimit * sizeof(struct tostruct);
91 1.1 cgd cp = (char *)malloc(p->kcountsize + p->fromssize + p->tossize,
92 1.1 cgd M_GPROF, M_NOWAIT);
93 1.1 cgd if (cp == 0) {
94 1.14 christos printf("No memory for profiling.\n");
95 1.1 cgd return;
96 1.1 cgd }
97 1.19 perry memset(cp, 0, p->kcountsize + p->tossize + p->fromssize);
98 1.1 cgd p->tos = (struct tostruct *)cp;
99 1.1 cgd cp += p->tossize;
100 1.1 cgd p->kcount = (u_short *)cp;
101 1.1 cgd cp += p->kcountsize;
102 1.1 cgd p->froms = (u_short *)cp;
103 1.1 cgd }
104 1.1 cgd
105 1.1 cgd /*
106 1.1 cgd * Return kernel profiling information.
107 1.1 cgd */
108 1.11 pk int
109 1.11 pk sysctl_doprof(name, namelen, oldp, oldlenp, newp, newlen)
110 1.1 cgd int *name;
111 1.1 cgd u_int namelen;
112 1.1 cgd void *oldp;
113 1.1 cgd size_t *oldlenp;
114 1.1 cgd void *newp;
115 1.1 cgd size_t newlen;
116 1.1 cgd {
117 1.1 cgd struct gmonparam *gp = &_gmonparam;
118 1.1 cgd int error;
119 1.1 cgd
120 1.1 cgd /* all sysctl names at this level are terminal */
121 1.1 cgd if (namelen != 1)
122 1.1 cgd return (ENOTDIR); /* overloaded */
123 1.1 cgd
124 1.1 cgd switch (name[0]) {
125 1.1 cgd case GPROF_STATE:
126 1.1 cgd error = sysctl_int(oldp, oldlenp, newp, newlen, &gp->state);
127 1.1 cgd if (error)
128 1.1 cgd return (error);
129 1.1 cgd if (gp->state == GMON_PROF_OFF)
130 1.1 cgd stopprofclock(&proc0);
131 1.1 cgd else
132 1.1 cgd startprofclock(&proc0);
133 1.1 cgd return (0);
134 1.1 cgd case GPROF_COUNT:
135 1.1 cgd return (sysctl_struct(oldp, oldlenp, newp, newlen,
136 1.1 cgd gp->kcount, gp->kcountsize));
137 1.1 cgd case GPROF_FROMS:
138 1.1 cgd return (sysctl_struct(oldp, oldlenp, newp, newlen,
139 1.1 cgd gp->froms, gp->fromssize));
140 1.1 cgd case GPROF_TOS:
141 1.1 cgd return (sysctl_struct(oldp, oldlenp, newp, newlen,
142 1.1 cgd gp->tos, gp->tossize));
143 1.1 cgd case GPROF_GMONPARAM:
144 1.18 perry return (sysctl_rdstruct(oldp, oldlenp, newp, gp, sizeof(*gp)));
145 1.1 cgd default:
146 1.1 cgd return (EOPNOTSUPP);
147 1.1 cgd }
148 1.1 cgd /* NOTREACHED */
149 1.1 cgd }
150 1.1 cgd #endif /* GPROF */
151 1.1 cgd
152 1.1 cgd /*
153 1.1 cgd * Profiling system call.
154 1.1 cgd *
155 1.1 cgd * The scale factor is a fixed point number with 16 bits of fraction, so that
156 1.1 cgd * 1.0 is represented as 0x10000. A scale factor of 0 turns off profiling.
157 1.1 cgd */
158 1.1 cgd /* ARGSUSED */
159 1.9 christos int
160 1.22.2.1 nathanw sys_profil(l, v, retval)
161 1.22.2.1 nathanw struct lwp *l;
162 1.6 thorpej void *v;
163 1.6 thorpej register_t *retval;
164 1.6 thorpej {
165 1.20 augustss struct sys_profil_args /* {
166 1.4 cgd syscallarg(caddr_t) samples;
167 1.9 christos syscallarg(u_int) size;
168 1.9 christos syscallarg(u_int) offset;
169 1.4 cgd syscallarg(u_int) scale;
170 1.6 thorpej } */ *uap = v;
171 1.22.2.1 nathanw struct proc *p = l->l_proc;
172 1.20 augustss struct uprof *upp;
173 1.1 cgd int s;
174 1.1 cgd
175 1.4 cgd if (SCARG(uap, scale) > (1 << 16))
176 1.1 cgd return (EINVAL);
177 1.4 cgd if (SCARG(uap, scale) == 0) {
178 1.1 cgd stopprofclock(p);
179 1.1 cgd return (0);
180 1.1 cgd }
181 1.1 cgd upp = &p->p_stats->p_prof;
182 1.1 cgd
183 1.1 cgd /* Block profile interrupts while changing state. */
184 1.1 cgd s = splstatclock();
185 1.4 cgd upp->pr_off = SCARG(uap, offset);
186 1.4 cgd upp->pr_scale = SCARG(uap, scale);
187 1.4 cgd upp->pr_base = SCARG(uap, samples);
188 1.4 cgd upp->pr_size = SCARG(uap, size);
189 1.1 cgd startprofclock(p);
190 1.1 cgd splx(s);
191 1.1 cgd
192 1.1 cgd return (0);
193 1.1 cgd }
194 1.1 cgd
195 1.1 cgd /*
196 1.1 cgd * Scale is a fixed-point number with the binary point 16 bits
197 1.1 cgd * into the value, and is <= 1.0. pc is at most 32 bits, so the
198 1.1 cgd * intermediate result is at most 48 bits.
199 1.1 cgd */
200 1.1 cgd #define PC_TO_INDEX(pc, prof) \
201 1.1 cgd ((int)(((u_quad_t)((pc) - (prof)->pr_off) * \
202 1.1 cgd (u_quad_t)((prof)->pr_scale)) >> 16) & ~1)
203 1.1 cgd
204 1.1 cgd /*
205 1.1 cgd * Collect user-level profiling statistics; called on a profiling tick,
206 1.1 cgd * when a process is running in user-mode. This routine may be called
207 1.1 cgd * from an interrupt context. We try to update the user profiling buffers
208 1.1 cgd * cheaply with fuswintr() and suswintr(). If that fails, we revert to
209 1.1 cgd * an AST that will vector us to trap() with a context in which copyin
210 1.1 cgd * and copyout will work. Trap will then call addupc_task().
211 1.1 cgd *
212 1.1 cgd * Note that we may (rarely) not get around to the AST soon enough, and
213 1.1 cgd * lose profile ticks when the next tick overwrites this one, but in this
214 1.1 cgd * case the system is overloaded and the profile is probably already
215 1.1 cgd * inaccurate.
216 1.1 cgd */
217 1.1 cgd void
218 1.22 mycroft addupc_intr(p, pc)
219 1.20 augustss struct proc *p;
220 1.20 augustss u_long pc;
221 1.1 cgd {
222 1.20 augustss struct uprof *prof;
223 1.20 augustss caddr_t addr;
224 1.20 augustss u_int i;
225 1.20 augustss int v;
226 1.1 cgd
227 1.1 cgd prof = &p->p_stats->p_prof;
228 1.1 cgd if (pc < prof->pr_off ||
229 1.1 cgd (i = PC_TO_INDEX(pc, prof)) >= prof->pr_size)
230 1.1 cgd return; /* out of range; ignore */
231 1.1 cgd
232 1.1 cgd addr = prof->pr_base + i;
233 1.22 mycroft if ((v = fuswintr(addr)) == -1 || suswintr(addr, v + 1) == -1) {
234 1.1 cgd prof->pr_addr = pc;
235 1.22 mycroft prof->pr_ticks++;
236 1.1 cgd need_proftick(p);
237 1.1 cgd }
238 1.1 cgd }
239 1.1 cgd
240 1.1 cgd /*
241 1.1 cgd * Much like before, but we can afford to take faults here. If the
242 1.1 cgd * update fails, we simply turn off profiling.
243 1.1 cgd */
244 1.1 cgd void
245 1.1 cgd addupc_task(p, pc, ticks)
246 1.20 augustss struct proc *p;
247 1.20 augustss u_long pc;
248 1.1 cgd u_int ticks;
249 1.1 cgd {
250 1.20 augustss struct uprof *prof;
251 1.20 augustss caddr_t addr;
252 1.20 augustss u_int i;
253 1.1 cgd u_short v;
254 1.1 cgd
255 1.1 cgd /* Testing P_PROFIL may be unnecessary, but is certainly safe. */
256 1.1 cgd if ((p->p_flag & P_PROFIL) == 0 || ticks == 0)
257 1.1 cgd return;
258 1.1 cgd
259 1.1 cgd prof = &p->p_stats->p_prof;
260 1.1 cgd if (pc < prof->pr_off ||
261 1.1 cgd (i = PC_TO_INDEX(pc, prof)) >= prof->pr_size)
262 1.1 cgd return;
263 1.1 cgd
264 1.1 cgd addr = prof->pr_base + i;
265 1.1 cgd if (copyin(addr, (caddr_t)&v, sizeof(v)) == 0) {
266 1.1 cgd v += ticks;
267 1.1 cgd if (copyout((caddr_t)&v, addr, sizeof(v)) == 0)
268 1.1 cgd return;
269 1.1 cgd }
270 1.1 cgd stopprofclock(p);
271 1.1 cgd }
272