100 lines
3.2 KiB
C
100 lines
3.2 KiB
C
/* Gprof -c option support for AArch64.
|
|
Copyright 2013 Linaro Ltd.
|
|
|
|
Based upon gprof/i386.c.
|
|
|
|
Copyright (c) 1983, 1993, 2001
|
|
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"
|
|
|
|
#define BRANCH_MASK 0x7c000000
|
|
#define BRANCH_PATTERN 0x14000000
|
|
|
|
void aarch64_find_call (Sym *, bfd_vma, bfd_vma);
|
|
|
|
void
|
|
aarch64_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc)
|
|
{
|
|
bfd_vma pc, dest_pc, offset;
|
|
unsigned int insn;
|
|
Sym *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)
|
|
{
|
|
|
|
insn = bfd_get_32 (core_bfd, ((unsigned char *) core_text_space
|
|
+ pc - core_text_sect->vma));
|
|
|
|
if ((insn & BRANCH_MASK) == BRANCH_PATTERN)
|
|
{
|
|
DBG (CALLDEBUG,
|
|
printf ("[find_call] 0x%lx: bl", (unsigned long) pc));
|
|
|
|
/* Regular pc relative addressing check that this is the
|
|
address of a function. */
|
|
offset = ((((bfd_vma) insn & 0x3ffffff) ^ 0x2000000) - 0x2000000) << 2;
|
|
|
|
dest_pc = pc + offset;
|
|
|
|
if (hist_check_address (dest_pc))
|
|
{
|
|
child = sym_lookup (&symtab, dest_pc);
|
|
|
|
if (child)
|
|
{
|
|
DBG (CALLDEBUG,
|
|
printf ("\tdest_pc=0x%lx, (name=%s, addr=0x%lx)\n",
|
|
(unsigned long) dest_pc, child->name,
|
|
(unsigned long) child->addr));
|
|
|
|
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"));
|
|
}
|
|
}
|
|
}
|