lib/csu/ns32k/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  *      $Id: gmon.h,v 1.1 1993/09/17 18:42:10 phil Exp $
  36  */
  37
  38 struct phdr {
  39     char        *lpc;
  40     char        *hpc;
  41     int         ncnt;
  42 };
  43
  44     /*
  45      *  histogram counters are unsigned shorts (according to the kernel).
  46      */
  47 #define HISTCOUNTER     unsigned short
  48
  49     /*
  50      *  fraction of text space to allocate for histogram counters
  51      *  here, 1/2
  52      */
  53 #define HISTFRACTION    2
  54
  55     /*
  56      *  Fraction of text space to allocate for from hash buckets.
  57      *  The value of HASHFRACTION is based on the minimum number of bytes
  58      *  of separation between two subroutine call points in the object code.
  59      *  Given MIN_SUBR_SEPARATION bytes of separation the value of
  60      *  HASHFRACTION is calculated as:
  61      *
  62      *          HASHFRACTION = MIN_SUBR_SEPARATION / (2 * sizeof(short) - 1);
  63      *
  64      *  For the VAX, the shortest two call sequence is:
  65      *
  66      *          calls   $0,(r0)
  67      *          calls   $0,(r0)
  68      *
  69      *  which is separated by only three bytes, thus HASHFRACTION is
  70      *  calculated as:
  71      *
  72      *          HASHFRACTION = 3 / (2 * 2 - 1) = 1
  73      *
  74      *  Note that the division above rounds down, thus if MIN_SUBR_FRACTION
  75      *  is less than three, this algorithm will not work!
  76      */
  77 #define HASHFRACTION    1
  78
  79     /*
  80      *  percent of text space to allocate for tostructs
  81      *  with a minimum.
  82      */
  83 #define ARCDENSITY      2
  84 #define MINARCS         50
  85
  86 struct tostruct {
  87     char                *selfpc;
  88     long                count;
  89     unsigned short      link;
  90 };
  91
  92     /*
  93      *  a raw arc,
  94      *      with pointers to the calling site and the called site
  95      *      and a count.
  96      */
  97 struct rawarc {
  98     unsigned long       raw_frompc;
  99     unsigned long       raw_selfpc;
 100     long                raw_count;
 101 };
 102
 103     /*
 104      *  general rounding functions.
 105      */
 106 #define ROUNDDOWN(x,y)  (((x)/(y))*(y))
 107 #define ROUNDUP(x,y)    ((((x)+(y)-1)/(y))*(y))