1 //===-- llvm/SymbolTable.h - Implement a type planned symtab ------*- C++ -*-=//
3 // This file implements a symbol table that has planed broken up by type.
4 // Identical types may have overlapping symbol names as long as they are
7 // Note that this implements a chained symbol table. If a name being 'lookup'd
8 // isn't found in the current symbol table, then the parent symbol table is
11 // This chaining behavior does NOT affect iterators though: only the lookup
14 //===----------------------------------------------------------------------===//
16 #ifndef LLVM_SYMBOL_TABLE_H
17 #define LLVM_SYMBOL_TABLE_H
19 #include "llvm/Value.h"
22 #ifndef NDEBUG // Only for assertions
23 #include "llvm/Type.h"
24 #include "llvm/ConstantVals.h"
29 class SymbolTable : public AbstractTypeUser,
30 public map<const Type *, map<const string, Value *> > {
32 typedef map<const string, Value *> VarMap;
33 typedef map<const Type *, VarMap> super;
36 SymbolTable *ParentSymTab;
38 friend class SymTabValue;
39 inline void setParentSymTab(SymbolTable *P) { ParentSymTab = P; }
42 typedef VarMap::iterator type_iterator;
43 typedef VarMap::const_iterator type_const_iterator;
45 inline SymbolTable(SymbolTable *P = 0) {
47 InternallyInconsistent = false;
51 SymbolTable *getParentSymTab() { return ParentSymTab; }
53 // lookup - Returns null on failure...
54 Value *lookup(const Type *Ty, const string &name);
56 // insert - Add named definition to the symbol table...
57 inline void insert(Value *N) {
58 assert(N->hasName() && "Value must be named to go into symbol table!");
59 insertEntry(N->getName(), N->getType(), N);
62 // insert - Insert a constant or type into the symbol table with the specified
63 // name... There can be a many to one mapping between names and
66 inline void insert(const string &Name, Value *V) {
67 assert((isa<Type>(V) || isa<Constant>(V)) &&
68 "Can only insert types and constants here!");
69 insertEntry(Name, V->getType(), V);
72 void remove(Value *N);
73 Value *type_remove(const type_iterator &It) {
74 return removeEntry(find(It->second->getType()), It);
77 // getUniqueName - Given a base name, return a string that is either equal to
78 // it (or derived from it) that does not already occur in the symbol table for
79 // the specified type.
81 string getUniqueName(const Type *Ty, const string &BaseName);
83 inline unsigned type_size(const Type *TypeID) const {
84 return find(TypeID)->second.size();
87 // Note that type_begin / type_end only work if you know that an element of
88 // TypeID is already in the symbol table!!!
90 inline type_iterator type_begin(const Type *TypeID) {
91 return find(TypeID)->second.begin();
93 inline type_const_iterator type_begin(const Type *TypeID) const {
94 return find(TypeID)->second.begin();
97 inline type_iterator type_end(const Type *TypeID) {
98 return find(TypeID)->second.end();
100 inline type_const_iterator type_end(const Type *TypeID) const {
101 return find(TypeID)->second.end();
104 void dump() const; // Debug method, print out symbol table
107 // InternallyInconsistent - There are times when the symbol table is
108 // internally inconsistent with the rest of the program. In this one case, a
109 // value exists with a Name, and it's not in the symbol table. When we call
110 // V->setName(""), it tries to remove itself from the symbol table and dies.
111 // We know this is happening, and so if the flag InternallyInconsistent is
112 // set, removal from the symbol table is a noop.
114 bool InternallyInconsistent;
116 inline super::value_type operator[](const Type *Ty) {
117 assert(0 && "Should not use this operator to access symbol table!");
118 return super::value_type();
121 // insertEntry - Insert a value into the symbol table with the specified
124 void insertEntry(const string &Name, const Type *Ty, Value *V);
126 // removeEntry - Remove a value from the symbol table...
128 Value *removeEntry(iterator Plane, type_iterator Entry);
130 // This function is called when one of the types in the type plane are refined
131 virtual void refineAbstractType(const DerivedType *OldTy, const Type *NewTy);