1 /* 2 * Copyright (c) 1983, 1993, 1998 3 * The Regents of the University of California. All rights reserved. 4 * 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. 28 */ 29 #include "gprof.h" 30 #include "search_list.h" 31 #include "source.h" 32 #include "symtab.h" 33 #include "cg_arcs.h" 34 #include "corefile.h" 35 #include "hist.h" 36 37 static Sym indirect_child; 38 39 void mips_find_call (Sym *, bfd_vma, bfd_vma); 40 41 void 42 mips_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc) 43 { 44 bfd_vma pc, dest_pc; 45 unsigned int op; 46 int offset; 47 Sym *child; 48 static bfd_boolean inited = FALSE; 49 50 if (!inited) 51 { 52 inited = TRUE; 53 sym_init (&indirect_child); 54 indirect_child.name = _("<indirect child>"); 55 indirect_child.cg.prop.fract = 1.0; 56 indirect_child.cg.cyc.head = &indirect_child; 57 } 58 59 if (!core_text_space) 60 { 61 return; 62 } 63 if (p_lowpc < s_lowpc) 64 { 65 p_lowpc = s_lowpc; 66 } 67 if (p_highpc > s_highpc) 68 { 69 p_highpc = s_highpc; 70 } 71 DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"), 72 parent->name, (unsigned long) p_lowpc, 73 (unsigned long) p_highpc)); 74 for (pc = p_lowpc; pc < p_highpc; pc += 4) 75 { 76 op = bfd_get_32 (core_bfd, &((char *)core_text_space)[pc - s_lowpc]); 77 if ((op & 0xfc000000) == 0x0c000000) 78 { 79 /* This is a "jal" instruction. Check that the destination 80 is the address of a function. */ 81 DBG (CALLDEBUG, 82 printf (_("[find_call] 0x%lx: jal"), (unsigned long) pc)); 83 offset = (op & 0x03ffffff) << 2; 84 dest_pc = (pc & ~(bfd_vma) 0xfffffff) | offset; 85 if (dest_pc >= s_lowpc && dest_pc <= s_highpc) 86 { 87 child = sym_lookup (&symtab, dest_pc); 88 DBG (CALLDEBUG, 89 printf (" 0x%lx\t; name=%s, addr=0x%lx", 90 (unsigned long) dest_pc, child->name, 91 (unsigned long) child->addr)); 92 if (child->addr == dest_pc) 93 { 94 DBG (CALLDEBUG, printf ("\n")); 95 /* a hit: */ 96 arc_add (parent, child, (unsigned long) 0); 97 continue; 98 } 99 } 100 /* Something funny going on. */ 101 DBG (CALLDEBUG, printf ("\tbut it's a botch\n")); 102 } 103 else if ((op & 0xfc00f83f) == 0x0000f809) 104 { 105 /* This is a "jalr" instruction (indirect call). */ 106 DBG (CALLDEBUG, 107 printf (_("[find_call] 0x%lx: jalr\n"), (unsigned long) pc)); 108 arc_add (parent, &indirect_child, (unsigned long) 0); 109 } 110 } 111 } 112