Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 1 | //===-- Value.cpp - Implement the Value class -----------------------------===// |
| 2 | // |
Chris Lattner | 8d44b99 | 2001-09-14 16:56:32 +0000 | [diff] [blame] | 3 | // This file implements the Value, User, and SymTabValue classes. |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 4 | // |
| 5 | //===----------------------------------------------------------------------===// |
| 6 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 7 | #include "llvm/InstrTypes.h" |
| 8 | #include "llvm/SymbolTable.h" |
| 9 | #include "llvm/SymTabValue.h" |
Chris Lattner | 67e5c29 | 2002-01-25 03:45:27 +0000 | [diff] [blame] | 10 | #include "llvm/DerivedTypes.h" |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | #include <algorithm> |
| 12 | |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | // Value Class |
| 15 | //===----------------------------------------------------------------------===// |
| 16 | |
Chris Lattner | 25450e3 | 2001-12-13 00:41:27 +0000 | [diff] [blame] | 17 | static inline const Type *checkType(const Type *Ty) { |
| 18 | assert(Ty && "Value defined with a null type: Error!"); |
| 19 | return Ty; |
| 20 | } |
| 21 | |
Chris Lattner | 7f74a56 | 2002-01-20 22:54:45 +0000 | [diff] [blame] | 22 | Value::Value(const Type *ty, ValueTy vty, const std::string &name = "") |
Chris Lattner | 25450e3 | 2001-12-13 00:41:27 +0000 | [diff] [blame] | 23 | : Name(name), Ty(checkType(ty), this) { |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 24 | VTy = vty; |
| 25 | } |
| 26 | |
| 27 | Value::~Value() { |
| 28 | #ifndef NDEBUG // Only in -g mode... |
Chris Lattner | 874ddad | 2001-06-11 15:04:40 +0000 | [diff] [blame] | 29 | // Check to make sure that there are no uses of this value that are still |
| 30 | // around when the value is destroyed. If there are, then we have a dangling |
| 31 | // reference and something is wrong. This code is here to print out what is |
| 32 | // still being referenced. The value in question should be printed as |
| 33 | // a <badref> |
| 34 | // |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 35 | if (Uses.begin() != Uses.end()) { |
Chris Lattner | 6fc8c23 | 2002-04-12 18:19:45 +0000 | [diff] [blame^] | 36 | std::cerr << "While deleting: " << Ty << "%" << Name << "\n"; |
Chris Lattner | 3d381bb | 2002-04-07 22:33:13 +0000 | [diff] [blame] | 37 | for (use_const_iterator I = Uses.begin(); I != Uses.end(); ++I) { |
| 38 | std::cerr << "Use still stuck around after Def is destroyed:"; |
| 39 | (*I)->dump(); |
| 40 | std::cerr << "\n"; |
| 41 | } |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 42 | } |
| 43 | #endif |
| 44 | assert(Uses.begin() == Uses.end()); |
| 45 | } |
| 46 | |
| 47 | void Value::replaceAllUsesWith(Value *D) { |
| 48 | assert(D && "Value::replaceAllUsesWith(<null>) is invalid!"); |
Chris Lattner | 2dd58ae | 2001-06-29 05:25:51 +0000 | [diff] [blame] | 49 | assert(D != this && "V->replaceAllUsesWith(V) is NOT valid!"); |
Chris Lattner | 25c8f60 | 2002-03-21 05:38:15 +0000 | [diff] [blame] | 50 | assert(D->getType() == getType() && |
| 51 | "replaceAllUses of value with new value of different type!"); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 52 | while (!Uses.empty()) { |
Chris Lattner | 8d44b99 | 2001-09-14 16:56:32 +0000 | [diff] [blame] | 53 | User *Use = Uses.back(); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 54 | #ifndef NDEBUG |
| 55 | unsigned NumUses = Uses.size(); |
| 56 | #endif |
| 57 | Use->replaceUsesOfWith(this, D); |
| 58 | |
| 59 | #ifndef NDEBUG // only in -g mode... |
Chris Lattner | 3d381bb | 2002-04-07 22:33:13 +0000 | [diff] [blame] | 60 | if (Uses.size() == NumUses) { |
| 61 | std::cerr << "Use: "; |
| 62 | Use->dump(); |
| 63 | std::cerr << "replace with: "; |
| 64 | D->dump(); |
| 65 | } |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 66 | #endif |
| 67 | assert(Uses.size() != NumUses && "Didn't remove definition!"); |
| 68 | } |
| 69 | } |
| 70 | |
Chris Lattner | 97d79f1 | 2001-09-07 16:57:07 +0000 | [diff] [blame] | 71 | // refineAbstractType - This function is implemented because we use |
| 72 | // potentially abstract types, and these types may be resolved to more |
| 73 | // concrete types after we are constructed. For the value class, we simply |
| 74 | // change Ty to point to the right type. :) |
| 75 | // |
| 76 | void Value::refineAbstractType(const DerivedType *OldTy, const Type *NewTy) { |
Chris Lattner | 67e5c29 | 2002-01-25 03:45:27 +0000 | [diff] [blame] | 77 | assert(Ty.get() == OldTy &&"Can't refine anything but my type!"); |
| 78 | if (OldTy == NewTy && !OldTy->isAbstract()) |
| 79 | Ty.removeUserFromConcrete(); |
Chris Lattner | 97d79f1 | 2001-09-07 16:57:07 +0000 | [diff] [blame] | 80 | Ty = NewTy; |
| 81 | } |
| 82 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 83 | void Value::killUse(User *i) { |
| 84 | if (i == 0) return; |
| 85 | use_iterator I = find(Uses.begin(), Uses.end(), i); |
| 86 | |
| 87 | assert(I != Uses.end() && "Use not in uses list!!"); |
| 88 | Uses.erase(I); |
| 89 | } |
| 90 | |
| 91 | User *Value::use_remove(use_iterator &I) { |
| 92 | assert(I != Uses.end() && "Trying to remove the end of the use list!!!"); |
| 93 | User *i = *I; |
| 94 | I = Uses.erase(I); |
| 95 | return i; |
| 96 | } |
| 97 | |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 98 | //===----------------------------------------------------------------------===// |
| 99 | // User Class |
| 100 | //===----------------------------------------------------------------------===// |
| 101 | |
Chris Lattner | 7f74a56 | 2002-01-20 22:54:45 +0000 | [diff] [blame] | 102 | User::User(const Type *Ty, ValueTy vty, const std::string &name) |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 103 | : Value(Ty, vty, name) { |
| 104 | } |
| 105 | |
| 106 | // replaceUsesOfWith - Replaces all references to the "From" definition with |
| 107 | // references to the "To" definition. |
| 108 | // |
| 109 | void User::replaceUsesOfWith(Value *From, Value *To) { |
| 110 | if (From == To) return; // Duh what? |
| 111 | |
Chris Lattner | a073acb | 2001-07-07 08:36:50 +0000 | [diff] [blame] | 112 | for (unsigned i = 0, E = getNumOperands(); i != E; ++i) |
| 113 | if (getOperand(i) == From) { // Is This operand is pointing to oldval? |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 114 | // The side effects of this setOperand call include linking to |
| 115 | // "To", adding "this" to the uses list of To, and |
| 116 | // most importantly, removing "this" from the use list of "From". |
Chris Lattner | a073acb | 2001-07-07 08:36:50 +0000 | [diff] [blame] | 117 | setOperand(i, To); // Fix it now... |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 118 | } |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 119 | } |
| 120 | |
| 121 | |
| 122 | //===----------------------------------------------------------------------===// |
| 123 | // SymTabValue Class |
| 124 | //===----------------------------------------------------------------------===// |
| 125 | |
Chris Lattner | 97d79f1 | 2001-09-07 16:57:07 +0000 | [diff] [blame] | 126 | SymTabValue::SymTabValue(Value *p) : ValueParent(p) { |
Chris Lattner | f2a738c | 2001-07-14 06:13:19 +0000 | [diff] [blame] | 127 | assert(ValueParent && "SymTavValue without parent!?!"); |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 128 | ParentSymTab = SymTab = 0; |
| 129 | } |
| 130 | |
| 131 | |
| 132 | SymTabValue::~SymTabValue() { |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 133 | delete SymTab; |
| 134 | } |
| 135 | |
| 136 | void SymTabValue::setParentSymTab(SymbolTable *ST) { |
| 137 | ParentSymTab = ST; |
| 138 | if (SymTab) |
| 139 | SymTab->setParentSymTab(ST); |
| 140 | } |
| 141 | |
| 142 | SymbolTable *SymTabValue::getSymbolTableSure() { |
| 143 | if (!SymTab) SymTab = new SymbolTable(ParentSymTab); |
| 144 | return SymTab; |
| 145 | } |
| 146 | |
| 147 | // hasSymbolTable() - Returns true if there is a symbol table allocated to |
| 148 | // this object AND if there is at least one name in it! |
| 149 | // |
| 150 | bool SymTabValue::hasSymbolTable() const { |
| 151 | if (!SymTab) return false; |
| 152 | |
| 153 | for (SymbolTable::const_iterator I = SymTab->begin(); |
Chris Lattner | 4cee8d8 | 2001-06-27 23:41:11 +0000 | [diff] [blame] | 154 | I != SymTab->end(); ++I) { |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 155 | if (I->second.begin() != I->second.end()) |
| 156 | return true; // Found nonempty type plane! |
| 157 | } |
| 158 | |
| 159 | return false; |
| 160 | } |