1 //===- ConstantFold.cpp - LLVM constant folder ----------------------------===//
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 folding of constants for LLVM. This implements the
11 // (internal) ConstantFold.h interface, which is used by the
12 // ConstantExpr::get* methods to automatically fold constants when possible.
14 // The current constant folding implementation is implemented in two pieces: the
15 // pieces that don't need DataLayout, and the pieces that do. This is to avoid
16 // a dependence in IR on Target.
18 //===----------------------------------------------------------------------===//
20 #include "ConstantFold.h"
21 #include "llvm/ADT/SmallVector.h"
22 #include "llvm/IR/Constants.h"
23 #include "llvm/IR/DerivedTypes.h"
24 #include "llvm/IR/Function.h"
25 #include "llvm/IR/GetElementPtrTypeIterator.h"
26 #include "llvm/IR/GlobalAlias.h"
27 #include "llvm/IR/GlobalVariable.h"
28 #include "llvm/IR/Instructions.h"
29 #include "llvm/IR/Operator.h"
30 #include "llvm/IR/PatternMatch.h"
31 #include "llvm/Support/Compiler.h"
32 #include "llvm/Support/ErrorHandling.h"
33 #include "llvm/Support/ManagedStatic.h"
34 #include "llvm/Support/MathExtras.h"
37 using namespace llvm::PatternMatch;
39 //===----------------------------------------------------------------------===//
40 // ConstantFold*Instruction Implementations
41 //===----------------------------------------------------------------------===//
43 /// BitCastConstantVector - Convert the specified vector Constant node to the
44 /// specified vector type. At this point, we know that the elements of the
45 /// input vector constant are all simple integer or FP values.
46 static Constant *BitCastConstantVector(Constant *CV, VectorType *DstTy) {
48 if (CV->isAllOnesValue()) return Constant::getAllOnesValue(DstTy);
49 if (CV->isNullValue()) return Constant::getNullValue(DstTy);
51 // If this cast changes element count then we can't handle it here:
52 // doing so requires endianness information. This should be handled by
53 // Analysis/ConstantFolding.cpp
54 unsigned NumElts = DstTy->getNumElements();
55 if (NumElts != CV->getType()->getVectorNumElements())
58 Type *DstEltTy = DstTy->getElementType();
60 SmallVector<Constant*, 16> Result;
61 Type *Ty = IntegerType::get(CV->getContext(), 32);
62 for (unsigned i = 0; i != NumElts; ++i) {
64 ConstantExpr::getExtractElement(CV, ConstantInt::get(Ty, i));
65 C = ConstantExpr::getBitCast(C, DstEltTy);
69 return ConstantVector::get(Result);
72 /// This function determines which opcode to use to fold two constant cast
73 /// expressions together. It uses CastInst::isEliminableCastPair to determine
74 /// the opcode. Consequently its just a wrapper around that function.
75 /// @brief Determine if it is valid to fold a cast of a cast
78 unsigned opc, ///< opcode of the second cast constant expression
79 ConstantExpr *Op, ///< the first cast constant expression
80 Type *DstTy ///< destination type of the first cast
82 assert(Op && Op->isCast() && "Can't fold cast of cast without a cast!");
83 assert(DstTy && DstTy->isFirstClassType() && "Invalid cast destination type");
84 assert(CastInst::isCast(opc) && "Invalid cast opcode");
86 // The the types and opcodes for the two Cast constant expressions
87 Type *SrcTy = Op->getOperand(0)->getType();
88 Type *MidTy = Op->getType();
89 Instruction::CastOps firstOp = Instruction::CastOps(Op->getOpcode());
90 Instruction::CastOps secondOp = Instruction::CastOps(opc);
92 // Assume that pointers are never more than 64 bits wide, and only use this
93 // for the middle type. Otherwise we could end up folding away illegal
94 // bitcasts between address spaces with different sizes.
95 IntegerType *FakeIntPtrTy = Type::getInt64Ty(DstTy->getContext());
97 // Let CastInst::isEliminableCastPair do the heavy lifting.
98 return CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy, DstTy,
99 nullptr, FakeIntPtrTy, nullptr);
102 static Constant *FoldBitCast(Constant *V, Type *DestTy) {
103 Type *SrcTy = V->getType();
105 return V; // no-op cast
107 // Check to see if we are casting a pointer to an aggregate to a pointer to
108 // the first element. If so, return the appropriate GEP instruction.
109 if (PointerType *PTy = dyn_cast<PointerType>(V->getType()))
110 if (PointerType *DPTy = dyn_cast<PointerType>(DestTy))
111 if (PTy->getAddressSpace() == DPTy->getAddressSpace()
112 && DPTy->getElementType()->isSized()) {
113 SmallVector<Value*, 8> IdxList;
115 Constant::getNullValue(Type::getInt32Ty(DPTy->getContext()));
116 IdxList.push_back(Zero);
117 Type *ElTy = PTy->getElementType();
118 while (ElTy != DPTy->getElementType()) {
119 if (StructType *STy = dyn_cast<StructType>(ElTy)) {
120 if (STy->getNumElements() == 0) break;
121 ElTy = STy->getElementType(0);
122 IdxList.push_back(Zero);
123 } else if (SequentialType *STy =
124 dyn_cast<SequentialType>(ElTy)) {
125 if (ElTy->isPointerTy()) break; // Can't index into pointers!
126 ElTy = STy->getElementType();
127 IdxList.push_back(Zero);
133 if (ElTy == DPTy->getElementType())
134 // This GEP is inbounds because all indices are zero.
135 return ConstantExpr::getInBoundsGetElementPtr(V, IdxList);
138 // Handle casts from one vector constant to another. We know that the src
139 // and dest type have the same size (otherwise its an illegal cast).
140 if (VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
141 if (VectorType *SrcTy = dyn_cast<VectorType>(V->getType())) {
142 assert(DestPTy->getBitWidth() == SrcTy->getBitWidth() &&
143 "Not cast between same sized vectors!");
145 // First, check for null. Undef is already handled.
146 if (isa<ConstantAggregateZero>(V))
147 return Constant::getNullValue(DestTy);
149 // Handle ConstantVector and ConstantAggregateVector.
150 return BitCastConstantVector(V, DestPTy);
153 // Canonicalize scalar-to-vector bitcasts into vector-to-vector bitcasts
154 // This allows for other simplifications (although some of them
155 // can only be handled by Analysis/ConstantFolding.cpp).
156 if (isa<ConstantInt>(V) || isa<ConstantFP>(V))
157 return ConstantExpr::getBitCast(ConstantVector::get(V), DestPTy);
160 // Finally, implement bitcast folding now. The code below doesn't handle
162 if (isa<ConstantPointerNull>(V)) // ptr->ptr cast.
163 return ConstantPointerNull::get(cast<PointerType>(DestTy));
165 // Handle integral constant input.
166 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
167 if (DestTy->isIntegerTy())
168 // Integral -> Integral. This is a no-op because the bit widths must
169 // be the same. Consequently, we just fold to V.
172 if (DestTy->isFloatingPointTy())
173 return ConstantFP::get(DestTy->getContext(),
174 APFloat(DestTy->getFltSemantics(),
177 // Otherwise, can't fold this (vector?)
181 // Handle ConstantFP input: FP -> Integral.
182 if (ConstantFP *FP = dyn_cast<ConstantFP>(V))
183 return ConstantInt::get(FP->getContext(),
184 FP->getValueAPF().bitcastToAPInt());
190 /// ExtractConstantBytes - V is an integer constant which only has a subset of
191 /// its bytes used. The bytes used are indicated by ByteStart (which is the
192 /// first byte used, counting from the least significant byte) and ByteSize,
193 /// which is the number of bytes used.
195 /// This function analyzes the specified constant to see if the specified byte
196 /// range can be returned as a simplified constant. If so, the constant is
197 /// returned, otherwise null is returned.
199 static Constant *ExtractConstantBytes(Constant *C, unsigned ByteStart,
201 assert(C->getType()->isIntegerTy() &&
202 (cast<IntegerType>(C->getType())->getBitWidth() & 7) == 0 &&
203 "Non-byte sized integer input");
204 unsigned CSize = cast<IntegerType>(C->getType())->getBitWidth()/8;
205 assert(ByteSize && "Must be accessing some piece");
206 assert(ByteStart+ByteSize <= CSize && "Extracting invalid piece from input");
207 assert(ByteSize != CSize && "Should not extract everything");
209 // Constant Integers are simple.
210 if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
211 APInt V = CI->getValue();
213 V = V.lshr(ByteStart*8);
214 V = V.trunc(ByteSize*8);
215 return ConstantInt::get(CI->getContext(), V);
218 // In the input is a constant expr, we might be able to recursively simplify.
219 // If not, we definitely can't do anything.
220 ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
221 if (!CE) return nullptr;
223 switch (CE->getOpcode()) {
224 default: return nullptr;
225 case Instruction::Or: {
226 Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize);
231 if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS))
232 if (RHSC->isAllOnesValue())
235 Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize);
238 return ConstantExpr::getOr(LHS, RHS);
240 case Instruction::And: {
241 Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize);
246 if (RHS->isNullValue())
249 Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize);
252 return ConstantExpr::getAnd(LHS, RHS);
254 case Instruction::LShr: {
255 ConstantInt *Amt = dyn_cast<ConstantInt>(CE->getOperand(1));
258 unsigned ShAmt = Amt->getZExtValue();
259 // Cannot analyze non-byte shifts.
260 if ((ShAmt & 7) != 0)
264 // If the extract is known to be all zeros, return zero.
265 if (ByteStart >= CSize-ShAmt)
266 return Constant::getNullValue(IntegerType::get(CE->getContext(),
268 // If the extract is known to be fully in the input, extract it.
269 if (ByteStart+ByteSize+ShAmt <= CSize)
270 return ExtractConstantBytes(CE->getOperand(0), ByteStart+ShAmt, ByteSize);
272 // TODO: Handle the 'partially zero' case.
276 case Instruction::Shl: {
277 ConstantInt *Amt = dyn_cast<ConstantInt>(CE->getOperand(1));
280 unsigned ShAmt = Amt->getZExtValue();
281 // Cannot analyze non-byte shifts.
282 if ((ShAmt & 7) != 0)
286 // If the extract is known to be all zeros, return zero.
287 if (ByteStart+ByteSize <= ShAmt)
288 return Constant::getNullValue(IntegerType::get(CE->getContext(),
290 // If the extract is known to be fully in the input, extract it.
291 if (ByteStart >= ShAmt)
292 return ExtractConstantBytes(CE->getOperand(0), ByteStart-ShAmt, ByteSize);
294 // TODO: Handle the 'partially zero' case.
298 case Instruction::ZExt: {
299 unsigned SrcBitSize =
300 cast<IntegerType>(CE->getOperand(0)->getType())->getBitWidth();
302 // If extracting something that is completely zero, return 0.
303 if (ByteStart*8 >= SrcBitSize)
304 return Constant::getNullValue(IntegerType::get(CE->getContext(),
307 // If exactly extracting the input, return it.
308 if (ByteStart == 0 && ByteSize*8 == SrcBitSize)
309 return CE->getOperand(0);
311 // If extracting something completely in the input, if if the input is a
312 // multiple of 8 bits, recurse.
313 if ((SrcBitSize&7) == 0 && (ByteStart+ByteSize)*8 <= SrcBitSize)
314 return ExtractConstantBytes(CE->getOperand(0), ByteStart, ByteSize);
316 // Otherwise, if extracting a subset of the input, which is not multiple of
317 // 8 bits, do a shift and trunc to get the bits.
318 if ((ByteStart+ByteSize)*8 < SrcBitSize) {
319 assert((SrcBitSize&7) && "Shouldn't get byte sized case here");
320 Constant *Res = CE->getOperand(0);
322 Res = ConstantExpr::getLShr(Res,
323 ConstantInt::get(Res->getType(), ByteStart*8));
324 return ConstantExpr::getTrunc(Res, IntegerType::get(C->getContext(),
328 // TODO: Handle the 'partially zero' case.
334 /// getFoldedSizeOf - Return a ConstantExpr with type DestTy for sizeof
335 /// on Ty, with any known factors factored out. If Folded is false,
336 /// return null if no factoring was possible, to avoid endlessly
337 /// bouncing an unfoldable expression back into the top-level folder.
339 static Constant *getFoldedSizeOf(Type *Ty, Type *DestTy,
341 if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
342 Constant *N = ConstantInt::get(DestTy, ATy->getNumElements());
343 Constant *E = getFoldedSizeOf(ATy->getElementType(), DestTy, true);
344 return ConstantExpr::getNUWMul(E, N);
347 if (StructType *STy = dyn_cast<StructType>(Ty))
348 if (!STy->isPacked()) {
349 unsigned NumElems = STy->getNumElements();
350 // An empty struct has size zero.
352 return ConstantExpr::getNullValue(DestTy);
353 // Check for a struct with all members having the same size.
354 Constant *MemberSize =
355 getFoldedSizeOf(STy->getElementType(0), DestTy, true);
357 for (unsigned i = 1; i != NumElems; ++i)
359 getFoldedSizeOf(STy->getElementType(i), DestTy, true)) {
364 Constant *N = ConstantInt::get(DestTy, NumElems);
365 return ConstantExpr::getNUWMul(MemberSize, N);
369 // Pointer size doesn't depend on the pointee type, so canonicalize them
370 // to an arbitrary pointee.
371 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
372 if (!PTy->getElementType()->isIntegerTy(1))
374 getFoldedSizeOf(PointerType::get(IntegerType::get(PTy->getContext(), 1),
375 PTy->getAddressSpace()),
378 // If there's no interesting folding happening, bail so that we don't create
379 // a constant that looks like it needs folding but really doesn't.
383 // Base case: Get a regular sizeof expression.
384 Constant *C = ConstantExpr::getSizeOf(Ty);
385 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
391 /// getFoldedAlignOf - Return a ConstantExpr with type DestTy for alignof
392 /// on Ty, with any known factors factored out. If Folded is false,
393 /// return null if no factoring was possible, to avoid endlessly
394 /// bouncing an unfoldable expression back into the top-level folder.
396 static Constant *getFoldedAlignOf(Type *Ty, Type *DestTy,
398 // The alignment of an array is equal to the alignment of the
399 // array element. Note that this is not always true for vectors.
400 if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
401 Constant *C = ConstantExpr::getAlignOf(ATy->getElementType());
402 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
409 if (StructType *STy = dyn_cast<StructType>(Ty)) {
410 // Packed structs always have an alignment of 1.
412 return ConstantInt::get(DestTy, 1);
414 // Otherwise, struct alignment is the maximum alignment of any member.
415 // Without target data, we can't compare much, but we can check to see
416 // if all the members have the same alignment.
417 unsigned NumElems = STy->getNumElements();
418 // An empty struct has minimal alignment.
420 return ConstantInt::get(DestTy, 1);
421 // Check for a struct with all members having the same alignment.
422 Constant *MemberAlign =
423 getFoldedAlignOf(STy->getElementType(0), DestTy, true);
425 for (unsigned i = 1; i != NumElems; ++i)
426 if (MemberAlign != getFoldedAlignOf(STy->getElementType(i), DestTy, true)) {
434 // Pointer alignment doesn't depend on the pointee type, so canonicalize them
435 // to an arbitrary pointee.
436 if (PointerType *PTy = dyn_cast<PointerType>(Ty))
437 if (!PTy->getElementType()->isIntegerTy(1))
439 getFoldedAlignOf(PointerType::get(IntegerType::get(PTy->getContext(),
441 PTy->getAddressSpace()),
444 // If there's no interesting folding happening, bail so that we don't create
445 // a constant that looks like it needs folding but really doesn't.
449 // Base case: Get a regular alignof expression.
450 Constant *C = ConstantExpr::getAlignOf(Ty);
451 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
457 /// getFoldedOffsetOf - Return a ConstantExpr with type DestTy for offsetof
458 /// on Ty and FieldNo, with any known factors factored out. If Folded is false,
459 /// return null if no factoring was possible, to avoid endlessly
460 /// bouncing an unfoldable expression back into the top-level folder.
462 static Constant *getFoldedOffsetOf(Type *Ty, Constant *FieldNo,
465 if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
466 Constant *N = ConstantExpr::getCast(CastInst::getCastOpcode(FieldNo, false,
469 Constant *E = getFoldedSizeOf(ATy->getElementType(), DestTy, true);
470 return ConstantExpr::getNUWMul(E, N);
473 if (StructType *STy = dyn_cast<StructType>(Ty))
474 if (!STy->isPacked()) {
475 unsigned NumElems = STy->getNumElements();
476 // An empty struct has no members.
479 // Check for a struct with all members having the same size.
480 Constant *MemberSize =
481 getFoldedSizeOf(STy->getElementType(0), DestTy, true);
483 for (unsigned i = 1; i != NumElems; ++i)
485 getFoldedSizeOf(STy->getElementType(i), DestTy, true)) {
490 Constant *N = ConstantExpr::getCast(CastInst::getCastOpcode(FieldNo,
495 return ConstantExpr::getNUWMul(MemberSize, N);
499 // If there's no interesting folding happening, bail so that we don't create
500 // a constant that looks like it needs folding but really doesn't.
504 // Base case: Get a regular offsetof expression.
505 Constant *C = ConstantExpr::getOffsetOf(Ty, FieldNo);
506 C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
512 Constant *llvm::ConstantFoldCastInstruction(unsigned opc, Constant *V,
514 if (isa<UndefValue>(V)) {
515 // zext(undef) = 0, because the top bits will be zero.
516 // sext(undef) = 0, because the top bits will all be the same.
517 // [us]itofp(undef) = 0, because the result value is bounded.
518 if (opc == Instruction::ZExt || opc == Instruction::SExt ||
519 opc == Instruction::UIToFP || opc == Instruction::SIToFP)
520 return Constant::getNullValue(DestTy);
521 return UndefValue::get(DestTy);
524 if (V->isNullValue() && !DestTy->isX86_MMXTy())
525 return Constant::getNullValue(DestTy);
527 // If the cast operand is a constant expression, there's a few things we can
528 // do to try to simplify it.
529 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
531 // Try hard to fold cast of cast because they are often eliminable.
532 if (unsigned newOpc = foldConstantCastPair(opc, CE, DestTy))
533 return ConstantExpr::getCast(newOpc, CE->getOperand(0), DestTy);
534 } else if (CE->getOpcode() == Instruction::GetElementPtr &&
535 // Do not fold addrspacecast (gep 0, .., 0). It might make the
536 // addrspacecast uncanonicalized.
537 opc != Instruction::AddrSpaceCast) {
538 // If all of the indexes in the GEP are null values, there is no pointer
539 // adjustment going on. We might as well cast the source pointer.
540 bool isAllNull = true;
541 for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
542 if (!CE->getOperand(i)->isNullValue()) {
547 // This is casting one pointer type to another, always BitCast
548 return ConstantExpr::getPointerCast(CE->getOperand(0), DestTy);
552 // If the cast operand is a constant vector, perform the cast by
553 // operating on each element. In the cast of bitcasts, the element
554 // count may be mismatched; don't attempt to handle that here.
555 if ((isa<ConstantVector>(V) || isa<ConstantDataVector>(V)) &&
556 DestTy->isVectorTy() &&
557 DestTy->getVectorNumElements() == V->getType()->getVectorNumElements()) {
558 SmallVector<Constant*, 16> res;
559 VectorType *DestVecTy = cast<VectorType>(DestTy);
560 Type *DstEltTy = DestVecTy->getElementType();
561 Type *Ty = IntegerType::get(V->getContext(), 32);
562 for (unsigned i = 0, e = V->getType()->getVectorNumElements(); i != e; ++i) {
564 ConstantExpr::getExtractElement(V, ConstantInt::get(Ty, i));
565 res.push_back(ConstantExpr::getCast(opc, C, DstEltTy));
567 return ConstantVector::get(res);
570 // We actually have to do a cast now. Perform the cast according to the
574 llvm_unreachable("Failed to cast constant expression");
575 case Instruction::FPTrunc:
576 case Instruction::FPExt:
577 if (ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
579 APFloat Val = FPC->getValueAPF();
580 Val.convert(DestTy->isHalfTy() ? APFloat::IEEEhalf :
581 DestTy->isFloatTy() ? APFloat::IEEEsingle :
582 DestTy->isDoubleTy() ? APFloat::IEEEdouble :
583 DestTy->isX86_FP80Ty() ? APFloat::x87DoubleExtended :
584 DestTy->isFP128Ty() ? APFloat::IEEEquad :
585 DestTy->isPPC_FP128Ty() ? APFloat::PPCDoubleDouble :
587 APFloat::rmNearestTiesToEven, &ignored);
588 return ConstantFP::get(V->getContext(), Val);
590 return nullptr; // Can't fold.
591 case Instruction::FPToUI:
592 case Instruction::FPToSI:
593 if (ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
594 const APFloat &V = FPC->getValueAPF();
597 uint32_t DestBitWidth = cast<IntegerType>(DestTy)->getBitWidth();
598 if (APFloat::opInvalidOp ==
599 V.convertToInteger(x, DestBitWidth, opc==Instruction::FPToSI,
600 APFloat::rmTowardZero, &ignored)) {
601 // Undefined behavior invoked - the destination type can't represent
602 // the input constant.
603 return UndefValue::get(DestTy);
605 APInt Val(DestBitWidth, x);
606 return ConstantInt::get(FPC->getContext(), Val);
608 return nullptr; // Can't fold.
609 case Instruction::IntToPtr: //always treated as unsigned
610 if (V->isNullValue()) // Is it an integral null value?
611 return ConstantPointerNull::get(cast<PointerType>(DestTy));
612 return nullptr; // Other pointer types cannot be casted
613 case Instruction::PtrToInt: // always treated as unsigned
614 // Is it a null pointer value?
615 if (V->isNullValue())
616 return ConstantInt::get(DestTy, 0);
617 // If this is a sizeof-like expression, pull out multiplications by
618 // known factors to expose them to subsequent folding. If it's an
619 // alignof-like expression, factor out known factors.
620 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
621 if (CE->getOpcode() == Instruction::GetElementPtr &&
622 CE->getOperand(0)->isNullValue()) {
624 cast<PointerType>(CE->getOperand(0)->getType())->getElementType();
625 if (CE->getNumOperands() == 2) {
626 // Handle a sizeof-like expression.
627 Constant *Idx = CE->getOperand(1);
628 bool isOne = isa<ConstantInt>(Idx) && cast<ConstantInt>(Idx)->isOne();
629 if (Constant *C = getFoldedSizeOf(Ty, DestTy, !isOne)) {
630 Idx = ConstantExpr::getCast(CastInst::getCastOpcode(Idx, true,
633 return ConstantExpr::getMul(C, Idx);
635 } else if (CE->getNumOperands() == 3 &&
636 CE->getOperand(1)->isNullValue()) {
637 // Handle an alignof-like expression.
638 if (StructType *STy = dyn_cast<StructType>(Ty))
639 if (!STy->isPacked()) {
640 ConstantInt *CI = cast<ConstantInt>(CE->getOperand(2));
642 STy->getNumElements() == 2 &&
643 STy->getElementType(0)->isIntegerTy(1)) {
644 return getFoldedAlignOf(STy->getElementType(1), DestTy, false);
647 // Handle an offsetof-like expression.
648 if (Ty->isStructTy() || Ty->isArrayTy()) {
649 if (Constant *C = getFoldedOffsetOf(Ty, CE->getOperand(2),
655 // Other pointer types cannot be casted
657 case Instruction::UIToFP:
658 case Instruction::SIToFP:
659 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
660 APInt api = CI->getValue();
661 APFloat apf(DestTy->getFltSemantics(),
662 APInt::getNullValue(DestTy->getPrimitiveSizeInBits()));
663 if (APFloat::opOverflow &
664 apf.convertFromAPInt(api, opc==Instruction::SIToFP,
665 APFloat::rmNearestTiesToEven)) {
666 // Undefined behavior invoked - the destination type can't represent
667 // the input constant.
668 return UndefValue::get(DestTy);
670 return ConstantFP::get(V->getContext(), apf);
673 case Instruction::ZExt:
674 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
675 uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
676 return ConstantInt::get(V->getContext(),
677 CI->getValue().zext(BitWidth));
680 case Instruction::SExt:
681 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
682 uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
683 return ConstantInt::get(V->getContext(),
684 CI->getValue().sext(BitWidth));
687 case Instruction::Trunc: {
688 if (V->getType()->isVectorTy())
691 uint32_t DestBitWidth = cast<IntegerType>(DestTy)->getBitWidth();
692 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
693 return ConstantInt::get(V->getContext(),
694 CI->getValue().trunc(DestBitWidth));
697 // The input must be a constantexpr. See if we can simplify this based on
698 // the bytes we are demanding. Only do this if the source and dest are an
699 // even multiple of a byte.
700 if ((DestBitWidth & 7) == 0 &&
701 (cast<IntegerType>(V->getType())->getBitWidth() & 7) == 0)
702 if (Constant *Res = ExtractConstantBytes(V, 0, DestBitWidth / 8))
707 case Instruction::BitCast:
708 return FoldBitCast(V, DestTy);
709 case Instruction::AddrSpaceCast:
714 Constant *llvm::ConstantFoldSelectInstruction(Constant *Cond,
715 Constant *V1, Constant *V2) {
716 // Check for i1 and vector true/false conditions.
717 if (Cond->isNullValue()) return V2;
718 if (Cond->isAllOnesValue()) return V1;
720 // If the condition is a vector constant, fold the result elementwise.
721 if (ConstantVector *CondV = dyn_cast<ConstantVector>(Cond)) {
722 SmallVector<Constant*, 16> Result;
723 Type *Ty = IntegerType::get(CondV->getContext(), 32);
724 for (unsigned i = 0, e = V1->getType()->getVectorNumElements(); i != e;++i){
726 Constant *V1Element = ConstantExpr::getExtractElement(V1,
727 ConstantInt::get(Ty, i));
728 Constant *V2Element = ConstantExpr::getExtractElement(V2,
729 ConstantInt::get(Ty, i));
730 Constant *Cond = dyn_cast<Constant>(CondV->getOperand(i));
731 if (V1Element == V2Element) {
733 } else if (isa<UndefValue>(Cond)) {
734 V = isa<UndefValue>(V1Element) ? V1Element : V2Element;
736 if (!isa<ConstantInt>(Cond)) break;
737 V = Cond->isNullValue() ? V2Element : V1Element;
742 // If we were able to build the vector, return it.
743 if (Result.size() == V1->getType()->getVectorNumElements())
744 return ConstantVector::get(Result);
747 if (isa<UndefValue>(Cond)) {
748 if (isa<UndefValue>(V1)) return V1;
751 if (isa<UndefValue>(V1)) return V2;
752 if (isa<UndefValue>(V2)) return V1;
753 if (V1 == V2) return V1;
755 if (ConstantExpr *TrueVal = dyn_cast<ConstantExpr>(V1)) {
756 if (TrueVal->getOpcode() == Instruction::Select)
757 if (TrueVal->getOperand(0) == Cond)
758 return ConstantExpr::getSelect(Cond, TrueVal->getOperand(1), V2);
760 if (ConstantExpr *FalseVal = dyn_cast<ConstantExpr>(V2)) {
761 if (FalseVal->getOpcode() == Instruction::Select)
762 if (FalseVal->getOperand(0) == Cond)
763 return ConstantExpr::getSelect(Cond, V1, FalseVal->getOperand(2));
769 Constant *llvm::ConstantFoldExtractElementInstruction(Constant *Val,
771 if (isa<UndefValue>(Val)) // ee(undef, x) -> undef
772 return UndefValue::get(Val->getType()->getVectorElementType());
773 if (Val->isNullValue()) // ee(zero, x) -> zero
774 return Constant::getNullValue(Val->getType()->getVectorElementType());
775 // ee({w,x,y,z}, undef) -> undef
776 if (isa<UndefValue>(Idx))
777 return UndefValue::get(Val->getType()->getVectorElementType());
779 if (ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx)) {
780 uint64_t Index = CIdx->getZExtValue();
781 // ee({w,x,y,z}, wrong_value) -> undef
782 if (Index >= Val->getType()->getVectorNumElements())
783 return UndefValue::get(Val->getType()->getVectorElementType());
784 return Val->getAggregateElement(Index);
789 Constant *llvm::ConstantFoldInsertElementInstruction(Constant *Val,
792 ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx);
793 if (!CIdx) return nullptr;
794 const APInt &IdxVal = CIdx->getValue();
796 SmallVector<Constant*, 16> Result;
797 Type *Ty = IntegerType::get(Val->getContext(), 32);
798 for (unsigned i = 0, e = Val->getType()->getVectorNumElements(); i != e; ++i){
800 Result.push_back(Elt);
805 ConstantExpr::getExtractElement(Val, ConstantInt::get(Ty, i));
809 return ConstantVector::get(Result);
812 Constant *llvm::ConstantFoldShuffleVectorInstruction(Constant *V1,
815 unsigned MaskNumElts = Mask->getType()->getVectorNumElements();
816 Type *EltTy = V1->getType()->getVectorElementType();
818 // Undefined shuffle mask -> undefined value.
819 if (isa<UndefValue>(Mask))
820 return UndefValue::get(VectorType::get(EltTy, MaskNumElts));
822 // Don't break the bitcode reader hack.
823 if (isa<ConstantExpr>(Mask)) return nullptr;
825 unsigned SrcNumElts = V1->getType()->getVectorNumElements();
827 // Loop over the shuffle mask, evaluating each element.
828 SmallVector<Constant*, 32> Result;
829 for (unsigned i = 0; i != MaskNumElts; ++i) {
830 int Elt = ShuffleVectorInst::getMaskValue(Mask, i);
832 Result.push_back(UndefValue::get(EltTy));
836 if (unsigned(Elt) >= SrcNumElts*2)
837 InElt = UndefValue::get(EltTy);
838 else if (unsigned(Elt) >= SrcNumElts) {
839 Type *Ty = IntegerType::get(V2->getContext(), 32);
841 ConstantExpr::getExtractElement(V2,
842 ConstantInt::get(Ty, Elt - SrcNumElts));
844 Type *Ty = IntegerType::get(V1->getContext(), 32);
845 InElt = ConstantExpr::getExtractElement(V1, ConstantInt::get(Ty, Elt));
847 Result.push_back(InElt);
850 return ConstantVector::get(Result);
853 Constant *llvm::ConstantFoldExtractValueInstruction(Constant *Agg,
854 ArrayRef<unsigned> Idxs) {
855 // Base case: no indices, so return the entire value.
859 if (Constant *C = Agg->getAggregateElement(Idxs[0]))
860 return ConstantFoldExtractValueInstruction(C, Idxs.slice(1));
865 Constant *llvm::ConstantFoldInsertValueInstruction(Constant *Agg,
867 ArrayRef<unsigned> Idxs) {
868 // Base case: no indices, so replace the entire value.
873 if (StructType *ST = dyn_cast<StructType>(Agg->getType()))
874 NumElts = ST->getNumElements();
875 else if (ArrayType *AT = dyn_cast<ArrayType>(Agg->getType()))
876 NumElts = AT->getNumElements();
878 NumElts = Agg->getType()->getVectorNumElements();
880 SmallVector<Constant*, 32> Result;
881 for (unsigned i = 0; i != NumElts; ++i) {
882 Constant *C = Agg->getAggregateElement(i);
883 if (!C) return nullptr;
886 C = ConstantFoldInsertValueInstruction(C, Val, Idxs.slice(1));
891 if (StructType *ST = dyn_cast<StructType>(Agg->getType()))
892 return ConstantStruct::get(ST, Result);
893 if (ArrayType *AT = dyn_cast<ArrayType>(Agg->getType()))
894 return ConstantArray::get(AT, Result);
895 return ConstantVector::get(Result);
899 Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode,
900 Constant *C1, Constant *C2) {
901 // Handle UndefValue up front.
902 if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) {
904 case Instruction::Xor:
905 if (isa<UndefValue>(C1) && isa<UndefValue>(C2))
906 // Handle undef ^ undef -> 0 special case. This is a common
908 return Constant::getNullValue(C1->getType());
910 case Instruction::Add:
911 case Instruction::Sub:
912 return UndefValue::get(C1->getType());
913 case Instruction::And:
914 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef & undef -> undef
916 return Constant::getNullValue(C1->getType()); // undef & X -> 0
917 case Instruction::Mul: {
918 // undef * undef -> undef
919 if (isa<UndefValue>(C1) && isa<UndefValue>(C2))
922 // X * undef -> undef if X is odd
923 if (match(C1, m_APInt(CV)) || match(C2, m_APInt(CV)))
925 return UndefValue::get(C1->getType());
927 // X * undef -> 0 otherwise
928 return Constant::getNullValue(C1->getType());
930 case Instruction::SDiv:
931 case Instruction::UDiv:
932 // X / undef -> undef
933 if (match(C1, m_Zero()))
935 // undef / 0 -> undef
936 // undef / 1 -> undef
937 if (match(C2, m_Zero()) || match(C2, m_One()))
939 // undef / X -> 0 otherwise
940 return Constant::getNullValue(C1->getType());
941 case Instruction::URem:
942 case Instruction::SRem:
943 // X % undef -> undef
944 if (match(C2, m_Undef()))
946 // undef % 0 -> undef
947 if (match(C2, m_Zero()))
949 // undef % X -> 0 otherwise
950 return Constant::getNullValue(C1->getType());
951 case Instruction::Or: // X | undef -> -1
952 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef | undef -> undef
954 return Constant::getAllOnesValue(C1->getType()); // undef | X -> ~0
955 case Instruction::LShr:
956 // X >>l undef -> undef
957 if (isa<UndefValue>(C2))
960 return Constant::getNullValue(C1->getType());
961 case Instruction::AShr:
962 // X >>a undef -> undef
963 if (isa<UndefValue>(C2))
965 // TODO: undef >>a X -> undef if the shift is exact
967 return Constant::getNullValue(C1->getType());
968 case Instruction::Shl:
969 // X << undef -> undef
970 if (isa<UndefValue>(C2))
973 return Constant::getNullValue(C1->getType());
977 // Handle simplifications when the RHS is a constant int.
978 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(C2)) {
980 case Instruction::Add:
981 if (CI2->equalsInt(0)) return C1; // X + 0 == X
983 case Instruction::Sub:
984 if (CI2->equalsInt(0)) return C1; // X - 0 == X
986 case Instruction::Mul:
987 if (CI2->equalsInt(0)) return C2; // X * 0 == 0
988 if (CI2->equalsInt(1))
989 return C1; // X * 1 == X
991 case Instruction::UDiv:
992 case Instruction::SDiv:
993 if (CI2->equalsInt(1))
994 return C1; // X / 1 == X
995 if (CI2->equalsInt(0))
996 return UndefValue::get(CI2->getType()); // X / 0 == undef
998 case Instruction::URem:
999 case Instruction::SRem:
1000 if (CI2->equalsInt(1))
1001 return Constant::getNullValue(CI2->getType()); // X % 1 == 0
1002 if (CI2->equalsInt(0))
1003 return UndefValue::get(CI2->getType()); // X % 0 == undef
1005 case Instruction::And:
1006 if (CI2->isZero()) return C2; // X & 0 == 0
1007 if (CI2->isAllOnesValue())
1008 return C1; // X & -1 == X
1010 if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
1011 // (zext i32 to i64) & 4294967295 -> (zext i32 to i64)
1012 if (CE1->getOpcode() == Instruction::ZExt) {
1013 unsigned DstWidth = CI2->getType()->getBitWidth();
1015 CE1->getOperand(0)->getType()->getPrimitiveSizeInBits();
1016 APInt PossiblySetBits(APInt::getLowBitsSet(DstWidth, SrcWidth));
1017 if ((PossiblySetBits & CI2->getValue()) == PossiblySetBits)
1021 // If and'ing the address of a global with a constant, fold it.
1022 if (CE1->getOpcode() == Instruction::PtrToInt &&
1023 isa<GlobalValue>(CE1->getOperand(0))) {
1024 GlobalValue *GV = cast<GlobalValue>(CE1->getOperand(0));
1026 // Functions are at least 4-byte aligned.
1027 unsigned GVAlign = GV->getAlignment();
1028 if (isa<Function>(GV))
1029 GVAlign = std::max(GVAlign, 4U);
1032 unsigned DstWidth = CI2->getType()->getBitWidth();
1033 unsigned SrcWidth = std::min(DstWidth, Log2_32(GVAlign));
1034 APInt BitsNotSet(APInt::getLowBitsSet(DstWidth, SrcWidth));
1036 // If checking bits we know are clear, return zero.
1037 if ((CI2->getValue() & BitsNotSet) == CI2->getValue())
1038 return Constant::getNullValue(CI2->getType());
1043 case Instruction::Or:
1044 if (CI2->equalsInt(0)) return C1; // X | 0 == X
1045 if (CI2->isAllOnesValue())
1046 return C2; // X | -1 == -1
1048 case Instruction::Xor:
1049 if (CI2->equalsInt(0)) return C1; // X ^ 0 == X
1051 if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
1052 switch (CE1->getOpcode()) {
1054 case Instruction::ICmp:
1055 case Instruction::FCmp:
1056 // cmp pred ^ true -> cmp !pred
1057 assert(CI2->equalsInt(1));
1058 CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate();
1059 pred = CmpInst::getInversePredicate(pred);
1060 return ConstantExpr::getCompare(pred, CE1->getOperand(0),
1061 CE1->getOperand(1));
1065 case Instruction::AShr:
1066 // ashr (zext C to Ty), C2 -> lshr (zext C, CSA), C2
1067 if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1))
1068 if (CE1->getOpcode() == Instruction::ZExt) // Top bits known zero.
1069 return ConstantExpr::getLShr(C1, C2);
1072 } else if (isa<ConstantInt>(C1)) {
1073 // If C1 is a ConstantInt and C2 is not, swap the operands.
1074 if (Instruction::isCommutative(Opcode))
1075 return ConstantExpr::get(Opcode, C2, C1);
1078 // At this point we know neither constant is an UndefValue.
1079 if (ConstantInt *CI1 = dyn_cast<ConstantInt>(C1)) {
1080 if (ConstantInt *CI2 = dyn_cast<ConstantInt>(C2)) {
1081 const APInt &C1V = CI1->getValue();
1082 const APInt &C2V = CI2->getValue();
1086 case Instruction::Add:
1087 return ConstantInt::get(CI1->getContext(), C1V + C2V);
1088 case Instruction::Sub:
1089 return ConstantInt::get(CI1->getContext(), C1V - C2V);
1090 case Instruction::Mul:
1091 return ConstantInt::get(CI1->getContext(), C1V * C2V);
1092 case Instruction::UDiv:
1093 assert(!CI2->isNullValue() && "Div by zero handled above");
1094 return ConstantInt::get(CI1->getContext(), C1V.udiv(C2V));
1095 case Instruction::SDiv:
1096 assert(!CI2->isNullValue() && "Div by zero handled above");
1097 if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
1098 return UndefValue::get(CI1->getType()); // MIN_INT / -1 -> undef
1099 return ConstantInt::get(CI1->getContext(), C1V.sdiv(C2V));
1100 case Instruction::URem:
1101 assert(!CI2->isNullValue() && "Div by zero handled above");
1102 return ConstantInt::get(CI1->getContext(), C1V.urem(C2V));
1103 case Instruction::SRem:
1104 assert(!CI2->isNullValue() && "Div by zero handled above");
1105 if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
1106 return UndefValue::get(CI1->getType()); // MIN_INT % -1 -> undef
1107 return ConstantInt::get(CI1->getContext(), C1V.srem(C2V));
1108 case Instruction::And:
1109 return ConstantInt::get(CI1->getContext(), C1V & C2V);
1110 case Instruction::Or:
1111 return ConstantInt::get(CI1->getContext(), C1V | C2V);
1112 case Instruction::Xor:
1113 return ConstantInt::get(CI1->getContext(), C1V ^ C2V);
1114 case Instruction::Shl: {
1115 uint32_t shiftAmt = C2V.getZExtValue();
1116 if (shiftAmt < C1V.getBitWidth())
1117 return ConstantInt::get(CI1->getContext(), C1V.shl(shiftAmt));
1119 return UndefValue::get(C1->getType()); // too big shift is undef
1121 case Instruction::LShr: {
1122 uint32_t shiftAmt = C2V.getZExtValue();
1123 if (shiftAmt < C1V.getBitWidth())
1124 return ConstantInt::get(CI1->getContext(), C1V.lshr(shiftAmt));
1126 return UndefValue::get(C1->getType()); // too big shift is undef
1128 case Instruction::AShr: {
1129 uint32_t shiftAmt = C2V.getZExtValue();
1130 if (shiftAmt < C1V.getBitWidth())
1131 return ConstantInt::get(CI1->getContext(), C1V.ashr(shiftAmt));
1133 return UndefValue::get(C1->getType()); // too big shift is undef
1139 case Instruction::SDiv:
1140 case Instruction::UDiv:
1141 case Instruction::URem:
1142 case Instruction::SRem:
1143 case Instruction::LShr:
1144 case Instruction::AShr:
1145 case Instruction::Shl:
1146 if (CI1->equalsInt(0)) return C1;
1151 } else if (ConstantFP *CFP1 = dyn_cast<ConstantFP>(C1)) {
1152 if (ConstantFP *CFP2 = dyn_cast<ConstantFP>(C2)) {
1153 APFloat C1V = CFP1->getValueAPF();
1154 APFloat C2V = CFP2->getValueAPF();
1155 APFloat C3V = C1V; // copy for modification
1159 case Instruction::FAdd:
1160 (void)C3V.add(C2V, APFloat::rmNearestTiesToEven);
1161 return ConstantFP::get(C1->getContext(), C3V);
1162 case Instruction::FSub:
1163 (void)C3V.subtract(C2V, APFloat::rmNearestTiesToEven);
1164 return ConstantFP::get(C1->getContext(), C3V);
1165 case Instruction::FMul:
1166 (void)C3V.multiply(C2V, APFloat::rmNearestTiesToEven);
1167 return ConstantFP::get(C1->getContext(), C3V);
1168 case Instruction::FDiv:
1169 (void)C3V.divide(C2V, APFloat::rmNearestTiesToEven);
1170 return ConstantFP::get(C1->getContext(), C3V);
1171 case Instruction::FRem:
1172 (void)C3V.mod(C2V, APFloat::rmNearestTiesToEven);
1173 return ConstantFP::get(C1->getContext(), C3V);
1176 } else if (VectorType *VTy = dyn_cast<VectorType>(C1->getType())) {
1177 // Perform elementwise folding.
1178 SmallVector<Constant*, 16> Result;
1179 Type *Ty = IntegerType::get(VTy->getContext(), 32);
1180 for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
1182 ConstantExpr::getExtractElement(C1, ConstantInt::get(Ty, i));
1184 ConstantExpr::getExtractElement(C2, ConstantInt::get(Ty, i));
1186 Result.push_back(ConstantExpr::get(Opcode, LHS, RHS));
1189 return ConstantVector::get(Result);
1192 if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
1193 // There are many possible foldings we could do here. We should probably
1194 // at least fold add of a pointer with an integer into the appropriate
1195 // getelementptr. This will improve alias analysis a bit.
1197 // Given ((a + b) + c), if (b + c) folds to something interesting, return
1199 if (Instruction::isAssociative(Opcode) && CE1->getOpcode() == Opcode) {
1200 Constant *T = ConstantExpr::get(Opcode, CE1->getOperand(1), C2);
1201 if (!isa<ConstantExpr>(T) || cast<ConstantExpr>(T)->getOpcode() != Opcode)
1202 return ConstantExpr::get(Opcode, CE1->getOperand(0), T);
1204 } else if (isa<ConstantExpr>(C2)) {
1205 // If C2 is a constant expr and C1 isn't, flop them around and fold the
1206 // other way if possible.
1207 if (Instruction::isCommutative(Opcode))
1208 return ConstantFoldBinaryInstruction(Opcode, C2, C1);
1211 // i1 can be simplified in many cases.
1212 if (C1->getType()->isIntegerTy(1)) {
1214 case Instruction::Add:
1215 case Instruction::Sub:
1216 return ConstantExpr::getXor(C1, C2);
1217 case Instruction::Mul:
1218 return ConstantExpr::getAnd(C1, C2);
1219 case Instruction::Shl:
1220 case Instruction::LShr:
1221 case Instruction::AShr:
1222 // We can assume that C2 == 0. If it were one the result would be
1223 // undefined because the shift value is as large as the bitwidth.
1225 case Instruction::SDiv:
1226 case Instruction::UDiv:
1227 // We can assume that C2 == 1. If it were zero the result would be
1228 // undefined through division by zero.
1230 case Instruction::URem:
1231 case Instruction::SRem:
1232 // We can assume that C2 == 1. If it were zero the result would be
1233 // undefined through division by zero.
1234 return ConstantInt::getFalse(C1->getContext());
1240 // We don't know how to fold this.
1244 /// isZeroSizedType - This type is zero sized if its an array or structure of
1245 /// zero sized types. The only leaf zero sized type is an empty structure.
1246 static bool isMaybeZeroSizedType(Type *Ty) {
1247 if (StructType *STy = dyn_cast<StructType>(Ty)) {
1248 if (STy->isOpaque()) return true; // Can't say.
1250 // If all of elements have zero size, this does too.
1251 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
1252 if (!isMaybeZeroSizedType(STy->getElementType(i))) return false;
1255 } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
1256 return isMaybeZeroSizedType(ATy->getElementType());
1261 /// IdxCompare - Compare the two constants as though they were getelementptr
1262 /// indices. This allows coersion of the types to be the same thing.
1264 /// If the two constants are the "same" (after coersion), return 0. If the
1265 /// first is less than the second, return -1, if the second is less than the
1266 /// first, return 1. If the constants are not integral, return -2.
1268 static int IdxCompare(Constant *C1, Constant *C2, Type *ElTy) {
1269 if (C1 == C2) return 0;
1271 // Ok, we found a different index. If they are not ConstantInt, we can't do
1272 // anything with them.
1273 if (!isa<ConstantInt>(C1) || !isa<ConstantInt>(C2))
1274 return -2; // don't know!
1276 // Ok, we have two differing integer indices. Sign extend them to be the same
1277 // type. Long is always big enough, so we use it.
1278 if (!C1->getType()->isIntegerTy(64))
1279 C1 = ConstantExpr::getSExt(C1, Type::getInt64Ty(C1->getContext()));
1281 if (!C2->getType()->isIntegerTy(64))
1282 C2 = ConstantExpr::getSExt(C2, Type::getInt64Ty(C1->getContext()));
1284 if (C1 == C2) return 0; // They are equal
1286 // If the type being indexed over is really just a zero sized type, there is
1287 // no pointer difference being made here.
1288 if (isMaybeZeroSizedType(ElTy))
1289 return -2; // dunno.
1291 // If they are really different, now that they are the same type, then we
1292 // found a difference!
1293 if (cast<ConstantInt>(C1)->getSExtValue() <
1294 cast<ConstantInt>(C2)->getSExtValue())
1300 /// evaluateFCmpRelation - This function determines if there is anything we can
1301 /// decide about the two constants provided. This doesn't need to handle simple
1302 /// things like ConstantFP comparisons, but should instead handle ConstantExprs.
1303 /// If we can determine that the two constants have a particular relation to
1304 /// each other, we should return the corresponding FCmpInst predicate,
1305 /// otherwise return FCmpInst::BAD_FCMP_PREDICATE. This is used below in
1306 /// ConstantFoldCompareInstruction.
1308 /// To simplify this code we canonicalize the relation so that the first
1309 /// operand is always the most "complex" of the two. We consider ConstantFP
1310 /// to be the simplest, and ConstantExprs to be the most complex.
1311 static FCmpInst::Predicate evaluateFCmpRelation(Constant *V1, Constant *V2) {
1312 assert(V1->getType() == V2->getType() &&
1313 "Cannot compare values of different types!");
1315 // Handle degenerate case quickly
1316 if (V1 == V2) return FCmpInst::FCMP_OEQ;
1318 if (!isa<ConstantExpr>(V1)) {
1319 if (!isa<ConstantExpr>(V2)) {
1320 // We distilled thisUse the standard constant folder for a few cases
1321 ConstantInt *R = nullptr;
1322 R = dyn_cast<ConstantInt>(
1323 ConstantExpr::getFCmp(FCmpInst::FCMP_OEQ, V1, V2));
1324 if (R && !R->isZero())
1325 return FCmpInst::FCMP_OEQ;
1326 R = dyn_cast<ConstantInt>(
1327 ConstantExpr::getFCmp(FCmpInst::FCMP_OLT, V1, V2));
1328 if (R && !R->isZero())
1329 return FCmpInst::FCMP_OLT;
1330 R = dyn_cast<ConstantInt>(
1331 ConstantExpr::getFCmp(FCmpInst::FCMP_OGT, V1, V2));
1332 if (R && !R->isZero())
1333 return FCmpInst::FCMP_OGT;
1335 // Nothing more we can do
1336 return FCmpInst::BAD_FCMP_PREDICATE;
1339 // If the first operand is simple and second is ConstantExpr, swap operands.
1340 FCmpInst::Predicate SwappedRelation = evaluateFCmpRelation(V2, V1);
1341 if (SwappedRelation != FCmpInst::BAD_FCMP_PREDICATE)
1342 return FCmpInst::getSwappedPredicate(SwappedRelation);
1344 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a
1345 // constantexpr or a simple constant.
1346 ConstantExpr *CE1 = cast<ConstantExpr>(V1);
1347 switch (CE1->getOpcode()) {
1348 case Instruction::FPTrunc:
1349 case Instruction::FPExt:
1350 case Instruction::UIToFP:
1351 case Instruction::SIToFP:
1352 // We might be able to do something with these but we don't right now.
1358 // There are MANY other foldings that we could perform here. They will
1359 // probably be added on demand, as they seem needed.
1360 return FCmpInst::BAD_FCMP_PREDICATE;
1363 static ICmpInst::Predicate areGlobalsPotentiallyEqual(const GlobalValue *GV1,
1364 const GlobalValue *GV2) {
1365 auto isGlobalUnsafeForEquality = [](const GlobalValue *GV) {
1366 if (GV->hasExternalWeakLinkage() || GV->hasWeakAnyLinkage())
1368 if (const auto *GVar = dyn_cast<GlobalVariable>(GV)) {
1369 Type *Ty = GVar->getType()->getPointerElementType();
1370 // A global with opaque type might end up being zero sized.
1373 // A global with an empty type might lie at the address of any other
1375 if (Ty->isEmptyTy())
1380 // Don't try to decide equality of aliases.
1381 if (!isa<GlobalAlias>(GV1) && !isa<GlobalAlias>(GV2))
1382 if (!isGlobalUnsafeForEquality(GV1) && !isGlobalUnsafeForEquality(GV2))
1383 return ICmpInst::ICMP_NE;
1384 return ICmpInst::BAD_ICMP_PREDICATE;
1387 /// evaluateICmpRelation - This function determines if there is anything we can
1388 /// decide about the two constants provided. This doesn't need to handle simple
1389 /// things like integer comparisons, but should instead handle ConstantExprs
1390 /// and GlobalValues. If we can determine that the two constants have a
1391 /// particular relation to each other, we should return the corresponding ICmp
1392 /// predicate, otherwise return ICmpInst::BAD_ICMP_PREDICATE.
1394 /// To simplify this code we canonicalize the relation so that the first
1395 /// operand is always the most "complex" of the two. We consider simple
1396 /// constants (like ConstantInt) to be the simplest, followed by
1397 /// GlobalValues, followed by ConstantExpr's (the most complex).
1399 static ICmpInst::Predicate evaluateICmpRelation(Constant *V1, Constant *V2,
1401 assert(V1->getType() == V2->getType() &&
1402 "Cannot compare different types of values!");
1403 if (V1 == V2) return ICmpInst::ICMP_EQ;
1405 if (!isa<ConstantExpr>(V1) && !isa<GlobalValue>(V1) &&
1406 !isa<BlockAddress>(V1)) {
1407 if (!isa<GlobalValue>(V2) && !isa<ConstantExpr>(V2) &&
1408 !isa<BlockAddress>(V2)) {
1409 // We distilled this down to a simple case, use the standard constant
1411 ConstantInt *R = nullptr;
1412 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ;
1413 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1414 if (R && !R->isZero())
1416 pred = isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
1417 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1418 if (R && !R->isZero())
1420 pred = isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1421 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1422 if (R && !R->isZero())
1425 // If we couldn't figure it out, bail.
1426 return ICmpInst::BAD_ICMP_PREDICATE;
1429 // If the first operand is simple, swap operands.
1430 ICmpInst::Predicate SwappedRelation =
1431 evaluateICmpRelation(V2, V1, isSigned);
1432 if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
1433 return ICmpInst::getSwappedPredicate(SwappedRelation);
1435 } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(V1)) {
1436 if (isa<ConstantExpr>(V2)) { // Swap as necessary.
1437 ICmpInst::Predicate SwappedRelation =
1438 evaluateICmpRelation(V2, V1, isSigned);
1439 if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
1440 return ICmpInst::getSwappedPredicate(SwappedRelation);
1441 return ICmpInst::BAD_ICMP_PREDICATE;
1444 // Now we know that the RHS is a GlobalValue, BlockAddress or simple
1445 // constant (which, since the types must match, means that it's a
1446 // ConstantPointerNull).
1447 if (const GlobalValue *GV2 = dyn_cast<GlobalValue>(V2)) {
1448 return areGlobalsPotentiallyEqual(GV, GV2);
1449 } else if (isa<BlockAddress>(V2)) {
1450 return ICmpInst::ICMP_NE; // Globals never equal labels.
1452 assert(isa<ConstantPointerNull>(V2) && "Canonicalization guarantee!");
1453 // GlobalVals can never be null unless they have external weak linkage.
1454 // We don't try to evaluate aliases here.
1455 if (!GV->hasExternalWeakLinkage() && !isa<GlobalAlias>(GV))
1456 return ICmpInst::ICMP_NE;
1458 } else if (const BlockAddress *BA = dyn_cast<BlockAddress>(V1)) {
1459 if (isa<ConstantExpr>(V2)) { // Swap as necessary.
1460 ICmpInst::Predicate SwappedRelation =
1461 evaluateICmpRelation(V2, V1, isSigned);
1462 if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
1463 return ICmpInst::getSwappedPredicate(SwappedRelation);
1464 return ICmpInst::BAD_ICMP_PREDICATE;
1467 // Now we know that the RHS is a GlobalValue, BlockAddress or simple
1468 // constant (which, since the types must match, means that it is a
1469 // ConstantPointerNull).
1470 if (const BlockAddress *BA2 = dyn_cast<BlockAddress>(V2)) {
1471 // Block address in another function can't equal this one, but block
1472 // addresses in the current function might be the same if blocks are
1474 if (BA2->getFunction() != BA->getFunction())
1475 return ICmpInst::ICMP_NE;
1477 // Block addresses aren't null, don't equal the address of globals.
1478 assert((isa<ConstantPointerNull>(V2) || isa<GlobalValue>(V2)) &&
1479 "Canonicalization guarantee!");
1480 return ICmpInst::ICMP_NE;
1483 // Ok, the LHS is known to be a constantexpr. The RHS can be any of a
1484 // constantexpr, a global, block address, or a simple constant.
1485 ConstantExpr *CE1 = cast<ConstantExpr>(V1);
1486 Constant *CE1Op0 = CE1->getOperand(0);
1488 switch (CE1->getOpcode()) {
1489 case Instruction::Trunc:
1490 case Instruction::FPTrunc:
1491 case Instruction::FPExt:
1492 case Instruction::FPToUI:
1493 case Instruction::FPToSI:
1494 break; // We can't evaluate floating point casts or truncations.
1496 case Instruction::UIToFP:
1497 case Instruction::SIToFP:
1498 case Instruction::BitCast:
1499 case Instruction::ZExt:
1500 case Instruction::SExt:
1501 // If the cast is not actually changing bits, and the second operand is a
1502 // null pointer, do the comparison with the pre-casted value.
1503 if (V2->isNullValue() &&
1504 (CE1->getType()->isPointerTy() || CE1->getType()->isIntegerTy())) {
1505 if (CE1->getOpcode() == Instruction::ZExt) isSigned = false;
1506 if (CE1->getOpcode() == Instruction::SExt) isSigned = true;
1507 return evaluateICmpRelation(CE1Op0,
1508 Constant::getNullValue(CE1Op0->getType()),
1513 case Instruction::GetElementPtr: {
1514 GEPOperator *CE1GEP = cast<GEPOperator>(CE1);
1515 // Ok, since this is a getelementptr, we know that the constant has a
1516 // pointer type. Check the various cases.
1517 if (isa<ConstantPointerNull>(V2)) {
1518 // If we are comparing a GEP to a null pointer, check to see if the base
1519 // of the GEP equals the null pointer.
1520 if (const GlobalValue *GV = dyn_cast<GlobalValue>(CE1Op0)) {
1521 if (GV->hasExternalWeakLinkage())
1522 // Weak linkage GVals could be zero or not. We're comparing that
1523 // to null pointer so its greater-or-equal
1524 return isSigned ? ICmpInst::ICMP_SGE : ICmpInst::ICMP_UGE;
1526 // If its not weak linkage, the GVal must have a non-zero address
1527 // so the result is greater-than
1528 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1529 } else if (isa<ConstantPointerNull>(CE1Op0)) {
1530 // If we are indexing from a null pointer, check to see if we have any
1531 // non-zero indices.
1532 for (unsigned i = 1, e = CE1->getNumOperands(); i != e; ++i)
1533 if (!CE1->getOperand(i)->isNullValue())
1534 // Offsetting from null, must not be equal.
1535 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1536 // Only zero indexes from null, must still be zero.
1537 return ICmpInst::ICMP_EQ;
1539 // Otherwise, we can't really say if the first operand is null or not.
1540 } else if (const GlobalValue *GV2 = dyn_cast<GlobalValue>(V2)) {
1541 if (isa<ConstantPointerNull>(CE1Op0)) {
1542 if (GV2->hasExternalWeakLinkage())
1543 // Weak linkage GVals could be zero or not. We're comparing it to
1544 // a null pointer, so its less-or-equal
1545 return isSigned ? ICmpInst::ICMP_SLE : ICmpInst::ICMP_ULE;
1547 // If its not weak linkage, the GVal must have a non-zero address
1548 // so the result is less-than
1549 return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
1550 } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(CE1Op0)) {
1552 // If this is a getelementptr of the same global, then it must be
1553 // different. Because the types must match, the getelementptr could
1554 // only have at most one index, and because we fold getelementptr's
1555 // with a single zero index, it must be nonzero.
1556 assert(CE1->getNumOperands() == 2 &&
1557 !CE1->getOperand(1)->isNullValue() &&
1558 "Surprising getelementptr!");
1559 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1561 if (CE1GEP->hasAllZeroIndices())
1562 return areGlobalsPotentiallyEqual(GV, GV2);
1563 return ICmpInst::BAD_ICMP_PREDICATE;
1567 ConstantExpr *CE2 = cast<ConstantExpr>(V2);
1568 Constant *CE2Op0 = CE2->getOperand(0);
1570 // There are MANY other foldings that we could perform here. They will
1571 // probably be added on demand, as they seem needed.
1572 switch (CE2->getOpcode()) {
1574 case Instruction::GetElementPtr:
1575 // By far the most common case to handle is when the base pointers are
1576 // obviously to the same global.
1577 if (isa<GlobalValue>(CE1Op0) && isa<GlobalValue>(CE2Op0)) {
1578 // Don't know relative ordering, but check for inequality.
1579 if (CE1Op0 != CE2Op0) {
1580 GEPOperator *CE2GEP = cast<GEPOperator>(CE2);
1581 if (CE1GEP->hasAllZeroIndices() && CE2GEP->hasAllZeroIndices())
1582 return areGlobalsPotentiallyEqual(cast<GlobalValue>(CE1Op0),
1583 cast<GlobalValue>(CE2Op0));
1584 return ICmpInst::BAD_ICMP_PREDICATE;
1586 // Ok, we know that both getelementptr instructions are based on the
1587 // same global. From this, we can precisely determine the relative
1588 // ordering of the resultant pointers.
1591 // The logic below assumes that the result of the comparison
1592 // can be determined by finding the first index that differs.
1593 // This doesn't work if there is over-indexing in any
1594 // subsequent indices, so check for that case first.
1595 if (!CE1->isGEPWithNoNotionalOverIndexing() ||
1596 !CE2->isGEPWithNoNotionalOverIndexing())
1597 return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
1599 // Compare all of the operands the GEP's have in common.
1600 gep_type_iterator GTI = gep_type_begin(CE1);
1601 for (;i != CE1->getNumOperands() && i != CE2->getNumOperands();
1603 switch (IdxCompare(CE1->getOperand(i),
1604 CE2->getOperand(i), GTI.getIndexedType())) {
1605 case -1: return isSigned ? ICmpInst::ICMP_SLT:ICmpInst::ICMP_ULT;
1606 case 1: return isSigned ? ICmpInst::ICMP_SGT:ICmpInst::ICMP_UGT;
1607 case -2: return ICmpInst::BAD_ICMP_PREDICATE;
1610 // Ok, we ran out of things they have in common. If any leftovers
1611 // are non-zero then we have a difference, otherwise we are equal.
1612 for (; i < CE1->getNumOperands(); ++i)
1613 if (!CE1->getOperand(i)->isNullValue()) {
1614 if (isa<ConstantInt>(CE1->getOperand(i)))
1615 return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
1617 return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
1620 for (; i < CE2->getNumOperands(); ++i)
1621 if (!CE2->getOperand(i)->isNullValue()) {
1622 if (isa<ConstantInt>(CE2->getOperand(i)))
1623 return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
1625 return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
1627 return ICmpInst::ICMP_EQ;
1637 return ICmpInst::BAD_ICMP_PREDICATE;
1640 Constant *llvm::ConstantFoldCompareInstruction(unsigned short pred,
1641 Constant *C1, Constant *C2) {
1643 if (VectorType *VT = dyn_cast<VectorType>(C1->getType()))
1644 ResultTy = VectorType::get(Type::getInt1Ty(C1->getContext()),
1645 VT->getNumElements());
1647 ResultTy = Type::getInt1Ty(C1->getContext());
1649 // Fold FCMP_FALSE/FCMP_TRUE unconditionally.
1650 if (pred == FCmpInst::FCMP_FALSE)
1651 return Constant::getNullValue(ResultTy);
1653 if (pred == FCmpInst::FCMP_TRUE)
1654 return Constant::getAllOnesValue(ResultTy);
1656 // Handle some degenerate cases first
1657 if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) {
1658 // For EQ and NE, we can always pick a value for the undef to make the
1659 // predicate pass or fail, so we can return undef.
1660 // Also, if both operands are undef, we can return undef.
1661 if (ICmpInst::isEquality(ICmpInst::Predicate(pred)) ||
1662 (isa<UndefValue>(C1) && isa<UndefValue>(C2)))
1663 return UndefValue::get(ResultTy);
1664 // Otherwise, pick the same value as the non-undef operand, and fold
1665 // it to true or false.
1666 return ConstantInt::get(ResultTy, CmpInst::isTrueWhenEqual(pred));
1669 // icmp eq/ne(null,GV) -> false/true
1670 if (C1->isNullValue()) {
1671 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C2))
1672 // Don't try to evaluate aliases. External weak GV can be null.
1673 if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage()) {
1674 if (pred == ICmpInst::ICMP_EQ)
1675 return ConstantInt::getFalse(C1->getContext());
1676 else if (pred == ICmpInst::ICMP_NE)
1677 return ConstantInt::getTrue(C1->getContext());
1679 // icmp eq/ne(GV,null) -> false/true
1680 } else if (C2->isNullValue()) {
1681 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C1))
1682 // Don't try to evaluate aliases. External weak GV can be null.
1683 if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage()) {
1684 if (pred == ICmpInst::ICMP_EQ)
1685 return ConstantInt::getFalse(C1->getContext());
1686 else if (pred == ICmpInst::ICMP_NE)
1687 return ConstantInt::getTrue(C1->getContext());
1691 // If the comparison is a comparison between two i1's, simplify it.
1692 if (C1->getType()->isIntegerTy(1)) {
1694 case ICmpInst::ICMP_EQ:
1695 if (isa<ConstantInt>(C2))
1696 return ConstantExpr::getXor(C1, ConstantExpr::getNot(C2));
1697 return ConstantExpr::getXor(ConstantExpr::getNot(C1), C2);
1698 case ICmpInst::ICMP_NE:
1699 return ConstantExpr::getXor(C1, C2);
1705 if (isa<ConstantInt>(C1) && isa<ConstantInt>(C2)) {
1706 APInt V1 = cast<ConstantInt>(C1)->getValue();
1707 APInt V2 = cast<ConstantInt>(C2)->getValue();
1709 default: llvm_unreachable("Invalid ICmp Predicate");
1710 case ICmpInst::ICMP_EQ: return ConstantInt::get(ResultTy, V1 == V2);
1711 case ICmpInst::ICMP_NE: return ConstantInt::get(ResultTy, V1 != V2);
1712 case ICmpInst::ICMP_SLT: return ConstantInt::get(ResultTy, V1.slt(V2));
1713 case ICmpInst::ICMP_SGT: return ConstantInt::get(ResultTy, V1.sgt(V2));
1714 case ICmpInst::ICMP_SLE: return ConstantInt::get(ResultTy, V1.sle(V2));
1715 case ICmpInst::ICMP_SGE: return ConstantInt::get(ResultTy, V1.sge(V2));
1716 case ICmpInst::ICMP_ULT: return ConstantInt::get(ResultTy, V1.ult(V2));
1717 case ICmpInst::ICMP_UGT: return ConstantInt::get(ResultTy, V1.ugt(V2));
1718 case ICmpInst::ICMP_ULE: return ConstantInt::get(ResultTy, V1.ule(V2));
1719 case ICmpInst::ICMP_UGE: return ConstantInt::get(ResultTy, V1.uge(V2));
1721 } else if (isa<ConstantFP>(C1) && isa<ConstantFP>(C2)) {
1722 APFloat C1V = cast<ConstantFP>(C1)->getValueAPF();
1723 APFloat C2V = cast<ConstantFP>(C2)->getValueAPF();
1724 APFloat::cmpResult R = C1V.compare(C2V);
1726 default: llvm_unreachable("Invalid FCmp Predicate");
1727 case FCmpInst::FCMP_FALSE: return Constant::getNullValue(ResultTy);
1728 case FCmpInst::FCMP_TRUE: return Constant::getAllOnesValue(ResultTy);
1729 case FCmpInst::FCMP_UNO:
1730 return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered);
1731 case FCmpInst::FCMP_ORD:
1732 return ConstantInt::get(ResultTy, R!=APFloat::cmpUnordered);
1733 case FCmpInst::FCMP_UEQ:
1734 return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
1735 R==APFloat::cmpEqual);
1736 case FCmpInst::FCMP_OEQ:
1737 return ConstantInt::get(ResultTy, R==APFloat::cmpEqual);
1738 case FCmpInst::FCMP_UNE:
1739 return ConstantInt::get(ResultTy, R!=APFloat::cmpEqual);
1740 case FCmpInst::FCMP_ONE:
1741 return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan ||
1742 R==APFloat::cmpGreaterThan);
1743 case FCmpInst::FCMP_ULT:
1744 return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
1745 R==APFloat::cmpLessThan);
1746 case FCmpInst::FCMP_OLT:
1747 return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan);
1748 case FCmpInst::FCMP_UGT:
1749 return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
1750 R==APFloat::cmpGreaterThan);
1751 case FCmpInst::FCMP_OGT:
1752 return ConstantInt::get(ResultTy, R==APFloat::cmpGreaterThan);
1753 case FCmpInst::FCMP_ULE:
1754 return ConstantInt::get(ResultTy, R!=APFloat::cmpGreaterThan);
1755 case FCmpInst::FCMP_OLE:
1756 return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan ||
1757 R==APFloat::cmpEqual);
1758 case FCmpInst::FCMP_UGE:
1759 return ConstantInt::get(ResultTy, R!=APFloat::cmpLessThan);
1760 case FCmpInst::FCMP_OGE:
1761 return ConstantInt::get(ResultTy, R==APFloat::cmpGreaterThan ||
1762 R==APFloat::cmpEqual);
1764 } else if (C1->getType()->isVectorTy()) {
1765 // If we can constant fold the comparison of each element, constant fold
1766 // the whole vector comparison.
1767 SmallVector<Constant*, 4> ResElts;
1768 Type *Ty = IntegerType::get(C1->getContext(), 32);
1769 // Compare the elements, producing an i1 result or constant expr.
1770 for (unsigned i = 0, e = C1->getType()->getVectorNumElements(); i != e;++i){
1772 ConstantExpr::getExtractElement(C1, ConstantInt::get(Ty, i));
1774 ConstantExpr::getExtractElement(C2, ConstantInt::get(Ty, i));
1776 ResElts.push_back(ConstantExpr::getCompare(pred, C1E, C2E));
1779 return ConstantVector::get(ResElts);
1782 if (C1->getType()->isFloatingPointTy()) {
1783 int Result = -1; // -1 = unknown, 0 = known false, 1 = known true.
1784 switch (evaluateFCmpRelation(C1, C2)) {
1785 default: llvm_unreachable("Unknown relation!");
1786 case FCmpInst::FCMP_UNO:
1787 case FCmpInst::FCMP_ORD:
1788 case FCmpInst::FCMP_UEQ:
1789 case FCmpInst::FCMP_UNE:
1790 case FCmpInst::FCMP_ULT:
1791 case FCmpInst::FCMP_UGT:
1792 case FCmpInst::FCMP_ULE:
1793 case FCmpInst::FCMP_UGE:
1794 case FCmpInst::FCMP_TRUE:
1795 case FCmpInst::FCMP_FALSE:
1796 case FCmpInst::BAD_FCMP_PREDICATE:
1797 break; // Couldn't determine anything about these constants.
1798 case FCmpInst::FCMP_OEQ: // We know that C1 == C2
1799 Result = (pred == FCmpInst::FCMP_UEQ || pred == FCmpInst::FCMP_OEQ ||
1800 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE ||
1801 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
1803 case FCmpInst::FCMP_OLT: // We know that C1 < C2
1804 Result = (pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
1805 pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT ||
1806 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE);
1808 case FCmpInst::FCMP_OGT: // We know that C1 > C2
1809 Result = (pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
1810 pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT ||
1811 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
1813 case FCmpInst::FCMP_OLE: // We know that C1 <= C2
1814 // We can only partially decide this relation.
1815 if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
1817 else if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
1820 case FCmpInst::FCMP_OGE: // We known that C1 >= C2
1821 // We can only partially decide this relation.
1822 if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
1824 else if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
1827 case FCmpInst::FCMP_ONE: // We know that C1 != C2
1828 // We can only partially decide this relation.
1829 if (pred == FCmpInst::FCMP_OEQ || pred == FCmpInst::FCMP_UEQ)
1831 else if (pred == FCmpInst::FCMP_ONE || pred == FCmpInst::FCMP_UNE)
1836 // If we evaluated the result, return it now.
1838 return ConstantInt::get(ResultTy, Result);
1841 // Evaluate the relation between the two constants, per the predicate.
1842 int Result = -1; // -1 = unknown, 0 = known false, 1 = known true.
1843 switch (evaluateICmpRelation(C1, C2, CmpInst::isSigned(pred))) {
1844 default: llvm_unreachable("Unknown relational!");
1845 case ICmpInst::BAD_ICMP_PREDICATE:
1846 break; // Couldn't determine anything about these constants.
1847 case ICmpInst::ICMP_EQ: // We know the constants are equal!
1848 // If we know the constants are equal, we can decide the result of this
1849 // computation precisely.
1850 Result = ICmpInst::isTrueWhenEqual((ICmpInst::Predicate)pred);
1852 case ICmpInst::ICMP_ULT:
1854 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_ULE:
1856 case ICmpInst::ICMP_UGT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_UGE:
1860 case ICmpInst::ICMP_SLT:
1862 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_SLE:
1864 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_SGE:
1868 case ICmpInst::ICMP_UGT:
1870 case ICmpInst::ICMP_UGT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGE:
1872 case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_ULE:
1876 case ICmpInst::ICMP_SGT:
1878 case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_SGE:
1880 case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_SLE:
1884 case ICmpInst::ICMP_ULE:
1885 if (pred == ICmpInst::ICMP_UGT) Result = 0;
1886 if (pred == ICmpInst::ICMP_ULT || pred == ICmpInst::ICMP_ULE) Result = 1;
1888 case ICmpInst::ICMP_SLE:
1889 if (pred == ICmpInst::ICMP_SGT) Result = 0;
1890 if (pred == ICmpInst::ICMP_SLT || pred == ICmpInst::ICMP_SLE) Result = 1;
1892 case ICmpInst::ICMP_UGE:
1893 if (pred == ICmpInst::ICMP_ULT) Result = 0;
1894 if (pred == ICmpInst::ICMP_UGT || pred == ICmpInst::ICMP_UGE) Result = 1;
1896 case ICmpInst::ICMP_SGE:
1897 if (pred == ICmpInst::ICMP_SLT) Result = 0;
1898 if (pred == ICmpInst::ICMP_SGT || pred == ICmpInst::ICMP_SGE) Result = 1;
1900 case ICmpInst::ICMP_NE:
1901 if (pred == ICmpInst::ICMP_EQ) Result = 0;
1902 if (pred == ICmpInst::ICMP_NE) Result = 1;
1906 // If we evaluated the result, return it now.
1908 return ConstantInt::get(ResultTy, Result);
1910 // If the right hand side is a bitcast, try using its inverse to simplify
1911 // it by moving it to the left hand side. We can't do this if it would turn
1912 // a vector compare into a scalar compare or visa versa.
1913 if (ConstantExpr *CE2 = dyn_cast<ConstantExpr>(C2)) {
1914 Constant *CE2Op0 = CE2->getOperand(0);
1915 if (CE2->getOpcode() == Instruction::BitCast &&
1916 CE2->getType()->isVectorTy() == CE2Op0->getType()->isVectorTy()) {
1917 Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType());
1918 return ConstantExpr::getICmp(pred, Inverse, CE2Op0);
1922 // If the left hand side is an extension, try eliminating it.
1923 if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
1924 if ((CE1->getOpcode() == Instruction::SExt && ICmpInst::isSigned(pred)) ||
1925 (CE1->getOpcode() == Instruction::ZExt && !ICmpInst::isSigned(pred))){
1926 Constant *CE1Op0 = CE1->getOperand(0);
1927 Constant *CE1Inverse = ConstantExpr::getTrunc(CE1, CE1Op0->getType());
1928 if (CE1Inverse == CE1Op0) {
1929 // Check whether we can safely truncate the right hand side.
1930 Constant *C2Inverse = ConstantExpr::getTrunc(C2, CE1Op0->getType());
1931 if (ConstantExpr::getCast(CE1->getOpcode(), C2Inverse,
1932 C2->getType()) == C2)
1933 return ConstantExpr::getICmp(pred, CE1Inverse, C2Inverse);
1938 if ((!isa<ConstantExpr>(C1) && isa<ConstantExpr>(C2)) ||
1939 (C1->isNullValue() && !C2->isNullValue())) {
1940 // If C2 is a constant expr and C1 isn't, flip them around and fold the
1941 // other way if possible.
1942 // Also, if C1 is null and C2 isn't, flip them around.
1943 pred = ICmpInst::getSwappedPredicate((ICmpInst::Predicate)pred);
1944 return ConstantExpr::getICmp(pred, C2, C1);
1950 /// isInBoundsIndices - Test whether the given sequence of *normalized* indices
1952 template<typename IndexTy>
1953 static bool isInBoundsIndices(ArrayRef<IndexTy> Idxs) {
1954 // No indices means nothing that could be out of bounds.
1955 if (Idxs.empty()) return true;
1957 // If the first index is zero, it's in bounds.
1958 if (cast<Constant>(Idxs[0])->isNullValue()) return true;
1960 // If the first index is one and all the rest are zero, it's in bounds,
1961 // by the one-past-the-end rule.
1962 if (!cast<ConstantInt>(Idxs[0])->isOne())
1964 for (unsigned i = 1, e = Idxs.size(); i != e; ++i)
1965 if (!cast<Constant>(Idxs[i])->isNullValue())
1970 /// \brief Test whether a given ConstantInt is in-range for a SequentialType.
1971 static bool isIndexInRangeOfSequentialType(const SequentialType *STy,
1972 const ConstantInt *CI) {
1973 if (const PointerType *PTy = dyn_cast<PointerType>(STy))
1974 // Only handle pointers to sized types, not pointers to functions.
1975 return PTy->getElementType()->isSized();
1977 uint64_t NumElements = 0;
1978 // Determine the number of elements in our sequential type.
1979 if (const ArrayType *ATy = dyn_cast<ArrayType>(STy))
1980 NumElements = ATy->getNumElements();
1981 else if (const VectorType *VTy = dyn_cast<VectorType>(STy))
1982 NumElements = VTy->getNumElements();
1984 assert((isa<ArrayType>(STy) || NumElements > 0) &&
1985 "didn't expect non-array type to have zero elements!");
1987 // We cannot bounds check the index if it doesn't fit in an int64_t.
1988 if (CI->getValue().getActiveBits() > 64)
1991 // A negative index or an index past the end of our sequential type is
1992 // considered out-of-range.
1993 int64_t IndexVal = CI->getSExtValue();
1994 if (IndexVal < 0 || (NumElements > 0 && (uint64_t)IndexVal >= NumElements))
1997 // Otherwise, it is in-range.
2001 template<typename IndexTy>
2002 static Constant *ConstantFoldGetElementPtrImpl(Constant *C,
2004 ArrayRef<IndexTy> Idxs) {
2005 if (Idxs.empty()) return C;
2006 Constant *Idx0 = cast<Constant>(Idxs[0]);
2007 if ((Idxs.size() == 1 && Idx0->isNullValue()))
2010 if (isa<UndefValue>(C)) {
2011 PointerType *Ptr = cast<PointerType>(C->getType());
2012 Type *Ty = GetElementPtrInst::getIndexedType(Ptr, Idxs);
2013 assert(Ty && "Invalid indices for GEP!");
2014 return UndefValue::get(PointerType::get(Ty, Ptr->getAddressSpace()));
2017 if (C->isNullValue()) {
2019 for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
2020 if (!cast<Constant>(Idxs[i])->isNullValue()) {
2025 PointerType *Ptr = cast<PointerType>(C->getType());
2026 Type *Ty = GetElementPtrInst::getIndexedType(Ptr, Idxs);
2027 assert(Ty && "Invalid indices for GEP!");
2028 return ConstantPointerNull::get(PointerType::get(Ty,
2029 Ptr->getAddressSpace()));
2033 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
2034 // Combine Indices - If the source pointer to this getelementptr instruction
2035 // is a getelementptr instruction, combine the indices of the two
2036 // getelementptr instructions into a single instruction.
2038 if (CE->getOpcode() == Instruction::GetElementPtr) {
2039 Type *LastTy = nullptr;
2040 for (gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE);
2044 // We cannot combine indices if doing so would take us outside of an
2045 // array or vector. Doing otherwise could trick us if we evaluated such a
2046 // GEP as part of a load.
2048 // e.g. Consider if the original GEP was:
2049 // i8* getelementptr ({ [2 x i8], i32, i8, [3 x i8] }* @main.c,
2050 // i32 0, i32 0, i64 0)
2052 // If we then tried to offset it by '8' to get to the third element,
2053 // an i8, we should *not* get:
2054 // i8* getelementptr ({ [2 x i8], i32, i8, [3 x i8] }* @main.c,
2055 // i32 0, i32 0, i64 8)
2057 // This GEP tries to index array element '8 which runs out-of-bounds.
2058 // Subsequent evaluation would get confused and produce erroneous results.
2060 // The following prohibits such a GEP from being formed by checking to see
2061 // if the index is in-range with respect to an array or vector.
2062 bool PerformFold = false;
2063 if (Idx0->isNullValue())
2065 else if (SequentialType *STy = dyn_cast_or_null<SequentialType>(LastTy))
2066 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx0))
2067 PerformFold = isIndexInRangeOfSequentialType(STy, CI);
2070 SmallVector<Value*, 16> NewIndices;
2071 NewIndices.reserve(Idxs.size() + CE->getNumOperands());
2072 for (unsigned i = 1, e = CE->getNumOperands()-1; i != e; ++i)
2073 NewIndices.push_back(CE->getOperand(i));
2075 // Add the last index of the source with the first index of the new GEP.
2076 // Make sure to handle the case when they are actually different types.
2077 Constant *Combined = CE->getOperand(CE->getNumOperands()-1);
2078 // Otherwise it must be an array.
2079 if (!Idx0->isNullValue()) {
2080 Type *IdxTy = Combined->getType();
2081 if (IdxTy != Idx0->getType()) {
2082 Type *Int64Ty = Type::getInt64Ty(IdxTy->getContext());
2083 Constant *C1 = ConstantExpr::getSExtOrBitCast(Idx0, Int64Ty);
2084 Constant *C2 = ConstantExpr::getSExtOrBitCast(Combined, Int64Ty);
2085 Combined = ConstantExpr::get(Instruction::Add, C1, C2);
2088 ConstantExpr::get(Instruction::Add, Idx0, Combined);
2092 NewIndices.push_back(Combined);
2093 NewIndices.append(Idxs.begin() + 1, Idxs.end());
2095 ConstantExpr::getGetElementPtr(CE->getOperand(0), NewIndices,
2097 cast<GEPOperator>(CE)->isInBounds());
2101 // Attempt to fold casts to the same type away. For example, folding:
2103 // i32* getelementptr ([2 x i32]* bitcast ([3 x i32]* %X to [2 x i32]*),
2107 // i32* getelementptr ([3 x i32]* %X, i64 0, i64 0)
2109 // Don't fold if the cast is changing address spaces.
2110 if (CE->isCast() && Idxs.size() > 1 && Idx0->isNullValue()) {
2111 PointerType *SrcPtrTy =
2112 dyn_cast<PointerType>(CE->getOperand(0)->getType());
2113 PointerType *DstPtrTy = dyn_cast<PointerType>(CE->getType());
2114 if (SrcPtrTy && DstPtrTy) {
2115 ArrayType *SrcArrayTy =
2116 dyn_cast<ArrayType>(SrcPtrTy->getElementType());
2117 ArrayType *DstArrayTy =
2118 dyn_cast<ArrayType>(DstPtrTy->getElementType());
2119 if (SrcArrayTy && DstArrayTy
2120 && SrcArrayTy->getElementType() == DstArrayTy->getElementType()
2121 && SrcPtrTy->getAddressSpace() == DstPtrTy->getAddressSpace())
2122 return ConstantExpr::getGetElementPtr((Constant*)CE->getOperand(0),
2128 // Check to see if any array indices are not within the corresponding
2129 // notional array or vector bounds. If so, try to determine if they can be
2130 // factored out into preceding dimensions.
2131 bool Unknown = false;
2132 SmallVector<Constant *, 8> NewIdxs;
2133 Type *Ty = C->getType();
2134 Type *Prev = nullptr;
2135 for (unsigned i = 0, e = Idxs.size(); i != e;
2136 Prev = Ty, Ty = cast<CompositeType>(Ty)->getTypeAtIndex(Idxs[i]), ++i) {
2137 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idxs[i])) {
2138 if (isa<ArrayType>(Ty) || isa<VectorType>(Ty))
2139 if (CI->getSExtValue() > 0 &&
2140 !isIndexInRangeOfSequentialType(cast<SequentialType>(Ty), CI)) {
2141 if (isa<SequentialType>(Prev)) {
2142 // It's out of range, but we can factor it into the prior
2144 NewIdxs.resize(Idxs.size());
2145 uint64_t NumElements = 0;
2146 if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty))
2147 NumElements = ATy->getNumElements();
2149 NumElements = cast<VectorType>(Ty)->getNumElements();
2151 ConstantInt *Factor = ConstantInt::get(CI->getType(), NumElements);
2152 NewIdxs[i] = ConstantExpr::getSRem(CI, Factor);
2154 Constant *PrevIdx = cast<Constant>(Idxs[i-1]);
2155 Constant *Div = ConstantExpr::getSDiv(CI, Factor);
2157 // Before adding, extend both operands to i64 to avoid
2158 // overflow trouble.
2159 if (!PrevIdx->getType()->isIntegerTy(64))
2160 PrevIdx = ConstantExpr::getSExt(PrevIdx,
2161 Type::getInt64Ty(Div->getContext()));
2162 if (!Div->getType()->isIntegerTy(64))
2163 Div = ConstantExpr::getSExt(Div,
2164 Type::getInt64Ty(Div->getContext()));
2166 NewIdxs[i-1] = ConstantExpr::getAdd(PrevIdx, Div);
2168 // It's out of range, but the prior dimension is a struct
2169 // so we can't do anything about it.
2174 // We don't know if it's in range or not.
2179 // If we did any factoring, start over with the adjusted indices.
2180 if (!NewIdxs.empty()) {
2181 for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
2182 if (!NewIdxs[i]) NewIdxs[i] = cast<Constant>(Idxs[i]);
2183 return ConstantExpr::getGetElementPtr(C, NewIdxs, inBounds);
2186 // If all indices are known integers and normalized, we can do a simple
2187 // check for the "inbounds" property.
2188 if (!Unknown && !inBounds)
2189 if (auto *GV = dyn_cast<GlobalVariable>(C))
2190 if (!GV->hasExternalWeakLinkage() && isInBoundsIndices(Idxs))
2191 return ConstantExpr::getInBoundsGetElementPtr(C, Idxs);
2196 Constant *llvm::ConstantFoldGetElementPtr(Constant *C,
2198 ArrayRef<Constant *> Idxs) {
2199 return ConstantFoldGetElementPtrImpl(C, inBounds, Idxs);
2202 Constant *llvm::ConstantFoldGetElementPtr(Constant *C,
2204 ArrayRef<Value *> Idxs) {
2205 return ConstantFoldGetElementPtrImpl(C, inBounds, Idxs);