gmon.c revision 1.4 1 1.4 cgd /* $NetBSD: gmon.c,v 1.4 1995/11/04 00:11:40 cgd Exp $ */
2 1.3 cgd
3 1.1 cgd /*-
4 1.1 cgd * Copyright (c) 1983, 1992, 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.1 cgd
36 1.1 cgd #if !defined(lint) && defined(LIBC_SCCS)
37 1.3 cgd #if 0
38 1.3 cgd static char sccsid[] = "@(#)gmon.c 8.1 (Berkeley) 6/4/93";
39 1.3 cgd #else
40 1.4 cgd static char rcsid[] = "$NetBSD: gmon.c,v 1.4 1995/11/04 00:11:40 cgd Exp $";
41 1.3 cgd #endif
42 1.1 cgd #endif
43 1.1 cgd
44 1.1 cgd #include <sys/param.h>
45 1.1 cgd #include <sys/time.h>
46 1.1 cgd #include <sys/gmon.h>
47 1.1 cgd #include <sys/sysctl.h>
48 1.1 cgd
49 1.1 cgd #include <stdio.h>
50 1.1 cgd #include <fcntl.h>
51 1.1 cgd #include <unistd.h>
52 1.1 cgd
53 1.1 cgd extern char *minbrk asm ("minbrk");
54 1.1 cgd
55 1.1 cgd struct gmonparam _gmonparam = { GMON_PROF_OFF };
56 1.1 cgd
57 1.1 cgd static int s_scale;
58 1.1 cgd /* see profil(2) where this is describe (incorrectly) */
59 1.1 cgd #define SCALE_1_TO_1 0x10000L
60 1.1 cgd
61 1.1 cgd #define ERR(s) write(2, s, sizeof(s))
62 1.1 cgd
63 1.1 cgd void moncontrol __P((int));
64 1.1 cgd static int hertz __P((void));
65 1.1 cgd
66 1.1 cgd void
67 1.1 cgd monstartup(lowpc, highpc)
68 1.1 cgd u_long lowpc;
69 1.1 cgd u_long highpc;
70 1.1 cgd {
71 1.1 cgd register int o;
72 1.1 cgd char *cp;
73 1.1 cgd struct gmonparam *p = &_gmonparam;
74 1.1 cgd
75 1.1 cgd /*
76 1.1 cgd * round lowpc and highpc to multiples of the density we're using
77 1.1 cgd * so the rest of the scaling (here and in gprof) stays in ints.
78 1.1 cgd */
79 1.1 cgd p->lowpc = ROUNDDOWN(lowpc, HISTFRACTION * sizeof(HISTCOUNTER));
80 1.1 cgd p->highpc = ROUNDUP(highpc, HISTFRACTION * sizeof(HISTCOUNTER));
81 1.1 cgd p->textsize = p->highpc - p->lowpc;
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
92 1.1 cgd cp = sbrk(p->kcountsize + p->fromssize + p->tossize);
93 1.1 cgd if (cp == (char *)-1) {
94 1.1 cgd ERR("monstartup: out of memory\n");
95 1.1 cgd return;
96 1.1 cgd }
97 1.1 cgd #ifdef notdef
98 1.1 cgd bzero(cp, p->kcountsize + p->fromssize + p->tossize);
99 1.1 cgd #endif
100 1.1 cgd p->tos = (struct tostruct *)cp;
101 1.1 cgd cp += p->tossize;
102 1.1 cgd p->kcount = (u_short *)cp;
103 1.1 cgd cp += p->kcountsize;
104 1.1 cgd p->froms = (u_short *)cp;
105 1.1 cgd
106 1.1 cgd minbrk = sbrk(0);
107 1.1 cgd p->tos[0].link = 0;
108 1.1 cgd
109 1.1 cgd o = p->highpc - p->lowpc;
110 1.1 cgd if (p->kcountsize < o) {
111 1.2 cgd #ifndef notdef
112 1.1 cgd s_scale = ((float)p->kcountsize / o ) * SCALE_1_TO_1;
113 1.1 cgd #else /* avoid floating point */
114 1.1 cgd int quot = o / p->kcountsize;
115 1.1 cgd
116 1.1 cgd if (quot >= 0x10000)
117 1.1 cgd s_scale = 1;
118 1.1 cgd else if (quot >= 0x100)
119 1.1 cgd s_scale = 0x10000 / quot;
120 1.1 cgd else if (o >= 0x800000)
121 1.1 cgd s_scale = 0x1000000 / (o / (p->kcountsize >> 8));
122 1.1 cgd else
123 1.1 cgd s_scale = 0x1000000 / ((o << 8) / p->kcountsize);
124 1.1 cgd #endif
125 1.1 cgd } else
126 1.1 cgd s_scale = SCALE_1_TO_1;
127 1.1 cgd
128 1.1 cgd moncontrol(1);
129 1.1 cgd }
130 1.1 cgd
131 1.1 cgd void
132 1.1 cgd _mcleanup()
133 1.1 cgd {
134 1.1 cgd int fd;
135 1.1 cgd int fromindex;
136 1.1 cgd int endfrom;
137 1.1 cgd u_long frompc;
138 1.1 cgd int toindex;
139 1.1 cgd struct rawarc rawarc;
140 1.1 cgd struct gmonparam *p = &_gmonparam;
141 1.1 cgd struct gmonhdr gmonhdr, *hdr;
142 1.1 cgd struct clockinfo clockinfo;
143 1.1 cgd int mib[2];
144 1.1 cgd size_t size;
145 1.1 cgd #ifdef DEBUG
146 1.1 cgd int log, len;
147 1.1 cgd char buf[200];
148 1.1 cgd #endif
149 1.1 cgd
150 1.1 cgd if (p->state == GMON_PROF_ERROR)
151 1.1 cgd ERR("_mcleanup: tos overflow\n");
152 1.1 cgd
153 1.1 cgd size = sizeof(clockinfo);
154 1.1 cgd mib[0] = CTL_KERN;
155 1.1 cgd mib[1] = KERN_CLOCKRATE;
156 1.1 cgd if (sysctl(mib, 2, &clockinfo, &size, NULL, 0) < 0) {
157 1.1 cgd /*
158 1.1 cgd * Best guess
159 1.1 cgd */
160 1.1 cgd clockinfo.profhz = hertz();
161 1.1 cgd } else if (clockinfo.profhz == 0) {
162 1.1 cgd if (clockinfo.hz != 0)
163 1.1 cgd clockinfo.profhz = clockinfo.hz;
164 1.1 cgd else
165 1.1 cgd clockinfo.profhz = hertz();
166 1.1 cgd }
167 1.1 cgd
168 1.1 cgd moncontrol(0);
169 1.1 cgd fd = open("gmon.out", O_CREAT|O_TRUNC|O_WRONLY, 0666);
170 1.1 cgd if (fd < 0) {
171 1.1 cgd perror("mcount: gmon.out");
172 1.1 cgd return;
173 1.1 cgd }
174 1.1 cgd #ifdef DEBUG
175 1.1 cgd log = open("gmon.log", O_CREAT|O_TRUNC|O_WRONLY, 0664);
176 1.1 cgd if (log < 0) {
177 1.1 cgd perror("mcount: gmon.log");
178 1.1 cgd return;
179 1.1 cgd }
180 1.1 cgd len = sprintf(buf, "[mcleanup1] kcount 0x%x ssiz %d\n",
181 1.1 cgd p->kcount, p->kcountsize);
182 1.1 cgd write(log, buf, len);
183 1.1 cgd #endif
184 1.1 cgd hdr = (struct gmonhdr *)&gmonhdr;
185 1.1 cgd hdr->lpc = p->lowpc;
186 1.1 cgd hdr->hpc = p->highpc;
187 1.1 cgd hdr->ncnt = p->kcountsize + sizeof(gmonhdr);
188 1.1 cgd hdr->version = GMONVERSION;
189 1.1 cgd hdr->profrate = clockinfo.profhz;
190 1.1 cgd write(fd, (char *)hdr, sizeof *hdr);
191 1.1 cgd write(fd, p->kcount, p->kcountsize);
192 1.1 cgd endfrom = p->fromssize / sizeof(*p->froms);
193 1.1 cgd for (fromindex = 0; fromindex < endfrom; fromindex++) {
194 1.1 cgd if (p->froms[fromindex] == 0)
195 1.1 cgd continue;
196 1.1 cgd
197 1.1 cgd frompc = p->lowpc;
198 1.1 cgd frompc += fromindex * p->hashfraction * sizeof(*p->froms);
199 1.1 cgd for (toindex = p->froms[fromindex]; toindex != 0;
200 1.1 cgd toindex = p->tos[toindex].link) {
201 1.1 cgd #ifdef DEBUG
202 1.1 cgd len = sprintf(buf,
203 1.1 cgd "[mcleanup2] frompc 0x%x selfpc 0x%x count %d\n" ,
204 1.1 cgd frompc, p->tos[toindex].selfpc,
205 1.1 cgd p->tos[toindex].count);
206 1.1 cgd write(log, buf, len);
207 1.1 cgd #endif
208 1.1 cgd rawarc.raw_frompc = frompc;
209 1.1 cgd rawarc.raw_selfpc = p->tos[toindex].selfpc;
210 1.1 cgd rawarc.raw_count = p->tos[toindex].count;
211 1.1 cgd write(fd, &rawarc, sizeof rawarc);
212 1.1 cgd }
213 1.1 cgd }
214 1.1 cgd close(fd);
215 1.1 cgd }
216 1.1 cgd
217 1.1 cgd /*
218 1.1 cgd * Control profiling
219 1.1 cgd * profiling is what mcount checks to see if
220 1.1 cgd * all the data structures are ready.
221 1.1 cgd */
222 1.1 cgd void
223 1.1 cgd moncontrol(mode)
224 1.1 cgd int mode;
225 1.1 cgd {
226 1.1 cgd struct gmonparam *p = &_gmonparam;
227 1.1 cgd
228 1.1 cgd if (mode) {
229 1.1 cgd /* start */
230 1.4 cgd profil((char *)p->kcount, p->kcountsize, p->lowpc,
231 1.1 cgd s_scale);
232 1.1 cgd p->state = GMON_PROF_ON;
233 1.1 cgd } else {
234 1.1 cgd /* stop */
235 1.1 cgd profil((char *)0, 0, 0, 0);
236 1.1 cgd p->state = GMON_PROF_OFF;
237 1.1 cgd }
238 1.1 cgd }
239 1.1 cgd
240 1.1 cgd /*
241 1.1 cgd * discover the tick frequency of the machine
242 1.1 cgd * if something goes wrong, we return 0, an impossible hertz.
243 1.1 cgd */
244 1.1 cgd static int
245 1.1 cgd hertz()
246 1.1 cgd {
247 1.1 cgd struct itimerval tim;
248 1.1 cgd
249 1.1 cgd tim.it_interval.tv_sec = 0;
250 1.1 cgd tim.it_interval.tv_usec = 1;
251 1.1 cgd tim.it_value.tv_sec = 0;
252 1.1 cgd tim.it_value.tv_usec = 0;
253 1.1 cgd setitimer(ITIMER_REAL, &tim, 0);
254 1.1 cgd setitimer(ITIMER_REAL, 0, &tim);
255 1.1 cgd if (tim.it_interval.tv_usec < 2)
256 1.1 cgd return(0);
257 1.1 cgd return (1000000 / tim.it_interval.tv_usec);
258 1.1 cgd }
259 1.1 cgd
260 1.1 cgd
261