blob: f19b074a02a1eda563bb3a45759061ea5e98fb3d [file] [log] [blame]
Chris Lattner24943d22010-06-08 16:52:24 +00001//===-- Symtab.cpp ----------------------------------------------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#include <map>
11
12#include "lldb/Core/Module.h"
13#include "lldb/Core/RegularExpression.h"
14#include "lldb/Core/Timer.h"
15#include "lldb/Symbol/ObjectFile.h"
16#include "lldb/Symbol/Symtab.h"
17
18using namespace lldb;
19using namespace lldb_private;
20
21
22
23Symtab::Symtab(ObjectFile *objfile) :
24 m_objfile(objfile),
25 m_symbols(),
26 m_addr_indexes(),
27 m_name_to_index()
28{
29}
30
31Symtab::~Symtab()
32{
33}
34
35void
36Symtab::Reserve(uint32_t count)
37{
38 m_symbols.reserve (count);
39}
40
41Symbol *
42Symtab::Resize(uint32_t count)
43{
44 m_symbols.resize (count);
45 return &m_symbols[0];
46}
47
48uint32_t
49Symtab::AddSymbol(const Symbol& symbol)
50{
51 uint32_t symbol_idx = m_symbols.size();
52 m_name_to_index.Clear();
53 m_addr_indexes.clear();
54 m_symbols.push_back(symbol);
55 return symbol_idx;
56}
57
58size_t
59Symtab::GetNumSymbols() const
60{
61 return m_symbols.size();
62}
63
64void
65Symtab::Dump(Stream *s, Process *process) const
66{
67 const_iterator pos;
68 s->Printf("%.*p: ", (int)sizeof(void*) * 2, this);
69 s->Indent();
70 const FileSpec &file_spec = m_objfile->GetFileSpec();
71 const char * object_name = NULL;
72 if (m_objfile->GetModule())
73 object_name = m_objfile->GetModule()->GetObjectName().GetCString();
74
75 if (file_spec)
76 s->Printf("Symtab, file = %s/%s%s%s%s, num_symbols = %u:\n",
77 file_spec.GetDirectory().AsCString(),
78 file_spec.GetFilename().AsCString(),
79 object_name ? "(" : "",
80 object_name ? object_name : "",
81 object_name ? ")" : "",
82 m_symbols.size());
83 else
84 s->Printf("Symtab, num_symbols = %u:\n", m_symbols.size());
85 s->IndentMore();
86
87 if (!m_symbols.empty())
88 {
89 const_iterator begin = m_symbols.begin();
90 const_iterator end = m_symbols.end();
91 DumpSymbolHeader (s);
92 for (pos = m_symbols.begin(); pos != end; ++pos)
93 {
94 s->Indent();
95 pos->Dump(s, process, std::distance(begin, pos));
96 }
97 }
98 s->IndentLess ();
99}
100
101void
102Symtab::Dump(Stream *s, Process *process, std::vector<uint32_t>& indexes) const
103{
104 const size_t num_symbols = GetNumSymbols();
105 s->Printf("%.*p: ", (int)sizeof(void*) * 2, this);
106 s->Indent();
107 s->Printf("Symtab %u symbol indexes (%u symbols total):\n", indexes.size(), m_symbols.size());
108 s->IndentMore();
109
110 if (!indexes.empty())
111 {
112 std::vector<uint32_t>::const_iterator pos;
113 std::vector<uint32_t>::const_iterator end = indexes.end();
114 DumpSymbolHeader (s);
115 for (pos = indexes.begin(); pos != end; ++pos)
116 {
117 uint32_t idx = *pos;
118 if (idx < num_symbols)
119 {
120 s->Indent();
121 m_symbols[idx].Dump(s, process, idx);
122 }
123 }
124 }
125 s->IndentLess ();
126}
127
128void
129Symtab::DumpSymbolHeader (Stream *s)
130{
131 s->Indent(" Debug symbol\n");
132 s->Indent(" |Synthetic symbol\n");
133 s->Indent(" ||Externally Visible\n");
134 s->Indent(" |||\n");
135 s->Indent("Index UserID DSX Type File Address/Value Load Address Size Flags Name\n");
136 s->Indent("------- ------ --- ------------ ------------------ ------------------ ------------------ ---------- ----------------------------------\n");
137}
138
139Symbol *
140Symtab::SymbolAtIndex(uint32_t idx)
141{
142 if (idx < m_symbols.size())
143 return &m_symbols[idx];
144 return NULL;
145}
146
147
148const Symbol *
149Symtab::SymbolAtIndex(uint32_t idx) const
150{
151 if (idx < m_symbols.size())
152 return &m_symbols[idx];
153 return NULL;
154}
155
156//----------------------------------------------------------------------
157// InitNameIndexes
158//----------------------------------------------------------------------
159void
160Symtab::InitNameIndexes()
161{
162 Timer scoped_timer (__PRETTY_FUNCTION__, "%s", __PRETTY_FUNCTION__);
163 // Create the name index vector to be able to quickly search by name
164 const size_t count = m_symbols.size();
165 assert(m_objfile != NULL);
166 assert(m_objfile->GetModule() != NULL);
167 m_name_to_index.Reserve (count);
168
169 UniqueCStringMap<uint32_t>::Entry entry;
170
171 for (entry.value = 0; entry.value < count; ++entry.value)
172 {
173 const Symbol *symbol = &m_symbols[entry.value];
174
175 // Don't let trampolines get into the lookup by name map
176 // If we ever need the trampoline symbols to be searchable by name
177 // we can remove this and then possibly add a new bool to any of the
178 // Symtab functions that lookup symbols by name to indicate if they
179 // want trampolines.
180 if (symbol->IsTrampoline())
181 continue;
182
183 const Mangled &mangled = symbol->GetMangled();
184 entry.cstring = mangled.GetMangledName().GetCString();
185 if (entry.cstring && entry.cstring[0])
186 m_name_to_index.Append (entry);
187
188 entry.cstring = mangled.GetDemangledName().GetCString();
189 if (entry.cstring && entry.cstring[0])
190 m_name_to_index.Append (entry);
191 }
192 m_name_to_index.Sort();
193}
194
195uint32_t
196Symtab::AppendSymbolIndexesWithType(SymbolType symbol_type, std::vector<uint32_t>& indexes, uint32_t start_idx, uint32_t end_index) const
197{
198 uint32_t prev_size = indexes.size();
199
200 const uint32_t count = std::min<uint32_t> (m_symbols.size(), end_index);
201
202 for (uint32_t i = start_idx; i < count; ++i)
203 {
204 if (symbol_type == eSymbolTypeAny || m_symbols[i].GetType() == symbol_type)
205 indexes.push_back(i);
206 }
207
208 return indexes.size() - prev_size;
209}
210
211struct SymbolSortInfo
212{
213 const bool sort_by_load_addr;
214 const Symbol *symbols;
215};
216
Owen Andersonc3d68552010-06-16 17:34:05 +0000217namespace {
218 struct SymbolIndexComparator {
219 const std::vector<Symbol>& symbols;
220 SymbolIndexComparator(const std::vector<Symbol>& s) : symbols(s) { }
221 bool operator()(uint32_t index_a, uint32_t index_b) {
222 addr_t value_a;
223 addr_t value_b;
224 if (symbols[index_a].GetValue().GetSection() == symbols[index_b].GetValue().GetSection()) {
225 value_a = symbols[index_a].GetValue ().GetOffset();
226 value_b = symbols[index_b].GetValue ().GetOffset();
227 } else {
228 value_a = symbols[index_a].GetValue ().GetFileAddress();
229 value_b = symbols[index_b].GetValue ().GetFileAddress();
230 }
Chris Lattner24943d22010-06-08 16:52:24 +0000231
Owen Andersonc3d68552010-06-16 17:34:05 +0000232 if (value_a == value_b) {
233 // The if the values are equal, use the original symbol user ID
234 lldb::user_id_t uid_a = symbols[index_a].GetID();
235 lldb::user_id_t uid_b = symbols[index_b].GetID();
236 if (uid_a < uid_b)
237 return true;
238 if (uid_a > uid_b)
239 return false;
240 return false;
241 } else if (value_a < value_b)
242 return true;
243
244 return false;
245 }
246 };
Eli Friedman020f3532010-06-10 23:36:31 +0000247}
248
Chris Lattner24943d22010-06-08 16:52:24 +0000249void
250Symtab::SortSymbolIndexesByValue (std::vector<uint32_t>& indexes, bool remove_duplicates) const
251{
Owen Andersonc3d68552010-06-16 17:34:05 +0000252 Timer scoped_timer (__PRETTY_FUNCTION__,__PRETTY_FUNCTION__);
Chris Lattner24943d22010-06-08 16:52:24 +0000253 // No need to sort if we have zero or one items...
254 if (indexes.size() <= 1)
255 return;
256
Owen Andersonc3d68552010-06-16 17:34:05 +0000257 // Sort the indexes in place using std::sort
258 std::stable_sort(indexes.begin(), indexes.end(), SymbolIndexComparator(m_symbols));
Chris Lattner24943d22010-06-08 16:52:24 +0000259
260 // Remove any duplicates if requested
261 if (remove_duplicates)
262 std::unique(indexes.begin(), indexes.end());
263}
264
265uint32_t
266Symtab::AppendSymbolIndexesWithName(const ConstString& symbol_name, std::vector<uint32_t>& indexes)
267{
268 Timer scoped_timer (__PRETTY_FUNCTION__, "%s", __PRETTY_FUNCTION__);
269 if (symbol_name)
270 {
271 const size_t old_size = indexes.size();
272 if (m_name_to_index.IsEmpty())
273 InitNameIndexes();
274
275 const char *symbol_cstr = symbol_name.GetCString();
276 const UniqueCStringMap<uint32_t>::Entry *entry_ptr;
277 for (entry_ptr = m_name_to_index.FindFirstValueForName (symbol_cstr);
278 entry_ptr!= NULL;
279 entry_ptr = m_name_to_index.FindNextValueForName (symbol_cstr, entry_ptr))
280 {
281 indexes.push_back (entry_ptr->value);
282 }
283 return indexes.size() - old_size;
284 }
285 return 0;
286}
287
288uint32_t
289Symtab::AppendSymbolIndexesWithNameAndType(const ConstString& symbol_name, SymbolType symbol_type, std::vector<uint32_t>& indexes)
290{
291 if (AppendSymbolIndexesWithName(symbol_name, indexes) > 0)
292 {
293 std::vector<uint32_t>::iterator pos = indexes.begin();
294 while (pos != indexes.end())
295 {
296 if (symbol_type == eSymbolTypeAny || m_symbols[*pos].GetType() == symbol_type)
297 ++pos;
298 else
299 indexes.erase(pos);
300 }
301 }
302 return indexes.size();
303}
304
305uint32_t
306Symtab::AppendSymbolIndexesMatchingRegExAndType (const RegularExpression &regexp, SymbolType symbol_type, std::vector<uint32_t>& indexes)
307{
308 uint32_t prev_size = indexes.size();
309 uint32_t sym_end = m_symbols.size();
310
311 for (int i = 0; i < sym_end; i++)
312 {
313 if (symbol_type == eSymbolTypeAny || m_symbols[i].GetType() == symbol_type)
314 {
315 const char *name = m_symbols[i].GetMangled().GetName().AsCString();
316 if (name)
317 {
318 if (regexp.Execute (name))
319 indexes.push_back(i);
320 }
321 }
322 }
323 return indexes.size() - prev_size;
324
325}
326
327Symbol *
328Symtab::FindSymbolWithType(SymbolType symbol_type, uint32_t& start_idx)
329{
330 const size_t count = m_symbols.size();
331 for (uint32_t idx = start_idx; idx < count; ++idx)
332 {
333 if (symbol_type == eSymbolTypeAny || m_symbols[idx].GetType() == symbol_type)
334 {
335 start_idx = idx;
336 return &m_symbols[idx];
337 }
338 }
339 return NULL;
340}
341
342const Symbol *
343Symtab::FindSymbolWithType(SymbolType symbol_type, uint32_t& start_idx) const
344{
345 const size_t count = m_symbols.size();
346 for (uint32_t idx = start_idx; idx < count; ++idx)
347 {
348 if (symbol_type == eSymbolTypeAny || m_symbols[idx].GetType() == symbol_type)
349 {
350 start_idx = idx;
351 return &m_symbols[idx];
352 }
353 }
354 return NULL;
355}
356
357size_t
358Symtab::FindAllSymbolsWithNameAndType (const ConstString &name, SymbolType symbol_type, std::vector<uint32_t>& symbol_indexes)
359{
360 Timer scoped_timer (__PRETTY_FUNCTION__, "%s", __PRETTY_FUNCTION__);
361 // Initialize all of the lookup by name indexes before converting NAME
362 // to a uniqued string NAME_STR below.
363 if (m_name_to_index.IsEmpty())
364 InitNameIndexes();
365
366 if (name)
367 {
368 // The string table did have a string that matched, but we need
369 // to check the symbols and match the symbol_type if any was given.
370 AppendSymbolIndexesWithNameAndType(name, symbol_type, symbol_indexes);
371 }
372 return symbol_indexes.size();
373}
374
375size_t
376Symtab::FindAllSymbolsMatchingRexExAndType (const RegularExpression &regex, SymbolType symbol_type, std::vector<uint32_t>& symbol_indexes)
377{
378 AppendSymbolIndexesMatchingRegExAndType(regex, symbol_type, symbol_indexes);
379 return symbol_indexes.size();
380}
381
382Symbol *
383Symtab::FindFirstSymbolWithNameAndType (const ConstString &name, SymbolType symbol_type)
384{
385 Timer scoped_timer (__PRETTY_FUNCTION__, "%s", __PRETTY_FUNCTION__);
386 if (m_name_to_index.IsEmpty())
387 InitNameIndexes();
388
389 if (name)
390 {
391 std::vector<uint32_t> matching_indexes;
392 // The string table did have a string that matched, but we need
393 // to check the symbols and match the symbol_type if any was given.
394 if (AppendSymbolIndexesWithNameAndType(name, symbol_type, matching_indexes))
395 {
396 std::vector<uint32_t>::const_iterator pos, end = matching_indexes.end();
397 for (pos = matching_indexes.begin(); pos != end; ++pos)
398 {
399 Symbol *symbol = SymbolAtIndex(*pos);
400
401 if (symbol->Compare(name, symbol_type))
402 return symbol;
403 }
404 }
405 }
406 return NULL;
407}
408
409typedef struct
410{
411 const Symtab *symtab;
412 const addr_t file_addr;
413 Symbol *match_symbol;
414 const uint32_t *match_index_ptr;
415 addr_t match_offset;
416} SymbolSearchInfo;
417
418static int
419SymbolWithFileAddress (SymbolSearchInfo *info, const uint32_t *index_ptr)
420{
421 const Symbol *curr_symbol = info->symtab->SymbolAtIndex (index_ptr[0]);
422 if (curr_symbol == NULL)
423 return -1;
424
425 const addr_t info_file_addr = info->file_addr;
426
427 // lldb::Symbol::GetAddressRangePtr() will only return a non NULL address
428 // range if the symbol has a section!
429 const AddressRange *curr_range = curr_symbol->GetAddressRangePtr();
430 if (curr_range)
431 {
432 const addr_t curr_file_addr = curr_range->GetBaseAddress().GetFileAddress();
433 if (info_file_addr < curr_file_addr)
434 return -1;
435 if (info_file_addr > curr_file_addr)
436 return +1;
437 info->match_symbol = const_cast<Symbol *>(curr_symbol);
438 info->match_index_ptr = index_ptr;
439 return 0;
440 }
441
442 return -1;
443}
444
445static int
446SymbolWithClosestFileAddress (SymbolSearchInfo *info, const uint32_t *index_ptr)
447{
448 const Symbol *symbol = info->symtab->SymbolAtIndex (index_ptr[0]);
449 if (symbol == NULL)
450 return -1;
451
452 const addr_t info_file_addr = info->file_addr;
453 const AddressRange *curr_range = symbol->GetAddressRangePtr();
454 if (curr_range)
455 {
456 const addr_t curr_file_addr = curr_range->GetBaseAddress().GetFileAddress();
457 if (info_file_addr < curr_file_addr)
458 return -1;
459
460 // Since we are finding the closest symbol that is greater than or equal
461 // to 'info->file_addr' we set the symbol here. This will get set
462 // multiple times, but after the search is done it will contain the best
463 // symbol match
464 info->match_symbol = const_cast<Symbol *>(symbol);
465 info->match_index_ptr = index_ptr;
466 info->match_offset = info_file_addr - curr_file_addr;
467
468 if (info_file_addr > curr_file_addr)
469 return +1;
470 return 0;
471 }
472 return -1;
473}
474
475static SymbolSearchInfo
476FindIndexPtrForSymbolContainingAddress(Symtab* symtab, addr_t file_addr, const uint32_t* indexes, uint32_t num_indexes)
477{
478 SymbolSearchInfo info = { symtab, file_addr, NULL, NULL, 0 };
479 bsearch(&info, indexes, num_indexes, sizeof(uint32_t), (comparison_function)SymbolWithClosestFileAddress);
480 return info;
481}
482
483
484void
485Symtab::InitAddressIndexes()
486{
487 if (m_addr_indexes.empty())
488 {
489 AppendSymbolIndexesWithType (eSymbolTypeFunction, m_addr_indexes);
490 AppendSymbolIndexesWithType (eSymbolTypeGlobal, m_addr_indexes);
491 AppendSymbolIndexesWithType (eSymbolTypeStatic, m_addr_indexes);
492 AppendSymbolIndexesWithType (eSymbolTypeCode, m_addr_indexes);
493 AppendSymbolIndexesWithType (eSymbolTypeTrampoline, m_addr_indexes);
494 AppendSymbolIndexesWithType (eSymbolTypeData, m_addr_indexes);
495 SortSymbolIndexesByValue(m_addr_indexes, true);
496 m_addr_indexes.push_back(UINT32_MAX); // Terminator for bsearch since we might need to look at the next symbol
497 }
498}
499
500size_t
501Symtab::CalculateSymbolSize (Symbol *symbol)
502{
503 // Make sure this symbol is from this symbol table...
504 if (symbol < m_symbols.data() && symbol >= m_symbols.data() + m_symbols.size())
505 return 0;
506
507 // See if this symbol already has a byte size?
508 size_t byte_size = symbol->GetByteSize();
509
510 if (byte_size)
511 {
512 // It does, just return it
513 return byte_size;
514 }
515
516 // Else if this is an address based symbol, figure out the delta between
517 // it and the next address based symbol
518 if (symbol->GetAddressRangePtr())
519 {
520 if (m_addr_indexes.empty())
521 InitAddressIndexes();
522 const size_t num_addr_indexes = m_addr_indexes.size();
523 SymbolSearchInfo info = FindIndexPtrForSymbolContainingAddress(this, symbol->GetAddressRangePtr()->GetBaseAddress().GetFileAddress(), m_addr_indexes.data(), num_addr_indexes);
524 if (info.match_index_ptr != NULL)
525 {
526 const lldb::addr_t curr_file_addr = symbol->GetAddressRangePtr()->GetBaseAddress().GetFileAddress();
527 // We can figure out the address range of all symbols except the
528 // last one by taking the delta between the current symbol and
529 // the next symbol
530
531 for (uint32_t addr_index = info.match_index_ptr - m_addr_indexes.data() + 1;
532 addr_index < num_addr_indexes;
533 ++addr_index)
534 {
535 Symbol *next_symbol = SymbolAtIndex(m_addr_indexes[addr_index]);
536 if (next_symbol == NULL)
537 break;
538
539 assert (next_symbol->GetAddressRangePtr());
540 const lldb::addr_t next_file_addr = next_symbol->GetAddressRangePtr()->GetBaseAddress().GetFileAddress();
541 if (next_file_addr > curr_file_addr)
542 {
543 byte_size = next_file_addr - curr_file_addr;
544 symbol->GetAddressRangePtr()->SetByteSize(byte_size);
545 symbol->SetSizeIsSynthesized(true);
546 break;
547 }
548 }
549 }
550 }
551 return byte_size;
552}
553
554Symbol *
555Symtab::FindSymbolWithFileAddress (addr_t file_addr)
556{
557 if (m_addr_indexes.empty())
558 InitAddressIndexes();
559
560 SymbolSearchInfo info = { this, file_addr, NULL, NULL, 0 };
561
562 uint32_t* match = (uint32_t*)bsearch(&info, &m_addr_indexes[0], m_addr_indexes.size(), sizeof(uint32_t), (comparison_function)SymbolWithFileAddress);
563 if (match)
564 return SymbolAtIndex (*match);
565 return NULL;
566}
567
568
569Symbol *
570Symtab::FindSymbolContainingFileAddress (addr_t file_addr, const uint32_t* indexes, uint32_t num_indexes)
571{
572 SymbolSearchInfo info = { this, file_addr, NULL, NULL, 0 };
573
574 bsearch(&info, indexes, num_indexes, sizeof(uint32_t), (comparison_function)SymbolWithClosestFileAddress);
575
576 if (info.match_symbol)
577 {
578 if (info.match_offset < CalculateSymbolSize(info.match_symbol))
579 return info.match_symbol;
580 }
581 return NULL;
582}
583
584Symbol *
585Symtab::FindSymbolContainingFileAddress (addr_t file_addr)
586{
587 if (m_addr_indexes.empty())
588 InitAddressIndexes();
589
590 return FindSymbolContainingFileAddress (file_addr, &m_addr_indexes[0], m_addr_indexes.size());
591}
592