1 //===-- ValueSymbolTable.cpp - Implement the ValueSymbolTable class -------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group. It is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the ValueSymbolTable class for the VMCore library.
12 //===----------------------------------------------------------------------===//
14 #define DEBUG_TYPE "valuesymtab"
15 #include "llvm/GlobalValue.h"
16 #include "llvm/Type.h"
17 #include "llvm/ValueSymbolTable.h"
18 #include "llvm/ADT/StringExtras.h"
19 #include "llvm/Support/Debug.h"
24 ValueSymbolTable::~ValueSymbolTable() {
25 #ifndef NDEBUG // Only do this in -g mode...
26 for (iterator VI = vmap.begin(), VE = vmap.end(); VI != VE; ++VI)
27 DEBUG(DOUT << "Value still in symbol table! Type = '"
28 << VI->second->getType()->getDescription() << "' Name = '"
29 << VI->first << "'\n");
30 assert(vmap.empty() && "Values remain in symbol table!");
34 // getUniqueName - Given a base name, return a string that is either equal to
35 // it (or derived from it) that does not already occur in the symbol table for
36 // the specified type.
38 std::string ValueSymbolTable::getUniqueName(const std::string &BaseName) const {
39 std::string TryName = BaseName;
40 const_iterator End = vmap.end();
42 // See if the name exists
43 while (vmap.find(TryName) != End) // Loop until we find a free
44 TryName = BaseName + utostr(++LastUnique); // name in the symbol table
49 // lookup a value - Returns null on failure...
51 Value *ValueSymbolTable::lookup(const std::string &Name) const {
52 const_iterator VI = vmap.find(Name);
53 if (VI != vmap.end()) // We found the symbol
54 return const_cast<Value*>(VI->second);
58 // Insert a value into the symbol table with the specified name...
60 void ValueSymbolTable::insert(Value* V) {
61 assert(V && "Can't insert null Value into symbol table!");
62 assert(V->hasName() && "Can't insert nameless Value into symbol table");
64 // Try inserting the name, assuming it won't conflict.
65 if (vmap.insert(make_pair(V->Name, V)).second) {
66 DOUT << " Inserted value: " << V->Name << ": " << *V << "\n";
70 // Otherwise, there is a naming conflict. Rename this value.
71 std::string UniqueName = V->getName();
72 unsigned BaseSize = UniqueName.size();
74 // Trim any suffix off.
75 UniqueName.resize(BaseSize);
76 UniqueName += utostr(++LastUnique);
77 // Try insert the vmap entry with this suffix.
78 } while (!vmap.insert(make_pair(UniqueName, V)).second);
82 DEBUG(DOUT << " Inserted value: " << UniqueName << ": " << *V << "\n");
86 void ValueSymbolTable::remove(Value *V) {
87 assert(V->hasName() && "Value doesn't have name!");
88 iterator Entry = vmap.find(V->getName());
89 assert(Entry != vmap.end() && "Entry was not in the symtab!");
91 DEBUG(DOUT << " Removing Value: " << Entry->second->getName() << "\n");
93 // Remove the value from the plane...
97 // DumpVal - a std::for_each function for dumping a value
99 static void DumpVal(const std::pair<const std::string, Value *> &V) {
100 DOUT << " '" << V.first << "' = ";
105 // dump - print out the symbol table
107 void ValueSymbolTable::dump() const {
108 DOUT << "ValueSymbolTable:\n";
109 for_each(vmap.begin(), vmap.end(), DumpVal);