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)
48 else if (left->addr < right->addr)
53 if (left->is_func != right->is_func)
55 return right->is_func - left->is_func;
58 return left->is_static - right->is_static;
63 DEFUN (symtab_finalize, (tab), Sym_Table * tab)
74 * Sort symbol table in order of increasing function addresses:
76 qsort (tab->base, tab->len, sizeof (Sym), cmp_addr);
79 * Remove duplicate entries to speed-up later processing and
80 * set end_addr if its not set yet:
82 prev_addr = tab->base[0].addr + 1;
83 for (src = dst = tab->base; src < tab->limit; ++src)
85 if (src->addr == prev_addr)
88 * If same address, favor global symbol over static one,
89 * then function over line number. If both symbols are
90 * either static or global and either function or line, check
91 * whether one has name beginning with underscore while
92 * the other doesn't. In such cases, keep sym without
93 * underscore. This takes cares of compiler generated
94 * symbols (such as __gnu_compiled, __c89_used, etc.).
96 if ((!src->is_static && dst[-1].is_static)
97 || ((src->is_static == dst[-1].is_static)
98 && ((src->is_func && !dst[-1].is_func)
99 || ((src->is_func == dst[-1].is_func)
100 && ((src->name[0] != '_' && dst[-1].name[0] == '_')
102 && src->name[1] != '_'
103 && dst[-1].name[1] == '_'))))))
105 DBG (AOUTDEBUG | IDDEBUG,
106 printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
107 src->name, src->is_static ? 't' : 'T',
108 src->is_func ? 'F' : 'f',
109 dst[-1].name, dst[-1].is_static ? 't' : 'T',
110 dst[-1].is_func ? 'F' : 'f');
111 printf (" (addr=%lx)\n", src->addr));
116 DBG (AOUTDEBUG | IDDEBUG,
117 printf ("[symtab_finalize] favor %s@%c%c over %s@%c%c",
118 dst[-1].name, dst[-1].is_static ? 't' : 'T',
119 dst[-1].is_func ? 'F' : 'f',
120 src->name, src->is_static ? 't' : 'T',
121 src->is_func ? 'F' : 'f');
122 printf (" (addr=%lx)\n", src->addr));
127 if (dst > tab->base && dst[-1].end_addr == 0)
129 dst[-1].end_addr = src->addr - 1;
132 /* retain sym only if it has a non-empty address range: */
133 if (!src->end_addr || src->addr <= src->end_addr)
136 prev_addr = src->addr;
140 if (tab->len > 0 && dst[-1].end_addr == 0)
142 dst[-1].end_addr = core_text_sect->vma + core_text_sect->_raw_size - 1;
145 DBG (AOUTDEBUG | IDDEBUG,
146 printf ("[symtab_finalize]: removed %d duplicate entries\n",
147 tab->len - (int) (dst - tab->base)));
150 tab->len = tab->limit - tab->base;
152 DBG (AOUTDEBUG | IDDEBUG,
155 for (j = 0; j < tab->len; ++j)
157 printf ("[symtab_finalize] 0x%lx-0x%lx\t%s\n",
158 (long) tab->base[j].addr, (long) tab->base[j].end_addr,
168 DEFUN (dbg_sym_lookup, (symtab, address), Sym_Table * symtab AND bfd_vma address)
173 fprintf (stderr, "[dbg_sym_lookup] address 0x%lx\n", address);
176 for (low = 0, high = symtab->len - 1; low != high;)
178 mid = (high + low) >> 1;
179 fprintf (stderr, "[dbg_sym_lookup] low=0x%lx, mid=0x%lx, high=0x%lx\n",
181 fprintf (stderr, "[dbg_sym_lookup] sym[m]=0x%lx sym[m + 1]=0x%lx\n",
182 sym[mid].addr, sym[mid + 1].addr);
183 if (sym[mid].addr <= address && sym[mid + 1].addr > address)
187 if (sym[mid].addr > address)
196 fprintf (stderr, "[dbg_sym_lookup] binary search fails???\n");
204 * Look up an address in the symbol-table that is sorted by address.
205 * If address does not hit any symbol, 0 is returned.
208 DEFUN (sym_lookup, (symtab, address), Sym_Table * symtab AND bfd_vma address)
223 for (low = 0, high = symtab->len - 1; low != high;)
225 DBG (LOOKUPDEBUG, ++probes);
226 mid = (high + low) / 2;
227 if (sym[mid].addr <= address && sym[mid + 1].addr > address)
229 if (address > sym[mid].end_addr)
232 * Address falls into gap between sym[mid] and
240 printf ("[sym_lookup] %d probes (symtab->len=%d)\n",
241 probes, symtab->len - 1));
245 if (sym[mid].addr > address)
254 if (sym[mid + 1].addr <= address)
256 if (address > sym[mid + 1].end_addr)
258 /* address is beyond end of sym[mid + 1]: */
263 DBG (LOOKUPDEBUG, printf ("[sym_lookup] %d (%d) probes, fall off\n",
264 probes, symtab->len - 1));
265 return &sym[mid + 1];