2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
39 #include "base/trace.hh"
40 #include "base/types.hh"
41 #include "sim/serialize.hh"
62 typedef std::shared_ptr<SymbolTable> SymbolTablePtr;
65 typedef std::vector<Symbol> SymbolVector;
66 // Map addresses to an index into the symbol vector.
67 typedef std::multimap<Addr, int> AddrMap;
68 // Map a symbol name to an index into the symbol vector.
69 typedef std::map<std::string, int> NameMap;
76 upperBound(Addr addr, AddrMap::const_iterator &iter) const
78 // find first key *larger* than desired address
79 iter = addrMap.upper_bound(addr);
81 // if very first key is larger, we're out of luck
82 if (iter == addrMap.begin())
88 typedef std::function<void(SymbolTable &symtab,
89 const Symbol &symbol)> SymTabOp;
91 operate(SymTabOp op) const
93 SymbolTablePtr symtab(new SymbolTable);
94 for (const auto &symbol: symbols)
99 typedef std::function<bool(const Symbol &symbol)> SymTabFilter;
101 filter(SymTabFilter filter) const
103 SymTabOp apply_filter =
104 [filter](SymbolTable &symtab, const Symbol &symbol) {
105 if (filter(symbol)) {
106 symtab.insert(symbol);
109 return operate(apply_filter);
113 filterByBinding(Symbol::Binding binding) const
115 auto filt = [binding](const Symbol &symbol) {
116 return symbol.binding == binding;
122 typedef SymbolVector::iterator iterator;
123 typedef SymbolVector::const_iterator const_iterator;
125 const_iterator begin() const { return symbols.begin(); }
126 const_iterator end() const { return symbols.end(); }
129 // Insert either a single symbol or the contents of an entire symbol table
131 bool insert(const Symbol &symbol);
132 bool insert(const SymbolTable &other);
133 bool load(const std::string &file);
134 bool empty() const { return symbols.empty(); }
137 offset(Addr by) const
139 SymTabOp op = [by](SymbolTable &symtab, const Symbol &symbol) {
150 SymTabOp op = [m](SymbolTable &symtab, const Symbol &symbol) {
161 return filterByBinding(Symbol::Binding::Global);
167 return filterByBinding(Symbol::Binding::Local);
173 return filterByBinding(Symbol::Binding::Weak);
176 void serialize(const std::string &base, CheckpointOut &cp) const;
177 void unserialize(const std::string &base, CheckpointIn &cp,
178 Symbol::Binding default_binding=Symbol::Binding::Global);
181 find(Addr address) const
183 AddrMap::const_iterator i = addrMap.find(address);
184 if (i == addrMap.end())
187 // There are potentially multiple symbols that map to the same
188 // address. For simplicity, just return the first one.
189 return symbols.begin() + i->second;
193 find(const std::string &name) const
195 NameMap::const_iterator i = nameMap.find(name);
196 if (i == nameMap.end())
199 return symbols.begin() + i->second;
202 /// Find the nearest symbol equal to or less than the supplied
203 /// address (e.g., the label for the enclosing function).
204 /// @param addr The address to look up.
205 /// @param nextaddr Address of following symbol (for
206 /// determining valid range of symbol).
207 /// @retval A const_iterator which points to the symbol if found, or end.
209 findNearest(Addr addr, Addr &nextaddr) const
211 AddrMap::const_iterator i = addrMap.end();
212 if (!upperBound(addr, i))
217 return symbols.begin() + i->second;
220 /// Overload for findNearestSymbol() for callers who don't care
223 findNearest(Addr addr) const
225 AddrMap::const_iterator i = addrMap.end();
226 if (!upperBound(addr, i))
230 return symbols.begin() + i->second;
234 /// Global unified debugging symbol table (for target). Conceptually
235 /// there should be one of these per System object for full system,
236 /// and per Process object for non-full-system, but so far one big
237 /// global one has worked well enough.
238 extern SymbolTable debugSymbolTable;
240 } // namespace Loader
242 #endif // __SYMTAB_HH__