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 /// GetElementPtrConstantExpr - This class is private to Constants.cpp, and is
537 /// used behind the scenes to implement getelementpr constant exprs.
538 class VISIBILITY_HIDDEN GetElementPtrConstantExpr : public ConstantExpr {
539 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
542 static GetElementPtrConstantExpr *Create(Constant *C, const std::vector<Constant*> &IdxList,
543 const Type *DestTy) {
544 return new(IdxList.size() + 1) GetElementPtrConstantExpr(C, IdxList, DestTy);
546 /// Transparently provide more efficient getOperand methods.
547 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
550 // CompareConstantExpr - This class is private to Constants.cpp, and is used
551 // behind the scenes to implement ICmp and FCmp constant expressions. This is
552 // needed in order to store the predicate value for these instructions.
553 struct VISIBILITY_HIDDEN CompareConstantExpr : public ConstantExpr {
554 void *operator new(size_t, unsigned); // DO NOT IMPLEMENT
555 // allocate space for exactly two operands
556 void *operator new(size_t s) {
557 return User::operator new(s, 2);
559 unsigned short predicate;
560 CompareConstantExpr(const Type *ty, Instruction::OtherOps opc,
561 unsigned short pred, Constant* LHS, Constant* RHS)
562 : ConstantExpr(ty, opc, &Op<0>(), 2), predicate(pred) {
563 Op<0>().init(LHS, this);
564 Op<1>().init(RHS, this);
566 /// Transparently provide more efficient getOperand methods.
567 DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value);
570 } // end anonymous namespace
573 struct OperandTraits<UnaryConstantExpr> : FixedNumOperandTraits<1> {
575 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryConstantExpr, Value)
578 struct OperandTraits<BinaryConstantExpr> : FixedNumOperandTraits<2> {
580 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryConstantExpr, Value)
583 struct OperandTraits<SelectConstantExpr> : FixedNumOperandTraits<3> {
585 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectConstantExpr, Value)
588 struct OperandTraits<ExtractElementConstantExpr> : FixedNumOperandTraits<2> {
590 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementConstantExpr, Value)
593 struct OperandTraits<InsertElementConstantExpr> : FixedNumOperandTraits<3> {
595 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementConstantExpr, Value)
598 struct OperandTraits<ShuffleVectorConstantExpr> : FixedNumOperandTraits<3> {
600 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorConstantExpr, Value)
604 struct OperandTraits<GetElementPtrConstantExpr> : VariadicOperandTraits<1> {
607 GetElementPtrConstantExpr::GetElementPtrConstantExpr
609 const std::vector<Constant*> &IdxList,
611 : ConstantExpr(DestTy, Instruction::GetElementPtr,
612 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
613 - (IdxList.size()+1),
615 OperandList[0].init(C, this);
616 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
617 OperandList[i+1].init(IdxList[i], this);
620 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrConstantExpr, Value)
624 struct OperandTraits<CompareConstantExpr> : FixedNumOperandTraits<2> {
626 DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CompareConstantExpr, Value)
629 } // End llvm namespace
632 // Utility function for determining if a ConstantExpr is a CastOp or not. This
633 // can't be inline because we don't want to #include Instruction.h into
635 bool ConstantExpr::isCast() const {
636 return Instruction::isCast(getOpcode());
639 bool ConstantExpr::isCompare() const {
640 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
643 /// ConstantExpr::get* - Return some common constants without having to
644 /// specify the full Instruction::OPCODE identifier.
646 Constant *ConstantExpr::getNeg(Constant *C) {
647 return get(Instruction::Sub,
648 ConstantExpr::getZeroValueForNegationExpr(C->getType()),
651 Constant *ConstantExpr::getNot(Constant *C) {
652 assert(isa<IntegerType>(C->getType()) && "Cannot NOT a nonintegral value!");
653 return get(Instruction::Xor, C,
654 ConstantInt::getAllOnesValue(C->getType()));
656 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2) {
657 return get(Instruction::Add, C1, C2);
659 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2) {
660 return get(Instruction::Sub, C1, C2);
662 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2) {
663 return get(Instruction::Mul, C1, C2);
665 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2) {
666 return get(Instruction::UDiv, C1, C2);
668 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2) {
669 return get(Instruction::SDiv, C1, C2);
671 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
672 return get(Instruction::FDiv, C1, C2);
674 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
675 return get(Instruction::URem, C1, C2);
677 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
678 return get(Instruction::SRem, C1, C2);
680 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
681 return get(Instruction::FRem, C1, C2);
683 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
684 return get(Instruction::And, C1, C2);
686 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
687 return get(Instruction::Or, C1, C2);
689 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
690 return get(Instruction::Xor, C1, C2);
692 unsigned ConstantExpr::getPredicate() const {
693 assert(getOpcode() == Instruction::FCmp ||
694 getOpcode() == Instruction::ICmp ||
695 getOpcode() == Instruction::VFCmp ||
696 getOpcode() == Instruction::VICmp);
697 return ((const CompareConstantExpr*)this)->predicate;
699 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2) {
700 return get(Instruction::Shl, C1, C2);
702 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2) {
703 return get(Instruction::LShr, C1, C2);
705 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2) {
706 return get(Instruction::AShr, C1, C2);
709 /// getWithOperandReplaced - Return a constant expression identical to this
710 /// one, but with the specified operand set to the specified value.
712 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
713 assert(OpNo < getNumOperands() && "Operand num is out of range!");
714 assert(Op->getType() == getOperand(OpNo)->getType() &&
715 "Replacing operand with value of different type!");
716 if (getOperand(OpNo) == Op)
717 return const_cast<ConstantExpr*>(this);
719 Constant *Op0, *Op1, *Op2;
720 switch (getOpcode()) {
721 case Instruction::Trunc:
722 case Instruction::ZExt:
723 case Instruction::SExt:
724 case Instruction::FPTrunc:
725 case Instruction::FPExt:
726 case Instruction::UIToFP:
727 case Instruction::SIToFP:
728 case Instruction::FPToUI:
729 case Instruction::FPToSI:
730 case Instruction::PtrToInt:
731 case Instruction::IntToPtr:
732 case Instruction::BitCast:
733 return ConstantExpr::getCast(getOpcode(), Op, getType());
734 case Instruction::Select:
735 Op0 = (OpNo == 0) ? Op : getOperand(0);
736 Op1 = (OpNo == 1) ? Op : getOperand(1);
737 Op2 = (OpNo == 2) ? Op : getOperand(2);
738 return ConstantExpr::getSelect(Op0, Op1, Op2);
739 case Instruction::InsertElement:
740 Op0 = (OpNo == 0) ? Op : getOperand(0);
741 Op1 = (OpNo == 1) ? Op : getOperand(1);
742 Op2 = (OpNo == 2) ? Op : getOperand(2);
743 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
744 case Instruction::ExtractElement:
745 Op0 = (OpNo == 0) ? Op : getOperand(0);
746 Op1 = (OpNo == 1) ? Op : getOperand(1);
747 return ConstantExpr::getExtractElement(Op0, Op1);
748 case Instruction::ShuffleVector:
749 Op0 = (OpNo == 0) ? Op : getOperand(0);
750 Op1 = (OpNo == 1) ? Op : getOperand(1);
751 Op2 = (OpNo == 2) ? Op : getOperand(2);
752 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
753 case Instruction::GetElementPtr: {
754 SmallVector<Constant*, 8> Ops;
755 Ops.resize(getNumOperands());
756 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
757 Ops[i] = getOperand(i);
759 return ConstantExpr::getGetElementPtr(Op, &Ops[0], Ops.size());
761 return ConstantExpr::getGetElementPtr(getOperand(0), &Ops[0], Ops.size());
764 assert(getNumOperands() == 2 && "Must be binary operator?");
765 Op0 = (OpNo == 0) ? Op : getOperand(0);
766 Op1 = (OpNo == 1) ? Op : getOperand(1);
767 return ConstantExpr::get(getOpcode(), Op0, Op1);
771 /// getWithOperands - This returns the current constant expression with the
772 /// operands replaced with the specified values. The specified operands must
773 /// match count and type with the existing ones.
774 Constant *ConstantExpr::
775 getWithOperands(const std::vector<Constant*> &Ops) const {
776 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
777 bool AnyChange = false;
778 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
779 assert(Ops[i]->getType() == getOperand(i)->getType() &&
780 "Operand type mismatch!");
781 AnyChange |= Ops[i] != getOperand(i);
783 if (!AnyChange) // No operands changed, return self.
784 return const_cast<ConstantExpr*>(this);
786 switch (getOpcode()) {
787 case Instruction::Trunc:
788 case Instruction::ZExt:
789 case Instruction::SExt:
790 case Instruction::FPTrunc:
791 case Instruction::FPExt:
792 case Instruction::UIToFP:
793 case Instruction::SIToFP:
794 case Instruction::FPToUI:
795 case Instruction::FPToSI:
796 case Instruction::PtrToInt:
797 case Instruction::IntToPtr:
798 case Instruction::BitCast:
799 return ConstantExpr::getCast(getOpcode(), Ops[0], getType());
800 case Instruction::Select:
801 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
802 case Instruction::InsertElement:
803 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
804 case Instruction::ExtractElement:
805 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
806 case Instruction::ShuffleVector:
807 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
808 case Instruction::GetElementPtr:
809 return ConstantExpr::getGetElementPtr(Ops[0], &Ops[1], Ops.size()-1);
810 case Instruction::ICmp:
811 case Instruction::FCmp:
812 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
814 assert(getNumOperands() == 2 && "Must be binary operator?");
815 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1]);
820 //===----------------------------------------------------------------------===//
821 // isValueValidForType implementations
823 bool ConstantInt::isValueValidForType(const Type *Ty, uint64_t Val) {
824 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
825 if (Ty == Type::Int1Ty)
826 return Val == 0 || Val == 1;
828 return true; // always true, has to fit in largest type
829 uint64_t Max = (1ll << NumBits) - 1;
833 bool ConstantInt::isValueValidForType(const Type *Ty, int64_t Val) {
834 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
835 if (Ty == Type::Int1Ty)
836 return Val == 0 || Val == 1 || Val == -1;
838 return true; // always true, has to fit in largest type
839 int64_t Min = -(1ll << (NumBits-1));
840 int64_t Max = (1ll << (NumBits-1)) - 1;
841 return (Val >= Min && Val <= Max);
844 bool ConstantFP::isValueValidForType(const Type *Ty, const APFloat& Val) {
845 // convert modifies in place, so make a copy.
846 APFloat Val2 = APFloat(Val);
847 switch (Ty->getTypeID()) {
849 return false; // These can't be represented as floating point!
851 // FIXME rounding mode needs to be more flexible
852 case Type::FloatTyID:
853 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
854 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
856 case Type::DoubleTyID:
857 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
858 &Val2.getSemantics() == &APFloat::IEEEdouble ||
859 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
861 case Type::X86_FP80TyID:
862 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
863 &Val2.getSemantics() == &APFloat::IEEEdouble ||
864 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
865 case Type::FP128TyID:
866 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
867 &Val2.getSemantics() == &APFloat::IEEEdouble ||
868 &Val2.getSemantics() == &APFloat::IEEEquad;
869 case Type::PPC_FP128TyID:
870 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
871 &Val2.getSemantics() == &APFloat::IEEEdouble ||
872 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
876 //===----------------------------------------------------------------------===//
877 // Factory Function Implementation
880 // The number of operands for each ConstantCreator::create method is
881 // determined by the ConstantTraits template.
882 // ConstantCreator - A class that is used to create constants by
883 // ValueMap*. This class should be partially specialized if there is
884 // something strange that needs to be done to interface to the ctor for the
888 template<class ValType>
889 struct ConstantTraits;
891 template<typename T, typename Alloc>
892 struct VISIBILITY_HIDDEN ConstantTraits< std::vector<T, Alloc> > {
893 static unsigned uses(const std::vector<T, Alloc>& v) {
898 template<class ConstantClass, class TypeClass, class ValType>
899 struct VISIBILITY_HIDDEN ConstantCreator {
900 static ConstantClass *create(const TypeClass *Ty, const ValType &V) {
901 return new(ConstantTraits<ValType>::uses(V)) ConstantClass(Ty, V);
905 template<class ConstantClass, class TypeClass>
906 struct VISIBILITY_HIDDEN ConvertConstantType {
907 static void convert(ConstantClass *OldC, const TypeClass *NewTy) {
908 assert(0 && "This type cannot be converted!\n");
913 template<class ValType, class TypeClass, class ConstantClass,
914 bool HasLargeKey = false /*true for arrays and structs*/ >
915 class VISIBILITY_HIDDEN ValueMap : public AbstractTypeUser {
917 typedef std::pair<const Type*, ValType> MapKey;
918 typedef std::map<MapKey, Constant *> MapTy;
919 typedef std::map<Constant*, typename MapTy::iterator> InverseMapTy;
920 typedef std::map<const Type*, typename MapTy::iterator> AbstractTypeMapTy;
922 /// Map - This is the main map from the element descriptor to the Constants.
923 /// This is the primary way we avoid creating two of the same shape
927 /// InverseMap - If "HasLargeKey" is true, this contains an inverse mapping
928 /// from the constants to their element in Map. This is important for
929 /// removal of constants from the array, which would otherwise have to scan
930 /// through the map with very large keys.
931 InverseMapTy InverseMap;
933 /// AbstractTypeMap - Map for abstract type constants.
935 AbstractTypeMapTy AbstractTypeMap;
938 typename MapTy::iterator map_end() { return Map.end(); }
940 /// InsertOrGetItem - Return an iterator for the specified element.
941 /// If the element exists in the map, the returned iterator points to the
942 /// entry and Exists=true. If not, the iterator points to the newly
943 /// inserted entry and returns Exists=false. Newly inserted entries have
944 /// I->second == 0, and should be filled in.
945 typename MapTy::iterator InsertOrGetItem(std::pair<MapKey, Constant *>
948 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
954 typename MapTy::iterator FindExistingElement(ConstantClass *CP) {
956 typename InverseMapTy::iterator IMI = InverseMap.find(CP);
957 assert(IMI != InverseMap.end() && IMI->second != Map.end() &&
958 IMI->second->second == CP &&
959 "InverseMap corrupt!");
963 typename MapTy::iterator I =
964 Map.find(MapKey((TypeClass*)CP->getRawType(), getValType(CP)));
965 if (I == Map.end() || I->second != CP) {
966 // FIXME: This should not use a linear scan. If this gets to be a
967 // performance problem, someone should look at this.
968 for (I = Map.begin(); I != Map.end() && I->second != CP; ++I)
975 /// getOrCreate - Return the specified constant from the map, creating it if
977 ConstantClass *getOrCreate(const TypeClass *Ty, const ValType &V) {
978 MapKey Lookup(Ty, V);
979 typename MapTy::iterator I = Map.lower_bound(Lookup);
981 if (I != Map.end() && I->first == Lookup)
982 return static_cast<ConstantClass *>(I->second);
984 // If no preexisting value, create one now...
985 ConstantClass *Result =
986 ConstantCreator<ConstantClass,TypeClass,ValType>::create(Ty, V);
988 /// FIXME: why does this assert fail when loading 176.gcc?
989 //assert(Result->getType() == Ty && "Type specified is not correct!");
990 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
992 if (HasLargeKey) // Remember the reverse mapping if needed.
993 InverseMap.insert(std::make_pair(Result, I));
995 // If the type of the constant is abstract, make sure that an entry exists
996 // for it in the AbstractTypeMap.
997 if (Ty->isAbstract()) {
998 typename AbstractTypeMapTy::iterator TI =
999 AbstractTypeMap.lower_bound(Ty);
1001 if (TI == AbstractTypeMap.end() || TI->first != Ty) {
1002 // Add ourselves to the ATU list of the type.
1003 cast<DerivedType>(Ty)->addAbstractTypeUser(this);
1005 AbstractTypeMap.insert(TI, std::make_pair(Ty, I));
1011 void remove(ConstantClass *CP) {
1012 typename MapTy::iterator I = FindExistingElement(CP);
1013 assert(I != Map.end() && "Constant not found in constant table!");
1014 assert(I->second == CP && "Didn't find correct element?");
1016 if (HasLargeKey) // Remember the reverse mapping if needed.
1017 InverseMap.erase(CP);
1019 // Now that we found the entry, make sure this isn't the entry that
1020 // the AbstractTypeMap points to.
1021 const TypeClass *Ty = static_cast<const TypeClass *>(I->first.first);
1022 if (Ty->isAbstract()) {
1023 assert(AbstractTypeMap.count(Ty) &&
1024 "Abstract type not in AbstractTypeMap?");
1025 typename MapTy::iterator &ATMEntryIt = AbstractTypeMap[Ty];
1026 if (ATMEntryIt == I) {
1027 // Yes, we are removing the representative entry for this type.
1028 // See if there are any other entries of the same type.
1029 typename MapTy::iterator TmpIt = ATMEntryIt;
1031 // First check the entry before this one...
1032 if (TmpIt != Map.begin()) {
1034 if (TmpIt->first.first != Ty) // Not the same type, move back...
1038 // If we didn't find the same type, try to move forward...
1039 if (TmpIt == ATMEntryIt) {
1041 if (TmpIt == Map.end() || TmpIt->first.first != Ty)
1042 --TmpIt; // No entry afterwards with the same type
1045 // If there is another entry in the map of the same abstract type,
1046 // update the AbstractTypeMap entry now.
1047 if (TmpIt != ATMEntryIt) {
1050 // Otherwise, we are removing the last instance of this type
1051 // from the table. Remove from the ATM, and from user list.
1052 cast<DerivedType>(Ty)->removeAbstractTypeUser(this);
1053 AbstractTypeMap.erase(Ty);
1062 /// MoveConstantToNewSlot - If we are about to change C to be the element
1063 /// specified by I, update our internal data structures to reflect this
1065 void MoveConstantToNewSlot(ConstantClass *C, typename MapTy::iterator I) {
1066 // First, remove the old location of the specified constant in the map.
1067 typename MapTy::iterator OldI = FindExistingElement(C);
1068 assert(OldI != Map.end() && "Constant not found in constant table!");
1069 assert(OldI->second == C && "Didn't find correct element?");
1071 // If this constant is the representative element for its abstract type,
1072 // update the AbstractTypeMap so that the representative element is I.
1073 if (C->getType()->isAbstract()) {
1074 typename AbstractTypeMapTy::iterator ATI =
1075 AbstractTypeMap.find(C->getType());
1076 assert(ATI != AbstractTypeMap.end() &&
1077 "Abstract type not in AbstractTypeMap?");
1078 if (ATI->second == OldI)
1082 // Remove the old entry from the map.
1085 // Update the inverse map so that we know that this constant is now
1086 // located at descriptor I.
1088 assert(I->second == C && "Bad inversemap entry!");
1093 void refineAbstractType(const DerivedType *OldTy, const Type *NewTy) {
1094 typename AbstractTypeMapTy::iterator I =
1095 AbstractTypeMap.find(cast<Type>(OldTy));
1097 assert(I != AbstractTypeMap.end() &&
1098 "Abstract type not in AbstractTypeMap?");
1100 // Convert a constant at a time until the last one is gone. The last one
1101 // leaving will remove() itself, causing the AbstractTypeMapEntry to be
1102 // eliminated eventually.
1104 ConvertConstantType<ConstantClass,
1105 TypeClass>::convert(
1106 static_cast<ConstantClass *>(I->second->second),
1107 cast<TypeClass>(NewTy));
1109 I = AbstractTypeMap.find(cast<Type>(OldTy));
1110 } while (I != AbstractTypeMap.end());
1113 // If the type became concrete without being refined to any other existing
1114 // type, we just remove ourselves from the ATU list.
1115 void typeBecameConcrete(const DerivedType *AbsTy) {
1116 AbsTy->removeAbstractTypeUser(this);
1120 DOUT << "Constant.cpp: ValueMap\n";
1127 //---- ConstantAggregateZero::get() implementation...
1130 // ConstantAggregateZero does not take extra "value" argument...
1131 template<class ValType>
1132 struct ConstantCreator<ConstantAggregateZero, Type, ValType> {
1133 static ConstantAggregateZero *create(const Type *Ty, const ValType &V){
1134 return new ConstantAggregateZero(Ty);
1139 struct ConvertConstantType<ConstantAggregateZero, Type> {
1140 static void convert(ConstantAggregateZero *OldC, const Type *NewTy) {
1141 // Make everyone now use a constant of the new type...
1142 Constant *New = ConstantAggregateZero::get(NewTy);
1143 assert(New != OldC && "Didn't replace constant??");
1144 OldC->uncheckedReplaceAllUsesWith(New);
1145 OldC->destroyConstant(); // This constant is now dead, destroy it.
1150 static ManagedStatic<ValueMap<char, Type,
1151 ConstantAggregateZero> > AggZeroConstants;
1153 static char getValType(ConstantAggregateZero *CPZ) { return 0; }
1155 Constant *ConstantAggregateZero::get(const Type *Ty) {
1156 assert((isa<StructType>(Ty) || isa<ArrayType>(Ty) || isa<VectorType>(Ty)) &&
1157 "Cannot create an aggregate zero of non-aggregate type!");
1158 return AggZeroConstants->getOrCreate(Ty, 0);
1161 // destroyConstant - Remove the constant from the constant table...
1163 void ConstantAggregateZero::destroyConstant() {
1164 AggZeroConstants->remove(this);
1165 destroyConstantImpl();
1168 //---- ConstantArray::get() implementation...
1172 struct ConvertConstantType<ConstantArray, ArrayType> {
1173 static void convert(ConstantArray *OldC, const ArrayType *NewTy) {
1174 // Make everyone now use a constant of the new type...
1175 std::vector<Constant*> C;
1176 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1177 C.push_back(cast<Constant>(OldC->getOperand(i)));
1178 Constant *New = ConstantArray::get(NewTy, C);
1179 assert(New != OldC && "Didn't replace constant??");
1180 OldC->uncheckedReplaceAllUsesWith(New);
1181 OldC->destroyConstant(); // This constant is now dead, destroy it.
1186 static std::vector<Constant*> getValType(ConstantArray *CA) {
1187 std::vector<Constant*> Elements;
1188 Elements.reserve(CA->getNumOperands());
1189 for (unsigned i = 0, e = CA->getNumOperands(); i != e; ++i)
1190 Elements.push_back(cast<Constant>(CA->getOperand(i)));
1194 typedef ValueMap<std::vector<Constant*>, ArrayType,
1195 ConstantArray, true /*largekey*/> ArrayConstantsTy;
1196 static ManagedStatic<ArrayConstantsTy> ArrayConstants;
1198 Constant *ConstantArray::get(const ArrayType *Ty,
1199 const std::vector<Constant*> &V) {
1200 // If this is an all-zero array, return a ConstantAggregateZero object
1203 if (!C->isNullValue())
1204 return ArrayConstants->getOrCreate(Ty, V);
1205 for (unsigned i = 1, e = V.size(); i != e; ++i)
1207 return ArrayConstants->getOrCreate(Ty, V);
1209 return ConstantAggregateZero::get(Ty);
1212 // destroyConstant - Remove the constant from the constant table...
1214 void ConstantArray::destroyConstant() {
1215 ArrayConstants->remove(this);
1216 destroyConstantImpl();
1219 /// ConstantArray::get(const string&) - Return an array that is initialized to
1220 /// contain the specified string. If length is zero then a null terminator is
1221 /// added to the specified string so that it may be used in a natural way.
1222 /// Otherwise, the length parameter specifies how much of the string to use
1223 /// and it won't be null terminated.
1225 Constant *ConstantArray::get(const std::string &Str, bool AddNull) {
1226 std::vector<Constant*> ElementVals;
1227 for (unsigned i = 0; i < Str.length(); ++i)
1228 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, Str[i]));
1230 // Add a null terminator to the string...
1232 ElementVals.push_back(ConstantInt::get(Type::Int8Ty, 0));
1235 ArrayType *ATy = ArrayType::get(Type::Int8Ty, ElementVals.size());
1236 return ConstantArray::get(ATy, ElementVals);
1239 /// isString - This method returns true if the array is an array of i8, and
1240 /// if the elements of the array are all ConstantInt's.
1241 bool ConstantArray::isString() const {
1242 // Check the element type for i8...
1243 if (getType()->getElementType() != Type::Int8Ty)
1245 // Check the elements to make sure they are all integers, not constant
1247 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1248 if (!isa<ConstantInt>(getOperand(i)))
1253 /// isCString - This method returns true if the array is a string (see
1254 /// isString) and it ends in a null byte \0 and does not contains any other
1255 /// null bytes except its terminator.
1256 bool ConstantArray::isCString() const {
1257 // Check the element type for i8...
1258 if (getType()->getElementType() != Type::Int8Ty)
1260 Constant *Zero = Constant::getNullValue(getOperand(0)->getType());
1261 // Last element must be a null.
1262 if (getOperand(getNumOperands()-1) != Zero)
1264 // Other elements must be non-null integers.
1265 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1266 if (!isa<ConstantInt>(getOperand(i)))
1268 if (getOperand(i) == Zero)
1275 // getAsString - If the sub-element type of this array is i8
1276 // then this method converts the array to an std::string and returns it.
1277 // Otherwise, it asserts out.
1279 std::string ConstantArray::getAsString() const {
1280 assert(isString() && "Not a string!");
1282 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1283 Result += (char)cast<ConstantInt>(getOperand(i))->getZExtValue();
1288 //---- ConstantStruct::get() implementation...
1293 struct ConvertConstantType<ConstantStruct, StructType> {
1294 static void convert(ConstantStruct *OldC, const StructType *NewTy) {
1295 // Make everyone now use a constant of the new type...
1296 std::vector<Constant*> C;
1297 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1298 C.push_back(cast<Constant>(OldC->getOperand(i)));
1299 Constant *New = ConstantStruct::get(NewTy, C);
1300 assert(New != OldC && "Didn't replace constant??");
1302 OldC->uncheckedReplaceAllUsesWith(New);
1303 OldC->destroyConstant(); // This constant is now dead, destroy it.
1308 typedef ValueMap<std::vector<Constant*>, StructType,
1309 ConstantStruct, true /*largekey*/> StructConstantsTy;
1310 static ManagedStatic<StructConstantsTy> StructConstants;
1312 static std::vector<Constant*> getValType(ConstantStruct *CS) {
1313 std::vector<Constant*> Elements;
1314 Elements.reserve(CS->getNumOperands());
1315 for (unsigned i = 0, e = CS->getNumOperands(); i != e; ++i)
1316 Elements.push_back(cast<Constant>(CS->getOperand(i)));
1320 Constant *ConstantStruct::get(const StructType *Ty,
1321 const std::vector<Constant*> &V) {
1322 // Create a ConstantAggregateZero value if all elements are zeros...
1323 for (unsigned i = 0, e = V.size(); i != e; ++i)
1324 if (!V[i]->isNullValue())
1325 return StructConstants->getOrCreate(Ty, V);
1327 return ConstantAggregateZero::get(Ty);
1330 Constant *ConstantStruct::get(const std::vector<Constant*> &V, bool packed) {
1331 std::vector<const Type*> StructEls;
1332 StructEls.reserve(V.size());
1333 for (unsigned i = 0, e = V.size(); i != e; ++i)
1334 StructEls.push_back(V[i]->getType());
1335 return get(StructType::get(StructEls, packed), V);
1338 // destroyConstant - Remove the constant from the constant table...
1340 void ConstantStruct::destroyConstant() {
1341 StructConstants->remove(this);
1342 destroyConstantImpl();
1345 //---- ConstantVector::get() implementation...
1349 struct ConvertConstantType<ConstantVector, VectorType> {
1350 static void convert(ConstantVector *OldC, const VectorType *NewTy) {
1351 // Make everyone now use a constant of the new type...
1352 std::vector<Constant*> C;
1353 for (unsigned i = 0, e = OldC->getNumOperands(); i != e; ++i)
1354 C.push_back(cast<Constant>(OldC->getOperand(i)));
1355 Constant *New = ConstantVector::get(NewTy, C);
1356 assert(New != OldC && "Didn't replace constant??");
1357 OldC->uncheckedReplaceAllUsesWith(New);
1358 OldC->destroyConstant(); // This constant is now dead, destroy it.
1363 static std::vector<Constant*> getValType(ConstantVector *CP) {
1364 std::vector<Constant*> Elements;
1365 Elements.reserve(CP->getNumOperands());
1366 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
1367 Elements.push_back(CP->getOperand(i));
1371 static ManagedStatic<ValueMap<std::vector<Constant*>, VectorType,
1372 ConstantVector> > VectorConstants;
1374 Constant *ConstantVector::get(const VectorType *Ty,
1375 const std::vector<Constant*> &V) {
1376 // If this is an all-zero vector, return a ConstantAggregateZero object
1379 if (!C->isNullValue())
1380 return VectorConstants->getOrCreate(Ty, V);
1381 for (unsigned i = 1, e = V.size(); i != e; ++i)
1383 return VectorConstants->getOrCreate(Ty, V);
1385 return ConstantAggregateZero::get(Ty);
1388 Constant *ConstantVector::get(const std::vector<Constant*> &V) {
1389 assert(!V.empty() && "Cannot infer type if V is empty");
1390 return get(VectorType::get(V.front()->getType(),V.size()), V);
1393 // destroyConstant - Remove the constant from the constant table...
1395 void ConstantVector::destroyConstant() {
1396 VectorConstants->remove(this);
1397 destroyConstantImpl();
1400 /// This function will return true iff every element in this vector constant
1401 /// is set to all ones.
1402 /// @returns true iff this constant's emements are all set to all ones.
1403 /// @brief Determine if the value is all ones.
1404 bool ConstantVector::isAllOnesValue() const {
1405 // Check out first element.
1406 const Constant *Elt = getOperand(0);
1407 const ConstantInt *CI = dyn_cast<ConstantInt>(Elt);
1408 if (!CI || !CI->isAllOnesValue()) return false;
1409 // Then make sure all remaining elements point to the same value.
1410 for (unsigned I = 1, E = getNumOperands(); I < E; ++I) {
1411 if (getOperand(I) != Elt) return false;
1416 /// getSplatValue - If this is a splat constant, where all of the
1417 /// elements have the same value, return that value. Otherwise return null.
1418 Constant *ConstantVector::getSplatValue() {
1419 // Check out first element.
1420 Constant *Elt = getOperand(0);
1421 // Then make sure all remaining elements point to the same value.
1422 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1423 if (getOperand(I) != Elt) return 0;
1427 //---- ConstantPointerNull::get() implementation...
1431 // ConstantPointerNull does not take extra "value" argument...
1432 template<class ValType>
1433 struct ConstantCreator<ConstantPointerNull, PointerType, ValType> {
1434 static ConstantPointerNull *create(const PointerType *Ty, const ValType &V){
1435 return new ConstantPointerNull(Ty);
1440 struct ConvertConstantType<ConstantPointerNull, PointerType> {
1441 static void convert(ConstantPointerNull *OldC, const PointerType *NewTy) {
1442 // Make everyone now use a constant of the new type...
1443 Constant *New = ConstantPointerNull::get(NewTy);
1444 assert(New != OldC && "Didn't replace constant??");
1445 OldC->uncheckedReplaceAllUsesWith(New);
1446 OldC->destroyConstant(); // This constant is now dead, destroy it.
1451 static ManagedStatic<ValueMap<char, PointerType,
1452 ConstantPointerNull> > NullPtrConstants;
1454 static char getValType(ConstantPointerNull *) {
1459 ConstantPointerNull *ConstantPointerNull::get(const PointerType *Ty) {
1460 return NullPtrConstants->getOrCreate(Ty, 0);
1463 // destroyConstant - Remove the constant from the constant table...
1465 void ConstantPointerNull::destroyConstant() {
1466 NullPtrConstants->remove(this);
1467 destroyConstantImpl();
1471 //---- UndefValue::get() implementation...
1475 // UndefValue does not take extra "value" argument...
1476 template<class ValType>
1477 struct ConstantCreator<UndefValue, Type, ValType> {
1478 static UndefValue *create(const Type *Ty, const ValType &V) {
1479 return new UndefValue(Ty);
1484 struct ConvertConstantType<UndefValue, Type> {
1485 static void convert(UndefValue *OldC, const Type *NewTy) {
1486 // Make everyone now use a constant of the new type.
1487 Constant *New = UndefValue::get(NewTy);
1488 assert(New != OldC && "Didn't replace constant??");
1489 OldC->uncheckedReplaceAllUsesWith(New);
1490 OldC->destroyConstant(); // This constant is now dead, destroy it.
1495 static ManagedStatic<ValueMap<char, Type, UndefValue> > UndefValueConstants;
1497 static char getValType(UndefValue *) {
1502 UndefValue *UndefValue::get(const Type *Ty) {
1503 return UndefValueConstants->getOrCreate(Ty, 0);
1506 // destroyConstant - Remove the constant from the constant table.
1508 void UndefValue::destroyConstant() {
1509 UndefValueConstants->remove(this);
1510 destroyConstantImpl();
1514 //---- ConstantExpr::get() implementations...
1519 struct ExprMapKeyType {
1520 explicit ExprMapKeyType(unsigned opc, std::vector<Constant*> ops,
1521 unsigned short pred = 0) : opcode(opc), predicate(pred), operands(ops) { }
1524 std::vector<Constant*> operands;
1525 bool operator==(const ExprMapKeyType& that) const {
1526 return this->opcode == that.opcode &&
1527 this->predicate == that.predicate &&
1528 this->operands == that.operands;
1530 bool operator<(const ExprMapKeyType & that) const {
1531 return this->opcode < that.opcode ||
1532 (this->opcode == that.opcode && this->predicate < that.predicate) ||
1533 (this->opcode == that.opcode && this->predicate == that.predicate &&
1534 this->operands < that.operands);
1537 bool operator!=(const ExprMapKeyType& that) const {
1538 return !(*this == that);
1546 struct ConstantCreator<ConstantExpr, Type, ExprMapKeyType> {
1547 static ConstantExpr *create(const Type *Ty, const ExprMapKeyType &V,
1548 unsigned short pred = 0) {
1549 if (Instruction::isCast(V.opcode))
1550 return new UnaryConstantExpr(V.opcode, V.operands[0], Ty);
1551 if ((V.opcode >= Instruction::BinaryOpsBegin &&
1552 V.opcode < Instruction::BinaryOpsEnd))
1553 return new BinaryConstantExpr(V.opcode, V.operands[0], V.operands[1]);
1554 if (V.opcode == Instruction::Select)
1555 return new SelectConstantExpr(V.operands[0], V.operands[1],
1557 if (V.opcode == Instruction::ExtractElement)
1558 return new ExtractElementConstantExpr(V.operands[0], V.operands[1]);
1559 if (V.opcode == Instruction::InsertElement)
1560 return new InsertElementConstantExpr(V.operands[0], V.operands[1],
1562 if (V.opcode == Instruction::ShuffleVector)
1563 return new ShuffleVectorConstantExpr(V.operands[0], V.operands[1],
1565 if (V.opcode == Instruction::GetElementPtr) {
1566 std::vector<Constant*> IdxList(V.operands.begin()+1, V.operands.end());
1567 return GetElementPtrConstantExpr::Create(V.operands[0], IdxList, Ty);
1570 // The compare instructions are weird. We have to encode the predicate
1571 // value and it is combined with the instruction opcode by multiplying
1572 // the opcode by one hundred. We must decode this to get the predicate.
1573 if (V.opcode == Instruction::ICmp)
1574 return new CompareConstantExpr(Ty, Instruction::ICmp, V.predicate,
1575 V.operands[0], V.operands[1]);
1576 if (V.opcode == Instruction::FCmp)
1577 return new CompareConstantExpr(Ty, Instruction::FCmp, V.predicate,
1578 V.operands[0], V.operands[1]);
1579 if (V.opcode == Instruction::VICmp)
1580 return new CompareConstantExpr(Ty, Instruction::VICmp, V.predicate,
1581 V.operands[0], V.operands[1]);
1582 if (V.opcode == Instruction::VFCmp)
1583 return new CompareConstantExpr(Ty, Instruction::VFCmp, V.predicate,
1584 V.operands[0], V.operands[1]);
1585 assert(0 && "Invalid ConstantExpr!");
1591 struct ConvertConstantType<ConstantExpr, Type> {
1592 static void convert(ConstantExpr *OldC, const Type *NewTy) {
1594 switch (OldC->getOpcode()) {
1595 case Instruction::Trunc:
1596 case Instruction::ZExt:
1597 case Instruction::SExt:
1598 case Instruction::FPTrunc:
1599 case Instruction::FPExt:
1600 case Instruction::UIToFP:
1601 case Instruction::SIToFP:
1602 case Instruction::FPToUI:
1603 case Instruction::FPToSI:
1604 case Instruction::PtrToInt:
1605 case Instruction::IntToPtr:
1606 case Instruction::BitCast:
1607 New = ConstantExpr::getCast(OldC->getOpcode(), OldC->getOperand(0),
1610 case Instruction::Select:
1611 New = ConstantExpr::getSelectTy(NewTy, OldC->getOperand(0),
1612 OldC->getOperand(1),
1613 OldC->getOperand(2));
1616 assert(OldC->getOpcode() >= Instruction::BinaryOpsBegin &&
1617 OldC->getOpcode() < Instruction::BinaryOpsEnd);
1618 New = ConstantExpr::getTy(NewTy, OldC->getOpcode(), OldC->getOperand(0),
1619 OldC->getOperand(1));
1621 case Instruction::GetElementPtr:
1622 // Make everyone now use a constant of the new type...
1623 std::vector<Value*> Idx(OldC->op_begin()+1, OldC->op_end());
1624 New = ConstantExpr::getGetElementPtrTy(NewTy, OldC->getOperand(0),
1625 &Idx[0], Idx.size());
1629 assert(New != OldC && "Didn't replace constant??");
1630 OldC->uncheckedReplaceAllUsesWith(New);
1631 OldC->destroyConstant(); // This constant is now dead, destroy it.
1634 } // end namespace llvm
1637 static ExprMapKeyType getValType(ConstantExpr *CE) {
1638 std::vector<Constant*> Operands;
1639 Operands.reserve(CE->getNumOperands());
1640 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
1641 Operands.push_back(cast<Constant>(CE->getOperand(i)));
1642 return ExprMapKeyType(CE->getOpcode(), Operands,
1643 CE->isCompare() ? CE->getPredicate() : 0);
1646 static ManagedStatic<ValueMap<ExprMapKeyType, Type,
1647 ConstantExpr> > ExprConstants;
1649 /// This is a utility function to handle folding of casts and lookup of the
1650 /// cast in the ExprConstants map. It is used by the various get* methods below.
1651 static inline Constant *getFoldedCast(
1652 Instruction::CastOps opc, Constant *C, const Type *Ty) {
1653 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1654 // Fold a few common cases
1655 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1658 // Look up the constant in the table first to ensure uniqueness
1659 std::vector<Constant*> argVec(1, C);
1660 ExprMapKeyType Key(opc, argVec);
1661 return ExprConstants->getOrCreate(Ty, Key);
1664 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, const Type *Ty) {
1665 Instruction::CastOps opc = Instruction::CastOps(oc);
1666 assert(Instruction::isCast(opc) && "opcode out of range");
1667 assert(C && Ty && "Null arguments to getCast");
1668 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1672 assert(0 && "Invalid cast opcode");
1674 case Instruction::Trunc: return getTrunc(C, Ty);
1675 case Instruction::ZExt: return getZExt(C, Ty);
1676 case Instruction::SExt: return getSExt(C, Ty);
1677 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1678 case Instruction::FPExt: return getFPExtend(C, Ty);
1679 case Instruction::UIToFP: return getUIToFP(C, Ty);
1680 case Instruction::SIToFP: return getSIToFP(C, Ty);
1681 case Instruction::FPToUI: return getFPToUI(C, Ty);
1682 case Instruction::FPToSI: return getFPToSI(C, Ty);
1683 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1684 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1685 case Instruction::BitCast: return getBitCast(C, Ty);
1690 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, const Type *Ty) {
1691 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1692 return getCast(Instruction::BitCast, C, Ty);
1693 return getCast(Instruction::ZExt, C, Ty);
1696 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, const Type *Ty) {
1697 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1698 return getCast(Instruction::BitCast, C, Ty);
1699 return getCast(Instruction::SExt, C, Ty);
1702 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, const Type *Ty) {
1703 if (C->getType()->getPrimitiveSizeInBits() == Ty->getPrimitiveSizeInBits())
1704 return getCast(Instruction::BitCast, C, Ty);
1705 return getCast(Instruction::Trunc, C, Ty);
1708 Constant *ConstantExpr::getPointerCast(Constant *S, const Type *Ty) {
1709 assert(isa<PointerType>(S->getType()) && "Invalid cast");
1710 assert((Ty->isInteger() || isa<PointerType>(Ty)) && "Invalid cast");
1712 if (Ty->isInteger())
1713 return getCast(Instruction::PtrToInt, S, Ty);
1714 return getCast(Instruction::BitCast, S, Ty);
1717 Constant *ConstantExpr::getIntegerCast(Constant *C, const Type *Ty,
1719 assert(C->getType()->isInteger() && Ty->isInteger() && "Invalid cast");
1720 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1721 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1722 Instruction::CastOps opcode =
1723 (SrcBits == DstBits ? Instruction::BitCast :
1724 (SrcBits > DstBits ? Instruction::Trunc :
1725 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1726 return getCast(opcode, C, Ty);
1729 Constant *ConstantExpr::getFPCast(Constant *C, const Type *Ty) {
1730 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1732 unsigned SrcBits = C->getType()->getPrimitiveSizeInBits();
1733 unsigned DstBits = Ty->getPrimitiveSizeInBits();
1734 if (SrcBits == DstBits)
1735 return C; // Avoid a useless cast
1736 Instruction::CastOps opcode =
1737 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1738 return getCast(opcode, C, Ty);
1741 Constant *ConstantExpr::getTrunc(Constant *C, const Type *Ty) {
1742 assert(C->getType()->isInteger() && "Trunc operand must be integer");
1743 assert(Ty->isInteger() && "Trunc produces only integral");
1744 assert(C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1745 "SrcTy must be larger than DestTy for Trunc!");
1747 return getFoldedCast(Instruction::Trunc, C, Ty);
1750 Constant *ConstantExpr::getSExt(Constant *C, const Type *Ty) {
1751 assert(C->getType()->isInteger() && "SEXt operand must be integral");
1752 assert(Ty->isInteger() && "SExt produces only integer");
1753 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1754 "SrcTy must be smaller than DestTy for SExt!");
1756 return getFoldedCast(Instruction::SExt, C, Ty);
1759 Constant *ConstantExpr::getZExt(Constant *C, const Type *Ty) {
1760 assert(C->getType()->isInteger() && "ZEXt operand must be integral");
1761 assert(Ty->isInteger() && "ZExt produces only integer");
1762 assert(C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1763 "SrcTy must be smaller than DestTy for ZExt!");
1765 return getFoldedCast(Instruction::ZExt, C, Ty);
1768 Constant *ConstantExpr::getFPTrunc(Constant *C, const Type *Ty) {
1769 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1770 C->getType()->getPrimitiveSizeInBits() > Ty->getPrimitiveSizeInBits()&&
1771 "This is an illegal floating point truncation!");
1772 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1775 Constant *ConstantExpr::getFPExtend(Constant *C, const Type *Ty) {
1776 assert(C->getType()->isFloatingPoint() && Ty->isFloatingPoint() &&
1777 C->getType()->getPrimitiveSizeInBits() < Ty->getPrimitiveSizeInBits()&&
1778 "This is an illegal floating point extension!");
1779 return getFoldedCast(Instruction::FPExt, C, Ty);
1782 Constant *ConstantExpr::getUIToFP(Constant *C, const Type *Ty) {
1783 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1784 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1785 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1786 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1787 "This is an illegal uint to floating point cast!");
1788 return getFoldedCast(Instruction::UIToFP, C, Ty);
1791 Constant *ConstantExpr::getSIToFP(Constant *C, const Type *Ty) {
1792 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1793 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1794 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1795 assert(C->getType()->isIntOrIntVector() && Ty->isFPOrFPVector() &&
1796 "This is an illegal sint to floating point cast!");
1797 return getFoldedCast(Instruction::SIToFP, C, Ty);
1800 Constant *ConstantExpr::getFPToUI(Constant *C, const Type *Ty) {
1801 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1802 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1803 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1804 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1805 "This is an illegal floating point to uint cast!");
1806 return getFoldedCast(Instruction::FPToUI, C, Ty);
1809 Constant *ConstantExpr::getFPToSI(Constant *C, const Type *Ty) {
1810 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1811 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1812 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1813 assert(C->getType()->isFPOrFPVector() && Ty->isIntOrIntVector() &&
1814 "This is an illegal floating point to sint cast!");
1815 return getFoldedCast(Instruction::FPToSI, C, Ty);
1818 Constant *ConstantExpr::getPtrToInt(Constant *C, const Type *DstTy) {
1819 assert(isa<PointerType>(C->getType()) && "PtrToInt source must be pointer");
1820 assert(DstTy->isInteger() && "PtrToInt destination must be integral");
1821 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1824 Constant *ConstantExpr::getIntToPtr(Constant *C, const Type *DstTy) {
1825 assert(C->getType()->isInteger() && "IntToPtr source must be integral");
1826 assert(isa<PointerType>(DstTy) && "IntToPtr destination must be a pointer");
1827 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1830 Constant *ConstantExpr::getBitCast(Constant *C, const Type *DstTy) {
1831 // BitCast implies a no-op cast of type only. No bits change. However, you
1832 // can't cast pointers to anything but pointers.
1833 const Type *SrcTy = C->getType();
1834 assert((isa<PointerType>(SrcTy) == isa<PointerType>(DstTy)) &&
1835 "BitCast cannot cast pointer to non-pointer and vice versa");
1837 // Now we know we're not dealing with mismatched pointer casts (ptr->nonptr
1838 // or nonptr->ptr). For all the other types, the cast is okay if source and
1839 // destination bit widths are identical.
1840 unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
1841 unsigned DstBitSize = DstTy->getPrimitiveSizeInBits();
1842 assert(SrcBitSize == DstBitSize && "BitCast requies types of same width");
1843 return getFoldedCast(Instruction::BitCast, C, DstTy);
1846 Constant *ConstantExpr::getSizeOf(const Type *Ty) {
1847 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1848 Constant *GEPIdx = ConstantInt::get(Type::Int32Ty, 1);
1850 getGetElementPtr(getNullValue(PointerType::getUnqual(Ty)), &GEPIdx, 1);
1851 return getCast(Instruction::PtrToInt, GEP, Type::Int64Ty);
1854 Constant *ConstantExpr::getTy(const Type *ReqTy, unsigned Opcode,
1855 Constant *C1, Constant *C2) {
1856 // Check the operands for consistency first
1857 assert(Opcode >= Instruction::BinaryOpsBegin &&
1858 Opcode < Instruction::BinaryOpsEnd &&
1859 "Invalid opcode in binary constant expression");
1860 assert(C1->getType() == C2->getType() &&
1861 "Operand types in binary constant expression should match");
1863 if (ReqTy == C1->getType() || ReqTy == Type::Int1Ty)
1864 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1865 return FC; // Fold a few common cases...
1867 std::vector<Constant*> argVec(1, C1); argVec.push_back(C2);
1868 ExprMapKeyType Key(Opcode, argVec);
1869 return ExprConstants->getOrCreate(ReqTy, Key);
1872 Constant *ConstantExpr::getCompareTy(unsigned short predicate,
1873 Constant *C1, Constant *C2) {
1874 switch (predicate) {
1875 default: assert(0 && "Invalid CmpInst predicate");
1876 case FCmpInst::FCMP_FALSE: case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_OGT:
1877 case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OLE:
1878 case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_ORD: case FCmpInst::FCMP_UNO:
1879 case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UGT: case FCmpInst::FCMP_UGE:
1880 case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_ULE: case FCmpInst::FCMP_UNE:
1881 case FCmpInst::FCMP_TRUE:
1882 return getFCmp(predicate, C1, C2);
1883 case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGT:
1884 case ICmpInst::ICMP_UGE: case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE:
1885 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_SGE: case ICmpInst::ICMP_SLT:
1886 case ICmpInst::ICMP_SLE:
1887 return getICmp(predicate, C1, C2);
1891 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2) {
1894 case Instruction::Add:
1895 case Instruction::Sub:
1896 case Instruction::Mul:
1897 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1898 assert((C1->getType()->isInteger() || C1->getType()->isFloatingPoint() ||
1899 isa<VectorType>(C1->getType())) &&
1900 "Tried to create an arithmetic operation on a non-arithmetic type!");
1902 case Instruction::UDiv:
1903 case Instruction::SDiv:
1904 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1905 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
1906 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
1907 "Tried to create an arithmetic operation on a non-arithmetic type!");
1909 case Instruction::FDiv:
1910 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1911 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
1912 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
1913 && "Tried to create an arithmetic operation on a non-arithmetic type!");
1915 case Instruction::URem:
1916 case Instruction::SRem:
1917 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1918 assert((C1->getType()->isInteger() || (isa<VectorType>(C1->getType()) &&
1919 cast<VectorType>(C1->getType())->getElementType()->isInteger())) &&
1920 "Tried to create an arithmetic operation on a non-arithmetic type!");
1922 case Instruction::FRem:
1923 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1924 assert((C1->getType()->isFloatingPoint() || (isa<VectorType>(C1->getType())
1925 && cast<VectorType>(C1->getType())->getElementType()->isFloatingPoint()))
1926 && "Tried to create an arithmetic operation on a non-arithmetic type!");
1928 case Instruction::And:
1929 case Instruction::Or:
1930 case Instruction::Xor:
1931 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1932 assert((C1->getType()->isInteger() || isa<VectorType>(C1->getType())) &&
1933 "Tried to create a logical operation on a non-integral type!");
1935 case Instruction::Shl:
1936 case Instruction::LShr:
1937 case Instruction::AShr:
1938 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1939 assert(C1->getType()->isInteger() &&
1940 "Tried to create a shift operation on a non-integer type!");
1947 return getTy(C1->getType(), Opcode, C1, C2);
1950 Constant *ConstantExpr::getCompare(unsigned short pred,
1951 Constant *C1, Constant *C2) {
1952 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1953 return getCompareTy(pred, C1, C2);
1956 Constant *ConstantExpr::getSelectTy(const Type *ReqTy, Constant *C,
1957 Constant *V1, Constant *V2) {
1958 assert(C->getType() == Type::Int1Ty && "Select condition must be i1!");
1959 assert(V1->getType() == V2->getType() && "Select value types must match!");
1960 assert(V1->getType()->isFirstClassType() && "Cannot select aggregate type!");
1962 if (ReqTy == V1->getType())
1963 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1964 return SC; // Fold common cases
1966 std::vector<Constant*> argVec(3, C);
1969 ExprMapKeyType Key(Instruction::Select, argVec);
1970 return ExprConstants->getOrCreate(ReqTy, Key);
1973 Constant *ConstantExpr::getGetElementPtrTy(const Type *ReqTy, Constant *C,
1976 assert(GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx, true) &&
1977 "GEP indices invalid!");
1979 if (Constant *FC = ConstantFoldGetElementPtr(C, (Constant**)Idxs, NumIdx))
1980 return FC; // Fold a few common cases...
1982 assert(isa<PointerType>(C->getType()) &&
1983 "Non-pointer type for constant GetElementPtr expression");
1984 // Look up the constant in the table first to ensure uniqueness
1985 std::vector<Constant*> ArgVec;
1986 ArgVec.reserve(NumIdx+1);
1987 ArgVec.push_back(C);
1988 for (unsigned i = 0; i != NumIdx; ++i)
1989 ArgVec.push_back(cast<Constant>(Idxs[i]));
1990 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec);
1991 return ExprConstants->getOrCreate(ReqTy, Key);
1994 Constant *ConstantExpr::getGetElementPtr(Constant *C, Value* const *Idxs,
1996 // Get the result type of the getelementptr!
1998 GetElementPtrInst::getIndexedType(C->getType(), Idxs, Idxs+NumIdx, true);
1999 assert(Ty && "GEP indices invalid!");
2000 unsigned As = cast<PointerType>(C->getType())->getAddressSpace();
2001 return getGetElementPtrTy(PointerType::get(Ty, As), C, Idxs, NumIdx);
2004 Constant *ConstantExpr::getGetElementPtr(Constant *C, Constant* const *Idxs,
2006 return getGetElementPtr(C, (Value* const *)Idxs, NumIdx);
2011 ConstantExpr::getICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2012 assert(LHS->getType() == RHS->getType());
2013 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2014 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2016 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2017 return FC; // Fold a few common cases...
2019 // Look up the constant in the table first to ensure uniqueness
2020 std::vector<Constant*> ArgVec;
2021 ArgVec.push_back(LHS);
2022 ArgVec.push_back(RHS);
2023 // Get the key type with both the opcode and predicate
2024 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
2025 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2029 ConstantExpr::getFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2030 assert(LHS->getType() == RHS->getType());
2031 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2033 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2034 return FC; // Fold a few common cases...
2036 // Look up the constant in the table first to ensure uniqueness
2037 std::vector<Constant*> ArgVec;
2038 ArgVec.push_back(LHS);
2039 ArgVec.push_back(RHS);
2040 // Get the key type with both the opcode and predicate
2041 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
2042 return ExprConstants->getOrCreate(Type::Int1Ty, Key);
2046 ConstantExpr::getVICmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2047 assert(isa<VectorType>(LHS->getType()) &&
2048 "Tried to create vicmp operation on non-vector type!");
2049 assert(LHS->getType() == RHS->getType());
2050 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2051 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid VICmp Predicate");
2053 const VectorType *VTy = cast<VectorType>(LHS->getType());
2054 const Type *EltTy = VTy->getElementType();
2055 unsigned NumElts = VTy->getNumElements();
2057 SmallVector<Constant *, 8> Elts;
2058 for (unsigned i = 0; i != NumElts; ++i) {
2059 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2060 RHS->getOperand(i));
2062 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2064 Elts.push_back(ConstantInt::getAllOnesValue(EltTy));
2066 Elts.push_back(ConstantInt::get(EltTy, 0ULL));
2069 if (Elts.size() == NumElts)
2070 return ConstantVector::get(&Elts[0], Elts.size());
2072 // Look up the constant in the table first to ensure uniqueness
2073 std::vector<Constant*> ArgVec;
2074 ArgVec.push_back(LHS);
2075 ArgVec.push_back(RHS);
2076 // Get the key type with both the opcode and predicate
2077 const ExprMapKeyType Key(Instruction::VICmp, ArgVec, pred);
2078 return ExprConstants->getOrCreate(LHS->getType(), Key);
2082 ConstantExpr::getVFCmp(unsigned short pred, Constant* LHS, Constant* RHS) {
2083 assert(isa<VectorType>(LHS->getType()) &&
2084 "Tried to create vfcmp operation on non-vector type!");
2085 assert(LHS->getType() == RHS->getType());
2086 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid VFCmp Predicate");
2088 const VectorType *VTy = cast<VectorType>(LHS->getType());
2089 unsigned NumElts = VTy->getNumElements();
2090 const Type *EltTy = VTy->getElementType();
2091 const Type *REltTy = IntegerType::get(EltTy->getPrimitiveSizeInBits());
2092 const Type *ResultTy = VectorType::get(REltTy, NumElts);
2094 SmallVector<Constant *, 8> Elts;
2095 for (unsigned i = 0; i != NumElts; ++i) {
2096 Constant *FC = ConstantFoldCompareInstruction(pred, LHS->getOperand(i),
2097 RHS->getOperand(i));
2099 uint64_t Val = cast<ConstantInt>(FC)->getZExtValue();
2101 Elts.push_back(ConstantInt::getAllOnesValue(REltTy));
2103 Elts.push_back(ConstantInt::get(REltTy, 0ULL));
2106 if (Elts.size() == NumElts)
2107 return ConstantVector::get(&Elts[0], Elts.size());
2109 // Look up the constant in the table first to ensure uniqueness
2110 std::vector<Constant*> ArgVec;
2111 ArgVec.push_back(LHS);
2112 ArgVec.push_back(RHS);
2113 // Get the key type with both the opcode and predicate
2114 const ExprMapKeyType Key(Instruction::VFCmp, ArgVec, pred);
2115 return ExprConstants->getOrCreate(ResultTy, Key);
2118 Constant *ConstantExpr::getExtractElementTy(const Type *ReqTy, Constant *Val,
2120 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
2121 return FC; // Fold a few common cases...
2122 // Look up the constant in the table first to ensure uniqueness
2123 std::vector<Constant*> ArgVec(1, Val);
2124 ArgVec.push_back(Idx);
2125 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
2126 return ExprConstants->getOrCreate(ReqTy, Key);
2129 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
2130 assert(isa<VectorType>(Val->getType()) &&
2131 "Tried to create extractelement operation on non-vector type!");
2132 assert(Idx->getType() == Type::Int32Ty &&
2133 "Extractelement index must be i32 type!");
2134 return getExtractElementTy(cast<VectorType>(Val->getType())->getElementType(),
2138 Constant *ConstantExpr::getInsertElementTy(const Type *ReqTy, Constant *Val,
2139 Constant *Elt, Constant *Idx) {
2140 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2141 return FC; // Fold a few common cases...
2142 // Look up the constant in the table first to ensure uniqueness
2143 std::vector<Constant*> ArgVec(1, Val);
2144 ArgVec.push_back(Elt);
2145 ArgVec.push_back(Idx);
2146 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
2147 return ExprConstants->getOrCreate(ReqTy, Key);
2150 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2152 assert(isa<VectorType>(Val->getType()) &&
2153 "Tried to create insertelement operation on non-vector type!");
2154 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
2155 && "Insertelement types must match!");
2156 assert(Idx->getType() == Type::Int32Ty &&
2157 "Insertelement index must be i32 type!");
2158 return getInsertElementTy(cast<VectorType>(Val->getType())->getElementType(),
2162 Constant *ConstantExpr::getShuffleVectorTy(const Type *ReqTy, Constant *V1,
2163 Constant *V2, Constant *Mask) {
2164 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2165 return FC; // Fold a few common cases...
2166 // Look up the constant in the table first to ensure uniqueness
2167 std::vector<Constant*> ArgVec(1, V1);
2168 ArgVec.push_back(V2);
2169 ArgVec.push_back(Mask);
2170 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
2171 return ExprConstants->getOrCreate(ReqTy, Key);
2174 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2176 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2177 "Invalid shuffle vector constant expr operands!");
2178 return getShuffleVectorTy(V1->getType(), V1, V2, Mask);
2181 Constant *ConstantExpr::getZeroValueForNegationExpr(const Type *Ty) {
2182 if (const VectorType *PTy = dyn_cast<VectorType>(Ty))
2183 if (PTy->getElementType()->isFloatingPoint()) {
2184 std::vector<Constant*> zeros(PTy->getNumElements(),
2185 ConstantFP::getNegativeZero(PTy->getElementType()));
2186 return ConstantVector::get(PTy, zeros);
2189 if (Ty->isFloatingPoint())
2190 return ConstantFP::getNegativeZero(Ty);
2192 return Constant::getNullValue(Ty);
2195 // destroyConstant - Remove the constant from the constant table...
2197 void ConstantExpr::destroyConstant() {
2198 ExprConstants->remove(this);
2199 destroyConstantImpl();
2202 const char *ConstantExpr::getOpcodeName() const {
2203 return Instruction::getOpcodeName(getOpcode());
2206 //===----------------------------------------------------------------------===//
2207 // replaceUsesOfWithOnConstant implementations
2209 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2210 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2213 /// Note that we intentionally replace all uses of From with To here. Consider
2214 /// a large array that uses 'From' 1000 times. By handling this case all here,
2215 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2216 /// single invocation handles all 1000 uses. Handling them one at a time would
2217 /// work, but would be really slow because it would have to unique each updated
2219 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2221 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2222 Constant *ToC = cast<Constant>(To);
2224 std::pair<ArrayConstantsTy::MapKey, Constant*> Lookup;
2225 Lookup.first.first = getType();
2226 Lookup.second = this;
2228 std::vector<Constant*> &Values = Lookup.first.second;
2229 Values.reserve(getNumOperands()); // Build replacement array.
2231 // Fill values with the modified operands of the constant array. Also,
2232 // compute whether this turns into an all-zeros array.
2233 bool isAllZeros = false;
2234 unsigned NumUpdated = 0;
2235 if (!ToC->isNullValue()) {
2236 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2237 Constant *Val = cast<Constant>(O->get());
2242 Values.push_back(Val);
2246 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2247 Constant *Val = cast<Constant>(O->get());
2252 Values.push_back(Val);
2253 if (isAllZeros) isAllZeros = Val->isNullValue();
2257 Constant *Replacement = 0;
2259 Replacement = ConstantAggregateZero::get(getType());
2261 // Check to see if we have this array type already.
2263 ArrayConstantsTy::MapTy::iterator I =
2264 ArrayConstants->InsertOrGetItem(Lookup, Exists);
2267 Replacement = I->second;
2269 // Okay, the new shape doesn't exist in the system yet. Instead of
2270 // creating a new constant array, inserting it, replaceallusesof'ing the
2271 // old with the new, then deleting the old... just update the current one
2273 ArrayConstants->MoveConstantToNewSlot(this, I);
2275 // Update to the new value. Optimize for the case when we have a single
2276 // operand that we're changing, but handle bulk updates efficiently.
2277 if (NumUpdated == 1) {
2278 unsigned OperandToUpdate = U-OperandList;
2279 assert(getOperand(OperandToUpdate) == From &&
2280 "ReplaceAllUsesWith broken!");
2281 setOperand(OperandToUpdate, ToC);
2283 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2284 if (getOperand(i) == From)
2291 // Otherwise, I do need to replace this with an existing value.
2292 assert(Replacement != this && "I didn't contain From!");
2294 // Everyone using this now uses the replacement.
2295 uncheckedReplaceAllUsesWith(Replacement);
2297 // Delete the old constant!
2301 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2303 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2304 Constant *ToC = cast<Constant>(To);
2306 unsigned OperandToUpdate = U-OperandList;
2307 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2309 std::pair<StructConstantsTy::MapKey, Constant*> Lookup;
2310 Lookup.first.first = getType();
2311 Lookup.second = this;
2312 std::vector<Constant*> &Values = Lookup.first.second;
2313 Values.reserve(getNumOperands()); // Build replacement struct.
2316 // Fill values with the modified operands of the constant struct. Also,
2317 // compute whether this turns into an all-zeros struct.
2318 bool isAllZeros = false;
2319 if (!ToC->isNullValue()) {
2320 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O)
2321 Values.push_back(cast<Constant>(O->get()));
2324 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2325 Constant *Val = cast<Constant>(O->get());
2326 Values.push_back(Val);
2327 if (isAllZeros) isAllZeros = Val->isNullValue();
2330 Values[OperandToUpdate] = ToC;
2332 Constant *Replacement = 0;
2334 Replacement = ConstantAggregateZero::get(getType());
2336 // Check to see if we have this array type already.
2338 StructConstantsTy::MapTy::iterator I =
2339 StructConstants->InsertOrGetItem(Lookup, Exists);
2342 Replacement = I->second;
2344 // Okay, the new shape doesn't exist in the system yet. Instead of
2345 // creating a new constant struct, inserting it, replaceallusesof'ing the
2346 // old with the new, then deleting the old... just update the current one
2348 StructConstants->MoveConstantToNewSlot(this, I);
2350 // Update to the new value.
2351 setOperand(OperandToUpdate, ToC);
2356 assert(Replacement != this && "I didn't contain From!");
2358 // Everyone using this now uses the replacement.
2359 uncheckedReplaceAllUsesWith(Replacement);
2361 // Delete the old constant!
2365 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2367 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2369 std::vector<Constant*> Values;
2370 Values.reserve(getNumOperands()); // Build replacement array...
2371 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2372 Constant *Val = getOperand(i);
2373 if (Val == From) Val = cast<Constant>(To);
2374 Values.push_back(Val);
2377 Constant *Replacement = ConstantVector::get(getType(), Values);
2378 assert(Replacement != this && "I didn't contain From!");
2380 // Everyone using this now uses the replacement.
2381 uncheckedReplaceAllUsesWith(Replacement);
2383 // Delete the old constant!
2387 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2389 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2390 Constant *To = cast<Constant>(ToV);
2392 Constant *Replacement = 0;
2393 if (getOpcode() == Instruction::GetElementPtr) {
2394 SmallVector<Constant*, 8> Indices;
2395 Constant *Pointer = getOperand(0);
2396 Indices.reserve(getNumOperands()-1);
2397 if (Pointer == From) Pointer = To;
2399 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2400 Constant *Val = getOperand(i);
2401 if (Val == From) Val = To;
2402 Indices.push_back(Val);
2404 Replacement = ConstantExpr::getGetElementPtr(Pointer,
2405 &Indices[0], Indices.size());
2406 } else if (isCast()) {
2407 assert(getOperand(0) == From && "Cast only has one use!");
2408 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2409 } else if (getOpcode() == Instruction::Select) {
2410 Constant *C1 = getOperand(0);
2411 Constant *C2 = getOperand(1);
2412 Constant *C3 = getOperand(2);
2413 if (C1 == From) C1 = To;
2414 if (C2 == From) C2 = To;
2415 if (C3 == From) C3 = To;
2416 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2417 } else if (getOpcode() == Instruction::ExtractElement) {
2418 Constant *C1 = getOperand(0);
2419 Constant *C2 = getOperand(1);
2420 if (C1 == From) C1 = To;
2421 if (C2 == From) C2 = To;
2422 Replacement = ConstantExpr::getExtractElement(C1, C2);
2423 } else if (getOpcode() == Instruction::InsertElement) {
2424 Constant *C1 = getOperand(0);
2425 Constant *C2 = getOperand(1);
2426 Constant *C3 = getOperand(1);
2427 if (C1 == From) C1 = To;
2428 if (C2 == From) C2 = To;
2429 if (C3 == From) C3 = To;
2430 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2431 } else if (getOpcode() == Instruction::ShuffleVector) {
2432 Constant *C1 = getOperand(0);
2433 Constant *C2 = getOperand(1);
2434 Constant *C3 = getOperand(2);
2435 if (C1 == From) C1 = To;
2436 if (C2 == From) C2 = To;
2437 if (C3 == From) C3 = To;
2438 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2439 } else if (isCompare()) {
2440 Constant *C1 = getOperand(0);
2441 Constant *C2 = getOperand(1);
2442 if (C1 == From) C1 = To;
2443 if (C2 == From) C2 = To;
2444 if (getOpcode() == Instruction::ICmp)
2445 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2447 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2448 } else if (getNumOperands() == 2) {
2449 Constant *C1 = getOperand(0);
2450 Constant *C2 = getOperand(1);
2451 if (C1 == From) C1 = To;
2452 if (C2 == From) C2 = To;
2453 Replacement = ConstantExpr::get(getOpcode(), C1, C2);
2455 assert(0 && "Unknown ConstantExpr type!");
2459 assert(Replacement != this && "I didn't contain From!");
2461 // Everyone using this now uses the replacement.
2462 uncheckedReplaceAllUsesWith(Replacement);
2464 // Delete the old constant!
2469 /// getStringValue - Turn an LLVM constant pointer that eventually points to a
2470 /// global into a string value. Return an empty string if we can't do it.
2471 /// Parameter Chop determines if the result is chopped at the first null
2474 std::string Constant::getStringValue(bool Chop, unsigned Offset) {
2475 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(this)) {
2476 if (GV->hasInitializer() && isa<ConstantArray>(GV->getInitializer())) {
2477 ConstantArray *Init = cast<ConstantArray>(GV->getInitializer());
2478 if (Init->isString()) {
2479 std::string Result = Init->getAsString();
2480 if (Offset < Result.size()) {
2481 // If we are pointing INTO The string, erase the beginning...
2482 Result.erase(Result.begin(), Result.begin()+Offset);
2484 // Take off the null terminator, and any string fragments after it.
2486 std::string::size_type NullPos = Result.find_first_of((char)0);
2487 if (NullPos != std::string::npos)
2488 Result.erase(Result.begin()+NullPos, Result.end());
2494 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(this)) {
2495 if (CE->getOpcode() == Instruction::GetElementPtr) {
2496 // Turn a gep into the specified offset.
2497 if (CE->getNumOperands() == 3 &&
2498 cast<Constant>(CE->getOperand(1))->isNullValue() &&
2499 isa<ConstantInt>(CE->getOperand(2))) {
2500 Offset += cast<ConstantInt>(CE->getOperand(2))->getZExtValue();
2501 return CE->getOperand(0)->getStringValue(Chop, Offset);