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 //===----------------------------------------------------------------------===//
160 //===----------------------------------------------------------------------===//
162 ConstantInt::ConstantInt(const IntegerType *Ty, const APInt& V)
163 : Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
164 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
167 ConstantInt *ConstantInt::TheTrueVal = 0;
168 ConstantInt *ConstantInt::TheFalseVal = 0;
171 void CleanupTrueFalse(void *) {
172 ConstantInt::ResetTrueFalse();
176 static ManagedCleanup<llvm::CleanupTrueFalse> TrueFalseCleanup;
178 ConstantInt *ConstantInt::CreateTrueFalseVals(bool WhichOne) {
179 assert(TheTrueVal == 0 && TheFalseVal == 0);
180 TheTrueVal = get(Type::Int1Ty, 1);
181 TheFalseVal = get(Type::Int1Ty, 0);
183 // Ensure that llvm_shutdown nulls out TheTrueVal/TheFalseVal.
184 TrueFalseCleanup.Register();
186 return WhichOne ? TheTrueVal : TheFalseVal;
191 struct DenseMapAPIntKeyInfo {
195 KeyTy(const APInt& V, const Type* Ty) : val(V), type(Ty) {}
196 KeyTy(const KeyTy& that) : val(that.val), type(that.type) {}
197 bool operator==(const KeyTy& that) const {
198 return type == that.type && this->val == that.val;
200 bool operator!=(const KeyTy& that) const {
201 return !this->operator==(that);
204 static inline KeyTy getEmptyKey() { return KeyTy(APInt(1,0), 0); }
205 static inline KeyTy getTombstoneKey() { return KeyTy(APInt(1,1), 0); }
206 static unsigned getHashValue(const KeyTy &Key) {
207 return DenseMapInfo<void*>::getHashValue(Key.type) ^
208 Key.val.getHashValue();
210 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
213 static bool isPod() { return false; }
218 typedef DenseMap<DenseMapAPIntKeyInfo::KeyTy, ConstantInt*,
219 DenseMapAPIntKeyInfo> IntMapTy;
220 static ManagedStatic<IntMapTy> IntConstants;
222 ConstantInt *ConstantInt::get(const Type *Ty, uint64_t V, bool isSigned) {
223 const IntegerType *ITy = cast<IntegerType>(Ty);
224 return get(APInt(ITy->getBitWidth(), V, isSigned));
227 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
228 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
229 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
230 // compare APInt's of different widths, which would violate an APInt class
231 // invariant which generates an assertion.
232 ConstantInt *ConstantInt::get(const APInt& V) {
233 // Get the corresponding integer type for the bit width of the value.
234 const IntegerType *ITy = IntegerType::get(V.getBitWidth());
235 // get an existing value or the insertion position
236 DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
237 ConstantInt *&Slot = (*IntConstants)[Key];
238 // if it exists, return it.
241 // otherwise create a new one, insert it, and return it.
242 return Slot = new ConstantInt(ITy, V);
245 //===----------------------------------------------------------------------===//
247 //===----------------------------------------------------------------------===//
249 static const fltSemantics *TypeToFloatSemantics(const Type *Ty) {
250 if (Ty == Type::FloatTy)
251 return &APFloat::IEEEsingle;
252 if (Ty == Type::DoubleTy)
253 return &APFloat::IEEEdouble;
254 if (Ty == Type::X86_FP80Ty)
255 return &APFloat::x87DoubleExtended;
256 else if (Ty == Type::FP128Ty)
257 return &APFloat::IEEEquad;
259 assert(Ty == Type::PPC_FP128Ty && "Unknown FP format");
260 return &APFloat::PPCDoubleDouble;
263 ConstantFP::ConstantFP(const Type *Ty, const APFloat& V)
264 : Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
265 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
269 bool ConstantFP::isNullValue() const {
270 return Val.isZero() && !Val.isNegative();
273 ConstantFP *ConstantFP::getNegativeZero(const Type *Ty) {
274 APFloat apf = cast <ConstantFP>(Constant::getNullValue(Ty))->getValueAPF();
276 return ConstantFP::get(apf);
279 bool ConstantFP::isExactlyValue(const APFloat& V) const {
280 return Val.bitwiseIsEqual(V);
284 struct DenseMapAPFloatKeyInfo {
287 KeyTy(const APFloat& V) : val(V){}
288 KeyTy(const KeyTy& that) : val(that.val) {}
289 bool operator==(const KeyTy& that) const {
290 return this->val.bitwiseIsEqual(that.val);
292 bool operator!=(const KeyTy& that) const {
293 return !this->operator==(that);
296 static inline KeyTy getEmptyKey() {
297 return KeyTy(APFloat(APFloat::Bogus,1));
299 static inline KeyTy getTombstoneKey() {
300 return KeyTy(APFloat(APFloat::Bogus,2));
302 static unsigned getHashValue(const KeyTy &Key) {
303 return Key.val.getHashValue();
305 static bool isEqual(const KeyTy &LHS, const KeyTy &RHS) {
308 static bool isPod() { return false; }
312 //---- ConstantFP::get() implementation...
314 typedef DenseMap<DenseMapAPFloatKeyInfo::KeyTy, ConstantFP*,
315 DenseMapAPFloatKeyInfo> FPMapTy;
317 static ManagedStatic<FPMapTy> FPConstants;
319 ConstantFP *ConstantFP::get(const APFloat &V) {
320 DenseMapAPFloatKeyInfo::KeyTy Key(V);
321 ConstantFP *&Slot = (*FPConstants)[Key];
322 if (Slot) return Slot;
325 if (&V.getSemantics() == &APFloat::IEEEsingle)
327 else if (&V.getSemantics() == &APFloat::IEEEdouble)
329 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
330 Ty = Type::X86_FP80Ty;
331 else if (&V.getSemantics() == &APFloat::IEEEquad)
334 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble&&"Unknown FP format");
335 Ty = Type::PPC_FP128Ty;
338 return Slot = new ConstantFP(Ty, V);
341 /// get() - This returns a constant fp for the specified value in the
342 /// specified type. This should only be used for simple constant values like
343 /// 2.0/1.0 etc, that are known-valid both as double and as the target format.
344 ConstantFP *ConstantFP::get(const Type *Ty, double V) {
346 FV.convert(*TypeToFloatSemantics(Ty), APFloat::rmNearestTiesToEven);
350 //===----------------------------------------------------------------------===//
351 // ConstantXXX Classes
352 //===----------------------------------------------------------------------===//
355 ConstantArray::ConstantArray(const ArrayType *T,
356 const std::vector<Constant*> &V)
357 : Constant(T, ConstantArrayVal,
358 OperandTraits<ConstantArray>::op_end(this) - V.size(),
360 assert(V.size() == T->getNumElements() &&
361 "Invalid initializer vector for constant array");
362 Use *OL = OperandList;
363 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
366 assert((C->getType() == T->getElementType() ||
368 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
369 "Initializer for array element doesn't match array element type!");
375 ConstantStruct::ConstantStruct(const StructType *T,
376 const std::vector<Constant*> &V)
377 : Constant(T, ConstantStructVal,
378 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
380 assert(V.size() == T->getNumElements() &&
381 "Invalid initializer vector for constant structure");
382 Use *OL = OperandList;
383 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
386 assert((C->getType() == T->getElementType(I-V.begin()) ||
387 ((T->getElementType(I-V.begin())->isAbstract() ||
388 C->getType()->isAbstract()) &&
389 T->getElementType(I-V.begin())->getTypeID() ==
390 C->getType()->getTypeID())) &&
391 "Initializer for struct element doesn't match struct element type!");
397 ConstantVector::ConstantVector(const VectorType *T,
398 const std::vector<Constant*> &V)
399 : Constant(T, ConstantVectorVal,
400 OperandTraits<ConstantVector>::op_end(this) - V.size(),
402 Use *OL = OperandList;
403 for (std::vector<Constant*>::const_iterator I = V.begin(), E = V.end();
406 assert((C->getType() == T->getElementType() ||
408 C->getType()->getTypeID() == T->getElementType()->getTypeID())) &&
409 "Initializer for vector element doesn't match vector element type!");
416 // We declare several classes private to this file, so use an anonymous
420 /// UnaryConstantExpr - This class is private to Constants.cpp, and is used
421 /// behind the scenes to implement unary constant exprs.
422 class VISIBILITY_HIDDEN UnaryConstantExpr : public ConstantExpr {
423 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
425 // allocate space for exactly one operand
426 void *operator new(size_t s) {
427 return User::operator new(s, 1);
429 UnaryConstantExpr(unsigned Opcode, Constant *C, const Type *Ty)
430 : ConstantExpr(Ty, Opcode, &Op<0>(), 1) {
433 /// Transparently provide more efficient getOperand methods.
434 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
437 /// BinaryConstantExpr - This class is private to Constants.cpp, and is used
438 /// behind the scenes to implement binary constant exprs.
439 class VISIBILITY_HIDDEN BinaryConstantExpr : public ConstantExpr {
440 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
442 // allocate space for exactly two operands
443 void *operator new(size_t s) {
444 return User::operator new(s, 2);
446 BinaryConstantExpr(unsigned Opcode, Constant *C1, Constant *C2)
447 : ConstantExpr(C1->getType(), Opcode, &Op<0>(), 2) {
451 /// Transparently provide more efficient getOperand methods.
452 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
455 /// SelectConstantExpr - This class is private to Constants.cpp, and is used
456 /// behind the scenes to implement select constant exprs.
457 class VISIBILITY_HIDDEN SelectConstantExpr : public ConstantExpr {
458 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
460 // allocate space for exactly three operands
461 void *operator new(size_t s) {
462 return User::operator new(s, 3);
464 SelectConstantExpr(Constant *C1, Constant *C2, Constant *C3)
465 : ConstantExpr(C2->getType(), Instruction::Select, &Op<0>(), 3) {
470 /// Transparently provide more efficient getOperand methods.
471 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
474 /// ExtractElementConstantExpr - This class is private to
475 /// Constants.cpp, and is used behind the scenes to implement
476 /// extractelement constant exprs.
477 class VISIBILITY_HIDDEN ExtractElementConstantExpr : public ConstantExpr {
478 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
480 // allocate space for exactly two operands
481 void *operator new(size_t s) {
482 return User::operator new(s, 2);
484 ExtractElementConstantExpr(Constant *C1, Constant *C2)
485 : ConstantExpr(cast<VectorType>(C1->getType())->getElementType(),
486 Instruction::ExtractElement, &Op<0>(), 2) {
490 /// Transparently provide more efficient getOperand methods.
491 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
494 /// InsertElementConstantExpr - This class is private to
495 /// Constants.cpp, and is used behind the scenes to implement
496 /// insertelement constant exprs.
497 class VISIBILITY_HIDDEN InsertElementConstantExpr : public ConstantExpr {
498 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
500 // allocate space for exactly three operands
501 void *operator new(size_t s) {
502 return User::operator new(s, 3);
504 InsertElementConstantExpr(Constant *C1, Constant *C2, Constant *C3)
505 : ConstantExpr(C1->getType(), Instruction::InsertElement,
511 /// Transparently provide more efficient getOperand methods.
512 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
515 /// ShuffleVectorConstantExpr - This class is private to
516 /// Constants.cpp, and is used behind the scenes to implement
517 /// shufflevector constant exprs.
518 class VISIBILITY_HIDDEN ShuffleVectorConstantExpr : public ConstantExpr {
519 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
521 // allocate space for exactly three operands
522 void *operator new(size_t s) {
523 return User::operator new(s, 3);
525 ShuffleVectorConstantExpr(Constant *C1, Constant *C2, Constant *C3)
526 : ConstantExpr(C1->getType(), Instruction::ShuffleVector,
532 /// Transparently provide more efficient getOperand methods.
533 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
536 /// ExtractValueConstantExpr - This class is private to
537 /// Constants.cpp, and is used behind the scenes to implement
538 /// extractvalue constant exprs.
539 class VISIBILITY_HIDDEN ExtractValueConstantExpr : public ConstantExpr {
540 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
542 // allocate space for exactly one operand
543 void *operator new(size_t s) {
544 return User::operator new(s, 1);
546 ExtractValueConstantExpr(Constant *Agg,
547 const SmallVector<unsigned, 4> &IdxList,
549 : ConstantExpr(DestTy, Instruction::ExtractValue, &Op<0>(), 1),
554 /// Indices - These identify which value to extract.
555 const SmallVector<unsigned, 4> Indices;
557 /// Transparently provide more efficient getOperand methods.
558 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
561 /// InsertValueConstantExpr - This class is private to
562 /// Constants.cpp, and is used behind the scenes to implement
563 /// insertvalue constant exprs.
564 class VISIBILITY_HIDDEN InsertValueConstantExpr : public ConstantExpr {
565 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
567 // allocate space for exactly one operand
568 void *operator new(size_t s) {
569 return User::operator new(s, 2);
571 InsertValueConstantExpr(Constant *Agg, Constant *Val,
572 const SmallVector<unsigned, 4> &IdxList,
574 : ConstantExpr(DestTy, Instruction::InsertValue, &Op<0>(), 2),
580 /// Indices - These identify the position for the insertion.
581 const SmallVector<unsigned, 4> Indices;
583 /// Transparently provide more efficient getOperand methods.
584 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
588 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
589 /// used behind the scenes to implement getelementpr constant exprs.
590 class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
591 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
594 static GetElementPtrConstantExpr *Create(Constant *C,
595 const std::vector<Constant*>&IdxList,
596 const Type *DestTy) {
597 return new(IdxList.size() + 1)
598 GetElementPtrConstantExpr(C, IdxList, DestTy);
600 /// Transparently provide more efficient getOperand methods.
601 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
604 // CompareConstantExpr - This class is private to Constants.cpp, and is used
605 // behind the scenes to implement ICmp and FCmp constant expressions. This is
606 // needed in order to store the predicate value for these instructions.
607 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
608 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
609 // allocate space for exactly two operands
610 void *operator new(size_t s) {
611 return User::operator new(s, 2);
613 unsigned short predicate;
614 CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
615 unsigned short pred, Constant* LHS, Constant* RHS)
616 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
620 /// Transparently provide more efficient getOperand methods.
621 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
624 } // end anonymous namespace
627 struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
629 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
632 struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
634 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
637 struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
639 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
642 struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
644 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
647 struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
649 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
652 struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
654 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
657 struct OperandTraits<ExtractValueConstantExpr> : FixedNumOperandTraits<1> {
659 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractValueConstantExpr, Value)
662 struct OperandTraits<InsertValueConstantExpr> : FixedNumOperandTraits<2> {
664 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueConstantExpr, Value)
667 struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
670 GetElementPtrConstantExpr::GetElementPtrConstantExpr
672 const std::vector<Constant*> &IdxList,
674 : ConstantExpr(DestTy, Instruction::GetElementPtr,
675 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
676 - (IdxList.size()+1),
679 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
680 OperandList[i+1] = IdxList[i];
683 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
687 struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
689 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
692 } // End llvm namespace
695 // Utility function for determining if a ConstantExpr is a CastOp or not. This
696 // can't be inline because we don't want to #include Instruction.h into
698 bool ConstantExpr::isCast() const {
699 return Instruction::isCast(getOpcode());
702 bool ConstantExpr::isCompare() const {
703 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
706 bool ConstantExpr::hasIndices() const {
707 return getOpcode() == Instruction::ExtractValue ||
708 getOpcode() == Instruction::InsertValue;
711 const SmallVector<unsigned, 4> &ConstantExpr::getIndices() const {
712 if (const ExtractValueConstantExpr *EVCE =
713 dyn_cast<ExtractValueConstantExpr>(this))
714 return EVCE->Indices;
715 if (const InsertValueConstantExpr *IVCE =
716 dyn_cast<InsertValueConstantExpr>(this))
717 return IVCE->Indices;
718 assert(0 && "ConstantExpr does not have indices!");
721 /// ConstantExpr::get* - Return some common constants without having to
722 /// specify the full Instruction::OPCODE identifier.
724 Constant *ConstantExpr::getNeg(Constant *C) {
725 return get(Instruction::Sub,
726 ConstantExpr::getZeroValueForNegationExpr(C->getType()),
729 Constant *ConstantExpr::getNot(Constant *C) {
730 assert(isa<IntegerType>(C->getType()) && "Cannot NOT a nonintegral value!");
731 return get(Instruction::Xor, C,
732 ConstantInt::getAllOnesValue(C->getType()));
734 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
735 return get(Instruction::Add, C1, C2);
737 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
738 return get(Instruction::Sub, C1, C2);
740 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
741 return get(Instruction::Mul, C1, C2);
743 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2) {
744 return get(Instruction::UDiv, C1, C2);
746 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2) {
747 return get(Instruction::SDiv, C1, C2);
749 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
750 return get(Instruction::FDiv, C1, C2);
752 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
753 return get(Instruction::URem, C1, C2);
755 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
756 return get(Instruction::SRem, C1, C2);
758 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
759 return get(Instruction::FRem, C1, C2);
761 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
762 return get(Instruction::And, C1, C2);
764 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
765 return get(Instruction::Or, C1, C2);
767 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
768 return get(Instruction::Xor, C1, C2);
770 unsigned ConstantExpr::getPredicate() const {
771 assert(getOpcode() == Instruction::FCmp ||
772 getOpcode() == Instruction::ICmp ||
773 getOpcode() == Instruction::VFCmp ||
774 getOpcode() == Instruction::VICmp);
775 return ((const CompareConstantExpr*)this)->predicate;
777 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
778 return get(Instruction::Shl, C1, C2);
780 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2) {
781 return get(Instruction::LShr, C1, C2);
783 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2) {
784 return get(Instruction::AShr, C1, C2);
787 /// getWithOperandReplaced - Return a constant expression identical to this
788 /// one, but with the specified operand set to the specified value.
790 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
791 assert(OpNo < getNumOperands() && "Operand num is out of range!");
792 assert(Op->getType() == getOperand(OpNo)->getType() &&
793 "Replacing operand with value of different type!");
794 if (getOperand(OpNo) == Op)
795 return const_cast<ConstantExpr*>(this);
797 Constant *Op0, *Op1, *Op2;
798 switch (getOpcode()) {
799 case Instruction::Trunc:
800 case Instruction::ZExt:
801 case Instruction::SExt:
802 case Instruction::FPTrunc:
803 case Instruction::FPExt:
804 case Instruction::UIToFP:
805 case Instruction::SIToFP:
806 case Instruction::FPToUI:
807 case Instruction::FPToSI:
808 case Instruction::PtrToInt:
809 case Instruction::IntToPtr:
810 case Instruction::BitCast:
811 return ConstantExpr::getCast(getOpcode(), Op, getType());
812 case Instruction::Select:
813 Op0 = (OpNo == 0) ? Op : getOperand(0);
814 Op1 = (OpNo == 1) ? Op : getOperand(1);
815 Op2 = (OpNo == 2) ? Op : getOperand(2);
816 return ConstantExpr::getSelect(Op0, Op1, Op2);
817 case Instruction::InsertElement:
818 Op0 = (OpNo == 0) ? Op : getOperand(0);
819 Op1 = (OpNo == 1) ? Op : getOperand(1);
820 Op2 = (OpNo == 2) ? Op : getOperand(2);
821 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
822 case Instruction::ExtractElement:
823 Op0 = (OpNo == 0) ? Op : getOperand(0);
824 Op1 = (OpNo == 1) ? Op : getOperand(1);
825 return ConstantExpr::getExtractElement(Op0, Op1);
826 case Instruction::ShuffleVector:
827 Op0 = (OpNo == 0) ? Op : getOperand(0);
828 Op1 = (OpNo == 1) ? Op : getOperand(1);
829 Op2 = (OpNo == 2) ? Op : getOperand(2);
830 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
831 case Instruction::InsertValue: {
832 const SmallVector<unsigned, 4> Indices = getIndices();
833 Op0 = (OpNo == 0) ? Op : getOperand(0);
834 Op1 = (OpNo == 1) ? Op : getOperand(1);
835 return ConstantExpr::getInsertValue(Op0, Op1,
836 &Indices[0], Indices.size());
838 case Instruction::ExtractValue: {
839 assert(OpNo == 0 && "ExtractaValue has only one operand!");
840 const SmallVector<unsigned, 4> Indices = getIndices();
842 ConstantExpr::getExtractValue(Op, &Indices[0], Indices.size());
844 case Instruction::GetElementPtr: {
845 SmallVector<Constant*, 8> Ops;
846 Ops.resize(getNumOperands()-1);
847 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
848 Ops[i-1] = getOperand(i);
850 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
852 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
855 assert(getNumOperands() == 2 && "Must be binary operator?");
856 Op0 = (OpNo == 0) ? Op : getOperand(0);
857 Op1 = (OpNo == 1) ? Op : getOperand(1);
858 return ConstantExpr::get(getOpcode(), Op0, Op1);
862 /// getWithOperands - This returns the current constant expression with the
863 /// operands replaced with the specified values. The specified operands must
864 /// match count and type with the existing ones.
865 Constant *ConstantExpr::
866 getWithOperands(const std::vector<Constant*> &Ops) const {
867 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
868 bool AnyChange = false;
869 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
870 assert(Ops[i]->getType() == getOperand(i)->getType() &&
871 "Operand type mismatch!");
872 AnyChange |= Ops[i] != getOperand(i);
874 if (!AnyChange) // No operands changed, return self.
875 return const_cast<ConstantExpr*>(this);
877 switch (getOpcode()) {
878 case Instruction::Trunc:
879 case Instruction::ZExt:
880 case Instruction::SExt:
881 case Instruction::FPTrunc:
882 case Instruction::FPExt:
883 case Instruction::UIToFP:
884 case Instruction::SIToFP:
885 case Instruction::FPToUI:
886 case Instruction::FPToSI:
887 case Instruction::PtrToInt:
888 case Instruction::IntToPtr:
889 case Instruction::BitCast:
890 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
891 case Instruction::Select:
892 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
893 case Instruction::InsertElement:
894 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
895 case Instruction::ExtractElement:
896 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
897 case Instruction::ShuffleVector:
898 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
899 case Instruction::InsertValue: {
900 const SmallVector<unsigned, 4> Indices = getIndices();
901 return ConstantExpr::getInsertValue(Ops[0], Ops[1],
902 &Indices[0], Indices.size());
904 case Instruction::ExtractValue: {
905 const SmallVector<unsigned, 4> Indices = getIndices();
906 return ConstantExpr::getExtractValue(Ops[0],
907 &Indices[0], Indices.size());
909 case Instruction::GetElementPtr:
910 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], Ops.size()-1);
911 case Instruction::ICmp:
912 case Instruction::FCmp:
913 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
915 assert(getNumOperands() == 2 && "Must be binary operator?");
916 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
921 //===----------------------------------------------------------------------===//
922 // isValueValidForType implementations
924 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
925 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
926 if (Ty == Type::Int1Ty)
927 return Val == 0 || Val == 1;
929 return true; // always true, has to fit in largest type
930 uint64_t Max = (1ll << NumBits) - 1;
934 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
935 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
936 if (Ty == Type::Int1Ty)
937 return Val == 0 || Val == 1 || Val == -1;
939 return true; // always true, has to fit in largest type
940 int64_t Min = -(1ll << (NumBits-1));
941 int64_t Max = (1ll << (NumBits-1)) - 1;
942 return (Val >= Min && Val <= Max);
945 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
946 // convert modifies in place, so make a copy.
947 APFloat Val2 = APFloat(Val);
948 switch (Ty->getTypeID()) {
950 return false; // These can't be represented as floating point!
952 // FIXME rounding mode needs to be more flexible
953 case Type::FloatTyID:
954 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
955 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
957 case Type::DoubleTyID:
958 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
959 &Val2.getSemantics() == &APFloat::IEEEdouble ||
960 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
962 case Type::X86_FP80TyID:
963 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
964 &Val2.getSemantics() == &APFloat::IEEEdouble ||
965 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
966 case Type::FP128TyID:
967 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
968 &Val2.getSemantics() == &APFloat::IEEEdouble ||
969 &Val2.getSemantics() == &APFloat::IEEEquad;
970 case Type::PPC_FP128TyID:
971 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
972 &Val2.getSemantics() == &APFloat::IEEEdouble ||
973 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
977 //===----------------------------------------------------------------------===//
978 // Factory Function Implementation
981 // The number of operands for each ConstantCreator::create method is
982 // determined by the ConstantTraits template.
983 // ConstantCreator - A class that is used to create constants by
984 // ValueMap*. This class should be partially specialized if there is
985 // something strange that needs to be done to interface to the ctor for the
989 template<class ValType>
990 struct ConstantTraits;
992 template<typename T, typename Alloc>
993 struct VISIBILITY_HIDDEN ConstantTraits< std::vector<T, Alloc> > {
994 static unsigned uses(const std::vector<T, Alloc>& v) {
999 template<class ConstantClass, class TypeClass, class ValType>
1000 struct VISIBILITY_HIDDEN ConstantCreator {
1001 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
1002 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
1006 template<class ConstantClass, class TypeClass>
1007 struct VISIBILITY_HIDDEN ConvertConstantType {
1008 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
1009 assert(0 && "This type cannot be converted!\n");
1014 template<class ValType, class TypeClass, class ConstantClass,
1015 bool HasLargeKey = false /*true for arrays and structs*/ >
1016 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
1018 typedef std::pair<const Type*, ValType> MapKey;
1019 typedef std::map<MapKey, Constant *> MapTy;
1020 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
1021 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
1023 /// Map - This is the main map from the element descriptor to the Constants.
1024 /// This is the primary way we avoid creating two of the same shape
1028 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
1029 /// from the constants to their element in Map. This is important for
1030 /// removal of constants from the array, which would otherwise have to scan
1031 /// through the map with very large keys.
1032 InverseMapTy InverseMap;
1034 /// AbstractTypeMap - Map for abstract type constants.
1036 AbstractTypeMapTy AbstractTypeMap;
1039 typename MapTy::iterator map_end() { return Map.end(); }
1041 /// InsertOrGetItem - Return an iterator for the specified element.
1042 /// If the element exists in the map, the returned iterator points to the
1043 /// entry and Exists=true. If not, the iterator points to the newly
1044 /// inserted entry and returns Exists=false. Newly inserted entries have
1045 /// I->second == 0, and should be filled in.
1046 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
1049 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
1050 Exists = !IP.second;
1055 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
1057 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
1058 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
1059 IMI->second->second == CP &&
1060 "InverseMap corrupt!");
1064 typename MapTy::iterator I =
1065 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
1066 if (I == Map.end() || I->second != CP) {
1067 // FIXME: This should not use a linear scan. If this gets to be a
1068 // performance problem, someone should look at this.
1069 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
1076 /// getOrCreate - Return the specified constant from the map, creating it if
1078 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
1079 MapKey Lookup(Ty, V);
1080 typename MapTy::iterator I = Map.lower_bound(Lookup);
1081 // Is it in the map?
1082 if (I != Map.end() && I->first == Lookup)
1083 return static_cast<ConstantClass *>(I->second);
1085 // If no preexisting value, create one now...
1086 ConstantClass *Result =
1087 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
1089 /// FIXME: why does this assert fail when loading 176.gcc?
1090 //assert(Result->getType() == Ty && "Type specified is not correct!");
1091 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
1093 if (HasLargeKey) // Remember the reverse mapping if needed.
1094 InverseMap.insert(std::make_pair(Result, I));
1096 // If the type of the constant is abstract, make sure that an entry exists
1097 // for it in the AbstractTypeMap.
1098 if (Ty->isAbstract()) {
1099 typename AbstractTypeMapTy::iterator TI =
1100 AbstractTypeMap.lower_bound(Ty);
1102 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
1103 // Add ourselves to the ATU list of the type.
1104 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
1106 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
1112 void remove(ConstantClass *CP) {
1113 typename MapTy::iterator I = FindExistingElement(CP);
1114 assert(I != Map.end() && "Constant not found in constant table!");
1115 assert(I->second == CP && "Didn't find correct element?");
1117 if (HasLargeKey) // Remember the reverse mapping if needed.
1118 InverseMap.erase(CP);
1120 // Now that we found the entry, make sure this isn't the entry that
1121 // the AbstractTypeMap points to.
1122 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
1123 if (Ty->isAbstract()) {
1124 assert(AbstractTypeMap.count(Ty) &&
1125 "Abstract type not in AbstractTypeMap?");
1126 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
1127 if (ATMEntryIt == I) {
1128 // Yes, we are removing the representative entry for this type.
1129 // See if there are any other entries of the same type.
1130 typename MapTy::iterator TmpIt = ATMEntryIt;
1132 // First check the entry before this one...
1133 if (TmpIt != Map.begin()) {
1135 if (TmpIt->first.first != Ty) // Not the same type, move back...
1139 // If we didn't find the same type, try to move forward...
1140 if (TmpIt == ATMEntryIt) {
1142 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
1143 --TmpIt; // No entry afterwards with the same type
1146 // If there is another entry in the map of the same abstract type,
1147 // update the AbstractTypeMap entry now.
1148 if (TmpIt != ATMEntryIt) {
1151 // Otherwise, we are removing the last instance of this type
1152 // from the table. Remove from the ATM, and from user list.
1153 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
1154 AbstractTypeMap.erase(Ty);
1163 /// MoveConstantToNewSlot - If we are about to change C to be the element
1164 /// specified by I, update our internal data structures to reflect this
1166 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
1167 // First, remove the old location of the specified constant in the map.
1168 typename MapTy::iterator OldI = FindExistingElement(C);
1169 assert(OldI != Map.end() && "Constant not found in constant table!");
1170 assert(OldI->second == C && "Didn't find correct element?");
1172 // If this constant is the representative element for its abstract type,
1173 // update the AbstractTypeMap so that the representative element is I.
1174 if (C->getType()->isAbstract()) {
1175 typename AbstractTypeMapTy::iterator ATI =
1176 AbstractTypeMap.find(C->getType());
1177 assert(ATI != AbstractTypeMap.end() &&
1178 "Abstract type not in AbstractTypeMap?");
1179 if (ATI->second == OldI)
1183 // Remove the old entry from the map.
1186 // Update the inverse map so that we know that this constant is now
1187 // located at descriptor I.
1189 assert(I->second == C && "Bad inversemap entry!");
1194 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
1195 typename AbstractTypeMapTy::iterator I =
1196 AbstractTypeMap.find(cast<Type>(OldTy));
1198 assert(I != AbstractTypeMap.end() &&
1199 "Abstract type not in AbstractTypeMap?");
1201 // Convert a constant at a time until the last one is gone. The last one
1202 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
1203 // eliminated eventually.
1205 ConvertConstantType<ConstantClass,
1206 TypeClass>::convert(
1207 static_cast<ConstantClass *>(I->second->second),
1208 cast<TypeClass>(NewTy));
1210 I = AbstractTypeMap.find(cast<Type>(OldTy));
1211 } while (I != AbstractTypeMap.end());
1214 // If the type became concrete without being refined to any other existing
1215 // type, we just remove ourselves from the ATU list.
1216 void typeBecameConcrete(const DerivedType *AbsTy) {
1217 AbsTy->removeAbstractTypeUser(this);
1221 DOUT << "Constant.cpp: ValueMap\n";
1228 //---- ConstantAggregateZero::get() implementation...
1231 // ConstantAggregateZero does not take extra "value" argument...
1232 template<class ValType>
1233 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1234 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1235 return new ConstantAggregateZero(Ty);
1240 struct ConvertConstantType<ConstantAggregateZero, Type> {
1241 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1242 // Make everyone now use a constant of the new type...
1243 Constant *New = ConstantAggregateZero::get(NewTy);
1244 assert(New != OldC && "Didn't replace constant??");
1245 OldC->uncheckedReplaceAllUsesWith(New);
1246 OldC->destroyConstant(); // This constant is now dead, destroy it.
1251 static ManagedStatic<ValueMap<char, Type,
1252 ConstantAggregateZero> > AggZeroConstants;
1254 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1256 Constant *ConstantAggregateZero::get(const Type *Ty) {
1257 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1258 "Cannot create an aggregate zero of non-aggregate type!");
1259 return AggZeroConstants->getOrCreate(Ty, 0);
1262 // destroyConstant - Remove the constant from the constant table...
1264 void ConstantAggregateZero::destroyConstant() {
1265 AggZeroConstants->remove(this);
1266 destroyConstantImpl();
1269 //---- ConstantArray::get() implementation...
1273 struct ConvertConstantType<ConstantArray, ArrayType> {
1274 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1275 // Make everyone now use a constant of the new type...
1276 std::vector<Constant*> C;
1277 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1278 C.push_back(cast<Constant>(OldC->getOperand(i)));
1279 Constant *New = ConstantArray::get(NewTy, C);
1280 assert(New != OldC && "Didn't replace constant??");
1281 OldC->uncheckedReplaceAllUsesWith(New);
1282 OldC->destroyConstant(); // This constant is now dead, destroy it.
1287 static std::vector<Constant*> getValType(ConstantArray *CA) {
1288 std::vector<Constant*> Elements;
1289 Elements.reserve(CA->getNumOperands());
1290 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1291 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1295 typedef ValueMap<std::vector<Constant*>, ArrayType,
1296 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1297 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1299 Constant *ConstantArray::get(const ArrayType *Ty,
1300 const std::vector<Constant*> &V) {
1301 // If this is an all-zero array, return a ConstantAggregateZero object
1304 if (!C->isNullValue())
1305 return ArrayConstants->getOrCreate(Ty, V);
1306 for (unsigned i = 1, e = V.size(); i != e; ++i)
1308 return ArrayConstants->getOrCreate(Ty, V);
1310 return ConstantAggregateZero::get(Ty);
1313 // destroyConstant - Remove the constant from the constant table...
1315 void ConstantArray::destroyConstant() {
1316 ArrayConstants->remove(this);
1317 destroyConstantImpl();
1320 /// ConstantArray::get(const string&) - Return an array that is initialized to
1321 /// contain the specified string. If length is zero then a null terminator is
1322 /// added to the specified string so that it may be used in a natural way.
1323 /// Otherwise, the length parameter specifies how much of the string to use
1324 /// and it won't be null terminated.
1326 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1327 std::vector<Constant*> ElementVals;
1328 for (unsigned i = 0; i < Str.length(); ++i)
1329 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, Str[i]));
1331 // Add a null terminator to the string...
1333 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, 0));
1336 ArrayType *ATy = ArrayType::get(Type::Int8Ty, ElementVals.size());
1337 return ConstantArray::get(ATy, ElementVals);
1340 /// isString - This method returns true if the array is an array of i8, and
1341 /// if the elements of the array are all ConstantInt's.
1342 bool ConstantArray::isString() const {
1343 // Check the element type for i8...
1344 if (getType()->getElementType() != Type::Int8Ty)
1346 // Check the elements to make sure they are all integers, not constant
1348 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1349 if (!isa<ConstantInt>(getOperand(i)))
1354 /// isCString - This method returns true if the array is a string (see
1355 /// isString) and it ends in a null byte \0 and does not contains any other
1356 /// null bytes except its terminator.
1357 bool ConstantArray::isCString() const {
1358 // Check the element type for i8...
1359 if (getType()->getElementType() != Type::Int8Ty)
1361 Constant *Zero = Constant::getNullValue(getOperand(0)->getType());
1362 // Last element must be a null.
1363 if (getOperand(getNumOperands()-1) != Zero)
1365 // Other elements must be non-null integers.
1366 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1367 if (!isa<ConstantInt>(getOperand(i)))
1369 if (getOperand(i) == Zero)
1376 // getAsString - If the sub-element type of this array is i8
1377 // then this method converts the array to an std::string and returns it.
1378 // Otherwise, it asserts out.
1380 std::string ConstantArray::getAsString() const {
1381 assert(isString() && "Not a string!");
1383 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1384 Result += (char)cast<ConstantInt>(getOperand(i))->getZExtValue();
1389 //---- ConstantStruct::get() implementation...
1394 struct ConvertConstantType<ConstantStruct, StructType> {
1395 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1396 // Make everyone now use a constant of the new type...
1397 std::vector<Constant*> C;
1398 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1399 C.push_back(cast<Constant>(OldC->getOperand(i)));
1400 Constant *New = ConstantStruct::get(NewTy, C);
1401 assert(New != OldC && "Didn't replace constant??");
1403 OldC->uncheckedReplaceAllUsesWith(New);
1404 OldC->destroyConstant(); // This constant is now dead, destroy it.
1409 typedef ValueMap<std::vector<Constant*>, StructType,
1410 ConstantStruct, true /*largekey*/> StructConstantsTy;
1411 static ManagedStatic<StructConstantsTy> StructConstants;
1413 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1414 std::vector<Constant*> Elements;
1415 Elements.reserve(CS->getNumOperands());
1416 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1417 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1421 Constant *ConstantStruct::get(const StructType *Ty,
1422 const std::vector<Constant*> &V) {
1423 // Create a ConstantAggregateZero value if all elements are zeros...
1424 for (unsigned i = 0, e = V.size(); i != e; ++i)
1425 if (!V[i]->isNullValue())
1426 return StructConstants->getOrCreate(Ty, V);
1428 return ConstantAggregateZero::get(Ty);
1431 Constant *ConstantStruct::get(const std::vector<Constant*> &V, bool packed) {
1432 std::vector<const Type*> StructEls;
1433 StructEls.reserve(V.size());
1434 for (unsigned i = 0, e = V.size(); i != e; ++i)
1435 StructEls.push_back(V[i]->getType());
1436 return get(StructType::get(StructEls, packed), V);
1439 // destroyConstant - Remove the constant from the constant table...
1441 void ConstantStruct::destroyConstant() {
1442 StructConstants->remove(this);
1443 destroyConstantImpl();
1446 //---- ConstantVector::get() implementation...
1450 struct ConvertConstantType<ConstantVector, VectorType> {
1451 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1452 // Make everyone now use a constant of the new type...
1453 std::vector<Constant*> C;
1454 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1455 C.push_back(cast<Constant>(OldC->getOperand(i)));
1456 Constant *New = ConstantVector::get(NewTy, C);
1457 assert(New != OldC && "Didn't replace constant??");
1458 OldC->uncheckedReplaceAllUsesWith(New);
1459 OldC->destroyConstant(); // This constant is now dead, destroy it.
1464 static std::vector<Constant*> getValType(ConstantVector *CP) {
1465 std::vector<Constant*> Elements;
1466 Elements.reserve(CP->getNumOperands());
1467 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1468 Elements.push_back(CP->getOperand(i));
1472 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1473 ConstantVector> > VectorConstants;
1475 Constant *ConstantVector::get(const VectorType *Ty,
1476 const std::vector<Constant*> &V) {
1477 // If this is an all-zero vector, return a ConstantAggregateZero object
1480 if (!C->isNullValue())
1481 return VectorConstants->getOrCreate(Ty, V);
1482 for (unsigned i = 1, e = V.size(); i != e; ++i)
1484 return VectorConstants->getOrCreate(Ty, V);
1486 return ConstantAggregateZero::get(Ty);
1489 Constant *ConstantVector::get(const std::vector<Constant*> &V) {
1490 assert(!V.empty() && "Cannot infer type if V is empty");
1491 return get(VectorType::get(V.front()->getType(),V.size()), V);
1494 // destroyConstant - Remove the constant from the constant table...
1496 void ConstantVector::destroyConstant() {
1497 VectorConstants->remove(this);
1498 destroyConstantImpl();
1501 /// This function will return true iff every element in this vector constant
1502 /// is set to all ones.
1503 /// @returns true iff this constant's emements are all set to all ones.
1504 /// @brief Determine if the value is all ones.
1505 bool ConstantVector::isAllOnesValue() const {
1506 // Check out first element.
1507 const Constant *Elt = getOperand(0);
1508 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1509 if (!CI || !CI->isAllOnesValue()) return false;
1510 // Then make sure all remaining elements point to the same value.
1511 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1512 if (getOperand(I) != Elt) return false;
1517 /// getSplatValue - If this is a splat constant, where all of the
1518 /// elements have the same value, return that value. Otherwise return null.
1519 Constant *ConstantVector::getSplatValue() {
1520 // Check out first element.
1521 Constant *Elt = getOperand(0);
1522 // Then make sure all remaining elements point to the same value.
1523 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1524 if (getOperand(I) != Elt) return 0;
1528 //---- ConstantPointerNull::get() implementation...
1532 // ConstantPointerNull does not take extra "value" argument...
1533 template<class ValType>
1534 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1535 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1536 return new ConstantPointerNull(Ty);
1541 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1542 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1543 // Make everyone now use a constant of the new type...
1544 Constant *New = ConstantPointerNull::get(NewTy);
1545 assert(New != OldC && "Didn't replace constant??");
1546 OldC->uncheckedReplaceAllUsesWith(New);
1547 OldC->destroyConstant(); // This constant is now dead, destroy it.
1552 static ManagedStatic<ValueMap<char, PointerType,
1553 ConstantPointerNull> > NullPtrConstants;
1555 static char getValType(ConstantPointerNull *) {
1560 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1561 return NullPtrConstants->getOrCreate(Ty, 0);
1564 // destroyConstant - Remove the constant from the constant table...
1566 void ConstantPointerNull::destroyConstant() {
1567 NullPtrConstants->remove(this);
1568 destroyConstantImpl();
1572 //---- UndefValue::get() implementation...
1576 // UndefValue does not take extra "value" argument...
1577 template<class ValType>
1578 struct ConstantCreator<UndefValue, Type, ValType> {
1579 static UndefValue *create(const Type *Ty, const ValType &V) {
1580 return new UndefValue(Ty);
1585 struct ConvertConstantType<UndefValue, Type> {
1586 static void convert(UndefValue *OldC, const Type *NewTy) {
1587 // Make everyone now use a constant of the new type.
1588 Constant *New = UndefValue::get(NewTy);
1589 assert(New != OldC && "Didn't replace constant??");
1590 OldC->uncheckedReplaceAllUsesWith(New);
1591 OldC->destroyConstant(); // This constant is now dead, destroy it.
1596 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1598 static char getValType(UndefValue *) {
1603 UndefValue *UndefValue::get(const Type *Ty) {
1604 return UndefValueConstants->getOrCreate(Ty, 0);
1607 // destroyConstant - Remove the constant from the constant table.
1609 void UndefValue::destroyConstant() {
1610 UndefValueConstants->remove(this);
1611 destroyConstantImpl();
1615 //---- ConstantExpr::get() implementations...
1620 struct ExprMapKeyType {
1621 typedef SmallVector<unsigned, 4> IndexList;
1623 ExprMapKeyType(unsigned opc,
1624 const std::vector<Constant*> &ops,
1625 unsigned short pred = 0,
1626 const IndexList &inds = IndexList())
1627 : opcode(opc), predicate(pred), operands(ops), indices(inds) {}
1630 std::vector<Constant*> operands;
1632 bool operator==(const ExprMapKeyType& that) const {
1633 return this->opcode == that.opcode &&
1634 this->predicate == that.predicate &&
1635 this->operands == that.operands;
1636 this->indices == that.indices;
1638 bool operator<(const ExprMapKeyType & that) const {
1639 return this->opcode < that.opcode ||
1640 (this->opcode == that.opcode && this->predicate < that.predicate) ||
1641 (this->opcode == that.opcode && this->predicate == that.predicate &&
1642 this->operands < that.operands) ||
1643 (this->opcode == that.opcode && this->predicate == that.predicate &&
1644 this->operands == that.operands && this->indices < that.indices);
1647 bool operator!=(const ExprMapKeyType& that) const {
1648 return !(*this == that);
1656 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1657 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
1658 unsigned short pred = 0) {
1659 if (Instruction::isCast(V.opcode))
1660 return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
1661 if ((V.opcode >= Instruction::BinaryOpsBegin &&
1662 V.opcode < Instruction::BinaryOpsEnd))
1663 return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
1664 if (V.opcode == Instruction::Select)
1665 return new SelectConstantExpr(V.operands[0], V.operands[1],
1667 if (V.opcode == Instruction::ExtractElement)
1668 return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
1669 if (V.opcode == Instruction::InsertElement)
1670 return new InsertElementConstantExpr(V.operands[0], V.operands[1],
1672 if (V.opcode == Instruction::ShuffleVector)
1673 return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
1675 if (V.opcode == Instruction::InsertValue)
1676 return new InsertValueConstantExpr(V.operands[0], V.operands[1],
1678 if (V.opcode == Instruction::ExtractValue)
1679 return new ExtractValueConstantExpr(V.operands[0], V.indices, Ty);
1680 if (V.opcode == Instruction::GetElementPtr) {
1681 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1682 return GetElementPtrConstantExpr::Create(V.operands[0], IdxList, Ty);
1685 // The compare instructions are weird. We have to encode the predicate
1686 // value and it is combined with the instruction opcode by multiplying
1687 // the opcode by one hundred. We must decode this to get the predicate.
1688 if (V.opcode == Instruction::ICmp)
1689 return new CompareConstantExpr(Ty, Instruction::ICmp, V.predicate,
1690 V.operands[0], V.operands[1]);
1691 if (V.opcode == Instruction::FCmp)
1692 return new CompareConstantExpr(Ty, Instruction::FCmp, V.predicate,
1693 V.operands[0], V.operands[1]);
1694 if (V.opcode == Instruction::VICmp)
1695 return new CompareConstantExpr(Ty, Instruction::VICmp, V.predicate,
1696 V.operands[0], V.operands[1]);
1697 if (V.opcode == Instruction::VFCmp)
1698 return new CompareConstantExpr(Ty, Instruction::VFCmp, V.predicate,
1699 V.operands[0], V.operands[1]);
1700 assert(0 && "Invalid ConstantExpr!");
1706 struct ConvertConstantType<ConstantExpr, Type> {
1707 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1709 switch (OldC->getOpcode()) {
1710 case Instruction::Trunc:
1711 case Instruction::ZExt:
1712 case Instruction::SExt:
1713 case Instruction::FPTrunc:
1714 case Instruction::FPExt:
1715 case Instruction::UIToFP:
1716 case Instruction::SIToFP:
1717 case Instruction::FPToUI:
1718 case Instruction::FPToSI:
1719 case Instruction::PtrToInt:
1720 case Instruction::IntToPtr:
1721 case Instruction::BitCast:
1722 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1725 case Instruction::Select:
1726 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1727 OldC->getOperand(1),
1728 OldC->getOperand(2));
1731 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1732 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1733 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1734 OldC->getOperand(1));
1736 case Instruction::GetElementPtr:
1737 // Make everyone now use a constant of the new type...
1738 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1739 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1740 &Idx[0], Idx.size());
1744 assert(New != OldC && "Didn't replace constant??");
1745 OldC->uncheckedReplaceAllUsesWith(New);
1746 OldC->destroyConstant(); // This constant is now dead, destroy it.
1749 } // end namespace llvm
1752 static ExprMapKeyType getValType(ConstantExpr *CE) {
1753 std::vector<Constant*> Operands;
1754 Operands.reserve(CE->getNumOperands());
1755 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1756 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1757 return ExprMapKeyType(CE->getOpcode(), Operands,
1758 CE->isCompare() ? CE->getPredicate() : 0,
1760 CE->getIndices() : SmallVector<unsigned, 4>());
1763 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1764 ConstantExpr> > ExprConstants;
1766 /// This is a utility function to handle folding of casts and lookup of the
1767 /// cast in the ExprConstants map. It is used by the various get* methods below.
1768 static inline Constant *getFoldedCast(
1769 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1770 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1771 // Fold a few common cases
1772 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1775 // Look up the constant in the table first to ensure uniqueness
1776 std::vector<Constant*> argVec(1, C);
1777 ExprMapKeyType Key(opc, argVec);
1778 return ExprConstants->getOrCreate(Ty, Key);
1781 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1782 Instruction::CastOps opc = Instruction::CastOps(oc);
1783 assert(Instruction::isCast(opc) && "opcode out of range");
1784 assert(C && Ty && "Null arguments to getCast");
1785 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1789 assert(0 && "Invalid cast opcode");
1791 case Instruction::Trunc: return getTrunc(C, Ty);
1792 case Instruction::ZExt: return getZExt(C, Ty);
1793 case Instruction::SExt: return getSExt(C, Ty);
1794 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1795 case Instruction::FPExt: return getFPExtend(C, Ty);
1796 case Instruction::UIToFP: return getUIToFP(C, Ty);
1797 case Instruction::SIToFP: return getSIToFP(C, Ty);
1798 case Instruction::FPToUI: return getFPToUI(C, Ty);
1799 case Instruction::FPToSI: return getFPToSI(C, Ty);
1800 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1801 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1802 case Instruction::BitCast: return getBitCast(C, Ty);
1807 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1808 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1809 return getCast(Instruction::BitCast, C, Ty);
1810 return getCast(Instruction::ZExt, C, Ty);
1813 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1814 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1815 return getCast(Instruction::BitCast, C, Ty);
1816 return getCast(Instruction::SExt, C, Ty);
1819 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1820 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1821 return getCast(Instruction::BitCast, C, Ty);
1822 return getCast(Instruction::Trunc, C, Ty);
1825 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1826 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1827 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1829 if (Ty->isInteger())
1830 return getCast(Instruction::PtrToInt, S, Ty);
1831 return getCast(Instruction::BitCast, S, Ty);
1834 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1836 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1837 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1838 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1839 Instruction::CastOps opcode =
1840 (SrcBits == DstBits ? Instruction::BitCast :
1841 (SrcBits > DstBits ? Instruction::Trunc :
1842 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1843 return getCast(opcode, C, Ty);
1846 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1847 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1849 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1850 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1851 if (SrcBits == DstBits)
1852 return C; // Avoid a useless cast
1853 Instruction::CastOps opcode =
1854 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1855 return getCast(opcode, C, Ty);
1858 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1859 assert(C->getType()->isInteger() && "Trunc operand must be integer");
1860 assert(Ty->isInteger() && "Trunc produces only integral");
1861 assert(C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1862 "SrcTy must be larger than DestTy for Trunc!");
1864 return getFoldedCast(Instruction::Trunc, C, Ty);
1867 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1868 assert(C->getType()->isInteger() && "SEXt operand must be integral");
1869 assert(Ty->isInteger() && "SExt produces only integer");
1870 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1871 "SrcTy must be smaller than DestTy for SExt!");
1873 return getFoldedCast(Instruction::SExt, C, Ty);
1876 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1877 assert(C->getType()->isInteger() && "ZEXt operand must be integral");
1878 assert(Ty->isInteger() && "ZExt produces only integer");
1879 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1880 "SrcTy must be smaller than DestTy for ZExt!");
1882 return getFoldedCast(Instruction::ZExt, C, Ty);
1885 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1886 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1887 C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1888 "This is an illegal floating point truncation!");
1889 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1892 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1893 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1894 C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1895 "This is an illegal floating point extension!");
1896 return getFoldedCast(Instruction::FPExt, C, Ty);
1899 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1900 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1901 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1902 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1903 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1904 "This is an illegal uint to floating point cast!");
1905 return getFoldedCast(Instruction::UIToFP, C, Ty);
1908 Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
1909 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1910 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1911 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1912 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1913 "This is an illegal sint to floating point cast!");
1914 return getFoldedCast(Instruction::SIToFP, C, Ty);
1917 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1918 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1919 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1920 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1921 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1922 "This is an illegal floating point to uint cast!");
1923 return getFoldedCast(Instruction::FPToUI, C, Ty);
1926 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1927 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1928 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1929 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1930 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1931 "This is an illegal floating point to sint cast!");
1932 return getFoldedCast(Instruction::FPToSI, C, Ty);
1935 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1936 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1937 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1938 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1941 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
1942 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
1943 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
1944 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1947 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
1948 // BitCast implies a no-op cast of type only. No bits change. However, you
1949 // can't cast pointers to anything but pointers.
1950 const Type *SrcTy = C->getType();
1951 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
1952 "BitCast cannot cast pointer to non-pointer and vice versa");
1954 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
1955 // or nonptr->ptr). For all the other types, the cast is okay if source and
1956 // destination bit widths are identical.
1957 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1958 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1959 assert(SrcBitSize == DstBitSize && "BitCast requies types of same width");
1960 return getFoldedCast(Instruction::BitCast, C, DstTy);
1963 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1964 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1965 Constant *GEPIdx = ConstantInt::get(Type::Int32Ty, 1);
1967 getGetElementPtr(getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
1968 return getCast(Instruction::PtrToInt, GEP, Type::Int64Ty);
1971 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1972 Constant *C1, Constant *C2) {
1973 // Check the operands for consistency first
1974 assert(Opcode >= Instruction::BinaryOpsBegin &&
1975 Opcode < Instruction::BinaryOpsEnd &&
1976 "Invalid opcode in binary constant expression");
1977 assert(C1->getType() == C2->getType() &&
1978 "Operand types in binary constant expression should match");
1980 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
1981 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1982 return FC; // Fold a few common cases...
1984 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1985 ExprMapKeyType Key(Opcode, argVec);
1986 return ExprConstants->getOrCreate(ReqTy, Key);
1989 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
1990 Constant *C1, Constant *C2) {
1991 switch (predicate) {
1992 default: assert(0 && "Invalid CmpInst predicate");
1993 case FCmpInst::FCMP_FALSE: case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_OGT:
1994 case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OLE:
1995 case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_ORD: case FCmpInst::FCMP_UNO:
1996 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UGT: case FCmpInst::FCMP_UGE:
1997 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_ULE: case FCmpInst::FCMP_UNE:
1998 case FCmpInst::FCMP_TRUE:
1999 return getFCmp(predicate, C1, C2);
2000 case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGT:
2001 case ICmpInst::ICMP_UGE: case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE:
2002 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_SGE: case ICmpInst::ICMP_SLT:
2003 case ICmpInst::ICMP_SLE:
2004 return getICmp(predicate, C1, C2);
2008 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
2011 case Instruction::Add:
2012 case Instruction::Sub:
2013 case Instruction::Mul:
2014 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2015 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
2016 isa<VectorType>(C1->getType())) &&
2017 "Tried to create an arithmetic operation on a non-arithmetic type!");
2019 case Instruction::UDiv:
2020 case Instruction::SDiv:
2021 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2022 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2023 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2024 "Tried to create an arithmetic operation on a non-arithmetic type!");
2026 case Instruction::FDiv:
2027 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2028 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2029 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2030 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2032 case Instruction::URem:
2033 case Instruction::SRem:
2034 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2035 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2036 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2037 "Tried to create an arithmetic operation on a non-arithmetic type!");
2039 case Instruction::FRem:
2040 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2041 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2042 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2043 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2045 case Instruction::And:
2046 case Instruction::Or:
2047 case Instruction::Xor:
2048 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2049 assert((C1->getType()->isInteger() || isa<VectorType>(C1->getType())) &&
2050 "Tried to create a logical operation on a non-integral type!");
2052 case Instruction::Shl:
2053 case Instruction::LShr:
2054 case Instruction::AShr:
2055 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2056 assert(C1->getType()->isInteger() &&
2057 "Tried to create a shift operation on a non-integer type!");
2064 return getTy(C1->getType(), Opcode, C1, C2);
2067 Constant *ConstantExpr::getCompare(unsigned short pred,
2068 Constant *C1, Constant *C2) {
2069 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2070 return getCompareTy(pred, C1, C2);
2073 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
2074 Constant *V1, Constant *V2) {
2075 assert(C->getType() == Type::Int1Ty && "Select condition must be i1!");
2076 assert(V1->getType() == V2->getType() && "Select value types must match!");
2077 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
2079 if (ReqTy == V1->getType())
2080 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
2081 return SC; // Fold common cases
2083 std::vector<Constant*> argVec(3, C);
2086 ExprMapKeyType Key(Instruction::Select, argVec);
2087 return ExprConstants->getOrCreate(ReqTy, Key);
2090 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
2093 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs,
2095 cast<PointerType>(ReqTy)->getElementType() &&
2096 "GEP indices invalid!");
2098 if (Constant *FC = ConstantFoldGetElementPtr(C, (Constant**)Idxs, NumIdx))
2099 return FC; // Fold a few common cases...
2101 assert(isa<PointerType>(C->getType()) &&
2102 "Non-pointer type for constant GetElementPtr expression");
2103 // Look up the constant in the table first to ensure uniqueness
2104 std::vector<Constant*> ArgVec;
2105 ArgVec.reserve(NumIdx+1);
2106 ArgVec.push_back(C);
2107 for (unsigned i = 0; i != NumIdx; ++i)
2108 ArgVec.push_back(cast<Constant>(Idxs[i]));
2109 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
2110 return ExprConstants->getOrCreate(ReqTy, Key);
2113 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
2115 // Get the result type of the getelementptr!
2117 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
2118 assert(Ty && "GEP indices invalid!");
2119 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
2120 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
2123 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
2125 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
2130 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2131 assert(LHS->getType() == RHS->getType());
2132 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2133 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2135 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2136 return FC; // Fold a few common cases...
2138 // Look up the constant in the table first to ensure uniqueness
2139 std::vector<Constant*> ArgVec;
2140 ArgVec.push_back(LHS);
2141 ArgVec.push_back(RHS);
2142 // Get the key type with both the opcode and predicate
2143 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
2144 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2148 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2149 assert(LHS->getType() == RHS->getType());
2150 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2152 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2153 return FC; // Fold a few common cases...
2155 // Look up the constant in the table first to ensure uniqueness
2156 std::vector<Constant*> ArgVec;
2157 ArgVec.push_back(LHS);
2158 ArgVec.push_back(RHS);
2159 // Get the key type with both the opcode and predicate
2160 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
2161 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2165 ConstantExpr::getVICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2166 assert(isa<VectorType>(LHS->getType()) &&
2167 "Tried to create vicmp operation on non-vector type!");
2168 assert(LHS->getType() == RHS->getType());
2169 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2170 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid VICmp Predicate");
2172 const VectorType *VTy = cast<VectorType>(LHS->getType());
2173 const Type *EltTy = VTy->getElementType();
2174 unsigned NumElts = VTy->getNumElements();
2176 SmallVector<Constant *, 8> Elts;
2177 for (unsigned i = 0; i != NumElts; ++i) {
2178 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2179 RHS->getOperand(i));
2181 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2183 Elts.push_back(ConstantInt::getAllOnesValue(EltTy));
2185 Elts.push_back(ConstantInt::get(EltTy, 0ULL));
2188 if (Elts.size() == NumElts)
2189 return ConstantVector::get(&Elts[0], Elts.size());
2191 // Look up the constant in the table first to ensure uniqueness
2192 std::vector<Constant*> ArgVec;
2193 ArgVec.push_back(LHS);
2194 ArgVec.push_back(RHS);
2195 // Get the key type with both the opcode and predicate
2196 const ExprMapKeyType Key(Instruction::VICmp, ArgVec, pred);
2197 return ExprConstants->getOrCreate(LHS->getType(), Key);
2201 ConstantExpr::getVFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2202 assert(isa<VectorType>(LHS->getType()) &&
2203 "Tried to create vfcmp operation on non-vector type!");
2204 assert(LHS->getType() == RHS->getType());
2205 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid VFCmp Predicate");
2207 const VectorType *VTy = cast<VectorType>(LHS->getType());
2208 unsigned NumElts = VTy->getNumElements();
2209 const Type *EltTy = VTy->getElementType();
2210 const Type *REltTy = IntegerType::get(EltTy->getPrimitiveSizeInBits());
2211 const Type *ResultTy = VectorType::get(REltTy, NumElts);
2213 SmallVector<Constant *, 8> Elts;
2214 for (unsigned i = 0; i != NumElts; ++i) {
2215 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2216 RHS->getOperand(i));
2218 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2220 Elts.push_back(ConstantInt::getAllOnesValue(REltTy));
2222 Elts.push_back(ConstantInt::get(REltTy, 0ULL));
2225 if (Elts.size() == NumElts)
2226 return ConstantVector::get(&Elts[0], Elts.size());
2228 // Look up the constant in the table first to ensure uniqueness
2229 std::vector<Constant*> ArgVec;
2230 ArgVec.push_back(LHS);
2231 ArgVec.push_back(RHS);
2232 // Get the key type with both the opcode and predicate
2233 const ExprMapKeyType Key(Instruction::VFCmp, ArgVec, pred);
2234 return ExprConstants->getOrCreate(ResultTy, Key);
2237 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
2239 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
2240 return FC; // Fold a few common cases...
2241 // Look up the constant in the table first to ensure uniqueness
2242 std::vector<Constant*> ArgVec(1, Val);
2243 ArgVec.push_back(Idx);
2244 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
2245 return ExprConstants->getOrCreate(ReqTy, Key);
2248 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
2249 assert(isa<VectorType>(Val->getType()) &&
2250 "Tried to create extractelement operation on non-vector type!");
2251 assert(Idx->getType() == Type::Int32Ty &&
2252 "Extractelement index must be i32 type!");
2253 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
2257 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
2258 Constant *Elt, Constant *Idx) {
2259 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2260 return FC; // Fold a few common cases...
2261 // Look up the constant in the table first to ensure uniqueness
2262 std::vector<Constant*> ArgVec(1, Val);
2263 ArgVec.push_back(Elt);
2264 ArgVec.push_back(Idx);
2265 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
2266 return ExprConstants->getOrCreate(ReqTy, Key);
2269 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2271 assert(isa<VectorType>(Val->getType()) &&
2272 "Tried to create insertelement operation on non-vector type!");
2273 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
2274 && "Insertelement types must match!");
2275 assert(Idx->getType() == Type::Int32Ty &&
2276 "Insertelement index must be i32 type!");
2277 return getInsertElementTy(cast<VectorType>(Val->getType())->getElementType(),
2281 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
2282 Constant *V2, Constant *Mask) {
2283 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2284 return FC; // Fold a few common cases...
2285 // Look up the constant in the table first to ensure uniqueness
2286 std::vector<Constant*> ArgVec(1, V1);
2287 ArgVec.push_back(V2);
2288 ArgVec.push_back(Mask);
2289 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
2290 return ExprConstants->getOrCreate(ReqTy, Key);
2293 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2295 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2296 "Invalid shuffle vector constant expr operands!");
2297 return getShuffleVectorTy(V1->getType(), V1, V2, Mask);
2300 Constant *ConstantExpr::getInsertValueTy(const Type *ReqTy, Constant *Agg,
2302 const unsigned *Idxs, unsigned NumIdx) {
2303 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2304 Idxs+NumIdx) == Val->getType() &&
2305 "insertvalue indices invalid!");
2306 assert(Agg->getType() == ReqTy &&
2307 "insertvalue type invalid!");
2308 assert(Agg->getType()->isFirstClassType() &&
2309 "Non-first-class type for constant InsertValue expression");
2310 if (Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs, NumIdx))
2311 return FC; // Fold a few common cases...
2312 // Look up the constant in the table first to ensure uniqueness
2313 std::vector<Constant*> ArgVec;
2314 ArgVec.push_back(Agg);
2315 ArgVec.push_back(Val);
2316 SmallVector<unsigned, 4> Indices(Idxs, Idxs + NumIdx);
2317 const ExprMapKeyType Key(Instruction::InsertValue, ArgVec, 0, Indices);
2318 return ExprConstants->getOrCreate(ReqTy, Key);
2321 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2322 const unsigned *IdxList, unsigned NumIdx) {
2323 assert(Agg->getType()->isFirstClassType() &&
2324 "Tried to create insertelement operation on non-first-class type!");
2326 const Type *ReqTy = Agg->getType();
2328 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2329 assert(ValTy == Val->getType() && "insertvalue indices invalid!");
2330 return getInsertValueTy(ReqTy, Agg, Val, IdxList, NumIdx);
2333 Constant *ConstantExpr::getExtractValueTy(const Type *ReqTy, Constant *Agg,
2334 const unsigned *Idxs, unsigned NumIdx) {
2335 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2336 Idxs+NumIdx) == ReqTy &&
2337 "extractvalue indices invalid!");
2338 assert(Agg->getType()->isFirstClassType() &&
2339 "Non-first-class type for constant extractvalue expression");
2340 if (Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs, NumIdx))
2341 return FC; // Fold a few common cases...
2342 // Look up the constant in the table first to ensure uniqueness
2343 std::vector<Constant*> ArgVec;
2344 ArgVec.push_back(Agg);
2345 SmallVector<unsigned, 4> Indices(Idxs, Idxs + NumIdx);
2346 const ExprMapKeyType Key(Instruction::ExtractValue, ArgVec, 0, Indices);
2347 return ExprConstants->getOrCreate(ReqTy, Key);
2350 Constant *ConstantExpr::getExtractValue(Constant *Agg,
2351 const unsigned *IdxList, unsigned NumIdx) {
2352 assert(Agg->getType()->isFirstClassType() &&
2353 "Tried to create extractelement operation on non-first-class type!");
2356 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2357 assert(ReqTy && "extractvalue indices invalid!");
2358 return getExtractValueTy(ReqTy, Agg, IdxList, NumIdx);
2361 Constant *ConstantExpr::getZeroValueForNegationExpr(const Type *Ty) {
2362 if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
2363 if (PTy->getElementType()->isFloatingPoint()) {
2364 std::vector<Constant*> zeros(PTy->getNumElements(),
2365 ConstantFP::getNegativeZero(PTy->getElementType()));
2366 return ConstantVector::get(PTy, zeros);
2369 if (Ty->isFloatingPoint())
2370 return ConstantFP::getNegativeZero(Ty);
2372 return Constant::getNullValue(Ty);
2375 // destroyConstant - Remove the constant from the constant table...
2377 void ConstantExpr::destroyConstant() {
2378 ExprConstants->remove(this);
2379 destroyConstantImpl();
2382 const char *ConstantExpr::getOpcodeName() const {
2383 return Instruction::getOpcodeName(getOpcode());
2386 //===----------------------------------------------------------------------===//
2387 // replaceUsesOfWithOnConstant implementations
2389 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2390 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2393 /// Note that we intentionally replace all uses of From with To here. Consider
2394 /// a large array that uses 'From' 1000 times. By handling this case all here,
2395 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2396 /// single invocation handles all 1000 uses. Handling them one at a time would
2397 /// work, but would be really slow because it would have to unique each updated
2399 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2401 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2402 Constant *ToC = cast<Constant>(To);
2404 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2405 Lookup.first.first = getType();
2406 Lookup.second = this;
2408 std::vector<Constant*> &Values = Lookup.first.second;
2409 Values.reserve(getNumOperands()); // Build replacement array.
2411 // Fill values with the modified operands of the constant array. Also,
2412 // compute whether this turns into an all-zeros array.
2413 bool isAllZeros = false;
2414 unsigned NumUpdated = 0;
2415 if (!ToC->isNullValue()) {
2416 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2417 Constant *Val = cast<Constant>(O->get());
2422 Values.push_back(Val);
2426 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2427 Constant *Val = cast<Constant>(O->get());
2432 Values.push_back(Val);
2433 if (isAllZeros) isAllZeros = Val->isNullValue();
2437 Constant *Replacement = 0;
2439 Replacement = ConstantAggregateZero::get(getType());
2441 // Check to see if we have this array type already.
2443 ArrayConstantsTy::MapTy::iterator I =
2444 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2447 Replacement = I->second;
2449 // Okay, the new shape doesn't exist in the system yet. Instead of
2450 // creating a new constant array, inserting it, replaceallusesof'ing the
2451 // old with the new, then deleting the old... just update the current one
2453 ArrayConstants->MoveConstantToNewSlot(this, I);
2455 // Update to the new value. Optimize for the case when we have a single
2456 // operand that we're changing, but handle bulk updates efficiently.
2457 if (NumUpdated == 1) {
2458 unsigned OperandToUpdate = U-OperandList;
2459 assert(getOperand(OperandToUpdate) == From &&
2460 "ReplaceAllUsesWith broken!");
2461 setOperand(OperandToUpdate, ToC);
2463 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2464 if (getOperand(i) == From)
2471 // Otherwise, I do need to replace this with an existing value.
2472 assert(Replacement != this && "I didn't contain From!");
2474 // Everyone using this now uses the replacement.
2475 uncheckedReplaceAllUsesWith(Replacement);
2477 // Delete the old constant!
2481 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2483 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2484 Constant *ToC = cast<Constant>(To);
2486 unsigned OperandToUpdate = U-OperandList;
2487 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2489 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2490 Lookup.first.first = getType();
2491 Lookup.second = this;
2492 std::vector<Constant*> &Values = Lookup.first.second;
2493 Values.reserve(getNumOperands()); // Build replacement struct.
2496 // Fill values with the modified operands of the constant struct. Also,
2497 // compute whether this turns into an all-zeros struct.
2498 bool isAllZeros = false;
2499 if (!ToC->isNullValue()) {
2500 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2501 Values.push_back(cast<Constant>(O->get()));
2504 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2505 Constant *Val = cast<Constant>(O->get());
2506 Values.push_back(Val);
2507 if (isAllZeros) isAllZeros = Val->isNullValue();
2510 Values[OperandToUpdate] = ToC;
2512 Constant *Replacement = 0;
2514 Replacement = ConstantAggregateZero::get(getType());
2516 // Check to see if we have this array type already.
2518 StructConstantsTy::MapTy::iterator I =
2519 StructConstants->InsertOrGetItem(Lookup, Exists);
2522 Replacement = I->second;
2524 // Okay, the new shape doesn't exist in the system yet. Instead of
2525 // creating a new constant struct, inserting it, replaceallusesof'ing the
2526 // old with the new, then deleting the old... just update the current one
2528 StructConstants->MoveConstantToNewSlot(this, I);
2530 // Update to the new value.
2531 setOperand(OperandToUpdate, ToC);
2536 assert(Replacement != this && "I didn't contain From!");
2538 // Everyone using this now uses the replacement.
2539 uncheckedReplaceAllUsesWith(Replacement);
2541 // Delete the old constant!
2545 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2547 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2549 std::vector<Constant*> Values;
2550 Values.reserve(getNumOperands()); // Build replacement array...
2551 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2552 Constant *Val = getOperand(i);
2553 if (Val == From) Val = cast<Constant>(To);
2554 Values.push_back(Val);
2557 Constant *Replacement = ConstantVector::get(getType(), Values);
2558 assert(Replacement != this && "I didn't contain From!");
2560 // Everyone using this now uses the replacement.
2561 uncheckedReplaceAllUsesWith(Replacement);
2563 // Delete the old constant!
2567 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2569 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2570 Constant *To = cast<Constant>(ToV);
2572 Constant *Replacement = 0;
2573 if (getOpcode() == Instruction::GetElementPtr) {
2574 SmallVector<Constant*, 8> Indices;
2575 Constant *Pointer = getOperand(0);
2576 Indices.reserve(getNumOperands()-1);
2577 if (Pointer == From) Pointer = To;
2579 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2580 Constant *Val = getOperand(i);
2581 if (Val == From) Val = To;
2582 Indices.push_back(Val);
2584 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2585 &Indices[0], Indices.size());
2586 } else if (getOpcode() == Instruction::ExtractValue) {
2587 Constant *Agg = getOperand(0);
2588 if (Agg == From) Agg = To;
2590 const SmallVector<unsigned, 4> &Indices = getIndices();
2591 Replacement = ConstantExpr::getExtractValue(Agg,
2592 &Indices[0], Indices.size());
2593 } else if (getOpcode() == Instruction::InsertValue) {
2594 Constant *Agg = getOperand(0);
2595 Constant *Val = getOperand(1);
2596 if (Agg == From) Agg = To;
2597 if (Val == From) Val = To;
2599 const SmallVector<unsigned, 4> &Indices = getIndices();
2600 Replacement = ConstantExpr::getInsertValue(Agg, Val,
2601 &Indices[0], Indices.size());
2602 } else if (isCast()) {
2603 assert(getOperand(0) == From && "Cast only has one use!");
2604 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2605 } else if (getOpcode() == Instruction::Select) {
2606 Constant *C1 = getOperand(0);
2607 Constant *C2 = getOperand(1);
2608 Constant *C3 = getOperand(2);
2609 if (C1 == From) C1 = To;
2610 if (C2 == From) C2 = To;
2611 if (C3 == From) C3 = To;
2612 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2613 } else if (getOpcode() == Instruction::ExtractElement) {
2614 Constant *C1 = getOperand(0);
2615 Constant *C2 = getOperand(1);
2616 if (C1 == From) C1 = To;
2617 if (C2 == From) C2 = To;
2618 Replacement = ConstantExpr::getExtractElement(C1, C2);
2619 } else if (getOpcode() == Instruction::InsertElement) {
2620 Constant *C1 = getOperand(0);
2621 Constant *C2 = getOperand(1);
2622 Constant *C3 = getOperand(1);
2623 if (C1 == From) C1 = To;
2624 if (C2 == From) C2 = To;
2625 if (C3 == From) C3 = To;
2626 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2627 } else if (getOpcode() == Instruction::ShuffleVector) {
2628 Constant *C1 = getOperand(0);
2629 Constant *C2 = getOperand(1);
2630 Constant *C3 = getOperand(2);
2631 if (C1 == From) C1 = To;
2632 if (C2 == From) C2 = To;
2633 if (C3 == From) C3 = To;
2634 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2635 } else if (isCompare()) {
2636 Constant *C1 = getOperand(0);
2637 Constant *C2 = getOperand(1);
2638 if (C1 == From) C1 = To;
2639 if (C2 == From) C2 = To;
2640 if (getOpcode() == Instruction::ICmp)
2641 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2643 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2644 } else if (getNumOperands() == 2) {
2645 Constant *C1 = getOperand(0);
2646 Constant *C2 = getOperand(1);
2647 if (C1 == From) C1 = To;
2648 if (C2 == From) C2 = To;
2649 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2651 assert(0 && "Unknown ConstantExpr type!");
2655 assert(Replacement != this && "I didn't contain From!");
2657 // Everyone using this now uses the replacement.
2658 uncheckedReplaceAllUsesWith(Replacement);
2660 // Delete the old constant!
2665 /// getStringValue - Turn an LLVM constant pointer that eventually points to a
2666 /// global into a string value. Return an empty string if we can't do it.
2667 /// Parameter Chop determines if the result is chopped at the first null
2670 std::string Constant::getStringValue(bool Chop, unsigned Offset) {
2671 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(this)) {
2672 if (GV->hasInitializer() && isa<ConstantArray>(GV->getInitializer())) {
2673 ConstantArray *Init = cast<ConstantArray>(GV->getInitializer());
2674 if (Init->isString()) {
2675 std::string Result = Init->getAsString();
2676 if (Offset < Result.size()) {
2677 // If we are pointing INTO The string, erase the beginning...
2678 Result.erase(Result.begin(), Result.begin()+Offset);
2680 // Take off the null terminator, and any string fragments after it.
2682 std::string::size_type NullPos = Result.find_first_of((char)0);
2683 if (NullPos != std::string::npos)
2684 Result.erase(Result.begin()+NullPos, Result.end());
2690 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(this)) {
2691 if (CE->getOpcode() == Instruction::GetElementPtr) {
2692 // Turn a gep into the specified offset.
2693 if (CE->getNumOperands() == 3 &&
2694 cast<Constant>(CE->getOperand(1))->isNullValue() &&
2695 isa<ConstantInt>(CE->getOperand(2))) {
2696 Offset += cast<ConstantInt>(CE->getOperand(2))->getZExtValue();
2697 return CE->getOperand(0)->getStringValue(Chop, Offset);