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