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 "LLVMContextImpl.h"
16 #include "ConstantFold.h"
17 #include "llvm/DerivedTypes.h"
18 #include "llvm/GlobalValue.h"
19 #include "llvm/Instructions.h"
20 #include "llvm/Module.h"
21 #include "llvm/Operator.h"
22 #include "llvm/ADT/FoldingSet.h"
23 #include "llvm/ADT/StringExtras.h"
24 #include "llvm/ADT/StringMap.h"
25 #include "llvm/Support/Compiler.h"
26 #include "llvm/Support/Debug.h"
27 #include "llvm/Support/ErrorHandling.h"
28 #include "llvm/Support/ManagedStatic.h"
29 #include "llvm/Support/MathExtras.h"
30 #include "llvm/Support/raw_ostream.h"
31 #include "llvm/Support/GetElementPtrTypeIterator.h"
32 #include "llvm/ADT/DenseMap.h"
33 #include "llvm/ADT/SmallVector.h"
34 #include "llvm/ADT/STLExtras.h"
39 //===----------------------------------------------------------------------===//
41 //===----------------------------------------------------------------------===//
43 void Constant::anchor() { }
45 bool Constant::isNegativeZeroValue() const {
46 // Floating point values have an explicit -0.0 value.
47 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
48 return CFP->isZero() && CFP->isNegative();
50 // Otherwise, just use +0.0.
54 bool Constant::isNullValue() const {
56 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
60 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
61 return CFP->isZero() && !CFP->isNegative();
63 // constant zero is zero for aggregates and cpnull is null for pointers.
64 return isa<ConstantAggregateZero>(this) || isa<ConstantPointerNull>(this);
67 bool Constant::isAllOnesValue() const {
68 // Check for -1 integers
69 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
70 return CI->isMinusOne();
72 // Check for FP which are bitcasted from -1 integers
73 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
74 return CFP->getValueAPF().bitcastToAPInt().isAllOnesValue();
76 // Check for constant vectors which are splats of -1 values.
77 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
78 if (Constant *Splat = CV->getSplatValue())
79 return Splat->isAllOnesValue();
84 // Constructor to create a '0' constant of arbitrary type...
85 Constant *Constant::getNullValue(Type *Ty) {
86 switch (Ty->getTypeID()) {
87 case Type::IntegerTyID:
88 return ConstantInt::get(Ty, 0);
90 return ConstantFP::get(Ty->getContext(),
91 APFloat::getZero(APFloat::IEEEhalf));
93 return ConstantFP::get(Ty->getContext(),
94 APFloat::getZero(APFloat::IEEEsingle));
95 case Type::DoubleTyID:
96 return ConstantFP::get(Ty->getContext(),
97 APFloat::getZero(APFloat::IEEEdouble));
98 case Type::X86_FP80TyID:
99 return ConstantFP::get(Ty->getContext(),
100 APFloat::getZero(APFloat::x87DoubleExtended));
101 case Type::FP128TyID:
102 return ConstantFP::get(Ty->getContext(),
103 APFloat::getZero(APFloat::IEEEquad));
104 case Type::PPC_FP128TyID:
105 return ConstantFP::get(Ty->getContext(),
106 APFloat(APInt::getNullValue(128)));
107 case Type::PointerTyID:
108 return ConstantPointerNull::get(cast<PointerType>(Ty));
109 case Type::StructTyID:
110 case Type::ArrayTyID:
111 case Type::VectorTyID:
112 return ConstantAggregateZero::get(Ty);
114 // Function, Label, or Opaque type?
115 assert(0 && "Cannot create a null constant of that type!");
120 Constant *Constant::getIntegerValue(Type *Ty, const APInt &V) {
121 Type *ScalarTy = Ty->getScalarType();
123 // Create the base integer constant.
124 Constant *C = ConstantInt::get(Ty->getContext(), V);
126 // Convert an integer to a pointer, if necessary.
127 if (PointerType *PTy = dyn_cast<PointerType>(ScalarTy))
128 C = ConstantExpr::getIntToPtr(C, PTy);
130 // Broadcast a scalar to a vector, if necessary.
131 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
132 C = ConstantVector::get(std::vector<Constant *>(VTy->getNumElements(), C));
137 Constant *Constant::getAllOnesValue(Type *Ty) {
138 if (IntegerType *ITy = dyn_cast<IntegerType>(Ty))
139 return ConstantInt::get(Ty->getContext(),
140 APInt::getAllOnesValue(ITy->getBitWidth()));
142 if (Ty->isFloatingPointTy()) {
143 APFloat FL = APFloat::getAllOnesValue(Ty->getPrimitiveSizeInBits(),
144 !Ty->isPPC_FP128Ty());
145 return ConstantFP::get(Ty->getContext(), FL);
148 SmallVector<Constant*, 16> Elts;
149 VectorType *VTy = cast<VectorType>(Ty);
150 Elts.resize(VTy->getNumElements(), getAllOnesValue(VTy->getElementType()));
151 assert(Elts[0] && "Invalid AllOnes value!");
152 return cast<ConstantVector>(ConstantVector::get(Elts));
155 void Constant::destroyConstantImpl() {
156 // When a Constant is destroyed, there may be lingering
157 // references to the constant by other constants in the constant pool. These
158 // constants are implicitly dependent on the module that is being deleted,
159 // but they don't know that. Because we only find out when the CPV is
160 // deleted, we must now notify all of our users (that should only be
161 // Constants) that they are, in fact, invalid now and should be deleted.
163 while (!use_empty()) {
164 Value *V = use_back();
165 #ifndef NDEBUG // Only in -g mode...
166 if (!isa<Constant>(V)) {
167 dbgs() << "While deleting: " << *this
168 << "\n\nUse still stuck around after Def is destroyed: "
172 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
173 Constant *CV = cast<Constant>(V);
174 CV->destroyConstant();
176 // The constant should remove itself from our use list...
177 assert((use_empty() || use_back() != V) && "Constant not removed!");
180 // Value has no outstanding references it is safe to delete it now...
184 /// canTrap - Return true if evaluation of this constant could trap. This is
185 /// true for things like constant expressions that could divide by zero.
186 bool Constant::canTrap() const {
187 assert(getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
188 // The only thing that could possibly trap are constant exprs.
189 const ConstantExpr *CE = dyn_cast<ConstantExpr>(this);
190 if (!CE) return false;
192 // ConstantExpr traps if any operands can trap.
193 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
194 if (CE->getOperand(i)->canTrap())
197 // Otherwise, only specific operations can trap.
198 switch (CE->getOpcode()) {
201 case Instruction::UDiv:
202 case Instruction::SDiv:
203 case Instruction::FDiv:
204 case Instruction::URem:
205 case Instruction::SRem:
206 case Instruction::FRem:
207 // Div and rem can trap if the RHS is not known to be non-zero.
208 if (!isa<ConstantInt>(CE->getOperand(1)) ||CE->getOperand(1)->isNullValue())
214 /// isConstantUsed - Return true if the constant has users other than constant
215 /// exprs and other dangling things.
216 bool Constant::isConstantUsed() const {
217 for (const_use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
218 const Constant *UC = dyn_cast<Constant>(*UI);
219 if (UC == 0 || isa<GlobalValue>(UC))
222 if (UC->isConstantUsed())
230 /// getRelocationInfo - This method classifies the entry according to
231 /// whether or not it may generate a relocation entry. This must be
232 /// conservative, so if it might codegen to a relocatable entry, it should say
233 /// so. The return values are:
235 /// NoRelocation: This constant pool entry is guaranteed to never have a
236 /// relocation applied to it (because it holds a simple constant like
238 /// LocalRelocation: This entry has relocations, but the entries are
239 /// guaranteed to be resolvable by the static linker, so the dynamic
240 /// linker will never see them.
241 /// GlobalRelocations: This entry may have arbitrary relocations.
243 /// FIXME: This really should not be in VMCore.
244 Constant::PossibleRelocationsTy Constant::getRelocationInfo() const {
245 if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
246 if (GV->hasLocalLinkage() || GV->hasHiddenVisibility())
247 return LocalRelocation; // Local to this file/library.
248 return GlobalRelocations; // Global reference.
251 if (const BlockAddress *BA = dyn_cast<BlockAddress>(this))
252 return BA->getFunction()->getRelocationInfo();
254 // While raw uses of blockaddress need to be relocated, differences between
255 // two of them don't when they are for labels in the same function. This is a
256 // common idiom when creating a table for the indirect goto extension, so we
257 // handle it efficiently here.
258 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(this))
259 if (CE->getOpcode() == Instruction::Sub) {
260 ConstantExpr *LHS = dyn_cast<ConstantExpr>(CE->getOperand(0));
261 ConstantExpr *RHS = dyn_cast<ConstantExpr>(CE->getOperand(1));
263 LHS->getOpcode() == Instruction::PtrToInt &&
264 RHS->getOpcode() == Instruction::PtrToInt &&
265 isa<BlockAddress>(LHS->getOperand(0)) &&
266 isa<BlockAddress>(RHS->getOperand(0)) &&
267 cast<BlockAddress>(LHS->getOperand(0))->getFunction() ==
268 cast<BlockAddress>(RHS->getOperand(0))->getFunction())
272 PossibleRelocationsTy Result = NoRelocation;
273 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
274 Result = std::max(Result,
275 cast<Constant>(getOperand(i))->getRelocationInfo());
281 /// getVectorElements - This method, which is only valid on constant of vector
282 /// type, returns the elements of the vector in the specified smallvector.
283 /// This handles breaking down a vector undef into undef elements, etc. For
284 /// constant exprs and other cases we can't handle, we return an empty vector.
285 void Constant::getVectorElements(SmallVectorImpl<Constant*> &Elts) const {
286 assert(getType()->isVectorTy() && "Not a vector constant!");
288 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this)) {
289 for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i)
290 Elts.push_back(CV->getOperand(i));
294 VectorType *VT = cast<VectorType>(getType());
295 if (isa<ConstantAggregateZero>(this)) {
296 Elts.assign(VT->getNumElements(),
297 Constant::getNullValue(VT->getElementType()));
301 if (isa<UndefValue>(this)) {
302 Elts.assign(VT->getNumElements(), UndefValue::get(VT->getElementType()));
306 // Unknown type, must be constant expr etc.
310 /// removeDeadUsersOfConstant - If the specified constantexpr is dead, remove
311 /// it. This involves recursively eliminating any dead users of the
313 static bool removeDeadUsersOfConstant(const Constant *C) {
314 if (isa<GlobalValue>(C)) return false; // Cannot remove this
316 while (!C->use_empty()) {
317 const Constant *User = dyn_cast<Constant>(C->use_back());
318 if (!User) return false; // Non-constant usage;
319 if (!removeDeadUsersOfConstant(User))
320 return false; // Constant wasn't dead
323 const_cast<Constant*>(C)->destroyConstant();
328 /// removeDeadConstantUsers - If there are any dead constant users dangling
329 /// off of this constant, remove them. This method is useful for clients
330 /// that want to check to see if a global is unused, but don't want to deal
331 /// with potentially dead constants hanging off of the globals.
332 void Constant::removeDeadConstantUsers() const {
333 Value::const_use_iterator I = use_begin(), E = use_end();
334 Value::const_use_iterator LastNonDeadUser = E;
336 const Constant *User = dyn_cast<Constant>(*I);
343 if (!removeDeadUsersOfConstant(User)) {
344 // If the constant wasn't dead, remember that this was the last live use
345 // and move on to the next constant.
351 // If the constant was dead, then the iterator is invalidated.
352 if (LastNonDeadUser == E) {
364 //===----------------------------------------------------------------------===//
366 //===----------------------------------------------------------------------===//
368 void ConstantInt::anchor() { }
370 ConstantInt::ConstantInt(IntegerType *Ty, const APInt& V)
371 : Constant(Ty, ConstantIntVal, 0, 0), Val(V) {
372 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
375 ConstantInt *ConstantInt::getTrue(LLVMContext &Context) {
376 LLVMContextImpl *pImpl = Context.pImpl;
377 if (!pImpl->TheTrueVal)
378 pImpl->TheTrueVal = ConstantInt::get(Type::getInt1Ty(Context), 1);
379 return pImpl->TheTrueVal;
382 ConstantInt *ConstantInt::getFalse(LLVMContext &Context) {
383 LLVMContextImpl *pImpl = Context.pImpl;
384 if (!pImpl->TheFalseVal)
385 pImpl->TheFalseVal = ConstantInt::get(Type::getInt1Ty(Context), 0);
386 return pImpl->TheFalseVal;
389 Constant *ConstantInt::getTrue(Type *Ty) {
390 VectorType *VTy = dyn_cast<VectorType>(Ty);
392 assert(Ty->isIntegerTy(1) && "True must be i1 or vector of i1.");
393 return ConstantInt::getTrue(Ty->getContext());
395 assert(VTy->getElementType()->isIntegerTy(1) &&
396 "True must be vector of i1 or i1.");
397 SmallVector<Constant*, 16> Splat(VTy->getNumElements(),
398 ConstantInt::getTrue(Ty->getContext()));
399 return ConstantVector::get(Splat);
402 Constant *ConstantInt::getFalse(Type *Ty) {
403 VectorType *VTy = dyn_cast<VectorType>(Ty);
405 assert(Ty->isIntegerTy(1) && "False must be i1 or vector of i1.");
406 return ConstantInt::getFalse(Ty->getContext());
408 assert(VTy->getElementType()->isIntegerTy(1) &&
409 "False must be vector of i1 or i1.");
410 SmallVector<Constant*, 16> Splat(VTy->getNumElements(),
411 ConstantInt::getFalse(Ty->getContext()));
412 return ConstantVector::get(Splat);
416 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
417 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
418 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
419 // compare APInt's of different widths, which would violate an APInt class
420 // invariant which generates an assertion.
421 ConstantInt *ConstantInt::get(LLVMContext &Context, const APInt &V) {
422 // Get the corresponding integer type for the bit width of the value.
423 IntegerType *ITy = IntegerType::get(Context, V.getBitWidth());
424 // get an existing value or the insertion position
425 DenseMapAPIntKeyInfo::KeyTy Key(V, ITy);
426 ConstantInt *&Slot = Context.pImpl->IntConstants[Key];
427 if (!Slot) Slot = new ConstantInt(ITy, V);
431 Constant *ConstantInt::get(Type *Ty, uint64_t V, bool isSigned) {
432 Constant *C = get(cast<IntegerType>(Ty->getScalarType()), V, isSigned);
434 // For vectors, broadcast the value.
435 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
436 return ConstantVector::get(SmallVector<Constant*,
437 16>(VTy->getNumElements(), C));
442 ConstantInt* ConstantInt::get(IntegerType* Ty, uint64_t V,
444 return get(Ty->getContext(), APInt(Ty->getBitWidth(), V, isSigned));
447 ConstantInt* ConstantInt::getSigned(IntegerType* Ty, int64_t V) {
448 return get(Ty, V, true);
451 Constant *ConstantInt::getSigned(Type *Ty, int64_t V) {
452 return get(Ty, V, true);
455 Constant *ConstantInt::get(Type* Ty, const APInt& V) {
456 ConstantInt *C = get(Ty->getContext(), V);
457 assert(C->getType() == Ty->getScalarType() &&
458 "ConstantInt type doesn't match the type implied by its value!");
460 // For vectors, broadcast the value.
461 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
462 return ConstantVector::get(
463 SmallVector<Constant *, 16>(VTy->getNumElements(), C));
468 ConstantInt* ConstantInt::get(IntegerType* Ty, StringRef Str,
470 return get(Ty->getContext(), APInt(Ty->getBitWidth(), Str, radix));
473 //===----------------------------------------------------------------------===//
475 //===----------------------------------------------------------------------===//
477 static const fltSemantics *TypeToFloatSemantics(Type *Ty) {
479 return &APFloat::IEEEhalf;
481 return &APFloat::IEEEsingle;
482 if (Ty->isDoubleTy())
483 return &APFloat::IEEEdouble;
484 if (Ty->isX86_FP80Ty())
485 return &APFloat::x87DoubleExtended;
486 else if (Ty->isFP128Ty())
487 return &APFloat::IEEEquad;
489 assert(Ty->isPPC_FP128Ty() && "Unknown FP format");
490 return &APFloat::PPCDoubleDouble;
493 void ConstantFP::anchor() { }
495 /// get() - This returns a constant fp for the specified value in the
496 /// specified type. This should only be used for simple constant values like
497 /// 2.0/1.0 etc, that are known-valid both as double and as the target format.
498 Constant *ConstantFP::get(Type* Ty, double V) {
499 LLVMContext &Context = Ty->getContext();
503 FV.convert(*TypeToFloatSemantics(Ty->getScalarType()),
504 APFloat::rmNearestTiesToEven, &ignored);
505 Constant *C = get(Context, FV);
507 // For vectors, broadcast the value.
508 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
509 return ConstantVector::get(
510 SmallVector<Constant *, 16>(VTy->getNumElements(), C));
516 Constant *ConstantFP::get(Type* Ty, StringRef Str) {
517 LLVMContext &Context = Ty->getContext();
519 APFloat FV(*TypeToFloatSemantics(Ty->getScalarType()), Str);
520 Constant *C = get(Context, FV);
522 // For vectors, broadcast the value.
523 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
524 return ConstantVector::get(
525 SmallVector<Constant *, 16>(VTy->getNumElements(), C));
531 ConstantFP* ConstantFP::getNegativeZero(Type* Ty) {
532 LLVMContext &Context = Ty->getContext();
533 APFloat apf = cast <ConstantFP>(Constant::getNullValue(Ty))->getValueAPF();
535 return get(Context, apf);
539 Constant *ConstantFP::getZeroValueForNegation(Type* Ty) {
540 if (VectorType *PTy = dyn_cast<VectorType>(Ty))
541 if (PTy->getElementType()->isFloatingPointTy()) {
542 SmallVector<Constant*, 16> zeros(PTy->getNumElements(),
543 getNegativeZero(PTy->getElementType()));
544 return ConstantVector::get(zeros);
547 if (Ty->isFloatingPointTy())
548 return getNegativeZero(Ty);
550 return Constant::getNullValue(Ty);
554 // ConstantFP accessors.
555 ConstantFP* ConstantFP::get(LLVMContext &Context, const APFloat& V) {
556 DenseMapAPFloatKeyInfo::KeyTy Key(V);
558 LLVMContextImpl* pImpl = Context.pImpl;
560 ConstantFP *&Slot = pImpl->FPConstants[Key];
564 if (&V.getSemantics() == &APFloat::IEEEhalf)
565 Ty = Type::getHalfTy(Context);
566 else if (&V.getSemantics() == &APFloat::IEEEsingle)
567 Ty = Type::getFloatTy(Context);
568 else if (&V.getSemantics() == &APFloat::IEEEdouble)
569 Ty = Type::getDoubleTy(Context);
570 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
571 Ty = Type::getX86_FP80Ty(Context);
572 else if (&V.getSemantics() == &APFloat::IEEEquad)
573 Ty = Type::getFP128Ty(Context);
575 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble &&
576 "Unknown FP format");
577 Ty = Type::getPPC_FP128Ty(Context);
579 Slot = new ConstantFP(Ty, V);
585 ConstantFP *ConstantFP::getInfinity(Type *Ty, bool Negative) {
586 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty);
587 return ConstantFP::get(Ty->getContext(),
588 APFloat::getInf(Semantics, Negative));
591 ConstantFP::ConstantFP(Type *Ty, const APFloat& V)
592 : Constant(Ty, ConstantFPVal, 0, 0), Val(V) {
593 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
597 bool ConstantFP::isExactlyValue(const APFloat &V) const {
598 return Val.bitwiseIsEqual(V);
601 //===----------------------------------------------------------------------===//
602 // ConstantAggregateZero Implementation
603 //===----------------------------------------------------------------------===//
605 /// getSequentialElement - If this CAZ has array or vector type, return a zero
606 /// with the right element type.
607 Constant *ConstantAggregateZero::getSequentialElement() {
608 return Constant::getNullValue(
609 cast<SequentialType>(getType())->getElementType());
612 /// getStructElement - If this CAZ has struct type, return a zero with the
613 /// right element type for the specified element.
614 Constant *ConstantAggregateZero::getStructElement(unsigned Elt) {
615 return Constant::getNullValue(
616 cast<StructType>(getType())->getElementType(Elt));
619 /// getElementValue - Return a zero of the right value for the specified GEP
620 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
621 Constant *ConstantAggregateZero::getElementValue(Constant *C) {
622 if (isa<SequentialType>(getType()))
623 return getSequentialElement();
624 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
627 /// getElementValue - Return a zero of the right value for the specified GEP
629 Constant *ConstantAggregateZero::getElementValue(unsigned Idx) {
630 if (isa<SequentialType>(getType()))
631 return getSequentialElement();
632 return getStructElement(Idx);
636 //===----------------------------------------------------------------------===//
637 // UndefValue Implementation
638 //===----------------------------------------------------------------------===//
640 /// getSequentialElement - If this undef has array or vector type, return an
641 /// undef with the right element type.
642 UndefValue *UndefValue::getSequentialElement() {
643 return UndefValue::get(cast<SequentialType>(getType())->getElementType());
646 /// getStructElement - If this undef has struct type, return a zero with the
647 /// right element type for the specified element.
648 UndefValue *UndefValue::getStructElement(unsigned Elt) {
649 return UndefValue::get(cast<StructType>(getType())->getElementType(Elt));
652 /// getElementValue - Return an undef of the right value for the specified GEP
653 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
654 UndefValue *UndefValue::getElementValue(Constant *C) {
655 if (isa<SequentialType>(getType()))
656 return getSequentialElement();
657 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
660 /// getElementValue - Return an undef of the right value for the specified GEP
662 UndefValue *UndefValue::getElementValue(unsigned Idx) {
663 if (isa<SequentialType>(getType()))
664 return getSequentialElement();
665 return getStructElement(Idx);
670 //===----------------------------------------------------------------------===//
671 // ConstantXXX Classes
672 //===----------------------------------------------------------------------===//
675 ConstantArray::ConstantArray(ArrayType *T, ArrayRef<Constant *> V)
676 : Constant(T, ConstantArrayVal,
677 OperandTraits<ConstantArray>::op_end(this) - V.size(),
679 assert(V.size() == T->getNumElements() &&
680 "Invalid initializer vector for constant array");
681 for (unsigned i = 0, e = V.size(); i != e; ++i)
682 assert(V[i]->getType() == T->getElementType() &&
683 "Initializer for array element doesn't match array element type!");
684 std::copy(V.begin(), V.end(), op_begin());
687 Constant *ConstantArray::get(ArrayType *Ty, ArrayRef<Constant*> V) {
688 for (unsigned i = 0, e = V.size(); i != e; ++i) {
689 assert(V[i]->getType() == Ty->getElementType() &&
690 "Wrong type in array element initializer");
692 LLVMContextImpl *pImpl = Ty->getContext().pImpl;
693 // If this is an all-zero array, return a ConstantAggregateZero object
696 if (!C->isNullValue())
697 return pImpl->ArrayConstants.getOrCreate(Ty, V);
699 for (unsigned i = 1, e = V.size(); i != e; ++i)
701 return pImpl->ArrayConstants.getOrCreate(Ty, V);
704 return ConstantAggregateZero::get(Ty);
707 /// ConstantArray::get(const string&) - Return an array that is initialized to
708 /// contain the specified string. If length is zero then a null terminator is
709 /// added to the specified string so that it may be used in a natural way.
710 /// Otherwise, the length parameter specifies how much of the string to use
711 /// and it won't be null terminated.
713 Constant *ConstantArray::get(LLVMContext &Context, StringRef Str,
715 std::vector<Constant*> ElementVals;
716 ElementVals.reserve(Str.size() + size_t(AddNull));
717 for (unsigned i = 0; i < Str.size(); ++i)
718 ElementVals.push_back(ConstantInt::get(Type::getInt8Ty(Context), Str[i]));
720 // Add a null terminator to the string...
722 ElementVals.push_back(ConstantInt::get(Type::getInt8Ty(Context), 0));
725 ArrayType *ATy = ArrayType::get(Type::getInt8Ty(Context), ElementVals.size());
726 return get(ATy, ElementVals);
729 /// getTypeForElements - Return an anonymous struct type to use for a constant
730 /// with the specified set of elements. The list must not be empty.
731 StructType *ConstantStruct::getTypeForElements(LLVMContext &Context,
732 ArrayRef<Constant*> V,
734 SmallVector<Type*, 16> EltTypes;
735 for (unsigned i = 0, e = V.size(); i != e; ++i)
736 EltTypes.push_back(V[i]->getType());
738 return StructType::get(Context, EltTypes, Packed);
742 StructType *ConstantStruct::getTypeForElements(ArrayRef<Constant*> V,
745 "ConstantStruct::getTypeForElements cannot be called on empty list");
746 return getTypeForElements(V[0]->getContext(), V, Packed);
750 ConstantStruct::ConstantStruct(StructType *T, ArrayRef<Constant *> V)
751 : Constant(T, ConstantStructVal,
752 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
754 assert(V.size() == T->getNumElements() &&
755 "Invalid initializer vector for constant structure");
756 for (unsigned i = 0, e = V.size(); i != e; ++i)
757 assert((T->isOpaque() || V[i]->getType() == T->getElementType(i)) &&
758 "Initializer for struct element doesn't match struct element type!");
759 std::copy(V.begin(), V.end(), op_begin());
762 // ConstantStruct accessors.
763 Constant *ConstantStruct::get(StructType *ST, ArrayRef<Constant*> V) {
764 // Create a ConstantAggregateZero value if all elements are zeros.
765 for (unsigned i = 0, e = V.size(); i != e; ++i)
766 if (!V[i]->isNullValue())
767 return ST->getContext().pImpl->StructConstants.getOrCreate(ST, V);
769 assert((ST->isOpaque() || ST->getNumElements() == V.size()) &&
770 "Incorrect # elements specified to ConstantStruct::get");
771 return ConstantAggregateZero::get(ST);
774 Constant *ConstantStruct::get(StructType *T, ...) {
776 SmallVector<Constant*, 8> Values;
778 while (Constant *Val = va_arg(ap, llvm::Constant*))
779 Values.push_back(Val);
781 return get(T, Values);
784 ConstantVector::ConstantVector(VectorType *T, ArrayRef<Constant *> V)
785 : Constant(T, ConstantVectorVal,
786 OperandTraits<ConstantVector>::op_end(this) - V.size(),
788 for (size_t i = 0, e = V.size(); i != e; i++)
789 assert(V[i]->getType() == T->getElementType() &&
790 "Initializer for vector element doesn't match vector element type!");
791 std::copy(V.begin(), V.end(), op_begin());
794 // ConstantVector accessors.
795 Constant *ConstantVector::get(ArrayRef<Constant*> V) {
796 assert(!V.empty() && "Vectors can't be empty");
797 VectorType *T = VectorType::get(V.front()->getType(), V.size());
798 LLVMContextImpl *pImpl = T->getContext().pImpl;
800 // If this is an all-undef or all-zero vector, return a
801 // ConstantAggregateZero or UndefValue.
803 bool isZero = C->isNullValue();
804 bool isUndef = isa<UndefValue>(C);
806 if (isZero || isUndef) {
807 for (unsigned i = 1, e = V.size(); i != e; ++i)
809 isZero = isUndef = false;
815 return ConstantAggregateZero::get(T);
817 return UndefValue::get(T);
819 return pImpl->VectorConstants.getOrCreate(T, V);
822 // Utility function for determining if a ConstantExpr is a CastOp or not. This
823 // can't be inline because we don't want to #include Instruction.h into
825 bool ConstantExpr::isCast() const {
826 return Instruction::isCast(getOpcode());
829 bool ConstantExpr::isCompare() const {
830 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
833 bool ConstantExpr::isGEPWithNoNotionalOverIndexing() const {
834 if (getOpcode() != Instruction::GetElementPtr) return false;
836 gep_type_iterator GEPI = gep_type_begin(this), E = gep_type_end(this);
837 User::const_op_iterator OI = llvm::next(this->op_begin());
839 // Skip the first index, as it has no static limit.
843 // The remaining indices must be compile-time known integers within the
844 // bounds of the corresponding notional static array types.
845 for (; GEPI != E; ++GEPI, ++OI) {
846 ConstantInt *CI = dyn_cast<ConstantInt>(*OI);
847 if (!CI) return false;
848 if (ArrayType *ATy = dyn_cast<ArrayType>(*GEPI))
849 if (CI->getValue().getActiveBits() > 64 ||
850 CI->getZExtValue() >= ATy->getNumElements())
854 // All the indices checked out.
858 bool ConstantExpr::hasIndices() const {
859 return getOpcode() == Instruction::ExtractValue ||
860 getOpcode() == Instruction::InsertValue;
863 ArrayRef<unsigned> ConstantExpr::getIndices() const {
864 if (const ExtractValueConstantExpr *EVCE =
865 dyn_cast<ExtractValueConstantExpr>(this))
866 return EVCE->Indices;
868 return cast<InsertValueConstantExpr>(this)->Indices;
871 unsigned ConstantExpr::getPredicate() const {
873 return ((const CompareConstantExpr*)this)->predicate;
876 /// getWithOperandReplaced - Return a constant expression identical to this
877 /// one, but with the specified operand set to the specified value.
879 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
880 assert(OpNo < getNumOperands() && "Operand num is out of range!");
881 assert(Op->getType() == getOperand(OpNo)->getType() &&
882 "Replacing operand with value of different type!");
883 if (getOperand(OpNo) == Op)
884 return const_cast<ConstantExpr*>(this);
886 Constant *Op0, *Op1, *Op2;
887 switch (getOpcode()) {
888 case Instruction::Trunc:
889 case Instruction::ZExt:
890 case Instruction::SExt:
891 case Instruction::FPTrunc:
892 case Instruction::FPExt:
893 case Instruction::UIToFP:
894 case Instruction::SIToFP:
895 case Instruction::FPToUI:
896 case Instruction::FPToSI:
897 case Instruction::PtrToInt:
898 case Instruction::IntToPtr:
899 case Instruction::BitCast:
900 return ConstantExpr::getCast(getOpcode(), Op, getType());
901 case Instruction::Select:
902 Op0 = (OpNo == 0) ? Op : getOperand(0);
903 Op1 = (OpNo == 1) ? Op : getOperand(1);
904 Op2 = (OpNo == 2) ? Op : getOperand(2);
905 return ConstantExpr::getSelect(Op0, Op1, Op2);
906 case Instruction::InsertElement:
907 Op0 = (OpNo == 0) ? Op : getOperand(0);
908 Op1 = (OpNo == 1) ? Op : getOperand(1);
909 Op2 = (OpNo == 2) ? Op : getOperand(2);
910 return ConstantExpr::getInsertElement(Op0, Op1, Op2);
911 case Instruction::ExtractElement:
912 Op0 = (OpNo == 0) ? Op : getOperand(0);
913 Op1 = (OpNo == 1) ? Op : getOperand(1);
914 return ConstantExpr::getExtractElement(Op0, Op1);
915 case Instruction::ShuffleVector:
916 Op0 = (OpNo == 0) ? Op : getOperand(0);
917 Op1 = (OpNo == 1) ? Op : getOperand(1);
918 Op2 = (OpNo == 2) ? Op : getOperand(2);
919 return ConstantExpr::getShuffleVector(Op0, Op1, Op2);
920 case Instruction::GetElementPtr: {
921 SmallVector<Constant*, 8> Ops;
922 Ops.resize(getNumOperands()-1);
923 for (unsigned i = 1, e = getNumOperands(); i != e; ++i)
924 Ops[i-1] = getOperand(i);
927 ConstantExpr::getGetElementPtr(Op, Ops,
928 cast<GEPOperator>(this)->isInBounds());
931 ConstantExpr::getGetElementPtr(getOperand(0), Ops,
932 cast<GEPOperator>(this)->isInBounds());
935 assert(getNumOperands() == 2 && "Must be binary operator?");
936 Op0 = (OpNo == 0) ? Op : getOperand(0);
937 Op1 = (OpNo == 1) ? Op : getOperand(1);
938 return ConstantExpr::get(getOpcode(), Op0, Op1, SubclassOptionalData);
942 /// getWithOperands - This returns the current constant expression with the
943 /// operands replaced with the specified values. The specified array must
944 /// have the same number of operands as our current one.
945 Constant *ConstantExpr::
946 getWithOperands(ArrayRef<Constant*> Ops, Type *Ty) const {
947 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
948 bool AnyChange = Ty != getType();
949 for (unsigned i = 0; i != Ops.size(); ++i)
950 AnyChange |= Ops[i] != getOperand(i);
952 if (!AnyChange) // No operands changed, return self.
953 return const_cast<ConstantExpr*>(this);
955 switch (getOpcode()) {
956 case Instruction::Trunc:
957 case Instruction::ZExt:
958 case Instruction::SExt:
959 case Instruction::FPTrunc:
960 case Instruction::FPExt:
961 case Instruction::UIToFP:
962 case Instruction::SIToFP:
963 case Instruction::FPToUI:
964 case Instruction::FPToSI:
965 case Instruction::PtrToInt:
966 case Instruction::IntToPtr:
967 case Instruction::BitCast:
968 return ConstantExpr::getCast(getOpcode(), Ops[0], Ty);
969 case Instruction::Select:
970 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
971 case Instruction::InsertElement:
972 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
973 case Instruction::ExtractElement:
974 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
975 case Instruction::ShuffleVector:
976 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
977 case Instruction::GetElementPtr:
979 ConstantExpr::getGetElementPtr(Ops[0], Ops.slice(1),
980 cast<GEPOperator>(this)->isInBounds());
981 case Instruction::ICmp:
982 case Instruction::FCmp:
983 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1]);
985 assert(getNumOperands() == 2 && "Must be binary operator?");
986 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1], SubclassOptionalData);
991 //===----------------------------------------------------------------------===//
992 // isValueValidForType implementations
994 bool ConstantInt::isValueValidForType(Type *Ty, uint64_t Val) {
995 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
996 if (Ty == Type::getInt1Ty(Ty->getContext()))
997 return Val == 0 || Val == 1;
999 return true; // always true, has to fit in largest type
1000 uint64_t Max = (1ll << NumBits) - 1;
1004 bool ConstantInt::isValueValidForType(Type *Ty, int64_t Val) {
1005 unsigned NumBits = cast<IntegerType>(Ty)->getBitWidth(); // assert okay
1006 if (Ty == Type::getInt1Ty(Ty->getContext()))
1007 return Val == 0 || Val == 1 || Val == -1;
1009 return true; // always true, has to fit in largest type
1010 int64_t Min = -(1ll << (NumBits-1));
1011 int64_t Max = (1ll << (NumBits-1)) - 1;
1012 return (Val >= Min && Val <= Max);
1015 bool ConstantFP::isValueValidForType(Type *Ty, const APFloat& Val) {
1016 // convert modifies in place, so make a copy.
1017 APFloat Val2 = APFloat(Val);
1019 switch (Ty->getTypeID()) {
1021 return false; // These can't be represented as floating point!
1023 // FIXME rounding mode needs to be more flexible
1024 case Type::HalfTyID: {
1025 if (&Val2.getSemantics() == &APFloat::IEEEhalf)
1027 Val2.convert(APFloat::IEEEhalf, APFloat::rmNearestTiesToEven, &losesInfo);
1030 case Type::FloatTyID: {
1031 if (&Val2.getSemantics() == &APFloat::IEEEsingle)
1033 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
1036 case Type::DoubleTyID: {
1037 if (&Val2.getSemantics() == &APFloat::IEEEhalf ||
1038 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1039 &Val2.getSemantics() == &APFloat::IEEEdouble)
1041 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
1044 case Type::X86_FP80TyID:
1045 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1046 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1047 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1048 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
1049 case Type::FP128TyID:
1050 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1051 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1052 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1053 &Val2.getSemantics() == &APFloat::IEEEquad;
1054 case Type::PPC_FP128TyID:
1055 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1056 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1057 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1058 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
1063 //===----------------------------------------------------------------------===//
1064 // Factory Function Implementation
1066 ConstantAggregateZero *ConstantAggregateZero::get(Type *Ty) {
1067 assert((Ty->isStructTy() || Ty->isArrayTy() || Ty->isVectorTy()) &&
1068 "Cannot create an aggregate zero of non-aggregate type!");
1070 ConstantAggregateZero *&Entry = Ty->getContext().pImpl->CAZConstants[Ty];
1072 Entry = new ConstantAggregateZero(Ty);
1077 /// destroyConstant - Remove the constant from the constant table.
1079 void ConstantAggregateZero::destroyConstant() {
1080 getContext().pImpl->CAZConstants.erase(getType());
1081 destroyConstantImpl();
1084 /// destroyConstant - Remove the constant from the constant table...
1086 void ConstantArray::destroyConstant() {
1087 getType()->getContext().pImpl->ArrayConstants.remove(this);
1088 destroyConstantImpl();
1091 /// isString - This method returns true if the array is an array of i8, and
1092 /// if the elements of the array are all ConstantInt's.
1093 bool ConstantArray::isString() const {
1094 // Check the element type for i8...
1095 if (!getType()->getElementType()->isIntegerTy(8))
1097 // Check the elements to make sure they are all integers, not constant
1099 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1100 if (!isa<ConstantInt>(getOperand(i)))
1105 /// isCString - This method returns true if the array is a string (see
1106 /// isString) and it ends in a null byte \\0 and does not contains any other
1107 /// null bytes except its terminator.
1108 bool ConstantArray::isCString() const {
1109 // Check the element type for i8...
1110 if (!getType()->getElementType()->isIntegerTy(8))
1113 // Last element must be a null.
1114 if (!getOperand(getNumOperands()-1)->isNullValue())
1116 // Other elements must be non-null integers.
1117 for (unsigned i = 0, e = getNumOperands()-1; i != e; ++i) {
1118 if (!isa<ConstantInt>(getOperand(i)))
1120 if (getOperand(i)->isNullValue())
1127 /// convertToString - Helper function for getAsString() and getAsCString().
1128 static std::string convertToString(const User *U, unsigned len) {
1130 Result.reserve(len);
1131 for (unsigned i = 0; i != len; ++i)
1132 Result.push_back((char)cast<ConstantInt>(U->getOperand(i))->getZExtValue());
1136 /// getAsString - If this array is isString(), then this method converts the
1137 /// array to an std::string and returns it. Otherwise, it asserts out.
1139 std::string ConstantArray::getAsString() const {
1140 assert(isString() && "Not a string!");
1141 return convertToString(this, getNumOperands());
1145 /// getAsCString - If this array is isCString(), then this method converts the
1146 /// array (without the trailing null byte) to an std::string and returns it.
1147 /// Otherwise, it asserts out.
1149 std::string ConstantArray::getAsCString() const {
1150 assert(isCString() && "Not a string!");
1151 return convertToString(this, getNumOperands() - 1);
1155 //---- ConstantStruct::get() implementation...
1158 // destroyConstant - Remove the constant from the constant table...
1160 void ConstantStruct::destroyConstant() {
1161 getType()->getContext().pImpl->StructConstants.remove(this);
1162 destroyConstantImpl();
1165 // destroyConstant - Remove the constant from the constant table...
1167 void ConstantVector::destroyConstant() {
1168 getType()->getContext().pImpl->VectorConstants.remove(this);
1169 destroyConstantImpl();
1172 /// getSplatValue - If this is a splat constant, where all of the
1173 /// elements have the same value, return that value. Otherwise return null.
1174 Constant *ConstantVector::getSplatValue() const {
1175 // Check out first element.
1176 Constant *Elt = getOperand(0);
1177 // Then make sure all remaining elements point to the same value.
1178 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1179 if (getOperand(I) != Elt)
1184 //---- ConstantPointerNull::get() implementation.
1187 ConstantPointerNull *ConstantPointerNull::get(PointerType *Ty) {
1188 ConstantPointerNull *&Entry = Ty->getContext().pImpl->CPNConstants[Ty];
1190 Entry = new ConstantPointerNull(Ty);
1195 // destroyConstant - Remove the constant from the constant table...
1197 void ConstantPointerNull::destroyConstant() {
1198 getContext().pImpl->CPNConstants.erase(getType());
1199 // Free the constant and any dangling references to it.
1200 destroyConstantImpl();
1204 //---- UndefValue::get() implementation.
1207 UndefValue *UndefValue::get(Type *Ty) {
1208 UndefValue *&Entry = Ty->getContext().pImpl->UVConstants[Ty];
1210 Entry = new UndefValue(Ty);
1215 // destroyConstant - Remove the constant from the constant table.
1217 void UndefValue::destroyConstant() {
1218 // Free the constant and any dangling references to it.
1219 getContext().pImpl->UVConstants.erase(getType());
1220 destroyConstantImpl();
1223 //---- BlockAddress::get() implementation.
1226 BlockAddress *BlockAddress::get(BasicBlock *BB) {
1227 assert(BB->getParent() != 0 && "Block must have a parent");
1228 return get(BB->getParent(), BB);
1231 BlockAddress *BlockAddress::get(Function *F, BasicBlock *BB) {
1233 F->getContext().pImpl->BlockAddresses[std::make_pair(F, BB)];
1235 BA = new BlockAddress(F, BB);
1237 assert(BA->getFunction() == F && "Basic block moved between functions");
1241 BlockAddress::BlockAddress(Function *F, BasicBlock *BB)
1242 : Constant(Type::getInt8PtrTy(F->getContext()), Value::BlockAddressVal,
1246 BB->AdjustBlockAddressRefCount(1);
1250 // destroyConstant - Remove the constant from the constant table.
1252 void BlockAddress::destroyConstant() {
1253 getFunction()->getType()->getContext().pImpl
1254 ->BlockAddresses.erase(std::make_pair(getFunction(), getBasicBlock()));
1255 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1256 destroyConstantImpl();
1259 void BlockAddress::replaceUsesOfWithOnConstant(Value *From, Value *To, Use *U) {
1260 // This could be replacing either the Basic Block or the Function. In either
1261 // case, we have to remove the map entry.
1262 Function *NewF = getFunction();
1263 BasicBlock *NewBB = getBasicBlock();
1266 NewF = cast<Function>(To);
1268 NewBB = cast<BasicBlock>(To);
1270 // See if the 'new' entry already exists, if not, just update this in place
1271 // and return early.
1272 BlockAddress *&NewBA =
1273 getContext().pImpl->BlockAddresses[std::make_pair(NewF, NewBB)];
1275 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1277 // Remove the old entry, this can't cause the map to rehash (just a
1278 // tombstone will get added).
1279 getContext().pImpl->BlockAddresses.erase(std::make_pair(getFunction(),
1282 setOperand(0, NewF);
1283 setOperand(1, NewBB);
1284 getBasicBlock()->AdjustBlockAddressRefCount(1);
1288 // Otherwise, I do need to replace this with an existing value.
1289 assert(NewBA != this && "I didn't contain From!");
1291 // Everyone using this now uses the replacement.
1292 replaceAllUsesWith(NewBA);
1297 //---- ConstantExpr::get() implementations.
1300 /// This is a utility function to handle folding of casts and lookup of the
1301 /// cast in the ExprConstants map. It is used by the various get* methods below.
1302 static inline Constant *getFoldedCast(
1303 Instruction::CastOps opc, Constant *C, Type *Ty) {
1304 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1305 // Fold a few common cases
1306 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1309 LLVMContextImpl *pImpl = Ty->getContext().pImpl;
1311 // Look up the constant in the table first to ensure uniqueness
1312 std::vector<Constant*> argVec(1, C);
1313 ExprMapKeyType Key(opc, argVec);
1315 return pImpl->ExprConstants.getOrCreate(Ty, Key);
1318 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, Type *Ty) {
1319 Instruction::CastOps opc = Instruction::CastOps(oc);
1320 assert(Instruction::isCast(opc) && "opcode out of range");
1321 assert(C && Ty && "Null arguments to getCast");
1322 assert(CastInst::castIsValid(opc, C, Ty) && "Invalid constantexpr cast!");
1326 llvm_unreachable("Invalid cast opcode");
1327 case Instruction::Trunc: return getTrunc(C, Ty);
1328 case Instruction::ZExt: return getZExt(C, Ty);
1329 case Instruction::SExt: return getSExt(C, Ty);
1330 case Instruction::FPTrunc: return getFPTrunc(C, Ty);
1331 case Instruction::FPExt: return getFPExtend(C, Ty);
1332 case Instruction::UIToFP: return getUIToFP(C, Ty);
1333 case Instruction::SIToFP: return getSIToFP(C, Ty);
1334 case Instruction::FPToUI: return getFPToUI(C, Ty);
1335 case Instruction::FPToSI: return getFPToSI(C, Ty);
1336 case Instruction::PtrToInt: return getPtrToInt(C, Ty);
1337 case Instruction::IntToPtr: return getIntToPtr(C, Ty);
1338 case Instruction::BitCast: return getBitCast(C, Ty);
1342 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, Type *Ty) {
1343 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1344 return getBitCast(C, Ty);
1345 return getZExt(C, Ty);
1348 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, Type *Ty) {
1349 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1350 return getBitCast(C, Ty);
1351 return getSExt(C, Ty);
1354 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, Type *Ty) {
1355 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1356 return getBitCast(C, Ty);
1357 return getTrunc(C, Ty);
1360 Constant *ConstantExpr::getPointerCast(Constant *S, Type *Ty) {
1361 assert(S->getType()->isPointerTy() && "Invalid cast");
1362 assert((Ty->isIntegerTy() || Ty->isPointerTy()) && "Invalid cast");
1364 if (Ty->isIntegerTy())
1365 return getPtrToInt(S, Ty);
1366 return getBitCast(S, Ty);
1369 Constant *ConstantExpr::getIntegerCast(Constant *C, Type *Ty,
1371 assert(C->getType()->isIntOrIntVectorTy() &&
1372 Ty->isIntOrIntVectorTy() && "Invalid cast");
1373 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1374 unsigned DstBits = Ty->getScalarSizeInBits();
1375 Instruction::CastOps opcode =
1376 (SrcBits == DstBits ? Instruction::BitCast :
1377 (SrcBits > DstBits ? Instruction::Trunc :
1378 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1379 return getCast(opcode, C, Ty);
1382 Constant *ConstantExpr::getFPCast(Constant *C, Type *Ty) {
1383 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1385 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1386 unsigned DstBits = Ty->getScalarSizeInBits();
1387 if (SrcBits == DstBits)
1388 return C; // Avoid a useless cast
1389 Instruction::CastOps opcode =
1390 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1391 return getCast(opcode, C, Ty);
1394 Constant *ConstantExpr::getTrunc(Constant *C, Type *Ty) {
1396 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1397 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1399 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1400 assert(C->getType()->isIntOrIntVectorTy() && "Trunc operand must be integer");
1401 assert(Ty->isIntOrIntVectorTy() && "Trunc produces only integral");
1402 assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1403 "SrcTy must be larger than DestTy for Trunc!");
1405 return getFoldedCast(Instruction::Trunc, C, Ty);
1408 Constant *ConstantExpr::getSExt(Constant *C, Type *Ty) {
1410 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1411 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1413 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1414 assert(C->getType()->isIntOrIntVectorTy() && "SExt operand must be integral");
1415 assert(Ty->isIntOrIntVectorTy() && "SExt produces only integer");
1416 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1417 "SrcTy must be smaller than DestTy for SExt!");
1419 return getFoldedCast(Instruction::SExt, C, Ty);
1422 Constant *ConstantExpr::getZExt(Constant *C, Type *Ty) {
1424 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1425 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1427 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1428 assert(C->getType()->isIntOrIntVectorTy() && "ZEXt operand must be integral");
1429 assert(Ty->isIntOrIntVectorTy() && "ZExt produces only integer");
1430 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1431 "SrcTy must be smaller than DestTy for ZExt!");
1433 return getFoldedCast(Instruction::ZExt, C, Ty);
1436 Constant *ConstantExpr::getFPTrunc(Constant *C, Type *Ty) {
1438 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1439 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1441 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1442 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1443 C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1444 "This is an illegal floating point truncation!");
1445 return getFoldedCast(Instruction::FPTrunc, C, Ty);
1448 Constant *ConstantExpr::getFPExtend(Constant *C, Type *Ty) {
1450 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1451 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1453 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1454 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1455 C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1456 "This is an illegal floating point extension!");
1457 return getFoldedCast(Instruction::FPExt, C, Ty);
1460 Constant *ConstantExpr::getUIToFP(Constant *C, Type *Ty) {
1462 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1463 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1465 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1466 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
1467 "This is an illegal uint to floating point cast!");
1468 return getFoldedCast(Instruction::UIToFP, C, Ty);
1471 Constant *ConstantExpr::getSIToFP(Constant *C, Type *Ty) {
1473 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1474 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1476 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1477 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
1478 "This is an illegal sint to floating point cast!");
1479 return getFoldedCast(Instruction::SIToFP, C, Ty);
1482 Constant *ConstantExpr::getFPToUI(Constant *C, Type *Ty) {
1484 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1485 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1487 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1488 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1489 "This is an illegal floating point to uint cast!");
1490 return getFoldedCast(Instruction::FPToUI, C, Ty);
1493 Constant *ConstantExpr::getFPToSI(Constant *C, Type *Ty) {
1495 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1496 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1498 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1499 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1500 "This is an illegal floating point to sint cast!");
1501 return getFoldedCast(Instruction::FPToSI, C, Ty);
1504 Constant *ConstantExpr::getPtrToInt(Constant *C, Type *DstTy) {
1505 assert(C->getType()->getScalarType()->isPointerTy() &&
1506 "PtrToInt source must be pointer or pointer vector");
1507 assert(DstTy->getScalarType()->isIntegerTy() &&
1508 "PtrToInt destination must be integer or integer vector");
1509 assert(C->getType()->getNumElements() == DstTy->getNumElements() &&
1510 "Invalid cast between a different number of vector elements");
1511 return getFoldedCast(Instruction::PtrToInt, C, DstTy);
1514 Constant *ConstantExpr::getIntToPtr(Constant *C, Type *DstTy) {
1515 assert(C->getType()->getScalarType()->isIntegerTy() &&
1516 "IntToPtr source must be integer or integer vector");
1517 assert(DstTy->getScalarType()->isPointerTy() &&
1518 "IntToPtr destination must be a pointer or pointer vector");
1519 assert(C->getType()->getNumElements() == DstTy->getNumElements() &&
1520 "Invalid cast between a different number of vector elements");
1521 return getFoldedCast(Instruction::IntToPtr, C, DstTy);
1524 Constant *ConstantExpr::getBitCast(Constant *C, Type *DstTy) {
1525 assert(CastInst::castIsValid(Instruction::BitCast, C, DstTy) &&
1526 "Invalid constantexpr bitcast!");
1528 // It is common to ask for a bitcast of a value to its own type, handle this
1530 if (C->getType() == DstTy) return C;
1532 return getFoldedCast(Instruction::BitCast, C, DstTy);
1535 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2,
1537 // Check the operands for consistency first.
1538 assert(Opcode >= Instruction::BinaryOpsBegin &&
1539 Opcode < Instruction::BinaryOpsEnd &&
1540 "Invalid opcode in binary constant expression");
1541 assert(C1->getType() == C2->getType() &&
1542 "Operand types in binary constant expression should match");
1546 case Instruction::Add:
1547 case Instruction::Sub:
1548 case Instruction::Mul:
1549 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1550 assert(C1->getType()->isIntOrIntVectorTy() &&
1551 "Tried to create an integer operation on a non-integer type!");
1553 case Instruction::FAdd:
1554 case Instruction::FSub:
1555 case Instruction::FMul:
1556 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1557 assert(C1->getType()->isFPOrFPVectorTy() &&
1558 "Tried to create a floating-point operation on a "
1559 "non-floating-point type!");
1561 case Instruction::UDiv:
1562 case Instruction::SDiv:
1563 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1564 assert(C1->getType()->isIntOrIntVectorTy() &&
1565 "Tried to create an arithmetic operation on a non-arithmetic type!");
1567 case Instruction::FDiv:
1568 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1569 assert(C1->getType()->isFPOrFPVectorTy() &&
1570 "Tried to create an arithmetic operation on a non-arithmetic type!");
1572 case Instruction::URem:
1573 case Instruction::SRem:
1574 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1575 assert(C1->getType()->isIntOrIntVectorTy() &&
1576 "Tried to create an arithmetic operation on a non-arithmetic type!");
1578 case Instruction::FRem:
1579 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1580 assert(C1->getType()->isFPOrFPVectorTy() &&
1581 "Tried to create an arithmetic operation on a non-arithmetic type!");
1583 case Instruction::And:
1584 case Instruction::Or:
1585 case Instruction::Xor:
1586 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1587 assert(C1->getType()->isIntOrIntVectorTy() &&
1588 "Tried to create a logical operation on a non-integral type!");
1590 case Instruction::Shl:
1591 case Instruction::LShr:
1592 case Instruction::AShr:
1593 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1594 assert(C1->getType()->isIntOrIntVectorTy() &&
1595 "Tried to create a shift operation on a non-integer type!");
1602 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1603 return FC; // Fold a few common cases.
1605 std::vector<Constant*> argVec(1, C1);
1606 argVec.push_back(C2);
1607 ExprMapKeyType Key(Opcode, argVec, 0, Flags);
1609 LLVMContextImpl *pImpl = C1->getContext().pImpl;
1610 return pImpl->ExprConstants.getOrCreate(C1->getType(), Key);
1613 Constant *ConstantExpr::getSizeOf(Type* Ty) {
1614 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1615 // Note that a non-inbounds gep is used, as null isn't within any object.
1616 Constant *GEPIdx = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1617 Constant *GEP = getGetElementPtr(
1618 Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1619 return getPtrToInt(GEP,
1620 Type::getInt64Ty(Ty->getContext()));
1623 Constant *ConstantExpr::getAlignOf(Type* Ty) {
1624 // alignof is implemented as: (i64) gep ({i1,Ty}*)null, 0, 1
1625 // Note that a non-inbounds gep is used, as null isn't within any object.
1627 StructType::get(Type::getInt1Ty(Ty->getContext()), Ty, NULL);
1628 Constant *NullPtr = Constant::getNullValue(AligningTy->getPointerTo());
1629 Constant *Zero = ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0);
1630 Constant *One = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1631 Constant *Indices[2] = { Zero, One };
1632 Constant *GEP = getGetElementPtr(NullPtr, Indices);
1633 return getPtrToInt(GEP,
1634 Type::getInt64Ty(Ty->getContext()));
1637 Constant *ConstantExpr::getOffsetOf(StructType* STy, unsigned FieldNo) {
1638 return getOffsetOf(STy, ConstantInt::get(Type::getInt32Ty(STy->getContext()),
1642 Constant *ConstantExpr::getOffsetOf(Type* Ty, Constant *FieldNo) {
1643 // offsetof is implemented as: (i64) gep (Ty*)null, 0, FieldNo
1644 // Note that a non-inbounds gep is used, as null isn't within any object.
1645 Constant *GEPIdx[] = {
1646 ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0),
1649 Constant *GEP = getGetElementPtr(
1650 Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1651 return getPtrToInt(GEP,
1652 Type::getInt64Ty(Ty->getContext()));
1655 Constant *ConstantExpr::getCompare(unsigned short Predicate,
1656 Constant *C1, Constant *C2) {
1657 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1659 switch (Predicate) {
1660 default: llvm_unreachable("Invalid CmpInst predicate");
1661 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
1662 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
1663 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
1664 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
1665 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
1666 case CmpInst::FCMP_TRUE:
1667 return getFCmp(Predicate, C1, C2);
1669 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
1670 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
1671 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
1672 case CmpInst::ICMP_SLE:
1673 return getICmp(Predicate, C1, C2);
1677 Constant *ConstantExpr::getSelect(Constant *C, Constant *V1, Constant *V2) {
1678 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
1680 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1681 return SC; // Fold common cases
1683 std::vector<Constant*> argVec(3, C);
1686 ExprMapKeyType Key(Instruction::Select, argVec);
1688 LLVMContextImpl *pImpl = C->getContext().pImpl;
1689 return pImpl->ExprConstants.getOrCreate(V1->getType(), Key);
1692 Constant *ConstantExpr::getGetElementPtr(Constant *C, ArrayRef<Value *> Idxs,
1694 if (Constant *FC = ConstantFoldGetElementPtr(C, InBounds, Idxs))
1695 return FC; // Fold a few common cases.
1697 // Get the result type of the getelementptr!
1698 Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), Idxs);
1699 assert(Ty && "GEP indices invalid!");
1700 unsigned AS = cast<PointerType>(C->getType())->getAddressSpace();
1701 Type *ReqTy = Ty->getPointerTo(AS);
1703 assert(C->getType()->isPointerTy() &&
1704 "Non-pointer type for constant GetElementPtr expression");
1705 // Look up the constant in the table first to ensure uniqueness
1706 std::vector<Constant*> ArgVec;
1707 ArgVec.reserve(1 + Idxs.size());
1708 ArgVec.push_back(C);
1709 for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
1710 ArgVec.push_back(cast<Constant>(Idxs[i]));
1711 const ExprMapKeyType Key(Instruction::GetElementPtr, ArgVec, 0,
1712 InBounds ? GEPOperator::IsInBounds : 0);
1714 LLVMContextImpl *pImpl = C->getContext().pImpl;
1715 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
1719 ConstantExpr::getICmp(unsigned short pred, Constant *LHS, Constant *RHS) {
1720 assert(LHS->getType() == RHS->getType());
1721 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
1722 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
1724 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
1725 return FC; // Fold a few common cases...
1727 // Look up the constant in the table first to ensure uniqueness
1728 std::vector<Constant*> ArgVec;
1729 ArgVec.push_back(LHS);
1730 ArgVec.push_back(RHS);
1731 // Get the key type with both the opcode and predicate
1732 const ExprMapKeyType Key(Instruction::ICmp, ArgVec, pred);
1734 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
1735 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
1736 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
1738 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
1739 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
1743 ConstantExpr::getFCmp(unsigned short pred, Constant *LHS, Constant *RHS) {
1744 assert(LHS->getType() == RHS->getType());
1745 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
1747 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
1748 return FC; // Fold a few common cases...
1750 // Look up the constant in the table first to ensure uniqueness
1751 std::vector<Constant*> ArgVec;
1752 ArgVec.push_back(LHS);
1753 ArgVec.push_back(RHS);
1754 // Get the key type with both the opcode and predicate
1755 const ExprMapKeyType Key(Instruction::FCmp, ArgVec, pred);
1757 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
1758 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
1759 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
1761 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
1762 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
1765 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx) {
1766 assert(Val->getType()->isVectorTy() &&
1767 "Tried to create extractelement operation on non-vector type!");
1768 assert(Idx->getType()->isIntegerTy(32) &&
1769 "Extractelement index must be i32 type!");
1771 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
1772 return FC; // Fold a few common cases.
1774 // Look up the constant in the table first to ensure uniqueness
1775 std::vector<Constant*> ArgVec(1, Val);
1776 ArgVec.push_back(Idx);
1777 const ExprMapKeyType Key(Instruction::ExtractElement,ArgVec);
1779 LLVMContextImpl *pImpl = Val->getContext().pImpl;
1780 Type *ReqTy = cast<VectorType>(Val->getType())->getElementType();
1781 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
1784 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
1786 assert(Val->getType()->isVectorTy() &&
1787 "Tried to create insertelement operation on non-vector type!");
1788 assert(Elt->getType() == cast<VectorType>(Val->getType())->getElementType()
1789 && "Insertelement types must match!");
1790 assert(Idx->getType()->isIntegerTy(32) &&
1791 "Insertelement index must be i32 type!");
1793 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
1794 return FC; // Fold a few common cases.
1795 // Look up the constant in the table first to ensure uniqueness
1796 std::vector<Constant*> ArgVec(1, Val);
1797 ArgVec.push_back(Elt);
1798 ArgVec.push_back(Idx);
1799 const ExprMapKeyType Key(Instruction::InsertElement,ArgVec);
1801 LLVMContextImpl *pImpl = Val->getContext().pImpl;
1802 return pImpl->ExprConstants.getOrCreate(Val->getType(), Key);
1805 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
1807 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
1808 "Invalid shuffle vector constant expr operands!");
1810 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
1811 return FC; // Fold a few common cases.
1813 unsigned NElts = cast<VectorType>(Mask->getType())->getNumElements();
1814 Type *EltTy = cast<VectorType>(V1->getType())->getElementType();
1815 Type *ShufTy = VectorType::get(EltTy, NElts);
1817 // Look up the constant in the table first to ensure uniqueness
1818 std::vector<Constant*> ArgVec(1, V1);
1819 ArgVec.push_back(V2);
1820 ArgVec.push_back(Mask);
1821 const ExprMapKeyType Key(Instruction::ShuffleVector,ArgVec);
1823 LLVMContextImpl *pImpl = ShufTy->getContext().pImpl;
1824 return pImpl->ExprConstants.getOrCreate(ShufTy, Key);
1827 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
1828 ArrayRef<unsigned> Idxs) {
1829 assert(ExtractValueInst::getIndexedType(Agg->getType(),
1830 Idxs) == Val->getType() &&
1831 "insertvalue indices invalid!");
1832 assert(Agg->getType()->isFirstClassType() &&
1833 "Non-first-class type for constant insertvalue expression");
1834 Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs);
1835 assert(FC && "insertvalue constant expr couldn't be folded!");
1839 Constant *ConstantExpr::getExtractValue(Constant *Agg,
1840 ArrayRef<unsigned> Idxs) {
1841 assert(Agg->getType()->isFirstClassType() &&
1842 "Tried to create extractelement operation on non-first-class type!");
1844 Type *ReqTy = ExtractValueInst::getIndexedType(Agg->getType(), Idxs);
1846 assert(ReqTy && "extractvalue indices invalid!");
1848 assert(Agg->getType()->isFirstClassType() &&
1849 "Non-first-class type for constant extractvalue expression");
1850 Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs);
1851 assert(FC && "ExtractValue constant expr couldn't be folded!");
1855 Constant *ConstantExpr::getNeg(Constant *C, bool HasNUW, bool HasNSW) {
1856 assert(C->getType()->isIntOrIntVectorTy() &&
1857 "Cannot NEG a nonintegral value!");
1858 return getSub(ConstantFP::getZeroValueForNegation(C->getType()),
1862 Constant *ConstantExpr::getFNeg(Constant *C) {
1863 assert(C->getType()->isFPOrFPVectorTy() &&
1864 "Cannot FNEG a non-floating-point value!");
1865 return getFSub(ConstantFP::getZeroValueForNegation(C->getType()), C);
1868 Constant *ConstantExpr::getNot(Constant *C) {
1869 assert(C->getType()->isIntOrIntVectorTy() &&
1870 "Cannot NOT a nonintegral value!");
1871 return get(Instruction::Xor, C, Constant::getAllOnesValue(C->getType()));
1874 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2,
1875 bool HasNUW, bool HasNSW) {
1876 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
1877 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
1878 return get(Instruction::Add, C1, C2, Flags);
1881 Constant *ConstantExpr::getFAdd(Constant *C1, Constant *C2) {
1882 return get(Instruction::FAdd, C1, C2);
1885 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2,
1886 bool HasNUW, bool HasNSW) {
1887 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
1888 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
1889 return get(Instruction::Sub, C1, C2, Flags);
1892 Constant *ConstantExpr::getFSub(Constant *C1, Constant *C2) {
1893 return get(Instruction::FSub, C1, C2);
1896 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2,
1897 bool HasNUW, bool HasNSW) {
1898 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
1899 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
1900 return get(Instruction::Mul, C1, C2, Flags);
1903 Constant *ConstantExpr::getFMul(Constant *C1, Constant *C2) {
1904 return get(Instruction::FMul, C1, C2);
1907 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2, bool isExact) {
1908 return get(Instruction::UDiv, C1, C2,
1909 isExact ? PossiblyExactOperator::IsExact : 0);
1912 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2, bool isExact) {
1913 return get(Instruction::SDiv, C1, C2,
1914 isExact ? PossiblyExactOperator::IsExact : 0);
1917 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
1918 return get(Instruction::FDiv, C1, C2);
1921 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
1922 return get(Instruction::URem, C1, C2);
1925 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
1926 return get(Instruction::SRem, C1, C2);
1929 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
1930 return get(Instruction::FRem, C1, C2);
1933 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
1934 return get(Instruction::And, C1, C2);
1937 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
1938 return get(Instruction::Or, C1, C2);
1941 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
1942 return get(Instruction::Xor, C1, C2);
1945 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2,
1946 bool HasNUW, bool HasNSW) {
1947 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
1948 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
1949 return get(Instruction::Shl, C1, C2, Flags);
1952 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2, bool isExact) {
1953 return get(Instruction::LShr, C1, C2,
1954 isExact ? PossiblyExactOperator::IsExact : 0);
1957 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2, bool isExact) {
1958 return get(Instruction::AShr, C1, C2,
1959 isExact ? PossiblyExactOperator::IsExact : 0);
1962 // destroyConstant - Remove the constant from the constant table...
1964 void ConstantExpr::destroyConstant() {
1965 getType()->getContext().pImpl->ExprConstants.remove(this);
1966 destroyConstantImpl();
1969 const char *ConstantExpr::getOpcodeName() const {
1970 return Instruction::getOpcodeName(getOpcode());
1975 GetElementPtrConstantExpr::
1976 GetElementPtrConstantExpr(Constant *C, const std::vector<Constant*> &IdxList,
1978 : ConstantExpr(DestTy, Instruction::GetElementPtr,
1979 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
1980 - (IdxList.size()+1), IdxList.size()+1) {
1982 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
1983 OperandList[i+1] = IdxList[i];
1986 //===----------------------------------------------------------------------===//
1987 // ConstantData* implementations
1989 void ConstantDataArray::anchor() {}
1990 void ConstantDataVector::anchor() {}
1992 /// getElementType - Return the element type of the array/vector.
1993 Type *ConstantDataSequential::getElementType() const {
1994 return getType()->getElementType();
1997 StringRef ConstantDataSequential::getRawDataValues() const {
1998 return StringRef(DataElements,
1999 getType()->getNumElements()*getElementByteSize());
2002 /// isElementTypeCompatible - Return true if a ConstantDataSequential can be
2003 /// formed with a vector or array of the specified element type.
2004 /// ConstantDataArray only works with normal float and int types that are
2005 /// stored densely in memory, not with things like i42 or x86_f80.
2006 bool ConstantDataSequential::isElementTypeCompatible(const Type *Ty) {
2007 if (Ty->isFloatTy() || Ty->isDoubleTy()) return true;
2008 if (const IntegerType *IT = dyn_cast<IntegerType>(Ty)) {
2009 switch (IT->getBitWidth()) {
2021 /// getElementByteSize - Return the size in bytes of the elements in the data.
2022 uint64_t ConstantDataSequential::getElementByteSize() const {
2023 return getElementType()->getPrimitiveSizeInBits()/8;
2026 /// getElementPointer - Return the start of the specified element.
2027 const char *ConstantDataSequential::getElementPointer(unsigned Elt) const {
2028 assert(Elt < getElementType()->getNumElements() && "Invalid Elt");
2029 return DataElements+Elt*getElementByteSize();
2033 /// isAllZeros - return true if the array is empty or all zeros.
2034 static bool isAllZeros(StringRef Arr) {
2035 for (StringRef::iterator I = Arr.begin(), E = Arr.end(); I != E; ++I)
2041 /// getImpl - This is the underlying implementation of all of the
2042 /// ConstantDataSequential::get methods. They all thunk down to here, providing
2043 /// the correct element type. We take the bytes in as an StringRef because
2044 /// we *want* an underlying "char*" to avoid TBAA type punning violations.
2045 Constant *ConstantDataSequential::getImpl(StringRef Elements, Type *Ty) {
2046 assert(isElementTypeCompatible(cast<SequentialType>(Ty)->getElementType()));
2047 // If the elements are all zero, return a CAZ, which is more dense.
2048 if (isAllZeros(Elements))
2049 return ConstantAggregateZero::get(Ty);
2051 // Do a lookup to see if we have already formed one of these.
2052 StringMap<ConstantDataSequential*>::MapEntryTy &Slot =
2053 Ty->getContext().pImpl->CDSConstants.GetOrCreateValue(Elements);
2055 // The bucket can point to a linked list of different CDS's that have the same
2056 // body but different types. For example, 0,0,0,1 could be a 4 element array
2057 // of i8, or a 1-element array of i32. They'll both end up in the same
2058 /// StringMap bucket, linked up by their Next pointers. Walk the list.
2059 ConstantDataSequential **Entry = &Slot.getValue();
2060 for (ConstantDataSequential *Node = *Entry; Node != 0;
2061 Entry = &Node->Next, Node = *Entry)
2062 if (Node->getType() == Ty)
2065 // Okay, we didn't get a hit. Create a node of the right class, link it in,
2067 if (isa<ArrayType>(Ty))
2068 return *Entry = new ConstantDataArray(Ty, Slot.getKeyData());
2070 assert(isa<VectorType>(Ty));
2071 return *Entry = new ConstantDataVector(Ty, Slot.getKeyData());
2074 void ConstantDataSequential::destroyConstant() {
2075 // Remove the constant from the StringMap.
2076 StringMap<ConstantDataSequential*> &CDSConstants =
2077 getType()->getContext().pImpl->CDSConstants;
2079 StringMap<ConstantDataSequential*>::iterator Slot =
2080 CDSConstants.find(getRawDataValues());
2082 assert(Slot != CDSConstants.end() && "CDS not found in uniquing table");
2084 ConstantDataSequential **Entry = &Slot->getValue();
2086 // Remove the entry from the hash table.
2087 if ((*Entry)->Next == 0) {
2088 // If there is only one value in the bucket (common case) it must be this
2089 // entry, and removing the entry should remove the bucket completely.
2090 assert((*Entry) == this && "Hash mismatch in ConstantDataSequential");
2091 getContext().pImpl->CDSConstants.erase(Slot);
2093 // Otherwise, there are multiple entries linked off the bucket, unlink the
2094 // node we care about but keep the bucket around.
2095 for (ConstantDataSequential *Node = *Entry; ;
2096 Entry = &Node->Next, Node = *Entry) {
2097 assert(Node && "Didn't find entry in its uniquing hash table!");
2098 // If we found our entry, unlink it from the list and we're done.
2100 *Entry = Node->Next;
2106 // If we were part of a list, make sure that we don't delete the list that is
2107 // still owned by the uniquing map.
2110 // Finally, actually delete it.
2111 destroyConstantImpl();
2114 /// get() constructors - Return a constant with array type with an element
2115 /// count and element type matching the ArrayRef passed in. Note that this
2116 /// can return a ConstantAggregateZero object.
2117 Constant *ConstantDataArray::get(ArrayRef<uint8_t> Elts, LLVMContext &Context) {
2118 Type *Ty = ArrayType::get(Type::getInt8Ty(Context), Elts.size());
2119 return getImpl(StringRef((char*)Elts.data(), Elts.size()*1), Ty);
2121 Constant *ConstantDataArray::get(ArrayRef<uint16_t> Elts, LLVMContext &Context){
2122 Type *Ty = ArrayType::get(Type::getInt16Ty(Context), Elts.size());
2123 return getImpl(StringRef((char*)Elts.data(), Elts.size()*2), Ty);
2125 Constant *ConstantDataArray::get(ArrayRef<uint32_t> Elts, LLVMContext &Context){
2126 Type *Ty = ArrayType::get(Type::getInt32Ty(Context), Elts.size());
2127 return getImpl(StringRef((char*)Elts.data(), Elts.size()*4), Ty);
2129 Constant *ConstantDataArray::get(ArrayRef<uint64_t> Elts, LLVMContext &Context){
2130 Type *Ty = ArrayType::get(Type::getInt64Ty(Context), Elts.size());
2131 return getImpl(StringRef((char*)Elts.data(), Elts.size()*8), Ty);
2133 Constant *ConstantDataArray::get(ArrayRef<float> Elts, LLVMContext &Context) {
2134 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size());
2135 return getImpl(StringRef((char*)Elts.data(), Elts.size()*4), Ty);
2137 Constant *ConstantDataArray::get(ArrayRef<double> Elts, LLVMContext &Context) {
2138 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size());
2139 return getImpl(StringRef((char*)Elts.data(), Elts.size()*8), Ty);
2143 /// get() constructors - Return a constant with vector type with an element
2144 /// count and element type matching the ArrayRef passed in. Note that this
2145 /// can return a ConstantAggregateZero object.
2146 Constant *ConstantDataVector::get(ArrayRef<uint8_t> Elts, LLVMContext &Context) {
2147 Type *Ty = VectorType::get(Type::getInt8Ty(Context), Elts.size());
2148 return getImpl(StringRef((char*)Elts.data(), Elts.size()*1), Ty);
2150 Constant *ConstantDataVector::get(ArrayRef<uint16_t> Elts, LLVMContext &Context){
2151 Type *Ty = VectorType::get(Type::getInt16Ty(Context), Elts.size());
2152 return getImpl(StringRef((char*)Elts.data(), Elts.size()*2), Ty);
2154 Constant *ConstantDataVector::get(ArrayRef<uint32_t> Elts, LLVMContext &Context){
2155 Type *Ty = VectorType::get(Type::getInt32Ty(Context), Elts.size());
2156 return getImpl(StringRef((char*)Elts.data(), Elts.size()*4), Ty);
2158 Constant *ConstantDataVector::get(ArrayRef<uint64_t> Elts, LLVMContext &Context){
2159 Type *Ty = VectorType::get(Type::getInt64Ty(Context), Elts.size());
2160 return getImpl(StringRef((char*)Elts.data(), Elts.size()*8), Ty);
2162 Constant *ConstantDataVector::get(ArrayRef<float> Elts, LLVMContext &Context) {
2163 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2164 return getImpl(StringRef((char*)Elts.data(), Elts.size()*4), Ty);
2166 Constant *ConstantDataVector::get(ArrayRef<double> Elts, LLVMContext &Context) {
2167 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2168 return getImpl(StringRef((char*)Elts.data(), Elts.size()*8), Ty);
2171 /// getElementAsInteger - If this is a sequential container of integers (of
2172 /// any size), return the specified element in the low bits of a uint64_t.
2173 uint64_t ConstantDataSequential::getElementAsInteger(unsigned Elt) const {
2174 assert(isa<IntegerType>(getElementType()) &&
2175 "Accessor can only be used when element is an integer");
2176 const char *EltPtr = getElementPointer(Elt);
2178 // The data is stored in host byte order, make sure to cast back to the right
2179 // type to load with the right endianness.
2180 switch (cast<IntegerType>(getElementType())->getBitWidth()) {
2181 default: assert(0 && "Invalid bitwidth for CDS");
2182 case 8: return *(uint8_t*)EltPtr;
2183 case 16: return *(uint16_t*)EltPtr;
2184 case 32: return *(uint32_t*)EltPtr;
2185 case 64: return *(uint64_t*)EltPtr;
2189 /// getElementAsAPFloat - If this is a sequential container of floating point
2190 /// type, return the specified element as an APFloat.
2191 APFloat ConstantDataSequential::getElementAsAPFloat(unsigned Elt) const {
2192 const char *EltPtr = getElementPointer(Elt);
2194 switch (getElementType()->getTypeID()) {
2195 default: assert("Accessor can only be used when element is float/double!");
2196 case Type::FloatTyID: return APFloat(*(float*)EltPtr);
2197 case Type::DoubleTyID: return APFloat(*(double*)EltPtr);
2201 /// getElementAsFloat - If this is an sequential container of floats, return
2202 /// the specified element as a float.
2203 float ConstantDataSequential::getElementAsFloat(unsigned Elt) const {
2204 assert(getElementType()->isFloatTy() &&
2205 "Accessor can only be used when element is a 'float'");
2206 return *(float*)getElementPointer(Elt);
2209 /// getElementAsDouble - If this is an sequential container of doubles, return
2210 /// the specified element as a float.
2211 double ConstantDataSequential::getElementAsDouble(unsigned Elt) const {
2212 assert(getElementType()->isDoubleTy() &&
2213 "Accessor can only be used when element is a 'float'");
2214 return *(double*)getElementPointer(Elt);
2217 /// getElementAsConstant - Return a Constant for a specified index's element.
2218 /// Note that this has to compute a new constant to return, so it isn't as
2219 /// efficient as getElementAsInteger/Float/Double.
2220 Constant *ConstantDataSequential::getElementAsConstant(unsigned Elt) const {
2221 if (getElementType()->isFloatTy() || getElementType()->isDoubleTy())
2222 return ConstantFP::get(getContext(), getElementAsAPFloat(Elt));
2224 return ConstantInt::get(getElementType(), getElementAsInteger(Elt));
2227 /// isString - This method returns true if this is an array of i8.
2228 bool ConstantDataSequential::isString() const {
2229 return isa<ArrayType>(getType()) && getElementType()->isIntegerTy(8);
2232 /// isCString - This method returns true if the array "isString", ends with a
2233 /// nul byte, and does not contains any other nul bytes.
2234 bool ConstantDataSequential::isCString() const {
2238 StringRef Str = getAsString();
2240 // The last value must be nul.
2241 if (Str.back() != 0) return false;
2243 // Other elements must be non-nul.
2244 return Str.drop_back().find(0) == StringRef::npos;
2248 //===----------------------------------------------------------------------===//
2249 // replaceUsesOfWithOnConstant implementations
2251 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2252 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2255 /// Note that we intentionally replace all uses of From with To here. Consider
2256 /// a large array that uses 'From' 1000 times. By handling this case all here,
2257 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2258 /// single invocation handles all 1000 uses. Handling them one at a time would
2259 /// work, but would be really slow because it would have to unique each updated
2262 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2264 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2265 Constant *ToC = cast<Constant>(To);
2267 LLVMContextImpl *pImpl = getType()->getContext().pImpl;
2269 std::pair<LLVMContextImpl::ArrayConstantsTy::MapKey, ConstantArray*> Lookup;
2270 Lookup.first.first = cast<ArrayType>(getType());
2271 Lookup.second = this;
2273 std::vector<Constant*> &Values = Lookup.first.second;
2274 Values.reserve(getNumOperands()); // Build replacement array.
2276 // Fill values with the modified operands of the constant array. Also,
2277 // compute whether this turns into an all-zeros array.
2278 bool isAllZeros = false;
2279 unsigned NumUpdated = 0;
2280 if (!ToC->isNullValue()) {
2281 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2282 Constant *Val = cast<Constant>(O->get());
2287 Values.push_back(Val);
2291 for (Use *O = OperandList, *E = OperandList+getNumOperands();O != E; ++O) {
2292 Constant *Val = cast<Constant>(O->get());
2297 Values.push_back(Val);
2298 if (isAllZeros) isAllZeros = Val->isNullValue();
2302 Constant *Replacement = 0;
2304 Replacement = ConstantAggregateZero::get(getType());
2306 // Check to see if we have this array type already.
2308 LLVMContextImpl::ArrayConstantsTy::MapTy::iterator I =
2309 pImpl->ArrayConstants.InsertOrGetItem(Lookup, Exists);
2312 Replacement = I->second;
2314 // Okay, the new shape doesn't exist in the system yet. Instead of
2315 // creating a new constant array, inserting it, replaceallusesof'ing the
2316 // old with the new, then deleting the old... just update the current one
2318 pImpl->ArrayConstants.MoveConstantToNewSlot(this, I);
2320 // Update to the new value. Optimize for the case when we have a single
2321 // operand that we're changing, but handle bulk updates efficiently.
2322 if (NumUpdated == 1) {
2323 unsigned OperandToUpdate = U - OperandList;
2324 assert(getOperand(OperandToUpdate) == From &&
2325 "ReplaceAllUsesWith broken!");
2326 setOperand(OperandToUpdate, ToC);
2328 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
2329 if (getOperand(i) == From)
2336 // Otherwise, I do need to replace this with an existing value.
2337 assert(Replacement != this && "I didn't contain From!");
2339 // Everyone using this now uses the replacement.
2340 replaceAllUsesWith(Replacement);
2342 // Delete the old constant!
2346 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2348 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2349 Constant *ToC = cast<Constant>(To);
2351 unsigned OperandToUpdate = U-OperandList;
2352 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2354 std::pair<LLVMContextImpl::StructConstantsTy::MapKey, ConstantStruct*> Lookup;
2355 Lookup.first.first = cast<StructType>(getType());
2356 Lookup.second = this;
2357 std::vector<Constant*> &Values = Lookup.first.second;
2358 Values.reserve(getNumOperands()); // Build replacement struct.
2361 // Fill values with the modified operands of the constant struct. Also,
2362 // compute whether this turns into an all-zeros struct.
2363 bool isAllZeros = false;
2364 if (!ToC->isNullValue()) {
2365 for (Use *O = OperandList, *E = OperandList + getNumOperands(); O != E; ++O)
2366 Values.push_back(cast<Constant>(O->get()));
2369 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2370 Constant *Val = cast<Constant>(O->get());
2371 Values.push_back(Val);
2372 if (isAllZeros) isAllZeros = Val->isNullValue();
2375 Values[OperandToUpdate] = ToC;
2377 LLVMContextImpl *pImpl = getContext().pImpl;
2379 Constant *Replacement = 0;
2381 Replacement = ConstantAggregateZero::get(getType());
2383 // Check to see if we have this struct type already.
2385 LLVMContextImpl::StructConstantsTy::MapTy::iterator I =
2386 pImpl->StructConstants.InsertOrGetItem(Lookup, Exists);
2389 Replacement = I->second;
2391 // Okay, the new shape doesn't exist in the system yet. Instead of
2392 // creating a new constant struct, inserting it, replaceallusesof'ing the
2393 // old with the new, then deleting the old... just update the current one
2395 pImpl->StructConstants.MoveConstantToNewSlot(this, I);
2397 // Update to the new value.
2398 setOperand(OperandToUpdate, ToC);
2403 assert(Replacement != this && "I didn't contain From!");
2405 // Everyone using this now uses the replacement.
2406 replaceAllUsesWith(Replacement);
2408 // Delete the old constant!
2412 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2414 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2416 std::vector<Constant*> Values;
2417 Values.reserve(getNumOperands()); // Build replacement array...
2418 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2419 Constant *Val = getOperand(i);
2420 if (Val == From) Val = cast<Constant>(To);
2421 Values.push_back(Val);
2424 Constant *Replacement = get(Values);
2425 assert(Replacement != this && "I didn't contain From!");
2427 // Everyone using this now uses the replacement.
2428 replaceAllUsesWith(Replacement);
2430 // Delete the old constant!
2434 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2436 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2437 Constant *To = cast<Constant>(ToV);
2439 Constant *Replacement = 0;
2440 if (getOpcode() == Instruction::GetElementPtr) {
2441 SmallVector<Constant*, 8> Indices;
2442 Constant *Pointer = getOperand(0);
2443 Indices.reserve(getNumOperands()-1);
2444 if (Pointer == From) Pointer = To;
2446 for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
2447 Constant *Val = getOperand(i);
2448 if (Val == From) Val = To;
2449 Indices.push_back(Val);
2451 Replacement = ConstantExpr::getGetElementPtr(Pointer, Indices,
2452 cast<GEPOperator>(this)->isInBounds());
2453 } else if (getOpcode() == Instruction::ExtractValue) {
2454 Constant *Agg = getOperand(0);
2455 if (Agg == From) Agg = To;
2457 ArrayRef<unsigned> Indices = getIndices();
2458 Replacement = ConstantExpr::getExtractValue(Agg, Indices);
2459 } else if (getOpcode() == Instruction::InsertValue) {
2460 Constant *Agg = getOperand(0);
2461 Constant *Val = getOperand(1);
2462 if (Agg == From) Agg = To;
2463 if (Val == From) Val = To;
2465 ArrayRef<unsigned> Indices = getIndices();
2466 Replacement = ConstantExpr::getInsertValue(Agg, Val, Indices);
2467 } else if (isCast()) {
2468 assert(getOperand(0) == From && "Cast only has one use!");
2469 Replacement = ConstantExpr::getCast(getOpcode(), To, getType());
2470 } else if (getOpcode() == Instruction::Select) {
2471 Constant *C1 = getOperand(0);
2472 Constant *C2 = getOperand(1);
2473 Constant *C3 = getOperand(2);
2474 if (C1 == From) C1 = To;
2475 if (C2 == From) C2 = To;
2476 if (C3 == From) C3 = To;
2477 Replacement = ConstantExpr::getSelect(C1, C2, C3);
2478 } else if (getOpcode() == Instruction::ExtractElement) {
2479 Constant *C1 = getOperand(0);
2480 Constant *C2 = getOperand(1);
2481 if (C1 == From) C1 = To;
2482 if (C2 == From) C2 = To;
2483 Replacement = ConstantExpr::getExtractElement(C1, C2);
2484 } else if (getOpcode() == Instruction::InsertElement) {
2485 Constant *C1 = getOperand(0);
2486 Constant *C2 = getOperand(1);
2487 Constant *C3 = getOperand(1);
2488 if (C1 == From) C1 = To;
2489 if (C2 == From) C2 = To;
2490 if (C3 == From) C3 = To;
2491 Replacement = ConstantExpr::getInsertElement(C1, C2, C3);
2492 } else if (getOpcode() == Instruction::ShuffleVector) {
2493 Constant *C1 = getOperand(0);
2494 Constant *C2 = getOperand(1);
2495 Constant *C3 = getOperand(2);
2496 if (C1 == From) C1 = To;
2497 if (C2 == From) C2 = To;
2498 if (C3 == From) C3 = To;
2499 Replacement = ConstantExpr::getShuffleVector(C1, C2, C3);
2500 } else if (isCompare()) {
2501 Constant *C1 = getOperand(0);
2502 Constant *C2 = getOperand(1);
2503 if (C1 == From) C1 = To;
2504 if (C2 == From) C2 = To;
2505 if (getOpcode() == Instruction::ICmp)
2506 Replacement = ConstantExpr::getICmp(getPredicate(), C1, C2);
2508 assert(getOpcode() == Instruction::FCmp);
2509 Replacement = ConstantExpr::getFCmp(getPredicate(), C1, C2);
2511 } else if (getNumOperands() == 2) {
2512 Constant *C1 = getOperand(0);
2513 Constant *C2 = getOperand(1);
2514 if (C1 == From) C1 = To;
2515 if (C2 == From) C2 = To;
2516 Replacement = ConstantExpr::get(getOpcode(), C1, C2, SubclassOptionalData);
2518 llvm_unreachable("Unknown ConstantExpr type!");
2521 assert(Replacement != this && "I didn't contain From!");
2523 // Everyone using this now uses the replacement.
2524 replaceAllUsesWith(Replacement);
2526 // Delete the old constant!