1999-05-03 09:29:11 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1983, 1998 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"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Opcodes of the call instructions:
|
|
|
|
*/
|
|
|
|
#define OP_Jxx 0x1a
|
|
|
|
#define OP_BSR 0x34
|
|
|
|
|
|
|
|
#define Jxx_FUNC_JMP 0
|
|
|
|
#define Jxx_FUNC_JSR 1
|
|
|
|
#define Jxx_FUNC_RET 2
|
|
|
|
#define Jxx_FUNC_JSR_COROUTINE 3
|
|
|
|
|
2002-01-31 13:56:08 +01:00
|
|
|
#if 0
|
|
|
|
/* Here to document only. We can't use this when cross compiling as
|
|
|
|
the bitfield layout might not be the same as native. */
|
1999-05-03 09:29:11 +02:00
|
|
|
typedef union
|
|
|
|
{
|
|
|
|
struct
|
|
|
|
{
|
|
|
|
unsigned other:26;
|
|
|
|
unsigned op_code:6;
|
|
|
|
}
|
|
|
|
a; /* any format */
|
|
|
|
struct
|
|
|
|
{
|
|
|
|
int disp:21;
|
|
|
|
unsigned ra:5;
|
|
|
|
unsigned op_code:6;
|
|
|
|
}
|
|
|
|
b; /* branch format */
|
|
|
|
struct
|
|
|
|
{
|
|
|
|
int hint:14;
|
|
|
|
unsigned func:2;
|
|
|
|
unsigned rb:5;
|
|
|
|
unsigned ra:5;
|
|
|
|
unsigned op_code:6;
|
|
|
|
}
|
|
|
|
j; /* jump format */
|
|
|
|
}
|
|
|
|
alpha_Instruction;
|
2002-01-31 13:56:08 +01:00
|
|
|
#endif
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
static Sym indirect_child;
|
|
|
|
|
2001-08-09 16:57:42 +02:00
|
|
|
void alpha_find_call PARAMS ((Sym *, bfd_vma, bfd_vma));
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
* On the Alpha we can only detect PC relative calls, which are
|
|
|
|
* usually generated for calls to functions within the same
|
|
|
|
* object file only. This is still better than nothing, however.
|
|
|
|
* (In particular it should be possible to find functions that
|
|
|
|
* potentially call integer division routines, for example.)
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
alpha_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;
|
2002-02-01 09:24:16 +01:00
|
|
|
unsigned int insn;
|
1999-05-03 09:29:11 +02:00
|
|
|
Sym *child;
|
|
|
|
|
2002-01-31 13:56:08 +01:00
|
|
|
if (indirect_child.name == NULL)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
sym_init (&indirect_child);
|
|
|
|
indirect_child.name = _("<indirect child>");
|
|
|
|
indirect_child.cg.prop.fract = 1.0;
|
|
|
|
indirect_child.cg.cyc.head = &indirect_child;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!core_text_space)
|
|
|
|
{
|
|
|
|
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-02-01 09:24:16 +01:00
|
|
|
for (pc = (p_lowpc + 3) & ~(bfd_vma) 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));
|
|
|
|
switch (insn & (0x3f << 26))
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
2002-01-31 13:56:08 +01:00
|
|
|
case OP_Jxx << 26:
|
1999-05-03 09:29:11 +02:00
|
|
|
/*
|
|
|
|
* There is no simple and reliable way to determine the
|
|
|
|
* target of a jsr (the hint bits help, but there aren't
|
|
|
|
* enough bits to get a satisfactory hit rate). Instead,
|
|
|
|
* for any indirect jump we simply add an arc from PARENT
|
|
|
|
* to INDIRECT_CHILD---that way the user it at least able
|
|
|
|
* to see that there are other calls as well.
|
|
|
|
*/
|
2002-01-31 13:56:08 +01:00
|
|
|
if ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
|
|
|
|
|| (insn & (3 << 14)) == Jxx_FUNC_JSR_COROUTINE << 14)
|
1999-05-03 09:29:11 +02:00
|
|
|
{
|
|
|
|
DBG (CALLDEBUG,
|
|
|
|
printf (_("[find_call] 0x%lx: jsr%s <indirect_child>\n"),
|
2002-01-31 13:56:08 +01:00
|
|
|
(unsigned long) pc,
|
|
|
|
((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
|
|
|
|
? "" : "_coroutine")));
|
1999-05-03 09:29:11 +02:00
|
|
|
arc_add (parent, &indirect_child, (unsigned long) 0);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2002-01-31 13:56:08 +01:00
|
|
|
case OP_BSR << 26:
|
1999-05-03 09:29:11 +02:00
|
|
|
DBG (CALLDEBUG,
|
2002-01-31 13:56:08 +01:00
|
|
|
printf (_("[find_call] 0x%lx: bsr"), (unsigned long) pc));
|
1999-05-03 09:29:11 +02:00
|
|
|
/*
|
|
|
|
* Regular PC relative addressing. Check that this is the
|
|
|
|
* address of a function. The linker sometimes redirects
|
|
|
|
* the entry point by 8 bytes to skip loading the global
|
2002-01-31 13:56:08 +01:00
|
|
|
* pointer, so we allow for either address:
|
1999-05-03 09:29:11 +02:00
|
|
|
*/
|
2002-01-31 13:56:08 +01:00
|
|
|
dest_pc = pc + 4 + (((bfd_signed_vma) (insn & 0x1fffff)
|
|
|
|
^ 0x100000) - 0x100000);
|
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 (" 0x%lx\t; name=%s, addr=0x%lx",
|
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 || child->addr == dest_pc - 8)
|
|
|
|
{
|
|
|
|
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"));
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|