// insert - Add named definition to the symbol table...
inline void insert(Value *N) {
assert(N->hasName() && "Value must be named to go into symbol table!");
- insertEntry(N->getName(), N);
+ insertEntry(N->getName(), N->getType(), N);
}
// insert - Insert a constant or type into the symbol table with the specified
inline void insert(const string &Name, Value *V) {
assert((isa<Type>(V) || isa<ConstPoolVal>(V)) &&
"Can only insert types and constants here!");
- insertEntry(Name, V);
+ insertEntry(Name, V->getType(), V);
}
void remove(Value *N);
// insertEntry - Insert a value into the symbol table with the specified
// name...
//
- void insertEntry(const string &Name, Value *V);
+ void insertEntry(const string &Name, const Type *Ty, Value *V);
// This function is called when one of the types in the type plane are refined
virtual void refineAbstractType(const DerivedType *OldTy, const Type *NewTy);
// insertEntry - Insert a value into the symbol table with the specified
// name...
//
-void SymbolTable::insertEntry(const string &Name, Value *V) {
- const Type *VTy = V->getType();
-
+void SymbolTable::insertEntry(const string &Name, const Type *VTy, Value *V) {
// TODO: The typeverifier should catch this when its implemented
assert(lookup(VTy, Name) == 0 &&
"SymbolTable::insertEntry - Name already in symbol table!");
iterator I = find(VTy);
if (I == end()) { // Not in collection yet... insert dummy entry
- (*this)[VTy] = VarMap();
- I = find(VTy);
+ // Insert a new empty element. I points to the new elements.
+ I = super::insert(make_pair(VTy, VarMap())).first;
assert(I != end() && "How did insert fail?");
+
+ // Check to see if the type is abstract. If so, it might be refined in the
+ // future, which would cause the plane of the old type to get merged into
+ // a new type plane.
+ //
+ if (VTy->isAbstract())
+ cast<DerivedType>(VTy)->addAbstractTypeUser(this);
}
I->second.insert(make_pair(Name, V));
const Type *NewType) {
if (OldType == NewType) return; // Noop, don't waste time dinking around
- iterator TPI = find(Type::TypeTy);
+ // Search to see if we have any values of the type oldtype. If so, we need to
+ // move them into the newtype plane...
+ iterator TPI = find(OldType);
+ if (TPI != end()) {
+ VarMap &OldPlane = TPI->second;
+ while (!OldPlane.empty()) {
+ pair<const string, Value*> V = *OldPlane.begin();
+ OldPlane.erase(OldPlane.begin());
+ insertEntry(V.first, NewType, V.second);
+ }
+
+ // Ok, now we are not referencing the type anymore... take me off your user
+ // list please!
+ OldType->removeAbstractTypeUser(this);
+ }
+
+ TPI = find(Type::TypeTy);
assert(TPI != end() &&"Type plane not in symbol table but we contain types!");
// Loop over all of the types in the symbol table, replacing any references to