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 // Constructor to create a '0' constant of arbitrary type...
155 Constant *Constant::getNullValue(Type *Ty) {
156 switch (Ty->getTypeID()) {
157 case Type::IntegerTyID:
158 return ConstantInt::get(Ty, 0);
160 return ConstantFP::get(Ty->getContext(),
161 APFloat::getZero(APFloat::IEEEhalf));
162 case Type::FloatTyID:
163 return ConstantFP::get(Ty->getContext(),
164 APFloat::getZero(APFloat::IEEEsingle));
165 case Type::DoubleTyID:
166 return ConstantFP::get(Ty->getContext(),
167 APFloat::getZero(APFloat::IEEEdouble));
168 case Type::X86_FP80TyID:
169 return ConstantFP::get(Ty->getContext(),
170 APFloat::getZero(APFloat::x87DoubleExtended));
171 case Type::FP128TyID:
172 return ConstantFP::get(Ty->getContext(),
173 APFloat::getZero(APFloat::IEEEquad));
174 case Type::PPC_FP128TyID:
175 return ConstantFP::get(Ty->getContext(),
176 APFloat(APFloat::PPCDoubleDouble,
177 APInt::getNullValue(128)));
178 case Type::PointerTyID:
179 return ConstantPointerNull::get(cast<PointerType>(Ty));
180 case Type::StructTyID:
181 case Type::ArrayTyID:
182 case Type::VectorTyID:
183 return ConstantAggregateZero::get(Ty);
185 // Function, Label, or Opaque type?
186 llvm_unreachable("Cannot create a null constant of that type!");
190 Constant *Constant::getIntegerValue(Type *Ty, const APInt &V) {
191 Type *ScalarTy = Ty->getScalarType();
193 // Create the base integer constant.
194 Constant *C = ConstantInt::get(Ty->getContext(), V);
196 // Convert an integer to a pointer, if necessary.
197 if (PointerType *PTy = dyn_cast<PointerType>(ScalarTy))
198 C = ConstantExpr::getIntToPtr(C, PTy);
200 // Broadcast a scalar to a vector, if necessary.
201 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
202 C = ConstantVector::getSplat(VTy->getNumElements(), C);
207 Constant *Constant::getAllOnesValue(Type *Ty) {
208 if (IntegerType *ITy = dyn_cast<IntegerType>(Ty))
209 return ConstantInt::get(Ty->getContext(),
210 APInt::getAllOnesValue(ITy->getBitWidth()));
212 if (Ty->isFloatingPointTy()) {
213 APFloat FL = APFloat::getAllOnesValue(Ty->getPrimitiveSizeInBits(),
214 !Ty->isPPC_FP128Ty());
215 return ConstantFP::get(Ty->getContext(), FL);
218 VectorType *VTy = cast<VectorType>(Ty);
219 return ConstantVector::getSplat(VTy->getNumElements(),
220 getAllOnesValue(VTy->getElementType()));
223 /// getAggregateElement - For aggregates (struct/array/vector) return the
224 /// constant that corresponds to the specified element if possible, or null if
225 /// not. This can return null if the element index is a ConstantExpr, or if
226 /// 'this' is a constant expr.
227 Constant *Constant::getAggregateElement(unsigned Elt) const {
228 if (const ConstantStruct *CS = dyn_cast<ConstantStruct>(this))
229 return Elt < CS->getNumOperands() ? CS->getOperand(Elt) : nullptr;
231 if (const ConstantArray *CA = dyn_cast<ConstantArray>(this))
232 return Elt < CA->getNumOperands() ? CA->getOperand(Elt) : nullptr;
234 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
235 return Elt < CV->getNumOperands() ? CV->getOperand(Elt) : nullptr;
237 if (const ConstantAggregateZero *CAZ =dyn_cast<ConstantAggregateZero>(this))
238 return CAZ->getElementValue(Elt);
240 if (const UndefValue *UV = dyn_cast<UndefValue>(this))
241 return UV->getElementValue(Elt);
243 if (const ConstantDataSequential *CDS =dyn_cast<ConstantDataSequential>(this))
244 return Elt < CDS->getNumElements() ? CDS->getElementAsConstant(Elt)
249 Constant *Constant::getAggregateElement(Constant *Elt) const {
250 assert(isa<IntegerType>(Elt->getType()) && "Index must be an integer");
251 if (ConstantInt *CI = dyn_cast<ConstantInt>(Elt))
252 return getAggregateElement(CI->getZExtValue());
257 void Constant::destroyConstantImpl() {
258 // When a Constant is destroyed, there may be lingering
259 // references to the constant by other constants in the constant pool. These
260 // constants are implicitly dependent on the module that is being deleted,
261 // but they don't know that. Because we only find out when the CPV is
262 // deleted, we must now notify all of our users (that should only be
263 // Constants) that they are, in fact, invalid now and should be deleted.
265 while (!use_empty()) {
266 Value *V = user_back();
267 #ifndef NDEBUG // Only in -g mode...
268 if (!isa<Constant>(V)) {
269 dbgs() << "While deleting: " << *this
270 << "\n\nUse still stuck around after Def is destroyed: "
274 assert(isa<Constant>(V) && "References remain to Constant being destroyed");
275 cast<Constant>(V)->destroyConstant();
277 // The constant should remove itself from our use list...
278 assert((use_empty() || user_back() != V) && "Constant not removed!");
281 // Value has no outstanding references it is safe to delete it now...
285 static bool canTrapImpl(const Constant *C,
286 SmallPtrSet<const ConstantExpr *, 4> &NonTrappingOps) {
287 assert(C->getType()->isFirstClassType() && "Cannot evaluate aggregate vals!");
288 // The only thing that could possibly trap are constant exprs.
289 const ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
293 // ConstantExpr traps if any operands can trap.
294 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
295 if (ConstantExpr *Op = dyn_cast<ConstantExpr>(CE->getOperand(i))) {
296 if (NonTrappingOps.insert(Op) && canTrapImpl(Op, NonTrappingOps))
301 // Otherwise, only specific operations can trap.
302 switch (CE->getOpcode()) {
305 case Instruction::UDiv:
306 case Instruction::SDiv:
307 case Instruction::FDiv:
308 case Instruction::URem:
309 case Instruction::SRem:
310 case Instruction::FRem:
311 // Div and rem can trap if the RHS is not known to be non-zero.
312 if (!isa<ConstantInt>(CE->getOperand(1)) ||CE->getOperand(1)->isNullValue())
318 /// canTrap - Return true if evaluation of this constant could trap. This is
319 /// true for things like constant expressions that could divide by zero.
320 bool Constant::canTrap() const {
321 SmallPtrSet<const ConstantExpr *, 4> NonTrappingOps;
322 return canTrapImpl(this, NonTrappingOps);
325 /// Check if C contains a GlobalValue for which Predicate is true.
327 ConstHasGlobalValuePredicate(const Constant *C,
328 bool (*Predicate)(const GlobalValue *)) {
329 SmallPtrSet<const Constant *, 8> Visited;
330 SmallVector<const Constant *, 8> WorkList;
331 WorkList.push_back(C);
334 while (!WorkList.empty()) {
335 const Constant *WorkItem = WorkList.pop_back_val();
336 if (const auto *GV = dyn_cast<GlobalValue>(WorkItem))
339 for (const Value *Op : WorkItem->operands()) {
340 const Constant *ConstOp = dyn_cast<Constant>(Op);
343 if (Visited.insert(ConstOp))
344 WorkList.push_back(ConstOp);
350 /// Return true if the value can vary between threads.
351 bool Constant::isThreadDependent() const {
352 auto DLLImportPredicate = [](const GlobalValue *GV) {
353 return GV->isThreadLocal();
355 return ConstHasGlobalValuePredicate(this, DLLImportPredicate);
358 bool Constant::isDLLImportDependent() const {
359 auto DLLImportPredicate = [](const GlobalValue *GV) {
360 return GV->hasDLLImportStorageClass();
362 return ConstHasGlobalValuePredicate(this, DLLImportPredicate);
365 /// Return true if the constant has users other than constant exprs and other
367 bool Constant::isConstantUsed() const {
368 for (const User *U : users()) {
369 const Constant *UC = dyn_cast<Constant>(U);
370 if (!UC || isa<GlobalValue>(UC))
373 if (UC->isConstantUsed())
381 /// getRelocationInfo - This method classifies the entry according to
382 /// whether or not it may generate a relocation entry. This must be
383 /// conservative, so if it might codegen to a relocatable entry, it should say
384 /// so. The return values are:
386 /// NoRelocation: This constant pool entry is guaranteed to never have a
387 /// relocation applied to it (because it holds a simple constant like
389 /// LocalRelocation: This entry has relocations, but the entries are
390 /// guaranteed to be resolvable by the static linker, so the dynamic
391 /// linker will never see them.
392 /// GlobalRelocations: This entry may have arbitrary relocations.
394 /// FIXME: This really should not be in IR.
395 Constant::PossibleRelocationsTy Constant::getRelocationInfo() const {
396 if (const GlobalValue *GV = dyn_cast<GlobalValue>(this)) {
397 if (GV->hasLocalLinkage() || GV->hasHiddenVisibility())
398 return LocalRelocation; // Local to this file/library.
399 return GlobalRelocations; // Global reference.
402 if (const BlockAddress *BA = dyn_cast<BlockAddress>(this))
403 return BA->getFunction()->getRelocationInfo();
405 // While raw uses of blockaddress need to be relocated, differences between
406 // two of them don't when they are for labels in the same function. This is a
407 // common idiom when creating a table for the indirect goto extension, so we
408 // handle it efficiently here.
409 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(this))
410 if (CE->getOpcode() == Instruction::Sub) {
411 ConstantExpr *LHS = dyn_cast<ConstantExpr>(CE->getOperand(0));
412 ConstantExpr *RHS = dyn_cast<ConstantExpr>(CE->getOperand(1));
414 LHS->getOpcode() == Instruction::PtrToInt &&
415 RHS->getOpcode() == Instruction::PtrToInt &&
416 isa<BlockAddress>(LHS->getOperand(0)) &&
417 isa<BlockAddress>(RHS->getOperand(0)) &&
418 cast<BlockAddress>(LHS->getOperand(0))->getFunction() ==
419 cast<BlockAddress>(RHS->getOperand(0))->getFunction())
423 PossibleRelocationsTy Result = NoRelocation;
424 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
425 Result = std::max(Result,
426 cast<Constant>(getOperand(i))->getRelocationInfo());
431 /// removeDeadUsersOfConstant - If the specified constantexpr is dead, remove
432 /// it. This involves recursively eliminating any dead users of the
434 static bool removeDeadUsersOfConstant(const Constant *C) {
435 if (isa<GlobalValue>(C)) return false; // Cannot remove this
437 while (!C->use_empty()) {
438 const Constant *User = dyn_cast<Constant>(C->user_back());
439 if (!User) return false; // Non-constant usage;
440 if (!removeDeadUsersOfConstant(User))
441 return false; // Constant wasn't dead
444 const_cast<Constant*>(C)->destroyConstant();
449 /// removeDeadConstantUsers - If there are any dead constant users dangling
450 /// off of this constant, remove them. This method is useful for clients
451 /// that want to check to see if a global is unused, but don't want to deal
452 /// with potentially dead constants hanging off of the globals.
453 void Constant::removeDeadConstantUsers() const {
454 Value::const_user_iterator I = user_begin(), E = user_end();
455 Value::const_user_iterator LastNonDeadUser = E;
457 const Constant *User = dyn_cast<Constant>(*I);
464 if (!removeDeadUsersOfConstant(User)) {
465 // If the constant wasn't dead, remember that this was the last live use
466 // and move on to the next constant.
472 // If the constant was dead, then the iterator is invalidated.
473 if (LastNonDeadUser == E) {
485 //===----------------------------------------------------------------------===//
487 //===----------------------------------------------------------------------===//
489 void ConstantInt::anchor() { }
491 ConstantInt::ConstantInt(IntegerType *Ty, const APInt& V)
492 : Constant(Ty, ConstantIntVal, nullptr, 0), Val(V) {
493 assert(V.getBitWidth() == Ty->getBitWidth() && "Invalid constant for type");
496 ConstantInt *ConstantInt::getTrue(LLVMContext &Context) {
497 LLVMContextImpl *pImpl = Context.pImpl;
498 if (!pImpl->TheTrueVal)
499 pImpl->TheTrueVal = ConstantInt::get(Type::getInt1Ty(Context), 1);
500 return pImpl->TheTrueVal;
503 ConstantInt *ConstantInt::getFalse(LLVMContext &Context) {
504 LLVMContextImpl *pImpl = Context.pImpl;
505 if (!pImpl->TheFalseVal)
506 pImpl->TheFalseVal = ConstantInt::get(Type::getInt1Ty(Context), 0);
507 return pImpl->TheFalseVal;
510 Constant *ConstantInt::getTrue(Type *Ty) {
511 VectorType *VTy = dyn_cast<VectorType>(Ty);
513 assert(Ty->isIntegerTy(1) && "True must be i1 or vector of i1.");
514 return ConstantInt::getTrue(Ty->getContext());
516 assert(VTy->getElementType()->isIntegerTy(1) &&
517 "True must be vector of i1 or i1.");
518 return ConstantVector::getSplat(VTy->getNumElements(),
519 ConstantInt::getTrue(Ty->getContext()));
522 Constant *ConstantInt::getFalse(Type *Ty) {
523 VectorType *VTy = dyn_cast<VectorType>(Ty);
525 assert(Ty->isIntegerTy(1) && "False must be i1 or vector of i1.");
526 return ConstantInt::getFalse(Ty->getContext());
528 assert(VTy->getElementType()->isIntegerTy(1) &&
529 "False must be vector of i1 or i1.");
530 return ConstantVector::getSplat(VTy->getNumElements(),
531 ConstantInt::getFalse(Ty->getContext()));
535 // Get a ConstantInt from an APInt. Note that the value stored in the DenseMap
536 // as the key, is a DenseMapAPIntKeyInfo::KeyTy which has provided the
537 // operator== and operator!= to ensure that the DenseMap doesn't attempt to
538 // compare APInt's of different widths, which would violate an APInt class
539 // invariant which generates an assertion.
540 ConstantInt *ConstantInt::get(LLVMContext &Context, const APInt &V) {
541 // Get the corresponding integer type for the bit width of the value.
542 IntegerType *ITy = IntegerType::get(Context, V.getBitWidth());
543 // get an existing value or the insertion position
544 LLVMContextImpl *pImpl = Context.pImpl;
545 ConstantInt *&Slot = pImpl->IntConstants[DenseMapAPIntKeyInfo::KeyTy(V, ITy)];
546 if (!Slot) Slot = new ConstantInt(ITy, V);
550 Constant *ConstantInt::get(Type *Ty, uint64_t V, bool isSigned) {
551 Constant *C = get(cast<IntegerType>(Ty->getScalarType()), V, isSigned);
553 // For vectors, broadcast the value.
554 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
555 return ConstantVector::getSplat(VTy->getNumElements(), C);
560 ConstantInt *ConstantInt::get(IntegerType *Ty, uint64_t V,
562 return get(Ty->getContext(), APInt(Ty->getBitWidth(), V, isSigned));
565 ConstantInt *ConstantInt::getSigned(IntegerType *Ty, int64_t V) {
566 return get(Ty, V, true);
569 Constant *ConstantInt::getSigned(Type *Ty, int64_t V) {
570 return get(Ty, V, true);
573 Constant *ConstantInt::get(Type *Ty, const APInt& V) {
574 ConstantInt *C = get(Ty->getContext(), V);
575 assert(C->getType() == Ty->getScalarType() &&
576 "ConstantInt type doesn't match the type implied by its value!");
578 // For vectors, broadcast the value.
579 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
580 return ConstantVector::getSplat(VTy->getNumElements(), C);
585 ConstantInt *ConstantInt::get(IntegerType* Ty, StringRef Str,
587 return get(Ty->getContext(), APInt(Ty->getBitWidth(), Str, radix));
590 //===----------------------------------------------------------------------===//
592 //===----------------------------------------------------------------------===//
594 static const fltSemantics *TypeToFloatSemantics(Type *Ty) {
596 return &APFloat::IEEEhalf;
598 return &APFloat::IEEEsingle;
599 if (Ty->isDoubleTy())
600 return &APFloat::IEEEdouble;
601 if (Ty->isX86_FP80Ty())
602 return &APFloat::x87DoubleExtended;
603 else if (Ty->isFP128Ty())
604 return &APFloat::IEEEquad;
606 assert(Ty->isPPC_FP128Ty() && "Unknown FP format");
607 return &APFloat::PPCDoubleDouble;
610 void ConstantFP::anchor() { }
612 /// get() - This returns a constant fp for the specified value in the
613 /// specified type. This should only be used for simple constant values like
614 /// 2.0/1.0 etc, that are known-valid both as double and as the target format.
615 Constant *ConstantFP::get(Type *Ty, double V) {
616 LLVMContext &Context = Ty->getContext();
620 FV.convert(*TypeToFloatSemantics(Ty->getScalarType()),
621 APFloat::rmNearestTiesToEven, &ignored);
622 Constant *C = get(Context, FV);
624 // For vectors, broadcast the value.
625 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
626 return ConstantVector::getSplat(VTy->getNumElements(), C);
632 Constant *ConstantFP::get(Type *Ty, StringRef Str) {
633 LLVMContext &Context = Ty->getContext();
635 APFloat FV(*TypeToFloatSemantics(Ty->getScalarType()), Str);
636 Constant *C = get(Context, FV);
638 // For vectors, broadcast the value.
639 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
640 return ConstantVector::getSplat(VTy->getNumElements(), C);
645 Constant *ConstantFP::getNegativeZero(Type *Ty) {
646 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType());
647 APFloat NegZero = APFloat::getZero(Semantics, /*Negative=*/true);
648 Constant *C = get(Ty->getContext(), NegZero);
650 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
651 return ConstantVector::getSplat(VTy->getNumElements(), C);
657 Constant *ConstantFP::getZeroValueForNegation(Type *Ty) {
658 if (Ty->isFPOrFPVectorTy())
659 return getNegativeZero(Ty);
661 return Constant::getNullValue(Ty);
665 // ConstantFP accessors.
666 ConstantFP* ConstantFP::get(LLVMContext &Context, const APFloat& V) {
667 LLVMContextImpl* pImpl = Context.pImpl;
669 ConstantFP *&Slot = pImpl->FPConstants[DenseMapAPFloatKeyInfo::KeyTy(V)];
673 if (&V.getSemantics() == &APFloat::IEEEhalf)
674 Ty = Type::getHalfTy(Context);
675 else if (&V.getSemantics() == &APFloat::IEEEsingle)
676 Ty = Type::getFloatTy(Context);
677 else if (&V.getSemantics() == &APFloat::IEEEdouble)
678 Ty = Type::getDoubleTy(Context);
679 else if (&V.getSemantics() == &APFloat::x87DoubleExtended)
680 Ty = Type::getX86_FP80Ty(Context);
681 else if (&V.getSemantics() == &APFloat::IEEEquad)
682 Ty = Type::getFP128Ty(Context);
684 assert(&V.getSemantics() == &APFloat::PPCDoubleDouble &&
685 "Unknown FP format");
686 Ty = Type::getPPC_FP128Ty(Context);
688 Slot = new ConstantFP(Ty, V);
694 Constant *ConstantFP::getInfinity(Type *Ty, bool Negative) {
695 const fltSemantics &Semantics = *TypeToFloatSemantics(Ty->getScalarType());
696 Constant *C = get(Ty->getContext(), APFloat::getInf(Semantics, Negative));
698 if (VectorType *VTy = dyn_cast<VectorType>(Ty))
699 return ConstantVector::getSplat(VTy->getNumElements(), C);
704 ConstantFP::ConstantFP(Type *Ty, const APFloat& V)
705 : Constant(Ty, ConstantFPVal, nullptr, 0), Val(V) {
706 assert(&V.getSemantics() == TypeToFloatSemantics(Ty) &&
710 bool ConstantFP::isExactlyValue(const APFloat &V) const {
711 return Val.bitwiseIsEqual(V);
714 //===----------------------------------------------------------------------===//
715 // ConstantAggregateZero Implementation
716 //===----------------------------------------------------------------------===//
718 /// getSequentialElement - If this CAZ has array or vector type, return a zero
719 /// with the right element type.
720 Constant *ConstantAggregateZero::getSequentialElement() const {
721 return Constant::getNullValue(getType()->getSequentialElementType());
724 /// getStructElement - If this CAZ has struct type, return a zero with the
725 /// right element type for the specified element.
726 Constant *ConstantAggregateZero::getStructElement(unsigned Elt) const {
727 return Constant::getNullValue(getType()->getStructElementType(Elt));
730 /// getElementValue - Return a zero of the right value for the specified GEP
731 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
732 Constant *ConstantAggregateZero::getElementValue(Constant *C) const {
733 if (isa<SequentialType>(getType()))
734 return getSequentialElement();
735 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
738 /// getElementValue - Return a zero of the right value for the specified GEP
740 Constant *ConstantAggregateZero::getElementValue(unsigned Idx) const {
741 if (isa<SequentialType>(getType()))
742 return getSequentialElement();
743 return getStructElement(Idx);
747 //===----------------------------------------------------------------------===//
748 // UndefValue Implementation
749 //===----------------------------------------------------------------------===//
751 /// getSequentialElement - If this undef has array or vector type, return an
752 /// undef with the right element type.
753 UndefValue *UndefValue::getSequentialElement() const {
754 return UndefValue::get(getType()->getSequentialElementType());
757 /// getStructElement - If this undef has struct type, return a zero with the
758 /// right element type for the specified element.
759 UndefValue *UndefValue::getStructElement(unsigned Elt) const {
760 return UndefValue::get(getType()->getStructElementType(Elt));
763 /// getElementValue - Return an undef of the right value for the specified GEP
764 /// index if we can, otherwise return null (e.g. if C is a ConstantExpr).
765 UndefValue *UndefValue::getElementValue(Constant *C) const {
766 if (isa<SequentialType>(getType()))
767 return getSequentialElement();
768 return getStructElement(cast<ConstantInt>(C)->getZExtValue());
771 /// getElementValue - Return an undef of the right value for the specified GEP
773 UndefValue *UndefValue::getElementValue(unsigned Idx) const {
774 if (isa<SequentialType>(getType()))
775 return getSequentialElement();
776 return getStructElement(Idx);
781 //===----------------------------------------------------------------------===//
782 // ConstantXXX Classes
783 //===----------------------------------------------------------------------===//
785 template <typename ItTy, typename EltTy>
786 static bool rangeOnlyContains(ItTy Start, ItTy End, EltTy Elt) {
787 for (; Start != End; ++Start)
793 ConstantArray::ConstantArray(ArrayType *T, ArrayRef<Constant *> V)
794 : Constant(T, ConstantArrayVal,
795 OperandTraits<ConstantArray>::op_end(this) - V.size(),
797 assert(V.size() == T->getNumElements() &&
798 "Invalid initializer vector for constant array");
799 for (unsigned i = 0, e = V.size(); i != e; ++i)
800 assert(V[i]->getType() == T->getElementType() &&
801 "Initializer for array element doesn't match array element type!");
802 std::copy(V.begin(), V.end(), op_begin());
805 Constant *ConstantArray::get(ArrayType *Ty, ArrayRef<Constant*> V) {
806 if (Constant *C = getImpl(Ty, V))
808 return Ty->getContext().pImpl->ArrayConstants.getOrCreate(Ty, V);
810 Constant *ConstantArray::getImpl(ArrayType *Ty, ArrayRef<Constant*> V) {
811 // Empty arrays are canonicalized to ConstantAggregateZero.
813 return ConstantAggregateZero::get(Ty);
815 for (unsigned i = 0, e = V.size(); i != e; ++i) {
816 assert(V[i]->getType() == Ty->getElementType() &&
817 "Wrong type in array element initializer");
820 // If this is an all-zero array, return a ConstantAggregateZero object. If
821 // all undef, return an UndefValue, if "all simple", then return a
822 // ConstantDataArray.
824 if (isa<UndefValue>(C) && rangeOnlyContains(V.begin(), V.end(), C))
825 return UndefValue::get(Ty);
827 if (C->isNullValue() && rangeOnlyContains(V.begin(), V.end(), C))
828 return ConstantAggregateZero::get(Ty);
830 // Check to see if all of the elements are ConstantFP or ConstantInt and if
831 // the element type is compatible with ConstantDataVector. If so, use it.
832 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) {
833 // We speculatively build the elements here even if it turns out that there
834 // is a constantexpr or something else weird in the array, since it is so
835 // uncommon for that to happen.
836 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
837 if (CI->getType()->isIntegerTy(8)) {
838 SmallVector<uint8_t, 16> Elts;
839 for (unsigned i = 0, e = V.size(); i != e; ++i)
840 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
841 Elts.push_back(CI->getZExtValue());
844 if (Elts.size() == V.size())
845 return ConstantDataArray::get(C->getContext(), Elts);
846 } else if (CI->getType()->isIntegerTy(16)) {
847 SmallVector<uint16_t, 16> Elts;
848 for (unsigned i = 0, e = V.size(); i != e; ++i)
849 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
850 Elts.push_back(CI->getZExtValue());
853 if (Elts.size() == V.size())
854 return ConstantDataArray::get(C->getContext(), Elts);
855 } else if (CI->getType()->isIntegerTy(32)) {
856 SmallVector<uint32_t, 16> Elts;
857 for (unsigned i = 0, e = V.size(); i != e; ++i)
858 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
859 Elts.push_back(CI->getZExtValue());
862 if (Elts.size() == V.size())
863 return ConstantDataArray::get(C->getContext(), Elts);
864 } else if (CI->getType()->isIntegerTy(64)) {
865 SmallVector<uint64_t, 16> Elts;
866 for (unsigned i = 0, e = V.size(); i != e; ++i)
867 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
868 Elts.push_back(CI->getZExtValue());
871 if (Elts.size() == V.size())
872 return ConstantDataArray::get(C->getContext(), Elts);
876 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
877 if (CFP->getType()->isFloatTy()) {
878 SmallVector<float, 16> Elts;
879 for (unsigned i = 0, e = V.size(); i != e; ++i)
880 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
881 Elts.push_back(CFP->getValueAPF().convertToFloat());
884 if (Elts.size() == V.size())
885 return ConstantDataArray::get(C->getContext(), Elts);
886 } else if (CFP->getType()->isDoubleTy()) {
887 SmallVector<double, 16> Elts;
888 for (unsigned i = 0, e = V.size(); i != e; ++i)
889 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
890 Elts.push_back(CFP->getValueAPF().convertToDouble());
893 if (Elts.size() == V.size())
894 return ConstantDataArray::get(C->getContext(), Elts);
899 // Otherwise, we really do want to create a ConstantArray.
903 /// getTypeForElements - Return an anonymous struct type to use for a constant
904 /// with the specified set of elements. The list must not be empty.
905 StructType *ConstantStruct::getTypeForElements(LLVMContext &Context,
906 ArrayRef<Constant*> V,
908 unsigned VecSize = V.size();
909 SmallVector<Type*, 16> EltTypes(VecSize);
910 for (unsigned i = 0; i != VecSize; ++i)
911 EltTypes[i] = V[i]->getType();
913 return StructType::get(Context, EltTypes, Packed);
917 StructType *ConstantStruct::getTypeForElements(ArrayRef<Constant*> V,
920 "ConstantStruct::getTypeForElements cannot be called on empty list");
921 return getTypeForElements(V[0]->getContext(), V, Packed);
925 ConstantStruct::ConstantStruct(StructType *T, ArrayRef<Constant *> V)
926 : Constant(T, ConstantStructVal,
927 OperandTraits<ConstantStruct>::op_end(this) - V.size(),
929 assert(V.size() == T->getNumElements() &&
930 "Invalid initializer vector for constant structure");
931 for (unsigned i = 0, e = V.size(); i != e; ++i)
932 assert((T->isOpaque() || V[i]->getType() == T->getElementType(i)) &&
933 "Initializer for struct element doesn't match struct element type!");
934 std::copy(V.begin(), V.end(), op_begin());
937 // ConstantStruct accessors.
938 Constant *ConstantStruct::get(StructType *ST, ArrayRef<Constant*> V) {
939 assert((ST->isOpaque() || ST->getNumElements() == V.size()) &&
940 "Incorrect # elements specified to ConstantStruct::get");
942 // Create a ConstantAggregateZero value if all elements are zeros.
944 bool isUndef = false;
947 isUndef = isa<UndefValue>(V[0]);
948 isZero = V[0]->isNullValue();
949 if (isUndef || isZero) {
950 for (unsigned i = 0, e = V.size(); i != e; ++i) {
951 if (!V[i]->isNullValue())
953 if (!isa<UndefValue>(V[i]))
959 return ConstantAggregateZero::get(ST);
961 return UndefValue::get(ST);
963 return ST->getContext().pImpl->StructConstants.getOrCreate(ST, V);
966 Constant *ConstantStruct::get(StructType *T, ...) {
968 SmallVector<Constant*, 8> Values;
970 while (Constant *Val = va_arg(ap, llvm::Constant*))
971 Values.push_back(Val);
973 return get(T, Values);
976 ConstantVector::ConstantVector(VectorType *T, ArrayRef<Constant *> V)
977 : Constant(T, ConstantVectorVal,
978 OperandTraits<ConstantVector>::op_end(this) - V.size(),
980 for (size_t i = 0, e = V.size(); i != e; i++)
981 assert(V[i]->getType() == T->getElementType() &&
982 "Initializer for vector element doesn't match vector element type!");
983 std::copy(V.begin(), V.end(), op_begin());
986 // ConstantVector accessors.
987 Constant *ConstantVector::get(ArrayRef<Constant*> V) {
988 if (Constant *C = getImpl(V))
990 VectorType *Ty = VectorType::get(V.front()->getType(), V.size());
991 return Ty->getContext().pImpl->VectorConstants.getOrCreate(Ty, V);
993 Constant *ConstantVector::getImpl(ArrayRef<Constant*> V) {
994 assert(!V.empty() && "Vectors can't be empty");
995 VectorType *T = VectorType::get(V.front()->getType(), V.size());
997 // If this is an all-undef or all-zero vector, return a
998 // ConstantAggregateZero or UndefValue.
1000 bool isZero = C->isNullValue();
1001 bool isUndef = isa<UndefValue>(C);
1003 if (isZero || isUndef) {
1004 for (unsigned i = 1, e = V.size(); i != e; ++i)
1006 isZero = isUndef = false;
1012 return ConstantAggregateZero::get(T);
1014 return UndefValue::get(T);
1016 // Check to see if all of the elements are ConstantFP or ConstantInt and if
1017 // the element type is compatible with ConstantDataVector. If so, use it.
1018 if (ConstantDataSequential::isElementTypeCompatible(C->getType())) {
1019 // We speculatively build the elements here even if it turns out that there
1020 // is a constantexpr or something else weird in the array, since it is so
1021 // uncommon for that to happen.
1022 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
1023 if (CI->getType()->isIntegerTy(8)) {
1024 SmallVector<uint8_t, 16> Elts;
1025 for (unsigned i = 0, e = V.size(); i != e; ++i)
1026 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1027 Elts.push_back(CI->getZExtValue());
1030 if (Elts.size() == V.size())
1031 return ConstantDataVector::get(C->getContext(), Elts);
1032 } else if (CI->getType()->isIntegerTy(16)) {
1033 SmallVector<uint16_t, 16> Elts;
1034 for (unsigned i = 0, e = V.size(); i != e; ++i)
1035 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1036 Elts.push_back(CI->getZExtValue());
1039 if (Elts.size() == V.size())
1040 return ConstantDataVector::get(C->getContext(), Elts);
1041 } else if (CI->getType()->isIntegerTy(32)) {
1042 SmallVector<uint32_t, 16> Elts;
1043 for (unsigned i = 0, e = V.size(); i != e; ++i)
1044 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1045 Elts.push_back(CI->getZExtValue());
1048 if (Elts.size() == V.size())
1049 return ConstantDataVector::get(C->getContext(), Elts);
1050 } else if (CI->getType()->isIntegerTy(64)) {
1051 SmallVector<uint64_t, 16> Elts;
1052 for (unsigned i = 0, e = V.size(); i != e; ++i)
1053 if (ConstantInt *CI = dyn_cast<ConstantInt>(V[i]))
1054 Elts.push_back(CI->getZExtValue());
1057 if (Elts.size() == V.size())
1058 return ConstantDataVector::get(C->getContext(), Elts);
1062 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
1063 if (CFP->getType()->isFloatTy()) {
1064 SmallVector<float, 16> Elts;
1065 for (unsigned i = 0, e = V.size(); i != e; ++i)
1066 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
1067 Elts.push_back(CFP->getValueAPF().convertToFloat());
1070 if (Elts.size() == V.size())
1071 return ConstantDataVector::get(C->getContext(), Elts);
1072 } else if (CFP->getType()->isDoubleTy()) {
1073 SmallVector<double, 16> Elts;
1074 for (unsigned i = 0, e = V.size(); i != e; ++i)
1075 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V[i]))
1076 Elts.push_back(CFP->getValueAPF().convertToDouble());
1079 if (Elts.size() == V.size())
1080 return ConstantDataVector::get(C->getContext(), Elts);
1085 // Otherwise, the element type isn't compatible with ConstantDataVector, or
1086 // the operand list constants a ConstantExpr or something else strange.
1090 Constant *ConstantVector::getSplat(unsigned NumElts, Constant *V) {
1091 // If this splat is compatible with ConstantDataVector, use it instead of
1093 if ((isa<ConstantFP>(V) || isa<ConstantInt>(V)) &&
1094 ConstantDataSequential::isElementTypeCompatible(V->getType()))
1095 return ConstantDataVector::getSplat(NumElts, V);
1097 SmallVector<Constant*, 32> Elts(NumElts, V);
1102 // Utility function for determining if a ConstantExpr is a CastOp or not. This
1103 // can't be inline because we don't want to #include Instruction.h into
1105 bool ConstantExpr::isCast() const {
1106 return Instruction::isCast(getOpcode());
1109 bool ConstantExpr::isCompare() const {
1110 return getOpcode() == Instruction::ICmp || getOpcode() == Instruction::FCmp;
1113 bool ConstantExpr::isGEPWithNoNotionalOverIndexing() const {
1114 if (getOpcode() != Instruction::GetElementPtr) return false;
1116 gep_type_iterator GEPI = gep_type_begin(this), E = gep_type_end(this);
1117 User::const_op_iterator OI = std::next(this->op_begin());
1119 // Skip the first index, as it has no static limit.
1123 // The remaining indices must be compile-time known integers within the
1124 // bounds of the corresponding notional static array types.
1125 for (; GEPI != E; ++GEPI, ++OI) {
1126 ConstantInt *CI = dyn_cast<ConstantInt>(*OI);
1127 if (!CI) return false;
1128 if (ArrayType *ATy = dyn_cast<ArrayType>(*GEPI))
1129 if (CI->getValue().getActiveBits() > 64 ||
1130 CI->getZExtValue() >= ATy->getNumElements())
1134 // All the indices checked out.
1138 bool ConstantExpr::hasIndices() const {
1139 return getOpcode() == Instruction::ExtractValue ||
1140 getOpcode() == Instruction::InsertValue;
1143 ArrayRef<unsigned> ConstantExpr::getIndices() const {
1144 if (const ExtractValueConstantExpr *EVCE =
1145 dyn_cast<ExtractValueConstantExpr>(this))
1146 return EVCE->Indices;
1148 return cast<InsertValueConstantExpr>(this)->Indices;
1151 unsigned ConstantExpr::getPredicate() const {
1152 assert(isCompare());
1153 return ((const CompareConstantExpr*)this)->predicate;
1156 /// getWithOperandReplaced - Return a constant expression identical to this
1157 /// one, but with the specified operand set to the specified value.
1159 ConstantExpr::getWithOperandReplaced(unsigned OpNo, Constant *Op) const {
1160 assert(Op->getType() == getOperand(OpNo)->getType() &&
1161 "Replacing operand with value of different type!");
1162 if (getOperand(OpNo) == Op)
1163 return const_cast<ConstantExpr*>(this);
1165 SmallVector<Constant*, 8> NewOps;
1166 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
1167 NewOps.push_back(i == OpNo ? Op : getOperand(i));
1169 return getWithOperands(NewOps);
1172 /// getWithOperands - This returns the current constant expression with the
1173 /// operands replaced with the specified values. The specified array must
1174 /// have the same number of operands as our current one.
1175 Constant *ConstantExpr::getWithOperands(ArrayRef<Constant *> Ops, Type *Ty,
1176 bool OnlyIfReduced) const {
1177 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
1178 bool AnyChange = Ty != getType();
1179 for (unsigned i = 0; i != Ops.size(); ++i)
1180 AnyChange |= Ops[i] != getOperand(i);
1182 if (!AnyChange) // No operands changed, return self.
1183 return const_cast<ConstantExpr*>(this);
1185 Type *OnlyIfReducedTy = OnlyIfReduced ? Ty : nullptr;
1186 switch (getOpcode()) {
1187 case Instruction::Trunc:
1188 case Instruction::ZExt:
1189 case Instruction::SExt:
1190 case Instruction::FPTrunc:
1191 case Instruction::FPExt:
1192 case Instruction::UIToFP:
1193 case Instruction::SIToFP:
1194 case Instruction::FPToUI:
1195 case Instruction::FPToSI:
1196 case Instruction::PtrToInt:
1197 case Instruction::IntToPtr:
1198 case Instruction::BitCast:
1199 case Instruction::AddrSpaceCast:
1200 return ConstantExpr::getCast(getOpcode(), Ops[0], Ty, OnlyIfReduced);
1201 case Instruction::Select:
1202 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2], OnlyIfReducedTy);
1203 case Instruction::InsertElement:
1204 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2],
1206 case Instruction::ExtractElement:
1207 return ConstantExpr::getExtractElement(Ops[0], Ops[1], OnlyIfReducedTy);
1208 case Instruction::InsertValue:
1209 return ConstantExpr::getInsertValue(Ops[0], Ops[1], getIndices(),
1211 case Instruction::ExtractValue:
1212 return ConstantExpr::getExtractValue(Ops[0], getIndices(), OnlyIfReducedTy);
1213 case Instruction::ShuffleVector:
1214 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2],
1216 case Instruction::GetElementPtr:
1217 return ConstantExpr::getGetElementPtr(Ops[0], Ops.slice(1),
1218 cast<GEPOperator>(this)->isInBounds(),
1220 case Instruction::ICmp:
1221 case Instruction::FCmp:
1222 return ConstantExpr::getCompare(getPredicate(), Ops[0], Ops[1],
1225 assert(getNumOperands() == 2 && "Must be binary operator?");
1226 return ConstantExpr::get(getOpcode(), Ops[0], Ops[1], SubclassOptionalData,
1232 //===----------------------------------------------------------------------===//
1233 // isValueValidForType implementations
1235 bool ConstantInt::isValueValidForType(Type *Ty, uint64_t Val) {
1236 unsigned NumBits = Ty->getIntegerBitWidth(); // assert okay
1237 if (Ty->isIntegerTy(1))
1238 return Val == 0 || Val == 1;
1240 return true; // always true, has to fit in largest type
1241 uint64_t Max = (1ll << NumBits) - 1;
1245 bool ConstantInt::isValueValidForType(Type *Ty, int64_t Val) {
1246 unsigned NumBits = Ty->getIntegerBitWidth();
1247 if (Ty->isIntegerTy(1))
1248 return Val == 0 || Val == 1 || Val == -1;
1250 return true; // always true, has to fit in largest type
1251 int64_t Min = -(1ll << (NumBits-1));
1252 int64_t Max = (1ll << (NumBits-1)) - 1;
1253 return (Val >= Min && Val <= Max);
1256 bool ConstantFP::isValueValidForType(Type *Ty, const APFloat& Val) {
1257 // convert modifies in place, so make a copy.
1258 APFloat Val2 = APFloat(Val);
1260 switch (Ty->getTypeID()) {
1262 return false; // These can't be represented as floating point!
1264 // FIXME rounding mode needs to be more flexible
1265 case Type::HalfTyID: {
1266 if (&Val2.getSemantics() == &APFloat::IEEEhalf)
1268 Val2.convert(APFloat::IEEEhalf, APFloat::rmNearestTiesToEven, &losesInfo);
1271 case Type::FloatTyID: {
1272 if (&Val2.getSemantics() == &APFloat::IEEEsingle)
1274 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven, &losesInfo);
1277 case Type::DoubleTyID: {
1278 if (&Val2.getSemantics() == &APFloat::IEEEhalf ||
1279 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1280 &Val2.getSemantics() == &APFloat::IEEEdouble)
1282 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven, &losesInfo);
1285 case Type::X86_FP80TyID:
1286 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1287 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1288 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1289 &Val2.getSemantics() == &APFloat::x87DoubleExtended;
1290 case Type::FP128TyID:
1291 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1292 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1293 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1294 &Val2.getSemantics() == &APFloat::IEEEquad;
1295 case Type::PPC_FP128TyID:
1296 return &Val2.getSemantics() == &APFloat::IEEEhalf ||
1297 &Val2.getSemantics() == &APFloat::IEEEsingle ||
1298 &Val2.getSemantics() == &APFloat::IEEEdouble ||
1299 &Val2.getSemantics() == &APFloat::PPCDoubleDouble;
1304 //===----------------------------------------------------------------------===//
1305 // Factory Function Implementation
1307 ConstantAggregateZero *ConstantAggregateZero::get(Type *Ty) {
1308 assert((Ty->isStructTy() || Ty->isArrayTy() || Ty->isVectorTy()) &&
1309 "Cannot create an aggregate zero of non-aggregate type!");
1311 ConstantAggregateZero *&Entry = Ty->getContext().pImpl->CAZConstants[Ty];
1313 Entry = new ConstantAggregateZero(Ty);
1318 /// destroyConstant - Remove the constant from the constant table.
1320 void ConstantAggregateZero::destroyConstant() {
1321 getContext().pImpl->CAZConstants.erase(getType());
1322 destroyConstantImpl();
1325 /// destroyConstant - Remove the constant from the constant table...
1327 void ConstantArray::destroyConstant() {
1328 getType()->getContext().pImpl->ArrayConstants.remove(this);
1329 destroyConstantImpl();
1333 //---- ConstantStruct::get() implementation...
1336 // destroyConstant - Remove the constant from the constant table...
1338 void ConstantStruct::destroyConstant() {
1339 getType()->getContext().pImpl->StructConstants.remove(this);
1340 destroyConstantImpl();
1343 // destroyConstant - Remove the constant from the constant table...
1345 void ConstantVector::destroyConstant() {
1346 getType()->getContext().pImpl->VectorConstants.remove(this);
1347 destroyConstantImpl();
1350 /// getSplatValue - If this is a splat vector constant, meaning that all of
1351 /// the elements have the same value, return that value. Otherwise return 0.
1352 Constant *Constant::getSplatValue() const {
1353 assert(this->getType()->isVectorTy() && "Only valid for vectors!");
1354 if (isa<ConstantAggregateZero>(this))
1355 return getNullValue(this->getType()->getVectorElementType());
1356 if (const ConstantDataVector *CV = dyn_cast<ConstantDataVector>(this))
1357 return CV->getSplatValue();
1358 if (const ConstantVector *CV = dyn_cast<ConstantVector>(this))
1359 return CV->getSplatValue();
1363 /// getSplatValue - If this is a splat constant, where all of the
1364 /// elements have the same value, return that value. Otherwise return null.
1365 Constant *ConstantVector::getSplatValue() const {
1366 // Check out first element.
1367 Constant *Elt = getOperand(0);
1368 // Then make sure all remaining elements point to the same value.
1369 for (unsigned I = 1, E = getNumOperands(); I < E; ++I)
1370 if (getOperand(I) != Elt)
1375 /// If C is a constant integer then return its value, otherwise C must be a
1376 /// vector of constant integers, all equal, and the common value is returned.
1377 const APInt &Constant::getUniqueInteger() const {
1378 if (const ConstantInt *CI = dyn_cast<ConstantInt>(this))
1379 return CI->getValue();
1380 assert(this->getSplatValue() && "Doesn't contain a unique integer!");
1381 const Constant *C = this->getAggregateElement(0U);
1382 assert(C && isa<ConstantInt>(C) && "Not a vector of numbers!");
1383 return cast<ConstantInt>(C)->getValue();
1387 //---- ConstantPointerNull::get() implementation.
1390 ConstantPointerNull *ConstantPointerNull::get(PointerType *Ty) {
1391 ConstantPointerNull *&Entry = Ty->getContext().pImpl->CPNConstants[Ty];
1393 Entry = new ConstantPointerNull(Ty);
1398 // destroyConstant - Remove the constant from the constant table...
1400 void ConstantPointerNull::destroyConstant() {
1401 getContext().pImpl->CPNConstants.erase(getType());
1402 // Free the constant and any dangling references to it.
1403 destroyConstantImpl();
1407 //---- UndefValue::get() implementation.
1410 UndefValue *UndefValue::get(Type *Ty) {
1411 UndefValue *&Entry = Ty->getContext().pImpl->UVConstants[Ty];
1413 Entry = new UndefValue(Ty);
1418 // destroyConstant - Remove the constant from the constant table.
1420 void UndefValue::destroyConstant() {
1421 // Free the constant and any dangling references to it.
1422 getContext().pImpl->UVConstants.erase(getType());
1423 destroyConstantImpl();
1426 //---- BlockAddress::get() implementation.
1429 BlockAddress *BlockAddress::get(BasicBlock *BB) {
1430 assert(BB->getParent() && "Block must have a parent");
1431 return get(BB->getParent(), BB);
1434 BlockAddress *BlockAddress::get(Function *F, BasicBlock *BB) {
1436 F->getContext().pImpl->BlockAddresses[std::make_pair(F, BB)];
1438 BA = new BlockAddress(F, BB);
1440 assert(BA->getFunction() == F && "Basic block moved between functions");
1444 BlockAddress::BlockAddress(Function *F, BasicBlock *BB)
1445 : Constant(Type::getInt8PtrTy(F->getContext()), Value::BlockAddressVal,
1449 BB->AdjustBlockAddressRefCount(1);
1452 BlockAddress *BlockAddress::lookup(const BasicBlock *BB) {
1453 if (!BB->hasAddressTaken())
1456 const Function *F = BB->getParent();
1457 assert(F && "Block must have a parent");
1459 F->getContext().pImpl->BlockAddresses.lookup(std::make_pair(F, BB));
1460 assert(BA && "Refcount and block address map disagree!");
1464 // destroyConstant - Remove the constant from the constant table.
1466 void BlockAddress::destroyConstant() {
1467 getFunction()->getType()->getContext().pImpl
1468 ->BlockAddresses.erase(std::make_pair(getFunction(), getBasicBlock()));
1469 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1470 destroyConstantImpl();
1473 void BlockAddress::replaceUsesOfWithOnConstant(Value *From, Value *To, Use *U) {
1474 // This could be replacing either the Basic Block or the Function. In either
1475 // case, we have to remove the map entry.
1476 Function *NewF = getFunction();
1477 BasicBlock *NewBB = getBasicBlock();
1480 NewF = cast<Function>(To->stripPointerCasts());
1482 NewBB = cast<BasicBlock>(To);
1484 // See if the 'new' entry already exists, if not, just update this in place
1485 // and return early.
1486 BlockAddress *&NewBA =
1487 getContext().pImpl->BlockAddresses[std::make_pair(NewF, NewBB)];
1489 replaceUsesOfWithOnConstantImpl(NewBA);
1493 getBasicBlock()->AdjustBlockAddressRefCount(-1);
1495 // Remove the old entry, this can't cause the map to rehash (just a
1496 // tombstone will get added).
1497 getContext().pImpl->BlockAddresses.erase(std::make_pair(getFunction(),
1500 setOperand(0, NewF);
1501 setOperand(1, NewBB);
1502 getBasicBlock()->AdjustBlockAddressRefCount(1);
1505 //---- ConstantExpr::get() implementations.
1508 /// This is a utility function to handle folding of casts and lookup of the
1509 /// cast in the ExprConstants map. It is used by the various get* methods below.
1510 static Constant *getFoldedCast(Instruction::CastOps opc, Constant *C, Type *Ty,
1511 bool OnlyIfReduced = false) {
1512 assert(Ty->isFirstClassType() && "Cannot cast to an aggregate type!");
1513 // Fold a few common cases
1514 if (Constant *FC = ConstantFoldCastInstruction(opc, C, Ty))
1520 LLVMContextImpl *pImpl = Ty->getContext().pImpl;
1522 // Look up the constant in the table first to ensure uniqueness.
1523 ConstantExprKeyType Key(opc, C);
1525 return pImpl->ExprConstants.getOrCreate(Ty, Key);
1528 Constant *ConstantExpr::getCast(unsigned oc, Constant *C, Type *Ty,
1529 bool OnlyIfReduced) {
1530 Instruction::CastOps opc = Instruction::CastOps(oc);
1531 assert(Instruction::isCast(opc) && "opcode out of range");
1532 assert(C && Ty && "Null arguments to getCast");
1533 assert(CastInst::castIsValid(opc, C, Ty) && "Invalid constantexpr cast!");
1537 llvm_unreachable("Invalid cast opcode");
1538 case Instruction::Trunc:
1539 return getTrunc(C, Ty, OnlyIfReduced);
1540 case Instruction::ZExt:
1541 return getZExt(C, Ty, OnlyIfReduced);
1542 case Instruction::SExt:
1543 return getSExt(C, Ty, OnlyIfReduced);
1544 case Instruction::FPTrunc:
1545 return getFPTrunc(C, Ty, OnlyIfReduced);
1546 case Instruction::FPExt:
1547 return getFPExtend(C, Ty, OnlyIfReduced);
1548 case Instruction::UIToFP:
1549 return getUIToFP(C, Ty, OnlyIfReduced);
1550 case Instruction::SIToFP:
1551 return getSIToFP(C, Ty, OnlyIfReduced);
1552 case Instruction::FPToUI:
1553 return getFPToUI(C, Ty, OnlyIfReduced);
1554 case Instruction::FPToSI:
1555 return getFPToSI(C, Ty, OnlyIfReduced);
1556 case Instruction::PtrToInt:
1557 return getPtrToInt(C, Ty, OnlyIfReduced);
1558 case Instruction::IntToPtr:
1559 return getIntToPtr(C, Ty, OnlyIfReduced);
1560 case Instruction::BitCast:
1561 return getBitCast(C, Ty, OnlyIfReduced);
1562 case Instruction::AddrSpaceCast:
1563 return getAddrSpaceCast(C, Ty, OnlyIfReduced);
1567 Constant *ConstantExpr::getZExtOrBitCast(Constant *C, Type *Ty) {
1568 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1569 return getBitCast(C, Ty);
1570 return getZExt(C, Ty);
1573 Constant *ConstantExpr::getSExtOrBitCast(Constant *C, Type *Ty) {
1574 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1575 return getBitCast(C, Ty);
1576 return getSExt(C, Ty);
1579 Constant *ConstantExpr::getTruncOrBitCast(Constant *C, Type *Ty) {
1580 if (C->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
1581 return getBitCast(C, Ty);
1582 return getTrunc(C, Ty);
1585 Constant *ConstantExpr::getPointerCast(Constant *S, Type *Ty) {
1586 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
1587 assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&
1590 if (Ty->isIntOrIntVectorTy())
1591 return getPtrToInt(S, Ty);
1593 unsigned SrcAS = S->getType()->getPointerAddressSpace();
1594 if (Ty->isPtrOrPtrVectorTy() && SrcAS != Ty->getPointerAddressSpace())
1595 return getAddrSpaceCast(S, Ty);
1597 return getBitCast(S, Ty);
1600 Constant *ConstantExpr::getPointerBitCastOrAddrSpaceCast(Constant *S,
1602 assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast");
1603 assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast");
1605 if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
1606 return getAddrSpaceCast(S, Ty);
1608 return getBitCast(S, Ty);
1611 Constant *ConstantExpr::getIntegerCast(Constant *C, Type *Ty,
1613 assert(C->getType()->isIntOrIntVectorTy() &&
1614 Ty->isIntOrIntVectorTy() && "Invalid cast");
1615 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1616 unsigned DstBits = Ty->getScalarSizeInBits();
1617 Instruction::CastOps opcode =
1618 (SrcBits == DstBits ? Instruction::BitCast :
1619 (SrcBits > DstBits ? Instruction::Trunc :
1620 (isSigned ? Instruction::SExt : Instruction::ZExt)));
1621 return getCast(opcode, C, Ty);
1624 Constant *ConstantExpr::getFPCast(Constant *C, Type *Ty) {
1625 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1627 unsigned SrcBits = C->getType()->getScalarSizeInBits();
1628 unsigned DstBits = Ty->getScalarSizeInBits();
1629 if (SrcBits == DstBits)
1630 return C; // Avoid a useless cast
1631 Instruction::CastOps opcode =
1632 (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt);
1633 return getCast(opcode, C, Ty);
1636 Constant *ConstantExpr::getTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) {
1638 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1639 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1641 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1642 assert(C->getType()->isIntOrIntVectorTy() && "Trunc operand must be integer");
1643 assert(Ty->isIntOrIntVectorTy() && "Trunc produces only integral");
1644 assert(C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1645 "SrcTy must be larger than DestTy for Trunc!");
1647 return getFoldedCast(Instruction::Trunc, C, Ty, OnlyIfReduced);
1650 Constant *ConstantExpr::getSExt(Constant *C, Type *Ty, bool OnlyIfReduced) {
1652 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1653 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1655 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1656 assert(C->getType()->isIntOrIntVectorTy() && "SExt operand must be integral");
1657 assert(Ty->isIntOrIntVectorTy() && "SExt produces only integer");
1658 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1659 "SrcTy must be smaller than DestTy for SExt!");
1661 return getFoldedCast(Instruction::SExt, C, Ty, OnlyIfReduced);
1664 Constant *ConstantExpr::getZExt(Constant *C, Type *Ty, bool OnlyIfReduced) {
1666 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1667 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1669 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1670 assert(C->getType()->isIntOrIntVectorTy() && "ZEXt operand must be integral");
1671 assert(Ty->isIntOrIntVectorTy() && "ZExt produces only integer");
1672 assert(C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1673 "SrcTy must be smaller than DestTy for ZExt!");
1675 return getFoldedCast(Instruction::ZExt, C, Ty, OnlyIfReduced);
1678 Constant *ConstantExpr::getFPTrunc(Constant *C, Type *Ty, bool OnlyIfReduced) {
1680 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1681 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1683 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1684 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1685 C->getType()->getScalarSizeInBits() > Ty->getScalarSizeInBits()&&
1686 "This is an illegal floating point truncation!");
1687 return getFoldedCast(Instruction::FPTrunc, C, Ty, OnlyIfReduced);
1690 Constant *ConstantExpr::getFPExtend(Constant *C, Type *Ty, bool OnlyIfReduced) {
1692 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1693 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1695 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1696 assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&
1697 C->getType()->getScalarSizeInBits() < Ty->getScalarSizeInBits()&&
1698 "This is an illegal floating point extension!");
1699 return getFoldedCast(Instruction::FPExt, C, Ty, OnlyIfReduced);
1702 Constant *ConstantExpr::getUIToFP(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() && Ty->isFPOrFPVectorTy() &&
1709 "This is an illegal uint to floating point cast!");
1710 return getFoldedCast(Instruction::UIToFP, C, Ty, OnlyIfReduced);
1713 Constant *ConstantExpr::getSIToFP(Constant *C, Type *Ty, bool OnlyIfReduced) {
1715 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1716 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1718 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1719 assert(C->getType()->isIntOrIntVectorTy() && Ty->isFPOrFPVectorTy() &&
1720 "This is an illegal sint to floating point cast!");
1721 return getFoldedCast(Instruction::SIToFP, C, Ty, OnlyIfReduced);
1724 Constant *ConstantExpr::getFPToUI(Constant *C, Type *Ty, bool OnlyIfReduced) {
1726 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1727 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1729 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1730 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1731 "This is an illegal floating point to uint cast!");
1732 return getFoldedCast(Instruction::FPToUI, C, Ty, OnlyIfReduced);
1735 Constant *ConstantExpr::getFPToSI(Constant *C, Type *Ty, bool OnlyIfReduced) {
1737 bool fromVec = C->getType()->getTypeID() == Type::VectorTyID;
1738 bool toVec = Ty->getTypeID() == Type::VectorTyID;
1740 assert((fromVec == toVec) && "Cannot convert from scalar to/from vector");
1741 assert(C->getType()->isFPOrFPVectorTy() && Ty->isIntOrIntVectorTy() &&
1742 "This is an illegal floating point to sint cast!");
1743 return getFoldedCast(Instruction::FPToSI, C, Ty, OnlyIfReduced);
1746 Constant *ConstantExpr::getPtrToInt(Constant *C, Type *DstTy,
1747 bool OnlyIfReduced) {
1748 assert(C->getType()->getScalarType()->isPointerTy() &&
1749 "PtrToInt source must be pointer or pointer vector");
1750 assert(DstTy->getScalarType()->isIntegerTy() &&
1751 "PtrToInt destination must be integer or integer vector");
1752 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy));
1753 if (isa<VectorType>(C->getType()))
1754 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&&
1755 "Invalid cast between a different number of vector elements");
1756 return getFoldedCast(Instruction::PtrToInt, C, DstTy, OnlyIfReduced);
1759 Constant *ConstantExpr::getIntToPtr(Constant *C, Type *DstTy,
1760 bool OnlyIfReduced) {
1761 assert(C->getType()->getScalarType()->isIntegerTy() &&
1762 "IntToPtr source must be integer or integer vector");
1763 assert(DstTy->getScalarType()->isPointerTy() &&
1764 "IntToPtr destination must be a pointer or pointer vector");
1765 assert(isa<VectorType>(C->getType()) == isa<VectorType>(DstTy));
1766 if (isa<VectorType>(C->getType()))
1767 assert(C->getType()->getVectorNumElements()==DstTy->getVectorNumElements()&&
1768 "Invalid cast between a different number of vector elements");
1769 return getFoldedCast(Instruction::IntToPtr, C, DstTy, OnlyIfReduced);
1772 Constant *ConstantExpr::getBitCast(Constant *C, Type *DstTy,
1773 bool OnlyIfReduced) {
1774 assert(CastInst::castIsValid(Instruction::BitCast, C, DstTy) &&
1775 "Invalid constantexpr bitcast!");
1777 // It is common to ask for a bitcast of a value to its own type, handle this
1779 if (C->getType() == DstTy) return C;
1781 return getFoldedCast(Instruction::BitCast, C, DstTy, OnlyIfReduced);
1784 Constant *ConstantExpr::getAddrSpaceCast(Constant *C, Type *DstTy,
1785 bool OnlyIfReduced) {
1786 assert(CastInst::castIsValid(Instruction::AddrSpaceCast, C, DstTy) &&
1787 "Invalid constantexpr addrspacecast!");
1789 // Canonicalize addrspacecasts between different pointer types by first
1790 // bitcasting the pointer type and then converting the address space.
1791 PointerType *SrcScalarTy = cast<PointerType>(C->getType()->getScalarType());
1792 PointerType *DstScalarTy = cast<PointerType>(DstTy->getScalarType());
1793 Type *DstElemTy = DstScalarTy->getElementType();
1794 if (SrcScalarTy->getElementType() != DstElemTy) {
1795 Type *MidTy = PointerType::get(DstElemTy, SrcScalarTy->getAddressSpace());
1796 if (VectorType *VT = dyn_cast<VectorType>(DstTy)) {
1797 // Handle vectors of pointers.
1798 MidTy = VectorType::get(MidTy, VT->getNumElements());
1800 C = getBitCast(C, MidTy);
1802 return getFoldedCast(Instruction::AddrSpaceCast, C, DstTy, OnlyIfReduced);
1805 Constant *ConstantExpr::get(unsigned Opcode, Constant *C1, Constant *C2,
1806 unsigned Flags, Type *OnlyIfReducedTy) {
1807 // Check the operands for consistency first.
1808 assert(Opcode >= Instruction::BinaryOpsBegin &&
1809 Opcode < Instruction::BinaryOpsEnd &&
1810 "Invalid opcode in binary constant expression");
1811 assert(C1->getType() == C2->getType() &&
1812 "Operand types in binary constant expression should match");
1816 case Instruction::Add:
1817 case Instruction::Sub:
1818 case Instruction::Mul:
1819 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1820 assert(C1->getType()->isIntOrIntVectorTy() &&
1821 "Tried to create an integer operation on a non-integer type!");
1823 case Instruction::FAdd:
1824 case Instruction::FSub:
1825 case Instruction::FMul:
1826 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1827 assert(C1->getType()->isFPOrFPVectorTy() &&
1828 "Tried to create a floating-point operation on a "
1829 "non-floating-point type!");
1831 case Instruction::UDiv:
1832 case Instruction::SDiv:
1833 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1834 assert(C1->getType()->isIntOrIntVectorTy() &&
1835 "Tried to create an arithmetic operation on a non-arithmetic type!");
1837 case Instruction::FDiv:
1838 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1839 assert(C1->getType()->isFPOrFPVectorTy() &&
1840 "Tried to create an arithmetic operation on a non-arithmetic type!");
1842 case Instruction::URem:
1843 case Instruction::SRem:
1844 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1845 assert(C1->getType()->isIntOrIntVectorTy() &&
1846 "Tried to create an arithmetic operation on a non-arithmetic type!");
1848 case Instruction::FRem:
1849 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1850 assert(C1->getType()->isFPOrFPVectorTy() &&
1851 "Tried to create an arithmetic operation on a non-arithmetic type!");
1853 case Instruction::And:
1854 case Instruction::Or:
1855 case Instruction::Xor:
1856 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1857 assert(C1->getType()->isIntOrIntVectorTy() &&
1858 "Tried to create a logical operation on a non-integral type!");
1860 case Instruction::Shl:
1861 case Instruction::LShr:
1862 case Instruction::AShr:
1863 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1864 assert(C1->getType()->isIntOrIntVectorTy() &&
1865 "Tried to create a shift operation on a non-integer type!");
1872 if (Constant *FC = ConstantFoldBinaryInstruction(Opcode, C1, C2))
1873 return FC; // Fold a few common cases.
1875 if (OnlyIfReducedTy == C1->getType())
1878 Constant *ArgVec[] = { C1, C2 };
1879 ConstantExprKeyType Key(Opcode, ArgVec, 0, Flags);
1881 LLVMContextImpl *pImpl = C1->getContext().pImpl;
1882 return pImpl->ExprConstants.getOrCreate(C1->getType(), Key);
1885 Constant *ConstantExpr::getSizeOf(Type* Ty) {
1886 // sizeof is implemented as: (i64) gep (Ty*)null, 1
1887 // Note that a non-inbounds gep is used, as null isn't within any object.
1888 Constant *GEPIdx = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1889 Constant *GEP = getGetElementPtr(
1890 Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1891 return getPtrToInt(GEP,
1892 Type::getInt64Ty(Ty->getContext()));
1895 Constant *ConstantExpr::getAlignOf(Type* Ty) {
1896 // alignof is implemented as: (i64) gep ({i1,Ty}*)null, 0, 1
1897 // Note that a non-inbounds gep is used, as null isn't within any object.
1899 StructType::get(Type::getInt1Ty(Ty->getContext()), Ty, NULL);
1900 Constant *NullPtr = Constant::getNullValue(AligningTy->getPointerTo(0));
1901 Constant *Zero = ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0);
1902 Constant *One = ConstantInt::get(Type::getInt32Ty(Ty->getContext()), 1);
1903 Constant *Indices[2] = { Zero, One };
1904 Constant *GEP = getGetElementPtr(NullPtr, Indices);
1905 return getPtrToInt(GEP,
1906 Type::getInt64Ty(Ty->getContext()));
1909 Constant *ConstantExpr::getOffsetOf(StructType* STy, unsigned FieldNo) {
1910 return getOffsetOf(STy, ConstantInt::get(Type::getInt32Ty(STy->getContext()),
1914 Constant *ConstantExpr::getOffsetOf(Type* Ty, Constant *FieldNo) {
1915 // offsetof is implemented as: (i64) gep (Ty*)null, 0, FieldNo
1916 // Note that a non-inbounds gep is used, as null isn't within any object.
1917 Constant *GEPIdx[] = {
1918 ConstantInt::get(Type::getInt64Ty(Ty->getContext()), 0),
1921 Constant *GEP = getGetElementPtr(
1922 Constant::getNullValue(PointerType::getUnqual(Ty)), GEPIdx);
1923 return getPtrToInt(GEP,
1924 Type::getInt64Ty(Ty->getContext()));
1927 Constant *ConstantExpr::getCompare(unsigned short Predicate, Constant *C1,
1928 Constant *C2, bool OnlyIfReduced) {
1929 assert(C1->getType() == C2->getType() && "Op types should be identical!");
1931 switch (Predicate) {
1932 default: llvm_unreachable("Invalid CmpInst predicate");
1933 case CmpInst::FCMP_FALSE: case CmpInst::FCMP_OEQ: case CmpInst::FCMP_OGT:
1934 case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLT: case CmpInst::FCMP_OLE:
1935 case CmpInst::FCMP_ONE: case CmpInst::FCMP_ORD: case CmpInst::FCMP_UNO:
1936 case CmpInst::FCMP_UEQ: case CmpInst::FCMP_UGT: case CmpInst::FCMP_UGE:
1937 case CmpInst::FCMP_ULT: case CmpInst::FCMP_ULE: case CmpInst::FCMP_UNE:
1938 case CmpInst::FCMP_TRUE:
1939 return getFCmp(Predicate, C1, C2, OnlyIfReduced);
1941 case CmpInst::ICMP_EQ: case CmpInst::ICMP_NE: case CmpInst::ICMP_UGT:
1942 case CmpInst::ICMP_UGE: case CmpInst::ICMP_ULT: case CmpInst::ICMP_ULE:
1943 case CmpInst::ICMP_SGT: case CmpInst::ICMP_SGE: case CmpInst::ICMP_SLT:
1944 case CmpInst::ICMP_SLE:
1945 return getICmp(Predicate, C1, C2, OnlyIfReduced);
1949 Constant *ConstantExpr::getSelect(Constant *C, Constant *V1, Constant *V2,
1950 Type *OnlyIfReducedTy) {
1951 assert(!SelectInst::areInvalidOperands(C, V1, V2)&&"Invalid select operands");
1953 if (Constant *SC = ConstantFoldSelectInstruction(C, V1, V2))
1954 return SC; // Fold common cases
1956 if (OnlyIfReducedTy == V1->getType())
1959 Constant *ArgVec[] = { C, V1, V2 };
1960 ConstantExprKeyType Key(Instruction::Select, ArgVec);
1962 LLVMContextImpl *pImpl = C->getContext().pImpl;
1963 return pImpl->ExprConstants.getOrCreate(V1->getType(), Key);
1966 Constant *ConstantExpr::getGetElementPtr(Constant *C, ArrayRef<Value *> Idxs,
1967 bool InBounds, Type *OnlyIfReducedTy) {
1968 assert(C->getType()->isPtrOrPtrVectorTy() &&
1969 "Non-pointer type for constant GetElementPtr expression");
1971 if (Constant *FC = ConstantFoldGetElementPtr(C, InBounds, Idxs))
1972 return FC; // Fold a few common cases.
1974 // Get the result type of the getelementptr!
1975 Type *Ty = GetElementPtrInst::getIndexedType(C->getType(), Idxs);
1976 assert(Ty && "GEP indices invalid!");
1977 unsigned AS = C->getType()->getPointerAddressSpace();
1978 Type *ReqTy = Ty->getPointerTo(AS);
1979 if (VectorType *VecTy = dyn_cast<VectorType>(C->getType()))
1980 ReqTy = VectorType::get(ReqTy, VecTy->getNumElements());
1982 if (OnlyIfReducedTy == ReqTy)
1985 // Look up the constant in the table first to ensure uniqueness
1986 std::vector<Constant*> ArgVec;
1987 ArgVec.reserve(1 + Idxs.size());
1988 ArgVec.push_back(C);
1989 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
1990 assert(Idxs[i]->getType()->isVectorTy() == ReqTy->isVectorTy() &&
1991 "getelementptr index type missmatch");
1992 assert((!Idxs[i]->getType()->isVectorTy() ||
1993 ReqTy->getVectorNumElements() ==
1994 Idxs[i]->getType()->getVectorNumElements()) &&
1995 "getelementptr index type missmatch");
1996 ArgVec.push_back(cast<Constant>(Idxs[i]));
1998 const ConstantExprKeyType Key(Instruction::GetElementPtr, ArgVec, 0,
1999 InBounds ? GEPOperator::IsInBounds : 0);
2001 LLVMContextImpl *pImpl = C->getContext().pImpl;
2002 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2005 Constant *ConstantExpr::getICmp(unsigned short pred, Constant *LHS,
2006 Constant *RHS, bool OnlyIfReduced) {
2007 assert(LHS->getType() == RHS->getType());
2008 assert(pred >= ICmpInst::FIRST_ICMP_PREDICATE &&
2009 pred <= ICmpInst::LAST_ICMP_PREDICATE && "Invalid ICmp Predicate");
2011 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2012 return FC; // Fold a few common cases...
2017 // Look up the constant in the table first to ensure uniqueness
2018 Constant *ArgVec[] = { LHS, RHS };
2019 // Get the key type with both the opcode and predicate
2020 const ConstantExprKeyType Key(Instruction::ICmp, ArgVec, pred);
2022 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
2023 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
2024 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
2026 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
2027 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
2030 Constant *ConstantExpr::getFCmp(unsigned short pred, Constant *LHS,
2031 Constant *RHS, bool OnlyIfReduced) {
2032 assert(LHS->getType() == RHS->getType());
2033 assert(pred <= FCmpInst::LAST_FCMP_PREDICATE && "Invalid FCmp Predicate");
2035 if (Constant *FC = ConstantFoldCompareInstruction(pred, LHS, RHS))
2036 return FC; // Fold a few common cases...
2041 // Look up the constant in the table first to ensure uniqueness
2042 Constant *ArgVec[] = { LHS, RHS };
2043 // Get the key type with both the opcode and predicate
2044 const ConstantExprKeyType Key(Instruction::FCmp, ArgVec, pred);
2046 Type *ResultTy = Type::getInt1Ty(LHS->getContext());
2047 if (VectorType *VT = dyn_cast<VectorType>(LHS->getType()))
2048 ResultTy = VectorType::get(ResultTy, VT->getNumElements());
2050 LLVMContextImpl *pImpl = LHS->getType()->getContext().pImpl;
2051 return pImpl->ExprConstants.getOrCreate(ResultTy, Key);
2054 Constant *ConstantExpr::getExtractElement(Constant *Val, Constant *Idx,
2055 Type *OnlyIfReducedTy) {
2056 assert(Val->getType()->isVectorTy() &&
2057 "Tried to create extractelement operation on non-vector type!");
2058 assert(Idx->getType()->isIntegerTy() &&
2059 "Extractelement index must be an integer type!");
2061 if (Constant *FC = ConstantFoldExtractElementInstruction(Val, Idx))
2062 return FC; // Fold a few common cases.
2064 Type *ReqTy = Val->getType()->getVectorElementType();
2065 if (OnlyIfReducedTy == ReqTy)
2068 // Look up the constant in the table first to ensure uniqueness
2069 Constant *ArgVec[] = { Val, Idx };
2070 const ConstantExprKeyType Key(Instruction::ExtractElement, ArgVec);
2072 LLVMContextImpl *pImpl = Val->getContext().pImpl;
2073 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2076 Constant *ConstantExpr::getInsertElement(Constant *Val, Constant *Elt,
2077 Constant *Idx, Type *OnlyIfReducedTy) {
2078 assert(Val->getType()->isVectorTy() &&
2079 "Tried to create insertelement operation on non-vector type!");
2080 assert(Elt->getType() == Val->getType()->getVectorElementType() &&
2081 "Insertelement types must match!");
2082 assert(Idx->getType()->isIntegerTy() &&
2083 "Insertelement index must be i32 type!");
2085 if (Constant *FC = ConstantFoldInsertElementInstruction(Val, Elt, Idx))
2086 return FC; // Fold a few common cases.
2088 if (OnlyIfReducedTy == Val->getType())
2091 // Look up the constant in the table first to ensure uniqueness
2092 Constant *ArgVec[] = { Val, Elt, Idx };
2093 const ConstantExprKeyType Key(Instruction::InsertElement, ArgVec);
2095 LLVMContextImpl *pImpl = Val->getContext().pImpl;
2096 return pImpl->ExprConstants.getOrCreate(Val->getType(), Key);
2099 Constant *ConstantExpr::getShuffleVector(Constant *V1, Constant *V2,
2100 Constant *Mask, Type *OnlyIfReducedTy) {
2101 assert(ShuffleVectorInst::isValidOperands(V1, V2, Mask) &&
2102 "Invalid shuffle vector constant expr operands!");
2104 if (Constant *FC = ConstantFoldShuffleVectorInstruction(V1, V2, Mask))
2105 return FC; // Fold a few common cases.
2107 unsigned NElts = Mask->getType()->getVectorNumElements();
2108 Type *EltTy = V1->getType()->getVectorElementType();
2109 Type *ShufTy = VectorType::get(EltTy, NElts);
2111 if (OnlyIfReducedTy == ShufTy)
2114 // Look up the constant in the table first to ensure uniqueness
2115 Constant *ArgVec[] = { V1, V2, Mask };
2116 const ConstantExprKeyType Key(Instruction::ShuffleVector, ArgVec);
2118 LLVMContextImpl *pImpl = ShufTy->getContext().pImpl;
2119 return pImpl->ExprConstants.getOrCreate(ShufTy, Key);
2122 Constant *ConstantExpr::getInsertValue(Constant *Agg, Constant *Val,
2123 ArrayRef<unsigned> Idxs,
2124 Type *OnlyIfReducedTy) {
2125 assert(Agg->getType()->isFirstClassType() &&
2126 "Non-first-class type for constant insertvalue expression");
2128 assert(ExtractValueInst::getIndexedType(Agg->getType(),
2129 Idxs) == Val->getType() &&
2130 "insertvalue indices invalid!");
2131 Type *ReqTy = Val->getType();
2133 if (Constant *FC = ConstantFoldInsertValueInstruction(Agg, Val, Idxs))
2136 if (OnlyIfReducedTy == ReqTy)
2139 Constant *ArgVec[] = { Agg, Val };
2140 const ConstantExprKeyType Key(Instruction::InsertValue, ArgVec, 0, 0, Idxs);
2142 LLVMContextImpl *pImpl = Agg->getContext().pImpl;
2143 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2146 Constant *ConstantExpr::getExtractValue(Constant *Agg, ArrayRef<unsigned> Idxs,
2147 Type *OnlyIfReducedTy) {
2148 assert(Agg->getType()->isFirstClassType() &&
2149 "Tried to create extractelement operation on non-first-class type!");
2151 Type *ReqTy = ExtractValueInst::getIndexedType(Agg->getType(), Idxs);
2153 assert(ReqTy && "extractvalue indices invalid!");
2155 assert(Agg->getType()->isFirstClassType() &&
2156 "Non-first-class type for constant extractvalue expression");
2157 if (Constant *FC = ConstantFoldExtractValueInstruction(Agg, Idxs))
2160 if (OnlyIfReducedTy == ReqTy)
2163 Constant *ArgVec[] = { Agg };
2164 const ConstantExprKeyType Key(Instruction::ExtractValue, ArgVec, 0, 0, Idxs);
2166 LLVMContextImpl *pImpl = Agg->getContext().pImpl;
2167 return pImpl->ExprConstants.getOrCreate(ReqTy, Key);
2170 Constant *ConstantExpr::getNeg(Constant *C, bool HasNUW, bool HasNSW) {
2171 assert(C->getType()->isIntOrIntVectorTy() &&
2172 "Cannot NEG a nonintegral value!");
2173 return getSub(ConstantFP::getZeroValueForNegation(C->getType()),
2177 Constant *ConstantExpr::getFNeg(Constant *C) {
2178 assert(C->getType()->isFPOrFPVectorTy() &&
2179 "Cannot FNEG a non-floating-point value!");
2180 return getFSub(ConstantFP::getZeroValueForNegation(C->getType()), C);
2183 Constant *ConstantExpr::getNot(Constant *C) {
2184 assert(C->getType()->isIntOrIntVectorTy() &&
2185 "Cannot NOT a nonintegral value!");
2186 return get(Instruction::Xor, C, Constant::getAllOnesValue(C->getType()));
2189 Constant *ConstantExpr::getAdd(Constant *C1, Constant *C2,
2190 bool HasNUW, bool HasNSW) {
2191 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2192 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2193 return get(Instruction::Add, C1, C2, Flags);
2196 Constant *ConstantExpr::getFAdd(Constant *C1, Constant *C2) {
2197 return get(Instruction::FAdd, C1, C2);
2200 Constant *ConstantExpr::getSub(Constant *C1, Constant *C2,
2201 bool HasNUW, bool HasNSW) {
2202 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2203 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2204 return get(Instruction::Sub, C1, C2, Flags);
2207 Constant *ConstantExpr::getFSub(Constant *C1, Constant *C2) {
2208 return get(Instruction::FSub, C1, C2);
2211 Constant *ConstantExpr::getMul(Constant *C1, Constant *C2,
2212 bool HasNUW, bool HasNSW) {
2213 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2214 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2215 return get(Instruction::Mul, C1, C2, Flags);
2218 Constant *ConstantExpr::getFMul(Constant *C1, Constant *C2) {
2219 return get(Instruction::FMul, C1, C2);
2222 Constant *ConstantExpr::getUDiv(Constant *C1, Constant *C2, bool isExact) {
2223 return get(Instruction::UDiv, C1, C2,
2224 isExact ? PossiblyExactOperator::IsExact : 0);
2227 Constant *ConstantExpr::getSDiv(Constant *C1, Constant *C2, bool isExact) {
2228 return get(Instruction::SDiv, C1, C2,
2229 isExact ? PossiblyExactOperator::IsExact : 0);
2232 Constant *ConstantExpr::getFDiv(Constant *C1, Constant *C2) {
2233 return get(Instruction::FDiv, C1, C2);
2236 Constant *ConstantExpr::getURem(Constant *C1, Constant *C2) {
2237 return get(Instruction::URem, C1, C2);
2240 Constant *ConstantExpr::getSRem(Constant *C1, Constant *C2) {
2241 return get(Instruction::SRem, C1, C2);
2244 Constant *ConstantExpr::getFRem(Constant *C1, Constant *C2) {
2245 return get(Instruction::FRem, C1, C2);
2248 Constant *ConstantExpr::getAnd(Constant *C1, Constant *C2) {
2249 return get(Instruction::And, C1, C2);
2252 Constant *ConstantExpr::getOr(Constant *C1, Constant *C2) {
2253 return get(Instruction::Or, C1, C2);
2256 Constant *ConstantExpr::getXor(Constant *C1, Constant *C2) {
2257 return get(Instruction::Xor, C1, C2);
2260 Constant *ConstantExpr::getShl(Constant *C1, Constant *C2,
2261 bool HasNUW, bool HasNSW) {
2262 unsigned Flags = (HasNUW ? OverflowingBinaryOperator::NoUnsignedWrap : 0) |
2263 (HasNSW ? OverflowingBinaryOperator::NoSignedWrap : 0);
2264 return get(Instruction::Shl, C1, C2, Flags);
2267 Constant *ConstantExpr::getLShr(Constant *C1, Constant *C2, bool isExact) {
2268 return get(Instruction::LShr, C1, C2,
2269 isExact ? PossiblyExactOperator::IsExact : 0);
2272 Constant *ConstantExpr::getAShr(Constant *C1, Constant *C2, bool isExact) {
2273 return get(Instruction::AShr, C1, C2,
2274 isExact ? PossiblyExactOperator::IsExact : 0);
2277 /// getBinOpIdentity - Return the identity for the given binary operation,
2278 /// i.e. a constant C such that X op C = X and C op X = X for every X. It
2279 /// returns null if the operator doesn't have an identity.
2280 Constant *ConstantExpr::getBinOpIdentity(unsigned Opcode, Type *Ty) {
2283 // Doesn't have an identity.
2286 case Instruction::Add:
2287 case Instruction::Or:
2288 case Instruction::Xor:
2289 return Constant::getNullValue(Ty);
2291 case Instruction::Mul:
2292 return ConstantInt::get(Ty, 1);
2294 case Instruction::And:
2295 return Constant::getAllOnesValue(Ty);
2299 /// getBinOpAbsorber - Return the absorbing element for the given binary
2300 /// operation, i.e. a constant C such that X op C = C and C op X = C for
2301 /// every X. For example, this returns zero for integer multiplication.
2302 /// It returns null if the operator doesn't have an absorbing element.
2303 Constant *ConstantExpr::getBinOpAbsorber(unsigned Opcode, Type *Ty) {
2306 // Doesn't have an absorber.
2309 case Instruction::Or:
2310 return Constant::getAllOnesValue(Ty);
2312 case Instruction::And:
2313 case Instruction::Mul:
2314 return Constant::getNullValue(Ty);
2318 // destroyConstant - Remove the constant from the constant table...
2320 void ConstantExpr::destroyConstant() {
2321 getType()->getContext().pImpl->ExprConstants.remove(this);
2322 destroyConstantImpl();
2325 const char *ConstantExpr::getOpcodeName() const {
2326 return Instruction::getOpcodeName(getOpcode());
2331 GetElementPtrConstantExpr::
2332 GetElementPtrConstantExpr(Constant *C, ArrayRef<Constant*> IdxList,
2334 : ConstantExpr(DestTy, Instruction::GetElementPtr,
2335 OperandTraits<GetElementPtrConstantExpr>::op_end(this)
2336 - (IdxList.size()+1), IdxList.size()+1) {
2338 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
2339 OperandList[i+1] = IdxList[i];
2342 //===----------------------------------------------------------------------===//
2343 // ConstantData* implementations
2345 void ConstantDataArray::anchor() {}
2346 void ConstantDataVector::anchor() {}
2348 /// getElementType - Return the element type of the array/vector.
2349 Type *ConstantDataSequential::getElementType() const {
2350 return getType()->getElementType();
2353 StringRef ConstantDataSequential::getRawDataValues() const {
2354 return StringRef(DataElements, getNumElements()*getElementByteSize());
2357 /// isElementTypeCompatible - Return true if a ConstantDataSequential can be
2358 /// formed with a vector or array of the specified element type.
2359 /// ConstantDataArray only works with normal float and int types that are
2360 /// stored densely in memory, not with things like i42 or x86_f80.
2361 bool ConstantDataSequential::isElementTypeCompatible(const Type *Ty) {
2362 if (Ty->isFloatTy() || Ty->isDoubleTy()) return true;
2363 if (const IntegerType *IT = dyn_cast<IntegerType>(Ty)) {
2364 switch (IT->getBitWidth()) {
2376 /// getNumElements - Return the number of elements in the array or vector.
2377 unsigned ConstantDataSequential::getNumElements() const {
2378 if (ArrayType *AT = dyn_cast<ArrayType>(getType()))
2379 return AT->getNumElements();
2380 return getType()->getVectorNumElements();
2384 /// getElementByteSize - Return the size in bytes of the elements in the data.
2385 uint64_t ConstantDataSequential::getElementByteSize() const {
2386 return getElementType()->getPrimitiveSizeInBits()/8;
2389 /// getElementPointer - Return the start of the specified element.
2390 const char *ConstantDataSequential::getElementPointer(unsigned Elt) const {
2391 assert(Elt < getNumElements() && "Invalid Elt");
2392 return DataElements+Elt*getElementByteSize();
2396 /// isAllZeros - return true if the array is empty or all zeros.
2397 static bool isAllZeros(StringRef Arr) {
2398 for (StringRef::iterator I = Arr.begin(), E = Arr.end(); I != E; ++I)
2404 /// getImpl - This is the underlying implementation of all of the
2405 /// ConstantDataSequential::get methods. They all thunk down to here, providing
2406 /// the correct element type. We take the bytes in as a StringRef because
2407 /// we *want* an underlying "char*" to avoid TBAA type punning violations.
2408 Constant *ConstantDataSequential::getImpl(StringRef Elements, Type *Ty) {
2409 assert(isElementTypeCompatible(Ty->getSequentialElementType()));
2410 // If the elements are all zero or there are no elements, return a CAZ, which
2411 // is more dense and canonical.
2412 if (isAllZeros(Elements))
2413 return ConstantAggregateZero::get(Ty);
2415 // Do a lookup to see if we have already formed one of these.
2416 StringMap<ConstantDataSequential*>::MapEntryTy &Slot =
2417 Ty->getContext().pImpl->CDSConstants.GetOrCreateValue(Elements);
2419 // The bucket can point to a linked list of different CDS's that have the same
2420 // body but different types. For example, 0,0,0,1 could be a 4 element array
2421 // of i8, or a 1-element array of i32. They'll both end up in the same
2422 /// StringMap bucket, linked up by their Next pointers. Walk the list.
2423 ConstantDataSequential **Entry = &Slot.getValue();
2424 for (ConstantDataSequential *Node = *Entry; Node;
2425 Entry = &Node->Next, Node = *Entry)
2426 if (Node->getType() == Ty)
2429 // Okay, we didn't get a hit. Create a node of the right class, link it in,
2431 if (isa<ArrayType>(Ty))
2432 return *Entry = new ConstantDataArray(Ty, Slot.getKeyData());
2434 assert(isa<VectorType>(Ty));
2435 return *Entry = new ConstantDataVector(Ty, Slot.getKeyData());
2438 void ConstantDataSequential::destroyConstant() {
2439 // Remove the constant from the StringMap.
2440 StringMap<ConstantDataSequential*> &CDSConstants =
2441 getType()->getContext().pImpl->CDSConstants;
2443 StringMap<ConstantDataSequential*>::iterator Slot =
2444 CDSConstants.find(getRawDataValues());
2446 assert(Slot != CDSConstants.end() && "CDS not found in uniquing table");
2448 ConstantDataSequential **Entry = &Slot->getValue();
2450 // Remove the entry from the hash table.
2451 if (!(*Entry)->Next) {
2452 // If there is only one value in the bucket (common case) it must be this
2453 // entry, and removing the entry should remove the bucket completely.
2454 assert((*Entry) == this && "Hash mismatch in ConstantDataSequential");
2455 getContext().pImpl->CDSConstants.erase(Slot);
2457 // Otherwise, there are multiple entries linked off the bucket, unlink the
2458 // node we care about but keep the bucket around.
2459 for (ConstantDataSequential *Node = *Entry; ;
2460 Entry = &Node->Next, Node = *Entry) {
2461 assert(Node && "Didn't find entry in its uniquing hash table!");
2462 // If we found our entry, unlink it from the list and we're done.
2464 *Entry = Node->Next;
2470 // If we were part of a list, make sure that we don't delete the list that is
2471 // still owned by the uniquing map.
2474 // Finally, actually delete it.
2475 destroyConstantImpl();
2478 /// get() constructors - Return a constant with array type with an element
2479 /// count and element type matching the ArrayRef passed in. Note that this
2480 /// can return a ConstantAggregateZero object.
2481 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint8_t> Elts) {
2482 Type *Ty = ArrayType::get(Type::getInt8Ty(Context), Elts.size());
2483 const char *Data = reinterpret_cast<const char *>(Elts.data());
2484 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty);
2486 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){
2487 Type *Ty = ArrayType::get(Type::getInt16Ty(Context), Elts.size());
2488 const char *Data = reinterpret_cast<const char *>(Elts.data());
2489 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty);
2491 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){
2492 Type *Ty = ArrayType::get(Type::getInt32Ty(Context), Elts.size());
2493 const char *Data = reinterpret_cast<const char *>(Elts.data());
2494 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2496 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){
2497 Type *Ty = ArrayType::get(Type::getInt64Ty(Context), Elts.size());
2498 const char *Data = reinterpret_cast<const char *>(Elts.data());
2499 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2501 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<float> Elts) {
2502 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size());
2503 const char *Data = reinterpret_cast<const char *>(Elts.data());
2504 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2506 Constant *ConstantDataArray::get(LLVMContext &Context, ArrayRef<double> Elts) {
2507 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size());
2508 const char *Data = reinterpret_cast<const char *>(Elts.data());
2509 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2512 /// getString - This method constructs a CDS and initializes it with a text
2513 /// string. The default behavior (AddNull==true) causes a null terminator to
2514 /// be placed at the end of the array (increasing the length of the string by
2515 /// one more than the StringRef would normally indicate. Pass AddNull=false
2516 /// to disable this behavior.
2517 Constant *ConstantDataArray::getString(LLVMContext &Context,
2518 StringRef Str, bool AddNull) {
2520 const uint8_t *Data = reinterpret_cast<const uint8_t *>(Str.data());
2521 return get(Context, ArrayRef<uint8_t>(const_cast<uint8_t *>(Data),
2525 SmallVector<uint8_t, 64> ElementVals;
2526 ElementVals.append(Str.begin(), Str.end());
2527 ElementVals.push_back(0);
2528 return get(Context, ElementVals);
2531 /// get() constructors - Return a constant with vector type with an element
2532 /// count and element type matching the ArrayRef passed in. Note that this
2533 /// can return a ConstantAggregateZero object.
2534 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint8_t> Elts){
2535 Type *Ty = VectorType::get(Type::getInt8Ty(Context), Elts.size());
2536 const char *Data = reinterpret_cast<const char *>(Elts.data());
2537 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*1), Ty);
2539 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint16_t> Elts){
2540 Type *Ty = VectorType::get(Type::getInt16Ty(Context), Elts.size());
2541 const char *Data = reinterpret_cast<const char *>(Elts.data());
2542 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*2), Ty);
2544 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint32_t> Elts){
2545 Type *Ty = VectorType::get(Type::getInt32Ty(Context), Elts.size());
2546 const char *Data = reinterpret_cast<const char *>(Elts.data());
2547 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2549 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<uint64_t> Elts){
2550 Type *Ty = VectorType::get(Type::getInt64Ty(Context), Elts.size());
2551 const char *Data = reinterpret_cast<const char *>(Elts.data());
2552 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2554 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<float> Elts) {
2555 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2556 const char *Data = reinterpret_cast<const char *>(Elts.data());
2557 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*4), Ty);
2559 Constant *ConstantDataVector::get(LLVMContext &Context, ArrayRef<double> Elts) {
2560 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2561 const char *Data = reinterpret_cast<const char *>(Elts.data());
2562 return getImpl(StringRef(const_cast<char *>(Data), Elts.size()*8), Ty);
2565 Constant *ConstantDataVector::getSplat(unsigned NumElts, Constant *V) {
2566 assert(isElementTypeCompatible(V->getType()) &&
2567 "Element type not compatible with ConstantData");
2568 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
2569 if (CI->getType()->isIntegerTy(8)) {
2570 SmallVector<uint8_t, 16> Elts(NumElts, CI->getZExtValue());
2571 return get(V->getContext(), Elts);
2573 if (CI->getType()->isIntegerTy(16)) {
2574 SmallVector<uint16_t, 16> Elts(NumElts, CI->getZExtValue());
2575 return get(V->getContext(), Elts);
2577 if (CI->getType()->isIntegerTy(32)) {
2578 SmallVector<uint32_t, 16> Elts(NumElts, CI->getZExtValue());
2579 return get(V->getContext(), Elts);
2581 assert(CI->getType()->isIntegerTy(64) && "Unsupported ConstantData type");
2582 SmallVector<uint64_t, 16> Elts(NumElts, CI->getZExtValue());
2583 return get(V->getContext(), Elts);
2586 if (ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
2587 if (CFP->getType()->isFloatTy()) {
2588 SmallVector<float, 16> Elts(NumElts, CFP->getValueAPF().convertToFloat());
2589 return get(V->getContext(), Elts);
2591 if (CFP->getType()->isDoubleTy()) {
2592 SmallVector<double, 16> Elts(NumElts,
2593 CFP->getValueAPF().convertToDouble());
2594 return get(V->getContext(), Elts);
2597 return ConstantVector::getSplat(NumElts, V);
2601 /// getElementAsInteger - If this is a sequential container of integers (of
2602 /// any size), return the specified element in the low bits of a uint64_t.
2603 uint64_t ConstantDataSequential::getElementAsInteger(unsigned Elt) const {
2604 assert(isa<IntegerType>(getElementType()) &&
2605 "Accessor can only be used when element is an integer");
2606 const char *EltPtr = getElementPointer(Elt);
2608 // The data is stored in host byte order, make sure to cast back to the right
2609 // type to load with the right endianness.
2610 switch (getElementType()->getIntegerBitWidth()) {
2611 default: llvm_unreachable("Invalid bitwidth for CDS");
2613 return *const_cast<uint8_t *>(reinterpret_cast<const uint8_t *>(EltPtr));
2615 return *const_cast<uint16_t *>(reinterpret_cast<const uint16_t *>(EltPtr));
2617 return *const_cast<uint32_t *>(reinterpret_cast<const uint32_t *>(EltPtr));
2619 return *const_cast<uint64_t *>(reinterpret_cast<const uint64_t *>(EltPtr));
2623 /// getElementAsAPFloat - If this is a sequential container of floating point
2624 /// type, return the specified element as an APFloat.
2625 APFloat ConstantDataSequential::getElementAsAPFloat(unsigned Elt) const {
2626 const char *EltPtr = getElementPointer(Elt);
2628 switch (getElementType()->getTypeID()) {
2630 llvm_unreachable("Accessor can only be used when element is float/double!");
2631 case Type::FloatTyID: {
2632 const float *FloatPrt = reinterpret_cast<const float *>(EltPtr);
2633 return APFloat(*const_cast<float *>(FloatPrt));
2635 case Type::DoubleTyID: {
2636 const double *DoublePtr = reinterpret_cast<const double *>(EltPtr);
2637 return APFloat(*const_cast<double *>(DoublePtr));
2642 /// getElementAsFloat - If this is an sequential container of floats, return
2643 /// the specified element as a float.
2644 float ConstantDataSequential::getElementAsFloat(unsigned Elt) const {
2645 assert(getElementType()->isFloatTy() &&
2646 "Accessor can only be used when element is a 'float'");
2647 const float *EltPtr = reinterpret_cast<const float *>(getElementPointer(Elt));
2648 return *const_cast<float *>(EltPtr);
2651 /// getElementAsDouble - If this is an sequential container of doubles, return
2652 /// the specified element as a float.
2653 double ConstantDataSequential::getElementAsDouble(unsigned Elt) const {
2654 assert(getElementType()->isDoubleTy() &&
2655 "Accessor can only be used when element is a 'float'");
2656 const double *EltPtr =
2657 reinterpret_cast<const double *>(getElementPointer(Elt));
2658 return *const_cast<double *>(EltPtr);
2661 /// getElementAsConstant - Return a Constant for a specified index's element.
2662 /// Note that this has to compute a new constant to return, so it isn't as
2663 /// efficient as getElementAsInteger/Float/Double.
2664 Constant *ConstantDataSequential::getElementAsConstant(unsigned Elt) const {
2665 if (getElementType()->isFloatTy() || getElementType()->isDoubleTy())
2666 return ConstantFP::get(getContext(), getElementAsAPFloat(Elt));
2668 return ConstantInt::get(getElementType(), getElementAsInteger(Elt));
2671 /// isString - This method returns true if this is an array of i8.
2672 bool ConstantDataSequential::isString() const {
2673 return isa<ArrayType>(getType()) && getElementType()->isIntegerTy(8);
2676 /// isCString - This method returns true if the array "isString", ends with a
2677 /// nul byte, and does not contains any other nul bytes.
2678 bool ConstantDataSequential::isCString() const {
2682 StringRef Str = getAsString();
2684 // The last value must be nul.
2685 if (Str.back() != 0) return false;
2687 // Other elements must be non-nul.
2688 return Str.drop_back().find(0) == StringRef::npos;
2691 /// getSplatValue - If this is a splat constant, meaning that all of the
2692 /// elements have the same value, return that value. Otherwise return NULL.
2693 Constant *ConstantDataVector::getSplatValue() const {
2694 const char *Base = getRawDataValues().data();
2696 // Compare elements 1+ to the 0'th element.
2697 unsigned EltSize = getElementByteSize();
2698 for (unsigned i = 1, e = getNumElements(); i != e; ++i)
2699 if (memcmp(Base, Base+i*EltSize, EltSize))
2702 // If they're all the same, return the 0th one as a representative.
2703 return getElementAsConstant(0);
2706 //===----------------------------------------------------------------------===//
2707 // replaceUsesOfWithOnConstant implementations
2709 /// replaceUsesOfWithOnConstant - Update this constant array to change uses of
2710 /// 'From' to be uses of 'To'. This must update the uniquing data structures
2713 /// Note that we intentionally replace all uses of From with To here. Consider
2714 /// a large array that uses 'From' 1000 times. By handling this case all here,
2715 /// ConstantArray::replaceUsesOfWithOnConstant is only invoked once, and that
2716 /// single invocation handles all 1000 uses. Handling them one at a time would
2717 /// work, but would be really slow because it would have to unique each updated
2720 void Constant::replaceUsesOfWithOnConstantImpl(Constant *Replacement) {
2721 // I do need to replace this with an existing value.
2722 assert(Replacement != this && "I didn't contain From!");
2724 // Everyone using this now uses the replacement.
2725 replaceAllUsesWith(Replacement);
2727 // Delete the old constant!
2731 void ConstantArray::replaceUsesOfWithOnConstant(Value *From, Value *To,
2733 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2734 Constant *ToC = cast<Constant>(To);
2736 SmallVector<Constant*, 8> Values;
2737 Values.reserve(getNumOperands()); // Build replacement array.
2739 // Fill values with the modified operands of the constant array. Also,
2740 // compute whether this turns into an all-zeros array.
2741 unsigned NumUpdated = 0;
2743 // Keep track of whether all the values in the array are "ToC".
2744 bool AllSame = true;
2745 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2746 Constant *Val = cast<Constant>(O->get());
2751 Values.push_back(Val);
2752 AllSame &= Val == ToC;
2755 if (AllSame && ToC->isNullValue()) {
2756 replaceUsesOfWithOnConstantImpl(ConstantAggregateZero::get(getType()));
2759 if (AllSame && isa<UndefValue>(ToC)) {
2760 replaceUsesOfWithOnConstantImpl(UndefValue::get(getType()));
2764 // Check for any other type of constant-folding.
2765 if (Constant *C = getImpl(getType(), Values)) {
2766 replaceUsesOfWithOnConstantImpl(C);
2770 // Update to the new value.
2771 if (Constant *C = getContext().pImpl->ArrayConstants.replaceOperandsInPlace(
2772 Values, this, From, ToC, NumUpdated, U - OperandList))
2773 replaceUsesOfWithOnConstantImpl(C);
2776 void ConstantStruct::replaceUsesOfWithOnConstant(Value *From, Value *To,
2778 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2779 Constant *ToC = cast<Constant>(To);
2781 unsigned OperandToUpdate = U-OperandList;
2782 assert(getOperand(OperandToUpdate) == From && "ReplaceAllUsesWith broken!");
2784 SmallVector<Constant*, 8> Values;
2785 Values.reserve(getNumOperands()); // Build replacement struct.
2787 // Fill values with the modified operands of the constant struct. Also,
2788 // compute whether this turns into an all-zeros struct.
2789 bool isAllZeros = false;
2790 bool isAllUndef = false;
2791 if (ToC->isNullValue()) {
2793 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2794 Constant *Val = cast<Constant>(O->get());
2795 Values.push_back(Val);
2796 if (isAllZeros) isAllZeros = Val->isNullValue();
2798 } else if (isa<UndefValue>(ToC)) {
2800 for (Use *O = OperandList, *E = OperandList+getNumOperands(); O != E; ++O) {
2801 Constant *Val = cast<Constant>(O->get());
2802 Values.push_back(Val);
2803 if (isAllUndef) isAllUndef = isa<UndefValue>(Val);
2806 for (Use *O = OperandList, *E = OperandList + getNumOperands(); O != E; ++O)
2807 Values.push_back(cast<Constant>(O->get()));
2809 Values[OperandToUpdate] = ToC;
2812 replaceUsesOfWithOnConstantImpl(ConstantAggregateZero::get(getType()));
2816 replaceUsesOfWithOnConstantImpl(UndefValue::get(getType()));
2820 // Update to the new value.
2821 if (Constant *C = getContext().pImpl->StructConstants.replaceOperandsInPlace(
2822 Values, this, From, ToC))
2823 replaceUsesOfWithOnConstantImpl(C);
2826 void ConstantVector::replaceUsesOfWithOnConstant(Value *From, Value *To,
2828 assert(isa<Constant>(To) && "Cannot make Constant refer to non-constant!");
2829 Constant *ToC = cast<Constant>(To);
2831 SmallVector<Constant*, 8> Values;
2832 Values.reserve(getNumOperands()); // Build replacement array...
2833 unsigned NumUpdated = 0;
2834 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2835 Constant *Val = getOperand(i);
2840 Values.push_back(Val);
2843 if (Constant *C = getImpl(Values)) {
2844 replaceUsesOfWithOnConstantImpl(C);
2848 // Update to the new value.
2849 if (Constant *C = getContext().pImpl->VectorConstants.replaceOperandsInPlace(
2850 Values, this, From, ToC, NumUpdated, U - OperandList))
2851 replaceUsesOfWithOnConstantImpl(C);
2854 void ConstantExpr::replaceUsesOfWithOnConstant(Value *From, Value *ToV,
2856 assert(isa<Constant>(ToV) && "Cannot make Constant refer to non-constant!");
2857 Constant *To = cast<Constant>(ToV);
2859 SmallVector<Constant*, 8> NewOps;
2860 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2861 Constant *Op = getOperand(i);
2862 NewOps.push_back(Op == From ? To : Op);
2865 Constant *Replacement = getWithOperands(NewOps);
2866 assert(Replacement != this && "I didn't contain From!");
2868 // Check if Replacement has no users (and is the same type). Ideally, this
2869 // check would be done *before* creating Replacement, but threading this
2870 // through constant-folding isn't trivial.
2871 if (canBecomeReplacement(Replacement)) {
2872 // Avoid unnecessary RAUW traffic.
2873 auto &ExprConstants = getType()->getContext().pImpl->ExprConstants;
2874 ExprConstants.remove(this);
2876 auto *CE = cast<ConstantExpr>(Replacement);
2877 for (unsigned I = 0, E = getNumOperands(); I != E; ++I)
2878 // Only set the operands that have actually changed.
2879 if (getOperand(I) != CE->getOperand(I))
2880 setOperand(I, CE->getOperand(I));
2882 CE->destroyConstant();
2883 ExprConstants.insert(this);
2887 // Everyone using this now uses the replacement.
2888 replaceAllUsesWith(Replacement);
2890 // Delete the old constant!
2894 bool ConstantExpr::canBecomeReplacement(const Constant *Replacement) const {
2895 // If Replacement already has users, use it regardless.
2896 if (!Replacement->use_empty())
2899 // Check for anything that could have changed during constant-folding.
2900 if (getValueID() != Replacement->getValueID())
2902 const auto *CE = cast<ConstantExpr>(Replacement);
2903 if (getOpcode() != CE->getOpcode())
2905 if (getNumOperands() != CE->getNumOperands())
2907 if (getRawSubclassOptionalData() != CE->getRawSubclassOptionalData())
2910 if (getPredicate() != CE->getPredicate())
2913 if (getIndices() != CE->getIndices())
2919 Instruction *ConstantExpr::getAsInstruction() {
2920 SmallVector<Value*,4> ValueOperands;
2921 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2922 ValueOperands.push_back(cast<Value>(I));
2924 ArrayRef<Value*> Ops(ValueOperands);
2926 switch (getOpcode()) {
2927 case Instruction::Trunc:
2928 case Instruction::ZExt:
2929 case Instruction::SExt:
2930 case Instruction::FPTrunc:
2931 case Instruction::FPExt:
2932 case Instruction::UIToFP:
2933 case Instruction::SIToFP:
2934 case Instruction::FPToUI:
2935 case Instruction::FPToSI:
2936 case Instruction::PtrToInt:
2937 case Instruction::IntToPtr:
2938 case Instruction::BitCast:
2939 case Instruction::AddrSpaceCast:
2940 return CastInst::Create((Instruction::CastOps)getOpcode(),
2942 case Instruction::Select:
2943 return SelectInst::Create(Ops[0], Ops[1], Ops[2]);
2944 case Instruction::InsertElement:
2945 return InsertElementInst::Create(Ops[0], Ops[1], Ops[2]);
2946 case Instruction::ExtractElement:
2947 return ExtractElementInst::Create(Ops[0], Ops[1]);
2948 case Instruction::InsertValue:
2949 return InsertValueInst::Create(Ops[0], Ops[1], getIndices());
2950 case Instruction::ExtractValue:
2951 return ExtractValueInst::Create(Ops[0], getIndices());
2952 case Instruction::ShuffleVector:
2953 return new ShuffleVectorInst(Ops[0], Ops[1], Ops[2]);
2955 case Instruction::GetElementPtr:
2956 if (cast<GEPOperator>(this)->isInBounds())
2957 return GetElementPtrInst::CreateInBounds(Ops[0], Ops.slice(1));
2959 return GetElementPtrInst::Create(Ops[0], Ops.slice(1));
2961 case Instruction::ICmp:
2962 case Instruction::FCmp:
2963 return CmpInst::Create((Instruction::OtherOps)getOpcode(),
2964 getPredicate(), Ops[0], Ops[1]);
2967 assert(getNumOperands() == 2 && "Must be binary operator?");
2968 BinaryOperator *BO =
2969 BinaryOperator::Create((Instruction::BinaryOps)getOpcode(),
2971 if (isa<OverflowingBinaryOperator>(BO)) {
2972 BO->setHasNoUnsignedWrap(SubclassOptionalData &
2973 OverflowingBinaryOperator::NoUnsignedWrap);
2974 BO->setHasNoSignedWrap(SubclassOptionalData &
2975 OverflowingBinaryOperator::NoSignedWrap);
2977 if (isa<PossiblyExactOperator>(BO))
2978 BO->setIsExact(SubclassOptionalData & PossiblyExactOperator::IsExact);