[deliverable/binutils-gdb.git] / gprof / alpha.c

/*
 * 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"

/*
 * 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

#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.  */
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;
#endif

static Sym indirect_child;

void alpha_find_call PARAMS ((Sym *, bfd_vma, bfd_vma));

/*
 * 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;
{
  bfd_vma pc, dest_pc;
  unsigned int insn;
  Sym *child;

  if (indirect_child.name == NULL)
    {
      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"),
			  parent->name, (unsigned long) p_lowpc,
			  (unsigned long) p_highpc));
  for (pc = (p_lowpc + 3) & ~(bfd_vma) 3; pc < p_highpc; pc += 4)
    {
      insn = bfd_get_32 (core_bfd, ((unsigned char *) core_text_space
				    + pc - core_text_sect->vma));
      switch (insn & (0x3f << 26))
	{
	case OP_Jxx << 26:
	  /*
	   * 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.
	   */
	  if ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
	      || (insn & (3 << 14)) == Jxx_FUNC_JSR_COROUTINE << 14)
	    {
	      DBG (CALLDEBUG,
		   printf (_("[find_call] 0x%lx: jsr%s <indirect_child>\n"),
			   (unsigned long) pc,
			   ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
			    ? "" : "_coroutine")));
	      arc_add (parent, &indirect_child, (unsigned long) 0);
	    }
	  break;

	case OP_BSR << 26:
	  DBG (CALLDEBUG,
	       printf (_("[find_call] 0x%lx: bsr"), (unsigned long) pc));
	  /*
	   * 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
	   * pointer, so we allow for either address:
	   */
	  dest_pc = pc + 4 + (((bfd_signed_vma) (insn & 0x1fffff)
			       ^ 0x100000) - 0x100000);
	  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",
			   (unsigned long) dest_pc, child->name,
			   (unsigned long) child->addr));
	      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;
	}
    }
}
Commit	Line	Data
252b5132	1	/*
5ec4a8f3 NC	2	* Copyright (c) 1983, 1993, 1998
5ec4a8f3 NC	3	* The Regents of the University of California. All rights reserved.
252b5132	4	*
5ec4a8f3 NC	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. Neither the name of the University nor the names of its contributors
	14	* may be used to endorse or promote products derived from this software
	15	* without specific prior written permission.
	16	*
	17	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	18	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	19	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	20	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	21	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	22	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	23	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	24	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	25	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	26	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	27	* SUCH DAMAGE.
252b5132 RH	28	*/
252b5132 RH	29	#include "gprof.h"
6d9c411a AM	30	#include "search_list.h"
	31	#include "source.h"
	32	#include "symtab.h"
252b5132 RH	33	#include "cg_arcs.h"
	34	#include "corefile.h"
	35	#include "hist.h"
252b5132 RH	36
	37	/*
	38	* Opcodes of the call instructions:
	39	*/
	40	#define OP_Jxx 0x1a
	41	#define OP_BSR 0x34
	42
	43	#define Jxx_FUNC_JMP 0
	44	#define Jxx_FUNC_JSR 1
	45	#define Jxx_FUNC_RET 2
	46	#define Jxx_FUNC_JSR_COROUTINE 3
	47
6d9c411a AM	48	#if 0
	49	/* Here to document only. We can't use this when cross compiling as
	50	the bitfield layout might not be the same as native. */
252b5132 RH	51	typedef union
	52	{
	53	struct
	54	{
	55	unsigned other:26;
	56	unsigned op_code:6;
	57	}
	58	a; /* any format */
	59	struct
	60	{
	61	int disp:21;
	62	unsigned ra:5;
	63	unsigned op_code:6;
	64	}
	65	b; /* branch format */
	66	struct
	67	{
	68	int hint:14;
	69	unsigned func:2;
	70	unsigned rb:5;
	71	unsigned ra:5;
	72	unsigned op_code:6;
	73	}
	74	j; /* jump format */
	75	}
	76	alpha_Instruction;
6d9c411a	77	#endif
252b5132 RH	78
	79	static Sym indirect_child;
	80
5789ecea	81	void alpha_find_call PARAMS ((Sym *, bfd_vma, bfd_vma));
252b5132 RH	82
	83	/*
	84	* On the Alpha we can only detect PC relative calls, which are
	85	* usually generated for calls to functions within the same
	86	* object file only. This is still better than nothing, however.
	87	* (In particular it should be possible to find functions that
	88	* potentially call integer division routines, for example.)
	89	*/
	90	void
	91	alpha_find_call (parent, p_lowpc, p_highpc)
	92	Sym *parent;
	93	bfd_vma p_lowpc;
	94	bfd_vma p_highpc;
	95	{
6d9c411a	96	bfd_vma pc, dest_pc;
1355568a	97	unsigned int insn;
252b5132 RH	98	Sym *child;
252b5132 RH	99
6d9c411a	100	if (indirect_child.name == NULL)
252b5132	101	{
252b5132 RH	102	sym_init (&indirect_child);
	103	indirect_child.name = _("<indirect child>");
	104	indirect_child.cg.prop.fract = 1.0;
	105	indirect_child.cg.cyc.head = &indirect_child;
	106	}
	107
	108	if (!core_text_space)
	109	{
	110	return;
	111	}
	112	if (p_lowpc < s_lowpc)
	113	{
	114	p_lowpc = s_lowpc;
	115	}
	116	if (p_highpc > s_highpc)
	117	{
	118	p_highpc = s_highpc;
	119	}
	120	DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"),
fdcf7d43 ILT	121	parent->name, (unsigned long) p_lowpc,
fdcf7d43 ILT	122	(unsigned long) p_highpc));
1355568a	123	for (pc = (p_lowpc + 3) & ~(bfd_vma) 3; pc < p_highpc; pc += 4)
252b5132	124	{
6d9c411a AM	125	insn = bfd_get_32 (core_bfd, ((unsigned char *) core_text_space
	126	+ pc - core_text_sect->vma));
	127	switch (insn & (0x3f << 26))
252b5132	128	{
6d9c411a	129	case OP_Jxx << 26:
252b5132 RH	130	/*
	131	* There is no simple and reliable way to determine the
	132	* target of a jsr (the hint bits help, but there aren't
	133	* enough bits to get a satisfactory hit rate). Instead,
	134	* for any indirect jump we simply add an arc from PARENT
	135	* to INDIRECT_CHILD---that way the user it at least able
	136	* to see that there are other calls as well.
	137	*/
6d9c411a AM	138	if ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
6d9c411a AM	139	\|\| (insn & (3 << 14)) == Jxx_FUNC_JSR_COROUTINE << 14)
252b5132 RH	140	{
	141	DBG (CALLDEBUG,
	142	printf (_("[find_call] 0x%lx: jsr%s <indirect_child>\n"),
6d9c411a AM	143	(unsigned long) pc,
	144	((insn & (3 << 14)) == Jxx_FUNC_JSR << 14
	145	? "" : "_coroutine")));
252b5132 RH	146	arc_add (parent, &indirect_child, (unsigned long) 0);
	147	}
	148	break;
	149
6d9c411a	150	case OP_BSR << 26:
252b5132	151	DBG (CALLDEBUG,
6d9c411a	152	printf (_("[find_call] 0x%lx: bsr"), (unsigned long) pc));
252b5132 RH	153	/*
	154	* Regular PC relative addressing. Check that this is the
	155	* address of a function. The linker sometimes redirects
	156	* the entry point by 8 bytes to skip loading the global
6d9c411a	157	* pointer, so we allow for either address:
252b5132	158	*/
6d9c411a AM	159	dest_pc = pc + 4 + (((bfd_signed_vma) (insn & 0x1fffff)
6d9c411a AM	160	^ 0x100000) - 0x100000);
252b5132 RH	161	if (dest_pc >= s_lowpc && dest_pc <= s_highpc)
	162	{
	163	child = sym_lookup (&symtab, dest_pc);
	164	DBG (CALLDEBUG,
	165	printf (" 0x%lx\t; name=%s, addr=0x%lx",
fdcf7d43 ILT	166	(unsigned long) dest_pc, child->name,
fdcf7d43 ILT	167	(unsigned long) child->addr));
252b5132 RH	168	if (child->addr == dest_pc \|\| child->addr == dest_pc - 8)
	169	{
	170	DBG (CALLDEBUG, printf ("\n"));
	171	/* a hit: */
	172	arc_add (parent, child, (unsigned long) 0);
	173	continue;
	174	}
	175	}
	176	/*
	177	* Something funny going on.
	178	*/
	179	DBG (CALLDEBUG, printf ("\tbut it's a botch\n"));
	180	break;
	181
	182	default:
	183	break;
	184	}
	185	}
	186	}