gprof/gmon.h

   1 /*-
   2  * Copyright (c) 1991 The Regents of the University of California.
   3  * 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  *      @(#)gmon.h      5.2 (Berkeley) 5/6/91
  34  */
  35 #ifndef gmon_h
  36 #define gmon_h
  37
  38 struct raw_phdr
  39   {
  40     char low_pc[sizeof (bfd_vma)];      /* base pc address of sample buffer */
  41     char high_pc[sizeof (bfd_vma)];     /* max pc address of sampled buffer */
  42     char ncnt[4];               /* size of sample buffer (plus this header) */
  43
  44 #if defined (__alpha__) && defined (__osf__)
  45     /*
  46      * DEC's OSF v3.0 uses 4 bytes of padding to bring the header to
  47      * a size that is a multiple of 8.
  48      */
  49     char pad[4];
  50 #elif defined (BSD44_FORMAT)
  51     char version[4];                    /* version number */
  52     char profrate[4];                   /* profiling clock rate */
  53     char spare[3*4];                    /* reserved */
  54 #endif
  55   };
  56
  57 /*
  58  * Histogram counters are unsigned shorts:
  59  */
  60 #define HISTCOUNTER unsigned short
  61
  62 /*
  63  * Fraction of text space to allocate for histogram counters here, 1/2:
  64  */
  65 #define HISTFRACTION    2
  66
  67 /*
  68  * Fraction of text space to allocate for from hash buckets.  The
  69  * value of HASHFRACTION is based on the minimum number of bytes of
  70  * separation between two subroutine call points in the object code.
  71  * Given MIN_SUBR_SEPARATION bytes of separation the value of
  72  * HASHFRACTION is calculated as:
  73  *
  74  *      HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
  75  *
  76  * For the VAX, the shortest two call sequence is:
  77  *
  78  *      calls   $0,(r0)
  79  *      calls   $0,(r0)
  80  *
  81  * which is separated by only three bytes, thus HASHFRACTION is
  82  * calculated as:
  83  *
  84  *      HASHFRACTION = 3 / (2 * 2 - 1) = 1
  85  *
  86  * Note that the division above rounds down, thus if MIN_SUBR_FRACTION
  87  * is less than three, this algorithm will not work!
  88  */
  89 #define HASHFRACTION 1
  90
  91 /*
  92  * Percent of text space to allocate for tostructs with a minimum:
  93  */
  94 #define ARCDENSITY      2
  95 #define MINARCS         50
  96
  97 struct tostruct
  98   {
  99     char *selfpc;
 100     int count;
 101     unsigned short link;
 102   };
 103
 104 /*
 105  * A raw arc, with pointers to the calling site and the called site
 106  * and a count.  Everything is defined in terms of characters so
 107  * as to get a packed representation (otherwise, different compilers
 108  * might introduce different padding):
 109  */
 110 struct raw_arc
 111   {
 112     char from_pc[sizeof (bfd_vma)];
 113     char self_pc[sizeof (bfd_vma)];
 114     char count[sizeof (long)];
 115   };
 116
 117 /*
 118  * General rounding functions:
 119  */
 120 #define ROUNDDOWN(x,y)  (((x)/(y))*(y))
 121 #define ROUNDUP(x,y)    ((((x)+(y)-1)/(y))*(y))
 122
 123 #endif /* gmon_h */