3 Copyright 2000, 2001, 2002 Free Software Foundation, Inc.
5 This file is part of GNU Binutils.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
23 #include "search_list.h"
29 static int cmp_addr
PARAMS ((const PTR
, const PTR
));
34 /* Initialize a symbol (so it's empty). */
40 memset (sym
, 0, sizeof (*sym
));
42 /* It is not safe to assume that a binary zero corresponds
43 to a floating-point 0.0, so initialize floats explicitly. */
45 sym
->cg
.child_time
= 0.0;
46 sym
->cg
.prop
.fract
= 0.0;
47 sym
->cg
.prop
.self
= 0.0;
48 sym
->cg
.prop
.child
= 0.0;
52 /* Compare the function entry-point of two symbols and return <0, =0,
53 or >0 depending on whether the left value is smaller than, equal
54 to, or greater than the right value. If two symbols are equal
55 but one has is_func set and the other doesn't, we make the
56 non-function symbol one "bigger" so that the function symbol will
57 survive duplicate removal. Finally, if both symbols have the
58 same is_func value, we discriminate against is_static such that
59 the global symbol survives. */
66 const Sym
*left
= (const Sym
*) lp
;
67 const Sym
*right
= (const Sym
*) rp
;
69 if (left
->addr
> right
->addr
)
71 else if (left
->addr
< right
->addr
)
74 if (left
->is_func
!= right
->is_func
)
75 return right
->is_func
- left
->is_func
;
77 return left
->is_static
- right
->is_static
;
91 /* Sort symbol table in order of increasing function addresses. */
92 qsort (tab
->base
, tab
->len
, sizeof (Sym
), cmp_addr
);
94 /* Remove duplicate entries to speed-up later processing and
95 set end_addr if its not set yet. */
96 prev_addr
= tab
->base
[0].addr
+ 1;
98 for (src
= dst
= tab
->base
; src
< tab
->limit
; ++src
)
100 if (src
->addr
== prev_addr
)
102 /* If same address, favor global symbol over static one,
103 then function over line number. If both symbols are
104 either static or global and either function or line, check
105 whether one has name beginning with underscore while
106 the other doesn't. In such cases, keep sym without
107 underscore. This takes cares of compiler generated
108 symbols (such as __gnu_compiled, __c89_used, etc.). */
109 if ((!src
->is_static
&& dst
[-1].is_static
)
110 || ((src
->is_static
== dst
[-1].is_static
)
111 && ((src
->is_func
&& !dst
[-1].is_func
)
112 || ((src
->is_func
== dst
[-1].is_func
)
113 && ((src
->name
[0] != '_' && dst
[-1].name
[0] == '_')
115 && src
->name
[1] != '_'
116 && dst
[-1].name
[1] == '_'))))))
118 DBG (AOUTDEBUG
| IDDEBUG
,
119 printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
120 src
->name
, src
->is_static
? 't' : 'T',
121 src
->is_func
? 'F' : 'f',
122 dst
[-1].name
, dst
[-1].is_static
? 't' : 'T',
123 dst
[-1].is_func
? 'F' : 'f');
124 printf (" (addr=%lx)\n", (unsigned long) src
->addr
));
130 DBG (AOUTDEBUG
| IDDEBUG
,
131 printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
132 dst
[-1].name
, dst
[-1].is_static
? 't' : 'T',
133 dst
[-1].is_func
? 'F' : 'f',
134 src
->name
, src
->is_static
? 't' : 'T',
135 src
->is_func
? 'F' : 'f');
136 printf (" (addr=%lx)\n", (unsigned long) src
->addr
));
141 if (dst
> tab
->base
&& dst
[-1].end_addr
== 0)
142 dst
[-1].end_addr
= src
->addr
- 1;
144 /* Retain sym only if it has a non-empty address range. */
145 if (!src
->end_addr
|| src
->addr
<= src
->end_addr
)
149 prev_addr
= src
->addr
;
154 if (tab
->len
> 0 && dst
[-1].end_addr
== 0)
155 dst
[-1].end_addr
= core_text_sect
->vma
+ core_text_sect
->_raw_size
- 1;
157 DBG (AOUTDEBUG
| IDDEBUG
,
158 printf ("[symtab_finalize]: removed %d duplicate entries\n",
159 tab
->len
- (int) (dst
- tab
->base
)));
162 tab
->len
= tab
->limit
- tab
->base
;
164 DBG (AOUTDEBUG
| IDDEBUG
,
167 for (j
= 0; j
< tab
->len
; ++j
)
169 printf ("[symtab_finalize] 0x%lx-0x%lx\t%s\n",
170 (long) tab
->base
[j
].addr
, (long) tab
->base
[j
].end_addr
,
180 dbg_sym_lookup (sym_tab
, address
)
187 fprintf (stderr
, "[dbg_sym_lookup] address 0x%lx\n",
188 (unsigned long) address
);
191 for (low
= 0, high
= sym_tab
->len
- 1; low
!= high
;)
193 mid
= (high
+ low
) >> 1;
195 fprintf (stderr
, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
197 fprintf (stderr
, "[dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx\n",
198 (unsigned long) sym
[mid
].addr
,
199 (unsigned long) sym
[mid
+ 1].addr
);
201 if (sym
[mid
].addr
<= address
&& sym
[mid
+ 1].addr
> address
)
204 if (sym
[mid
].addr
> address
)
210 fprintf (stderr
, "[dbg_sym_lookup] binary search fails???\n");
218 /* Look up an address in the symbol-table that is sorted by address.
219 If address does not hit any symbol, 0 is returned. */
221 sym_lookup (sym_tab
, address
)
236 for (low
= 0, high
= sym_tab
->len
- 1; low
!= high
;)
238 DBG (LOOKUPDEBUG
, ++probes
);
239 mid
= (high
+ low
) / 2;
241 if (sym
[mid
].addr
<= address
&& sym
[mid
+ 1].addr
> address
)
243 if (address
> sym
[mid
].end_addr
)
245 /* Address falls into gap between
246 sym[mid] and sym[mid + 1]. */
252 printf ("[sym_lookup] %d probes (symtab->len=%u)\n",
253 probes
, sym_tab
->len
- 1));
258 if (sym
[mid
].addr
> address
)
264 if (sym
[mid
+ 1].addr
<= address
)
266 if (address
> sym
[mid
+ 1].end_addr
)
268 /* Address is beyond end of sym[mid + 1]. */
273 DBG (LOOKUPDEBUG
, printf ("[sym_lookup] %d (%u) probes, fall off\n",
274 probes
, sym_tab
->len
- 1));
275 return &sym
[mid
+ 1];
This page took 0.035139 seconds and 4 git commands to generate.