1 //===-- Constants.cpp - Implement Constant nodes --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Constant* classes...
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Constants.h"
15 #include "ConstantFolding.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/GlobalValue.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/SymbolTable.h"
20 #include "llvm/Module.h"
21 #include "llvm/ADT/StringExtras.h"
22 #include "llvm/Support/MathExtras.h"
27 ConstantBool *ConstantBool::True = new ConstantBool(true);
28 ConstantBool *ConstantBool::False = new ConstantBool(false);
31 //===----------------------------------------------------------------------===//
33 //===----------------------------------------------------------------------===//
35 void Constant::destroyConstantImpl() {
36 // When a Constant is destroyed, there may be lingering
37 // references to the constant by other constants in the constant pool. These
38 // constants are implicitly dependent on the module that is being deleted,
39 // but they don't know that. Because we only find out when the CPV is
40 // deleted, we must now notify all of our users (that should only be
41 // Constants) that they are, in fact, invalid now and should be deleted.
43 while (!use_empty()) {
44 Value *V = use_back();
45 #ifndef NDEBUG // Only in -g mode...
46 if (!isa<Constant>(V))
47 std::cerr << "While deleting: " << *this
48 << "\n\nUse still stuck around after Def is destroyed: "
51 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
52 Constant *CV = cast<Constant>(V);
53 CV->destroyConstant();
55 // The constant should remove itself from our use list...
56 assert((use_empty() || use_back() != V) && "Constant not removed!");
59 // Value has no outstanding references it is safe to delete it now...
63 // Static constructor to create a '0' constant of arbitrary type...
64 Constant *Constant::getNullValue(const Type *Ty) {
65 switch (Ty->getTypeID()) {
66 case Type::BoolTyID: {
67 static Constant *NullBool = ConstantBool::get(false);
70 case Type::SByteTyID: {
71 static Constant *NullSByte = ConstantSInt::get(Type::SByteTy, 0);
74 case Type::UByteTyID: {
75 static Constant *NullUByte = ConstantUInt::get(Type::UByteTy, 0);
78 case Type::ShortTyID: {
79 static Constant *NullShort = ConstantSInt::get(Type::ShortTy, 0);
82 case Type::UShortTyID: {
83 static Constant *NullUShort = ConstantUInt::get(Type::UShortTy, 0);
87 static Constant *NullInt = ConstantSInt::get(Type::IntTy, 0);
90 case Type::UIntTyID: {
91 static Constant *NullUInt = ConstantUInt::get(Type::UIntTy, 0);
94 case Type::LongTyID: {
95 static Constant *NullLong = ConstantSInt::get(Type::LongTy, 0);
98 case Type::ULongTyID: {
99 static Constant *NullULong = ConstantUInt::get(Type::ULongTy, 0);
103 case Type::FloatTyID: {
104 static Constant *NullFloat = ConstantFP::get(Type::FloatTy, 0);
107 case Type::DoubleTyID: {
108 static Constant *NullDouble = ConstantFP::get(Type::DoubleTy, 0);
112 case Type::PointerTyID:
113 return ConstantPointerNull::get(cast<PointerType>(Ty));
115 case Type::StructTyID:
116 case Type::ArrayTyID:
117 case Type::PackedTyID:
118 return ConstantAggregateZero::get(Ty);
120 // Function, Label, or Opaque type?
121 assert(!"Cannot create a null constant of that type!");
126 // Static constructor to create the maximum constant of an integral type...
127 ConstantIntegral *ConstantIntegral::getMaxValue(const Type *Ty) {
128 switch (Ty->getTypeID()) {
129 case Type::BoolTyID: return ConstantBool::True;
130 case Type::SByteTyID:
131 case Type::ShortTyID:
133 case Type::LongTyID: {
134 // Calculate 011111111111111...
135 unsigned TypeBits = Ty->getPrimitiveSize()*8;
136 int64_t Val = INT64_MAX; // All ones
137 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
138 return ConstantSInt::get(Ty, Val);
141 case Type::UByteTyID:
142 case Type::UShortTyID:
144 case Type::ULongTyID: return getAllOnesValue(Ty);
150 // Static constructor to create the minimum constant for an integral type...
151 ConstantIntegral *ConstantIntegral::getMinValue(const Type *Ty) {
152 switch (Ty->getTypeID()) {
153 case Type::BoolTyID: return ConstantBool::False;
154 case Type::SByteTyID:
155 case Type::ShortTyID:
157 case Type::LongTyID: {
158 // Calculate 1111111111000000000000
159 unsigned TypeBits = Ty->getPrimitiveSize()*8;
160 int64_t Val = -1; // All ones
161 Val <<= TypeBits-1; // Shift over to the right spot
162 return ConstantSInt::get(Ty, Val);
165 case Type::UByteTyID:
166 case Type::UShortTyID:
168 case Type::ULongTyID: return ConstantUInt::get(Ty, 0);
174 // Static constructor to create an integral constant with all bits set
175 ConstantIntegral *ConstantIntegral::getAllOnesValue(const Type *Ty) {
176 switch (Ty->getTypeID()) {
177 case Type::BoolTyID: return ConstantBool::True;
178 case Type::SByteTyID:
179 case Type::ShortTyID:
181 case Type::LongTyID: return ConstantSInt::get(Ty, -1);
183 case Type::UByteTyID:
184 case Type::UShortTyID:
186 case Type::ULongTyID: {
187 // Calculate ~0 of the right type...
188 unsigned TypeBits = Ty->getPrimitiveSize()*8;
189 uint64_t Val = ~0ULL; // All ones
190 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
191 return ConstantUInt::get(Ty, Val);
197 bool ConstantUInt::isAllOnesValue() const {
198 unsigned TypeBits = getType()->getPrimitiveSize()*8;
199 uint64_t Val = ~0ULL; // All ones
200 Val >>= 64-TypeBits; // Shift out inappropriate bits
201 return getValue() == Val;
205 //===----------------------------------------------------------------------===//
206 // ConstantXXX Classes
207 //===----------------------------------------------------------------------===//
209 //===----------------------------------------------------------------------===//
210 // Normal Constructors
212 ConstantIntegral::ConstantIntegral(const Type *Ty, ValueTy VT, uint64_t V)
213 : Constant(Ty, VT, 0, 0) {
217 ConstantBool::ConstantBool(bool V)
218 : ConstantIntegral(Type::BoolTy, ConstantBoolVal, V) {
221 ConstantInt::ConstantInt(const Type *Ty, ValueTy VT, uint64_t V)
222 : ConstantIntegral(Ty, VT, V) {
225 ConstantSInt::ConstantSInt(const Type *Ty, int64_t V)
226 : ConstantInt(Ty, ConstantSIntVal, V) {
227 assert(Ty->isInteger() && Ty->isSigned() &&
228 "Illegal type for signed integer constant!");
229 assert(isValueValidForType(Ty, V) && "Value too large for type!");
232 ConstantUInt::ConstantUInt(const Type *Ty, uint64_t V)
233 : ConstantInt(Ty, ConstantUIntVal, V) {
234 assert(Ty->isInteger() && Ty->isUnsigned() &&
235 "Illegal type for unsigned integer constant!");
236 assert(isValueValidForType(Ty, V) && "Value too large for type!");
239 ConstantFP::ConstantFP(const Type *Ty, double V)
240 : Constant(Ty, ConstantFPVal, 0, 0) {
241 assert(isValueValidForType(Ty, V) && "Value too large for type!");
245 ConstantArray::ConstantArray(const ArrayType *T,
246 const std::vector<Constant*> &V)
247 : Constant(T, ConstantArrayVal, new Use[V.size()], V.size()) {
248 assert(V.size() == T->getNumElements() &&
249 "Invalid initializer vector for constant array");
250 Use *OL = OperandList;
251 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
254 assert((E->getType() == T->getElementType() ||
256 E->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
257 "Initializer for array element doesn't match array element type!");
262 ConstantArray::~ConstantArray() {
263 delete [] OperandList;
266 ConstantStruct::ConstantStruct(const StructType *T,
267 const std::vector<Constant*> &V)
268 : Constant(T, ConstantStructVal, new Use[V.size()], V.size()) {
269 assert(V.size() == T->getNumElements() &&
270 "Invalid initializer vector for constant structure");
271 Use *OL = OperandList;
272 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
275 assert((E->getType() == T->getElementType(I-V.begin()) ||
276 ((T->getElementType(I-V.begin())->isAbstract() ||
277 E->getType()->isAbstract()) &&
278 T->getElementType(I-V.begin())->getTypeID() ==
279 E->getType()->getTypeID())) &&
280 "Initializer for struct element doesn't match struct element type!");
285 ConstantStruct::~ConstantStruct() {
286 delete [] OperandList;
290 ConstantPacked::ConstantPacked(const PackedType *T,
291 const std::vector<Constant*> &V)
292 : Constant(T, ConstantPackedVal, new Use[V.size()], V.size()) {
293 Use *OL = OperandList;
294 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
297 assert((E->getType() == T->getElementType() ||
299 E->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
300 "Initializer for packed element doesn't match packed element type!");
305 ConstantPacked::~ConstantPacked() {
306 delete [] OperandList;
309 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
310 /// behind the scenes to implement unary constant exprs.
311 class UnaryConstantExpr : public ConstantExpr {
314 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
315 : ConstantExpr(Ty, Opcode, &Op, 1), Op(C, this) {}
318 static bool isSetCC(unsigned Opcode) {
319 return Opcode == Instruction::SetEQ || Opcode == Instruction::SetNE ||
320 Opcode == Instruction::SetLT || Opcode == Instruction::SetGT ||
321 Opcode == Instruction::SetLE || Opcode == Instruction::SetGE;
324 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
325 /// behind the scenes to implement binary constant exprs.
326 class BinaryConstantExpr : public ConstantExpr {
329 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
330 : ConstantExpr(isSetCC(Opcode) ? Type::BoolTy : C1->getType(),
332 Ops[0].init(C1, this);
333 Ops[1].init(C2, this);
337 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
338 /// behind the scenes to implement select constant exprs.
339 class SelectConstantExpr : public ConstantExpr {
342 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
343 : ConstantExpr(C2->getType(), Instruction::Select, Ops, 3) {
344 Ops[0].init(C1, this);
345 Ops[1].init(C2, this);
346 Ops[2].init(C3, this);
350 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
351 /// used behind the scenes to implement getelementpr constant exprs.
352 struct GetElementPtrConstantExpr : public ConstantExpr {
353 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
355 : ConstantExpr(DestTy, Instruction::GetElementPtr,
356 new Use[IdxList.size()+1], IdxList.size()+1) {
357 OperandList[0].init(C, this);
358 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
359 OperandList[i+1].init(IdxList[i], this);
361 ~GetElementPtrConstantExpr() {
362 delete [] OperandList;
366 /// ConstantExpr::get* - Return some common constants without having to
367 /// specify the full Instruction::OPCODE identifier.
369 Constant *ConstantExpr::getNeg(Constant *C) {
370 if (!C->getType()->isFloatingPoint())
371 return get(Instruction::Sub, getNullValue(C->getType()), C);
373 return get(Instruction::Sub, ConstantFP::get(C->getType(), -0.0), C);
375 Constant *ConstantExpr::getNot(Constant *C) {
376 assert(isa<ConstantIntegral>(C) && "Cannot NOT a nonintegral type!");
377 return get(Instruction::Xor, C,
378 ConstantIntegral::getAllOnesValue(C->getType()));
380 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
381 return get(Instruction::Add, C1, C2);
383 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
384 return get(Instruction::Sub, C1, C2);
386 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
387 return get(Instruction::Mul, C1, C2);
389 Constant *ConstantExpr::getDiv(Constant *C1, Constant *C2) {
390 return get(Instruction::Div, C1, C2);
392 Constant *ConstantExpr::getRem(Constant *C1, Constant *C2) {
393 return get(Instruction::Rem, C1, C2);
395 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
396 return get(Instruction::And, C1, C2);
398 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
399 return get(Instruction::Or, C1, C2);
401 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
402 return get(Instruction::Xor, C1, C2);
404 Constant *ConstantExpr::getSetEQ(Constant *C1, Constant *C2) {
405 return get(Instruction::SetEQ, C1, C2);
407 Constant *ConstantExpr::getSetNE(Constant *C1, Constant *C2) {
408 return get(Instruction::SetNE, C1, C2);
410 Constant *ConstantExpr::getSetLT(Constant *C1, Constant *C2) {
411 return get(Instruction::SetLT, C1, C2);
413 Constant *ConstantExpr::getSetGT(Constant *C1, Constant *C2) {
414 return get(Instruction::SetGT, C1, C2);
416 Constant *ConstantExpr::getSetLE(Constant *C1, Constant *C2) {
417 return get(Instruction::SetLE, C1, C2);
419 Constant *ConstantExpr::getSetGE(Constant *C1, Constant *C2) {
420 return get(Instruction::SetGE, C1, C2);
422 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
423 return get(Instruction::Shl, C1, C2);
425 Constant *ConstantExpr::getShr(Constant *C1, Constant *C2) {
426 return get(Instruction::Shr, C1, C2);
429 Constant *ConstantExpr::getUShr(Constant *C1, Constant *C2) {
430 if (C1->getType()->isUnsigned()) return getShr(C1, C2);
431 return getCast(getShr(getCast(C1,
432 C1->getType()->getUnsignedVersion()), C2), C1->getType());
435 Constant *ConstantExpr::getSShr(Constant *C1, Constant *C2) {
436 if (C1->getType()->isSigned()) return getShr(C1, C2);
437 return getCast(getShr(getCast(C1,
438 C1->getType()->getSignedVersion()), C2), C1->getType());
442 //===----------------------------------------------------------------------===//
443 // isValueValidForType implementations
445 bool ConstantSInt::isValueValidForType(const Type *Ty, int64_t Val) {
446 switch (Ty->getTypeID()) {
448 return false; // These can't be represented as integers!!!
450 case Type::SByteTyID:
451 return (Val <= INT8_MAX && Val >= INT8_MIN);
452 case Type::ShortTyID:
453 return (Val <= INT16_MAX && Val >= INT16_MIN);
455 return (Val <= int(INT32_MAX) && Val >= int(INT32_MIN));
457 return true; // This is the largest type...
461 bool ConstantUInt::isValueValidForType(const Type *Ty, uint64_t Val) {
462 switch (Ty->getTypeID()) {
464 return false; // These can't be represented as integers!!!
467 case Type::UByteTyID:
468 return (Val <= UINT8_MAX);
469 case Type::UShortTyID:
470 return (Val <= UINT16_MAX);
472 return (Val <= UINT32_MAX);
473 case Type::ULongTyID:
474 return true; // This is the largest type...
478 bool ConstantFP::isValueValidForType(const Type *Ty, double Val) {
479 switch (Ty->getTypeID()) {
481 return false; // These can't be represented as floating point!
483 // TODO: Figure out how to test if a double can be cast to a float!
484 case Type::FloatTyID:
485 case Type::DoubleTyID:
486 return true; // This is the largest type...
490 //===----------------------------------------------------------------------===//
491 // Factory Function Implementation
493 // ConstantCreator - A class that is used to create constants by
494 // ValueMap*. This class should be partially specialized if there is
495 // something strange that needs to be done to interface to the ctor for the
499 template<class ConstantClass, class TypeClass, class ValType>
500 struct ConstantCreator {
501 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
502 return new ConstantClass(Ty, V);
506 template<class ConstantClass, class TypeClass>
507 struct ConvertConstantType {
508 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
509 assert(0 && "This type cannot be converted!\n");
516 template<class ValType, class TypeClass, class ConstantClass,
517 bool HasLargeKey = false /*true for arrays and structs*/ >
518 class ValueMap : public AbstractTypeUser {
520 typedef std::pair<const TypeClass*, ValType> MapKey;
521 typedef std::map<MapKey, ConstantClass *> MapTy;
522 typedef typename MapTy::iterator MapIterator;
524 /// Map - This is the main map from the element descriptor to the Constants.
525 /// This is the primary way we avoid creating two of the same shape
529 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
530 /// from the constants to their element in Map. This is important for
531 /// removal of constants from the array, which would otherwise have to scan
532 /// through the map with very large keys.
533 std::map<ConstantClass*, MapIterator> InverseMap;
535 typedef std::map<const TypeClass*, MapIterator> AbstractTypeMapTy;
536 AbstractTypeMapTy AbstractTypeMap;
538 friend void Constant::clearAllValueMaps();
540 void clear(std::vector<Constant *> &Constants) {
541 for(MapIterator I = Map.begin(); I != Map.end(); ++I)
542 Constants.push_back(I->second);
544 AbstractTypeMap.clear();
549 MapIterator map_end() { return Map.end(); }
551 void UpdateInverseMap(ConstantClass *C, MapIterator I) {
553 assert(I->second == C && "Bad inversemap entry!");
558 /// InsertOrGetItem - Return an iterator for the specified element.
559 /// If the element exists in the map, the returned iterator points to the
560 /// entry and Exists=true. If not, the iterator points to the newly
561 /// inserted entry and returns Exists=false. Newly inserted entries have
562 /// I->second == 0, and should be filled in.
563 MapIterator InsertOrGetItem(std::pair<MapKey, ConstantClass *> &InsertVal,
565 std::pair<MapIterator, bool> IP = Map.insert(InsertVal);
571 MapIterator FindExistingElement(ConstantClass *CP) {
573 typename std::map<ConstantClass*, MapIterator>::iterator
574 IMI = InverseMap.find(CP);
575 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
576 IMI->second->second == CP &&
577 "InverseMap corrupt!");
582 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
583 if (I == Map.end() || I->second != CP) {
584 // FIXME: This should not use a linear scan. If this gets to be a
585 // performance problem, someone should look at this.
586 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
593 /// SimpleRemove - This method removes the specified constant from the map,
594 /// without updating type information. This should only be used when we're
595 /// changing an element in the map, making this the second half of a 'move'
597 void SimpleRemove(ConstantClass *CP) {
598 MapIterator I = FindExistingElement(CP);
599 assert(I != Map.end() && "Constant not found in constant table!");
600 assert(I->second == CP && "Didn't find correct element?");
604 /// getOrCreate - Return the specified constant from the map, creating it if
606 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
607 MapKey Lookup(Ty, V);
608 MapIterator I = Map.lower_bound(Lookup);
609 if (I != Map.end() && I->first == Lookup)
610 return I->second; // Is it in the map?
612 // If no preexisting value, create one now...
613 ConstantClass *Result =
614 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
616 /// FIXME: why does this assert fail when loading 176.gcc?
617 //assert(Result->getType() == Ty && "Type specified is not correct!");
618 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
620 if (HasLargeKey) // Remember the reverse mapping if needed.
621 InverseMap.insert(std::make_pair(Result, I));
623 // If the type of the constant is abstract, make sure that an entry exists
624 // for it in the AbstractTypeMap.
625 if (Ty->isAbstract()) {
626 typename AbstractTypeMapTy::iterator TI =
627 AbstractTypeMap.lower_bound(Ty);
629 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
630 // Add ourselves to the ATU list of the type.
631 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
633 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
639 void remove(ConstantClass *CP) {
640 MapIterator I = FindExistingElement(CP);
641 assert(I != Map.end() && "Constant not found in constant table!");
642 assert(I->second == CP && "Didn't find correct element?");
644 if (HasLargeKey) // Remember the reverse mapping if needed.
645 InverseMap.erase(CP);
647 // Now that we found the entry, make sure this isn't the entry that
648 // the AbstractTypeMap points to.
649 const TypeClass *Ty = I->first.first;
650 if (Ty->isAbstract()) {
651 assert(AbstractTypeMap.count(Ty) &&
652 "Abstract type not in AbstractTypeMap?");
653 MapIterator &ATMEntryIt = AbstractTypeMap[Ty];
654 if (ATMEntryIt == I) {
655 // Yes, we are removing the representative entry for this type.
656 // See if there are any other entries of the same type.
657 MapIterator TmpIt = ATMEntryIt;
659 // First check the entry before this one...
660 if (TmpIt != Map.begin()) {
662 if (TmpIt->first.first != Ty) // Not the same type, move back...
666 // If we didn't find the same type, try to move forward...
667 if (TmpIt == ATMEntryIt) {
669 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
670 --TmpIt; // No entry afterwards with the same type
673 // If there is another entry in the map of the same abstract type,
674 // update the AbstractTypeMap entry now.
675 if (TmpIt != ATMEntryIt) {
678 // Otherwise, we are removing the last instance of this type
679 // from the table. Remove from the ATM, and from user list.
680 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
681 AbstractTypeMap.erase(Ty);
689 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
690 typename AbstractTypeMapTy::iterator I =
691 AbstractTypeMap.find(cast<TypeClass>(OldTy));
693 assert(I != AbstractTypeMap.end() &&
694 "Abstract type not in AbstractTypeMap?");
696 // Convert a constant at a time until the last one is gone. The last one
697 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
698 // eliminated eventually.
700 ConvertConstantType<ConstantClass,
701 TypeClass>::convert(I->second->second,
702 cast<TypeClass>(NewTy));
704 I = AbstractTypeMap.find(cast<TypeClass>(OldTy));
705 } while (I != AbstractTypeMap.end());
708 // If the type became concrete without being refined to any other existing
709 // type, we just remove ourselves from the ATU list.
710 void typeBecameConcrete(const DerivedType *AbsTy) {
711 AbsTy->removeAbstractTypeUser(this);
715 std::cerr << "Constant.cpp: ValueMap\n";
720 //---- ConstantUInt::get() and ConstantSInt::get() implementations...
722 static ValueMap< int64_t, Type, ConstantSInt> SIntConstants;
723 static ValueMap<uint64_t, Type, ConstantUInt> UIntConstants;
725 ConstantSInt *ConstantSInt::get(const Type *Ty, int64_t V) {
726 return SIntConstants.getOrCreate(Ty, V);
729 ConstantUInt *ConstantUInt::get(const Type *Ty, uint64_t V) {
730 return UIntConstants.getOrCreate(Ty, V);
733 ConstantInt *ConstantInt::get(const Type *Ty, unsigned char V) {
734 assert(V <= 127 && "Can only be used with very small positive constants!");
735 if (Ty->isSigned()) return ConstantSInt::get(Ty, V);
736 return ConstantUInt::get(Ty, V);
739 //---- ConstantFP::get() implementation...
743 struct ConstantCreator<ConstantFP, Type, uint64_t> {
744 static ConstantFP *create(const Type *Ty, uint64_t V) {
745 assert(Ty == Type::DoubleTy);
746 return new ConstantFP(Ty, BitsToDouble(V));
750 struct ConstantCreator<ConstantFP, Type, uint32_t> {
751 static ConstantFP *create(const Type *Ty, uint32_t V) {
752 assert(Ty == Type::FloatTy);
753 return new ConstantFP(Ty, BitsToFloat(V));
758 static ValueMap<uint64_t, Type, ConstantFP> DoubleConstants;
759 static ValueMap<uint32_t, Type, ConstantFP> FloatConstants;
761 bool ConstantFP::isNullValue() const {
762 return DoubleToBits(Val) == 0;
765 bool ConstantFP::isExactlyValue(double V) const {
766 return DoubleToBits(V) == DoubleToBits(Val);
770 ConstantFP *ConstantFP::get(const Type *Ty, double V) {
771 if (Ty == Type::FloatTy) {
772 // Force the value through memory to normalize it.
773 return FloatConstants.getOrCreate(Ty, FloatToBits(V));
775 assert(Ty == Type::DoubleTy);
776 return DoubleConstants.getOrCreate(Ty, DoubleToBits(V));
780 //---- ConstantAggregateZero::get() implementation...
783 // ConstantAggregateZero does not take extra "value" argument...
784 template<class ValType>
785 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
786 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
787 return new ConstantAggregateZero(Ty);
792 struct ConvertConstantType<ConstantAggregateZero, Type> {
793 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
794 // Make everyone now use a constant of the new type...
795 Constant *New = ConstantAggregateZero::get(NewTy);
796 assert(New != OldC && "Didn't replace constant??");
797 OldC->uncheckedReplaceAllUsesWith(New);
798 OldC->destroyConstant(); // This constant is now dead, destroy it.
803 static ValueMap<char, Type, ConstantAggregateZero> AggZeroConstants;
805 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
807 Constant *ConstantAggregateZero::get(const Type *Ty) {
808 return AggZeroConstants.getOrCreate(Ty, 0);
811 // destroyConstant - Remove the constant from the constant table...
813 void ConstantAggregateZero::destroyConstant() {
814 AggZeroConstants.remove(this);
815 destroyConstantImpl();
818 //---- ConstantArray::get() implementation...
822 struct ConvertConstantType<ConstantArray, ArrayType> {
823 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
824 // Make everyone now use a constant of the new type...
825 std::vector<Constant*> C;
826 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
827 C.push_back(cast<Constant>(OldC->getOperand(i)));
828 Constant *New = ConstantArray::get(NewTy, C);
829 assert(New != OldC && "Didn't replace constant??");
830 OldC->uncheckedReplaceAllUsesWith(New);
831 OldC->destroyConstant(); // This constant is now dead, destroy it.
836 static std::vector<Constant*> getValType(ConstantArray *CA) {
837 std::vector<Constant*> Elements;
838 Elements.reserve(CA->getNumOperands());
839 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
840 Elements.push_back(cast<Constant>(CA->getOperand(i)));
844 typedef ValueMap<std::vector<Constant*>, ArrayType,
845 ConstantArray, true /*largekey*/> ArrayConstantsTy;
846 static ArrayConstantsTy ArrayConstants;
848 Constant *ConstantArray::get(const ArrayType *Ty,
849 const std::vector<Constant*> &V) {
850 // If this is an all-zero array, return a ConstantAggregateZero object
853 if (!C->isNullValue())
854 return ArrayConstants.getOrCreate(Ty, V);
855 for (unsigned i = 1, e = V.size(); i != e; ++i)
857 return ArrayConstants.getOrCreate(Ty, V);
859 return ConstantAggregateZero::get(Ty);
862 // destroyConstant - Remove the constant from the constant table...
864 void ConstantArray::destroyConstant() {
865 ArrayConstants.remove(this);
866 destroyConstantImpl();
869 // ConstantArray::get(const string&) - Return an array that is initialized to
870 // contain the specified string. A null terminator is added to the specified
871 // string so that it may be used in a natural way...
873 Constant *ConstantArray::get(const std::string &Str) {
874 std::vector<Constant*> ElementVals;
876 for (unsigned i = 0; i < Str.length(); ++i)
877 ElementVals.push_back(ConstantSInt::get(Type::SByteTy, Str[i]));
879 // Add a null terminator to the string...
880 ElementVals.push_back(ConstantSInt::get(Type::SByteTy, 0));
882 ArrayType *ATy = ArrayType::get(Type::SByteTy, Str.length()+1);
883 return ConstantArray::get(ATy, ElementVals);
886 /// isString - This method returns true if the array is an array of sbyte or
887 /// ubyte, and if the elements of the array are all ConstantInt's.
888 bool ConstantArray::isString() const {
889 // Check the element type for sbyte or ubyte...
890 if (getType()->getElementType() != Type::UByteTy &&
891 getType()->getElementType() != Type::SByteTy)
893 // Check the elements to make sure they are all integers, not constant
895 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
896 if (!isa<ConstantInt>(getOperand(i)))
901 // getAsString - If the sub-element type of this array is either sbyte or ubyte,
902 // then this method converts the array to an std::string and returns it.
903 // Otherwise, it asserts out.
905 std::string ConstantArray::getAsString() const {
906 assert(isString() && "Not a string!");
908 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
909 Result += (char)cast<ConstantInt>(getOperand(i))->getRawValue();
914 //---- ConstantStruct::get() implementation...
919 struct ConvertConstantType<ConstantStruct, StructType> {
920 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
921 // Make everyone now use a constant of the new type...
922 std::vector<Constant*> C;
923 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
924 C.push_back(cast<Constant>(OldC->getOperand(i)));
925 Constant *New = ConstantStruct::get(NewTy, C);
926 assert(New != OldC && "Didn't replace constant??");
928 OldC->uncheckedReplaceAllUsesWith(New);
929 OldC->destroyConstant(); // This constant is now dead, destroy it.
934 typedef ValueMap<std::vector<Constant*>, StructType,
935 ConstantStruct, true /*largekey*/> StructConstantsTy;
936 static StructConstantsTy StructConstants;
938 static std::vector<Constant*> getValType(ConstantStruct *CS) {
939 std::vector<Constant*> Elements;
940 Elements.reserve(CS->getNumOperands());
941 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
942 Elements.push_back(cast<Constant>(CS->getOperand(i)));
946 Constant *ConstantStruct::get(const StructType *Ty,
947 const std::vector<Constant*> &V) {
948 // Create a ConstantAggregateZero value if all elements are zeros...
949 for (unsigned i = 0, e = V.size(); i != e; ++i)
950 if (!V[i]->isNullValue())
951 return StructConstants.getOrCreate(Ty, V);
953 return ConstantAggregateZero::get(Ty);
956 Constant *ConstantStruct::get(const std::vector<Constant*> &V) {
957 std::vector<const Type*> StructEls;
958 StructEls.reserve(V.size());
959 for (unsigned i = 0, e = V.size(); i != e; ++i)
960 StructEls.push_back(V[i]->getType());
961 return get(StructType::get(StructEls), V);
964 // destroyConstant - Remove the constant from the constant table...
966 void ConstantStruct::destroyConstant() {
967 StructConstants.remove(this);
968 destroyConstantImpl();
971 //---- ConstantPacked::get() implementation...
975 struct ConvertConstantType<ConstantPacked, PackedType> {
976 static void convert(ConstantPacked *OldC, const PackedType *NewTy) {
977 // Make everyone now use a constant of the new type...
978 std::vector<Constant*> C;
979 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
980 C.push_back(cast<Constant>(OldC->getOperand(i)));
981 Constant *New = ConstantPacked::get(NewTy, C);
982 assert(New != OldC && "Didn't replace constant??");
983 OldC->uncheckedReplaceAllUsesWith(New);
984 OldC->destroyConstant(); // This constant is now dead, destroy it.
989 static std::vector<Constant*> getValType(ConstantPacked *CP) {
990 std::vector<Constant*> Elements;
991 Elements.reserve(CP->getNumOperands());
992 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
993 Elements.push_back(CP->getOperand(i));
997 static ValueMap<std::vector<Constant*>, PackedType,
998 ConstantPacked> PackedConstants;
1000 Constant *ConstantPacked::get(const PackedType *Ty,
1001 const std::vector<Constant*> &V) {
1002 // If this is an all-zero packed, return a ConstantAggregateZero object
1005 if (!C->isNullValue())
1006 return PackedConstants.getOrCreate(Ty, V);
1007 for (unsigned i = 1, e = V.size(); i != e; ++i)
1009 return PackedConstants.getOrCreate(Ty, V);
1011 return ConstantAggregateZero::get(Ty);
1014 Constant *ConstantPacked::get(const std::vector<Constant*> &V) {
1015 assert(!V.empty() && "Cannot infer type if V is empty");
1016 return get(PackedType::get(V.front()->getType(),V.size()), V);
1019 // destroyConstant - Remove the constant from the constant table...
1021 void ConstantPacked::destroyConstant() {
1022 PackedConstants.remove(this);
1023 destroyConstantImpl();
1026 //---- ConstantPointerNull::get() implementation...
1030 // ConstantPointerNull does not take extra "value" argument...
1031 template<class ValType>
1032 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1033 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1034 return new ConstantPointerNull(Ty);
1039 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1040 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1041 // Make everyone now use a constant of the new type...
1042 Constant *New = ConstantPointerNull::get(NewTy);
1043 assert(New != OldC && "Didn't replace constant??");
1044 OldC->uncheckedReplaceAllUsesWith(New);
1045 OldC->destroyConstant(); // This constant is now dead, destroy it.
1050 static ValueMap<char, PointerType, ConstantPointerNull> NullPtrConstants;
1052 static char getValType(ConstantPointerNull *) {
1057 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1058 return NullPtrConstants.getOrCreate(Ty, 0);
1061 // destroyConstant - Remove the constant from the constant table...
1063 void ConstantPointerNull::destroyConstant() {
1064 NullPtrConstants.remove(this);
1065 destroyConstantImpl();
1069 //---- UndefValue::get() implementation...
1073 // UndefValue does not take extra "value" argument...
1074 template<class ValType>
1075 struct ConstantCreator<UndefValue, Type, ValType> {
1076 static UndefValue *create(const Type *Ty, const ValType &V) {
1077 return new UndefValue(Ty);
1082 struct ConvertConstantType<UndefValue, Type> {
1083 static void convert(UndefValue *OldC, const Type *NewTy) {
1084 // Make everyone now use a constant of the new type.
1085 Constant *New = UndefValue::get(NewTy);
1086 assert(New != OldC && "Didn't replace constant??");
1087 OldC->uncheckedReplaceAllUsesWith(New);
1088 OldC->destroyConstant(); // This constant is now dead, destroy it.
1093 static ValueMap<char, Type, UndefValue> UndefValueConstants;
1095 static char getValType(UndefValue *) {
1100 UndefValue *UndefValue::get(const Type *Ty) {
1101 return UndefValueConstants.getOrCreate(Ty, 0);
1104 // destroyConstant - Remove the constant from the constant table.
1106 void UndefValue::destroyConstant() {
1107 UndefValueConstants.remove(this);
1108 destroyConstantImpl();
1114 //---- ConstantExpr::get() implementations...
1116 typedef std::pair<unsigned, std::vector<Constant*> > ExprMapKeyType;
1120 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1121 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V) {
1122 if (V.first == Instruction::Cast)
1123 return new UnaryConstantExpr(Instruction::Cast, V.second[0], Ty);
1124 if ((V.first >= Instruction::BinaryOpsBegin &&
1125 V.first < Instruction::BinaryOpsEnd) ||
1126 V.first == Instruction::Shl || V.first == Instruction::Shr)
1127 return new BinaryConstantExpr(V.first, V.second[0], V.second[1]);
1128 if (V.first == Instruction::Select)
1129 return new SelectConstantExpr(V.second[0], V.second[1], V.second[2]);
1131 assert(V.first == Instruction::GetElementPtr && "Invalid ConstantExpr!");
1133 std::vector<Constant*> IdxList(V.second.begin()+1, V.second.end());
1134 return new GetElementPtrConstantExpr(V.second[0], IdxList, Ty);
1139 struct ConvertConstantType<ConstantExpr, Type> {
1140 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1142 switch (OldC->getOpcode()) {
1143 case Instruction::Cast:
1144 New = ConstantExpr::getCast(OldC->getOperand(0), NewTy);
1146 case Instruction::Select:
1147 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1148 OldC->getOperand(1),
1149 OldC->getOperand(2));
1151 case Instruction::Shl:
1152 case Instruction::Shr:
1153 New = ConstantExpr::getShiftTy(NewTy, OldC->getOpcode(),
1154 OldC->getOperand(0), OldC->getOperand(1));
1157 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1158 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1159 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1160 OldC->getOperand(1));
1162 case Instruction::GetElementPtr:
1163 // Make everyone now use a constant of the new type...
1164 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1165 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0), Idx);
1169 assert(New != OldC && "Didn't replace constant??");
1170 OldC->uncheckedReplaceAllUsesWith(New);
1171 OldC->destroyConstant(); // This constant is now dead, destroy it.
1174 } // end namespace llvm
1177 static ExprMapKeyType getValType(ConstantExpr *CE) {
1178 std::vector<Constant*> Operands;
1179 Operands.reserve(CE->getNumOperands());
1180 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1181 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1182 return ExprMapKeyType(CE->getOpcode(), Operands);
1185 static ValueMap<ExprMapKeyType, Type, ConstantExpr> ExprConstants;
1187 Constant *ConstantExpr::getCast(Constant *C, const Type *Ty) {
1188 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1190 if (Constant *FC = ConstantFoldCastInstruction(C, Ty))
1191 return FC; // Fold a few common cases...
1193 // Look up the constant in the table first to ensure uniqueness
1194 std::vector<Constant*> argVec(1, C);
1195 ExprMapKeyType Key = std::make_pair(Instruction::Cast, argVec);
1196 return ExprConstants.getOrCreate(Ty, Key);
1199 Constant *ConstantExpr::getSignExtend(Constant *C, const Type *Ty) {
1200 assert(C->getType()->isIntegral() && Ty->isIntegral() &&
1201 C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() &&
1202 "This is an illegal sign extension!");
1203 if (C->getType() != Type::BoolTy) {
1204 C = ConstantExpr::getCast(C, C->getType()->getSignedVersion());
1205 return ConstantExpr::getCast(C, Ty);
1207 if (C == ConstantBool::True)
1208 return ConstantIntegral::getAllOnesValue(Ty);
1210 return ConstantIntegral::getNullValue(Ty);
1214 Constant *ConstantExpr::getZeroExtend(Constant *C, const Type *Ty) {
1215 assert(C->getType()->isIntegral() && Ty->isIntegral() &&
1216 C->getType()->getPrimitiveSize() <= Ty->getPrimitiveSize() &&
1217 "This is an illegal zero extension!");
1218 if (C->getType() != Type::BoolTy)
1219 C = ConstantExpr::getCast(C, C->getType()->getUnsignedVersion());
1220 return ConstantExpr::getCast(C, Ty);
1223 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1224 // sizeof is implemented as: (ulong) gep (Ty*)null, 1
1226 getGetElementPtr(getNullValue(PointerType::get(Ty)),
1227 std::vector<Constant*>(1, ConstantInt::get(Type::UIntTy, 1))),
1231 Constant *ConstantExpr::getPtrPtrFromArrayPtr(Constant *C) {
1232 // pointer from array is implemented as: getelementptr arr ptr, 0, 0
1233 static std::vector<Constant*> Indices(2, ConstantUInt::get(Type::UIntTy, 0));
1235 return ConstantExpr::getGetElementPtr(C, Indices);
1238 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1239 Constant *C1, Constant *C2) {
1240 if (Opcode == Instruction::Shl || Opcode == Instruction::Shr)
1241 return getShiftTy(ReqTy, Opcode, C1, C2);
1242 // Check the operands for consistency first
1243 assert((Opcode >= Instruction::BinaryOpsBegin &&
1244 Opcode < Instruction::BinaryOpsEnd) &&
1245 "Invalid opcode in binary constant expression");
1246 assert(C1->getType() == C2->getType() &&
1247 "Operand types in binary constant expression should match");
1249 if (ReqTy == C1->getType() || (Instruction::isRelational(Opcode) &&
1250 ReqTy == Type::BoolTy))
1251 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1252 return FC; // Fold a few common cases...
1254 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1255 ExprMapKeyType Key = std::make_pair(Opcode, argVec);
1256 return ExprConstants.getOrCreate(ReqTy, Key);
1259 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
1262 case Instruction::Add: case Instruction::Sub:
1263 case Instruction::Mul: case Instruction::Div:
1264 case Instruction::Rem:
1265 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1266 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint()) &&
1267 "Tried to create an arithmetic operation on a non-arithmetic type!");
1269 case Instruction::And:
1270 case Instruction::Or:
1271 case Instruction::Xor:
1272 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1273 assert(C1->getType()->isIntegral() &&
1274 "Tried to create a logical operation on a non-integral type!");
1276 case Instruction::SetLT: case Instruction::SetGT: case Instruction::SetLE:
1277 case Instruction::SetGE: case Instruction::SetEQ: case Instruction::SetNE:
1278 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1280 case Instruction::Shl:
1281 case Instruction::Shr:
1282 assert(C2->getType() == Type::UByteTy && "Shift should be by ubyte!");
1283 assert(C1->getType()->isInteger() &&
1284 "Tried to create a shift operation on a non-integer type!");
1291 if (Instruction::isRelational(Opcode))
1292 return getTy(Type::BoolTy, Opcode, C1, C2);
1294 return getTy(C1->getType(), Opcode, C1, C2);
1297 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
1298 Constant *V1, Constant *V2) {
1299 assert(C->getType() == Type::BoolTy && "Select condition must be bool!");
1300 assert(V1->getType() == V2->getType() && "Select value types must match!");
1301 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
1303 if (ReqTy == V1->getType())
1304 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1305 return SC; // Fold common cases
1307 std::vector<Constant*> argVec(3, C);
1310 ExprMapKeyType Key = std::make_pair(Instruction::Select, argVec);
1311 return ExprConstants.getOrCreate(ReqTy, Key);
1314 /// getShiftTy - Return a shift left or shift right constant expr
1315 Constant *ConstantExpr::getShiftTy(const Type *ReqTy, unsigned Opcode,
1316 Constant *C1, Constant *C2) {
1317 // Check the operands for consistency first
1318 assert((Opcode == Instruction::Shl ||
1319 Opcode == Instruction::Shr) &&
1320 "Invalid opcode in binary constant expression");
1321 assert(C1->getType()->isIntegral() && C2->getType() == Type::UByteTy &&
1322 "Invalid operand types for Shift constant expr!");
1324 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1325 return FC; // Fold a few common cases...
1327 // Look up the constant in the table first to ensure uniqueness
1328 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1329 ExprMapKeyType Key = std::make_pair(Opcode, argVec);
1330 return ExprConstants.getOrCreate(ReqTy, Key);
1334 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
1335 const std::vector<Value*> &IdxList) {
1336 assert(GetElementPtrInst::getIndexedType(C->getType(), IdxList, true) &&
1337 "GEP indices invalid!");
1339 if (Constant *FC = ConstantFoldGetElementPtr(C, IdxList))
1340 return FC; // Fold a few common cases...
1342 assert(isa<PointerType>(C->getType()) &&
1343 "Non-pointer type for constant GetElementPtr expression");
1344 // Look up the constant in the table first to ensure uniqueness
1345 std::vector<Constant*> ArgVec;
1346 ArgVec.reserve(IdxList.size()+1);
1347 ArgVec.push_back(C);
1348 for (unsigned i = 0, e = IdxList.size(); i != e; ++i)
1349 ArgVec.push_back(cast<Constant>(IdxList[i]));
1350 const ExprMapKeyType &Key = std::make_pair(Instruction::GetElementPtr,ArgVec);
1351 return ExprConstants.getOrCreate(ReqTy, Key);
1354 Constant *ConstantExpr::getGetElementPtr(Constant *C,
1355 const std::vector<Constant*> &IdxList){
1356 // Get the result type of the getelementptr!
1357 std::vector<Value*> VIdxList(IdxList.begin(), IdxList.end());
1359 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), VIdxList,
1361 assert(Ty && "GEP indices invalid!");
1362 return getGetElementPtrTy(PointerType::get(Ty), C, VIdxList);
1365 Constant *ConstantExpr::getGetElementPtr(Constant *C,
1366 const std::vector<Value*> &IdxList) {
1367 // Get the result type of the getelementptr!
1368 const Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), IdxList,
1370 assert(Ty && "GEP indices invalid!");
1371 return getGetElementPtrTy(PointerType::get(Ty), C, IdxList);
1375 // destroyConstant - Remove the constant from the constant table...
1377 void ConstantExpr::destroyConstant() {
1378 ExprConstants.remove(this);
1379 destroyConstantImpl();
1382 const char *ConstantExpr::getOpcodeName() const {
1383 return Instruction::getOpcodeName(getOpcode());
1386 //===----------------------------------------------------------------------===//
1387 // replaceUsesOfWithOnConstant implementations
1389 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
1391 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1392 Constant *ToC = cast<Constant>(To);
1394 std::pair<ArrayConstantsTy::MapKey, ConstantArray*> Lookup;
1395 Lookup.first.first = getType();
1396 Lookup.second = this;
1397 std::vector<Constant*> &Values = Lookup.first.second;
1398 Values.reserve(getNumOperands()); // Build replacement array.
1400 // Fill values with the modified operands of the constant array. Also,
1401 // compute whether this turns into an all-zeros array.
1402 bool isAllZeros = ToC->isNullValue();
1403 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1404 Constant *Val = getOperand(i);
1405 if (Val == From) Val = ToC;
1406 Values.push_back(Val);
1407 if (isAllZeros) isAllZeros = Val->isNullValue();
1410 Constant *Replacement = 0;
1412 Replacement = ConstantAggregateZero::get(getType());
1414 // Check to see if we have this array type already.
1416 ArrayConstantsTy::MapIterator I =
1417 ArrayConstants.InsertOrGetItem(Lookup, Exists);
1420 Replacement = I->second;
1422 // Okay, the new shape doesn't exist in the system yet. Instead of
1423 // creating a new constant array, inserting it, replaceallusesof'ing the
1424 // old with the new, then deleting the old... just update the current one
1426 ArrayConstants.SimpleRemove(this); // Remove old shape from the map.
1428 // Update the inverse map so that we know that this constant is now
1429 // located at descriptor I.
1430 ArrayConstants.UpdateInverseMap(this, I);
1432 // Update to the new values.
1433 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1434 if (getOperand(i) == From)
1440 // Otherwise, I do need to replace this with an existing value.
1441 assert(Replacement != this && "I didn't contain From!");
1443 // Everyone using this now uses the replacement.
1444 uncheckedReplaceAllUsesWith(Replacement);
1446 // Delete the old constant!
1450 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
1452 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1453 Constant *ToC = cast<Constant>(To);
1455 std::pair<StructConstantsTy::MapKey, ConstantStruct*> Lookup;
1456 Lookup.first.first = getType();
1457 Lookup.second = this;
1458 std::vector<Constant*> &Values = Lookup.first.second;
1459 Values.reserve(getNumOperands()); // Build replacement struct.
1461 // Fill values with the modified operands of the constant struct. Also,
1462 // compute whether this turns into an all-zeros struct.
1463 bool isAllZeros = ToC->isNullValue();
1464 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1465 Constant *Val = getOperand(i);
1466 if (Val == From) Val = ToC;
1467 Values.push_back(Val);
1468 if (isAllZeros) isAllZeros = Val->isNullValue();
1471 Constant *Replacement = 0;
1473 Replacement = ConstantAggregateZero::get(getType());
1475 // Check to see if we have this array type already.
1477 StructConstantsTy::MapIterator I =
1478 StructConstants.InsertOrGetItem(Lookup, Exists);
1481 Replacement = I->second;
1483 // Okay, the new shape doesn't exist in the system yet. Instead of
1484 // creating a new constant struct, inserting it, replaceallusesof'ing the
1485 // old with the new, then deleting the old... just update the current one
1487 StructConstants.SimpleRemove(this); // Remove old shape from the map.
1489 // Update the inverse map so that we know that this constant is now
1490 // located at descriptor I.
1491 StructConstants.UpdateInverseMap(this, I);
1493 // Update to the new values.
1494 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1495 if (getOperand(i) == From)
1501 assert(Replacement != this && "I didn't contain From!");
1503 // Everyone using this now uses the replacement.
1504 uncheckedReplaceAllUsesWith(Replacement);
1506 // Delete the old constant!
1510 void ConstantPacked::replaceUsesOfWithOnConstant(Value *From, Value *To,
1512 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
1514 std::vector<Constant*> Values;
1515 Values.reserve(getNumOperands()); // Build replacement array...
1516 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
1517 Constant *Val = getOperand(i);
1518 if (Val == From) Val = cast<Constant>(To);
1519 Values.push_back(Val);
1522 Constant *Replacement = ConstantPacked::get(getType(), Values);
1523 assert(Replacement != this && "I didn't contain From!");
1525 // Everyone using this now uses the replacement.
1526 uncheckedReplaceAllUsesWith(Replacement);
1528 // Delete the old constant!
1532 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
1534 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
1535 Constant *To = cast<Constant>(ToV);
1537 Constant *Replacement = 0;
1538 if (getOpcode() == Instruction::GetElementPtr) {
1539 std::vector<Constant*> Indices;
1540 Constant *Pointer = getOperand(0);
1541 Indices.reserve(getNumOperands()-1);
1542 if (Pointer == From) Pointer = To;
1544 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
1545 Constant *Val = getOperand(i);
1546 if (Val == From) Val = To;
1547 Indices.push_back(Val);
1549 Replacement = ConstantExpr::getGetElementPtr(Pointer, Indices);
1550 } else if (getOpcode() == Instruction::Cast) {
1551 assert(getOperand(0) == From && "Cast only has one use!");
1552 Replacement = ConstantExpr::getCast(To, getType());
1553 } else if (getOpcode() == Instruction::Select) {
1554 Constant *C1 = getOperand(0);
1555 Constant *C2 = getOperand(1);
1556 Constant *C3 = getOperand(2);
1557 if (C1 == From) C1 = To;
1558 if (C2 == From) C2 = To;
1559 if (C3 == From) C3 = To;
1560 Replacement = ConstantExpr::getSelect(C1, C2, C3);
1561 } else if (getNumOperands() == 2) {
1562 Constant *C1 = getOperand(0);
1563 Constant *C2 = getOperand(1);
1564 if (C1 == From) C1 = To;
1565 if (C2 == From) C2 = To;
1566 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
1568 assert(0 && "Unknown ConstantExpr type!");
1572 assert(Replacement != this && "I didn't contain From!");
1574 // Everyone using this now uses the replacement.
1575 uncheckedReplaceAllUsesWith(Replacement);
1577 // Delete the old constant!
1583 /// clearAllValueMaps - This method frees all internal memory used by the
1584 /// constant subsystem, which can be used in environments where this memory
1585 /// is otherwise reported as a leak.
1586 void Constant::clearAllValueMaps() {
1587 std::vector<Constant *> Constants;
1589 DoubleConstants.clear(Constants);
1590 FloatConstants.clear(Constants);
1591 SIntConstants.clear(Constants);
1592 UIntConstants.clear(Constants);
1593 AggZeroConstants.clear(Constants);
1594 ArrayConstants.clear(Constants);
1595 StructConstants.clear(Constants);
1596 PackedConstants.clear(Constants);
1597 NullPtrConstants.clear(Constants);
1598 UndefValueConstants.clear(Constants);
1599 ExprConstants.clear(Constants);
1601 for (std::vector<Constant *>::iterator I = Constants.begin(),
1602 E = Constants.end(); I != E; ++I)
1603 (*I)->dropAllReferences();
1604 for (std::vector<Constant *>::iterator I = Constants.begin(),
1605 E = Constants.end(); I != E; ++I)
1606 (*I)->destroyConstantImpl();