1999-05-03 09:29:11 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1983 Regents of the University of California.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms are permitted
|
|
|
|
* provided that: (1) source distributions retain this entire copyright
|
|
|
|
* notice and comment, and (2) distributions including binaries display
|
|
|
|
* the following acknowledgement: ``This product includes software
|
|
|
|
* developed by the University of California, Berkeley and its contributors''
|
|
|
|
* in the documentation or other materials provided with the distribution
|
|
|
|
* and in all advertising materials mentioning features or use of this
|
|
|
|
* software. 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR
|
|
|
|
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
|
|
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
|
*/
|
|
|
|
#include "gprof.h"
|
2002-01-31 13:56:08 +01:00
|
|
|
#include "search_list.h"
|
|
|
|
#include "source.h"
|
|
|
|
#include "symtab.h"
|
1999-05-03 09:29:11 +02:00
|
|
|
#include "cg_arcs.h"
|
|
|
|
#include "corefile.h"
|
|
|
|
#include "hist.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* opcode of the `callf' instruction
|
|
|
|
*/
|
|
|
|
#define CALL (0xc0000000)
|
|
|
|
|
2001-08-09 16:57:42 +02:00
|
|
|
void sparc_find_call PARAMS ((Sym *, bfd_vma, bfd_vma));
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
void
|
|
|
|
sparc_find_call (parent, p_lowpc, p_highpc)
|
|
|
|
Sym *parent;
|
|
|
|
bfd_vma p_lowpc;
|
|
|
|
bfd_vma p_highpc;
|
|
|
|
{
|
2002-01-31 13:56:08 +01:00
|
|
|
bfd_vma pc, dest_pc;
|
|
|
|
unsigned long insn;
|
1999-05-03 09:29:11 +02:00
|
|
|
Sym *child;
|
|
|
|
|
|
|
|
if (core_text_space == 0)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (p_lowpc < s_lowpc)
|
|
|
|
{
|
|
|
|
p_lowpc = s_lowpc;
|
|
|
|
}
|
|
|
|
if (p_highpc > s_highpc)
|
|
|
|
{
|
|
|
|
p_highpc = s_highpc;
|
|
|
|
}
|
|
|
|
DBG (CALLDEBUG, printf ("[find_call] %s: 0x%lx to 0x%lx\n",
|
1999-07-01 00:38:30 +02:00
|
|
|
parent->name, (unsigned long) p_lowpc,
|
|
|
|
(unsigned long) p_highpc));
|
2002-01-31 13:56:08 +01:00
|
|
|
for (pc = (p_lowpc + 3) & ~3; pc < p_highpc; pc += 4)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
2002-01-31 13:56:08 +01:00
|
|
|
insn = bfd_get_32 (core_bfd, ((unsigned char *) core_text_space
|
|
|
|
+ pc - core_text_sect->vma));
|
|
|
|
if (insn & CALL)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
DBG (CALLDEBUG,
|
2002-01-31 13:56:08 +01:00
|
|
|
printf ("[find_call] 0x%lx: callf", (unsigned long) pc));
|
1999-05-03 09:29:11 +02:00
|
|
|
/*
|
|
|
|
* Regular pc relative addressing check that this is the
|
|
|
|
* address of a function.
|
|
|
|
*/
|
2002-01-31 13:56:08 +01:00
|
|
|
dest_pc = pc + (((bfd_signed_vma) (insn & 0x3fffffff)
|
|
|
|
^ 0x20000000) - 0x20000000);
|
1999-05-03 09:29:11 +02:00
|
|
|
if (dest_pc >= s_lowpc && dest_pc <= s_highpc)
|
|
|
|
{
|
|
|
|
child = sym_lookup (&symtab, dest_pc);
|
|
|
|
DBG (CALLDEBUG,
|
|
|
|
printf ("\tdest_pc=0x%lx, (name=%s, addr=0x%lx)\n",
|
1999-07-01 00:38:30 +02:00
|
|
|
(unsigned long) dest_pc, child->name,
|
|
|
|
(unsigned long) child->addr));
|
1999-05-03 09:29:11 +02:00
|
|
|
if (child->addr == dest_pc)
|
|
|
|
{
|
|
|
|
/* a hit: */
|
|
|
|
arc_add (parent, child, (unsigned long) 0);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Something funny going on.
|
|
|
|
*/
|
|
|
|
DBG (CALLDEBUG, printf ("\tbut it's a botch\n"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|