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/IR/Constants.h"
15 #include "ConstantFold.h"
16 #include "LLVMContextImpl.h"
17 #include "llvm/ADT/DenseMap.h"
18 #include "llvm/ADT/FoldingSet.h"
19 #include "llvm/ADT/STLExtras.h"
20 #include "llvm/ADT/SmallVector.h"
21 #include "llvm/ADT/StringExtras.h"
22 #include "llvm/ADT/StringMap.h"
23 #include "llvm/IR/DerivedTypes.h"
24 #include "llvm/IR/GetElementPtrTypeIterator.h"
25 #include "llvm/IR/GlobalValue.h"
26 #include "llvm/IR/Instructions.h"
27 #include "llvm/IR/Module.h"
28 #include "llvm/IR/Operator.h"
29 #include "llvm/Support/Compiler.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/Support/ErrorHandling.h"
32 #include "llvm/Support/ManagedStatic.h"
33 #include "llvm/Support/MathExtras.h"
34 #include "llvm/Support/raw_ostream.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 // Equivalent for a vector of -0.0's.
51 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
52 if (ConstantFP *SplatCFP = dyn_cast_or_null<ConstantFP>(CV->getSplatValue()))
53 if (SplatCFP && SplatCFP->isZero() && SplatCFP->isNegative())
56 // We've already handled true FP case; any other FP vectors can't represent -0.0.
57 if (getType()->isFPOrFPVectorTy())
60 // Otherwise, just use +0.0.
64 // Return true iff this constant is positive zero (floating point), negative
65 // zero (floating point), or a null value.
66 bool Constant::isZeroValue() const {
67 // Floating point values have an explicit -0.0 value.
68 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
71 // Otherwise, just use +0.0.
75 bool Constant::isNullValue() const {
77 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
81 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
82 return CFP->isZero() && !CFP->isNegative();
84 // constant zero is zero for aggregates and cpnull is null for pointers.
85 return isa<ConstantAggregateZero>(this) || isa<ConstantPointerNull>(this);
88 bool Constant::isAllOnesValue() const {
89 // Check for -1 integers
90 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
91 return CI->isMinusOne();
93 // Check for FP which are bitcasted from -1 integers
94 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
95 return CFP->getValueAPF().bitcastToAPInt().isAllOnesValue();
97 // Check for constant vectors which are splats of -1 values.
98 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
99 if (Constant *Splat = CV->getSplatValue())
100 return Splat->isAllOnesValue();
102 // Check for constant vectors which are splats of -1 values.
103 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
104 if (Constant *Splat = CV->getSplatValue())
105 return Splat->isAllOnesValue();
110 bool Constant::isOneValue() const {
111 // Check for 1 integers
112 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
115 // Check for FP which are bitcasted from 1 integers
116 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
117 return CFP->getValueAPF().bitcastToAPInt() == 1;
119 // Check for constant vectors which are splats of 1 values.
120 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
121 if (Constant *Splat = CV->getSplatValue())
122 return Splat->isOneValue();
124 // Check for constant vectors which are splats of 1 values.
125 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
126 if (Constant *Splat = CV->getSplatValue())
127 return Splat->isOneValue();
132 bool Constant::isMinSignedValue() const {
133 // Check for INT_MIN integers
134 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
135 return CI->isMinValue(/*isSigned=*/true);
137 // Check for FP which are bitcasted from INT_MIN integers
138 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
139 return CFP->getValueAPF().bitcastToAPInt().isMinSignedValue();
141 // Check for constant vectors which are splats of INT_MIN values.
142 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
143 if (Constant *Splat = CV->getSplatValue())
144 return Splat->isMinSignedValue();
146 // Check for constant vectors which are splats of INT_MIN values.
147 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
148 if (Constant *Splat = CV->getSplatValue())
149 return Splat->isMinSignedValue();
154 bool Constant::isNotMinSignedValue() const {
155 // Check for INT_MIN integers
156 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
157 return !CI->isMinValue(/*isSigned=*/true);
159 // Check for FP which are bitcasted from INT_MIN integers
160 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(this))
161 return !CFP->getValueAPF().bitcastToAPInt().isMinSignedValue();
163 // Check for constant vectors which are splats of INT_MIN values.
164 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
165 if (Constant *Splat = CV->getSplatValue())
166 return Splat->isNotMinSignedValue();
168 // Check for constant vectors which are splats of INT_MIN values.
169 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
170 if (Constant *Splat = CV->getSplatValue())
171 return Splat->isNotMinSignedValue();
173 // It *may* contain INT_MIN, we can't tell.
177 // Constructor to create a '0' constant of arbitrary type...
178 Constant *Constant::getNullValue(Type *Ty) {
179 switch (Ty->getTypeID()) {
180 case Type::IntegerTyID:
181 return ConstantInt::get(Ty, 0);
183 return ConstantFP::get(Ty->getContext(),
184 APFloat::getZero(APFloat::IEEEhalf));
185 case Type::FloatTyID:
186 return ConstantFP::get(Ty->getContext(),
187 APFloat::getZero(APFloat::IEEEsingle));
188 case Type::DoubleTyID:
189 return ConstantFP::get(Ty->getContext(),
190 APFloat::getZero(APFloat::IEEEdouble));
191 case Type::X86_FP80TyID:
192 return ConstantFP::get(Ty->getContext(),
193 APFloat::getZero(APFloat::x87DoubleExtended));
194 case Type::FP128TyID:
195 return ConstantFP::get(Ty->getContext(),
196 APFloat::getZero(APFloat::IEEEquad));
197 case Type::PPC_FP128TyID:
198 return ConstantFP::get(Ty->getContext(),
199 APFloat(APFloat::PPCDoubleDouble,
200 APInt::getNullValue(128)));
201 case Type::PointerTyID:
202 return ConstantPointerNull::get(cast<PointerType>(Ty));
203 case Type::StructTyID:
204 case Type::ArrayTyID:
205 case Type::VectorTyID:
206 return ConstantAggregateZero::get(Ty);
208 // Function, Label, or Opaque type?
209 llvm_unreachable("Cannot create a null constant of that type!");
213 Constant *Constant::getIntegerValue(Type *Ty, const APInt &V) {
214 Type *ScalarTy = Ty->getScalarType();
216 // Create the base integer constant.
217 Constant *C = ConstantInt::get(Ty->getContext(), V);
219 // Convert an integer to a pointer, if necessary.
220 if (PointerType *PTy = dyn_cast<PointerType>(ScalarTy))
221 C = ConstantExpr::getIntToPtr(C, PTy);
223 // Broadcast a scalar to a vector, if necessary.
224 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
225 C = ConstantVector::getSplat(VTy->getNumElements(), C);
230 Constant *Constant::getAllOnesValue(Type *Ty) {
231 if (IntegerType *ITy = dyn_cast<IntegerType>(Ty))
232 return ConstantInt::get(Ty->getContext(),
233 APInt::getAllOnesValue(ITy->getBitWidth()));
235 if (Ty->isFloatingPointTy()) {
236 APFloat FL = APFloat::getAllOnesValue(Ty->getPrimitiveSizeInBits(),
237 !Ty->isPPC_FP128Ty());
238 return ConstantFP::get(Ty->getContext(), FL);
241 VectorType *VTy = cast<VectorType>(Ty);
242 return ConstantVector::getSplat(VTy->getNumElements(),
243 getAllOnesValue(VTy->getElementType()));
246 /// getAggregateElement - For aggregates (struct/array/vector) return the
247 /// constant that corresponds to the specified element if possible, or null if
248 /// not. This can return null if the element index is a ConstantExpr, or if
249 /// 'this' is a constant expr.
250 Constant *Constant::getAggregateElement(unsigned Elt) const {
251 if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(this))
252 return Elt < CS->getNumOperands() ? CS->getOperand(Elt) : nullptr;
254 if (const ConstantArray *CA = dyn_cast<ConstantArray>(this))
255 return Elt < CA->getNumOperands() ? CA->getOperand(Elt) : nullptr;
257 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
258 return Elt < CV->getNumOperands() ? CV->getOperand(Elt) : nullptr;
260 if (const ConstantAggregateZero *CAZ = dyn_cast<ConstantAggregateZero>(this))
261 return Elt < CAZ->getNumElements() ? CAZ->getElementValue(Elt) : nullptr;
263 if (const UndefValue *UV = dyn_cast<UndefValue>(this))
264 return Elt < UV->getNumElements() ? UV->getElementValue(Elt) : nullptr;
266 if (const ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(this))
267 return Elt < CDS->getNumElements() ? CDS->getElementAsConstant(Elt)
272 Constant *Constant::getAggregateElement(Constant *Elt) const {
273 assert(isa<IntegerType>(Elt->getType()) && "Index must be an integer");
274 if (ConstantInt *CI = dyn_cast<ConstantInt>(Elt))
275 return getAggregateElement(CI->getZExtValue());
279 void Constant::destroyConstant() {
280 /// First call destroyConstantImpl on the subclass. This gives the subclass
281 /// a chance to remove the constant from any maps/pools it's contained in.
282 switch (getValueID()) {
284 llvm_unreachable("Not a constant!");
285 #define HANDLE_CONSTANT(Name) \
286 case Value::Name##Val: \
287 cast<Name>(this)->destroyConstantImpl(); \
289 #include "llvm/IR/Value.def"
292 // When a Constant is destroyed, there may be lingering
293 // references to the constant by other constants in the constant pool. These
294 // constants are implicitly dependent on the module that is being deleted,
295 // but they don't know that. Because we only find out when the CPV is
296 // deleted, we must now notify all of our users (that should only be
297 // Constants) that they are, in fact, invalid now and should be deleted.
299 while (!use_empty()) {
300 Value *V = user_back();
301 #ifndef NDEBUG // Only in -g mode...
302 if (!isa<Constant>(V)) {
303 dbgs() << "While deleting: " << *this
304 << "\n\nUse still stuck around after Def is destroyed: " << *V
308 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
309 cast<Constant>(V)->destroyConstant();
311 // The constant should remove itself from our use list...
312 assert((use_empty() || user_back() != V) && "Constant not removed!");
315 // Value has no outstanding references it is safe to delete it now...
319 static bool canTrapImpl(const Constant *C,
320 SmallPtrSetImpl<const ConstantExpr *> &NonTrappingOps) {
321 assert(C->getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
322 // The only thing that could possibly trap are constant exprs.
323 const ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
327 // ConstantExpr traps if any operands can trap.
328 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
329 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(CE->getOperand(i))) {
330 if (NonTrappingOps.insert(Op).second && canTrapImpl(Op, NonTrappingOps))
335 // Otherwise, only specific operations can trap.
336 switch (CE->getOpcode()) {
339 case Instruction::UDiv:
340 case Instruction::SDiv:
341 case Instruction::FDiv:
342 case Instruction::URem:
343 case Instruction::SRem:
344 case Instruction::FRem:
345 // Div and rem can trap if the RHS is not known to be non-zero.
346 if (!isa<ConstantInt>(CE->getOperand(1)) ||CE->getOperand(1)->isNullValue())
352 /// canTrap - Return true if evaluation of this constant could trap. This is
353 /// true for things like constant expressions that could divide by zero.
354 bool Constant::canTrap() const {
355 SmallPtrSet<const ConstantExpr *, 4> NonTrappingOps;
356 return canTrapImpl(this, NonTrappingOps);
359 /// Check if C contains a GlobalValue for which Predicate is true.
361 ConstHasGlobalValuePredicate(const Constant *C,
362 bool (*Predicate)(const GlobalValue *)) {
363 SmallPtrSet<const Constant *, 8> Visited;
364 SmallVector<const Constant *, 8> WorkList;
365 WorkList.push_back(C);
368 while (!WorkList.empty()) {
369 const Constant *WorkItem = WorkList.pop_back_val();
370 if (const auto *GV = dyn_cast<GlobalValue>(WorkItem))
373 for (const Value *Op : WorkItem->operands()) {
374 const Constant *ConstOp = dyn_cast<Constant>(Op);
377 if (Visited.insert(ConstOp).second)
378 WorkList.push_back(ConstOp);
384 /// Return true if the value can vary between threads.
385 bool Constant::isThreadDependent() const {
386 auto DLLImportPredicate = [](const GlobalValue *GV) {
387 return GV->isThreadLocal();
389 return ConstHasGlobalValuePredicate(this, DLLImportPredicate);
392 bool Constant::isDLLImportDependent() const {
393 auto DLLImportPredicate = [](const GlobalValue *GV) {
394 return GV->hasDLLImportStorageClass();
396 return ConstHasGlobalValuePredicate(this, DLLImportPredicate);
399 /// Return true if the constant has users other than constant exprs and other
401 bool Constant::isConstantUsed() const {
402 for (const User *U : users()) {
403 const Constant *UC = dyn_cast<Constant>(U);
404 if (!UC || isa<GlobalValue>(UC))
407 if (UC->isConstantUsed())
415 /// getRelocationInfo - This method classifies the entry according to
416 /// whether or not it may generate a relocation entry. This must be
417 /// conservative, so if it might codegen to a relocatable entry, it should say
418 /// so. The return values are:
420 /// NoRelocation: This constant pool entry is guaranteed to never have a
421 /// relocation applied to it (because it holds a simple constant like
423 /// LocalRelocation: This entry has relocations, but the entries are
424 /// guaranteed to be resolvable by the static linker, so the dynamic
425 /// linker will never see them.
426 /// GlobalRelocations: This entry may have arbitrary relocations.
428 /// FIXME: This really should not be in IR.
429 Constant::PossibleRelocationsTy Constant::getRelocationInfo() const {
430 if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
431 if (GV->hasLocalLinkage() || GV->hasHiddenVisibility())
432 return LocalRelocation; // Local to this file/library.
433 return GlobalRelocations; // Global reference.
436 if (const BlockAddress *BA = dyn_cast<BlockAddress>(this))
437 return BA->getFunction()->getRelocationInfo();
439 // While raw uses of blockaddress need to be relocated, differences between
440 // two of them don't when they are for labels in the same function. This is a
441 // common idiom when creating a table for the indirect goto extension, so we
442 // handle it efficiently here.
443 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(this))
444 if (CE->getOpcode() == Instruction::Sub) {
445 ConstantExpr *LHS = dyn_cast<ConstantExpr>(CE->getOperand(0));
446 ConstantExpr *RHS = dyn_cast<ConstantExpr>(CE->getOperand(1));
448 LHS->getOpcode() == Instruction::PtrToInt &&
449 RHS->getOpcode() == Instruction::PtrToInt &&
450 isa<BlockAddress>(LHS->getOperand(0)) &&
451 isa<BlockAddress>(RHS->getOperand(0)) &&
452 cast<BlockAddress>(LHS->getOperand(0))->getFunction() ==
453 cast<BlockAddress>(RHS->getOperand(0))->getFunction())
457 PossibleRelocationsTy Result = NoRelocation;
458 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
459 Result = std::max(Result,
460 cast<Constant>(getOperand(i))->getRelocationInfo());
465 /// removeDeadUsersOfConstant - If the specified constantexpr is dead, remove
466 /// it. This involves recursively eliminating any dead users of the
468 static bool removeDeadUsersOfConstant(const Constant *C) {
469 if (isa<GlobalValue>(C)) return false; // Cannot remove this
471 while (!C->use_empty()) {
472 const Constant *User = dyn_cast<Constant>(C->user_back());
473 if (!User) return false; // Non-constant usage;
474 if (!removeDeadUsersOfConstant(User))
475 return false; // Constant wasn't dead
478 const_cast<Constant*>(C)->destroyConstant();
483 /// removeDeadConstantUsers - If there are any dead constant users dangling
484 /// off of this constant, remove them. This method is useful for clients
485 /// that want to check to see if a global is unused, but don't want to deal
486 /// with potentially dead constants hanging off of the globals.
487 void Constant::removeDeadConstantUsers() const {
488 Value::const_user_iterator I = user_begin(), E = user_end();
489 Value::const_user_iterator LastNonDeadUser = E;
491 const Constant *User = dyn_cast<Constant>(*I);
498 if (!removeDeadUsersOfConstant(User)) {
499 // If the constant wasn't dead, remember that this was the last live use
500 // and move on to the next constant.
506 // If the constant was dead, then the iterator is invalidated.
507 if (LastNonDeadUser == E) {
519 //===----------------------------------------------------------------------===//
521 //===----------------------------------------------------------------------===//
523 void ConstantInt::anchor() { }
525 ConstantInt::ConstantInt(IntegerType *Ty, const APInt& V)
526 : Constant(Ty, ConstantIntVal, nullptr, 0), Val(V) {
527 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
530 ConstantInt *ConstantInt::getTrue(LLVMContext &Context) {
531 LLVMContextImpl *pImpl = Context.pImpl;
532 if (!pImpl->TheTrueVal)
533 pImpl->TheTrueVal = ConstantInt::get(Type::getInt1Ty(Context), 1);
534 return pImpl->TheTrueVal;
537 ConstantInt *ConstantInt::getFalse(LLVMContext &Context) {
538 LLVMContextImpl *pImpl = Context.pImpl;
539 if (!pImpl->TheFalseVal)
540 pImpl->TheFalseVal = ConstantInt::get(Type::getInt1Ty(Context), 0);
541 return pImpl->TheFalseVal;
544 Constant *ConstantInt::getTrue(Type *Ty) {
545 VectorType *VTy = dyn_cast<VectorType>(Ty);
547 assert(Ty->isIntegerTy(1) && "True must be i1 or vector of i1.");
548 return ConstantInt::getTrue(Ty->getContext());
550 assert(VTy->getElementType()->isIntegerTy(1) &&
551 "True must be vector of i1 or i1.");
552 return ConstantVector::getSplat(VTy->getNumElements(),
553 ConstantInt::getTrue(Ty->getContext()));
556 Constant *ConstantInt::getFalse(Type *Ty) {
557 VectorType *VTy = dyn_cast<VectorType>(Ty);
559 assert(Ty->isIntegerTy(1) && "False must be i1 or vector of i1.");
560 return ConstantInt::getFalse(Ty->getContext());
562 assert(VTy->getElementType()->isIntegerTy(1) &&
563 "False must be vector of i1 or i1.");
564 return ConstantVector::getSplat(VTy->getNumElements(),
565 ConstantInt::getFalse(Ty->getContext()));
568 // Get a ConstantInt from an APInt.
569 ConstantInt *ConstantInt::get(LLVMContext &Context, const APInt &V) {
570 // get an existing value or the insertion position
571 LLVMContextImpl *pImpl = Context.pImpl;
572 ConstantInt *&Slot = pImpl->IntConstants[V];
574 // Get the corresponding integer type for the bit width of the value.
575 IntegerType *ITy = IntegerType::get(Context, V.getBitWidth());
576 Slot = new ConstantInt(ITy, V);
578 assert(Slot->getType() == IntegerType::get(Context, V.getBitWidth()));
582 Constant *ConstantInt::get(Type *Ty, uint64_t V, bool isSigned) {
583 Constant *C = get(cast<IntegerType>(Ty->getScalarType()), V, isSigned);
585 // For vectors, broadcast the value.
586 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
587 return ConstantVector::getSplat(VTy->getNumElements(), C);
592 ConstantInt *ConstantInt::get(IntegerType *Ty, uint64_t V,
594 return get(Ty->getContext(), APInt(Ty->getBitWidth(), V, isSigned));
597 ConstantInt *ConstantInt::getSigned(IntegerType *Ty, int64_t V) {
598 return get(Ty, V, true);
601 Constant *ConstantInt::getSigned(Type *Ty, int64_t V) {
602 return get(Ty, V, true);
605 Constant *ConstantInt::get(Type *Ty, const APInt& V) {
606 ConstantInt *C = get(Ty->getContext(), V);
607 assert(C->getType() == Ty->getScalarType() &&
608 "ConstantInt type doesn't match the type implied by its value!");
610 // For vectors, broadcast the value.
611 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
612 return ConstantVector::getSplat(VTy->getNumElements(), C);
617 ConstantInt *ConstantInt::get(IntegerType* Ty, StringRef Str,
619 return get(Ty->getContext(), APInt(Ty->getBitWidth(), Str, radix));
622 /// Remove the constant from the constant table.
623 void ConstantInt::destroyConstantImpl() {
624 llvm_unreachable("You can't ConstantInt->destroyConstantImpl()!");
627 //===----------------------------------------------------------------------===//
629 //===----------------------------------------------------------------------===//
631 static const fltSemantics *TypeToFloatSemantics(Type *Ty) {
633 return &APFloat::IEEEhalf;
635 return &APFloat::IEEEsingle;
636 if (Ty->isDoubleTy())
637 return &APFloat::IEEEdouble;
638 if (Ty->isX86_FP80Ty())
639 return &APFloat::x87DoubleExtended;
640 else if (Ty->isFP128Ty())
641 return &APFloat::IEEEquad;
643 assert(Ty->isPPC_FP128Ty() && "Unknown FP format");
644 return &APFloat::PPCDoubleDouble;
647 void ConstantFP::anchor() { }
649 /// get() - This returns a constant fp for the specified value in the
650 /// specified type. This should only be used for simple constant values like
651 /// 2.0/1.0 etc, that are known-valid both as double and as the target format.
652 Constant *ConstantFP::get(Type *Ty, double V) {
653 LLVMContext &Context = Ty->getContext();
657 FV.convert(*TypeToFloatSemantics(Ty->getScalarType()),
658 APFloat::rmNearestTiesToEven, &ignored);
659 Constant *C = get(Context, FV);
661 // For vectors, broadcast the value.
662 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
663 return ConstantVector::getSplat(VTy->getNumElements(), C);
669 Constant *ConstantFP::get(Type *Ty, StringRef Str) {
670 LLVMContext &Context = Ty->getContext();
672 APFloat FV(*TypeToFloatSemantics(Ty->getScalarType()), Str);
673 Constant *C = get(Context, FV);
675 // For vectors, broadcast the value.
676 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
677 return ConstantVector::getSplat(VTy->getNumElements(), C);
682 Constant *ConstantFP::getNaN(Type *Ty, bool Negative, unsigned Type) {
683 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType());
684 APFloat NaN = APFloat::getNaN(Semantics, Negative, Type);
685 Constant *C = get(Ty->getContext(), NaN);
687 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
688 return ConstantVector::getSplat(VTy->getNumElements(), C);
693 Constant *ConstantFP::getNegativeZero(Type *Ty) {
694 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType());
695 APFloat NegZero = APFloat::getZero(Semantics, /*Negative=*/true);
696 Constant *C = get(Ty->getContext(), NegZero);
698 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
699 return ConstantVector::getSplat(VTy->getNumElements(), C);
705 Constant *ConstantFP::getZeroValueForNegation(Type *Ty) {
706 if (Ty->isFPOrFPVectorTy())
707 return getNegativeZero(Ty);
709 return Constant::getNullValue(Ty);
713 // ConstantFP accessors.
714 ConstantFP* ConstantFP::get(LLVMContext &Context, const APFloat& V) {
715 LLVMContextImpl* pImpl = Context.pImpl;
717 ConstantFP *&Slot = pImpl->FPConstants[V];
721 if (&V.getSemantics() == &APFloat::IEEEhalf)
722 Ty = Type::getHalfTy(Context);
723 else if (&V.getSemantics() == &APFloat::IEEEsingle)
724 Ty = Type::getFloatTy(Context);
725 else if (&V.getSemantics() == &APFloat::IEEEdouble)
726 Ty = Type::getDoubleTy(Context);
727 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
728 Ty = Type::getX86_FP80Ty(Context);
729 else if (&V.getSemantics() == &APFloat::IEEEquad)
730 Ty = Type::getFP128Ty(Context);
732 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble &&
733 "Unknown FP format");
734 Ty = Type::getPPC_FP128Ty(Context);
736 Slot = new ConstantFP(Ty, V);
742 Constant *ConstantFP::getInfinity(Type *Ty, bool Negative) {
743 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType());
744 Constant *C = get(Ty->getContext(), APFloat::getInf(Semantics, Negative));
746 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
747 return ConstantVector::getSplat(VTy->getNumElements(), C);
752 ConstantFP::ConstantFP(Type *Ty, const APFloat& V)
753 : Constant(Ty, ConstantFPVal, nullptr, 0), Val(V) {
754 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
758 bool ConstantFP::isExactlyValue(const APFloat &V) const {
759 return Val.bitwiseIsEqual(V);
762 /// Remove the constant from the constant table.
763 void ConstantFP::destroyConstantImpl() {
764 llvm_unreachable("You can't ConstantInt->destroyConstantImpl()!");
767 //===----------------------------------------------------------------------===//
768 // ConstantAggregateZero Implementation
769 //===----------------------------------------------------------------------===//
771 /// getSequentialElement - If this CAZ has array or vector type, return a zero
772 /// with the right element type.
773 Constant *ConstantAggregateZero::getSequentialElement() const {
774 return Constant::getNullValue(getType()->getSequentialElementType());
777 /// getStructElement - If this CAZ has struct type, return a zero with the
778 /// right element type for the specified element.
779 Constant *ConstantAggregateZero::getStructElement(unsigned Elt) const {
780 return Constant::getNullValue(getType()->getStructElementType(Elt));
783 /// getElementValue - Return a zero of the right value for the specified GEP
784 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
785 Constant *ConstantAggregateZero::getElementValue(Constant *C) const {
786 if (isa<SequentialType>(getType()))
787 return getSequentialElement();
788 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
791 /// getElementValue - Return a zero of the right value for the specified GEP
793 Constant *ConstantAggregateZero::getElementValue(unsigned Idx) const {
794 if (isa<SequentialType>(getType()))
795 return getSequentialElement();
796 return getStructElement(Idx);
799 unsigned ConstantAggregateZero::getNumElements() const {
800 Type *Ty = getType();
801 if (auto *AT = dyn_cast<ArrayType>(Ty))
802 return AT->getNumElements();
803 if (auto *VT = dyn_cast<VectorType>(Ty))
804 return VT->getNumElements();
805 return Ty->getStructNumElements();
808 //===----------------------------------------------------------------------===//
809 // UndefValue Implementation
810 //===----------------------------------------------------------------------===//
812 /// getSequentialElement - If this undef has array or vector type, return an
813 /// undef with the right element type.
814 UndefValue *UndefValue::getSequentialElement() const {
815 return UndefValue::get(getType()->getSequentialElementType());
818 /// getStructElement - If this undef has struct type, return a zero with the
819 /// right element type for the specified element.
820 UndefValue *UndefValue::getStructElement(unsigned Elt) const {
821 return UndefValue::get(getType()->getStructElementType(Elt));
824 /// getElementValue - Return an undef of the right value for the specified GEP
825 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
826 UndefValue *UndefValue::getElementValue(Constant *C) const {
827 if (isa<SequentialType>(getType()))
828 return getSequentialElement();
829 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
832 /// getElementValue - Return an undef of the right value for the specified GEP
834 UndefValue *UndefValue::getElementValue(unsigned Idx) const {
835 if (isa<SequentialType>(getType()))
836 return getSequentialElement();
837 return getStructElement(Idx);
840 unsigned UndefValue::getNumElements() const {
841 Type *Ty = getType();
842 if (auto *AT = dyn_cast<ArrayType>(Ty))
843 return AT->getNumElements();
844 if (auto *VT = dyn_cast<VectorType>(Ty))
845 return VT->getNumElements();
846 return Ty->getStructNumElements();
849 //===----------------------------------------------------------------------===//
850 // ConstantXXX Classes
851 //===----------------------------------------------------------------------===//
853 template <typename ItTy, typename EltTy>
854 static bool rangeOnlyContains(ItTy Start, ItTy End, EltTy Elt) {
855 for (; Start != End; ++Start)
861 ConstantArray::ConstantArray(ArrayType *T, ArrayRef<Constant *> V)
862 : Constant(T, ConstantArrayVal,
863 OperandTraits<ConstantArray>::op_end(this) - V.size(),
865 assert(V.size() == T->getNumElements() &&
866 "Invalid initializer vector for constant array");
867 for (unsigned i = 0, e = V.size(); i != e; ++i)
868 assert(V[i]->getType() == T->getElementType() &&
869 "Initializer for array element doesn't match array element type!");
870 std::copy(V.begin(), V.end(), op_begin());
873 Constant *ConstantArray::get(ArrayType *Ty, ArrayRef<Constant*> V) {
874 if (Constant *C = getImpl(Ty, V))
876 return Ty->getContext().pImpl->ArrayConstants.getOrCreate(Ty, V);
878 Constant *ConstantArray::getImpl(ArrayType *Ty, ArrayRef<Constant*> V) {
879 // Empty arrays are canonicalized to ConstantAggregateZero.
881 return ConstantAggregateZero::get(Ty);
883 for (unsigned i = 0, e = V.size(); i != e; ++i) {
884 assert(V[i]->getType() == Ty->getElementType() &&
885 "Wrong type in array element initializer");
888 // If this is an all-zero array, return a ConstantAggregateZero object. If
889 // all undef, return an UndefValue, if "all simple", then return a
890 // ConstantDataArray.
892 if (isa<UndefValue>(C) && rangeOnlyContains(V.begin(), V.end(), C))
893 return UndefValue::get(Ty);
895 if (C->isNullValue() && rangeOnlyContains(V.begin(), V.end(), C))
896 return ConstantAggregateZero::get(Ty);
898 // Check to see if all of the elements are ConstantFP or ConstantInt and if
899 // the element type is compatible with ConstantDataVector. If so, use it.
900 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) {
901 // We speculatively build the elements here even if it turns out that there
902 // is a constantexpr or something else weird in the array, since it is so
903 // uncommon for that to happen.
904 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
905 if (CI->getType()->isIntegerTy(8)) {
906 SmallVector<uint8_t, 16> Elts;
907 for (unsigned i = 0, e = V.size(); i != e; ++i)
908 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
909 Elts.push_back(CI->getZExtValue());
912 if (Elts.size() == V.size())
913 return ConstantDataArray::get(C->getContext(), Elts);
914 } else if (CI->getType()->isIntegerTy(16)) {
915 SmallVector<uint16_t, 16> Elts;
916 for (unsigned i = 0, e = V.size(); i != e; ++i)
917 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
918 Elts.push_back(CI->getZExtValue());
921 if (Elts.size() == V.size())
922 return ConstantDataArray::get(C->getContext(), Elts);
923 } else if (CI->getType()->isIntegerTy(32)) {
924 SmallVector<uint32_t, 16> Elts;
925 for (unsigned i = 0, e = V.size(); i != e; ++i)
926 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
927 Elts.push_back(CI->getZExtValue());
930 if (Elts.size() == V.size())
931 return ConstantDataArray::get(C->getContext(), Elts);
932 } else if (CI->getType()->isIntegerTy(64)) {
933 SmallVector<uint64_t, 16> Elts;
934 for (unsigned i = 0, e = V.size(); i != e; ++i)
935 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
936 Elts.push_back(CI->getZExtValue());
939 if (Elts.size() == V.size())
940 return ConstantDataArray::get(C->getContext(), Elts);
944 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
945 if (CFP->getType()->isFloatTy()) {
946 SmallVector<uint32_t, 16> Elts;
947 for (unsigned i = 0, e = V.size(); i != e; ++i)
948 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
950 CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
953 if (Elts.size() == V.size())
954 return ConstantDataArray::getFP(C->getContext(), Elts);
955 } else if (CFP->getType()->isDoubleTy()) {
956 SmallVector<uint64_t, 16> Elts;
957 for (unsigned i = 0, e = V.size(); i != e; ++i)
958 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
960 CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
963 if (Elts.size() == V.size())
964 return ConstantDataArray::getFP(C->getContext(), Elts);
969 // Otherwise, we really do want to create a ConstantArray.
973 /// getTypeForElements - Return an anonymous struct type to use for a constant
974 /// with the specified set of elements. The list must not be empty.
975 StructType *ConstantStruct::getTypeForElements(LLVMContext &Context,
976 ArrayRef<Constant*> V,
978 unsigned VecSize = V.size();
979 SmallVector<Type*, 16> EltTypes(VecSize);
980 for (unsigned i = 0; i != VecSize; ++i)
981 EltTypes[i] = V[i]->getType();
983 return StructType::get(Context, EltTypes, Packed);
987 StructType *ConstantStruct::getTypeForElements(ArrayRef<Constant*> V,
990 "ConstantStruct::getTypeForElements cannot be called on empty list");
991 return getTypeForElements(V[0]->getContext(), V, Packed);
995 ConstantStruct::ConstantStruct(StructType *T, ArrayRef<Constant *> V)
996 : Constant(T, ConstantStructVal,
997 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
999 assert(V.size() == T->getNumElements() &&
1000 "Invalid initializer vector for constant structure");
1001 for (unsigned i = 0, e = V.size(); i != e; ++i)
1002 assert((T->isOpaque() || V[i]->getType() == T->getElementType(i)) &&
1003 "Initializer for struct element doesn't match struct element type!");
1004 std::copy(V.begin(), V.end(), op_begin());
1007 // ConstantStruct accessors.
1008 Constant *ConstantStruct::get(StructType *ST, ArrayRef<Constant*> V) {
1009 assert((ST->isOpaque() || ST->getNumElements() == V.size()) &&
1010 "Incorrect # elements specified to ConstantStruct::get");
1012 // Create a ConstantAggregateZero value if all elements are zeros.
1014 bool isUndef = false;
1017 isUndef = isa<UndefValue>(V[0]);
1018 isZero = V[0]->isNullValue();
1019 if (isUndef || isZero) {
1020 for (unsigned i = 0, e = V.size(); i != e; ++i) {
1021 if (!V[i]->isNullValue())
1023 if (!isa<UndefValue>(V[i]))
1029 return ConstantAggregateZero::get(ST);
1031 return UndefValue::get(ST);
1033 return ST->getContext().pImpl->StructConstants.getOrCreate(ST, V);
1036 Constant *ConstantStruct::get(StructType *T, ...) {
1038 SmallVector<Constant*, 8> Values;
1040 while (Constant *Val = va_arg(ap, llvm::Constant*))
1041 Values.push_back(Val);
1043 return get(T, Values);
1046 ConstantVector::ConstantVector(VectorType *T, ArrayRef<Constant *> V)
1047 : Constant(T, ConstantVectorVal,
1048 OperandTraits<ConstantVector>::op_end(this) - V.size(),
1050 for (size_t i = 0, e = V.size(); i != e; i++)
1051 assert(V[i]->getType() == T->getElementType() &&
1052 "Initializer for vector element doesn't match vector element type!");
1053 std::copy(V.begin(), V.end(), op_begin());
1056 // ConstantVector accessors.
1057 Constant *ConstantVector::get(ArrayRef<Constant*> V) {
1058 if (Constant *C = getImpl(V))
1060 VectorType *Ty = VectorType::get(V.front()->getType(), V.size());
1061 return Ty->getContext().pImpl->VectorConstants.getOrCreate(Ty, V);
1063 Constant *ConstantVector::getImpl(ArrayRef<Constant*> V) {
1064 assert(!V.empty() && "Vectors can't be empty");
1065 VectorType *T = VectorType::get(V.front()->getType(), V.size());
1067 // If this is an all-undef or all-zero vector, return a
1068 // ConstantAggregateZero or UndefValue.
1070 bool isZero = C->isNullValue();
1071 bool isUndef = isa<UndefValue>(C);
1073 if (isZero || isUndef) {
1074 for (unsigned i = 1, e = V.size(); i != e; ++i)
1076 isZero = isUndef = false;
1082 return ConstantAggregateZero::get(T);
1084 return UndefValue::get(T);
1086 // Check to see if all of the elements are ConstantFP or ConstantInt and if
1087 // the element type is compatible with ConstantDataVector. If so, use it.
1088 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) {
1089 // We speculatively build the elements here even if it turns out that there
1090 // is a constantexpr or something else weird in the array, since it is so
1091 // uncommon for that to happen.
1092 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
1093 if (CI->getType()->isIntegerTy(8)) {
1094 SmallVector<uint8_t, 16> Elts;
1095 for (unsigned i = 0, e = V.size(); i != e; ++i)
1096 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1097 Elts.push_back(CI->getZExtValue());
1100 if (Elts.size() == V.size())
1101 return ConstantDataVector::get(C->getContext(), Elts);
1102 } else if (CI->getType()->isIntegerTy(16)) {
1103 SmallVector<uint16_t, 16> Elts;
1104 for (unsigned i = 0, e = V.size(); i != e; ++i)
1105 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1106 Elts.push_back(CI->getZExtValue());
1109 if (Elts.size() == V.size())
1110 return ConstantDataVector::get(C->getContext(), Elts);
1111 } else if (CI->getType()->isIntegerTy(32)) {
1112 SmallVector<uint32_t, 16> Elts;
1113 for (unsigned i = 0, e = V.size(); i != e; ++i)
1114 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1115 Elts.push_back(CI->getZExtValue());
1118 if (Elts.size() == V.size())
1119 return ConstantDataVector::get(C->getContext(), Elts);
1120 } else if (CI->getType()->isIntegerTy(64)) {
1121 SmallVector<uint64_t, 16> Elts;
1122 for (unsigned i = 0, e = V.size(); i != e; ++i)
1123 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1124 Elts.push_back(CI->getZExtValue());
1127 if (Elts.size() == V.size())
1128 return ConstantDataVector::get(C->getContext(), Elts);
1132 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
1133 if (CFP->getType()->isFloatTy()) {
1134 SmallVector<uint32_t, 16> Elts;
1135 for (unsigned i = 0, e = V.size(); i != e; ++i)
1136 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
1138 CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
1141 if (Elts.size() == V.size())
1142 return ConstantDataVector::getFP(C->getContext(), Elts);
1143 } else if (CFP->getType()->isDoubleTy()) {
1144 SmallVector<uint64_t, 16> Elts;
1145 for (unsigned i = 0, e = V.size(); i != e; ++i)
1146 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
1148 CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
1151 if (Elts.size() == V.size())
1152 return ConstantDataVector::getFP(C->getContext(), Elts);
1157 // Otherwise, the element type isn't compatible with ConstantDataVector, or
1158 // the operand list constants a ConstantExpr or something else strange.
1162 Constant *ConstantVector::getSplat(unsigned NumElts, Constant *V) {
1163 // If this splat is compatible with ConstantDataVector, use it instead of
1165 if ((isa<ConstantFP>(V) || isa<ConstantInt>(V)) &&
1166 ConstantDataSequential::isElementTypeCompatible(V->getType()))
1167 return ConstantDataVector::getSplat(NumElts, V);
1169 SmallVector<Constant*, 32> Elts(NumElts, V);
1174 // Utility function for determining if a ConstantExpr is a CastOp or not. This
1175 // can't be inline because we don't want to #include Instruction.h into
1177 bool ConstantExpr::isCast() const {
1178 return Instruction::isCast(getOpcode());
1181 bool ConstantExpr::isCompare() const {
1182 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
1185 bool ConstantExpr::isGEPWithNoNotionalOverIndexing() const {
1186 if (getOpcode() != Instruction::GetElementPtr) return false;
1188 gep_type_iterator GEPI = gep_type_begin(this), E = gep_type_end(this);
1189 User::const_op_iterator OI = std::next(this->op_begin());
1191 // Skip the first index, as it has no static limit.
1195 // The remaining indices must be compile-time known integers within the
1196 // bounds of the corresponding notional static array types.
1197 for (; GEPI != E; ++GEPI, ++OI) {
1198 ConstantInt *CI = dyn_cast<ConstantInt>(*OI);
1199 if (!CI) return false;
1200 if (ArrayType *ATy = dyn_cast<ArrayType>(*GEPI))
1201 if (CI->getValue().getActiveBits() > 64 ||
1202 CI->getZExtValue() >= ATy->getNumElements())
1206 // All the indices checked out.
1210 bool ConstantExpr::hasIndices() const {
1211 return getOpcode() == Instruction::ExtractValue ||
1212 getOpcode() == Instruction::InsertValue;
1215 ArrayRef<unsigned> ConstantExpr::getIndices() const {
1216 if (const ExtractValueConstantExpr *EVCE =
1217 dyn_cast<ExtractValueConstantExpr>(this))
1218 return EVCE->Indices;
1220 return cast<InsertValueConstantExpr>(this)->Indices;
1223 unsigned ConstantExpr::getPredicate() const {
1224 assert(isCompare());
1225 return ((const CompareConstantExpr*)this)->predicate;
1228 /// getWithOperandReplaced - Return a constant expression identical to this
1229 /// one, but with the specified operand set to the specified value.
1231 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
1232 assert(Op->getType() == getOperand(OpNo)->getType() &&
1233 "Replacing operand with value of different type!");
1234 if (getOperand(OpNo) == Op)
1235 return const_cast<ConstantExpr*>(this);
1237 SmallVector<Constant*, 8> NewOps;
1238 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1239 NewOps.push_back(i == OpNo ? Op : getOperand(i));
1241 return getWithOperands(NewOps);
1244 /// getWithOperands - This returns the current constant expression with the
1245 /// operands replaced with the specified values. The specified array must
1246 /// have the same number of operands as our current one.
1247 Constant *ConstantExpr::getWithOperands(ArrayRef<Constant *> Ops, Type *Ty,
1248 bool OnlyIfReduced, Type *SrcTy) const {
1249 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
1251 // If no operands changed return self.
1252 if (Ty == getType() && std::equal(Ops.begin(), Ops.end(), op_begin()))
1253 return const_cast<ConstantExpr*>(this);
1255 Type *OnlyIfReducedTy = OnlyIfReduced ? Ty : nullptr;
1256 switch (getOpcode()) {
1257 case Instruction::Trunc:
1258 case Instruction::ZExt:
1259 case Instruction::SExt:
1260 case Instruction::FPTrunc:
1261 case Instruction::FPExt:
1262 case Instruction::UIToFP:
1263 case Instruction::SIToFP:
1264 case Instruction::FPToUI:
1265 case Instruction::FPToSI:
1266 case Instruction::PtrToInt:
1267 case Instruction::IntToPtr:
1268 case Instruction::BitCast:
1269 case Instruction::AddrSpaceCast:
1270 return ConstantExpr::getCast(getOpcode(), Ops[0], Ty, OnlyIfReduced);
1271 case Instruction::Select:
1272 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2], OnlyIfReducedTy);
1273 case Instruction::InsertElement:
1274 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2],
1276 case Instruction::ExtractElement:
1277 return ConstantExpr::getExtractElement(Ops[0], Ops[1], OnlyIfReducedTy);
1278 case Instruction::InsertValue:
1279 return ConstantExpr::getInsertValue(Ops[0], Ops[1], getIndices(),
1281 case Instruction::ExtractValue:
1282 return ConstantExpr::getExtractValue(Ops[0], getIndices(), OnlyIfReducedTy);
1283 case Instruction::ShuffleVector:
1284 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2],
1286 case Instruction::GetElementPtr: {
1287 auto *GEPO = cast<GEPOperator>(this);
1288 assert(SrcTy || (Ops[0]->getType() == getOperand(0)->getType()));
1289 return ConstantExpr::getGetElementPtr(
1290 SrcTy ? SrcTy : GEPO->getSourceElementType(), Ops[0], Ops.slice(1),
1291 GEPO->isInBounds(), OnlyIfReducedTy);
1293 case Instruction::ICmp:
1294 case Instruction::FCmp:
1295 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1],
1298 assert(getNumOperands() == 2 && "Must be binary operator?");
1299 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1], SubclassOptionalData,
1305 //===----------------------------------------------------------------------===//
1306 // isValueValidForType implementations
1308 bool ConstantInt::isValueValidForType(Type *Ty, uint64_t Val) {
1309 unsigned NumBits = Ty->getIntegerBitWidth(); // assert okay
1310 if (Ty->isIntegerTy(1))
1311 return Val == 0 || Val == 1;
1313 return true; // always true, has to fit in largest type
1314 uint64_t Max = (1ll << NumBits) - 1;
1318 bool ConstantInt::isValueValidForType(Type *Ty, int64_t Val) {
1319 unsigned NumBits = Ty->getIntegerBitWidth();
1320 if (Ty->isIntegerTy(1))
1321 return Val == 0 || Val == 1 || Val == -1;
1323 return true; // always true, has to fit in largest type
1324 int64_t Min = -(1ll << (NumBits-1));
1325 int64_t Max = (1ll << (NumBits-1)) - 1;
1326 return (Val >= Min && Val <= Max);
1329 bool ConstantFP::isValueValidForType(Type *Ty, const APFloat& Val) {
1330 // convert modifies in place, so make a copy.
1331 APFloat Val2 = APFloat(Val);
1333 switch (Ty->getTypeID()) {
1335 return false; // These can't be represented as floating point!
1337 // FIXME rounding mode needs to be more flexible
1338 case Type::HalfTyID: {
1339 if (&Val2.getSemantics() == &APFloat::IEEEhalf)
1341 Val2.convert(APFloat::IEEEhalf, APFloat::rmNearestTiesToEven, &losesInfo);
1344 case Type::FloatTyID: {
1345 if (&Val2.getSemantics() == &APFloat::IEEEsingle)
1347 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
1350 case Type::DoubleTyID: {
1351 if (&Val2.getSemantics() == &APFloat::IEEEhalf ||
1352 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1353 &Val2.getSemantics() == &APFloat::IEEEdouble)
1355 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
1358 case Type::X86_FP80TyID:
1359 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1360 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1361 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1362 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
1363 case Type::FP128TyID:
1364 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1365 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1366 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1367 &Val2.getSemantics() == &APFloat::IEEEquad;
1368 case Type::PPC_FP128TyID:
1369 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1370 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1371 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1372 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
1377 //===----------------------------------------------------------------------===//
1378 // Factory Function Implementation
1380 ConstantAggregateZero *ConstantAggregateZero::get(Type *Ty) {
1381 assert((Ty->isStructTy() || Ty->isArrayTy() || Ty->isVectorTy()) &&
1382 "Cannot create an aggregate zero of non-aggregate type!");
1384 ConstantAggregateZero *&Entry = Ty->getContext().pImpl->CAZConstants[Ty];
1386 Entry = new ConstantAggregateZero(Ty);
1391 /// destroyConstant - Remove the constant from the constant table.
1393 void ConstantAggregateZero::destroyConstantImpl() {
1394 getContext().pImpl->CAZConstants.erase(getType());
1397 /// destroyConstant - Remove the constant from the constant table...
1399 void ConstantArray::destroyConstantImpl() {
1400 getType()->getContext().pImpl->ArrayConstants.remove(this);
1404 //---- ConstantStruct::get() implementation...
1407 // destroyConstant - Remove the constant from the constant table...
1409 void ConstantStruct::destroyConstantImpl() {
1410 getType()->getContext().pImpl->StructConstants.remove(this);
1413 // destroyConstant - Remove the constant from the constant table...
1415 void ConstantVector::destroyConstantImpl() {
1416 getType()->getContext().pImpl->VectorConstants.remove(this);
1419 /// getSplatValue - If this is a splat vector constant, meaning that all of
1420 /// the elements have the same value, return that value. Otherwise return 0.
1421 Constant *Constant::getSplatValue() const {
1422 assert(this->getType()->isVectorTy() && "Only valid for vectors!");
1423 if (isa<ConstantAggregateZero>(this))
1424 return getNullValue(this->getType()->getVectorElementType());
1425 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
1426 return CV->getSplatValue();
1427 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
1428 return CV->getSplatValue();
1432 /// getSplatValue - If this is a splat constant, where all of the
1433 /// elements have the same value, return that value. Otherwise return null.
1434 Constant *ConstantVector::getSplatValue() const {
1435 // Check out first element.
1436 Constant *Elt = getOperand(0);
1437 // Then make sure all remaining elements point to the same value.
1438 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1439 if (getOperand(I) != Elt)
1444 /// If C is a constant integer then return its value, otherwise C must be a
1445 /// vector of constant integers, all equal, and the common value is returned.
1446 const APInt &Constant::getUniqueInteger() const {
1447 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
1448 return CI->getValue();
1449 assert(this->getSplatValue() && "Doesn't contain a unique integer!");
1450 const Constant *C = this->getAggregateElement(0U);
1451 assert(C && isa<ConstantInt>(C) && "Not a vector of numbers!");
1452 return cast<ConstantInt>(C)->getValue();
1455 //---- ConstantPointerNull::get() implementation.
1458 ConstantPointerNull *ConstantPointerNull::get(PointerType *Ty) {
1459 ConstantPointerNull *&Entry = Ty->getContext().pImpl->CPNConstants[Ty];
1461 Entry = new ConstantPointerNull(Ty);
1466 // destroyConstant - Remove the constant from the constant table...
1468 void ConstantPointerNull::destroyConstantImpl() {
1469 getContext().pImpl->CPNConstants.erase(getType());
1473 //---- UndefValue::get() implementation.
1476 UndefValue *UndefValue::get(Type *Ty) {
1477 UndefValue *&Entry = Ty->getContext().pImpl->UVConstants[Ty];
1479 Entry = new UndefValue(Ty);
1484 // destroyConstant - Remove the constant from the constant table.
1486 void UndefValue::destroyConstantImpl() {
1487 // Free the constant and any dangling references to it.
1488 getContext().pImpl->UVConstants.erase(getType());
1491 //---- BlockAddress::get() implementation.
1494 BlockAddress *BlockAddress::get(BasicBlock *BB) {
1495 assert(BB->getParent() && "Block must have a parent");
1496 return get(BB->getParent(), BB);
1499 BlockAddress *BlockAddress::get(Function *F, BasicBlock *BB) {
1501 F->getContext().pImpl->BlockAddresses[std::make_pair(F, BB)];
1503 BA = new BlockAddress(F, BB);
1505 assert(BA->getFunction() == F && "Basic block moved between functions");
1509 BlockAddress::BlockAddress(Function *F, BasicBlock *BB)
1510 : Constant(Type::getInt8PtrTy(F->getContext()), Value::BlockAddressVal,
1514 BB->AdjustBlockAddressRefCount(1);
1517 BlockAddress *BlockAddress::lookup(const BasicBlock *BB) {
1518 if (!BB->hasAddressTaken())
1521 const Function *F = BB->getParent();
1522 assert(F && "Block must have a parent");
1524 F->getContext().pImpl->BlockAddresses.lookup(std::make_pair(F, BB));
1525 assert(BA && "Refcount and block address map disagree!");
1529 // destroyConstant - Remove the constant from the constant table.
1531 void BlockAddress::destroyConstantImpl() {
1532 getFunction()->getType()->getContext().pImpl
1533 ->BlockAddresses.erase(std::make_pair(getFunction(), getBasicBlock()));
1534 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1537 Value *BlockAddress::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
1538 // This could be replacing either the Basic Block or the Function. In either
1539 // case, we have to remove the map entry.
1540 Function *NewF = getFunction();
1541 BasicBlock *NewBB = getBasicBlock();
1544 NewF = cast<Function>(To->stripPointerCasts());
1546 NewBB = cast<BasicBlock>(To);
1548 // See if the 'new' entry already exists, if not, just update this in place
1549 // and return early.
1550 BlockAddress *&NewBA =
1551 getContext().pImpl->BlockAddresses[std::make_pair(NewF, NewBB)];
1555 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1557 // Remove the old entry, this can't cause the map to rehash (just a
1558 // tombstone will get added).
1559 getContext().pImpl->BlockAddresses.erase(std::make_pair(getFunction(),
1562 setOperand(0, NewF);
1563 setOperand(1, NewBB);
1564 getBasicBlock()->AdjustBlockAddressRefCount(1);
1566 // If we just want to keep the existing value, then return null.
1567 // Callers know that this means we shouldn't delete this value.
1571 //---- ConstantExpr::get() implementations.
1574 /// This is a utility function to handle folding of casts and lookup of the
1575 /// cast in the ExprConstants map. It is used by the various get* methods below.
1576 static Constant *getFoldedCast(Instruction::CastOps opc, Constant *C, Type *Ty,
1577 bool OnlyIfReduced = false) {
1578 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1579 // Fold a few common cases
1580 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1586 LLVMContextImpl *pImpl = Ty->getContext().pImpl;
1588 // Look up the constant in the table first to ensure uniqueness.
1589 ConstantExprKeyType Key(opc, C);
1591 return pImpl->ExprConstants.getOrCreate(Ty, Key);
1594 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, Type *Ty,
1595 bool OnlyIfReduced) {
1596 Instruction::CastOps opc = Instruction::CastOps(oc);
1597 assert(Instruction::isCast(opc) && "opcode out of range");
1598 assert(C && Ty && "Null arguments to getCast");
1599 assert(CastInst::castIsValid(opc, C, Ty) && "Invalid constantexpr cast!");
1603 llvm_unreachable("Invalid cast opcode");
1604 case Instruction::Trunc:
1605 return getTrunc(C, Ty, OnlyIfReduced);
1606 case Instruction::ZExt:
1607 return getZExt(C, Ty, OnlyIfReduced);
1608 case Instruction::SExt:
1609 return getSExt(C, Ty, OnlyIfReduced);
1610 case Instruction::FPTrunc:
1611 return getFPTrunc(C, Ty, OnlyIfReduced);
1612 case Instruction::FPExt:
1613 return getFPExtend(C, Ty, OnlyIfReduced);
1614 case Instruction::UIToFP:
1615 return getUIToFP(C, Ty, OnlyIfReduced);
1616 case Instruction::SIToFP:
1617 return getSIToFP(C, Ty, OnlyIfReduced);
1618 case Instruction::FPToUI:
1619 return getFPToUI(C, Ty, OnlyIfReduced);
1620 case Instruction::FPToSI:
1621 return getFPToSI(C, Ty, OnlyIfReduced);
1622 case Instruction::PtrToInt:
1623 return getPtrToInt(C, Ty, OnlyIfReduced);
1624 case Instruction::IntToPtr:
1625 return getIntToPtr(C, Ty, OnlyIfReduced);
1626 case Instruction::BitCast:
1627 return getBitCast(C, Ty, OnlyIfReduced);
1628 case Instruction::AddrSpaceCast:
1629 return getAddrSpaceCast(C, Ty, OnlyIfReduced);
1633 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, Type *Ty) {
1634 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1635 return getBitCast(C, Ty);
1636 return getZExt(C, Ty);
1639 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, Type *Ty) {
1640 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1641 return getBitCast(C, Ty);
1642 return getSExt(C, Ty);
1645 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, Type *Ty) {
1646 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1647 return getBitCast(C, Ty);
1648 return getTrunc(C, Ty);
1651 Constant *ConstantExpr::getPointerCast(Constant *S, Type *Ty) {
1652 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
1653 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
1656 if (Ty->isIntOrIntVectorTy())
1657 return getPtrToInt(S, Ty);
1659 unsigned SrcAS = S->getType()->getPointerAddressSpace();
1660 if (Ty->isPtrOrPtrVectorTy() && SrcAS != Ty->getPointerAddressSpace())
1661 return getAddrSpaceCast(S, Ty);
1663 return getBitCast(S, Ty);
1666 Constant *ConstantExpr::getPointerBitCastOrAddrSpaceCast(Constant *S,
1668 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
1669 assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast");
1671 if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
1672 return getAddrSpaceCast(S, Ty);
1674 return getBitCast(S, Ty);
1677 Constant *ConstantExpr::getIntegerCast(Constant *C, Type *Ty,
1679 assert(C->getType()->isIntOrIntVectorTy() &&
1680 Ty->isIntOrIntVectorTy() && "Invalid cast");
1681 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1682 unsigned DstBits = Ty->getScalarSizeInBits();
1683 Instruction::CastOps opcode =
1684 (SrcBits == DstBits ? Instruction::BitCast :
1685 (SrcBits > DstBits ? Instruction::Trunc :
1686 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1687 return getCast(opcode, C, Ty);
1690 Constant *ConstantExpr::getFPCast(Constant *C, Type *Ty) {
1691 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1693 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1694 unsigned DstBits = Ty->getScalarSizeInBits();
1695 if (SrcBits == DstBits)
1696 return C; // Avoid a useless cast
1697 Instruction::CastOps opcode =
1698 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1699 return getCast(opcode, C, Ty);
1702 Constant *ConstantExpr::getTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) {
1704 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1705 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1707 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1708 assert(C->getType()->isIntOrIntVectorTy() && "Trunc operand must be integer");
1709 assert(Ty->isIntOrIntVectorTy() && "Trunc produces only integral");
1710 assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1711 "SrcTy must be larger than DestTy for Trunc!");
1713 return getFoldedCast(Instruction::Trunc, C, Ty, OnlyIfReduced);
1716 Constant *ConstantExpr::getSExt(Constant *C, Type *Ty, bool OnlyIfReduced) {
1718 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1719 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1721 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1722 assert(C->getType()->isIntOrIntVectorTy() && "SExt operand must be integral");
1723 assert(Ty->isIntOrIntVectorTy() && "SExt produces only integer");
1724 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1725 "SrcTy must be smaller than DestTy for SExt!");
1727 return getFoldedCast(Instruction::SExt, C, Ty, OnlyIfReduced);
1730 Constant *ConstantExpr::getZExt(Constant *C, Type *Ty, bool OnlyIfReduced) {
1732 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1733 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1735 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1736 assert(C->getType()->isIntOrIntVectorTy() && "ZEXt operand must be integral");
1737 assert(Ty->isIntOrIntVectorTy() && "ZExt produces only integer");
1738 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1739 "SrcTy must be smaller than DestTy for ZExt!");
1741 return getFoldedCast(Instruction::ZExt, C, Ty, OnlyIfReduced);
1744 Constant *ConstantExpr::getFPTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) {
1746 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1747 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1749 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1750 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1751 C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1752 "This is an illegal floating point truncation!");
1753 return getFoldedCast(Instruction::FPTrunc, C, Ty, OnlyIfReduced);
1756 Constant *ConstantExpr::getFPExtend(Constant *C, Type *Ty, bool OnlyIfReduced) {
1758 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1759 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1761 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1762 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1763 C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1764 "This is an illegal floating point extension!");
1765 return getFoldedCast(Instruction::FPExt, C, Ty, OnlyIfReduced);
1768 Constant *ConstantExpr::getUIToFP(Constant *C, Type *Ty, bool OnlyIfReduced) {
1770 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1771 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1773 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1774 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
1775 "This is an illegal uint to floating point cast!");
1776 return getFoldedCast(Instruction::UIToFP, C, Ty, OnlyIfReduced);
1779 Constant *ConstantExpr::getSIToFP(Constant *C, Type *Ty, bool OnlyIfReduced) {
1781 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1782 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1784 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1785 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
1786 "This is an illegal sint to floating point cast!");
1787 return getFoldedCast(Instruction::SIToFP, C, Ty, OnlyIfReduced);
1790 Constant *ConstantExpr::getFPToUI(Constant *C, Type *Ty, bool OnlyIfReduced) {
1792 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1793 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1795 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1796 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1797 "This is an illegal floating point to uint cast!");
1798 return getFoldedCast(Instruction::FPToUI, C, Ty, OnlyIfReduced);
1801 Constant *ConstantExpr::getFPToSI(Constant *C, Type *Ty, bool OnlyIfReduced) {
1803 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1804 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1806 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1807 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1808 "This is an illegal floating point to sint cast!");
1809 return getFoldedCast(Instruction::FPToSI, C, Ty, OnlyIfReduced);
1812 Constant *ConstantExpr::getPtrToInt(Constant *C, Type *DstTy,
1813 bool OnlyIfReduced) {
1814 assert(C->getType()->getScalarType()->isPointerTy() &&
1815 "PtrToInt source must be pointer or pointer vector");
1816 assert(DstTy->getScalarType()->isIntegerTy() &&
1817 "PtrToInt destination must be integer or integer vector");
1818 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy));
1819 if (isa<VectorType>(C->getType()))
1820 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&&
1821 "Invalid cast between a different number of vector elements");
1822 return getFoldedCast(Instruction::PtrToInt, C, DstTy, OnlyIfReduced);
1825 Constant *ConstantExpr::getIntToPtr(Constant *C, Type *DstTy,
1826 bool OnlyIfReduced) {
1827 assert(C->getType()->getScalarType()->isIntegerTy() &&
1828 "IntToPtr source must be integer or integer vector");
1829 assert(DstTy->getScalarType()->isPointerTy() &&
1830 "IntToPtr destination must be a pointer or pointer vector");
1831 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy));
1832 if (isa<VectorType>(C->getType()))
1833 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&&
1834 "Invalid cast between a different number of vector elements");
1835 return getFoldedCast(Instruction::IntToPtr, C, DstTy, OnlyIfReduced);
1838 Constant *ConstantExpr::getBitCast(Constant *C, Type *DstTy,
1839 bool OnlyIfReduced) {
1840 assert(CastInst::castIsValid(Instruction::BitCast, C, DstTy) &&
1841 "Invalid constantexpr bitcast!");
1843 // It is common to ask for a bitcast of a value to its own type, handle this
1845 if (C->getType() == DstTy) return C;
1847 return getFoldedCast(Instruction::BitCast, C, DstTy, OnlyIfReduced);
1850 Constant *ConstantExpr::getAddrSpaceCast(Constant *C, Type *DstTy,
1851 bool OnlyIfReduced) {
1852 assert(CastInst::castIsValid(Instruction::AddrSpaceCast, C, DstTy) &&
1853 "Invalid constantexpr addrspacecast!");
1855 // Canonicalize addrspacecasts between different pointer types by first
1856 // bitcasting the pointer type and then converting the address space.
1857 PointerType *SrcScalarTy = cast<PointerType>(C->getType()->getScalarType());
1858 PointerType *DstScalarTy = cast<PointerType>(DstTy->getScalarType());
1859 Type *DstElemTy = DstScalarTy->getElementType();
1860 if (SrcScalarTy->getElementType() != DstElemTy) {
1861 Type *MidTy = PointerType::get(DstElemTy, SrcScalarTy->getAddressSpace());
1862 if (VectorType *VT = dyn_cast<VectorType>(DstTy)) {
1863 // Handle vectors of pointers.
1864 MidTy = VectorType::get(MidTy, VT->getNumElements());
1866 C = getBitCast(C, MidTy);
1868 return getFoldedCast(Instruction::AddrSpaceCast, C, DstTy, OnlyIfReduced);
1871 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2,
1872 unsigned Flags, Type *OnlyIfReducedTy) {
1873 // Check the operands for consistency first.
1874 assert(Opcode >= Instruction::BinaryOpsBegin &&
1875 Opcode < Instruction::BinaryOpsEnd &&
1876 "Invalid opcode in binary constant expression");
1877 assert(C1->getType() == C2->getType() &&
1878 "Operand types in binary constant expression should match");
1882 case Instruction::Add:
1883 case Instruction::Sub:
1884 case Instruction::Mul:
1885 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1886 assert(C1->getType()->isIntOrIntVectorTy() &&
1887 "Tried to create an integer operation on a non-integer type!");
1889 case Instruction::FAdd:
1890 case Instruction::FSub:
1891 case Instruction::FMul:
1892 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1893 assert(C1->getType()->isFPOrFPVectorTy() &&
1894 "Tried to create a floating-point operation on a "
1895 "non-floating-point type!");
1897 case Instruction::UDiv:
1898 case Instruction::SDiv:
1899 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1900 assert(C1->getType()->isIntOrIntVectorTy() &&
1901 "Tried to create an arithmetic operation on a non-arithmetic type!");
1903 case Instruction::FDiv:
1904 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1905 assert(C1->getType()->isFPOrFPVectorTy() &&
1906 "Tried to create an arithmetic operation on a non-arithmetic type!");
1908 case Instruction::URem:
1909 case Instruction::SRem:
1910 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1911 assert(C1->getType()->isIntOrIntVectorTy() &&
1912 "Tried to create an arithmetic operation on a non-arithmetic type!");
1914 case Instruction::FRem:
1915 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1916 assert(C1->getType()->isFPOrFPVectorTy() &&
1917 "Tried to create an arithmetic operation on a non-arithmetic type!");
1919 case Instruction::And:
1920 case Instruction::Or:
1921 case Instruction::Xor:
1922 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1923 assert(C1->getType()->isIntOrIntVectorTy() &&
1924 "Tried to create a logical operation on a non-integral type!");
1926 case Instruction::Shl:
1927 case Instruction::LShr:
1928 case Instruction::AShr:
1929 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1930 assert(C1->getType()->isIntOrIntVectorTy() &&
1931 "Tried to create a shift operation on a non-integer type!");
1938 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1939 return FC; // Fold a few common cases.
1941 if (OnlyIfReducedTy == C1->getType())
1944 Constant *ArgVec[] = { C1, C2 };
1945 ConstantExprKeyType Key(Opcode, ArgVec, 0, Flags);
1947 LLVMContextImpl *pImpl = C1->getContext().pImpl;
1948 return pImpl->ExprConstants.getOrCreate(C1->getType(), Key);
1951 Constant *ConstantExpr::getSizeOf(Type* Ty) {
1952 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1953 // Note that a non-inbounds gep is used, as null isn't within any object.
1954 Constant *GEPIdx = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1955 Constant *GEP = getGetElementPtr(
1956 Ty, Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1957 return getPtrToInt(GEP,
1958 Type::getInt64Ty(Ty->getContext()));
1961 Constant *ConstantExpr::getAlignOf(Type* Ty) {
1962 // alignof is implemented as: (i64) gep ({i1,Ty}*)null, 0, 1
1963 // Note that a non-inbounds gep is used, as null isn't within any object.
1965 StructType::get(Type::getInt1Ty(Ty->getContext()), Ty, nullptr);
1966 Constant *NullPtr = Constant::getNullValue(AligningTy->getPointerTo(0));
1967 Constant *Zero = ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0);
1968 Constant *One = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1969 Constant *Indices[2] = { Zero, One };
1970 Constant *GEP = getGetElementPtr(AligningTy, NullPtr, Indices);
1971 return getPtrToInt(GEP,
1972 Type::getInt64Ty(Ty->getContext()));
1975 Constant *ConstantExpr::getOffsetOf(StructType* STy, unsigned FieldNo) {
1976 return getOffsetOf(STy, ConstantInt::get(Type::getInt32Ty(STy->getContext()),
1980 Constant *ConstantExpr::getOffsetOf(Type* Ty, Constant *FieldNo) {
1981 // offsetof is implemented as: (i64) gep (Ty*)null, 0, FieldNo
1982 // Note that a non-inbounds gep is used, as null isn't within any object.
1983 Constant *GEPIdx[] = {
1984 ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0),
1987 Constant *GEP = getGetElementPtr(
1988 Ty, Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1989 return getPtrToInt(GEP,
1990 Type::getInt64Ty(Ty->getContext()));
1993 Constant *ConstantExpr::getCompare(unsigned short Predicate, Constant *C1,
1994 Constant *C2, bool OnlyIfReduced) {
1995 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1997 switch (Predicate) {
1998 default: llvm_unreachable("Invalid CmpInst predicate");
1999 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
2000 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
2001 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
2002 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
2003 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
2004 case CmpInst::FCMP_TRUE:
2005 return getFCmp(Predicate, C1, C2, OnlyIfReduced);
2007 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
2008 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
2009 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
2010 case CmpInst::ICMP_SLE:
2011 return getICmp(Predicate, C1, C2, OnlyIfReduced);
2015 Constant *ConstantExpr::getSelect(Constant *C, Constant *V1, Constant *V2,
2016 Type *OnlyIfReducedTy) {
2017 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
2019 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
2020 return SC; // Fold common cases
2022 if (OnlyIfReducedTy == V1->getType())
2025 Constant *ArgVec[] = { C, V1, V2 };
2026 ConstantExprKeyType Key(Instruction::Select, ArgVec);
2028 LLVMContextImpl *pImpl = C->getContext().pImpl;
2029 return pImpl->ExprConstants.getOrCreate(V1->getType(), Key);
2032 Constant *ConstantExpr::getGetElementPtr(Type *Ty, Constant *C,
2033 ArrayRef<Value *> Idxs, bool InBounds,
2034 Type *OnlyIfReducedTy) {
2036 Ty = cast<PointerType>(C->getType()->getScalarType())->getElementType();
2040 cast<PointerType>(C->getType()->getScalarType())->getContainedType(0u));
2042 if (Constant *FC = ConstantFoldGetElementPtr(Ty, C, InBounds, Idxs))
2043 return FC; // Fold a few common cases.
2045 // Get the result type of the getelementptr!
2046 Type *DestTy = GetElementPtrInst::getIndexedType(Ty, Idxs);
2047 assert(DestTy && "GEP indices invalid!");
2048 unsigned AS = C->getType()->getPointerAddressSpace();
2049 Type *ReqTy = DestTy->getPointerTo(AS);
2050 if (VectorType *VecTy = dyn_cast<VectorType>(C->getType()))
2051 ReqTy = VectorType::get(ReqTy, VecTy->getNumElements());
2053 if (OnlyIfReducedTy == ReqTy)
2056 // Look up the constant in the table first to ensure uniqueness
2057 std::vector<Constant*> ArgVec;
2058 ArgVec.reserve(1 + Idxs.size());
2059 ArgVec.push_back(C);
2060 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2061 assert(Idxs[i]->getType()->isVectorTy() == ReqTy->isVectorTy() &&
2062 "getelementptr index type missmatch");
2063 assert((!Idxs[i]->getType()->isVectorTy() ||
2064 ReqTy->getVectorNumElements() ==
2065 Idxs[i]->getType()->getVectorNumElements()) &&
2066 "getelementptr index type missmatch");
2067 ArgVec.push_back(cast<Constant>(Idxs[i]));
2069 const ConstantExprKeyType Key(Instruction::GetElementPtr, ArgVec, 0,
2070 InBounds ? GEPOperator::IsInBounds : 0, None,
2073 LLVMContextImpl *pImpl = C->getContext().pImpl;
2074 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2077 Constant *ConstantExpr::getICmp(unsigned short pred, Constant *LHS,
2078 Constant *RHS, bool OnlyIfReduced) {
2079 assert(LHS->getType() == RHS->getType());
2080 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2081 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2083 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2084 return FC; // Fold a few common cases...
2089 // Look up the constant in the table first to ensure uniqueness
2090 Constant *ArgVec[] = { LHS, RHS };
2091 // Get the key type with both the opcode and predicate
2092 const ConstantExprKeyType Key(Instruction::ICmp, ArgVec, pred);
2094 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
2095 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
2096 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
2098 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
2099 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
2102 Constant *ConstantExpr::getFCmp(unsigned short pred, Constant *LHS,
2103 Constant *RHS, bool OnlyIfReduced) {
2104 assert(LHS->getType() == RHS->getType());
2105 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2107 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2108 return FC; // Fold a few common cases...
2113 // Look up the constant in the table first to ensure uniqueness
2114 Constant *ArgVec[] = { LHS, RHS };
2115 // Get the key type with both the opcode and predicate
2116 const ConstantExprKeyType Key(Instruction::FCmp, ArgVec, pred);
2118 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
2119 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
2120 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
2122 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
2123 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
2126 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx,
2127 Type *OnlyIfReducedTy) {
2128 assert(Val->getType()->isVectorTy() &&
2129 "Tried to create extractelement operation on non-vector type!");
2130 assert(Idx->getType()->isIntegerTy() &&
2131 "Extractelement index must be an integer type!");
2133 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
2134 return FC; // Fold a few common cases.
2136 Type *ReqTy = Val->getType()->getVectorElementType();
2137 if (OnlyIfReducedTy == ReqTy)
2140 // Look up the constant in the table first to ensure uniqueness
2141 Constant *ArgVec[] = { Val, Idx };
2142 const ConstantExprKeyType Key(Instruction::ExtractElement, ArgVec);
2144 LLVMContextImpl *pImpl = Val->getContext().pImpl;
2145 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2148 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2149 Constant *Idx, Type *OnlyIfReducedTy) {
2150 assert(Val->getType()->isVectorTy() &&
2151 "Tried to create insertelement operation on non-vector type!");
2152 assert(Elt->getType() == Val->getType()->getVectorElementType() &&
2153 "Insertelement types must match!");
2154 assert(Idx->getType()->isIntegerTy() &&
2155 "Insertelement index must be i32 type!");
2157 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2158 return FC; // Fold a few common cases.
2160 if (OnlyIfReducedTy == Val->getType())
2163 // Look up the constant in the table first to ensure uniqueness
2164 Constant *ArgVec[] = { Val, Elt, Idx };
2165 const ConstantExprKeyType Key(Instruction::InsertElement, ArgVec);
2167 LLVMContextImpl *pImpl = Val->getContext().pImpl;
2168 return pImpl->ExprConstants.getOrCreate(Val->getType(), Key);
2171 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2172 Constant *Mask, Type *OnlyIfReducedTy) {
2173 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2174 "Invalid shuffle vector constant expr operands!");
2176 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2177 return FC; // Fold a few common cases.
2179 unsigned NElts = Mask->getType()->getVectorNumElements();
2180 Type *EltTy = V1->getType()->getVectorElementType();
2181 Type *ShufTy = VectorType::get(EltTy, NElts);
2183 if (OnlyIfReducedTy == ShufTy)
2186 // Look up the constant in the table first to ensure uniqueness
2187 Constant *ArgVec[] = { V1, V2, Mask };
2188 const ConstantExprKeyType Key(Instruction::ShuffleVector, ArgVec);
2190 LLVMContextImpl *pImpl = ShufTy->getContext().pImpl;
2191 return pImpl->ExprConstants.getOrCreate(ShufTy, Key);
2194 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2195 ArrayRef<unsigned> Idxs,
2196 Type *OnlyIfReducedTy) {
2197 assert(Agg->getType()->isFirstClassType() &&
2198 "Non-first-class type for constant insertvalue expression");
2200 assert(ExtractValueInst::getIndexedType(Agg->getType(),
2201 Idxs) == Val->getType() &&
2202 "insertvalue indices invalid!");
2203 Type *ReqTy = Val->getType();
2205 if (Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs))
2208 if (OnlyIfReducedTy == ReqTy)
2211 Constant *ArgVec[] = { Agg, Val };
2212 const ConstantExprKeyType Key(Instruction::InsertValue, ArgVec, 0, 0, Idxs);
2214 LLVMContextImpl *pImpl = Agg->getContext().pImpl;
2215 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2218 Constant *ConstantExpr::getExtractValue(Constant *Agg, ArrayRef<unsigned> Idxs,
2219 Type *OnlyIfReducedTy) {
2220 assert(Agg->getType()->isFirstClassType() &&
2221 "Tried to create extractelement operation on non-first-class type!");
2223 Type *ReqTy = ExtractValueInst::getIndexedType(Agg->getType(), Idxs);
2225 assert(ReqTy && "extractvalue indices invalid!");
2227 assert(Agg->getType()->isFirstClassType() &&
2228 "Non-first-class type for constant extractvalue expression");
2229 if (Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs))
2232 if (OnlyIfReducedTy == ReqTy)
2235 Constant *ArgVec[] = { Agg };
2236 const ConstantExprKeyType Key(Instruction::ExtractValue, ArgVec, 0, 0, Idxs);
2238 LLVMContextImpl *pImpl = Agg->getContext().pImpl;
2239 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2242 Constant *ConstantExpr::getNeg(Constant *C, bool HasNUW, bool HasNSW) {
2243 assert(C->getType()->isIntOrIntVectorTy() &&
2244 "Cannot NEG a nonintegral value!");
2245 return getSub(ConstantFP::getZeroValueForNegation(C->getType()),
2249 Constant *ConstantExpr::getFNeg(Constant *C) {
2250 assert(C->getType()->isFPOrFPVectorTy() &&
2251 "Cannot FNEG a non-floating-point value!");
2252 return getFSub(ConstantFP::getZeroValueForNegation(C->getType()), C);
2255 Constant *ConstantExpr::getNot(Constant *C) {
2256 assert(C->getType()->isIntOrIntVectorTy() &&
2257 "Cannot NOT a nonintegral value!");
2258 return get(Instruction::Xor, C, Constant::getAllOnesValue(C->getType()));
2261 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2,
2262 bool HasNUW, bool HasNSW) {
2263 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2264 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2265 return get(Instruction::Add, C1, C2, Flags);
2268 Constant *ConstantExpr::getFAdd(Constant *C1, Constant *C2) {
2269 return get(Instruction::FAdd, C1, C2);
2272 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2,
2273 bool HasNUW, bool HasNSW) {
2274 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2275 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2276 return get(Instruction::Sub, C1, C2, Flags);
2279 Constant *ConstantExpr::getFSub(Constant *C1, Constant *C2) {
2280 return get(Instruction::FSub, C1, C2);
2283 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2,
2284 bool HasNUW, bool HasNSW) {
2285 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2286 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2287 return get(Instruction::Mul, C1, C2, Flags);
2290 Constant *ConstantExpr::getFMul(Constant *C1, Constant *C2) {
2291 return get(Instruction::FMul, C1, C2);
2294 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2, bool isExact) {
2295 return get(Instruction::UDiv, C1, C2,
2296 isExact ? PossiblyExactOperator::IsExact : 0);
2299 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2, bool isExact) {
2300 return get(Instruction::SDiv, C1, C2,
2301 isExact ? PossiblyExactOperator::IsExact : 0);
2304 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
2305 return get(Instruction::FDiv, C1, C2);
2308 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
2309 return get(Instruction::URem, C1, C2);
2312 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
2313 return get(Instruction::SRem, C1, C2);
2316 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
2317 return get(Instruction::FRem, C1, C2);
2320 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
2321 return get(Instruction::And, C1, C2);
2324 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
2325 return get(Instruction::Or, C1, C2);
2328 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
2329 return get(Instruction::Xor, C1, C2);
2332 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2,
2333 bool HasNUW, bool HasNSW) {
2334 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2335 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2336 return get(Instruction::Shl, C1, C2, Flags);
2339 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2, bool isExact) {
2340 return get(Instruction::LShr, C1, C2,
2341 isExact ? PossiblyExactOperator::IsExact : 0);
2344 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2, bool isExact) {
2345 return get(Instruction::AShr, C1, C2,
2346 isExact ? PossiblyExactOperator::IsExact : 0);
2349 /// getBinOpIdentity - Return the identity for the given binary operation,
2350 /// i.e. a constant C such that X op C = X and C op X = X for every X. It
2351 /// returns null if the operator doesn't have an identity.
2352 Constant *ConstantExpr::getBinOpIdentity(unsigned Opcode, Type *Ty) {
2355 // Doesn't have an identity.
2358 case Instruction::Add:
2359 case Instruction::Or:
2360 case Instruction::Xor:
2361 return Constant::getNullValue(Ty);
2363 case Instruction::Mul:
2364 return ConstantInt::get(Ty, 1);
2366 case Instruction::And:
2367 return Constant::getAllOnesValue(Ty);
2371 /// getBinOpAbsorber - Return the absorbing element for the given binary
2372 /// operation, i.e. a constant C such that X op C = C and C op X = C for
2373 /// every X. For example, this returns zero for integer multiplication.
2374 /// It returns null if the operator doesn't have an absorbing element.
2375 Constant *ConstantExpr::getBinOpAbsorber(unsigned Opcode, Type *Ty) {
2378 // Doesn't have an absorber.
2381 case Instruction::Or:
2382 return Constant::getAllOnesValue(Ty);
2384 case Instruction::And:
2385 case Instruction::Mul:
2386 return Constant::getNullValue(Ty);
2390 // destroyConstant - Remove the constant from the constant table...
2392 void ConstantExpr::destroyConstantImpl() {
2393 getType()->getContext().pImpl->ExprConstants.remove(this);
2396 const char *ConstantExpr::getOpcodeName() const {
2397 return Instruction::getOpcodeName(getOpcode());
2400 GetElementPtrConstantExpr::GetElementPtrConstantExpr(
2401 Type *SrcElementTy, Constant *C, ArrayRef<Constant *> IdxList, Type *DestTy)
2402 : ConstantExpr(DestTy, Instruction::GetElementPtr,
2403 OperandTraits<GetElementPtrConstantExpr>::op_end(this) -
2404 (IdxList.size() + 1),
2405 IdxList.size() + 1),
2406 SrcElementTy(SrcElementTy) {
2408 Use *OperandList = getOperandList();
2409 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
2410 OperandList[i+1] = IdxList[i];
2413 Type *GetElementPtrConstantExpr::getSourceElementType() const {
2414 return SrcElementTy;
2417 //===----------------------------------------------------------------------===//
2418 // ConstantData* implementations
2420 void ConstantDataArray::anchor() {}
2421 void ConstantDataVector::anchor() {}
2423 /// getElementType - Return the element type of the array/vector.
2424 Type *ConstantDataSequential::getElementType() const {
2425 return getType()->getElementType();
2428 StringRef ConstantDataSequential::getRawDataValues() const {
2429 return StringRef(DataElements, getNumElements()*getElementByteSize());
2432 /// isElementTypeCompatible - Return true if a ConstantDataSequential can be
2433 /// formed with a vector or array of the specified element type.
2434 /// ConstantDataArray only works with normal float and int types that are
2435 /// stored densely in memory, not with things like i42 or x86_f80.
2436 bool ConstantDataSequential::isElementTypeCompatible(Type *Ty) {
2437 if (Ty->isFloatTy() || Ty->isDoubleTy()) return true;
2438 if (auto *IT = dyn_cast<IntegerType>(Ty)) {
2439 switch (IT->getBitWidth()) {
2451 /// getNumElements - Return the number of elements in the array or vector.
2452 unsigned ConstantDataSequential::getNumElements() const {
2453 if (ArrayType *AT = dyn_cast<ArrayType>(getType()))
2454 return AT->getNumElements();
2455 return getType()->getVectorNumElements();
2459 /// getElementByteSize - Return the size in bytes of the elements in the data.
2460 uint64_t ConstantDataSequential::getElementByteSize() const {
2461 return getElementType()->getPrimitiveSizeInBits()/8;
2464 /// getElementPointer - Return the start of the specified element.
2465 const char *ConstantDataSequential::getElementPointer(unsigned Elt) const {
2466 assert(Elt < getNumElements() && "Invalid Elt");
2467 return DataElements+Elt*getElementByteSize();
2471 /// isAllZeros - return true if the array is empty or all zeros.
2472 static bool isAllZeros(StringRef Arr) {
2473 for (StringRef::iterator I = Arr.begin(), E = Arr.end(); I != E; ++I)
2479 /// getImpl - This is the underlying implementation of all of the
2480 /// ConstantDataSequential::get methods. They all thunk down to here, providing
2481 /// the correct element type. We take the bytes in as a StringRef because
2482 /// we *want* an underlying "char*" to avoid TBAA type punning violations.
2483 Constant *ConstantDataSequential::getImpl(StringRef Elements, Type *Ty) {
2484 assert(isElementTypeCompatible(Ty->getSequentialElementType()));
2485 // If the elements are all zero or there are no elements, return a CAZ, which
2486 // is more dense and canonical.
2487 if (isAllZeros(Elements))
2488 return ConstantAggregateZero::get(Ty);
2490 // Do a lookup to see if we have already formed one of these.
2493 .pImpl->CDSConstants.insert(std::make_pair(Elements, nullptr))
2496 // The bucket can point to a linked list of different CDS's that have the same
2497 // body but different types. For example, 0,0,0,1 could be a 4 element array
2498 // of i8, or a 1-element array of i32. They'll both end up in the same
2499 /// StringMap bucket, linked up by their Next pointers. Walk the list.
2500 ConstantDataSequential **Entry = &Slot.second;
2501 for (ConstantDataSequential *Node = *Entry; Node;
2502 Entry = &Node->Next, Node = *Entry)
2503 if (Node->getType() == Ty)
2506 // Okay, we didn't get a hit. Create a node of the right class, link it in,
2508 if (isa<ArrayType>(Ty))
2509 return *Entry = new ConstantDataArray(Ty, Slot.first().data());
2511 assert(isa<VectorType>(Ty));
2512 return *Entry = new ConstantDataVector(Ty, Slot.first().data());
2515 void ConstantDataSequential::destroyConstantImpl() {
2516 // Remove the constant from the StringMap.
2517 StringMap<ConstantDataSequential*> &CDSConstants =
2518 getType()->getContext().pImpl->CDSConstants;
2520 StringMap<ConstantDataSequential*>::iterator Slot =
2521 CDSConstants.find(getRawDataValues());
2523 assert(Slot != CDSConstants.end() && "CDS not found in uniquing table");
2525 ConstantDataSequential **Entry = &Slot->getValue();
2527 // Remove the entry from the hash table.
2528 if (!(*Entry)->Next) {
2529 // If there is only one value in the bucket (common case) it must be this
2530 // entry, and removing the entry should remove the bucket completely.
2531 assert((*Entry) == this && "Hash mismatch in ConstantDataSequential");
2532 getContext().pImpl->CDSConstants.erase(Slot);
2534 // Otherwise, there are multiple entries linked off the bucket, unlink the
2535 // node we care about but keep the bucket around.
2536 for (ConstantDataSequential *Node = *Entry; ;
2537 Entry = &Node->Next, Node = *Entry) {
2538 assert(Node && "Didn't find entry in its uniquing hash table!");
2539 // If we found our entry, unlink it from the list and we're done.
2541 *Entry = Node->Next;
2547 // If we were part of a list, make sure that we don't delete the list that is
2548 // still owned by the uniquing map.
2552 /// get() constructors - Return a constant with array type with an element
2553 /// count and element type matching the ArrayRef passed in. Note that this
2554 /// can return a ConstantAggregateZero object.
2555 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint8_t> Elts) {
2556 Type *Ty = ArrayType::get(Type::getInt8Ty(Context), Elts.size());
2557 const char *Data = reinterpret_cast<const char *>(Elts.data());
2558 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty);
2560 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){
2561 Type *Ty = ArrayType::get(Type::getInt16Ty(Context), Elts.size());
2562 const char *Data = reinterpret_cast<const char *>(Elts.data());
2563 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty);
2565 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){
2566 Type *Ty = ArrayType::get(Type::getInt32Ty(Context), Elts.size());
2567 const char *Data = reinterpret_cast<const char *>(Elts.data());
2568 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2570 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){
2571 Type *Ty = ArrayType::get(Type::getInt64Ty(Context), Elts.size());
2572 const char *Data = reinterpret_cast<const char *>(Elts.data());
2573 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2575 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<float> Elts) {
2576 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size());
2577 const char *Data = reinterpret_cast<const char *>(Elts.data());
2578 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2580 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<double> Elts) {
2581 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size());
2582 const char *Data = reinterpret_cast<const char *>(Elts.data());
2583 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty);
2586 /// getFP() constructors - Return a constant with array type with an element
2587 /// count and element type of float with precision matching the number of
2588 /// bits in the ArrayRef passed in. (i.e. half for 16bits, float for 32bits,
2589 /// double for 64bits) Note that this can return a ConstantAggregateZero
2591 Constant *ConstantDataArray::getFP(LLVMContext &Context,
2592 ArrayRef<uint16_t> Elts) {
2593 Type *Ty = VectorType::get(Type::getHalfTy(Context), Elts.size());
2594 const char *Data = reinterpret_cast<const char *>(Elts.data());
2595 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 2), Ty);
2597 Constant *ConstantDataArray::getFP(LLVMContext &Context,
2598 ArrayRef<uint32_t> Elts) {
2599 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size());
2600 const char *Data = reinterpret_cast<const char *>(Elts.data());
2601 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 4), Ty);
2603 Constant *ConstantDataArray::getFP(LLVMContext &Context,
2604 ArrayRef<uint64_t> Elts) {
2605 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size());
2606 const char *Data = reinterpret_cast<const char *>(Elts.data());
2607 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty);
2610 /// getString - This method constructs a CDS and initializes it with a text
2611 /// string. The default behavior (AddNull==true) causes a null terminator to
2612 /// be placed at the end of the array (increasing the length of the string by
2613 /// one more than the StringRef would normally indicate. Pass AddNull=false
2614 /// to disable this behavior.
2615 Constant *ConstantDataArray::getString(LLVMContext &Context,
2616 StringRef Str, bool AddNull) {
2618 const uint8_t *Data = reinterpret_cast<const uint8_t *>(Str.data());
2619 return get(Context, makeArrayRef(const_cast<uint8_t *>(Data),
2623 SmallVector<uint8_t, 64> ElementVals;
2624 ElementVals.append(Str.begin(), Str.end());
2625 ElementVals.push_back(0);
2626 return get(Context, ElementVals);
2629 /// get() constructors - Return a constant with vector type with an element
2630 /// count and element type matching the ArrayRef passed in. Note that this
2631 /// can return a ConstantAggregateZero object.
2632 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint8_t> Elts){
2633 Type *Ty = VectorType::get(Type::getInt8Ty(Context), Elts.size());
2634 const char *Data = reinterpret_cast<const char *>(Elts.data());
2635 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty);
2637 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){
2638 Type *Ty = VectorType::get(Type::getInt16Ty(Context), Elts.size());
2639 const char *Data = reinterpret_cast<const char *>(Elts.data());
2640 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty);
2642 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){
2643 Type *Ty = VectorType::get(Type::getInt32Ty(Context), Elts.size());
2644 const char *Data = reinterpret_cast<const char *>(Elts.data());
2645 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2647 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){
2648 Type *Ty = VectorType::get(Type::getInt64Ty(Context), Elts.size());
2649 const char *Data = reinterpret_cast<const char *>(Elts.data());
2650 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2652 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<float> Elts) {
2653 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2654 const char *Data = reinterpret_cast<const char *>(Elts.data());
2655 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2657 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<double> Elts) {
2658 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2659 const char *Data = reinterpret_cast<const char *>(Elts.data());
2660 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty);
2663 /// getFP() constructors - Return a constant with vector type with an element
2664 /// count and element type of float with the precision matching the number of
2665 /// bits in the ArrayRef passed in. (i.e. half for 16bits, float for 32bits,
2666 /// double for 64bits) Note that this can return a ConstantAggregateZero
2668 Constant *ConstantDataVector::getFP(LLVMContext &Context,
2669 ArrayRef<uint16_t> Elts) {
2670 Type *Ty = VectorType::get(Type::getHalfTy(Context), Elts.size());
2671 const char *Data = reinterpret_cast<const char *>(Elts.data());
2672 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 2), Ty);
2674 Constant *ConstantDataVector::getFP(LLVMContext &Context,
2675 ArrayRef<uint32_t> Elts) {
2676 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2677 const char *Data = reinterpret_cast<const char *>(Elts.data());
2678 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 4), Ty);
2680 Constant *ConstantDataVector::getFP(LLVMContext &Context,
2681 ArrayRef<uint64_t> Elts) {
2682 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2683 const char *Data = reinterpret_cast<const char *>(Elts.data());
2684 return getImpl(StringRef(const_cast<char *>(Data), Elts.size() * 8), Ty);
2687 Constant *ConstantDataVector::getSplat(unsigned NumElts, Constant *V) {
2688 assert(isElementTypeCompatible(V->getType()) &&
2689 "Element type not compatible with ConstantData");
2690 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
2691 if (CI->getType()->isIntegerTy(8)) {
2692 SmallVector<uint8_t, 16> Elts(NumElts, CI->getZExtValue());
2693 return get(V->getContext(), Elts);
2695 if (CI->getType()->isIntegerTy(16)) {
2696 SmallVector<uint16_t, 16> Elts(NumElts, CI->getZExtValue());
2697 return get(V->getContext(), Elts);
2699 if (CI->getType()->isIntegerTy(32)) {
2700 SmallVector<uint32_t, 16> Elts(NumElts, CI->getZExtValue());
2701 return get(V->getContext(), Elts);
2703 assert(CI->getType()->isIntegerTy(64) && "Unsupported ConstantData type");
2704 SmallVector<uint64_t, 16> Elts(NumElts, CI->getZExtValue());
2705 return get(V->getContext(), Elts);
2708 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
2709 if (CFP->getType()->isFloatTy()) {
2710 SmallVector<uint32_t, 16> Elts(
2711 NumElts, CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
2712 return getFP(V->getContext(), Elts);
2714 if (CFP->getType()->isDoubleTy()) {
2715 SmallVector<uint64_t, 16> Elts(
2716 NumElts, CFP->getValueAPF().bitcastToAPInt().getLimitedValue());
2717 return getFP(V->getContext(), Elts);
2720 return ConstantVector::getSplat(NumElts, V);
2724 /// getElementAsInteger - If this is a sequential container of integers (of
2725 /// any size), return the specified element in the low bits of a uint64_t.
2726 uint64_t ConstantDataSequential::getElementAsInteger(unsigned Elt) const {
2727 assert(isa<IntegerType>(getElementType()) &&
2728 "Accessor can only be used when element is an integer");
2729 const char *EltPtr = getElementPointer(Elt);
2731 // The data is stored in host byte order, make sure to cast back to the right
2732 // type to load with the right endianness.
2733 switch (getElementType()->getIntegerBitWidth()) {
2734 default: llvm_unreachable("Invalid bitwidth for CDS");
2736 return *const_cast<uint8_t *>(reinterpret_cast<const uint8_t *>(EltPtr));
2738 return *const_cast<uint16_t *>(reinterpret_cast<const uint16_t *>(EltPtr));
2740 return *const_cast<uint32_t *>(reinterpret_cast<const uint32_t *>(EltPtr));
2742 return *const_cast<uint64_t *>(reinterpret_cast<const uint64_t *>(EltPtr));
2746 /// getElementAsAPFloat - If this is a sequential container of floating point
2747 /// type, return the specified element as an APFloat.
2748 APFloat ConstantDataSequential::getElementAsAPFloat(unsigned Elt) const {
2749 const char *EltPtr = getElementPointer(Elt);
2751 switch (getElementType()->getTypeID()) {
2753 llvm_unreachable("Accessor can only be used when element is float/double!");
2754 case Type::FloatTyID: {
2755 auto EltVal = *reinterpret_cast<const uint32_t *>(EltPtr);
2756 return APFloat(APFloat::IEEEsingle, APInt(32, EltVal));
2758 case Type::DoubleTyID: {
2759 auto EltVal = *reinterpret_cast<const uint64_t *>(EltPtr);
2760 return APFloat(APFloat::IEEEdouble, APInt(64, EltVal));
2765 /// getElementAsFloat - If this is an sequential container of floats, return
2766 /// the specified element as a float.
2767 float ConstantDataSequential::getElementAsFloat(unsigned Elt) const {
2768 assert(getElementType()->isFloatTy() &&
2769 "Accessor can only be used when element is a 'float'");
2770 const float *EltPtr = reinterpret_cast<const float *>(getElementPointer(Elt));
2771 return *const_cast<float *>(EltPtr);
2774 /// getElementAsDouble - If this is an sequential container of doubles, return
2775 /// the specified element as a float.
2776 double ConstantDataSequential::getElementAsDouble(unsigned Elt) const {
2777 assert(getElementType()->isDoubleTy() &&
2778 "Accessor can only be used when element is a 'float'");
2779 const double *EltPtr =
2780 reinterpret_cast<const double *>(getElementPointer(Elt));
2781 return *const_cast<double *>(EltPtr);
2784 /// getElementAsConstant - Return a Constant for a specified index's element.
2785 /// Note that this has to compute a new constant to return, so it isn't as
2786 /// efficient as getElementAsInteger/Float/Double.
2787 Constant *ConstantDataSequential::getElementAsConstant(unsigned Elt) const {
2788 if (getElementType()->isFloatTy() || getElementType()->isDoubleTy())
2789 return ConstantFP::get(getContext(), getElementAsAPFloat(Elt));
2791 return ConstantInt::get(getElementType(), getElementAsInteger(Elt));
2794 /// isString - This method returns true if this is an array of i8.
2795 bool ConstantDataSequential::isString() const {
2796 return isa<ArrayType>(getType()) && getElementType()->isIntegerTy(8);
2799 /// isCString - This method returns true if the array "isString", ends with a
2800 /// nul byte, and does not contains any other nul bytes.
2801 bool ConstantDataSequential::isCString() const {
2805 StringRef Str = getAsString();
2807 // The last value must be nul.
2808 if (Str.back() != 0) return false;
2810 // Other elements must be non-nul.
2811 return Str.drop_back().find(0) == StringRef::npos;
2814 /// getSplatValue - If this is a splat constant, meaning that all of the
2815 /// elements have the same value, return that value. Otherwise return nullptr.
2816 Constant *ConstantDataVector::getSplatValue() const {
2817 const char *Base = getRawDataValues().data();
2819 // Compare elements 1+ to the 0'th element.
2820 unsigned EltSize = getElementByteSize();
2821 for (unsigned i = 1, e = getNumElements(); i != e; ++i)
2822 if (memcmp(Base, Base+i*EltSize, EltSize))
2825 // If they're all the same, return the 0th one as a representative.
2826 return getElementAsConstant(0);
2829 //===----------------------------------------------------------------------===//
2830 // handleOperandChange implementations
2832 /// Update this constant array to change uses of
2833 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2836 /// Note that we intentionally replace all uses of From with To here. Consider
2837 /// a large array that uses 'From' 1000 times. By handling this case all here,
2838 /// ConstantArray::handleOperandChange is only invoked once, and that
2839 /// single invocation handles all 1000 uses. Handling them one at a time would
2840 /// work, but would be really slow because it would have to unique each updated
2843 void Constant::handleOperandChange(Value *From, Value *To, Use *U) {
2844 Value *Replacement = nullptr;
2845 switch (getValueID()) {
2847 llvm_unreachable("Not a constant!");
2848 #define HANDLE_CONSTANT(Name) \
2849 case Value::Name##Val: \
2850 Replacement = cast<Name>(this)->handleOperandChangeImpl(From, To, U); \
2852 #include "llvm/IR/Value.def"
2855 // If handleOperandChangeImpl returned nullptr, then it handled
2856 // replacing itself and we don't want to delete or replace anything else here.
2860 // I do need to replace this with an existing value.
2861 assert(Replacement != this && "I didn't contain From!");
2863 // Everyone using this now uses the replacement.
2864 replaceAllUsesWith(Replacement);
2866 // Delete the old constant!
2870 Value *ConstantInt::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2871 llvm_unreachable("Unsupported class for handleOperandChange()!");
2874 Value *ConstantFP::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2875 llvm_unreachable("Unsupported class for handleOperandChange()!");
2878 Value *UndefValue::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2879 llvm_unreachable("Unsupported class for handleOperandChange()!");
2882 Value *ConstantPointerNull::handleOperandChangeImpl(Value *From, Value *To,
2884 llvm_unreachable("Unsupported class for handleOperandChange()!");
2887 Value *ConstantAggregateZero::handleOperandChangeImpl(Value *From, Value *To,
2889 llvm_unreachable("Unsupported class for handleOperandChange()!");
2892 Value *ConstantDataSequential::handleOperandChangeImpl(Value *From, Value *To,
2894 llvm_unreachable("Unsupported class for handleOperandChange()!");
2897 Value *ConstantArray::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2898 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2899 Constant *ToC = cast<Constant>(To);
2901 SmallVector<Constant*, 8> Values;
2902 Values.reserve(getNumOperands()); // Build replacement array.
2904 // Fill values with the modified operands of the constant array. Also,
2905 // compute whether this turns into an all-zeros array.
2906 unsigned NumUpdated = 0;
2908 // Keep track of whether all the values in the array are "ToC".
2909 bool AllSame = true;
2910 Use *OperandList = getOperandList();
2911 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2912 Constant *Val = cast<Constant>(O->get());
2917 Values.push_back(Val);
2918 AllSame &= Val == ToC;
2921 if (AllSame && ToC->isNullValue())
2922 return ConstantAggregateZero::get(getType());
2924 if (AllSame && isa<UndefValue>(ToC))
2925 return UndefValue::get(getType());
2927 // Check for any other type of constant-folding.
2928 if (Constant *C = getImpl(getType(), Values))
2931 // Update to the new value.
2932 return getContext().pImpl->ArrayConstants.replaceOperandsInPlace(
2933 Values, this, From, ToC, NumUpdated, U - OperandList);
2936 Value *ConstantStruct::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2937 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2938 Constant *ToC = cast<Constant>(To);
2940 Use *OperandList = getOperandList();
2941 unsigned OperandToUpdate = U-OperandList;
2942 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2944 SmallVector<Constant*, 8> Values;
2945 Values.reserve(getNumOperands()); // Build replacement struct.
2947 // Fill values with the modified operands of the constant struct. Also,
2948 // compute whether this turns into an all-zeros struct.
2949 bool isAllZeros = false;
2950 bool isAllUndef = false;
2951 if (ToC->isNullValue()) {
2953 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2954 Constant *Val = cast<Constant>(O->get());
2955 Values.push_back(Val);
2956 if (isAllZeros) isAllZeros = Val->isNullValue();
2958 } else if (isa<UndefValue>(ToC)) {
2960 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2961 Constant *Val = cast<Constant>(O->get());
2962 Values.push_back(Val);
2963 if (isAllUndef) isAllUndef = isa<UndefValue>(Val);
2966 for (Use *O = OperandList, *E = OperandList + getNumOperands(); O != E; ++O)
2967 Values.push_back(cast<Constant>(O->get()));
2969 Values[OperandToUpdate] = ToC;
2972 return ConstantAggregateZero::get(getType());
2975 return UndefValue::get(getType());
2977 // Update to the new value.
2978 return getContext().pImpl->StructConstants.replaceOperandsInPlace(
2979 Values, this, From, ToC);
2982 Value *ConstantVector::handleOperandChangeImpl(Value *From, Value *To, Use *U) {
2983 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2984 Constant *ToC = cast<Constant>(To);
2986 SmallVector<Constant*, 8> Values;
2987 Values.reserve(getNumOperands()); // Build replacement array...
2988 unsigned NumUpdated = 0;
2989 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2990 Constant *Val = getOperand(i);
2995 Values.push_back(Val);
2998 if (Constant *C = getImpl(Values))
3001 // Update to the new value.
3002 Use *OperandList = getOperandList();
3003 return getContext().pImpl->VectorConstants.replaceOperandsInPlace(
3004 Values, this, From, ToC, NumUpdated, U - OperandList);
3007 Value *ConstantExpr::handleOperandChangeImpl(Value *From, Value *ToV, Use *U) {
3008 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
3009 Constant *To = cast<Constant>(ToV);
3011 SmallVector<Constant*, 8> NewOps;
3012 unsigned NumUpdated = 0;
3013 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
3014 Constant *Op = getOperand(i);
3019 NewOps.push_back(Op);
3021 assert(NumUpdated && "I didn't contain From!");
3023 if (Constant *C = getWithOperands(NewOps, getType(), true))
3026 // Update to the new value.
3027 Use *OperandList = getOperandList();
3028 return getContext().pImpl->ExprConstants.replaceOperandsInPlace(
3029 NewOps, this, From, To, NumUpdated, U - OperandList);
3032 Instruction *ConstantExpr::getAsInstruction() {
3033 SmallVector<Value *, 4> ValueOperands(op_begin(), op_end());
3034 ArrayRef<Value*> Ops(ValueOperands);
3036 switch (getOpcode()) {
3037 case Instruction::Trunc:
3038 case Instruction::ZExt:
3039 case Instruction::SExt:
3040 case Instruction::FPTrunc:
3041 case Instruction::FPExt:
3042 case Instruction::UIToFP:
3043 case Instruction::SIToFP:
3044 case Instruction::FPToUI:
3045 case Instruction::FPToSI:
3046 case Instruction::PtrToInt:
3047 case Instruction::IntToPtr:
3048 case Instruction::BitCast:
3049 case Instruction::AddrSpaceCast:
3050 return CastInst::Create((Instruction::CastOps)getOpcode(),
3052 case Instruction::Select:
3053 return SelectInst::Create(Ops[0], Ops[1], Ops[2]);
3054 case Instruction::InsertElement:
3055 return InsertElementInst::Create(Ops[0], Ops[1], Ops[2]);
3056 case Instruction::ExtractElement:
3057 return ExtractElementInst::Create(Ops[0], Ops[1]);
3058 case Instruction::InsertValue:
3059 return InsertValueInst::Create(Ops[0], Ops[1], getIndices());
3060 case Instruction::ExtractValue:
3061 return ExtractValueInst::Create(Ops[0], getIndices());
3062 case Instruction::ShuffleVector:
3063 return new ShuffleVectorInst(Ops[0], Ops[1], Ops[2]);
3065 case Instruction::GetElementPtr: {
3066 const auto *GO = cast<GEPOperator>(this);
3067 if (GO->isInBounds())
3068 return GetElementPtrInst::CreateInBounds(GO->getSourceElementType(),
3069 Ops[0], Ops.slice(1));
3070 return GetElementPtrInst::Create(GO->getSourceElementType(), Ops[0],
3073 case Instruction::ICmp:
3074 case Instruction::FCmp:
3075 return CmpInst::Create((Instruction::OtherOps)getOpcode(),
3076 getPredicate(), Ops[0], Ops[1]);
3079 assert(getNumOperands() == 2 && "Must be binary operator?");
3080 BinaryOperator *BO =
3081 BinaryOperator::Create((Instruction::BinaryOps)getOpcode(),
3083 if (isa<OverflowingBinaryOperator>(BO)) {
3084 BO->setHasNoUnsignedWrap(SubclassOptionalData &
3085 OverflowingBinaryOperator::NoUnsignedWrap);
3086 BO->setHasNoSignedWrap(SubclassOptionalData &
3087 OverflowingBinaryOperator::NoSignedWrap);
3089 if (isa<PossiblyExactOperator>(BO))
3090 BO->setIsExact(SubclassOptionalData & PossiblyExactOperator::IsExact);