Commit | Line | Data |
---|---|---|
252b5132 | 1 | /* |
5ec4a8f3 NC |
2 | * Copyright (c) 1983, 1993, 1998 |
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 | */ |
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 | ||
3e8f6abf | 81 | void alpha_find_call (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 | |
3e8f6abf | 91 | alpha_find_call (Sym *parent, bfd_vma p_lowpc, bfd_vma p_highpc) |
252b5132 | 92 | { |
6d9c411a | 93 | bfd_vma pc, dest_pc; |
1355568a | 94 | unsigned int insn; |
252b5132 RH |
95 | Sym *child; |
96 | ||
6d9c411a | 97 | if (indirect_child.name == NULL) |
252b5132 | 98 | { |
252b5132 RH |
99 | sym_init (&indirect_child); |
100 | indirect_child.name = _("<indirect child>"); | |
101 | indirect_child.cg.prop.fract = 1.0; | |
102 | indirect_child.cg.cyc.head = &indirect_child; | |
103 | } | |
104 | ||
105 | if (!core_text_space) | |
106 | { | |
107 | return; | |
108 | } | |
109 | if (p_lowpc < s_lowpc) | |
110 | { | |
111 | p_lowpc = s_lowpc; | |
112 | } | |
113 | if (p_highpc > s_highpc) | |
114 | { | |
115 | p_highpc = s_highpc; | |
116 | } | |
117 | DBG (CALLDEBUG, printf (_("[find_call] %s: 0x%lx to 0x%lx\n"), | |
fdcf7d43 ILT |
118 | parent->name, (unsigned long) p_lowpc, |
119 | (unsigned long) p_highpc)); | |
1355568a | 120 | for (pc = (p_lowpc + 3) & ~(bfd_vma) 3; pc < p_highpc; pc += 4) |
252b5132 | 121 | { |
6d9c411a AM |
122 | insn = bfd_get_32 (core_bfd, ((unsigned char *) core_text_space |
123 | + pc - core_text_sect->vma)); | |
124 | switch (insn & (0x3f << 26)) | |
252b5132 | 125 | { |
6d9c411a | 126 | case OP_Jxx << 26: |
252b5132 RH |
127 | /* |
128 | * There is no simple and reliable way to determine the | |
129 | * target of a jsr (the hint bits help, but there aren't | |
130 | * enough bits to get a satisfactory hit rate). Instead, | |
131 | * for any indirect jump we simply add an arc from PARENT | |
132 | * to INDIRECT_CHILD---that way the user it at least able | |
133 | * to see that there are other calls as well. | |
134 | */ | |
6d9c411a AM |
135 | if ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14 |
136 | || (insn & (3 << 14)) == Jxx_FUNC_JSR_COROUTINE << 14) | |
252b5132 RH |
137 | { |
138 | DBG (CALLDEBUG, | |
139 | printf (_("[find_call] 0x%lx: jsr%s <indirect_child>\n"), | |
6d9c411a AM |
140 | (unsigned long) pc, |
141 | ((insn & (3 << 14)) == Jxx_FUNC_JSR << 14 | |
142 | ? "" : "_coroutine"))); | |
252b5132 RH |
143 | arc_add (parent, &indirect_child, (unsigned long) 0); |
144 | } | |
145 | break; | |
146 | ||
6d9c411a | 147 | case OP_BSR << 26: |
252b5132 | 148 | DBG (CALLDEBUG, |
6d9c411a | 149 | printf (_("[find_call] 0x%lx: bsr"), (unsigned long) pc)); |
252b5132 RH |
150 | /* |
151 | * Regular PC relative addressing. Check that this is the | |
152 | * address of a function. The linker sometimes redirects | |
153 | * the entry point by 8 bytes to skip loading the global | |
6d9c411a | 154 | * pointer, so we allow for either address: |
252b5132 | 155 | */ |
6d9c411a AM |
156 | dest_pc = pc + 4 + (((bfd_signed_vma) (insn & 0x1fffff) |
157 | ^ 0x100000) - 0x100000); | |
252b5132 RH |
158 | if (dest_pc >= s_lowpc && dest_pc <= s_highpc) |
159 | { | |
160 | child = sym_lookup (&symtab, dest_pc); | |
161 | DBG (CALLDEBUG, | |
162 | printf (" 0x%lx\t; name=%s, addr=0x%lx", | |
fdcf7d43 ILT |
163 | (unsigned long) dest_pc, child->name, |
164 | (unsigned long) child->addr)); | |
252b5132 RH |
165 | if (child->addr == dest_pc || child->addr == dest_pc - 8) |
166 | { | |
167 | DBG (CALLDEBUG, printf ("\n")); | |
168 | /* a hit: */ | |
169 | arc_add (parent, child, (unsigned long) 0); | |
170 | continue; | |
171 | } | |
172 | } | |
173 | /* | |
174 | * Something funny going on. | |
175 | */ | |
176 | DBG (CALLDEBUG, printf ("\tbut it's a botch\n")); | |
177 | break; | |
178 | ||
179 | default: | |
180 | break; | |
181 | } | |
182 | } | |
183 | } |