Subversion Repositories openrisc_2011-10-31

/*

 * Copyright (c) 1983, 1993, 1998

 *      The Regents of the University of California.  All rights reserved.

 *

 * Redistribution and use in source and binary forms, with or without

 * modification, are permitted provided that the following conditions

 * are met:

 * 1. Redistributions of source code must retain the above copyright

 *    notice, this list of conditions and the following disclaimer.

 * 2. Redistributions in binary form must reproduce the above copyright

 *    notice, this list of conditions and the following disclaimer in the

 *    documentation and/or other materials provided with the distribution.

 * 3. Neither the name of the University nor the names of its contributors

 *    may be used to endorse or promote products derived from this software

 *    without specific prior written permission.

 *

 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND

 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE

 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE

 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS

 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)

 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT

 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY

 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF

 * SUCH DAMAGE.

 */

#include "gprof.h"

#include "search_list.h"

#include "source.h"

#include "symtab.h"

#include "cg_arcs.h"

#include "corefile.h"

#include "hist.h"

static Sym indirect_child;

void mips_find_call (Sym *, bfd_vma, bfd_vma);

void

mips_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc)

{

  bfd_vma pc, dest_pc;

  unsigned int op;

  int offset;

  Sym *child;

  static bfd_boolean inited = FALSE;

  if (!inited)

    {

      inited = TRUE;

      sym_init (&indirect_child);

      indirect_child.name = _("<indirect child>");

      indirect_child.cg.prop.fract = 1.0;

      indirect_child.cg.cyc.head = &indirect_child;

    }

  DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"),

                          parent->name, (unsigned long) p_lowpc,

                          (unsigned long) p_highpc));

  for (pc = p_lowpc; pc < p_highpc; pc += 4)

    {

      op = bfd_get_32 (core_bfd, ((unsigned char *)core_text_space

                                 + pc - core_text_sect->vma));

      if ((op & 0xfc000000) == 0x0c000000)

        {

          /* This is a "jal" instruction.  Check that the destination

             is the address of a function.  */

          DBG (CALLDEBUG,

               printf (_("[find_call] 0x%lx: jal"), (unsigned long) pc));

          offset = (op & 0x03ffffff) << 2;

          dest_pc = (pc & ~(bfd_vma) 0xfffffff) | offset;

          if (hist_check_address (dest_pc))

            {

              child = sym_lookup (&symtab, dest_pc);

              DBG (CALLDEBUG,

                   printf (" 0x%lx\t; name=%s, addr=0x%lx",

                           (unsigned long) dest_pc, child->name,

                           (unsigned long) child->addr));

              if (child->addr == dest_pc)

                {

                  DBG (CALLDEBUG, printf ("\n"));

                  /* a hit:  */

                  arc_add (parent, child, (unsigned long) 0);

                  continue;

                }

            }

          /* Something funny going on.  */

          DBG (CALLDEBUG, printf ("\tbut it's a botch\n"));

        }

      else if ((op & 0xfc00f83f) == 0x0000f809)

        {

          /* This is a "jalr" instruction (indirect call).  */

          DBG (CALLDEBUG,

               printf (_("[find_call] 0x%lx: jalr\n"), (unsigned long) pc));

          arc_add (parent, &indirect_child, (unsigned long) 0);

        }

    }

}