diff options
author | Chris Lattner <sabre@nondot.org> | 2001-06-06 20:29:01 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2001-06-06 20:29:01 +0000 |
commit | 009505452b713ed2e3a8e99c5545a6e721c65495 (patch) | |
tree | 136a71c5b87bdf534d1f20a67558b49226b5a4d6 /lib/VMCore/SymbolTable.cpp | |
parent | 8d0afd3d32d1d67f9aa5df250a1d6955aa8f1ac9 (diff) | |
download | external_llvm-009505452b713ed2e3a8e99c5545a6e721c65495.zip external_llvm-009505452b713ed2e3a8e99c5545a6e721c65495.tar.gz external_llvm-009505452b713ed2e3a8e99c5545a6e721c65495.tar.bz2 |
Initial revision
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/VMCore/SymbolTable.cpp')
-rw-r--r-- | lib/VMCore/SymbolTable.cpp | 106 |
1 files changed, 106 insertions, 0 deletions
diff --git a/lib/VMCore/SymbolTable.cpp b/lib/VMCore/SymbolTable.cpp new file mode 100644 index 0000000..395c23f --- /dev/null +++ b/lib/VMCore/SymbolTable.cpp @@ -0,0 +1,106 @@ +//===-- SymbolTable.cpp - Implement the SymbolTable class -------------------=// +// +// This file implements the SymbolTable class for the VMCore library. +// +//===----------------------------------------------------------------------===// + +#include "llvm/SymbolTable.h" +#include "llvm/InstrTypes.h" +#ifndef NDEBUG +#include "llvm/BasicBlock.h" // Required for assertions to work. +#include "llvm/Type.h" +#endif + +SymbolTable::~SymbolTable() { +#ifndef NDEBUG // Only do this in -g mode... + bool Good = true; + for (iterator i = begin(); i != end(); i++) { + if (i->second.begin() != i->second.end()) { + for (type_iterator I = i->second.begin(); I != i->second.end(); I++) + cerr << "Value still in symbol table! Type = " << i->first->getName() + << " Name = " << I->first << endl; + Good = false; + } + } + assert(Good && "Values remain in symbol table!"); +#endif +} + +SymbolTable::type_iterator SymbolTable::type_find(const Value *D) { + assert(D->hasName() && "type_find(Value*) only works on named nodes!"); + return type_find(D->getType(), D->getName()); +} + + +// find - returns end(Ty->getIDNumber()) on failure... +SymbolTable::type_iterator SymbolTable::type_find(const Type *Ty, + const string &Name) { + iterator I = find(Ty); + if (I == end()) { // Not in collection yet... insert dummy entry + (*this)[Ty] = VarMap(); + I = find(Ty); + assert(I != end() && "How did insert fail?"); + } + + return I->second.find(Name); +} + + +// lookup - Returns null on failure... +Value *SymbolTable::lookup(const Type *Ty, const string &Name) { + iterator I = find(Ty); + if (I != end()) { // We have symbols in that plane... + type_iterator J = I->second.find(Name); + if (J != I->second.end()) // and the name is in our hash table... + return J->second; + } + + return ParentSymTab ? ParentSymTab->lookup(Ty, Name) : 0; +} + +void SymbolTable::remove(Value *N) { + assert(N->hasName() && "Value doesn't have name!"); + assert(type_find(N) != type_end(N->getType()) && + "Value not in symbol table!"); + type_remove(type_find(N)); +} + + +#define DEBUG_SYMBOL_TABLE 0 + +Value *SymbolTable::type_remove(const type_iterator &It) { + Value *Result = It->second; +#if DEBUG_SYMBOL_TABLE + cerr << this << " Removing Value: " << Result->getName() << endl; +#endif + + find(Result->getType())->second.erase(It); + + return Result; +} + +void SymbolTable::insert(Value *N) { + assert(N->hasName() && "Value must be named to go into symbol table!"); + + // TODO: The typeverifier should catch this when its implemented + if (lookup(N->getType(), N->getName())) { + cerr << "SymbolTable WARNING: Name already in symbol table: '" + << N->getName() << "'\n"; + abort(); // TODO: REMOVE THIS + } + +#if DEBUG_SYMBOL_TABLE + cerr << this << " Inserting definition: " << N->getName() << ": " + << N->getType()->getName() << endl; +#endif + + iterator I = find(N->getType()); + if (I == end()) { // Not in collection yet... insert dummy entry + (*this)[N->getType()] = VarMap(); + I = find(N->getType()); + assert(I != end() && "How did insert fail?"); + } + + I->second.insert(make_pair(N->getName(), N)); +} + |