LCOV - code coverage report
Current view: top level - lib/IR - ConstantFold.cpp (source / functions) Hit Total Coverage
Test: llvm-toolchain.info Lines: 803 917 87.6 %
Date: 2018-06-17 00:07:59 Functions: 25 25 100.0 %
Legend: Lines: hit not hit

          Line data    Source code
       1             : //===- ConstantFold.cpp - LLVM constant folder ----------------------------===//
       2             : //
       3             : //                     The LLVM Compiler Infrastructure
       4             : //
       5             : // This file is distributed under the University of Illinois Open Source
       6             : // License. See LICENSE.TXT for details.
       7             : //
       8             : //===----------------------------------------------------------------------===//
       9             : //
      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.
      13             : //
      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.
      17             : //
      18             : //===----------------------------------------------------------------------===//
      19             : 
      20             : #include "ConstantFold.h"
      21             : #include "llvm/ADT/APSInt.h"
      22             : #include "llvm/ADT/SmallVector.h"
      23             : #include "llvm/IR/Constants.h"
      24             : #include "llvm/IR/DerivedTypes.h"
      25             : #include "llvm/IR/Function.h"
      26             : #include "llvm/IR/GetElementPtrTypeIterator.h"
      27             : #include "llvm/IR/GlobalAlias.h"
      28             : #include "llvm/IR/GlobalVariable.h"
      29             : #include "llvm/IR/Instructions.h"
      30             : #include "llvm/IR/Operator.h"
      31             : #include "llvm/IR/PatternMatch.h"
      32             : #include "llvm/Support/ErrorHandling.h"
      33             : #include "llvm/Support/ManagedStatic.h"
      34             : #include "llvm/Support/MathExtras.h"
      35             : using namespace llvm;
      36             : using namespace llvm::PatternMatch;
      37             : 
      38             : //===----------------------------------------------------------------------===//
      39             : //                ConstantFold*Instruction Implementations
      40             : //===----------------------------------------------------------------------===//
      41             : 
      42             : /// Convert the specified vector Constant node to the specified vector type.
      43             : /// At this point, we know that the elements of the input vector constant are
      44             : /// all simple integer or FP values.
      45         186 : static Constant *BitCastConstantVector(Constant *CV, VectorType *DstTy) {
      46             : 
      47         186 :   if (CV->isAllOnesValue()) return Constant::getAllOnesValue(DstTy);
      48          96 :   if (CV->isNullValue()) return Constant::getNullValue(DstTy);
      49             : 
      50             :   // If this cast changes element count then we can't handle it here:
      51             :   // doing so requires endianness information.  This should be handled by
      52             :   // Analysis/ConstantFolding.cpp
      53          96 :   unsigned NumElts = DstTy->getNumElements();
      54         192 :   if (NumElts != CV->getType()->getVectorNumElements())
      55             :     return nullptr;
      56             : 
      57           2 :   Type *DstEltTy = DstTy->getElementType();
      58             : 
      59             :   SmallVector<Constant*, 16> Result;
      60           2 :   Type *Ty = IntegerType::get(CV->getContext(), 32);
      61          10 :   for (unsigned i = 0; i != NumElts; ++i) {
      62             :     Constant *C =
      63           4 :       ConstantExpr::getExtractElement(CV, ConstantInt::get(Ty, i));
      64           4 :     C = ConstantExpr::getBitCast(C, DstEltTy);
      65           4 :     Result.push_back(C);
      66             :   }
      67             : 
      68           2 :   return ConstantVector::get(Result);
      69             : }
      70             : 
      71             : /// This function determines which opcode to use to fold two constant cast
      72             : /// expressions together. It uses CastInst::isEliminableCastPair to determine
      73             : /// the opcode. Consequently its just a wrapper around that function.
      74             : /// Determine if it is valid to fold a cast of a cast
      75             : static unsigned
      76      532374 : foldConstantCastPair(
      77             :   unsigned opc,          ///< opcode of the second cast constant expression
      78             :   ConstantExpr *Op,      ///< the first cast constant expression
      79             :   Type *DstTy            ///< destination type of the first cast
      80             : ) {
      81             :   assert(Op && Op->isCast() && "Can't fold cast of cast without a cast!");
      82             :   assert(DstTy && DstTy->isFirstClassType() && "Invalid cast destination type");
      83             :   assert(CastInst::isCast(opc) && "Invalid cast opcode");
      84             : 
      85             :   // The types and opcodes for the two Cast constant expressions
      86      532374 :   Type *SrcTy = Op->getOperand(0)->getType();
      87      532374 :   Type *MidTy = Op->getType();
      88             :   Instruction::CastOps firstOp = Instruction::CastOps(Op->getOpcode());
      89             :   Instruction::CastOps secondOp = Instruction::CastOps(opc);
      90             : 
      91             :   // Assume that pointers are never more than 64 bits wide, and only use this
      92             :   // for the middle type. Otherwise we could end up folding away illegal
      93             :   // bitcasts between address spaces with different sizes.
      94      532374 :   IntegerType *FakeIntPtrTy = Type::getInt64Ty(DstTy->getContext());
      95             : 
      96             :   // Let CastInst::isEliminableCastPair do the heavy lifting.
      97             :   return CastInst::isEliminableCastPair(firstOp, secondOp, SrcTy, MidTy, DstTy,
      98      532374 :                                         nullptr, FakeIntPtrTy, nullptr);
      99             : }
     100             : 
     101     1632399 : static Constant *FoldBitCast(Constant *V, Type *DestTy) {
     102     1632399 :   Type *SrcTy = V->getType();
     103     1632399 :   if (SrcTy == DestTy)
     104             :     return V; // no-op cast
     105             : 
     106             :   // Check to see if we are casting a pointer to an aggregate to a pointer to
     107             :   // the first element.  If so, return the appropriate GEP instruction.
     108             :   if (PointerType *PTy = dyn_cast<PointerType>(V->getType()))
     109             :     if (PointerType *DPTy = dyn_cast<PointerType>(DestTy))
     110             :       if (PTy->getAddressSpace() == DPTy->getAddressSpace()
     111     1629948 :           && PTy->getElementType()->isSized()) {
     112             :         SmallVector<Value*, 8> IdxList;
     113             :         Value *Zero =
     114     1581561 :           Constant::getNullValue(Type::getInt32Ty(DPTy->getContext()));
     115     1581561 :         IdxList.push_back(Zero);
     116     1581561 :         Type *ElTy = PTy->getElementType();
     117     3074089 :         while (ElTy != DPTy->getElementType()) {
     118             :           if (StructType *STy = dyn_cast<StructType>(ElTy)) {
     119       29626 :             if (STy->getNumElements() == 0) break;
     120       29597 :             ElTy = STy->getElementType(0);
     121       29597 :             IdxList.push_back(Zero);
     122             :           } else if (SequentialType *STy =
     123             :                      dyn_cast<SequentialType>(ElTy)) {
     124     1462931 :             ElTy = STy->getElementType();
     125     1462931 :             IdxList.push_back(Zero);
     126             :           } else {
     127             :             break;
     128             :           }
     129             :         }
     130             : 
     131     1581561 :         if (ElTy == DPTy->getElementType())
     132             :           // This GEP is inbounds because all indices are zero.
     133       21113 :           return ConstantExpr::getInBoundsGetElementPtr(PTy->getElementType(),
     134             :                                                         V, IdxList);
     135             :       }
     136             : 
     137             :   // Handle casts from one vector constant to another.  We know that the src
     138             :   // and dest type have the same size (otherwise its an illegal cast).
     139             :   if (VectorType *DestPTy = dyn_cast<VectorType>(DestTy)) {
     140         304 :     if (VectorType *SrcTy = dyn_cast<VectorType>(V->getType())) {
     141             :       assert(DestPTy->getBitWidth() == SrcTy->getBitWidth() &&
     142             :              "Not cast between same sized vectors!");
     143             :       SrcTy = nullptr;
     144             :       // First, check for null.  Undef is already handled.
     145         186 :       if (isa<ConstantAggregateZero>(V))
     146           0 :         return Constant::getNullValue(DestTy);
     147             : 
     148             :       // Handle ConstantVector and ConstantAggregateVector.
     149         186 :       return BitCastConstantVector(V, DestPTy);
     150             :     }
     151             : 
     152             :     // Canonicalize scalar-to-vector bitcasts into vector-to-vector bitcasts
     153             :     // This allows for other simplifications (although some of them
     154             :     // can only be handled by Analysis/ConstantFolding.cpp).
     155         118 :     if (isa<ConstantInt>(V) || isa<ConstantFP>(V))
     156          89 :       return ConstantExpr::getBitCast(ConstantVector::get(V), DestPTy);
     157             :   }
     158             : 
     159             :   // Finally, implement bitcast folding now.   The code below doesn't handle
     160             :   // bitcast right.
     161     3222022 :   if (isa<ConstantPointerNull>(V))  // ptr->ptr cast.
     162           0 :     return ConstantPointerNull::get(cast<PointerType>(DestTy));
     163             : 
     164             :   // Handle integral constant input.
     165             :   if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
     166         629 :     if (DestTy->isIntegerTy())
     167             :       // Integral -> Integral. This is a no-op because the bit widths must
     168             :       // be the same. Consequently, we just fold to V.
     169             :       return V;
     170             : 
     171             :     // See note below regarding the PPC_FP128 restriction.
     172         625 :     if (DestTy->isFloatingPointTy() && !DestTy->isPPC_FP128Ty())
     173         625 :       return ConstantFP::get(DestTy->getContext(),
     174        1250 :                              APFloat(DestTy->getFltSemantics(),
     175         625 :                                      CI->getValue()));
     176             : 
     177             :     // Otherwise, can't fold this (vector?)
     178             :     return nullptr;
     179             :   }
     180             : 
     181             :   // Handle ConstantFP input: FP -> Integral.
     182             :   if (ConstantFP *FP = dyn_cast<ConstantFP>(V)) {
     183             :     // PPC_FP128 is really the sum of two consecutive doubles, where the first
     184             :     // double is always stored first in memory, regardless of the target
     185             :     // endianness. The memory layout of i128, however, depends on the target
     186             :     // endianness, and so we can't fold this without target endianness
     187             :     // information. This should instead be handled by
     188             :     // Analysis/ConstantFolding.cpp
     189        2666 :     if (FP->getType()->isPPC_FP128Ty())
     190             :       return nullptr;
     191             : 
     192             :     // Make sure dest type is compatible with the folded integer constant.
     193        1324 :     if (!DestTy->isIntegerTy())
     194             :       return nullptr;
     195             : 
     196        1319 :     return ConstantInt::get(FP->getContext(),
     197        3957 :                             FP->getValueAPF().bitcastToAPInt());
     198             :   }
     199             : 
     200             :   return nullptr;
     201             : }
     202             : 
     203             : 
     204             : /// V is an integer constant which only has a subset of its bytes used.
     205             : /// The bytes used are indicated by ByteStart (which is the first byte used,
     206             : /// counting from the least significant byte) and ByteSize, which is the number
     207             : /// of bytes used.
     208             : ///
     209             : /// This function analyzes the specified constant to see if the specified byte
     210             : /// range can be returned as a simplified constant.  If so, the constant is
     211             : /// returned, otherwise null is returned.
     212        1250 : static Constant *ExtractConstantBytes(Constant *C, unsigned ByteStart,
     213             :                                       unsigned ByteSize) {
     214             :   assert(C->getType()->isIntegerTy() &&
     215             :          (cast<IntegerType>(C->getType())->getBitWidth() & 7) == 0 &&
     216             :          "Non-byte sized integer input");
     217        2500 :   unsigned CSize = cast<IntegerType>(C->getType())->getBitWidth()/8;
     218             :   assert(ByteSize && "Must be accessing some piece");
     219             :   assert(ByteStart+ByteSize <= CSize && "Extracting invalid piece from input");
     220             :   assert(ByteSize != CSize && "Should not extract everything");
     221             : 
     222             :   // Constant Integers are simple.
     223             :   if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
     224             :     APInt V = CI->getValue();
     225          18 :     if (ByteStart)
     226          13 :       V.lshrInPlace(ByteStart*8);
     227          36 :     V = V.trunc(ByteSize*8);
     228          18 :     return ConstantInt::get(CI->getContext(), V);
     229             :   }
     230             : 
     231             :   // In the input is a constant expr, we might be able to recursively simplify.
     232             :   // If not, we definitely can't do anything.
     233             :   ConstantExpr *CE = dyn_cast<ConstantExpr>(C);
     234             :   if (!CE) return nullptr;
     235             : 
     236        1232 :   switch (CE->getOpcode()) {
     237             :   default: return nullptr;
     238             :   case Instruction::Or: {
     239          14 :     Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize);
     240          14 :     if (!RHS)
     241             :       return nullptr;
     242             : 
     243             :     // X | -1 -> -1.
     244             :     if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS))
     245          12 :       if (RHSC->isMinusOne())
     246             :         return RHSC;
     247             : 
     248          14 :     Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize);
     249          14 :     if (!LHS)
     250             :       return nullptr;
     251           7 :     return ConstantExpr::getOr(LHS, RHS);
     252             :   }
     253             :   case Instruction::And: {
     254          11 :     Constant *RHS = ExtractConstantBytes(CE->getOperand(1), ByteStart,ByteSize);
     255          11 :     if (!RHS)
     256             :       return nullptr;
     257             : 
     258             :     // X & 0 -> 0.
     259          11 :     if (RHS->isNullValue())
     260             :       return RHS;
     261             : 
     262           7 :     Constant *LHS = ExtractConstantBytes(CE->getOperand(0), ByteStart,ByteSize);
     263           7 :     if (!LHS)
     264             :       return nullptr;
     265           3 :     return ConstantExpr::getAnd(LHS, RHS);
     266             :   }
     267             :   case Instruction::LShr: {
     268             :     ConstantInt *Amt = dyn_cast<ConstantInt>(CE->getOperand(1));
     269             :     if (!Amt)
     270             :       return nullptr;
     271          36 :     unsigned ShAmt = Amt->getZExtValue();
     272             :     // Cannot analyze non-byte shifts.
     273          36 :     if ((ShAmt & 7) != 0)
     274             :       return nullptr;
     275          36 :     ShAmt >>= 3;
     276             : 
     277             :     // If the extract is known to be all zeros, return zero.
     278          36 :     if (ByteStart >= CSize-ShAmt)
     279           0 :       return Constant::getNullValue(IntegerType::get(CE->getContext(),
     280           0 :                                                      ByteSize*8));
     281             :     // If the extract is known to be fully in the input, extract it.
     282          36 :     if (ByteStart+ByteSize+ShAmt <= CSize)
     283          72 :       return ExtractConstantBytes(CE->getOperand(0), ByteStart+ShAmt, ByteSize);
     284             : 
     285             :     // TODO: Handle the 'partially zero' case.
     286             :     return nullptr;
     287             :   }
     288             : 
     289             :   case Instruction::Shl: {
     290             :     ConstantInt *Amt = dyn_cast<ConstantInt>(CE->getOperand(1));
     291             :     if (!Amt)
     292             :       return nullptr;
     293          20 :     unsigned ShAmt = Amt->getZExtValue();
     294             :     // Cannot analyze non-byte shifts.
     295          20 :     if ((ShAmt & 7) != 0)
     296             :       return nullptr;
     297          16 :     ShAmt >>= 3;
     298             : 
     299             :     // If the extract is known to be all zeros, return zero.
     300          16 :     if (ByteStart+ByteSize <= ShAmt)
     301           5 :       return Constant::getNullValue(IntegerType::get(CE->getContext(),
     302           5 :                                                      ByteSize*8));
     303             :     // If the extract is known to be fully in the input, extract it.
     304          11 :     if (ByteStart >= ShAmt)
     305          10 :       return ExtractConstantBytes(CE->getOperand(0), ByteStart-ShAmt, ByteSize);
     306             : 
     307             :     // TODO: Handle the 'partially zero' case.
     308             :     return nullptr;
     309             :   }
     310             : 
     311             :   case Instruction::ZExt: {
     312             :     unsigned SrcBitSize =
     313          12 :       cast<IntegerType>(CE->getOperand(0)->getType())->getBitWidth();
     314             : 
     315             :     // If extracting something that is completely zero, return 0.
     316          12 :     if (ByteStart*8 >= SrcBitSize)
     317           6 :       return Constant::getNullValue(IntegerType::get(CE->getContext(),
     318           6 :                                                      ByteSize*8));
     319             : 
     320             :     // If exactly extracting the input, return it.
     321           6 :     if (ByteStart == 0 && ByteSize*8 == SrcBitSize)
     322             :       return CE->getOperand(0);
     323             : 
     324             :     // If extracting something completely in the input, if the input is a
     325             :     // multiple of 8 bits, recurse.
     326           1 :     if ((SrcBitSize&7) == 0 && (ByteStart+ByteSize)*8 <= SrcBitSize)
     327           0 :       return ExtractConstantBytes(CE->getOperand(0), ByteStart, ByteSize);
     328             : 
     329             :     // Otherwise, if extracting a subset of the input, which is not multiple of
     330             :     // 8 bits, do a shift and trunc to get the bits.
     331           1 :     if ((ByteStart+ByteSize)*8 < SrcBitSize) {
     332             :       assert((SrcBitSize&7) && "Shouldn't get byte sized case here");
     333             :       Constant *Res = CE->getOperand(0);
     334           0 :       if (ByteStart)
     335           0 :         Res = ConstantExpr::getLShr(Res,
     336             :                                  ConstantInt::get(Res->getType(), ByteStart*8));
     337           0 :       return ConstantExpr::getTrunc(Res, IntegerType::get(C->getContext(),
     338           0 :                                                           ByteSize*8));
     339             :     }
     340             : 
     341             :     // TODO: Handle the 'partially zero' case.
     342             :     return nullptr;
     343             :   }
     344             :   }
     345             : }
     346             : 
     347             : /// Return a ConstantExpr with type DestTy for sizeof on Ty, with any known
     348             : /// factors factored out. If Folded is false, return null if no factoring was
     349             : /// possible, to avoid endlessly bouncing an unfoldable expression back into the
     350             : /// top-level folder.
     351         749 : static Constant *getFoldedSizeOf(Type *Ty, Type *DestTy, bool Folded) {
     352             :   if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
     353          21 :     Constant *N = ConstantInt::get(DestTy, ATy->getNumElements());
     354          21 :     Constant *E = getFoldedSizeOf(ATy->getElementType(), DestTy, true);
     355          21 :     return ConstantExpr::getNUWMul(E, N);
     356             :   }
     357             : 
     358             :   if (StructType *STy = dyn_cast<StructType>(Ty))
     359         112 :     if (!STy->isPacked()) {
     360         112 :       unsigned NumElems = STy->getNumElements();
     361             :       // An empty struct has size zero.
     362         112 :       if (NumElems == 0)
     363           0 :         return ConstantExpr::getNullValue(DestTy);
     364             :       // Check for a struct with all members having the same size.
     365             :       Constant *MemberSize =
     366         224 :         getFoldedSizeOf(STy->getElementType(0), DestTy, true);
     367             :       bool AllSame = true;
     368         138 :       for (unsigned i = 1; i != NumElems; ++i)
     369          32 :         if (MemberSize !=
     370          64 :             getFoldedSizeOf(STy->getElementType(i), DestTy, true)) {
     371             :           AllSame = false;
     372             :           break;
     373             :         }
     374         112 :       if (AllSame) {
     375          93 :         Constant *N = ConstantInt::get(DestTy, NumElems);
     376          93 :         return ConstantExpr::getNUWMul(MemberSize, N);
     377             :       }
     378             :     }
     379             : 
     380             :   // Pointer size doesn't depend on the pointee type, so canonicalize them
     381             :   // to an arbitrary pointee.
     382             :   if (PointerType *PTy = dyn_cast<PointerType>(Ty))
     383          48 :     if (!PTy->getElementType()->isIntegerTy(1))
     384             :       return
     385          15 :         getFoldedSizeOf(PointerType::get(IntegerType::get(PTy->getContext(), 1),
     386             :                                          PTy->getAddressSpace()),
     387          15 :                         DestTy, true);
     388             : 
     389             :   // If there's no interesting folding happening, bail so that we don't create
     390             :   // a constant that looks like it needs folding but really doesn't.
     391         620 :   if (!Folded)
     392             :     return nullptr;
     393             : 
     394             :   // Base case: Get a regular sizeof expression.
     395         197 :   Constant *C = ConstantExpr::getSizeOf(Ty);
     396         197 :   C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
     397             :                                                     DestTy, false),
     398             :                             C, DestTy);
     399         197 :   return C;
     400             : }
     401             : 
     402             : /// Return a ConstantExpr with type DestTy for alignof on Ty, with any known
     403             : /// factors factored out. If Folded is false, return null if no factoring was
     404             : /// possible, to avoid endlessly bouncing an unfoldable expression back into the
     405             : /// top-level folder.
     406         106 : static Constant *getFoldedAlignOf(Type *Ty, Type *DestTy, bool Folded) {
     407             :   // The alignment of an array is equal to the alignment of the
     408             :   // array element. Note that this is not always true for vectors.
     409             :   if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
     410          10 :     Constant *C = ConstantExpr::getAlignOf(ATy->getElementType());
     411          10 :     C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
     412             :                                                       DestTy,
     413             :                                                       false),
     414             :                               C, DestTy);
     415          10 :     return C;
     416             :   }
     417             : 
     418             :   if (StructType *STy = dyn_cast<StructType>(Ty)) {
     419             :     // Packed structs always have an alignment of 1.
     420          20 :     if (STy->isPacked())
     421          10 :       return ConstantInt::get(DestTy, 1);
     422             : 
     423             :     // Otherwise, struct alignment is the maximum alignment of any member.
     424             :     // Without target data, we can't compare much, but we can check to see
     425             :     // if all the members have the same alignment.
     426          10 :     unsigned NumElems = STy->getNumElements();
     427             :     // An empty struct has minimal alignment.
     428          10 :     if (NumElems == 0)
     429           0 :       return ConstantInt::get(DestTy, 1);
     430             :     // Check for a struct with all members having the same alignment.
     431             :     Constant *MemberAlign =
     432          20 :       getFoldedAlignOf(STy->getElementType(0), DestTy, true);
     433             :     bool AllSame = true;
     434          30 :     for (unsigned i = 1; i != NumElems; ++i)
     435          20 :       if (MemberAlign != getFoldedAlignOf(STy->getElementType(i), DestTy, true)) {
     436             :         AllSame = false;
     437             :         break;
     438             :       }
     439          10 :     if (AllSame)
     440             :       return MemberAlign;
     441             :   }
     442             : 
     443             :   // Pointer alignment doesn't depend on the pointee type, so canonicalize them
     444             :   // to an arbitrary pointee.
     445             :   if (PointerType *PTy = dyn_cast<PointerType>(Ty))
     446          24 :     if (!PTy->getElementType()->isIntegerTy(1))
     447             :       return
     448           8 :         getFoldedAlignOf(PointerType::get(IntegerType::get(PTy->getContext(),
     449             :                                                            1),
     450             :                                           PTy->getAddressSpace()),
     451           8 :                          DestTy, true);
     452             : 
     453             :   // If there's no interesting folding happening, bail so that we don't create
     454             :   // a constant that looks like it needs folding but really doesn't.
     455          68 :   if (!Folded)
     456             :     return nullptr;
     457             : 
     458             :   // Base case: Get a regular alignof expression.
     459          28 :   Constant *C = ConstantExpr::getAlignOf(Ty);
     460          28 :   C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
     461             :                                                     DestTy, false),
     462             :                             C, DestTy);
     463          28 :   return C;
     464             : }
     465             : 
     466             : /// Return a ConstantExpr with type DestTy for offsetof on Ty and FieldNo, with
     467             : /// any known factors factored out. If Folded is false, return null if no
     468             : /// factoring was possible, to avoid endlessly bouncing an unfoldable expression
     469             : /// back into the top-level folder.
     470          35 : static Constant *getFoldedOffsetOf(Type *Ty, Constant *FieldNo, Type *DestTy,
     471             :                                    bool Folded) {
     472             :   if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
     473          10 :     Constant *N = ConstantExpr::getCast(CastInst::getCastOpcode(FieldNo, false,
     474             :                                                                 DestTy, false),
     475          10 :                                         FieldNo, DestTy);
     476          10 :     Constant *E = getFoldedSizeOf(ATy->getElementType(), DestTy, true);
     477          10 :     return ConstantExpr::getNUWMul(E, N);
     478             :   }
     479             : 
     480             :   if (StructType *STy = dyn_cast<StructType>(Ty))
     481          25 :     if (!STy->isPacked()) {
     482          25 :       unsigned NumElems = STy->getNumElements();
     483             :       // An empty struct has no members.
     484          25 :       if (NumElems == 0)
     485             :         return nullptr;
     486             :       // Check for a struct with all members having the same size.
     487             :       Constant *MemberSize =
     488          50 :         getFoldedSizeOf(STy->getElementType(0), DestTy, true);
     489             :       bool AllSame = true;
     490          85 :       for (unsigned i = 1; i != NumElems; ++i)
     491          45 :         if (MemberSize !=
     492          90 :             getFoldedSizeOf(STy->getElementType(i), DestTy, true)) {
     493             :           AllSame = false;
     494             :           break;
     495             :         }
     496          25 :       if (AllSame) {
     497          10 :         Constant *N = ConstantExpr::getCast(CastInst::getCastOpcode(FieldNo,
     498             :                                                                     false,
     499             :                                                                     DestTy,
     500             :                                                                     false),
     501          10 :                                             FieldNo, DestTy);
     502          10 :         return ConstantExpr::getNUWMul(MemberSize, N);
     503             :       }
     504             :     }
     505             : 
     506             :   // If there's no interesting folding happening, bail so that we don't create
     507             :   // a constant that looks like it needs folding but really doesn't.
     508          15 :   if (!Folded)
     509             :     return nullptr;
     510             : 
     511             :   // Base case: Get a regular offsetof expression.
     512           0 :   Constant *C = ConstantExpr::getOffsetOf(Ty, FieldNo);
     513           0 :   C = ConstantExpr::getCast(CastInst::getCastOpcode(C, false,
     514             :                                                     DestTy, false),
     515             :                             C, DestTy);
     516           0 :   return C;
     517             : }
     518             : 
     519     3095930 : Constant *llvm::ConstantFoldCastInstruction(unsigned opc, Constant *V,
     520             :                                             Type *DestTy) {
     521     3095930 :   if (isa<UndefValue>(V)) {
     522             :     // zext(undef) = 0, because the top bits will be zero.
     523             :     // sext(undef) = 0, because the top bits will all be the same.
     524             :     // [us]itofp(undef) = 0, because the result value is bounded.
     525        8538 :     if (opc == Instruction::ZExt || opc == Instruction::SExt ||
     526        4504 :         opc == Instruction::UIToFP || opc == Instruction::SIToFP)
     527        4036 :       return Constant::getNullValue(DestTy);
     528         233 :     return UndefValue::get(DestTy);
     529             :   }
     530             : 
     531     3427039 :   if (V->isNullValue() && !DestTy->isX86_MMXTy() &&
     532             :       opc != Instruction::AddrSpaceCast)
     533      334872 :     return Constant::getNullValue(DestTy);
     534             : 
     535             :   // If the cast operand is a constant expression, there's a few things we can
     536             :   // do to try to simplify it.
     537             :   if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) {
     538      791275 :     if (CE->isCast()) {
     539             :       // Try hard to fold cast of cast because they are often eliminable.
     540      532374 :       if (unsigned newOpc = foldConstantCastPair(opc, CE, DestTy))
     541      531500 :         return ConstantExpr::getCast(newOpc, CE->getOperand(0), DestTy);
     542      512083 :     } else if (CE->getOpcode() == Instruction::GetElementPtr &&
     543             :                // Do not fold addrspacecast (gep 0, .., 0). It might make the
     544             :                // addrspacecast uncanonicalized.
     545      253102 :                opc != Instruction::AddrSpaceCast &&
     546             :                // Do not fold bitcast (gep) with inrange index, as this loses
     547             :                // information.
     548      738851 :                !cast<GEPOperator>(CE)->getInRangeIndex().hasValue() &&
     549             :                // Do not fold if the gep type is a vector, as bitcasting
     550             :                // operand 0 of a vector gep will result in a bitcast between
     551             :                // different sizes.
     552      226848 :                !CE->getType()->isVectorTy()) {
     553             :       // If all of the indexes in the GEP are null values, there is no pointer
     554             :       // adjustment going on.  We might as well cast the source pointer.
     555             :       bool isAllNull = true;
     556      999158 :       for (unsigned i = 1, e = CE->getNumOperands(); i != e; ++i)
     557      449223 :         if (!CE->getOperand(i)->isNullValue()) {
     558             :           isAllNull = false;
     559             :           break;
     560             :         }
     561      226844 :       if (isAllNull)
     562             :         // This is casting one pointer type to another, always BitCast
     563      163778 :         return ConstantExpr::getPointerCast(CE->getOperand(0), DestTy);
     564             :     }
     565             :   }
     566             : 
     567             :   // If the cast operand is a constant vector, perform the cast by
     568             :   // operating on each element. In the cast of bitcasts, the element
     569             :   // count may be mismatched; don't attempt to handle that here.
     570     2062369 :   if ((isa<ConstantVector>(V) || isa<ConstantDataVector>(V)) &&
     571     2062422 :       DestTy->isVectorTy() &&
     572         911 :       DestTy->getVectorNumElements() == V->getType()->getVectorNumElements()) {
     573             :     SmallVector<Constant*, 16> res;
     574             :     VectorType *DestVecTy = cast<VectorType>(DestTy);
     575         730 :     Type *DstEltTy = DestVecTy->getElementType();
     576         730 :     Type *Ty = IntegerType::get(V->getContext(), 32);
     577        8006 :     for (unsigned i = 0, e = V->getType()->getVectorNumElements(); i != e; ++i) {
     578             :       Constant *C =
     579        3273 :         ConstantExpr::getExtractElement(V, ConstantInt::get(Ty, i));
     580        3273 :       res.push_back(ConstantExpr::getCast(opc, C, DstEltTy));
     581             :     }
     582         730 :     return ConstantVector::get(res);
     583             :   }
     584             : 
     585             :   // We actually have to do a cast now. Perform the cast according to the
     586             :   // opcode specified.
     587     2060781 :   switch (opc) {
     588           0 :   default:
     589           0 :     llvm_unreachable("Failed to cast constant expression");
     590        1926 :   case Instruction::FPTrunc:
     591             :   case Instruction::FPExt:
     592             :     if (ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
     593             :       bool ignored;
     594             :       APFloat Val = FPC->getValueAPF();
     595        1924 :       Val.convert(DestTy->isHalfTy() ? APFloat::IEEEhalf() :
     596             :                   DestTy->isFloatTy() ? APFloat::IEEEsingle() :
     597             :                   DestTy->isDoubleTy() ? APFloat::IEEEdouble() :
     598             :                   DestTy->isX86_FP80Ty() ? APFloat::x87DoubleExtended() :
     599             :                   DestTy->isFP128Ty() ? APFloat::IEEEquad() :
     600             :                   DestTy->isPPC_FP128Ty() ? APFloat::PPCDoubleDouble() :
     601             :                   APFloat::Bogus(),
     602             :                   APFloat::rmNearestTiesToEven, &ignored);
     603        1924 :       return ConstantFP::get(V->getContext(), Val);
     604             :     }
     605             :     return nullptr; // Can't fold.
     606          72 :   case Instruction::FPToUI:
     607             :   case Instruction::FPToSI:
     608             :     if (ConstantFP *FPC = dyn_cast<ConstantFP>(V)) {
     609             :       const APFloat &V = FPC->getValueAPF();
     610             :       bool ignored;
     611             :       uint32_t DestBitWidth = cast<IntegerType>(DestTy)->getBitWidth();
     612          72 :       APSInt IntVal(DestBitWidth, opc == Instruction::FPToUI);
     613          72 :       if (APFloat::opInvalidOp ==
     614          72 :           V.convertToInteger(IntVal, APFloat::rmTowardZero, &ignored)) {
     615             :         // Undefined behavior invoked - the destination type can't represent
     616             :         // the input constant.
     617          18 :         return UndefValue::get(DestTy);
     618             :       }
     619          54 :       return ConstantInt::get(FPC->getContext(), IntVal);
     620             :     }
     621             :     return nullptr; // Can't fold.
     622       10651 :   case Instruction::IntToPtr:   //always treated as unsigned
     623       10651 :     if (V->isNullValue())       // Is it an integral null value?
     624           0 :       return ConstantPointerNull::get(cast<PointerType>(DestTy));
     625             :     return nullptr;                   // Other pointer types cannot be casted
     626       12675 :   case Instruction::PtrToInt:   // always treated as unsigned
     627             :     // Is it a null pointer value?
     628       12675 :     if (V->isNullValue())
     629           0 :       return ConstantInt::get(DestTy, 0);
     630             :     // If this is a sizeof-like expression, pull out multiplications by
     631             :     // known factors to expose them to subsequent folding. If it's an
     632             :     // alignof-like expression, factor out known factors.
     633             :     if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V))
     634        9413 :       if (CE->getOpcode() == Instruction::GetElementPtr &&
     635        4652 :           CE->getOperand(0)->isNullValue()) {
     636             :         // FIXME: Looks like getFoldedSizeOf(), getFoldedOffsetOf() and
     637             :         // getFoldedAlignOf() don't handle the case when DestTy is a vector of
     638             :         // pointers yet. We end up in asserts in CastInst::getCastOpcode (see
     639             :         // test/Analysis/ConstantFolding/cast-vector.ll). I've only seen this
     640             :         // happen in one "real" C-code test case, so it does not seem to be an
     641             :         // important optimization to handle vectors here. For now, simply bail
     642             :         // out.
     643         604 :         if (DestTy->isVectorTy())
     644             :           return nullptr;
     645             :         GEPOperator *GEPO = cast<GEPOperator>(CE);
     646         602 :         Type *Ty = GEPO->getSourceElementType();
     647         602 :         if (CE->getNumOperands() == 2) {
     648             :           // Handle a sizeof-like expression.
     649             :           Constant *Idx = CE->getOperand(1);
     650         978 :           bool isOne = isa<ConstantInt>(Idx) && cast<ConstantInt>(Idx)->isOne();
     651         489 :           if (Constant *C = getFoldedSizeOf(Ty, DestTy, !isOne)) {
     652          66 :             Idx = ConstantExpr::getCast(CastInst::getCastOpcode(Idx, true,
     653             :                                                                 DestTy, false),
     654             :                                         Idx, DestTy);
     655          66 :             return ConstantExpr::getMul(C, Idx);
     656             :           }
     657         226 :         } else if (CE->getNumOperands() == 3 &&
     658         113 :                    CE->getOperand(1)->isNullValue()) {
     659             :           // Handle an alignof-like expression.
     660             :           if (StructType *STy = dyn_cast<StructType>(Ty))
     661         103 :             if (!STy->isPacked()) {
     662             :               ConstantInt *CI = cast<ConstantInt>(CE->getOperand(2));
     663          80 :               if (CI->isOne() &&
     664         182 :                   STy->getNumElements() == 2 &&
     665         158 :                   STy->getElementType(0)->isIntegerTy(1)) {
     666         156 :                 return getFoldedAlignOf(STy->getElementType(1), DestTy, false);
     667             :               }
     668             :             }
     669             :           // Handle an offsetof-like expression.
     670          35 :           if (Ty->isStructTy() || Ty->isArrayTy()) {
     671          35 :             if (Constant *C = getFoldedOffsetOf(Ty, CE->getOperand(2),
     672          35 :                                                 DestTy, false))
     673             :               return C;
     674             :           }
     675             :         }
     676             :       }
     677             :     // Other pointer types cannot be casted
     678             :     return nullptr;
     679        2738 :   case Instruction::UIToFP:
     680             :   case Instruction::SIToFP:
     681             :     if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
     682             :       const APInt &api = CI->getValue();
     683             :       APFloat apf(DestTy->getFltSemantics(),
     684        5450 :                   APInt::getNullValue(DestTy->getPrimitiveSizeInBits()));
     685        2725 :       apf.convertFromAPInt(api, opc==Instruction::SIToFP,
     686             :                            APFloat::rmNearestTiesToEven);
     687        2725 :       return ConstantFP::get(V->getContext(), apf);
     688             :     }
     689             :     return nullptr;
     690      115908 :   case Instruction::ZExt:
     691             :     if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
     692             :       uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
     693      114463 :       return ConstantInt::get(V->getContext(),
     694      343389 :                               CI->getValue().zext(BitWidth));
     695             :     }
     696             :     return nullptr;
     697       90244 :   case Instruction::SExt:
     698             :     if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
     699             :       uint32_t BitWidth = cast<IntegerType>(DestTy)->getBitWidth();
     700       90220 :       return ConstantInt::get(V->getContext(),
     701      270660 :                               CI->getValue().sext(BitWidth));
     702             :     }
     703             :     return nullptr;
     704      192635 :   case Instruction::Trunc: {
     705      385270 :     if (V->getType()->isVectorTy())
     706             :       return nullptr;
     707             : 
     708             :     uint32_t DestBitWidth = cast<IntegerType>(DestTy)->getBitWidth();
     709             :     if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
     710      191443 :       return ConstantInt::get(V->getContext(),
     711      574329 :                               CI->getValue().trunc(DestBitWidth));
     712             :     }
     713             : 
     714             :     // The input must be a constantexpr.  See if we can simplify this based on
     715             :     // the bytes we are demanding.  Only do this if the source and dest are an
     716             :     // even multiple of a byte.
     717        2352 :     if ((DestBitWidth & 7) == 0 &&
     718             :         (cast<IntegerType>(V->getType())->getBitWidth() & 7) == 0)
     719        1163 :       if (Constant *Res = ExtractConstantBytes(V, 0, DestBitWidth / 8))
     720             :         return Res;
     721             : 
     722             :     return nullptr;
     723             :   }
     724     1632399 :   case Instruction::BitCast:
     725     1632399 :     return FoldBitCast(V, DestTy);
     726             :   case Instruction::AddrSpaceCast:
     727             :     return nullptr;
     728             :   }
     729             : }
     730             : 
     731        4823 : Constant *llvm::ConstantFoldSelectInstruction(Constant *Cond,
     732             :                                               Constant *V1, Constant *V2) {
     733             :   // Check for i1 and vector true/false conditions.
     734        4823 :   if (Cond->isNullValue()) return V2;
     735        2855 :   if (Cond->isAllOnesValue()) return V1;
     736             : 
     737             :   // If the condition is a vector constant, fold the result elementwise.
     738             :   if (ConstantVector *CondV = dyn_cast<ConstantVector>(Cond)) {
     739             :     SmallVector<Constant*, 16> Result;
     740          73 :     Type *Ty = IntegerType::get(CondV->getContext(), 32);
     741         782 :     for (unsigned i = 0, e = V1->getType()->getVectorNumElements(); i != e;++i){
     742             :       Constant *V;
     743         319 :       Constant *V1Element = ConstantExpr::getExtractElement(V1,
     744             :                                                     ConstantInt::get(Ty, i));
     745         319 :       Constant *V2Element = ConstantExpr::getExtractElement(V2,
     746         319 :                                                     ConstantInt::get(Ty, i));
     747         319 :       Constant *Cond = dyn_cast<Constant>(CondV->getOperand(i));
     748         319 :       if (V1Element == V2Element) {
     749          78 :         V = V1Element;
     750         241 :       } else if (isa<UndefValue>(Cond)) {
     751           6 :         V = isa<UndefValue>(V1Element) ? V1Element : V2Element;
     752             :       } else {
     753         235 :         if (!isa<ConstantInt>(Cond)) break;
     754         234 :         V = Cond->isNullValue() ? V2Element : V1Element;
     755             :       }
     756         318 :       Result.push_back(V);
     757             :     }
     758             : 
     759             :     // If we were able to build the vector, return it.
     760         146 :     if (Result.size() == V1->getType()->getVectorNumElements())
     761          72 :       return ConstantVector::get(Result);
     762             :   }
     763             : 
     764         139 :   if (isa<UndefValue>(Cond)) {
     765          28 :     if (isa<UndefValue>(V1)) return V1;
     766          16 :     return V2;
     767             :   }
     768         111 :   if (isa<UndefValue>(V1)) return V2;
     769         111 :   if (isa<UndefValue>(V2)) return V1;
     770         110 :   if (V1 == V2) return V1;
     771             : 
     772          64 :   if (ConstantExpr *TrueVal = dyn_cast<ConstantExpr>(V1)) {
     773          64 :     if (TrueVal->getOpcode() == Instruction::Select)
     774           1 :       if (TrueVal->getOperand(0) == Cond)
     775           1 :         return ConstantExpr::getSelect(Cond, TrueVal->getOperand(1), V2);
     776             :   }
     777          18 :   if (ConstantExpr *FalseVal = dyn_cast<ConstantExpr>(V2)) {
     778          18 :     if (FalseVal->getOpcode() == Instruction::Select)
     779           0 :       if (FalseVal->getOperand(0) == Cond)
     780           0 :         return ConstantExpr::getSelect(Cond, V1, FalseVal->getOperand(2));
     781             :   }
     782             : 
     783             :   return nullptr;
     784             : }
     785             : 
     786      307957 : Constant *llvm::ConstantFoldExtractElementInstruction(Constant *Val,
     787             :                                                       Constant *Idx) {
     788      307957 :   if (isa<UndefValue>(Val))  // ee(undef, x) -> undef
     789      190204 :     return UndefValue::get(Val->getType()->getVectorElementType());
     790      212855 :   if (Val->isNullValue())  // ee(zero, x) -> zero
     791        6532 :     return Constant::getNullValue(Val->getType()->getVectorElementType());
     792             :   // ee({w,x,y,z}, undef) -> undef
     793      209589 :   if (isa<UndefValue>(Idx))
     794           2 :     return UndefValue::get(Val->getType()->getVectorElementType());
     795             : 
     796             :   if (ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx)) {
     797             :     // ee({w,x,y,z}, wrong_value) -> undef
     798      419176 :     if (CIdx->uge(Val->getType()->getVectorNumElements()))
     799           6 :       return UndefValue::get(Val->getType()->getVectorElementType());
     800      209585 :     return Val->getAggregateElement(CIdx->getZExtValue());
     801             :   }
     802             :   return nullptr;
     803             : }
     804             : 
     805      157640 : Constant *llvm::ConstantFoldInsertElementInstruction(Constant *Val,
     806             :                                                      Constant *Elt,
     807             :                                                      Constant *Idx) {
     808      157640 :   if (isa<UndefValue>(Idx))
     809           1 :     return UndefValue::get(Val->getType());
     810             : 
     811             :   ConstantInt *CIdx = dyn_cast<ConstantInt>(Idx);
     812             :   if (!CIdx) return nullptr;
     813             : 
     814      157639 :   unsigned NumElts = Val->getType()->getVectorNumElements();
     815      157639 :   if (CIdx->uge(NumElts))
     816           3 :     return UndefValue::get(Val->getType());
     817             : 
     818             :   SmallVector<Constant*, 16> Result;
     819      157636 :   Result.reserve(NumElts);
     820      157636 :   auto *Ty = Type::getInt32Ty(Val->getContext());
     821             :   uint64_t IdxVal = CIdx->getZExtValue();
     822      997766 :   for (unsigned i = 0; i != NumElts; ++i) {
     823      577701 :     if (i == IdxVal) {
     824      157636 :       Result.push_back(Elt);
     825      157636 :       continue;
     826             :     }
     827             : 
     828      262429 :     Constant *C = ConstantExpr::getExtractElement(Val, ConstantInt::get(Ty, i));
     829      262429 :     Result.push_back(C);
     830             :   }
     831             : 
     832      157636 :   return ConstantVector::get(Result);
     833             : }
     834             : 
     835        3217 : Constant *llvm::ConstantFoldShuffleVectorInstruction(Constant *V1,
     836             :                                                      Constant *V2,
     837             :                                                      Constant *Mask) {
     838        3217 :   unsigned MaskNumElts = Mask->getType()->getVectorNumElements();
     839        3217 :   Type *EltTy = V1->getType()->getVectorElementType();
     840             : 
     841             :   // Undefined shuffle mask -> undefined value.
     842        3217 :   if (isa<UndefValue>(Mask))
     843          13 :     return UndefValue::get(VectorType::get(EltTy, MaskNumElts));
     844             : 
     845             :   // Don't break the bitcode reader hack.
     846        3204 :   if (isa<ConstantExpr>(Mask)) return nullptr;
     847             : 
     848             :   unsigned SrcNumElts = V1->getType()->getVectorNumElements();
     849             : 
     850             :   // Loop over the shuffle mask, evaluating each element.
     851             :   SmallVector<Constant*, 32> Result;
     852       39764 :   for (unsigned i = 0; i != MaskNumElts; ++i) {
     853       18280 :     int Elt = ShuffleVectorInst::getMaskValue(Mask, i);
     854       18521 :     if (Elt == -1) {
     855         241 :       Result.push_back(UndefValue::get(EltTy));
     856         241 :       continue;
     857             :     }
     858             :     Constant *InElt;
     859       18039 :     if (unsigned(Elt) >= SrcNumElts*2)
     860           0 :       InElt = UndefValue::get(EltTy);
     861       18039 :     else if (unsigned(Elt) >= SrcNumElts) {
     862         527 :       Type *Ty = IntegerType::get(V2->getContext(), 32);
     863         527 :       InElt =
     864         527 :         ConstantExpr::getExtractElement(V2,
     865         527 :                                         ConstantInt::get(Ty, Elt - SrcNumElts));
     866             :     } else {
     867       17512 :       Type *Ty = IntegerType::get(V1->getContext(), 32);
     868       17512 :       InElt = ConstantExpr::getExtractElement(V1, ConstantInt::get(Ty, Elt));
     869             :     }
     870       18039 :     Result.push_back(InElt);
     871             :   }
     872             : 
     873        3204 :   return ConstantVector::get(Result);
     874             : }
     875             : 
     876      328905 : Constant *llvm::ConstantFoldExtractValueInstruction(Constant *Agg,
     877             :                                                     ArrayRef<unsigned> Idxs) {
     878             :   // Base case: no indices, so return the entire value.
     879      328905 :   if (Idxs.empty())
     880             :     return Agg;
     881             : 
     882      164461 :   if (Constant *C = Agg->getAggregateElement(Idxs[0]))
     883      164456 :     return ConstantFoldExtractValueInstruction(C, Idxs.slice(1));
     884             : 
     885             :   return nullptr;
     886             : }
     887             : 
     888         584 : Constant *llvm::ConstantFoldInsertValueInstruction(Constant *Agg,
     889             :                                                    Constant *Val,
     890             :                                                    ArrayRef<unsigned> Idxs) {
     891             :   // Base case: no indices, so replace the entire value.
     892         584 :   if (Idxs.empty())
     893             :     return Val;
     894             : 
     895             :   unsigned NumElts;
     896         354 :   if (StructType *ST = dyn_cast<StructType>(Agg->getType()))
     897         242 :     NumElts = ST->getNumElements();
     898             :   else
     899         112 :     NumElts = cast<SequentialType>(Agg->getType())->getNumElements();
     900             : 
     901             :   SmallVector<Constant*, 32> Result;
     902       10354 :   for (unsigned i = 0; i != NumElts; ++i) {
     903        5001 :     Constant *C = Agg->getAggregateElement(i);
     904        5001 :     if (!C) return nullptr;
     905             : 
     906        5000 :     if (Idxs[0] == i)
     907         353 :       C = ConstantFoldInsertValueInstruction(C, Val, Idxs.slice(1));
     908             : 
     909        5000 :     Result.push_back(C);
     910             :   }
     911             : 
     912         353 :   if (StructType *ST = dyn_cast<StructType>(Agg->getType()))
     913         241 :     return ConstantStruct::get(ST, Result);
     914             :   if (ArrayType *AT = dyn_cast<ArrayType>(Agg->getType()))
     915         112 :     return ConstantArray::get(AT, Result);
     916           0 :   return ConstantVector::get(Result);
     917             : }
     918             : 
     919             : 
     920      781009 : Constant *llvm::ConstantFoldBinaryInstruction(unsigned Opcode,
     921             :                                               Constant *C1, Constant *C2) {
     922             :   assert(Instruction::isBinaryOp(Opcode) && "Non-binary instruction detected");
     923             : 
     924             :   // Handle UndefValue up front.
     925     1561525 :   if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) {
     926         778 :     switch (static_cast<Instruction::BinaryOps>(Opcode)) {
     927          34 :     case Instruction::Xor:
     928          53 :       if (isa<UndefValue>(C1) && isa<UndefValue>(C2))
     929             :         // Handle undef ^ undef -> 0 special case. This is a common
     930             :         // idiom (misuse).
     931           3 :         return Constant::getNullValue(C1->getType());
     932             :       LLVM_FALLTHROUGH;
     933             :     case Instruction::Add:
     934             :     case Instruction::Sub:
     935         170 :       return UndefValue::get(C1->getType());
     936         121 :     case Instruction::And:
     937         241 :       if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef & undef -> undef
     938             :         return C1;
     939         115 :       return Constant::getNullValue(C1->getType());   // undef & X -> 0
     940          13 :     case Instruction::Mul: {
     941             :       // undef * undef -> undef
     942          19 :       if (isa<UndefValue>(C1) && isa<UndefValue>(C2))
     943             :         return C1;
     944             :       const APInt *CV;
     945             :       // X * undef -> undef   if X is odd
     946          26 :       if (match(C1, m_APInt(CV)) || match(C2, m_APInt(CV)))
     947          22 :         if ((*CV)[0])
     948           3 :           return UndefValue::get(C1->getType());
     949             : 
     950             :       // X * undef -> 0       otherwise
     951           8 :       return Constant::getNullValue(C1->getType());
     952             :     }
     953           8 :     case Instruction::SDiv:
     954             :     case Instruction::UDiv:
     955             :       // X / undef -> undef
     956           8 :       if (isa<UndefValue>(C2))
     957             :         return C2;
     958             :       // undef / 0 -> undef
     959             :       // undef / 1 -> undef
     960          14 :       if (match(C2, m_Zero()) || match(C2, m_One()))
     961             :         return C1;
     962             :       // undef / X -> 0       otherwise
     963           3 :       return Constant::getNullValue(C1->getType());
     964             :     case Instruction::URem:
     965             :     case Instruction::SRem:
     966             :       // X % undef -> undef
     967          12 :       if (match(C2, m_Undef()))
     968             :         return C2;
     969             :       // undef % 0 -> undef
     970          12 :       if (match(C2, m_Zero()))
     971             :         return C1;
     972             :       // undef % X -> 0       otherwise
     973          12 :       return Constant::getNullValue(C1->getType());
     974          20 :     case Instruction::Or:                          // X | undef -> -1
     975          33 :       if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef | undef -> undef
     976             :         return C1;
     977           9 :       return Constant::getAllOnesValue(C1->getType()); // undef | X -> ~0
     978          29 :     case Instruction::LShr:
     979             :       // X >>l undef -> undef
     980          29 :       if (isa<UndefValue>(C2))
     981             :         return C2;
     982             :       // undef >>l 0 -> undef
     983          26 :       if (match(C2, m_Zero()))
     984             :         return C1;
     985             :       // undef >>l X -> 0
     986          25 :       return Constant::getNullValue(C1->getType());
     987           9 :     case Instruction::AShr:
     988             :       // X >>a undef -> undef
     989           9 :       if (isa<UndefValue>(C2))
     990             :         return C2;
     991             :       // undef >>a 0 -> undef
     992           7 :       if (match(C2, m_Zero()))
     993             :         return C1;
     994             :       // TODO: undef >>a X -> undef if the shift is exact
     995             :       // undef >>a X -> 0
     996           6 :       return Constant::getNullValue(C1->getType());
     997          31 :     case Instruction::Shl:
     998             :       // X << undef -> undef
     999          31 :       if (isa<UndefValue>(C2))
    1000             :         return C2;
    1001             :       // undef << 0 -> undef
    1002          25 :       if (match(C2, m_Zero()))
    1003             :         return C1;
    1004             :       // undef << X -> 0
    1005          23 :       return Constant::getNullValue(C1->getType());
    1006         362 :     case Instruction::FAdd:
    1007             :     case Instruction::FSub:
    1008             :     case Instruction::FMul:
    1009             :     case Instruction::FDiv:
    1010             :     case Instruction::FRem:
    1011             :       // [any flop] undef, undef -> undef
    1012         529 :       if (isa<UndefValue>(C1) && isa<UndefValue>(C2))
    1013             :         return C1;
    1014             :       // [any flop] C, undef -> NaN
    1015             :       // [any flop] undef, C -> NaN
    1016             :       // We could potentially specialize NaN/Inf constants vs. 'normal'
    1017             :       // constants (possibly differently depending on opcode and operand). This
    1018             :       // would allow returning undef sometimes. But it is always safe to fold to
    1019             :       // NaN because we can choose the undef operand as NaN, and any FP opcode
    1020             :       // with a NaN operand will propagate NaN.
    1021         291 :       return ConstantFP::getNaN(C1->getType());
    1022           0 :     case Instruction::BinaryOpsEnd:
    1023           0 :       llvm_unreachable("Invalid BinaryOp");
    1024             :     }
    1025             :   }
    1026             : 
    1027             :   // At this point neither constant should be an UndefValue.
    1028             :   assert(!isa<UndefValue>(C1) && !isa<UndefValue>(C2) &&
    1029             :          "Unexpected UndefValue");
    1030             : 
    1031             :   // Handle simplifications when the RHS is a constant int.
    1032             :   if (ConstantInt *CI2 = dyn_cast<ConstantInt>(C2)) {
    1033      769990 :     switch (Opcode) {
    1034             :     case Instruction::Add:
    1035      148935 :       if (CI2->isZero()) return C1;                             // X + 0 == X
    1036             :       break;
    1037             :     case Instruction::Sub:
    1038      441700 :       if (CI2->isZero()) return C1;                             // X - 0 == X
    1039             :       break;
    1040             :     case Instruction::Mul:
    1041       19918 :       if (CI2->isZero()) return C2;                             // X * 0 == 0
    1042       19613 :       if (CI2->isOne())
    1043             :         return C1;                                              // X * 1 == X
    1044             :       break;
    1045             :     case Instruction::UDiv:
    1046             :     case Instruction::SDiv:
    1047       29764 :       if (CI2->isOne())
    1048             :         return C1;                                            // X / 1 == X
    1049       12885 :       if (CI2->isZero())
    1050           6 :         return UndefValue::get(CI2->getType());               // X / 0 == undef
    1051             :       break;
    1052             :     case Instruction::URem:
    1053             :     case Instruction::SRem:
    1054         897 :       if (CI2->isOne())
    1055          14 :         return Constant::getNullValue(CI2->getType());        // X % 1 == 0
    1056         883 :       if (CI2->isZero())
    1057           3 :         return UndefValue::get(CI2->getType());               // X % 0 == undef
    1058             :       break;
    1059             :     case Instruction::And:
    1060       15314 :       if (CI2->isZero()) return C2;                           // X & 0 == 0
    1061       15249 :       if (CI2->isMinusOne())
    1062             :         return C1;                                            // X & -1 == X
    1063             : 
    1064             :       if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
    1065             :         // (zext i32 to i64) & 4294967295 -> (zext i32 to i64)
    1066        3138 :         if (CE1->getOpcode() == Instruction::ZExt) {
    1067             :           unsigned DstWidth = CI2->getType()->getBitWidth();
    1068             :           unsigned SrcWidth =
    1069           3 :             CE1->getOperand(0)->getType()->getPrimitiveSizeInBits();
    1070           3 :           APInt PossiblySetBits(APInt::getLowBitsSet(DstWidth, SrcWidth));
    1071           6 :           if ((PossiblySetBits & CI2->getValue()) == PossiblySetBits)
    1072             :             return C1;
    1073             :         }
    1074             : 
    1075             :         // If and'ing the address of a global with a constant, fold it.
    1076        3138 :         if (CE1->getOpcode() == Instruction::PtrToInt &&
    1077             :             isa<GlobalValue>(CE1->getOperand(0))) {
    1078             :           GlobalValue *GV = cast<GlobalValue>(CE1->getOperand(0));
    1079             : 
    1080             :           // Functions are at least 4-byte aligned.
    1081         137 :           unsigned GVAlign = GV->getAlignment();
    1082         137 :           if (isa<Function>(GV))
    1083         128 :             GVAlign = std::max(GVAlign, 4U);
    1084             : 
    1085         137 :           if (GVAlign > 1) {
    1086         112 :             unsigned DstWidth = CI2->getType()->getBitWidth();
    1087         224 :             unsigned SrcWidth = std::min(DstWidth, Log2_32(GVAlign));
    1088         112 :             APInt BitsNotSet(APInt::getLowBitsSet(DstWidth, SrcWidth));
    1089             : 
    1090             :             // If checking bits we know are clear, return zero.
    1091         224 :             if ((CI2->getValue() & BitsNotSet) == CI2->getValue())
    1092          83 :               return Constant::getNullValue(CI2->getType());
    1093             :           }
    1094             :         }
    1095             :       }
    1096             :       break;
    1097             :     case Instruction::Or:
    1098        8994 :       if (CI2->isZero()) return C1;        // X | 0 == X
    1099        8388 :       if (CI2->isMinusOne())
    1100             :         return C2;                         // X | -1 == -1
    1101             :       break;
    1102             :     case Instruction::Xor:
    1103       84342 :       if (CI2->isZero()) return C1;        // X ^ 0 == X
    1104             : 
    1105             :       if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
    1106          63 :         switch (CE1->getOpcode()) {
    1107             :         default: break;
    1108          30 :         case Instruction::ICmp:
    1109             :         case Instruction::FCmp:
    1110             :           // cmp pred ^ true -> cmp !pred
    1111             :           assert(CI2->isOne());
    1112          30 :           CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate();
    1113          30 :           pred = CmpInst::getInversePredicate(pred);
    1114          30 :           return ConstantExpr::getCompare(pred, CE1->getOperand(0),
    1115          30 :                                           CE1->getOperand(1));
    1116             :         }
    1117             :       }
    1118             :       break;
    1119        1426 :     case Instruction::AShr:
    1120             :       // ashr (zext C to Ty), C2 -> lshr (zext C, CSA), C2
    1121             :       if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1))
    1122          47 :         if (CE1->getOpcode() == Instruction::ZExt)  // Top bits known zero.
    1123           0 :           return ConstantExpr::getLShr(C1, C2);
    1124             :       break;
    1125             :     }
    1126       10241 :   } else if (isa<ConstantInt>(C1)) {
    1127             :     // If C1 is a ConstantInt and C2 is not, swap the operands.
    1128             :     if (Instruction::isCommutative(Opcode))
    1129        1067 :       return ConstantExpr::get(Opcode, C2, C1);
    1130             :   }
    1131             : 
    1132             :   if (ConstantInt *CI1 = dyn_cast<ConstantInt>(C1)) {
    1133             :     if (ConstantInt *CI2 = dyn_cast<ConstantInt>(C2)) {
    1134             :       const APInt &C1V = CI1->getValue();
    1135             :       const APInt &C2V = CI2->getValue();
    1136      531286 :       switch (Opcode) {
    1137             :       default:
    1138             :         break;
    1139             :       case Instruction::Add:
    1140      436695 :         return ConstantInt::get(CI1->getContext(), C1V + C2V);
    1141             :       case Instruction::Sub:
    1142      716487 :         return ConstantInt::get(CI1->getContext(), C1V - C2V);
    1143        8815 :       case Instruction::Mul:
    1144       17630 :         return ConstantInt::get(CI1->getContext(), C1V * C2V);
    1145       11276 :       case Instruction::UDiv:
    1146             :         assert(!CI2->isZero() && "Div by zero handled above");
    1147       22552 :         return ConstantInt::get(CI1->getContext(), C1V.udiv(C2V));
    1148             :       case Instruction::SDiv:
    1149             :         assert(!CI2->isZero() && "Div by zero handled above");
    1150        1570 :         if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
    1151           1 :           return UndefValue::get(CI1->getType());   // MIN_INT / -1 -> undef
    1152        3138 :         return ConstantInt::get(CI1->getContext(), C1V.sdiv(C2V));
    1153         753 :       case Instruction::URem:
    1154             :         assert(!CI2->isZero() && "Div by zero handled above");
    1155        1506 :         return ConstantInt::get(CI1->getContext(), C1V.urem(C2V));
    1156             :       case Instruction::SRem:
    1157             :         assert(!CI2->isZero() && "Div by zero handled above");
    1158         120 :         if (C2V.isAllOnesValue() && C1V.isMinSignedValue())
    1159           1 :           return UndefValue::get(CI1->getType());   // MIN_INT % -1 -> undef
    1160         238 :         return ConstantInt::get(CI1->getContext(), C1V.srem(C2V));
    1161             :       case Instruction::And:
    1162       36201 :         return ConstantInt::get(CI1->getContext(), C1V & C2V);
    1163             :       case Instruction::Or:
    1164       24894 :         return ConstantInt::get(CI1->getContext(), C1V | C2V);
    1165             :       case Instruction::Xor:
    1166      252384 :         return ConstantInt::get(CI1->getContext(), C1V ^ C2V);
    1167       15800 :       case Instruction::Shl:
    1168       15800 :         if (C2V.ult(C1V.getBitWidth()))
    1169       31562 :           return ConstantInt::get(CI1->getContext(), C1V.shl(C2V));
    1170          19 :         return UndefValue::get(C1->getType()); // too big shift is undef
    1171        2686 :       case Instruction::LShr:
    1172        2686 :         if (C2V.ult(C1V.getBitWidth()))
    1173        5332 :           return ConstantInt::get(CI1->getContext(), C1V.lshr(C2V));
    1174          20 :         return UndefValue::get(C1->getType()); // too big shift is undef
    1175        1379 :       case Instruction::AShr:
    1176        1379 :         if (C2V.ult(C1V.getBitWidth()))
    1177        2738 :           return ConstantInt::get(CI1->getContext(), C1V.ashr(C2V));
    1178          10 :         return UndefValue::get(C1->getType()); // too big shift is undef
    1179             :       }
    1180             :     }
    1181             : 
    1182             :     switch (Opcode) {
    1183             :     case Instruction::SDiv:
    1184             :     case Instruction::UDiv:
    1185             :     case Instruction::URem:
    1186             :     case Instruction::SRem:
    1187             :     case Instruction::LShr:
    1188             :     case Instruction::AShr:
    1189             :     case Instruction::Shl:
    1190          64 :       if (CI1->isZero()) return C1;
    1191             :       break;
    1192             :     default:
    1193             :       break;
    1194             :     }
    1195             :   } else if (ConstantFP *CFP1 = dyn_cast<ConstantFP>(C1)) {
    1196             :     if (ConstantFP *CFP2 = dyn_cast<ConstantFP>(C2)) {
    1197             :       const APFloat &C1V = CFP1->getValueAPF();
    1198             :       const APFloat &C2V = CFP2->getValueAPF();
    1199             :       APFloat C3V = C1V;  // copy for modification
    1200         994 :       switch (Opcode) {
    1201             :       default:
    1202             :         break;
    1203         304 :       case Instruction::FAdd:
    1204         304 :         (void)C3V.add(C2V, APFloat::rmNearestTiesToEven);
    1205         304 :         return ConstantFP::get(C1->getContext(), C3V);
    1206         276 :       case Instruction::FSub:
    1207         276 :         (void)C3V.subtract(C2V, APFloat::rmNearestTiesToEven);
    1208         276 :         return ConstantFP::get(C1->getContext(), C3V);
    1209         281 :       case Instruction::FMul:
    1210         281 :         (void)C3V.multiply(C2V, APFloat::rmNearestTiesToEven);
    1211         281 :         return ConstantFP::get(C1->getContext(), C3V);
    1212          72 :       case Instruction::FDiv:
    1213          72 :         (void)C3V.divide(C2V, APFloat::rmNearestTiesToEven);
    1214          72 :         return ConstantFP::get(C1->getContext(), C3V);
    1215          61 :       case Instruction::FRem:
    1216          61 :         (void)C3V.mod(C2V);
    1217          61 :         return ConstantFP::get(C1->getContext(), C3V);
    1218             :       }
    1219             :     }
    1220       13053 :   } else if (VectorType *VTy = dyn_cast<VectorType>(C1->getType())) {
    1221             :     // Perform elementwise folding.
    1222             :     SmallVector<Constant*, 16> Result;
    1223        2707 :     Type *Ty = IntegerType::get(VTy->getContext(), 32);
    1224       13973 :     for (unsigned i = 0, e = VTy->getNumElements(); i != e; ++i) {
    1225       11271 :       Constant *ExtractIdx = ConstantInt::get(Ty, i);
    1226       11271 :       Constant *LHS = ConstantExpr::getExtractElement(C1, ExtractIdx);
    1227       11271 :       Constant *RHS = ConstantExpr::getExtractElement(C2, ExtractIdx);
    1228             : 
    1229             :       // If any element of a divisor vector is zero, the whole op is undef.
    1230       22542 :       if ((Opcode == Instruction::SDiv || Opcode == Instruction::UDiv ||
    1231       22577 :            Opcode == Instruction::SRem || Opcode == Instruction::URem) &&
    1232          35 :           RHS->isNullValue())
    1233           5 :         return UndefValue::get(VTy);
    1234             : 
    1235       11266 :       Result.push_back(ConstantExpr::get(Opcode, LHS, RHS));
    1236             :     }
    1237             : 
    1238        2702 :     return ConstantVector::get(Result);
    1239             :   }
    1240             : 
    1241             :   if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
    1242             :     // There are many possible foldings we could do here.  We should probably
    1243             :     // at least fold add of a pointer with an integer into the appropriate
    1244             :     // getelementptr.  This will improve alias analysis a bit.
    1245             : 
    1246             :     // Given ((a + b) + c), if (b + c) folds to something interesting, return
    1247             :     // (a + (b + c)).
    1248        8693 :     if (Instruction::isAssociative(Opcode) && CE1->getOpcode() == Opcode) {
    1249          62 :       Constant *T = ConstantExpr::get(Opcode, CE1->getOperand(1), C2);
    1250          77 :       if (!isa<ConstantExpr>(T) || cast<ConstantExpr>(T)->getOpcode() != Opcode)
    1251          47 :         return ConstantExpr::get(Opcode, CE1->getOperand(0), T);
    1252             :     }
    1253         130 :   } else if (isa<ConstantExpr>(C2)) {
    1254             :     // If C2 is a constant expr and C1 isn't, flop them around and fold the
    1255             :     // other way if possible.
    1256             :     if (Instruction::isCommutative(Opcode))
    1257           0 :       return ConstantFoldBinaryInstruction(Opcode, C2, C1);
    1258             :   }
    1259             : 
    1260             :   // i1 can be simplified in many cases.
    1261       10429 :   if (C1->getType()->isIntegerTy(1)) {
    1262         700 :     switch (Opcode) {
    1263           2 :     case Instruction::Add:
    1264             :     case Instruction::Sub:
    1265           2 :       return ConstantExpr::getXor(C1, C2);
    1266           1 :     case Instruction::Mul:
    1267           1 :       return ConstantExpr::getAnd(C1, C2);
    1268             :     case Instruction::Shl:
    1269             :     case Instruction::LShr:
    1270             :     case Instruction::AShr:
    1271             :       // We can assume that C2 == 0.  If it were one the result would be
    1272             :       // undefined because the shift value is as large as the bitwidth.
    1273             :       return C1;
    1274             :     case Instruction::SDiv:
    1275             :     case Instruction::UDiv:
    1276             :       // We can assume that C2 == 1.  If it were zero the result would be
    1277             :       // undefined through division by zero.
    1278             :       return C1;
    1279           2 :     case Instruction::URem:
    1280             :     case Instruction::SRem:
    1281             :       // We can assume that C2 == 1.  If it were zero the result would be
    1282             :       // undefined through division by zero.
    1283           2 :       return ConstantInt::getFalse(C1->getContext());
    1284             :     default:
    1285             :       break;
    1286             :     }
    1287             :   }
    1288             : 
    1289             :   // We don't know how to fold this.
    1290       10422 :   return nullptr;
    1291             : }
    1292             : 
    1293             : /// This type is zero-sized if it's an array or structure of zero-sized types.
    1294             : /// The only leaf zero-sized type is an empty structure.
    1295          15 : static bool isMaybeZeroSizedType(Type *Ty) {
    1296             :   if (StructType *STy = dyn_cast<StructType>(Ty)) {
    1297           8 :     if (STy->isOpaque()) return true;  // Can't say.
    1298             : 
    1299             :     // If all of elements have zero size, this does too.
    1300           8 :     for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
    1301          16 :       if (!isMaybeZeroSizedType(STy->getElementType(i))) return false;
    1302             :     return true;
    1303             : 
    1304             :   } else if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
    1305           4 :     return isMaybeZeroSizedType(ATy->getElementType());
    1306             :   }
    1307             :   return false;
    1308             : }
    1309             : 
    1310             : /// Compare the two constants as though they were getelementptr indices.
    1311             : /// This allows coercion of the types to be the same thing.
    1312             : ///
    1313             : /// If the two constants are the "same" (after coercion), return 0.  If the
    1314             : /// first is less than the second, return -1, if the second is less than the
    1315             : /// first, return 1.  If the constants are not integral, return -2.
    1316             : ///
    1317          18 : static int IdxCompare(Constant *C1, Constant *C2, Type *ElTy) {
    1318          18 :   if (C1 == C2) return 0;
    1319             : 
    1320             :   // Ok, we found a different index.  If they are not ConstantInt, we can't do
    1321             :   // anything with them.
    1322          15 :   if (!isa<ConstantInt>(C1) || !isa<ConstantInt>(C2))
    1323             :     return -2; // don't know!
    1324             : 
    1325             :   // We cannot compare the indices if they don't fit in an int64_t.
    1326          14 :   if (cast<ConstantInt>(C1)->getValue().getActiveBits() > 64 ||
    1327             :       cast<ConstantInt>(C2)->getValue().getActiveBits() > 64)
    1328             :     return -2; // don't know!
    1329             : 
    1330             :   // Ok, we have two differing integer indices.  Sign extend them to be the same
    1331             :   // type.
    1332             :   int64_t C1Val = cast<ConstantInt>(C1)->getSExtValue();
    1333             :   int64_t C2Val = cast<ConstantInt>(C2)->getSExtValue();
    1334             : 
    1335           7 :   if (C1Val == C2Val) return 0;  // They are equal
    1336             : 
    1337             :   // If the type being indexed over is really just a zero sized type, there is
    1338             :   // no pointer difference being made here.
    1339           7 :   if (isMaybeZeroSizedType(ElTy))
    1340             :     return -2; // dunno.
    1341             : 
    1342             :   // If they are really different, now that they are the same type, then we
    1343             :   // found a difference!
    1344           7 :   if (C1Val < C2Val)
    1345             :     return -1;
    1346             :   else
    1347           0 :     return 1;
    1348             : }
    1349             : 
    1350             : /// This function determines if there is anything we can decide about the two
    1351             : /// constants provided. This doesn't need to handle simple things like
    1352             : /// ConstantFP comparisons, but should instead handle ConstantExprs.
    1353             : /// If we can determine that the two constants have a particular relation to
    1354             : /// each other, we should return the corresponding FCmpInst predicate,
    1355             : /// otherwise return FCmpInst::BAD_FCMP_PREDICATE. This is used below in
    1356             : /// ConstantFoldCompareInstruction.
    1357             : ///
    1358             : /// To simplify this code we canonicalize the relation so that the first
    1359             : /// operand is always the most "complex" of the two.  We consider ConstantFP
    1360             : /// to be the simplest, and ConstantExprs to be the most complex.
    1361           4 : static FCmpInst::Predicate evaluateFCmpRelation(Constant *V1, Constant *V2) {
    1362             :   assert(V1->getType() == V2->getType() &&
    1363             :          "Cannot compare values of different types!");
    1364             : 
    1365             :   // Handle degenerate case quickly
    1366           4 :   if (V1 == V2) return FCmpInst::FCMP_OEQ;
    1367             : 
    1368           4 :   if (!isa<ConstantExpr>(V1)) {
    1369           0 :     if (!isa<ConstantExpr>(V2)) {
    1370             :       // Simple case, use the standard constant folder.
    1371             :       ConstantInt *R = nullptr;
    1372           0 :       R = dyn_cast<ConstantInt>(
    1373             :                       ConstantExpr::getFCmp(FCmpInst::FCMP_OEQ, V1, V2));
    1374           0 :       if (R && !R->isZero())
    1375             :         return FCmpInst::FCMP_OEQ;
    1376           0 :       R = dyn_cast<ConstantInt>(
    1377             :                       ConstantExpr::getFCmp(FCmpInst::FCMP_OLT, V1, V2));
    1378           0 :       if (R && !R->isZero())
    1379             :         return FCmpInst::FCMP_OLT;
    1380           0 :       R = dyn_cast<ConstantInt>(
    1381             :                       ConstantExpr::getFCmp(FCmpInst::FCMP_OGT, V1, V2));
    1382           0 :       if (R && !R->isZero())
    1383             :         return FCmpInst::FCMP_OGT;
    1384             : 
    1385             :       // Nothing more we can do
    1386             :       return FCmpInst::BAD_FCMP_PREDICATE;
    1387             :     }
    1388             : 
    1389             :     // If the first operand is simple and second is ConstantExpr, swap operands.
    1390           0 :     FCmpInst::Predicate SwappedRelation = evaluateFCmpRelation(V2, V1);
    1391           0 :     if (SwappedRelation != FCmpInst::BAD_FCMP_PREDICATE)
    1392           0 :       return FCmpInst::getSwappedPredicate(SwappedRelation);
    1393             :   } else {
    1394             :     // Ok, the LHS is known to be a constantexpr.  The RHS can be any of a
    1395             :     // constantexpr or a simple constant.
    1396             :     ConstantExpr *CE1 = cast<ConstantExpr>(V1);
    1397             :     switch (CE1->getOpcode()) {
    1398             :     case Instruction::FPTrunc:
    1399             :     case Instruction::FPExt:
    1400             :     case Instruction::UIToFP:
    1401             :     case Instruction::SIToFP:
    1402             :       // We might be able to do something with these but we don't right now.
    1403             :       break;
    1404             :     default:
    1405             :       break;
    1406             :     }
    1407             :   }
    1408             :   // There are MANY other foldings that we could perform here.  They will
    1409             :   // probably be added on demand, as they seem needed.
    1410             :   return FCmpInst::BAD_FCMP_PREDICATE;
    1411             : }
    1412             : 
    1413          95 : static ICmpInst::Predicate areGlobalsPotentiallyEqual(const GlobalValue *GV1,
    1414             :                                                       const GlobalValue *GV2) {
    1415         146 :   auto isGlobalUnsafeForEquality = [](const GlobalValue *GV) {
    1416         146 :     if (GV->hasExternalWeakLinkage() || GV->hasWeakAnyLinkage())
    1417             :       return true;
    1418             :     if (const auto *GVar = dyn_cast<GlobalVariable>(GV)) {
    1419         105 :       Type *Ty = GVar->getValueType();
    1420             :       // A global with opaque type might end up being zero sized.
    1421         105 :       if (!Ty->isSized())
    1422             :         return true;
    1423             :       // A global with an empty type might lie at the address of any other
    1424             :       // global.
    1425         105 :       if (Ty->isEmptyTy())
    1426             :         return true;
    1427             :     }
    1428             :     return false;
    1429             :   };
    1430             :   // Don't try to decide equality of aliases.
    1431         190 :   if (!isa<GlobalAlias>(GV1) && !isa<GlobalAlias>(GV2))
    1432          95 :     if (!isGlobalUnsafeForEquality(GV1) && !isGlobalUnsafeForEquality(GV2))
    1433             :       return ICmpInst::ICMP_NE;
    1434             :   return ICmpInst::BAD_ICMP_PREDICATE;
    1435             : }
    1436             : 
    1437             : /// This function determines if there is anything we can decide about the two
    1438             : /// constants provided. This doesn't need to handle simple things like integer
    1439             : /// comparisons, but should instead handle ConstantExprs and GlobalValues.
    1440             : /// If we can determine that the two constants have a particular relation to
    1441             : /// each other, we should return the corresponding ICmp predicate, otherwise
    1442             : /// return ICmpInst::BAD_ICMP_PREDICATE.
    1443             : ///
    1444             : /// To simplify this code we canonicalize the relation so that the first
    1445             : /// operand is always the most "complex" of the two.  We consider simple
    1446             : /// constants (like ConstantInt) to be the simplest, followed by
    1447             : /// GlobalValues, followed by ConstantExpr's (the most complex).
    1448             : ///
    1449       18839 : static ICmpInst::Predicate evaluateICmpRelation(Constant *V1, Constant *V2,
    1450             :                                                 bool isSigned) {
    1451             :   assert(V1->getType() == V2->getType() &&
    1452             :          "Cannot compare different types of values!");
    1453       18839 :   if (V1 == V2) return ICmpInst::ICMP_EQ;
    1454             : 
    1455        7058 :   if (!isa<ConstantExpr>(V1) && !isa<GlobalValue>(V1) &&
    1456             :       !isa<BlockAddress>(V1)) {
    1457          13 :     if (!isa<GlobalValue>(V2) && !isa<ConstantExpr>(V2) &&
    1458             :         !isa<BlockAddress>(V2)) {
    1459             :       // We distilled this down to a simple case, use the standard constant
    1460             :       // folder.
    1461             :       ConstantInt *R = nullptr;
    1462             :       ICmpInst::Predicate pred = ICmpInst::ICMP_EQ;
    1463           1 :       R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
    1464           0 :       if (R && !R->isZero())
    1465             :         return pred;
    1466           1 :       pred = isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
    1467           1 :       R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
    1468           0 :       if (R && !R->isZero())
    1469             :         return pred;
    1470           1 :       pred = isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
    1471           1 :       R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
    1472           0 :       if (R && !R->isZero())
    1473             :         return pred;
    1474             : 
    1475             :       // If we couldn't figure it out, bail.
    1476             :       return ICmpInst::BAD_ICMP_PREDICATE;
    1477             :     }
    1478             : 
    1479             :     // If the first operand is simple, swap operands.
    1480             :     ICmpInst::Predicate SwappedRelation =
    1481          12 :       evaluateICmpRelation(V2, V1, isSigned);
    1482          12 :     if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
    1483           0 :       return ICmpInst::getSwappedPredicate(SwappedRelation);
    1484             : 
    1485             :   } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(V1)) {
    1486         530 :     if (isa<ConstantExpr>(V2)) {  // Swap as necessary.
    1487             :       ICmpInst::Predicate SwappedRelation =
    1488           4 :         evaluateICmpRelation(V2, V1, isSigned);
    1489           4 :       if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
    1490           4 :         return ICmpInst::getSwappedPredicate(SwappedRelation);
    1491             :       return ICmpInst::BAD_ICMP_PREDICATE;
    1492             :     }
    1493             : 
    1494             :     // Now we know that the RHS is a GlobalValue, BlockAddress or simple
    1495             :     // constant (which, since the types must match, means that it's a
    1496             :     // ConstantPointerNull).
    1497             :     if (const GlobalValue *GV2 = dyn_cast<GlobalValue>(V2)) {
    1498          82 :       return areGlobalsPotentiallyEqual(GV, GV2);
    1499         444 :     } else if (isa<BlockAddress>(V2)) {
    1500             :       return ICmpInst::ICMP_NE; // Globals never equal labels.
    1501             :     } else {
    1502             :       assert(isa<ConstantPointerNull>(V2) && "Canonicalization guarantee!");
    1503             :       // GlobalVals can never be null unless they have external weak linkage.
    1504             :       // We don't try to evaluate aliases here.
    1505         444 :       if (!GV->hasExternalWeakLinkage() && !isa<GlobalAlias>(GV))
    1506             :         return ICmpInst::ICMP_NE;
    1507             :     }
    1508             :   } else if (const BlockAddress *BA = dyn_cast<BlockAddress>(V1)) {
    1509           1 :     if (isa<ConstantExpr>(V2)) {  // Swap as necessary.
    1510             :       ICmpInst::Predicate SwappedRelation =
    1511           0 :         evaluateICmpRelation(V2, V1, isSigned);
    1512           0 :       if (SwappedRelation != ICmpInst::BAD_ICMP_PREDICATE)
    1513           0 :         return ICmpInst::getSwappedPredicate(SwappedRelation);
    1514             :       return ICmpInst::BAD_ICMP_PREDICATE;
    1515             :     }
    1516             : 
    1517             :     // Now we know that the RHS is a GlobalValue, BlockAddress or simple
    1518             :     // constant (which, since the types must match, means that it is a
    1519             :     // ConstantPointerNull).
    1520             :     if (const BlockAddress *BA2 = dyn_cast<BlockAddress>(V2)) {
    1521             :       // Block address in another function can't equal this one, but block
    1522             :       // addresses in the current function might be the same if blocks are
    1523             :       // empty.
    1524           0 :       if (BA2->getFunction() != BA->getFunction())
    1525             :         return ICmpInst::ICMP_NE;
    1526             :     } else {
    1527             :       // Block addresses aren't null, don't equal the address of globals.
    1528             :       assert((isa<ConstantPointerNull>(V2) || isa<GlobalValue>(V2)) &&
    1529             :              "Canonicalization guarantee!");
    1530             :       return ICmpInst::ICMP_NE;
    1531             :     }
    1532             :   } else {
    1533             :     // Ok, the LHS is known to be a constantexpr.  The RHS can be any of a
    1534             :     // constantexpr, a global, block address, or a simple constant.
    1535             :     ConstantExpr *CE1 = cast<ConstantExpr>(V1);
    1536             :     Constant *CE1Op0 = CE1->getOperand(0);
    1537             : 
    1538             :     switch (CE1->getOpcode()) {
    1539             :     case Instruction::Trunc:
    1540             :     case Instruction::FPTrunc:
    1541             :     case Instruction::FPExt:
    1542             :     case Instruction::FPToUI:
    1543             :     case Instruction::FPToSI:
    1544             :       break; // We can't evaluate floating point casts or truncations.
    1545             : 
    1546        1334 :     case Instruction::UIToFP:
    1547             :     case Instruction::SIToFP:
    1548             :     case Instruction::BitCast:
    1549             :     case Instruction::ZExt:
    1550             :     case Instruction::SExt:
    1551             :       // We can't evaluate floating point casts or truncations.
    1552        1334 :       if (CE1Op0->getType()->isFloatingPointTy())
    1553             :         break;
    1554             : 
    1555             :       // If the cast is not actually changing bits, and the second operand is a
    1556             :       // null pointer, do the comparison with the pre-casted value.
    1557        2621 :       if (V2->isNullValue() &&
    1558        2027 :           (CE1->getType()->isPointerTy() || CE1->getType()->isIntegerTy())) {
    1559        1289 :         if (CE1->getOpcode() == Instruction::ZExt) isSigned = false;
    1560        1289 :         if (CE1->getOpcode() == Instruction::SExt) isSigned = true;
    1561        1289 :         return evaluateICmpRelation(CE1Op0,
    1562             :                                     Constant::getNullValue(CE1Op0->getType()),
    1563        1289 :                                     isSigned);
    1564             :       }
    1565             :       break;
    1566             : 
    1567             :     case Instruction::GetElementPtr: {
    1568             :       GEPOperator *CE1GEP = cast<GEPOperator>(CE1);
    1569             :       // Ok, since this is a getelementptr, we know that the constant has a
    1570             :       // pointer type.  Check the various cases.
    1571        3143 :       if (isa<ConstantPointerNull>(V2)) {
    1572             :         // If we are comparing a GEP to a null pointer, check to see if the base
    1573             :         // of the GEP equals the null pointer.
    1574             :         if (const GlobalValue *GV = dyn_cast<GlobalValue>(CE1Op0)) {
    1575        2793 :           if (GV->hasExternalWeakLinkage())
    1576             :             // Weak linkage GVals could be zero or not. We're comparing that
    1577             :             // to null pointer so its greater-or-equal
    1578           0 :             return isSigned ? ICmpInst::ICMP_SGE : ICmpInst::ICMP_UGE;
    1579             :           else
    1580             :             // If its not weak linkage, the GVal must have a non-zero address
    1581             :             // so the result is greater-than
    1582        2793 :             return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
    1583         172 :         } else if (isa<ConstantPointerNull>(CE1Op0)) {
    1584             :           // If we are indexing from a null pointer, check to see if we have any
    1585             :           // non-zero indices.
    1586           3 :           for (unsigned i = 1, e = CE1->getNumOperands(); i != e; ++i)
    1587           2 :             if (!CE1->getOperand(i)->isNullValue())
    1588             :               // Offsetting from null, must not be equal.
    1589           1 :               return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
    1590             :           // Only zero indexes from null, must still be zero.
    1591             :           return ICmpInst::ICMP_EQ;
    1592             :         }
    1593             :         // Otherwise, we can't really say if the first operand is null or not.
    1594             :       } else if (const GlobalValue *GV2 = dyn_cast<GlobalValue>(V2)) {
    1595         130 :         if (isa<ConstantPointerNull>(CE1Op0)) {
    1596           0 :           if (GV2->hasExternalWeakLinkage())
    1597             :             // Weak linkage GVals could be zero or not. We're comparing it to
    1598             :             // a null pointer, so its less-or-equal
    1599           0 :             return isSigned ? ICmpInst::ICMP_SLE : ICmpInst::ICMP_ULE;
    1600             :           else
    1601             :             // If its not weak linkage, the GVal must have a non-zero address
    1602             :             // so the result is less-than
    1603           0 :             return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
    1604             :         } else if (const GlobalValue *GV = dyn_cast<GlobalValue>(CE1Op0)) {
    1605         130 :           if (GV == GV2) {
    1606             :             // If this is a getelementptr of the same global, then it must be
    1607             :             // different.  Because the types must match, the getelementptr could
    1608             :             // only have at most one index, and because we fold getelementptr's
    1609             :             // with a single zero index, it must be nonzero.
    1610             :             assert(CE1->getNumOperands() == 2 &&
    1611             :                    !CE1->getOperand(1)->isNullValue() &&
    1612             :                    "Surprising getelementptr!");
    1613           5 :             return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
    1614             :           } else {
    1615         125 :             if (CE1GEP->hasAllZeroIndices())
    1616           9 :               return areGlobalsPotentiallyEqual(GV, GV2);
    1617             :             return ICmpInst::BAD_ICMP_PREDICATE;
    1618             :           }
    1619             :         }
    1620             :       } else {
    1621             :         ConstantExpr *CE2 = cast<ConstantExpr>(V2);
    1622             :         Constant *CE2Op0 = CE2->getOperand(0);
    1623             : 
    1624             :         // There are MANY other foldings that we could perform here.  They will
    1625             :         // probably be added on demand, as they seem needed.
    1626          48 :         switch (CE2->getOpcode()) {
    1627             :         default: break;
    1628          45 :         case Instruction::GetElementPtr:
    1629             :           // By far the most common case to handle is when the base pointers are
    1630             :           // obviously to the same global.
    1631             :           if (isa<GlobalValue>(CE1Op0) && isa<GlobalValue>(CE2Op0)) {
    1632             :             // Don't know relative ordering, but check for inequality.
    1633          36 :             if (CE1Op0 != CE2Op0) {
    1634             :               GEPOperator *CE2GEP = cast<GEPOperator>(CE2);
    1635          28 :               if (CE1GEP->hasAllZeroIndices() && CE2GEP->hasAllZeroIndices())
    1636             :                 return areGlobalsPotentiallyEqual(cast<GlobalValue>(CE1Op0),
    1637           4 :                                                   cast<GlobalValue>(CE2Op0));
    1638             :               return ICmpInst::BAD_ICMP_PREDICATE;
    1639             :             }
    1640             :             // Ok, we know that both getelementptr instructions are based on the
    1641             :             // same global.  From this, we can precisely determine the relative
    1642             :             // ordering of the resultant pointers.
    1643             :             unsigned i = 1;
    1644             : 
    1645             :             // The logic below assumes that the result of the comparison
    1646             :             // can be determined by finding the first index that differs.
    1647             :             // This doesn't work if there is over-indexing in any
    1648             :             // subsequent indices, so check for that case first.
    1649          16 :             if (!CE1->isGEPWithNoNotionalOverIndexing() ||
    1650           8 :                 !CE2->isGEPWithNoNotionalOverIndexing())
    1651             :                return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
    1652             : 
    1653             :             // Compare all of the operands the GEP's have in common.
    1654           8 :             gep_type_iterator GTI = gep_type_begin(CE1);
    1655          46 :             for (;i != CE1->getNumOperands() && i != CE2->getNumOperands();
    1656             :                  ++i, ++GTI)
    1657          36 :               switch (IdxCompare(CE1->getOperand(i),
    1658             :                                  CE2->getOperand(i), GTI.getIndexedType())) {
    1659           7 :               case -1: return isSigned ? ICmpInst::ICMP_SLT:ICmpInst::ICMP_ULT;
    1660           0 :               case 1:  return isSigned ? ICmpInst::ICMP_SGT:ICmpInst::ICMP_UGT;
    1661             :               case -2: return ICmpInst::BAD_ICMP_PREDICATE;
    1662             :               }
    1663             : 
    1664             :             // Ok, we ran out of things they have in common.  If any leftovers
    1665             :             // are non-zero then we have a difference, otherwise we are equal.
    1666           0 :             for (; i < CE1->getNumOperands(); ++i)
    1667           0 :               if (!CE1->getOperand(i)->isNullValue()) {
    1668           0 :                 if (isa<ConstantInt>(CE1->getOperand(i)))
    1669           0 :                   return isSigned ? ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT;
    1670             :                 else
    1671             :                   return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
    1672             :               }
    1673             : 
    1674           0 :             for (; i < CE2->getNumOperands(); ++i)
    1675           0 :               if (!CE2->getOperand(i)->isNullValue()) {
    1676           0 :                 if (isa<ConstantInt>(CE2->getOperand(i)))
    1677           0 :                   return isSigned ? ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT;
    1678             :                 else
    1679             :                   return ICmpInst::BAD_ICMP_PREDICATE; // Might be equal.
    1680             :               }
    1681             :             return ICmpInst::ICMP_EQ;
    1682             :           }
    1683             :         }
    1684             :       }
    1685             :       break;
    1686             :     }
    1687             :     default:
    1688             :       break;
    1689             :     }
    1690             :   }
    1691             : 
    1692             :   return ICmpInst::BAD_ICMP_PREDICATE;
    1693             : }
    1694             : 
    1695       93542 : Constant *llvm::ConstantFoldCompareInstruction(unsigned short pred,
    1696             :                                                Constant *C1, Constant *C2) {
    1697             :   Type *ResultTy;
    1698       93542 :   if (VectorType *VT = dyn_cast<VectorType>(C1->getType()))
    1699          84 :     ResultTy = VectorType::get(Type::getInt1Ty(C1->getContext()),
    1700          84 :                                VT->getNumElements());
    1701             :   else
    1702       93458 :     ResultTy = Type::getInt1Ty(C1->getContext());
    1703             : 
    1704             :   // Fold FCMP_FALSE/FCMP_TRUE unconditionally.
    1705       93542 :   if (pred == FCmpInst::FCMP_FALSE)
    1706           0 :     return Constant::getNullValue(ResultTy);
    1707             : 
    1708       93542 :   if (pred == FCmpInst::FCMP_TRUE)
    1709           0 :     return Constant::getAllOnesValue(ResultTy);
    1710             : 
    1711             :   // Handle some degenerate cases first
    1712      186891 :   if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) {
    1713         223 :     CmpInst::Predicate Predicate = CmpInst::Predicate(pred);
    1714             :     bool isIntegerPredicate = ICmpInst::isIntPredicate(Predicate);
    1715             :     // For EQ and NE, we can always pick a value for the undef to make the
    1716             :     // predicate pass or fail, so we can return undef.
    1717             :     // Also, if both operands are undef, we can return undef for int comparison.
    1718         223 :     if (ICmpInst::isEquality(Predicate) || (isIntegerPredicate && C1 == C2))
    1719         118 :       return UndefValue::get(ResultTy);
    1720             : 
    1721             :     // Otherwise, for integer compare, pick the same value as the non-undef
    1722             :     // operand, and fold it to true or false.
    1723         105 :     if (isIntegerPredicate)
    1724          67 :       return ConstantInt::get(ResultTy, CmpInst::isTrueWhenEqual(Predicate));
    1725             : 
    1726             :     // Choosing NaN for the undef will always make unordered comparison succeed
    1727             :     // and ordered comparison fails.
    1728          38 :     return ConstantInt::get(ResultTy, CmpInst::isUnordered(Predicate));
    1729             :   }
    1730             : 
    1731             :   // icmp eq/ne(null,GV) -> false/true
    1732       93319 :   if (C1->isNullValue()) {
    1733             :     if (const GlobalValue *GV = dyn_cast<GlobalValue>(C2))
    1734             :       // Don't try to evaluate aliases.  External weak GV can be null.
    1735           0 :       if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage()) {
    1736           0 :         if (pred == ICmpInst::ICMP_EQ)
    1737           0 :           return ConstantInt::getFalse(C1->getContext());
    1738           0 :         else if (pred == ICmpInst::ICMP_NE)
    1739           0 :           return ConstantInt::getTrue(C1->getContext());
    1740             :       }
    1741             :   // icmp eq/ne(GV,null) -> false/true
    1742       58589 :   } else if (C2->isNullValue()) {
    1743             :     if (const GlobalValue *GV = dyn_cast<GlobalValue>(C1))
    1744             :       // Don't try to evaluate aliases.  External weak GV can be null.
    1745         191 :       if (!isa<GlobalAlias>(GV) && !GV->hasExternalWeakLinkage()) {
    1746          33 :         if (pred == ICmpInst::ICMP_EQ)
    1747          12 :           return ConstantInt::getFalse(C1->getContext());
    1748          21 :         else if (pred == ICmpInst::ICMP_NE)
    1749          17 :           return ConstantInt::getTrue(C1->getContext());
    1750             :       }
    1751             :   }
    1752             : 
    1753             :   // If the comparison is a comparison between two i1's, simplify it.
    1754       93290 :   if (C1->getType()->isIntegerTy(1)) {
    1755         149 :     switch(pred) {
    1756          86 :     case ICmpInst::ICMP_EQ:
    1757          86 :       if (isa<ConstantInt>(C2))
    1758          86 :         return ConstantExpr::getXor(C1, ConstantExpr::getNot(C2));
    1759           0 :       return ConstantExpr::getXor(ConstantExpr::getNot(C1), C2);
    1760          19 :     case ICmpInst::ICMP_NE:
    1761          19 :       return ConstantExpr::getXor(C1, C2);
    1762             :     default:
    1763             :       break;
    1764             :     }
    1765             :   }
    1766             : 
    1767      168472 :   if (isa<ConstantInt>(C1) && isa<ConstantInt>(C2)) {
    1768             :     const APInt &V1 = cast<ConstantInt>(C1)->getValue();
    1769             :     const APInt &V2 = cast<ConstantInt>(C2)->getValue();
    1770       75277 :     switch (pred) {
    1771           0 :     default: llvm_unreachable("Invalid ICmp Predicate");
    1772       24767 :     case ICmpInst::ICMP_EQ:  return ConstantInt::get(ResultTy, V1 == V2);
    1773        5942 :     case ICmpInst::ICMP_NE:  return ConstantInt::get(ResultTy, V1 != V2);
    1774        2100 :     case ICmpInst::ICMP_SLT: return ConstantInt::get(ResultTy, V1.slt(V2));
    1775       10204 :     case ICmpInst::ICMP_SGT: return ConstantInt::get(ResultTy, V1.sgt(V2));
    1776         971 :     case ICmpInst::ICMP_SLE: return ConstantInt::get(ResultTy, V1.sle(V2));
    1777         664 :     case ICmpInst::ICMP_SGE: return ConstantInt::get(ResultTy, V1.sge(V2));
    1778       23399 :     case ICmpInst::ICMP_ULT: return ConstantInt::get(ResultTy, V1.ult(V2));
    1779        5325 :     case ICmpInst::ICMP_UGT: return ConstantInt::get(ResultTy, V1.ugt(V2));
    1780        1148 :     case ICmpInst::ICMP_ULE: return ConstantInt::get(ResultTy, V1.ule(V2));
    1781         757 :     case ICmpInst::ICMP_UGE: return ConstantInt::get(ResultTy, V1.uge(V2));
    1782             :     }
    1783       18207 :   } else if (isa<ConstantFP>(C1) && isa<ConstantFP>(C2)) {
    1784             :     const APFloat &C1V = cast<ConstantFP>(C1)->getValueAPF();
    1785             :     const APFloat &C2V = cast<ConstantFP>(C2)->getValueAPF();
    1786         299 :     APFloat::cmpResult R = C1V.compare(C2V);
    1787         299 :     switch (pred) {
    1788           0 :     default: llvm_unreachable("Invalid FCmp Predicate");
    1789           0 :     case FCmpInst::FCMP_FALSE: return Constant::getNullValue(ResultTy);
    1790           0 :     case FCmpInst::FCMP_TRUE:  return Constant::getAllOnesValue(ResultTy);
    1791           9 :     case FCmpInst::FCMP_UNO:
    1792           9 :       return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered);
    1793           1 :     case FCmpInst::FCMP_ORD:
    1794           1 :       return ConstantInt::get(ResultTy, R!=APFloat::cmpUnordered);
    1795           7 :     case FCmpInst::FCMP_UEQ:
    1796          14 :       return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
    1797          14 :                                         R==APFloat::cmpEqual);
    1798          42 :     case FCmpInst::FCMP_OEQ:
    1799          42 :       return ConstantInt::get(ResultTy, R==APFloat::cmpEqual);
    1800          88 :     case FCmpInst::FCMP_UNE:
    1801          88 :       return ConstantInt::get(ResultTy, R!=APFloat::cmpEqual);
    1802           3 :     case FCmpInst::FCMP_ONE:
    1803           6 :       return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan ||
    1804           6 :                                         R==APFloat::cmpGreaterThan);
    1805          10 :     case FCmpInst::FCMP_ULT:
    1806          20 :       return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
    1807          20 :                                         R==APFloat::cmpLessThan);
    1808          26 :     case FCmpInst::FCMP_OLT:
    1809          26 :       return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan);
    1810           4 :     case FCmpInst::FCMP_UGT:
    1811           4 :       return ConstantInt::get(ResultTy, R==APFloat::cmpUnordered ||
    1812           4 :                                         R==APFloat::cmpGreaterThan);
    1813          20 :     case FCmpInst::FCMP_OGT:
    1814          20 :       return ConstantInt::get(ResultTy, R==APFloat::cmpGreaterThan);
    1815           0 :     case FCmpInst::FCMP_ULE:
    1816           0 :       return ConstantInt::get(ResultTy, R!=APFloat::cmpGreaterThan);
    1817          15 :     case FCmpInst::FCMP_OLE:
    1818          15 :       return ConstantInt::get(ResultTy, R==APFloat::cmpLessThan ||
    1819          15 :                                         R==APFloat::cmpEqual);
    1820          39 :     case FCmpInst::FCMP_UGE:
    1821          39 :       return ConstantInt::get(ResultTy, R!=APFloat::cmpLessThan);
    1822          35 :     case FCmpInst::FCMP_OGE:
    1823          35 :       return ConstantInt::get(ResultTy, R==APFloat::cmpGreaterThan ||
    1824          35 :                                         R==APFloat::cmpEqual);
    1825             :     }
    1826       35218 :   } else if (C1->getType()->isVectorTy()) {
    1827             :     // If we can constant fold the comparison of each element, constant fold
    1828             :     // the whole vector comparison.
    1829             :     SmallVector<Constant*, 4> ResElts;
    1830          71 :     Type *Ty = IntegerType::get(C1->getContext(), 32);
    1831             :     // Compare the elements, producing an i1 result or constant expr.
    1832         850 :     for (unsigned i = 0, e = C1->getType()->getVectorNumElements(); i != e;++i){
    1833             :       Constant *C1E =
    1834         354 :         ConstantExpr::getExtractElement(C1, ConstantInt::get(Ty, i));
    1835             :       Constant *C2E =
    1836         354 :         ConstantExpr::getExtractElement(C2, ConstantInt::get(Ty, i));
    1837             : 
    1838         354 :       ResElts.push_back(ConstantExpr::getCompare(pred, C1E, C2E));
    1839             :     }
    1840             : 
    1841          71 :     return ConstantVector::get(ResElts);
    1842             :   }
    1843             : 
    1844           4 :   if (C1->getType()->isFloatingPointTy() &&
    1845             :       // Only call evaluateFCmpRelation if we have a constant expr to avoid
    1846             :       // infinite recursive loop
    1847           0 :       (isa<ConstantExpr>(C1) || isa<ConstantExpr>(C2))) {
    1848             :     int Result = -1;  // -1 = unknown, 0 = known false, 1 = known true.
    1849           4 :     switch (evaluateFCmpRelation(C1, C2)) {
    1850           0 :     default: llvm_unreachable("Unknown relation!");
    1851             :     case FCmpInst::FCMP_UNO:
    1852             :     case FCmpInst::FCMP_ORD:
    1853             :     case FCmpInst::FCMP_UEQ:
    1854             :     case FCmpInst::FCMP_UNE:
    1855             :     case FCmpInst::FCMP_ULT:
    1856             :     case FCmpInst::FCMP_UGT:
    1857             :     case FCmpInst::FCMP_ULE:
    1858             :     case FCmpInst::FCMP_UGE:
    1859             :     case FCmpInst::FCMP_TRUE:
    1860             :     case FCmpInst::FCMP_FALSE:
    1861             :     case FCmpInst::BAD_FCMP_PREDICATE:
    1862             :       break; // Couldn't determine anything about these constants.
    1863           0 :     case FCmpInst::FCMP_OEQ: // We know that C1 == C2
    1864           0 :       Result = (pred == FCmpInst::FCMP_UEQ || pred == FCmpInst::FCMP_OEQ ||
    1865           0 :                 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE ||
    1866           0 :                 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
    1867           0 :       break;
    1868           0 :     case FCmpInst::FCMP_OLT: // We know that C1 < C2
    1869           0 :       Result = (pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
    1870           0 :                 pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT ||
    1871           0 :                 pred == FCmpInst::FCMP_ULE || pred == FCmpInst::FCMP_OLE);
    1872           0 :       break;
    1873           0 :     case FCmpInst::FCMP_OGT: // We know that C1 > C2
    1874           0 :       Result = (pred == FCmpInst::FCMP_UNE || pred == FCmpInst::FCMP_ONE ||
    1875           0 :                 pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT ||
    1876           0 :                 pred == FCmpInst::FCMP_UGE || pred == FCmpInst::FCMP_OGE);
    1877           0 :       break;
    1878           0 :     case FCmpInst::FCMP_OLE: // We know that C1 <= C2
    1879             :       // We can only partially decide this relation.
    1880           0 :       if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
    1881             :         Result = 0;
    1882           0 :       else if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
    1883             :         Result = 1;
    1884             :       break;
    1885           0 :     case FCmpInst::FCMP_OGE: // We known that C1 >= C2
    1886             :       // We can only partially decide this relation.
    1887           0 :       if (pred == FCmpInst::FCMP_ULT || pred == FCmpInst::FCMP_OLT)
    1888             :         Result = 0;
    1889           0 :       else if (pred == FCmpInst::FCMP_UGT || pred == FCmpInst::FCMP_OGT)
    1890             :         Result = 1;
    1891             :       break;
    1892           0 :     case FCmpInst::FCMP_ONE: // We know that C1 != C2
    1893             :       // We can only partially decide this relation.
    1894           0 :       if (pred == FCmpInst::FCMP_OEQ || pred == FCmpInst::FCMP_UEQ)
    1895             :         Result = 0;
    1896           0 :       else if (pred == FCmpInst::FCMP_ONE || pred == FCmpInst::FCMP_UNE)
    1897             :         Result = 1;
    1898             :       break;
    1899             :     }
    1900             : 
    1901             :     // If we evaluated the result, return it now.
    1902             :     if (Result != -1)
    1903           0 :       return ConstantInt::get(ResultTy, Result);
    1904             : 
    1905             :   } else {
    1906             :     // Evaluate the relation between the two constants, per the predicate.
    1907             :     int Result = -1;  // -1 = unknown, 0 = known false, 1 = known true.
    1908       17534 :     switch (evaluateICmpRelation(C1, C2,
    1909       17534 :                                  CmpInst::isSigned((CmpInst::Predicate)pred))) {
    1910           0 :     default: llvm_unreachable("Unknown relational!");
    1911             :     case ICmpInst::BAD_ICMP_PREDICATE:
    1912             :       break;  // Couldn't determine anything about these constants.
    1913       11795 :     case ICmpInst::ICMP_EQ:   // We know the constants are equal!
    1914             :       // If we know the constants are equal, we can decide the result of this
    1915             :       // computation precisely.
    1916       11795 :       Result = ICmpInst::isTrueWhenEqual((ICmpInst::Predicate)pred);
    1917       11795 :       break;
    1918           7 :     case ICmpInst::ICMP_ULT:
    1919             :       switch (pred) {
    1920             :       case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_ULE:
    1921             :         Result = 1; break;
    1922             :       case ICmpInst::ICMP_UGT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_UGE:
    1923             :         Result = 0; break;
    1924             :       }
    1925             :       break;
    1926           4 :     case ICmpInst::ICMP_SLT:
    1927             :       switch (pred) {
    1928             :       case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_SLE:
    1929             :         Result = 1; break;
    1930             :       case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_SGE:
    1931             :         Result = 0; break;
    1932             :       }
    1933             :       break;
    1934        2795 :     case ICmpInst::ICMP_UGT:
    1935             :       switch (pred) {
    1936             :       case ICmpInst::ICMP_UGT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_UGE:
    1937             :         Result = 1; break;
    1938             :       case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_ULE:
    1939             :         Result = 0; break;
    1940             :       }
    1941             :       break;
    1942           0 :     case ICmpInst::ICMP_SGT:
    1943             :       switch (pred) {
    1944             :       case ICmpInst::ICMP_SGT: case ICmpInst::ICMP_NE: case ICmpInst::ICMP_SGE:
    1945             :         Result = 1; break;
    1946             :       case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_EQ: case ICmpInst::ICMP_SLE:
    1947             :         Result = 0; break;
    1948             :       }
    1949             :       break;
    1950           0 :     case ICmpInst::ICMP_ULE:
    1951           0 :       if (pred == ICmpInst::ICMP_UGT) Result = 0;
    1952           0 :       if (pred == ICmpInst::ICMP_ULT || pred == ICmpInst::ICMP_ULE) Result = 1;
    1953             :       break;
    1954           0 :     case ICmpInst::ICMP_SLE:
    1955           0 :       if (pred == ICmpInst::ICMP_SGT) Result = 0;
    1956           0 :       if (pred == ICmpInst::ICMP_SLT || pred == ICmpInst::ICMP_SLE) Result = 1;
    1957             :       break;
    1958           0 :     case ICmpInst::ICMP_UGE:
    1959           0 :       if (pred == ICmpInst::ICMP_ULT) Result = 0;
    1960           0 :       if (pred == ICmpInst::ICMP_UGT || pred == ICmpInst::ICMP_UGE) Result = 1;
    1961             :       break;
    1962           0 :     case ICmpInst::ICMP_SGE:
    1963           0 :       if (pred == ICmpInst::ICMP_SLT) Result = 0;
    1964           0 :       if (pred == ICmpInst::ICMP_SGT || pred == ICmpInst::ICMP_SGE) Result = 1;
    1965             :       break;
    1966          70 :     case ICmpInst::ICMP_NE:
    1967          70 :       if (pred == ICmpInst::ICMP_EQ) Result = 0;
    1968          70 :       if (pred == ICmpInst::ICMP_NE) Result = 1;
    1969             :       break;
    1970             :     }
    1971             : 
    1972             :     // If we evaluated the result, return it now.
    1973       11862 :     if (Result != -1)
    1974       14634 :       return ConstantInt::get(ResultTy, Result);
    1975             : 
    1976             :     // If the right hand side is a bitcast, try using its inverse to simplify
    1977             :     // it by moving it to the left hand side.  We can't do this if it would turn
    1978             :     // a vector compare into a scalar compare or visa versa.
    1979             :     if (ConstantExpr *CE2 = dyn_cast<ConstantExpr>(C2)) {
    1980             :       Constant *CE2Op0 = CE2->getOperand(0);
    1981         405 :       if (CE2->getOpcode() == Instruction::BitCast &&
    1982          38 :           CE2->getType()->isVectorTy() == CE2Op0->getType()->isVectorTy()) {
    1983          19 :         Constant *Inverse = ConstantExpr::getBitCast(C1, CE2Op0->getType());
    1984          19 :         return ConstantExpr::getICmp(pred, Inverse, CE2Op0);
    1985             :       }
    1986             :     }
    1987             : 
    1988             :     // If the left hand side is an extension, try eliminating it.
    1989             :     if (ConstantExpr *CE1 = dyn_cast<ConstantExpr>(C1)) {
    1990           0 :       if ((CE1->getOpcode() == Instruction::SExt &&
    1991        5448 :            ICmpInst::isSigned((ICmpInst::Predicate)pred)) ||
    1992         736 :           (CE1->getOpcode() == Instruction::ZExt &&
    1993         736 :            !ICmpInst::isSigned((ICmpInst::Predicate)pred))){
    1994             :         Constant *CE1Op0 = CE1->getOperand(0);
    1995          39 :         Constant *CE1Inverse = ConstantExpr::getTrunc(CE1, CE1Op0->getType());
    1996          39 :         if (CE1Inverse == CE1Op0) {
    1997             :           // Check whether we can safely truncate the right hand side.
    1998          39 :           Constant *C2Inverse = ConstantExpr::getTrunc(C2, CE1Op0->getType());
    1999          78 :           if (ConstantExpr::getCast(CE1->getOpcode(), C2Inverse,
    2000             :                                     C2->getType()) == C2)
    2001          39 :             return ConstantExpr::getICmp(pred, CE1Inverse, C2Inverse);
    2002             :         }
    2003             :       }
    2004             :     }
    2005             : 
    2006        5829 :     if ((!isa<ConstantExpr>(C1) && isa<ConstantExpr>(C2)) ||
    2007        2830 :         (C1->isNullValue() && !C2->isNullValue())) {
    2008             :       // If C2 is a constant expr and C1 isn't, flip them around and fold the
    2009             :       // other way if possible.
    2010             :       // Also, if C1 is null and C2 isn't, flip them around.
    2011          12 :       pred = ICmpInst::getSwappedPredicate((ICmpInst::Predicate)pred);
    2012          12 :       return ConstantExpr::getICmp(pred, C2, C1);
    2013             :     }
    2014             :   }
    2015             :   return nullptr;
    2016             : }
    2017             : 
    2018             : /// Test whether the given sequence of *normalized* indices is "inbounds".
    2019             : template<typename IndexTy>
    2020      212020 : static bool isInBoundsIndices(ArrayRef<IndexTy> Idxs) {
    2021             :   // No indices means nothing that could be out of bounds.
    2022      212020 :   if (Idxs.empty()) return true;
    2023             : 
    2024             :   // If the first index is zero, it's in bounds.
    2025      212020 :   if (cast<Constant>(Idxs[0])->isNullValue()) return true;
    2026             : 
    2027             :   // If the first index is one and all the rest are zero, it's in bounds,
    2028             :   // by the one-past-the-end rule.
    2029         211 :   if (auto *CI = dyn_cast<ConstantInt>(Idxs[0])) {
    2030         210 :     if (!CI->isOne())
    2031             :       return false;
    2032             :   } else {
    2033             :     auto *CV = cast<ConstantDataVector>(Idxs[0]);
    2034           1 :     CI = dyn_cast_or_null<ConstantInt>(CV->getSplatValue());
    2035           1 :     if (!CI || !CI->isOne())
    2036             :       return false;
    2037             :   }
    2038             : 
    2039         113 :   for (unsigned i = 1, e = Idxs.size(); i != e; ++i)
    2040         104 :     if (!cast<Constant>(Idxs[i])->isNullValue())
    2041             :       return false;
    2042             :   return true;
    2043             : }
    2044             : 
    2045             : /// Test whether a given ConstantInt is in-range for a SequentialType.
    2046    10965264 : static bool isIndexInRangeOfArrayType(uint64_t NumElements,
    2047             :                                       const ConstantInt *CI) {
    2048             :   // We cannot bounds check the index if it doesn't fit in an int64_t.
    2049    10965264 :   if (CI->getValue().getActiveBits() > 64)
    2050             :     return false;
    2051             : 
    2052             :   // A negative index or an index past the end of our sequential type is
    2053             :   // considered out-of-range.
    2054             :   int64_t IndexVal = CI->getSExtValue();
    2055    10965264 :   if (IndexVal < 0 || (NumElements > 0 && (uint64_t)IndexVal >= NumElements))
    2056             :     return false;
    2057             : 
    2058             :   // Otherwise, it is in-range.
    2059    10964680 :   return true;
    2060             : }
    2061             : 
    2062    11030743 : Constant *llvm::ConstantFoldGetElementPtr(Type *PointeeTy, Constant *C,
    2063             :                                           bool InBounds,
    2064             :                                           Optional<unsigned> InRangeIndex,
    2065             :                                           ArrayRef<Value *> Idxs) {
    2066    11030743 :   if (Idxs.empty()) return C;
    2067             : 
    2068             :   Type *GEPTy = GetElementPtrInst::getGEPReturnType(
    2069    11030741 :       C, makeArrayRef((Value *const *)Idxs.data(), Idxs.size()));
    2070             : 
    2071    11030741 :   if (isa<UndefValue>(C))
    2072          54 :     return UndefValue::get(GEPTy);
    2073             : 
    2074    11030687 :   Constant *Idx0 = cast<Constant>(Idxs[0]);
    2075    11038463 :   if (Idxs.size() == 1 && (Idx0->isNullValue() || isa<UndefValue>(Idx0)))
    2076          10 :     return GEPTy->isVectorTy() && !C->getType()->isVectorTy()
    2077         698 :                ? ConstantVector::getSplat(
    2078           2 :                      cast<VectorType>(GEPTy)->getNumElements(), C)
    2079             :                : C;
    2080             : 
    2081    11029991 :   if (C->isNullValue()) {
    2082             :     bool isNull = true;
    2083        3823 :     for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
    2084       15152 :       if (!isa<UndefValue>(Idxs[i]) &&
    2085        3788 :           !cast<Constant>(Idxs[i])->isNullValue()) {
    2086             :         isNull = false;
    2087             :         break;
    2088             :       }
    2089        2278 :     if (isNull) {
    2090          35 :       PointerType *PtrTy = cast<PointerType>(C->getType()->getScalarType());
    2091          35 :       Type *Ty = GetElementPtrInst::getIndexedType(PointeeTy, Idxs);
    2092             : 
    2093             :       assert(Ty && "Invalid indices for GEP!");
    2094          35 :       Type *OrigGEPTy = PointerType::get(Ty, PtrTy->getAddressSpace());
    2095          35 :       Type *GEPTy = PointerType::get(Ty, PtrTy->getAddressSpace());
    2096          35 :       if (VectorType *VT = dyn_cast<VectorType>(C->getType()))
    2097           2 :         GEPTy = VectorType::get(OrigGEPTy, VT->getNumElements());
    2098             : 
    2099             :       // The GEP returns a vector of pointers when one of more of
    2100             :       // its arguments is a vector.
    2101         169 :       for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
    2102         140 :         if (auto *VT = dyn_cast<VectorType>(Idxs[i]->getType())) {
    2103           3 :           GEPTy = VectorType::get(OrigGEPTy, VT->getNumElements());
    2104           3 :           break;
    2105             :         }
    2106             :       }
    2107             : 
    2108          35 :       return Constant::getNullValue(GEPTy);
    2109             :     }
    2110             :   }
    2111             : 
    2112             :   if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) {
    2113             :     // Combine Indices - If the source pointer to this getelementptr instruction
    2114             :     // is a getelementptr instruction, combine the indices of the two
    2115             :     // getelementptr instructions into a single instruction.
    2116             :     //
    2117        7145 :     if (CE->getOpcode() == Instruction::GetElementPtr) {
    2118             :       gep_type_iterator LastI = gep_type_end(CE);
    2119       10592 :       for (gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE);
    2120       10592 :            I != E; ++I)
    2121        7288 :         LastI = I;
    2122             : 
    2123             :       // We cannot combine indices if doing so would take us outside of an
    2124             :       // array or vector.  Doing otherwise could trick us if we evaluated such a
    2125             :       // GEP as part of a load.
    2126             :       //
    2127             :       // e.g. Consider if the original GEP was:
    2128             :       // i8* getelementptr ({ [2 x i8], i32, i8, [3 x i8] }* @main.c,
    2129             :       //                    i32 0, i32 0, i64 0)
    2130             :       //
    2131             :       // If we then tried to offset it by '8' to get to the third element,
    2132             :       // an i8, we should *not* get:
    2133             :       // i8* getelementptr ({ [2 x i8], i32, i8, [3 x i8] }* @main.c,
    2134             :       //                    i32 0, i32 0, i64 8)
    2135             :       //
    2136             :       // This GEP tries to index array element '8  which runs out-of-bounds.
    2137             :       // Subsequent evaluation would get confused and produce erroneous results.
    2138             :       //
    2139             :       // The following prohibits such a GEP from being formed by checking to see
    2140             :       // if the index is in-range with respect to an array.
    2141             :       // TODO: This code may be extended to handle vectors as well.
    2142             :       bool PerformFold = false;
    2143        3304 :       if (Idx0->isNullValue())
    2144             :         PerformFold = true;
    2145        1590 :       else if (LastI.isSequential())
    2146             :         if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx0))
    2147        1508 :           PerformFold = (!LastI.isBoundedSequential() ||
    2148        1508 :                          isIndexInRangeOfArrayType(
    2149        1100 :                              LastI.getSequentialNumElements(), CI)) &&
    2150        1100 :                         !CE->getOperand(CE->getNumOperands() - 1)
    2151             :                              ->getType()
    2152        1100 :                              ->isVectorTy();
    2153             : 
    2154             :       if (PerformFold) {
    2155             :         SmallVector<Value*, 16> NewIndices;
    2156        2813 :         NewIndices.reserve(Idxs.size() + CE->getNumOperands());
    2157        5626 :         NewIndices.append(CE->op_begin() + 1, CE->op_end() - 1);
    2158             : 
    2159             :         // Add the last index of the source with the first index of the new GEP.
    2160             :         // Make sure to handle the case when they are actually different types.
    2161        2813 :         Constant *Combined = CE->getOperand(CE->getNumOperands()-1);
    2162             :         // Otherwise it must be an array.
    2163        2813 :         if (!Idx0->isNullValue()) {
    2164        1099 :           Type *IdxTy = Combined->getType();
    2165        1099 :           if (IdxTy != Idx0->getType()) {
    2166             :             unsigned CommonExtendedWidth =
    2167         231 :                 std::max(IdxTy->getIntegerBitWidth(),
    2168         231 :                          Idx0->getType()->getIntegerBitWidth());
    2169         154 :             CommonExtendedWidth = std::max(CommonExtendedWidth, 64U);
    2170             : 
    2171             :             Type *CommonTy =
    2172          77 :                 Type::getIntNTy(IdxTy->getContext(), CommonExtendedWidth);
    2173          77 :             Constant *C1 = ConstantExpr::getSExtOrBitCast(Idx0, CommonTy);
    2174          77 :             Constant *C2 = ConstantExpr::getSExtOrBitCast(Combined, CommonTy);
    2175          77 :             Combined = ConstantExpr::get(Instruction::Add, C1, C2);
    2176             :           } else {
    2177        1022 :             Combined =
    2178             :               ConstantExpr::get(Instruction::Add, Idx0, Combined);
    2179             :           }
    2180             :         }
    2181             : 
    2182        2813 :         NewIndices.push_back(Combined);
    2183        2813 :         NewIndices.append(Idxs.begin() + 1, Idxs.end());
    2184             : 
    2185             :         // The combined GEP normally inherits its index inrange attribute from
    2186             :         // the inner GEP, but if the inner GEP's last index was adjusted by the
    2187             :         // outer GEP, any inbounds attribute on that index is invalidated.
    2188             :         Optional<unsigned> IRIndex = cast<GEPOperator>(CE)->getInRangeIndex();
    2189        2819 :         if (IRIndex && *IRIndex == CE->getNumOperands() - 2 && !Idx0->isNullValue())
    2190             :           IRIndex = None;
    2191             : 
    2192        8439 :         return ConstantExpr::getGetElementPtr(
    2193             :             cast<GEPOperator>(CE)->getSourceElementType(), CE->getOperand(0),
    2194        3808 :             NewIndices, InBounds && cast<GEPOperator>(CE)->isInBounds(),
    2195        2813 :             IRIndex);
    2196             :       }
    2197             :     }
    2198             : 
    2199             :     // Attempt to fold casts to the same type away.  For example, folding:
    2200             :     //
    2201             :     //   i32* getelementptr ([2 x i32]* bitcast ([3 x i32]* %X to [2 x i32]*),
    2202             :     //                       i64 0, i64 0)
    2203             :     // into:
    2204             :     //
    2205             :     //   i32* getelementptr ([3 x i32]* %X, i64 0, i64 0)
    2206             :     //
    2207             :     // Don't fold if the cast is changing address spaces.
    2208        4332 :     if (CE->isCast() && Idxs.size() > 1 && Idx0->isNullValue()) {
    2209             :       PointerType *SrcPtrTy =
    2210         599 :         dyn_cast<PointerType>(CE->getOperand(0)->getType());
    2211         599 :       PointerType *DstPtrTy = dyn_cast<PointerType>(CE->getType());
    2212         599 :       if (SrcPtrTy && DstPtrTy) {
    2213             :         ArrayType *SrcArrayTy =
    2214         430 :           dyn_cast<ArrayType>(SrcPtrTy->getElementType());
    2215             :         ArrayType *DstArrayTy =
    2216         430 :           dyn_cast<ArrayType>(DstPtrTy->getElementType());
    2217         430 :         if (SrcArrayTy && DstArrayTy
    2218         111 :             && SrcArrayTy->getElementType() == DstArrayTy->getElementType()
    2219         533 :             && SrcPtrTy->getAddressSpace() == DstPtrTy->getAddressSpace())
    2220          50 :           return ConstantExpr::getGetElementPtr(SrcArrayTy,
    2221             :                                                 (Constant *)CE->getOperand(0),
    2222          25 :                                                 Idxs, InBounds, InRangeIndex);
    2223             :       }
    2224             :     }
    2225             :   }
    2226             : 
    2227             :   // Check to see if any array indices are not within the corresponding
    2228             :   // notional array or vector bounds. If so, try to determine if they can be
    2229             :   // factored out into preceding dimensions.
    2230             :   SmallVector<Constant *, 8> NewIdxs;
    2231             :   Type *Ty = PointeeTy;
    2232    11027118 :   Type *Prev = C->getType();
    2233             :   bool Unknown =
    2234    22054236 :       !isa<ConstantInt>(Idxs[0]) && !isa<ConstantDataVector>(Idxs[0]);
    2235    22090414 :   for (unsigned i = 1, e = Idxs.size(); i != e;
    2236    11063296 :        Prev = Ty, Ty = cast<CompositeType>(Ty)->getTypeAtIndex(Idxs[i]), ++i) {
    2237    33189936 :     if (!isa<ConstantInt>(Idxs[i]) && !isa<ConstantDataVector>(Idxs[i])) {
    2238             :       // We don't know if it's in range or not.
    2239             :       Unknown = true;
    2240    11063283 :       continue;
    2241             :     }
    2242    33189810 :     if (!isa<ConstantInt>(Idxs[i - 1]) && !isa<ConstantDataVector>(Idxs[i - 1]))
    2243             :       // Skip if the type of the previous index is not supported.
    2244          14 :       continue;
    2245    11147330 :     if (InRangeIndex && i == *InRangeIndex + 1) {
    2246             :       // If an index is marked inrange, we cannot apply this canonicalization to
    2247             :       // the following index, as that will cause the inrange index to point to
    2248             :       // the wrong element.
    2249       28032 :       continue;
    2250             :     }
    2251    11106695 :     if (isa<StructType>(Ty)) {
    2252             :       // The verify makes sure that GEPs into a struct are in range.
    2253       71493 :       continue;
    2254             :     }
    2255             :     auto *STy = cast<SequentialType>(Ty);
    2256    10963709 :     if (isa<VectorType>(STy)) {
    2257             :       // There can be awkward padding in after a non-power of two vector.
    2258             :       Unknown = true;
    2259          16 :       continue;
    2260             :     }
    2261             :     if (ConstantInt *CI = dyn_cast<ConstantInt>(Idxs[i])) {
    2262    10963662 :       if (isIndexInRangeOfArrayType(STy->getNumElements(), CI))
    2263             :         // It's in range, skip to the next index.
    2264    10963496 :         continue;
    2265         166 :       if (CI->getSExtValue() < 0) {
    2266             :         // It's out of range and negative, don't try to factor it.
    2267             :         Unknown = true;
    2268          77 :         continue;
    2269             :       }
    2270             :     } else {
    2271             :       auto *CV = cast<ConstantDataVector>(Idxs[i]);
    2272             :       bool InRange = true;
    2273         125 :       for (unsigned I = 0, E = CV->getNumElements(); I != E; ++I) {
    2274          94 :         auto *CI = cast<ConstantInt>(CV->getElementAsConstant(I));
    2275          94 :         InRange &= isIndexInRangeOfArrayType(STy->getNumElements(), CI);
    2276          94 :         if (CI->getSExtValue() < 0) {
    2277             :           Unknown = true;
    2278             :           break;
    2279             :         }
    2280             :       }
    2281          31 :       if (InRange || Unknown)
    2282             :         // It's in range, skip to the next index.
    2283             :         // It's out of range and negative, don't try to factor it.
    2284          27 :         continue;
    2285             :     }
    2286          93 :     if (isa<StructType>(Prev)) {
    2287             :       // It's out of range, but the prior dimension is a struct
    2288             :       // so we can't do anything about it.
    2289             :       Unknown = true;
    2290          32 :       continue;
    2291             :     }
    2292             :     // It's out of range, but we can factor it into the prior
    2293             :     // dimension.
    2294          61 :     NewIdxs.resize(Idxs.size());
    2295             :     // Determine the number of elements in our sequential type.
    2296             :     uint64_t NumElements = STy->getArrayNumElements();
    2297             : 
    2298             :     // Expand the current index or the previous index to a vector from a scalar
    2299             :     // if necessary.
    2300          61 :     Constant *CurrIdx = cast<Constant>(Idxs[i]);
    2301             :     auto *PrevIdx =
    2302          61 :         NewIdxs[i - 1] ? NewIdxs[i - 1] : cast<Constant>(Idxs[i - 1]);
    2303          61 :     bool IsCurrIdxVector = CurrIdx->getType()->isVectorTy();
    2304          61 :     bool IsPrevIdxVector = PrevIdx->getType()->isVectorTy();
    2305          61 :     bool UseVector = IsCurrIdxVector || IsPrevIdxVector;
    2306             : 
    2307          61 :     if (!IsCurrIdxVector && IsPrevIdxVector)
    2308           1 :       CurrIdx = ConstantDataVector::getSplat(
    2309             :           PrevIdx->getType()->getVectorNumElements(), CurrIdx);
    2310             : 
    2311          61 :     if (!IsPrevIdxVector && IsCurrIdxVector)
    2312           2 :       PrevIdx = ConstantDataVector::getSplat(
    2313             :           CurrIdx->getType()->getVectorNumElements(), PrevIdx);
    2314             : 
    2315             :     Constant *Factor =
    2316         122 :         ConstantInt::get(CurrIdx->getType()->getScalarType(), NumElements);
    2317          61 :     if (UseVector)
    2318          10 :       Factor = ConstantDataVector::getSplat(
    2319           4 :           IsPrevIdxVector ? PrevIdx->getType()->getVectorNumElements()
    2320           1 :                           : CurrIdx->getType()->getVectorNumElements(),
    2321             :           Factor);
    2322             : 
    2323          61 :     NewIdxs[i] = ConstantExpr::getSRem(CurrIdx, Factor);
    2324             : 
    2325          61 :     Constant *Div = ConstantExpr::getSDiv(CurrIdx, Factor);
    2326             : 
    2327             :     unsigned CommonExtendedWidth =
    2328         183 :         std::max(PrevIdx->getType()->getScalarSizeInBits(),
    2329         183 :                  Div->getType()->getScalarSizeInBits());
    2330         122 :     CommonExtendedWidth = std::max(CommonExtendedWidth, 64U);
    2331             : 
    2332             :     // Before adding, extend both operands to i64 to avoid
    2333             :     // overflow trouble.
    2334          61 :     Type *ExtendedTy = Type::getIntNTy(Div->getContext(), CommonExtendedWidth);
    2335          61 :     if (UseVector)
    2336          10 :       ExtendedTy = VectorType::get(
    2337             :           ExtendedTy, IsPrevIdxVector
    2338           4 :                           ? PrevIdx->getType()->getVectorNumElements()
    2339           1 :                           : CurrIdx->getType()->getVectorNumElements());
    2340             : 
    2341         122 :     if (!PrevIdx->getType()->isIntOrIntVectorTy(CommonExtendedWidth))
    2342          22 :       PrevIdx = ConstantExpr::getSExt(PrevIdx, ExtendedTy);
    2343             : 
    2344         122 :     if (!Div->getType()->isIntOrIntVectorTy(CommonExtendedWidth))
    2345          14 :       Div = ConstantExpr::getSExt(Div, ExtendedTy);
    2346             : 
    2347          61 :     NewIdxs[i - 1] = ConstantExpr::getAdd(PrevIdx, Div);
    2348             :   }
    2349             : 
    2350             :   // If we did any factoring, start over with the adjusted indices.
    2351    11027118 :   if (!NewIdxs.empty()) {
    2352         403 :     for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
    2353         399 :       if (!NewIdxs[i]) NewIdxs[i] = cast<Constant>(Idxs[i]);
    2354          57 :     return ConstantExpr::getGetElementPtr(PointeeTy, C, NewIdxs, InBounds,
    2355             :                                           InRangeIndex);
    2356             :   }
    2357             : 
    2358             :   // If all indices are known integers and normalized, we can do a simple
    2359             :   // check for the "inbounds" property.
    2360    11027061 :   if (!Unknown && !InBounds)
    2361             :     if (auto *GV = dyn_cast<GlobalVariable>(C))
    2362      212080 :       if (!GV->hasExternalWeakLinkage() && isInBoundsIndices(Idxs))
    2363      211870 :         return ConstantExpr::getGetElementPtr(PointeeTy, C, Idxs,
    2364      211870 :                                               /*InBounds=*/true, InRangeIndex);
    2365             : 
    2366             :   return nullptr;
    2367             : }

Generated by: LCOV version 1.13