usr.bin/gprof/sparc.c

   1 /*
   2  * Copyright (c) 1992, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This software was developed by the Computer Systems Engineering group
   6  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
   7  * contributed to Berkeley.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted provided that the following conditions
  11  * are met:
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  * 2. Redistributions in binary form must reproduce the above copyright
  15  *    notice, this list of conditions and the following disclaimer in the
  16  *    documentation and/or other materials provided with the distribution.
  17  * 3. All advertising materials mentioning features or use of this software
  18  *    must display the following acknowledgement:
  19  *      This product includes software developed by the University of
  20  *      California, Berkeley and its contributors.
  21  * 4. Neither the name of the University nor the names of its contributors
  22  *    may be used to endorse or promote products derived from this software
  23  *    without specific prior written permission.
  24  *
  25  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  29  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  30  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  31  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  35  * SUCH DAMAGE.
  36  *
  37  * @(#)sparc.c  8.1 (Berkeley) 6/6/93
  38  *
  39  * $DragonFly: src/usr.bin/gprof/sparc.c,v 1.4 2005/04/10 20:55:38 drhodus Exp $
  40  */
  41
  42 #include        "gprof.h"
  43
  44     /*
  45      *  a namelist entry to be the child of indirect calls
  46      */
  47 nltype  indirectchild = {
  48         "(*)" ,                         /* the name */
  49         (unsigned long) 0 ,             /* the pc entry point */
  50         (unsigned long) 0 ,             /* entry point aligned to histogram */
  51         (double) 0.0 ,                  /* ticks in this routine */
  52         (double) 0.0 ,                  /* cumulative ticks in children */
  53         (long) 0 ,                      /* how many times called */
  54         (long) 0 ,                      /* times called by live arcs */
  55         (long) 0 ,                      /* how many calls to self */
  56         (double) 1.0 ,                  /* propagation fraction */
  57         (double) 0.0 ,                  /* self propagation time */
  58         (double) 0.0 ,                  /* child propagation time */
  59         (short) 0 ,                     /* print flag */
  60         (short) 0 ,                     /* flags */
  61         (int) 0 ,                       /* index in the graph list */
  62         (int) 0 ,                       /* graph call chain top-sort order */
  63         (int) 0 ,                       /* internal number of cycle on */
  64         (int) 0 ,                       /* number of live parent arcs */
  65         (struct nl *) &indirectchild ,  /* pointer to head of cycle */
  66         (struct nl *) 0 ,               /* pointer to next member of cycle */
  67         (arctype *) 0 ,                 /* list of caller arcs */
  68         (arctype *) 0                   /* list of callee arcs */
  69 };
  70
  71 findcall(nltype *parentp, unsigned long p_lowpc, unsigned long p_highpc)
  72 {
  73         u_long pc;
  74         nltype *childp;
  75         unsigned long destpc;
  76         long op;
  77         int off;
  78
  79         if (textspace == 0)
  80                 return;
  81         if (p_lowpc < s_lowpc)
  82                 p_lowpc = s_lowpc;
  83         if (p_highpc > s_highpc)
  84                 p_highpc = s_highpc;
  85
  86         for (pc = p_lowpc; pc < p_highpc; pc += 4) {
  87                 off = pc - s_lowpc;
  88                 op = *(u_long *)&textspace[off];
  89                 if ((op & 0xc0000000) == 0x40000000) {
  90                         /*
  91                          * a pc relative call insn -- check that this
  92                          * is the address of a function.
  93                          */
  94                         off = (op & 0x3fffffff) << 2;
  95                         destpc = pc + off;
  96                         if (destpc >= s_lowpc && destpc <= s_highpc) {
  97                                 childp = nllookup(destpc);
  98                                 if (childp != 0 && childp->value == destpc)
  99                                         addarc(parentp, childp, 0L);
 100                         }
 101                 } else if ((op & 0xfff80000) == 0x9fc00000)
 102                         /*
 103                          * A jmpl with rd = 15 (%o7) -- an indirect call.
 104                          */
 105                         addarc(parentp, &indirectchild, 0L);
 106         }
 107 }