1 //===-- ConstantFolding.cpp - Fold instructions into constants ------------===//
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 defines routines for folding instructions into constants.
12 // Also, to supplement the basic IR ConstantExpr simplifications,
13 // this file defines some additional folding routines that can make use of
14 // DataLayout information. These functions cannot go in IR due to library
17 //===----------------------------------------------------------------------===//
19 #include "llvm/Analysis/ConstantFolding.h"
20 #include "llvm/ADT/APFloat.h"
21 #include "llvm/ADT/APInt.h"
22 #include "llvm/ADT/ArrayRef.h"
23 #include "llvm/ADT/DenseMap.h"
24 #include "llvm/ADT/STLExtras.h"
25 #include "llvm/ADT/SmallVector.h"
26 #include "llvm/ADT/StringRef.h"
27 #include "llvm/Analysis/TargetLibraryInfo.h"
28 #include "llvm/Analysis/ValueTracking.h"
29 #include "llvm/Config/config.h"
30 #include "llvm/IR/Constant.h"
31 #include "llvm/IR/Constants.h"
32 #include "llvm/IR/DataLayout.h"
33 #include "llvm/IR/DerivedTypes.h"
34 #include "llvm/IR/Function.h"
35 #include "llvm/IR/GlobalValue.h"
36 #include "llvm/IR/GlobalVariable.h"
37 #include "llvm/IR/InstrTypes.h"
38 #include "llvm/IR/Instruction.h"
39 #include "llvm/IR/Instructions.h"
40 #include "llvm/IR/Operator.h"
41 #include "llvm/IR/Type.h"
42 #include "llvm/IR/Value.h"
43 #include "llvm/Support/Casting.h"
44 #include "llvm/Support/ErrorHandling.h"
45 #include "llvm/Support/KnownBits.h"
46 #include "llvm/Support/MathExtras.h"
58 //===----------------------------------------------------------------------===//
59 // Constant Folding internal helper functions
60 //===----------------------------------------------------------------------===//
62 static Constant *foldConstVectorToAPInt(APInt &Result, Type *DestTy,
63 Constant *C, Type *SrcEltTy,
65 const DataLayout &DL) {
66 // Now that we know that the input value is a vector of integers, just shift
67 // and insert them into our result.
68 unsigned BitShift = DL.getTypeSizeInBits(SrcEltTy);
69 for (unsigned i = 0; i != NumSrcElts; ++i) {
71 if (DL.isLittleEndian())
72 Element = C->getAggregateElement(NumSrcElts - i - 1);
74 Element = C->getAggregateElement(i);
76 if (Element && isa<UndefValue>(Element)) {
81 auto *ElementCI = dyn_cast_or_null<ConstantInt>(Element);
83 return ConstantExpr::getBitCast(C, DestTy);
86 Result |= ElementCI->getValue().zextOrSelf(Result.getBitWidth());
92 /// Constant fold bitcast, symbolically evaluating it with DataLayout.
93 /// This always returns a non-null constant, but it may be a
94 /// ConstantExpr if unfoldable.
95 Constant *FoldBitCast(Constant *C, Type *DestTy, const DataLayout &DL) {
96 // Catch the obvious splat cases.
97 if (C->isNullValue() && !DestTy->isX86_MMXTy())
98 return Constant::getNullValue(DestTy);
99 if (C->isAllOnesValue() && !DestTy->isX86_MMXTy() &&
100 !DestTy->isPtrOrPtrVectorTy()) // Don't get ones for ptr types!
101 return Constant::getAllOnesValue(DestTy);
103 if (auto *VTy = dyn_cast<VectorType>(C->getType())) {
104 // Handle a vector->scalar integer/fp cast.
105 if (isa<IntegerType>(DestTy) || DestTy->isFloatingPointTy()) {
106 unsigned NumSrcElts = VTy->getNumElements();
107 Type *SrcEltTy = VTy->getElementType();
109 // If the vector is a vector of floating point, convert it to vector of int
110 // to simplify things.
111 if (SrcEltTy->isFloatingPointTy()) {
112 unsigned FPWidth = SrcEltTy->getPrimitiveSizeInBits();
114 VectorType::get(IntegerType::get(C->getContext(), FPWidth), NumSrcElts);
115 // Ask IR to do the conversion now that #elts line up.
116 C = ConstantExpr::getBitCast(C, SrcIVTy);
119 APInt Result(DL.getTypeSizeInBits(DestTy), 0);
120 if (Constant *CE = foldConstVectorToAPInt(Result, DestTy, C,
121 SrcEltTy, NumSrcElts, DL))
124 if (isa<IntegerType>(DestTy))
125 return ConstantInt::get(DestTy, Result);
127 APFloat FP(DestTy->getFltSemantics(), Result);
128 return ConstantFP::get(DestTy->getContext(), FP);
132 // The code below only handles casts to vectors currently.
133 auto *DestVTy = dyn_cast<VectorType>(DestTy);
135 return ConstantExpr::getBitCast(C, DestTy);
137 // If this is a scalar -> vector cast, convert the input into a <1 x scalar>
138 // vector so the code below can handle it uniformly.
139 if (isa<ConstantFP>(C) || isa<ConstantInt>(C)) {
140 Constant *Ops = C; // don't take the address of C!
141 return FoldBitCast(ConstantVector::get(Ops), DestTy, DL);
144 // If this is a bitcast from constant vector -> vector, fold it.
145 if (!isa<ConstantDataVector>(C) && !isa<ConstantVector>(C))
146 return ConstantExpr::getBitCast(C, DestTy);
148 // If the element types match, IR can fold it.
149 unsigned NumDstElt = DestVTy->getNumElements();
150 unsigned NumSrcElt = C->getType()->getVectorNumElements();
151 if (NumDstElt == NumSrcElt)
152 return ConstantExpr::getBitCast(C, DestTy);
154 Type *SrcEltTy = C->getType()->getVectorElementType();
155 Type *DstEltTy = DestVTy->getElementType();
157 // Otherwise, we're changing the number of elements in a vector, which
158 // requires endianness information to do the right thing. For example,
159 // bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
160 // folds to (little endian):
161 // <4 x i32> <i32 0, i32 0, i32 1, i32 0>
162 // and to (big endian):
163 // <4 x i32> <i32 0, i32 0, i32 0, i32 1>
165 // First thing is first. We only want to think about integer here, so if
166 // we have something in FP form, recast it as integer.
167 if (DstEltTy->isFloatingPointTy()) {
168 // Fold to an vector of integers with same size as our FP type.
169 unsigned FPWidth = DstEltTy->getPrimitiveSizeInBits();
171 VectorType::get(IntegerType::get(C->getContext(), FPWidth), NumDstElt);
172 // Recursively handle this integer conversion, if possible.
173 C = FoldBitCast(C, DestIVTy, DL);
175 // Finally, IR can handle this now that #elts line up.
176 return ConstantExpr::getBitCast(C, DestTy);
179 // Okay, we know the destination is integer, if the input is FP, convert
180 // it to integer first.
181 if (SrcEltTy->isFloatingPointTy()) {
182 unsigned FPWidth = SrcEltTy->getPrimitiveSizeInBits();
184 VectorType::get(IntegerType::get(C->getContext(), FPWidth), NumSrcElt);
185 // Ask IR to do the conversion now that #elts line up.
186 C = ConstantExpr::getBitCast(C, SrcIVTy);
187 // If IR wasn't able to fold it, bail out.
188 if (!isa<ConstantVector>(C) && // FIXME: Remove ConstantVector.
189 !isa<ConstantDataVector>(C))
193 // Now we know that the input and output vectors are both integer vectors
194 // of the same size, and that their #elements is not the same. Do the
195 // conversion here, which depends on whether the input or output has
197 bool isLittleEndian = DL.isLittleEndian();
199 SmallVector<Constant*, 32> Result;
200 if (NumDstElt < NumSrcElt) {
201 // Handle: bitcast (<4 x i32> <i32 0, i32 1, i32 2, i32 3> to <2 x i64>)
202 Constant *Zero = Constant::getNullValue(DstEltTy);
203 unsigned Ratio = NumSrcElt/NumDstElt;
204 unsigned SrcBitSize = SrcEltTy->getPrimitiveSizeInBits();
206 for (unsigned i = 0; i != NumDstElt; ++i) {
207 // Build each element of the result.
208 Constant *Elt = Zero;
209 unsigned ShiftAmt = isLittleEndian ? 0 : SrcBitSize*(Ratio-1);
210 for (unsigned j = 0; j != Ratio; ++j) {
211 Constant *Src = C->getAggregateElement(SrcElt++);
212 if (Src && isa<UndefValue>(Src))
213 Src = Constant::getNullValue(C->getType()->getVectorElementType());
215 Src = dyn_cast_or_null<ConstantInt>(Src);
216 if (!Src) // Reject constantexpr elements.
217 return ConstantExpr::getBitCast(C, DestTy);
219 // Zero extend the element to the right size.
220 Src = ConstantExpr::getZExt(Src, Elt->getType());
222 // Shift it to the right place, depending on endianness.
223 Src = ConstantExpr::getShl(Src,
224 ConstantInt::get(Src->getType(), ShiftAmt));
225 ShiftAmt += isLittleEndian ? SrcBitSize : -SrcBitSize;
228 Elt = ConstantExpr::getOr(Elt, Src);
230 Result.push_back(Elt);
232 return ConstantVector::get(Result);
235 // Handle: bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
236 unsigned Ratio = NumDstElt/NumSrcElt;
237 unsigned DstBitSize = DL.getTypeSizeInBits(DstEltTy);
239 // Loop over each source value, expanding into multiple results.
240 for (unsigned i = 0; i != NumSrcElt; ++i) {
241 auto *Element = C->getAggregateElement(i);
243 if (!Element) // Reject constantexpr elements.
244 return ConstantExpr::getBitCast(C, DestTy);
246 if (isa<UndefValue>(Element)) {
247 // Correctly Propagate undef values.
248 Result.append(Ratio, UndefValue::get(DstEltTy));
252 auto *Src = dyn_cast<ConstantInt>(Element);
254 return ConstantExpr::getBitCast(C, DestTy);
256 unsigned ShiftAmt = isLittleEndian ? 0 : DstBitSize*(Ratio-1);
257 for (unsigned j = 0; j != Ratio; ++j) {
258 // Shift the piece of the value into the right place, depending on
260 Constant *Elt = ConstantExpr::getLShr(Src,
261 ConstantInt::get(Src->getType(), ShiftAmt));
262 ShiftAmt += isLittleEndian ? DstBitSize : -DstBitSize;
264 // Truncate the element to an integer with the same pointer size and
265 // convert the element back to a pointer using a inttoptr.
266 if (DstEltTy->isPointerTy()) {
267 IntegerType *DstIntTy = Type::getIntNTy(C->getContext(), DstBitSize);
268 Constant *CE = ConstantExpr::getTrunc(Elt, DstIntTy);
269 Result.push_back(ConstantExpr::getIntToPtr(CE, DstEltTy));
273 // Truncate and remember this piece.
274 Result.push_back(ConstantExpr::getTrunc(Elt, DstEltTy));
278 return ConstantVector::get(Result);
281 } // end anonymous namespace
283 /// If this constant is a constant offset from a global, return the global and
284 /// the constant. Because of constantexprs, this function is recursive.
285 bool llvm::IsConstantOffsetFromGlobal(Constant *C, GlobalValue *&GV,
286 APInt &Offset, const DataLayout &DL) {
287 // Trivial case, constant is the global.
288 if ((GV = dyn_cast<GlobalValue>(C))) {
289 unsigned BitWidth = DL.getPointerTypeSizeInBits(GV->getType());
290 Offset = APInt(BitWidth, 0);
294 // Otherwise, if this isn't a constant expr, bail out.
295 auto *CE = dyn_cast<ConstantExpr>(C);
296 if (!CE) return false;
298 // Look through ptr->int and ptr->ptr casts.
299 if (CE->getOpcode() == Instruction::PtrToInt ||
300 CE->getOpcode() == Instruction::BitCast)
301 return IsConstantOffsetFromGlobal(CE->getOperand(0), GV, Offset, DL);
303 // i32* getelementptr ([5 x i32]* @a, i32 0, i32 5)
304 auto *GEP = dyn_cast<GEPOperator>(CE);
308 unsigned BitWidth = DL.getPointerTypeSizeInBits(GEP->getType());
309 APInt TmpOffset(BitWidth, 0);
311 // If the base isn't a global+constant, we aren't either.
312 if (!IsConstantOffsetFromGlobal(CE->getOperand(0), GV, TmpOffset, DL))
315 // Otherwise, add any offset that our operands provide.
316 if (!GEP->accumulateConstantOffset(DL, TmpOffset))
325 /// Recursive helper to read bits out of global. C is the constant being copied
326 /// out of. ByteOffset is an offset into C. CurPtr is the pointer to copy
327 /// results into and BytesLeft is the number of bytes left in
328 /// the CurPtr buffer. DL is the DataLayout.
329 bool ReadDataFromGlobal(Constant *C, uint64_t ByteOffset, unsigned char *CurPtr,
330 unsigned BytesLeft, const DataLayout &DL) {
331 assert(ByteOffset <= DL.getTypeAllocSize(C->getType()) &&
332 "Out of range access");
334 // If this element is zero or undefined, we can just return since *CurPtr is
336 if (isa<ConstantAggregateZero>(C) || isa<UndefValue>(C))
339 if (auto *CI = dyn_cast<ConstantInt>(C)) {
340 if (CI->getBitWidth() > 64 ||
341 (CI->getBitWidth() & 7) != 0)
344 uint64_t Val = CI->getZExtValue();
345 unsigned IntBytes = unsigned(CI->getBitWidth()/8);
347 for (unsigned i = 0; i != BytesLeft && ByteOffset != IntBytes; ++i) {
349 if (!DL.isLittleEndian())
350 n = IntBytes - n - 1;
351 CurPtr[i] = (unsigned char)(Val >> (n * 8));
357 if (auto *CFP = dyn_cast<ConstantFP>(C)) {
358 if (CFP->getType()->isDoubleTy()) {
359 C = FoldBitCast(C, Type::getInt64Ty(C->getContext()), DL);
360 return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
362 if (CFP->getType()->isFloatTy()){
363 C = FoldBitCast(C, Type::getInt32Ty(C->getContext()), DL);
364 return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
366 if (CFP->getType()->isHalfTy()){
367 C = FoldBitCast(C, Type::getInt16Ty(C->getContext()), DL);
368 return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
373 if (auto *CS = dyn_cast<ConstantStruct>(C)) {
374 const StructLayout *SL = DL.getStructLayout(CS->getType());
375 unsigned Index = SL->getElementContainingOffset(ByteOffset);
376 uint64_t CurEltOffset = SL->getElementOffset(Index);
377 ByteOffset -= CurEltOffset;
380 // If the element access is to the element itself and not to tail padding,
381 // read the bytes from the element.
382 uint64_t EltSize = DL.getTypeAllocSize(CS->getOperand(Index)->getType());
384 if (ByteOffset < EltSize &&
385 !ReadDataFromGlobal(CS->getOperand(Index), ByteOffset, CurPtr,
391 // Check to see if we read from the last struct element, if so we're done.
392 if (Index == CS->getType()->getNumElements())
395 // If we read all of the bytes we needed from this element we're done.
396 uint64_t NextEltOffset = SL->getElementOffset(Index);
398 if (BytesLeft <= NextEltOffset - CurEltOffset - ByteOffset)
401 // Move to the next element of the struct.
402 CurPtr += NextEltOffset - CurEltOffset - ByteOffset;
403 BytesLeft -= NextEltOffset - CurEltOffset - ByteOffset;
405 CurEltOffset = NextEltOffset;
410 if (isa<ConstantArray>(C) || isa<ConstantVector>(C) ||
411 isa<ConstantDataSequential>(C)) {
412 Type *EltTy = C->getType()->getSequentialElementType();
413 uint64_t EltSize = DL.getTypeAllocSize(EltTy);
414 uint64_t Index = ByteOffset / EltSize;
415 uint64_t Offset = ByteOffset - Index * EltSize;
417 if (auto *AT = dyn_cast<ArrayType>(C->getType()))
418 NumElts = AT->getNumElements();
420 NumElts = C->getType()->getVectorNumElements();
422 for (; Index != NumElts; ++Index) {
423 if (!ReadDataFromGlobal(C->getAggregateElement(Index), Offset, CurPtr,
427 uint64_t BytesWritten = EltSize - Offset;
428 assert(BytesWritten <= EltSize && "Not indexing into this element?");
429 if (BytesWritten >= BytesLeft)
433 BytesLeft -= BytesWritten;
434 CurPtr += BytesWritten;
439 if (auto *CE = dyn_cast<ConstantExpr>(C)) {
440 if (CE->getOpcode() == Instruction::IntToPtr &&
441 CE->getOperand(0)->getType() == DL.getIntPtrType(CE->getType())) {
442 return ReadDataFromGlobal(CE->getOperand(0), ByteOffset, CurPtr,
447 // Otherwise, unknown initializer type.
451 Constant *FoldReinterpretLoadFromConstPtr(Constant *C, Type *LoadTy,
452 const DataLayout &DL) {
453 auto *PTy = cast<PointerType>(C->getType());
454 auto *IntType = dyn_cast<IntegerType>(LoadTy);
456 // If this isn't an integer load we can't fold it directly.
458 unsigned AS = PTy->getAddressSpace();
460 // If this is a float/double load, we can try folding it as an int32/64 load
461 // and then bitcast the result. This can be useful for union cases. Note
462 // that address spaces don't matter here since we're not going to result in
463 // an actual new load.
465 if (LoadTy->isHalfTy())
466 MapTy = Type::getInt16Ty(C->getContext());
467 else if (LoadTy->isFloatTy())
468 MapTy = Type::getInt32Ty(C->getContext());
469 else if (LoadTy->isDoubleTy())
470 MapTy = Type::getInt64Ty(C->getContext());
471 else if (LoadTy->isVectorTy()) {
472 MapTy = PointerType::getIntNTy(C->getContext(),
473 DL.getTypeAllocSizeInBits(LoadTy));
477 C = FoldBitCast(C, MapTy->getPointerTo(AS), DL);
478 if (Constant *Res = FoldReinterpretLoadFromConstPtr(C, MapTy, DL))
479 return FoldBitCast(Res, LoadTy, DL);
483 unsigned BytesLoaded = (IntType->getBitWidth() + 7) / 8;
484 if (BytesLoaded > 32 || BytesLoaded == 0)
489 if (!IsConstantOffsetFromGlobal(C, GVal, OffsetAI, DL))
492 auto *GV = dyn_cast<GlobalVariable>(GVal);
493 if (!GV || !GV->isConstant() || !GV->hasDefinitiveInitializer() ||
494 !GV->getInitializer()->getType()->isSized())
497 int64_t Offset = OffsetAI.getSExtValue();
498 int64_t InitializerSize = DL.getTypeAllocSize(GV->getInitializer()->getType());
500 // If we're not accessing anything in this constant, the result is undefined.
501 if (Offset + BytesLoaded <= 0)
502 return UndefValue::get(IntType);
504 // If we're not accessing anything in this constant, the result is undefined.
505 if (Offset >= InitializerSize)
506 return UndefValue::get(IntType);
508 unsigned char RawBytes[32] = {0};
509 unsigned char *CurPtr = RawBytes;
510 unsigned BytesLeft = BytesLoaded;
512 // If we're loading off the beginning of the global, some bytes may be valid.
519 if (!ReadDataFromGlobal(GV->getInitializer(), Offset, CurPtr, BytesLeft, DL))
522 APInt ResultVal = APInt(IntType->getBitWidth(), 0);
523 if (DL.isLittleEndian()) {
524 ResultVal = RawBytes[BytesLoaded - 1];
525 for (unsigned i = 1; i != BytesLoaded; ++i) {
527 ResultVal |= RawBytes[BytesLoaded - 1 - i];
530 ResultVal = RawBytes[0];
531 for (unsigned i = 1; i != BytesLoaded; ++i) {
533 ResultVal |= RawBytes[i];
537 return ConstantInt::get(IntType->getContext(), ResultVal);
540 Constant *ConstantFoldLoadThroughBitcast(ConstantExpr *CE, Type *DestTy,
541 const DataLayout &DL) {
542 auto *SrcPtr = CE->getOperand(0);
543 auto *SrcPtrTy = dyn_cast<PointerType>(SrcPtr->getType());
546 Type *SrcTy = SrcPtrTy->getPointerElementType();
548 Constant *C = ConstantFoldLoadFromConstPtr(SrcPtr, SrcTy, DL);
553 Type *SrcTy = C->getType();
555 // If the type sizes are the same and a cast is legal, just directly
556 // cast the constant.
557 if (DL.getTypeSizeInBits(DestTy) == DL.getTypeSizeInBits(SrcTy)) {
558 Instruction::CastOps Cast = Instruction::BitCast;
559 // If we are going from a pointer to int or vice versa, we spell the cast
561 if (SrcTy->isIntegerTy() && DestTy->isPointerTy())
562 Cast = Instruction::IntToPtr;
563 else if (SrcTy->isPointerTy() && DestTy->isIntegerTy())
564 Cast = Instruction::PtrToInt;
566 if (CastInst::castIsValid(Cast, C, DestTy))
567 return ConstantExpr::getCast(Cast, C, DestTy);
570 // If this isn't an aggregate type, there is nothing we can do to drill down
571 // and find a bitcastable constant.
572 if (!SrcTy->isAggregateType())
575 // We're simulating a load through a pointer that was bitcast to point to
576 // a different type, so we can try to walk down through the initial
577 // elements of an aggregate to see if some part of th e aggregate is
578 // castable to implement the "load" semantic model.
579 C = C->getAggregateElement(0u);
585 } // end anonymous namespace
587 Constant *llvm::ConstantFoldLoadFromConstPtr(Constant *C, Type *Ty,
588 const DataLayout &DL) {
589 // First, try the easy cases:
590 if (auto *GV = dyn_cast<GlobalVariable>(C))
591 if (GV->isConstant() && GV->hasDefinitiveInitializer())
592 return GV->getInitializer();
594 if (auto *GA = dyn_cast<GlobalAlias>(C))
595 if (GA->getAliasee() && !GA->isInterposable())
596 return ConstantFoldLoadFromConstPtr(GA->getAliasee(), Ty, DL);
598 // If the loaded value isn't a constant expr, we can't handle it.
599 auto *CE = dyn_cast<ConstantExpr>(C);
603 if (CE->getOpcode() == Instruction::GetElementPtr) {
604 if (auto *GV = dyn_cast<GlobalVariable>(CE->getOperand(0))) {
605 if (GV->isConstant() && GV->hasDefinitiveInitializer()) {
607 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE))
613 if (CE->getOpcode() == Instruction::BitCast)
614 if (Constant *LoadedC = ConstantFoldLoadThroughBitcast(CE, Ty, DL))
617 // Instead of loading constant c string, use corresponding integer value
618 // directly if string length is small enough.
620 if (getConstantStringInfo(CE, Str) && !Str.empty()) {
621 size_t StrLen = Str.size();
622 unsigned NumBits = Ty->getPrimitiveSizeInBits();
623 // Replace load with immediate integer if the result is an integer or fp
625 if ((NumBits >> 3) == StrLen + 1 && (NumBits & 7) == 0 &&
626 (isa<IntegerType>(Ty) || Ty->isFloatingPointTy())) {
627 APInt StrVal(NumBits, 0);
628 APInt SingleChar(NumBits, 0);
629 if (DL.isLittleEndian()) {
630 for (unsigned char C : reverse(Str.bytes())) {
631 SingleChar = static_cast<uint64_t>(C);
632 StrVal = (StrVal << 8) | SingleChar;
635 for (unsigned char C : Str.bytes()) {
636 SingleChar = static_cast<uint64_t>(C);
637 StrVal = (StrVal << 8) | SingleChar;
639 // Append NULL at the end.
641 StrVal = (StrVal << 8) | SingleChar;
644 Constant *Res = ConstantInt::get(CE->getContext(), StrVal);
645 if (Ty->isFloatingPointTy())
646 Res = ConstantExpr::getBitCast(Res, Ty);
651 // If this load comes from anywhere in a constant global, and if the global
652 // is all undef or zero, we know what it loads.
653 if (auto *GV = dyn_cast<GlobalVariable>(GetUnderlyingObject(CE, DL))) {
654 if (GV->isConstant() && GV->hasDefinitiveInitializer()) {
655 if (GV->getInitializer()->isNullValue())
656 return Constant::getNullValue(Ty);
657 if (isa<UndefValue>(GV->getInitializer()))
658 return UndefValue::get(Ty);
662 // Try hard to fold loads from bitcasted strange and non-type-safe things.
663 return FoldReinterpretLoadFromConstPtr(CE, Ty, DL);
668 Constant *ConstantFoldLoadInst(const LoadInst *LI, const DataLayout &DL) {
669 if (LI->isVolatile()) return nullptr;
671 if (auto *C = dyn_cast<Constant>(LI->getOperand(0)))
672 return ConstantFoldLoadFromConstPtr(C, LI->getType(), DL);
677 /// One of Op0/Op1 is a constant expression.
678 /// Attempt to symbolically evaluate the result of a binary operator merging
679 /// these together. If target data info is available, it is provided as DL,
680 /// otherwise DL is null.
681 Constant *SymbolicallyEvaluateBinop(unsigned Opc, Constant *Op0, Constant *Op1,
682 const DataLayout &DL) {
685 // Fold (and 0xffffffff00000000, (shl x, 32)) -> shl.
686 // Fold (lshr (or X, Y), 32) -> (lshr [X/Y], 32) if one doesn't contribute
689 if (Opc == Instruction::And) {
690 KnownBits Known0 = computeKnownBits(Op0, DL);
691 KnownBits Known1 = computeKnownBits(Op1, DL);
692 if ((Known1.One | Known0.Zero).isAllOnesValue()) {
693 // All the bits of Op0 that the 'and' could be masking are already zero.
696 if ((Known0.One | Known1.Zero).isAllOnesValue()) {
697 // All the bits of Op1 that the 'and' could be masking are already zero.
701 Known0.Zero |= Known1.Zero;
702 Known0.One &= Known1.One;
703 if (Known0.isConstant())
704 return ConstantInt::get(Op0->getType(), Known0.getConstant());
707 // If the constant expr is something like &A[123] - &A[4].f, fold this into a
708 // constant. This happens frequently when iterating over a global array.
709 if (Opc == Instruction::Sub) {
710 GlobalValue *GV1, *GV2;
713 if (IsConstantOffsetFromGlobal(Op0, GV1, Offs1, DL))
714 if (IsConstantOffsetFromGlobal(Op1, GV2, Offs2, DL) && GV1 == GV2) {
715 unsigned OpSize = DL.getTypeSizeInBits(Op0->getType());
717 // (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow.
718 // PtrToInt may change the bitwidth so we have convert to the right size
720 return ConstantInt::get(Op0->getType(), Offs1.zextOrTrunc(OpSize) -
721 Offs2.zextOrTrunc(OpSize));
728 /// If array indices are not pointer-sized integers, explicitly cast them so
729 /// that they aren't implicitly casted by the getelementptr.
730 Constant *CastGEPIndices(Type *SrcElemTy, ArrayRef<Constant *> Ops,
731 Type *ResultTy, Optional<unsigned> InRangeIndex,
732 const DataLayout &DL, const TargetLibraryInfo *TLI) {
733 Type *IntPtrTy = DL.getIntPtrType(ResultTy);
734 Type *IntPtrScalarTy = IntPtrTy->getScalarType();
737 SmallVector<Constant*, 32> NewIdxs;
738 for (unsigned i = 1, e = Ops.size(); i != e; ++i) {
740 !isa<StructType>(GetElementPtrInst::getIndexedType(
741 SrcElemTy, Ops.slice(1, i - 1)))) &&
742 Ops[i]->getType()->getScalarType() != IntPtrScalarTy) {
744 Type *NewType = Ops[i]->getType()->isVectorTy()
746 : IntPtrTy->getScalarType();
747 NewIdxs.push_back(ConstantExpr::getCast(CastInst::getCastOpcode(Ops[i],
753 NewIdxs.push_back(Ops[i]);
759 Constant *C = ConstantExpr::getGetElementPtr(
760 SrcElemTy, Ops[0], NewIdxs, /*InBounds=*/false, InRangeIndex);
761 if (Constant *Folded = ConstantFoldConstant(C, DL, TLI))
767 /// Strip the pointer casts, but preserve the address space information.
768 Constant* StripPtrCastKeepAS(Constant* Ptr, Type *&ElemTy) {
769 assert(Ptr->getType()->isPointerTy() && "Not a pointer type");
770 auto *OldPtrTy = cast<PointerType>(Ptr->getType());
771 Ptr = Ptr->stripPointerCasts();
772 auto *NewPtrTy = cast<PointerType>(Ptr->getType());
774 ElemTy = NewPtrTy->getPointerElementType();
776 // Preserve the address space number of the pointer.
777 if (NewPtrTy->getAddressSpace() != OldPtrTy->getAddressSpace()) {
778 NewPtrTy = ElemTy->getPointerTo(OldPtrTy->getAddressSpace());
779 Ptr = ConstantExpr::getPointerCast(Ptr, NewPtrTy);
784 /// If we can symbolically evaluate the GEP constant expression, do so.
785 Constant *SymbolicallyEvaluateGEP(const GEPOperator *GEP,
786 ArrayRef<Constant *> Ops,
787 const DataLayout &DL,
788 const TargetLibraryInfo *TLI) {
789 const GEPOperator *InnermostGEP = GEP;
790 bool InBounds = GEP->isInBounds();
792 Type *SrcElemTy = GEP->getSourceElementType();
793 Type *ResElemTy = GEP->getResultElementType();
794 Type *ResTy = GEP->getType();
795 if (!SrcElemTy->isSized())
798 if (Constant *C = CastGEPIndices(SrcElemTy, Ops, ResTy,
799 GEP->getInRangeIndex(), DL, TLI))
802 Constant *Ptr = Ops[0];
803 if (!Ptr->getType()->isPointerTy())
806 Type *IntPtrTy = DL.getIntPtrType(Ptr->getType());
808 // If this is a constant expr gep that is effectively computing an
809 // "offsetof", fold it into 'cast int Size to T*' instead of 'gep 0, 0, 12'
810 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
811 if (!isa<ConstantInt>(Ops[i])) {
813 // If this is "gep i8* Ptr, (sub 0, V)", fold this as:
814 // "inttoptr (sub (ptrtoint Ptr), V)"
815 if (Ops.size() == 2 && ResElemTy->isIntegerTy(8)) {
816 auto *CE = dyn_cast<ConstantExpr>(Ops[1]);
817 assert((!CE || CE->getType() == IntPtrTy) &&
818 "CastGEPIndices didn't canonicalize index types!");
819 if (CE && CE->getOpcode() == Instruction::Sub &&
820 CE->getOperand(0)->isNullValue()) {
821 Constant *Res = ConstantExpr::getPtrToInt(Ptr, CE->getType());
822 Res = ConstantExpr::getSub(Res, CE->getOperand(1));
823 Res = ConstantExpr::getIntToPtr(Res, ResTy);
824 if (auto *FoldedRes = ConstantFoldConstant(Res, DL, TLI))
832 unsigned BitWidth = DL.getTypeSizeInBits(IntPtrTy);
835 DL.getIndexedOffsetInType(
837 makeArrayRef((Value * const *)Ops.data() + 1, Ops.size() - 1)));
838 Ptr = StripPtrCastKeepAS(Ptr, SrcElemTy);
840 // If this is a GEP of a GEP, fold it all into a single GEP.
841 while (auto *GEP = dyn_cast<GEPOperator>(Ptr)) {
843 InBounds &= GEP->isInBounds();
845 SmallVector<Value *, 4> NestedOps(GEP->op_begin() + 1, GEP->op_end());
847 // Do not try the incorporate the sub-GEP if some index is not a number.
848 bool AllConstantInt = true;
849 for (Value *NestedOp : NestedOps)
850 if (!isa<ConstantInt>(NestedOp)) {
851 AllConstantInt = false;
857 Ptr = cast<Constant>(GEP->getOperand(0));
858 SrcElemTy = GEP->getSourceElementType();
859 Offset += APInt(BitWidth, DL.getIndexedOffsetInType(SrcElemTy, NestedOps));
860 Ptr = StripPtrCastKeepAS(Ptr, SrcElemTy);
863 // If the base value for this address is a literal integer value, fold the
864 // getelementptr to the resulting integer value casted to the pointer type.
865 APInt BasePtr(BitWidth, 0);
866 if (auto *CE = dyn_cast<ConstantExpr>(Ptr)) {
867 if (CE->getOpcode() == Instruction::IntToPtr) {
868 if (auto *Base = dyn_cast<ConstantInt>(CE->getOperand(0)))
869 BasePtr = Base->getValue().zextOrTrunc(BitWidth);
873 auto *PTy = cast<PointerType>(Ptr->getType());
874 if ((Ptr->isNullValue() || BasePtr != 0) &&
875 !DL.isNonIntegralPointerType(PTy)) {
876 Constant *C = ConstantInt::get(Ptr->getContext(), Offset + BasePtr);
877 return ConstantExpr::getIntToPtr(C, ResTy);
880 // Otherwise form a regular getelementptr. Recompute the indices so that
881 // we eliminate over-indexing of the notional static type array bounds.
882 // This makes it easy to determine if the getelementptr is "inbounds".
883 // Also, this helps GlobalOpt do SROA on GlobalVariables.
885 SmallVector<Constant *, 32> NewIdxs;
888 if (!Ty->isStructTy()) {
889 if (Ty->isPointerTy()) {
890 // The only pointer indexing we'll do is on the first index of the GEP.
891 if (!NewIdxs.empty())
896 // Only handle pointers to sized types, not pointers to functions.
899 } else if (auto *ATy = dyn_cast<SequentialType>(Ty)) {
900 Ty = ATy->getElementType();
902 // We've reached some non-indexable type.
906 // Determine which element of the array the offset points into.
907 APInt ElemSize(BitWidth, DL.getTypeAllocSize(Ty));
909 // The element size is 0. This may be [0 x Ty]*, so just use a zero
910 // index for this level and proceed to the next level to see if it can
911 // accommodate the offset.
912 NewIdxs.push_back(ConstantInt::get(IntPtrTy, 0));
914 // The element size is non-zero divide the offset by the element
915 // size (rounding down), to compute the index at this level.
917 APInt NewIdx = Offset.sdiv_ov(ElemSize, Overflow);
920 Offset -= NewIdx * ElemSize;
921 NewIdxs.push_back(ConstantInt::get(IntPtrTy, NewIdx));
924 auto *STy = cast<StructType>(Ty);
925 // If we end up with an offset that isn't valid for this struct type, we
926 // can't re-form this GEP in a regular form, so bail out. The pointer
927 // operand likely went through casts that are necessary to make the GEP
929 const StructLayout &SL = *DL.getStructLayout(STy);
930 if (Offset.isNegative() || Offset.uge(SL.getSizeInBytes()))
933 // Determine which field of the struct the offset points into. The
934 // getZExtValue is fine as we've already ensured that the offset is
935 // within the range representable by the StructLayout API.
936 unsigned ElIdx = SL.getElementContainingOffset(Offset.getZExtValue());
937 NewIdxs.push_back(ConstantInt::get(Type::getInt32Ty(Ty->getContext()),
939 Offset -= APInt(BitWidth, SL.getElementOffset(ElIdx));
940 Ty = STy->getTypeAtIndex(ElIdx);
942 } while (Ty != ResElemTy);
944 // If we haven't used up the entire offset by descending the static
945 // type, then the offset is pointing into the middle of an indivisible
946 // member, so we can't simplify it.
950 // Preserve the inrange index from the innermost GEP if possible. We must
951 // have calculated the same indices up to and including the inrange index.
952 Optional<unsigned> InRangeIndex;
953 if (Optional<unsigned> LastIRIndex = InnermostGEP->getInRangeIndex())
954 if (SrcElemTy == InnermostGEP->getSourceElementType() &&
955 NewIdxs.size() > *LastIRIndex) {
956 InRangeIndex = LastIRIndex;
957 for (unsigned I = 0; I <= *LastIRIndex; ++I)
958 if (NewIdxs[I] != InnermostGEP->getOperand(I + 1)) {
965 Constant *C = ConstantExpr::getGetElementPtr(SrcElemTy, Ptr, NewIdxs,
966 InBounds, InRangeIndex);
967 assert(C->getType()->getPointerElementType() == Ty &&
968 "Computed GetElementPtr has unexpected type!");
970 // If we ended up indexing a member with a type that doesn't match
971 // the type of what the original indices indexed, add a cast.
973 C = FoldBitCast(C, ResTy, DL);
978 /// Attempt to constant fold an instruction with the
979 /// specified opcode and operands. If successful, the constant result is
980 /// returned, if not, null is returned. Note that this function can fail when
981 /// attempting to fold instructions like loads and stores, which have no
982 /// constant expression form.
984 /// TODO: This function neither utilizes nor preserves nsw/nuw/inbounds/inrange
985 /// etc information, due to only being passed an opcode and operands. Constant
986 /// folding using this function strips this information.
988 Constant *ConstantFoldInstOperandsImpl(const Value *InstOrCE, unsigned Opcode,
989 ArrayRef<Constant *> Ops,
990 const DataLayout &DL,
991 const TargetLibraryInfo *TLI) {
992 Type *DestTy = InstOrCE->getType();
994 // Handle easy binops first.
995 if (Instruction::isBinaryOp(Opcode))
996 return ConstantFoldBinaryOpOperands(Opcode, Ops[0], Ops[1], DL);
998 if (Instruction::isCast(Opcode))
999 return ConstantFoldCastOperand(Opcode, Ops[0], DestTy, DL);
1001 if (auto *GEP = dyn_cast<GEPOperator>(InstOrCE)) {
1002 if (Constant *C = SymbolicallyEvaluateGEP(GEP, Ops, DL, TLI))
1005 return ConstantExpr::getGetElementPtr(GEP->getSourceElementType(), Ops[0],
1006 Ops.slice(1), GEP->isInBounds(),
1007 GEP->getInRangeIndex());
1010 if (auto *CE = dyn_cast<ConstantExpr>(InstOrCE))
1011 return CE->getWithOperands(Ops);
1014 default: return nullptr;
1015 case Instruction::ICmp:
1016 case Instruction::FCmp: llvm_unreachable("Invalid for compares");
1017 case Instruction::Call:
1018 if (auto *F = dyn_cast<Function>(Ops.back())) {
1019 ImmutableCallSite CS(cast<CallInst>(InstOrCE));
1020 if (canConstantFoldCallTo(CS, F))
1021 return ConstantFoldCall(CS, F, Ops.slice(0, Ops.size() - 1), TLI);
1024 case Instruction::Select:
1025 return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
1026 case Instruction::ExtractElement:
1027 return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
1028 case Instruction::InsertElement:
1029 return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
1030 case Instruction::ShuffleVector:
1031 return ConstantExpr::getShuffleVector(Ops[0], Ops[1], Ops[2]);
1035 } // end anonymous namespace
1037 //===----------------------------------------------------------------------===//
1038 // Constant Folding public APIs
1039 //===----------------------------------------------------------------------===//
1044 ConstantFoldConstantImpl(const Constant *C, const DataLayout &DL,
1045 const TargetLibraryInfo *TLI,
1046 SmallDenseMap<Constant *, Constant *> &FoldedOps) {
1047 if (!isa<ConstantVector>(C) && !isa<ConstantExpr>(C))
1050 SmallVector<Constant *, 8> Ops;
1051 for (const Use &NewU : C->operands()) {
1052 auto *NewC = cast<Constant>(&NewU);
1053 // Recursively fold the ConstantExpr's operands. If we have already folded
1054 // a ConstantExpr, we don't have to process it again.
1055 if (isa<ConstantVector>(NewC) || isa<ConstantExpr>(NewC)) {
1056 auto It = FoldedOps.find(NewC);
1057 if (It == FoldedOps.end()) {
1059 ConstantFoldConstantImpl(NewC, DL, TLI, FoldedOps)) {
1060 FoldedOps.insert({NewC, FoldedC});
1063 FoldedOps.insert({NewC, NewC});
1069 Ops.push_back(NewC);
1072 if (auto *CE = dyn_cast<ConstantExpr>(C)) {
1073 if (CE->isCompare())
1074 return ConstantFoldCompareInstOperands(CE->getPredicate(), Ops[0], Ops[1],
1077 return ConstantFoldInstOperandsImpl(CE, CE->getOpcode(), Ops, DL, TLI);
1080 assert(isa<ConstantVector>(C));
1081 return ConstantVector::get(Ops);
1084 } // end anonymous namespace
1086 Constant *llvm::ConstantFoldInstruction(Instruction *I, const DataLayout &DL,
1087 const TargetLibraryInfo *TLI) {
1088 // Handle PHI nodes quickly here...
1089 if (auto *PN = dyn_cast<PHINode>(I)) {
1090 Constant *CommonValue = nullptr;
1092 SmallDenseMap<Constant *, Constant *> FoldedOps;
1093 for (Value *Incoming : PN->incoming_values()) {
1094 // If the incoming value is undef then skip it. Note that while we could
1095 // skip the value if it is equal to the phi node itself we choose not to
1096 // because that would break the rule that constant folding only applies if
1097 // all operands are constants.
1098 if (isa<UndefValue>(Incoming))
1100 // If the incoming value is not a constant, then give up.
1101 auto *C = dyn_cast<Constant>(Incoming);
1104 // Fold the PHI's operands.
1105 if (auto *FoldedC = ConstantFoldConstantImpl(C, DL, TLI, FoldedOps))
1107 // If the incoming value is a different constant to
1108 // the one we saw previously, then give up.
1109 if (CommonValue && C != CommonValue)
1114 // If we reach here, all incoming values are the same constant or undef.
1115 return CommonValue ? CommonValue : UndefValue::get(PN->getType());
1118 // Scan the operand list, checking to see if they are all constants, if so,
1119 // hand off to ConstantFoldInstOperandsImpl.
1120 if (!all_of(I->operands(), [](Use &U) { return isa<Constant>(U); }))
1123 SmallDenseMap<Constant *, Constant *> FoldedOps;
1124 SmallVector<Constant *, 8> Ops;
1125 for (const Use &OpU : I->operands()) {
1126 auto *Op = cast<Constant>(&OpU);
1127 // Fold the Instruction's operands.
1128 if (auto *FoldedOp = ConstantFoldConstantImpl(Op, DL, TLI, FoldedOps))
1134 if (const auto *CI = dyn_cast<CmpInst>(I))
1135 return ConstantFoldCompareInstOperands(CI->getPredicate(), Ops[0], Ops[1],
1138 if (const auto *LI = dyn_cast<LoadInst>(I))
1139 return ConstantFoldLoadInst(LI, DL);
1141 if (auto *IVI = dyn_cast<InsertValueInst>(I)) {
1142 return ConstantExpr::getInsertValue(
1143 cast<Constant>(IVI->getAggregateOperand()),
1144 cast<Constant>(IVI->getInsertedValueOperand()),
1148 if (auto *EVI = dyn_cast<ExtractValueInst>(I)) {
1149 return ConstantExpr::getExtractValue(
1150 cast<Constant>(EVI->getAggregateOperand()),
1154 return ConstantFoldInstOperands(I, Ops, DL, TLI);
1157 Constant *llvm::ConstantFoldConstant(const Constant *C, const DataLayout &DL,
1158 const TargetLibraryInfo *TLI) {
1159 SmallDenseMap<Constant *, Constant *> FoldedOps;
1160 return ConstantFoldConstantImpl(C, DL, TLI, FoldedOps);
1163 Constant *llvm::ConstantFoldInstOperands(Instruction *I,
1164 ArrayRef<Constant *> Ops,
1165 const DataLayout &DL,
1166 const TargetLibraryInfo *TLI) {
1167 return ConstantFoldInstOperandsImpl(I, I->getOpcode(), Ops, DL, TLI);
1170 Constant *llvm::ConstantFoldCompareInstOperands(unsigned Predicate,
1171 Constant *Ops0, Constant *Ops1,
1172 const DataLayout &DL,
1173 const TargetLibraryInfo *TLI) {
1174 // fold: icmp (inttoptr x), null -> icmp x, 0
1175 // fold: icmp null, (inttoptr x) -> icmp 0, x
1176 // fold: icmp (ptrtoint x), 0 -> icmp x, null
1177 // fold: icmp 0, (ptrtoint x) -> icmp null, x
1178 // fold: icmp (inttoptr x), (inttoptr y) -> icmp trunc/zext x, trunc/zext y
1179 // fold: icmp (ptrtoint x), (ptrtoint y) -> icmp x, y
1181 // FIXME: The following comment is out of data and the DataLayout is here now.
1182 // ConstantExpr::getCompare cannot do this, because it doesn't have DL
1183 // around to know if bit truncation is happening.
1184 if (auto *CE0 = dyn_cast<ConstantExpr>(Ops0)) {
1185 if (Ops1->isNullValue()) {
1186 if (CE0->getOpcode() == Instruction::IntToPtr) {
1187 Type *IntPtrTy = DL.getIntPtrType(CE0->getType());
1188 // Convert the integer value to the right size to ensure we get the
1189 // proper extension or truncation.
1190 Constant *C = ConstantExpr::getIntegerCast(CE0->getOperand(0),
1192 Constant *Null = Constant::getNullValue(C->getType());
1193 return ConstantFoldCompareInstOperands(Predicate, C, Null, DL, TLI);
1196 // Only do this transformation if the int is intptrty in size, otherwise
1197 // there is a truncation or extension that we aren't modeling.
1198 if (CE0->getOpcode() == Instruction::PtrToInt) {
1199 Type *IntPtrTy = DL.getIntPtrType(CE0->getOperand(0)->getType());
1200 if (CE0->getType() == IntPtrTy) {
1201 Constant *C = CE0->getOperand(0);
1202 Constant *Null = Constant::getNullValue(C->getType());
1203 return ConstantFoldCompareInstOperands(Predicate, C, Null, DL, TLI);
1208 if (auto *CE1 = dyn_cast<ConstantExpr>(Ops1)) {
1209 if (CE0->getOpcode() == CE1->getOpcode()) {
1210 if (CE0->getOpcode() == Instruction::IntToPtr) {
1211 Type *IntPtrTy = DL.getIntPtrType(CE0->getType());
1213 // Convert the integer value to the right size to ensure we get the
1214 // proper extension or truncation.
1215 Constant *C0 = ConstantExpr::getIntegerCast(CE0->getOperand(0),
1217 Constant *C1 = ConstantExpr::getIntegerCast(CE1->getOperand(0),
1219 return ConstantFoldCompareInstOperands(Predicate, C0, C1, DL, TLI);
1222 // Only do this transformation if the int is intptrty in size, otherwise
1223 // there is a truncation or extension that we aren't modeling.
1224 if (CE0->getOpcode() == Instruction::PtrToInt) {
1225 Type *IntPtrTy = DL.getIntPtrType(CE0->getOperand(0)->getType());
1226 if (CE0->getType() == IntPtrTy &&
1227 CE0->getOperand(0)->getType() == CE1->getOperand(0)->getType()) {
1228 return ConstantFoldCompareInstOperands(
1229 Predicate, CE0->getOperand(0), CE1->getOperand(0), DL, TLI);
1235 // icmp eq (or x, y), 0 -> (icmp eq x, 0) & (icmp eq y, 0)
1236 // icmp ne (or x, y), 0 -> (icmp ne x, 0) | (icmp ne y, 0)
1237 if ((Predicate == ICmpInst::ICMP_EQ || Predicate == ICmpInst::ICMP_NE) &&
1238 CE0->getOpcode() == Instruction::Or && Ops1->isNullValue()) {
1239 Constant *LHS = ConstantFoldCompareInstOperands(
1240 Predicate, CE0->getOperand(0), Ops1, DL, TLI);
1241 Constant *RHS = ConstantFoldCompareInstOperands(
1242 Predicate, CE0->getOperand(1), Ops1, DL, TLI);
1244 Predicate == ICmpInst::ICMP_EQ ? Instruction::And : Instruction::Or;
1245 return ConstantFoldBinaryOpOperands(OpC, LHS, RHS, DL);
1247 } else if (isa<ConstantExpr>(Ops1)) {
1248 // If RHS is a constant expression, but the left side isn't, swap the
1249 // operands and try again.
1250 Predicate = ICmpInst::getSwappedPredicate((ICmpInst::Predicate)Predicate);
1251 return ConstantFoldCompareInstOperands(Predicate, Ops1, Ops0, DL, TLI);
1254 return ConstantExpr::getCompare(Predicate, Ops0, Ops1);
1257 Constant *llvm::ConstantFoldBinaryOpOperands(unsigned Opcode, Constant *LHS,
1259 const DataLayout &DL) {
1260 assert(Instruction::isBinaryOp(Opcode));
1261 if (isa<ConstantExpr>(LHS) || isa<ConstantExpr>(RHS))
1262 if (Constant *C = SymbolicallyEvaluateBinop(Opcode, LHS, RHS, DL))
1265 return ConstantExpr::get(Opcode, LHS, RHS);
1268 Constant *llvm::ConstantFoldCastOperand(unsigned Opcode, Constant *C,
1269 Type *DestTy, const DataLayout &DL) {
1270 assert(Instruction::isCast(Opcode));
1273 llvm_unreachable("Missing case");
1274 case Instruction::PtrToInt:
1275 // If the input is a inttoptr, eliminate the pair. This requires knowing
1276 // the width of a pointer, so it can't be done in ConstantExpr::getCast.
1277 if (auto *CE = dyn_cast<ConstantExpr>(C)) {
1278 if (CE->getOpcode() == Instruction::IntToPtr) {
1279 Constant *Input = CE->getOperand(0);
1280 unsigned InWidth = Input->getType()->getScalarSizeInBits();
1281 unsigned PtrWidth = DL.getPointerTypeSizeInBits(CE->getType());
1282 if (PtrWidth < InWidth) {
1284 ConstantInt::get(CE->getContext(),
1285 APInt::getLowBitsSet(InWidth, PtrWidth));
1286 Input = ConstantExpr::getAnd(Input, Mask);
1288 // Do a zext or trunc to get to the dest size.
1289 return ConstantExpr::getIntegerCast(Input, DestTy, false);
1292 return ConstantExpr::getCast(Opcode, C, DestTy);
1293 case Instruction::IntToPtr:
1294 // If the input is a ptrtoint, turn the pair into a ptr to ptr bitcast if
1295 // the int size is >= the ptr size and the address spaces are the same.
1296 // This requires knowing the width of a pointer, so it can't be done in
1297 // ConstantExpr::getCast.
1298 if (auto *CE = dyn_cast<ConstantExpr>(C)) {
1299 if (CE->getOpcode() == Instruction::PtrToInt) {
1300 Constant *SrcPtr = CE->getOperand(0);
1301 unsigned SrcPtrSize = DL.getPointerTypeSizeInBits(SrcPtr->getType());
1302 unsigned MidIntSize = CE->getType()->getScalarSizeInBits();
1304 if (MidIntSize >= SrcPtrSize) {
1305 unsigned SrcAS = SrcPtr->getType()->getPointerAddressSpace();
1306 if (SrcAS == DestTy->getPointerAddressSpace())
1307 return FoldBitCast(CE->getOperand(0), DestTy, DL);
1312 return ConstantExpr::getCast(Opcode, C, DestTy);
1313 case Instruction::Trunc:
1314 case Instruction::ZExt:
1315 case Instruction::SExt:
1316 case Instruction::FPTrunc:
1317 case Instruction::FPExt:
1318 case Instruction::UIToFP:
1319 case Instruction::SIToFP:
1320 case Instruction::FPToUI:
1321 case Instruction::FPToSI:
1322 case Instruction::AddrSpaceCast:
1323 return ConstantExpr::getCast(Opcode, C, DestTy);
1324 case Instruction::BitCast:
1325 return FoldBitCast(C, DestTy, DL);
1329 Constant *llvm::ConstantFoldLoadThroughGEPConstantExpr(Constant *C,
1331 if (!CE->getOperand(1)->isNullValue())
1332 return nullptr; // Do not allow stepping over the value!
1334 // Loop over all of the operands, tracking down which value we are
1336 for (unsigned i = 2, e = CE->getNumOperands(); i != e; ++i) {
1337 C = C->getAggregateElement(CE->getOperand(i));
1345 llvm::ConstantFoldLoadThroughGEPIndices(Constant *C,
1346 ArrayRef<Constant *> Indices) {
1347 // Loop over all of the operands, tracking down which value we are
1349 for (Constant *Index : Indices) {
1350 C = C->getAggregateElement(Index);
1357 //===----------------------------------------------------------------------===//
1358 // Constant Folding for Calls
1361 bool llvm::canConstantFoldCallTo(ImmutableCallSite CS, const Function *F) {
1362 if (CS.isNoBuiltin() || CS.isStrictFP())
1364 switch (F->getIntrinsicID()) {
1365 case Intrinsic::fabs:
1366 case Intrinsic::minnum:
1367 case Intrinsic::maxnum:
1368 case Intrinsic::log:
1369 case Intrinsic::log2:
1370 case Intrinsic::log10:
1371 case Intrinsic::exp:
1372 case Intrinsic::exp2:
1373 case Intrinsic::floor:
1374 case Intrinsic::ceil:
1375 case Intrinsic::sqrt:
1376 case Intrinsic::sin:
1377 case Intrinsic::cos:
1378 case Intrinsic::trunc:
1379 case Intrinsic::rint:
1380 case Intrinsic::nearbyint:
1381 case Intrinsic::pow:
1382 case Intrinsic::powi:
1383 case Intrinsic::bswap:
1384 case Intrinsic::ctpop:
1385 case Intrinsic::ctlz:
1386 case Intrinsic::cttz:
1387 case Intrinsic::fma:
1388 case Intrinsic::fmuladd:
1389 case Intrinsic::copysign:
1390 case Intrinsic::round:
1391 case Intrinsic::masked_load:
1392 case Intrinsic::sadd_with_overflow:
1393 case Intrinsic::uadd_with_overflow:
1394 case Intrinsic::ssub_with_overflow:
1395 case Intrinsic::usub_with_overflow:
1396 case Intrinsic::smul_with_overflow:
1397 case Intrinsic::umul_with_overflow:
1398 case Intrinsic::convert_from_fp16:
1399 case Intrinsic::convert_to_fp16:
1400 case Intrinsic::bitreverse:
1401 case Intrinsic::x86_sse_cvtss2si:
1402 case Intrinsic::x86_sse_cvtss2si64:
1403 case Intrinsic::x86_sse_cvttss2si:
1404 case Intrinsic::x86_sse_cvttss2si64:
1405 case Intrinsic::x86_sse2_cvtsd2si:
1406 case Intrinsic::x86_sse2_cvtsd2si64:
1407 case Intrinsic::x86_sse2_cvttsd2si:
1408 case Intrinsic::x86_sse2_cvttsd2si64:
1412 case Intrinsic::not_intrinsic: break;
1417 StringRef Name = F->getName();
1419 // In these cases, the check of the length is required. We don't want to
1420 // return true for a name like "cos\0blah" which strcmp would return equal to
1421 // "cos", but has length 8.
1426 return Name == "acos" || Name == "asin" || Name == "atan" ||
1427 Name == "atan2" || Name == "acosf" || Name == "asinf" ||
1428 Name == "atanf" || Name == "atan2f";
1430 return Name == "ceil" || Name == "cos" || Name == "cosh" ||
1431 Name == "ceilf" || Name == "cosf" || Name == "coshf";
1433 return Name == "exp" || Name == "exp2" || Name == "expf" || Name == "exp2f";
1435 return Name == "fabs" || Name == "floor" || Name == "fmod" ||
1436 Name == "fabsf" || Name == "floorf" || Name == "fmodf";
1438 return Name == "log" || Name == "log10" || Name == "logf" ||
1441 return Name == "pow" || Name == "powf";
1443 return Name == "round" || Name == "roundf";
1445 return Name == "sin" || Name == "sinh" || Name == "sqrt" ||
1446 Name == "sinf" || Name == "sinhf" || Name == "sqrtf";
1448 return Name == "tan" || Name == "tanh" || Name == "tanf" || Name == "tanhf";
1451 // Check for various function names that get used for the math functions
1452 // when the header files are preprocessed with the macro
1453 // __FINITE_MATH_ONLY__ enabled.
1454 // The '12' here is the length of the shortest name that can match.
1455 // We need to check the size before looking at Name[1] and Name[2]
1456 // so we may as well check a limit that will eliminate mismatches.
1457 if (Name.size() < 12 || Name[1] != '_')
1463 return Name == "__acos_finite" || Name == "__acosf_finite" ||
1464 Name == "__asin_finite" || Name == "__asinf_finite" ||
1465 Name == "__atan2_finite" || Name == "__atan2f_finite";
1467 return Name == "__cosh_finite" || Name == "__coshf_finite";
1469 return Name == "__exp_finite" || Name == "__expf_finite" ||
1470 Name == "__exp2_finite" || Name == "__exp2f_finite";
1472 return Name == "__log_finite" || Name == "__logf_finite" ||
1473 Name == "__log10_finite" || Name == "__log10f_finite";
1475 return Name == "__pow_finite" || Name == "__powf_finite";
1477 return Name == "__sinh_finite" || Name == "__sinhf_finite";
1484 Constant *GetConstantFoldFPValue(double V, Type *Ty) {
1485 if (Ty->isHalfTy()) {
1488 APF.convert(APFloat::IEEEhalf(), APFloat::rmNearestTiesToEven, &unused);
1489 return ConstantFP::get(Ty->getContext(), APF);
1491 if (Ty->isFloatTy())
1492 return ConstantFP::get(Ty->getContext(), APFloat((float)V));
1493 if (Ty->isDoubleTy())
1494 return ConstantFP::get(Ty->getContext(), APFloat(V));
1495 llvm_unreachable("Can only constant fold half/float/double");
1498 /// Clear the floating-point exception state.
1499 inline void llvm_fenv_clearexcept() {
1500 #if defined(HAVE_FENV_H) && HAVE_DECL_FE_ALL_EXCEPT
1501 feclearexcept(FE_ALL_EXCEPT);
1506 /// Test if a floating-point exception was raised.
1507 inline bool llvm_fenv_testexcept() {
1508 int errno_val = errno;
1509 if (errno_val == ERANGE || errno_val == EDOM)
1511 #if defined(HAVE_FENV_H) && HAVE_DECL_FE_ALL_EXCEPT && HAVE_DECL_FE_INEXACT
1512 if (fetestexcept(FE_ALL_EXCEPT & ~FE_INEXACT))
1518 Constant *ConstantFoldFP(double (*NativeFP)(double), double V, Type *Ty) {
1519 llvm_fenv_clearexcept();
1521 if (llvm_fenv_testexcept()) {
1522 llvm_fenv_clearexcept();
1526 return GetConstantFoldFPValue(V, Ty);
1529 Constant *ConstantFoldBinaryFP(double (*NativeFP)(double, double), double V,
1530 double W, Type *Ty) {
1531 llvm_fenv_clearexcept();
1533 if (llvm_fenv_testexcept()) {
1534 llvm_fenv_clearexcept();
1538 return GetConstantFoldFPValue(V, Ty);
1541 /// Attempt to fold an SSE floating point to integer conversion of a constant
1542 /// floating point. If roundTowardZero is false, the default IEEE rounding is
1543 /// used (toward nearest, ties to even). This matches the behavior of the
1544 /// non-truncating SSE instructions in the default rounding mode. The desired
1545 /// integer type Ty is used to select how many bits are available for the
1546 /// result. Returns null if the conversion cannot be performed, otherwise
1547 /// returns the Constant value resulting from the conversion.
1548 Constant *ConstantFoldSSEConvertToInt(const APFloat &Val, bool roundTowardZero,
1550 // All of these conversion intrinsics form an integer of at most 64bits.
1551 unsigned ResultWidth = Ty->getIntegerBitWidth();
1552 assert(ResultWidth <= 64 &&
1553 "Can only constant fold conversions to 64 and 32 bit ints");
1556 bool isExact = false;
1557 APFloat::roundingMode mode = roundTowardZero? APFloat::rmTowardZero
1558 : APFloat::rmNearestTiesToEven;
1559 APFloat::opStatus status =
1560 Val.convertToInteger(makeMutableArrayRef(UIntVal), ResultWidth,
1561 /*isSigned=*/true, mode, &isExact);
1562 if (status != APFloat::opOK &&
1563 (!roundTowardZero || status != APFloat::opInexact))
1565 return ConstantInt::get(Ty, UIntVal, /*isSigned=*/true);
1568 double getValueAsDouble(ConstantFP *Op) {
1569 Type *Ty = Op->getType();
1571 if (Ty->isFloatTy())
1572 return Op->getValueAPF().convertToFloat();
1574 if (Ty->isDoubleTy())
1575 return Op->getValueAPF().convertToDouble();
1578 APFloat APF = Op->getValueAPF();
1579 APF.convert(APFloat::IEEEdouble(), APFloat::rmNearestTiesToEven, &unused);
1580 return APF.convertToDouble();
1583 Constant *ConstantFoldScalarCall(StringRef Name, unsigned IntrinsicID, Type *Ty,
1584 ArrayRef<Constant *> Operands,
1585 const TargetLibraryInfo *TLI) {
1586 if (Operands.size() == 1) {
1587 if (isa<UndefValue>(Operands[0])) {
1588 // cosine(arg) is between -1 and 1. cosine(invalid arg) is NaN
1589 if (IntrinsicID == Intrinsic::cos)
1590 return Constant::getNullValue(Ty);
1591 if (IntrinsicID == Intrinsic::bswap ||
1592 IntrinsicID == Intrinsic::bitreverse)
1595 if (auto *Op = dyn_cast<ConstantFP>(Operands[0])) {
1596 if (IntrinsicID == Intrinsic::convert_to_fp16) {
1597 APFloat Val(Op->getValueAPF());
1600 Val.convert(APFloat::IEEEhalf(), APFloat::rmNearestTiesToEven, &lost);
1602 return ConstantInt::get(Ty->getContext(), Val.bitcastToAPInt());
1605 if (!Ty->isHalfTy() && !Ty->isFloatTy() && !Ty->isDoubleTy())
1608 if (IntrinsicID == Intrinsic::round) {
1609 APFloat V = Op->getValueAPF();
1610 V.roundToIntegral(APFloat::rmNearestTiesToAway);
1611 return ConstantFP::get(Ty->getContext(), V);
1614 if (IntrinsicID == Intrinsic::floor) {
1615 APFloat V = Op->getValueAPF();
1616 V.roundToIntegral(APFloat::rmTowardNegative);
1617 return ConstantFP::get(Ty->getContext(), V);
1620 if (IntrinsicID == Intrinsic::ceil) {
1621 APFloat V = Op->getValueAPF();
1622 V.roundToIntegral(APFloat::rmTowardPositive);
1623 return ConstantFP::get(Ty->getContext(), V);
1626 if (IntrinsicID == Intrinsic::trunc) {
1627 APFloat V = Op->getValueAPF();
1628 V.roundToIntegral(APFloat::rmTowardZero);
1629 return ConstantFP::get(Ty->getContext(), V);
1632 if (IntrinsicID == Intrinsic::rint) {
1633 APFloat V = Op->getValueAPF();
1634 V.roundToIntegral(APFloat::rmNearestTiesToEven);
1635 return ConstantFP::get(Ty->getContext(), V);
1638 if (IntrinsicID == Intrinsic::nearbyint) {
1639 APFloat V = Op->getValueAPF();
1640 V.roundToIntegral(APFloat::rmNearestTiesToEven);
1641 return ConstantFP::get(Ty->getContext(), V);
1644 /// We only fold functions with finite arguments. Folding NaN and inf is
1645 /// likely to be aborted with an exception anyway, and some host libms
1646 /// have known errors raising exceptions.
1647 if (Op->getValueAPF().isNaN() || Op->getValueAPF().isInfinity())
1650 /// Currently APFloat versions of these functions do not exist, so we use
1651 /// the host native double versions. Float versions are not called
1652 /// directly but for all these it is true (float)(f((double)arg)) ==
1653 /// f(arg). Long double not supported yet.
1654 double V = getValueAsDouble(Op);
1656 switch (IntrinsicID) {
1658 case Intrinsic::fabs:
1659 return ConstantFoldFP(fabs, V, Ty);
1660 case Intrinsic::log2:
1661 return ConstantFoldFP(Log2, V, Ty);
1662 case Intrinsic::log:
1663 return ConstantFoldFP(log, V, Ty);
1664 case Intrinsic::log10:
1665 return ConstantFoldFP(log10, V, Ty);
1666 case Intrinsic::exp:
1667 return ConstantFoldFP(exp, V, Ty);
1668 case Intrinsic::exp2:
1669 return ConstantFoldFP(exp2, V, Ty);
1670 case Intrinsic::sin:
1671 return ConstantFoldFP(sin, V, Ty);
1672 case Intrinsic::cos:
1673 return ConstantFoldFP(cos, V, Ty);
1674 case Intrinsic::sqrt:
1675 return ConstantFoldFP(sqrt, V, Ty);
1681 char NameKeyChar = Name[0];
1682 if (Name[0] == '_' && Name.size() > 2 && Name[1] == '_')
1683 NameKeyChar = Name[2];
1685 switch (NameKeyChar) {
1687 if ((Name == "acos" && TLI->has(LibFunc_acos)) ||
1688 (Name == "acosf" && TLI->has(LibFunc_acosf)) ||
1689 (Name == "__acos_finite" && TLI->has(LibFunc_acos_finite)) ||
1690 (Name == "__acosf_finite" && TLI->has(LibFunc_acosf_finite)))
1691 return ConstantFoldFP(acos, V, Ty);
1692 else if ((Name == "asin" && TLI->has(LibFunc_asin)) ||
1693 (Name == "asinf" && TLI->has(LibFunc_asinf)) ||
1694 (Name == "__asin_finite" && TLI->has(LibFunc_asin_finite)) ||
1695 (Name == "__asinf_finite" && TLI->has(LibFunc_asinf_finite)))
1696 return ConstantFoldFP(asin, V, Ty);
1697 else if ((Name == "atan" && TLI->has(LibFunc_atan)) ||
1698 (Name == "atanf" && TLI->has(LibFunc_atanf)))
1699 return ConstantFoldFP(atan, V, Ty);
1702 if ((Name == "ceil" && TLI->has(LibFunc_ceil)) ||
1703 (Name == "ceilf" && TLI->has(LibFunc_ceilf)))
1704 return ConstantFoldFP(ceil, V, Ty);
1705 else if ((Name == "cos" && TLI->has(LibFunc_cos)) ||
1706 (Name == "cosf" && TLI->has(LibFunc_cosf)))
1707 return ConstantFoldFP(cos, V, Ty);
1708 else if ((Name == "cosh" && TLI->has(LibFunc_cosh)) ||
1709 (Name == "coshf" && TLI->has(LibFunc_coshf)) ||
1710 (Name == "__cosh_finite" && TLI->has(LibFunc_cosh_finite)) ||
1711 (Name == "__coshf_finite" && TLI->has(LibFunc_coshf_finite)))
1712 return ConstantFoldFP(cosh, V, Ty);
1715 if ((Name == "exp" && TLI->has(LibFunc_exp)) ||
1716 (Name == "expf" && TLI->has(LibFunc_expf)) ||
1717 (Name == "__exp_finite" && TLI->has(LibFunc_exp_finite)) ||
1718 (Name == "__expf_finite" && TLI->has(LibFunc_expf_finite)))
1719 return ConstantFoldFP(exp, V, Ty);
1720 if ((Name == "exp2" && TLI->has(LibFunc_exp2)) ||
1721 (Name == "exp2f" && TLI->has(LibFunc_exp2f)) ||
1722 (Name == "__exp2_finite" && TLI->has(LibFunc_exp2_finite)) ||
1723 (Name == "__exp2f_finite" && TLI->has(LibFunc_exp2f_finite)))
1724 // Constant fold exp2(x) as pow(2,x) in case the host doesn't have a
1726 return ConstantFoldBinaryFP(pow, 2.0, V, Ty);
1729 if ((Name == "fabs" && TLI->has(LibFunc_fabs)) ||
1730 (Name == "fabsf" && TLI->has(LibFunc_fabsf)))
1731 return ConstantFoldFP(fabs, V, Ty);
1732 else if ((Name == "floor" && TLI->has(LibFunc_floor)) ||
1733 (Name == "floorf" && TLI->has(LibFunc_floorf)))
1734 return ConstantFoldFP(floor, V, Ty);
1737 if ((Name == "log" && V > 0 && TLI->has(LibFunc_log)) ||
1738 (Name == "logf" && V > 0 && TLI->has(LibFunc_logf)) ||
1739 (Name == "__log_finite" && V > 0 &&
1740 TLI->has(LibFunc_log_finite)) ||
1741 (Name == "__logf_finite" && V > 0 &&
1742 TLI->has(LibFunc_logf_finite)))
1743 return ConstantFoldFP(log, V, Ty);
1744 else if ((Name == "log10" && V > 0 && TLI->has(LibFunc_log10)) ||
1745 (Name == "log10f" && V > 0 && TLI->has(LibFunc_log10f)) ||
1746 (Name == "__log10_finite" && V > 0 &&
1747 TLI->has(LibFunc_log10_finite)) ||
1748 (Name == "__log10f_finite" && V > 0 &&
1749 TLI->has(LibFunc_log10f_finite)))
1750 return ConstantFoldFP(log10, V, Ty);
1753 if ((Name == "round" && TLI->has(LibFunc_round)) ||
1754 (Name == "roundf" && TLI->has(LibFunc_roundf)))
1755 return ConstantFoldFP(round, V, Ty);
1758 if ((Name == "sin" && TLI->has(LibFunc_sin)) ||
1759 (Name == "sinf" && TLI->has(LibFunc_sinf)))
1760 return ConstantFoldFP(sin, V, Ty);
1761 else if ((Name == "sinh" && TLI->has(LibFunc_sinh)) ||
1762 (Name == "sinhf" && TLI->has(LibFunc_sinhf)) ||
1763 (Name == "__sinh_finite" && TLI->has(LibFunc_sinh_finite)) ||
1764 (Name == "__sinhf_finite" && TLI->has(LibFunc_sinhf_finite)))
1765 return ConstantFoldFP(sinh, V, Ty);
1766 else if ((Name == "sqrt" && V >= 0 && TLI->has(LibFunc_sqrt)) ||
1767 (Name == "sqrtf" && V >= 0 && TLI->has(LibFunc_sqrtf)))
1768 return ConstantFoldFP(sqrt, V, Ty);
1771 if ((Name == "tan" && TLI->has(LibFunc_tan)) ||
1772 (Name == "tanf" && TLI->has(LibFunc_tanf)))
1773 return ConstantFoldFP(tan, V, Ty);
1774 else if ((Name == "tanh" && TLI->has(LibFunc_tanh)) ||
1775 (Name == "tanhf" && TLI->has(LibFunc_tanhf)))
1776 return ConstantFoldFP(tanh, V, Ty);
1784 if (auto *Op = dyn_cast<ConstantInt>(Operands[0])) {
1785 switch (IntrinsicID) {
1786 case Intrinsic::bswap:
1787 return ConstantInt::get(Ty->getContext(), Op->getValue().byteSwap());
1788 case Intrinsic::ctpop:
1789 return ConstantInt::get(Ty, Op->getValue().countPopulation());
1790 case Intrinsic::bitreverse:
1791 return ConstantInt::get(Ty->getContext(), Op->getValue().reverseBits());
1792 case Intrinsic::convert_from_fp16: {
1793 APFloat Val(APFloat::IEEEhalf(), Op->getValue());
1796 APFloat::opStatus status = Val.convert(
1797 Ty->getFltSemantics(), APFloat::rmNearestTiesToEven, &lost);
1799 // Conversion is always precise.
1801 assert(status == APFloat::opOK && !lost &&
1802 "Precision lost during fp16 constfolding");
1804 return ConstantFP::get(Ty->getContext(), Val);
1811 // Support ConstantVector in case we have an Undef in the top.
1812 if (isa<ConstantVector>(Operands[0]) ||
1813 isa<ConstantDataVector>(Operands[0])) {
1814 auto *Op = cast<Constant>(Operands[0]);
1815 switch (IntrinsicID) {
1817 case Intrinsic::x86_sse_cvtss2si:
1818 case Intrinsic::x86_sse_cvtss2si64:
1819 case Intrinsic::x86_sse2_cvtsd2si:
1820 case Intrinsic::x86_sse2_cvtsd2si64:
1821 if (ConstantFP *FPOp =
1822 dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
1823 return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
1824 /*roundTowardZero=*/false, Ty);
1826 case Intrinsic::x86_sse_cvttss2si:
1827 case Intrinsic::x86_sse_cvttss2si64:
1828 case Intrinsic::x86_sse2_cvttsd2si:
1829 case Intrinsic::x86_sse2_cvttsd2si64:
1830 if (ConstantFP *FPOp =
1831 dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
1832 return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
1833 /*roundTowardZero=*/true, Ty);
1841 if (Operands.size() == 2) {
1842 if (auto *Op1 = dyn_cast<ConstantFP>(Operands[0])) {
1843 if (!Ty->isHalfTy() && !Ty->isFloatTy() && !Ty->isDoubleTy())
1845 double Op1V = getValueAsDouble(Op1);
1847 if (auto *Op2 = dyn_cast<ConstantFP>(Operands[1])) {
1848 if (Op2->getType() != Op1->getType())
1851 double Op2V = getValueAsDouble(Op2);
1852 if (IntrinsicID == Intrinsic::pow) {
1853 return ConstantFoldBinaryFP(pow, Op1V, Op2V, Ty);
1855 if (IntrinsicID == Intrinsic::copysign) {
1856 APFloat V1 = Op1->getValueAPF();
1857 const APFloat &V2 = Op2->getValueAPF();
1859 return ConstantFP::get(Ty->getContext(), V1);
1862 if (IntrinsicID == Intrinsic::minnum) {
1863 const APFloat &C1 = Op1->getValueAPF();
1864 const APFloat &C2 = Op2->getValueAPF();
1865 return ConstantFP::get(Ty->getContext(), minnum(C1, C2));
1868 if (IntrinsicID == Intrinsic::maxnum) {
1869 const APFloat &C1 = Op1->getValueAPF();
1870 const APFloat &C2 = Op2->getValueAPF();
1871 return ConstantFP::get(Ty->getContext(), maxnum(C1, C2));
1876 if ((Name == "pow" && TLI->has(LibFunc_pow)) ||
1877 (Name == "powf" && TLI->has(LibFunc_powf)) ||
1878 (Name == "__pow_finite" && TLI->has(LibFunc_pow_finite)) ||
1879 (Name == "__powf_finite" && TLI->has(LibFunc_powf_finite)))
1880 return ConstantFoldBinaryFP(pow, Op1V, Op2V, Ty);
1881 if ((Name == "fmod" && TLI->has(LibFunc_fmod)) ||
1882 (Name == "fmodf" && TLI->has(LibFunc_fmodf)))
1883 return ConstantFoldBinaryFP(fmod, Op1V, Op2V, Ty);
1884 if ((Name == "atan2" && TLI->has(LibFunc_atan2)) ||
1885 (Name == "atan2f" && TLI->has(LibFunc_atan2f)) ||
1886 (Name == "__atan2_finite" && TLI->has(LibFunc_atan2_finite)) ||
1887 (Name == "__atan2f_finite" && TLI->has(LibFunc_atan2f_finite)))
1888 return ConstantFoldBinaryFP(atan2, Op1V, Op2V, Ty);
1889 } else if (auto *Op2C = dyn_cast<ConstantInt>(Operands[1])) {
1890 if (IntrinsicID == Intrinsic::powi && Ty->isHalfTy())
1891 return ConstantFP::get(Ty->getContext(),
1892 APFloat((float)std::pow((float)Op1V,
1893 (int)Op2C->getZExtValue())));
1894 if (IntrinsicID == Intrinsic::powi && Ty->isFloatTy())
1895 return ConstantFP::get(Ty->getContext(),
1896 APFloat((float)std::pow((float)Op1V,
1897 (int)Op2C->getZExtValue())));
1898 if (IntrinsicID == Intrinsic::powi && Ty->isDoubleTy())
1899 return ConstantFP::get(Ty->getContext(),
1900 APFloat((double)std::pow((double)Op1V,
1901 (int)Op2C->getZExtValue())));
1906 if (auto *Op1 = dyn_cast<ConstantInt>(Operands[0])) {
1907 if (auto *Op2 = dyn_cast<ConstantInt>(Operands[1])) {
1908 switch (IntrinsicID) {
1910 case Intrinsic::sadd_with_overflow:
1911 case Intrinsic::uadd_with_overflow:
1912 case Intrinsic::ssub_with_overflow:
1913 case Intrinsic::usub_with_overflow:
1914 case Intrinsic::smul_with_overflow:
1915 case Intrinsic::umul_with_overflow: {
1918 switch (IntrinsicID) {
1919 default: llvm_unreachable("Invalid case");
1920 case Intrinsic::sadd_with_overflow:
1921 Res = Op1->getValue().sadd_ov(Op2->getValue(), Overflow);
1923 case Intrinsic::uadd_with_overflow:
1924 Res = Op1->getValue().uadd_ov(Op2->getValue(), Overflow);
1926 case Intrinsic::ssub_with_overflow:
1927 Res = Op1->getValue().ssub_ov(Op2->getValue(), Overflow);
1929 case Intrinsic::usub_with_overflow:
1930 Res = Op1->getValue().usub_ov(Op2->getValue(), Overflow);
1932 case Intrinsic::smul_with_overflow:
1933 Res = Op1->getValue().smul_ov(Op2->getValue(), Overflow);
1935 case Intrinsic::umul_with_overflow:
1936 Res = Op1->getValue().umul_ov(Op2->getValue(), Overflow);
1940 ConstantInt::get(Ty->getContext(), Res),
1941 ConstantInt::get(Type::getInt1Ty(Ty->getContext()), Overflow)
1943 return ConstantStruct::get(cast<StructType>(Ty), Ops);
1945 case Intrinsic::cttz:
1946 if (Op2->isOne() && Op1->isZero()) // cttz(0, 1) is undef.
1947 return UndefValue::get(Ty);
1948 return ConstantInt::get(Ty, Op1->getValue().countTrailingZeros());
1949 case Intrinsic::ctlz:
1950 if (Op2->isOne() && Op1->isZero()) // ctlz(0, 1) is undef.
1951 return UndefValue::get(Ty);
1952 return ConstantInt::get(Ty, Op1->getValue().countLeadingZeros());
1961 if (Operands.size() != 3)
1964 if (const auto *Op1 = dyn_cast<ConstantFP>(Operands[0])) {
1965 if (const auto *Op2 = dyn_cast<ConstantFP>(Operands[1])) {
1966 if (const auto *Op3 = dyn_cast<ConstantFP>(Operands[2])) {
1967 switch (IntrinsicID) {
1969 case Intrinsic::fma:
1970 case Intrinsic::fmuladd: {
1971 APFloat V = Op1->getValueAPF();
1972 APFloat::opStatus s = V.fusedMultiplyAdd(Op2->getValueAPF(),
1974 APFloat::rmNearestTiesToEven);
1975 if (s != APFloat::opInvalidOp)
1976 return ConstantFP::get(Ty->getContext(), V);
1988 Constant *ConstantFoldVectorCall(StringRef Name, unsigned IntrinsicID,
1989 VectorType *VTy, ArrayRef<Constant *> Operands,
1990 const DataLayout &DL,
1991 const TargetLibraryInfo *TLI) {
1992 SmallVector<Constant *, 4> Result(VTy->getNumElements());
1993 SmallVector<Constant *, 4> Lane(Operands.size());
1994 Type *Ty = VTy->getElementType();
1996 if (IntrinsicID == Intrinsic::masked_load) {
1997 auto *SrcPtr = Operands[0];
1998 auto *Mask = Operands[2];
1999 auto *Passthru = Operands[3];
2001 Constant *VecData = ConstantFoldLoadFromConstPtr(SrcPtr, VTy, DL);
2003 SmallVector<Constant *, 32> NewElements;
2004 for (unsigned I = 0, E = VTy->getNumElements(); I != E; ++I) {
2005 auto *MaskElt = Mask->getAggregateElement(I);
2008 auto *PassthruElt = Passthru->getAggregateElement(I);
2009 auto *VecElt = VecData ? VecData->getAggregateElement(I) : nullptr;
2010 if (isa<UndefValue>(MaskElt)) {
2012 NewElements.push_back(PassthruElt);
2014 NewElements.push_back(VecElt);
2018 if (MaskElt->isNullValue()) {
2021 NewElements.push_back(PassthruElt);
2022 } else if (MaskElt->isOneValue()) {
2025 NewElements.push_back(VecElt);
2030 if (NewElements.size() != VTy->getNumElements())
2032 return ConstantVector::get(NewElements);
2035 for (unsigned I = 0, E = VTy->getNumElements(); I != E; ++I) {
2036 // Gather a column of constants.
2037 for (unsigned J = 0, JE = Operands.size(); J != JE; ++J) {
2038 // These intrinsics use a scalar type for their second argument.
2040 (IntrinsicID == Intrinsic::cttz || IntrinsicID == Intrinsic::ctlz ||
2041 IntrinsicID == Intrinsic::powi)) {
2042 Lane[J] = Operands[J];
2046 Constant *Agg = Operands[J]->getAggregateElement(I);
2053 // Use the regular scalar folding to simplify this column.
2054 Constant *Folded = ConstantFoldScalarCall(Name, IntrinsicID, Ty, Lane, TLI);
2060 return ConstantVector::get(Result);
2063 } // end anonymous namespace
2066 llvm::ConstantFoldCall(ImmutableCallSite CS, Function *F,
2067 ArrayRef<Constant *> Operands,
2068 const TargetLibraryInfo *TLI) {
2069 if (CS.isNoBuiltin() || CS.isStrictFP())
2073 StringRef Name = F->getName();
2075 Type *Ty = F->getReturnType();
2077 if (auto *VTy = dyn_cast<VectorType>(Ty))
2078 return ConstantFoldVectorCall(Name, F->getIntrinsicID(), VTy, Operands,
2079 F->getParent()->getDataLayout(), TLI);
2081 return ConstantFoldScalarCall(Name, F->getIntrinsicID(), Ty, Operands, TLI);
2084 bool llvm::isMathLibCallNoop(CallSite CS, const TargetLibraryInfo *TLI) {
2085 // FIXME: Refactor this code; this duplicates logic in LibCallsShrinkWrap
2086 // (and to some extent ConstantFoldScalarCall).
2087 if (CS.isNoBuiltin() || CS.isStrictFP())
2089 Function *F = CS.getCalledFunction();
2094 if (!TLI || !TLI->getLibFunc(*F, Func))
2097 if (CS.getNumArgOperands() == 1) {
2098 if (ConstantFP *OpC = dyn_cast<ConstantFP>(CS.getArgOperand(0))) {
2099 const APFloat &Op = OpC->getValueAPF();
2107 case LibFunc_log10l:
2109 case LibFunc_log10f:
2110 return Op.isNaN() || (!Op.isZero() && !Op.isNegative());
2115 // FIXME: These boundaries are slightly conservative.
2116 if (OpC->getType()->isDoubleTy())
2117 return Op.compare(APFloat(-745.0)) != APFloat::cmpLessThan &&
2118 Op.compare(APFloat(709.0)) != APFloat::cmpGreaterThan;
2119 if (OpC->getType()->isFloatTy())
2120 return Op.compare(APFloat(-103.0f)) != APFloat::cmpLessThan &&
2121 Op.compare(APFloat(88.0f)) != APFloat::cmpGreaterThan;
2127 // FIXME: These boundaries are slightly conservative.
2128 if (OpC->getType()->isDoubleTy())
2129 return Op.compare(APFloat(-1074.0)) != APFloat::cmpLessThan &&
2130 Op.compare(APFloat(1023.0)) != APFloat::cmpGreaterThan;
2131 if (OpC->getType()->isFloatTy())
2132 return Op.compare(APFloat(-149.0f)) != APFloat::cmpLessThan &&
2133 Op.compare(APFloat(127.0f)) != APFloat::cmpGreaterThan;
2142 return !Op.isInfinity();
2146 case LibFunc_tanf: {
2147 // FIXME: Stop using the host math library.
2148 // FIXME: The computation isn't done in the right precision.
2149 Type *Ty = OpC->getType();
2150 if (Ty->isDoubleTy() || Ty->isFloatTy() || Ty->isHalfTy()) {
2151 double OpV = getValueAsDouble(OpC);
2152 return ConstantFoldFP(tan, OpV, Ty) != nullptr;
2163 return Op.compare(APFloat(Op.getSemantics(), "-1")) !=
2164 APFloat::cmpLessThan &&
2165 Op.compare(APFloat(Op.getSemantics(), "1")) !=
2166 APFloat::cmpGreaterThan;
2174 // FIXME: These boundaries are slightly conservative.
2175 if (OpC->getType()->isDoubleTy())
2176 return Op.compare(APFloat(-710.0)) != APFloat::cmpLessThan &&
2177 Op.compare(APFloat(710.0)) != APFloat::cmpGreaterThan;
2178 if (OpC->getType()->isFloatTy())
2179 return Op.compare(APFloat(-89.0f)) != APFloat::cmpLessThan &&
2180 Op.compare(APFloat(89.0f)) != APFloat::cmpGreaterThan;
2186 return Op.isNaN() || Op.isZero() || !Op.isNegative();
2188 // FIXME: Add more functions: sqrt_finite, atanh, expm1, log1p,
2196 if (CS.getNumArgOperands() == 2) {
2197 ConstantFP *Op0C = dyn_cast<ConstantFP>(CS.getArgOperand(0));
2198 ConstantFP *Op1C = dyn_cast<ConstantFP>(CS.getArgOperand(1));
2200 const APFloat &Op0 = Op0C->getValueAPF();
2201 const APFloat &Op1 = Op1C->getValueAPF();
2206 case LibFunc_powf: {
2207 // FIXME: Stop using the host math library.
2208 // FIXME: The computation isn't done in the right precision.
2209 Type *Ty = Op0C->getType();
2210 if (Ty->isDoubleTy() || Ty->isFloatTy() || Ty->isHalfTy()) {
2211 if (Ty == Op1C->getType()) {
2212 double Op0V = getValueAsDouble(Op0C);
2213 double Op1V = getValueAsDouble(Op1C);
2214 return ConstantFoldBinaryFP(pow, Op0V, Op1V, Ty) != nullptr;
2223 return Op0.isNaN() || Op1.isNaN() ||
2224 (!Op0.isInfinity() && !Op1.isZero());