10 * Initialize a symbol (so it's empty).
13 DEFUN(sym_init
, (sym
), Sym
*sym
)
15 memset(sym
, 0, sizeof(*sym
));
17 * It is not safe to assume that a binary zero corresponds to
18 * a floating-point 0.0, so initialize floats explicitly:
21 sym
->cg
.child_time
= 0.0;
22 sym
->cg
.prop
.fract
= 0.0;
23 sym
->cg
.prop
.self
= 0.0;
24 sym
->cg
.prop
.child
= 0.0;
29 * Compare the function entry-point of two symbols and return <0, =0,
30 * or >0 depending on whether the left value is smaller than, equal
31 * to, or greater than the right value. If two symbols are equal
32 * but one has is_func set and the other doesn't, we make the
33 * non-function symbol one "bigger" so that the function symbol will
34 * survive duplicate removal. Finally, if both symbols have the
35 * same is_func value, we discriminate against is_static such that
36 * the global symbol survives.
39 DEFUN(cmp_addr
, (lp
, rp
), const PTR lp AND
const PTR rp
)
41 Sym
*left
= (Sym
*) lp
;
42 Sym
*right
= (Sym
*) rp
;
44 if (left
->addr
> right
->addr
) {
46 } else if (left
->addr
< right
->addr
) {
50 if (left
->is_func
!= right
->is_func
) {
51 return right
->is_func
- left
->is_func
;
54 return left
->is_static
- right
->is_static
;
59 DEFUN(symtab_finalize
, (tab
), Sym_Table
*tab
)
69 * Sort symbol table in order of increasing function addresses:
71 qsort(tab
->base
, tab
->len
, sizeof(Sym
), cmp_addr
);
74 * Remove duplicate entries to speed-up later processing and
75 * set end_addr if its not set yet:
77 prev_addr
= tab
->base
[0].addr
+ 1;
78 for (src
= dst
= tab
->base
; src
< tab
->limit
; ++src
) {
79 if (src
->addr
== prev_addr
) {
81 * If same address, favor global symbol over static one.
82 * If both symbols are either static or global, check
83 * whether one has name beginning with underscore while
84 * the other doesn't. In such cases, keep sym without
85 * underscore. This takes cares of compiler generated
86 * symbols (such as __gnu_compiled, __c89_used, etc.).
88 if ((!src
->is_static
&& dst
[-1].is_static
)
89 || ((src
->is_static
== dst
[-1].is_static
) &&
90 (src
->name
[0] != '_' && dst
[-1].name
[0] == '_')
92 && src
->name
[1] != '_' && dst
[-1].name
[1] == '_')))
94 DBG(AOUTDEBUG
|IDDEBUG
,
95 printf("[symtab_finalize] favor %s@%c%c over %s@%c%c",
96 src
->name
, src
->is_static
? 't' : 'T',
97 src
->is_func
? 'F' : 'f',
98 dst
[-1].name
, dst
[-1].is_static
? 't' : 'T',
99 dst
[-1].is_func
? 'F' : 'f');
100 printf(" (addr=%lx)\n", src
->addr
));
103 DBG(AOUTDEBUG
|IDDEBUG
,
104 printf("[symtab_finalize] favor %s@%c%c over %s@%c%c",
105 dst
[-1].name
, dst
[-1].is_static
? 't' : 'T',
106 dst
[-1].is_func
? 'F' : 'f',
107 src
->name
, src
->is_static
? 't' : 'T',
108 src
->is_func
? 'F' : 'f');
109 printf(" (addr=%lx)\n", src
->addr
));
112 if (dst
> tab
->base
&& dst
[-1].end_addr
== 0) {
113 dst
[-1].end_addr
= src
->addr
- 1;
116 /* retain sym only if it has a non-empty address range: */
117 if (!src
->end_addr
|| src
->addr
<= src
->end_addr
) {
119 prev_addr
= src
->addr
;
123 if (tab
->len
> 0 && dst
[-1].end_addr
== 0) {
124 dst
[-1].end_addr
= core_text_sect
->vma
+ core_text_sect
->_raw_size
- 1;
127 DBG(AOUTDEBUG
|IDDEBUG
,
128 printf("[symtab_finalize]: removed %d duplicate entries\n",
129 tab
->len
- (int) (dst
- tab
->base
)));
132 tab
->len
= tab
->limit
- tab
->base
;
134 DBG(AOUTDEBUG
|IDDEBUG
,
137 for (j
= 0; j
< tab
->len
; ++j
){
138 printf("[symtab_finalize] 0x%lx-0x%lx\t%s\n",
139 (long) tab
->base
[j
].addr
, (long) tab
->base
[j
].end_addr
,
142 } /* symtab_finalize */
148 DEFUN(dbg_sym_lookup
, (symtab
, address
), Sym_Table
*symtab AND bfd_vma address
)
153 fprintf(stderr
,"[sym_lookup] address 0x%lx\n", address
);
156 for (low
= 0, high
= symtab
->len
- 1 ; low
!= high
;) {
157 mid
= (high
+ low
) >> 1;
158 fprintf(stderr
, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
160 fprintf(stderr
, "[dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx\n",
161 sym
[mid
].addr
, sym
[mid
+ 1].addr
);
162 if (sym
[mid
].addr
<= address
&& sym
[mid
+ 1].addr
> address
) {
165 if (sym
[mid
].addr
> address
) {
171 fprintf(stderr
, "[sym_lookup] binary search fails???\n");
173 } /* dbg_sym_lookup */
179 * Look up an address in the symbol-table that is sorted by address.
180 * If address does not hit any symbol, 0 is returned.
183 DEFUN(sym_lookup
, (symtab
, address
), Sym_Table
*symtab AND bfd_vma address
)
197 for (low
= 0, high
= symtab
->len
- 1 ; low
!= high
;) {
198 DBG(LOOKUPDEBUG
, ++probes
);
199 mid
= (high
+ low
) / 2;
200 if (sym
[mid
].addr
<= address
&& sym
[mid
+ 1].addr
> address
) {
201 if (address
> sym
[mid
].end_addr
) {
203 * Address falls into gap between sym[mid] and
209 printf("[sym_lookup] %d probes (symtab->len=%d)\n",
210 probes
, symtab
->len
- 1));
214 if (sym
[mid
].addr
> address
) {
220 if (sym
[mid
+ 1].addr
<= address
) {
221 if (address
> sym
[mid
+ 1].end_addr
) {
222 /* address is beyond end of sym[mid + 1]: */
225 DBG(LOOKUPDEBUG
, printf("[sym_lookup] %d (%d) probes, fall off\n",
226 probes
, symtab
->len
- 1));
227 return &sym
[mid
+ 1];
233 /*** end of symtab.c ***/