1 /*- 2 * Copyright (c) 1983, 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * $FreeBSD: src/lib/libc/gmon/gmon.c,v 1.8 2000/01/27 23:06:25 jasone Exp $ 34 */ 35 36 #if !defined(lint) && defined(LIBC_SCCS) 37 static char sccsid[] = "@(#)gmon.c 8.1 (Berkeley) 6/4/93"; 38 #endif 39 40 #include <sys/param.h> 41 #include <sys/time.h> 42 #include <sys/gmon.h> 43 #include <sys/sysctl.h> 44 45 #include <err.h> 46 #include <errno.h> 47 #include <stdio.h> 48 #include <fcntl.h> 49 #include <unistd.h> 50 51 #if defined(__ELF__) && defined(i386) 52 extern char *minbrk asm (".minbrk"); 53 #else 54 extern char *minbrk asm ("minbrk"); 55 #endif 56 57 extern char *__progname; 58 59 struct gmonparam _gmonparam = { GMON_PROF_OFF }; 60 61 static int s_scale; 62 /* see profil(2) where this is describe (incorrectly) */ 63 #define SCALE_1_TO_1 0x10000L 64 65 #define ERR(s) _write(2, s, sizeof(s)) 66 67 void moncontrol __P((int)); 68 static int hertz __P((void)); 69 70 void 71 monstartup(lowpc, highpc) 72 u_long lowpc; 73 u_long highpc; 74 { 75 register int o; 76 char *cp; 77 struct gmonparam *p = &_gmonparam; 78 79 /* 80 * round lowpc and highpc to multiples of the density we're using 81 * so the rest of the scaling (here and in gprof) stays in ints. 82 */ 83 p->lowpc = ROUNDDOWN(lowpc, HISTFRACTION * sizeof(HISTCOUNTER)); 84 p->highpc = ROUNDUP(highpc, HISTFRACTION * sizeof(HISTCOUNTER)); 85 p->textsize = p->highpc - p->lowpc; 86 p->kcountsize = p->textsize / HISTFRACTION; 87 p->hashfraction = HASHFRACTION; 88 p->fromssize = p->textsize / HASHFRACTION; 89 p->tolimit = p->textsize * ARCDENSITY / 100; 90 if (p->tolimit < MINARCS) 91 p->tolimit = MINARCS; 92 else if (p->tolimit > MAXARCS) 93 p->tolimit = MAXARCS; 94 p->tossize = p->tolimit * sizeof(struct tostruct); 95 96 cp = sbrk(p->kcountsize + p->fromssize + p->tossize); 97 if (cp == (char *)-1) { 98 ERR("monstartup: out of memory\n"); 99 return; 100 } 101 #ifdef notdef 102 bzero(cp, p->kcountsize + p->fromssize + p->tossize); 103 #endif 104 p->tos = (struct tostruct *)cp; 105 cp += p->tossize; 106 p->kcount = (u_short *)cp; 107 cp += p->kcountsize; 108 p->froms = (u_short *)cp; 109 110 minbrk = sbrk(0); 111 p->tos[0].link = 0; 112 113 o = p->highpc - p->lowpc; 114 if (p->kcountsize < o) { 115 #ifndef hp300 116 s_scale = ((float)p->kcountsize / o ) * SCALE_1_TO_1; 117 #else /* avoid floating point */ 118 int quot = o / p->kcountsize; 119 120 if (quot >= 0x10000) 121 s_scale = 1; 122 else if (quot >= 0x100) 123 s_scale = 0x10000 / quot; 124 else if (o >= 0x800000) 125 s_scale = 0x1000000 / (o / (p->kcountsize >> 8)); 126 else 127 s_scale = 0x1000000 / ((o << 8) / p->kcountsize); 128 #endif 129 } else 130 s_scale = SCALE_1_TO_1; 131 132 moncontrol(1); 133 } 134 135 void 136 _mcleanup() 137 { 138 int fd; 139 int fromindex; 140 int endfrom; 141 u_long frompc; 142 int toindex; 143 struct rawarc rawarc; 144 struct gmonparam *p = &_gmonparam; 145 struct gmonhdr gmonhdr, *hdr; 146 struct clockinfo clockinfo; 147 char outname[128]; 148 int mib[2]; 149 size_t size; 150 #ifdef DEBUG 151 int log, len; 152 char buf[200]; 153 #endif 154 155 if (p->state == GMON_PROF_ERROR) 156 ERR("_mcleanup: tos overflow\n"); 157 158 size = sizeof(clockinfo); 159 mib[0] = CTL_KERN; 160 mib[1] = KERN_CLOCKRATE; 161 if (sysctl(mib, 2, &clockinfo, &size, NULL, 0) < 0) { 162 /* 163 * Best guess 164 */ 165 clockinfo.profhz = hertz(); 166 } else if (clockinfo.profhz == 0) { 167 if (clockinfo.hz != 0) 168 clockinfo.profhz = clockinfo.hz; 169 else 170 clockinfo.profhz = hertz(); 171 } 172 173 moncontrol(0); 174 snprintf(outname,sizeof(outname),"%s.gmon",__progname); 175 fd = _open(outname, O_CREAT|O_TRUNC|O_WRONLY, 0666); 176 if (fd < 0) { 177 warnx("_mcleanup: %s - %s",outname,strerror(errno)); 178 return; 179 } 180 #ifdef DEBUG 181 log = _open("gmon.log", O_CREAT|O_TRUNC|O_WRONLY, 0664); 182 if (log < 0) { 183 perror("_mcleanup: gmon.log"); 184 return; 185 } 186 len = sprintf(buf, "[mcleanup1] kcount 0x%x ssiz %d\n", 187 p->kcount, p->kcountsize); 188 _write(log, buf, len); 189 #endif 190 hdr = (struct gmonhdr *)&gmonhdr; 191 hdr->lpc = p->lowpc; 192 hdr->hpc = p->highpc; 193 hdr->ncnt = p->kcountsize + sizeof(gmonhdr); 194 hdr->version = GMONVERSION; 195 hdr->profrate = clockinfo.profhz; 196 _write(fd, (char *)hdr, sizeof *hdr); 197 _write(fd, p->kcount, p->kcountsize); 198 endfrom = p->fromssize / sizeof(*p->froms); 199 for (fromindex = 0; fromindex < endfrom; fromindex++) { 200 if (p->froms[fromindex] == 0) 201 continue; 202 203 frompc = p->lowpc; 204 frompc += fromindex * p->hashfraction * sizeof(*p->froms); 205 for (toindex = p->froms[fromindex]; toindex != 0; 206 toindex = p->tos[toindex].link) { 207 #ifdef DEBUG 208 len = sprintf(buf, 209 "[mcleanup2] frompc 0x%x selfpc 0x%x count %d\n" , 210 frompc, p->tos[toindex].selfpc, 211 p->tos[toindex].count); 212 _write(log, buf, len); 213 #endif 214 rawarc.raw_frompc = frompc; 215 rawarc.raw_selfpc = p->tos[toindex].selfpc; 216 rawarc.raw_count = p->tos[toindex].count; 217 _write(fd, &rawarc, sizeof rawarc); 218 } 219 } 220 _close(fd); 221 } 222 223 /* 224 * Control profiling 225 * profiling is what mcount checks to see if 226 * all the data structures are ready. 227 */ 228 void 229 moncontrol(mode) 230 int mode; 231 { 232 struct gmonparam *p = &_gmonparam; 233 234 if (mode) { 235 /* start */ 236 profil((char *)p->kcount, p->kcountsize, p->lowpc, s_scale); 237 p->state = GMON_PROF_ON; 238 } else { 239 /* stop */ 240 profil((char *)0, 0, 0, 0); 241 p->state = GMON_PROF_OFF; 242 } 243 } 244 245 /* 246 * discover the tick frequency of the machine 247 * if something goes wrong, we return 0, an impossible hertz. 248 */ 249 static int 250 hertz() 251 { 252 struct itimerval tim; 253 254 tim.it_interval.tv_sec = 0; 255 tim.it_interval.tv_usec = 1; 256 tim.it_value.tv_sec = 0; 257 tim.it_value.tv_usec = 0; 258 setitimer(ITIMER_REAL, &tim, 0); 259 setitimer(ITIMER_REAL, 0, &tim); 260 if (tim.it_interval.tv_usec < 2) 261 return(0); 262 return (1000000 / tim.it_interval.tv_usec); 263 } 264