symtab.cc revision 1762 
1/*
2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
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.
15 *
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.
27 */
28
29#include <iostream>
30#include <fstream>
31#include <string>
32#include <vector>
33
34#include "sim/host.hh"
35#include "base/misc.hh"
36#include "base/str.hh"
37#include "base/loader/symtab.hh"
38
39using namespace std;
40
41SymbolTable *debugSymbolTable = NULL;
42
43bool
44SymbolTable::insert(Addr address, string symbol)
45{
46    if (!addrTable.insert(make_pair(address, symbol)).second)
47        return false;
48
49    if (!symbolTable.insert(make_pair(symbol, address)).second)
50        return false;
51
52    return true;
53}
54
55
56bool
57SymbolTable::load(const string &filename)
58{
59    string buffer;
60    ifstream file(filename.c_str());
61
62    if (!file) {
63        cerr << "Can't open symbol table file " << filename << endl;
64        fatal("file error");
65    }
66
67    while (!file.eof()) {
68        getline(file, buffer);
69        if (buffer.empty())
70            continue;
71
72        int idx = buffer.find(',');
73        if (idx == string::npos)
74            return false;
75
76        string address = buffer.substr(0, idx);
77        eat_white(address);
78        if (address.empty())
79            return false;
80
81        string symbol = buffer.substr(idx + 1);
82        eat_white(symbol);
83        if (symbol.empty())
84            return false;
85
86        Addr addr;
87        if (!to_number(address, addr))
88            return false;
89
90        if (!insert(addr, symbol))
91            return false;
92    }
93
94    file.close();
95
96    return true;
97}
98
99bool
100SymbolTable::findNearestSymbol(Addr address, string &symbol,
101                               Addr &sym_address, Addr &next_sym_address) const
102{
103    // find first key *larger* than desired address
104    ATable::const_iterator i = addrTable.upper_bound(address);
105
106    // if very first key is larger, we're out of luck
107    if (i == addrTable.begin())
108        return false;
109
110    next_sym_address = i->first;
111    --i;
112    sym_address = i->first;
113    symbol = i->second;
114
115    return true;
116}
117
118bool
119SymbolTable::findSymbol(Addr address, string &symbol) const
120{
121    ATable::const_iterator i = addrTable.find(address);
122    if (i == addrTable.end())
123        return false;
124
125    symbol = (*i).second;
126    return true;
127}
128
129bool
130SymbolTable::findAddress(const string &symbol, Addr &address) const
131{
132    STable::const_iterator i = symbolTable.find(symbol);
133    if (i == symbolTable.end())
134        return false;
135
136    address = (*i).second;
137    return true;
138}
139