gmon/gmon.c

   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 #include <sys/param.h>
  34 #include <sys/time.h>
  35 #include <sys/gmon.h>
  36 #include <sys/gmon_out.h>
  37
  38 #include <stdio.h>
  39 #include <fcntl.h>
  40 #include <unistd.h>
  41
  42 #include <stdio.h>
  43 #include <stdlib.h>
  44 #include <string.h>
  45 #include <unistd.h>
  46
  47 extern int __profile_frequency __P ((void));
  48
  49 struct __bb *__bb_head; /*  Head of basic-block list or NULL. */
  50
  51 struct gmonparam _gmonparam = { GMON_PROF_OFF };
  52
  53 /*
  54  * See profil(2) where this is described:
  55  */
  56 static int      s_scale;
  57 #define         SCALE_1_TO_1    0x10000L
  58
  59 #define ERR(s) write(2, s, sizeof(s) - 1)
  60
  61 /*
  62  * Control profiling
  63  *      profiling is what mcount checks to see if
  64  *      all the data structures are ready.
  65  */
  66 void
  67 moncontrol (mode)
  68      int mode;
  69 {
  70   struct gmonparam *p = &_gmonparam;
  71
  72   if (mode)
  73     {
  74       /* start */
  75       profil((void *) p->kcount, p->kcountsize, p->lowpc, s_scale);
  76       p->state = GMON_PROF_ON;
  77     }
  78   else
  79     {
  80       /* stop */
  81       profil((void *) 0, 0, 0, 0);
  82       p->state = GMON_PROF_OFF;
  83     }
  84 }
  85
  86
  87 void
  88 monstartup (lowpc, highpc)
  89      u_long lowpc;
  90      u_long highpc;
  91 {
  92   register int o;
  93   char *cp;
  94   struct gmonparam *p = &_gmonparam;
  95
  96   /*
  97    * round lowpc and highpc to multiples of the density we're using
  98    * so the rest of the scaling (here and in gprof) stays in ints.
  99    */
 100   p->lowpc = ROUNDDOWN(lowpc, HISTFRACTION * sizeof(HISTCOUNTER));
 101   p->highpc = ROUNDUP(highpc, HISTFRACTION * sizeof(HISTCOUNTER));
 102   p->textsize = p->highpc - p->lowpc;
 103   p->kcountsize = p->textsize / HISTFRACTION;
 104   p->hashfraction = HASHFRACTION;
 105   p->log_hashfraction = -1;
 106   if ((HASHFRACTION & (HASHFRACTION - 1)) == 0) {
 107       /* if HASHFRACTION is a power of two, mcount can use shifting
 108          instead of integer division.  Precompute shift amount. */
 109       p->log_hashfraction = ffs(p->hashfraction * sizeof(*p->froms)) - 1;
 110   }
 111   p->fromssize = p->textsize / HASHFRACTION;
 112   p->tolimit = p->textsize * ARCDENSITY / 100;
 113   if (p->tolimit < MINARCS)
 114     p->tolimit = MINARCS;
 115   else if (p->tolimit > MAXARCS)
 116     p->tolimit = MAXARCS;
 117   p->tossize = p->tolimit * sizeof(struct tostruct);
 118
 119   cp = malloc (p->kcountsize + p->fromssize + p->tossize);
 120   if (! cp)
 121     {
 122       ERR("monstartup: out of memory\n");
 123       return;
 124     }
 125   bzero(cp, p->kcountsize + p->fromssize + p->tossize);
 126   p->tos = (struct tostruct *)cp;
 127   cp += p->tossize;
 128   p->kcount = (u_short *)cp;
 129   cp += p->kcountsize;
 130   p->froms = (u_short *)cp;
 131
 132   p->tos[0].link = 0;
 133
 134   o = p->highpc - p->lowpc;
 135   if (p->kcountsize < (u_long) o)
 136     {
 137 #ifndef hp300
 138       s_scale = ((float)p->kcountsize / o ) * SCALE_1_TO_1;
 139 #else
 140       /* avoid floating point operations */
 141       int quot = o / p->kcountsize;
 142
 143       if (quot >= 0x10000)
 144         s_scale = 1;
 145       else if (quot >= 0x100)
 146         s_scale = 0x10000 / quot;
 147       else if (o >= 0x800000)
 148         s_scale = 0x1000000 / (o / (p->kcountsize >> 8));
 149       else
 150         s_scale = 0x1000000 / ((o << 8) / p->kcountsize);
 151 #endif
 152     } else
 153       s_scale = SCALE_1_TO_1;
 154
 155   moncontrol(1);
 156 }
 157
 158
 159 static void
 160 write_hist (fd)
 161      int fd;
 162 {
 163   const u_char tag = GMON_TAG_TIME_HIST;
 164   struct gmon_hist_hdr thdr;
 165
 166   if (_gmonparam.kcountsize > 0)
 167     {
 168       thdr.low_pc = _gmonparam.lowpc;
 169       thdr.high_pc = _gmonparam.highpc;
 170       thdr.hist_size = _gmonparam.kcountsize / sizeof(HISTCOUNTER);
 171       thdr.prof_rate = __profile_frequency();
 172       strncpy(thdr.dimen, "seconds", sizeof(thdr.dimen));
 173       thdr.dimen_abbrev = 's';
 174
 175       write(fd, &tag, sizeof(tag));
 176       write(fd, &thdr, sizeof(thdr));
 177       write(fd, _gmonparam.kcount, _gmonparam.kcountsize);
 178     }
 179 }
 180
 181
 182 static void
 183 write_call_graph (fd)
 184      int fd;
 185 {
 186   const u_char tag = GMON_TAG_CG_ARC;
 187   struct gmon_cg_arc_record raw_arc;
 188   int from_index, to_index, from_len;
 189   u_long frompc;
 190
 191   from_len = _gmonparam.fromssize / sizeof(*_gmonparam.froms);
 192   for (from_index = 0; from_index < from_len; ++from_index)
 193     {
 194       if (_gmonparam.froms[from_index] == 0)
 195         continue;
 196
 197       frompc = _gmonparam.lowpc;
 198       frompc += (from_index * _gmonparam.hashfraction
 199                  * sizeof(*_gmonparam.froms));
 200       for (to_index = _gmonparam.froms[from_index];
 201            to_index != 0;
 202            to_index = _gmonparam.tos[to_index].link)
 203         {
 204           raw_arc.from_pc = frompc;
 205           raw_arc.self_pc = _gmonparam.tos[to_index].selfpc;
 206           raw_arc.count = _gmonparam.tos[to_index].count;
 207
 208           write(fd, &tag, sizeof(tag));
 209           write(fd, &raw_arc, sizeof(raw_arc));
 210         }
 211     }
 212 }
 213
 214
 215 static void
 216 write_bb_counts (fd)
 217      int fd;
 218 {
 219   struct __bb *grp;
 220   const u_char tag = GMON_TAG_BB_COUNT;
 221   int ncounts;
 222   int i;
 223
 224   /* Write each group of basic-block info (all basic-blocks in a
 225      compilation unit form a single group). */
 226
 227   for (grp = __bb_head; grp; grp = grp->next)
 228     {
 229       ncounts = grp->ncounts;
 230       write(fd, &tag, sizeof(tag));
 231       write(fd, &ncounts, sizeof(ncounts));
 232       for (i = 0; i < ncounts; ++i)
 233         {
 234           write(fd, &grp->addresses[i], sizeof(grp->addresses[0]));
 235           write(fd, &grp->counts[i], sizeof(grp->counts[0]));
 236         }
 237     }
 238 }
 239
 240
 241 void
 242 _mcleanup ()
 243 {
 244     struct gmon_hdr ghdr;
 245     int fd;
 246
 247     moncontrol(0);
 248     fd = open("gmon.out", O_CREAT|O_TRUNC|O_WRONLY, 0666);
 249     if (fd < 0)
 250       {
 251         perror("_mcleanup: gmon.out");
 252         return;
 253       }
 254
 255     /* write gmon.out header: */
 256     memset(&ghdr, 0, sizeof(ghdr));
 257     memcpy(&ghdr.cookie[0], GMON_MAGIC, sizeof(ghdr.cookie));
 258     ghdr.version = GMON_VERSION;
 259     write(fd, &ghdr, sizeof(ghdr));
 260
 261     /* write PC histogram: */
 262     write_hist(fd);
 263
 264     /* write call-graph: */
 265     write_call_graph(fd);
 266
 267     /* write basic-block execution counts: */
 268     write_bb_counts(fd);
 269
 270     close(fd);
 271 }