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.
28 * Authors: Nathan Binkert
38 #include "sim/host.hh" // for Addr
44 typedef std::map<Addr, std::string> ATable;
45 typedef std::map<std::string, Addr> STable;
53 upperBound(Addr addr, ATable::const_iterator &iter) const
55 // find first key *larger* than desired address
56 iter = addrTable.upper_bound(addr);
58 // if very first key is larger, we're out of luck
59 if (iter == addrTable.begin())
67 SymbolTable(const std::string &file) { load(file); }
71 bool insert(Addr address, std::string symbol);
72 bool load(const std::string &file);
74 const ATable &getAddrTable() const { return addrTable; }
75 const STable &getSymbolTable() const { return symbolTable; }
78 void serialize(const std::string &base, std::ostream &os);
79 void unserialize(const std::string &base, Checkpoint *cp,
80 const std::string §ion);
84 findSymbol(Addr address, std::string &symbol) const
86 ATable::const_iterator i = addrTable.find(address);
87 if (i == addrTable.end())
95 findAddress(const std::string &symbol, Addr &address) const
97 STable::const_iterator i = symbolTable.find(symbol);
98 if (i == symbolTable.end())
101 address = (*i).second;
105 /// Find the nearest symbol equal to or less than the supplied
106 /// address (e.g., the label for the enclosing function).
107 /// @param addr The address to look up.
108 /// @param symbol Return reference for symbol string.
109 /// @param symaddr Return reference for symbol address.
110 /// @param nextaddr Address of following symbol (for
111 /// determining valid range of symbol).
112 /// @retval True if a symbol was found.
114 findNearestSymbol(Addr addr, std::string &symbol, Addr &symaddr,
115 Addr &nextaddr) const
117 ATable::const_iterator i;
118 if (!upperBound(addr, i))
128 /// Overload for findNearestSymbol() for callers who don't care
131 findNearestSymbol(Addr addr, std::string &symbol, Addr &symaddr) const
133 ATable::const_iterator i;
134 if (!upperBound(addr, i))
145 findNearestAddr(Addr addr, Addr &symaddr, Addr &nextaddr) const
147 ATable::const_iterator i;
148 if (!upperBound(addr, i))
158 findNearestAddr(Addr addr, Addr &symaddr) const
160 ATable::const_iterator i;
161 if (!upperBound(addr, i))
170 /// Global unified debugging symbol table (for target). Conceptually
171 /// there should be one of these per System object for full system,
172 /// and per Process object for non-full-system, but so far one big
173 /// global one has worked well enough.
174 extern SymbolTable *debugSymbolTable;
176 #endif // __SYMTAB_HH__