1 //===-- Constants.cpp - Implement Constant nodes --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the Constant* classes...
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Constants.h"
15 #include "ConstantFold.h"
16 #include "llvm/DerivedTypes.h"
17 #include "llvm/GlobalValue.h"
18 #include "llvm/Instructions.h"
19 #include "llvm/MDNode.h"
20 #include "llvm/Module.h"
21 #include "llvm/ADT/FoldingSet.h"
22 #include "llvm/ADT/StringExtras.h"
23 #include "llvm/ADT/StringMap.h"
24 #include "llvm/Support/Compiler.h"
25 #include "llvm/Support/Debug.h"
26 #include "llvm/Support/ErrorHandling.h"
27 #include "llvm/Support/ManagedStatic.h"
28 #include "llvm/Support/MathExtras.h"
29 #include "llvm/System/Mutex.h"
30 #include "llvm/System/RWMutex.h"
31 #include "llvm/System/Threading.h"
32 #include "llvm/ADT/DenseMap.h"
33 #include "llvm/ADT/SmallVector.h"
38 //===----------------------------------------------------------------------===//
40 //===----------------------------------------------------------------------===//
42 // Becomes a no-op when multithreading is disabled.
43 ManagedStatic<sys::SmartRWMutex<true> > ConstantsLock;
45 void Constant::destroyConstantImpl() {
46 // When a Constant is destroyed, there may be lingering
47 // references to the constant by other constants in the constant pool. These
48 // constants are implicitly dependent on the module that is being deleted,
49 // but they don't know that. Because we only find out when the CPV is
50 // deleted, we must now notify all of our users (that should only be
51 // Constants) that they are, in fact, invalid now and should be deleted.
53 while (!use_empty()) {
54 Value *V = use_back();
55 #ifndef NDEBUG // Only in -g mode...
56 if (!isa<Constant>(V))
57 DOUT << "While deleting: " << *this
58 << "\n\nUse still stuck around after Def is destroyed: "
61 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
62 Constant *CV = cast<Constant>(V);
63 CV->destroyConstant();
65 // The constant should remove itself from our use list...
66 assert((use_empty() || use_back() != V) && "Constant not removed!");
69 // Value has no outstanding references it is safe to delete it now...
73 /// canTrap - Return true if evaluation of this constant could trap. This is
74 /// true for things like constant expressions that could divide by zero.
75 bool Constant::canTrap() const {
76 assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
77 // The only thing that could possibly trap are constant exprs.
78 const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
79 if (!CE) return false;
81 // ConstantExpr traps if any operands can trap.
82 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
83 if (getOperand(i)->canTrap())
86 // Otherwise, only specific operations can trap.
87 switch (CE->getOpcode()) {
90 case Instruction::UDiv:
91 case Instruction::SDiv:
92 case Instruction::FDiv:
93 case Instruction::URem:
94 case Instruction::SRem:
95 case Instruction::FRem:
96 // Div and rem can trap if the RHS is not known to be non-zero.
97 if (!isa<ConstantInt>(getOperand(1)) || getOperand(1)->isNullValue())
103 /// ContainsRelocations - Return true if the constant value contains relocations
104 /// which cannot be resolved at compile time. Kind argument is used to filter
105 /// only 'interesting' sorts of relocations.
106 bool Constant::ContainsRelocations(unsigned Kind) const {
107 if (const GlobalValue* GV = dyn_cast<GlobalValue>(this)) {
108 bool isLocal = GV->hasLocalLinkage();
109 if ((Kind & Reloc::Local) && isLocal) {
110 // Global has local linkage and 'local' kind of relocations are
115 if ((Kind & Reloc::Global) && !isLocal) {
116 // Global has non-local linkage and 'global' kind of relocations are
124 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
125 if (getOperand(i)->ContainsRelocations(Kind))
131 /// getVectorElements - This method, which is only valid on constant of vector
132 /// type, returns the elements of the vector in the specified smallvector.
133 /// This handles breaking down a vector undef into undef elements, etc. For
134 /// constant exprs and other cases we can't handle, we return an empty vector.
135 void Constant::getVectorElements(LLVMContext &Context,
136 SmallVectorImpl<Constant*> &Elts) const {
137 assert(isa<VectorType>(getType()) && "Not a vector constant!");
139 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) {
140 for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i)
141 Elts.push_back(CV->getOperand(i));
145 const VectorType *VT = cast<VectorType>(getType());
146 if (isa<ConstantAggregateZero>(this)) {
147 Elts.assign(VT->getNumElements(),
148 Context.getNullValue(VT->getElementType()));
152 if (isa<UndefValue>(this)) {
153 Elts.assign(VT->getNumElements(), Context.getUndef(VT->getElementType()));
157 // Unknown type, must be constant expr etc.
162 //===----------------------------------------------------------------------===//
164 //===----------------------------------------------------------------------===//
166 ConstantInt::ConstantInt(const IntegerType *Ty, const APInt& V)
167 : Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
168 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
171 ConstantInt *ConstantInt::TheTrueVal = 0;
172 ConstantInt *ConstantInt::TheFalseVal = 0;
175 void CleanupTrueFalse(void *) {
176 ConstantInt::ResetTrueFalse();
180 static ManagedCleanup<llvm::CleanupTrueFalse> TrueFalseCleanup;
182 ConstantInt *ConstantInt::CreateTrueFalseVals(bool WhichOne) {
183 assert(TheTrueVal == 0 && TheFalseVal == 0);
184 TheTrueVal = getGlobalContext().getConstantInt(Type::Int1Ty, 1);
185 TheFalseVal = getGlobalContext().getConstantInt(Type::Int1Ty, 0);
187 // Ensure that llvm_shutdown nulls out TheTrueVal/TheFalseVal.
188 TrueFalseCleanup.Register();
190 return WhichOne ? TheTrueVal : TheFalseVal;
195 struct DenseMapAPIntKeyInfo {
199 KeyTy(const APInt& V, const Type* Ty) : val(V), type(Ty) {}
200 KeyTy(const KeyTy& that) : val(that.val), type(that.type) {}
201 bool operator==(const KeyTy& that) const {
202 return type == that.type && this->val == that.val;
204 bool operator!=(const KeyTy& that) const {
205 return !this->operator==(that);
208 static inline KeyTy getEmptyKey() { return KeyTy(APInt(1,0), 0); }
209 static inline KeyTy getTombstoneKey() { return KeyTy(APInt(1,1), 0); }
210 static unsigned getHashValue(const KeyTy &Key) {
211 return DenseMapInfo<void*>::getHashValue(Key.type) ^
212 Key.val.getHashValue();
214 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
217 static bool isPod() { return false; }
222 typedef DenseMap<DenseMapAPIntKeyInfo::KeyTy, ConstantInt*,
223 DenseMapAPIntKeyInfo> IntMapTy;
224 static ManagedStatic<IntMapTy> IntConstants;
226 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
227 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
228 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
229 // compare APInt's of different widths, which would violate an APInt class
230 // invariant which generates an assertion.
231 ConstantInt *ConstantInt::get(const APInt& V) {
232 // Get the corresponding integer type for the bit width of the value.
233 const IntegerType *ITy = IntegerType::get(V.getBitWidth());
234 // get an existing value or the insertion position
235 DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
237 ConstantsLock->reader_acquire();
238 ConstantInt *&Slot = (*IntConstants)[Key];
239 ConstantsLock->reader_release();
242 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
243 ConstantInt *&NewSlot = (*IntConstants)[Key];
245 NewSlot = new ConstantInt(ITy, V);
254 //===----------------------------------------------------------------------===//
256 //===----------------------------------------------------------------------===//
258 static const fltSemantics *TypeToFloatSemantics(const Type *Ty) {
259 if (Ty == Type::FloatTy)
260 return &APFloat::IEEEsingle;
261 if (Ty == Type::DoubleTy)
262 return &APFloat::IEEEdouble;
263 if (Ty == Type::X86_FP80Ty)
264 return &APFloat::x87DoubleExtended;
265 else if (Ty == Type::FP128Ty)
266 return &APFloat::IEEEquad;
268 assert(Ty == Type::PPC_FP128Ty && "Unknown FP format");
269 return &APFloat::PPCDoubleDouble;
272 ConstantFP::ConstantFP(const Type *Ty, const APFloat& V)
273 : Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
274 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
278 bool ConstantFP::isNullValue() const {
279 return Val.isZero() && !Val.isNegative();
282 bool ConstantFP::isExactlyValue(const APFloat& V) const {
283 return Val.bitwiseIsEqual(V);
287 struct DenseMapAPFloatKeyInfo {
290 KeyTy(const APFloat& V) : val(V){}
291 KeyTy(const KeyTy& that) : val(that.val) {}
292 bool operator==(const KeyTy& that) const {
293 return this->val.bitwiseIsEqual(that.val);
295 bool operator!=(const KeyTy& that) const {
296 return !this->operator==(that);
299 static inline KeyTy getEmptyKey() {
300 return KeyTy(APFloat(APFloat::Bogus,1));
302 static inline KeyTy getTombstoneKey() {
303 return KeyTy(APFloat(APFloat::Bogus,2));
305 static unsigned getHashValue(const KeyTy &Key) {
306 return Key.val.getHashValue();
308 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
311 static bool isPod() { return false; }
315 //---- ConstantFP::get() implementation...
317 typedef DenseMap<DenseMapAPFloatKeyInfo::KeyTy, ConstantFP*,
318 DenseMapAPFloatKeyInfo> FPMapTy;
320 static ManagedStatic<FPMapTy> FPConstants;
322 ConstantFP *ConstantFP::get(const APFloat &V) {
323 DenseMapAPFloatKeyInfo::KeyTy Key(V);
325 ConstantsLock->reader_acquire();
326 ConstantFP *&Slot = (*FPConstants)[Key];
327 ConstantsLock->reader_release();
330 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
331 ConstantFP *&NewSlot = (*FPConstants)[Key];
334 if (&V.getSemantics() == &APFloat::IEEEsingle)
336 else if (&V.getSemantics() == &APFloat::IEEEdouble)
338 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
339 Ty = Type::X86_FP80Ty;
340 else if (&V.getSemantics() == &APFloat::IEEEquad)
343 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble &&
344 "Unknown FP format");
345 Ty = Type::PPC_FP128Ty;
347 NewSlot = new ConstantFP(Ty, V);
356 //===----------------------------------------------------------------------===//
357 // ConstantXXX Classes
358 //===----------------------------------------------------------------------===//
361 ConstantArray::ConstantArray(const ArrayType *T,
362 const std::vector<Constant*> &V)
363 : Constant(T, ConstantArrayVal,
364 OperandTraits<ConstantArray>::op_end(this) - V.size(),
366 assert(V.size() == T->getNumElements() &&
367 "Invalid initializer vector for constant array");
368 Use *OL = OperandList;
369 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
372 assert((C->getType() == T->getElementType() ||
374 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
375 "Initializer for array element doesn't match array element type!");
381 ConstantStruct::ConstantStruct(const StructType *T,
382 const std::vector<Constant*> &V)
383 : Constant(T, ConstantStructVal,
384 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
386 assert(V.size() == T->getNumElements() &&
387 "Invalid initializer vector for constant structure");
388 Use *OL = OperandList;
389 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
392 assert((C->getType() == T->getElementType(I-V.begin()) ||
393 ((T->getElementType(I-V.begin())->isAbstract() ||
394 C->getType()->isAbstract()) &&
395 T->getElementType(I-V.begin())->getTypeID() ==
396 C->getType()->getTypeID())) &&
397 "Initializer for struct element doesn't match struct element type!");
403 ConstantVector::ConstantVector(const VectorType *T,
404 const std::vector<Constant*> &V)
405 : Constant(T, ConstantVectorVal,
406 OperandTraits<ConstantVector>::op_end(this) - V.size(),
408 Use *OL = OperandList;
409 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
412 assert((C->getType() == T->getElementType() ||
414 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
415 "Initializer for vector element doesn't match vector element type!");
422 // We declare several classes private to this file, so use an anonymous
426 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
427 /// behind the scenes to implement unary constant exprs.
428 class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
429 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
431 // allocate space for exactly one operand
432 void *operator new(size_t s) {
433 return User::operator new(s, 1);
435 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
436 : ConstantExpr(Ty, Opcode, &Op<0>(), 1) {
439 /// Transparently provide more efficient getOperand methods.
440 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
443 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
444 /// behind the scenes to implement binary constant exprs.
445 class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
446 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
448 // allocate space for exactly two operands
449 void *operator new(size_t s) {
450 return User::operator new(s, 2);
452 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
453 : ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) {
457 /// Transparently provide more efficient getOperand methods.
458 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
461 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
462 /// behind the scenes to implement select constant exprs.
463 class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
464 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
466 // allocate space for exactly three operands
467 void *operator new(size_t s) {
468 return User::operator new(s, 3);
470 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
471 : ConstantExpr(C2->getType(), Instruction::Select, &Op<0>(), 3) {
476 /// Transparently provide more efficient getOperand methods.
477 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
480 /// ExtractElementConstantExpr - This class is private to
481 /// Constants.cpp, and is used behind the scenes to implement
482 /// extractelement constant exprs.
483 class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
484 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
486 // allocate space for exactly two operands
487 void *operator new(size_t s) {
488 return User::operator new(s, 2);
490 ExtractElementConstantExpr(Constant *C1, Constant *C2)
491 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(),
492 Instruction::ExtractElement, &Op<0>(), 2) {
496 /// Transparently provide more efficient getOperand methods.
497 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
500 /// InsertElementConstantExpr - This class is private to
501 /// Constants.cpp, and is used behind the scenes to implement
502 /// insertelement constant exprs.
503 class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
504 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
506 // allocate space for exactly three operands
507 void *operator new(size_t s) {
508 return User::operator new(s, 3);
510 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
511 : ConstantExpr(C1->getType(), Instruction::InsertElement,
517 /// Transparently provide more efficient getOperand methods.
518 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
521 /// ShuffleVectorConstantExpr - This class is private to
522 /// Constants.cpp, and is used behind the scenes to implement
523 /// shufflevector constant exprs.
524 class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
525 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
527 // allocate space for exactly three operands
528 void *operator new(size_t s) {
529 return User::operator new(s, 3);
531 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
532 : ConstantExpr(VectorType::get(
533 cast<VectorType>(C1->getType())->getElementType(),
534 cast<VectorType>(C3->getType())->getNumElements()),
535 Instruction::ShuffleVector,
541 /// Transparently provide more efficient getOperand methods.
542 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
545 /// ExtractValueConstantExpr - This class is private to
546 /// Constants.cpp, and is used behind the scenes to implement
547 /// extractvalue constant exprs.
548 class VISIBILITY_HIDDEN ExtractValueConstantExpr : public ConstantExpr {
549 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
551 // allocate space for exactly one operand
552 void *operator new(size_t s) {
553 return User::operator new(s, 1);
555 ExtractValueConstantExpr(Constant *Agg,
556 const SmallVector<unsigned, 4> &IdxList,
558 : ConstantExpr(DestTy, Instruction::ExtractValue, &Op<0>(), 1),
563 /// Indices - These identify which value to extract.
564 const SmallVector<unsigned, 4> Indices;
566 /// Transparently provide more efficient getOperand methods.
567 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
570 /// InsertValueConstantExpr - This class is private to
571 /// Constants.cpp, and is used behind the scenes to implement
572 /// insertvalue constant exprs.
573 class VISIBILITY_HIDDEN InsertValueConstantExpr : public ConstantExpr {
574 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
576 // allocate space for exactly one operand
577 void *operator new(size_t s) {
578 return User::operator new(s, 2);
580 InsertValueConstantExpr(Constant *Agg, Constant *Val,
581 const SmallVector<unsigned, 4> &IdxList,
583 : ConstantExpr(DestTy, Instruction::InsertValue, &Op<0>(), 2),
589 /// Indices - These identify the position for the insertion.
590 const SmallVector<unsigned, 4> Indices;
592 /// Transparently provide more efficient getOperand methods.
593 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
597 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
598 /// used behind the scenes to implement getelementpr constant exprs.
599 class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
600 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
603 static GetElementPtrConstantExpr *Create(Constant *C,
604 const std::vector<Constant*>&IdxList,
605 const Type *DestTy) {
606 return new(IdxList.size() + 1)
607 GetElementPtrConstantExpr(C, IdxList, DestTy);
609 /// Transparently provide more efficient getOperand methods.
610 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
613 // CompareConstantExpr - This class is private to Constants.cpp, and is used
614 // behind the scenes to implement ICmp and FCmp constant expressions. This is
615 // needed in order to store the predicate value for these instructions.
616 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
617 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
618 // allocate space for exactly two operands
619 void *operator new(size_t s) {
620 return User::operator new(s, 2);
622 unsigned short predicate;
623 CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
624 unsigned short pred, Constant* LHS, Constant* RHS)
625 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
629 /// Transparently provide more efficient getOperand methods.
630 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
633 } // end anonymous namespace
636 struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
638 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
641 struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
643 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
646 struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
648 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
651 struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
653 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
656 struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
658 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
661 struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
663 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
666 struct OperandTraits<ExtractValueConstantExpr> : FixedNumOperandTraits<1> {
668 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractValueConstantExpr, Value)
671 struct OperandTraits<InsertValueConstantExpr> : FixedNumOperandTraits<2> {
673 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueConstantExpr, Value)
676 struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
679 GetElementPtrConstantExpr::GetElementPtrConstantExpr
681 const std::vector<Constant*> &IdxList,
683 : ConstantExpr(DestTy, Instruction::GetElementPtr,
684 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
685 - (IdxList.size()+1),
688 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
689 OperandList[i+1] = IdxList[i];
692 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
696 struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
698 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
701 } // End llvm namespace
704 // Utility function for determining if a ConstantExpr is a CastOp or not. This
705 // can't be inline because we don't want to #include Instruction.h into
707 bool ConstantExpr::isCast() const {
708 return Instruction::isCast(getOpcode());
711 bool ConstantExpr::isCompare() const {
712 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
715 bool ConstantExpr::hasIndices() const {
716 return getOpcode() == Instruction::ExtractValue ||
717 getOpcode() == Instruction::InsertValue;
720 const SmallVector<unsigned, 4> &ConstantExpr::getIndices() const {
721 if (const ExtractValueConstantExpr *EVCE =
722 dyn_cast<ExtractValueConstantExpr>(this))
723 return EVCE->Indices;
725 return cast<InsertValueConstantExpr>(this)->Indices;
728 unsigned ConstantExpr::getPredicate() const {
729 assert(getOpcode() == Instruction::FCmp ||
730 getOpcode() == Instruction::ICmp);
731 return ((const CompareConstantExpr*)this)->predicate;
734 /// getWithOperandReplaced - Return a constant expression identical to this
735 /// one, but with the specified operand set to the specified value.
737 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
738 assert(OpNo < getNumOperands() && "Operand num is out of range!");
739 assert(Op->getType() == getOperand(OpNo)->getType() &&
740 "Replacing operand with value of different type!");
741 if (getOperand(OpNo) == Op)
742 return const_cast<ConstantExpr*>(this);
744 Constant *Op0, *Op1, *Op2;
745 switch (getOpcode()) {
746 case Instruction::Trunc:
747 case Instruction::ZExt:
748 case Instruction::SExt:
749 case Instruction::FPTrunc:
750 case Instruction::FPExt:
751 case Instruction::UIToFP:
752 case Instruction::SIToFP:
753 case Instruction::FPToUI:
754 case Instruction::FPToSI:
755 case Instruction::PtrToInt:
756 case Instruction::IntToPtr:
757 case Instruction::BitCast:
758 return ConstantExpr::getCast(getOpcode(), Op, getType());
759 case Instruction::Select:
760 Op0 = (OpNo == 0) ? Op : getOperand(0);
761 Op1 = (OpNo == 1) ? Op : getOperand(1);
762 Op2 = (OpNo == 2) ? Op : getOperand(2);
763 return ConstantExpr::getSelect(Op0, Op1, Op2);
764 case Instruction::InsertElement:
765 Op0 = (OpNo == 0) ? Op : getOperand(0);
766 Op1 = (OpNo == 1) ? Op : getOperand(1);
767 Op2 = (OpNo == 2) ? Op : getOperand(2);
768 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
769 case Instruction::ExtractElement:
770 Op0 = (OpNo == 0) ? Op : getOperand(0);
771 Op1 = (OpNo == 1) ? Op : getOperand(1);
772 return ConstantExpr::getExtractElement(Op0, Op1);
773 case Instruction::ShuffleVector:
774 Op0 = (OpNo == 0) ? Op : getOperand(0);
775 Op1 = (OpNo == 1) ? Op : getOperand(1);
776 Op2 = (OpNo == 2) ? Op : getOperand(2);
777 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
778 case Instruction::GetElementPtr: {
779 SmallVector<Constant*, 8> Ops;
780 Ops.resize(getNumOperands()-1);
781 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
782 Ops[i-1] = getOperand(i);
784 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
786 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
789 assert(getNumOperands() == 2 && "Must be binary operator?");
790 Op0 = (OpNo == 0) ? Op : getOperand(0);
791 Op1 = (OpNo == 1) ? Op : getOperand(1);
792 return ConstantExpr::get(getOpcode(), Op0, Op1);
796 /// getWithOperands - This returns the current constant expression with the
797 /// operands replaced with the specified values. The specified operands must
798 /// match count and type with the existing ones.
799 Constant *ConstantExpr::
800 getWithOperands(Constant* const *Ops, unsigned NumOps) const {
801 assert(NumOps == getNumOperands() && "Operand count mismatch!");
802 bool AnyChange = false;
803 for (unsigned i = 0; i != NumOps; ++i) {
804 assert(Ops[i]->getType() == getOperand(i)->getType() &&
805 "Operand type mismatch!");
806 AnyChange |= Ops[i] != getOperand(i);
808 if (!AnyChange) // No operands changed, return self.
809 return const_cast<ConstantExpr*>(this);
811 switch (getOpcode()) {
812 case Instruction::Trunc:
813 case Instruction::ZExt:
814 case Instruction::SExt:
815 case Instruction::FPTrunc:
816 case Instruction::FPExt:
817 case Instruction::UIToFP:
818 case Instruction::SIToFP:
819 case Instruction::FPToUI:
820 case Instruction::FPToSI:
821 case Instruction::PtrToInt:
822 case Instruction::IntToPtr:
823 case Instruction::BitCast:
824 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
825 case Instruction::Select:
826 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
827 case Instruction::InsertElement:
828 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
829 case Instruction::ExtractElement:
830 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
831 case Instruction::ShuffleVector:
832 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
833 case Instruction::GetElementPtr:
834 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], NumOps-1);
835 case Instruction::ICmp:
836 case Instruction::FCmp:
837 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
839 assert(getNumOperands() == 2 && "Must be binary operator?");
840 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
845 //===----------------------------------------------------------------------===//
846 // isValueValidForType implementations
848 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
849 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
850 if (Ty == Type::Int1Ty)
851 return Val == 0 || Val == 1;
853 return true; // always true, has to fit in largest type
854 uint64_t Max = (1ll << NumBits) - 1;
858 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
859 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
860 if (Ty == Type::Int1Ty)
861 return Val == 0 || Val == 1 || Val == -1;
863 return true; // always true, has to fit in largest type
864 int64_t Min = -(1ll << (NumBits-1));
865 int64_t Max = (1ll << (NumBits-1)) - 1;
866 return (Val >= Min && Val <= Max);
869 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
870 // convert modifies in place, so make a copy.
871 APFloat Val2 = APFloat(Val);
873 switch (Ty->getTypeID()) {
875 return false; // These can't be represented as floating point!
877 // FIXME rounding mode needs to be more flexible
878 case Type::FloatTyID: {
879 if (&Val2.getSemantics() == &APFloat::IEEEsingle)
881 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
884 case Type::DoubleTyID: {
885 if (&Val2.getSemantics() == &APFloat::IEEEsingle ||
886 &Val2.getSemantics() == &APFloat::IEEEdouble)
888 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
891 case Type::X86_FP80TyID:
892 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
893 &Val2.getSemantics() == &APFloat::IEEEdouble ||
894 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
895 case Type::FP128TyID:
896 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
897 &Val2.getSemantics() == &APFloat::IEEEdouble ||
898 &Val2.getSemantics() == &APFloat::IEEEquad;
899 case Type::PPC_FP128TyID:
900 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
901 &Val2.getSemantics() == &APFloat::IEEEdouble ||
902 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
906 //===----------------------------------------------------------------------===//
907 // Factory Function Implementation
910 // The number of operands for each ConstantCreator::create method is
911 // determined by the ConstantTraits template.
912 // ConstantCreator - A class that is used to create constants by
913 // ValueMap*. This class should be partially specialized if there is
914 // something strange that needs to be done to interface to the ctor for the
918 template<class ValType>
919 struct ConstantTraits;
921 template<typename T, typename Alloc>
922 struct VISIBILITY_HIDDEN ConstantTraits< std::vector<T, Alloc> > {
923 static unsigned uses(const std::vector<T, Alloc>& v) {
928 template<class ConstantClass, class TypeClass, class ValType>
929 struct VISIBILITY_HIDDEN ConstantCreator {
930 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
931 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
935 template<class ConstantClass, class TypeClass>
936 struct VISIBILITY_HIDDEN ConvertConstantType {
937 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
938 llvm_unreachable("This type cannot be converted!");
942 template<class ValType, class TypeClass, class ConstantClass,
943 bool HasLargeKey = false /*true for arrays and structs*/ >
944 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
946 typedef std::pair<const Type*, ValType> MapKey;
947 typedef std::map<MapKey, Constant *> MapTy;
948 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
949 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
951 /// Map - This is the main map from the element descriptor to the Constants.
952 /// This is the primary way we avoid creating two of the same shape
956 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
957 /// from the constants to their element in Map. This is important for
958 /// removal of constants from the array, which would otherwise have to scan
959 /// through the map with very large keys.
960 InverseMapTy InverseMap;
962 /// AbstractTypeMap - Map for abstract type constants.
964 AbstractTypeMapTy AbstractTypeMap;
966 /// ValueMapLock - Mutex for this map.
967 sys::SmartMutex<true> ValueMapLock;
970 // NOTE: This function is not locked. It is the caller's responsibility
971 // to enforce proper synchronization.
972 typename MapTy::iterator map_end() { return Map.end(); }
974 /// InsertOrGetItem - Return an iterator for the specified element.
975 /// If the element exists in the map, the returned iterator points to the
976 /// entry and Exists=true. If not, the iterator points to the newly
977 /// inserted entry and returns Exists=false. Newly inserted entries have
978 /// I->second == 0, and should be filled in.
979 /// NOTE: This function is not locked. It is the caller's responsibility
980 // to enforce proper synchronization.
981 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
984 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
990 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
992 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
993 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
994 IMI->second->second == CP &&
995 "InverseMap corrupt!");
999 typename MapTy::iterator I =
1000 Map.find(MapKey(static_cast<const TypeClass*>(CP->getRawType()),
1002 if (I == Map.end() || I->second != CP) {
1003 // FIXME: This should not use a linear scan. If this gets to be a
1004 // performance problem, someone should look at this.
1005 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
1011 ConstantClass* Create(const TypeClass *Ty, const ValType &V,
1012 typename MapTy::iterator I) {
1013 ConstantClass* Result =
1014 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
1016 assert(Result->getType() == Ty && "Type specified is not correct!");
1017 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
1019 if (HasLargeKey) // Remember the reverse mapping if needed.
1020 InverseMap.insert(std::make_pair(Result, I));
1022 // If the type of the constant is abstract, make sure that an entry
1023 // exists for it in the AbstractTypeMap.
1024 if (Ty->isAbstract()) {
1025 typename AbstractTypeMapTy::iterator TI =
1026 AbstractTypeMap.find(Ty);
1028 if (TI == AbstractTypeMap.end()) {
1029 // Add ourselves to the ATU list of the type.
1030 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
1032 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
1040 /// getOrCreate - Return the specified constant from the map, creating it if
1042 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
1043 sys::SmartScopedLock<true> Lock(ValueMapLock);
1044 MapKey Lookup(Ty, V);
1045 ConstantClass* Result = 0;
1047 typename MapTy::iterator I = Map.find(Lookup);
1048 // Is it in the map?
1050 Result = static_cast<ConstantClass *>(I->second);
1053 // If no preexisting value, create one now...
1054 Result = Create(Ty, V, I);
1060 void remove(ConstantClass *CP) {
1061 sys::SmartScopedLock<true> Lock(ValueMapLock);
1062 typename MapTy::iterator I = FindExistingElement(CP);
1063 assert(I != Map.end() && "Constant not found in constant table!");
1064 assert(I->second == CP && "Didn't find correct element?");
1066 if (HasLargeKey) // Remember the reverse mapping if needed.
1067 InverseMap.erase(CP);
1069 // Now that we found the entry, make sure this isn't the entry that
1070 // the AbstractTypeMap points to.
1071 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
1072 if (Ty->isAbstract()) {
1073 assert(AbstractTypeMap.count(Ty) &&
1074 "Abstract type not in AbstractTypeMap?");
1075 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
1076 if (ATMEntryIt == I) {
1077 // Yes, we are removing the representative entry for this type.
1078 // See if there are any other entries of the same type.
1079 typename MapTy::iterator TmpIt = ATMEntryIt;
1081 // First check the entry before this one...
1082 if (TmpIt != Map.begin()) {
1084 if (TmpIt->first.first != Ty) // Not the same type, move back...
1088 // If we didn't find the same type, try to move forward...
1089 if (TmpIt == ATMEntryIt) {
1091 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
1092 --TmpIt; // No entry afterwards with the same type
1095 // If there is another entry in the map of the same abstract type,
1096 // update the AbstractTypeMap entry now.
1097 if (TmpIt != ATMEntryIt) {
1100 // Otherwise, we are removing the last instance of this type
1101 // from the table. Remove from the ATM, and from user list.
1102 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
1103 AbstractTypeMap.erase(Ty);
1112 /// MoveConstantToNewSlot - If we are about to change C to be the element
1113 /// specified by I, update our internal data structures to reflect this
1115 /// NOTE: This function is not locked. It is the responsibility of the
1116 /// caller to enforce proper synchronization if using this method.
1117 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
1118 // First, remove the old location of the specified constant in the map.
1119 typename MapTy::iterator OldI = FindExistingElement(C);
1120 assert(OldI != Map.end() && "Constant not found in constant table!");
1121 assert(OldI->second == C && "Didn't find correct element?");
1123 // If this constant is the representative element for its abstract type,
1124 // update the AbstractTypeMap so that the representative element is I.
1125 if (C->getType()->isAbstract()) {
1126 typename AbstractTypeMapTy::iterator ATI =
1127 AbstractTypeMap.find(C->getType());
1128 assert(ATI != AbstractTypeMap.end() &&
1129 "Abstract type not in AbstractTypeMap?");
1130 if (ATI->second == OldI)
1134 // Remove the old entry from the map.
1137 // Update the inverse map so that we know that this constant is now
1138 // located at descriptor I.
1140 assert(I->second == C && "Bad inversemap entry!");
1145 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
1146 sys::SmartScopedLock<true> Lock(ValueMapLock);
1147 typename AbstractTypeMapTy::iterator I =
1148 AbstractTypeMap.find(cast<Type>(OldTy));
1150 assert(I != AbstractTypeMap.end() &&
1151 "Abstract type not in AbstractTypeMap?");
1153 // Convert a constant at a time until the last one is gone. The last one
1154 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
1155 // eliminated eventually.
1157 ConvertConstantType<ConstantClass,
1158 TypeClass>::convert(
1159 static_cast<ConstantClass *>(I->second->second),
1160 cast<TypeClass>(NewTy));
1162 I = AbstractTypeMap.find(cast<Type>(OldTy));
1163 } while (I != AbstractTypeMap.end());
1166 // If the type became concrete without being refined to any other existing
1167 // type, we just remove ourselves from the ATU list.
1168 void typeBecameConcrete(const DerivedType *AbsTy) {
1169 AbsTy->removeAbstractTypeUser(this);
1173 DOUT << "Constant.cpp: ValueMap\n";
1180 //---- ConstantAggregateZero::get() implementation...
1183 // ConstantAggregateZero does not take extra "value" argument...
1184 template<class ValType>
1185 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1186 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1187 return new ConstantAggregateZero(Ty);
1192 struct ConvertConstantType<ConstantAggregateZero, Type> {
1193 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1194 // Make everyone now use a constant of the new type...
1195 Constant *New = ConstantAggregateZero::get(NewTy);
1196 assert(New != OldC && "Didn't replace constant??");
1197 OldC->uncheckedReplaceAllUsesWith(New);
1198 OldC->destroyConstant(); // This constant is now dead, destroy it.
1203 static ManagedStatic<ValueMap<char, Type,
1204 ConstantAggregateZero> > AggZeroConstants;
1206 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1208 ConstantAggregateZero *ConstantAggregateZero::get(const Type *Ty) {
1209 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1210 "Cannot create an aggregate zero of non-aggregate type!");
1212 // Implicitly locked.
1213 return AggZeroConstants->getOrCreate(Ty, 0);
1216 /// destroyConstant - Remove the constant from the constant table...
1218 void ConstantAggregateZero::destroyConstant() {
1219 // Implicitly locked.
1220 AggZeroConstants->remove(this);
1221 destroyConstantImpl();
1224 //---- ConstantArray::get() implementation...
1228 struct ConvertConstantType<ConstantArray, ArrayType> {
1229 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1230 // Make everyone now use a constant of the new type...
1231 std::vector<Constant*> C;
1232 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1233 C.push_back(cast<Constant>(OldC->getOperand(i)));
1234 Constant *New = ConstantArray::get(NewTy, C);
1235 assert(New != OldC && "Didn't replace constant??");
1236 OldC->uncheckedReplaceAllUsesWith(New);
1237 OldC->destroyConstant(); // This constant is now dead, destroy it.
1242 static std::vector<Constant*> getValType(ConstantArray *CA) {
1243 std::vector<Constant*> Elements;
1244 Elements.reserve(CA->getNumOperands());
1245 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1246 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1250 typedef ValueMap<std::vector<Constant*>, ArrayType,
1251 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1252 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1254 Constant *ConstantArray::get(const ArrayType *Ty,
1255 const std::vector<Constant*> &V) {
1256 // If this is an all-zero array, return a ConstantAggregateZero object
1259 if (!C->isNullValue()) {
1260 // Implicitly locked.
1261 return ArrayConstants->getOrCreate(Ty, V);
1263 for (unsigned i = 1, e = V.size(); i != e; ++i)
1265 // Implicitly locked.
1266 return ArrayConstants->getOrCreate(Ty, V);
1270 return ConstantAggregateZero::get(Ty);
1273 /// destroyConstant - Remove the constant from the constant table...
1275 void ConstantArray::destroyConstant() {
1276 // Implicitly locked.
1277 ArrayConstants->remove(this);
1278 destroyConstantImpl();
1281 /// isString - This method returns true if the array is an array of i8, and
1282 /// if the elements of the array are all ConstantInt's.
1283 bool ConstantArray::isString() const {
1284 // Check the element type for i8...
1285 if (getType()->getElementType() != Type::Int8Ty)
1287 // Check the elements to make sure they are all integers, not constant
1289 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1290 if (!isa<ConstantInt>(getOperand(i)))
1295 /// isCString - This method returns true if the array is a string (see
1296 /// isString) and it ends in a null byte \\0 and does not contains any other
1297 /// null bytes except its terminator.
1298 bool ConstantArray::isCString() const {
1299 // Check the element type for i8...
1300 if (getType()->getElementType() != Type::Int8Ty)
1303 // Last element must be a null.
1304 if (!getOperand(getNumOperands()-1)->isNullValue())
1306 // Other elements must be non-null integers.
1307 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1308 if (!isa<ConstantInt>(getOperand(i)))
1310 if (getOperand(i)->isNullValue())
1317 /// getAsString - If the sub-element type of this array is i8
1318 /// then this method converts the array to an std::string and returns it.
1319 /// Otherwise, it asserts out.
1321 std::string ConstantArray::getAsString() const {
1322 assert(isString() && "Not a string!");
1324 Result.reserve(getNumOperands());
1325 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1326 Result.push_back((char)cast<ConstantInt>(getOperand(i))->getZExtValue());
1331 //---- ConstantStruct::get() implementation...
1336 struct ConvertConstantType<ConstantStruct, StructType> {
1337 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1338 // Make everyone now use a constant of the new type...
1339 std::vector<Constant*> C;
1340 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1341 C.push_back(cast<Constant>(OldC->getOperand(i)));
1342 Constant *New = ConstantStruct::get(NewTy, C);
1343 assert(New != OldC && "Didn't replace constant??");
1345 OldC->uncheckedReplaceAllUsesWith(New);
1346 OldC->destroyConstant(); // This constant is now dead, destroy it.
1351 typedef ValueMap<std::vector<Constant*>, StructType,
1352 ConstantStruct, true /*largekey*/> StructConstantsTy;
1353 static ManagedStatic<StructConstantsTy> StructConstants;
1355 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1356 std::vector<Constant*> Elements;
1357 Elements.reserve(CS->getNumOperands());
1358 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1359 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1363 Constant *ConstantStruct::get(const StructType *Ty,
1364 const std::vector<Constant*> &V) {
1365 // Create a ConstantAggregateZero value if all elements are zeros...
1366 for (unsigned i = 0, e = V.size(); i != e; ++i)
1367 if (!V[i]->isNullValue())
1368 // Implicitly locked.
1369 return StructConstants->getOrCreate(Ty, V);
1371 return ConstantAggregateZero::get(Ty);
1374 // destroyConstant - Remove the constant from the constant table...
1376 void ConstantStruct::destroyConstant() {
1377 // Implicitly locked.
1378 StructConstants->remove(this);
1379 destroyConstantImpl();
1382 //---- ConstantVector::get() implementation...
1386 struct ConvertConstantType<ConstantVector, VectorType> {
1387 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1388 // Make everyone now use a constant of the new type...
1389 std::vector<Constant*> C;
1390 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1391 C.push_back(cast<Constant>(OldC->getOperand(i)));
1392 Constant *New = ConstantVector::get(NewTy, C);
1393 assert(New != OldC && "Didn't replace constant??");
1394 OldC->uncheckedReplaceAllUsesWith(New);
1395 OldC->destroyConstant(); // This constant is now dead, destroy it.
1400 static std::vector<Constant*> getValType(ConstantVector *CP) {
1401 std::vector<Constant*> Elements;
1402 Elements.reserve(CP->getNumOperands());
1403 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1404 Elements.push_back(CP->getOperand(i));
1408 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1409 ConstantVector> > VectorConstants;
1411 Constant *ConstantVector::get(const VectorType *Ty,
1412 const std::vector<Constant*> &V) {
1413 assert(!V.empty() && "Vectors can't be empty");
1414 // If this is an all-undef or alll-zero vector, return a
1415 // ConstantAggregateZero or UndefValue.
1417 bool isZero = C->isNullValue();
1418 bool isUndef = isa<UndefValue>(C);
1420 if (isZero || isUndef) {
1421 for (unsigned i = 1, e = V.size(); i != e; ++i)
1423 isZero = isUndef = false;
1429 return ConstantAggregateZero::get(Ty);
1431 return UndefValue::get(Ty);
1433 // Implicitly locked.
1434 return VectorConstants->getOrCreate(Ty, V);
1437 // destroyConstant - Remove the constant from the constant table...
1439 void ConstantVector::destroyConstant() {
1440 // Implicitly locked.
1441 VectorConstants->remove(this);
1442 destroyConstantImpl();
1445 /// This function will return true iff every element in this vector constant
1446 /// is set to all ones.
1447 /// @returns true iff this constant's emements are all set to all ones.
1448 /// @brief Determine if the value is all ones.
1449 bool ConstantVector::isAllOnesValue() const {
1450 // Check out first element.
1451 const Constant *Elt = getOperand(0);
1452 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1453 if (!CI || !CI->isAllOnesValue()) return false;
1454 // Then make sure all remaining elements point to the same value.
1455 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1456 if (getOperand(I) != Elt) return false;
1461 /// getSplatValue - If this is a splat constant, where all of the
1462 /// elements have the same value, return that value. Otherwise return null.
1463 Constant *ConstantVector::getSplatValue() {
1464 // Check out first element.
1465 Constant *Elt = getOperand(0);
1466 // Then make sure all remaining elements point to the same value.
1467 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1468 if (getOperand(I) != Elt) return 0;
1472 //---- ConstantPointerNull::get() implementation...
1476 // ConstantPointerNull does not take extra "value" argument...
1477 template<class ValType>
1478 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1479 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1480 return new ConstantPointerNull(Ty);
1485 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1486 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1487 // Make everyone now use a constant of the new type...
1488 Constant *New = ConstantPointerNull::get(NewTy);
1489 assert(New != OldC && "Didn't replace constant??");
1490 OldC->uncheckedReplaceAllUsesWith(New);
1491 OldC->destroyConstant(); // This constant is now dead, destroy it.
1496 static ManagedStatic<ValueMap<char, PointerType,
1497 ConstantPointerNull> > NullPtrConstants;
1499 static char getValType(ConstantPointerNull *) {
1504 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1505 // Implicitly locked.
1506 return NullPtrConstants->getOrCreate(Ty, 0);
1509 // destroyConstant - Remove the constant from the constant table...
1511 void ConstantPointerNull::destroyConstant() {
1512 // Implicitly locked.
1513 NullPtrConstants->remove(this);
1514 destroyConstantImpl();
1518 //---- UndefValue::get() implementation...
1522 // UndefValue does not take extra "value" argument...
1523 template<class ValType>
1524 struct ConstantCreator<UndefValue, Type, ValType> {
1525 static UndefValue *create(const Type *Ty, const ValType &V) {
1526 return new UndefValue(Ty);
1531 struct ConvertConstantType<UndefValue, Type> {
1532 static void convert(UndefValue *OldC, const Type *NewTy) {
1533 // Make everyone now use a constant of the new type.
1534 Constant *New = UndefValue::get(NewTy);
1535 assert(New != OldC && "Didn't replace constant??");
1536 OldC->uncheckedReplaceAllUsesWith(New);
1537 OldC->destroyConstant(); // This constant is now dead, destroy it.
1542 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1544 static char getValType(UndefValue *) {
1549 UndefValue *UndefValue::get(const Type *Ty) {
1550 // Implicitly locked.
1551 return UndefValueConstants->getOrCreate(Ty, 0);
1554 // destroyConstant - Remove the constant from the constant table.
1556 void UndefValue::destroyConstant() {
1557 // Implicitly locked.
1558 UndefValueConstants->remove(this);
1559 destroyConstantImpl();
1562 //---- MDString::get() implementation
1565 MDString::MDString(const char *begin, const char *end)
1566 : Constant(Type::MetadataTy, MDStringVal, 0, 0),
1567 StrBegin(begin), StrEnd(end) {}
1569 static ManagedStatic<StringMap<MDString*> > MDStringCache;
1571 MDString *MDString::get(const char *StrBegin, const char *StrEnd) {
1572 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
1573 StringMapEntry<MDString *> &Entry = MDStringCache->GetOrCreateValue(
1575 MDString *&S = Entry.getValue();
1576 if (!S) S = new MDString(Entry.getKeyData(),
1577 Entry.getKeyData() + Entry.getKeyLength());
1582 MDString *MDString::get(const std::string &Str) {
1583 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
1584 StringMapEntry<MDString *> &Entry = MDStringCache->GetOrCreateValue(
1585 Str.data(), Str.data() + Str.size());
1586 MDString *&S = Entry.getValue();
1587 if (!S) S = new MDString(Entry.getKeyData(),
1588 Entry.getKeyData() + Entry.getKeyLength());
1593 void MDString::destroyConstant() {
1594 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
1595 MDStringCache->erase(MDStringCache->find(StrBegin, StrEnd));
1596 destroyConstantImpl();
1599 //---- MDNode::get() implementation
1602 static ManagedStatic<FoldingSet<MDNode> > MDNodeSet;
1604 MDNode::MDNode(Value*const* Vals, unsigned NumVals)
1605 : Constant(Type::MetadataTy, MDNodeVal, 0, 0) {
1606 for (unsigned i = 0; i != NumVals; ++i)
1607 Node.push_back(ElementVH(Vals[i], this));
1610 void MDNode::Profile(FoldingSetNodeID &ID) const {
1611 for (const_elem_iterator I = elem_begin(), E = elem_end(); I != E; ++I)
1615 MDNode *MDNode::get(Value*const* Vals, unsigned NumVals) {
1616 FoldingSetNodeID ID;
1617 for (unsigned i = 0; i != NumVals; ++i)
1618 ID.AddPointer(Vals[i]);
1620 ConstantsLock->reader_acquire();
1622 MDNode *N = MDNodeSet->FindNodeOrInsertPos(ID, InsertPoint);
1623 ConstantsLock->reader_release();
1626 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
1627 N = MDNodeSet->FindNodeOrInsertPos(ID, InsertPoint);
1629 // InsertPoint will have been set by the FindNodeOrInsertPos call.
1630 N = new(0) MDNode(Vals, NumVals);
1631 MDNodeSet->InsertNode(N, InsertPoint);
1637 void MDNode::destroyConstant() {
1638 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
1639 MDNodeSet->RemoveNode(this);
1641 destroyConstantImpl();
1644 //---- ConstantExpr::get() implementations...
1649 struct ExprMapKeyType {
1650 typedef SmallVector<unsigned, 4> IndexList;
1652 ExprMapKeyType(unsigned opc,
1653 const std::vector<Constant*> &ops,
1654 unsigned short pred = 0,
1655 const IndexList &inds = IndexList())
1656 : opcode(opc), predicate(pred), operands(ops), indices(inds) {}
1659 std::vector<Constant*> operands;
1661 bool operator==(const ExprMapKeyType& that) const {
1662 return this->opcode == that.opcode &&
1663 this->predicate == that.predicate &&
1664 this->operands == that.operands &&
1665 this->indices == that.indices;
1667 bool operator<(const ExprMapKeyType & that) const {
1668 return this->opcode < that.opcode ||
1669 (this->opcode == that.opcode && this->predicate < that.predicate) ||
1670 (this->opcode == that.opcode && this->predicate == that.predicate &&
1671 this->operands < that.operands) ||
1672 (this->opcode == that.opcode && this->predicate == that.predicate &&
1673 this->operands == that.operands && this->indices < that.indices);
1676 bool operator!=(const ExprMapKeyType& that) const {
1677 return !(*this == that);
1685 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1686 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
1687 unsigned short pred = 0) {
1688 if (Instruction::isCast(V.opcode))
1689 return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
1690 if ((V.opcode >= Instruction::BinaryOpsBegin &&
1691 V.opcode < Instruction::BinaryOpsEnd))
1692 return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
1693 if (V.opcode == Instruction::Select)
1694 return new SelectConstantExpr(V.operands[0], V.operands[1],
1696 if (V.opcode == Instruction::ExtractElement)
1697 return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
1698 if (V.opcode == Instruction::InsertElement)
1699 return new InsertElementConstantExpr(V.operands[0], V.operands[1],
1701 if (V.opcode == Instruction::ShuffleVector)
1702 return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
1704 if (V.opcode == Instruction::InsertValue)
1705 return new InsertValueConstantExpr(V.operands[0], V.operands[1],
1707 if (V.opcode == Instruction::ExtractValue)
1708 return new ExtractValueConstantExpr(V.operands[0], V.indices, Ty);
1709 if (V.opcode == Instruction::GetElementPtr) {
1710 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1711 return GetElementPtrConstantExpr::Create(V.operands[0], IdxList, Ty);
1714 // The compare instructions are weird. We have to encode the predicate
1715 // value and it is combined with the instruction opcode by multiplying
1716 // the opcode by one hundred. We must decode this to get the predicate.
1717 if (V.opcode == Instruction::ICmp)
1718 return new CompareConstantExpr(Ty, Instruction::ICmp, V.predicate,
1719 V.operands[0], V.operands[1]);
1720 if (V.opcode == Instruction::FCmp)
1721 return new CompareConstantExpr(Ty, Instruction::FCmp, V.predicate,
1722 V.operands[0], V.operands[1]);
1723 llvm_unreachable("Invalid ConstantExpr!");
1729 struct ConvertConstantType<ConstantExpr, Type> {
1730 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1732 switch (OldC->getOpcode()) {
1733 case Instruction::Trunc:
1734 case Instruction::ZExt:
1735 case Instruction::SExt:
1736 case Instruction::FPTrunc:
1737 case Instruction::FPExt:
1738 case Instruction::UIToFP:
1739 case Instruction::SIToFP:
1740 case Instruction::FPToUI:
1741 case Instruction::FPToSI:
1742 case Instruction::PtrToInt:
1743 case Instruction::IntToPtr:
1744 case Instruction::BitCast:
1745 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1748 case Instruction::Select:
1749 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1750 OldC->getOperand(1),
1751 OldC->getOperand(2));
1754 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1755 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1756 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1757 OldC->getOperand(1));
1759 case Instruction::GetElementPtr:
1760 // Make everyone now use a constant of the new type...
1761 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1762 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1763 &Idx[0], Idx.size());
1767 assert(New != OldC && "Didn't replace constant??");
1768 OldC->uncheckedReplaceAllUsesWith(New);
1769 OldC->destroyConstant(); // This constant is now dead, destroy it.
1772 } // end namespace llvm
1775 static ExprMapKeyType getValType(ConstantExpr *CE) {
1776 std::vector<Constant*> Operands;
1777 Operands.reserve(CE->getNumOperands());
1778 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1779 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1780 return ExprMapKeyType(CE->getOpcode(), Operands,
1781 CE->isCompare() ? CE->getPredicate() : 0,
1783 CE->getIndices() : SmallVector<unsigned, 4>());
1786 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1787 ConstantExpr> > ExprConstants;
1789 /// This is a utility function to handle folding of casts and lookup of the
1790 /// cast in the ExprConstants map. It is used by the various get* methods below.
1791 static inline Constant *getFoldedCast(
1792 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1793 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1794 // Fold a few common cases
1796 ConstantFoldCastInstruction(getGlobalContext(), opc, C, Ty))
1799 // Look up the constant in the table first to ensure uniqueness
1800 std::vector<Constant*> argVec(1, C);
1801 ExprMapKeyType Key(opc, argVec);
1803 // Implicitly locked.
1804 return ExprConstants->getOrCreate(Ty, Key);
1807 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1808 Instruction::CastOps opc = Instruction::CastOps(oc);
1809 assert(Instruction::isCast(opc) && "opcode out of range");
1810 assert(C && Ty && "Null arguments to getCast");
1811 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1815 llvm_unreachable("Invalid cast opcode");
1817 case Instruction::Trunc: return getTrunc(C, Ty);
1818 case Instruction::ZExt: return getZExt(C, Ty);
1819 case Instruction::SExt: return getSExt(C, Ty);
1820 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1821 case Instruction::FPExt: return getFPExtend(C, Ty);
1822 case Instruction::UIToFP: return getUIToFP(C, Ty);
1823 case Instruction::SIToFP: return getSIToFP(C, Ty);
1824 case Instruction::FPToUI: return getFPToUI(C, Ty);
1825 case Instruction::FPToSI: return getFPToSI(C, Ty);
1826 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1827 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1828 case Instruction::BitCast: return getBitCast(C, Ty);
1833 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1834 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1835 return getCast(Instruction::BitCast, C, Ty);
1836 return getCast(Instruction::ZExt, C, Ty);
1839 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1840 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1841 return getCast(Instruction::BitCast, C, Ty);
1842 return getCast(Instruction::SExt, C, Ty);
1845 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1846 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1847 return getCast(Instruction::BitCast, C, Ty);
1848 return getCast(Instruction::Trunc, C, Ty);
1851 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1852 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1853 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1855 if (Ty->isInteger())
1856 return getCast(Instruction::PtrToInt, S, Ty);
1857 return getCast(Instruction::BitCast, S, Ty);
1860 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1862 assert(C->getType()->isIntOrIntVector() &&
1863 Ty->isIntOrIntVector() && "Invalid cast");
1864 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1865 unsigned DstBits = Ty->getScalarSizeInBits();
1866 Instruction::CastOps opcode =
1867 (SrcBits == DstBits ? Instruction::BitCast :
1868 (SrcBits > DstBits ? Instruction::Trunc :
1869 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1870 return getCast(opcode, C, Ty);
1873 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1874 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
1876 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1877 unsigned DstBits = Ty->getScalarSizeInBits();
1878 if (SrcBits == DstBits)
1879 return C; // Avoid a useless cast
1880 Instruction::CastOps opcode =
1881 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1882 return getCast(opcode, C, Ty);
1885 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1887 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1888 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1890 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1891 assert(C->getType()->isIntOrIntVector() && "Trunc operand must be integer");
1892 assert(Ty->isIntOrIntVector() && "Trunc produces only integral");
1893 assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1894 "SrcTy must be larger than DestTy for Trunc!");
1896 return getFoldedCast(Instruction::Trunc, C, Ty);
1899 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1901 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1902 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1904 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1905 assert(C->getType()->isIntOrIntVector() && "SExt operand must be integral");
1906 assert(Ty->isIntOrIntVector() && "SExt produces only integer");
1907 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1908 "SrcTy must be smaller than DestTy for SExt!");
1910 return getFoldedCast(Instruction::SExt, C, Ty);
1913 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1915 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1916 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1918 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1919 assert(C->getType()->isIntOrIntVector() && "ZEXt operand must be integral");
1920 assert(Ty->isIntOrIntVector() && "ZExt produces only integer");
1921 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1922 "SrcTy must be smaller than DestTy for ZExt!");
1924 return getFoldedCast(Instruction::ZExt, C, Ty);
1927 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1929 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1930 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1932 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1933 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
1934 C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1935 "This is an illegal floating point truncation!");
1936 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1939 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1941 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1942 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1944 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1945 assert(C->getType()->isFPOrFPVector() && Ty->isFPOrFPVector() &&
1946 C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1947 "This is an illegal floating point extension!");
1948 return getFoldedCast(Instruction::FPExt, C, Ty);
1951 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1953 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1954 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1956 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1957 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1958 "This is an illegal uint to floating point cast!");
1959 return getFoldedCast(Instruction::UIToFP, C, Ty);
1962 Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
1964 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1965 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1967 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1968 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1969 "This is an illegal sint to floating point cast!");
1970 return getFoldedCast(Instruction::SIToFP, C, Ty);
1973 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1975 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1976 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1978 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1979 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1980 "This is an illegal floating point to uint cast!");
1981 return getFoldedCast(Instruction::FPToUI, C, Ty);
1984 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1986 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1987 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1989 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1990 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1991 "This is an illegal floating point to sint cast!");
1992 return getFoldedCast(Instruction::FPToSI, C, Ty);
1995 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1996 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1997 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1998 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
2001 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
2002 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
2003 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
2004 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
2007 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
2008 // BitCast implies a no-op cast of type only. No bits change. However, you
2009 // can't cast pointers to anything but pointers.
2011 const Type *SrcTy = C->getType();
2012 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
2013 "BitCast cannot cast pointer to non-pointer and vice versa");
2015 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
2016 // or nonptr->ptr). For all the other types, the cast is okay if source and
2017 // destination bit widths are identical.
2018 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
2019 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
2021 assert(SrcBitSize == DstBitSize && "BitCast requires types of same width");
2023 // It is common to ask for a bitcast of a value to its own type, handle this
2025 if (C->getType() == DstTy) return C;
2027 return getFoldedCast(Instruction::BitCast, C, DstTy);
2030 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
2031 Constant *C1, Constant *C2) {
2032 // Check the operands for consistency first
2033 assert(Opcode >= Instruction::BinaryOpsBegin &&
2034 Opcode < Instruction::BinaryOpsEnd &&
2035 "Invalid opcode in binary constant expression");
2036 assert(C1->getType() == C2->getType() &&
2037 "Operand types in binary constant expression should match");
2039 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
2040 if (Constant *FC = ConstantFoldBinaryInstruction(
2041 getGlobalContext(), Opcode, C1, C2))
2042 return FC; // Fold a few common cases...
2044 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
2045 ExprMapKeyType Key(Opcode, argVec);
2047 // Implicitly locked.
2048 return ExprConstants->getOrCreate(ReqTy, Key);
2051 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
2052 Constant *C1, Constant *C2) {
2053 switch (predicate) {
2054 default: llvm_unreachable("Invalid CmpInst predicate");
2055 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
2056 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
2057 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
2058 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
2059 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
2060 case CmpInst::FCMP_TRUE:
2061 return getFCmp(predicate, C1, C2);
2063 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
2064 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
2065 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
2066 case CmpInst::ICMP_SLE:
2067 return getICmp(predicate, C1, C2);
2071 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
2072 // API compatibility: Adjust integer opcodes to floating-point opcodes.
2073 if (C1->getType()->isFPOrFPVector()) {
2074 if (Opcode == Instruction::Add) Opcode = Instruction::FAdd;
2075 else if (Opcode == Instruction::Sub) Opcode = Instruction::FSub;
2076 else if (Opcode == Instruction::Mul) Opcode = Instruction::FMul;
2080 case Instruction::Add:
2081 case Instruction::Sub:
2082 case Instruction::Mul:
2083 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2084 assert(C1->getType()->isIntOrIntVector() &&
2085 "Tried to create an integer operation on a non-integer type!");
2087 case Instruction::FAdd:
2088 case Instruction::FSub:
2089 case Instruction::FMul:
2090 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2091 assert(C1->getType()->isFPOrFPVector() &&
2092 "Tried to create a floating-point operation on a "
2093 "non-floating-point type!");
2095 case Instruction::UDiv:
2096 case Instruction::SDiv:
2097 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2098 assert(C1->getType()->isIntOrIntVector() &&
2099 "Tried to create an arithmetic operation on a non-arithmetic type!");
2101 case Instruction::FDiv:
2102 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2103 assert(C1->getType()->isFPOrFPVector() &&
2104 "Tried to create an arithmetic operation on a non-arithmetic type!");
2106 case Instruction::URem:
2107 case Instruction::SRem:
2108 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2109 assert(C1->getType()->isIntOrIntVector() &&
2110 "Tried to create an arithmetic operation on a non-arithmetic type!");
2112 case Instruction::FRem:
2113 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2114 assert(C1->getType()->isFPOrFPVector() &&
2115 "Tried to create an arithmetic operation on a non-arithmetic type!");
2117 case Instruction::And:
2118 case Instruction::Or:
2119 case Instruction::Xor:
2120 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2121 assert(C1->getType()->isIntOrIntVector() &&
2122 "Tried to create a logical operation on a non-integral type!");
2124 case Instruction::Shl:
2125 case Instruction::LShr:
2126 case Instruction::AShr:
2127 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2128 assert(C1->getType()->isIntOrIntVector() &&
2129 "Tried to create a shift operation on a non-integer type!");
2136 return getTy(C1->getType(), Opcode, C1, C2);
2139 Constant *ConstantExpr::getCompare(unsigned short pred,
2140 Constant *C1, Constant *C2) {
2141 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2142 return getCompareTy(pred, C1, C2);
2145 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
2146 Constant *V1, Constant *V2) {
2147 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
2149 if (ReqTy == V1->getType())
2150 if (Constant *SC = ConstantFoldSelectInstruction(
2151 getGlobalContext(), C, V1, V2))
2152 return SC; // Fold common cases
2154 std::vector<Constant*> argVec(3, C);
2157 ExprMapKeyType Key(Instruction::Select, argVec);
2159 // Implicitly locked.
2160 return ExprConstants->getOrCreate(ReqTy, Key);
2163 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
2166 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs,
2168 cast<PointerType>(ReqTy)->getElementType() &&
2169 "GEP indices invalid!");
2171 if (Constant *FC = ConstantFoldGetElementPtr(
2172 getGlobalContext(), C, (Constant**)Idxs, NumIdx))
2173 return FC; // Fold a few common cases...
2175 assert(isa<PointerType>(C->getType()) &&
2176 "Non-pointer type for constant GetElementPtr expression");
2177 // Look up the constant in the table first to ensure uniqueness
2178 std::vector<Constant*> ArgVec;
2179 ArgVec.reserve(NumIdx+1);
2180 ArgVec.push_back(C);
2181 for (unsigned i = 0; i != NumIdx; ++i)
2182 ArgVec.push_back(cast<Constant>(Idxs[i]));
2183 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
2185 // Implicitly locked.
2186 return ExprConstants->getOrCreate(ReqTy, Key);
2189 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
2191 // Get the result type of the getelementptr!
2193 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
2194 assert(Ty && "GEP indices invalid!");
2195 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
2196 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
2199 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
2201 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
2206 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2207 assert(LHS->getType() == RHS->getType());
2208 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2209 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2211 if (Constant *FC = ConstantFoldCompareInstruction(
2212 getGlobalContext(),pred, LHS, RHS))
2213 return FC; // Fold a few common cases...
2215 // Look up the constant in the table first to ensure uniqueness
2216 std::vector<Constant*> ArgVec;
2217 ArgVec.push_back(LHS);
2218 ArgVec.push_back(RHS);
2219 // Get the key type with both the opcode and predicate
2220 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
2222 // Implicitly locked.
2223 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2227 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2228 assert(LHS->getType() == RHS->getType());
2229 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2231 if (Constant *FC = ConstantFoldCompareInstruction(
2232 getGlobalContext(), pred, LHS, RHS))
2233 return FC; // Fold a few common cases...
2235 // Look up the constant in the table first to ensure uniqueness
2236 std::vector<Constant*> ArgVec;
2237 ArgVec.push_back(LHS);
2238 ArgVec.push_back(RHS);
2239 // Get the key type with both the opcode and predicate
2240 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
2242 // Implicitly locked.
2243 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2246 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
2248 if (Constant *FC = ConstantFoldExtractElementInstruction(
2249 getGlobalContext(), Val, Idx))
2250 return FC; // Fold a few common cases...
2251 // Look up the constant in the table first to ensure uniqueness
2252 std::vector<Constant*> ArgVec(1, Val);
2253 ArgVec.push_back(Idx);
2254 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
2256 // Implicitly locked.
2257 return ExprConstants->getOrCreate(ReqTy, Key);
2260 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
2261 assert(isa<VectorType>(Val->getType()) &&
2262 "Tried to create extractelement operation on non-vector type!");
2263 assert(Idx->getType() == Type::Int32Ty &&
2264 "Extractelement index must be i32 type!");
2265 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
2269 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
2270 Constant *Elt, Constant *Idx) {
2271 if (Constant *FC = ConstantFoldInsertElementInstruction(
2272 getGlobalContext(), Val, Elt, Idx))
2273 return FC; // Fold a few common cases...
2274 // Look up the constant in the table first to ensure uniqueness
2275 std::vector<Constant*> ArgVec(1, Val);
2276 ArgVec.push_back(Elt);
2277 ArgVec.push_back(Idx);
2278 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
2280 // Implicitly locked.
2281 return ExprConstants->getOrCreate(ReqTy, Key);
2284 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2286 assert(isa<VectorType>(Val->getType()) &&
2287 "Tried to create insertelement operation on non-vector type!");
2288 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
2289 && "Insertelement types must match!");
2290 assert(Idx->getType() == Type::Int32Ty &&
2291 "Insertelement index must be i32 type!");
2292 return getInsertElementTy(Val->getType(), Val, Elt, Idx);
2295 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
2296 Constant *V2, Constant *Mask) {
2297 if (Constant *FC = ConstantFoldShuffleVectorInstruction(
2298 getGlobalContext(), V1, V2, Mask))
2299 return FC; // Fold a few common cases...
2300 // Look up the constant in the table first to ensure uniqueness
2301 std::vector<Constant*> ArgVec(1, V1);
2302 ArgVec.push_back(V2);
2303 ArgVec.push_back(Mask);
2304 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
2306 // Implicitly locked.
2307 return ExprConstants->getOrCreate(ReqTy, Key);
2310 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2312 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2313 "Invalid shuffle vector constant expr operands!");
2315 unsigned NElts = cast<VectorType>(Mask->getType())->getNumElements();
2316 const Type *EltTy = cast<VectorType>(V1->getType())->getElementType();
2317 const Type *ShufTy = VectorType::get(EltTy, NElts);
2318 return getShuffleVectorTy(ShufTy, V1, V2, Mask);
2321 Constant *ConstantExpr::getInsertValueTy(const Type *ReqTy, Constant *Agg,
2323 const unsigned *Idxs, unsigned NumIdx) {
2324 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2325 Idxs+NumIdx) == Val->getType() &&
2326 "insertvalue indices invalid!");
2327 assert(Agg->getType() == ReqTy &&
2328 "insertvalue type invalid!");
2329 assert(Agg->getType()->isFirstClassType() &&
2330 "Non-first-class type for constant InsertValue expression");
2331 Constant *FC = ConstantFoldInsertValueInstruction(
2332 getGlobalContext(), Agg, Val, Idxs, NumIdx);
2333 assert(FC && "InsertValue constant expr couldn't be folded!");
2337 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2338 const unsigned *IdxList, unsigned NumIdx) {
2339 assert(Agg->getType()->isFirstClassType() &&
2340 "Tried to create insertelement operation on non-first-class type!");
2342 const Type *ReqTy = Agg->getType();
2345 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2347 assert(ValTy == Val->getType() && "insertvalue indices invalid!");
2348 return getInsertValueTy(ReqTy, Agg, Val, IdxList, NumIdx);
2351 Constant *ConstantExpr::getExtractValueTy(const Type *ReqTy, Constant *Agg,
2352 const unsigned *Idxs, unsigned NumIdx) {
2353 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2354 Idxs+NumIdx) == ReqTy &&
2355 "extractvalue indices invalid!");
2356 assert(Agg->getType()->isFirstClassType() &&
2357 "Non-first-class type for constant extractvalue expression");
2358 Constant *FC = ConstantFoldExtractValueInstruction(
2359 getGlobalContext(), Agg, Idxs, NumIdx);
2360 assert(FC && "ExtractValue constant expr couldn't be folded!");
2364 Constant *ConstantExpr::getExtractValue(Constant *Agg,
2365 const unsigned *IdxList, unsigned NumIdx) {
2366 assert(Agg->getType()->isFirstClassType() &&
2367 "Tried to create extractelement operation on non-first-class type!");
2370 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2371 assert(ReqTy && "extractvalue indices invalid!");
2372 return getExtractValueTy(ReqTy, Agg, IdxList, NumIdx);
2375 // destroyConstant - Remove the constant from the constant table...
2377 void ConstantExpr::destroyConstant() {
2378 // Implicitly locked.
2379 ExprConstants->remove(this);
2380 destroyConstantImpl();
2383 const char *ConstantExpr::getOpcodeName() const {
2384 return Instruction::getOpcodeName(getOpcode());
2387 //===----------------------------------------------------------------------===//
2388 // replaceUsesOfWithOnConstant implementations
2390 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2391 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2394 /// Note that we intentionally replace all uses of From with To here. Consider
2395 /// a large array that uses 'From' 1000 times. By handling this case all here,
2396 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2397 /// single invocation handles all 1000 uses. Handling them one at a time would
2398 /// work, but would be really slow because it would have to unique each updated
2400 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2402 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2403 Constant *ToC = cast<Constant>(To);
2405 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2406 Lookup.first.first = getType();
2407 Lookup.second = this;
2409 std::vector<Constant*> &Values = Lookup.first.second;
2410 Values.reserve(getNumOperands()); // Build replacement array.
2412 // Fill values with the modified operands of the constant array. Also,
2413 // compute whether this turns into an all-zeros array.
2414 bool isAllZeros = false;
2415 unsigned NumUpdated = 0;
2416 if (!ToC->isNullValue()) {
2417 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2418 Constant *Val = cast<Constant>(O->get());
2423 Values.push_back(Val);
2427 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2428 Constant *Val = cast<Constant>(O->get());
2433 Values.push_back(Val);
2434 if (isAllZeros) isAllZeros = Val->isNullValue();
2438 Constant *Replacement = 0;
2440 Replacement = ConstantAggregateZero::get(getType());
2442 // Check to see if we have this array type already.
2443 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
2445 ArrayConstantsTy::MapTy::iterator I =
2446 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2449 Replacement = I->second;
2451 // Okay, the new shape doesn't exist in the system yet. Instead of
2452 // creating a new constant array, inserting it, replaceallusesof'ing the
2453 // old with the new, then deleting the old... just update the current one
2455 ArrayConstants->MoveConstantToNewSlot(this, I);
2457 // Update to the new value. Optimize for the case when we have a single
2458 // operand that we're changing, but handle bulk updates efficiently.
2459 if (NumUpdated == 1) {
2460 unsigned OperandToUpdate = U-OperandList;
2461 assert(getOperand(OperandToUpdate) == From &&
2462 "ReplaceAllUsesWith broken!");
2463 setOperand(OperandToUpdate, ToC);
2465 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2466 if (getOperand(i) == From)
2473 // Otherwise, I do need to replace this with an existing value.
2474 assert(Replacement != this && "I didn't contain From!");
2476 // Everyone using this now uses the replacement.
2477 uncheckedReplaceAllUsesWith(Replacement);
2479 // Delete the old constant!
2483 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2485 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2486 Constant *ToC = cast<Constant>(To);
2488 unsigned OperandToUpdate = U-OperandList;
2489 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2491 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2492 Lookup.first.first = getType();
2493 Lookup.second = this;
2494 std::vector<Constant*> &Values = Lookup.first.second;
2495 Values.reserve(getNumOperands()); // Build replacement struct.
2498 // Fill values with the modified operands of the constant struct. Also,
2499 // compute whether this turns into an all-zeros struct.
2500 bool isAllZeros = false;
2501 if (!ToC->isNullValue()) {
2502 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2503 Values.push_back(cast<Constant>(O->get()));
2506 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2507 Constant *Val = cast<Constant>(O->get());
2508 Values.push_back(Val);
2509 if (isAllZeros) isAllZeros = Val->isNullValue();
2512 Values[OperandToUpdate] = ToC;
2514 Constant *Replacement = 0;
2516 Replacement = ConstantAggregateZero::get(getType());
2518 // Check to see if we have this array type already.
2519 sys::SmartScopedWriter<true> Writer(*ConstantsLock);
2521 StructConstantsTy::MapTy::iterator I =
2522 StructConstants->InsertOrGetItem(Lookup, Exists);
2525 Replacement = I->second;
2527 // Okay, the new shape doesn't exist in the system yet. Instead of
2528 // creating a new constant struct, inserting it, replaceallusesof'ing the
2529 // old with the new, then deleting the old... just update the current one
2531 StructConstants->MoveConstantToNewSlot(this, I);
2533 // Update to the new value.
2534 setOperand(OperandToUpdate, ToC);
2539 assert(Replacement != this && "I didn't contain From!");
2541 // Everyone using this now uses the replacement.
2542 uncheckedReplaceAllUsesWith(Replacement);
2544 // Delete the old constant!
2548 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2550 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2552 std::vector<Constant*> Values;
2553 Values.reserve(getNumOperands()); // Build replacement array...
2554 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2555 Constant *Val = getOperand(i);
2556 if (Val == From) Val = cast<Constant>(To);
2557 Values.push_back(Val);
2560 Constant *Replacement = ConstantVector::get(getType(), Values);
2561 assert(Replacement != this && "I didn't contain From!");
2563 // Everyone using this now uses the replacement.
2564 uncheckedReplaceAllUsesWith(Replacement);
2566 // Delete the old constant!
2570 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2572 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2573 Constant *To = cast<Constant>(ToV);
2575 Constant *Replacement = 0;
2576 if (getOpcode() == Instruction::GetElementPtr) {
2577 SmallVector<Constant*, 8> Indices;
2578 Constant *Pointer = getOperand(0);
2579 Indices.reserve(getNumOperands()-1);
2580 if (Pointer == From) Pointer = To;
2582 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2583 Constant *Val = getOperand(i);
2584 if (Val == From) Val = To;
2585 Indices.push_back(Val);
2587 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2588 &Indices[0], Indices.size());
2589 } else if (getOpcode() == Instruction::ExtractValue) {
2590 Constant *Agg = getOperand(0);
2591 if (Agg == From) Agg = To;
2593 const SmallVector<unsigned, 4> &Indices = getIndices();
2594 Replacement = ConstantExpr::getExtractValue(Agg,
2595 &Indices[0], Indices.size());
2596 } else if (getOpcode() == Instruction::InsertValue) {
2597 Constant *Agg = getOperand(0);
2598 Constant *Val = getOperand(1);
2599 if (Agg == From) Agg = To;
2600 if (Val == From) Val = To;
2602 const SmallVector<unsigned, 4> &Indices = getIndices();
2603 Replacement = ConstantExpr::getInsertValue(Agg, Val,
2604 &Indices[0], Indices.size());
2605 } else if (isCast()) {
2606 assert(getOperand(0) == From && "Cast only has one use!");
2607 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2608 } else if (getOpcode() == Instruction::Select) {
2609 Constant *C1 = getOperand(0);
2610 Constant *C2 = getOperand(1);
2611 Constant *C3 = getOperand(2);
2612 if (C1 == From) C1 = To;
2613 if (C2 == From) C2 = To;
2614 if (C3 == From) C3 = To;
2615 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2616 } else if (getOpcode() == Instruction::ExtractElement) {
2617 Constant *C1 = getOperand(0);
2618 Constant *C2 = getOperand(1);
2619 if (C1 == From) C1 = To;
2620 if (C2 == From) C2 = To;
2621 Replacement = ConstantExpr::getExtractElement(C1, C2);
2622 } else if (getOpcode() == Instruction::InsertElement) {
2623 Constant *C1 = getOperand(0);
2624 Constant *C2 = getOperand(1);
2625 Constant *C3 = getOperand(1);
2626 if (C1 == From) C1 = To;
2627 if (C2 == From) C2 = To;
2628 if (C3 == From) C3 = To;
2629 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2630 } else if (getOpcode() == Instruction::ShuffleVector) {
2631 Constant *C1 = getOperand(0);
2632 Constant *C2 = getOperand(1);
2633 Constant *C3 = getOperand(2);
2634 if (C1 == From) C1 = To;
2635 if (C2 == From) C2 = To;
2636 if (C3 == From) C3 = To;
2637 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2638 } else if (isCompare()) {
2639 Constant *C1 = getOperand(0);
2640 Constant *C2 = getOperand(1);
2641 if (C1 == From) C1 = To;
2642 if (C2 == From) C2 = To;
2643 if (getOpcode() == Instruction::ICmp)
2644 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2646 assert(getOpcode() == Instruction::FCmp);
2647 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2649 } else if (getNumOperands() == 2) {
2650 Constant *C1 = getOperand(0);
2651 Constant *C2 = getOperand(1);
2652 if (C1 == From) C1 = To;
2653 if (C2 == From) C2 = To;
2654 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2656 llvm_unreachable("Unknown ConstantExpr type!");
2660 assert(Replacement != this && "I didn't contain From!");
2662 // Everyone using this now uses the replacement.
2663 uncheckedReplaceAllUsesWith(Replacement);
2665 // Delete the old constant!
2669 void MDNode::replaceElement(Value *From, Value *To) {
2670 SmallVector<Value*, 4> Values;
2671 Values.reserve(getNumElements()); // Build replacement array...
2672 for (unsigned i = 0, e = getNumElements(); i != e; ++i) {
2673 Value *Val = getElement(i);
2674 if (Val == From) Val = To;
2675 Values.push_back(Val);
2678 MDNode *Replacement = MDNode::get(&Values[0], Values.size());
2679 assert(Replacement != this && "I didn't contain From!");
2681 uncheckedReplaceAllUsesWith(Replacement);