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/Module.h"
20 #include "llvm/ADT/StringExtras.h"
21 #include "llvm/Support/Compiler.h"
22 #include "llvm/Support/Debug.h"
23 #include "llvm/Support/ManagedStatic.h"
24 #include "llvm/Support/MathExtras.h"
25 #include "llvm/ADT/DenseMap.h"
26 #include "llvm/ADT/SmallVector.h"
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 DOUT << "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 /// canTrap - Return true if evaluation of this constant could trap. This is
64 /// true for things like constant expressions that could divide by zero.
65 bool Constant::canTrap() const {
66 assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
67 // The only thing that could possibly trap are constant exprs.
68 const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
69 if (!CE) return false;
71 // ConstantExpr traps if any operands can trap.
72 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
73 if (getOperand(i)->canTrap())
76 // Otherwise, only specific operations can trap.
77 switch (CE->getOpcode()) {
80 case Instruction::UDiv:
81 case Instruction::SDiv:
82 case Instruction::FDiv:
83 case Instruction::URem:
84 case Instruction::SRem:
85 case Instruction::FRem:
86 // Div and rem can trap if the RHS is not known to be non-zero.
87 if (!isa<ConstantInt>(getOperand(1)) || getOperand(1)->isNullValue())
93 /// ContaintsRelocations - Return true if the constant value contains
94 /// relocations which cannot be resolved at compile time.
95 bool Constant::ContainsRelocations() const {
96 if (isa<GlobalValue>(this))
98 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
99 if (getOperand(i)->ContainsRelocations())
104 // Static constructor to create a '0' constant of arbitrary type...
105 Constant *Constant::getNullValue(const Type *Ty) {
106 static uint64_t zero[2] = {0, 0};
107 switch (Ty->getTypeID()) {
108 case Type::IntegerTyID:
109 return ConstantInt::get(Ty, 0);
110 case Type::FloatTyID:
111 return ConstantFP::get(APFloat(APInt(32, 0)));
112 case Type::DoubleTyID:
113 return ConstantFP::get(APFloat(APInt(64, 0)));
114 case Type::X86_FP80TyID:
115 return ConstantFP::get(APFloat(APInt(80, 2, zero)));
116 case Type::FP128TyID:
117 return ConstantFP::get(APFloat(APInt(128, 2, zero), true));
118 case Type::PPC_FP128TyID:
119 return ConstantFP::get(APFloat(APInt(128, 2, zero)));
120 case Type::PointerTyID:
121 return ConstantPointerNull::get(cast<PointerType>(Ty));
122 case Type::StructTyID:
123 case Type::ArrayTyID:
124 case Type::VectorTyID:
125 return ConstantAggregateZero::get(Ty);
127 // Function, Label, or Opaque type?
128 assert(!"Cannot create a null constant of that type!");
133 Constant *Constant::getAllOnesValue(const Type *Ty) {
134 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty))
135 return ConstantInt::get(APInt::getAllOnesValue(ITy->getBitWidth()));
136 return ConstantVector::getAllOnesValue(cast<VectorType>(Ty));
139 // Static constructor to create an integral constant with all bits set
140 ConstantInt *ConstantInt::getAllOnesValue(const Type *Ty) {
141 if (const IntegerType* ITy = dyn_cast<IntegerType>(Ty))
142 return ConstantInt::get(APInt::getAllOnesValue(ITy->getBitWidth()));
146 /// @returns the value for a vector integer constant of the given type that
147 /// has all its bits set to true.
148 /// @brief Get the all ones value
149 ConstantVector *ConstantVector::getAllOnesValue(const VectorType *Ty) {
150 std::vector<Constant*> Elts;
151 Elts.resize(Ty->getNumElements(),
152 ConstantInt::getAllOnesValue(Ty->getElementType()));
153 assert(Elts[0] && "Not a vector integer type!");
154 return cast<ConstantVector>(ConstantVector::get(Elts));
158 /// getVectorElements - This method, which is only valid on constant of vector
159 /// type, returns the elements of the vector in the specified smallvector.
160 /// This handles breaking down a vector undef into undef elements, etc. For
161 /// constant exprs and other cases we can't handle, we return an empty vector.
162 void Constant::getVectorElements(SmallVectorImpl<Constant*> &Elts) const {
163 assert(isa<VectorType>(getType()) && "Not a vector constant!");
165 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) {
166 for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i)
167 Elts.push_back(CV->getOperand(i));
171 const VectorType *VT = cast<VectorType>(getType());
172 if (isa<ConstantAggregateZero>(this)) {
173 Elts.assign(VT->getNumElements(),
174 Constant::getNullValue(VT->getElementType()));
178 if (isa<UndefValue>(this)) {
179 Elts.assign(VT->getNumElements(), UndefValue::get(VT->getElementType()));
183 // Unknown type, must be constant expr etc.
188 //===----------------------------------------------------------------------===//
190 //===----------------------------------------------------------------------===//
192 ConstantInt::ConstantInt(const IntegerType *Ty, const APInt& V)
193 : Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
194 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
197 ConstantInt *ConstantInt::TheTrueVal = 0;
198 ConstantInt *ConstantInt::TheFalseVal = 0;
201 void CleanupTrueFalse(void *) {
202 ConstantInt::ResetTrueFalse();
206 static ManagedCleanup<llvm::CleanupTrueFalse> TrueFalseCleanup;
208 ConstantInt *ConstantInt::CreateTrueFalseVals(bool WhichOne) {
209 assert(TheTrueVal == 0 && TheFalseVal == 0);
210 TheTrueVal = get(Type::Int1Ty, 1);
211 TheFalseVal = get(Type::Int1Ty, 0);
213 // Ensure that llvm_shutdown nulls out TheTrueVal/TheFalseVal.
214 TrueFalseCleanup.Register();
216 return WhichOne ? TheTrueVal : TheFalseVal;
221 struct DenseMapAPIntKeyInfo {
225 KeyTy(const APInt& V, const Type* Ty) : val(V), type(Ty) {}
226 KeyTy(const KeyTy& that) : val(that.val), type(that.type) {}
227 bool operator==(const KeyTy& that) const {
228 return type == that.type && this->val == that.val;
230 bool operator!=(const KeyTy& that) const {
231 return !this->operator==(that);
234 static inline KeyTy getEmptyKey() { return KeyTy(APInt(1,0), 0); }
235 static inline KeyTy getTombstoneKey() { return KeyTy(APInt(1,1), 0); }
236 static unsigned getHashValue(const KeyTy &Key) {
237 return DenseMapInfo<void*>::getHashValue(Key.type) ^
238 Key.val.getHashValue();
240 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
243 static bool isPod() { return false; }
248 typedef DenseMap<DenseMapAPIntKeyInfo::KeyTy, ConstantInt*,
249 DenseMapAPIntKeyInfo> IntMapTy;
250 static ManagedStatic<IntMapTy> IntConstants;
252 ConstantInt *ConstantInt::get(const Type *Ty, uint64_t V, bool isSigned) {
253 const IntegerType *ITy = cast<IntegerType>(Ty);
254 return get(APInt(ITy->getBitWidth(), V, isSigned));
257 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
258 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
259 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
260 // compare APInt's of different widths, which would violate an APInt class
261 // invariant which generates an assertion.
262 ConstantInt *ConstantInt::get(const APInt& V) {
263 // Get the corresponding integer type for the bit width of the value.
264 const IntegerType *ITy = IntegerType::get(V.getBitWidth());
265 // get an existing value or the insertion position
266 DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
267 ConstantInt *&Slot = (*IntConstants)[Key];
268 // if it exists, return it.
271 // otherwise create a new one, insert it, and return it.
272 return Slot = new ConstantInt(ITy, V);
275 //===----------------------------------------------------------------------===//
277 //===----------------------------------------------------------------------===//
279 static const fltSemantics *TypeToFloatSemantics(const Type *Ty) {
280 if (Ty == Type::FloatTy)
281 return &APFloat::IEEEsingle;
282 if (Ty == Type::DoubleTy)
283 return &APFloat::IEEEdouble;
284 if (Ty == Type::X86_FP80Ty)
285 return &APFloat::x87DoubleExtended;
286 else if (Ty == Type::FP128Ty)
287 return &APFloat::IEEEquad;
289 assert(Ty == Type::PPC_FP128Ty && "Unknown FP format");
290 return &APFloat::PPCDoubleDouble;
293 ConstantFP::ConstantFP(const Type *Ty, const APFloat& V)
294 : Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
295 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
299 bool ConstantFP::isNullValue() const {
300 return Val.isZero() && !Val.isNegative();
303 ConstantFP *ConstantFP::getNegativeZero(const Type *Ty) {
304 APFloat apf = cast <ConstantFP>(Constant::getNullValue(Ty))->getValueAPF();
306 return ConstantFP::get(apf);
309 bool ConstantFP::isExactlyValue(const APFloat& V) const {
310 return Val.bitwiseIsEqual(V);
314 struct DenseMapAPFloatKeyInfo {
317 KeyTy(const APFloat& V) : val(V){}
318 KeyTy(const KeyTy& that) : val(that.val) {}
319 bool operator==(const KeyTy& that) const {
320 return this->val.bitwiseIsEqual(that.val);
322 bool operator!=(const KeyTy& that) const {
323 return !this->operator==(that);
326 static inline KeyTy getEmptyKey() {
327 return KeyTy(APFloat(APFloat::Bogus,1));
329 static inline KeyTy getTombstoneKey() {
330 return KeyTy(APFloat(APFloat::Bogus,2));
332 static unsigned getHashValue(const KeyTy &Key) {
333 return Key.val.getHashValue();
335 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
338 static bool isPod() { return false; }
342 //---- ConstantFP::get() implementation...
344 typedef DenseMap<DenseMapAPFloatKeyInfo::KeyTy, ConstantFP*,
345 DenseMapAPFloatKeyInfo> FPMapTy;
347 static ManagedStatic<FPMapTy> FPConstants;
349 ConstantFP *ConstantFP::get(const APFloat &V) {
350 DenseMapAPFloatKeyInfo::KeyTy Key(V);
351 ConstantFP *&Slot = (*FPConstants)[Key];
352 if (Slot) return Slot;
355 if (&V.getSemantics() == &APFloat::IEEEsingle)
357 else if (&V.getSemantics() == &APFloat::IEEEdouble)
359 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
360 Ty = Type::X86_FP80Ty;
361 else if (&V.getSemantics() == &APFloat::IEEEquad)
364 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble&&"Unknown FP format");
365 Ty = Type::PPC_FP128Ty;
368 return Slot = new ConstantFP(Ty, V);
371 /// get() - This returns a constant fp for the specified value in the
372 /// specified type. This should only be used for simple constant values like
373 /// 2.0/1.0 etc, that are known-valid both as double and as the target format.
374 ConstantFP *ConstantFP::get(const Type *Ty, double V) {
377 FV.convert(*TypeToFloatSemantics(Ty), APFloat::rmNearestTiesToEven, &ignored);
381 //===----------------------------------------------------------------------===//
382 // ConstantXXX Classes
383 //===----------------------------------------------------------------------===//
386 ConstantArray::ConstantArray(const ArrayType *T,
387 const std::vector<Constant*> &V)
388 : Constant(T, ConstantArrayVal,
389 OperandTraits<ConstantArray>::op_end(this) - V.size(),
391 assert(V.size() == T->getNumElements() &&
392 "Invalid initializer vector for constant array");
393 Use *OL = OperandList;
394 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
397 assert((C->getType() == T->getElementType() ||
399 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
400 "Initializer for array element doesn't match array element type!");
406 ConstantStruct::ConstantStruct(const StructType *T,
407 const std::vector<Constant*> &V)
408 : Constant(T, ConstantStructVal,
409 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
411 assert(V.size() == T->getNumElements() &&
412 "Invalid initializer vector for constant structure");
413 Use *OL = OperandList;
414 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
417 assert((C->getType() == T->getElementType(I-V.begin()) ||
418 ((T->getElementType(I-V.begin())->isAbstract() ||
419 C->getType()->isAbstract()) &&
420 T->getElementType(I-V.begin())->getTypeID() ==
421 C->getType()->getTypeID())) &&
422 "Initializer for struct element doesn't match struct element type!");
428 ConstantVector::ConstantVector(const VectorType *T,
429 const std::vector<Constant*> &V)
430 : Constant(T, ConstantVectorVal,
431 OperandTraits<ConstantVector>::op_end(this) - V.size(),
433 Use *OL = OperandList;
434 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
437 assert((C->getType() == T->getElementType() ||
439 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
440 "Initializer for vector element doesn't match vector element type!");
447 // We declare several classes private to this file, so use an anonymous
451 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
452 /// behind the scenes to implement unary constant exprs.
453 class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
454 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
456 // allocate space for exactly one operand
457 void *operator new(size_t s) {
458 return User::operator new(s, 1);
460 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
461 : ConstantExpr(Ty, Opcode, &Op<0>(), 1) {
464 /// Transparently provide more efficient getOperand methods.
465 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
468 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
469 /// behind the scenes to implement binary constant exprs.
470 class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
471 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
473 // allocate space for exactly two operands
474 void *operator new(size_t s) {
475 return User::operator new(s, 2);
477 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
478 : ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) {
482 /// Transparently provide more efficient getOperand methods.
483 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
486 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
487 /// behind the scenes to implement select constant exprs.
488 class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
489 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
491 // allocate space for exactly three operands
492 void *operator new(size_t s) {
493 return User::operator new(s, 3);
495 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
496 : ConstantExpr(C2->getType(), Instruction::Select, &Op<0>(), 3) {
501 /// Transparently provide more efficient getOperand methods.
502 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
505 /// ExtractElementConstantExpr - This class is private to
506 /// Constants.cpp, and is used behind the scenes to implement
507 /// extractelement constant exprs.
508 class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
509 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
511 // allocate space for exactly two operands
512 void *operator new(size_t s) {
513 return User::operator new(s, 2);
515 ExtractElementConstantExpr(Constant *C1, Constant *C2)
516 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(),
517 Instruction::ExtractElement, &Op<0>(), 2) {
521 /// Transparently provide more efficient getOperand methods.
522 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
525 /// InsertElementConstantExpr - This class is private to
526 /// Constants.cpp, and is used behind the scenes to implement
527 /// insertelement constant exprs.
528 class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
529 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
531 // allocate space for exactly three operands
532 void *operator new(size_t s) {
533 return User::operator new(s, 3);
535 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
536 : ConstantExpr(C1->getType(), Instruction::InsertElement,
542 /// Transparently provide more efficient getOperand methods.
543 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
546 /// ShuffleVectorConstantExpr - This class is private to
547 /// Constants.cpp, and is used behind the scenes to implement
548 /// shufflevector constant exprs.
549 class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
550 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
552 // allocate space for exactly three operands
553 void *operator new(size_t s) {
554 return User::operator new(s, 3);
556 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
557 : ConstantExpr(VectorType::get(
558 cast<VectorType>(C1->getType())->getElementType(),
559 cast<VectorType>(C3->getType())->getNumElements()),
560 Instruction::ShuffleVector,
566 /// Transparently provide more efficient getOperand methods.
567 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
570 /// ExtractValueConstantExpr - This class is private to
571 /// Constants.cpp, and is used behind the scenes to implement
572 /// extractvalue constant exprs.
573 class VISIBILITY_HIDDEN ExtractValueConstantExpr : 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, 1);
580 ExtractValueConstantExpr(Constant *Agg,
581 const SmallVector<unsigned, 4> &IdxList,
583 : ConstantExpr(DestTy, Instruction::ExtractValue, &Op<0>(), 1),
588 /// Indices - These identify which value to extract.
589 const SmallVector<unsigned, 4> Indices;
591 /// Transparently provide more efficient getOperand methods.
592 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
595 /// InsertValueConstantExpr - This class is private to
596 /// Constants.cpp, and is used behind the scenes to implement
597 /// insertvalue constant exprs.
598 class VISIBILITY_HIDDEN InsertValueConstantExpr : public ConstantExpr {
599 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
601 // allocate space for exactly one operand
602 void *operator new(size_t s) {
603 return User::operator new(s, 2);
605 InsertValueConstantExpr(Constant *Agg, Constant *Val,
606 const SmallVector<unsigned, 4> &IdxList,
608 : ConstantExpr(DestTy, Instruction::InsertValue, &Op<0>(), 2),
614 /// Indices - These identify the position for the insertion.
615 const SmallVector<unsigned, 4> Indices;
617 /// Transparently provide more efficient getOperand methods.
618 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
622 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
623 /// used behind the scenes to implement getelementpr constant exprs.
624 class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
625 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
628 static GetElementPtrConstantExpr *Create(Constant *C,
629 const std::vector<Constant*>&IdxList,
630 const Type *DestTy) {
631 return new(IdxList.size() + 1)
632 GetElementPtrConstantExpr(C, IdxList, DestTy);
634 /// Transparently provide more efficient getOperand methods.
635 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
638 // CompareConstantExpr - This class is private to Constants.cpp, and is used
639 // behind the scenes to implement ICmp and FCmp constant expressions. This is
640 // needed in order to store the predicate value for these instructions.
641 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
642 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
643 // allocate space for exactly two operands
644 void *operator new(size_t s) {
645 return User::operator new(s, 2);
647 unsigned short predicate;
648 CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
649 unsigned short pred, Constant* LHS, Constant* RHS)
650 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
654 /// Transparently provide more efficient getOperand methods.
655 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
658 } // end anonymous namespace
661 struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
663 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
666 struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
668 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
671 struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
673 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
676 struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
678 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
681 struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
683 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
686 struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
688 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
691 struct OperandTraits<ExtractValueConstantExpr> : FixedNumOperandTraits<1> {
693 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractValueConstantExpr, Value)
696 struct OperandTraits<InsertValueConstantExpr> : FixedNumOperandTraits<2> {
698 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueConstantExpr, Value)
701 struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
704 GetElementPtrConstantExpr::GetElementPtrConstantExpr
706 const std::vector<Constant*> &IdxList,
708 : ConstantExpr(DestTy, Instruction::GetElementPtr,
709 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
710 - (IdxList.size()+1),
713 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
714 OperandList[i+1] = IdxList[i];
717 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
721 struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
723 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
726 } // End llvm namespace
729 // Utility function for determining if a ConstantExpr is a CastOp or not. This
730 // can't be inline because we don't want to #include Instruction.h into
732 bool ConstantExpr::isCast() const {
733 return Instruction::isCast(getOpcode());
736 bool ConstantExpr::isCompare() const {
737 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp ||
738 getOpcode() == Instruction::VICmp || getOpcode() == Instruction::VFCmp;
741 bool ConstantExpr::hasIndices() const {
742 return getOpcode() == Instruction::ExtractValue ||
743 getOpcode() == Instruction::InsertValue;
746 const SmallVector<unsigned, 4> &ConstantExpr::getIndices() const {
747 if (const ExtractValueConstantExpr *EVCE =
748 dyn_cast<ExtractValueConstantExpr>(this))
749 return EVCE->Indices;
751 return cast<InsertValueConstantExpr>(this)->Indices;
754 /// ConstantExpr::get* - Return some common constants without having to
755 /// specify the full Instruction::OPCODE identifier.
757 Constant *ConstantExpr::getNeg(Constant *C) {
758 return get(Instruction::Sub,
759 ConstantExpr::getZeroValueForNegationExpr(C->getType()),
762 Constant *ConstantExpr::getNot(Constant *C) {
763 assert((isa<IntegerType>(C->getType()) ||
764 cast<VectorType>(C->getType())->getElementType()->isInteger()) &&
765 "Cannot NOT a nonintegral value!");
766 return get(Instruction::Xor, C,
767 Constant::getAllOnesValue(C->getType()));
769 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
770 return get(Instruction::Add, C1, C2);
772 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
773 return get(Instruction::Sub, C1, C2);
775 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
776 return get(Instruction::Mul, C1, C2);
778 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2) {
779 return get(Instruction::UDiv, C1, C2);
781 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2) {
782 return get(Instruction::SDiv, C1, C2);
784 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
785 return get(Instruction::FDiv, C1, C2);
787 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
788 return get(Instruction::URem, C1, C2);
790 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
791 return get(Instruction::SRem, C1, C2);
793 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
794 return get(Instruction::FRem, C1, C2);
796 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
797 return get(Instruction::And, C1, C2);
799 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
800 return get(Instruction::Or, C1, C2);
802 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
803 return get(Instruction::Xor, C1, C2);
805 unsigned ConstantExpr::getPredicate() const {
806 assert(getOpcode() == Instruction::FCmp ||
807 getOpcode() == Instruction::ICmp ||
808 getOpcode() == Instruction::VFCmp ||
809 getOpcode() == Instruction::VICmp);
810 return ((const CompareConstantExpr*)this)->predicate;
812 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
813 return get(Instruction::Shl, C1, C2);
815 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2) {
816 return get(Instruction::LShr, C1, C2);
818 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2) {
819 return get(Instruction::AShr, C1, C2);
822 /// getWithOperandReplaced - Return a constant expression identical to this
823 /// one, but with the specified operand set to the specified value.
825 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
826 assert(OpNo < getNumOperands() && "Operand num is out of range!");
827 assert(Op->getType() == getOperand(OpNo)->getType() &&
828 "Replacing operand with value of different type!");
829 if (getOperand(OpNo) == Op)
830 return const_cast<ConstantExpr*>(this);
832 Constant *Op0, *Op1, *Op2;
833 switch (getOpcode()) {
834 case Instruction::Trunc:
835 case Instruction::ZExt:
836 case Instruction::SExt:
837 case Instruction::FPTrunc:
838 case Instruction::FPExt:
839 case Instruction::UIToFP:
840 case Instruction::SIToFP:
841 case Instruction::FPToUI:
842 case Instruction::FPToSI:
843 case Instruction::PtrToInt:
844 case Instruction::IntToPtr:
845 case Instruction::BitCast:
846 return ConstantExpr::getCast(getOpcode(), Op, getType());
847 case Instruction::Select:
848 Op0 = (OpNo == 0) ? Op : getOperand(0);
849 Op1 = (OpNo == 1) ? Op : getOperand(1);
850 Op2 = (OpNo == 2) ? Op : getOperand(2);
851 return ConstantExpr::getSelect(Op0, Op1, Op2);
852 case Instruction::InsertElement:
853 Op0 = (OpNo == 0) ? Op : getOperand(0);
854 Op1 = (OpNo == 1) ? Op : getOperand(1);
855 Op2 = (OpNo == 2) ? Op : getOperand(2);
856 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
857 case Instruction::ExtractElement:
858 Op0 = (OpNo == 0) ? Op : getOperand(0);
859 Op1 = (OpNo == 1) ? Op : getOperand(1);
860 return ConstantExpr::getExtractElement(Op0, Op1);
861 case Instruction::ShuffleVector:
862 Op0 = (OpNo == 0) ? Op : getOperand(0);
863 Op1 = (OpNo == 1) ? Op : getOperand(1);
864 Op2 = (OpNo == 2) ? Op : getOperand(2);
865 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
866 case Instruction::GetElementPtr: {
867 SmallVector<Constant*, 8> Ops;
868 Ops.resize(getNumOperands()-1);
869 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
870 Ops[i-1] = getOperand(i);
872 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
874 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
877 assert(getNumOperands() == 2 && "Must be binary operator?");
878 Op0 = (OpNo == 0) ? Op : getOperand(0);
879 Op1 = (OpNo == 1) ? Op : getOperand(1);
880 return ConstantExpr::get(getOpcode(), Op0, Op1);
884 /// getWithOperands - This returns the current constant expression with the
885 /// operands replaced with the specified values. The specified operands must
886 /// match count and type with the existing ones.
887 Constant *ConstantExpr::
888 getWithOperands(Constant* const *Ops, unsigned NumOps) const {
889 assert(NumOps == getNumOperands() && "Operand count mismatch!");
890 bool AnyChange = false;
891 for (unsigned i = 0; i != NumOps; ++i) {
892 assert(Ops[i]->getType() == getOperand(i)->getType() &&
893 "Operand type mismatch!");
894 AnyChange |= Ops[i] != getOperand(i);
896 if (!AnyChange) // No operands changed, return self.
897 return const_cast<ConstantExpr*>(this);
899 switch (getOpcode()) {
900 case Instruction::Trunc:
901 case Instruction::ZExt:
902 case Instruction::SExt:
903 case Instruction::FPTrunc:
904 case Instruction::FPExt:
905 case Instruction::UIToFP:
906 case Instruction::SIToFP:
907 case Instruction::FPToUI:
908 case Instruction::FPToSI:
909 case Instruction::PtrToInt:
910 case Instruction::IntToPtr:
911 case Instruction::BitCast:
912 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
913 case Instruction::Select:
914 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
915 case Instruction::InsertElement:
916 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
917 case Instruction::ExtractElement:
918 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
919 case Instruction::ShuffleVector:
920 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
921 case Instruction::GetElementPtr:
922 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], NumOps-1);
923 case Instruction::ICmp:
924 case Instruction::FCmp:
925 case Instruction::VICmp:
926 case Instruction::VFCmp:
927 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
929 assert(getNumOperands() == 2 && "Must be binary operator?");
930 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
935 //===----------------------------------------------------------------------===//
936 // isValueValidForType implementations
938 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
939 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
940 if (Ty == Type::Int1Ty)
941 return Val == 0 || Val == 1;
943 return true; // always true, has to fit in largest type
944 uint64_t Max = (1ll << NumBits) - 1;
948 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
949 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
950 if (Ty == Type::Int1Ty)
951 return Val == 0 || Val == 1 || Val == -1;
953 return true; // always true, has to fit in largest type
954 int64_t Min = -(1ll << (NumBits-1));
955 int64_t Max = (1ll << (NumBits-1)) - 1;
956 return (Val >= Min && Val <= Max);
959 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
960 // convert modifies in place, so make a copy.
961 APFloat Val2 = APFloat(Val);
963 switch (Ty->getTypeID()) {
965 return false; // These can't be represented as floating point!
967 // FIXME rounding mode needs to be more flexible
968 case Type::FloatTyID: {
969 if (&Val2.getSemantics() == &APFloat::IEEEsingle)
971 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
974 case Type::DoubleTyID: {
975 if (&Val2.getSemantics() == &APFloat::IEEEsingle ||
976 &Val2.getSemantics() == &APFloat::IEEEdouble)
978 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
981 case Type::X86_FP80TyID:
982 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
983 &Val2.getSemantics() == &APFloat::IEEEdouble ||
984 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
985 case Type::FP128TyID:
986 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
987 &Val2.getSemantics() == &APFloat::IEEEdouble ||
988 &Val2.getSemantics() == &APFloat::IEEEquad;
989 case Type::PPC_FP128TyID:
990 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
991 &Val2.getSemantics() == &APFloat::IEEEdouble ||
992 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
996 //===----------------------------------------------------------------------===//
997 // Factory Function Implementation
1000 // The number of operands for each ConstantCreator::create method is
1001 // determined by the ConstantTraits template.
1002 // ConstantCreator - A class that is used to create constants by
1003 // ValueMap*. This class should be partially specialized if there is
1004 // something strange that needs to be done to interface to the ctor for the
1008 template<class ValType>
1009 struct ConstantTraits;
1011 template<typename T, typename Alloc>
1012 struct VISIBILITY_HIDDEN ConstantTraits< std::vector<T, Alloc> > {
1013 static unsigned uses(const std::vector<T, Alloc>& v) {
1018 template<class ConstantClass, class TypeClass, class ValType>
1019 struct VISIBILITY_HIDDEN ConstantCreator {
1020 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
1021 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
1025 template<class ConstantClass, class TypeClass>
1026 struct VISIBILITY_HIDDEN ConvertConstantType {
1027 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
1028 assert(0 && "This type cannot be converted!\n");
1033 template<class ValType, class TypeClass, class ConstantClass,
1034 bool HasLargeKey = false /*true for arrays and structs*/ >
1035 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
1037 typedef std::pair<const Type*, ValType> MapKey;
1038 typedef std::map<MapKey, Constant *> MapTy;
1039 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
1040 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
1042 /// Map - This is the main map from the element descriptor to the Constants.
1043 /// This is the primary way we avoid creating two of the same shape
1047 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
1048 /// from the constants to their element in Map. This is important for
1049 /// removal of constants from the array, which would otherwise have to scan
1050 /// through the map with very large keys.
1051 InverseMapTy InverseMap;
1053 /// AbstractTypeMap - Map for abstract type constants.
1055 AbstractTypeMapTy AbstractTypeMap;
1058 typename MapTy::iterator map_end() { return Map.end(); }
1060 /// InsertOrGetItem - Return an iterator for the specified element.
1061 /// If the element exists in the map, the returned iterator points to the
1062 /// entry and Exists=true. If not, the iterator points to the newly
1063 /// inserted entry and returns Exists=false. Newly inserted entries have
1064 /// I->second == 0, and should be filled in.
1065 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
1068 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
1069 Exists = !IP.second;
1074 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
1076 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
1077 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
1078 IMI->second->second == CP &&
1079 "InverseMap corrupt!");
1083 typename MapTy::iterator I =
1084 Map.find(MapKey(static_cast<const TypeClass*>(CP->getRawType()),
1086 if (I == Map.end() || I->second != CP) {
1087 // FIXME: This should not use a linear scan. If this gets to be a
1088 // performance problem, someone should look at this.
1089 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
1096 /// getOrCreate - Return the specified constant from the map, creating it if
1098 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
1099 MapKey Lookup(Ty, V);
1100 typename MapTy::iterator I = Map.find(Lookup);
1101 // Is it in the map?
1103 return static_cast<ConstantClass *>(I->second);
1105 // If no preexisting value, create one now...
1106 ConstantClass *Result =
1107 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
1109 assert(Result->getType() == Ty && "Type specified is not correct!");
1110 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
1112 if (HasLargeKey) // Remember the reverse mapping if needed.
1113 InverseMap.insert(std::make_pair(Result, I));
1115 // If the type of the constant is abstract, make sure that an entry exists
1116 // for it in the AbstractTypeMap.
1117 if (Ty->isAbstract()) {
1118 typename AbstractTypeMapTy::iterator TI = AbstractTypeMap.find(Ty);
1120 if (TI == AbstractTypeMap.end()) {
1121 // Add ourselves to the ATU list of the type.
1122 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
1124 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
1130 void remove(ConstantClass *CP) {
1131 typename MapTy::iterator I = FindExistingElement(CP);
1132 assert(I != Map.end() && "Constant not found in constant table!");
1133 assert(I->second == CP && "Didn't find correct element?");
1135 if (HasLargeKey) // Remember the reverse mapping if needed.
1136 InverseMap.erase(CP);
1138 // Now that we found the entry, make sure this isn't the entry that
1139 // the AbstractTypeMap points to.
1140 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
1141 if (Ty->isAbstract()) {
1142 assert(AbstractTypeMap.count(Ty) &&
1143 "Abstract type not in AbstractTypeMap?");
1144 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
1145 if (ATMEntryIt == I) {
1146 // Yes, we are removing the representative entry for this type.
1147 // See if there are any other entries of the same type.
1148 typename MapTy::iterator TmpIt = ATMEntryIt;
1150 // First check the entry before this one...
1151 if (TmpIt != Map.begin()) {
1153 if (TmpIt->first.first != Ty) // Not the same type, move back...
1157 // If we didn't find the same type, try to move forward...
1158 if (TmpIt == ATMEntryIt) {
1160 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
1161 --TmpIt; // No entry afterwards with the same type
1164 // If there is another entry in the map of the same abstract type,
1165 // update the AbstractTypeMap entry now.
1166 if (TmpIt != ATMEntryIt) {
1169 // Otherwise, we are removing the last instance of this type
1170 // from the table. Remove from the ATM, and from user list.
1171 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
1172 AbstractTypeMap.erase(Ty);
1181 /// MoveConstantToNewSlot - If we are about to change C to be the element
1182 /// specified by I, update our internal data structures to reflect this
1184 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
1185 // First, remove the old location of the specified constant in the map.
1186 typename MapTy::iterator OldI = FindExistingElement(C);
1187 assert(OldI != Map.end() && "Constant not found in constant table!");
1188 assert(OldI->second == C && "Didn't find correct element?");
1190 // If this constant is the representative element for its abstract type,
1191 // update the AbstractTypeMap so that the representative element is I.
1192 if (C->getType()->isAbstract()) {
1193 typename AbstractTypeMapTy::iterator ATI =
1194 AbstractTypeMap.find(C->getType());
1195 assert(ATI != AbstractTypeMap.end() &&
1196 "Abstract type not in AbstractTypeMap?");
1197 if (ATI->second == OldI)
1201 // Remove the old entry from the map.
1204 // Update the inverse map so that we know that this constant is now
1205 // located at descriptor I.
1207 assert(I->second == C && "Bad inversemap entry!");
1212 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
1213 typename AbstractTypeMapTy::iterator I =
1214 AbstractTypeMap.find(cast<Type>(OldTy));
1216 assert(I != AbstractTypeMap.end() &&
1217 "Abstract type not in AbstractTypeMap?");
1219 // Convert a constant at a time until the last one is gone. The last one
1220 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
1221 // eliminated eventually.
1223 ConvertConstantType<ConstantClass,
1224 TypeClass>::convert(
1225 static_cast<ConstantClass *>(I->second->second),
1226 cast<TypeClass>(NewTy));
1228 I = AbstractTypeMap.find(cast<Type>(OldTy));
1229 } while (I != AbstractTypeMap.end());
1232 // If the type became concrete without being refined to any other existing
1233 // type, we just remove ourselves from the ATU list.
1234 void typeBecameConcrete(const DerivedType *AbsTy) {
1235 AbsTy->removeAbstractTypeUser(this);
1239 DOUT << "Constant.cpp: ValueMap\n";
1246 //---- ConstantAggregateZero::get() implementation...
1249 // ConstantAggregateZero does not take extra "value" argument...
1250 template<class ValType>
1251 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1252 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1253 return new ConstantAggregateZero(Ty);
1258 struct ConvertConstantType<ConstantAggregateZero, Type> {
1259 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1260 // Make everyone now use a constant of the new type...
1261 Constant *New = ConstantAggregateZero::get(NewTy);
1262 assert(New != OldC && "Didn't replace constant??");
1263 OldC->uncheckedReplaceAllUsesWith(New);
1264 OldC->destroyConstant(); // This constant is now dead, destroy it.
1269 static ManagedStatic<ValueMap<char, Type,
1270 ConstantAggregateZero> > AggZeroConstants;
1272 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1274 ConstantAggregateZero *ConstantAggregateZero::get(const Type *Ty) {
1275 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1276 "Cannot create an aggregate zero of non-aggregate type!");
1277 return AggZeroConstants->getOrCreate(Ty, 0);
1280 /// destroyConstant - Remove the constant from the constant table...
1282 void ConstantAggregateZero::destroyConstant() {
1283 AggZeroConstants->remove(this);
1284 destroyConstantImpl();
1287 //---- ConstantArray::get() implementation...
1291 struct ConvertConstantType<ConstantArray, ArrayType> {
1292 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1293 // Make everyone now use a constant of the new type...
1294 std::vector<Constant*> C;
1295 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1296 C.push_back(cast<Constant>(OldC->getOperand(i)));
1297 Constant *New = ConstantArray::get(NewTy, C);
1298 assert(New != OldC && "Didn't replace constant??");
1299 OldC->uncheckedReplaceAllUsesWith(New);
1300 OldC->destroyConstant(); // This constant is now dead, destroy it.
1305 static std::vector<Constant*> getValType(ConstantArray *CA) {
1306 std::vector<Constant*> Elements;
1307 Elements.reserve(CA->getNumOperands());
1308 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1309 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1313 typedef ValueMap<std::vector<Constant*>, ArrayType,
1314 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1315 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1317 Constant *ConstantArray::get(const ArrayType *Ty,
1318 const std::vector<Constant*> &V) {
1319 // If this is an all-zero array, return a ConstantAggregateZero object
1322 if (!C->isNullValue())
1323 return ArrayConstants->getOrCreate(Ty, V);
1324 for (unsigned i = 1, e = V.size(); i != e; ++i)
1326 return ArrayConstants->getOrCreate(Ty, V);
1328 return ConstantAggregateZero::get(Ty);
1331 /// destroyConstant - Remove the constant from the constant table...
1333 void ConstantArray::destroyConstant() {
1334 ArrayConstants->remove(this);
1335 destroyConstantImpl();
1338 /// ConstantArray::get(const string&) - Return an array that is initialized to
1339 /// contain the specified string. If length is zero then a null terminator is
1340 /// added to the specified string so that it may be used in a natural way.
1341 /// Otherwise, the length parameter specifies how much of the string to use
1342 /// and it won't be null terminated.
1344 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1345 std::vector<Constant*> ElementVals;
1346 for (unsigned i = 0; i < Str.length(); ++i)
1347 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, Str[i]));
1349 // Add a null terminator to the string...
1351 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, 0));
1354 ArrayType *ATy = ArrayType::get(Type::Int8Ty, ElementVals.size());
1355 return ConstantArray::get(ATy, ElementVals);
1358 /// isString - This method returns true if the array is an array of i8, and
1359 /// if the elements of the array are all ConstantInt's.
1360 bool ConstantArray::isString() const {
1361 // Check the element type for i8...
1362 if (getType()->getElementType() != Type::Int8Ty)
1364 // Check the elements to make sure they are all integers, not constant
1366 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1367 if (!isa<ConstantInt>(getOperand(i)))
1372 /// isCString - This method returns true if the array is a string (see
1373 /// isString) and it ends in a null byte \\0 and does not contains any other
1374 /// null bytes except its terminator.
1375 bool ConstantArray::isCString() const {
1376 // Check the element type for i8...
1377 if (getType()->getElementType() != Type::Int8Ty)
1379 Constant *Zero = Constant::getNullValue(getOperand(0)->getType());
1380 // Last element must be a null.
1381 if (getOperand(getNumOperands()-1) != Zero)
1383 // Other elements must be non-null integers.
1384 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1385 if (!isa<ConstantInt>(getOperand(i)))
1387 if (getOperand(i) == Zero)
1394 /// getAsString - If the sub-element type of this array is i8
1395 /// then this method converts the array to an std::string and returns it.
1396 /// Otherwise, it asserts out.
1398 std::string ConstantArray::getAsString() const {
1399 assert(isString() && "Not a string!");
1401 Result.reserve(getNumOperands());
1402 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1403 Result.push_back((char)cast<ConstantInt>(getOperand(i))->getZExtValue());
1408 //---- ConstantStruct::get() implementation...
1413 struct ConvertConstantType<ConstantStruct, StructType> {
1414 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1415 // Make everyone now use a constant of the new type...
1416 std::vector<Constant*> C;
1417 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1418 C.push_back(cast<Constant>(OldC->getOperand(i)));
1419 Constant *New = ConstantStruct::get(NewTy, C);
1420 assert(New != OldC && "Didn't replace constant??");
1422 OldC->uncheckedReplaceAllUsesWith(New);
1423 OldC->destroyConstant(); // This constant is now dead, destroy it.
1428 typedef ValueMap<std::vector<Constant*>, StructType,
1429 ConstantStruct, true /*largekey*/> StructConstantsTy;
1430 static ManagedStatic<StructConstantsTy> StructConstants;
1432 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1433 std::vector<Constant*> Elements;
1434 Elements.reserve(CS->getNumOperands());
1435 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1436 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1440 Constant *ConstantStruct::get(const StructType *Ty,
1441 const std::vector<Constant*> &V) {
1442 // Create a ConstantAggregateZero value if all elements are zeros...
1443 for (unsigned i = 0, e = V.size(); i != e; ++i)
1444 if (!V[i]->isNullValue())
1445 return StructConstants->getOrCreate(Ty, V);
1447 return ConstantAggregateZero::get(Ty);
1450 Constant *ConstantStruct::get(const std::vector<Constant*> &V, bool packed) {
1451 std::vector<const Type*> StructEls;
1452 StructEls.reserve(V.size());
1453 for (unsigned i = 0, e = V.size(); i != e; ++i)
1454 StructEls.push_back(V[i]->getType());
1455 return get(StructType::get(StructEls, packed), V);
1458 // destroyConstant - Remove the constant from the constant table...
1460 void ConstantStruct::destroyConstant() {
1461 StructConstants->remove(this);
1462 destroyConstantImpl();
1465 //---- ConstantVector::get() implementation...
1469 struct ConvertConstantType<ConstantVector, VectorType> {
1470 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1471 // Make everyone now use a constant of the new type...
1472 std::vector<Constant*> C;
1473 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1474 C.push_back(cast<Constant>(OldC->getOperand(i)));
1475 Constant *New = ConstantVector::get(NewTy, C);
1476 assert(New != OldC && "Didn't replace constant??");
1477 OldC->uncheckedReplaceAllUsesWith(New);
1478 OldC->destroyConstant(); // This constant is now dead, destroy it.
1483 static std::vector<Constant*> getValType(ConstantVector *CP) {
1484 std::vector<Constant*> Elements;
1485 Elements.reserve(CP->getNumOperands());
1486 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1487 Elements.push_back(CP->getOperand(i));
1491 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1492 ConstantVector> > VectorConstants;
1494 Constant *ConstantVector::get(const VectorType *Ty,
1495 const std::vector<Constant*> &V) {
1496 assert(!V.empty() && "Vectors can't be empty");
1497 // If this is an all-undef or alll-zero vector, return a
1498 // ConstantAggregateZero or UndefValue.
1500 bool isZero = C->isNullValue();
1501 bool isUndef = isa<UndefValue>(C);
1503 if (isZero || isUndef) {
1504 for (unsigned i = 1, e = V.size(); i != e; ++i)
1506 isZero = isUndef = false;
1512 return ConstantAggregateZero::get(Ty);
1514 return UndefValue::get(Ty);
1515 return VectorConstants->getOrCreate(Ty, V);
1518 Constant *ConstantVector::get(const std::vector<Constant*> &V) {
1519 assert(!V.empty() && "Cannot infer type if V is empty");
1520 return get(VectorType::get(V.front()->getType(),V.size()), V);
1523 // destroyConstant - Remove the constant from the constant table...
1525 void ConstantVector::destroyConstant() {
1526 VectorConstants->remove(this);
1527 destroyConstantImpl();
1530 /// This function will return true iff every element in this vector constant
1531 /// is set to all ones.
1532 /// @returns true iff this constant's emements are all set to all ones.
1533 /// @brief Determine if the value is all ones.
1534 bool ConstantVector::isAllOnesValue() const {
1535 // Check out first element.
1536 const Constant *Elt = getOperand(0);
1537 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1538 if (!CI || !CI->isAllOnesValue()) return false;
1539 // Then make sure all remaining elements point to the same value.
1540 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1541 if (getOperand(I) != Elt) return false;
1546 /// getSplatValue - If this is a splat constant, where all of the
1547 /// elements have the same value, return that value. Otherwise return null.
1548 Constant *ConstantVector::getSplatValue() {
1549 // Check out first element.
1550 Constant *Elt = getOperand(0);
1551 // Then make sure all remaining elements point to the same value.
1552 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1553 if (getOperand(I) != Elt) return 0;
1557 //---- ConstantPointerNull::get() implementation...
1561 // ConstantPointerNull does not take extra "value" argument...
1562 template<class ValType>
1563 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1564 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1565 return new ConstantPointerNull(Ty);
1570 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1571 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1572 // Make everyone now use a constant of the new type...
1573 Constant *New = ConstantPointerNull::get(NewTy);
1574 assert(New != OldC && "Didn't replace constant??");
1575 OldC->uncheckedReplaceAllUsesWith(New);
1576 OldC->destroyConstant(); // This constant is now dead, destroy it.
1581 static ManagedStatic<ValueMap<char, PointerType,
1582 ConstantPointerNull> > NullPtrConstants;
1584 static char getValType(ConstantPointerNull *) {
1589 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1590 return NullPtrConstants->getOrCreate(Ty, 0);
1593 // destroyConstant - Remove the constant from the constant table...
1595 void ConstantPointerNull::destroyConstant() {
1596 NullPtrConstants->remove(this);
1597 destroyConstantImpl();
1601 //---- UndefValue::get() implementation...
1605 // UndefValue does not take extra "value" argument...
1606 template<class ValType>
1607 struct ConstantCreator<UndefValue, Type, ValType> {
1608 static UndefValue *create(const Type *Ty, const ValType &V) {
1609 return new UndefValue(Ty);
1614 struct ConvertConstantType<UndefValue, Type> {
1615 static void convert(UndefValue *OldC, const Type *NewTy) {
1616 // Make everyone now use a constant of the new type.
1617 Constant *New = UndefValue::get(NewTy);
1618 assert(New != OldC && "Didn't replace constant??");
1619 OldC->uncheckedReplaceAllUsesWith(New);
1620 OldC->destroyConstant(); // This constant is now dead, destroy it.
1625 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1627 static char getValType(UndefValue *) {
1632 UndefValue *UndefValue::get(const Type *Ty) {
1633 return UndefValueConstants->getOrCreate(Ty, 0);
1636 // destroyConstant - Remove the constant from the constant table.
1638 void UndefValue::destroyConstant() {
1639 UndefValueConstants->remove(this);
1640 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 if (V.opcode == Instruction::VICmp)
1724 return new CompareConstantExpr(Ty, Instruction::VICmp, V.predicate,
1725 V.operands[0], V.operands[1]);
1726 if (V.opcode == Instruction::VFCmp)
1727 return new CompareConstantExpr(Ty, Instruction::VFCmp, V.predicate,
1728 V.operands[0], V.operands[1]);
1729 assert(0 && "Invalid ConstantExpr!");
1735 struct ConvertConstantType<ConstantExpr, Type> {
1736 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1738 switch (OldC->getOpcode()) {
1739 case Instruction::Trunc:
1740 case Instruction::ZExt:
1741 case Instruction::SExt:
1742 case Instruction::FPTrunc:
1743 case Instruction::FPExt:
1744 case Instruction::UIToFP:
1745 case Instruction::SIToFP:
1746 case Instruction::FPToUI:
1747 case Instruction::FPToSI:
1748 case Instruction::PtrToInt:
1749 case Instruction::IntToPtr:
1750 case Instruction::BitCast:
1751 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1754 case Instruction::Select:
1755 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1756 OldC->getOperand(1),
1757 OldC->getOperand(2));
1760 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1761 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1762 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1763 OldC->getOperand(1));
1765 case Instruction::GetElementPtr:
1766 // Make everyone now use a constant of the new type...
1767 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1768 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1769 &Idx[0], Idx.size());
1773 assert(New != OldC && "Didn't replace constant??");
1774 OldC->uncheckedReplaceAllUsesWith(New);
1775 OldC->destroyConstant(); // This constant is now dead, destroy it.
1778 } // end namespace llvm
1781 static ExprMapKeyType getValType(ConstantExpr *CE) {
1782 std::vector<Constant*> Operands;
1783 Operands.reserve(CE->getNumOperands());
1784 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1785 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1786 return ExprMapKeyType(CE->getOpcode(), Operands,
1787 CE->isCompare() ? CE->getPredicate() : 0,
1789 CE->getIndices() : SmallVector<unsigned, 4>());
1792 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1793 ConstantExpr> > ExprConstants;
1795 /// This is a utility function to handle folding of casts and lookup of the
1796 /// cast in the ExprConstants map. It is used by the various get* methods below.
1797 static inline Constant *getFoldedCast(
1798 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1799 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1800 // Fold a few common cases
1801 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1804 // Look up the constant in the table first to ensure uniqueness
1805 std::vector<Constant*> argVec(1, C);
1806 ExprMapKeyType Key(opc, argVec);
1807 return ExprConstants->getOrCreate(Ty, Key);
1810 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1811 Instruction::CastOps opc = Instruction::CastOps(oc);
1812 assert(Instruction::isCast(opc) && "opcode out of range");
1813 assert(C && Ty && "Null arguments to getCast");
1814 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1818 assert(0 && "Invalid cast opcode");
1820 case Instruction::Trunc: return getTrunc(C, Ty);
1821 case Instruction::ZExt: return getZExt(C, Ty);
1822 case Instruction::SExt: return getSExt(C, Ty);
1823 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1824 case Instruction::FPExt: return getFPExtend(C, Ty);
1825 case Instruction::UIToFP: return getUIToFP(C, Ty);
1826 case Instruction::SIToFP: return getSIToFP(C, Ty);
1827 case Instruction::FPToUI: return getFPToUI(C, Ty);
1828 case Instruction::FPToSI: return getFPToSI(C, Ty);
1829 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1830 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1831 case Instruction::BitCast: return getBitCast(C, Ty);
1836 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1837 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1838 return getCast(Instruction::BitCast, C, Ty);
1839 return getCast(Instruction::ZExt, C, Ty);
1842 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1843 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1844 return getCast(Instruction::BitCast, C, Ty);
1845 return getCast(Instruction::SExt, C, Ty);
1848 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1849 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1850 return getCast(Instruction::BitCast, C, Ty);
1851 return getCast(Instruction::Trunc, C, Ty);
1854 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1855 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1856 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1858 if (Ty->isInteger())
1859 return getCast(Instruction::PtrToInt, S, Ty);
1860 return getCast(Instruction::BitCast, S, Ty);
1863 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1865 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1866 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1867 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1868 Instruction::CastOps opcode =
1869 (SrcBits == DstBits ? Instruction::BitCast :
1870 (SrcBits > DstBits ? Instruction::Trunc :
1871 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1872 return getCast(opcode, C, Ty);
1875 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1876 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1878 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1879 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1880 if (SrcBits == DstBits)
1881 return C; // Avoid a useless cast
1882 Instruction::CastOps opcode =
1883 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1884 return getCast(opcode, C, Ty);
1887 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1888 assert(C->getType()->isInteger() && "Trunc operand must be integer");
1889 assert(Ty->isInteger() && "Trunc produces only integral");
1890 assert(C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1891 "SrcTy must be larger than DestTy for Trunc!");
1893 return getFoldedCast(Instruction::Trunc, C, Ty);
1896 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1897 assert(C->getType()->isInteger() && "SEXt operand must be integral");
1898 assert(Ty->isInteger() && "SExt produces only integer");
1899 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1900 "SrcTy must be smaller than DestTy for SExt!");
1902 return getFoldedCast(Instruction::SExt, C, Ty);
1905 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1906 assert(C->getType()->isInteger() && "ZEXt operand must be integral");
1907 assert(Ty->isInteger() && "ZExt produces only integer");
1908 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1909 "SrcTy must be smaller than DestTy for ZExt!");
1911 return getFoldedCast(Instruction::ZExt, C, Ty);
1914 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1915 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1916 C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1917 "This is an illegal floating point truncation!");
1918 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1921 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1922 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1923 C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1924 "This is an illegal floating point extension!");
1925 return getFoldedCast(Instruction::FPExt, C, Ty);
1928 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1930 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1931 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1933 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1934 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1935 "This is an illegal uint to floating point cast!");
1936 return getFoldedCast(Instruction::UIToFP, C, Ty);
1939 Constant *ConstantExpr::getSIToFP(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()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1946 "This is an illegal sint to floating point cast!");
1947 return getFoldedCast(Instruction::SIToFP, C, Ty);
1950 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1952 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1953 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1955 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1956 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1957 "This is an illegal floating point to uint cast!");
1958 return getFoldedCast(Instruction::FPToUI, C, Ty);
1961 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1963 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1964 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1966 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1967 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1968 "This is an illegal floating point to sint cast!");
1969 return getFoldedCast(Instruction::FPToSI, C, Ty);
1972 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1973 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1974 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1975 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1978 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
1979 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
1980 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
1981 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1984 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
1985 // BitCast implies a no-op cast of type only. No bits change. However, you
1986 // can't cast pointers to anything but pointers.
1988 const Type *SrcTy = C->getType();
1989 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
1990 "BitCast cannot cast pointer to non-pointer and vice versa");
1992 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
1993 // or nonptr->ptr). For all the other types, the cast is okay if source and
1994 // destination bit widths are identical.
1995 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1996 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1998 assert(SrcBitSize == DstBitSize && "BitCast requires types of same width");
1999 return getFoldedCast(Instruction::BitCast, C, DstTy);
2002 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
2003 // sizeof is implemented as: (i64) gep (Ty*)null, 1
2004 Constant *GEPIdx = ConstantInt::get(Type::Int32Ty, 1);
2006 getGetElementPtr(getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
2007 return getCast(Instruction::PtrToInt, GEP, Type::Int64Ty);
2010 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
2011 Constant *C1, Constant *C2) {
2012 // Check the operands for consistency first
2013 assert(Opcode >= Instruction::BinaryOpsBegin &&
2014 Opcode < Instruction::BinaryOpsEnd &&
2015 "Invalid opcode in binary constant expression");
2016 assert(C1->getType() == C2->getType() &&
2017 "Operand types in binary constant expression should match");
2019 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
2020 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
2021 return FC; // Fold a few common cases...
2023 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
2024 ExprMapKeyType Key(Opcode, argVec);
2025 return ExprConstants->getOrCreate(ReqTy, Key);
2028 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
2029 Constant *C1, Constant *C2) {
2030 bool isVectorType = C1->getType()->getTypeID() == Type::VectorTyID;
2031 switch (predicate) {
2032 default: assert(0 && "Invalid CmpInst predicate");
2033 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
2034 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
2035 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
2036 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
2037 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
2038 case CmpInst::FCMP_TRUE:
2039 return isVectorType ? getVFCmp(predicate, C1, C2)
2040 : getFCmp(predicate, C1, C2);
2041 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
2042 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
2043 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
2044 case CmpInst::ICMP_SLE:
2045 return isVectorType ? getVICmp(predicate, C1, C2)
2046 : getICmp(predicate, C1, C2);
2050 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
2053 case Instruction::Add:
2054 case Instruction::Sub:
2055 case Instruction::Mul:
2056 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2057 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
2058 isa<VectorType>(C1->getType())) &&
2059 "Tried to create an arithmetic operation on a non-arithmetic type!");
2061 case Instruction::UDiv:
2062 case Instruction::SDiv:
2063 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2064 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2065 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2066 "Tried to create an arithmetic operation on a non-arithmetic type!");
2068 case Instruction::FDiv:
2069 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2070 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2071 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2072 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2074 case Instruction::URem:
2075 case Instruction::SRem:
2076 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2077 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2078 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2079 "Tried to create an arithmetic operation on a non-arithmetic type!");
2081 case Instruction::FRem:
2082 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2083 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2084 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2085 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2087 case Instruction::And:
2088 case Instruction::Or:
2089 case Instruction::Xor:
2090 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2091 assert((C1->getType()->isInteger() || isa<VectorType>(C1->getType())) &&
2092 "Tried to create a logical operation on a non-integral type!");
2094 case Instruction::Shl:
2095 case Instruction::LShr:
2096 case Instruction::AShr:
2097 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2098 assert(C1->getType()->isIntOrIntVector() &&
2099 "Tried to create a shift operation on a non-integer type!");
2106 return getTy(C1->getType(), Opcode, C1, C2);
2109 Constant *ConstantExpr::getCompare(unsigned short pred,
2110 Constant *C1, Constant *C2) {
2111 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2112 return getCompareTy(pred, C1, C2);
2115 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
2116 Constant *V1, Constant *V2) {
2117 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
2119 if (ReqTy == V1->getType())
2120 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
2121 return SC; // Fold common cases
2123 std::vector<Constant*> argVec(3, C);
2126 ExprMapKeyType Key(Instruction::Select, argVec);
2127 return ExprConstants->getOrCreate(ReqTy, Key);
2130 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
2133 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs,
2135 cast<PointerType>(ReqTy)->getElementType() &&
2136 "GEP indices invalid!");
2138 if (Constant *FC = ConstantFoldGetElementPtr(C, (Constant**)Idxs, NumIdx))
2139 return FC; // Fold a few common cases...
2141 assert(isa<PointerType>(C->getType()) &&
2142 "Non-pointer type for constant GetElementPtr expression");
2143 // Look up the constant in the table first to ensure uniqueness
2144 std::vector<Constant*> ArgVec;
2145 ArgVec.reserve(NumIdx+1);
2146 ArgVec.push_back(C);
2147 for (unsigned i = 0; i != NumIdx; ++i)
2148 ArgVec.push_back(cast<Constant>(Idxs[i]));
2149 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
2150 return ExprConstants->getOrCreate(ReqTy, Key);
2153 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
2155 // Get the result type of the getelementptr!
2157 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
2158 assert(Ty && "GEP indices invalid!");
2159 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
2160 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
2163 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
2165 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
2170 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2171 assert(LHS->getType() == RHS->getType());
2172 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2173 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2175 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2176 return FC; // Fold a few common cases...
2178 // Look up the constant in the table first to ensure uniqueness
2179 std::vector<Constant*> ArgVec;
2180 ArgVec.push_back(LHS);
2181 ArgVec.push_back(RHS);
2182 // Get the key type with both the opcode and predicate
2183 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
2184 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2188 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2189 assert(LHS->getType() == RHS->getType());
2190 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2192 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2193 return FC; // Fold a few common cases...
2195 // Look up the constant in the table first to ensure uniqueness
2196 std::vector<Constant*> ArgVec;
2197 ArgVec.push_back(LHS);
2198 ArgVec.push_back(RHS);
2199 // Get the key type with both the opcode and predicate
2200 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
2201 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2205 ConstantExpr::getVICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2206 assert(isa<VectorType>(LHS->getType()) && LHS->getType() == RHS->getType() &&
2207 "Tried to create vicmp operation on non-vector type!");
2208 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2209 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid VICmp Predicate");
2211 const VectorType *VTy = cast<VectorType>(LHS->getType());
2212 const Type *EltTy = VTy->getElementType();
2213 unsigned NumElts = VTy->getNumElements();
2215 // See if we can fold the element-wise comparison of the LHS and RHS.
2216 SmallVector<Constant *, 16> LHSElts, RHSElts;
2217 LHS->getVectorElements(LHSElts);
2218 RHS->getVectorElements(RHSElts);
2220 if (!LHSElts.empty() && !RHSElts.empty()) {
2221 SmallVector<Constant *, 16> Elts;
2222 for (unsigned i = 0; i != NumElts; ++i) {
2223 Constant *FC = ConstantFoldCompareInstruction(pred, LHSElts[i],
2225 if (ConstantInt *FCI = dyn_cast_or_null<ConstantInt>(FC)) {
2226 if (FCI->getZExtValue())
2227 Elts.push_back(ConstantInt::getAllOnesValue(EltTy));
2229 Elts.push_back(ConstantInt::get(EltTy, 0ULL));
2230 } else if (FC && isa<UndefValue>(FC)) {
2231 Elts.push_back(UndefValue::get(EltTy));
2236 if (Elts.size() == NumElts)
2237 return ConstantVector::get(&Elts[0], Elts.size());
2240 // Look up the constant in the table first to ensure uniqueness
2241 std::vector<Constant*> ArgVec;
2242 ArgVec.push_back(LHS);
2243 ArgVec.push_back(RHS);
2244 // Get the key type with both the opcode and predicate
2245 const ExprMapKeyType Key(Instruction::VICmp, ArgVec, pred);
2246 return ExprConstants->getOrCreate(LHS->getType(), Key);
2250 ConstantExpr::getVFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2251 assert(isa<VectorType>(LHS->getType()) &&
2252 "Tried to create vfcmp operation on non-vector type!");
2253 assert(LHS->getType() == RHS->getType());
2254 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid VFCmp Predicate");
2256 const VectorType *VTy = cast<VectorType>(LHS->getType());
2257 unsigned NumElts = VTy->getNumElements();
2258 const Type *EltTy = VTy->getElementType();
2259 const Type *REltTy = IntegerType::get(EltTy->getPrimitiveSizeInBits());
2260 const Type *ResultTy = VectorType::get(REltTy, NumElts);
2262 // See if we can fold the element-wise comparison of the LHS and RHS.
2263 SmallVector<Constant *, 16> LHSElts, RHSElts;
2264 LHS->getVectorElements(LHSElts);
2265 RHS->getVectorElements(RHSElts);
2267 if (!LHSElts.empty() && !RHSElts.empty()) {
2268 SmallVector<Constant *, 16> Elts;
2269 for (unsigned i = 0; i != NumElts; ++i) {
2270 Constant *FC = ConstantFoldCompareInstruction(pred, LHSElts[i],
2272 if (ConstantInt *FCI = dyn_cast_or_null<ConstantInt>(FC)) {
2273 if (FCI->getZExtValue())
2274 Elts.push_back(ConstantInt::getAllOnesValue(REltTy));
2276 Elts.push_back(ConstantInt::get(REltTy, 0ULL));
2277 } else if (FC && isa<UndefValue>(FC)) {
2278 Elts.push_back(UndefValue::get(REltTy));
2283 if (Elts.size() == NumElts)
2284 return ConstantVector::get(&Elts[0], Elts.size());
2287 // Look up the constant in the table first to ensure uniqueness
2288 std::vector<Constant*> ArgVec;
2289 ArgVec.push_back(LHS);
2290 ArgVec.push_back(RHS);
2291 // Get the key type with both the opcode and predicate
2292 const ExprMapKeyType Key(Instruction::VFCmp, ArgVec, pred);
2293 return ExprConstants->getOrCreate(ResultTy, Key);
2296 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
2298 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
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, Val);
2302 ArgVec.push_back(Idx);
2303 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
2304 return ExprConstants->getOrCreate(ReqTy, Key);
2307 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
2308 assert(isa<VectorType>(Val->getType()) &&
2309 "Tried to create extractelement operation on non-vector type!");
2310 assert(Idx->getType() == Type::Int32Ty &&
2311 "Extractelement index must be i32 type!");
2312 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
2316 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
2317 Constant *Elt, Constant *Idx) {
2318 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2319 return FC; // Fold a few common cases...
2320 // Look up the constant in the table first to ensure uniqueness
2321 std::vector<Constant*> ArgVec(1, Val);
2322 ArgVec.push_back(Elt);
2323 ArgVec.push_back(Idx);
2324 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
2325 return ExprConstants->getOrCreate(ReqTy, Key);
2328 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2330 assert(isa<VectorType>(Val->getType()) &&
2331 "Tried to create insertelement operation on non-vector type!");
2332 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
2333 && "Insertelement types must match!");
2334 assert(Idx->getType() == Type::Int32Ty &&
2335 "Insertelement index must be i32 type!");
2336 return getInsertElementTy(Val->getType(), Val, Elt, Idx);
2339 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
2340 Constant *V2, Constant *Mask) {
2341 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2342 return FC; // Fold a few common cases...
2343 // Look up the constant in the table first to ensure uniqueness
2344 std::vector<Constant*> ArgVec(1, V1);
2345 ArgVec.push_back(V2);
2346 ArgVec.push_back(Mask);
2347 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
2348 return ExprConstants->getOrCreate(ReqTy, Key);
2351 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2353 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2354 "Invalid shuffle vector constant expr operands!");
2356 unsigned NElts = cast<VectorType>(Mask->getType())->getNumElements();
2357 const Type *EltTy = cast<VectorType>(V1->getType())->getElementType();
2358 const Type *ShufTy = VectorType::get(EltTy, NElts);
2359 return getShuffleVectorTy(ShufTy, V1, V2, Mask);
2362 Constant *ConstantExpr::getInsertValueTy(const Type *ReqTy, Constant *Agg,
2364 const unsigned *Idxs, unsigned NumIdx) {
2365 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2366 Idxs+NumIdx) == Val->getType() &&
2367 "insertvalue indices invalid!");
2368 assert(Agg->getType() == ReqTy &&
2369 "insertvalue type invalid!");
2370 assert(Agg->getType()->isFirstClassType() &&
2371 "Non-first-class type for constant InsertValue expression");
2372 Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs, NumIdx);
2373 assert(FC && "InsertValue constant expr couldn't be folded!");
2377 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2378 const unsigned *IdxList, unsigned NumIdx) {
2379 assert(Agg->getType()->isFirstClassType() &&
2380 "Tried to create insertelement operation on non-first-class type!");
2382 const Type *ReqTy = Agg->getType();
2385 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2387 assert(ValTy == Val->getType() && "insertvalue indices invalid!");
2388 return getInsertValueTy(ReqTy, Agg, Val, IdxList, NumIdx);
2391 Constant *ConstantExpr::getExtractValueTy(const Type *ReqTy, Constant *Agg,
2392 const unsigned *Idxs, unsigned NumIdx) {
2393 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2394 Idxs+NumIdx) == ReqTy &&
2395 "extractvalue indices invalid!");
2396 assert(Agg->getType()->isFirstClassType() &&
2397 "Non-first-class type for constant extractvalue expression");
2398 Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs, NumIdx);
2399 assert(FC && "ExtractValue constant expr couldn't be folded!");
2403 Constant *ConstantExpr::getExtractValue(Constant *Agg,
2404 const unsigned *IdxList, unsigned NumIdx) {
2405 assert(Agg->getType()->isFirstClassType() &&
2406 "Tried to create extractelement operation on non-first-class type!");
2409 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2410 assert(ReqTy && "extractvalue indices invalid!");
2411 return getExtractValueTy(ReqTy, Agg, IdxList, NumIdx);
2414 Constant *ConstantExpr::getZeroValueForNegationExpr(const Type *Ty) {
2415 if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
2416 if (PTy->getElementType()->isFloatingPoint()) {
2417 std::vector<Constant*> zeros(PTy->getNumElements(),
2418 ConstantFP::getNegativeZero(PTy->getElementType()));
2419 return ConstantVector::get(PTy, zeros);
2422 if (Ty->isFloatingPoint())
2423 return ConstantFP::getNegativeZero(Ty);
2425 return Constant::getNullValue(Ty);
2428 // destroyConstant - Remove the constant from the constant table...
2430 void ConstantExpr::destroyConstant() {
2431 ExprConstants->remove(this);
2432 destroyConstantImpl();
2435 const char *ConstantExpr::getOpcodeName() const {
2436 return Instruction::getOpcodeName(getOpcode());
2439 //===----------------------------------------------------------------------===//
2440 // replaceUsesOfWithOnConstant implementations
2442 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2443 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2446 /// Note that we intentionally replace all uses of From with To here. Consider
2447 /// a large array that uses 'From' 1000 times. By handling this case all here,
2448 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2449 /// single invocation handles all 1000 uses. Handling them one at a time would
2450 /// work, but would be really slow because it would have to unique each updated
2452 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2454 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2455 Constant *ToC = cast<Constant>(To);
2457 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2458 Lookup.first.first = getType();
2459 Lookup.second = this;
2461 std::vector<Constant*> &Values = Lookup.first.second;
2462 Values.reserve(getNumOperands()); // Build replacement array.
2464 // Fill values with the modified operands of the constant array. Also,
2465 // compute whether this turns into an all-zeros array.
2466 bool isAllZeros = false;
2467 unsigned NumUpdated = 0;
2468 if (!ToC->isNullValue()) {
2469 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2470 Constant *Val = cast<Constant>(O->get());
2475 Values.push_back(Val);
2479 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2480 Constant *Val = cast<Constant>(O->get());
2485 Values.push_back(Val);
2486 if (isAllZeros) isAllZeros = Val->isNullValue();
2490 Constant *Replacement = 0;
2492 Replacement = ConstantAggregateZero::get(getType());
2494 // Check to see if we have this array type already.
2496 ArrayConstantsTy::MapTy::iterator I =
2497 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2500 Replacement = I->second;
2502 // Okay, the new shape doesn't exist in the system yet. Instead of
2503 // creating a new constant array, inserting it, replaceallusesof'ing the
2504 // old with the new, then deleting the old... just update the current one
2506 ArrayConstants->MoveConstantToNewSlot(this, I);
2508 // Update to the new value. Optimize for the case when we have a single
2509 // operand that we're changing, but handle bulk updates efficiently.
2510 if (NumUpdated == 1) {
2511 unsigned OperandToUpdate = U-OperandList;
2512 assert(getOperand(OperandToUpdate) == From &&
2513 "ReplaceAllUsesWith broken!");
2514 setOperand(OperandToUpdate, ToC);
2516 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2517 if (getOperand(i) == From)
2524 // Otherwise, I do need to replace this with an existing value.
2525 assert(Replacement != this && "I didn't contain From!");
2527 // Everyone using this now uses the replacement.
2528 uncheckedReplaceAllUsesWith(Replacement);
2530 // Delete the old constant!
2534 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2536 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2537 Constant *ToC = cast<Constant>(To);
2539 unsigned OperandToUpdate = U-OperandList;
2540 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2542 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2543 Lookup.first.first = getType();
2544 Lookup.second = this;
2545 std::vector<Constant*> &Values = Lookup.first.second;
2546 Values.reserve(getNumOperands()); // Build replacement struct.
2549 // Fill values with the modified operands of the constant struct. Also,
2550 // compute whether this turns into an all-zeros struct.
2551 bool isAllZeros = false;
2552 if (!ToC->isNullValue()) {
2553 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2554 Values.push_back(cast<Constant>(O->get()));
2557 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2558 Constant *Val = cast<Constant>(O->get());
2559 Values.push_back(Val);
2560 if (isAllZeros) isAllZeros = Val->isNullValue();
2563 Values[OperandToUpdate] = ToC;
2565 Constant *Replacement = 0;
2567 Replacement = ConstantAggregateZero::get(getType());
2569 // Check to see if we have this array type already.
2571 StructConstantsTy::MapTy::iterator I =
2572 StructConstants->InsertOrGetItem(Lookup, Exists);
2575 Replacement = I->second;
2577 // Okay, the new shape doesn't exist in the system yet. Instead of
2578 // creating a new constant struct, inserting it, replaceallusesof'ing the
2579 // old with the new, then deleting the old... just update the current one
2581 StructConstants->MoveConstantToNewSlot(this, I);
2583 // Update to the new value.
2584 setOperand(OperandToUpdate, ToC);
2589 assert(Replacement != this && "I didn't contain From!");
2591 // Everyone using this now uses the replacement.
2592 uncheckedReplaceAllUsesWith(Replacement);
2594 // Delete the old constant!
2598 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2600 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2602 std::vector<Constant*> Values;
2603 Values.reserve(getNumOperands()); // Build replacement array...
2604 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2605 Constant *Val = getOperand(i);
2606 if (Val == From) Val = cast<Constant>(To);
2607 Values.push_back(Val);
2610 Constant *Replacement = ConstantVector::get(getType(), Values);
2611 assert(Replacement != this && "I didn't contain From!");
2613 // Everyone using this now uses the replacement.
2614 uncheckedReplaceAllUsesWith(Replacement);
2616 // Delete the old constant!
2620 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2622 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2623 Constant *To = cast<Constant>(ToV);
2625 Constant *Replacement = 0;
2626 if (getOpcode() == Instruction::GetElementPtr) {
2627 SmallVector<Constant*, 8> Indices;
2628 Constant *Pointer = getOperand(0);
2629 Indices.reserve(getNumOperands()-1);
2630 if (Pointer == From) Pointer = To;
2632 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2633 Constant *Val = getOperand(i);
2634 if (Val == From) Val = To;
2635 Indices.push_back(Val);
2637 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2638 &Indices[0], Indices.size());
2639 } else if (getOpcode() == Instruction::ExtractValue) {
2640 Constant *Agg = getOperand(0);
2641 if (Agg == From) Agg = To;
2643 const SmallVector<unsigned, 4> &Indices = getIndices();
2644 Replacement = ConstantExpr::getExtractValue(Agg,
2645 &Indices[0], Indices.size());
2646 } else if (getOpcode() == Instruction::InsertValue) {
2647 Constant *Agg = getOperand(0);
2648 Constant *Val = getOperand(1);
2649 if (Agg == From) Agg = To;
2650 if (Val == From) Val = To;
2652 const SmallVector<unsigned, 4> &Indices = getIndices();
2653 Replacement = ConstantExpr::getInsertValue(Agg, Val,
2654 &Indices[0], Indices.size());
2655 } else if (isCast()) {
2656 assert(getOperand(0) == From && "Cast only has one use!");
2657 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2658 } else if (getOpcode() == Instruction::Select) {
2659 Constant *C1 = getOperand(0);
2660 Constant *C2 = getOperand(1);
2661 Constant *C3 = getOperand(2);
2662 if (C1 == From) C1 = To;
2663 if (C2 == From) C2 = To;
2664 if (C3 == From) C3 = To;
2665 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2666 } else if (getOpcode() == Instruction::ExtractElement) {
2667 Constant *C1 = getOperand(0);
2668 Constant *C2 = getOperand(1);
2669 if (C1 == From) C1 = To;
2670 if (C2 == From) C2 = To;
2671 Replacement = ConstantExpr::getExtractElement(C1, C2);
2672 } else if (getOpcode() == Instruction::InsertElement) {
2673 Constant *C1 = getOperand(0);
2674 Constant *C2 = getOperand(1);
2675 Constant *C3 = getOperand(1);
2676 if (C1 == From) C1 = To;
2677 if (C2 == From) C2 = To;
2678 if (C3 == From) C3 = To;
2679 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2680 } else if (getOpcode() == Instruction::ShuffleVector) {
2681 Constant *C1 = getOperand(0);
2682 Constant *C2 = getOperand(1);
2683 Constant *C3 = getOperand(2);
2684 if (C1 == From) C1 = To;
2685 if (C2 == From) C2 = To;
2686 if (C3 == From) C3 = To;
2687 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2688 } else if (isCompare()) {
2689 Constant *C1 = getOperand(0);
2690 Constant *C2 = getOperand(1);
2691 if (C1 == From) C1 = To;
2692 if (C2 == From) C2 = To;
2693 if (getOpcode() == Instruction::ICmp)
2694 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2695 else if (getOpcode() == Instruction::FCmp)
2696 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2697 else if (getOpcode() == Instruction::VICmp)
2698 Replacement = ConstantExpr::getVICmp(getPredicate(), C1, C2);
2700 assert(getOpcode() == Instruction::VFCmp);
2701 Replacement = ConstantExpr::getVFCmp(getPredicate(), C1, C2);
2703 } else if (getNumOperands() == 2) {
2704 Constant *C1 = getOperand(0);
2705 Constant *C2 = getOperand(1);
2706 if (C1 == From) C1 = To;
2707 if (C2 == From) C2 = To;
2708 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2710 assert(0 && "Unknown ConstantExpr type!");
2714 assert(Replacement != this && "I didn't contain From!");
2716 // Everyone using this now uses the replacement.
2717 uncheckedReplaceAllUsesWith(Replacement);
2719 // Delete the old constant!