/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp

Bug Summary

File:	llvm/lib/Analysis/ConstantFolding.cpp
Warning:	line 2605, column 35 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ConstantFolding.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -analyzer-config-compatibility-mode=true -mrelocation-model pic -pic-level 2 -mframe-pointer=none -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -ffunction-sections -fdata-sections -fcoverage-compilation-dir=/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/build-llvm/lib/Analysis -resource-dir /usr/lib/llvm-13/lib/clang/13.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/build-llvm/lib/Analysis -I /build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis -I /build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/build-llvm/include -I /build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include -D NDEBUG -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/x86_64-linux-gnu/c++/10 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../include/c++/10/backward -internal-isystem /usr/lib/llvm-13/lib/clang/13.0.0/include -internal-isystem /usr/local/include -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/10/../../../../x86_64-linux-gnu/include -internal-externc-isystem /usr/include/x86_64-linux-gnu -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-maybe-uninitialized -Wno-class-memaccess -Wno-redundant-move -Wno-pessimizing-move -Wno-noexcept-type -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/build-llvm/lib/Analysis -fdebug-prefix-map=/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4=. -ferror-limit 19 -fvisibility-inlines-hidden -stack-protector 2 -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /tmp/scan-build-2021-07-23-023125-8721-1 -x c++ /build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp

/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp

→

1//===-- ConstantFolding.cpp - Fold instructions into constants ------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file defines routines for folding instructions into constants.
10//
11// Also, to supplement the basic IR ConstantExpr simplifications,
12// this file defines some additional folding routines that can make use of
13// DataLayout information. These functions cannot go in IR due to library
14// dependency issues.
15//
16//===----------------------------------------------------------------------===//

18#include "llvm/Analysis/ConstantFolding.h"
19#include "llvm/ADT/APFloat.h"
20#include "llvm/ADT/APInt.h"
21#include "llvm/ADT/APSInt.h"
22#include "llvm/ADT/ArrayRef.h"
23#include "llvm/ADT/DenseMap.h"
24#include "llvm/ADT/STLExtras.h"
25#include "llvm/ADT/SmallVector.h"
26#include "llvm/ADT/StringRef.h"
27#include "llvm/Analysis/TargetFolder.h"
28#include "llvm/Analysis/TargetLibraryInfo.h"
29#include "llvm/Analysis/ValueTracking.h"
30#include "llvm/Analysis/VectorUtils.h"
31#include "llvm/Config/config.h"
32#include "llvm/IR/Constant.h"
33#include "llvm/IR/Constants.h"
34#include "llvm/IR/DataLayout.h"
35#include "llvm/IR/DerivedTypes.h"
36#include "llvm/IR/Function.h"
37#include "llvm/IR/GlobalValue.h"
38#include "llvm/IR/GlobalVariable.h"
39#include "llvm/IR/InstrTypes.h"
40#include "llvm/IR/Instruction.h"
41#include "llvm/IR/Instructions.h"
42#include "llvm/IR/IntrinsicInst.h"
43#include "llvm/IR/Intrinsics.h"
44#include "llvm/IR/IntrinsicsAArch64.h"
45#include "llvm/IR/IntrinsicsAMDGPU.h"
46#include "llvm/IR/IntrinsicsARM.h"
47#include "llvm/IR/IntrinsicsWebAssembly.h"
48#include "llvm/IR/IntrinsicsX86.h"
49#include "llvm/IR/Operator.h"
50#include "llvm/IR/Type.h"
51#include "llvm/IR/Value.h"
52#include "llvm/Support/Casting.h"
53#include "llvm/Support/ErrorHandling.h"
54#include "llvm/Support/KnownBits.h"
55#include "llvm/Support/MathExtras.h"
56#include <cassert>
57#include <cerrno>
58#include <cfenv>
59#include <cmath>
60#include <cstddef>
61#include <cstdint>

63using namespace llvm;

65namespace {
66Constant *SymbolicallyEvaluateGEP(const GEPOperator *GEP,
                                ArrayRef<Constant *> Ops,
                                const DataLayout &DL,
                                const TargetLibraryInfo *TLI,
                                bool ForLoadOperand);

72//===----------------------------------------------------------------------===//
73// Constant Folding internal helper functions
74//===----------------------------------------------------------------------===//

76static Constant *foldConstVectorToAPInt(APInt &Result, Type *DestTy,
                                      Constant *C, Type *SrcEltTy,
                                      unsigned NumSrcElts,
                                      const DataLayout &DL) {
// Now that we know that the input value is a vector of integers, just shift
// and insert them into our result.
unsigned BitShift = DL.getTypeSizeInBits(SrcEltTy);
for (unsigned i = 0; i != NumSrcElts; ++i) {
  Constant *Element;
  if (DL.isLittleEndian())
    Element = C->getAggregateElement(NumSrcElts - i - 1);
  else
    Element = C->getAggregateElement(i);

  if (Element && isa<UndefValue>(Element)) {
    Result <<= BitShift;
    continue;
  }

  auto *ElementCI = dyn_cast_or_null<ConstantInt>(Element);
  if (!ElementCI)
    return ConstantExpr::getBitCast(C, DestTy);

  Result <<= BitShift;
  Result |= ElementCI->getValue().zextOrSelf(Result.getBitWidth());
}

return nullptr;
104}

106/// Constant fold bitcast, symbolically evaluating it with DataLayout.
107/// This always returns a non-null constant, but it may be a
108/// ConstantExpr if unfoldable.
109Constant *FoldBitCast(Constant *C, Type *DestTy, const DataLayout &DL) {
assert(CastInst::castIsValid(Instruction::BitCast, C, DestTy) &&(static_cast <bool> (CastInst::castIsValid(Instruction::
BitCast, C, DestTy) && "Invalid constantexpr bitcast!"
) ? void (0) : __assert_fail ("CastInst::castIsValid(Instruction::BitCast, C, DestTy) && \"Invalid constantexpr bitcast!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 111, __extension__ __PRETTY_FUNCTION__))
       "Invalid constantexpr bitcast!")(static_cast <bool> (CastInst::castIsValid(Instruction::
BitCast, C, DestTy) && "Invalid constantexpr bitcast!"
) ? void (0) : __assert_fail ("CastInst::castIsValid(Instruction::BitCast, C, DestTy) && \"Invalid constantexpr bitcast!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 111, __extension__ __PRETTY_FUNCTION__));

// Catch the obvious splat cases.
if (C->isNullValue() && !DestTy->isX86_MMXTy() && !DestTy->isX86_AMXTy())
  return Constant::getNullValue(DestTy);
if (C->isAllOnesValue() && !DestTy->isX86_MMXTy() && !DestTy->isX86_AMXTy() &&
    !DestTy->isPtrOrPtrVectorTy()) // Don't get ones for ptr types!
  return Constant::getAllOnesValue(DestTy);

if (auto *VTy = dyn_cast<VectorType>(C->getType())) {
  // Handle a vector->scalar integer/fp cast.
  if (isa<IntegerType>(DestTy) || DestTy->isFloatingPointTy()) {
    unsigned NumSrcElts = cast<FixedVectorType>(VTy)->getNumElements();
    Type *SrcEltTy = VTy->getElementType();

    // If the vector is a vector of floating point, convert it to vector of int
    // to simplify things.
    if (SrcEltTy->isFloatingPointTy()) {
      unsigned FPWidth = SrcEltTy->getPrimitiveSizeInBits();
      auto *SrcIVTy = FixedVectorType::get(
          IntegerType::get(C->getContext(), FPWidth), NumSrcElts);
      // Ask IR to do the conversion now that #elts line up.
      C = ConstantExpr::getBitCast(C, SrcIVTy);
    }

    APInt Result(DL.getTypeSizeInBits(DestTy), 0);
    if (Constant *CE = foldConstVectorToAPInt(Result, DestTy, C,
                                              SrcEltTy, NumSrcElts, DL))
      return CE;

    if (isa<IntegerType>(DestTy))
      return ConstantInt::get(DestTy, Result);

    APFloat FP(DestTy->getFltSemantics(), Result);
    return ConstantFP::get(DestTy->getContext(), FP);
  }
}

// The code below only handles casts to vectors currently.
auto *DestVTy = dyn_cast<VectorType>(DestTy);
if (!DestVTy)
  return ConstantExpr::getBitCast(C, DestTy);

// If this is a scalar -> vector cast, convert the input into a <1 x scalar>
// vector so the code below can handle it uniformly.
if (isa<ConstantFP>(C) || isa<ConstantInt>(C)) {
  Constant *Ops = C; // don't take the address of C!
  return FoldBitCast(ConstantVector::get(Ops), DestTy, DL);
}

// If this is a bitcast from constant vector -> vector, fold it.
if (!isa<ConstantDataVector>(C) && !isa<ConstantVector>(C))
  return ConstantExpr::getBitCast(C, DestTy);

// If the element types match, IR can fold it.
unsigned NumDstElt = cast<FixedVectorType>(DestVTy)->getNumElements();
unsigned NumSrcElt = cast<FixedVectorType>(C->getType())->getNumElements();
if (NumDstElt == NumSrcElt)
  return ConstantExpr::getBitCast(C, DestTy);

Type *SrcEltTy = cast<VectorType>(C->getType())->getElementType();
Type *DstEltTy = DestVTy->getElementType();

// Otherwise, we're changing the number of elements in a vector, which
// requires endianness information to do the right thing.  For example,
//    bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
// folds to (little endian):
//    <4 x i32> <i32 0, i32 0, i32 1, i32 0>
// and to (big endian):
//    <4 x i32> <i32 0, i32 0, i32 0, i32 1>

// First thing is first.  We only want to think about integer here, so if
// we have something in FP form, recast it as integer.
if (DstEltTy->isFloatingPointTy()) {
  // Fold to an vector of integers with same size as our FP type.
  unsigned FPWidth = DstEltTy->getPrimitiveSizeInBits();
  auto *DestIVTy = FixedVectorType::get(
      IntegerType::get(C->getContext(), FPWidth), NumDstElt);
  // Recursively handle this integer conversion, if possible.
  C = FoldBitCast(C, DestIVTy, DL);

  // Finally, IR can handle this now that #elts line up.
  return ConstantExpr::getBitCast(C, DestTy);
}

// Okay, we know the destination is integer, if the input is FP, convert
// it to integer first.
if (SrcEltTy->isFloatingPointTy()) {
  unsigned FPWidth = SrcEltTy->getPrimitiveSizeInBits();
  auto *SrcIVTy = FixedVectorType::get(
      IntegerType::get(C->getContext(), FPWidth), NumSrcElt);
  // Ask IR to do the conversion now that #elts line up.
  C = ConstantExpr::getBitCast(C, SrcIVTy);
  // If IR wasn't able to fold it, bail out.
  if (!isa<ConstantVector>(C) &&  // FIXME: Remove ConstantVector.
      !isa<ConstantDataVector>(C))
    return C;
}

// Now we know that the input and output vectors are both integer vectors
// of the same size, and that their #elements is not the same.  Do the
// conversion here, which depends on whether the input or output has
// more elements.
bool isLittleEndian = DL.isLittleEndian();

SmallVector<Constant*, 32> Result;
if (NumDstElt < NumSrcElt) {
  // Handle: bitcast (<4 x i32> <i32 0, i32 1, i32 2, i32 3> to <2 x i64>)
  Constant *Zero = Constant::getNullValue(DstEltTy);
  unsigned Ratio = NumSrcElt/NumDstElt;
  unsigned SrcBitSize = SrcEltTy->getPrimitiveSizeInBits();
  unsigned SrcElt = 0;
  for (unsigned i = 0; i != NumDstElt; ++i) {
    // Build each element of the result.
    Constant *Elt = Zero;
    unsigned ShiftAmt = isLittleEndian ? 0 : SrcBitSize*(Ratio-1);
    for (unsigned j = 0; j != Ratio; ++j) {
      Constant *Src = C->getAggregateElement(SrcElt++);
      if (Src && isa<UndefValue>(Src))
        Src = Constant::getNullValue(
            cast<VectorType>(C->getType())->getElementType());
      else
        Src = dyn_cast_or_null<ConstantInt>(Src);
      if (!Src)  // Reject constantexpr elements.
        return ConstantExpr::getBitCast(C, DestTy);

      // Zero extend the element to the right size.
      Src = ConstantExpr::getZExt(Src, Elt->getType());

      // Shift it to the right place, depending on endianness.
      Src = ConstantExpr::getShl(Src,
                                 ConstantInt::get(Src->getType(), ShiftAmt));
      ShiftAmt += isLittleEndian ? SrcBitSize : -SrcBitSize;

      // Mix it in.
      Elt = ConstantExpr::getOr(Elt, Src);
    }
    Result.push_back(Elt);
  }
  return ConstantVector::get(Result);
}

// Handle: bitcast (<2 x i64> <i64 0, i64 1> to <4 x i32>)
unsigned Ratio = NumDstElt/NumSrcElt;
unsigned DstBitSize = DL.getTypeSizeInBits(DstEltTy);

// Loop over each source value, expanding into multiple results.
for (unsigned i = 0; i != NumSrcElt; ++i) {
  auto *Element = C->getAggregateElement(i);

  if (!Element) // Reject constantexpr elements.
    return ConstantExpr::getBitCast(C, DestTy);

  if (isa<UndefValue>(Element)) {
    // Correctly Propagate undef values.
    Result.append(Ratio, UndefValue::get(DstEltTy));
    continue;
  }

  auto *Src = dyn_cast<ConstantInt>(Element);
  if (!Src)
    return ConstantExpr::getBitCast(C, DestTy);

  unsigned ShiftAmt = isLittleEndian ? 0 : DstBitSize*(Ratio-1);
  for (unsigned j = 0; j != Ratio; ++j) {
    // Shift the piece of the value into the right place, depending on
    // endianness.
    Constant *Elt = ConstantExpr::getLShr(Src,
                                ConstantInt::get(Src->getType(), ShiftAmt));
    ShiftAmt += isLittleEndian ? DstBitSize : -DstBitSize;

    // Truncate the element to an integer with the same pointer size and
    // convert the element back to a pointer using a inttoptr.
    if (DstEltTy->isPointerTy()) {
      IntegerType *DstIntTy = Type::getIntNTy(C->getContext(), DstBitSize);
      Constant *CE = ConstantExpr::getTrunc(Elt, DstIntTy);
      Result.push_back(ConstantExpr::getIntToPtr(CE, DstEltTy));
      continue;
    }

    // Truncate and remember this piece.
    Result.push_back(ConstantExpr::getTrunc(Elt, DstEltTy));
  }
}

return ConstantVector::get(Result);
297}

299} // end anonymous namespace

301/// If this constant is a constant offset from a global, return the global and
302/// the constant. Because of constantexprs, this function is recursive.
303bool llvm::IsConstantOffsetFromGlobal(Constant *C, GlobalValue *&GV,
                                    APInt &Offset, const DataLayout &DL,
                                    DSOLocalEquivalent **DSOEquiv) {
if (DSOEquiv)
  *DSOEquiv = nullptr;

// Trivial case, constant is the global.
if ((GV = dyn_cast<GlobalValue>(C))) {
  unsigned BitWidth = DL.getIndexTypeSizeInBits(GV->getType());
  Offset = APInt(BitWidth, 0);
  return true;
}

if (auto *FoundDSOEquiv = dyn_cast<DSOLocalEquivalent>(C)) {
  if (DSOEquiv)
    *DSOEquiv = FoundDSOEquiv;
  GV = FoundDSOEquiv->getGlobalValue();
  unsigned BitWidth = DL.getIndexTypeSizeInBits(GV->getType());
  Offset = APInt(BitWidth, 0);
  return true;
}

// Otherwise, if this isn't a constant expr, bail out.
auto *CE = dyn_cast<ConstantExpr>(C);
if (!CE) return false;

// Look through ptr->int and ptr->ptr casts.
if (CE->getOpcode() == Instruction::PtrToInt ||
    CE->getOpcode() == Instruction::BitCast)
  return IsConstantOffsetFromGlobal(CE->getOperand(0), GV, Offset, DL,
                                    DSOEquiv);

// i32* getelementptr ([5 x i32]* @a, i32 0, i32 5)
auto *GEP = dyn_cast<GEPOperator>(CE);
if (!GEP)
  return false;

unsigned BitWidth = DL.getIndexTypeSizeInBits(GEP->getType());
APInt TmpOffset(BitWidth, 0);

// If the base isn't a global+constant, we aren't either.
if (!IsConstantOffsetFromGlobal(CE->getOperand(0), GV, TmpOffset, DL,
                                DSOEquiv))
  return false;

// Otherwise, add any offset that our operands provide.
if (!GEP->accumulateConstantOffset(DL, TmpOffset))
  return false;

Offset = TmpOffset;
return true;
354}

356Constant *llvm::ConstantFoldLoadThroughBitcast(Constant *C, Type *DestTy,
                                       const DataLayout &DL) {
do {
  Type *SrcTy = C->getType();
  uint64_t DestSize = DL.getTypeSizeInBits(DestTy);
  uint64_t SrcSize = DL.getTypeSizeInBits(SrcTy);
  if (SrcSize < DestSize)
    return nullptr;

  // Catch the obvious splat cases (since all-zeros can coerce non-integral
  // pointers legally).
  if (C->isNullValue() && !DestTy->isX86_MMXTy() && !DestTy->isX86_AMXTy())
    return Constant::getNullValue(DestTy);
  if (C->isAllOnesValue() &&
      (DestTy->isIntegerTy() || DestTy->isFloatingPointTy() ||
       DestTy->isVectorTy()) &&
      !DestTy->isX86_AMXTy() && !DestTy->isX86_MMXTy() &&
      !DestTy->isPtrOrPtrVectorTy())
    // Get ones when the input is trivial, but
    // only for supported types inside getAllOnesValue.
    return Constant::getAllOnesValue(DestTy);

  // If the type sizes are the same and a cast is legal, just directly
  // cast the constant.
  // But be careful not to coerce non-integral pointers illegally.
  if (SrcSize == DestSize &&
      DL.isNonIntegralPointerType(SrcTy->getScalarType()) ==
          DL.isNonIntegralPointerType(DestTy->getScalarType())) {
    Instruction::CastOps Cast = Instruction::BitCast;
    // If we are going from a pointer to int or vice versa, we spell the cast
    // differently.
    if (SrcTy->isIntegerTy() && DestTy->isPointerTy())
      Cast = Instruction::IntToPtr;
    else if (SrcTy->isPointerTy() && DestTy->isIntegerTy())
      Cast = Instruction::PtrToInt;

    if (CastInst::castIsValid(Cast, C, DestTy))
      return ConstantExpr::getCast(Cast, C, DestTy);
  }

  // If this isn't an aggregate type, there is nothing we can do to drill down
  // and find a bitcastable constant.
  if (!SrcTy->isAggregateType() && !SrcTy->isVectorTy())
    return nullptr;

  // We're simulating a load through a pointer that was bitcast to point to
  // a different type, so we can try to walk down through the initial
  // elements of an aggregate to see if some part of the aggregate is
  // castable to implement the "load" semantic model.
  if (SrcTy->isStructTy()) {
    // Struct types might have leading zero-length elements like [0 x i32],
    // which are certainly not what we are looking for, so skip them.
    unsigned Elem = 0;
    Constant *ElemC;
    do {
      ElemC = C->getAggregateElement(Elem++);
    } while (ElemC && DL.getTypeSizeInBits(ElemC->getType()).isZero());
    C = ElemC;
  } else {
    C = C->getAggregateElement(0u);
  }
} while (C);

return nullptr;
420}

422namespace {

424/// Recursive helper to read bits out of global. C is the constant being copied
425/// out of. ByteOffset is an offset into C. CurPtr is the pointer to copy
426/// results into and BytesLeft is the number of bytes left in
427/// the CurPtr buffer. DL is the DataLayout.
428bool ReadDataFromGlobal(Constant *C, uint64_t ByteOffset, unsigned char *CurPtr,
                      unsigned BytesLeft, const DataLayout &DL) {
assert(ByteOffset <= DL.getTypeAllocSize(C->getType()) &&(static_cast <bool> (ByteOffset <= DL.getTypeAllocSize
(C->getType()) && "Out of range access") ? void (0
) : __assert_fail ("ByteOffset <= DL.getTypeAllocSize(C->getType()) && \"Out of range access\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 431, __extension__ __PRETTY_FUNCTION__))
       "Out of range access")(static_cast <bool> (ByteOffset <= DL.getTypeAllocSize
(C->getType()) && "Out of range access") ? void (0
) : __assert_fail ("ByteOffset <= DL.getTypeAllocSize(C->getType()) && \"Out of range access\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 431, __extension__ __PRETTY_FUNCTION__));

// If this element is zero or undefined, we can just return since *CurPtr is
// zero initialized.
if (isa<ConstantAggregateZero>(C) || isa<UndefValue>(C))
  return true;

if (auto *CI = dyn_cast<ConstantInt>(C)) {
  if (CI->getBitWidth() > 64 ||
      (CI->getBitWidth() & 7) != 0)
    return false;

  uint64_t Val = CI->getZExtValue();
  unsigned IntBytes = unsigned(CI->getBitWidth()/8);

  for (unsigned i = 0; i != BytesLeft && ByteOffset != IntBytes; ++i) {
    int n = ByteOffset;
    if (!DL.isLittleEndian())
      n = IntBytes - n - 1;
    CurPtr[i] = (unsigned char)(Val >> (n * 8));
    ++ByteOffset;
  }
  return true;
}

if (auto *CFP = dyn_cast<ConstantFP>(C)) {
  if (CFP->getType()->isDoubleTy()) {
    C = FoldBitCast(C, Type::getInt64Ty(C->getContext()), DL);
    return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
  }
  if (CFP->getType()->isFloatTy()){
    C = FoldBitCast(C, Type::getInt32Ty(C->getContext()), DL);
    return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
  }
  if (CFP->getType()->isHalfTy()){
    C = FoldBitCast(C, Type::getInt16Ty(C->getContext()), DL);
    return ReadDataFromGlobal(C, ByteOffset, CurPtr, BytesLeft, DL);
  }
  return false;
}

if (auto *CS = dyn_cast<ConstantStruct>(C)) {
  const StructLayout *SL = DL.getStructLayout(CS->getType());
  unsigned Index = SL->getElementContainingOffset(ByteOffset);
  uint64_t CurEltOffset = SL->getElementOffset(Index);
  ByteOffset -= CurEltOffset;

  while (true) {
    // If the element access is to the element itself and not to tail padding,
    // read the bytes from the element.
    uint64_t EltSize = DL.getTypeAllocSize(CS->getOperand(Index)->getType());

    if (ByteOffset < EltSize &&
        !ReadDataFromGlobal(CS->getOperand(Index), ByteOffset, CurPtr,
                            BytesLeft, DL))
      return false;

    ++Index;

    // Check to see if we read from the last struct element, if so we're done.
    if (Index == CS->getType()->getNumElements())
      return true;

    // If we read all of the bytes we needed from this element we're done.
    uint64_t NextEltOffset = SL->getElementOffset(Index);

    if (BytesLeft <= NextEltOffset - CurEltOffset - ByteOffset)
      return true;

    // Move to the next element of the struct.
    CurPtr += NextEltOffset - CurEltOffset - ByteOffset;
    BytesLeft -= NextEltOffset - CurEltOffset - ByteOffset;
    ByteOffset = 0;
    CurEltOffset = NextEltOffset;
  }
  // not reached.
}

if (isa<ConstantArray>(C) || isa<ConstantVector>(C) ||
    isa<ConstantDataSequential>(C)) {
  uint64_t NumElts;
  Type *EltTy;
  if (auto *AT = dyn_cast<ArrayType>(C->getType())) {
    NumElts = AT->getNumElements();
    EltTy = AT->getElementType();
  } else {
    NumElts = cast<FixedVectorType>(C->getType())->getNumElements();
    EltTy = cast<FixedVectorType>(C->getType())->getElementType();
  }
  uint64_t EltSize = DL.getTypeAllocSize(EltTy);
  uint64_t Index = ByteOffset / EltSize;
  uint64_t Offset = ByteOffset - Index * EltSize;

  for (; Index != NumElts; ++Index) {
    if (!ReadDataFromGlobal(C->getAggregateElement(Index), Offset, CurPtr,
                            BytesLeft, DL))
      return false;

    uint64_t BytesWritten = EltSize - Offset;
    assert(BytesWritten <= EltSize && "Not indexing into this element?")(static_cast <bool> (BytesWritten <= EltSize &&
 "Not indexing into this element?") ? void (0) : __assert_fail
 ("BytesWritten <= EltSize && \"Not indexing into this element?\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 530, __extension__ __PRETTY_FUNCTION__));
    if (BytesWritten >= BytesLeft)
      return true;

    Offset = 0;
    BytesLeft -= BytesWritten;
    CurPtr += BytesWritten;
  }
  return true;
}

if (auto *CE = dyn_cast<ConstantExpr>(C)) {
  if (CE->getOpcode() == Instruction::IntToPtr &&
      CE->getOperand(0)->getType() == DL.getIntPtrType(CE->getType())) {
    return ReadDataFromGlobal(CE->getOperand(0), ByteOffset, CurPtr,
                              BytesLeft, DL);
  }
}

// Otherwise, unknown initializer type.
return false;
551}

553Constant *FoldReinterpretLoadFromConstPtr(Constant *C, Type *LoadTy,
                                        const DataLayout &DL) {
// Bail out early. Not expect to load from scalable global variable.
if (isa<ScalableVectorType>(LoadTy))
  return nullptr;

auto *PTy = cast<PointerType>(C->getType());
auto *IntType = dyn_cast<IntegerType>(LoadTy);

// If this isn't an integer load we can't fold it directly.
if (!IntType) {
  unsigned AS = PTy->getAddressSpace();

  // If this is a float/double load, we can try folding it as an int32/64 load
  // and then bitcast the result.  This can be useful for union cases.  Note
  // that address spaces don't matter here since we're not going to result in
  // an actual new load.
  Type *MapTy;
  if (LoadTy->isHalfTy())
    MapTy = Type::getInt16Ty(C->getContext());
  else if (LoadTy->isFloatTy())
    MapTy = Type::getInt32Ty(C->getContext());
  else if (LoadTy->isDoubleTy())
    MapTy = Type::getInt64Ty(C->getContext());
  else if (LoadTy->isVectorTy()) {
    MapTy = PointerType::getIntNTy(
        C->getContext(), DL.getTypeSizeInBits(LoadTy).getFixedSize());
  } else
    return nullptr;

  C = FoldBitCast(C, MapTy->getPointerTo(AS), DL);
  if (Constant *Res = FoldReinterpretLoadFromConstPtr(C, MapTy, DL)) {
    if (Res->isNullValue() && !LoadTy->isX86_MMXTy() &&
        !LoadTy->isX86_AMXTy())
      // Materializing a zero can be done trivially without a bitcast
      return Constant::getNullValue(LoadTy);
    Type *CastTy = LoadTy->isPtrOrPtrVectorTy() ? DL.getIntPtrType(LoadTy) : LoadTy;
    Res = FoldBitCast(Res, CastTy, DL);
    if (LoadTy->isPtrOrPtrVectorTy()) {
      // For vector of pointer, we needed to first convert to a vector of integer, then do vector inttoptr
      if (Res->isNullValue() && !LoadTy->isX86_MMXTy() &&
          !LoadTy->isX86_AMXTy())
        return Constant::getNullValue(LoadTy);
      if (DL.isNonIntegralPointerType(LoadTy->getScalarType()))
        // Be careful not to replace a load of an addrspace value with an inttoptr here
        return nullptr;
      Res = ConstantExpr::getCast(Instruction::IntToPtr, Res, LoadTy);
    }
    return Res;
  }
  return nullptr;
}

unsigned BytesLoaded = (IntType->getBitWidth() + 7) / 8;
if (BytesLoaded > 32 || BytesLoaded == 0)
  return nullptr;

GlobalValue *GVal;
APInt OffsetAI;
if (!IsConstantOffsetFromGlobal(C, GVal, OffsetAI, DL))
  return nullptr;

auto *GV = dyn_cast<GlobalVariable>(GVal);
if (!GV || !GV->isConstant() || !GV->hasDefinitiveInitializer() ||
    !GV->getInitializer()->getType()->isSized())
  return nullptr;

int64_t Offset = OffsetAI.getSExtValue();
int64_t InitializerSize =
    DL.getTypeAllocSize(GV->getInitializer()->getType()).getFixedSize();

// If we're not accessing anything in this constant, the result is undefined.
if (Offset <= -1 * static_cast<int64_t>(BytesLoaded))
  return UndefValue::get(IntType);

// If we're not accessing anything in this constant, the result is undefined.
if (Offset >= InitializerSize)
  return UndefValue::get(IntType);

unsigned char RawBytes[32] = {0};
unsigned char *CurPtr = RawBytes;
unsigned BytesLeft = BytesLoaded;

// If we're loading off the beginning of the global, some bytes may be valid.
if (Offset < 0) {
  CurPtr += -Offset;
  BytesLeft += Offset;
  Offset = 0;
}

if (!ReadDataFromGlobal(GV->getInitializer(), Offset, CurPtr, BytesLeft, DL))
  return nullptr;

APInt ResultVal = APInt(IntType->getBitWidth(), 0);
if (DL.isLittleEndian()) {
  ResultVal = RawBytes[BytesLoaded - 1];
  for (unsigned i = 1; i != BytesLoaded; ++i) {
    ResultVal <<= 8;
    ResultVal |= RawBytes[BytesLoaded - 1 - i];
  }
} else {
  ResultVal = RawBytes[0];
  for (unsigned i = 1; i != BytesLoaded; ++i) {
    ResultVal <<= 8;
    ResultVal |= RawBytes[i];
  }
}

return ConstantInt::get(IntType->getContext(), ResultVal);
662}

664Constant *ConstantFoldLoadThroughBitcastExpr(ConstantExpr *CE, Type *DestTy,
                                           const DataLayout &DL) {
auto *SrcPtr = CE->getOperand(0);
if (!SrcPtr->getType()->isPointerTy())
  return nullptr;

return ConstantFoldLoadFromConstPtr(SrcPtr, DestTy, DL);
671}

673} // end anonymous namespace

675Constant *llvm::ConstantFoldLoadFromConstPtr(Constant *C, Type *Ty,
                                           const DataLayout &DL) {
// First, try the easy cases:
if (auto *GV = dyn_cast<GlobalVariable>(C))
  if (GV->isConstant() && GV->hasDefinitiveInitializer())
    return ConstantFoldLoadThroughBitcast(GV->getInitializer(), Ty, DL);

if (auto *GA = dyn_cast<GlobalAlias>(C))
  if (GA->getAliasee() && !GA->isInterposable())
    return ConstantFoldLoadFromConstPtr(GA->getAliasee(), Ty, DL);

// If the loaded value isn't a constant expr, we can't handle it.
auto *CE = dyn_cast<ConstantExpr>(C);
if (!CE)
  return nullptr;

if (CE->getOpcode() == Instruction::GetElementPtr) {
  if (auto *GV = dyn_cast<GlobalVariable>(CE->getOperand(0))) {
    if (GV->isConstant() && GV->hasDefinitiveInitializer()) {
      if (Constant *V = ConstantFoldLoadThroughGEPConstantExpr(
              GV->getInitializer(), CE, Ty, DL))
        return V;
    }
  } else {
    // Try to simplify GEP if the pointer operand wasn't a GlobalVariable.
    // SymbolicallyEvaluateGEP() with `ForLoadOperand = true` can potentially
    // simplify the GEP more than it normally would have been, but should only
    // be used for const folding loads.
    SmallVector<Constant *> Ops;
    for (unsigned I = 0, E = CE->getNumOperands(); I != E; ++I)
      Ops.push_back(cast<Constant>(CE->getOperand(I)));
    if (auto *Simplified = dyn_cast_or_null<ConstantExpr>(
            SymbolicallyEvaluateGEP(cast<GEPOperator>(CE), Ops, DL, nullptr,
                                    /*ForLoadOperand*/ true))) {
      // If the symbolically evaluated GEP is another GEP, we can only const
      // fold it if the resulting pointer operand is a GlobalValue. Otherwise
      // there is nothing else to simplify since the GEP is already in the
      // most simplified form.
      if (isa<GEPOperator>(Simplified)) {
        if (auto *GV = dyn_cast<GlobalVariable>(Simplified->getOperand(0))) {
          if (GV->isConstant() && GV->hasDefinitiveInitializer()) {
            if (Constant *V = ConstantFoldLoadThroughGEPConstantExpr(
                    GV->getInitializer(), Simplified, Ty, DL))
              return V;
          }
        }
      } else {
        return ConstantFoldLoadFromConstPtr(Simplified, Ty, DL);
      }
    }
  }
}

if (CE->getOpcode() == Instruction::BitCast)
  if (Constant *LoadedC = ConstantFoldLoadThroughBitcastExpr(CE, Ty, DL))
    return LoadedC;

// Instead of loading constant c string, use corresponding integer value
// directly if string length is small enough.
StringRef Str;
if (getConstantStringInfo(CE, Str) && !Str.empty()) {
  size_t StrLen = Str.size();
  unsigned NumBits = Ty->getPrimitiveSizeInBits();
  // Replace load with immediate integer if the result is an integer or fp
  // value.
  if ((NumBits >> 3) == StrLen + 1 && (NumBits & 7) == 0 &&
      (isa<IntegerType>(Ty) || Ty->isFloatingPointTy())) {
    APInt StrVal(NumBits, 0);
    APInt SingleChar(NumBits, 0);
    if (DL.isLittleEndian()) {
      for (unsigned char C : reverse(Str.bytes())) {
        SingleChar = static_cast<uint64_t>(C);
        StrVal = (StrVal << 8) | SingleChar;
      }
    } else {
      for (unsigned char C : Str.bytes()) {
        SingleChar = static_cast<uint64_t>(C);
        StrVal = (StrVal << 8) | SingleChar;
      }
      // Append NULL at the end.
      SingleChar = 0;
      StrVal = (StrVal << 8) | SingleChar;
    }

    Constant *Res = ConstantInt::get(CE->getContext(), StrVal);
    if (Ty->isFloatingPointTy())
      Res = ConstantExpr::getBitCast(Res, Ty);
    return Res;
  }
}

// If this load comes from anywhere in a constant global, and if the global
// is all undef or zero, we know what it loads.
if (auto *GV = dyn_cast<GlobalVariable>(getUnderlyingObject(CE))) {
  if (GV->isConstant() && GV->hasDefinitiveInitializer()) {
    if (GV->getInitializer()->isNullValue())
      return Constant::getNullValue(Ty);
    if (isa<UndefValue>(GV->getInitializer()))
      return UndefValue::get(Ty);
  }
}

// Try hard to fold loads from bitcasted strange and non-type-safe things.
return FoldReinterpretLoadFromConstPtr(CE, Ty, DL);
779}

781namespace {

783/// One of Op0/Op1 is a constant expression.
784/// Attempt to symbolically evaluate the result of a binary operator merging
785/// these together.  If target data info is available, it is provided as DL,
786/// otherwise DL is null.
787Constant *SymbolicallyEvaluateBinop(unsigned Opc, Constant *Op0, Constant *Op1,
                                  const DataLayout &DL) {
// SROA

// Fold (and 0xffffffff00000000, (shl x, 32)) -> shl.
// Fold (lshr (or X, Y), 32) -> (lshr [X/Y], 32) if one doesn't contribute
// bits.

if (Opc == Instruction::And) {
  KnownBits Known0 = computeKnownBits(Op0, DL);
  KnownBits Known1 = computeKnownBits(Op1, DL);
  if ((Known1.One | Known0.Zero).isAllOnesValue()) {
    // All the bits of Op0 that the 'and' could be masking are already zero.
    return Op0;
  }
  if ((Known0.One | Known1.Zero).isAllOnesValue()) {
    // All the bits of Op1 that the 'and' could be masking are already zero.
    return Op1;
  }

  Known0 &= Known1;
  if (Known0.isConstant())
    return ConstantInt::get(Op0->getType(), Known0.getConstant());
}

// If the constant expr is something like &A[123] - &A[4].f, fold this into a
// constant.  This happens frequently when iterating over a global array.
if (Opc == Instruction::Sub) {
  GlobalValue *GV1, *GV2;
  APInt Offs1, Offs2;

  if (IsConstantOffsetFromGlobal(Op0, GV1, Offs1, DL))
    if (IsConstantOffsetFromGlobal(Op1, GV2, Offs2, DL) && GV1 == GV2) {
      unsigned OpSize = DL.getTypeSizeInBits(Op0->getType());

      // (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow.
      // PtrToInt may change the bitwidth so we have convert to the right size
      // first.
      return ConstantInt::get(Op0->getType(), Offs1.zextOrTrunc(OpSize) -
                                              Offs2.zextOrTrunc(OpSize));
    }
}

return nullptr;
831}

833/// If array indices are not pointer-sized integers, explicitly cast them so
834/// that they aren't implicitly casted by the getelementptr.
835Constant *CastGEPIndices(Type *SrcElemTy, ArrayRef<Constant *> Ops,
                       Type *ResultTy, Optional<unsigned> InRangeIndex,
                       const DataLayout &DL, const TargetLibraryInfo *TLI) {
Type *IntIdxTy = DL.getIndexType(ResultTy);
Type *IntIdxScalarTy = IntIdxTy->getScalarType();

bool Any = false;
SmallVector<Constant*, 32> NewIdxs;
for (unsigned i = 1, e = Ops.size(); i != e; ++i) {
  if ((i == 1 ||
       !isa<StructType>(GetElementPtrInst::getIndexedType(
           SrcElemTy, Ops.slice(1, i - 1)))) &&
      Ops[i]->getType()->getScalarType() != IntIdxScalarTy) {
    Any = true;
    Type *NewType = Ops[i]->getType()->isVectorTy()
                        ? IntIdxTy
                        : IntIdxScalarTy;
    NewIdxs.push_back(ConstantExpr::getCast(CastInst::getCastOpcode(Ops[i],
                                                                    true,
                                                                    NewType,
                                                                    true),
                                            Ops[i], NewType));
  } else
    NewIdxs.push_back(Ops[i]);
}

if (!Any)
  return nullptr;

Constant *C = ConstantExpr::getGetElementPtr(
    SrcElemTy, Ops[0], NewIdxs, /*InBounds=*/false, InRangeIndex);
return ConstantFoldConstant(C, DL, TLI);
867}

869/// Strip the pointer casts, but preserve the address space information.
870Constant *StripPtrCastKeepAS(Constant *Ptr, bool ForLoadOperand) {
assert(Ptr->getType()->isPointerTy() && "Not a pointer type")(static_cast <bool> (Ptr->getType()->isPointerTy(
) && "Not a pointer type") ? void (0) : __assert_fail
 ("Ptr->getType()->isPointerTy() && \"Not a pointer type\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 871, __extension__ __PRETTY_FUNCTION__));
auto *OldPtrTy = cast<PointerType>(Ptr->getType());
Ptr = cast<Constant>(Ptr->stripPointerCasts());
if (ForLoadOperand) {
  while (isa<GlobalAlias>(Ptr) && !cast<GlobalAlias>(Ptr)->isInterposable() &&
         !cast<GlobalAlias>(Ptr)->getBaseObject()->isInterposable()) {
    Ptr = cast<GlobalAlias>(Ptr)->getAliasee();
  }
}

auto *NewPtrTy = cast<PointerType>(Ptr->getType());

// Preserve the address space number of the pointer.
if (NewPtrTy->getAddressSpace() != OldPtrTy->getAddressSpace()) {
  Ptr = ConstantExpr::getPointerCast(
      Ptr, PointerType::getWithSamePointeeType(NewPtrTy,
                                               OldPtrTy->getAddressSpace()));
}
return Ptr;
890}

892/// If we can symbolically evaluate the GEP constant expression, do so.
893Constant *SymbolicallyEvaluateGEP(const GEPOperator *GEP,
                                ArrayRef<Constant *> Ops,
                                const DataLayout &DL,
                                const TargetLibraryInfo *TLI,
                                bool ForLoadOperand) {
const GEPOperator *InnermostGEP = GEP;
bool InBounds = GEP->isInBounds();

Type *SrcElemTy = GEP->getSourceElementType();
Type *ResElemTy = GEP->getResultElementType();
Type *ResTy = GEP->getType();
if (!SrcElemTy->isSized() || isa<ScalableVectorType>(SrcElemTy))
  return nullptr;

if (Constant *C = CastGEPIndices(SrcElemTy, Ops, ResTy,
                                 GEP->getInRangeIndex(), DL, TLI))
  return C;

Constant *Ptr = Ops[0];
if (!Ptr->getType()->isPointerTy())
  return nullptr;

Type *IntIdxTy = DL.getIndexType(Ptr->getType());

// If this is "gep i8* Ptr, (sub 0, V)", fold this as:
// "inttoptr (sub (ptrtoint Ptr), V)"
if (Ops.size() == 2 && ResElemTy->isIntegerTy(8)) {
  auto *CE = dyn_cast<ConstantExpr>(Ops[1]);
  assert((!CE || CE->getType() == IntIdxTy) &&(static_cast <bool> ((!CE || CE->getType() == IntIdxTy
) && "CastGEPIndices didn't canonicalize index types!"
) ? void (0) : __assert_fail ("(!CE || CE->getType() == IntIdxTy) && \"CastGEPIndices didn't canonicalize index types!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 922, __extension__ __PRETTY_FUNCTION__))
         "CastGEPIndices didn't canonicalize index types!")(static_cast <bool> ((!CE || CE->getType() == IntIdxTy
) && "CastGEPIndices didn't canonicalize index types!"
) ? void (0) : __assert_fail ("(!CE || CE->getType() == IntIdxTy) && \"CastGEPIndices didn't canonicalize index types!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 922, __extension__ __PRETTY_FUNCTION__));
  if (CE && CE->getOpcode() == Instruction::Sub &&
      CE->getOperand(0)->isNullValue()) {
    Constant *Res = ConstantExpr::getPtrToInt(Ptr, CE->getType());
    Res = ConstantExpr::getSub(Res, CE->getOperand(1));
    Res = ConstantExpr::getIntToPtr(Res, ResTy);
    return ConstantFoldConstant(Res, DL, TLI);
  }
}

for (unsigned i = 1, e = Ops.size(); i != e; ++i)
  if (!isa<ConstantInt>(Ops[i]))
    return nullptr;

unsigned BitWidth = DL.getTypeSizeInBits(IntIdxTy);
APInt Offset =
    APInt(BitWidth,
          DL.getIndexedOffsetInType(
              SrcElemTy,
              makeArrayRef((Value * const *)Ops.data() + 1, Ops.size() - 1)));
Ptr = StripPtrCastKeepAS(Ptr, ForLoadOperand);

// If this is a GEP of a GEP, fold it all into a single GEP.
while (auto *GEP = dyn_cast<GEPOperator>(Ptr)) {
  InnermostGEP = GEP;
  InBounds &= GEP->isInBounds();

  SmallVector<Value *, 4> NestedOps(GEP->op_begin() + 1, GEP->op_end());

  // Do not try the incorporate the sub-GEP if some index is not a number.
  bool AllConstantInt = true;
  for (Value *NestedOp : NestedOps)
    if (!isa<ConstantInt>(NestedOp)) {
      AllConstantInt = false;
      break;
    }
  if (!AllConstantInt)
    break;

  Ptr = cast<Constant>(GEP->getOperand(0));
  SrcElemTy = GEP->getSourceElementType();
  Offset += APInt(BitWidth, DL.getIndexedOffsetInType(SrcElemTy, NestedOps));
  Ptr = StripPtrCastKeepAS(Ptr, ForLoadOperand);
}

// If the base value for this address is a literal integer value, fold the
// getelementptr to the resulting integer value casted to the pointer type.
APInt BasePtr(BitWidth, 0);
if (auto *CE = dyn_cast<ConstantExpr>(Ptr)) {
  if (CE->getOpcode() == Instruction::IntToPtr) {
    if (auto *Base = dyn_cast<ConstantInt>(CE->getOperand(0)))
      BasePtr = Base->getValue().zextOrTrunc(BitWidth);
  }
}

auto *PTy = cast<PointerType>(Ptr->getType());
if ((Ptr->isNullValue() || BasePtr != 0) &&
    !DL.isNonIntegralPointerType(PTy)) {
  Constant *C = ConstantInt::get(Ptr->getContext(), Offset + BasePtr);
  return ConstantExpr::getIntToPtr(C, ResTy);
}

// Otherwise form a regular getelementptr. Recompute the indices so that
// we eliminate over-indexing of the notional static type array bounds.
// This makes it easy to determine if the getelementptr is "inbounds".
// Also, this helps GlobalOpt do SROA on GlobalVariables.
SmallVector<Constant *, 32> NewIdxs;
Type *Ty = PTy;
SrcElemTy = PTy->getElementType();

do {
  if (!Ty->isStructTy()) {
    if (Ty->isPointerTy()) {
      // The only pointer indexing we'll do is on the first index of the GEP.
      if (!NewIdxs.empty())
        break;

      Ty = SrcElemTy;

      // Only handle pointers to sized types, not pointers to functions.
      if (!Ty->isSized())
        return nullptr;
    } else {
      Type *NextTy = GetElementPtrInst::getTypeAtIndex(Ty, (uint64_t)0);
      if (!NextTy)
        break;
      Ty = NextTy;
    }

    // Determine which element of the array the offset points into.
    APInt ElemSize(BitWidth, DL.getTypeAllocSize(Ty));
    if (ElemSize == 0) {
      // The element size is 0. This may be [0 x Ty]*, so just use a zero
      // index for this level and proceed to the next level to see if it can
      // accommodate the offset.
      NewIdxs.push_back(ConstantInt::get(IntIdxTy, 0));
    } else {
      // The element size is non-zero divide the offset by the element
      // size (rounding down), to compute the index at this level.
      bool Overflow;
      APInt NewIdx = Offset.sdiv_ov(ElemSize, Overflow);
      if (Overflow)
        break;
      Offset -= NewIdx * ElemSize;
      NewIdxs.push_back(ConstantInt::get(IntIdxTy, NewIdx));
    }
  } else {
    auto *STy = cast<StructType>(Ty);
    // If we end up with an offset that isn't valid for this struct type, we
    // can't re-form this GEP in a regular form, so bail out. The pointer
    // operand likely went through casts that are necessary to make the GEP
    // sensible.
    const StructLayout &SL = *DL.getStructLayout(STy);
    if (Offset.isNegative() || Offset.uge(SL.getSizeInBytes()))
      break;

    // Determine which field of the struct the offset points into. The
    // getZExtValue is fine as we've already ensured that the offset is
    // within the range representable by the StructLayout API.
    unsigned ElIdx = SL.getElementContainingOffset(Offset.getZExtValue());
    NewIdxs.push_back(ConstantInt::get(Type::getInt32Ty(Ty->getContext()),
                                       ElIdx));
    Offset -= APInt(BitWidth, SL.getElementOffset(ElIdx));
    Ty = STy->getTypeAtIndex(ElIdx);
  }
} while (Ty != ResElemTy);

// If we haven't used up the entire offset by descending the static
// type, then the offset is pointing into the middle of an indivisible
// member, so we can't simplify it.
if (Offset != 0)
  return nullptr;

// Preserve the inrange index from the innermost GEP if possible. We must
// have calculated the same indices up to and including the inrange index.
Optional<unsigned> InRangeIndex;
if (Optional<unsigned> LastIRIndex = InnermostGEP->getInRangeIndex())
  if (SrcElemTy == InnermostGEP->getSourceElementType() &&
      NewIdxs.size() > *LastIRIndex) {
    InRangeIndex = LastIRIndex;
    for (unsigned I = 0; I <= *LastIRIndex; ++I)
      if (NewIdxs[I] != InnermostGEP->getOperand(I + 1))
        return nullptr;
  }

// Create a GEP.
Constant *C = ConstantExpr::getGetElementPtr(SrcElemTy, Ptr, NewIdxs,
                                             InBounds, InRangeIndex);
assert(C->getType()->getPointerElementType() == Ty &&(static_cast <bool> (C->getType()->getPointerElementType
() == Ty && "Computed GetElementPtr has unexpected type!"
) ? void (0) : __assert_fail ("C->getType()->getPointerElementType() == Ty && \"Computed GetElementPtr has unexpected type!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1071, __extension__ __PRETTY_FUNCTION__))
       "Computed GetElementPtr has unexpected type!")(static_cast <bool> (C->getType()->getPointerElementType
() == Ty && "Computed GetElementPtr has unexpected type!"
) ? void (0) : __assert_fail ("C->getType()->getPointerElementType() == Ty && \"Computed GetElementPtr has unexpected type!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1071, __extension__ __PRETTY_FUNCTION__));

// If we ended up indexing a member with a type that doesn't match
// the type of what the original indices indexed, add a cast.
if (C->getType() != ResTy)
  C = FoldBitCast(C, ResTy, DL);

return C;
1079}

1081/// Attempt to constant fold an instruction with the
1082/// specified opcode and operands.  If successful, the constant result is
1083/// returned, if not, null is returned.  Note that this function can fail when
1084/// attempting to fold instructions like loads and stores, which have no
1085/// constant expression form.
1086Constant *ConstantFoldInstOperandsImpl(const Value *InstOrCE, unsigned Opcode,
                                     ArrayRef<Constant *> Ops,
                                     const DataLayout &DL,
                                     const TargetLibraryInfo *TLI) {
Type *DestTy = InstOrCE->getType();

if (Instruction::isUnaryOp(Opcode))
  return ConstantFoldUnaryOpOperand(Opcode, Ops[0], DL);

if (Instruction::isBinaryOp(Opcode))
  return ConstantFoldBinaryOpOperands(Opcode, Ops[0], Ops[1], DL);

if (Instruction::isCast(Opcode))
  return ConstantFoldCastOperand(Opcode, Ops[0], DestTy, DL);

if (auto *GEP = dyn_cast<GEPOperator>(InstOrCE)) {
  if (Constant *C = SymbolicallyEvaluateGEP(GEP, Ops, DL, TLI,
                                            /*ForLoadOperand*/ false))
    return C;

  return ConstantExpr::getGetElementPtr(GEP->getSourceElementType(), Ops[0],
                                        Ops.slice(1), GEP->isInBounds(),
                                        GEP->getInRangeIndex());
}

if (auto *CE = dyn_cast<ConstantExpr>(InstOrCE))
  return CE->getWithOperands(Ops);

switch (Opcode) {
default: return nullptr;
case Instruction::ICmp:
case Instruction::FCmp: llvm_unreachable("Invalid for compares")::llvm::llvm_unreachable_internal("Invalid for compares", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1117);
case Instruction::Freeze:
  return isGuaranteedNotToBeUndefOrPoison(Ops[0]) ? Ops[0] : nullptr;
case Instruction::Call:
  if (auto *F = dyn_cast<Function>(Ops.back())) {
    const auto *Call = cast<CallBase>(InstOrCE);
    if (canConstantFoldCallTo(Call, F))
      return ConstantFoldCall(Call, F, Ops.slice(0, Ops.size() - 1), TLI);
  }
  return nullptr;
case Instruction::Select:
  return ConstantExpr::getSelect(Ops[0], Ops[1], Ops[2]);
case Instruction::ExtractElement:
  return ConstantExpr::getExtractElement(Ops[0], Ops[1]);
case Instruction::ExtractValue:
  return ConstantExpr::getExtractValue(
      Ops[0], cast<ExtractValueInst>(InstOrCE)->getIndices());
case Instruction::InsertElement:
  return ConstantExpr::getInsertElement(Ops[0], Ops[1], Ops[2]);
case Instruction::ShuffleVector:
  return ConstantExpr::getShuffleVector(
      Ops[0], Ops[1], cast<ShuffleVectorInst>(InstOrCE)->getShuffleMask());
}
1140}

1142} // end anonymous namespace

1144//===----------------------------------------------------------------------===//
1145// Constant Folding public APIs
1146//===----------------------------------------------------------------------===//

1148namespace {

1150Constant *
1151ConstantFoldConstantImpl(const Constant *C, const DataLayout &DL,
                       const TargetLibraryInfo *TLI,
                       SmallDenseMap<Constant *, Constant *> &FoldedOps) {
if (!isa<ConstantVector>(C) && !isa<ConstantExpr>(C))
  return const_cast<Constant *>(C);

SmallVector<Constant *, 8> Ops;
for (const Use &OldU : C->operands()) {
  Constant *OldC = cast<Constant>(&OldU);
  Constant *NewC = OldC;
  // Recursively fold the ConstantExpr's operands. If we have already folded
  // a ConstantExpr, we don't have to process it again.
  if (isa<ConstantVector>(OldC) || isa<ConstantExpr>(OldC)) {
    auto It = FoldedOps.find(OldC);
    if (It == FoldedOps.end()) {
      NewC = ConstantFoldConstantImpl(OldC, DL, TLI, FoldedOps);
      FoldedOps.insert({OldC, NewC});
    } else {
      NewC = It->second;
    }
  }
  Ops.push_back(NewC);
}

if (auto *CE = dyn_cast<ConstantExpr>(C)) {
  if (CE->isCompare())
    return ConstantFoldCompareInstOperands(CE->getPredicate(), Ops[0], Ops[1],
                                           DL, TLI);

  return ConstantFoldInstOperandsImpl(CE, CE->getOpcode(), Ops, DL, TLI);
}

assert(isa<ConstantVector>(C))(static_cast <bool> (isa<ConstantVector>(C)) ? void
 (0) : __assert_fail ("isa<ConstantVector>(C)", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1183, __extension__ __PRETTY_FUNCTION__));
return ConstantVector::get(Ops);
1185}

1187} // end anonymous namespace

1189Constant *llvm::ConstantFoldInstruction(Instruction *I, const DataLayout &DL,
                                      const TargetLibraryInfo *TLI) {
// Handle PHI nodes quickly here...
if (auto *PN = dyn_cast<PHINode>(I)) {
  Constant *CommonValue = nullptr;

  SmallDenseMap<Constant *, Constant *> FoldedOps;
  for (Value *Incoming : PN->incoming_values()) {
    // If the incoming value is undef then skip it.  Note that while we could
    // skip the value if it is equal to the phi node itself we choose not to
    // because that would break the rule that constant folding only applies if
    // all operands are constants.
    if (isa<UndefValue>(Incoming))
      continue;
    // If the incoming value is not a constant, then give up.
    auto *C = dyn_cast<Constant>(Incoming);
    if (!C)
      return nullptr;
    // Fold the PHI's operands.
    C = ConstantFoldConstantImpl(C, DL, TLI, FoldedOps);
    // If the incoming value is a different constant to
    // the one we saw previously, then give up.
    if (CommonValue && C != CommonValue)
      return nullptr;
    CommonValue = C;
  }

  // If we reach here, all incoming values are the same constant or undef.
  return CommonValue ? CommonValue : UndefValue::get(PN->getType());
}

// Scan the operand list, checking to see if they are all constants, if so,
// hand off to ConstantFoldInstOperandsImpl.
if (!all_of(I->operands(), [](Use &U) { return isa<Constant>(U); }))
  return nullptr;

SmallDenseMap<Constant *, Constant *> FoldedOps;
SmallVector<Constant *, 8> Ops;
for (const Use &OpU : I->operands()) {
  auto *Op = cast<Constant>(&OpU);
  // Fold the Instruction's operands.
  Op = ConstantFoldConstantImpl(Op, DL, TLI, FoldedOps);
  Ops.push_back(Op);
}

if (const auto *CI = dyn_cast<CmpInst>(I))
  return ConstantFoldCompareInstOperands(CI->getPredicate(), Ops[0], Ops[1],
                                         DL, TLI);

if (const auto *LI = dyn_cast<LoadInst>(I)) {
  if (LI->isVolatile())
    return nullptr;
  return ConstantFoldLoadFromConstPtr(Ops[0], LI->getType(), DL);
}

if (auto *IVI = dyn_cast<InsertValueInst>(I))
  return ConstantExpr::getInsertValue(Ops[0], Ops[1], IVI->getIndices());

if (auto *EVI = dyn_cast<ExtractValueInst>(I))
  return ConstantExpr::getExtractValue(Ops[0], EVI->getIndices());

return ConstantFoldInstOperands(I, Ops, DL, TLI);
1251}

1253Constant *llvm::ConstantFoldConstant(const Constant *C, const DataLayout &DL,
                                   const TargetLibraryInfo *TLI) {
SmallDenseMap<Constant *, Constant *> FoldedOps;
return ConstantFoldConstantImpl(C, DL, TLI, FoldedOps);
1257}

1259Constant *llvm::ConstantFoldInstOperands(Instruction *I,
                                       ArrayRef<Constant *> Ops,
                                       const DataLayout &DL,
                                       const TargetLibraryInfo *TLI) {
return ConstantFoldInstOperandsImpl(I, I->getOpcode(), Ops, DL, TLI);
1264}

1266Constant *llvm::ConstantFoldCompareInstOperands(unsigned Predicate,
                                              Constant *Ops0, Constant *Ops1,
                                              const DataLayout &DL,
                                              const TargetLibraryInfo *TLI) {
// fold: icmp (inttoptr x), null         -> icmp x, 0
// fold: icmp null, (inttoptr x)         -> icmp 0, x
// fold: icmp (ptrtoint x), 0            -> icmp x, null
// fold: icmp 0, (ptrtoint x)            -> icmp null, x
// fold: icmp (inttoptr x), (inttoptr y) -> icmp trunc/zext x, trunc/zext y
// fold: icmp (ptrtoint x), (ptrtoint y) -> icmp x, y
//
// FIXME: The following comment is out of data and the DataLayout is here now.
// ConstantExpr::getCompare cannot do this, because it doesn't have DL
// around to know if bit truncation is happening.
if (auto *CE0 = dyn_cast<ConstantExpr>(Ops0)) {
  if (Ops1->isNullValue()) {
    if (CE0->getOpcode() == Instruction::IntToPtr) {
      Type *IntPtrTy = DL.getIntPtrType(CE0->getType());
      // Convert the integer value to the right size to ensure we get the
      // proper extension or truncation.
      Constant *C = ConstantExpr::getIntegerCast(CE0->getOperand(0),
                                                 IntPtrTy, false);
      Constant *Null = Constant::getNullValue(C->getType());
      return ConstantFoldCompareInstOperands(Predicate, C, Null, DL, TLI);
    }

    // Only do this transformation if the int is intptrty in size, otherwise
    // there is a truncation or extension that we aren't modeling.
    if (CE0->getOpcode() == Instruction::PtrToInt) {
      Type *IntPtrTy = DL.getIntPtrType(CE0->getOperand(0)->getType());
      if (CE0->getType() == IntPtrTy) {
        Constant *C = CE0->getOperand(0);
        Constant *Null = Constant::getNullValue(C->getType());
        return ConstantFoldCompareInstOperands(Predicate, C, Null, DL, TLI);
      }
    }
  }

  if (auto *CE1 = dyn_cast<ConstantExpr>(Ops1)) {
    if (CE0->getOpcode() == CE1->getOpcode()) {
      if (CE0->getOpcode() == Instruction::IntToPtr) {
        Type *IntPtrTy = DL.getIntPtrType(CE0->getType());

        // Convert the integer value to the right size to ensure we get the
        // proper extension or truncation.
        Constant *C0 = ConstantExpr::getIntegerCast(CE0->getOperand(0),
                                                    IntPtrTy, false);
        Constant *C1 = ConstantExpr::getIntegerCast(CE1->getOperand(0),
                                                    IntPtrTy, false);
        return ConstantFoldCompareInstOperands(Predicate, C0, C1, DL, TLI);
      }

      // Only do this transformation if the int is intptrty in size, otherwise
      // there is a truncation or extension that we aren't modeling.
      if (CE0->getOpcode() == Instruction::PtrToInt) {
        Type *IntPtrTy = DL.getIntPtrType(CE0->getOperand(0)->getType());
        if (CE0->getType() == IntPtrTy &&
            CE0->getOperand(0)->getType() == CE1->getOperand(0)->getType()) {
          return ConstantFoldCompareInstOperands(
              Predicate, CE0->getOperand(0), CE1->getOperand(0), DL, TLI);
        }
      }
    }
  }

  // icmp eq (or x, y), 0 -> (icmp eq x, 0) & (icmp eq y, 0)
  // icmp ne (or x, y), 0 -> (icmp ne x, 0) | (icmp ne y, 0)
  if ((Predicate == ICmpInst::ICMP_EQ || Predicate == ICmpInst::ICMP_NE) &&
      CE0->getOpcode() == Instruction::Or && Ops1->isNullValue()) {
    Constant *LHS = ConstantFoldCompareInstOperands(
        Predicate, CE0->getOperand(0), Ops1, DL, TLI);
    Constant *RHS = ConstantFoldCompareInstOperands(
        Predicate, CE0->getOperand(1), Ops1, DL, TLI);
    unsigned OpC =
      Predicate == ICmpInst::ICMP_EQ ? Instruction::And : Instruction::Or;
    return ConstantFoldBinaryOpOperands(OpC, LHS, RHS, DL);
  }
} else if (isa<ConstantExpr>(Ops1)) {
  // If RHS is a constant expression, but the left side isn't, swap the
  // operands and try again.
  Predicate = ICmpInst::getSwappedPredicate((ICmpInst::Predicate)Predicate);
  return ConstantFoldCompareInstOperands(Predicate, Ops1, Ops0, DL, TLI);
}

return ConstantExpr::getCompare(Predicate, Ops0, Ops1);
1351}

1353Constant *llvm::ConstantFoldUnaryOpOperand(unsigned Opcode, Constant *Op,
                                         const DataLayout &DL) {
assert(Instruction::isUnaryOp(Opcode))(static_cast <bool> (Instruction::isUnaryOp(Opcode)) ? void
 (0) : __assert_fail ("Instruction::isUnaryOp(Opcode)", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1355, __extension__ __PRETTY_FUNCTION__));

return ConstantExpr::get(Opcode, Op);
1358}

1360Constant *llvm::ConstantFoldBinaryOpOperands(unsigned Opcode, Constant *LHS,
                                           Constant *RHS,
                                           const DataLayout &DL) {
assert(Instruction::isBinaryOp(Opcode))(static_cast <bool> (Instruction::isBinaryOp(Opcode)) ?
 void (0) : __assert_fail ("Instruction::isBinaryOp(Opcode)",
 "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1363, __extension__ __PRETTY_FUNCTION__));
if (isa<ConstantExpr>(LHS) || isa<ConstantExpr>(RHS))
  if (Constant *C = SymbolicallyEvaluateBinop(Opcode, LHS, RHS, DL))
    return C;

return ConstantExpr::get(Opcode, LHS, RHS);
1369}

1371Constant *llvm::ConstantFoldCastOperand(unsigned Opcode, Constant *C,
                                      Type *DestTy, const DataLayout &DL) {
assert(Instruction::isCast(Opcode))(static_cast <bool> (Instruction::isCast(Opcode)) ? void
 (0) : __assert_fail ("Instruction::isCast(Opcode)", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1373, __extension__ __PRETTY_FUNCTION__));
switch (Opcode) {
default:
  llvm_unreachable("Missing case")::llvm::llvm_unreachable_internal("Missing case", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1376);
case Instruction::PtrToInt:
  // If the input is a inttoptr, eliminate the pair.  This requires knowing
  // the width of a pointer, so it can't be done in ConstantExpr::getCast.
  if (auto *CE = dyn_cast<ConstantExpr>(C)) {
    if (CE->getOpcode() == Instruction::IntToPtr) {
      Constant *Input = CE->getOperand(0);
      unsigned InWidth = Input->getType()->getScalarSizeInBits();
      unsigned PtrWidth = DL.getPointerTypeSizeInBits(CE->getType());
      if (PtrWidth < InWidth) {
        Constant *Mask =
          ConstantInt::get(CE->getContext(),
                           APInt::getLowBitsSet(InWidth, PtrWidth));
        Input = ConstantExpr::getAnd(Input, Mask);
      }
      // Do a zext or trunc to get to the dest size.
      return ConstantExpr::getIntegerCast(Input, DestTy, false);
    }
  }
  return ConstantExpr::getCast(Opcode, C, DestTy);
case Instruction::IntToPtr:
  // If the input is a ptrtoint, turn the pair into a ptr to ptr bitcast if
  // the int size is >= the ptr size and the address spaces are the same.
  // This requires knowing the width of a pointer, so it can't be done in
  // ConstantExpr::getCast.
  if (auto *CE = dyn_cast<ConstantExpr>(C)) {
    if (CE->getOpcode() == Instruction::PtrToInt) {
      Constant *SrcPtr = CE->getOperand(0);
      unsigned SrcPtrSize = DL.getPointerTypeSizeInBits(SrcPtr->getType());
      unsigned MidIntSize = CE->getType()->getScalarSizeInBits();

      if (MidIntSize >= SrcPtrSize) {
        unsigned SrcAS = SrcPtr->getType()->getPointerAddressSpace();
        if (SrcAS == DestTy->getPointerAddressSpace())
          return FoldBitCast(CE->getOperand(0), DestTy, DL);
      }
    }
  }

  return ConstantExpr::getCast(Opcode, C, DestTy);
case Instruction::Trunc:
case Instruction::ZExt:
case Instruction::SExt:
case Instruction::FPTrunc:
case Instruction::FPExt:
case Instruction::UIToFP:
case Instruction::SIToFP:
case Instruction::FPToUI:
case Instruction::FPToSI:
case Instruction::AddrSpaceCast:
    return ConstantExpr::getCast(Opcode, C, DestTy);
case Instruction::BitCast:
  return FoldBitCast(C, DestTy, DL);
}
1430}

1432Constant *llvm::ConstantFoldLoadThroughGEPConstantExpr(Constant *C,
                                                     ConstantExpr *CE,
                                                     Type *Ty,
                                                     const DataLayout &DL) {
if (!CE->getOperand(1)->isNullValue())
  return nullptr;  // Do not allow stepping over the value!

// Loop over all of the operands, tracking down which value we are
// addressing.
for (unsigned i = 2, e = CE->getNumOperands(); i != e; ++i) {
  C = C->getAggregateElement(CE->getOperand(i));
  if (!C)
    return nullptr;
}
return ConstantFoldLoadThroughBitcast(C, Ty, DL);
1447}

1449Constant *
1450llvm::ConstantFoldLoadThroughGEPIndices(Constant *C,
                                      ArrayRef<Constant *> Indices) {
// Loop over all of the operands, tracking down which value we are
// addressing.
for (Constant *Index : Indices) {
  C = C->getAggregateElement(Index);
  if (!C)
    return nullptr;
}
return C;
1460}

1462//===----------------------------------------------------------------------===//
1463//  Constant Folding for Calls
1464//

1466bool llvm::canConstantFoldCallTo(const CallBase *Call, const Function *F) {
if (Call->isNoBuiltin())
  return false;
switch (F->getIntrinsicID()) {
// Operations that do not operate floating-point numbers and do not depend on
// FP environment can be folded even in strictfp functions.
case Intrinsic::bswap:
case Intrinsic::ctpop:
case Intrinsic::ctlz:
case Intrinsic::cttz:
case Intrinsic::fshl:
case Intrinsic::fshr:
case Intrinsic::launder_invariant_group:
case Intrinsic::strip_invariant_group:
case Intrinsic::masked_load:
case Intrinsic::get_active_lane_mask:
case Intrinsic::abs:
case Intrinsic::smax:
case Intrinsic::smin:
case Intrinsic::umax:
case Intrinsic::umin:
case Intrinsic::sadd_with_overflow:
case Intrinsic::uadd_with_overflow:
case Intrinsic::ssub_with_overflow:
case Intrinsic::usub_with_overflow:
case Intrinsic::smul_with_overflow:
case Intrinsic::umul_with_overflow:
case Intrinsic::sadd_sat:
case Intrinsic::uadd_sat:
case Intrinsic::ssub_sat:
case Intrinsic::usub_sat:
case Intrinsic::smul_fix:
case Intrinsic::smul_fix_sat:
case Intrinsic::bitreverse:
case Intrinsic::is_constant:
case Intrinsic::vector_reduce_add:
case Intrinsic::vector_reduce_mul:
case Intrinsic::vector_reduce_and:
case Intrinsic::vector_reduce_or:
case Intrinsic::vector_reduce_xor:
case Intrinsic::vector_reduce_smin:
case Intrinsic::vector_reduce_smax:
case Intrinsic::vector_reduce_umin:
case Intrinsic::vector_reduce_umax:
// Target intrinsics
case Intrinsic::amdgcn_perm:
case Intrinsic::arm_mve_vctp8:
case Intrinsic::arm_mve_vctp16:
case Intrinsic::arm_mve_vctp32:
case Intrinsic::arm_mve_vctp64:
case Intrinsic::aarch64_sve_convert_from_svbool:
// WebAssembly float semantics are always known
case Intrinsic::wasm_trunc_signed:
case Intrinsic::wasm_trunc_unsigned:
  return true;

// Floating point operations cannot be folded in strictfp functions in
// general case. They can be folded if FP environment is known to compiler.
case Intrinsic::minnum:
case Intrinsic::maxnum:
case Intrinsic::minimum:
case Intrinsic::maximum:
case Intrinsic::log:
case Intrinsic::log2:
case Intrinsic::log10:
case Intrinsic::exp:
case Intrinsic::exp2:
case Intrinsic::sqrt:
case Intrinsic::sin:
case Intrinsic::cos:
case Intrinsic::pow:
case Intrinsic::powi:
case Intrinsic::fma:
case Intrinsic::fmuladd:
case Intrinsic::fptoui_sat:
case Intrinsic::fptosi_sat:
case Intrinsic::convert_from_fp16:
case Intrinsic::convert_to_fp16:
case Intrinsic::amdgcn_cos:
case Intrinsic::amdgcn_cubeid:
case Intrinsic::amdgcn_cubema:
case Intrinsic::amdgcn_cubesc:
case Intrinsic::amdgcn_cubetc:
case Intrinsic::amdgcn_fmul_legacy:
case Intrinsic::amdgcn_fma_legacy:
case Intrinsic::amdgcn_fract:
case Intrinsic::amdgcn_ldexp:
case Intrinsic::amdgcn_sin:
// The intrinsics below depend on rounding mode in MXCSR.
case Intrinsic::x86_sse_cvtss2si:
case Intrinsic::x86_sse_cvtss2si64:
case Intrinsic::x86_sse_cvttss2si:
case Intrinsic::x86_sse_cvttss2si64:
case Intrinsic::x86_sse2_cvtsd2si:
case Intrinsic::x86_sse2_cvtsd2si64:
case Intrinsic::x86_sse2_cvttsd2si:
case Intrinsic::x86_sse2_cvttsd2si64:
case Intrinsic::x86_avx512_vcvtss2si32:
case Intrinsic::x86_avx512_vcvtss2si64:
case Intrinsic::x86_avx512_cvttss2si:
case Intrinsic::x86_avx512_cvttss2si64:
case Intrinsic::x86_avx512_vcvtsd2si32:
case Intrinsic::x86_avx512_vcvtsd2si64:
case Intrinsic::x86_avx512_cvttsd2si:
case Intrinsic::x86_avx512_cvttsd2si64:
case Intrinsic::x86_avx512_vcvtss2usi32:
case Intrinsic::x86_avx512_vcvtss2usi64:
case Intrinsic::x86_avx512_cvttss2usi:
case Intrinsic::x86_avx512_cvttss2usi64:
case Intrinsic::x86_avx512_vcvtsd2usi32:
case Intrinsic::x86_avx512_vcvtsd2usi64:
case Intrinsic::x86_avx512_cvttsd2usi:
case Intrinsic::x86_avx512_cvttsd2usi64:
  return !Call->isStrictFP();

// Sign operations are actually bitwise operations, they do not raise
// exceptions even for SNANs.
case Intrinsic::fabs:
case Intrinsic::copysign:
// Non-constrained variants of rounding operations means default FP
// environment, they can be folded in any case.
case Intrinsic::ceil:
case Intrinsic::floor:
case Intrinsic::round:
case Intrinsic::roundeven:
case Intrinsic::trunc:
case Intrinsic::nearbyint:
case Intrinsic::rint:
// Constrained intrinsics can be folded if FP environment is known
// to compiler.
case Intrinsic::experimental_constrained_ceil:
case Intrinsic::experimental_constrained_floor:
case Intrinsic::experimental_constrained_round:
case Intrinsic::experimental_constrained_roundeven:
case Intrinsic::experimental_constrained_trunc:
case Intrinsic::experimental_constrained_nearbyint:
case Intrinsic::experimental_constrained_rint:
  return true;
default:
  return false;
case Intrinsic::not_intrinsic: break;
}

if (!F->hasName() || Call->isStrictFP())
  return false;

// In these cases, the check of the length is required.  We don't want to
// return true for a name like "cos\0blah" which strcmp would return equal to
// "cos", but has length 8.
StringRef Name = F->getName();
switch (Name[0]) {
default:
  return false;
case 'a':
  return Name == "acos" || Name == "acosf" ||
         Name == "asin" || Name == "asinf" ||
         Name == "atan" || Name == "atanf" ||
         Name == "atan2" || Name == "atan2f";
case 'c':
  return Name == "ceil" || Name == "ceilf" ||
         Name == "cos" || Name == "cosf" ||
         Name == "cosh" || Name == "coshf";
case 'e':
  return Name == "exp" || Name == "expf" ||
         Name == "exp2" || Name == "exp2f";
case 'f':
  return Name == "fabs" || Name == "fabsf" ||
         Name == "floor" || Name == "floorf" ||
         Name == "fmod" || Name == "fmodf";
case 'l':
  return Name == "log" || Name == "logf" ||
         Name == "log2" || Name == "log2f" ||
         Name == "log10" || Name == "log10f";
case 'n':
  return Name == "nearbyint" || Name == "nearbyintf";
case 'p':
  return Name == "pow" || Name == "powf";
case 'r':
  return Name == "remainder" || Name == "remainderf" ||
         Name == "rint" || Name == "rintf" ||
         Name == "round" || Name == "roundf";
case 's':
  return Name == "sin" || Name == "sinf" ||
         Name == "sinh" || Name == "sinhf" ||
         Name == "sqrt" || Name == "sqrtf";
case 't':
  return Name == "tan" || Name == "tanf" ||
         Name == "tanh" || Name == "tanhf" ||
         Name == "trunc" || Name == "truncf";
case '_':
  // Check for various function names that get used for the math functions
  // when the header files are preprocessed with the macro
  // __FINITE_MATH_ONLY__ enabled.
  // The '12' here is the length of the shortest name that can match.
  // We need to check the size before looking at Name[1] and Name[2]
  // so we may as well check a limit that will eliminate mismatches.
  if (Name.size() < 12 || Name[1] != '_')
    return false;
  switch (Name[2]) {
  default:
    return false;
  case 'a':
    return Name == "__acos_finite" || Name == "__acosf_finite" ||
           Name == "__asin_finite" || Name == "__asinf_finite" ||
           Name == "__atan2_finite" || Name == "__atan2f_finite";
  case 'c':
    return Name == "__cosh_finite" || Name == "__coshf_finite";
  case 'e':
    return Name == "__exp_finite" || Name == "__expf_finite" ||
           Name == "__exp2_finite" || Name == "__exp2f_finite";
  case 'l':
    return Name == "__log_finite" || Name == "__logf_finite" ||
           Name == "__log10_finite" || Name == "__log10f_finite";
  case 'p':
    return Name == "__pow_finite" || Name == "__powf_finite";
  case 's':
    return Name == "__sinh_finite" || Name == "__sinhf_finite";
  }
}
1685}

1687namespace {

1689Constant *GetConstantFoldFPValue(double V, Type *Ty) {
if (Ty->isHalfTy() || Ty->isFloatTy()) {
  APFloat APF(V);
  bool unused;
  APF.convert(Ty->getFltSemantics(), APFloat::rmNearestTiesToEven, &unused);
  return ConstantFP::get(Ty->getContext(), APF);
}
if (Ty->isDoubleTy())
  return ConstantFP::get(Ty->getContext(), APFloat(V));
llvm_unreachable("Can only constant fold half/float/double")::llvm::llvm_unreachable_internal("Can only constant fold half/float/double"
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1698);
1699}

1701/// Clear the floating-point exception state.
1702inline void llvm_fenv_clearexcept() {
1703#if defined(HAVE_FENV_H1) && HAVE_DECL_FE_ALL_EXCEPT1
feclearexcept(FE_ALL_EXCEPT(0x20 | 0x04 | 0x10 | 0x08 | 0x01));
1705#endif
errno(*__errno_location ()) = 0;
1707}

1709/// Test if a floating-point exception was raised.
1710inline bool llvm_fenv_testexcept() {
int errno_val = errno(*__errno_location ());
if (errno_val == ERANGE34 || errno_val == EDOM33)
  return true;
1714#if defined(HAVE_FENV_H1) && HAVE_DECL_FE_ALL_EXCEPT1 && HAVE_DECL_FE_INEXACT1
if (fetestexcept(FE_ALL_EXCEPT(0x20 | 0x04 | 0x10 | 0x08 | 0x01) & ~FE_INEXACT0x20))
  return true;
1717#endif
return false;
1719}

1721Constant *ConstantFoldFP(double (*NativeFP)(double), const APFloat &V,
                       Type *Ty) {
llvm_fenv_clearexcept();
double Result = NativeFP(V.convertToDouble());
if (llvm_fenv_testexcept()) {
  llvm_fenv_clearexcept();
  return nullptr;
}

return GetConstantFoldFPValue(Result, Ty);
1731}

1733Constant *ConstantFoldBinaryFP(double (*NativeFP)(double, double),
                             const APFloat &V, const APFloat &W, Type *Ty) {
llvm_fenv_clearexcept();
double Result = NativeFP(V.convertToDouble(), W.convertToDouble());
if (llvm_fenv_testexcept()) {
  llvm_fenv_clearexcept();
  return nullptr;
}

return GetConstantFoldFPValue(Result, Ty);
1743}

1745Constant *constantFoldVectorReduce(Intrinsic::ID IID, Constant *Op) {
FixedVectorType *VT = dyn_cast<FixedVectorType>(Op->getType());
if (!VT)
  return nullptr;

// This isn't strictly necessary, but handle the special/common case of zero:
// all integer reductions of a zero input produce zero.
if (isa<ConstantAggregateZero>(Op))
  return ConstantInt::get(VT->getElementType(), 0);

// This is the same as the underlying binops - poison propagates.
if (isa<PoisonValue>(Op) || Op->containsPoisonElement())
  return PoisonValue::get(VT->getElementType());

// TODO: Handle undef.
if (!isa<ConstantVector>(Op) && !isa<ConstantDataVector>(Op))
  return nullptr;

auto *EltC = dyn_cast<ConstantInt>(Op->getAggregateElement(0U));
if (!EltC)
  return nullptr;

APInt Acc = EltC->getValue();
for (unsigned I = 1, E = VT->getNumElements(); I != E; I++) {
  if (!(EltC = dyn_cast<ConstantInt>(Op->getAggregateElement(I))))
    return nullptr;
  const APInt &X = EltC->getValue();
  switch (IID) {
  case Intrinsic::vector_reduce_add:
    Acc = Acc + X;
    break;
  case Intrinsic::vector_reduce_mul:
    Acc = Acc * X;
    break;
  case Intrinsic::vector_reduce_and:
    Acc = Acc & X;
    break;
  case Intrinsic::vector_reduce_or:
    Acc = Acc | X;
    break;
  case Intrinsic::vector_reduce_xor:
    Acc = Acc ^ X;
    break;
  case Intrinsic::vector_reduce_smin:
    Acc = APIntOps::smin(Acc, X);
    break;
  case Intrinsic::vector_reduce_smax:
    Acc = APIntOps::smax(Acc, X);
    break;
  case Intrinsic::vector_reduce_umin:
    Acc = APIntOps::umin(Acc, X);
    break;
  case Intrinsic::vector_reduce_umax:
    Acc = APIntOps::umax(Acc, X);
    break;
  }
}

return ConstantInt::get(Op->getContext(), Acc);
1804}

1806/// Attempt to fold an SSE floating point to integer conversion of a constant
1807/// floating point. If roundTowardZero is false, the default IEEE rounding is
1808/// used (toward nearest, ties to even). This matches the behavior of the
1809/// non-truncating SSE instructions in the default rounding mode. The desired
1810/// integer type Ty is used to select how many bits are available for the
1811/// result. Returns null if the conversion cannot be performed, otherwise
1812/// returns the Constant value resulting from the conversion.
1813Constant *ConstantFoldSSEConvertToInt(const APFloat &Val, bool roundTowardZero,
                                    Type *Ty, bool IsSigned) {
// All of these conversion intrinsics form an integer of at most 64bits.
unsigned ResultWidth = Ty->getIntegerBitWidth();
assert(ResultWidth <= 64 &&(static_cast <bool> (ResultWidth <= 64 && "Can only constant fold conversions to 64 and 32 bit ints"
) ? void (0) : __assert_fail ("ResultWidth <= 64 && \"Can only constant fold conversions to 64 and 32 bit ints\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1818, __extension__ __PRETTY_FUNCTION__))
       "Can only constant fold conversions to 64 and 32 bit ints")(static_cast <bool> (ResultWidth <= 64 && "Can only constant fold conversions to 64 and 32 bit ints"
) ? void (0) : __assert_fail ("ResultWidth <= 64 && \"Can only constant fold conversions to 64 and 32 bit ints\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1818, __extension__ __PRETTY_FUNCTION__));

uint64_t UIntVal;
bool isExact = false;
APFloat::roundingMode mode = roundTowardZero? APFloat::rmTowardZero
                                            : APFloat::rmNearestTiesToEven;
APFloat::opStatus status =
    Val.convertToInteger(makeMutableArrayRef(UIntVal), ResultWidth,
                         IsSigned, mode, &isExact);
if (status != APFloat::opOK &&
    (!roundTowardZero || status != APFloat::opInexact))
  return nullptr;
return ConstantInt::get(Ty, UIntVal, IsSigned);
1831}

1833double getValueAsDouble(ConstantFP *Op) {
Type *Ty = Op->getType();

if (Ty->isBFloatTy() || Ty->isHalfTy() || Ty->isFloatTy() || Ty->isDoubleTy())
  return Op->getValueAPF().convertToDouble();

bool unused;
APFloat APF = Op->getValueAPF();
APF.convert(APFloat::IEEEdouble(), APFloat::rmNearestTiesToEven, &unused);
return APF.convertToDouble();
1843}

1845static bool getConstIntOrUndef(Value *Op, const APInt *&C) {
if (auto *CI26.1
'CI' is null
1
'CI' is non-null
1
'CI' is null
1
'CI' is non-null
1
'CI' is null
1
'CI' is non-null
 = dyn_cast<ConstantInt>(Op)) {
26
←
Assuming 'Op' is not a 'ConstantInt'→
27
←
Taking false branch→
34
←
Assuming 'Op' is a 'ConstantInt'→
35
←
Taking true branch→
  C = &CI->getValue();
  return true;
36
←
Returning the value 1, which participates in a condition later→
}
if (isa<UndefValue>(Op)) {
28
←
Assuming 'Op' is a 'UndefValue'→
29
←
Taking true branch→
  C = nullptr;
30
←
Null pointer value stored to 'C0'→
  return true;
31
←
Returning the value 1, which participates in a condition later→
}
return false;
1855}

1857static Constant *ConstantFoldScalarCall1(StringRef Name,
                                       Intrinsic::ID IntrinsicID,
                                       Type *Ty,
                                       ArrayRef<Constant *> Operands,
                                       const TargetLibraryInfo *TLI,
                                       const CallBase *Call) {
assert(Operands.size() == 1 && "Wrong number of operands.")(static_cast <bool> (Operands.size() == 1 && "Wrong number of operands."
) ? void (0) : __assert_fail ("Operands.size() == 1 && \"Wrong number of operands.\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 1863, __extension__ __PRETTY_FUNCTION__));

if (IntrinsicID == Intrinsic::is_constant) {
  // We know we have a "Constant" argument. But we want to only
  // return true for manifest constants, not those that depend on
  // constants with unknowable values, e.g. GlobalValue or BlockAddress.
  if (Operands[0]->isManifestConstant())
    return ConstantInt::getTrue(Ty->getContext());
  return nullptr;
}
if (isa<UndefValue>(Operands[0])) {
  // cosine(arg) is between -1 and 1. cosine(invalid arg) is NaN.
  // ctpop() is between 0 and bitwidth, pick 0 for undef.
  // fptoui.sat and fptosi.sat can always fold to zero (for a zero input).
  if (IntrinsicID == Intrinsic::cos ||
      IntrinsicID == Intrinsic::ctpop ||
      IntrinsicID == Intrinsic::fptoui_sat ||
      IntrinsicID == Intrinsic::fptosi_sat)
    return Constant::getNullValue(Ty);
  if (IntrinsicID == Intrinsic::bswap ||
      IntrinsicID == Intrinsic::bitreverse ||
      IntrinsicID == Intrinsic::launder_invariant_group ||
      IntrinsicID == Intrinsic::strip_invariant_group)
    return Operands[0];
}

if (isa<ConstantPointerNull>(Operands[0])) {
  // launder(null) == null == strip(null) iff in addrspace 0
  if (IntrinsicID == Intrinsic::launder_invariant_group ||
      IntrinsicID == Intrinsic::strip_invariant_group) {
    // If instruction is not yet put in a basic block (e.g. when cloning
    // a function during inlining), Call's caller may not be available.
    // So check Call's BB first before querying Call->getCaller.
    const Function *Caller =
        Call->getParent() ? Call->getCaller() : nullptr;
    if (Caller &&
        !NullPointerIsDefined(
            Caller, Operands[0]->getType()->getPointerAddressSpace())) {
      return Operands[0];
    }
    return nullptr;
  }
}

if (auto *Op = dyn_cast<ConstantFP>(Operands[0])) {
  if (IntrinsicID == Intrinsic::convert_to_fp16) {
    APFloat Val(Op->getValueAPF());

    bool lost = false;
    Val.convert(APFloat::IEEEhalf(), APFloat::rmNearestTiesToEven, &lost);

    return ConstantInt::get(Ty->getContext(), Val.bitcastToAPInt());
  }

  APFloat U = Op->getValueAPF();

  if (IntrinsicID == Intrinsic::wasm_trunc_signed ||
      IntrinsicID == Intrinsic::wasm_trunc_unsigned) {
    bool Signed = IntrinsicID == Intrinsic::wasm_trunc_signed;

    if (U.isNaN())
      return nullptr;

    unsigned Width = Ty->getIntegerBitWidth();
    APSInt Int(Width, !Signed);
    bool IsExact = false;
    APFloat::opStatus Status =
        U.convertToInteger(Int, APFloat::rmTowardZero, &IsExact);

    if (Status == APFloat::opOK || Status == APFloat::opInexact)
      return ConstantInt::get(Ty, Int);

    return nullptr;
  }

  if (IntrinsicID == Intrinsic::fptoui_sat ||
      IntrinsicID == Intrinsic::fptosi_sat) {
    // convertToInteger() already has the desired saturation semantics.
    APSInt Int(Ty->getIntegerBitWidth(),
               IntrinsicID == Intrinsic::fptoui_sat);
    bool IsExact;
    U.convertToInteger(Int, APFloat::rmTowardZero, &IsExact);
    return ConstantInt::get(Ty, Int);
  }

  if (!Ty->isHalfTy() && !Ty->isFloatTy() && !Ty->isDoubleTy())
    return nullptr;

  // Use internal versions of these intrinsics.

  if (IntrinsicID == Intrinsic::nearbyint || IntrinsicID == Intrinsic::rint) {
    U.roundToIntegral(APFloat::rmNearestTiesToEven);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::round) {
    U.roundToIntegral(APFloat::rmNearestTiesToAway);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::roundeven) {
    U.roundToIntegral(APFloat::rmNearestTiesToEven);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::ceil) {
    U.roundToIntegral(APFloat::rmTowardPositive);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::floor) {
    U.roundToIntegral(APFloat::rmTowardNegative);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::trunc) {
    U.roundToIntegral(APFloat::rmTowardZero);
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::fabs) {
    U.clearSign();
    return ConstantFP::get(Ty->getContext(), U);
  }

  if (IntrinsicID == Intrinsic::amdgcn_fract) {
    // The v_fract instruction behaves like the OpenCL spec, which defines
    // fract(x) as fmin(x - floor(x), 0x1.fffffep-1f): "The min() operator is
    //   there to prevent fract(-small) from returning 1.0. It returns the
    //   largest positive floating-point number less than 1.0."
    APFloat FloorU(U);
    FloorU.roundToIntegral(APFloat::rmTowardNegative);
    APFloat FractU(U - FloorU);
    APFloat AlmostOne(U.getSemantics(), 1);
    AlmostOne.next(/*nextDown*/ true);
    return ConstantFP::get(Ty->getContext(), minimum(FractU, AlmostOne));
  }

  // Rounding operations (floor, trunc, ceil, round and nearbyint) do not
  // raise FP exceptions, unless the argument is signaling NaN.

  Optional<APFloat::roundingMode> RM;
  switch (IntrinsicID) {
  default:
    break;
  case Intrinsic::experimental_constrained_nearbyint:
  case Intrinsic::experimental_constrained_rint: {
    auto CI = cast<ConstrainedFPIntrinsic>(Call);
    RM = CI->getRoundingMode();
    if (!RM || RM.getValue() == RoundingMode::Dynamic)
      return nullptr;
    break;
  }
  case Intrinsic::experimental_constrained_round:
    RM = APFloat::rmNearestTiesToAway;
    break;
  case Intrinsic::experimental_constrained_ceil:
    RM = APFloat::rmTowardPositive;
    break;
  case Intrinsic::experimental_constrained_floor:
    RM = APFloat::rmTowardNegative;
    break;
  case Intrinsic::experimental_constrained_trunc:
    RM = APFloat::rmTowardZero;
    break;
  }
  if (RM) {
    auto CI = cast<ConstrainedFPIntrinsic>(Call);
    if (U.isFinite()) {
      APFloat::opStatus St = U.roundToIntegral(*RM);
      if (IntrinsicID == Intrinsic::experimental_constrained_rint &&
          St == APFloat::opInexact) {
        Optional<fp::ExceptionBehavior> EB = CI->getExceptionBehavior();
        if (EB && *EB == fp::ebStrict)
          return nullptr;
      }
    } else if (U.isSignaling()) {
      Optional<fp::ExceptionBehavior> EB = CI->getExceptionBehavior();
      if (EB && *EB != fp::ebIgnore)
        return nullptr;
      U = APFloat::getQNaN(U.getSemantics());
    }
    return ConstantFP::get(Ty->getContext(), U);
  }

  /// We only fold functions with finite arguments. Folding NaN and inf is
  /// likely to be aborted with an exception anyway, and some host libms
  /// have known errors raising exceptions.
  if (!U.isFinite())
    return nullptr;

  /// Currently APFloat versions of these functions do not exist, so we use
  /// the host native double versions.  Float versions are not called
  /// directly but for all these it is true (float)(f((double)arg)) ==
  /// f(arg).  Long double not supported yet.
  APFloat APF = Op->getValueAPF();

  switch (IntrinsicID) {
    default: break;
    case Intrinsic::log:
      return ConstantFoldFP(log, APF, Ty);
    case Intrinsic::log2:
      // TODO: What about hosts that lack a C99 library?
      return ConstantFoldFP(Log2, APF, Ty);
    case Intrinsic::log10:
      // TODO: What about hosts that lack a C99 library?
      return ConstantFoldFP(log10, APF, Ty);
    case Intrinsic::exp:
      return ConstantFoldFP(exp, APF, Ty);
    case Intrinsic::exp2:
      // Fold exp2(x) as pow(2, x), in case the host lacks a C99 library.
      return ConstantFoldBinaryFP(pow, APFloat(2.0), APF, Ty);
    case Intrinsic::sin:
      return ConstantFoldFP(sin, APF, Ty);
    case Intrinsic::cos:
      return ConstantFoldFP(cos, APF, Ty);
    case Intrinsic::sqrt:
      return ConstantFoldFP(sqrt, APF, Ty);
    case Intrinsic::amdgcn_cos:
    case Intrinsic::amdgcn_sin: {
      double V = getValueAsDouble(Op);
      if (V < -256.0 || V > 256.0)
        // The gfx8 and gfx9 architectures handle arguments outside the range
        // [-256, 256] differently. This should be a rare case so bail out
        // rather than trying to handle the difference.
        return nullptr;
      bool IsCos = IntrinsicID == Intrinsic::amdgcn_cos;
      double V4 = V * 4.0;
      if (V4 == floor(V4)) {
        // Force exact results for quarter-integer inputs.
        const double SinVals[4] = { 0.0, 1.0, 0.0, -1.0 };
        V = SinVals[((int)V4 + (IsCos ? 1 : 0)) & 3];
      } else {
        if (IsCos)
          V = cos(V * 2.0 * numbers::pi);
        else
          V = sin(V * 2.0 * numbers::pi);
      }
      return GetConstantFoldFPValue(V, Ty);
    }
  }

  if (!TLI)
    return nullptr;

  LibFunc Func = NotLibFunc;
  TLI->getLibFunc(Name, Func);
  switch (Func) {
  default:
    break;
  case LibFunc_acos:
  case LibFunc_acosf:
  case LibFunc_acos_finite:
  case LibFunc_acosf_finite:
    if (TLI->has(Func))
      return ConstantFoldFP(acos, APF, Ty);
    break;
  case LibFunc_asin:
  case LibFunc_asinf:
  case LibFunc_asin_finite:
  case LibFunc_asinf_finite:
    if (TLI->has(Func))
      return ConstantFoldFP(asin, APF, Ty);
    break;
  case LibFunc_atan:
  case LibFunc_atanf:
    if (TLI->has(Func))
      return ConstantFoldFP(atan, APF, Ty);
    break;
  case LibFunc_ceil:
  case LibFunc_ceilf:
    if (TLI->has(Func)) {
      U.roundToIntegral(APFloat::rmTowardPositive);
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  case LibFunc_cos:
  case LibFunc_cosf:
    if (TLI->has(Func))
      return ConstantFoldFP(cos, APF, Ty);
    break;
  case LibFunc_cosh:
  case LibFunc_coshf:
  case LibFunc_cosh_finite:
  case LibFunc_coshf_finite:
    if (TLI->has(Func))
      return ConstantFoldFP(cosh, APF, Ty);
    break;
  case LibFunc_exp:
  case LibFunc_expf:
  case LibFunc_exp_finite:
  case LibFunc_expf_finite:
    if (TLI->has(Func))
      return ConstantFoldFP(exp, APF, Ty);
    break;
  case LibFunc_exp2:
  case LibFunc_exp2f:
  case LibFunc_exp2_finite:
  case LibFunc_exp2f_finite:
    if (TLI->has(Func))
      // Fold exp2(x) as pow(2, x), in case the host lacks a C99 library.
      return ConstantFoldBinaryFP(pow, APFloat(2.0), APF, Ty);
    break;
  case LibFunc_fabs:
  case LibFunc_fabsf:
    if (TLI->has(Func)) {
      U.clearSign();
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  case LibFunc_floor:
  case LibFunc_floorf:
    if (TLI->has(Func)) {
      U.roundToIntegral(APFloat::rmTowardNegative);
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  case LibFunc_log:
  case LibFunc_logf:
  case LibFunc_log_finite:
  case LibFunc_logf_finite:
    if (!APF.isNegative() && !APF.isZero() && TLI->has(Func))
      return ConstantFoldFP(log, APF, Ty);
    break;
  case LibFunc_log2:
  case LibFunc_log2f:
  case LibFunc_log2_finite:
  case LibFunc_log2f_finite:
    if (!APF.isNegative() && !APF.isZero() && TLI->has(Func))
      // TODO: What about hosts that lack a C99 library?
      return ConstantFoldFP(Log2, APF, Ty);
    break;
  case LibFunc_log10:
  case LibFunc_log10f:
  case LibFunc_log10_finite:
  case LibFunc_log10f_finite:
    if (!APF.isNegative() && !APF.isZero() && TLI->has(Func))
      // TODO: What about hosts that lack a C99 library?
      return ConstantFoldFP(log10, APF, Ty);
    break;
  case LibFunc_nearbyint:
  case LibFunc_nearbyintf:
  case LibFunc_rint:
  case LibFunc_rintf:
    if (TLI->has(Func)) {
      U.roundToIntegral(APFloat::rmNearestTiesToEven);
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  case LibFunc_round:
  case LibFunc_roundf:
    if (TLI->has(Func)) {
      U.roundToIntegral(APFloat::rmNearestTiesToAway);
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  case LibFunc_sin:
  case LibFunc_sinf:
    if (TLI->has(Func))
      return ConstantFoldFP(sin, APF, Ty);
    break;
  case LibFunc_sinh:
  case LibFunc_sinhf:
  case LibFunc_sinh_finite:
  case LibFunc_sinhf_finite:
    if (TLI->has(Func))
      return ConstantFoldFP(sinh, APF, Ty);
    break;
  case LibFunc_sqrt:
  case LibFunc_sqrtf:
    if (!APF.isNegative() && TLI->has(Func))
      return ConstantFoldFP(sqrt, APF, Ty);
    break;
  case LibFunc_tan:
  case LibFunc_tanf:
    if (TLI->has(Func))
      return ConstantFoldFP(tan, APF, Ty);
    break;
  case LibFunc_tanh:
  case LibFunc_tanhf:
    if (TLI->has(Func))
      return ConstantFoldFP(tanh, APF, Ty);
    break;
  case LibFunc_trunc:
  case LibFunc_truncf:
    if (TLI->has(Func)) {
      U.roundToIntegral(APFloat::rmTowardZero);
      return ConstantFP::get(Ty->getContext(), U);
    }
    break;
  }
  return nullptr;
}

if (auto *Op = dyn_cast<ConstantInt>(Operands[0])) {
  switch (IntrinsicID) {
  case Intrinsic::bswap:
    return ConstantInt::get(Ty->getContext(), Op->getValue().byteSwap());
  case Intrinsic::ctpop:
    return ConstantInt::get(Ty, Op->getValue().countPopulation());
  case Intrinsic::bitreverse:
    return ConstantInt::get(Ty->getContext(), Op->getValue().reverseBits());
  case Intrinsic::convert_from_fp16: {
    APFloat Val(APFloat::IEEEhalf(), Op->getValue());

    bool lost = false;
    APFloat::opStatus status = Val.convert(
        Ty->getFltSemantics(), APFloat::rmNearestTiesToEven, &lost);

    // Conversion is always precise.
    (void)status;
    assert(status == APFloat::opOK && !lost &&(static_cast <bool> (status == APFloat::opOK &&
 !lost && "Precision lost during fp16 constfolding") ?
 void (0) : __assert_fail ("status == APFloat::opOK && !lost && \"Precision lost during fp16 constfolding\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2275, __extension__ __PRETTY_FUNCTION__))
           "Precision lost during fp16 constfolding")(static_cast <bool> (status == APFloat::opOK &&
 !lost && "Precision lost during fp16 constfolding") ?
 void (0) : __assert_fail ("status == APFloat::opOK && !lost && \"Precision lost during fp16 constfolding\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2275, __extension__ __PRETTY_FUNCTION__));

    return ConstantFP::get(Ty->getContext(), Val);
  }
  default:
    return nullptr;
  }
}

switch (IntrinsicID) {
default: break;
case Intrinsic::vector_reduce_add:
case Intrinsic::vector_reduce_mul:
case Intrinsic::vector_reduce_and:
case Intrinsic::vector_reduce_or:
case Intrinsic::vector_reduce_xor:
case Intrinsic::vector_reduce_smin:
case Intrinsic::vector_reduce_smax:
case Intrinsic::vector_reduce_umin:
case Intrinsic::vector_reduce_umax:
  if (Constant *C = constantFoldVectorReduce(IntrinsicID, Operands[0]))
    return C;
  break;
}

// Support ConstantVector in case we have an Undef in the top.
if (isa<ConstantVector>(Operands[0]) ||
    isa<ConstantDataVector>(Operands[0])) {
  auto *Op = cast<Constant>(Operands[0]);
  switch (IntrinsicID) {
  default: break;
  case Intrinsic::x86_sse_cvtss2si:
  case Intrinsic::x86_sse_cvtss2si64:
  case Intrinsic::x86_sse2_cvtsd2si:
  case Intrinsic::x86_sse2_cvtsd2si64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/false, Ty,
                                         /*IsSigned*/true);
    break;
  case Intrinsic::x86_sse_cvttss2si:
  case Intrinsic::x86_sse_cvttss2si64:
  case Intrinsic::x86_sse2_cvttsd2si:
  case Intrinsic::x86_sse2_cvttsd2si64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/true, Ty,
                                         /*IsSigned*/true);
    break;
  }
}

return nullptr;
2330}

2332static Constant *ConstantFoldScalarCall2(StringRef Name,
                                       Intrinsic::ID IntrinsicID,
                                       Type *Ty,
                                       ArrayRef<Constant *> Operands,
                                       const TargetLibraryInfo *TLI,
                                       const CallBase *Call) {
assert(Operands.size() == 2 && "Wrong number of operands.")(static_cast <bool> (Operands.size() == 2 && "Wrong number of operands."
) ? void (0) : __assert_fail ("Operands.size() == 2 && \"Wrong number of operands.\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2338, __extension__ __PRETTY_FUNCTION__));
1
Assuming the condition is true→
2
←
'?' condition is true→

if (Ty->isFloatingPointTy()) {
3
←
Calling 'Type::isFloatingPointTy'→
12
←
Returning from 'Type::isFloatingPointTy'→
13
←
Taking false branch→
  // TODO: We should have undef handling for all of the FP intrinsics that
  //       are attempted to be folded in this function.
  bool IsOp0Undef = isa<UndefValue>(Operands[0]);
  bool IsOp1Undef = isa<UndefValue>(Operands[1]);
  switch (IntrinsicID) {
  case Intrinsic::maxnum:
  case Intrinsic::minnum:
  case Intrinsic::maximum:
  case Intrinsic::minimum:
    // If one argument is undef, return the other argument.
    if (IsOp0Undef)
      return Operands[1];
    if (IsOp1Undef)
      return Operands[0];
    break;
  }
}

if (auto *Op114.1
'Op1' is null
1
'Op1' is null
1
'Op1' is null
 = dyn_cast<ConstantFP>(Operands[0])) {
14
←
Assuming the object is not a 'ConstantFP'→
15
←
Taking false branch→
  if (!Ty->isFloatingPointTy())
    return nullptr;
  APFloat Op1V = Op1->getValueAPF();

  if (auto *Op2 = dyn_cast<ConstantFP>(Operands[1])) {
    if (Op2->getType() != Op1->getType())
      return nullptr;
    APFloat Op2V = Op2->getValueAPF();

    switch (IntrinsicID) {
    default:
      break;
    case Intrinsic::copysign:
      return ConstantFP::get(Ty->getContext(), APFloat::copySign(Op1V, Op2V));
    case Intrinsic::minnum:
      return ConstantFP::get(Ty->getContext(), minnum(Op1V, Op2V));
    case Intrinsic::maxnum:
      return ConstantFP::get(Ty->getContext(), maxnum(Op1V, Op2V));
    case Intrinsic::minimum:
      return ConstantFP::get(Ty->getContext(), minimum(Op1V, Op2V));
    case Intrinsic::maximum:
      return ConstantFP::get(Ty->getContext(), maximum(Op1V, Op2V));
    }

    if (!Ty->isHalfTy() && !Ty->isFloatTy() && !Ty->isDoubleTy())
      return nullptr;

    switch (IntrinsicID) {
    default:
      break;
    case Intrinsic::pow:
      return ConstantFoldBinaryFP(pow, Op1V, Op2V, Ty);
    case Intrinsic::amdgcn_fmul_legacy:
      // The legacy behaviour is that multiplying +/- 0.0 by anything, even
      // NaN or infinity, gives +0.0.
      if (Op1V.isZero() || Op2V.isZero())
        return ConstantFP::getNullValue(Ty);
      return ConstantFP::get(Ty->getContext(), Op1V * Op2V);
    }

    if (!TLI)
      return nullptr;

    LibFunc Func = NotLibFunc;
    TLI->getLibFunc(Name, Func);
    switch (Func) {
    default:
      break;
    case LibFunc_pow:
    case LibFunc_powf:
    case LibFunc_pow_finite:
    case LibFunc_powf_finite:
      if (TLI->has(Func))
        return ConstantFoldBinaryFP(pow, Op1V, Op2V, Ty);
      break;
    case LibFunc_fmod:
    case LibFunc_fmodf:
      if (TLI->has(Func)) {
        APFloat V = Op1->getValueAPF();
        if (APFloat::opStatus::opOK == V.mod(Op2->getValueAPF()))
          return ConstantFP::get(Ty->getContext(), V);
      }
      break;
    case LibFunc_remainder:
    case LibFunc_remainderf:
      if (TLI->has(Func)) {
        APFloat V = Op1->getValueAPF();
        if (APFloat::opStatus::opOK == V.remainder(Op2->getValueAPF()))
          return ConstantFP::get(Ty->getContext(), V);
      }
      break;
    case LibFunc_atan2:
    case LibFunc_atan2f:
    case LibFunc_atan2_finite:
    case LibFunc_atan2f_finite:
      if (TLI->has(Func))
        return ConstantFoldBinaryFP(atan2, Op1V, Op2V, Ty);
      break;
    }
  } else if (auto *Op2C = dyn_cast<ConstantInt>(Operands[1])) {
    if (IntrinsicID == Intrinsic::powi && Ty->isHalfTy())
      return ConstantFP::get(
          Ty->getContext(),
          APFloat((float)std::pow((float)Op1V.convertToDouble(),
                                  (int)Op2C->getZExtValue())));
    if (IntrinsicID == Intrinsic::powi && Ty->isFloatTy())
      return ConstantFP::get(
          Ty->getContext(),
          APFloat((float)std::pow((float)Op1V.convertToDouble(),
                                  (int)Op2C->getZExtValue())));
    if (IntrinsicID == Intrinsic::powi && Ty->isDoubleTy())
      return ConstantFP::get(
          Ty->getContext(),
          APFloat((double)std::pow(Op1V.convertToDouble(),
                                   (int)Op2C->getZExtValue())));

    if (IntrinsicID == Intrinsic::amdgcn_ldexp) {
      // FIXME: Should flush denorms depending on FP mode, but that's ignored
      // everywhere else.

      // scalbn is equivalent to ldexp with float radix 2
      APFloat Result = scalbn(Op1->getValueAPF(), Op2C->getSExtValue(),
                              APFloat::rmNearestTiesToEven);
      return ConstantFP::get(Ty->getContext(), Result);
    }
  }
  return nullptr;
}

if (Operands[0]->getType()->isIntegerTy() &&
16
←
Calling 'Type::isIntegerTy'→
19
←
Returning from 'Type::isIntegerTy'→
24
←
Taking true branch→
    Operands[1]->getType()->isIntegerTy()) {
20
←
Calling 'Type::isIntegerTy'→
23
←
Returning from 'Type::isIntegerTy'→
  const APInt *C0, *C1;
  if (!getConstIntOrUndef(Operands[0], C0) ||
25
←
Calling 'getConstIntOrUndef'→
32
←
Returning from 'getConstIntOrUndef'→
38
←
Taking false branch→
      !getConstIntOrUndef(Operands[1], C1))
33
←
Calling 'getConstIntOrUndef'→
37
←
Returning from 'getConstIntOrUndef'→
    return nullptr;

  unsigned BitWidth = Ty->getScalarSizeInBits();
  switch (IntrinsicID) {
39
←
Control jumps to 'case abs:'  at line 2595→
  default: break;
  case Intrinsic::smax:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return ConstantInt::get(Ty, APInt::getSignedMaxValue(BitWidth));
    return ConstantInt::get(Ty, C0->sgt(*C1) ? *C0 : *C1);

  case Intrinsic::smin:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return ConstantInt::get(Ty, APInt::getSignedMinValue(BitWidth));
    return ConstantInt::get(Ty, C0->slt(*C1) ? *C0 : *C1);

  case Intrinsic::umax:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return ConstantInt::get(Ty, APInt::getMaxValue(BitWidth));
    return ConstantInt::get(Ty, C0->ugt(*C1) ? *C0 : *C1);

  case Intrinsic::umin:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return ConstantInt::get(Ty, APInt::getMinValue(BitWidth));
    return ConstantInt::get(Ty, C0->ult(*C1) ? *C0 : *C1);

  case Intrinsic::usub_with_overflow:
  case Intrinsic::ssub_with_overflow:
    // X - undef -> { 0, false }
    // undef - X -> { 0, false }
    if (!C0 || !C1)
      return Constant::getNullValue(Ty);
    LLVM_FALLTHROUGH[[gnu::fallthrough]];
  case Intrinsic::uadd_with_overflow:
  case Intrinsic::sadd_with_overflow:
    // X + undef -> { -1, false }
    // undef + x -> { -1, false }
    if (!C0 || !C1) {
      return ConstantStruct::get(
          cast<StructType>(Ty),
          {Constant::getAllOnesValue(Ty->getStructElementType(0)),
           Constant::getNullValue(Ty->getStructElementType(1))});
    }
    LLVM_FALLTHROUGH[[gnu::fallthrough]];
  case Intrinsic::smul_with_overflow:
  case Intrinsic::umul_with_overflow: {
    // undef * X -> { 0, false }
    // X * undef -> { 0, false }
    if (!C0 || !C1)
      return Constant::getNullValue(Ty);

    APInt Res;
    bool Overflow;
    switch (IntrinsicID) {
    default: llvm_unreachable("Invalid case")::llvm::llvm_unreachable_internal("Invalid case", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2535);
    case Intrinsic::sadd_with_overflow:
      Res = C0->sadd_ov(*C1, Overflow);
      break;
    case Intrinsic::uadd_with_overflow:
      Res = C0->uadd_ov(*C1, Overflow);
      break;
    case Intrinsic::ssub_with_overflow:
      Res = C0->ssub_ov(*C1, Overflow);
      break;
    case Intrinsic::usub_with_overflow:
      Res = C0->usub_ov(*C1, Overflow);
      break;
    case Intrinsic::smul_with_overflow:
      Res = C0->smul_ov(*C1, Overflow);
      break;
    case Intrinsic::umul_with_overflow:
      Res = C0->umul_ov(*C1, Overflow);
      break;
    }
    Constant *Ops[] = {
      ConstantInt::get(Ty->getContext(), Res),
      ConstantInt::get(Type::getInt1Ty(Ty->getContext()), Overflow)
    };
    return ConstantStruct::get(cast<StructType>(Ty), Ops);
  }
  case Intrinsic::uadd_sat:
  case Intrinsic::sadd_sat:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return Constant::getAllOnesValue(Ty);
    if (IntrinsicID == Intrinsic::uadd_sat)
      return ConstantInt::get(Ty, C0->uadd_sat(*C1));
    else
      return ConstantInt::get(Ty, C0->sadd_sat(*C1));
  case Intrinsic::usub_sat:
  case Intrinsic::ssub_sat:
    if (!C0 && !C1)
      return UndefValue::get(Ty);
    if (!C0 || !C1)
      return Constant::getNullValue(Ty);
    if (IntrinsicID == Intrinsic::usub_sat)
      return ConstantInt::get(Ty, C0->usub_sat(*C1));
    else
      return ConstantInt::get(Ty, C0->ssub_sat(*C1));
  case Intrinsic::cttz:
  case Intrinsic::ctlz:
    assert(C1 && "Must be constant int")(static_cast <bool> (C1 && "Must be constant int"
) ? void (0) : __assert_fail ("C1 && \"Must be constant int\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2583, __extension__ __PRETTY_FUNCTION__));

    // cttz(0, 1) and ctlz(0, 1) are undef.
    if (C1->isOneValue() && (!C0 || C0->isNullValue()))
      return UndefValue::get(Ty);
    if (!C0)
      return Constant::getNullValue(Ty);
    if (IntrinsicID == Intrinsic::cttz)
      return ConstantInt::get(Ty, C0->countTrailingZeros());
    else
      return ConstantInt::get(Ty, C0->countLeadingZeros());

  case Intrinsic::abs:
    // Undef or minimum val operand with poison min --> undef
    assert(C1 && "Must be constant int")(static_cast <bool> (C1 && "Must be constant int"
) ? void (0) : __assert_fail ("C1 && \"Must be constant int\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2597, __extension__ __PRETTY_FUNCTION__));
40
←
'?' condition is true→
    if (C1->isOneValue() && (!C0 || C0->isMinSignedValue()))
41
←
Calling 'APInt::isOneValue'→
49
←
Returning from 'APInt::isOneValue'→
      return UndefValue::get(Ty);

    // Undef operand with no poison min --> 0 (sign bit must be clear)
    if (C1->isNullValue() && !C0)
50
←
Calling 'APInt::isNullValue'→
60
←
Returning from 'APInt::isNullValue'→
      return Constant::getNullValue(Ty);

    return ConstantInt::get(Ty, C0->abs());
61
←
Called C++ object pointer is null
  }

  return nullptr;
}

// Support ConstantVector in case we have an Undef in the top.
if ((isa<ConstantVector>(Operands[0]) ||
     isa<ConstantDataVector>(Operands[0])) &&
    // Check for default rounding mode.
    // FIXME: Support other rounding modes?
    isa<ConstantInt>(Operands[1]) &&
    cast<ConstantInt>(Operands[1])->getValue() == 4) {
  auto *Op = cast<Constant>(Operands[0]);
  switch (IntrinsicID) {
  default: break;
  case Intrinsic::x86_avx512_vcvtss2si32:
  case Intrinsic::x86_avx512_vcvtss2si64:
  case Intrinsic::x86_avx512_vcvtsd2si32:
  case Intrinsic::x86_avx512_vcvtsd2si64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/false, Ty,
                                         /*IsSigned*/true);
    break;
  case Intrinsic::x86_avx512_vcvtss2usi32:
  case Intrinsic::x86_avx512_vcvtss2usi64:
  case Intrinsic::x86_avx512_vcvtsd2usi32:
  case Intrinsic::x86_avx512_vcvtsd2usi64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/false, Ty,
                                         /*IsSigned*/false);
    break;
  case Intrinsic::x86_avx512_cvttss2si:
  case Intrinsic::x86_avx512_cvttss2si64:
  case Intrinsic::x86_avx512_cvttsd2si:
  case Intrinsic::x86_avx512_cvttsd2si64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/true, Ty,
                                         /*IsSigned*/true);
    break;
  case Intrinsic::x86_avx512_cvttss2usi:
  case Intrinsic::x86_avx512_cvttss2usi64:
  case Intrinsic::x86_avx512_cvttsd2usi:
  case Intrinsic::x86_avx512_cvttsd2usi64:
    if (ConstantFP *FPOp =
            dyn_cast_or_null<ConstantFP>(Op->getAggregateElement(0U)))
      return ConstantFoldSSEConvertToInt(FPOp->getValueAPF(),
                                         /*roundTowardZero=*/true, Ty,
                                         /*IsSigned*/false);
    break;
  }
}
return nullptr;
2664}

2666static APFloat ConstantFoldAMDGCNCubeIntrinsic(Intrinsic::ID IntrinsicID,
                                             const APFloat &S0,
                                             const APFloat &S1,
                                             const APFloat &S2) {
unsigned ID;
const fltSemantics &Sem = S0.getSemantics();
APFloat MA(Sem), SC(Sem), TC(Sem);
if (abs(S2) >= abs(S0) && abs(S2) >= abs(S1)) {
  if (S2.isNegative() && S2.isNonZero() && !S2.isNaN()) {
    // S2 < 0
    ID = 5;
    SC = -S0;
  } else {
    ID = 4;
    SC = S0;
  }
  MA = S2;
  TC = -S1;
} else if (abs(S1) >= abs(S0)) {
  if (S1.isNegative() && S1.isNonZero() && !S1.isNaN()) {
    // S1 < 0
    ID = 3;
    TC = -S2;
  } else {
    ID = 2;
    TC = S2;
  }
  MA = S1;
  SC = S0;
} else {
  if (S0.isNegative() && S0.isNonZero() && !S0.isNaN()) {
    // S0 < 0
    ID = 1;
    SC = S2;
  } else {
    ID = 0;
    SC = -S2;
  }
  MA = S0;
  TC = -S1;
}
switch (IntrinsicID) {
default:
  llvm_unreachable("unhandled amdgcn cube intrinsic")::llvm::llvm_unreachable_internal("unhandled amdgcn cube intrinsic"
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2709);
case Intrinsic::amdgcn_cubeid:
  return APFloat(Sem, ID);
case Intrinsic::amdgcn_cubema:
  return MA + MA;
case Intrinsic::amdgcn_cubesc:
  return SC;
case Intrinsic::amdgcn_cubetc:
  return TC;
}
2719}

2721static Constant *ConstantFoldAMDGCNPermIntrinsic(ArrayRef<Constant *> Operands,
                                               Type *Ty) {
const APInt *C0, *C1, *C2;
if (!getConstIntOrUndef(Operands[0], C0) ||
    !getConstIntOrUndef(Operands[1], C1) ||
    !getConstIntOrUndef(Operands[2], C2))
  return nullptr;

if (!C2)
  return UndefValue::get(Ty);

APInt Val(32, 0);
unsigned NumUndefBytes = 0;
for (unsigned I = 0; I < 32; I += 8) {
  unsigned Sel = C2->extractBitsAsZExtValue(8, I);
  unsigned B = 0;

  if (Sel >= 13)
    B = 0xff;
  else if (Sel == 12)
    B = 0x00;
  else {
    const APInt *Src = ((Sel & 10) == 10 || (Sel & 12) == 4) ? C0 : C1;
    if (!Src)
      ++NumUndefBytes;
    else if (Sel < 8)
      B = Src->extractBitsAsZExtValue(8, (Sel & 3) * 8);
    else
      B = Src->extractBitsAsZExtValue(1, (Sel & 1) ? 31 : 15) * 0xff;
  }

  Val.insertBits(B, I, 8);
}

if (NumUndefBytes == 4)
  return UndefValue::get(Ty);

return ConstantInt::get(Ty, Val);
2759}

2761static Constant *ConstantFoldScalarCall3(StringRef Name,
                                       Intrinsic::ID IntrinsicID,
                                       Type *Ty,
                                       ArrayRef<Constant *> Operands,
                                       const TargetLibraryInfo *TLI,
                                       const CallBase *Call) {
assert(Operands.size() == 3 && "Wrong number of operands.")(static_cast <bool> (Operands.size() == 3 && "Wrong number of operands."
) ? void (0) : __assert_fail ("Operands.size() == 3 && \"Wrong number of operands.\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2767, __extension__ __PRETTY_FUNCTION__));

if (const auto *Op1 = dyn_cast<ConstantFP>(Operands[0])) {
  if (const auto *Op2 = dyn_cast<ConstantFP>(Operands[1])) {
    if (const auto *Op3 = dyn_cast<ConstantFP>(Operands[2])) {
      const APFloat &C1 = Op1->getValueAPF();
      const APFloat &C2 = Op2->getValueAPF();
      const APFloat &C3 = Op3->getValueAPF();
      switch (IntrinsicID) {
      default: break;
      case Intrinsic::amdgcn_fma_legacy: {
        // The legacy behaviour is that multiplying +/- 0.0 by anything, even
        // NaN or infinity, gives +0.0.
        if (C1.isZero() || C2.isZero()) {
          // It's tempting to just return C3 here, but that would give the
          // wrong result if C3 was -0.0.
          return ConstantFP::get(Ty->getContext(), APFloat(0.0f) + C3);
        }
        LLVM_FALLTHROUGH[[gnu::fallthrough]];
      }
      case Intrinsic::fma:
      case Intrinsic::fmuladd: {
        APFloat V = C1;
        V.fusedMultiplyAdd(C2, C3, APFloat::rmNearestTiesToEven);
        return ConstantFP::get(Ty->getContext(), V);
      }
      case Intrinsic::amdgcn_cubeid:
      case Intrinsic::amdgcn_cubema:
      case Intrinsic::amdgcn_cubesc:
      case Intrinsic::amdgcn_cubetc: {
        APFloat V = ConstantFoldAMDGCNCubeIntrinsic(IntrinsicID, C1, C2, C3);
        return ConstantFP::get(Ty->getContext(), V);
      }
      }
    }
  }
}

if (IntrinsicID == Intrinsic::smul_fix ||
    IntrinsicID == Intrinsic::smul_fix_sat) {
  // poison * C -> poison
  // C * poison -> poison
  if (isa<PoisonValue>(Operands[0]) || isa<PoisonValue>(Operands[1]))
    return PoisonValue::get(Ty);

  const APInt *C0, *C1;
  if (!getConstIntOrUndef(Operands[0], C0) ||
      !getConstIntOrUndef(Operands[1], C1))
    return nullptr;

  // undef * C -> 0
  // C * undef -> 0
  if (!C0 || !C1)
    return Constant::getNullValue(Ty);

  // This code performs rounding towards negative infinity in case the result
  // cannot be represented exactly for the given scale. Targets that do care
  // about rounding should use a target hook for specifying how rounding
  // should be done, and provide their own folding to be consistent with
  // rounding. This is the same approach as used by
  // DAGTypeLegalizer::ExpandIntRes_MULFIX.
  unsigned Scale = cast<ConstantInt>(Operands[2])->getZExtValue();
  unsigned Width = C0->getBitWidth();
  assert(Scale < Width && "Illegal scale.")(static_cast <bool> (Scale < Width && "Illegal scale."
) ? void (0) : __assert_fail ("Scale < Width && \"Illegal scale.\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/lib/Analysis/ConstantFolding.cpp"
, 2830, __extension__ __PRETTY_FUNCTION__));
  unsigned ExtendedWidth = Width * 2;
  APInt Product = (C0->sextOrSelf(ExtendedWidth) *
                   C1->sextOrSelf(ExtendedWidth)).ashr(Scale);
  if (IntrinsicID == Intrinsic::smul_fix_sat) {
    APInt Max = APInt::getSignedMaxValue(Width).sextOrSelf(ExtendedWidth);
    APInt Min = APInt::getSignedMinValue(Width).sextOrSelf(ExtendedWidth);
    Product = APIntOps::smin(Product, Max);
    Product = APIntOps::smax(Product, Min);
  }
  return ConstantInt::get(Ty->getContext(), Product.sextOrTrunc(Width));
}

if (IntrinsicID == Intrinsic::fshl || IntrinsicID == Intrinsic::fshr) {
  const APInt *C0, *C1, *C2;
  if (!getConstIntOrUndef(Operands[0], C0) ||
      !getConstIntOrUndef(Operands[1], C1) ||
      !getConstIntOrUndef(Operands[2], C2))
    return nullptr;

  bool IsRight = IntrinsicID == Intrinsic::fshr;
  if (!C2)
    return Operands[IsRight ? 1 : 0];
  if (!C0 && !C1)
    return UndefValue::get(Ty);

  // The shift amount is interpreted as modulo the bitwidth. If the shift
  // amount is effectively 0, avoid UB due to oversized inverse shift below.
  unsigned BitWidth = C2->getBitWidth();
  unsigned ShAmt = C2->urem(BitWidth);
  if (!ShAmt)
    return Operands[IsRight ? 1 : 0];

  // (C0 << ShlAmt) | (C1 >> LshrAmt)
  unsigned LshrAmt = IsRight ? ShAmt : BitWidth - ShAmt;
  unsigned ShlAmt = !IsRight ? ShAmt : BitWidth - ShAmt;
  if (!C0)
    return ConstantInt::get(Ty, C1->lshr(LshrAmt));
  if (!C1)
    return ConstantInt::get(Ty, C0->shl(ShlAmt));
  return ConstantInt::get(Ty, C0->shl(ShlAmt) | C1->lshr(LshrAmt));
}

if (IntrinsicID == Intrinsic::amdgcn_perm)
  return ConstantFoldAMDGCNPermIntrinsic(Operands, Ty);

return nullptr;
2877}

2879static Constant *ConstantFoldScalarCall(StringRef Name,
                                      Intrinsic::ID IntrinsicID,
                                      Type *Ty,
                                      ArrayRef<Constant *> Operands,
                                      const TargetLibraryInfo *TLI,
                                      const CallBase *Call) {
if (Operands.size() == 1)
  return ConstantFoldScalarCall1(Name, IntrinsicID, Ty, Operands, TLI, Call);

if (Operands.size() == 2)
  return ConstantFoldScalarCall2(Name, IntrinsicID, Ty, Operands, TLI, Call);

if (Operands.size() == 3)
  return ConstantFoldScalarCall3(Name, IntrinsicID, Ty, Operands, TLI, Call);

return nullptr;
2895}

2897static Constant *ConstantFoldFixedVectorCall(
  StringRef Name, Intrinsic::ID IntrinsicID, FixedVectorType *FVTy,
  ArrayRef<Constant *> Operands, const DataLayout &DL,
  const TargetLibraryInfo *TLI, const CallBase *Call) {
SmallVector<Constant *, 4> Result(FVTy->getNumElements());
SmallVector<Constant *, 4> Lane(Operands.size());
Type *Ty = FVTy->getElementType();

switch (IntrinsicID) {
case Intrinsic::masked_load: {
  auto *SrcPtr = Operands[0];
  auto *Mask = Operands[2];
  auto *Passthru = Operands[3];

  Constant *VecData = ConstantFoldLoadFromConstPtr(SrcPtr, FVTy, DL);

  SmallVector<Constant *, 32> NewElements;
  for (unsigned I = 0, E = FVTy->getNumElements(); I != E; ++I) {
    auto *MaskElt = Mask->getAggregateElement(I);
    if (!MaskElt)
      break;
    auto *PassthruElt = Passthru->getAggregateElement(I);
    auto *VecElt = VecData ? VecData->getAggregateElement(I) : nullptr;
    if (isa<UndefValue>(MaskElt)) {
      if (PassthruElt)
        NewElements.push_back(PassthruElt);
      else if (VecElt)
        NewElements.push_back(VecElt);
      else
        return nullptr;
    }
    if (MaskElt->isNullValue()) {
      if (!PassthruElt)
        return nullptr;
      NewElements.push_back(PassthruElt);
    } else if (MaskElt->isOneValue()) {
      if (!VecElt)
        return nullptr;
      NewElements.push_back(VecElt);
    } else {
      return nullptr;
    }
  }
  if (NewElements.size() != FVTy->getNumElements())
    return nullptr;
  return ConstantVector::get(NewElements);
}
case Intrinsic::arm_mve_vctp8:
case Intrinsic::arm_mve_vctp16:
case Intrinsic::arm_mve_vctp32:
case Intrinsic::arm_mve_vctp64: {
  if (auto *Op = dyn_cast<ConstantInt>(Operands[0])) {
    unsigned Lanes = FVTy->getNumElements();
    uint64_t Limit = Op->getZExtValue();
    // vctp64 are currently modelled as returning a v4i1, not a v2i1. Make
    // sure we get the limit right in that case and set all relevant lanes.
    if (IntrinsicID == Intrinsic::arm_mve_vctp64)
      Limit *= 2;

    SmallVector<Constant *, 16> NCs;
    for (unsigned i = 0; i < Lanes; i++) {
      if (i < Limit)
        NCs.push_back(ConstantInt::getTrue(Ty));
      else
        NCs.push_back(ConstantInt::getFalse(Ty));
    }
    return ConstantVector::get(NCs);
  }
  break;
}
case Intrinsic::get_active_lane_mask: {
  auto *Op0 = dyn_cast<ConstantInt>(Operands[0]);
  auto *Op1 = dyn_cast<ConstantInt>(Operands[1]);
  if (Op0 && Op1) {
    unsigned Lanes = FVTy->getNumElements();
    uint64_t Base = Op0->getZExtValue();
    uint64_t Limit = Op1->getZExtValue();

    SmallVector<Constant *, 16> NCs;
    for (unsigned i = 0; i < Lanes; i++) {
      if (Base + i < Limit)
        NCs.push_back(ConstantInt::getTrue(Ty));
      else
        NCs.push_back(ConstantInt::getFalse(Ty));
    }
    return ConstantVector::get(NCs);
  }
  break;
}
default:
  break;
}

for (unsigned I = 0, E = FVTy->getNumElements(); I != E; ++I) {
  // Gather a column of constants.
  for (unsigned J = 0, JE = Operands.size(); J != JE; ++J) {
    // Some intrinsics use a scalar type for certain arguments.
    if (hasVectorInstrinsicScalarOpd(IntrinsicID, J)) {
      Lane[J] = Operands[J];
      continue;
    }

    Constant *Agg = Operands[J]->getAggregateElement(I);
    if (!Agg)
      return nullptr;

    Lane[J] = Agg;
  }

  // Use the regular scalar folding to simplify this column.
  Constant *Folded =
      ConstantFoldScalarCall(Name, IntrinsicID, Ty, Lane, TLI, Call);
  if (!Folded)
    return nullptr;
  Result[I] = Folded;
}

return ConstantVector::get(Result);
3015}

3017static Constant *ConstantFoldScalableVectorCall(
  StringRef Name, Intrinsic::ID IntrinsicID, ScalableVectorType *SVTy,
  ArrayRef<Constant *> Operands, const DataLayout &DL,
  const TargetLibraryInfo *TLI, const CallBase *Call) {
switch (IntrinsicID) {
case Intrinsic::aarch64_sve_convert_from_svbool: {
  auto *Src = dyn_cast<Constant>(Operands[0]);
  if (!Src || !Src->isNullValue())
    break;

  return ConstantInt::getFalse(SVTy);
}
default:
  break;
}
return nullptr;
3033}

3035} // end anonymous namespace

3037Constant *llvm::ConstantFoldCall(const CallBase *Call, Function *F,
                               ArrayRef<Constant *> Operands,
                               const TargetLibraryInfo *TLI) {
if (Call->isNoBuiltin())
  return nullptr;
if (!F->hasName())
  return nullptr;

// If this is not an intrinsic and not recognized as a library call, bail out.
if (F->getIntrinsicID() == Intrinsic::not_intrinsic) {
  if (!TLI)
    return nullptr;
  LibFunc LibF;
  if (!TLI->getLibFunc(*F, LibF))
    return nullptr;
}

StringRef Name = F->getName();
Type *Ty = F->getReturnType();
if (auto *FVTy = dyn_cast<FixedVectorType>(Ty))
  return ConstantFoldFixedVectorCall(
      Name, F->getIntrinsicID(), FVTy, Operands,
      F->getParent()->getDataLayout(), TLI, Call);

if (auto *SVTy = dyn_cast<ScalableVectorType>(Ty))
  return ConstantFoldScalableVectorCall(
      Name, F->getIntrinsicID(), SVTy, Operands,
      F->getParent()->getDataLayout(), TLI, Call);

// TODO: If this is a library function, we already discovered that above,
//       so we should pass the LibFunc, not the name (and it might be better
//       still to separate intrinsic handling from libcalls).
return ConstantFoldScalarCall(Name, F->getIntrinsicID(), Ty, Operands, TLI,
                              Call);
3071}

3073bool llvm::isMathLibCallNoop(const CallBase *Call,
                           const TargetLibraryInfo *TLI) {
// FIXME: Refactor this code; this duplicates logic in LibCallsShrinkWrap
// (and to some extent ConstantFoldScalarCall).
if (Call->isNoBuiltin() || Call->isStrictFP())
  return false;
Function *F = Call->getCalledFunction();
if (!F)
  return false;

LibFunc Func;
if (!TLI || !TLI->getLibFunc(*F, Func))
  return false;

if (Call->getNumArgOperands() == 1) {
  if (ConstantFP *OpC = dyn_cast<ConstantFP>(Call->getArgOperand(0))) {
    const APFloat &Op = OpC->getValueAPF();
    switch (Func) {
    case LibFunc_logl:
    case LibFunc_log:
    case LibFunc_logf:
    case LibFunc_log2l:
    case LibFunc_log2:
    case LibFunc_log2f:
    case LibFunc_log10l:
    case LibFunc_log10:
    case LibFunc_log10f:
      return Op.isNaN() || (!Op.isZero() && !Op.isNegative());

    case LibFunc_expl:
    case LibFunc_exp:
    case LibFunc_expf:
      // FIXME: These boundaries are slightly conservative.
      if (OpC->getType()->isDoubleTy())
        return !(Op < APFloat(-745.0) || Op > APFloat(709.0));
      if (OpC->getType()->isFloatTy())
        return !(Op < APFloat(-103.0f) || Op > APFloat(88.0f));
      break;

    case LibFunc_exp2l:
    case LibFunc_exp2:
    case LibFunc_exp2f:
      // FIXME: These boundaries are slightly conservative.
      if (OpC->getType()->isDoubleTy())
        return !(Op < APFloat(-1074.0) || Op > APFloat(1023.0));
      if (OpC->getType()->isFloatTy())
        return !(Op < APFloat(-149.0f) || Op > APFloat(127.0f));
      break;

    case LibFunc_sinl:
    case LibFunc_sin:
    case LibFunc_sinf:
    case LibFunc_cosl:
    case LibFunc_cos:
    case LibFunc_cosf:
      return !Op.isInfinity();

    case LibFunc_tanl:
    case LibFunc_tan:
    case LibFunc_tanf: {
      // FIXME: Stop using the host math library.
      // FIXME: The computation isn't done in the right precision.
      Type *Ty = OpC->getType();
      if (Ty->isDoubleTy() || Ty->isFloatTy() || Ty->isHalfTy())
        return ConstantFoldFP(tan, OpC->getValueAPF(), Ty) != nullptr;
      break;
    }

    case LibFunc_asinl:
    case LibFunc_asin:
    case LibFunc_asinf:
    case LibFunc_acosl:
    case LibFunc_acos:
    case LibFunc_acosf:
      return !(Op < APFloat(Op.getSemantics(), "-1") ||
               Op > APFloat(Op.getSemantics(), "1"));

    case LibFunc_sinh:
    case LibFunc_cosh:
    case LibFunc_sinhf:
    case LibFunc_coshf:
    case LibFunc_sinhl:
    case LibFunc_coshl:
      // FIXME: These boundaries are slightly conservative.
      if (OpC->getType()->isDoubleTy())
        return !(Op < APFloat(-710.0) || Op > APFloat(710.0));
      if (OpC->getType()->isFloatTy())
        return !(Op < APFloat(-89.0f) || Op > APFloat(89.0f));
      break;

    case LibFunc_sqrtl:
    case LibFunc_sqrt:
    case LibFunc_sqrtf:
      return Op.isNaN() || Op.isZero() || !Op.isNegative();

    // FIXME: Add more functions: sqrt_finite, atanh, expm1, log1p,
    // maybe others?
    default:
      break;
    }
  }
}

if (Call->getNumArgOperands() == 2) {
  ConstantFP *Op0C = dyn_cast<ConstantFP>(Call->getArgOperand(0));
  ConstantFP *Op1C = dyn_cast<ConstantFP>(Call->getArgOperand(1));
  if (Op0C && Op1C) {
    const APFloat &Op0 = Op0C->getValueAPF();
    const APFloat &Op1 = Op1C->getValueAPF();

    switch (Func) {
    case LibFunc_powl:
    case LibFunc_pow:
    case LibFunc_powf: {
      // FIXME: Stop using the host math library.
      // FIXME: The computation isn't done in the right precision.
      Type *Ty = Op0C->getType();
      if (Ty->isDoubleTy() || Ty->isFloatTy() || Ty->isHalfTy()) {
        if (Ty == Op1C->getType())
          return ConstantFoldBinaryFP(pow, Op0, Op1, Ty) != nullptr;
      }
      break;
    }

    case LibFunc_fmodl:
    case LibFunc_fmod:
    case LibFunc_fmodf:
    case LibFunc_remainderl:
    case LibFunc_remainder:
    case LibFunc_remainderf:
      return Op0.isNaN() || Op1.isNaN() ||
             (!Op0.isInfinity() && !Op1.isZero());

    default:
      break;
    }
  }
}

return false;
3213}

3215void TargetFolder::anchor() {}

←

/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h

→

1//===- llvm/Type.h - Classes for handling data types ------------*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8//
9// This file contains the declaration of the Type class.  For more "Type"
10// stuff, look in DerivedTypes.h.
11//
12//===----------------------------------------------------------------------===//

14#ifndef LLVM_IR_TYPE_H
15#define LLVM_IR_TYPE_H

17#include "llvm/ADT/APFloat.h"
18#include "llvm/ADT/ArrayRef.h"
19#include "llvm/ADT/SmallPtrSet.h"
20#include "llvm/Support/CBindingWrapping.h"
21#include "llvm/Support/Casting.h"
22#include "llvm/Support/Compiler.h"
23#include "llvm/Support/ErrorHandling.h"
24#include "llvm/Support/TypeSize.h"
25#include <cassert>
26#include <cstdint>
27#include <iterator>

29namespace llvm {

31class IntegerType;
32class LLVMContext;
33class PointerType;
34class raw_ostream;
35class StringRef;

37/// The instances of the Type class are immutable: once they are created,
38/// they are never changed.  Also note that only one instance of a particular
39/// type is ever created.  Thus seeing if two types are equal is a matter of
40/// doing a trivial pointer comparison. To enforce that no two equal instances
41/// are created, Type instances can only be created via static factory methods
42/// in class Type and in derived classes.  Once allocated, Types are never
43/// free'd.
44///
45class Type {
46public:
//===--------------------------------------------------------------------===//
/// Definitions of all of the base types for the Type system.  Based on this
/// value, you can cast to a class defined in DerivedTypes.h.
/// Note: If you add an element to this, you need to add an element to the
/// Type::getPrimitiveType function, or else things will break!
/// Also update LLVMTypeKind and LLVMGetTypeKind () in the C binding.
///
enum TypeID {
  // PrimitiveTypes
  HalfTyID = 0,  ///< 16-bit floating point type
  BFloatTyID,    ///< 16-bit floating point type (7-bit significand)
  FloatTyID,     ///< 32-bit floating point type
  DoubleTyID,    ///< 64-bit floating point type
  X86_FP80TyID,  ///< 80-bit floating point type (X87)
  FP128TyID,     ///< 128-bit floating point type (112-bit significand)
  PPC_FP128TyID, ///< 128-bit floating point type (two 64-bits, PowerPC)
  VoidTyID,      ///< type with no size
  LabelTyID,     ///< Labels
  MetadataTyID,  ///< Metadata
  X86_MMXTyID,   ///< MMX vectors (64 bits, X86 specific)
  X86_AMXTyID,   ///< AMX vectors (8192 bits, X86 specific)
  TokenTyID,     ///< Tokens

  // Derived types... see DerivedTypes.h file.
  IntegerTyID,       ///< Arbitrary bit width integers
  FunctionTyID,      ///< Functions
  PointerTyID,       ///< Pointers
  StructTyID,        ///< Structures
  ArrayTyID,         ///< Arrays
  FixedVectorTyID,   ///< Fixed width SIMD vector type
  ScalableVectorTyID ///< Scalable SIMD vector type
};

80private:
/// This refers to the LLVMContext in which this type was uniqued.
LLVMContext &Context;

TypeID   ID : 8;            // The current base type of this type.
unsigned SubclassData : 24; // Space for subclasses to store data.
                            // Note that this should be synchronized with
                            // MAX_INT_BITS value in IntegerType class.

89protected:
friend class LLVMContextImpl;

explicit Type(LLVMContext &C, TypeID tid)
  : Context(C), ID(tid), SubclassData(0) {}
~Type() = default;

unsigned getSubclassData() const { return SubclassData; }

void setSubclassData(unsigned val) {
  SubclassData = val;
  // Ensure we don't have any accidental truncation.
  assert(getSubclassData() == val && "Subclass data too large for field")(static_cast <bool> (getSubclassData() == val &&
 "Subclass data too large for field") ? void (0) : __assert_fail
 ("getSubclassData() == val && \"Subclass data too large for field\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 101, __extension__ __PRETTY_FUNCTION__));
}

/// Keeps track of how many Type*'s there are in the ContainedTys list.
unsigned NumContainedTys = 0;

/// A pointer to the array of Types contained by this Type. For example, this
/// includes the arguments of a function type, the elements of a structure,
/// the pointee of a pointer, the element type of an array, etc. This pointer
/// may be 0 for types that don't contain other types (Integer, Double,
/// Float).
Type * const *ContainedTys = nullptr;

114public:
/// Print the current type.
/// Omit the type details if \p NoDetails == true.
/// E.g., let %st = type { i32, i16 }
/// When \p NoDetails is true, we only print %st.
/// Put differently, \p NoDetails prints the type as if
/// inlined with the operands when printing an instruction.
void print(raw_ostream &O, bool IsForDebug = false,
           bool NoDetails = false) const;

void dump() const;

/// Return the LLVMContext in which this type was uniqued.
LLVMContext &getContext() const { return Context; }

//===--------------------------------------------------------------------===//
// Accessors for working with types.
//

/// Return the type id for the type. This will return one of the TypeID enum
/// elements defined above.
TypeID getTypeID() const { return ID; }

/// Return true if this is 'void'.
bool isVoidTy() const { return getTypeID() == VoidTyID; }

/// Return true if this is 'half', a 16-bit IEEE fp type.
bool isHalfTy() const { return getTypeID() == HalfTyID; }

/// Return true if this is 'bfloat', a 16-bit bfloat type.
bool isBFloatTy() const { return getTypeID() == BFloatTyID; }

/// Return true if this is 'float', a 32-bit IEEE fp type.
bool isFloatTy() const { return getTypeID() == FloatTyID; }

/// Return true if this is 'double', a 64-bit IEEE fp type.
bool isDoubleTy() const { return getTypeID() == DoubleTyID; }

/// Return true if this is x86 long double.
bool isX86_FP80Ty() const { return getTypeID() == X86_FP80TyID; }

/// Return true if this is 'fp128'.
bool isFP128Ty() const { return getTypeID() == FP128TyID; }

/// Return true if this is powerpc long double.
bool isPPC_FP128Ty() const { return getTypeID() == PPC_FP128TyID; }

/// Return true if this is one of the six floating-point types
bool isFloatingPointTy() const {
  return getTypeID() == HalfTyID || getTypeID() == BFloatTyID ||
4
←
Assuming the condition is false→
5
←
Assuming the condition is false→
11
←
Returning zero, which participates in a condition later→
         getTypeID() == FloatTyID || getTypeID() == DoubleTyID ||
6
←
Assuming the condition is false→
7
←
Assuming the condition is false→
         getTypeID() == X86_FP80TyID || getTypeID() == FP128TyID ||
8
←
Assuming the condition is false→
9
←
Assuming the condition is false→
         getTypeID() == PPC_FP128TyID;
10
←
Assuming the condition is false→
}

const fltSemantics &getFltSemantics() const {
  switch (getTypeID()) {
  case HalfTyID: return APFloat::IEEEhalf();
  case BFloatTyID: return APFloat::BFloat();
  case FloatTyID: return APFloat::IEEEsingle();
  case DoubleTyID: return APFloat::IEEEdouble();
  case X86_FP80TyID: return APFloat::x87DoubleExtended();
  case FP128TyID: return APFloat::IEEEquad();
  case PPC_FP128TyID: return APFloat::PPCDoubleDouble();
  default: llvm_unreachable("Invalid floating type")::llvm::llvm_unreachable_internal("Invalid floating type", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 178);
  }
}

/// Return true if this is X86 MMX.
bool isX86_MMXTy() const { return getTypeID() == X86_MMXTyID; }

/// Return true if this is X86 AMX.
bool isX86_AMXTy() const { return getTypeID() == X86_AMXTyID; }

/// Return true if this is a FP type or a vector of FP.
bool isFPOrFPVectorTy() const { return getScalarType()->isFloatingPointTy(); }

/// Return true if this is 'label'.
bool isLabelTy() const { return getTypeID() == LabelTyID; }

/// Return true if this is 'metadata'.
bool isMetadataTy() const { return getTypeID() == MetadataTyID; }

/// Return true if this is 'token'.
bool isTokenTy() const { return getTypeID() == TokenTyID; }

/// True if this is an instance of IntegerType.
bool isIntegerTy() const { return getTypeID() == IntegerTyID; }
17
←
Assuming the condition is true→
18
←
Returning the value 1, which participates in a condition later→
21
←
Assuming the condition is true→
22
←
Returning the value 1, which participates in a condition later→

/// Return true if this is an IntegerType of the given width.
bool isIntegerTy(unsigned Bitwidth) const;

/// Return true if this is an integer type or a vector of integer types.
bool isIntOrIntVectorTy() const { return getScalarType()->isIntegerTy(); }

/// Return true if this is an integer type or a vector of integer types of
/// the given width.
bool isIntOrIntVectorTy(unsigned BitWidth) const {
  return getScalarType()->isIntegerTy(BitWidth);
}

/// Return true if this is an integer type or a pointer type.
bool isIntOrPtrTy() const { return isIntegerTy() || isPointerTy(); }

/// True if this is an instance of FunctionType.
bool isFunctionTy() const { return getTypeID() == FunctionTyID; }

/// True if this is an instance of StructType.
bool isStructTy() const { return getTypeID() == StructTyID; }

/// True if this is an instance of ArrayType.
bool isArrayTy() const { return getTypeID() == ArrayTyID; }

/// True if this is an instance of PointerType.
bool isPointerTy() const { return getTypeID() == PointerTyID; }

/// True if this is an instance of an opaque PointerType.
bool isOpaquePointerTy() const;

/// Return true if this is a pointer type or a vector of pointer types.
bool isPtrOrPtrVectorTy() const { return getScalarType()->isPointerTy(); }

/// True if this is an instance of VectorType.
inline bool isVectorTy() const {
  return getTypeID() == ScalableVectorTyID || getTypeID() == FixedVectorTyID;
}

/// Return true if this type could be converted with a lossless BitCast to
/// type 'Ty'. For example, i8* to i32*. BitCasts are valid for types of the
/// same size only where no re-interpretation of the bits is done.
/// Determine if this type could be losslessly bitcast to Ty
bool canLosslesslyBitCastTo(Type *Ty) const;

/// Return true if this type is empty, that is, it has no elements or all of
/// its elements are empty.
bool isEmptyTy() const;

/// Return true if the type is "first class", meaning it is a valid type for a
/// Value.
bool isFirstClassType() const {
  return getTypeID() != FunctionTyID && getTypeID() != VoidTyID;
}

/// Return true if the type is a valid type for a register in codegen. This
/// includes all first-class types except struct and array types.
bool isSingleValueType() const {
  return isFloatingPointTy() || isX86_MMXTy() || isIntegerTy() ||
         isPointerTy() || isVectorTy() || isX86_AMXTy();
}

/// Return true if the type is an aggregate type. This means it is valid as
/// the first operand of an insertvalue or extractvalue instruction. This
/// includes struct and array types, but does not include vector types.
bool isAggregateType() const {
  return getTypeID() == StructTyID || getTypeID() == ArrayTyID;
}

/// Return true if it makes sense to take the size of this type. To get the
/// actual size for a particular target, it is reasonable to use the
/// DataLayout subsystem to do this.
bool isSized(SmallPtrSetImpl<Type*> *Visited = nullptr) const {
  // If it's a primitive, it is always sized.
  if (getTypeID() == IntegerTyID || isFloatingPointTy() ||
      getTypeID() == PointerTyID || getTypeID() == X86_MMXTyID ||
      getTypeID() == X86_AMXTyID)
    return true;
  // If it is not something that can have a size (e.g. a function or label),
  // it doesn't have a size.
  if (getTypeID() != StructTyID && getTypeID() != ArrayTyID && !isVectorTy())
    return false;
  // Otherwise we have to try harder to decide.
  return isSizedDerivedType(Visited);
}

/// Return the basic size of this type if it is a primitive type. These are
/// fixed by LLVM and are not target-dependent.
/// This will return zero if the type does not have a size or is not a
/// primitive type.
///
/// If this is a scalable vector type, the scalable property will be set and
/// the runtime size will be a positive integer multiple of the base size.
///
/// Note that this may not reflect the size of memory allocated for an
/// instance of the type or the number of bytes that are written when an
/// instance of the type is stored to memory. The DataLayout class provides
/// additional query functions to provide this information.
///
TypeSize getPrimitiveSizeInBits() const LLVM_READONLY__attribute__((__pure__));

/// If this is a vector type, return the getPrimitiveSizeInBits value for the
/// element type. Otherwise return the getPrimitiveSizeInBits value for this
/// type.
unsigned getScalarSizeInBits() const LLVM_READONLY__attribute__((__pure__));

/// Return the width of the mantissa of this type. This is only valid on
/// floating-point types. If the FP type does not have a stable mantissa (e.g.
/// ppc long double), this method returns -1.
int getFPMantissaWidth() const;

/// Return whether the type is IEEE compatible, as defined by the eponymous
/// method in APFloat.
bool isIEEE() const { return APFloat::getZero(getFltSemantics()).isIEEE(); }

/// If this is a vector type, return the element type, otherwise return
/// 'this'.
inline Type *getScalarType() const {
  if (isVectorTy())
    return getContainedType(0);
  return const_cast<Type *>(this);
}

//===--------------------------------------------------------------------===//
// Type Iteration support.
//
using subtype_iterator = Type * const *;

subtype_iterator subtype_begin() const { return ContainedTys; }
subtype_iterator subtype_end() const { return &ContainedTys[NumContainedTys];}
ArrayRef<Type*> subtypes() const {
  return makeArrayRef(subtype_begin(), subtype_end());
}

using subtype_reverse_iterator = std::reverse_iterator<subtype_iterator>;

subtype_reverse_iterator subtype_rbegin() const {
  return subtype_reverse_iterator(subtype_end());
}
subtype_reverse_iterator subtype_rend() const {
  return subtype_reverse_iterator(subtype_begin());
}

/// This method is used to implement the type iterator (defined at the end of
/// the file). For derived types, this returns the types 'contained' in the
/// derived type.
Type *getContainedType(unsigned i) const {
  assert(i < NumContainedTys && "Index out of range!")(static_cast <bool> (i < NumContainedTys && "Index out of range!"
) ? void (0) : __assert_fail ("i < NumContainedTys && \"Index out of range!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 349, __extension__ __PRETTY_FUNCTION__));
  return ContainedTys[i];
}

/// Return the number of types in the derived type.
unsigned getNumContainedTypes() const { return NumContainedTys; }

//===--------------------------------------------------------------------===//
// Helper methods corresponding to subclass methods.  This forces a cast to
// the specified subclass and calls its accessor.  "getArrayNumElements" (for
// example) is shorthand for cast<ArrayType>(Ty)->getNumElements().  This is
// only intended to cover the core methods that are frequently used, helper
// methods should not be added here.

inline unsigned getIntegerBitWidth() const;

inline Type *getFunctionParamType(unsigned i) const;
inline unsigned getFunctionNumParams() const;
inline bool isFunctionVarArg() const;

inline StringRef getStructName() const;
inline unsigned getStructNumElements() const;
inline Type *getStructElementType(unsigned N) const;

inline uint64_t getArrayNumElements() const;

Type *getArrayElementType() const {
  assert(getTypeID() == ArrayTyID)(static_cast <bool> (getTypeID() == ArrayTyID) ? void (
0) : __assert_fail ("getTypeID() == ArrayTyID", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 376, __extension__ __PRETTY_FUNCTION__));
  return ContainedTys[0];
}

Type *getPointerElementType() const {
  assert(getTypeID() == PointerTyID)(static_cast <bool> (getTypeID() == PointerTyID) ? void
 (0) : __assert_fail ("getTypeID() == PointerTyID", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 381, __extension__ __PRETTY_FUNCTION__));
  return ContainedTys[0];
}

/// Given vector type, change the element type,
/// whilst keeping the old number of elements.
/// For non-vectors simply returns \p EltTy.
inline Type *getWithNewType(Type *EltTy) const;

/// Given an integer or vector type, change the lane bitwidth to NewBitwidth,
/// whilst keeping the old number of lanes.
inline Type *getWithNewBitWidth(unsigned NewBitWidth) const;

/// Given scalar/vector integer type, returns a type with elements twice as
/// wide as in the original type. For vectors, preserves element count.
inline Type *getExtendedType() const;

/// Get the address space of this pointer or pointer vector type.
inline unsigned getPointerAddressSpace() const;

//===--------------------------------------------------------------------===//
// Static members exported by the Type class itself.  Useful for getting
// instances of Type.
//

/// Return a type based on an identifier.
static Type *getPrimitiveType(LLVMContext &C, TypeID IDNumber);

//===--------------------------------------------------------------------===//
// These are the builtin types that are always available.
//
static Type *getVoidTy(LLVMContext &C);
static Type *getLabelTy(LLVMContext &C);
static Type *getHalfTy(LLVMContext &C);
static Type *getBFloatTy(LLVMContext &C);
static Type *getFloatTy(LLVMContext &C);
static Type *getDoubleTy(LLVMContext &C);
static Type *getMetadataTy(LLVMContext &C);
static Type *getX86_FP80Ty(LLVMContext &C);
static Type *getFP128Ty(LLVMContext &C);
static Type *getPPC_FP128Ty(LLVMContext &C);
static Type *getX86_MMXTy(LLVMContext &C);
static Type *getX86_AMXTy(LLVMContext &C);
static Type *getTokenTy(LLVMContext &C);
static IntegerType *getIntNTy(LLVMContext &C, unsigned N);
static IntegerType *getInt1Ty(LLVMContext &C);
static IntegerType *getInt8Ty(LLVMContext &C);
static IntegerType *getInt16Ty(LLVMContext &C);
static IntegerType *getInt32Ty(LLVMContext &C);
static IntegerType *getInt64Ty(LLVMContext &C);
static IntegerType *getInt128Ty(LLVMContext &C);
template <typename ScalarTy> static Type *getScalarTy(LLVMContext &C) {
  int noOfBits = sizeof(ScalarTy) * CHAR_BIT8;
  if (std::is_integral<ScalarTy>::value) {
    return (Type*) Type::getIntNTy(C, noOfBits);
  } else if (std::is_floating_point<ScalarTy>::value) {
    switch (noOfBits) {
    case 32:
      return Type::getFloatTy(C);
    case 64:
      return Type::getDoubleTy(C);
    }
  }
  llvm_unreachable("Unsupported type in Type::getScalarTy")::llvm::llvm_unreachable_internal("Unsupported type in Type::getScalarTy"
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 444);
}
static Type *getFloatingPointTy(LLVMContext &C, const fltSemantics &S) {
  Type *Ty;
  if (&S == &APFloat::IEEEhalf())
    Ty = Type::getHalfTy(C);
  else if (&S == &APFloat::BFloat())
    Ty = Type::getBFloatTy(C);
  else if (&S == &APFloat::IEEEsingle())
    Ty = Type::getFloatTy(C);
  else if (&S == &APFloat::IEEEdouble())
    Ty = Type::getDoubleTy(C);
  else if (&S == &APFloat::x87DoubleExtended())
    Ty = Type::getX86_FP80Ty(C);
  else if (&S == &APFloat::IEEEquad())
    Ty = Type::getFP128Ty(C);
  else {
    assert(&S == &APFloat::PPCDoubleDouble() && "Unknown FP format")(static_cast <bool> (&S == &APFloat::PPCDoubleDouble
() && "Unknown FP format") ? void (0) : __assert_fail
 ("&S == &APFloat::PPCDoubleDouble() && \"Unknown FP format\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/IR/Type.h"
, 461, __extension__ __PRETTY_FUNCTION__));
    Ty = Type::getPPC_FP128Ty(C);
  }
  return Ty;
}

//===--------------------------------------------------------------------===//
// Convenience methods for getting pointer types with one of the above builtin
// types as pointee.
//
static PointerType *getHalfPtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getBFloatPtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getFloatPtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getDoublePtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getX86_FP80PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getFP128PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getPPC_FP128PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getX86_MMXPtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getX86_AMXPtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getIntNPtrTy(LLVMContext &C, unsigned N, unsigned AS = 0);
static PointerType *getInt1PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getInt8PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getInt16PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getInt32PtrTy(LLVMContext &C, unsigned AS = 0);
static PointerType *getInt64PtrTy(LLVMContext &C, unsigned AS = 0);

/// Return a pointer to the current type. This is equivalent to
/// PointerType::get(Foo, AddrSpace).
/// TODO: Remove this after opaque pointer transition is complete.
PointerType *getPointerTo(unsigned AddrSpace = 0) const;

492private:
/// Derived types like structures and arrays are sized iff all of the members
/// of the type are sized as well. Since asking for their size is relatively
/// uncommon, move this operation out-of-line.
bool isSizedDerivedType(SmallPtrSetImpl<Type*> *Visited = nullptr) const;
497};

499// Printing of types.
500inline raw_ostream &operator<<(raw_ostream &OS, const Type &T) {
T.print(OS);
return OS;
503}

505// allow isa<PointerType>(x) to work without DerivedTypes.h included.
506template <> struct isa_impl<PointerType, Type> {
static inline bool doit(const Type &Ty) {
  return Ty.getTypeID() == Type::PointerTyID;
}
510};

512// Create wrappers for C Binding types (see CBindingWrapping.h).
513DEFINE_ISA_CONVERSION_FUNCTIONS(Type, LLVMTypeRef)inline Type *unwrap(LLVMTypeRef P) { return reinterpret_cast<
Type*>(P); } inline LLVMTypeRef wrap(const Type *P) { return
 reinterpret_cast<LLVMTypeRef>(const_cast<Type*>(
P)); } template<typename T> inline T *unwrap(LLVMTypeRef
 P) { return cast<T>(unwrap(P)); }

515/* Specialized opaque type conversions.
*/
517inline Type **unwrap(LLVMTypeRef* Tys) {
return reinterpret_cast<Type**>(Tys);
519}

521inline LLVMTypeRef *wrap(Type **Tys) {
return reinterpret_cast<LLVMTypeRef*>(const_cast<Type**>(Tys));
523}

525} // end namespace llvm

527#endif // LLVM_IR_TYPE_H

←

/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h

1//===-- llvm/ADT/APInt.h - For Arbitrary Precision Integer -----*- C++ -*--===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8///
9/// \file
10/// This file implements a class to represent arbitrary precision
11/// integral constant values and operations on them.
12///
13//===----------------------------------------------------------------------===//

15#ifndef LLVM_ADT_APINT_H
16#define LLVM_ADT_APINT_H

18#include "llvm/Support/Compiler.h"
19#include "llvm/Support/MathExtras.h"
20#include <cassert>
21#include <climits>
22#include <cstring>
23#include <utility>

25namespace llvm {
26class FoldingSetNodeID;
27class StringRef;
28class hash_code;
29class raw_ostream;

31template <typename T> class SmallVectorImpl;
32template <typename T> class ArrayRef;
33template <typename T> class Optional;
34template <typename T> struct DenseMapInfo;

36class APInt;

38inline APInt operator-(APInt);

40//===----------------------------------------------------------------------===//
41//                              APInt Class
42//===----------------------------------------------------------------------===//

44/// Class for arbitrary precision integers.
45///
46/// APInt is a functional replacement for common case unsigned integer type like
47/// "unsigned", "unsigned long" or "uint64_t", but also allows non-byte-width
48/// integer sizes and large integer value types such as 3-bits, 15-bits, or more
49/// than 64-bits of precision. APInt provides a variety of arithmetic operators
50/// and methods to manipulate integer values of any bit-width. It supports both
51/// the typical integer arithmetic and comparison operations as well as bitwise
52/// manipulation.
53///
54/// The class has several invariants worth noting:
55///   * All bit, byte, and word positions are zero-based.
56///   * Once the bit width is set, it doesn't change except by the Truncate,
57///     SignExtend, or ZeroExtend operations.
58///   * All binary operators must be on APInt instances of the same bit width.
59///     Attempting to use these operators on instances with different bit
60///     widths will yield an assertion.
61///   * The value is stored canonically as an unsigned value. For operations
62///     where it makes a difference, there are both signed and unsigned variants
63///     of the operation. For example, sdiv and udiv. However, because the bit
64///     widths must be the same, operations such as Mul and Add produce the same
65///     results regardless of whether the values are interpreted as signed or
66///     not.
67///   * In general, the class tries to follow the style of computation that LLVM
68///     uses in its IR. This simplifies its use for LLVM.
69///
70class LLVM_NODISCARD[[clang::warn_unused_result]] APInt {
71public:
typedef uint64_t WordType;

/// This enum is used to hold the constants we needed for APInt.
enum : unsigned {
  /// Byte size of a word.
  APINT_WORD_SIZE = sizeof(WordType),
  /// Bits in a word.
  APINT_BITS_PER_WORD = APINT_WORD_SIZE * CHAR_BIT8
};

enum class Rounding {
  DOWN,
  TOWARD_ZERO,
  UP,
};

static constexpr WordType WORDTYPE_MAX = ~WordType(0);

90private:
/// This union is used to store the integer value. When the
/// integer bit-width <= 64, it uses VAL, otherwise it uses pVal.
union {
  uint64_t VAL;   ///< Used to store the <= 64 bits integer value.
  uint64_t *pVal; ///< Used to store the >64 bits integer value.
} U;

unsigned BitWidth; ///< The number of bits in this APInt.

friend struct DenseMapInfo<APInt>;

friend class APSInt;

/// Fast internal constructor
///
/// This constructor is used only internally for speed of construction of
/// temporaries. It is unsafe for general use so it is not public.
APInt(uint64_t *val, unsigned bits) : BitWidth(bits) {
  U.pVal = val;
}

/// Determine if this APInt just has one word to store value.
///
/// \returns true if the number of bits <= 64, false otherwise.
bool isSingleWord() const { return BitWidth52.1
Field 'BitWidth' is > APINT_BITS_PER_WORD
1
Field 'BitWidth' is > APINT_BITS_PER_WORD
1
Field 'BitWidth' is > APINT_BITS_PER_WORD
 <= APINT_BITS_PER_WORD; }
43
←
Assuming field 'BitWidth' is > APINT_BITS_PER_WORD→
44
←
Returning zero, which participates in a condition later→
53
←
Returning zero, which participates in a condition later→

/// Determine which word a bit is in.
///
/// \returns the word position for the specified bit position.
static unsigned whichWord(unsigned bitPosition) {
  return bitPosition / APINT_BITS_PER_WORD;
}

/// Determine which bit in a word a bit is in.
///
/// \returns the bit position in a word for the specified bit position
/// in the APInt.
static unsigned whichBit(unsigned bitPosition) {
  return bitPosition % APINT_BITS_PER_WORD;
}

/// Get a single bit mask.
///
/// \returns a uint64_t with only bit at "whichBit(bitPosition)" set
/// This method generates and returns a uint64_t (word) mask for a single
/// bit at a specific bit position. This is used to mask the bit in the
/// corresponding word.
static uint64_t maskBit(unsigned bitPosition) {
  return 1ULL << whichBit(bitPosition);
}

/// Clear unused high order bits
///
/// This method is used internally to clear the top "N" bits in the high order
/// word that are not used by the APInt. This is needed after the most
/// significant word is assigned a value to ensure that those bits are
/// zero'd out.
APInt &clearUnusedBits() {
  // Compute how many bits are used in the final word
  unsigned WordBits = ((BitWidth-1) % APINT_BITS_PER_WORD) + 1;

  // Mask out the high bits.
  uint64_t mask = WORDTYPE_MAX >> (APINT_BITS_PER_WORD - WordBits);
  if (isSingleWord())
    U.VAL &= mask;
  else
    U.pVal[getNumWords() - 1] &= mask;
  return *this;
}

/// Get the word corresponding to a bit position
/// \returns the corresponding word for the specified bit position.
uint64_t getWord(unsigned bitPosition) const {
  return isSingleWord() ? U.VAL : U.pVal[whichWord(bitPosition)];
}

/// Utility method to change the bit width of this APInt to new bit width,
/// allocating and/or deallocating as necessary. There is no guarantee on the
/// value of any bits upon return. Caller should populate the bits after.
void reallocate(unsigned NewBitWidth);

/// Convert a char array into an APInt
///
/// \param radix 2, 8, 10, 16, or 36
/// Converts a string into a number.  The string must be non-empty
/// and well-formed as a number of the given base. The bit-width
/// must be sufficient to hold the result.
///
/// This is used by the constructors that take string arguments.
///
/// StringRef::getAsInteger is superficially similar but (1) does
/// not assume that the string is well-formed and (2) grows the
/// result to hold the input.
void fromString(unsigned numBits, StringRef str, uint8_t radix);

/// An internal division function for dividing APInts.
///
/// This is used by the toString method to divide by the radix. It simply
/// provides a more convenient form of divide for internal use since KnuthDiv
/// has specific constraints on its inputs. If those constraints are not met
/// then it provides a simpler form of divide.
static void divide(const WordType *LHS, unsigned lhsWords,
                   const WordType *RHS, unsigned rhsWords, WordType *Quotient,
                   WordType *Remainder);

/// out-of-line slow case for inline constructor
void initSlowCase(uint64_t val, bool isSigned);

/// shared code between two array constructors
void initFromArray(ArrayRef<uint64_t> array);

/// out-of-line slow case for inline copy constructor
void initSlowCase(const APInt &that);

/// out-of-line slow case for shl
void shlSlowCase(unsigned ShiftAmt);

/// out-of-line slow case for lshr.
void lshrSlowCase(unsigned ShiftAmt);

/// out-of-line slow case for ashr.
void ashrSlowCase(unsigned ShiftAmt);

/// out-of-line slow case for operator=
void AssignSlowCase(const APInt &RHS);

/// out-of-line slow case for operator==
bool EqualSlowCase(const APInt &RHS) const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for countLeadingZeros
unsigned countLeadingZerosSlowCase() const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for countLeadingOnes.
unsigned countLeadingOnesSlowCase() const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for countTrailingZeros.
unsigned countTrailingZerosSlowCase() const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for countTrailingOnes
unsigned countTrailingOnesSlowCase() const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for countPopulation
unsigned countPopulationSlowCase() const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for intersects.
bool intersectsSlowCase(const APInt &RHS) const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for isSubsetOf.
bool isSubsetOfSlowCase(const APInt &RHS) const LLVM_READONLY__attribute__((__pure__));

/// out-of-line slow case for setBits.
void setBitsSlowCase(unsigned loBit, unsigned hiBit);

/// out-of-line slow case for flipAllBits.
void flipAllBitsSlowCase();

/// out-of-line slow case for operator&=.
void AndAssignSlowCase(const APInt& RHS);

/// out-of-line slow case for operator|=.
void OrAssignSlowCase(const APInt& RHS);

/// out-of-line slow case for operator^=.
void XorAssignSlowCase(const APInt& RHS);

/// Unsigned comparison. Returns -1, 0, or 1 if this APInt is less than, equal
/// to, or greater than RHS.
int compare(const APInt &RHS) const LLVM_READONLY__attribute__((__pure__));

/// Signed comparison. Returns -1, 0, or 1 if this APInt is less than, equal
/// to, or greater than RHS.
int compareSigned(const APInt &RHS) const LLVM_READONLY__attribute__((__pure__));

264public:
/// \name Constructors
/// @{

/// Create a new APInt of numBits width, initialized as val.
///
/// If isSigned is true then val is treated as if it were a signed value
/// (i.e. as an int64_t) and the appropriate sign extension to the bit width
/// will be done. Otherwise, no sign extension occurs (high order bits beyond
/// the range of val are zero filled).
///
/// \param numBits the bit width of the constructed APInt
/// \param val the initial value of the APInt
/// \param isSigned how to treat signedness of val
APInt(unsigned numBits, uint64_t val, bool isSigned = false)
    : BitWidth(numBits) {
  assert(BitWidth && "bitwidth too small")(static_cast <bool> (BitWidth && "bitwidth too small"
) ? void (0) : __assert_fail ("BitWidth && \"bitwidth too small\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 280, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord()) {
    U.VAL = val;
    clearUnusedBits();
  } else {
    initSlowCase(val, isSigned);
  }
}

/// Construct an APInt of numBits width, initialized as bigVal[].
///
/// Note that bigVal.size() can be smaller or larger than the corresponding
/// bit width but any extraneous bits will be dropped.
///
/// \param numBits the bit width of the constructed APInt
/// \param bigVal a sequence of words to form the initial value of the APInt
APInt(unsigned numBits, ArrayRef<uint64_t> bigVal);

/// Equivalent to APInt(numBits, ArrayRef<uint64_t>(bigVal, numWords)), but
/// deprecated because this constructor is prone to ambiguity with the
/// APInt(unsigned, uint64_t, bool) constructor.
///
/// If this overload is ever deleted, care should be taken to prevent calls
/// from being incorrectly captured by the APInt(unsigned, uint64_t, bool)
/// constructor.
APInt(unsigned numBits, unsigned numWords, const uint64_t bigVal[]);

/// Construct an APInt from a string representation.
///
/// This constructor interprets the string \p str in the given radix. The
/// interpretation stops when the first character that is not suitable for the
/// radix is encountered, or the end of the string. Acceptable radix values
/// are 2, 8, 10, 16, and 36. It is an error for the value implied by the
/// string to require more bits than numBits.
///
/// \param numBits the bit width of the constructed APInt
/// \param str the string to be interpreted
/// \param radix the radix to use for the conversion
APInt(unsigned numBits, StringRef str, uint8_t radix);

/// Simply makes *this a copy of that.
/// Copy Constructor.
APInt(const APInt &that) : BitWidth(that.BitWidth) {
  if (isSingleWord())
    U.VAL = that.U.VAL;
  else
    initSlowCase(that);
}

/// Move Constructor.
APInt(APInt &&that) : BitWidth(that.BitWidth) {
  memcpy(&U, &that.U, sizeof(U));
  that.BitWidth = 0;
}

/// Destructor.
~APInt() {
  if (needsCleanup())
    delete[] U.pVal;
}

/// Default constructor that creates an uninteresting APInt
/// representing a 1-bit zero value.
///
/// This is useful for object deserialization (pair this with the static
///  method Read).
explicit APInt() : BitWidth(1) { U.VAL = 0; }

/// Returns whether this instance allocated memory.
bool needsCleanup() const { return !isSingleWord(); }

/// Used to insert APInt objects, or objects that contain APInt objects, into
///  FoldingSets.
void Profile(FoldingSetNodeID &id) const;

/// @}
/// \name Value Tests
/// @{

/// Determine sign of this APInt.
///
/// This tests the high bit of this APInt to determine if it is set.
///
/// \returns true if this APInt is negative, false otherwise
bool isNegative() const { return (*this)[BitWidth - 1]; }

/// Determine if this APInt Value is non-negative (>= 0)
///
/// This tests the high bit of the APInt to determine if it is unset.
bool isNonNegative() const { return !isNegative(); }

/// Determine if sign bit of this APInt is set.
///
/// This tests the high bit of this APInt to determine if it is set.
///
/// \returns true if this APInt has its sign bit set, false otherwise.
bool isSignBitSet() const { return (*this)[BitWidth-1]; }

/// Determine if sign bit of this APInt is clear.
///
/// This tests the high bit of this APInt to determine if it is clear.
///
/// \returns true if this APInt has its sign bit clear, false otherwise.
bool isSignBitClear() const { return !isSignBitSet(); }

/// Determine if this APInt Value is positive.
///
/// This tests if the value of this APInt is positive (> 0). Note
/// that 0 is not a positive value.
///
/// \returns true if this APInt is positive.
bool isStrictlyPositive() const { return isNonNegative() && !isNullValue(); }

/// Determine if this APInt Value is non-positive (<= 0).
///
/// \returns true if this APInt is non-positive.
bool isNonPositive() const { return !isStrictlyPositive(); }

/// Determine if all bits are set
///
/// This checks to see if the value has all bits of the APInt are set or not.
bool isAllOnesValue() const {
  if (isSingleWord())
    return U.VAL == WORDTYPE_MAX >> (APINT_BITS_PER_WORD - BitWidth);
  return countTrailingOnesSlowCase() == BitWidth;
}

/// Determine if all bits are clear
///
/// This checks to see if the value has all bits of the APInt are clear or
/// not.
bool isNullValue() const { return !*this; }
51
←
Calling 'APInt::operator!'→
58
←
Returning from 'APInt::operator!'→
59
←
Returning zero, which participates in a condition later→

/// Determine if this is a value of 1.
///
/// This checks to see if the value of this APInt is one.
bool isOneValue() const {
  if (isSingleWord())
42
←
Calling 'APInt::isSingleWord'→
45
←
Returning from 'APInt::isSingleWord'→
46
←
Taking false branch→
    return U.VAL == 1;
  return countLeadingZerosSlowCase() == BitWidth - 1;
47
←
Assuming the condition is false→
48
←
Returning zero, which participates in a condition later→
}

/// Determine if this is the largest unsigned value.
///
/// This checks to see if the value of this APInt is the maximum unsigned
/// value for the APInt's bit width.
bool isMaxValue() const { return isAllOnesValue(); }

/// Determine if this is the largest signed value.
///
/// This checks to see if the value of this APInt is the maximum signed
/// value for the APInt's bit width.
bool isMaxSignedValue() const {
  if (isSingleWord())
    return U.VAL == ((WordType(1) << (BitWidth - 1)) - 1);
  return !isNegative() && countTrailingOnesSlowCase() == BitWidth - 1;
}

/// Determine if this is the smallest unsigned value.
///
/// This checks to see if the value of this APInt is the minimum unsigned
/// value for the APInt's bit width.
bool isMinValue() const { return isNullValue(); }

/// Determine if this is the smallest signed value.
///
/// This checks to see if the value of this APInt is the minimum signed
/// value for the APInt's bit width.
bool isMinSignedValue() const {
  if (isSingleWord())
    return U.VAL == (WordType(1) << (BitWidth - 1));
  return isNegative() && countTrailingZerosSlowCase() == BitWidth - 1;
}

/// Check if this APInt has an N-bits unsigned integer value.
bool isIntN(unsigned N) const {
  assert(N && "N == 0 ???")(static_cast <bool> (N && "N == 0 ???") ? void (
0) : __assert_fail ("N && \"N == 0 ???\"", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 456, __extension__ __PRETTY_FUNCTION__));
  return getActiveBits() <= N;
}

/// Check if this APInt has an N-bits signed integer value.
bool isSignedIntN(unsigned N) const {
  assert(N && "N == 0 ???")(static_cast <bool> (N && "N == 0 ???") ? void (
0) : __assert_fail ("N && \"N == 0 ???\"", "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 462, __extension__ __PRETTY_FUNCTION__));
  return getMinSignedBits() <= N;
}

/// Check if this APInt's value is a power of two greater than zero.
///
/// \returns true if the argument APInt value is a power of two > 0.
bool isPowerOf2() const {
  if (isSingleWord())
    return isPowerOf2_64(U.VAL);
  return countPopulationSlowCase() == 1;
}

/// Check if the APInt's value is returned by getSignMask.
///
/// \returns true if this is the value returned by getSignMask.
bool isSignMask() const { return isMinSignedValue(); }

/// Convert APInt to a boolean value.
///
/// This converts the APInt to a boolean value as a test against zero.
bool getBoolValue() const { return !!*this; }

/// If this value is smaller than the specified limit, return it, otherwise
/// return the limit value.  This causes the value to saturate to the limit.
uint64_t getLimitedValue(uint64_t Limit = UINT64_MAX(18446744073709551615UL)) const {
  return ugt(Limit) ? Limit : getZExtValue();
}

/// Check if the APInt consists of a repeated bit pattern.
///
/// e.g. 0x01010101 satisfies isSplat(8).
/// \param SplatSizeInBits The size of the pattern in bits. Must divide bit
/// width without remainder.
bool isSplat(unsigned SplatSizeInBits) const;

/// \returns true if this APInt value is a sequence of \param numBits ones
/// starting at the least significant bit with the remainder zero.
bool isMask(unsigned numBits) const {
  assert(numBits != 0 && "numBits must be non-zero")(static_cast <bool> (numBits != 0 && "numBits must be non-zero"
) ? void (0) : __assert_fail ("numBits != 0 && \"numBits must be non-zero\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 501, __extension__ __PRETTY_FUNCTION__));
  assert(numBits <= BitWidth && "numBits out of range")(static_cast <bool> (numBits <= BitWidth && "numBits out of range"
) ? void (0) : __assert_fail ("numBits <= BitWidth && \"numBits out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 502, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    return U.VAL == (WORDTYPE_MAX >> (APINT_BITS_PER_WORD - numBits));
  unsigned Ones = countTrailingOnesSlowCase();
  return (numBits == Ones) &&
         ((Ones + countLeadingZerosSlowCase()) == BitWidth);
}

/// \returns true if this APInt is a non-empty sequence of ones starting at
/// the least significant bit with the remainder zero.
/// Ex. isMask(0x0000FFFFU) == true.
bool isMask() const {
  if (isSingleWord())
    return isMask_64(U.VAL);
  unsigned Ones = countTrailingOnesSlowCase();
  return (Ones > 0) && ((Ones + countLeadingZerosSlowCase()) == BitWidth);
}

/// Return true if this APInt value contains a sequence of ones with
/// the remainder zero.
bool isShiftedMask() const {
  if (isSingleWord())
    return isShiftedMask_64(U.VAL);
  unsigned Ones = countPopulationSlowCase();
  unsigned LeadZ = countLeadingZerosSlowCase();
  return (Ones + LeadZ + countTrailingZeros()) == BitWidth;
}

/// @}
/// \name Value Generators
/// @{

/// Gets maximum unsigned value of APInt for specific bit width.
static APInt getMaxValue(unsigned numBits) {
  return getAllOnesValue(numBits);
}

/// Gets maximum signed value of APInt for a specific bit width.
static APInt getSignedMaxValue(unsigned numBits) {
  APInt API = getAllOnesValue(numBits);
  API.clearBit(numBits - 1);
  return API;
}

/// Gets minimum unsigned value of APInt for a specific bit width.
static APInt getMinValue(unsigned numBits) { return APInt(numBits, 0); }

/// Gets minimum signed value of APInt for a specific bit width.
static APInt getSignedMinValue(unsigned numBits) {
  APInt API(numBits, 0);
  API.setBit(numBits - 1);
  return API;
}

/// Get the SignMask for a specific bit width.
///
/// This is just a wrapper function of getSignedMinValue(), and it helps code
/// readability when we want to get a SignMask.
static APInt getSignMask(unsigned BitWidth) {
  return getSignedMinValue(BitWidth);
}

/// Get the all-ones value.
///
/// \returns the all-ones value for an APInt of the specified bit-width.
static APInt getAllOnesValue(unsigned numBits) {
  return APInt(numBits, WORDTYPE_MAX, true);
}

/// Get the '0' value.
///
/// \returns the '0' value for an APInt of the specified bit-width.
static APInt getNullValue(unsigned numBits) { return APInt(numBits, 0); }

/// Compute an APInt containing numBits highbits from this APInt.
///
/// Get an APInt with the same BitWidth as this APInt, just zero mask
/// the low bits and right shift to the least significant bit.
///
/// \returns the high "numBits" bits of this APInt.
APInt getHiBits(unsigned numBits) const;

/// Compute an APInt containing numBits lowbits from this APInt.
///
/// Get an APInt with the same BitWidth as this APInt, just zero mask
/// the high bits.
///
/// \returns the low "numBits" bits of this APInt.
APInt getLoBits(unsigned numBits) const;

/// Return an APInt with exactly one bit set in the result.
static APInt getOneBitSet(unsigned numBits, unsigned BitNo) {
  APInt Res(numBits, 0);
  Res.setBit(BitNo);
  return Res;
}

/// Get a value with a block of bits set.
///
/// Constructs an APInt value that has a contiguous range of bits set. The
/// bits from loBit (inclusive) to hiBit (exclusive) will be set. All other
/// bits will be zero. For example, with parameters(32, 0, 16) you would get
/// 0x0000FFFF. Please call getBitsSetWithWrap if \p loBit may be greater than
/// \p hiBit.
///
/// \param numBits the intended bit width of the result
/// \param loBit the index of the lowest bit set.
/// \param hiBit the index of the highest bit set.
///
/// \returns An APInt value with the requested bits set.
static APInt getBitsSet(unsigned numBits, unsigned loBit, unsigned hiBit) {
  assert(loBit <= hiBit && "loBit greater than hiBit")(static_cast <bool> (loBit <= hiBit && "loBit greater than hiBit"
) ? void (0) : __assert_fail ("loBit <= hiBit && \"loBit greater than hiBit\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 613, __extension__ __PRETTY_FUNCTION__));
  APInt Res(numBits, 0);
  Res.setBits(loBit, hiBit);
  return Res;
}

/// Wrap version of getBitsSet.
/// If \p hiBit is bigger than \p loBit, this is same with getBitsSet.
/// If \p hiBit is not bigger than \p loBit, the set bits "wrap". For example,
/// with parameters (32, 28, 4), you would get 0xF000000F.
/// If \p hiBit is equal to \p loBit, you would get a result with all bits
/// set.
static APInt getBitsSetWithWrap(unsigned numBits, unsigned loBit,
                                unsigned hiBit) {
  APInt Res(numBits, 0);
  Res.setBitsWithWrap(loBit, hiBit);
  return Res;
}

/// Get a value with upper bits starting at loBit set.
///
/// Constructs an APInt value that has a contiguous range of bits set. The
/// bits from loBit (inclusive) to numBits (exclusive) will be set. All other
/// bits will be zero. For example, with parameters(32, 12) you would get
/// 0xFFFFF000.
///
/// \param numBits the intended bit width of the result
/// \param loBit the index of the lowest bit to set.
///
/// \returns An APInt value with the requested bits set.
static APInt getBitsSetFrom(unsigned numBits, unsigned loBit) {
  APInt Res(numBits, 0);
  Res.setBitsFrom(loBit);
  return Res;
}

/// Get a value with high bits set
///
/// Constructs an APInt value that has the top hiBitsSet bits set.
///
/// \param numBits the bitwidth of the result
/// \param hiBitsSet the number of high-order bits set in the result.
static APInt getHighBitsSet(unsigned numBits, unsigned hiBitsSet) {
  APInt Res(numBits, 0);
  Res.setHighBits(hiBitsSet);
  return Res;
}

/// Get a value with low bits set
///
/// Constructs an APInt value that has the bottom loBitsSet bits set.
///
/// \param numBits the bitwidth of the result
/// \param loBitsSet the number of low-order bits set in the result.
static APInt getLowBitsSet(unsigned numBits, unsigned loBitsSet) {
  APInt Res(numBits, 0);
  Res.setLowBits(loBitsSet);
  return Res;
}

/// Return a value containing V broadcasted over NewLen bits.
static APInt getSplat(unsigned NewLen, const APInt &V);

/// Determine if two APInts have the same value, after zero-extending
/// one of them (if needed!) to ensure that the bit-widths match.
static bool isSameValue(const APInt &I1, const APInt &I2) {
  if (I1.getBitWidth() == I2.getBitWidth())
    return I1 == I2;

  if (I1.getBitWidth() > I2.getBitWidth())
    return I1 == I2.zext(I1.getBitWidth());

  return I1.zext(I2.getBitWidth()) == I2;
}

/// Overload to compute a hash_code for an APInt value.
friend hash_code hash_value(const APInt &Arg);

/// This function returns a pointer to the internal storage of the APInt.
/// This is useful for writing out the APInt in binary form without any
/// conversions.
const uint64_t *getRawData() const {
  if (isSingleWord())
    return &U.VAL;
  return &U.pVal[0];
}

/// @}
/// \name Unary Operators
/// @{

/// Postfix increment operator.
///
/// Increments *this by 1.
///
/// \returns a new APInt value representing the original value of *this.
const APInt operator++(int) {
  APInt API(*this);
  ++(*this);
  return API;
}

/// Prefix increment operator.
///
/// \returns *this incremented by one
APInt &operator++();

/// Postfix decrement operator.
///
/// Decrements *this by 1.
///
/// \returns a new APInt value representing the original value of *this.
const APInt operator--(int) {
  APInt API(*this);
  --(*this);
  return API;
}

/// Prefix decrement operator.
///
/// \returns *this decremented by one.
APInt &operator--();

/// Logical negation operator.
///
/// Performs logical negation operation on this APInt.
///
/// \returns true if *this is zero, false otherwise.
bool operator!() const {
  if (isSingleWord())
52
←
Calling 'APInt::isSingleWord'→
54
←
Returning from 'APInt::isSingleWord'→
55
←
Taking false branch→
    return U.VAL == 0;
  return countLeadingZerosSlowCase() == BitWidth;
56
←
Assuming the condition is false→
57
←
Returning zero, which participates in a condition later→
}

/// @}
/// \name Assignment Operators
/// @{

/// Copy assignment operator.
///
/// \returns *this after assignment of RHS.
APInt &operator=(const APInt &RHS) {
  // If the bitwidths are the same, we can avoid mucking with memory
  if (isSingleWord() && RHS.isSingleWord()) {
    U.VAL = RHS.U.VAL;
    BitWidth = RHS.BitWidth;
    return clearUnusedBits();
  }

  AssignSlowCase(RHS);
  return *this;
}

/// Move assignment operator.
APInt &operator=(APInt &&that) {
768#ifdef EXPENSIVE_CHECKS
  // Some std::shuffle implementations still do self-assignment.
  if (this == &that)
    return *this;
772#endif
  assert(this != &that && "Self-move not supported")(static_cast <bool> (this != &that && "Self-move not supported"
) ? void (0) : __assert_fail ("this != &that && \"Self-move not supported\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 773, __extension__ __PRETTY_FUNCTION__));
  if (!isSingleWord())
    delete[] U.pVal;

  // Use memcpy so that type based alias analysis sees both VAL and pVal
  // as modified.
  memcpy(&U, &that.U, sizeof(U));

  BitWidth = that.BitWidth;
  that.BitWidth = 0;

  return *this;
}

/// Assignment operator.
///
/// The RHS value is assigned to *this. If the significant bits in RHS exceed
/// the bit width, the excess bits are truncated. If the bit width is larger
/// than 64, the value is zero filled in the unspecified high order bits.
///
/// \returns *this after assignment of RHS value.
APInt &operator=(uint64_t RHS) {
  if (isSingleWord()) {
    U.VAL = RHS;
    return clearUnusedBits();
  }
  U.pVal[0] = RHS;
  memset(U.pVal + 1, 0, (getNumWords() - 1) * APINT_WORD_SIZE);
  return *this;
}

/// Bitwise AND assignment operator.
///
/// Performs a bitwise AND operation on this APInt and RHS. The result is
/// assigned to *this.
///
/// \returns *this after ANDing with RHS.
APInt &operator&=(const APInt &RHS) {
  assert(BitWidth == RHS.BitWidth && "Bit widths must be the same")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Bit widths must be the same") ? void (0) : __assert_fail ("BitWidth == RHS.BitWidth && \"Bit widths must be the same\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 811, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    U.VAL &= RHS.U.VAL;
  else
    AndAssignSlowCase(RHS);
  return *this;
}

/// Bitwise AND assignment operator.
///
/// Performs a bitwise AND operation on this APInt and RHS. RHS is
/// logically zero-extended or truncated to match the bit-width of
/// the LHS.
APInt &operator&=(uint64_t RHS) {
  if (isSingleWord()) {
    U.VAL &= RHS;
    return *this;
  }
  U.pVal[0] &= RHS;
  memset(U.pVal+1, 0, (getNumWords() - 1) * APINT_WORD_SIZE);
  return *this;
}

/// Bitwise OR assignment operator.
///
/// Performs a bitwise OR operation on this APInt and RHS. The result is
/// assigned *this;
///
/// \returns *this after ORing with RHS.
APInt &operator|=(const APInt &RHS) {
  assert(BitWidth == RHS.BitWidth && "Bit widths must be the same")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Bit widths must be the same") ? void (0) : __assert_fail ("BitWidth == RHS.BitWidth && \"Bit widths must be the same\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 841, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    U.VAL |= RHS.U.VAL;
  else
    OrAssignSlowCase(RHS);
  return *this;
}

/// Bitwise OR assignment operator.
///
/// Performs a bitwise OR operation on this APInt and RHS. RHS is
/// logically zero-extended or truncated to match the bit-width of
/// the LHS.
APInt &operator|=(uint64_t RHS) {
  if (isSingleWord()) {
    U.VAL |= RHS;
    return clearUnusedBits();
  }
  U.pVal[0] |= RHS;
  return *this;
}

/// Bitwise XOR assignment operator.
///
/// Performs a bitwise XOR operation on this APInt and RHS. The result is
/// assigned to *this.
///
/// \returns *this after XORing with RHS.
APInt &operator^=(const APInt &RHS) {
  assert(BitWidth == RHS.BitWidth && "Bit widths must be the same")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Bit widths must be the same") ? void (0) : __assert_fail ("BitWidth == RHS.BitWidth && \"Bit widths must be the same\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 870, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    U.VAL ^= RHS.U.VAL;
  else
    XorAssignSlowCase(RHS);
  return *this;
}

/// Bitwise XOR assignment operator.
///
/// Performs a bitwise XOR operation on this APInt and RHS. RHS is
/// logically zero-extended or truncated to match the bit-width of
/// the LHS.
APInt &operator^=(uint64_t RHS) {
  if (isSingleWord()) {
    U.VAL ^= RHS;
    return clearUnusedBits();
  }
  U.pVal[0] ^= RHS;
  return *this;
}

/// Multiplication assignment operator.
///
/// Multiplies this APInt by RHS and assigns the result to *this.
///
/// \returns *this
APInt &operator*=(const APInt &RHS);
APInt &operator*=(uint64_t RHS);

/// Addition assignment operator.
///
/// Adds RHS to *this and assigns the result to *this.
///
/// \returns *this
APInt &operator+=(const APInt &RHS);
APInt &operator+=(uint64_t RHS);

/// Subtraction assignment operator.
///
/// Subtracts RHS from *this and assigns the result to *this.
///
/// \returns *this
APInt &operator-=(const APInt &RHS);
APInt &operator-=(uint64_t RHS);

/// Left-shift assignment function.
///
/// Shifts *this left by shiftAmt and assigns the result to *this.
///
/// \returns *this after shifting left by ShiftAmt
APInt &operator<<=(unsigned ShiftAmt) {
  assert(ShiftAmt <= BitWidth && "Invalid shift amount")(static_cast <bool> (ShiftAmt <= BitWidth &&
 "Invalid shift amount") ? void (0) : __assert_fail ("ShiftAmt <= BitWidth && \"Invalid shift amount\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 922, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord()) {
    if (ShiftAmt == BitWidth)
      U.VAL = 0;
    else
      U.VAL <<= ShiftAmt;
    return clearUnusedBits();
  }
  shlSlowCase(ShiftAmt);
  return *this;
}

/// Left-shift assignment function.
///
/// Shifts *this left by shiftAmt and assigns the result to *this.
///
/// \returns *this after shifting left by ShiftAmt
APInt &operator<<=(const APInt &ShiftAmt);

/// @}
/// \name Binary Operators
/// @{

/// Multiplication operator.
///
/// Multiplies this APInt by RHS and returns the result.
APInt operator*(const APInt &RHS) const;

/// Left logical shift operator.
///
/// Shifts this APInt left by \p Bits and returns the result.
APInt operator<<(unsigned Bits) const { return shl(Bits); }

/// Left logical shift operator.
///
/// Shifts this APInt left by \p Bits and returns the result.
APInt operator<<(const APInt &Bits) const { return shl(Bits); }

/// Arithmetic right-shift function.
///
/// Arithmetic right-shift this APInt by shiftAmt.
APInt ashr(unsigned ShiftAmt) const {
  APInt R(*this);
  R.ashrInPlace(ShiftAmt);
  return R;
}

/// Arithmetic right-shift this APInt by ShiftAmt in place.
void ashrInPlace(unsigned ShiftAmt) {
  assert(ShiftAmt <= BitWidth && "Invalid shift amount")(static_cast <bool> (ShiftAmt <= BitWidth &&
 "Invalid shift amount") ? void (0) : __assert_fail ("ShiftAmt <= BitWidth && \"Invalid shift amount\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 971, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord()) {
    int64_t SExtVAL = SignExtend64(U.VAL, BitWidth);
    if (ShiftAmt == BitWidth)
      U.VAL = SExtVAL >> (APINT_BITS_PER_WORD - 1); // Fill with sign bit.
    else
      U.VAL = SExtVAL >> ShiftAmt;
    clearUnusedBits();
    return;
  }
  ashrSlowCase(ShiftAmt);
}

/// Logical right-shift function.
///
/// Logical right-shift this APInt by shiftAmt.
APInt lshr(unsigned shiftAmt) const {
  APInt R(*this);
  R.lshrInPlace(shiftAmt);
  return R;
}

/// Logical right-shift this APInt by ShiftAmt in place.
void lshrInPlace(unsigned ShiftAmt) {
  assert(ShiftAmt <= BitWidth && "Invalid shift amount")(static_cast <bool> (ShiftAmt <= BitWidth &&
 "Invalid shift amount") ? void (0) : __assert_fail ("ShiftAmt <= BitWidth && \"Invalid shift amount\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 995, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord()) {
    if (ShiftAmt == BitWidth)
      U.VAL = 0;
    else
      U.VAL >>= ShiftAmt;
    return;
  }
  lshrSlowCase(ShiftAmt);
}

/// Left-shift function.
///
/// Left-shift this APInt by shiftAmt.
APInt shl(unsigned shiftAmt) const {
  APInt R(*this);
  R <<= shiftAmt;
  return R;
}

/// Rotate left by rotateAmt.
APInt rotl(unsigned rotateAmt) const;

/// Rotate right by rotateAmt.
APInt rotr(unsigned rotateAmt) const;

/// Arithmetic right-shift function.
///
/// Arithmetic right-shift this APInt by shiftAmt.
APInt ashr(const APInt &ShiftAmt) const {
  APInt R(*this);
  R.ashrInPlace(ShiftAmt);
  return R;
}

/// Arithmetic right-shift this APInt by shiftAmt in place.
void ashrInPlace(const APInt &shiftAmt);

/// Logical right-shift function.
///
/// Logical right-shift this APInt by shiftAmt.
APInt lshr(const APInt &ShiftAmt) const {
  APInt R(*this);
  R.lshrInPlace(ShiftAmt);
  return R;
}

/// Logical right-shift this APInt by ShiftAmt in place.
void lshrInPlace(const APInt &ShiftAmt);

/// Left-shift function.
///
/// Left-shift this APInt by shiftAmt.
APInt shl(const APInt &ShiftAmt) const {
  APInt R(*this);
  R <<= ShiftAmt;
  return R;
}

/// Rotate left by rotateAmt.
APInt rotl(const APInt &rotateAmt) const;

/// Rotate right by rotateAmt.
APInt rotr(const APInt &rotateAmt) const;

/// Unsigned division operation.
///
/// Perform an unsigned divide operation on this APInt by RHS. Both this and
/// RHS are treated as unsigned quantities for purposes of this division.
///
/// \returns a new APInt value containing the division result, rounded towards
/// zero.
APInt udiv(const APInt &RHS) const;
APInt udiv(uint64_t RHS) const;

/// Signed division function for APInt.
///
/// Signed divide this APInt by APInt RHS.
///
/// The result is rounded towards zero.
APInt sdiv(const APInt &RHS) const;
APInt sdiv(int64_t RHS) const;

/// Unsigned remainder operation.
///
/// Perform an unsigned remainder operation on this APInt with RHS being the
/// divisor. Both this and RHS are treated as unsigned quantities for purposes
/// of this operation. Note that this is a true remainder operation and not a
/// modulo operation because the sign follows the sign of the dividend which
/// is *this.
///
/// \returns a new APInt value containing the remainder result
APInt urem(const APInt &RHS) const;
uint64_t urem(uint64_t RHS) const;

/// Function for signed remainder operation.
///
/// Signed remainder operation on APInt.
APInt srem(const APInt &RHS) const;
int64_t srem(int64_t RHS) const;

/// Dual division/remainder interface.
///
/// Sometimes it is convenient to divide two APInt values and obtain both the
/// quotient and remainder. This function does both operations in the same
/// computation making it a little more efficient. The pair of input arguments
/// may overlap with the pair of output arguments. It is safe to call
/// udivrem(X, Y, X, Y), for example.
static void udivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
                    APInt &Remainder);
static void udivrem(const APInt &LHS, uint64_t RHS, APInt &Quotient,
                    uint64_t &Remainder);

static void sdivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient,
                    APInt &Remainder);
static void sdivrem(const APInt &LHS, int64_t RHS, APInt &Quotient,
                    int64_t &Remainder);

// Operations that return overflow indicators.
APInt sadd_ov(const APInt &RHS, bool &Overflow) const;
APInt uadd_ov(const APInt &RHS, bool &Overflow) const;
APInt ssub_ov(const APInt &RHS, bool &Overflow) const;
APInt usub_ov(const APInt &RHS, bool &Overflow) const;
APInt sdiv_ov(const APInt &RHS, bool &Overflow) const;
APInt smul_ov(const APInt &RHS, bool &Overflow) const;
APInt umul_ov(const APInt &RHS, bool &Overflow) const;
APInt sshl_ov(const APInt &Amt, bool &Overflow) const;
APInt ushl_ov(const APInt &Amt, bool &Overflow) const;

// Operations that saturate
APInt sadd_sat(const APInt &RHS) const;
APInt uadd_sat(const APInt &RHS) const;
APInt ssub_sat(const APInt &RHS) const;
APInt usub_sat(const APInt &RHS) const;
APInt smul_sat(const APInt &RHS) const;
APInt umul_sat(const APInt &RHS) const;
APInt sshl_sat(const APInt &RHS) const;
APInt ushl_sat(const APInt &RHS) const;

/// Array-indexing support.
///
/// \returns the bit value at bitPosition
bool operator[](unsigned bitPosition) const {
  assert(bitPosition < getBitWidth() && "Bit position out of bounds!")(static_cast <bool> (bitPosition < getBitWidth() &&
 "Bit position out of bounds!") ? void (0) : __assert_fail ("bitPosition < getBitWidth() && \"Bit position out of bounds!\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1138, __extension__ __PRETTY_FUNCTION__));
  return (maskBit(bitPosition) & getWord(bitPosition)) != 0;
}

/// @}
/// \name Comparison Operators
/// @{

/// Equality operator.
///
/// Compares this APInt with RHS for the validity of the equality
/// relationship.
bool operator==(const APInt &RHS) const {
  assert(BitWidth == RHS.BitWidth && "Comparison requires equal bit widths")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Comparison requires equal bit widths") ? void (0) : __assert_fail
 ("BitWidth == RHS.BitWidth && \"Comparison requires equal bit widths\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1151, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    return U.VAL == RHS.U.VAL;
  return EqualSlowCase(RHS);
}

/// Equality operator.
///
/// Compares this APInt with a uint64_t for the validity of the equality
/// relationship.
///
/// \returns true if *this == Val
bool operator==(uint64_t Val) const {
  return (isSingleWord() || getActiveBits() <= 64) && getZExtValue() == Val;
}

/// Equality comparison.
///
/// Compares this APInt with RHS for the validity of the equality
/// relationship.
///
/// \returns true if *this == Val
bool eq(const APInt &RHS) const { return (*this) == RHS; }

/// Inequality operator.
///
/// Compares this APInt with RHS for the validity of the inequality
/// relationship.
///
/// \returns true if *this != Val
bool operator!=(const APInt &RHS) const { return !((*this) == RHS); }

/// Inequality operator.
///
/// Compares this APInt with a uint64_t for the validity of the inequality
/// relationship.
///
/// \returns true if *this != Val
bool operator!=(uint64_t Val) const { return !((*this) == Val); }

/// Inequality comparison
///
/// Compares this APInt with RHS for the validity of the inequality
/// relationship.
///
/// \returns true if *this != Val
bool ne(const APInt &RHS) const { return !((*this) == RHS); }

/// Unsigned less than comparison
///
/// Regards both *this and RHS as unsigned quantities and compares them for
/// the validity of the less-than relationship.
///
/// \returns true if *this < RHS when both are considered unsigned.
bool ult(const APInt &RHS) const { return compare(RHS) < 0; }

/// Unsigned less than comparison
///
/// Regards both *this as an unsigned quantity and compares it with RHS for
/// the validity of the less-than relationship.
///
/// \returns true if *this < RHS when considered unsigned.
bool ult(uint64_t RHS) const {
  // Only need to check active bits if not a single word.
  return (isSingleWord() || getActiveBits() <= 64) && getZExtValue() < RHS;
}

/// Signed less than comparison
///
/// Regards both *this and RHS as signed quantities and compares them for
/// validity of the less-than relationship.
///
/// \returns true if *this < RHS when both are considered signed.
bool slt(const APInt &RHS) const { return compareSigned(RHS) < 0; }

/// Signed less than comparison
///
/// Regards both *this as a signed quantity and compares it with RHS for
/// the validity of the less-than relationship.
///
/// \returns true if *this < RHS when considered signed.
bool slt(int64_t RHS) const {
  return (!isSingleWord() && getMinSignedBits() > 64) ? isNegative()
                                                      : getSExtValue() < RHS;
}

/// Unsigned less or equal comparison
///
/// Regards both *this and RHS as unsigned quantities and compares them for
/// validity of the less-or-equal relationship.
///
/// \returns true if *this <= RHS when both are considered unsigned.
bool ule(const APInt &RHS) const { return compare(RHS) <= 0; }

/// Unsigned less or equal comparison
///
/// Regards both *this as an unsigned quantity and compares it with RHS for
/// the validity of the less-or-equal relationship.
///
/// \returns true if *this <= RHS when considered unsigned.
bool ule(uint64_t RHS) const { return !ugt(RHS); }

/// Signed less or equal comparison
///
/// Regards both *this and RHS as signed quantities and compares them for
/// validity of the less-or-equal relationship.
///
/// \returns true if *this <= RHS when both are considered signed.
bool sle(const APInt &RHS) const { return compareSigned(RHS) <= 0; }

/// Signed less or equal comparison
///
/// Regards both *this as a signed quantity and compares it with RHS for the
/// validity of the less-or-equal relationship.
///
/// \returns true if *this <= RHS when considered signed.
bool sle(uint64_t RHS) const { return !sgt(RHS); }

/// Unsigned greater than comparison
///
/// Regards both *this and RHS as unsigned quantities and compares them for
/// the validity of the greater-than relationship.
///
/// \returns true if *this > RHS when both are considered unsigned.
bool ugt(const APInt &RHS) const { return !ule(RHS); }

/// Unsigned greater than comparison
///
/// Regards both *this as an unsigned quantity and compares it with RHS for
/// the validity of the greater-than relationship.
///
/// \returns true if *this > RHS when considered unsigned.
bool ugt(uint64_t RHS) const {
  // Only need to check active bits if not a single word.
  return (!isSingleWord() && getActiveBits() > 64) || getZExtValue() > RHS;
}

/// Signed greater than comparison
///
/// Regards both *this and RHS as signed quantities and compares them for the
/// validity of the greater-than relationship.
///
/// \returns true if *this > RHS when both are considered signed.
bool sgt(const APInt &RHS) const { return !sle(RHS); }

/// Signed greater than comparison
///
/// Regards both *this as a signed quantity and compares it with RHS for
/// the validity of the greater-than relationship.
///
/// \returns true if *this > RHS when considered signed.
bool sgt(int64_t RHS) const {
  return (!isSingleWord() && getMinSignedBits() > 64) ? !isNegative()
                                                      : getSExtValue() > RHS;
}

/// Unsigned greater or equal comparison
///
/// Regards both *this and RHS as unsigned quantities and compares them for
/// validity of the greater-or-equal relationship.
///
/// \returns true if *this >= RHS when both are considered unsigned.
bool uge(const APInt &RHS) const { return !ult(RHS); }

/// Unsigned greater or equal comparison
///
/// Regards both *this as an unsigned quantity and compares it with RHS for
/// the validity of the greater-or-equal relationship.
///
/// \returns true if *this >= RHS when considered unsigned.
bool uge(uint64_t RHS) const { return !ult(RHS); }

/// Signed greater or equal comparison
///
/// Regards both *this and RHS as signed quantities and compares them for
/// validity of the greater-or-equal relationship.
///
/// \returns true if *this >= RHS when both are considered signed.
bool sge(const APInt &RHS) const { return !slt(RHS); }

/// Signed greater or equal comparison
///
/// Regards both *this as a signed quantity and compares it with RHS for
/// the validity of the greater-or-equal relationship.
///
/// \returns true if *this >= RHS when considered signed.
bool sge(int64_t RHS) const { return !slt(RHS); }

/// This operation tests if there are any pairs of corresponding bits
/// between this APInt and RHS that are both set.
bool intersects(const APInt &RHS) const {
  assert(BitWidth == RHS.BitWidth && "Bit widths must be the same")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Bit widths must be the same") ? void (0) : __assert_fail ("BitWidth == RHS.BitWidth && \"Bit widths must be the same\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1342, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    return (U.VAL & RHS.U.VAL) != 0;
  return intersectsSlowCase(RHS);
}

/// This operation checks that all bits set in this APInt are also set in RHS.
bool isSubsetOf(const APInt &RHS) const {
  assert(BitWidth == RHS.BitWidth && "Bit widths must be the same")(static_cast <bool> (BitWidth == RHS.BitWidth &&
 "Bit widths must be the same") ? void (0) : __assert_fail ("BitWidth == RHS.BitWidth && \"Bit widths must be the same\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1350, __extension__ __PRETTY_FUNCTION__));
  if (isSingleWord())
    return (U.VAL & ~RHS.U.VAL) == 0;
  return isSubsetOfSlowCase(RHS);
}

/// @}
/// \name Resizing Operators
/// @{

/// Truncate to new width.
///
/// Truncate the APInt to a specified width. It is an error to specify a width
/// that is greater than or equal to the current width.
APInt trunc(unsigned width) const;

/// Truncate to new width with unsigned saturation.
///
/// If the APInt, treated as unsigned integer, can be losslessly truncated to
/// the new bitwidth, then return truncated APInt. Else, return max value.
APInt truncUSat(unsigned width) const;

/// Truncate to new width with signed saturation.
///
/// If this APInt, treated as signed integer, can be losslessly truncated to
/// the new bitwidth, then return truncated APInt. Else, return either
/// signed min value if the APInt was negative, or signed max value.
APInt truncSSat(unsigned width) const;

/// Sign extend to a new width.
///
/// This operation sign extends the APInt to a new width. If the high order
/// bit is set, the fill on the left will be done with 1 bits, otherwise zero.
/// It is an error to specify a width that is less than or equal to the
/// current width.
APInt sext(unsigned width) const;

/// Zero extend to a new width.
///
/// This operation zero extends the APInt to a new width. The high order bits
/// are filled with 0 bits.  It is an error to specify a width that is less
/// than or equal to the current width.
APInt zext(unsigned width) const;

/// Sign extend or truncate to width
///
/// Make this APInt have the bit width given by \p width. The value is sign
/// extended, truncated, or left alone to make it that width.
APInt sextOrTrunc(unsigned width) const;

/// Zero extend or truncate to width
///
/// Make this APInt have the bit width given by \p width. The value is zero
/// extended, truncated, or left alone to make it that width.
APInt zextOrTrunc(unsigned width) const;

/// Truncate to width
///
/// Make this APInt have the bit width given by \p width. The value is
/// truncated or left alone to make it that width.
APInt truncOrSelf(unsigned width) const;

/// Sign extend or truncate to width
///
/// Make this APInt have the bit width given by \p width. The value is sign
/// extended, or left alone to make it that width.
APInt sextOrSelf(unsigned width) const;

/// Zero extend or truncate to width
///
/// Make this APInt have the bit width given by \p width. The value is zero
/// extended, or left alone to make it that width.
APInt zextOrSelf(unsigned width) const;

/// @}
/// \name Bit Manipulation Operators
/// @{

/// Set every bit to 1.
void setAllBits() {
  if (isSingleWord())
    U.VAL = WORDTYPE_MAX;
  else
    // Set all the bits in all the words.
    memset(U.pVal, -1, getNumWords() * APINT_WORD_SIZE);
  // Clear the unused ones
  clearUnusedBits();
}

/// Set a given bit to 1.
///
/// Set the given bit to 1 whose position is given as "bitPosition".
void setBit(unsigned BitPosition) {
  assert(BitPosition < BitWidth && "BitPosition out of range")(static_cast <bool> (BitPosition < BitWidth &&
 "BitPosition out of range") ? void (0) : __assert_fail ("BitPosition < BitWidth && \"BitPosition out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1443, __extension__ __PRETTY_FUNCTION__));
  WordType Mask = maskBit(BitPosition);
  if (isSingleWord())
    U.VAL |= Mask;
  else
    U.pVal[whichWord(BitPosition)] |= Mask;
}

/// Set the sign bit to 1.
void setSignBit() {
  setBit(BitWidth - 1);
}

/// Set a given bit to a given value.
void setBitVal(unsigned BitPosition, bool BitValue) {
  if (BitValue)
    setBit(BitPosition);
  else
    clearBit(BitPosition);
}

/// Set the bits from loBit (inclusive) to hiBit (exclusive) to 1.
/// This function handles "wrap" case when \p loBit >= \p hiBit, and calls
/// setBits when \p loBit < \p hiBit.
/// For \p loBit == \p hiBit wrap case, set every bit to 1.
void setBitsWithWrap(unsigned loBit, unsigned hiBit) {
  assert(hiBit <= BitWidth && "hiBit out of range")(static_cast <bool> (hiBit <= BitWidth && "hiBit out of range"
) ? void (0) : __assert_fail ("hiBit <= BitWidth && \"hiBit out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1469, __extension__ __PRETTY_FUNCTION__));
  assert(loBit <= BitWidth && "loBit out of range")(static_cast <bool> (loBit <= BitWidth && "loBit out of range"
) ? void (0) : __assert_fail ("loBit <= BitWidth && \"loBit out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1470, __extension__ __PRETTY_FUNCTION__));
  if (loBit < hiBit) {
    setBits(loBit, hiBit);
    return;
  }
  setLowBits(hiBit);
  setHighBits(BitWidth - loBit);
}

/// Set the bits from loBit (inclusive) to hiBit (exclusive) to 1.
/// This function handles case when \p loBit <= \p hiBit.
void setBits(unsigned loBit, unsigned hiBit) {
  assert(hiBit <= BitWidth && "hiBit out of range")(static_cast <bool> (hiBit <= BitWidth && "hiBit out of range"
) ? void (0) : __assert_fail ("hiBit <= BitWidth && \"hiBit out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1482, __extension__ __PRETTY_FUNCTION__));
  assert(loBit <= BitWidth && "loBit out of range")(static_cast <bool> (loBit <= BitWidth && "loBit out of range"
) ? void (0) : __assert_fail ("loBit <= BitWidth && \"loBit out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1483, __extension__ __PRETTY_FUNCTION__));
  assert(loBit <= hiBit && "loBit greater than hiBit")(static_cast <bool> (loBit <= hiBit && "loBit greater than hiBit"
) ? void (0) : __assert_fail ("loBit <= hiBit && \"loBit greater than hiBit\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1484, __extension__ __PRETTY_FUNCTION__));
  if (loBit == hiBit)
    return;
  if (loBit < APINT_BITS_PER_WORD && hiBit <= APINT_BITS_PER_WORD) {
    uint64_t mask = WORDTYPE_MAX >> (APINT_BITS_PER_WORD - (hiBit - loBit));
    mask <<= loBit;
    if (isSingleWord())
      U.VAL |= mask;
    else
      U.pVal[0] |= mask;
  } else {
    setBitsSlowCase(loBit, hiBit);
  }
}

/// Set the top bits starting from loBit.
void setBitsFrom(unsigned loBit) {
  return setBits(loBit, BitWidth);
}

/// Set the bottom loBits bits.
void setLowBits(unsigned loBits) {
  return setBits(0, loBits);
}

/// Set the top hiBits bits.
void setHighBits(unsigned hiBits) {
  return setBits(BitWidth - hiBits, BitWidth);
}

/// Set every bit to 0.
void clearAllBits() {
  if (isSingleWord())
    U.VAL = 0;
  else
    memset(U.pVal, 0, getNumWords() * APINT_WORD_SIZE);
}

/// Set a given bit to 0.
///
/// Set the given bit to 0 whose position is given as "bitPosition".
void clearBit(unsigned BitPosition) {
  assert(BitPosition < BitWidth && "BitPosition out of range")(static_cast <bool> (BitPosition < BitWidth &&
 "BitPosition out of range") ? void (0) : __assert_fail ("BitPosition < BitWidth && \"BitPosition out of range\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1526, __extension__ __PRETTY_FUNCTION__));
  WordType Mask = ~maskBit(BitPosition);
  if (isSingleWord())
    U.VAL &= Mask;
  else
    U.pVal[whichWord(BitPosition)] &= Mask;
}

/// Set bottom loBits bits to 0.
void clearLowBits(unsigned loBits) {
  assert(loBits <= BitWidth && "More bits than bitwidth")(static_cast <bool> (loBits <= BitWidth && "More bits than bitwidth"
) ? void (0) : __assert_fail ("loBits <= BitWidth && \"More bits than bitwidth\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1536, __extension__ __PRETTY_FUNCTION__));
  APInt Keep = getHighBitsSet(BitWidth, BitWidth - loBits);
  *this &= Keep;
}

/// Set the sign bit to 0.
void clearSignBit() {
  clearBit(BitWidth - 1);
}

/// Toggle every bit to its opposite value.
void flipAllBits() {
  if (isSingleWord()) {
    U.VAL ^= WORDTYPE_MAX;
    clearUnusedBits();
  } else {
    flipAllBitsSlowCase();
  }
}

/// Toggles a given bit to its opposite value.
///
/// Toggle a given bit to its opposite value whose position is given
/// as "bitPosition".
void flipBit(unsigned bitPosition);

/// Negate this APInt in place.
void negate() {
  flipAllBits();
  ++(*this);
}

/// Insert the bits from a smaller APInt starting at bitPosition.
void insertBits(const APInt &SubBits, unsigned bitPosition);
void insertBits(uint64_t SubBits, unsigned bitPosition, unsigned numBits);

/// Return an APInt with the extracted bits [bitPosition,bitPosition+numBits).
APInt extractBits(unsigned numBits, unsigned bitPosition) const;
uint64_t extractBitsAsZExtValue(unsigned numBits, unsigned bitPosition) const;

/// @}
/// \name Value Characterization Functions
/// @{

/// Return the number of bits in the APInt.
unsigned getBitWidth() const { return BitWidth; }

/// Get the number of words.
///
/// Here one word's bitwidth equals to that of uint64_t.
///
/// \returns the number of words to hold the integer value of this APInt.
unsigned getNumWords() const { return getNumWords(BitWidth); }

/// Get the number of words.
///
/// *NOTE* Here one word's bitwidth equals to that of uint64_t.
///
/// \returns the number of words to hold the integer value with a given bit
/// width.
static unsigned getNumWords(unsigned BitWidth) {
  return ((uint64_t)BitWidth + APINT_BITS_PER_WORD - 1) / APINT_BITS_PER_WORD;
}

/// Compute the number of active bits in the value
///
/// This function returns the number of active bits which is defined as the
/// bit width minus the number of leading zeros. This is used in several
/// computations to see how "wide" the value is.
unsigned getActiveBits() const { return BitWidth - countLeadingZeros(); }

/// Compute the number of active words in the value of this APInt.
///
/// This is used in conjunction with getActiveData to extract the raw value of
/// the APInt.
unsigned getActiveWords() const {
  unsigned numActiveBits = getActiveBits();
  return numActiveBits ? whichWord(numActiveBits - 1) + 1 : 1;
}

/// Get the minimum bit size for this signed APInt
///
/// Computes the minimum bit width for this APInt while considering it to be a
/// signed (and probably negative) value. If the value is not negative, this
/// function returns the same value as getActiveBits()+1. Otherwise, it
/// returns the smallest bit width that will retain the negative value. For
/// example, -1 can be written as 0b1 or 0xFFFFFFFFFF. 0b1 is shorter and so
/// for -1, this function will always return 1.
unsigned getMinSignedBits() const { return BitWidth - getNumSignBits() + 1; }

/// Get zero extended value
///
/// This method attempts to return the value of this APInt as a zero extended
/// uint64_t. The bitwidth must be <= 64 or the value must fit within a
/// uint64_t. Otherwise an assertion will result.
uint64_t getZExtValue() const {
  if (isSingleWord())
    return U.VAL;
  assert(getActiveBits() <= 64 && "Too many bits for uint64_t")(static_cast <bool> (getActiveBits() <= 64 &&
 "Too many bits for uint64_t") ? void (0) : __assert_fail ("getActiveBits() <= 64 && \"Too many bits for uint64_t\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1634, __extension__ __PRETTY_FUNCTION__));
  return U.pVal[0];
}

/// Get sign extended value
///
/// This method attempts to return the value of this APInt as a sign extended
/// int64_t. The bit width must be <= 64 or the value must fit within an
/// int64_t. Otherwise an assertion will result.
int64_t getSExtValue() const {
  if (isSingleWord())
    return SignExtend64(U.VAL, BitWidth);
  assert(getMinSignedBits() <= 64 && "Too many bits for int64_t")(static_cast <bool> (getMinSignedBits() <= 64 &&
 "Too many bits for int64_t") ? void (0) : __assert_fail ("getMinSignedBits() <= 64 && \"Too many bits for int64_t\""
, "/build/llvm-toolchain-snapshot-13~++20210722111111+b115c038d2d4/llvm/include/llvm/ADT/APInt.h"
, 1646, __extension__ __PRETTY_FUNCTION__));
  return int64_t(U.pVal[0]);
}

/// Get bits required for string value.
///
/// This method determines how many bits are required to hold the APInt
/// equivalent of the string given by \p str.
static unsigned getBitsNeeded(StringRef str, uint8_t radix);

/// The APInt version of the countLeadingZeros functions in
///   MathExtras.h.
///
/// It counts the number of zeros from the most significant bit to the first
/// one bit.
///
/// \returns BitWidth if the value is zero, otherwise returns the number of
///   zeros from the most significant bit to the first one bits.
unsigned countLeadingZeros() const {
  if (isSingleWord()) {
    unsigned unusedBits = APINT_BITS_PER_WORD - BitWidth;
    return llvm::countLeadingZeros(U.VAL) - unusedBits;
  }
  return countLeadingZerosSlowCase();
}

/// Count the number of leading one bits.
///
/// This function is an APInt version of the countLeadingOnes
/// functions in MathExtras.h. It counts the number of ones from the most
/// significant bit to the first zero bit.
///
/// \returns 0 if the high order bit is not set, otherwise returns the number
/// of 1 bits from the most significant to the least
unsigned countLeadingOnes() const {
  if (isSingleWord())
    return llvm::countLeadingOnes(U.VAL << (APINT_BITS_PER_WORD - BitWidth));
  return countLeadingOnesSlowCase();
}

/// Computes the number of leading bits of this APInt that are equal to its
/// sign bit.
unsigned getNumSignBits() const {
  return isNegative() ? countLeadingOnes() : countLeadingZeros();
}

/// Count the number of trailing zero bits.
///
/// This function is an APInt version of the countTrailingZeros
/// functions in MathExtras.h. It counts the number of zeros from the least
/// significant bit to the first set bit.
///
/// \returns BitWidth if the value is zero, otherwise returns the number of
/// zeros from the least significant bit to the first one bit.
unsigned countTrailingZeros() const {
  if (isSingleWord()) {
    unsigned TrailingZeros = llvm::countTrailingZeros(U.VAL);
    return (TrailingZeros > BitWidth ? BitWidth : TrailingZeros);
  }
  return countTrailingZerosSlowCase();
}

/// Count the number of trailing one bits.
///
/// This function is an APInt version of the countTrailingOnes
/// functions in MathExtras.h. It counts the number of ones from the least
/// significant bit to the first zero bit.
///
/// \returns BitWidth if the value is all ones, otherwise returns the number
/// of ones from the least significant bit to the first zero bit.
unsigned countTrailingOnes() const {
  if (isSingleWord())
    return llvm::countTrailingOnes(U.VAL);
  return countTrailingOnesSlowCase();
}

/// Count the number of bits set.
///
/// This function is an APInt version of the countPopulation functions
/// in MathExtras.h. It counts the number of 1 bits in the APInt value.
///
/// \returns 0 if the value is zero, otherwise returns the number of set bits.
unsigned countPopulation() const {
  if (isSingleWord())
    return llvm::countPopulation(U.VAL);
  return countPopulationSlowCase();
}

/// @}
/// \name Conversion Functions
/// @{
void print(raw_ostream &OS, bool isSigned) const;

/// Converts an APInt to a string and append it to Str.  Str is commonly a
/// SmallString.
void toString(SmallVectorImpl<char> &Str, unsigned Radix, bool Signed,
              bool formatAsCLiteral = false) const;

/// Considers the APInt to be unsigned and converts it into a string in the
/// radix given. The radix can be 2, 8, 10 16, or 36.
void toStringUnsigned(SmallVectorImpl<char> &Str, unsigned Radix = 10) const {
  toString(Str, Radix, false, false);
}

/// Considers the APInt to be signed and converts it into a string in the
/// radix given. The radix can be 2, 8, 10, 16, or 36.
void toStringSigned(SmallVectorImpl<char> &Str, unsigned Radix = 10) const {
  toString(Str, Radix, true, false);
}

/// \returns a byte-swapped representation of this APInt Value.
APInt byteSwap() const;

/// \returns the value with the bit representation reversed of this APInt
/// Value.
APInt reverseBits() const;

/// Converts this APInt to a double value.
double roundToDouble(bool isSigned) const;

/// Converts this unsigned APInt to a double value.
double roundToDouble() const { return roundToDouble(false); }

/// Converts this signed APInt to a double value.
double signedRoundToDouble() const { return roundToDouble(true); }

/// Converts APInt bits to a double
///
/// The conversion does not do a translation from integer to double, it just
/// re-interprets the bits as a double. Note that it is valid to do this on
/// any bit width. Exactly 64 bits will be translated.
double bitsToDouble() const {
  return BitsToDouble(getWord(0));
}

/// Converts APInt bits to a float
///
/// The conversion does not do a translation from integer to float, it just
/// re-interprets the bits as a float. Note that it is valid to do this on
/// any bit width. Exactly 32 bits will be translated.
float bitsToFloat() const {
  return BitsToFloat(static_cast<uint32_t>(getWord(0)));
}

/// Converts a double to APInt bits.
///
/// The conversion does not do a translation from double to integer, it just
/// re-interprets the bits of the double.
static APInt doubleToBits(double V) {
  return APInt(sizeof(double) * CHAR_BIT8, DoubleToBits(V));
}

/// Converts a float to APInt bits.
///
/// The conversion does not do a translation from float to integer, it just
/// re-interprets the bits of the float.
static APInt floatToBits(float V) {
  return APInt(sizeof(float) * CHAR_BIT8, FloatToBits(V));
}

/// @}
/// \name Mathematics Operations
/// @{

/// \returns the floor log base 2 of this APInt.
unsigned logBase2() const { return getActiveBits() -  1; }

/// \returns the ceil log base 2 of this APInt.
unsigned ceilLogBase2() const {
  APInt temp(*this);
  --temp;
  return temp.getActiveBits();
}

/// \returns the nearest log base 2 of this APInt. Ties round up.
///
/// NOTE: When we have a BitWidth of 1, we define:
///
///   log2(0) = UINT32_MAX
///   log2(1) = 0
///
/// to get around any mathematical concerns resulting from
/// referencing 2 in a space where 2 does no exist.
unsigned nearestLogBase2() const {
  // Special case when we have a bitwidth of 1. If VAL is 1, then we
  // get 0. If VAL is 0, we get WORDTYPE_MAX which gets truncated to
  // UINT32_MAX.
  if (BitWidth == 1)
    return U.VAL - 1;

  // Handle the zero case.
  if (isNullValue())
    return UINT32_MAX(4294967295U);

  // The non-zero case is handled by computing:
  //
  //   nearestLogBase2(x) = logBase2(x) + x[logBase2(x)-1].
  //
  // where x[i] is referring to the value of the ith bit of x.
  unsigned lg = logBase2();
  return lg + unsigned((*this)[lg - 1]);
}

/// \returns the log base 2 of this APInt if its an exact power of two, -1
/// otherwise
int32_t exactLogBase2() const {
  if (!isPowerOf2())
    return -1;
  return logBase2();
}

/// Compute the square root
APInt sqrt() const;

/// Get the absolute value;
///
/// If *this is < 0 then return -(*this), otherwise *this;
APInt abs() const {
  if (isNegative())
    return -(*this);
  return *this;
}

/// \returns the multiplicative inverse for a given modulo.
APInt multiplicativeInverse(const APInt &modulo) const;

/// @}
/// \name Support for division by constant
/// @{

/// Calculate the magic number for signed division by a constant.
struct ms;
ms magic() const;

/// Calculate the magic number for unsigned division by a constant.
struct mu;
mu magicu(unsigned LeadingZeros = 0) const;

/// @}
/// \name Building-block Operations for APInt and APFloat
/// @{

// These building block operations operate on a representation of arbitrary
// precision, two's-complement, bignum integer values. They should be
// sufficient to implement APInt and APFloat bignum requirements. Inputs are
// generally a pointer to the base of an array of integer parts, representing
// an unsigned bignum, and a count of how many parts there are.

/// Sets the least significant part of a bignum to the input value, and zeroes
/// out higher parts.
static void tcSet(WordType *, WordType, unsigned);

/// Assign one bignum to another.
static void tcAssign(WordType *, const WordType *, unsigned);

/// Returns true if a bignum is zero, false otherwise.
static bool tcIsZero(const WordType *, unsigned);

/// Extract the given bit of a bignum; returns 0 or 1.  Zero-based.
static int tcExtractBit(const WordType *, unsigned bit);

/// Copy the bit vector of width srcBITS from SRC, starting at bit srcLSB, to
/// DST, of dstCOUNT parts, such that the bit srcLSB becomes the least
/// significant bit of DST.  All high bits above srcBITS in DST are
/// zero-filled.
static void tcExtract(WordType *, unsigned dstCount,
                      const WordType *, unsigned srcBits,
                      unsigned srcLSB);

/// Set the given bit of a bignum.  Zero-based.
static void tcSetBit(WordType *, unsigned bit);

/// Clear the given bit of a bignum.  Zero-based.
static void tcClearBit(WordType *, unsigned bit);

/// Returns the bit number of the least or most significant set bit of a
/// number.  If the input number has no bits set -1U is returned.
static unsigned tcLSB(const WordType *, unsigned n);
static unsigned tcMSB(const WordType *parts, unsigned n);

/// Negate a bignum in-place.
static void tcNegate(WordType *, unsigned);

/// DST += RHS + CARRY where CARRY is zero or one.  Returns the carry flag.
static WordType tcAdd(WordType *, const WordType *,
                      WordType carry, unsigned);
/// DST += RHS.  Returns the carry flag.
static WordType tcAddPart(WordType *, WordType, unsigned);

/// DST -= RHS + CARRY where CARRY is zero or one. Returns the carry flag.
static WordType tcSubtract(WordType *, const WordType *,
                           WordType carry, unsigned);
/// DST -= RHS.  Returns the carry flag.
static WordType tcSubtractPart(WordType *, WordType, unsigned);

/// DST += SRC * MULTIPLIER + PART   if add is true
/// DST  = SRC * MULTIPLIER + PART   if add is false
///
/// Requires 0 <= DSTPARTS <= SRCPARTS + 1.  If DST overlaps SRC they must
/// start at the same point, i.e. DST == SRC.
///
/// If DSTPARTS == SRC_PARTS + 1 no overflow occurs and zero is returned.
/// Otherwise DST is filled with the least significant DSTPARTS parts of the
/// result, and if all of the omitted higher parts were zero return zero,
/// otherwise overflow occurred and return one.
static int tcMultiplyPart(WordType *dst, const WordType *src,
                          WordType multiplier, WordType carry,
                          unsigned srcParts, unsigned dstParts,
                          bool add);

/// DST = LHS * RHS, where DST has the same width as the operands and is
/// filled with the least significant parts of the result.  Returns one if
/// overflow occurred, otherwise zero.  DST must be disjoint from both
/// operands.
static int tcMultiply(WordType *, const WordType *, const WordType *,
                      unsigned);

/// DST = LHS * RHS, where DST has width the sum of the widths of the
/// operands. No overflow occurs. DST must be disjoint from both operands.
static void tcFullMultiply(WordType *, const WordType *,
                           const WordType *, unsigned, unsigned);

/// If RHS is zero LHS and REMAINDER are left unchanged, return one.
/// Otherwise set LHS to LHS / RHS with the fractional part discarded, set
/// REMAINDER to the remainder, return zero.  i.e.
///
///  OLD_LHS = RHS * LHS + REMAINDER
///
/// SCRATCH is a bignum of the same size as the operands and result for use by
/// the routine; its contents need not be initialized and are destroyed.  LHS,
/// REMAINDER and SCRATCH must be distinct.
static int tcDivide(WordType *lhs, const WordType *rhs,
                    WordType *remainder, WordType *scratch,
                    unsigned parts);

/// Shift a bignum left Count bits. Shifted in bits are zero. There are no
/// restrictions on Count.
static void tcShiftLeft(WordType *, unsigned Words, unsigned Count);

/// Shift a bignum right Count bits.  Shifted in bits are zero.  There are no
/// restrictions on Count.
static void tcShiftRight(WordType *, unsigned Words, unsigned Count);

/// The obvious AND, OR and XOR and complement operations.
static void tcAnd(WordType *, const WordType *, unsigned);
static void tcOr(WordType *, const WordType *, unsigned);
static void tcXor(WordType *, const WordType *, unsigned);
static void tcComplement(WordType *, unsigned);

/// Comparison (unsigned) of two bignums.
static int tcCompare(const WordType *, const WordType *, unsigned);

/// Increment a bignum in-place.  Return the carry flag.
static WordType tcIncrement(WordType *dst, unsigned parts) {
  return tcAddPart(dst, 1, parts);
}

/// Decrement a bignum in-place.  Return the borrow flag.
static WordType tcDecrement(WordType *dst, unsigned parts) {
  return tcSubtractPart(dst, 1, parts);
}

/// Set the least significant BITS and clear the rest.
static void tcSetLeastSignificantBits(WordType *, unsigned, unsigned bits);

/// debug method
void dump() const;

/// @}
2015};

2017/// Magic data for optimising signed division by a constant.
2018struct APInt::ms {
APInt m;    ///< magic number
unsigned s; ///< shift amount
2021};

2023/// Magic data for optimising unsigned division by a constant.
2024struct APInt::mu {
APInt m;    ///< magic number
bool a;     ///< add indicator
unsigned s; ///< shift amount
2028};

2030inline bool operator==(uint64_t V1, const APInt &V2) { return V2 == V1; }

2032inline bool operator!=(uint64_t V1, const APInt &V2) { return V2 != V1; }

2034/// Unary bitwise complement operator.
2035///
2036/// \returns an APInt that is the bitwise complement of \p v.
2037inline APInt operator~(APInt v) {
v.flipAllBits();
return v;
2040}

2042inline APInt operator&(APInt a, const APInt &b) {
a &= b;
return a;
2045}

2047inline APInt operator&(const APInt &a, APInt &&b) {
b &= a;
return std::move(b);
2050}

2052inline APInt operator&(APInt a, uint64_t RHS) {
a &= RHS;
return a;
2055}

2057inline APInt operator&(uint64_t LHS, APInt b) {
b &= LHS;
return b;
2060}

2062inline APInt operator|(APInt a, const APInt &b) {
a |= b;
return a;
2065}

2067inline APInt operator|(const APInt &a, APInt &&b) {
b |= a;
return std::move(b);
2070}

2072inline APInt operator|(APInt a, uint64_t RHS) {
a |= RHS;
return a;
2075}

2077inline APInt operator|(uint64_t LHS, APInt b) {
b |= LHS;
return b;
2080}

2082inline APInt operator^(APInt a, const APInt &b) {
a ^= b;
return a;
2085}

2087inline APInt operator^(const APInt &a, APInt &&b) {
b ^= a;
return std::move(b);
2090}

2092inline APInt operator^(APInt a, uint64_t RHS) {
a ^= RHS;
return a;
2095}

2097inline APInt operator^(uint64_t LHS, APInt b) {
b ^= LHS;
return b;
2100}

2102inline raw_ostream &operator<<(raw_ostream &OS, const APInt &I) {
I.print(OS, true);
return OS;
2105}

2107inline APInt operator-(APInt v) {
v.negate();
return v;
2110}

2112inline APInt operator+(APInt a, const APInt &b) {
a += b;
return a;
2115}

2117inline APInt operator+(const APInt &a, APInt &&b) {
b += a;
return std::move(b);
2120}

2122inline APInt operator+(APInt a, uint64_t RHS) {
a += RHS;
return a;
2125}

2127inline APInt operator+(uint64_t LHS, APInt b) {
b += LHS;
return b;
2130}

2132inline APInt operator-(APInt a, const APInt &b) {
a -= b;
return a;
2135}

2137inline APInt operator-(const APInt &a, APInt &&b) {
b.negate();
b += a;
return std::move(b);
2141}

2143inline APInt operator-(APInt a, uint64_t RHS) {
a -= RHS;
return a;
2146}

2148inline APInt operator-(uint64_t LHS, APInt b) {
b.negate();
b += LHS;
return b;
2152}

2154inline APInt operator*(APInt a, uint64_t RHS) {
a *= RHS;
return a;
2157}

2159inline APInt operator*(uint64_t LHS, APInt b) {
b *= LHS;
return b;
2162}


2165namespace APIntOps {

2167/// Determine the smaller of two APInts considered to be signed.
2168inline const APInt &smin(const APInt &A, const APInt &B) {
return A.slt(B) ? A : B;
2170}

2172/// Determine the larger of two APInts considered to be signed.
2173inline const APInt &smax(const APInt &A, const APInt &B) {
return A.sgt(B) ? A : B;
2175}

2177/// Determine the smaller of two APInts considered to be unsigned.
2178inline const APInt &umin(const APInt &A, const APInt &B) {
return A.ult(B) ? A : B;
2180}

2182/// Determine the larger of two APInts considered to be unsigned.
2183inline const APInt &umax(const APInt &A, const APInt &B) {
return A.ugt(B) ? A : B;
2185}

2187/// Compute GCD of two unsigned APInt values.
2188///
2189/// This function returns the greatest common divisor of the two APInt values
2190/// using Stein's algorithm.
2191///
2192/// \returns the greatest common divisor of A and B.
2193APInt GreatestCommonDivisor(APInt A, APInt B);

2195/// Converts the given APInt to a double value.
2196///
2197/// Treats the APInt as an unsigned value for conversion purposes.
2198inline double RoundAPIntToDouble(const APInt &APIVal) {
return APIVal.roundToDouble();
2200}

2202/// Converts the given APInt to a double value.
2203///
2204/// Treats the APInt as a signed value for conversion purposes.
2205inline double RoundSignedAPIntToDouble(const APInt &APIVal) {
return APIVal.signedRoundToDouble();
2207}

2209/// Converts the given APInt to a float value.
2210inline float RoundAPIntToFloat(const APInt &APIVal) {
return float(RoundAPIntToDouble(APIVal));
2212}

2214/// Converts the given APInt to a float value.
2215///
2216/// Treats the APInt as a signed value for conversion purposes.
2217inline float RoundSignedAPIntToFloat(const APInt &APIVal) {
return float(APIVal.signedRoundToDouble());
2219}

2221/// Converts the given double value into a APInt.
2222///
2223/// This function convert a double value to an APInt value.
2224APInt RoundDoubleToAPInt(double Double, unsigned width);

2226/// Converts a float value into a APInt.
2227///
2228/// Converts a float value into an APInt value.
2229inline APInt RoundFloatToAPInt(float Float, unsigned width) {
return RoundDoubleToAPInt(double(Float), width);
2231}

2233/// Return A unsign-divided by B, rounded by the given rounding mode.
2234APInt RoundingUDiv(const APInt &A, const APInt &B, APInt::Rounding RM);

2236/// Return A sign-divided by B, rounded by the given rounding mode.
2237APInt RoundingSDiv(const APInt &A, const APInt &B, APInt::Rounding RM);

2239/// Let q(n) = An^2 + Bn + C, and BW = bit width of the value range
2240/// (e.g. 32 for i32).
2241/// This function finds the smallest number n, such that
2242/// (a) n >= 0 and q(n) = 0, or
2243/// (b) n >= 1 and q(n-1) and q(n), when evaluated in the set of all
2244///     integers, belong to two different intervals [Rk, Rk+R),
2245///     where R = 2^BW, and k is an integer.
2246/// The idea here is to find when q(n) "overflows" 2^BW, while at the
2247/// same time "allowing" subtraction. In unsigned modulo arithmetic a
2248/// subtraction (treated as addition of negated numbers) would always
2249/// count as an overflow, but here we want to allow values to decrease
2250/// and increase as long as they are within the same interval.
2251/// Specifically, adding of two negative numbers should not cause an
2252/// overflow (as long as the magnitude does not exceed the bit width).
2253/// On the other hand, given a positive number, adding a negative
2254/// number to it can give a negative result, which would cause the
2255/// value to go from [-2^BW, 0) to [0, 2^BW). In that sense, zero is
2256/// treated as a special case of an overflow.
2257///
2258/// This function returns None if after finding k that minimizes the
2259/// positive solution to q(n) = kR, both solutions are contained between
2260/// two consecutive integers.
2261///
2262/// There are cases where q(n) > T, and q(n+1) < T (assuming evaluation
2263/// in arithmetic modulo 2^BW, and treating the values as signed) by the
2264/// virtue of *signed* overflow. This function will *not* find such an n,
2265/// however it may find a value of n satisfying the inequalities due to
2266/// an *unsigned* overflow (if the values are treated as unsigned).
2267/// To find a solution for a signed overflow, treat it as a problem of
2268/// finding an unsigned overflow with a range with of BW-1.
2269///
2270/// The returned value may have a different bit width from the input
2271/// coefficients.
2272Optional<APInt> SolveQuadraticEquationWrap(APInt A, APInt B, APInt C,
                                         unsigned RangeWidth);

2275/// Compare two values, and if they are different, return the position of the
2276/// most significant bit that is different in the values.
2277Optional<unsigned> GetMostSignificantDifferentBit(const APInt &A,
                                                const APInt &B);

2280} // End of APIntOps namespace

2282// See friend declaration above. This additional declaration is required in
2283// order to compile LLVM with IBM xlC compiler.
2284hash_code hash_value(const APInt &Arg);

2286/// StoreIntToMemory - Fills the StoreBytes bytes of memory starting from Dst
2287/// with the integer held in IntVal.
2288void StoreIntToMemory(const APInt &IntVal, uint8_t *Dst, unsigned StoreBytes);

2290/// LoadIntFromMemory - Loads the integer stored in the LoadBytes bytes starting
2291/// from Src into IntVal, which is assumed to be wide enough and to hold zero.
2292void LoadIntFromMemory(APInt &IntVal, const uint8_t *Src, unsigned LoadBytes);

2294/// Provide DenseMapInfo for APInt.
2295template <> struct DenseMapInfo<APInt> {
static inline APInt getEmptyKey() {
  APInt V(nullptr, 0);
  V.U.VAL = 0;
  return V;
}

static inline APInt getTombstoneKey() {
  APInt V(nullptr, 0);
  V.U.VAL = 1;
  return V;
}

static unsigned getHashValue(const APInt &Key);

static bool isEqual(const APInt &LHS, const APInt &RHS) {
  return LHS.getBitWidth() == RHS.getBitWidth() && LHS == RHS;
}
2313};

2315} // namespace llvm

2317#endif