binutils/gold/dwarf_reader.cc

8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
13 // This program is distributed in the hope that it will be useful,
155   for (Abbrev_code_table::iterator it = this->high_abbrev_codes_.begin();
156        it != this->high_abbrev_codes_.end();
157        ++it)
159       if (it->second != NULL)
160 	delete it->second;
222 // It may be in the hash table, it may not have been read yet,
223 // or it may not exist in the abbrev table.
229   Abbrev_code_table::const_iterator it = this->high_abbrev_codes_.find(code);
230   if (it != this->high_abbrev_codes_.end())
231     return it->second;
584   // but in cases we know about, it seems OK to assume that the table
624   // it's harmless.
1019 // Get the name of the DIE and cache it.
1031 // Get the linkage name of the DIE and cache it.
1202       // when it reads a zero abbrev code.
1490 // a derived class needs to implement only the hooks that it needs
1761   // If the opcode is great than the opcode_base, it is a special
1870               typename Reloc_map::const_iterator it
1872               if (it != reloc_map_.end())
1882 		  lsm->address += it->second.second;
1883                   lsm->shndx = it->second.first;
1937 // Read the debug information at LINEPTR and store it in the line
2036   for (typename Lineno_map::iterator it = line_number_map_.begin();
2037        it != line_number_map_.end();
2038        ++it)
2040     std::sort(it->second.begin(), it->second.end());
2059 // comments below for the algorithm).  If it does, return an iterator
2061 // offset.  If not, it returns vector::end().
2071   std::vector<Offset_to_lineno_entry>::const_iterator it
2105   //         offsets[0].  Since it's not an exact match and we're
2117   //         offsets[1].  Since it's not an exact match, we back
2122   //         offsets[8].  Since it's not an exact match, we back
2127   //         offsets[19].  Since it's not an exact match, we back
2130   //         We note offsets[16] is a valid entry, so we return it.
2134   //         only by offset and last_line_for_offset.  (Note it
2137   //         we want it to be last.)
2140   if ((it == offsets->begin() && offset < it->offset)
2141       || it == offsets->end())
2145   if (offset == it->offset)
2147       while (it != offsets->end()
2148              && it->offset == offset
2149              && it->line_num == -1)
2150         ++it;
2151       if (it == offsets->end() || it->offset != offset)
2154         return it;
2159   gold_assert(it != offsets->begin());
2160   std::vector<Offset_to_lineno_entry>::const_iterator range_end = it;
2161   --it;
2162   const off_t range_value = it->offset;
2163   while (it != offsets->begin() && (it-1)->offset == range_value)
2164     --it;
2167   // equal_range [it, range_end) has a line_num != -1, it's a valid
2169   // last for an offset will be sorted first, so it'll get returned if
2170   // it's present.
2171   for (; it != range_end; ++it)
2172     if (it->line_num != -1)
2173       return it;
2202   typename std::vector<Offset_to_lineno_entry>::const_iterator it
2204   if (it == offsets->end())
2207   std::string result = this->format_file_lineno(*it);
2212       unsigned int last_file_num = it->file_num;
2213       int last_line_num = it->line_num;
2216       for (++it; it != offsets->end(); ++it)
2218 	  if (it->offset == offset && it->line_num == -1)
2220 	  if (it->line_num == -1)
2222 	  if (it->file_num != last_file_num || it->line_num != last_line_num)
2224 	      other_lines->push_back(this->format_file_lineno(*it));
2227 	      last_file_num = it->file_num;
2228 	      last_line_num = it->line_num;
2230 	  if (it->offset > offset && other_lines->size() >= 4)
2308   std::vector<Addr2line_cache_entry>::iterator it;
2311   for (it = addr2line_cache.begin(); it != addr2line_cache.end(); ++it)
2313       if (it->object == object && it->shndx == shndx)
2315           lineinfo = it->dwarf_line_info;
2316           it->generation_count = next_generation_count;
2321           if (it->access_count < 31)
2322             ++it->access_count;
2366       for (it = addr2line_cache.begin(); it != addr2line_cache.end(); ++it)
2368           const unsigned int score = (it->generation_count
2369                                       + (1U << it->access_count));
2373               lowest = it;
2389   for (std::vector<Addr2line_cache_entry>::iterator it = addr2line_cache.begin();
2390        it != addr2line_cache.end();
2391        ++it)
2392     delete it->dwarf_line_info;