1*a9fa9459Szrj /*
2*a9fa9459Szrj * Copyright (c) 1983, 1993, 1998
3*a9fa9459Szrj * The Regents of the University of California. All rights reserved.
4*a9fa9459Szrj *
5*a9fa9459Szrj * Redistribution and use in source and binary forms, with or without
6*a9fa9459Szrj * modification, are permitted provided that the following conditions
7*a9fa9459Szrj * are met:
8*a9fa9459Szrj * 1. Redistributions of source code must retain the above copyright
9*a9fa9459Szrj * notice, this list of conditions and the following disclaimer.
10*a9fa9459Szrj * 2. Redistributions in binary form must reproduce the above copyright
11*a9fa9459Szrj * notice, this list of conditions and the following disclaimer in the
12*a9fa9459Szrj * documentation and/or other materials provided with the distribution.
13*a9fa9459Szrj * 3. Neither the name of the University nor the names of its contributors
14*a9fa9459Szrj * may be used to endorse or promote products derived from this software
15*a9fa9459Szrj * without specific prior written permission.
16*a9fa9459Szrj *
17*a9fa9459Szrj * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18*a9fa9459Szrj * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19*a9fa9459Szrj * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20*a9fa9459Szrj * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21*a9fa9459Szrj * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22*a9fa9459Szrj * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23*a9fa9459Szrj * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24*a9fa9459Szrj * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25*a9fa9459Szrj * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26*a9fa9459Szrj * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27*a9fa9459Szrj * SUCH DAMAGE.
28*a9fa9459Szrj */
29*a9fa9459Szrj #include "gprof.h"
30*a9fa9459Szrj #include "search_list.h"
31*a9fa9459Szrj #include "source.h"
32*a9fa9459Szrj #include "symtab.h"
33*a9fa9459Szrj #include "cg_arcs.h"
34*a9fa9459Szrj #include "corefile.h"
35*a9fa9459Szrj #include "hist.h"
36*a9fa9459Szrj
37*a9fa9459Szrj static Sym indirect_child;
38*a9fa9459Szrj
39*a9fa9459Szrj void mips_find_call (Sym *, bfd_vma, bfd_vma);
40*a9fa9459Szrj
41*a9fa9459Szrj void
mips_find_call(Sym * parent,bfd_vma p_lowpc,bfd_vma p_highpc)42*a9fa9459Szrj mips_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc)
43*a9fa9459Szrj {
44*a9fa9459Szrj bfd_vma pc, dest_pc;
45*a9fa9459Szrj unsigned int op;
46*a9fa9459Szrj int offset;
47*a9fa9459Szrj Sym *child;
48*a9fa9459Szrj static bfd_boolean inited = FALSE;
49*a9fa9459Szrj
50*a9fa9459Szrj if (!inited)
51*a9fa9459Szrj {
52*a9fa9459Szrj inited = TRUE;
53*a9fa9459Szrj sym_init (&indirect_child);
54*a9fa9459Szrj indirect_child.name = _("<indirect child>");
55*a9fa9459Szrj indirect_child.cg.prop.fract = 1.0;
56*a9fa9459Szrj indirect_child.cg.cyc.head = &indirect_child;
57*a9fa9459Szrj }
58*a9fa9459Szrj
59*a9fa9459Szrj DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"),
60*a9fa9459Szrj parent->name, (unsigned long) p_lowpc,
61*a9fa9459Szrj (unsigned long) p_highpc));
62*a9fa9459Szrj for (pc = p_lowpc; pc < p_highpc; pc += 4)
63*a9fa9459Szrj {
64*a9fa9459Szrj op = bfd_get_32 (core_bfd, ((unsigned char *)core_text_space
65*a9fa9459Szrj + pc - core_text_sect->vma));
66*a9fa9459Szrj if ((op & 0xfc000000) == 0x0c000000)
67*a9fa9459Szrj {
68*a9fa9459Szrj /* This is a "jal" instruction. Check that the destination
69*a9fa9459Szrj is the address of a function. */
70*a9fa9459Szrj DBG (CALLDEBUG,
71*a9fa9459Szrj printf (_("[find_call] 0x%lx: jal"), (unsigned long) pc));
72*a9fa9459Szrj offset = (op & 0x03ffffff) << 2;
73*a9fa9459Szrj dest_pc = (pc & ~(bfd_vma) 0xfffffff) | offset;
74*a9fa9459Szrj if (hist_check_address (dest_pc))
75*a9fa9459Szrj {
76*a9fa9459Szrj child = sym_lookup (&symtab, dest_pc);
77*a9fa9459Szrj if (child)
78*a9fa9459Szrj {
79*a9fa9459Szrj DBG (CALLDEBUG,
80*a9fa9459Szrj printf (" 0x%lx\t; name=%s, addr=0x%lx",
81*a9fa9459Szrj (unsigned long) dest_pc, child->name,
82*a9fa9459Szrj (unsigned long) child->addr));
83*a9fa9459Szrj if (child->addr == dest_pc)
84*a9fa9459Szrj {
85*a9fa9459Szrj DBG (CALLDEBUG, printf ("\n"));
86*a9fa9459Szrj /* a hit: */
87*a9fa9459Szrj arc_add (parent, child, (unsigned long) 0);
88*a9fa9459Szrj continue;
89*a9fa9459Szrj }
90*a9fa9459Szrj }
91*a9fa9459Szrj }
92*a9fa9459Szrj /* Something funny going on. */
93*a9fa9459Szrj DBG (CALLDEBUG, printf ("\tbut it's a botch\n"));
94*a9fa9459Szrj }
95*a9fa9459Szrj else if ((op & 0xfc00f83f) == 0x0000f809)
96*a9fa9459Szrj {
97*a9fa9459Szrj /* This is a "jalr" instruction (indirect call). */
98*a9fa9459Szrj DBG (CALLDEBUG,
99*a9fa9459Szrj printf (_("[find_call] 0x%lx: jalr\n"), (unsigned long) pc));
100*a9fa9459Szrj arc_add (parent, &indirect_child, (unsigned long) 0);
101*a9fa9459Szrj }
102*a9fa9459Szrj }
103*a9fa9459Szrj }
104