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) {
448 Op<0>().init(C1, this);
449 Op<1>().init(C2, this);
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) {
466 Op<0>().init(C1, this);
467 Op<1>().init(C2, this);
468 Op<2>().init(C3, this);
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) {
487 Op<0>().init(C1, this);
488 Op<1>().init(C2, this);
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,
507 Op<0>().init(C1, this);
508 Op<1>().init(C2, this);
509 Op<2>().init(C3, this);
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,
528 Op<0>().init(C1, this);
529 Op<1>().init(C2, this);
530 Op<2>().init(C3, this);
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 ExtractValueConstantExpr(Constant *Agg, const std::vector<Constant*> &IdxList,
543 static ExtractValueConstantExpr *Create(Constant *Agg,
544 const std::vector<Constant*> &IdxList,
545 const Type *DestTy) {
547 new(IdxList.size() + 1) ExtractValueConstantExpr(Agg, IdxList, DestTy);
549 /// Transparently provide more efficient getOperand methods.
550 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
553 /// InsertValueConstantExpr - This class is private to
554 /// Constants.cpp, and is used behind the scenes to implement
555 /// insertvalue constant exprs.
556 class VISIBILITY_HIDDEN InsertValueConstantExpr : public ConstantExpr {
557 InsertValueConstantExpr(Constant *Agg, Constant *Val,
558 const std::vector<Constant*> &IdxList,
561 static InsertValueConstantExpr *Create(Constant *Agg, Constant *Val,
562 const std::vector<Constant*> &IdxList,
563 const Type *DestTy) {
565 new(IdxList.size() + 2) InsertValueConstantExpr(Agg, Val,
568 /// Transparently provide more efficient getOperand methods.
569 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
573 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
574 /// used behind the scenes to implement getelementpr constant exprs.
575 class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
576 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
579 static GetElementPtrConstantExpr *Create(Constant *C,
580 const std::vector<Constant*>&IdxList,
581 const Type *DestTy) {
582 return new(IdxList.size() + 1)
583 GetElementPtrConstantExpr(C, IdxList, DestTy);
585 /// Transparently provide more efficient getOperand methods.
586 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
589 // CompareConstantExpr - This class is private to Constants.cpp, and is used
590 // behind the scenes to implement ICmp and FCmp constant expressions. This is
591 // needed in order to store the predicate value for these instructions.
592 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
593 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
594 // allocate space for exactly two operands
595 void *operator new(size_t s) {
596 return User::operator new(s, 2);
598 unsigned short predicate;
599 CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
600 unsigned short pred, Constant* LHS, Constant* RHS)
601 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
602 Op<0>().init(LHS, this);
603 Op<1>().init(RHS, this);
605 /// Transparently provide more efficient getOperand methods.
606 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
609 } // end anonymous namespace
612 struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
614 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
617 struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
619 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
622 struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
624 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
627 struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
629 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
632 struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
634 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
637 struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
639 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
642 struct OperandTraits<ExtractValueConstantExpr> : VariadicOperandTraits<1> {
645 ExtractValueConstantExpr::ExtractValueConstantExpr
647 const std::vector<Constant*> &IdxList,
649 : ConstantExpr(DestTy, Instruction::ExtractValue,
650 OperandTraits<ExtractValueConstantExpr>::op_end(this)
651 - (IdxList.size()+1),
653 OperandList[0].init(Agg, this);
654 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
655 OperandList[i+1].init(IdxList[i], this);
658 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractValueConstantExpr, Value)
661 struct OperandTraits<InsertValueConstantExpr> : VariadicOperandTraits<2> {
664 InsertValueConstantExpr::InsertValueConstantExpr
665 (Constant *Agg, Constant *Val,
666 const std::vector<Constant*> &IdxList,
668 : ConstantExpr(DestTy, Instruction::InsertValue,
669 OperandTraits<InsertValueConstantExpr>::op_end(this)
670 - (IdxList.size()+2),
672 OperandList[0].init(Agg, this);
673 OperandList[1].init(Val, this);
674 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
675 OperandList[i+2].init(IdxList[i], this);
678 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueConstantExpr, Value)
682 struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
685 GetElementPtrConstantExpr::GetElementPtrConstantExpr
687 const std::vector<Constant*> &IdxList,
689 : ConstantExpr(DestTy, Instruction::GetElementPtr,
690 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
691 - (IdxList.size()+1),
693 OperandList[0].init(C, this);
694 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
695 OperandList[i+1].init(IdxList[i], this);
698 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
702 struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
704 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
707 } // End llvm namespace
710 // Utility function for determining if a ConstantExpr is a CastOp or not. This
711 // can't be inline because we don't want to #include Instruction.h into
713 bool ConstantExpr::isCast() const {
714 return Instruction::isCast(getOpcode());
717 bool ConstantExpr::isCompare() const {
718 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
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 SmallVector<Constant*, 8> Ops;
833 Ops.resize(getNumOperands()-2);
834 for (unsigned i = 2, e = getNumOperands(); i != e; ++i)
835 Ops[i-2] = getOperand(i);
837 return ConstantExpr::getInsertValue(Op, getOperand(1),
838 &Ops[0], Ops.size());
840 return ConstantExpr::getInsertValue(getOperand(0), Op,
841 &Ops[0], Ops.size());
843 return ConstantExpr::getInsertValue(getOperand(0), getOperand(1),
844 &Ops[0], Ops.size());
846 case Instruction::ExtractValue: {
847 SmallVector<Constant*, 8> Ops;
848 Ops.resize(getNumOperands()-1);
849 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
850 Ops[i-1] = getOperand(i);
852 return ConstantExpr::getExtractValue(Op, &Ops[0], Ops.size());
854 return ConstantExpr::getExtractValue(getOperand(0), &Ops[0], Ops.size());
856 case Instruction::GetElementPtr: {
857 SmallVector<Constant*, 8> Ops;
858 Ops.resize(getNumOperands()-1);
859 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
860 Ops[i-1] = getOperand(i);
862 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
864 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
867 assert(getNumOperands() == 2 && "Must be binary operator?");
868 Op0 = (OpNo == 0) ? Op : getOperand(0);
869 Op1 = (OpNo == 1) ? Op : getOperand(1);
870 return ConstantExpr::get(getOpcode(), Op0, Op1);
874 /// getWithOperands - This returns the current constant expression with the
875 /// operands replaced with the specified values. The specified operands must
876 /// match count and type with the existing ones.
877 Constant *ConstantExpr::
878 getWithOperands(const std::vector<Constant*> &Ops) const {
879 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
880 bool AnyChange = false;
881 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
882 assert(Ops[i]->getType() == getOperand(i)->getType() &&
883 "Operand type mismatch!");
884 AnyChange |= Ops[i] != getOperand(i);
886 if (!AnyChange) // No operands changed, return self.
887 return const_cast<ConstantExpr*>(this);
889 switch (getOpcode()) {
890 case Instruction::Trunc:
891 case Instruction::ZExt:
892 case Instruction::SExt:
893 case Instruction::FPTrunc:
894 case Instruction::FPExt:
895 case Instruction::UIToFP:
896 case Instruction::SIToFP:
897 case Instruction::FPToUI:
898 case Instruction::FPToSI:
899 case Instruction::PtrToInt:
900 case Instruction::IntToPtr:
901 case Instruction::BitCast:
902 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
903 case Instruction::Select:
904 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
905 case Instruction::InsertElement:
906 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
907 case Instruction::ExtractElement:
908 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
909 case Instruction::ShuffleVector:
910 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
911 case Instruction::InsertValue:
912 return ConstantExpr::getInsertValue(Ops[0], Ops[1], &Ops[2], Ops.size()-2);
913 case Instruction::ExtractValue:
914 return ConstantExpr::getExtractValue(Ops[0], &Ops[1], Ops.size()-1);
915 case Instruction::GetElementPtr:
916 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], Ops.size()-1);
917 case Instruction::ICmp:
918 case Instruction::FCmp:
919 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
921 assert(getNumOperands() == 2 && "Must be binary operator?");
922 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
927 //===----------------------------------------------------------------------===//
928 // isValueValidForType implementations
930 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
931 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
932 if (Ty == Type::Int1Ty)
933 return Val == 0 || Val == 1;
935 return true; // always true, has to fit in largest type
936 uint64_t Max = (1ll << NumBits) - 1;
940 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
941 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
942 if (Ty == Type::Int1Ty)
943 return Val == 0 || Val == 1 || Val == -1;
945 return true; // always true, has to fit in largest type
946 int64_t Min = -(1ll << (NumBits-1));
947 int64_t Max = (1ll << (NumBits-1)) - 1;
948 return (Val >= Min && Val <= Max);
951 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
952 // convert modifies in place, so make a copy.
953 APFloat Val2 = APFloat(Val);
954 switch (Ty->getTypeID()) {
956 return false; // These can't be represented as floating point!
958 // FIXME rounding mode needs to be more flexible
959 case Type::FloatTyID:
960 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
961 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
963 case Type::DoubleTyID:
964 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
965 &Val2.getSemantics() == &APFloat::IEEEdouble ||
966 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
968 case Type::X86_FP80TyID:
969 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
970 &Val2.getSemantics() == &APFloat::IEEEdouble ||
971 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
972 case Type::FP128TyID:
973 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
974 &Val2.getSemantics() == &APFloat::IEEEdouble ||
975 &Val2.getSemantics() == &APFloat::IEEEquad;
976 case Type::PPC_FP128TyID:
977 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
978 &Val2.getSemantics() == &APFloat::IEEEdouble ||
979 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
983 //===----------------------------------------------------------------------===//
984 // Factory Function Implementation
987 // The number of operands for each ConstantCreator::create method is
988 // determined by the ConstantTraits template.
989 // ConstantCreator - A class that is used to create constants by
990 // ValueMap*. This class should be partially specialized if there is
991 // something strange that needs to be done to interface to the ctor for the
995 template<class ValType>
996 struct ConstantTraits;
998 template<typename T, typename Alloc>
999 struct VISIBILITY_HIDDEN ConstantTraits< std::vector<T, Alloc> > {
1000 static unsigned uses(const std::vector<T, Alloc>& v) {
1005 template<class ConstantClass, class TypeClass, class ValType>
1006 struct VISIBILITY_HIDDEN ConstantCreator {
1007 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
1008 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
1012 template<class ConstantClass, class TypeClass>
1013 struct VISIBILITY_HIDDEN ConvertConstantType {
1014 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
1015 assert(0 && "This type cannot be converted!\n");
1020 template<class ValType, class TypeClass, class ConstantClass,
1021 bool HasLargeKey = false /*true for arrays and structs*/ >
1022 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
1024 typedef std::pair<const Type*, ValType> MapKey;
1025 typedef std::map<MapKey, Constant *> MapTy;
1026 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
1027 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
1029 /// Map - This is the main map from the element descriptor to the Constants.
1030 /// This is the primary way we avoid creating two of the same shape
1034 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
1035 /// from the constants to their element in Map. This is important for
1036 /// removal of constants from the array, which would otherwise have to scan
1037 /// through the map with very large keys.
1038 InverseMapTy InverseMap;
1040 /// AbstractTypeMap - Map for abstract type constants.
1042 AbstractTypeMapTy AbstractTypeMap;
1045 typename MapTy::iterator map_end() { return Map.end(); }
1047 /// InsertOrGetItem - Return an iterator for the specified element.
1048 /// If the element exists in the map, the returned iterator points to the
1049 /// entry and Exists=true. If not, the iterator points to the newly
1050 /// inserted entry and returns Exists=false. Newly inserted entries have
1051 /// I->second == 0, and should be filled in.
1052 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
1055 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
1056 Exists = !IP.second;
1061 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
1063 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
1064 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
1065 IMI->second->second == CP &&
1066 "InverseMap corrupt!");
1070 typename MapTy::iterator I =
1071 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
1072 if (I == Map.end() || I->second != CP) {
1073 // FIXME: This should not use a linear scan. If this gets to be a
1074 // performance problem, someone should look at this.
1075 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
1082 /// getOrCreate - Return the specified constant from the map, creating it if
1084 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
1085 MapKey Lookup(Ty, V);
1086 typename MapTy::iterator I = Map.lower_bound(Lookup);
1087 // Is it in the map?
1088 if (I != Map.end() && I->first == Lookup)
1089 return static_cast<ConstantClass *>(I->second);
1091 // If no preexisting value, create one now...
1092 ConstantClass *Result =
1093 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
1095 /// FIXME: why does this assert fail when loading 176.gcc?
1096 //assert(Result->getType() == Ty && "Type specified is not correct!");
1097 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
1099 if (HasLargeKey) // Remember the reverse mapping if needed.
1100 InverseMap.insert(std::make_pair(Result, I));
1102 // If the type of the constant is abstract, make sure that an entry exists
1103 // for it in the AbstractTypeMap.
1104 if (Ty->isAbstract()) {
1105 typename AbstractTypeMapTy::iterator TI =
1106 AbstractTypeMap.lower_bound(Ty);
1108 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
1109 // Add ourselves to the ATU list of the type.
1110 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
1112 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
1118 void remove(ConstantClass *CP) {
1119 typename MapTy::iterator I = FindExistingElement(CP);
1120 assert(I != Map.end() && "Constant not found in constant table!");
1121 assert(I->second == CP && "Didn't find correct element?");
1123 if (HasLargeKey) // Remember the reverse mapping if needed.
1124 InverseMap.erase(CP);
1126 // Now that we found the entry, make sure this isn't the entry that
1127 // the AbstractTypeMap points to.
1128 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
1129 if (Ty->isAbstract()) {
1130 assert(AbstractTypeMap.count(Ty) &&
1131 "Abstract type not in AbstractTypeMap?");
1132 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
1133 if (ATMEntryIt == I) {
1134 // Yes, we are removing the representative entry for this type.
1135 // See if there are any other entries of the same type.
1136 typename MapTy::iterator TmpIt = ATMEntryIt;
1138 // First check the entry before this one...
1139 if (TmpIt != Map.begin()) {
1141 if (TmpIt->first.first != Ty) // Not the same type, move back...
1145 // If we didn't find the same type, try to move forward...
1146 if (TmpIt == ATMEntryIt) {
1148 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
1149 --TmpIt; // No entry afterwards with the same type
1152 // If there is another entry in the map of the same abstract type,
1153 // update the AbstractTypeMap entry now.
1154 if (TmpIt != ATMEntryIt) {
1157 // Otherwise, we are removing the last instance of this type
1158 // from the table. Remove from the ATM, and from user list.
1159 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
1160 AbstractTypeMap.erase(Ty);
1169 /// MoveConstantToNewSlot - If we are about to change C to be the element
1170 /// specified by I, update our internal data structures to reflect this
1172 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
1173 // First, remove the old location of the specified constant in the map.
1174 typename MapTy::iterator OldI = FindExistingElement(C);
1175 assert(OldI != Map.end() && "Constant not found in constant table!");
1176 assert(OldI->second == C && "Didn't find correct element?");
1178 // If this constant is the representative element for its abstract type,
1179 // update the AbstractTypeMap so that the representative element is I.
1180 if (C->getType()->isAbstract()) {
1181 typename AbstractTypeMapTy::iterator ATI =
1182 AbstractTypeMap.find(C->getType());
1183 assert(ATI != AbstractTypeMap.end() &&
1184 "Abstract type not in AbstractTypeMap?");
1185 if (ATI->second == OldI)
1189 // Remove the old entry from the map.
1192 // Update the inverse map so that we know that this constant is now
1193 // located at descriptor I.
1195 assert(I->second == C && "Bad inversemap entry!");
1200 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
1201 typename AbstractTypeMapTy::iterator I =
1202 AbstractTypeMap.find(cast<Type>(OldTy));
1204 assert(I != AbstractTypeMap.end() &&
1205 "Abstract type not in AbstractTypeMap?");
1207 // Convert a constant at a time until the last one is gone. The last one
1208 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
1209 // eliminated eventually.
1211 ConvertConstantType<ConstantClass,
1212 TypeClass>::convert(
1213 static_cast<ConstantClass *>(I->second->second),
1214 cast<TypeClass>(NewTy));
1216 I = AbstractTypeMap.find(cast<Type>(OldTy));
1217 } while (I != AbstractTypeMap.end());
1220 // If the type became concrete without being refined to any other existing
1221 // type, we just remove ourselves from the ATU list.
1222 void typeBecameConcrete(const DerivedType *AbsTy) {
1223 AbsTy->removeAbstractTypeUser(this);
1227 DOUT << "Constant.cpp: ValueMap\n";
1234 //---- ConstantAggregateZero::get() implementation...
1237 // ConstantAggregateZero does not take extra "value" argument...
1238 template<class ValType>
1239 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1240 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1241 return new ConstantAggregateZero(Ty);
1246 struct ConvertConstantType<ConstantAggregateZero, Type> {
1247 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1248 // Make everyone now use a constant of the new type...
1249 Constant *New = ConstantAggregateZero::get(NewTy);
1250 assert(New != OldC && "Didn't replace constant??");
1251 OldC->uncheckedReplaceAllUsesWith(New);
1252 OldC->destroyConstant(); // This constant is now dead, destroy it.
1257 static ManagedStatic<ValueMap<char, Type,
1258 ConstantAggregateZero> > AggZeroConstants;
1260 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1262 Constant *ConstantAggregateZero::get(const Type *Ty) {
1263 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1264 "Cannot create an aggregate zero of non-aggregate type!");
1265 return AggZeroConstants->getOrCreate(Ty, 0);
1268 // destroyConstant - Remove the constant from the constant table...
1270 void ConstantAggregateZero::destroyConstant() {
1271 AggZeroConstants->remove(this);
1272 destroyConstantImpl();
1275 //---- ConstantArray::get() implementation...
1279 struct ConvertConstantType<ConstantArray, ArrayType> {
1280 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1281 // Make everyone now use a constant of the new type...
1282 std::vector<Constant*> C;
1283 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1284 C.push_back(cast<Constant>(OldC->getOperand(i)));
1285 Constant *New = ConstantArray::get(NewTy, C);
1286 assert(New != OldC && "Didn't replace constant??");
1287 OldC->uncheckedReplaceAllUsesWith(New);
1288 OldC->destroyConstant(); // This constant is now dead, destroy it.
1293 static std::vector<Constant*> getValType(ConstantArray *CA) {
1294 std::vector<Constant*> Elements;
1295 Elements.reserve(CA->getNumOperands());
1296 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1297 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1301 typedef ValueMap<std::vector<Constant*>, ArrayType,
1302 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1303 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1305 Constant *ConstantArray::get(const ArrayType *Ty,
1306 const std::vector<Constant*> &V) {
1307 // If this is an all-zero array, return a ConstantAggregateZero object
1310 if (!C->isNullValue())
1311 return ArrayConstants->getOrCreate(Ty, V);
1312 for (unsigned i = 1, e = V.size(); i != e; ++i)
1314 return ArrayConstants->getOrCreate(Ty, V);
1316 return ConstantAggregateZero::get(Ty);
1319 // destroyConstant - Remove the constant from the constant table...
1321 void ConstantArray::destroyConstant() {
1322 ArrayConstants->remove(this);
1323 destroyConstantImpl();
1326 /// ConstantArray::get(const string&) - Return an array that is initialized to
1327 /// contain the specified string. If length is zero then a null terminator is
1328 /// added to the specified string so that it may be used in a natural way.
1329 /// Otherwise, the length parameter specifies how much of the string to use
1330 /// and it won't be null terminated.
1332 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1333 std::vector<Constant*> ElementVals;
1334 for (unsigned i = 0; i < Str.length(); ++i)
1335 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, Str[i]));
1337 // Add a null terminator to the string...
1339 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, 0));
1342 ArrayType *ATy = ArrayType::get(Type::Int8Ty, ElementVals.size());
1343 return ConstantArray::get(ATy, ElementVals);
1346 /// isString - This method returns true if the array is an array of i8, and
1347 /// if the elements of the array are all ConstantInt's.
1348 bool ConstantArray::isString() const {
1349 // Check the element type for i8...
1350 if (getType()->getElementType() != Type::Int8Ty)
1352 // Check the elements to make sure they are all integers, not constant
1354 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1355 if (!isa<ConstantInt>(getOperand(i)))
1360 /// isCString - This method returns true if the array is a string (see
1361 /// isString) and it ends in a null byte \0 and does not contains any other
1362 /// null bytes except its terminator.
1363 bool ConstantArray::isCString() const {
1364 // Check the element type for i8...
1365 if (getType()->getElementType() != Type::Int8Ty)
1367 Constant *Zero = Constant::getNullValue(getOperand(0)->getType());
1368 // Last element must be a null.
1369 if (getOperand(getNumOperands()-1) != Zero)
1371 // Other elements must be non-null integers.
1372 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1373 if (!isa<ConstantInt>(getOperand(i)))
1375 if (getOperand(i) == Zero)
1382 // getAsString - If the sub-element type of this array is i8
1383 // then this method converts the array to an std::string and returns it.
1384 // Otherwise, it asserts out.
1386 std::string ConstantArray::getAsString() const {
1387 assert(isString() && "Not a string!");
1389 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1390 Result += (char)cast<ConstantInt>(getOperand(i))->getZExtValue();
1395 //---- ConstantStruct::get() implementation...
1400 struct ConvertConstantType<ConstantStruct, StructType> {
1401 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1402 // Make everyone now use a constant of the new type...
1403 std::vector<Constant*> C;
1404 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1405 C.push_back(cast<Constant>(OldC->getOperand(i)));
1406 Constant *New = ConstantStruct::get(NewTy, C);
1407 assert(New != OldC && "Didn't replace constant??");
1409 OldC->uncheckedReplaceAllUsesWith(New);
1410 OldC->destroyConstant(); // This constant is now dead, destroy it.
1415 typedef ValueMap<std::vector<Constant*>, StructType,
1416 ConstantStruct, true /*largekey*/> StructConstantsTy;
1417 static ManagedStatic<StructConstantsTy> StructConstants;
1419 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1420 std::vector<Constant*> Elements;
1421 Elements.reserve(CS->getNumOperands());
1422 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1423 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1427 Constant *ConstantStruct::get(const StructType *Ty,
1428 const std::vector<Constant*> &V) {
1429 // Create a ConstantAggregateZero value if all elements are zeros...
1430 for (unsigned i = 0, e = V.size(); i != e; ++i)
1431 if (!V[i]->isNullValue())
1432 return StructConstants->getOrCreate(Ty, V);
1434 return ConstantAggregateZero::get(Ty);
1437 Constant *ConstantStruct::get(const std::vector<Constant*> &V, bool packed) {
1438 std::vector<const Type*> StructEls;
1439 StructEls.reserve(V.size());
1440 for (unsigned i = 0, e = V.size(); i != e; ++i)
1441 StructEls.push_back(V[i]->getType());
1442 return get(StructType::get(StructEls, packed), V);
1445 // destroyConstant - Remove the constant from the constant table...
1447 void ConstantStruct::destroyConstant() {
1448 StructConstants->remove(this);
1449 destroyConstantImpl();
1452 //---- ConstantVector::get() implementation...
1456 struct ConvertConstantType<ConstantVector, VectorType> {
1457 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1458 // Make everyone now use a constant of the new type...
1459 std::vector<Constant*> C;
1460 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1461 C.push_back(cast<Constant>(OldC->getOperand(i)));
1462 Constant *New = ConstantVector::get(NewTy, C);
1463 assert(New != OldC && "Didn't replace constant??");
1464 OldC->uncheckedReplaceAllUsesWith(New);
1465 OldC->destroyConstant(); // This constant is now dead, destroy it.
1470 static std::vector<Constant*> getValType(ConstantVector *CP) {
1471 std::vector<Constant*> Elements;
1472 Elements.reserve(CP->getNumOperands());
1473 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1474 Elements.push_back(CP->getOperand(i));
1478 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1479 ConstantVector> > VectorConstants;
1481 Constant *ConstantVector::get(const VectorType *Ty,
1482 const std::vector<Constant*> &V) {
1483 // If this is an all-zero vector, return a ConstantAggregateZero object
1486 if (!C->isNullValue())
1487 return VectorConstants->getOrCreate(Ty, V);
1488 for (unsigned i = 1, e = V.size(); i != e; ++i)
1490 return VectorConstants->getOrCreate(Ty, V);
1492 return ConstantAggregateZero::get(Ty);
1495 Constant *ConstantVector::get(const std::vector<Constant*> &V) {
1496 assert(!V.empty() && "Cannot infer type if V is empty");
1497 return get(VectorType::get(V.front()->getType(),V.size()), V);
1500 // destroyConstant - Remove the constant from the constant table...
1502 void ConstantVector::destroyConstant() {
1503 VectorConstants->remove(this);
1504 destroyConstantImpl();
1507 /// This function will return true iff every element in this vector constant
1508 /// is set to all ones.
1509 /// @returns true iff this constant's emements are all set to all ones.
1510 /// @brief Determine if the value is all ones.
1511 bool ConstantVector::isAllOnesValue() const {
1512 // Check out first element.
1513 const Constant *Elt = getOperand(0);
1514 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1515 if (!CI || !CI->isAllOnesValue()) return false;
1516 // Then make sure all remaining elements point to the same value.
1517 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1518 if (getOperand(I) != Elt) return false;
1523 /// getSplatValue - If this is a splat constant, where all of the
1524 /// elements have the same value, return that value. Otherwise return null.
1525 Constant *ConstantVector::getSplatValue() {
1526 // Check out first element.
1527 Constant *Elt = getOperand(0);
1528 // Then make sure all remaining elements point to the same value.
1529 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1530 if (getOperand(I) != Elt) return 0;
1534 //---- ConstantPointerNull::get() implementation...
1538 // ConstantPointerNull does not take extra "value" argument...
1539 template<class ValType>
1540 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1541 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1542 return new ConstantPointerNull(Ty);
1547 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1548 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1549 // Make everyone now use a constant of the new type...
1550 Constant *New = ConstantPointerNull::get(NewTy);
1551 assert(New != OldC && "Didn't replace constant??");
1552 OldC->uncheckedReplaceAllUsesWith(New);
1553 OldC->destroyConstant(); // This constant is now dead, destroy it.
1558 static ManagedStatic<ValueMap<char, PointerType,
1559 ConstantPointerNull> > NullPtrConstants;
1561 static char getValType(ConstantPointerNull *) {
1566 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1567 return NullPtrConstants->getOrCreate(Ty, 0);
1570 // destroyConstant - Remove the constant from the constant table...
1572 void ConstantPointerNull::destroyConstant() {
1573 NullPtrConstants->remove(this);
1574 destroyConstantImpl();
1578 //---- UndefValue::get() implementation...
1582 // UndefValue does not take extra "value" argument...
1583 template<class ValType>
1584 struct ConstantCreator<UndefValue, Type, ValType> {
1585 static UndefValue *create(const Type *Ty, const ValType &V) {
1586 return new UndefValue(Ty);
1591 struct ConvertConstantType<UndefValue, Type> {
1592 static void convert(UndefValue *OldC, const Type *NewTy) {
1593 // Make everyone now use a constant of the new type.
1594 Constant *New = UndefValue::get(NewTy);
1595 assert(New != OldC && "Didn't replace constant??");
1596 OldC->uncheckedReplaceAllUsesWith(New);
1597 OldC->destroyConstant(); // This constant is now dead, destroy it.
1602 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1604 static char getValType(UndefValue *) {
1609 UndefValue *UndefValue::get(const Type *Ty) {
1610 return UndefValueConstants->getOrCreate(Ty, 0);
1613 // destroyConstant - Remove the constant from the constant table.
1615 void UndefValue::destroyConstant() {
1616 UndefValueConstants->remove(this);
1617 destroyConstantImpl();
1621 //---- ConstantExpr::get() implementations...
1626 struct ExprMapKeyType {
1627 explicit ExprMapKeyType(unsigned opc, std::vector<Constant*> ops,
1628 unsigned short pred = 0) : opcode(opc), predicate(pred), operands(ops) { }
1631 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;
1637 bool operator<(const ExprMapKeyType & that) const {
1638 return this->opcode < that.opcode ||
1639 (this->opcode == that.opcode && this->predicate < that.predicate) ||
1640 (this->opcode == that.opcode && this->predicate == that.predicate &&
1641 this->operands < that.operands);
1644 bool operator!=(const ExprMapKeyType& that) const {
1645 return !(*this == that);
1653 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1654 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
1655 unsigned short pred = 0) {
1656 if (Instruction::isCast(V.opcode))
1657 return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
1658 if ((V.opcode >= Instruction::BinaryOpsBegin &&
1659 V.opcode < Instruction::BinaryOpsEnd))
1660 return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
1661 if (V.opcode == Instruction::Select)
1662 return new SelectConstantExpr(V.operands[0], V.operands[1],
1664 if (V.opcode == Instruction::ExtractElement)
1665 return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
1666 if (V.opcode == Instruction::InsertElement)
1667 return new InsertElementConstantExpr(V.operands[0], V.operands[1],
1669 if (V.opcode == Instruction::ShuffleVector)
1670 return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
1672 if (V.opcode == Instruction::InsertValue) {
1673 std::vector<Constant*> IdxList(V.operands.begin()+2, V.operands.end());
1674 return InsertValueConstantExpr::Create(V.operands[0], V.operands[1],
1677 if (V.opcode == Instruction::ExtractValue) {
1678 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1679 return ExtractValueConstantExpr::Create(V.operands[0], IdxList, Ty);
1681 if (V.opcode == Instruction::GetElementPtr) {
1682 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1683 return GetElementPtrConstantExpr::Create(V.operands[0], IdxList, Ty);
1686 // The compare instructions are weird. We have to encode the predicate
1687 // value and it is combined with the instruction opcode by multiplying
1688 // the opcode by one hundred. We must decode this to get the predicate.
1689 if (V.opcode == Instruction::ICmp)
1690 return new CompareConstantExpr(Ty, Instruction::ICmp, V.predicate,
1691 V.operands[0], V.operands[1]);
1692 if (V.opcode == Instruction::FCmp)
1693 return new CompareConstantExpr(Ty, Instruction::FCmp, V.predicate,
1694 V.operands[0], V.operands[1]);
1695 if (V.opcode == Instruction::VICmp)
1696 return new CompareConstantExpr(Ty, Instruction::VICmp, V.predicate,
1697 V.operands[0], V.operands[1]);
1698 if (V.opcode == Instruction::VFCmp)
1699 return new CompareConstantExpr(Ty, Instruction::VFCmp, V.predicate,
1700 V.operands[0], V.operands[1]);
1701 assert(0 && "Invalid ConstantExpr!");
1707 struct ConvertConstantType<ConstantExpr, Type> {
1708 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1710 switch (OldC->getOpcode()) {
1711 case Instruction::Trunc:
1712 case Instruction::ZExt:
1713 case Instruction::SExt:
1714 case Instruction::FPTrunc:
1715 case Instruction::FPExt:
1716 case Instruction::UIToFP:
1717 case Instruction::SIToFP:
1718 case Instruction::FPToUI:
1719 case Instruction::FPToSI:
1720 case Instruction::PtrToInt:
1721 case Instruction::IntToPtr:
1722 case Instruction::BitCast:
1723 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1726 case Instruction::Select:
1727 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1728 OldC->getOperand(1),
1729 OldC->getOperand(2));
1732 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1733 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1734 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1735 OldC->getOperand(1));
1737 case Instruction::GetElementPtr:
1738 // Make everyone now use a constant of the new type...
1739 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1740 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1741 &Idx[0], Idx.size());
1745 assert(New != OldC && "Didn't replace constant??");
1746 OldC->uncheckedReplaceAllUsesWith(New);
1747 OldC->destroyConstant(); // This constant is now dead, destroy it.
1750 } // end namespace llvm
1753 static ExprMapKeyType getValType(ConstantExpr *CE) {
1754 std::vector<Constant*> Operands;
1755 Operands.reserve(CE->getNumOperands());
1756 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1757 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1758 return ExprMapKeyType(CE->getOpcode(), Operands,
1759 CE->isCompare() ? CE->getPredicate() : 0);
1762 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1763 ConstantExpr> > ExprConstants;
1765 /// This is a utility function to handle folding of casts and lookup of the
1766 /// cast in the ExprConstants map. It is used by the various get* methods below.
1767 static inline Constant *getFoldedCast(
1768 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1769 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1770 // Fold a few common cases
1771 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1774 // Look up the constant in the table first to ensure uniqueness
1775 std::vector<Constant*> argVec(1, C);
1776 ExprMapKeyType Key(opc, argVec);
1777 return ExprConstants->getOrCreate(Ty, Key);
1780 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1781 Instruction::CastOps opc = Instruction::CastOps(oc);
1782 assert(Instruction::isCast(opc) && "opcode out of range");
1783 assert(C && Ty && "Null arguments to getCast");
1784 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1788 assert(0 && "Invalid cast opcode");
1790 case Instruction::Trunc: return getTrunc(C, Ty);
1791 case Instruction::ZExt: return getZExt(C, Ty);
1792 case Instruction::SExt: return getSExt(C, Ty);
1793 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1794 case Instruction::FPExt: return getFPExtend(C, Ty);
1795 case Instruction::UIToFP: return getUIToFP(C, Ty);
1796 case Instruction::SIToFP: return getSIToFP(C, Ty);
1797 case Instruction::FPToUI: return getFPToUI(C, Ty);
1798 case Instruction::FPToSI: return getFPToSI(C, Ty);
1799 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1800 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1801 case Instruction::BitCast: return getBitCast(C, Ty);
1806 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1807 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1808 return getCast(Instruction::BitCast, C, Ty);
1809 return getCast(Instruction::ZExt, C, Ty);
1812 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1813 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1814 return getCast(Instruction::BitCast, C, Ty);
1815 return getCast(Instruction::SExt, C, Ty);
1818 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1819 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1820 return getCast(Instruction::BitCast, C, Ty);
1821 return getCast(Instruction::Trunc, C, Ty);
1824 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1825 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1826 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1828 if (Ty->isInteger())
1829 return getCast(Instruction::PtrToInt, S, Ty);
1830 return getCast(Instruction::BitCast, S, Ty);
1833 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1835 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1836 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1837 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1838 Instruction::CastOps opcode =
1839 (SrcBits == DstBits ? Instruction::BitCast :
1840 (SrcBits > DstBits ? Instruction::Trunc :
1841 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1842 return getCast(opcode, C, Ty);
1845 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1846 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1848 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1849 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1850 if (SrcBits == DstBits)
1851 return C; // Avoid a useless cast
1852 Instruction::CastOps opcode =
1853 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1854 return getCast(opcode, C, Ty);
1857 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1858 assert(C->getType()->isInteger() && "Trunc operand must be integer");
1859 assert(Ty->isInteger() && "Trunc produces only integral");
1860 assert(C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1861 "SrcTy must be larger than DestTy for Trunc!");
1863 return getFoldedCast(Instruction::Trunc, C, Ty);
1866 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1867 assert(C->getType()->isInteger() && "SEXt operand must be integral");
1868 assert(Ty->isInteger() && "SExt produces only integer");
1869 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1870 "SrcTy must be smaller than DestTy for SExt!");
1872 return getFoldedCast(Instruction::SExt, C, Ty);
1875 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1876 assert(C->getType()->isInteger() && "ZEXt operand must be integral");
1877 assert(Ty->isInteger() && "ZExt produces only integer");
1878 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1879 "SrcTy must be smaller than DestTy for ZExt!");
1881 return getFoldedCast(Instruction::ZExt, C, Ty);
1884 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1885 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1886 C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1887 "This is an illegal floating point truncation!");
1888 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1891 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1892 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1893 C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1894 "This is an illegal floating point extension!");
1895 return getFoldedCast(Instruction::FPExt, C, Ty);
1898 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1899 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1900 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1901 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1902 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1903 "This is an illegal uint to floating point cast!");
1904 return getFoldedCast(Instruction::UIToFP, C, Ty);
1907 Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
1908 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1909 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1910 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1911 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1912 "This is an illegal sint to floating point cast!");
1913 return getFoldedCast(Instruction::SIToFP, C, Ty);
1916 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1917 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1918 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1919 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1920 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1921 "This is an illegal floating point to uint cast!");
1922 return getFoldedCast(Instruction::FPToUI, C, Ty);
1925 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1926 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1927 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1928 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1929 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1930 "This is an illegal floating point to sint cast!");
1931 return getFoldedCast(Instruction::FPToSI, C, Ty);
1934 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1935 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1936 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1937 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1940 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
1941 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
1942 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
1943 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1946 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
1947 // BitCast implies a no-op cast of type only. No bits change. However, you
1948 // can't cast pointers to anything but pointers.
1949 const Type *SrcTy = C->getType();
1950 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
1951 "BitCast cannot cast pointer to non-pointer and vice versa");
1953 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
1954 // or nonptr->ptr). For all the other types, the cast is okay if source and
1955 // destination bit widths are identical.
1956 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1957 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1958 assert(SrcBitSize == DstBitSize && "BitCast requies types of same width");
1959 return getFoldedCast(Instruction::BitCast, C, DstTy);
1962 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1963 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1964 Constant *GEPIdx = ConstantInt::get(Type::Int32Ty, 1);
1966 getGetElementPtr(getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
1967 return getCast(Instruction::PtrToInt, GEP, Type::Int64Ty);
1970 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1971 Constant *C1, Constant *C2) {
1972 // Check the operands for consistency first
1973 assert(Opcode >= Instruction::BinaryOpsBegin &&
1974 Opcode < Instruction::BinaryOpsEnd &&
1975 "Invalid opcode in binary constant expression");
1976 assert(C1->getType() == C2->getType() &&
1977 "Operand types in binary constant expression should match");
1979 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
1980 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1981 return FC; // Fold a few common cases...
1983 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1984 ExprMapKeyType Key(Opcode, argVec);
1985 return ExprConstants->getOrCreate(ReqTy, Key);
1988 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
1989 Constant *C1, Constant *C2) {
1990 switch (predicate) {
1991 default: assert(0 && "Invalid CmpInst predicate");
1992 case FCmpInst::FCMP_FALSE: case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_OGT:
1993 case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OLE:
1994 case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_ORD: case FCmpInst::FCMP_UNO:
1995 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UGT: case FCmpInst::FCMP_UGE:
1996 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_ULE: case FCmpInst::FCMP_UNE:
1997 case FCmpInst::FCMP_TRUE:
1998 return getFCmp(predicate, C1, C2);
1999 case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGT:
2000 case ICmpInst::ICMP_UGE: case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE:
2001 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_SGE: case ICmpInst::ICMP_SLT:
2002 case ICmpInst::ICMP_SLE:
2003 return getICmp(predicate, C1, C2);
2007 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
2010 case Instruction::Add:
2011 case Instruction::Sub:
2012 case Instruction::Mul:
2013 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2014 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
2015 isa<VectorType>(C1->getType())) &&
2016 "Tried to create an arithmetic operation on a non-arithmetic type!");
2018 case Instruction::UDiv:
2019 case Instruction::SDiv:
2020 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2021 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2022 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2023 "Tried to create an arithmetic operation on a non-arithmetic type!");
2025 case Instruction::FDiv:
2026 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2027 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2028 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2029 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2031 case Instruction::URem:
2032 case Instruction::SRem:
2033 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2034 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
2035 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
2036 "Tried to create an arithmetic operation on a non-arithmetic type!");
2038 case Instruction::FRem:
2039 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2040 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
2041 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
2042 && "Tried to create an arithmetic operation on a non-arithmetic type!");
2044 case Instruction::And:
2045 case Instruction::Or:
2046 case Instruction::Xor:
2047 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2048 assert((C1->getType()->isInteger() || isa<VectorType>(C1->getType())) &&
2049 "Tried to create a logical operation on a non-integral type!");
2051 case Instruction::Shl:
2052 case Instruction::LShr:
2053 case Instruction::AShr:
2054 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2055 assert(C1->getType()->isInteger() &&
2056 "Tried to create a shift operation on a non-integer type!");
2063 return getTy(C1->getType(), Opcode, C1, C2);
2066 Constant *ConstantExpr::getCompare(unsigned short pred,
2067 Constant *C1, Constant *C2) {
2068 assert(C1->getType() == C2->getType() && "Op types should be identical!");
2069 return getCompareTy(pred, C1, C2);
2072 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
2073 Constant *V1, Constant *V2) {
2074 assert(C->getType() == Type::Int1Ty && "Select condition must be i1!");
2075 assert(V1->getType() == V2->getType() && "Select value types must match!");
2076 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
2078 if (ReqTy == V1->getType())
2079 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
2080 return SC; // Fold common cases
2082 std::vector<Constant*> argVec(3, C);
2085 ExprMapKeyType Key(Instruction::Select, argVec);
2086 return ExprConstants->getOrCreate(ReqTy, Key);
2089 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
2092 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs,
2094 cast<PointerType>(ReqTy)->getElementType() &&
2095 "GEP indices invalid!");
2097 if (Constant *FC = ConstantFoldGetElementPtr(C, (Constant**)Idxs, NumIdx))
2098 return FC; // Fold a few common cases...
2100 assert(isa<PointerType>(C->getType()) &&
2101 "Non-pointer type for constant GetElementPtr expression");
2102 // Look up the constant in the table first to ensure uniqueness
2103 std::vector<Constant*> ArgVec;
2104 ArgVec.reserve(NumIdx+1);
2105 ArgVec.push_back(C);
2106 for (unsigned i = 0; i != NumIdx; ++i)
2107 ArgVec.push_back(cast<Constant>(Idxs[i]));
2108 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
2109 return ExprConstants->getOrCreate(ReqTy, Key);
2112 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
2114 // Get the result type of the getelementptr!
2116 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx);
2117 assert(Ty && "GEP indices invalid!");
2118 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
2119 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
2122 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
2124 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
2129 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2130 assert(LHS->getType() == RHS->getType());
2131 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2132 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2134 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2135 return FC; // Fold a few common cases...
2137 // Look up the constant in the table first to ensure uniqueness
2138 std::vector<Constant*> ArgVec;
2139 ArgVec.push_back(LHS);
2140 ArgVec.push_back(RHS);
2141 // Get the key type with both the opcode and predicate
2142 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
2143 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2147 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2148 assert(LHS->getType() == RHS->getType());
2149 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2151 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2152 return FC; // Fold a few common cases...
2154 // Look up the constant in the table first to ensure uniqueness
2155 std::vector<Constant*> ArgVec;
2156 ArgVec.push_back(LHS);
2157 ArgVec.push_back(RHS);
2158 // Get the key type with both the opcode and predicate
2159 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
2160 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2164 ConstantExpr::getVICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2165 assert(isa<VectorType>(LHS->getType()) &&
2166 "Tried to create vicmp operation on non-vector type!");
2167 assert(LHS->getType() == RHS->getType());
2168 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2169 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid VICmp Predicate");
2171 const VectorType *VTy = cast<VectorType>(LHS->getType());
2172 const Type *EltTy = VTy->getElementType();
2173 unsigned NumElts = VTy->getNumElements();
2175 SmallVector<Constant *, 8> Elts;
2176 for (unsigned i = 0; i != NumElts; ++i) {
2177 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2178 RHS->getOperand(i));
2180 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2182 Elts.push_back(ConstantInt::getAllOnesValue(EltTy));
2184 Elts.push_back(ConstantInt::get(EltTy, 0ULL));
2187 if (Elts.size() == NumElts)
2188 return ConstantVector::get(&Elts[0], Elts.size());
2190 // Look up the constant in the table first to ensure uniqueness
2191 std::vector<Constant*> ArgVec;
2192 ArgVec.push_back(LHS);
2193 ArgVec.push_back(RHS);
2194 // Get the key type with both the opcode and predicate
2195 const ExprMapKeyType Key(Instruction::VICmp, ArgVec, pred);
2196 return ExprConstants->getOrCreate(LHS->getType(), Key);
2200 ConstantExpr::getVFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2201 assert(isa<VectorType>(LHS->getType()) &&
2202 "Tried to create vfcmp operation on non-vector type!");
2203 assert(LHS->getType() == RHS->getType());
2204 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid VFCmp Predicate");
2206 const VectorType *VTy = cast<VectorType>(LHS->getType());
2207 unsigned NumElts = VTy->getNumElements();
2208 const Type *EltTy = VTy->getElementType();
2209 const Type *REltTy = IntegerType::get(EltTy->getPrimitiveSizeInBits());
2210 const Type *ResultTy = VectorType::get(REltTy, NumElts);
2212 SmallVector<Constant *, 8> Elts;
2213 for (unsigned i = 0; i != NumElts; ++i) {
2214 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2215 RHS->getOperand(i));
2217 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2219 Elts.push_back(ConstantInt::getAllOnesValue(REltTy));
2221 Elts.push_back(ConstantInt::get(REltTy, 0ULL));
2224 if (Elts.size() == NumElts)
2225 return ConstantVector::get(&Elts[0], Elts.size());
2227 // Look up the constant in the table first to ensure uniqueness
2228 std::vector<Constant*> ArgVec;
2229 ArgVec.push_back(LHS);
2230 ArgVec.push_back(RHS);
2231 // Get the key type with both the opcode and predicate
2232 const ExprMapKeyType Key(Instruction::VFCmp, ArgVec, pred);
2233 return ExprConstants->getOrCreate(ResultTy, Key);
2236 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
2238 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
2239 return FC; // Fold a few common cases...
2240 // Look up the constant in the table first to ensure uniqueness
2241 std::vector<Constant*> ArgVec(1, Val);
2242 ArgVec.push_back(Idx);
2243 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
2244 return ExprConstants->getOrCreate(ReqTy, Key);
2247 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
2248 assert(isa<VectorType>(Val->getType()) &&
2249 "Tried to create extractelement operation on non-vector type!");
2250 assert(Idx->getType() == Type::Int32Ty &&
2251 "Extractelement index must be i32 type!");
2252 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
2256 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
2257 Constant *Elt, Constant *Idx) {
2258 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2259 return FC; // Fold a few common cases...
2260 // Look up the constant in the table first to ensure uniqueness
2261 std::vector<Constant*> ArgVec(1, Val);
2262 ArgVec.push_back(Elt);
2263 ArgVec.push_back(Idx);
2264 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
2265 return ExprConstants->getOrCreate(ReqTy, Key);
2268 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2270 assert(isa<VectorType>(Val->getType()) &&
2271 "Tried to create insertelement operation on non-vector type!");
2272 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
2273 && "Insertelement types must match!");
2274 assert(Idx->getType() == Type::Int32Ty &&
2275 "Insertelement index must be i32 type!");
2276 return getInsertElementTy(cast<VectorType>(Val->getType())->getElementType(),
2280 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
2281 Constant *V2, Constant *Mask) {
2282 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2283 return FC; // Fold a few common cases...
2284 // Look up the constant in the table first to ensure uniqueness
2285 std::vector<Constant*> ArgVec(1, V1);
2286 ArgVec.push_back(V2);
2287 ArgVec.push_back(Mask);
2288 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
2289 return ExprConstants->getOrCreate(ReqTy, Key);
2292 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2294 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2295 "Invalid shuffle vector constant expr operands!");
2296 return getShuffleVectorTy(V1->getType(), V1, V2, Mask);
2299 Constant *ConstantExpr::getInsertValueTy(const Type *ReqTy, Constant *Agg,
2301 Constant *const *Idxs, unsigned NumIdx) {
2302 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2303 Idxs+NumIdx) == Val->getType() &&
2304 "insertvalue indices invalid!");
2305 assert(Agg->getType() == ReqTy &&
2306 "insertvalue type invalid!");
2308 if (Constant *FC = ConstantFoldInsertValue(Agg, Val, Idxs, NumIdx))
2309 return FC; // Fold a few common cases...
2311 assert(Agg->getType()->isFirstClassType() &&
2312 "Non-first-class type for constant InsertValue expression");
2313 // Look up the constant in the table first to ensure uniqueness
2314 std::vector<Constant*> ArgVec;
2315 ArgVec.reserve(NumIdx+2);
2316 ArgVec.push_back(Agg);
2317 ArgVec.push_back(Val);
2318 for (unsigned i = 0; i != NumIdx; ++i)
2319 ArgVec.push_back(cast<Constant>(Idxs[i]));
2320 const ExprMapKeyType Key(Instruction::InsertValue, ArgVec);
2321 return ExprConstants->getOrCreate(ReqTy, Key);
2324 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2325 Constant* const *IdxList, unsigned NumIdx) {
2326 assert(Agg->getType()->isFirstClassType() &&
2327 "Tried to create insertelement operation on non-first-class type!");
2329 const Type *ReqTy = Agg->getType();
2331 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2332 assert(ValTy == Val->getType() && "insertvalue indices invalid!");
2333 return getInsertValueTy(ReqTy, Agg, Val, IdxList, NumIdx);
2336 Constant *ConstantExpr::getExtractValueTy(const Type *ReqTy, Constant *Agg,
2337 Constant *const *Idxs, unsigned NumIdx) {
2338 assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs,
2339 Idxs+NumIdx) == ReqTy &&
2340 "extractvalue indices invalid!");
2342 if (Constant *FC = ConstantFoldExtractValue(Agg, Idxs, NumIdx))
2343 return FC; // Fold a few common cases...
2345 assert(Agg->getType()->isFirstClassType() &&
2346 "Non-first-class type for constant extractvalue expression");
2347 // Look up the constant in the table first to ensure uniqueness
2348 std::vector<Constant*> ArgVec;
2349 ArgVec.reserve(NumIdx+1);
2350 ArgVec.push_back(Agg);
2351 for (unsigned i = 0; i != NumIdx; ++i)
2352 ArgVec.push_back(cast<Constant>(Idxs[i]));
2353 const ExprMapKeyType Key(Instruction::ExtractValue, ArgVec);
2354 return ExprConstants->getOrCreate(ReqTy, Key);
2357 Constant *ConstantExpr::getExtractValue(Constant *Agg,
2358 Constant* const *IdxList, unsigned NumIdx) {
2359 assert(Agg->getType()->isFirstClassType() &&
2360 "Tried to create extractelement operation on non-first-class type!");
2363 ExtractValueInst::getIndexedType(Agg->getType(), IdxList, IdxList+NumIdx);
2364 assert(ReqTy && "extractvalue indices invalid!");
2365 return getExtractValueTy(ReqTy, Agg, IdxList, NumIdx);
2368 Constant *ConstantExpr::getZeroValueForNegationExpr(const Type *Ty) {
2369 if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
2370 if (PTy->getElementType()->isFloatingPoint()) {
2371 std::vector<Constant*> zeros(PTy->getNumElements(),
2372 ConstantFP::getNegativeZero(PTy->getElementType()));
2373 return ConstantVector::get(PTy, zeros);
2376 if (Ty->isFloatingPoint())
2377 return ConstantFP::getNegativeZero(Ty);
2379 return Constant::getNullValue(Ty);
2382 // destroyConstant - Remove the constant from the constant table...
2384 void ConstantExpr::destroyConstant() {
2385 ExprConstants->remove(this);
2386 destroyConstantImpl();
2389 const char *ConstantExpr::getOpcodeName() const {
2390 return Instruction::getOpcodeName(getOpcode());
2393 //===----------------------------------------------------------------------===//
2394 // replaceUsesOfWithOnConstant implementations
2396 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2397 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2400 /// Note that we intentionally replace all uses of From with To here. Consider
2401 /// a large array that uses 'From' 1000 times. By handling this case all here,
2402 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2403 /// single invocation handles all 1000 uses. Handling them one at a time would
2404 /// work, but would be really slow because it would have to unique each updated
2406 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2408 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2409 Constant *ToC = cast<Constant>(To);
2411 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2412 Lookup.first.first = getType();
2413 Lookup.second = this;
2415 std::vector<Constant*> &Values = Lookup.first.second;
2416 Values.reserve(getNumOperands()); // Build replacement array.
2418 // Fill values with the modified operands of the constant array. Also,
2419 // compute whether this turns into an all-zeros array.
2420 bool isAllZeros = false;
2421 unsigned NumUpdated = 0;
2422 if (!ToC->isNullValue()) {
2423 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2424 Constant *Val = cast<Constant>(O->get());
2429 Values.push_back(Val);
2433 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2434 Constant *Val = cast<Constant>(O->get());
2439 Values.push_back(Val);
2440 if (isAllZeros) isAllZeros = Val->isNullValue();
2444 Constant *Replacement = 0;
2446 Replacement = ConstantAggregateZero::get(getType());
2448 // Check to see if we have this array type already.
2450 ArrayConstantsTy::MapTy::iterator I =
2451 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2454 Replacement = I->second;
2456 // Okay, the new shape doesn't exist in the system yet. Instead of
2457 // creating a new constant array, inserting it, replaceallusesof'ing the
2458 // old with the new, then deleting the old... just update the current one
2460 ArrayConstants->MoveConstantToNewSlot(this, I);
2462 // Update to the new value. Optimize for the case when we have a single
2463 // operand that we're changing, but handle bulk updates efficiently.
2464 if (NumUpdated == 1) {
2465 unsigned OperandToUpdate = U-OperandList;
2466 assert(getOperand(OperandToUpdate) == From &&
2467 "ReplaceAllUsesWith broken!");
2468 setOperand(OperandToUpdate, ToC);
2470 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2471 if (getOperand(i) == From)
2478 // Otherwise, I do need to replace this with an existing value.
2479 assert(Replacement != this && "I didn't contain From!");
2481 // Everyone using this now uses the replacement.
2482 uncheckedReplaceAllUsesWith(Replacement);
2484 // Delete the old constant!
2488 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2490 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2491 Constant *ToC = cast<Constant>(To);
2493 unsigned OperandToUpdate = U-OperandList;
2494 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2496 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2497 Lookup.first.first = getType();
2498 Lookup.second = this;
2499 std::vector<Constant*> &Values = Lookup.first.second;
2500 Values.reserve(getNumOperands()); // Build replacement struct.
2503 // Fill values with the modified operands of the constant struct. Also,
2504 // compute whether this turns into an all-zeros struct.
2505 bool isAllZeros = false;
2506 if (!ToC->isNullValue()) {
2507 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2508 Values.push_back(cast<Constant>(O->get()));
2511 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2512 Constant *Val = cast<Constant>(O->get());
2513 Values.push_back(Val);
2514 if (isAllZeros) isAllZeros = Val->isNullValue();
2517 Values[OperandToUpdate] = ToC;
2519 Constant *Replacement = 0;
2521 Replacement = ConstantAggregateZero::get(getType());
2523 // Check to see if we have this array type already.
2525 StructConstantsTy::MapTy::iterator I =
2526 StructConstants->InsertOrGetItem(Lookup, Exists);
2529 Replacement = I->second;
2531 // Okay, the new shape doesn't exist in the system yet. Instead of
2532 // creating a new constant struct, inserting it, replaceallusesof'ing the
2533 // old with the new, then deleting the old... just update the current one
2535 StructConstants->MoveConstantToNewSlot(this, I);
2537 // Update to the new value.
2538 setOperand(OperandToUpdate, ToC);
2543 assert(Replacement != this && "I didn't contain From!");
2545 // Everyone using this now uses the replacement.
2546 uncheckedReplaceAllUsesWith(Replacement);
2548 // Delete the old constant!
2552 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2554 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2556 std::vector<Constant*> Values;
2557 Values.reserve(getNumOperands()); // Build replacement array...
2558 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2559 Constant *Val = getOperand(i);
2560 if (Val == From) Val = cast<Constant>(To);
2561 Values.push_back(Val);
2564 Constant *Replacement = ConstantVector::get(getType(), Values);
2565 assert(Replacement != this && "I didn't contain From!");
2567 // Everyone using this now uses the replacement.
2568 uncheckedReplaceAllUsesWith(Replacement);
2570 // Delete the old constant!
2574 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2576 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2577 Constant *To = cast<Constant>(ToV);
2579 Constant *Replacement = 0;
2580 if (getOpcode() == Instruction::GetElementPtr) {
2581 SmallVector<Constant*, 8> Indices;
2582 Constant *Pointer = getOperand(0);
2583 Indices.reserve(getNumOperands()-1);
2584 if (Pointer == From) Pointer = To;
2586 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2587 Constant *Val = getOperand(i);
2588 if (Val == From) Val = To;
2589 Indices.push_back(Val);
2591 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2592 &Indices[0], Indices.size());
2593 } else if (getOpcode() == Instruction::ExtractValue) {
2594 SmallVector<Constant*, 8> Indices;
2595 Constant *Agg = getOperand(0);
2596 Indices.reserve(getNumOperands()-1);
2597 if (Agg == From) Agg = To;
2599 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2600 Constant *Val = getOperand(i);
2601 if (Val == From) Val = To;
2602 Indices.push_back(Val);
2604 Replacement = ConstantExpr::getExtractValue(Agg,
2605 &Indices[0], Indices.size());
2606 } else if (getOpcode() == Instruction::InsertValue) {
2607 SmallVector<Constant*, 8> Indices;
2608 Constant *Agg = getOperand(0);
2609 Constant *Val = getOperand(1);
2610 Indices.reserve(getNumOperands()-2);
2611 if (Agg == From) Agg = To;
2612 if (Val == From) Val = To;
2614 for (unsigned i = 2, e = getNumOperands(); i != e; ++i) {
2615 Constant *Val = getOperand(i);
2616 if (Val == From) Val = To;
2617 Indices.push_back(Val);
2619 Replacement = ConstantExpr::getInsertValue(Agg, Val,
2620 &Indices[0], Indices.size());
2621 } else if (isCast()) {
2622 assert(getOperand(0) == From && "Cast only has one use!");
2623 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2624 } else if (getOpcode() == Instruction::Select) {
2625 Constant *C1 = getOperand(0);
2626 Constant *C2 = getOperand(1);
2627 Constant *C3 = getOperand(2);
2628 if (C1 == From) C1 = To;
2629 if (C2 == From) C2 = To;
2630 if (C3 == From) C3 = To;
2631 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2632 } else if (getOpcode() == Instruction::ExtractElement) {
2633 Constant *C1 = getOperand(0);
2634 Constant *C2 = getOperand(1);
2635 if (C1 == From) C1 = To;
2636 if (C2 == From) C2 = To;
2637 Replacement = ConstantExpr::getExtractElement(C1, C2);
2638 } else if (getOpcode() == Instruction::InsertElement) {
2639 Constant *C1 = getOperand(0);
2640 Constant *C2 = getOperand(1);
2641 Constant *C3 = getOperand(1);
2642 if (C1 == From) C1 = To;
2643 if (C2 == From) C2 = To;
2644 if (C3 == From) C3 = To;
2645 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2646 } else if (getOpcode() == Instruction::ShuffleVector) {
2647 Constant *C1 = getOperand(0);
2648 Constant *C2 = getOperand(1);
2649 Constant *C3 = getOperand(2);
2650 if (C1 == From) C1 = To;
2651 if (C2 == From) C2 = To;
2652 if (C3 == From) C3 = To;
2653 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2654 } else if (isCompare()) {
2655 Constant *C1 = getOperand(0);
2656 Constant *C2 = getOperand(1);
2657 if (C1 == From) C1 = To;
2658 if (C2 == From) C2 = To;
2659 if (getOpcode() == Instruction::ICmp)
2660 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2662 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2663 } else if (getNumOperands() == 2) {
2664 Constant *C1 = getOperand(0);
2665 Constant *C2 = getOperand(1);
2666 if (C1 == From) C1 = To;
2667 if (C2 == From) C2 = To;
2668 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2670 assert(0 && "Unknown ConstantExpr type!");
2674 assert(Replacement != this && "I didn't contain From!");
2676 // Everyone using this now uses the replacement.
2677 uncheckedReplaceAllUsesWith(Replacement);
2679 // Delete the old constant!
2684 /// getStringValue - Turn an LLVM constant pointer that eventually points to a
2685 /// global into a string value. Return an empty string if we can't do it.
2686 /// Parameter Chop determines if the result is chopped at the first null
2689 std::string Constant::getStringValue(bool Chop, unsigned Offset) {
2690 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(this)) {
2691 if (GV->hasInitializer() && isa<ConstantArray>(GV->getInitializer())) {
2692 ConstantArray *Init = cast<ConstantArray>(GV->getInitializer());
2693 if (Init->isString()) {
2694 std::string Result = Init->getAsString();
2695 if (Offset < Result.size()) {
2696 // If we are pointing INTO The string, erase the beginning...
2697 Result.erase(Result.begin(), Result.begin()+Offset);
2699 // Take off the null terminator, and any string fragments after it.
2701 std::string::size_type NullPos = Result.find_first_of((char)0);
2702 if (NullPos != std::string::npos)
2703 Result.erase(Result.begin()+NullPos, Result.end());
2709 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(this)) {
2710 if (CE->getOpcode() == Instruction::GetElementPtr) {
2711 // Turn a gep into the specified offset.
2712 if (CE->getNumOperands() == 3 &&
2713 cast<Constant>(CE->getOperand(1))->isNullValue() &&
2714 isa<ConstantInt>(CE->getOperand(2))) {
2715 Offset += cast<ConstantInt>(CE->getOperand(2))->getZExtValue();
2716 return CE->getOperand(0)->getStringValue(Chop, Offset);