/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h

Bug Summary

File:	llvm/include/llvm/IR/Instructions.h
Warning:	line 2598, column 17 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 ValueTracking.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-14~++20210828111110+16086d47c0d0/build-llvm/lib/Analysis -resource-dir /usr/lib/llvm-14/lib/clang/14.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/build-llvm/lib/Analysis -I /build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis -I /build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/build-llvm/include -I /build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/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-14/lib/clang/14.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-14~++20210828111110+16086d47c0d0/build-llvm/lib/Analysis -fdebug-prefix-map=/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0=. -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-08-28-193554-24367-1 -x c++ /build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp

/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp

→

1//===- ValueTracking.cpp - Walk computations to compute properties --------===//
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 routines that help analyze properties that chains of
10// computations have.
11//
12//===----------------------------------------------------------------------===//

14#include "llvm/Analysis/ValueTracking.h"
15#include "llvm/ADT/APFloat.h"
16#include "llvm/ADT/APInt.h"
17#include "llvm/ADT/ArrayRef.h"
18#include "llvm/ADT/None.h"
19#include "llvm/ADT/Optional.h"
20#include "llvm/ADT/STLExtras.h"
21#include "llvm/ADT/SmallPtrSet.h"
22#include "llvm/ADT/SmallSet.h"
23#include "llvm/ADT/SmallVector.h"
24#include "llvm/ADT/StringRef.h"
25#include "llvm/ADT/iterator_range.h"
26#include "llvm/Analysis/AliasAnalysis.h"
27#include "llvm/Analysis/AssumeBundleQueries.h"
28#include "llvm/Analysis/AssumptionCache.h"
29#include "llvm/Analysis/EHPersonalities.h"
30#include "llvm/Analysis/GuardUtils.h"
31#include "llvm/Analysis/InstructionSimplify.h"
32#include "llvm/Analysis/Loads.h"
33#include "llvm/Analysis/LoopInfo.h"
34#include "llvm/Analysis/OptimizationRemarkEmitter.h"
35#include "llvm/Analysis/TargetLibraryInfo.h"
36#include "llvm/IR/Argument.h"
37#include "llvm/IR/Attributes.h"
38#include "llvm/IR/BasicBlock.h"
39#include "llvm/IR/Constant.h"
40#include "llvm/IR/ConstantRange.h"
41#include "llvm/IR/Constants.h"
42#include "llvm/IR/DerivedTypes.h"
43#include "llvm/IR/DiagnosticInfo.h"
44#include "llvm/IR/Dominators.h"
45#include "llvm/IR/Function.h"
46#include "llvm/IR/GetElementPtrTypeIterator.h"
47#include "llvm/IR/GlobalAlias.h"
48#include "llvm/IR/GlobalValue.h"
49#include "llvm/IR/GlobalVariable.h"
50#include "llvm/IR/InstrTypes.h"
51#include "llvm/IR/Instruction.h"
52#include "llvm/IR/Instructions.h"
53#include "llvm/IR/IntrinsicInst.h"
54#include "llvm/IR/Intrinsics.h"
55#include "llvm/IR/IntrinsicsAArch64.h"
56#include "llvm/IR/IntrinsicsRISCV.h"
57#include "llvm/IR/IntrinsicsX86.h"
58#include "llvm/IR/LLVMContext.h"
59#include "llvm/IR/Metadata.h"
60#include "llvm/IR/Module.h"
61#include "llvm/IR/Operator.h"
62#include "llvm/IR/PatternMatch.h"
63#include "llvm/IR/Type.h"
64#include "llvm/IR/User.h"
65#include "llvm/IR/Value.h"
66#include "llvm/Support/Casting.h"
67#include "llvm/Support/CommandLine.h"
68#include "llvm/Support/Compiler.h"
69#include "llvm/Support/ErrorHandling.h"
70#include "llvm/Support/KnownBits.h"
71#include "llvm/Support/MathExtras.h"
72#include <algorithm>
73#include <array>
74#include <cassert>
75#include <cstdint>
76#include <iterator>
77#include <utility>

79using namespace llvm;
80using namespace llvm::PatternMatch;

82// Controls the number of uses of the value searched for possible
83// dominating comparisons.
84static cl::opt<unsigned> DomConditionsMaxUses("dom-conditions-max-uses",
                                            cl::Hidden, cl::init(20));

87/// Returns the bitwidth of the given scalar or pointer type. For vector types,
88/// returns the element type's bitwidth.
89static unsigned getBitWidth(Type *Ty, const DataLayout &DL) {
if (unsigned BitWidth = Ty->getScalarSizeInBits())
  return BitWidth;

return DL.getPointerTypeSizeInBits(Ty);
94}

96namespace {

98// Simplifying using an assume can only be done in a particular control-flow
99// context (the context instruction provides that context). If an assume and
100// the context instruction are not in the same block then the DT helps in
101// figuring out if we can use it.
102struct Query {
const DataLayout &DL;
AssumptionCache *AC;
const Instruction *CxtI;
const DominatorTree *DT;

// Unlike the other analyses, this may be a nullptr because not all clients
// provide it currently.
OptimizationRemarkEmitter *ORE;

/// If true, it is safe to use metadata during simplification.
InstrInfoQuery IIQ;

Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI,
      const DominatorTree *DT, bool UseInstrInfo,
      OptimizationRemarkEmitter *ORE = nullptr)
    : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE), IIQ(UseInstrInfo) {}
119};

121} // end anonymous namespace

123// Given the provided Value and, potentially, a context instruction, return
124// the preferred context instruction (if any).
125static const Instruction *safeCxtI(const Value *V, const Instruction *CxtI) {
// If we've been provided with a context instruction, then use that (provided
// it has been inserted).
if (CxtI && CxtI->getParent())
  return CxtI;

// If the value is really an already-inserted instruction, then use that.
CxtI = dyn_cast<Instruction>(V);
if (CxtI && CxtI->getParent())
  return CxtI;

return nullptr;
137}

139static const Instruction *safeCxtI(const Value *V1, const Value *V2, const Instruction *CxtI) {
// If we've been provided with a context instruction, then use that (provided
// it has been inserted).
if (CxtI && CxtI->getParent())
  return CxtI;

// If the value is really an already-inserted instruction, then use that.
CxtI = dyn_cast<Instruction>(V1);
if (CxtI && CxtI->getParent())
  return CxtI;

CxtI = dyn_cast<Instruction>(V2);
if (CxtI && CxtI->getParent())
  return CxtI;

return nullptr;
155}

157static bool getShuffleDemandedElts(const ShuffleVectorInst *Shuf,
                                 const APInt &DemandedElts,
                                 APInt &DemandedLHS, APInt &DemandedRHS) {
// The length of scalable vectors is unknown at compile time, thus we
// cannot check their values
if (isa<ScalableVectorType>(Shuf->getType()))
  return false;

int NumElts =
    cast<FixedVectorType>(Shuf->getOperand(0)->getType())->getNumElements();
int NumMaskElts = cast<FixedVectorType>(Shuf->getType())->getNumElements();
DemandedLHS = DemandedRHS = APInt::getNullValue(NumElts);
if (DemandedElts.isNullValue())
  return true;
// Simple case of a shuffle with zeroinitializer.
if (all_of(Shuf->getShuffleMask(), [](int Elt) { return Elt == 0; })) {
  DemandedLHS.setBit(0);
  return true;
}
for (int i = 0; i != NumMaskElts; ++i) {
  if (!DemandedElts[i])
    continue;
  int M = Shuf->getMaskValue(i);
  assert(M < (NumElts * 2) && "Invalid shuffle mask constant")(static_cast <bool> (M < (NumElts * 2) && "Invalid shuffle mask constant"
) ? void (0) : __assert_fail ("M < (NumElts * 2) && \"Invalid shuffle mask constant\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 180, __extension__ __PRETTY_FUNCTION__));

  // For undef elements, we don't know anything about the common state of
  // the shuffle result.
  if (M == -1)
    return false;
  if (M < NumElts)
    DemandedLHS.setBit(M % NumElts);
  else
    DemandedRHS.setBit(M % NumElts);
}

return true;
193}

195static void computeKnownBits(const Value *V, const APInt &DemandedElts,
                           KnownBits &Known, unsigned Depth, const Query &Q);

198static void computeKnownBits(const Value *V, KnownBits &Known, unsigned Depth,
                           const Query &Q) {
// FIXME: We currently have no way to represent the DemandedElts of a scalable
// vector
if (isa<ScalableVectorType>(V->getType())) {
  Known.resetAll();
  return;
}

auto *FVTy = dyn_cast<FixedVectorType>(V->getType());
APInt DemandedElts =
    FVTy ? APInt::getAllOnesValue(FVTy->getNumElements()) : APInt(1, 1);
computeKnownBits(V, DemandedElts, Known, Depth, Q);
211}

213void llvm::computeKnownBits(const Value *V, KnownBits &Known,
                          const DataLayout &DL, unsigned Depth,
                          AssumptionCache *AC, const Instruction *CxtI,
                          const DominatorTree *DT,
                          OptimizationRemarkEmitter *ORE, bool UseInstrInfo) {
::computeKnownBits(V, Known, Depth,
                   Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
220}

222void llvm::computeKnownBits(const Value *V, const APInt &DemandedElts,
                          KnownBits &Known, const DataLayout &DL,
                          unsigned Depth, AssumptionCache *AC,
                          const Instruction *CxtI, const DominatorTree *DT,
                          OptimizationRemarkEmitter *ORE, bool UseInstrInfo) {
::computeKnownBits(V, DemandedElts, Known, Depth,
                   Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
229}

231static KnownBits computeKnownBits(const Value *V, const APInt &DemandedElts,
                                unsigned Depth, const Query &Q);

234static KnownBits computeKnownBits(const Value *V, unsigned Depth,
                                const Query &Q);

237KnownBits llvm::computeKnownBits(const Value *V, const DataLayout &DL,
                               unsigned Depth, AssumptionCache *AC,
                               const Instruction *CxtI,
                               const DominatorTree *DT,
                               OptimizationRemarkEmitter *ORE,
                               bool UseInstrInfo) {
return ::computeKnownBits(
    V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
245}

247KnownBits llvm::computeKnownBits(const Value *V, const APInt &DemandedElts,
                               const DataLayout &DL, unsigned Depth,
                               AssumptionCache *AC, const Instruction *CxtI,
                               const DominatorTree *DT,
                               OptimizationRemarkEmitter *ORE,
                               bool UseInstrInfo) {
return ::computeKnownBits(
    V, DemandedElts, Depth,
    Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE));
256}

258bool llvm::haveNoCommonBitsSet(const Value *LHS, const Value *RHS,
                             const DataLayout &DL, AssumptionCache *AC,
                             const Instruction *CxtI, const DominatorTree *DT,
                             bool UseInstrInfo) {
assert(LHS->getType() == RHS->getType() &&(static_cast <bool> (LHS->getType() == RHS->getType
() && "LHS and RHS should have the same type") ? void
 (0) : __assert_fail ("LHS->getType() == RHS->getType() && \"LHS and RHS should have the same type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 263, __extension__ __PRETTY_FUNCTION__))
       "LHS and RHS should have the same type")(static_cast <bool> (LHS->getType() == RHS->getType
() && "LHS and RHS should have the same type") ? void
 (0) : __assert_fail ("LHS->getType() == RHS->getType() && \"LHS and RHS should have the same type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 263, __extension__ __PRETTY_FUNCTION__));
assert(LHS->getType()->isIntOrIntVectorTy() &&(static_cast <bool> (LHS->getType()->isIntOrIntVectorTy
() && "LHS and RHS should be integers") ? void (0) : __assert_fail
 ("LHS->getType()->isIntOrIntVectorTy() && \"LHS and RHS should be integers\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 265, __extension__ __PRETTY_FUNCTION__))
       "LHS and RHS should be integers")(static_cast <bool> (LHS->getType()->isIntOrIntVectorTy
() && "LHS and RHS should be integers") ? void (0) : __assert_fail
 ("LHS->getType()->isIntOrIntVectorTy() && \"LHS and RHS should be integers\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 265, __extension__ __PRETTY_FUNCTION__));
// Look for an inverted mask: (X & ~M) op (Y & M).
Value *M;
if (match(LHS, m_c_And(m_Not(m_Value(M)), m_Value())) &&
    match(RHS, m_c_And(m_Specific(M), m_Value())))
  return true;
if (match(RHS, m_c_And(m_Not(m_Value(M)), m_Value())) &&
    match(LHS, m_c_And(m_Specific(M), m_Value())))
  return true;
IntegerType *IT = cast<IntegerType>(LHS->getType()->getScalarType());
KnownBits LHSKnown(IT->getBitWidth());
KnownBits RHSKnown(IT->getBitWidth());
computeKnownBits(LHS, LHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo);
computeKnownBits(RHS, RHSKnown, DL, 0, AC, CxtI, DT, nullptr, UseInstrInfo);
return KnownBits::haveNoCommonBitsSet(LHSKnown, RHSKnown);
280}

282bool llvm::isOnlyUsedInZeroEqualityComparison(const Instruction *CxtI) {
for (const User *U : CxtI->users()) {
  if (const ICmpInst *IC = dyn_cast<ICmpInst>(U))
    if (IC->isEquality())
      if (Constant *C = dyn_cast<Constant>(IC->getOperand(1)))
        if (C->isNullValue())
          continue;
  return false;
}
return true;
292}

294static bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
                                 const Query &Q);

297bool llvm::isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL,
                                bool OrZero, unsigned Depth,
                                AssumptionCache *AC, const Instruction *CxtI,
                                const DominatorTree *DT, bool UseInstrInfo) {
return ::isKnownToBeAPowerOfTwo(
    V, OrZero, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
303}

305static bool isKnownNonZero(const Value *V, const APInt &DemandedElts,
                         unsigned Depth, const Query &Q);

308static bool isKnownNonZero(const Value *V, unsigned Depth, const Query &Q);

310bool llvm::isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth,
                        AssumptionCache *AC, const Instruction *CxtI,
                        const DominatorTree *DT, bool UseInstrInfo) {
return ::isKnownNonZero(V, Depth,
                        Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
315}

317bool llvm::isKnownNonNegative(const Value *V, const DataLayout &DL,
                            unsigned Depth, AssumptionCache *AC,
                            const Instruction *CxtI, const DominatorTree *DT,
                            bool UseInstrInfo) {
KnownBits Known =
    computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo);
return Known.isNonNegative();
324}

326bool llvm::isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth,
                         AssumptionCache *AC, const Instruction *CxtI,
                         const DominatorTree *DT, bool UseInstrInfo) {
if (auto *CI = dyn_cast<ConstantInt>(V))
  return CI->getValue().isStrictlyPositive();

// TODO: We'd doing two recursive queries here.  We should factor this such
// that only a single query is needed.
return isKnownNonNegative(V, DL, Depth, AC, CxtI, DT, UseInstrInfo) &&
       isKnownNonZero(V, DL, Depth, AC, CxtI, DT, UseInstrInfo);
336}

338bool llvm::isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth,
                         AssumptionCache *AC, const Instruction *CxtI,
                         const DominatorTree *DT, bool UseInstrInfo) {
KnownBits Known =
    computeKnownBits(V, DL, Depth, AC, CxtI, DT, nullptr, UseInstrInfo);
return Known.isNegative();
344}

346static bool isKnownNonEqual(const Value *V1, const Value *V2, unsigned Depth,
                          const Query &Q);

349bool llvm::isKnownNonEqual(const Value *V1, const Value *V2,
                         const DataLayout &DL, AssumptionCache *AC,
                         const Instruction *CxtI, const DominatorTree *DT,
                         bool UseInstrInfo) {
return ::isKnownNonEqual(V1, V2, 0,
                         Query(DL, AC, safeCxtI(V2, V1, CxtI), DT,
                               UseInstrInfo, /*ORE=*/nullptr));
356}

358static bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth,
                            const Query &Q);

361bool llvm::MaskedValueIsZero(const Value *V, const APInt &Mask,
                           const DataLayout &DL, unsigned Depth,
                           AssumptionCache *AC, const Instruction *CxtI,
                           const DominatorTree *DT, bool UseInstrInfo) {
return ::MaskedValueIsZero(
    V, Mask, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
367}

369static unsigned ComputeNumSignBits(const Value *V, const APInt &DemandedElts,
                                 unsigned Depth, const Query &Q);

372static unsigned ComputeNumSignBits(const Value *V, unsigned Depth,
                                 const Query &Q) {
// FIXME: We currently have no way to represent the DemandedElts of a scalable
// vector
if (isa<ScalableVectorType>(V->getType()))
  return 1;

auto *FVTy = dyn_cast<FixedVectorType>(V->getType());
APInt DemandedElts =
    FVTy ? APInt::getAllOnesValue(FVTy->getNumElements()) : APInt(1, 1);
return ComputeNumSignBits(V, DemandedElts, Depth, Q);
383}

385unsigned llvm::ComputeNumSignBits(const Value *V, const DataLayout &DL,
                                unsigned Depth, AssumptionCache *AC,
                                const Instruction *CxtI,
                                const DominatorTree *DT, bool UseInstrInfo) {
return ::ComputeNumSignBits(
    V, Depth, Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo));
391}

393static void computeKnownBitsAddSub(bool Add, const Value *Op0, const Value *Op1,
                                 bool NSW, const APInt &DemandedElts,
                                 KnownBits &KnownOut, KnownBits &Known2,
                                 unsigned Depth, const Query &Q) {
computeKnownBits(Op1, DemandedElts, KnownOut, Depth + 1, Q);

// If one operand is unknown and we have no nowrap information,
// the result will be unknown independently of the second operand.
if (KnownOut.isUnknown() && !NSW)
  return;

computeKnownBits(Op0, DemandedElts, Known2, Depth + 1, Q);
KnownOut = KnownBits::computeForAddSub(Add, NSW, Known2, KnownOut);
406}

408static void computeKnownBitsMul(const Value *Op0, const Value *Op1, bool NSW,
                              const APInt &DemandedElts, KnownBits &Known,
                              KnownBits &Known2, unsigned Depth,
                              const Query &Q) {
computeKnownBits(Op1, DemandedElts, Known, Depth + 1, Q);
computeKnownBits(Op0, DemandedElts, Known2, Depth + 1, Q);

bool isKnownNegative = false;
bool isKnownNonNegative = false;
// If the multiplication is known not to overflow, compute the sign bit.
if (NSW) {
  if (Op0 == Op1) {
    // The product of a number with itself is non-negative.
    isKnownNonNegative = true;
  } else {
    bool isKnownNonNegativeOp1 = Known.isNonNegative();
    bool isKnownNonNegativeOp0 = Known2.isNonNegative();
    bool isKnownNegativeOp1 = Known.isNegative();
    bool isKnownNegativeOp0 = Known2.isNegative();
    // The product of two numbers with the same sign is non-negative.
    isKnownNonNegative = (isKnownNegativeOp1 && isKnownNegativeOp0) ||
                         (isKnownNonNegativeOp1 && isKnownNonNegativeOp0);
    // The product of a negative number and a non-negative number is either
    // negative or zero.
    if (!isKnownNonNegative)
      isKnownNegative =
          (isKnownNegativeOp1 && isKnownNonNegativeOp0 &&
           Known2.isNonZero()) ||
          (isKnownNegativeOp0 && isKnownNonNegativeOp1 && Known.isNonZero());
  }
}

Known = KnownBits::mul(Known, Known2);

// Only make use of no-wrap flags if we failed to compute the sign bit
// directly.  This matters if the multiplication always overflows, in
// which case we prefer to follow the result of the direct computation,
// though as the program is invoking undefined behaviour we can choose
// whatever we like here.
if (isKnownNonNegative && !Known.isNegative())
  Known.makeNonNegative();
else if (isKnownNegative && !Known.isNonNegative())
  Known.makeNegative();
451}

453void llvm::computeKnownBitsFromRangeMetadata(const MDNode &Ranges,
                                           KnownBits &Known) {
unsigned BitWidth = Known.getBitWidth();
unsigned NumRanges = Ranges.getNumOperands() / 2;
assert(NumRanges >= 1)(static_cast <bool> (NumRanges >= 1) ? void (0) : __assert_fail
 ("NumRanges >= 1", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 457, __extension__ __PRETTY_FUNCTION__));

Known.Zero.setAllBits();
Known.One.setAllBits();

for (unsigned i = 0; i < NumRanges; ++i) {
  ConstantInt *Lower =
      mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 0));
  ConstantInt *Upper =
      mdconst::extract<ConstantInt>(Ranges.getOperand(2 * i + 1));
  ConstantRange Range(Lower->getValue(), Upper->getValue());

  // The first CommonPrefixBits of all values in Range are equal.
  unsigned CommonPrefixBits =
      (Range.getUnsignedMax() ^ Range.getUnsignedMin()).countLeadingZeros();
  APInt Mask = APInt::getHighBitsSet(BitWidth, CommonPrefixBits);
  APInt UnsignedMax = Range.getUnsignedMax().zextOrTrunc(BitWidth);
  Known.One &= UnsignedMax & Mask;
  Known.Zero &= ~UnsignedMax & Mask;
}
477}

479static bool isEphemeralValueOf(const Instruction *I, const Value *E) {
SmallVector<const Value *, 16> WorkSet(1, I);
SmallPtrSet<const Value *, 32> Visited;
SmallPtrSet<const Value *, 16> EphValues;

// The instruction defining an assumption's condition itself is always
// considered ephemeral to that assumption (even if it has other
// non-ephemeral users). See r246696's test case for an example.
if (is_contained(I->operands(), E))
  return true;

while (!WorkSet.empty()) {
  const Value *V = WorkSet.pop_back_val();
  if (!Visited.insert(V).second)
    continue;

  // If all uses of this value are ephemeral, then so is this value.
  if (llvm::all_of(V->users(), [&](const User *U) {
                                 return EphValues.count(U);
                               })) {
    if (V == E)
      return true;

    if (V == I || isSafeToSpeculativelyExecute(V)) {
     EphValues.insert(V);
     if (const User *U = dyn_cast<User>(V))
       append_range(WorkSet, U->operands());
    }
  }
}

return false;
511}

513// Is this an intrinsic that cannot be speculated but also cannot trap?
514bool llvm::isAssumeLikeIntrinsic(const Instruction *I) {
if (const IntrinsicInst *CI = dyn_cast<IntrinsicInst>(I))
  return CI->isAssumeLikeIntrinsic();

return false;
519}

521bool llvm::isValidAssumeForContext(const Instruction *Inv,
                                 const Instruction *CxtI,
                                 const DominatorTree *DT) {
// There are two restrictions on the use of an assume:
//  1. The assume must dominate the context (or the control flow must
//     reach the assume whenever it reaches the context).
//  2. The context must not be in the assume's set of ephemeral values
//     (otherwise we will use the assume to prove that the condition
//     feeding the assume is trivially true, thus causing the removal of
//     the assume).

if (Inv->getParent() == CxtI->getParent()) {
  // If Inv and CtxI are in the same block, check if the assume (Inv) is first
  // in the BB.
  if (Inv->comesBefore(CxtI))
    return true;

  // Don't let an assume affect itself - this would cause the problems
  // `isEphemeralValueOf` is trying to prevent, and it would also make
  // the loop below go out of bounds.
  if (Inv == CxtI)
    return false;

  // The context comes first, but they're both in the same block.
  // Make sure there is nothing in between that might interrupt
  // the control flow, not even CxtI itself.
  // We limit the scan distance between the assume and its context instruction
  // to avoid a compile-time explosion. This limit is chosen arbitrarily, so
  // it can be adjusted if needed (could be turned into a cl::opt).
  unsigned ScanLimit = 15;
  for (BasicBlock::const_iterator I(CxtI), IE(Inv); I != IE; ++I)
    if (!isGuaranteedToTransferExecutionToSuccessor(&*I) || --ScanLimit == 0)
      return false;

  return !isEphemeralValueOf(Inv, CxtI);
}

// Inv and CxtI are in different blocks.
if (DT) {
  if (DT->dominates(Inv, CxtI))
    return true;
} else if (Inv->getParent() == CxtI->getParent()->getSinglePredecessor()) {
  // We don't have a DT, but this trivially dominates.
  return true;
}

return false;
568}

570static bool cmpExcludesZero(CmpInst::Predicate Pred, const Value *RHS) {
// v u> y implies v != 0.
if (Pred == ICmpInst::ICMP_UGT)
  return true;

// Special-case v != 0 to also handle v != null.
if (Pred == ICmpInst::ICMP_NE)
  return match(RHS, m_Zero());

// All other predicates - rely on generic ConstantRange handling.
const APInt *C;
if (!match(RHS, m_APInt(C)))
  return false;

ConstantRange TrueValues = ConstantRange::makeExactICmpRegion(Pred, *C);
return !TrueValues.contains(APInt::getNullValue(C->getBitWidth()));
586}

588static bool isKnownNonZeroFromAssume(const Value *V, const Query &Q) {
// Use of assumptions is context-sensitive. If we don't have a context, we
// cannot use them!
if (!Q.AC || !Q.CxtI)
  return false;

if (Q.CxtI && V->getType()->isPointerTy()) {
  SmallVector<Attribute::AttrKind, 2> AttrKinds{Attribute::NonNull};
  if (!NullPointerIsDefined(Q.CxtI->getFunction(),
                            V->getType()->getPointerAddressSpace()))
    AttrKinds.push_back(Attribute::Dereferenceable);

  if (getKnowledgeValidInContext(V, AttrKinds, Q.CxtI, Q.DT, Q.AC))
    return true;
}

for (auto &AssumeVH : Q.AC->assumptionsFor(V)) {
  if (!AssumeVH)
    continue;
  CallInst *I = cast<CallInst>(AssumeVH);
  assert(I->getFunction() == Q.CxtI->getFunction() &&(static_cast <bool> (I->getFunction() == Q.CxtI->
getFunction() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getFunction() == Q.CxtI->getFunction() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 609, __extension__ __PRETTY_FUNCTION__))
         "Got assumption for the wrong function!")(static_cast <bool> (I->getFunction() == Q.CxtI->
getFunction() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getFunction() == Q.CxtI->getFunction() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 609, __extension__ __PRETTY_FUNCTION__));

  // Warning: This loop can end up being somewhat performance sensitive.
  // We're running this loop for once for each value queried resulting in a
  // runtime of ~O(#assumes * #values).

  assert(I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume &&(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 616, __extension__ __PRETTY_FUNCTION__))
         "must be an assume intrinsic")(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 616, __extension__ __PRETTY_FUNCTION__));

  Value *RHS;
  CmpInst::Predicate Pred;
  auto m_V = m_CombineOr(m_Specific(V), m_PtrToInt(m_Specific(V)));
  if (!match(I->getArgOperand(0), m_c_ICmp(Pred, m_V, m_Value(RHS))))
    return false;

  if (cmpExcludesZero(Pred, RHS) && isValidAssumeForContext(I, Q.CxtI, Q.DT))
    return true;
}

return false;
629}

631static void computeKnownBitsFromAssume(const Value *V, KnownBits &Known,
                                     unsigned Depth, const Query &Q) {
// Use of assumptions is context-sensitive. If we don't have a context, we
// cannot use them!
if (!Q.AC || !Q.CxtI)
  return;

unsigned BitWidth = Known.getBitWidth();

// Refine Known set if the pointer alignment is set by assume bundles.
if (V->getType()->isPointerTy()) {
  if (RetainedKnowledge RK = getKnowledgeValidInContext(
          V, {Attribute::Alignment}, Q.CxtI, Q.DT, Q.AC)) {
    Known.Zero.setLowBits(Log2_32(RK.ArgValue));
  }
}

// Note that the patterns below need to be kept in sync with the code
// in AssumptionCache::updateAffectedValues.

for (auto &AssumeVH : Q.AC->assumptionsFor(V)) {
  if (!AssumeVH)
    continue;
  CallInst *I = cast<CallInst>(AssumeVH);
  assert(I->getParent()->getParent() == Q.CxtI->getParent()->getParent() &&(static_cast <bool> (I->getParent()->getParent() ==
 Q.CxtI->getParent()->getParent() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getParent()->getParent() == Q.CxtI->getParent()->getParent() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 656, __extension__ __PRETTY_FUNCTION__))
         "Got assumption for the wrong function!")(static_cast <bool> (I->getParent()->getParent() ==
 Q.CxtI->getParent()->getParent() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getParent()->getParent() == Q.CxtI->getParent()->getParent() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 656, __extension__ __PRETTY_FUNCTION__));

  // Warning: This loop can end up being somewhat performance sensitive.
  // We're running this loop for once for each value queried resulting in a
  // runtime of ~O(#assumes * #values).

  assert(I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume &&(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 663, __extension__ __PRETTY_FUNCTION__))
         "must be an assume intrinsic")(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 663, __extension__ __PRETTY_FUNCTION__));

  Value *Arg = I->getArgOperand(0);

  if (Arg == V && isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
    assert(BitWidth == 1 && "assume operand is not i1?")(static_cast <bool> (BitWidth == 1 && "assume operand is not i1?"
) ? void (0) : __assert_fail ("BitWidth == 1 && \"assume operand is not i1?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 668, __extension__ __PRETTY_FUNCTION__));
    Known.setAllOnes();
    return;
  }
  if (match(Arg, m_Not(m_Specific(V))) &&
      isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
    assert(BitWidth == 1 && "assume operand is not i1?")(static_cast <bool> (BitWidth == 1 && "assume operand is not i1?"
) ? void (0) : __assert_fail ("BitWidth == 1 && \"assume operand is not i1?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 674, __extension__ __PRETTY_FUNCTION__));
    Known.setAllZero();
    return;
  }

  // The remaining tests are all recursive, so bail out if we hit the limit.
  if (Depth == MaxAnalysisRecursionDepth)
    continue;

  ICmpInst *Cmp = dyn_cast<ICmpInst>(Arg);
  if (!Cmp)
    continue;

  // We are attempting to compute known bits for the operands of an assume.
  // Do not try to use other assumptions for those recursive calls because
  // that can lead to mutual recursion and a compile-time explosion.
  // An example of the mutual recursion: computeKnownBits can call
  // isKnownNonZero which calls computeKnownBitsFromAssume (this function)
  // and so on.
  Query QueryNoAC = Q;
  QueryNoAC.AC = nullptr;

  // Note that ptrtoint may change the bitwidth.
  Value *A, *B;
  auto m_V = m_CombineOr(m_Specific(V), m_PtrToInt(m_Specific(V)));

  CmpInst::Predicate Pred;
  uint64_t C;
  switch (Cmp->getPredicate()) {
  default:
    break;
  case ICmpInst::ICMP_EQ:
    // assume(v = a)
    if (match(Cmp, m_c_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      Known.Zero |= RHSKnown.Zero;
      Known.One  |= RHSKnown.One;
    // assume(v & b = a)
    } else if (match(Cmp,
                     m_c_ICmp(Pred, m_c_And(m_V, m_Value(B)), m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits MaskKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in the mask that are known to be one, we can propagate
      // known bits from the RHS to V.
      Known.Zero |= RHSKnown.Zero & MaskKnown.One;
      Known.One  |= RHSKnown.One  & MaskKnown.One;
    // assume(~(v & b) = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Not(m_c_And(m_V, m_Value(B))),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits MaskKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in the mask that are known to be one, we can propagate
      // inverted known bits from the RHS to V.
      Known.Zero |= RHSKnown.One  & MaskKnown.One;
      Known.One  |= RHSKnown.Zero & MaskKnown.One;
    // assume(v | b = a)
    } else if (match(Cmp,
                     m_c_ICmp(Pred, m_c_Or(m_V, m_Value(B)), m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits BKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in B that are known to be zero, we can propagate known
      // bits from the RHS to V.
      Known.Zero |= RHSKnown.Zero & BKnown.Zero;
      Known.One  |= RHSKnown.One  & BKnown.Zero;
    // assume(~(v | b) = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Not(m_c_Or(m_V, m_Value(B))),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits BKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in B that are known to be zero, we can propagate
      // inverted known bits from the RHS to V.
      Known.Zero |= RHSKnown.One  & BKnown.Zero;
      Known.One  |= RHSKnown.Zero & BKnown.Zero;
    // assume(v ^ b = a)
    } else if (match(Cmp,
                     m_c_ICmp(Pred, m_c_Xor(m_V, m_Value(B)), m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits BKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in B that are known to be zero, we can propagate known
      // bits from the RHS to V. For those bits in B that are known to be one,
      // we can propagate inverted known bits from the RHS to V.
      Known.Zero |= RHSKnown.Zero & BKnown.Zero;
      Known.One  |= RHSKnown.One  & BKnown.Zero;
      Known.Zero |= RHSKnown.One  & BKnown.One;
      Known.One  |= RHSKnown.Zero & BKnown.One;
    // assume(~(v ^ b) = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Not(m_c_Xor(m_V, m_Value(B))),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      KnownBits BKnown =
          computeKnownBits(B, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in B that are known to be zero, we can propagate
      // inverted known bits from the RHS to V. For those bits in B that are
      // known to be one, we can propagate known bits from the RHS to V.
      Known.Zero |= RHSKnown.One  & BKnown.Zero;
      Known.One  |= RHSKnown.Zero & BKnown.Zero;
      Known.Zero |= RHSKnown.Zero & BKnown.One;
      Known.One  |= RHSKnown.One  & BKnown.One;
    // assume(v << c = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Shl(m_V, m_ConstantInt(C)),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT) && C < BitWidth) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // For those bits in RHS that are known, we can propagate them to known
      // bits in V shifted to the right by C.
      RHSKnown.Zero.lshrInPlace(C);
      Known.Zero |= RHSKnown.Zero;
      RHSKnown.One.lshrInPlace(C);
      Known.One  |= RHSKnown.One;
    // assume(~(v << c) = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Not(m_Shl(m_V, m_ConstantInt(C))),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT) && C < BitWidth) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      // For those bits in RHS that are known, we can propagate them inverted
      // to known bits in V shifted to the right by C.
      RHSKnown.One.lshrInPlace(C);
      Known.Zero |= RHSKnown.One;
      RHSKnown.Zero.lshrInPlace(C);
      Known.One  |= RHSKnown.Zero;
    // assume(v >> c = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Shr(m_V, m_ConstantInt(C)),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT) && C < BitWidth) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      // For those bits in RHS that are known, we can propagate them to known
      // bits in V shifted to the right by C.
      Known.Zero |= RHSKnown.Zero << C;
      Known.One  |= RHSKnown.One  << C;
    // assume(~(v >> c) = a)
    } else if (match(Cmp, m_c_ICmp(Pred, m_Not(m_Shr(m_V, m_ConstantInt(C))),
                                   m_Value(A))) &&
               isValidAssumeForContext(I, Q.CxtI, Q.DT) && C < BitWidth) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);
      // For those bits in RHS that are known, we can propagate them inverted
      // to known bits in V shifted to the right by C.
      Known.Zero |= RHSKnown.One  << C;
      Known.One  |= RHSKnown.Zero << C;
    }
    break;
  case ICmpInst::ICMP_SGE:
    // assume(v >=_s c) where c is non-negative
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth + 1, QueryNoAC).anyextOrTrunc(BitWidth);

      if (RHSKnown.isNonNegative()) {
        // We know that the sign bit is zero.
        Known.makeNonNegative();
      }
    }
    break;
  case ICmpInst::ICMP_SGT:
    // assume(v >_s c) where c is at least -1.
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth + 1, QueryNoAC).anyextOrTrunc(BitWidth);

      if (RHSKnown.isAllOnes() || RHSKnown.isNonNegative()) {
        // We know that the sign bit is zero.
        Known.makeNonNegative();
      }
    }
    break;
  case ICmpInst::ICMP_SLE:
    // assume(v <=_s c) where c is negative
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth + 1, QueryNoAC).anyextOrTrunc(BitWidth);

      if (RHSKnown.isNegative()) {
        // We know that the sign bit is one.
        Known.makeNegative();
      }
    }
    break;
  case ICmpInst::ICMP_SLT:
    // assume(v <_s c) where c is non-positive
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      if (RHSKnown.isZero() || RHSKnown.isNegative()) {
        // We know that the sign bit is one.
        Known.makeNegative();
      }
    }
    break;
  case ICmpInst::ICMP_ULE:
    // assume(v <=_u c)
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // Whatever high bits in c are zero are known to be zero.
      Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros());
    }
    break;
  case ICmpInst::ICMP_ULT:
    // assume(v <_u c)
    if (match(Cmp, m_ICmp(Pred, m_V, m_Value(A))) &&
        isValidAssumeForContext(I, Q.CxtI, Q.DT)) {
      KnownBits RHSKnown =
          computeKnownBits(A, Depth+1, QueryNoAC).anyextOrTrunc(BitWidth);

      // If the RHS is known zero, then this assumption must be wrong (nothing
      // is unsigned less than zero). Signal a conflict and get out of here.
      if (RHSKnown.isZero()) {
        Known.Zero.setAllBits();
        Known.One.setAllBits();
        break;
      }

      // Whatever high bits in c are zero are known to be zero (if c is a power
      // of 2, then one more).
      if (isKnownToBeAPowerOfTwo(A, false, Depth + 1, QueryNoAC))
        Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros() + 1);
      else
        Known.Zero.setHighBits(RHSKnown.countMinLeadingZeros());
    }
    break;
  }
}

// If assumptions conflict with each other or previous known bits, then we
// have a logical fallacy. It's possible that the assumption is not reachable,
// so this isn't a real bug. On the other hand, the program may have undefined
// behavior, or we might have a bug in the compiler. We can't assert/crash, so
// clear out the known bits, try to warn the user, and hope for the best.
if (Known.Zero.intersects(Known.One)) {
  Known.resetAll();

  if (Q.ORE)
    Q.ORE->emit([&]() {
      auto *CxtI = const_cast<Instruction *>(Q.CxtI);
      return OptimizationRemarkAnalysis("value-tracking", "BadAssumption",
                                        CxtI)
             << "Detected conflicting code assumptions. Program may "
                "have undefined behavior, or compiler may have "
                "internal error.";
    });
}
951}

953/// Compute known bits from a shift operator, including those with a
954/// non-constant shift amount. Known is the output of this function. Known2 is a
955/// pre-allocated temporary with the same bit width as Known and on return
956/// contains the known bit of the shift value source. KF is an
957/// operator-specific function that, given the known-bits and a shift amount,
958/// compute the implied known-bits of the shift operator's result respectively
959/// for that shift amount. The results from calling KF are conservatively
960/// combined for all permitted shift amounts.
961static void computeKnownBitsFromShiftOperator(
  const Operator *I, const APInt &DemandedElts, KnownBits &Known,
  KnownBits &Known2, unsigned Depth, const Query &Q,
  function_ref<KnownBits(const KnownBits &, const KnownBits &)> KF) {
unsigned BitWidth = Known.getBitWidth();
computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);
computeKnownBits(I->getOperand(1), DemandedElts, Known, Depth + 1, Q);

// Note: We cannot use Known.Zero.getLimitedValue() here, because if
// BitWidth > 64 and any upper bits are known, we'll end up returning the
// limit value (which implies all bits are known).
uint64_t ShiftAmtKZ = Known.Zero.zextOrTrunc(64).getZExtValue();
uint64_t ShiftAmtKO = Known.One.zextOrTrunc(64).getZExtValue();
bool ShiftAmtIsConstant = Known.isConstant();
bool MaxShiftAmtIsOutOfRange = Known.getMaxValue().uge(BitWidth);

if (ShiftAmtIsConstant) {
  Known = KF(Known2, Known);

  // If the known bits conflict, this must be an overflowing left shift, so
  // the shift result is poison. We can return anything we want. Choose 0 for
  // the best folding opportunity.
  if (Known.hasConflict())
    Known.setAllZero();

  return;
}

// If the shift amount could be greater than or equal to the bit-width of the
// LHS, the value could be poison, but bail out because the check below is
// expensive.
// TODO: Should we just carry on?
if (MaxShiftAmtIsOutOfRange) {
  Known.resetAll();
  return;
}

// It would be more-clearly correct to use the two temporaries for this
// calculation. Reusing the APInts here to prevent unnecessary allocations.
Known.resetAll();

// If we know the shifter operand is nonzero, we can sometimes infer more
// known bits. However this is expensive to compute, so be lazy about it and
// only compute it when absolutely necessary.
Optional<bool> ShifterOperandIsNonZero;

// Early exit if we can't constrain any well-defined shift amount.
if (!(ShiftAmtKZ & (PowerOf2Ceil(BitWidth) - 1)) &&
    !(ShiftAmtKO & (PowerOf2Ceil(BitWidth) - 1))) {
  ShifterOperandIsNonZero =
      isKnownNonZero(I->getOperand(1), DemandedElts, Depth + 1, Q);
  if (!*ShifterOperandIsNonZero)
    return;
}

Known.Zero.setAllBits();
Known.One.setAllBits();
for (unsigned ShiftAmt = 0; ShiftAmt < BitWidth; ++ShiftAmt) {
  // Combine the shifted known input bits only for those shift amounts
  // compatible with its known constraints.
  if ((ShiftAmt & ~ShiftAmtKZ) != ShiftAmt)
    continue;
  if ((ShiftAmt | ShiftAmtKO) != ShiftAmt)
    continue;
  // If we know the shifter is nonzero, we may be able to infer more known
  // bits. This check is sunk down as far as possible to avoid the expensive
  // call to isKnownNonZero if the cheaper checks above fail.
  if (ShiftAmt == 0) {
    if (!ShifterOperandIsNonZero.hasValue())
      ShifterOperandIsNonZero =
          isKnownNonZero(I->getOperand(1), DemandedElts, Depth + 1, Q);
    if (*ShifterOperandIsNonZero)
      continue;
  }

  Known = KnownBits::commonBits(
      Known, KF(Known2, KnownBits::makeConstant(APInt(32, ShiftAmt))));
}

// If the known bits conflict, the result is poison. Return a 0 and hope the
// caller can further optimize that.
if (Known.hasConflict())
  Known.setAllZero();
1044}

1046static void computeKnownBitsFromOperator(const Operator *I,
                                       const APInt &DemandedElts,
                                       KnownBits &Known, unsigned Depth,
                                       const Query &Q) {
unsigned BitWidth = Known.getBitWidth();

KnownBits Known2(BitWidth);
switch (I->getOpcode()) {
default: break;
case Instruction::Load:
  if (MDNode *MD =
          Q.IIQ.getMetadata(cast<LoadInst>(I), LLVMContext::MD_range))
    computeKnownBitsFromRangeMetadata(*MD, Known);
  break;
case Instruction::And: {
  // If either the LHS or the RHS are Zero, the result is zero.
  computeKnownBits(I->getOperand(1), DemandedElts, Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);

  Known &= Known2;

  // and(x, add (x, -1)) is a common idiom that always clears the low bit;
  // here we handle the more general case of adding any odd number by
  // matching the form add(x, add(x, y)) where y is odd.
  // TODO: This could be generalized to clearing any bit set in y where the
  // following bit is known to be unset in y.
  Value *X = nullptr, *Y = nullptr;
  if (!Known.Zero[0] && !Known.One[0] &&
      match(I, m_c_BinOp(m_Value(X), m_Add(m_Deferred(X), m_Value(Y))))) {
    Known2.resetAll();
    computeKnownBits(Y, DemandedElts, Known2, Depth + 1, Q);
    if (Known2.countMinTrailingOnes() > 0)
      Known.Zero.setBit(0);
  }
  break;
}
case Instruction::Or:
  computeKnownBits(I->getOperand(1), DemandedElts, Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);

  Known |= Known2;
  break;
case Instruction::Xor:
  computeKnownBits(I->getOperand(1), DemandedElts, Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);

  Known ^= Known2;
  break;
case Instruction::Mul: {
  bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));
  computeKnownBitsMul(I->getOperand(0), I->getOperand(1), NSW, DemandedElts,
                      Known, Known2, Depth, Q);
  break;
}
case Instruction::UDiv: {
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
  Known = KnownBits::udiv(Known, Known2);
  break;
}
case Instruction::Select: {
  const Value *LHS = nullptr, *RHS = nullptr;
  SelectPatternFlavor SPF = matchSelectPattern(I, LHS, RHS).Flavor;
  if (SelectPatternResult::isMinOrMax(SPF)) {
    computeKnownBits(RHS, Known, Depth + 1, Q);
    computeKnownBits(LHS, Known2, Depth + 1, Q);
    switch (SPF) {
    default:
      llvm_unreachable("Unhandled select pattern flavor!")::llvm::llvm_unreachable_internal("Unhandled select pattern flavor!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1114);
    case SPF_SMAX:
      Known = KnownBits::smax(Known, Known2);
      break;
    case SPF_SMIN:
      Known = KnownBits::smin(Known, Known2);
      break;
    case SPF_UMAX:
      Known = KnownBits::umax(Known, Known2);
      break;
    case SPF_UMIN:
      Known = KnownBits::umin(Known, Known2);
      break;
    }
    break;
  }

  computeKnownBits(I->getOperand(2), Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);

  // Only known if known in both the LHS and RHS.
  Known = KnownBits::commonBits(Known, Known2);

  if (SPF == SPF_ABS) {
    // RHS from matchSelectPattern returns the negation part of abs pattern.
    // If the negate has an NSW flag we can assume the sign bit of the result
    // will be 0 because that makes abs(INT_MIN) undefined.
    if (match(RHS, m_Neg(m_Specific(LHS))) &&
        Q.IIQ.hasNoSignedWrap(cast<Instruction>(RHS)))
      Known.Zero.setSignBit();
  }

  break;
}
case Instruction::FPTrunc:
case Instruction::FPExt:
case Instruction::FPToUI:
case Instruction::FPToSI:
case Instruction::SIToFP:
case Instruction::UIToFP:
  break; // Can't work with floating point.
case Instruction::PtrToInt:
case Instruction::IntToPtr:
  // Fall through and handle them the same as zext/trunc.
  LLVM_FALLTHROUGH[[gnu::fallthrough]];
case Instruction::ZExt:
case Instruction::Trunc: {
  Type *SrcTy = I->getOperand(0)->getType();

  unsigned SrcBitWidth;
  // Note that we handle pointer operands here because of inttoptr/ptrtoint
  // which fall through here.
  Type *ScalarTy = SrcTy->getScalarType();
  SrcBitWidth = ScalarTy->isPointerTy() ?
    Q.DL.getPointerTypeSizeInBits(ScalarTy) :
    Q.DL.getTypeSizeInBits(ScalarTy);

  assert(SrcBitWidth && "SrcBitWidth can't be zero")(static_cast <bool> (SrcBitWidth && "SrcBitWidth can't be zero"
) ? void (0) : __assert_fail ("SrcBitWidth && \"SrcBitWidth can't be zero\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1171, __extension__ __PRETTY_FUNCTION__));
  Known = Known.anyextOrTrunc(SrcBitWidth);
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  Known = Known.zextOrTrunc(BitWidth);
  break;
}
case Instruction::BitCast: {
  Type *SrcTy = I->getOperand(0)->getType();
  if (SrcTy->isIntOrPtrTy() &&
      // TODO: For now, not handling conversions like:
      // (bitcast i64 %x to <2 x i32>)
      !I->getType()->isVectorTy()) {
    computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
    break;
  }

  // Handle cast from vector integer type to scalar or vector integer.
  auto *SrcVecTy = dyn_cast<FixedVectorType>(SrcTy);
  if (!SrcVecTy || !SrcVecTy->getElementType()->isIntegerTy() ||
      !I->getType()->isIntOrIntVectorTy())
    break;

  // Look through a cast from narrow vector elements to wider type.
  // Examples: v4i32 -> v2i64, v3i8 -> v24
  unsigned SubBitWidth = SrcVecTy->getScalarSizeInBits();
  if (BitWidth % SubBitWidth == 0) {
    // Known bits are automatically intersected across demanded elements of a
    // vector. So for example, if a bit is computed as known zero, it must be
    // zero across all demanded elements of the vector.
    //
    // For this bitcast, each demanded element of the output is sub-divided
    // across a set of smaller vector elements in the source vector. To get
    // the known bits for an entire element of the output, compute the known
    // bits for each sub-element sequentially. This is done by shifting the
    // one-set-bit demanded elements parameter across the sub-elements for
    // consecutive calls to computeKnownBits. We are using the demanded
    // elements parameter as a mask operator.
    //
    // The known bits of each sub-element are then inserted into place
    // (dependent on endian) to form the full result of known bits.
    unsigned NumElts = DemandedElts.getBitWidth();
    unsigned SubScale = BitWidth / SubBitWidth;
    APInt SubDemandedElts = APInt::getNullValue(NumElts * SubScale);
    for (unsigned i = 0; i != NumElts; ++i) {
      if (DemandedElts[i])
        SubDemandedElts.setBit(i * SubScale);
    }

    KnownBits KnownSrc(SubBitWidth);
    for (unsigned i = 0; i != SubScale; ++i) {
      computeKnownBits(I->getOperand(0), SubDemandedElts.shl(i), KnownSrc,
                       Depth + 1, Q);
      unsigned ShiftElt = Q.DL.isLittleEndian() ? i : SubScale - 1 - i;
      Known.insertBits(KnownSrc, ShiftElt * SubBitWidth);
    }
  }
  break;
}
case Instruction::SExt: {
  // Compute the bits in the result that are not present in the input.
  unsigned SrcBitWidth = I->getOperand(0)->getType()->getScalarSizeInBits();

  Known = Known.trunc(SrcBitWidth);
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  // If the sign bit of the input is known set or clear, then we know the
  // top bits of the result.
  Known = Known.sext(BitWidth);
  break;
}
case Instruction::Shl: {
  bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));
  auto KF = [NSW](const KnownBits &KnownVal, const KnownBits &KnownAmt) {
    KnownBits Result = KnownBits::shl(KnownVal, KnownAmt);
    // If this shift has "nsw" keyword, then the result is either a poison
    // value or has the same sign bit as the first operand.
    if (NSW) {
      if (KnownVal.Zero.isSignBitSet())
        Result.Zero.setSignBit();
      if (KnownVal.One.isSignBitSet())
        Result.One.setSignBit();
    }
    return Result;
  };
  computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Depth, Q,
                                    KF);
  // Trailing zeros of a right-shifted constant never decrease.
  const APInt *C;
  if (match(I->getOperand(0), m_APInt(C)))
    Known.Zero.setLowBits(C->countTrailingZeros());
  break;
}
case Instruction::LShr: {
  auto KF = [](const KnownBits &KnownVal, const KnownBits &KnownAmt) {
    return KnownBits::lshr(KnownVal, KnownAmt);
  };
  computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Depth, Q,
                                    KF);
  // Leading zeros of a left-shifted constant never decrease.
  const APInt *C;
  if (match(I->getOperand(0), m_APInt(C)))
    Known.Zero.setHighBits(C->countLeadingZeros());
  break;
}
case Instruction::AShr: {
  auto KF = [](const KnownBits &KnownVal, const KnownBits &KnownAmt) {
    return KnownBits::ashr(KnownVal, KnownAmt);
  };
  computeKnownBitsFromShiftOperator(I, DemandedElts, Known, Known2, Depth, Q,
                                    KF);
  break;
}
case Instruction::Sub: {
  bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));
  computeKnownBitsAddSub(false, I->getOperand(0), I->getOperand(1), NSW,
                         DemandedElts, Known, Known2, Depth, Q);
  break;
}
case Instruction::Add: {
  bool NSW = Q.IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(I));
  computeKnownBitsAddSub(true, I->getOperand(0), I->getOperand(1), NSW,
                         DemandedElts, Known, Known2, Depth, Q);
  break;
}
case Instruction::SRem:
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
  Known = KnownBits::srem(Known, Known2);
  break;

case Instruction::URem:
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
  Known = KnownBits::urem(Known, Known2);
  break;
case Instruction::Alloca:
  Known.Zero.setLowBits(Log2(cast<AllocaInst>(I)->getAlign()));
  break;
case Instruction::GetElementPtr: {
  // Analyze all of the subscripts of this getelementptr instruction
  // to determine if we can prove known low zero bits.
  computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  // Accumulate the constant indices in a separate variable
  // to minimize the number of calls to computeForAddSub.
  APInt AccConstIndices(BitWidth, 0, /*IsSigned*/ true);

  gep_type_iterator GTI = gep_type_begin(I);
  for (unsigned i = 1, e = I->getNumOperands(); i != e; ++i, ++GTI) {
    // TrailZ can only become smaller, short-circuit if we hit zero.
    if (Known.isUnknown())
      break;

    Value *Index = I->getOperand(i);

    // Handle case when index is zero.
    Constant *CIndex = dyn_cast<Constant>(Index);
    if (CIndex && CIndex->isZeroValue())
      continue;

    if (StructType *STy = GTI.getStructTypeOrNull()) {
      // Handle struct member offset arithmetic.

      assert(CIndex &&(static_cast <bool> (CIndex && "Access to structure field must be known at compile time"
) ? void (0) : __assert_fail ("CIndex && \"Access to structure field must be known at compile time\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1333, __extension__ __PRETTY_FUNCTION__))
             "Access to structure field must be known at compile time")(static_cast <bool> (CIndex && "Access to structure field must be known at compile time"
) ? void (0) : __assert_fail ("CIndex && \"Access to structure field must be known at compile time\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1333, __extension__ __PRETTY_FUNCTION__));

      if (CIndex->getType()->isVectorTy())
        Index = CIndex->getSplatValue();

      unsigned Idx = cast<ConstantInt>(Index)->getZExtValue();
      const StructLayout *SL = Q.DL.getStructLayout(STy);
      uint64_t Offset = SL->getElementOffset(Idx);
      AccConstIndices += Offset;
      continue;
    }

    // Handle array index arithmetic.
    Type *IndexedTy = GTI.getIndexedType();
    if (!IndexedTy->isSized()) {
      Known.resetAll();
      break;
    }

    unsigned IndexBitWidth = Index->getType()->getScalarSizeInBits();
    KnownBits IndexBits(IndexBitWidth);
    computeKnownBits(Index, IndexBits, Depth + 1, Q);
    TypeSize IndexTypeSize = Q.DL.getTypeAllocSize(IndexedTy);
    uint64_t TypeSizeInBytes = IndexTypeSize.getKnownMinSize();
    KnownBits ScalingFactor(IndexBitWidth);
    // Multiply by current sizeof type.
    // &A[i] == A + i * sizeof(*A[i]).
    if (IndexTypeSize.isScalable()) {
      // For scalable types the only thing we know about sizeof is
      // that this is a multiple of the minimum size.
      ScalingFactor.Zero.setLowBits(countTrailingZeros(TypeSizeInBytes));
    } else if (IndexBits.isConstant()) {
      APInt IndexConst = IndexBits.getConstant();
      APInt ScalingFactor(IndexBitWidth, TypeSizeInBytes);
      IndexConst *= ScalingFactor;
      AccConstIndices += IndexConst.sextOrTrunc(BitWidth);
      continue;
    } else {
      ScalingFactor =
          KnownBits::makeConstant(APInt(IndexBitWidth, TypeSizeInBytes));
    }
    IndexBits = KnownBits::mul(IndexBits, ScalingFactor);

    // If the offsets have a different width from the pointer, according
    // to the language reference we need to sign-extend or truncate them
    // to the width of the pointer.
    IndexBits = IndexBits.sextOrTrunc(BitWidth);

    // Note that inbounds does *not* guarantee nsw for the addition, as only
    // the offset is signed, while the base address is unsigned.
    Known = KnownBits::computeForAddSub(
        /*Add=*/true, /*NSW=*/false, Known, IndexBits);
  }
  if (!Known.isUnknown() && !AccConstIndices.isNullValue()) {
    KnownBits Index = KnownBits::makeConstant(AccConstIndices);
    Known = KnownBits::computeForAddSub(
        /*Add=*/true, /*NSW=*/false, Known, Index);
  }
  break;
}
case Instruction::PHI: {
  const PHINode *P = cast<PHINode>(I);
  BinaryOperator *BO = nullptr;
  Value *R = nullptr, *L = nullptr;
  if (matchSimpleRecurrence(P, BO, R, L)) {
    // Handle the case of a simple two-predecessor recurrence PHI.
    // There's a lot more that could theoretically be done here, but
    // this is sufficient to catch some interesting cases.
    unsigned Opcode = BO->getOpcode();

    // If this is a shift recurrence, we know the bits being shifted in.
    // We can combine that with information about the start value of the
    // recurrence to conclude facts about the result.
    if ((Opcode == Instruction::LShr || Opcode == Instruction::AShr ||
         Opcode == Instruction::Shl) &&
        BO->getOperand(0) == I) {

      // We have matched a recurrence of the form:
      // %iv = [R, %entry], [%iv.next, %backedge]
      // %iv.next = shift_op %iv, L

      // Recurse with the phi context to avoid concern about whether facts
      // inferred hold at original context instruction.  TODO: It may be
      // correct to use the original context.  IF warranted, explore and
      // add sufficient tests to cover.
      Query RecQ = Q;
      RecQ.CxtI = P;
      computeKnownBits(R, DemandedElts, Known2, Depth + 1, RecQ);
      switch (Opcode) {
      case Instruction::Shl:
        // A shl recurrence will only increase the tailing zeros
        Known.Zero.setLowBits(Known2.countMinTrailingZeros());
        break;
      case Instruction::LShr:
        // A lshr recurrence will preserve the leading zeros of the
        // start value
        Known.Zero.setHighBits(Known2.countMinLeadingZeros());
        break;
      case Instruction::AShr:
        // An ashr recurrence will extend the initial sign bit
        Known.Zero.setHighBits(Known2.countMinLeadingZeros());
        Known.One.setHighBits(Known2.countMinLeadingOnes());
        break;
      };
    }

    // Check for operations that have the property that if
    // both their operands have low zero bits, the result
    // will have low zero bits.
    if (Opcode == Instruction::Add ||
        Opcode == Instruction::Sub ||
        Opcode == Instruction::And ||
        Opcode == Instruction::Or ||
        Opcode == Instruction::Mul) {
      // Change the context instruction to the "edge" that flows into the
      // phi. This is important because that is where the value is actually
      // "evaluated" even though it is used later somewhere else. (see also
      // D69571).
      Query RecQ = Q;

      unsigned OpNum = P->getOperand(0) == R ? 0 : 1;
      Instruction *RInst = P->getIncomingBlock(OpNum)->getTerminator();
      Instruction *LInst = P->getIncomingBlock(1-OpNum)->getTerminator();

      // Ok, we have a PHI of the form L op= R. Check for low
      // zero bits.
      RecQ.CxtI = RInst;
      computeKnownBits(R, Known2, Depth + 1, RecQ);

      // We need to take the minimum number of known bits
      KnownBits Known3(BitWidth);
      RecQ.CxtI = LInst;
      computeKnownBits(L, Known3, Depth + 1, RecQ);

      Known.Zero.setLowBits(std::min(Known2.countMinTrailingZeros(),
                                     Known3.countMinTrailingZeros()));

      auto *OverflowOp = dyn_cast<OverflowingBinaryOperator>(BO);
      if (OverflowOp && Q.IIQ.hasNoSignedWrap(OverflowOp)) {
        // If initial value of recurrence is nonnegative, and we are adding
        // a nonnegative number with nsw, the result can only be nonnegative
        // or poison value regardless of the number of times we execute the
        // add in phi recurrence. If initial value is negative and we are
        // adding a negative number with nsw, the result can only be
        // negative or poison value. Similar arguments apply to sub and mul.
        //
        // (add non-negative, non-negative) --> non-negative
        // (add negative, negative) --> negative
        if (Opcode == Instruction::Add) {
          if (Known2.isNonNegative() && Known3.isNonNegative())
            Known.makeNonNegative();
          else if (Known2.isNegative() && Known3.isNegative())
            Known.makeNegative();
        }

        // (sub nsw non-negative, negative) --> non-negative
        // (sub nsw negative, non-negative) --> negative
        else if (Opcode == Instruction::Sub && BO->getOperand(0) == I) {
          if (Known2.isNonNegative() && Known3.isNegative())
            Known.makeNonNegative();
          else if (Known2.isNegative() && Known3.isNonNegative())
            Known.makeNegative();
        }

        // (mul nsw non-negative, non-negative) --> non-negative
        else if (Opcode == Instruction::Mul && Known2.isNonNegative() &&
                 Known3.isNonNegative())
          Known.makeNonNegative();
      }

      break;
    }
  }

  // Unreachable blocks may have zero-operand PHI nodes.
  if (P->getNumIncomingValues() == 0)
    break;

  // Otherwise take the unions of the known bit sets of the operands,
  // taking conservative care to avoid excessive recursion.
  if (Depth < MaxAnalysisRecursionDepth - 1 && !Known.Zero && !Known.One) {
    // Skip if every incoming value references to ourself.
    if (dyn_cast_or_null<UndefValue>(P->hasConstantValue()))
      break;

    Known.Zero.setAllBits();
    Known.One.setAllBits();
    for (unsigned u = 0, e = P->getNumIncomingValues(); u < e; ++u) {
      Value *IncValue = P->getIncomingValue(u);
      // Skip direct self references.
      if (IncValue == P) continue;

      // Change the context instruction to the "edge" that flows into the
      // phi. This is important because that is where the value is actually
      // "evaluated" even though it is used later somewhere else. (see also
      // D69571).
      Query RecQ = Q;
      RecQ.CxtI = P->getIncomingBlock(u)->getTerminator();

      Known2 = KnownBits(BitWidth);
      // Recurse, but cap the recursion to one level, because we don't
      // want to waste time spinning around in loops.
      computeKnownBits(IncValue, Known2, MaxAnalysisRecursionDepth - 1, RecQ);
      Known = KnownBits::commonBits(Known, Known2);
      // If all bits have been ruled out, there's no need to check
      // more operands.
      if (Known.isUnknown())
        break;
    }
  }
  break;
}
case Instruction::Call:
case Instruction::Invoke:
  // If range metadata is attached to this call, set known bits from that,
  // and then intersect with known bits based on other properties of the
  // function.
  if (MDNode *MD =
          Q.IIQ.getMetadata(cast<Instruction>(I), LLVMContext::MD_range))
    computeKnownBitsFromRangeMetadata(*MD, Known);
  if (const Value *RV = cast<CallBase>(I)->getReturnedArgOperand()) {
    computeKnownBits(RV, Known2, Depth + 1, Q);
    Known.Zero |= Known2.Zero;
    Known.One |= Known2.One;
  }
  if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
    switch (II->getIntrinsicID()) {
    default: break;
    case Intrinsic::abs: {
      computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
      bool IntMinIsPoison = match(II->getArgOperand(1), m_One());
      Known = Known2.abs(IntMinIsPoison);
      break;
    }
    case Intrinsic::bitreverse:
      computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);
      Known.Zero |= Known2.Zero.reverseBits();
      Known.One |= Known2.One.reverseBits();
      break;
    case Intrinsic::bswap:
      computeKnownBits(I->getOperand(0), DemandedElts, Known2, Depth + 1, Q);
      Known.Zero |= Known2.Zero.byteSwap();
      Known.One |= Known2.One.byteSwap();
      break;
    case Intrinsic::ctlz: {
      computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
      // If we have a known 1, its position is our upper bound.
      unsigned PossibleLZ = Known2.countMaxLeadingZeros();
      // If this call is undefined for 0, the result will be less than 2^n.
      if (II->getArgOperand(1) == ConstantInt::getTrue(II->getContext()))
        PossibleLZ = std::min(PossibleLZ, BitWidth - 1);
      unsigned LowBits = Log2_32(PossibleLZ)+1;
      Known.Zero.setBitsFrom(LowBits);
      break;
    }
    case Intrinsic::cttz: {
      computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
      // If we have a known 1, its position is our upper bound.
      unsigned PossibleTZ = Known2.countMaxTrailingZeros();
      // If this call is undefined for 0, the result will be less than 2^n.
      if (II->getArgOperand(1) == ConstantInt::getTrue(II->getContext()))
        PossibleTZ = std::min(PossibleTZ, BitWidth - 1);
      unsigned LowBits = Log2_32(PossibleTZ)+1;
      Known.Zero.setBitsFrom(LowBits);
      break;
    }
    case Intrinsic::ctpop: {
      computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
      // We can bound the space the count needs.  Also, bits known to be zero
      // can't contribute to the population.
      unsigned BitsPossiblySet = Known2.countMaxPopulation();
      unsigned LowBits = Log2_32(BitsPossiblySet)+1;
      Known.Zero.setBitsFrom(LowBits);
      // TODO: we could bound KnownOne using the lower bound on the number
      // of bits which might be set provided by popcnt KnownOne2.
      break;
    }
    case Intrinsic::fshr:
    case Intrinsic::fshl: {
      const APInt *SA;
      if (!match(I->getOperand(2), m_APInt(SA)))
        break;

      // Normalize to funnel shift left.
      uint64_t ShiftAmt = SA->urem(BitWidth);
      if (II->getIntrinsicID() == Intrinsic::fshr)
        ShiftAmt = BitWidth - ShiftAmt;

      KnownBits Known3(BitWidth);
      computeKnownBits(I->getOperand(0), Known2, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known3, Depth + 1, Q);

      Known.Zero =
          Known2.Zero.shl(ShiftAmt) | Known3.Zero.lshr(BitWidth - ShiftAmt);
      Known.One =
          Known2.One.shl(ShiftAmt) | Known3.One.lshr(BitWidth - ShiftAmt);
      break;
    }
    case Intrinsic::uadd_sat:
    case Intrinsic::usub_sat: {
      bool IsAdd = II->getIntrinsicID() == Intrinsic::uadd_sat;
      computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);

      // Add: Leading ones of either operand are preserved.
      // Sub: Leading zeros of LHS and leading ones of RHS are preserved
      // as leading zeros in the result.
      unsigned LeadingKnown;
      if (IsAdd)
        LeadingKnown = std::max(Known.countMinLeadingOnes(),
                                Known2.countMinLeadingOnes());
      else
        LeadingKnown = std::max(Known.countMinLeadingZeros(),
                                Known2.countMinLeadingOnes());

      Known = KnownBits::computeForAddSub(
          IsAdd, /* NSW */ false, Known, Known2);

      // We select between the operation result and all-ones/zero
      // respectively, so we can preserve known ones/zeros.
      if (IsAdd) {
        Known.One.setHighBits(LeadingKnown);
        Known.Zero.clearAllBits();
      } else {
        Known.Zero.setHighBits(LeadingKnown);
        Known.One.clearAllBits();
      }
      break;
    }
    case Intrinsic::umin:
      computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
      Known = KnownBits::umin(Known, Known2);
      break;
    case Intrinsic::umax:
      computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
      Known = KnownBits::umax(Known, Known2);
      break;
    case Intrinsic::smin:
      computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
      Known = KnownBits::smin(Known, Known2);
      break;
    case Intrinsic::smax:
      computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
      computeKnownBits(I->getOperand(1), Known2, Depth + 1, Q);
      Known = KnownBits::smax(Known, Known2);
      break;
    case Intrinsic::x86_sse42_crc32_64_64:
      Known.Zero.setBitsFrom(32);
      break;
    case Intrinsic::riscv_vsetvli:
    case Intrinsic::riscv_vsetvlimax:
      // Assume that VL output is positive and would fit in an int32_t.
      // TODO: VLEN might be capped at 16 bits in a future V spec update.
      if (BitWidth >= 32)
        Known.Zero.setBitsFrom(31);
      break;
    }
  }
  break;
case Instruction::ShuffleVector: {
  auto *Shuf = dyn_cast<ShuffleVectorInst>(I);
  // FIXME: Do we need to handle ConstantExpr involving shufflevectors?
  if (!Shuf) {
    Known.resetAll();
    return;
  }
  // For undef elements, we don't know anything about the common state of
  // the shuffle result.
  APInt DemandedLHS, DemandedRHS;
  if (!getShuffleDemandedElts(Shuf, DemandedElts, DemandedLHS, DemandedRHS)) {
    Known.resetAll();
    return;
  }
  Known.One.setAllBits();
  Known.Zero.setAllBits();
  if (!!DemandedLHS) {
    const Value *LHS = Shuf->getOperand(0);
    computeKnownBits(LHS, DemandedLHS, Known, Depth + 1, Q);
    // If we don't know any bits, early out.
    if (Known.isUnknown())
      break;
  }
  if (!!DemandedRHS) {
    const Value *RHS = Shuf->getOperand(1);
    computeKnownBits(RHS, DemandedRHS, Known2, Depth + 1, Q);
    Known = KnownBits::commonBits(Known, Known2);
  }
  break;
}
case Instruction::InsertElement: {
  const Value *Vec = I->getOperand(0);
  const Value *Elt = I->getOperand(1);
  auto *CIdx = dyn_cast<ConstantInt>(I->getOperand(2));
  // Early out if the index is non-constant or out-of-range.
  unsigned NumElts = DemandedElts.getBitWidth();
  if (!CIdx || CIdx->getValue().uge(NumElts)) {
    Known.resetAll();
    return;
  }
  Known.One.setAllBits();
  Known.Zero.setAllBits();
  unsigned EltIdx = CIdx->getZExtValue();
  // Do we demand the inserted element?
  if (DemandedElts[EltIdx]) {
    computeKnownBits(Elt, Known, Depth + 1, Q);
    // If we don't know any bits, early out.
    if (Known.isUnknown())
      break;
  }
  // We don't need the base vector element that has been inserted.
  APInt DemandedVecElts = DemandedElts;
  DemandedVecElts.clearBit(EltIdx);
  if (!!DemandedVecElts) {
    computeKnownBits(Vec, DemandedVecElts, Known2, Depth + 1, Q);
    Known = KnownBits::commonBits(Known, Known2);
  }
  break;
}
case Instruction::ExtractElement: {
  // Look through extract element. If the index is non-constant or
  // out-of-range demand all elements, otherwise just the extracted element.
  const Value *Vec = I->getOperand(0);
  const Value *Idx = I->getOperand(1);
  auto *CIdx = dyn_cast<ConstantInt>(Idx);
  if (isa<ScalableVectorType>(Vec->getType())) {
    // FIXME: there's probably *something* we can do with scalable vectors
    Known.resetAll();
    break;
  }
  unsigned NumElts = cast<FixedVectorType>(Vec->getType())->getNumElements();
  APInt DemandedVecElts = APInt::getAllOnesValue(NumElts);
  if (CIdx && CIdx->getValue().ult(NumElts))
    DemandedVecElts = APInt::getOneBitSet(NumElts, CIdx->getZExtValue());
  computeKnownBits(Vec, DemandedVecElts, Known, Depth + 1, Q);
  break;
}
case Instruction::ExtractValue:
  if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I->getOperand(0))) {
    const ExtractValueInst *EVI = cast<ExtractValueInst>(I);
    if (EVI->getNumIndices() != 1) break;
    if (EVI->getIndices()[0] == 0) {
      switch (II->getIntrinsicID()) {
      default: break;
      case Intrinsic::uadd_with_overflow:
      case Intrinsic::sadd_with_overflow:
        computeKnownBitsAddSub(true, II->getArgOperand(0),
                               II->getArgOperand(1), false, DemandedElts,
                               Known, Known2, Depth, Q);
        break;
      case Intrinsic::usub_with_overflow:
      case Intrinsic::ssub_with_overflow:
        computeKnownBitsAddSub(false, II->getArgOperand(0),
                               II->getArgOperand(1), false, DemandedElts,
                               Known, Known2, Depth, Q);
        break;
      case Intrinsic::umul_with_overflow:
      case Intrinsic::smul_with_overflow:
        computeKnownBitsMul(II->getArgOperand(0), II->getArgOperand(1), false,
                            DemandedElts, Known, Known2, Depth, Q);
        break;
      }
    }
  }
  break;
case Instruction::Freeze:
  if (isGuaranteedNotToBePoison(I->getOperand(0), Q.AC, Q.CxtI, Q.DT,
                                Depth + 1))
    computeKnownBits(I->getOperand(0), Known, Depth + 1, Q);
  break;
}
1806}

1808/// Determine which bits of V are known to be either zero or one and return
1809/// them.
1810KnownBits computeKnownBits(const Value *V, const APInt &DemandedElts,
                         unsigned Depth, const Query &Q) {
KnownBits Known(getBitWidth(V->getType(), Q.DL));
computeKnownBits(V, DemandedElts, Known, Depth, Q);
return Known;
1815}

1817/// Determine which bits of V are known to be either zero or one and return
1818/// them.
1819KnownBits computeKnownBits(const Value *V, unsigned Depth, const Query &Q) {
KnownBits Known(getBitWidth(V->getType(), Q.DL));
computeKnownBits(V, Known, Depth, Q);
return Known;
1823}

1825/// Determine which bits of V are known to be either zero or one and return
1826/// them in the Known bit set.
1827///
1828/// NOTE: we cannot consider 'undef' to be "IsZero" here.  The problem is that
1829/// we cannot optimize based on the assumption that it is zero without changing
1830/// it to be an explicit zero.  If we don't change it to zero, other code could
1831/// optimized based on the contradictory assumption that it is non-zero.
1832/// Because instcombine aggressively folds operations with undef args anyway,
1833/// this won't lose us code quality.
1834///
1835/// This function is defined on values with integer type, values with pointer
1836/// type, and vectors of integers.  In the case
1837/// where V is a vector, known zero, and known one values are the
1838/// same width as the vector element, and the bit is set only if it is true
1839/// for all of the demanded elements in the vector specified by DemandedElts.
1840void computeKnownBits(const Value *V, const APInt &DemandedElts,
                    KnownBits &Known, unsigned Depth, const Query &Q) {
if (!DemandedElts || isa<ScalableVectorType>(V->getType())) {
  // No demanded elts or V is a scalable vector, better to assume we don't
  // know anything.
  Known.resetAll();
  return;
}

assert(V && "No Value?")(static_cast <bool> (V && "No Value?") ? void (
0) : __assert_fail ("V && \"No Value?\"", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1849, __extension__ __PRETTY_FUNCTION__));
assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth")(static_cast <bool> (Depth <= MaxAnalysisRecursionDepth
 && "Limit Search Depth") ? void (0) : __assert_fail (
"Depth <= MaxAnalysisRecursionDepth && \"Limit Search Depth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1850, __extension__ __PRETTY_FUNCTION__));

1852#ifndef NDEBUG
Type *Ty = V->getType();
unsigned BitWidth = Known.getBitWidth();

assert((Ty->isIntOrIntVectorTy(BitWidth) || Ty->isPtrOrPtrVectorTy()) &&(static_cast <bool> ((Ty->isIntOrIntVectorTy(BitWidth
) || Ty->isPtrOrPtrVectorTy()) && "Not integer or pointer type!"
) ? void (0) : __assert_fail ("(Ty->isIntOrIntVectorTy(BitWidth) || Ty->isPtrOrPtrVectorTy()) && \"Not integer or pointer type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1857, __extension__ __PRETTY_FUNCTION__))
       "Not integer or pointer type!")(static_cast <bool> ((Ty->isIntOrIntVectorTy(BitWidth
) || Ty->isPtrOrPtrVectorTy()) && "Not integer or pointer type!"
) ? void (0) : __assert_fail ("(Ty->isIntOrIntVectorTy(BitWidth) || Ty->isPtrOrPtrVectorTy()) && \"Not integer or pointer type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1857, __extension__ __PRETTY_FUNCTION__));

if (auto *FVTy = dyn_cast<FixedVectorType>(Ty)) {
  assert((static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1862, __extension__ __PRETTY_FUNCTION__))
      FVTy->getNumElements() == DemandedElts.getBitWidth() &&(static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1862, __extension__ __PRETTY_FUNCTION__))
      "DemandedElt width should equal the fixed vector number of elements")(static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1862, __extension__ __PRETTY_FUNCTION__));
} else {
  assert(DemandedElts == APInt(1, 1) &&(static_cast <bool> (DemandedElts == APInt(1, 1) &&
 "DemandedElt width should be 1 for scalars") ? void (0) : __assert_fail
 ("DemandedElts == APInt(1, 1) && \"DemandedElt width should be 1 for scalars\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1865, __extension__ __PRETTY_FUNCTION__))
         "DemandedElt width should be 1 for scalars")(static_cast <bool> (DemandedElts == APInt(1, 1) &&
 "DemandedElt width should be 1 for scalars") ? void (0) : __assert_fail
 ("DemandedElts == APInt(1, 1) && \"DemandedElt width should be 1 for scalars\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1865, __extension__ __PRETTY_FUNCTION__));
}

Type *ScalarTy = Ty->getScalarType();
if (ScalarTy->isPointerTy()) {
  assert(BitWidth == Q.DL.getPointerTypeSizeInBits(ScalarTy) &&(static_cast <bool> (BitWidth == Q.DL.getPointerTypeSizeInBits
(ScalarTy) && "V and Known should have same BitWidth"
) ? void (0) : __assert_fail ("BitWidth == Q.DL.getPointerTypeSizeInBits(ScalarTy) && \"V and Known should have same BitWidth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1871, __extension__ __PRETTY_FUNCTION__))
         "V and Known should have same BitWidth")(static_cast <bool> (BitWidth == Q.DL.getPointerTypeSizeInBits
(ScalarTy) && "V and Known should have same BitWidth"
) ? void (0) : __assert_fail ("BitWidth == Q.DL.getPointerTypeSizeInBits(ScalarTy) && \"V and Known should have same BitWidth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1871, __extension__ __PRETTY_FUNCTION__));
} else {
  assert(BitWidth == Q.DL.getTypeSizeInBits(ScalarTy) &&(static_cast <bool> (BitWidth == Q.DL.getTypeSizeInBits
(ScalarTy) && "V and Known should have same BitWidth"
) ? void (0) : __assert_fail ("BitWidth == Q.DL.getTypeSizeInBits(ScalarTy) && \"V and Known should have same BitWidth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1874, __extension__ __PRETTY_FUNCTION__))
         "V and Known should have same BitWidth")(static_cast <bool> (BitWidth == Q.DL.getTypeSizeInBits
(ScalarTy) && "V and Known should have same BitWidth"
) ? void (0) : __assert_fail ("BitWidth == Q.DL.getTypeSizeInBits(ScalarTy) && \"V and Known should have same BitWidth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1874, __extension__ __PRETTY_FUNCTION__));
}
1876#endif

const APInt *C;
if (match(V, m_APInt(C))) {
  // We know all of the bits for a scalar constant or a splat vector constant!
  Known = KnownBits::makeConstant(*C);
  return;
}
// Null and aggregate-zero are all-zeros.
if (isa<ConstantPointerNull>(V) || isa<ConstantAggregateZero>(V)) {
  Known.setAllZero();
  return;
}
// Handle a constant vector by taking the intersection of the known bits of
// each element.
if (const ConstantDataVector *CDV = dyn_cast<ConstantDataVector>(V)) {
  // We know that CDV must be a vector of integers. Take the intersection of
  // each element.
  Known.Zero.setAllBits(); Known.One.setAllBits();
  for (unsigned i = 0, e = CDV->getNumElements(); i != e; ++i) {
    if (!DemandedElts[i])
      continue;
    APInt Elt = CDV->getElementAsAPInt(i);
    Known.Zero &= ~Elt;
    Known.One &= Elt;
  }
  return;
}

if (const auto *CV = dyn_cast<ConstantVector>(V)) {
  // We know that CV must be a vector of integers. Take the intersection of
  // each element.
  Known.Zero.setAllBits(); Known.One.setAllBits();
  for (unsigned i = 0, e = CV->getNumOperands(); i != e; ++i) {
    if (!DemandedElts[i])
      continue;
    Constant *Element = CV->getAggregateElement(i);
    auto *ElementCI = dyn_cast_or_null<ConstantInt>(Element);
    if (!ElementCI) {
      Known.resetAll();
      return;
    }
    const APInt &Elt = ElementCI->getValue();
    Known.Zero &= ~Elt;
    Known.One &= Elt;
  }
  return;
}

// Start out not knowing anything.
Known.resetAll();

// We can't imply anything about undefs.
if (isa<UndefValue>(V))
  return;

// There's no point in looking through other users of ConstantData for
// assumptions.  Confirm that we've handled them all.
assert(!isa<ConstantData>(V) && "Unhandled constant data!")(static_cast <bool> (!isa<ConstantData>(V) &&
 "Unhandled constant data!") ? void (0) : __assert_fail ("!isa<ConstantData>(V) && \"Unhandled constant data!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1934, __extension__ __PRETTY_FUNCTION__));

// All recursive calls that increase depth must come after this.
if (Depth == MaxAnalysisRecursionDepth)
  return;

// A weak GlobalAlias is totally unknown. A non-weak GlobalAlias has
// the bits of its aliasee.
if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
  if (!GA->isInterposable())
    computeKnownBits(GA->getAliasee(), Known, Depth + 1, Q);
  return;
}

if (const Operator *I = dyn_cast<Operator>(V))
  computeKnownBitsFromOperator(I, DemandedElts, Known, Depth, Q);

// Aligned pointers have trailing zeros - refine Known.Zero set
if (isa<PointerType>(V->getType())) {
  Align Alignment = V->getPointerAlignment(Q.DL);
  Known.Zero.setLowBits(Log2(Alignment));
}

// computeKnownBitsFromAssume strictly refines Known.
// Therefore, we run them after computeKnownBitsFromOperator.

// Check whether a nearby assume intrinsic can determine some known bits.
computeKnownBitsFromAssume(V, Known, Depth, Q);

assert((Known.Zero & Known.One) == 0 && "Bits known to be one AND zero?")(static_cast <bool> ((Known.Zero & Known.One) == 0 &&
 "Bits known to be one AND zero?") ? void (0) : __assert_fail
 ("(Known.Zero & Known.One) == 0 && \"Bits known to be one AND zero?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1963, __extension__ __PRETTY_FUNCTION__));
1964}

1966/// Return true if the given value is known to have exactly one
1967/// bit set when defined. For vectors return true if every element is known to
1968/// be a power of two when defined. Supports values with integer or pointer
1969/// types and vectors of integers.
1970bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,
                          const Query &Q) {
assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth")(static_cast <bool> (Depth <= MaxAnalysisRecursionDepth
 && "Limit Search Depth") ? void (0) : __assert_fail (
"Depth <= MaxAnalysisRecursionDepth && \"Limit Search Depth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 1972, __extension__ __PRETTY_FUNCTION__));

// Attempt to match against constants.
if (OrZero && match(V, m_Power2OrZero()))
    return true;
if (match(V, m_Power2()))
    return true;

// 1 << X is clearly a power of two if the one is not shifted off the end.  If
// it is shifted off the end then the result is undefined.
if (match(V, m_Shl(m_One(), m_Value())))
  return true;

// (signmask) >>l X is clearly a power of two if the one is not shifted off
// the bottom.  If it is shifted off the bottom then the result is undefined.
if (match(V, m_LShr(m_SignMask(), m_Value())))
  return true;

// The remaining tests are all recursive, so bail out if we hit the limit.
if (Depth++ == MaxAnalysisRecursionDepth)
  return false;

Value *X = nullptr, *Y = nullptr;
// A shift left or a logical shift right of a power of two is a power of two
// or zero.
if (OrZero && (match(V, m_Shl(m_Value(X), m_Value())) ||
               match(V, m_LShr(m_Value(X), m_Value()))))
  return isKnownToBeAPowerOfTwo(X, /*OrZero*/ true, Depth, Q);

if (const ZExtInst *ZI = dyn_cast<ZExtInst>(V))
  return isKnownToBeAPowerOfTwo(ZI->getOperand(0), OrZero, Depth, Q);

if (const SelectInst *SI = dyn_cast<SelectInst>(V))
  return isKnownToBeAPowerOfTwo(SI->getTrueValue(), OrZero, Depth, Q) &&
         isKnownToBeAPowerOfTwo(SI->getFalseValue(), OrZero, Depth, Q);

// Peek through min/max.
if (match(V, m_MaxOrMin(m_Value(X), m_Value(Y)))) {
  return isKnownToBeAPowerOfTwo(X, OrZero, Depth, Q) &&
         isKnownToBeAPowerOfTwo(Y, OrZero, Depth, Q);
}

if (OrZero && match(V, m_And(m_Value(X), m_Value(Y)))) {
  // A power of two and'd with anything is a power of two or zero.
  if (isKnownToBeAPowerOfTwo(X, /*OrZero*/ true, Depth, Q) ||
      isKnownToBeAPowerOfTwo(Y, /*OrZero*/ true, Depth, Q))
    return true;
  // X & (-X) is always a power of two or zero.
  if (match(X, m_Neg(m_Specific(Y))) || match(Y, m_Neg(m_Specific(X))))
    return true;
  return false;
}

// Adding a power-of-two or zero to the same power-of-two or zero yields
// either the original power-of-two, a larger power-of-two or zero.
if (match(V, m_Add(m_Value(X), m_Value(Y)))) {
  const OverflowingBinaryOperator *VOBO = cast<OverflowingBinaryOperator>(V);
  if (OrZero || Q.IIQ.hasNoUnsignedWrap(VOBO) ||
      Q.IIQ.hasNoSignedWrap(VOBO)) {
    if (match(X, m_And(m_Specific(Y), m_Value())) ||
        match(X, m_And(m_Value(), m_Specific(Y))))
      if (isKnownToBeAPowerOfTwo(Y, OrZero, Depth, Q))
        return true;
    if (match(Y, m_And(m_Specific(X), m_Value())) ||
        match(Y, m_And(m_Value(), m_Specific(X))))
      if (isKnownToBeAPowerOfTwo(X, OrZero, Depth, Q))
        return true;

    unsigned BitWidth = V->getType()->getScalarSizeInBits();
    KnownBits LHSBits(BitWidth);
    computeKnownBits(X, LHSBits, Depth, Q);

    KnownBits RHSBits(BitWidth);
    computeKnownBits(Y, RHSBits, Depth, Q);
    // If i8 V is a power of two or zero:
    //  ZeroBits: 1 1 1 0 1 1 1 1
    // ~ZeroBits: 0 0 0 1 0 0 0 0
    if ((~(LHSBits.Zero & RHSBits.Zero)).isPowerOf2())
      // If OrZero isn't set, we cannot give back a zero result.
      // Make sure either the LHS or RHS has a bit set.
      if (OrZero || RHSBits.One.getBoolValue() || LHSBits.One.getBoolValue())
        return true;
  }
}

// An exact divide or right shift can only shift off zero bits, so the result
// is a power of two only if the first operand is a power of two and not
// copying a sign bit (sdiv int_min, 2).
if (match(V, m_Exact(m_LShr(m_Value(), m_Value()))) ||
    match(V, m_Exact(m_UDiv(m_Value(), m_Value())))) {
  return isKnownToBeAPowerOfTwo(cast<Operator>(V)->getOperand(0), OrZero,
                                Depth, Q);
}

return false;
2067}

2069/// Test whether a GEP's result is known to be non-null.
2070///
2071/// Uses properties inherent in a GEP to try to determine whether it is known
2072/// to be non-null.
2073///
2074/// Currently this routine does not support vector GEPs.
2075static bool isGEPKnownNonNull(const GEPOperator *GEP, unsigned Depth,
                            const Query &Q) {
const Function *F = nullptr;
if (const Instruction *I = dyn_cast<Instruction>(GEP))
  F = I->getFunction();

if (!GEP->isInBounds() ||
    NullPointerIsDefined(F, GEP->getPointerAddressSpace()))
  return false;

// FIXME: Support vector-GEPs.
assert(GEP->getType()->isPointerTy() && "We only support plain pointer GEP")(static_cast <bool> (GEP->getType()->isPointerTy(
) && "We only support plain pointer GEP") ? void (0) :
 __assert_fail ("GEP->getType()->isPointerTy() && \"We only support plain pointer GEP\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2086, __extension__ __PRETTY_FUNCTION__));

// If the base pointer is non-null, we cannot walk to a null address with an
// inbounds GEP in address space zero.
if (isKnownNonZero(GEP->getPointerOperand(), Depth, Q))
  return true;

// Walk the GEP operands and see if any operand introduces a non-zero offset.
// If so, then the GEP cannot produce a null pointer, as doing so would
// inherently violate the inbounds contract within address space zero.
for (gep_type_iterator GTI = gep_type_begin(GEP), GTE = gep_type_end(GEP);
     GTI != GTE; ++GTI) {
  // Struct types are easy -- they must always be indexed by a constant.
  if (StructType *STy = GTI.getStructTypeOrNull()) {
    ConstantInt *OpC = cast<ConstantInt>(GTI.getOperand());
    unsigned ElementIdx = OpC->getZExtValue();
    const StructLayout *SL = Q.DL.getStructLayout(STy);
    uint64_t ElementOffset = SL->getElementOffset(ElementIdx);
    if (ElementOffset > 0)
      return true;
    continue;
  }

  // If we have a zero-sized type, the index doesn't matter. Keep looping.
  if (Q.DL.getTypeAllocSize(GTI.getIndexedType()).getKnownMinSize() == 0)
    continue;

  // Fast path the constant operand case both for efficiency and so we don't
  // increment Depth when just zipping down an all-constant GEP.
  if (ConstantInt *OpC = dyn_cast<ConstantInt>(GTI.getOperand())) {
    if (!OpC->isZero())
      return true;
    continue;
  }

  // We post-increment Depth here because while isKnownNonZero increments it
  // as well, when we pop back up that increment won't persist. We don't want
  // to recurse 10k times just because we have 10k GEP operands. We don't
  // bail completely out because we want to handle constant GEPs regardless
  // of depth.
  if (Depth++ >= MaxAnalysisRecursionDepth)
    continue;

  if (isKnownNonZero(GTI.getOperand(), Depth, Q))
    return true;
}

return false;
2134}

2136static bool isKnownNonNullFromDominatingCondition(const Value *V,
                                                const Instruction *CtxI,
                                                const DominatorTree *DT) {
if (isa<Constant>(V))
  return false;

if (!CtxI || !DT)
  return false;

unsigned NumUsesExplored = 0;
for (auto *U : V->users()) {
  // Avoid massive lists
  if (NumUsesExplored >= DomConditionsMaxUses)
    break;
  NumUsesExplored++;

  // If the value is used as an argument to a call or invoke, then argument
  // attributes may provide an answer about null-ness.
  if (const auto *CB = dyn_cast<CallBase>(U))
    if (auto *CalledFunc = CB->getCalledFunction())
      for (const Argument &Arg : CalledFunc->args())
        if (CB->getArgOperand(Arg.getArgNo()) == V &&
            Arg.hasNonNullAttr(/* AllowUndefOrPoison */ false) &&
            DT->dominates(CB, CtxI))
          return true;

  // If the value is used as a load/store, then the pointer must be non null.
  if (V == getLoadStorePointerOperand(U)) {
    const Instruction *I = cast<Instruction>(U);
    if (!NullPointerIsDefined(I->getFunction(),
                              V->getType()->getPointerAddressSpace()) &&
        DT->dominates(I, CtxI))
      return true;
  }

  // Consider only compare instructions uniquely controlling a branch
  Value *RHS;
  CmpInst::Predicate Pred;
  if (!match(U, m_c_ICmp(Pred, m_Specific(V), m_Value(RHS))))
    continue;

  bool NonNullIfTrue;
  if (cmpExcludesZero(Pred, RHS))
    NonNullIfTrue = true;
  else if (cmpExcludesZero(CmpInst::getInversePredicate(Pred), RHS))
    NonNullIfTrue = false;
  else
    continue;

  SmallVector<const User *, 4> WorkList;
  SmallPtrSet<const User *, 4> Visited;
  for (auto *CmpU : U->users()) {
    assert(WorkList.empty() && "Should be!")(static_cast <bool> (WorkList.empty() && "Should be!"
) ? void (0) : __assert_fail ("WorkList.empty() && \"Should be!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2188, __extension__ __PRETTY_FUNCTION__));
    if (Visited.insert(CmpU).second)
      WorkList.push_back(CmpU);

    while (!WorkList.empty()) {
      auto *Curr = WorkList.pop_back_val();

      // If a user is an AND, add all its users to the work list. We only
      // propagate "pred != null" condition through AND because it is only
      // correct to assume that all conditions of AND are met in true branch.
      // TODO: Support similar logic of OR and EQ predicate?
      if (NonNullIfTrue)
        if (match(Curr, m_LogicalAnd(m_Value(), m_Value()))) {
          for (auto *CurrU : Curr->users())
            if (Visited.insert(CurrU).second)
              WorkList.push_back(CurrU);
          continue;
        }

      if (const BranchInst *BI = dyn_cast<BranchInst>(Curr)) {
        assert(BI->isConditional() && "uses a comparison!")(static_cast <bool> (BI->isConditional() && "uses a comparison!"
) ? void (0) : __assert_fail ("BI->isConditional() && \"uses a comparison!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2208, __extension__ __PRETTY_FUNCTION__));

        BasicBlock *NonNullSuccessor =
            BI->getSuccessor(NonNullIfTrue ? 0 : 1);
        BasicBlockEdge Edge(BI->getParent(), NonNullSuccessor);
        if (Edge.isSingleEdge() && DT->dominates(Edge, CtxI->getParent()))
          return true;
      } else if (NonNullIfTrue && isGuard(Curr) &&
                 DT->dominates(cast<Instruction>(Curr), CtxI)) {
        return true;
      }
    }
  }
}

return false;
2224}

2226/// Does the 'Range' metadata (which must be a valid MD_range operand list)
2227/// ensure that the value it's attached to is never Value?  'RangeType' is
2228/// is the type of the value described by the range.
2229static bool rangeMetadataExcludesValue(const MDNode* Ranges, const APInt& Value) {
const unsigned NumRanges = Ranges->getNumOperands() / 2;
assert(NumRanges >= 1)(static_cast <bool> (NumRanges >= 1) ? void (0) : __assert_fail
 ("NumRanges >= 1", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2231, __extension__ __PRETTY_FUNCTION__));
for (unsigned i = 0; i < NumRanges; ++i) {
  ConstantInt *Lower =
      mdconst::extract<ConstantInt>(Ranges->getOperand(2 * i + 0));
  ConstantInt *Upper =
      mdconst::extract<ConstantInt>(Ranges->getOperand(2 * i + 1));
  ConstantRange Range(Lower->getValue(), Upper->getValue());
  if (Range.contains(Value))
    return false;
}
return true;
2242}

2244/// Try to detect a recurrence that monotonically increases/decreases from a
2245/// non-zero starting value. These are common as induction variables.
2246static bool isNonZeroRecurrence(const PHINode *PN) {
BinaryOperator *BO = nullptr;
Value *Start = nullptr, *Step = nullptr;
const APInt *StartC, *StepC;
if (!matchSimpleRecurrence(PN, BO, Start, Step) ||
    !match(Start, m_APInt(StartC)) || StartC->isNullValue())
  return false;

switch (BO->getOpcode()) {
case Instruction::Add:
  // Starting from non-zero and stepping away from zero can never wrap back
  // to zero.
  return BO->hasNoUnsignedWrap() ||
         (BO->hasNoSignedWrap() && match(Step, m_APInt(StepC)) &&
          StartC->isNegative() == StepC->isNegative());
case Instruction::Mul:
  return (BO->hasNoUnsignedWrap() || BO->hasNoSignedWrap()) &&
         match(Step, m_APInt(StepC)) && !StepC->isNullValue();
case Instruction::Shl:
  return BO->hasNoUnsignedWrap() || BO->hasNoSignedWrap();
case Instruction::AShr:
case Instruction::LShr:
  return BO->isExact();
default:
  return false;
}
2272}

2274/// Return true if the given value is known to be non-zero when defined. For
2275/// vectors, return true if every demanded element is known to be non-zero when
2276/// defined. For pointers, if the context instruction and dominator tree are
2277/// specified, perform context-sensitive analysis and return true if the
2278/// pointer couldn't possibly be null at the specified instruction.
2279/// Supports values with integer or pointer type and vectors of integers.
2280bool isKnownNonZero(const Value *V, const APInt &DemandedElts, unsigned Depth,
                  const Query &Q) {
// FIXME: We currently have no way to represent the DemandedElts of a scalable
// vector
if (isa<ScalableVectorType>(V->getType()))
  return false;

if (auto *C = dyn_cast<Constant>(V)) {
  if (C->isNullValue())
    return false;
  if (isa<ConstantInt>(C))
    // Must be non-zero due to null test above.
    return true;

  if (auto *CE = dyn_cast<ConstantExpr>(C)) {
    // See the comment for IntToPtr/PtrToInt instructions below.
    if (CE->getOpcode() == Instruction::IntToPtr ||
        CE->getOpcode() == Instruction::PtrToInt)
      if (Q.DL.getTypeSizeInBits(CE->getOperand(0)->getType())
              .getFixedSize() <=
          Q.DL.getTypeSizeInBits(CE->getType()).getFixedSize())
        return isKnownNonZero(CE->getOperand(0), Depth, Q);
  }

  // For constant vectors, check that all elements are undefined or known
  // non-zero to determine that the whole vector is known non-zero.
  if (auto *VecTy = dyn_cast<FixedVectorType>(C->getType())) {
    for (unsigned i = 0, e = VecTy->getNumElements(); i != e; ++i) {
      if (!DemandedElts[i])
        continue;
      Constant *Elt = C->getAggregateElement(i);
      if (!Elt || Elt->isNullValue())
        return false;
      if (!isa<UndefValue>(Elt) && !isa<ConstantInt>(Elt))
        return false;
    }
    return true;
  }

  // A global variable in address space 0 is non null unless extern weak
  // or an absolute symbol reference. Other address spaces may have null as a
  // valid address for a global, so we can't assume anything.
  if (const GlobalValue *GV = dyn_cast<GlobalValue>(V)) {
    if (!GV->isAbsoluteSymbolRef() && !GV->hasExternalWeakLinkage() &&
        GV->getType()->getAddressSpace() == 0)
      return true;
  } else
    return false;
}

if (auto *I = dyn_cast<Instruction>(V)) {
  if (MDNode *Ranges = Q.IIQ.getMetadata(I, LLVMContext::MD_range)) {
    // If the possible ranges don't contain zero, then the value is
    // definitely non-zero.
    if (auto *Ty = dyn_cast<IntegerType>(V->getType())) {
      const APInt ZeroValue(Ty->getBitWidth(), 0);
      if (rangeMetadataExcludesValue(Ranges, ZeroValue))
        return true;
    }
  }
}

if (isKnownNonZeroFromAssume(V, Q))
  return true;

// Some of the tests below are recursive, so bail out if we hit the limit.
if (Depth++ >= MaxAnalysisRecursionDepth)
  return false;

// Check for pointer simplifications.

if (PointerType *PtrTy = dyn_cast<PointerType>(V->getType())) {
  // Alloca never returns null, malloc might.
  if (isa<AllocaInst>(V) && Q.DL.getAllocaAddrSpace() == 0)
    return true;

  // A byval, inalloca may not be null in a non-default addres space. A
  // nonnull argument is assumed never 0.
  if (const Argument *A = dyn_cast<Argument>(V)) {
    if (((A->hasPassPointeeByValueCopyAttr() &&
          !NullPointerIsDefined(A->getParent(), PtrTy->getAddressSpace())) ||
         A->hasNonNullAttr()))
      return true;
  }

  // A Load tagged with nonnull metadata is never null.
  if (const LoadInst *LI = dyn_cast<LoadInst>(V))
    if (Q.IIQ.getMetadata(LI, LLVMContext::MD_nonnull))
      return true;

  if (const auto *Call = dyn_cast<CallBase>(V)) {
    if (Call->isReturnNonNull())
      return true;
    if (const auto *RP = getArgumentAliasingToReturnedPointer(Call, true))
      return isKnownNonZero(RP, Depth, Q);
  }
}

if (isKnownNonNullFromDominatingCondition(V, Q.CxtI, Q.DT))
  return true;

// Check for recursive pointer simplifications.
if (V->getType()->isPointerTy()) {
  // Look through bitcast operations, GEPs, and int2ptr instructions as they
  // do not alter the value, or at least not the nullness property of the
  // value, e.g., int2ptr is allowed to zero/sign extend the value.
  //
  // Note that we have to take special care to avoid looking through
  // truncating casts, e.g., int2ptr/ptr2int with appropriate sizes, as well
  // as casts that can alter the value, e.g., AddrSpaceCasts.
  if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V))
    return isGEPKnownNonNull(GEP, Depth, Q);

  if (auto *BCO = dyn_cast<BitCastOperator>(V))
    return isKnownNonZero(BCO->getOperand(0), Depth, Q);

  if (auto *I2P = dyn_cast<IntToPtrInst>(V))
    if (Q.DL.getTypeSizeInBits(I2P->getSrcTy()).getFixedSize() <=
        Q.DL.getTypeSizeInBits(I2P->getDestTy()).getFixedSize())
      return isKnownNonZero(I2P->getOperand(0), Depth, Q);
}

// Similar to int2ptr above, we can look through ptr2int here if the cast
// is a no-op or an extend and not a truncate.
if (auto *P2I = dyn_cast<PtrToIntInst>(V))
  if (Q.DL.getTypeSizeInBits(P2I->getSrcTy()).getFixedSize() <=
      Q.DL.getTypeSizeInBits(P2I->getDestTy()).getFixedSize())
    return isKnownNonZero(P2I->getOperand(0), Depth, Q);

unsigned BitWidth = getBitWidth(V->getType()->getScalarType(), Q.DL);

// X | Y != 0 if X != 0 or Y != 0.
Value *X = nullptr, *Y = nullptr;
if (match(V, m_Or(m_Value(X), m_Value(Y))))
  return isKnownNonZero(X, DemandedElts, Depth, Q) ||
         isKnownNonZero(Y, DemandedElts, Depth, Q);

// ext X != 0 if X != 0.
if (isa<SExtInst>(V) || isa<ZExtInst>(V))
  return isKnownNonZero(cast<Instruction>(V)->getOperand(0), Depth, Q);

// shl X, Y != 0 if X is odd.  Note that the value of the shift is undefined
// if the lowest bit is shifted off the end.
if (match(V, m_Shl(m_Value(X), m_Value(Y)))) {
  // shl nuw can't remove any non-zero bits.
  const OverflowingBinaryOperator *BO = cast<OverflowingBinaryOperator>(V);
  if (Q.IIQ.hasNoUnsignedWrap(BO))
    return isKnownNonZero(X, Depth, Q);

  KnownBits Known(BitWidth);
  computeKnownBits(X, DemandedElts, Known, Depth, Q);
  if (Known.One[0])
    return true;
}
// shr X, Y != 0 if X is negative.  Note that the value of the shift is not
// defined if the sign bit is shifted off the end.
else if (match(V, m_Shr(m_Value(X), m_Value(Y)))) {
  // shr exact can only shift out zero bits.
  const PossiblyExactOperator *BO = cast<PossiblyExactOperator>(V);
  if (BO->isExact())
    return isKnownNonZero(X, Depth, Q);

  KnownBits Known = computeKnownBits(X, DemandedElts, Depth, Q);
  if (Known.isNegative())
    return true;

  // If the shifter operand is a constant, and all of the bits shifted
  // out are known to be zero, and X is known non-zero then at least one
  // non-zero bit must remain.
  if (ConstantInt *Shift = dyn_cast<ConstantInt>(Y)) {
    auto ShiftVal = Shift->getLimitedValue(BitWidth - 1);
    // Is there a known one in the portion not shifted out?
    if (Known.countMaxLeadingZeros() < BitWidth - ShiftVal)
      return true;
    // Are all the bits to be shifted out known zero?
    if (Known.countMinTrailingZeros() >= ShiftVal)
      return isKnownNonZero(X, DemandedElts, Depth, Q);
  }
}
// div exact can only produce a zero if the dividend is zero.
else if (match(V, m_Exact(m_IDiv(m_Value(X), m_Value())))) {
  return isKnownNonZero(X, DemandedElts, Depth, Q);
}
// X + Y.
else if (match(V, m_Add(m_Value(X), m_Value(Y)))) {
  KnownBits XKnown = computeKnownBits(X, DemandedElts, Depth, Q);
  KnownBits YKnown = computeKnownBits(Y, DemandedElts, Depth, Q);

  // If X and Y are both non-negative (as signed values) then their sum is not
  // zero unless both X and Y are zero.
  if (XKnown.isNonNegative() && YKnown.isNonNegative())
    if (isKnownNonZero(X, DemandedElts, Depth, Q) ||
        isKnownNonZero(Y, DemandedElts, Depth, Q))
      return true;

  // If X and Y are both negative (as signed values) then their sum is not
  // zero unless both X and Y equal INT_MIN.
  if (XKnown.isNegative() && YKnown.isNegative()) {
    APInt Mask = APInt::getSignedMaxValue(BitWidth);
    // The sign bit of X is set.  If some other bit is set then X is not equal
    // to INT_MIN.
    if (XKnown.One.intersects(Mask))
      return true;
    // The sign bit of Y is set.  If some other bit is set then Y is not equal
    // to INT_MIN.
    if (YKnown.One.intersects(Mask))
      return true;
  }

  // The sum of a non-negative number and a power of two is not zero.
  if (XKnown.isNonNegative() &&
      isKnownToBeAPowerOfTwo(Y, /*OrZero*/ false, Depth, Q))
    return true;
  if (YKnown.isNonNegative() &&
      isKnownToBeAPowerOfTwo(X, /*OrZero*/ false, Depth, Q))
    return true;
}
// X * Y.
else if (match(V, m_Mul(m_Value(X), m_Value(Y)))) {
  const OverflowingBinaryOperator *BO = cast<OverflowingBinaryOperator>(V);
  // If X and Y are non-zero then so is X * Y as long as the multiplication
  // does not overflow.
  if ((Q.IIQ.hasNoSignedWrap(BO) || Q.IIQ.hasNoUnsignedWrap(BO)) &&
      isKnownNonZero(X, DemandedElts, Depth, Q) &&
      isKnownNonZero(Y, DemandedElts, Depth, Q))
    return true;
}
// (C ? X : Y) != 0 if X != 0 and Y != 0.
else if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
  if (isKnownNonZero(SI->getTrueValue(), DemandedElts, Depth, Q) &&
      isKnownNonZero(SI->getFalseValue(), DemandedElts, Depth, Q))
    return true;
}
// PHI
else if (const PHINode *PN = dyn_cast<PHINode>(V)) {
  if (Q.IIQ.UseInstrInfo && isNonZeroRecurrence(PN))
    return true;

  // Check if all incoming values are non-zero using recursion.
  Query RecQ = Q;
  unsigned NewDepth = std::max(Depth, MaxAnalysisRecursionDepth - 1);
  return llvm::all_of(PN->operands(), [&](const Use &U) {
    if (U.get() == PN)
      return true;
    RecQ.CxtI = PN->getIncomingBlock(U)->getTerminator();
    return isKnownNonZero(U.get(), DemandedElts, NewDepth, RecQ);
  });
}
// ExtractElement
else if (const auto *EEI = dyn_cast<ExtractElementInst>(V)) {
  const Value *Vec = EEI->getVectorOperand();
  const Value *Idx = EEI->getIndexOperand();
  auto *CIdx = dyn_cast<ConstantInt>(Idx);
  if (auto *VecTy = dyn_cast<FixedVectorType>(Vec->getType())) {
    unsigned NumElts = VecTy->getNumElements();
    APInt DemandedVecElts = APInt::getAllOnesValue(NumElts);
    if (CIdx && CIdx->getValue().ult(NumElts))
      DemandedVecElts = APInt::getOneBitSet(NumElts, CIdx->getZExtValue());
    return isKnownNonZero(Vec, DemandedVecElts, Depth, Q);
  }
}
// Freeze
else if (const FreezeInst *FI = dyn_cast<FreezeInst>(V)) {
  auto *Op = FI->getOperand(0);
  if (isKnownNonZero(Op, Depth, Q) &&
      isGuaranteedNotToBePoison(Op, Q.AC, Q.CxtI, Q.DT, Depth))
    return true;
}

KnownBits Known(BitWidth);
computeKnownBits(V, DemandedElts, Known, Depth, Q);
return Known.One != 0;
2552}

2554bool isKnownNonZero(const Value* V, unsigned Depth, const Query& Q) {
// FIXME: We currently have no way to represent the DemandedElts of a scalable
// vector
if (isa<ScalableVectorType>(V->getType()))
  return false;

auto *FVTy = dyn_cast<FixedVectorType>(V->getType());
APInt DemandedElts =
    FVTy ? APInt::getAllOnesValue(FVTy->getNumElements()) : APInt(1, 1);
return isKnownNonZero(V, DemandedElts, Depth, Q);
2564}

2566/// If the pair of operators are the same invertible function, return the
2567/// the operands of the function corresponding to each input. Otherwise,
2568/// return None.  An invertible function is one that is 1-to-1 and maps
2569/// every input value to exactly one output value.  This is equivalent to
2570/// saying that Op1 and Op2 are equal exactly when the specified pair of
2571/// operands are equal, (except that Op1 and Op2 may be poison more often.)
2572static Optional<std::pair<Value*, Value*>>
2573getInvertibleOperands(const Operator *Op1,
                    const Operator *Op2) {
if (Op1->getOpcode() != Op2->getOpcode())
  return None;

auto getOperands = [&](unsigned OpNum) -> auto {
  return std::make_pair(Op1->getOperand(OpNum), Op2->getOperand(OpNum));
};

switch (Op1->getOpcode()) {
default:
  break;
case Instruction::Add:
case Instruction::Sub:
  if (Op1->getOperand(0) == Op2->getOperand(0))
    return getOperands(1);
  if (Op1->getOperand(1) == Op2->getOperand(1))
    return getOperands(0);
  break;
case Instruction::Mul: {
  // invertible if A * B == (A * B) mod 2^N where A, and B are integers
  // and N is the bitwdith.  The nsw case is non-obvious, but proven by
  // alive2: https://alive2.llvm.org/ce/z/Z6D5qK
  auto *OBO1 = cast<OverflowingBinaryOperator>(Op1);
  auto *OBO2 = cast<OverflowingBinaryOperator>(Op2);
  if ((!OBO1->hasNoUnsignedWrap() || !OBO2->hasNoUnsignedWrap()) &&
      (!OBO1->hasNoSignedWrap() || !OBO2->hasNoSignedWrap()))
    break;

  // Assume operand order has been canonicalized
  if (Op1->getOperand(1) == Op2->getOperand(1) &&
      isa<ConstantInt>(Op1->getOperand(1)) &&
      !cast<ConstantInt>(Op1->getOperand(1))->isZero())
    return getOperands(0);
  break;
}
case Instruction::Shl: {
  // Same as multiplies, with the difference that we don't need to check
  // for a non-zero multiply. Shifts always multiply by non-zero.
  auto *OBO1 = cast<OverflowingBinaryOperator>(Op1);
  auto *OBO2 = cast<OverflowingBinaryOperator>(Op2);
  if ((!OBO1->hasNoUnsignedWrap() || !OBO2->hasNoUnsignedWrap()) &&
      (!OBO1->hasNoSignedWrap() || !OBO2->hasNoSignedWrap()))
    break;

  if (Op1->getOperand(1) == Op2->getOperand(1))
    return getOperands(0);
  break;
}
case Instruction::AShr:
case Instruction::LShr: {
  auto *PEO1 = cast<PossiblyExactOperator>(Op1);
  auto *PEO2 = cast<PossiblyExactOperator>(Op2);
  if (!PEO1->isExact() || !PEO2->isExact())
    break;

  if (Op1->getOperand(1) == Op2->getOperand(1))
    return getOperands(0);
  break;
}
case Instruction::SExt:
case Instruction::ZExt:
  if (Op1->getOperand(0)->getType() == Op2->getOperand(0)->getType())
    return getOperands(0);
  break;
case Instruction::PHI: {
  const PHINode *PN1 = cast<PHINode>(Op1);
  const PHINode *PN2 = cast<PHINode>(Op2);

  // If PN1 and PN2 are both recurrences, can we prove the entire recurrences
  // are a single invertible function of the start values? Note that repeated
  // application of an invertible function is also invertible
  BinaryOperator *BO1 = nullptr;
  Value *Start1 = nullptr, *Step1 = nullptr;
  BinaryOperator *BO2 = nullptr;
  Value *Start2 = nullptr, *Step2 = nullptr;
  if (PN1->getParent() != PN2->getParent() ||
      !matchSimpleRecurrence(PN1, BO1, Start1, Step1) ||
      !matchSimpleRecurrence(PN2, BO2, Start2, Step2))
    break;

  auto Values = getInvertibleOperands(cast<Operator>(BO1),
                                      cast<Operator>(BO2));
  if (!Values)
     break;

  // We have to be careful of mutually defined recurrences here.  Ex:
  // * X_i = X_(i-1) OP Y_(i-1), and Y_i = X_(i-1) OP V
  // * X_i = Y_i = X_(i-1) OP Y_(i-1)
  // The invertibility of these is complicated, and not worth reasoning
  // about (yet?).
  if (Values->first != PN1 || Values->second != PN2)
    break;

  return std::make_pair(Start1, Start2);
}
}
return None;
2671}

2673/// Return true if V2 == V1 + X, where X is known non-zero.
2674static bool isAddOfNonZero(const Value *V1, const Value *V2, unsigned Depth,
                         const Query &Q) {
const BinaryOperator *BO = dyn_cast<BinaryOperator>(V1);
if (!BO || BO->getOpcode() != Instruction::Add)
  return false;
Value *Op = nullptr;
if (V2 == BO->getOperand(0))
  Op = BO->getOperand(1);
else if (V2 == BO->getOperand(1))
  Op = BO->getOperand(0);
else
  return false;
return isKnownNonZero(Op, Depth + 1, Q);
2687}

2689/// Return true if V2 == V1 * C, where V1 is known non-zero, C is not 0/1 and
2690/// the multiplication is nuw or nsw.
2691static bool isNonEqualMul(const Value *V1, const Value *V2, unsigned Depth,
                        const Query &Q) {
if (auto *OBO = dyn_cast<OverflowingBinaryOperator>(V2)) {
  const APInt *C;
  return match(OBO, m_Mul(m_Specific(V1), m_APInt(C))) &&
         (OBO->hasNoUnsignedWrap() || OBO->hasNoSignedWrap()) &&
         !C->isNullValue() && !C->isOneValue() &&
         isKnownNonZero(V1, Depth + 1, Q);
}
return false;
2701}

2703/// Return true if V2 == V1 << C, where V1 is known non-zero, C is not 0 and
2704/// the shift is nuw or nsw.
2705static bool isNonEqualShl(const Value *V1, const Value *V2, unsigned Depth,
                        const Query &Q) {
if (auto *OBO = dyn_cast<OverflowingBinaryOperator>(V2)) {
  const APInt *C;
  return match(OBO, m_Shl(m_Specific(V1), m_APInt(C))) &&
         (OBO->hasNoUnsignedWrap() || OBO->hasNoSignedWrap()) &&
         !C->isNullValue() && isKnownNonZero(V1, Depth + 1, Q);
}
return false;
2714}

2716static bool isNonEqualPHIs(const PHINode *PN1, const PHINode *PN2,
                         unsigned Depth, const Query &Q) {
// Check two PHIs are in same block.
if (PN1->getParent() != PN2->getParent())
  return false;

SmallPtrSet<const BasicBlock *, 8> VisitedBBs;
bool UsedFullRecursion = false;
for (const BasicBlock *IncomBB : PN1->blocks()) {
  if (!VisitedBBs.insert(IncomBB).second)
    continue; // Don't reprocess blocks that we have dealt with already.
  const Value *IV1 = PN1->getIncomingValueForBlock(IncomBB);
  const Value *IV2 = PN2->getIncomingValueForBlock(IncomBB);
  const APInt *C1, *C2;
  if (match(IV1, m_APInt(C1)) && match(IV2, m_APInt(C2)) && *C1 != *C2)
    continue;

  // Only one pair of phi operands is allowed for full recursion.
  if (UsedFullRecursion)
    return false;

  Query RecQ = Q;
  RecQ.CxtI = IncomBB->getTerminator();
  if (!isKnownNonEqual(IV1, IV2, Depth + 1, RecQ))
    return false;
  UsedFullRecursion = true;
}
return true;
2744}

2746/// Return true if it is known that V1 != V2.
2747static bool isKnownNonEqual(const Value *V1, const Value *V2, unsigned Depth,
                          const Query &Q) {
if (V1 == V2)
  return false;
if (V1->getType() != V2->getType())
  // We can't look through casts yet.
  return false;

if (Depth >= MaxAnalysisRecursionDepth)
  return false;

// See if we can recurse through (exactly one of) our operands.  This
// requires our operation be 1-to-1 and map every input value to exactly
// one output value.  Such an operation is invertible.
auto *O1 = dyn_cast<Operator>(V1);
auto *O2 = dyn_cast<Operator>(V2);
if (O1 && O2 && O1->getOpcode() == O2->getOpcode()) {
  if (auto Values = getInvertibleOperands(O1, O2))
    return isKnownNonEqual(Values->first, Values->second, Depth + 1, Q);

  if (const PHINode *PN1 = dyn_cast<PHINode>(V1)) {
    const PHINode *PN2 = cast<PHINode>(V2);
    // FIXME: This is missing a generalization to handle the case where one is
    // a PHI and another one isn't.
    if (isNonEqualPHIs(PN1, PN2, Depth, Q))
      return true;
  };
}

if (isAddOfNonZero(V1, V2, Depth, Q) || isAddOfNonZero(V2, V1, Depth, Q))
  return true;

if (isNonEqualMul(V1, V2, Depth, Q) || isNonEqualMul(V2, V1, Depth, Q))
  return true;

if (isNonEqualShl(V1, V2, Depth, Q) || isNonEqualShl(V2, V1, Depth, Q))
  return true;

if (V1->getType()->isIntOrIntVectorTy()) {
  // Are any known bits in V1 contradictory to known bits in V2? If V1
  // has a known zero where V2 has a known one, they must not be equal.
  KnownBits Known1 = computeKnownBits(V1, Depth, Q);
  KnownBits Known2 = computeKnownBits(V2, Depth, Q);

  if (Known1.Zero.intersects(Known2.One) ||
      Known2.Zero.intersects(Known1.One))
    return true;
}
return false;
2796}

2798/// Return true if 'V & Mask' is known to be zero.  We use this predicate to
2799/// simplify operations downstream. Mask is known to be zero for bits that V
2800/// cannot have.
2801///
2802/// This function is defined on values with integer type, values with pointer
2803/// type, and vectors of integers.  In the case
2804/// where V is a vector, the mask, known zero, and known one values are the
2805/// same width as the vector element, and the bit is set only if it is true
2806/// for all of the elements in the vector.
2807bool MaskedValueIsZero(const Value *V, const APInt &Mask, unsigned Depth,
                     const Query &Q) {
KnownBits Known(Mask.getBitWidth());
computeKnownBits(V, Known, Depth, Q);
return Mask.isSubsetOf(Known.Zero);
2812}

2814// Match a signed min+max clamp pattern like smax(smin(In, CHigh), CLow).
2815// Returns the input and lower/upper bounds.
2816static bool isSignedMinMaxClamp(const Value *Select, const Value *&In,
                              const APInt *&CLow, const APInt *&CHigh) {
assert(isa<Operator>(Select) &&(static_cast <bool> (isa<Operator>(Select) &&
 cast<Operator>(Select)->getOpcode() == Instruction::
Select && "Input should be a Select!") ? void (0) : __assert_fail
 ("isa<Operator>(Select) && cast<Operator>(Select)->getOpcode() == Instruction::Select && \"Input should be a Select!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2820, __extension__ __PRETTY_FUNCTION__))
       cast<Operator>(Select)->getOpcode() == Instruction::Select &&(static_cast <bool> (isa<Operator>(Select) &&
 cast<Operator>(Select)->getOpcode() == Instruction::
Select && "Input should be a Select!") ? void (0) : __assert_fail
 ("isa<Operator>(Select) && cast<Operator>(Select)->getOpcode() == Instruction::Select && \"Input should be a Select!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2820, __extension__ __PRETTY_FUNCTION__))
       "Input should be a Select!")(static_cast <bool> (isa<Operator>(Select) &&
 cast<Operator>(Select)->getOpcode() == Instruction::
Select && "Input should be a Select!") ? void (0) : __assert_fail
 ("isa<Operator>(Select) && cast<Operator>(Select)->getOpcode() == Instruction::Select && \"Input should be a Select!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2820, __extension__ __PRETTY_FUNCTION__));

const Value *LHS = nullptr, *RHS = nullptr;
SelectPatternFlavor SPF = matchSelectPattern(Select, LHS, RHS).Flavor;
if (SPF != SPF_SMAX && SPF != SPF_SMIN)
  return false;

if (!match(RHS, m_APInt(CLow)))
  return false;

const Value *LHS2 = nullptr, *RHS2 = nullptr;
SelectPatternFlavor SPF2 = matchSelectPattern(LHS, LHS2, RHS2).Flavor;
if (getInverseMinMaxFlavor(SPF) != SPF2)
  return false;

if (!match(RHS2, m_APInt(CHigh)))
  return false;

if (SPF == SPF_SMIN)
  std::swap(CLow, CHigh);

In = LHS2;
return CLow->sle(*CHigh);
2843}

2845/// For vector constants, loop over the elements and find the constant with the
2846/// minimum number of sign bits. Return 0 if the value is not a vector constant
2847/// or if any element was not analyzed; otherwise, return the count for the
2848/// element with the minimum number of sign bits.
2849static unsigned computeNumSignBitsVectorConstant(const Value *V,
                                               const APInt &DemandedElts,
                                               unsigned TyBits) {
const auto *CV = dyn_cast<Constant>(V);
if (!CV || !isa<FixedVectorType>(CV->getType()))
  return 0;

unsigned MinSignBits = TyBits;
unsigned NumElts = cast<FixedVectorType>(CV->getType())->getNumElements();
for (unsigned i = 0; i != NumElts; ++i) {
  if (!DemandedElts[i])
    continue;
  // If we find a non-ConstantInt, bail out.
  auto *Elt = dyn_cast_or_null<ConstantInt>(CV->getAggregateElement(i));
  if (!Elt)
    return 0;

  MinSignBits = std::min(MinSignBits, Elt->getValue().getNumSignBits());
}

return MinSignBits;
2870}

2872static unsigned ComputeNumSignBitsImpl(const Value *V,
                                     const APInt &DemandedElts,
                                     unsigned Depth, const Query &Q);

2876static unsigned ComputeNumSignBits(const Value *V, const APInt &DemandedElts,
                                 unsigned Depth, const Query &Q) {
unsigned Result = ComputeNumSignBitsImpl(V, DemandedElts, Depth, Q);
assert(Result > 0 && "At least one sign bit needs to be present!")(static_cast <bool> (Result > 0 && "At least one sign bit needs to be present!"
) ? void (0) : __assert_fail ("Result > 0 && \"At least one sign bit needs to be present!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2879, __extension__ __PRETTY_FUNCTION__));
return Result;
2881}

2883/// Return the number of times the sign bit of the register is replicated into
2884/// the other bits. We know that at least 1 bit is always equal to the sign bit
2885/// (itself), but other cases can give us information. For example, immediately
2886/// after an "ashr X, 2", we know that the top 3 bits are all equal to each
2887/// other, so we return 3. For vectors, return the number of sign bits for the
2888/// vector element with the minimum number of known sign bits of the demanded
2889/// elements in the vector specified by DemandedElts.
2890static unsigned ComputeNumSignBitsImpl(const Value *V,
                                     const APInt &DemandedElts,
                                     unsigned Depth, const Query &Q) {
Type *Ty = V->getType();

// FIXME: We currently have no way to represent the DemandedElts of a scalable
// vector
if (isa<ScalableVectorType>(Ty))
  return 1;

2900#ifndef NDEBUG
assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth")(static_cast <bool> (Depth <= MaxAnalysisRecursionDepth
 && "Limit Search Depth") ? void (0) : __assert_fail (
"Depth <= MaxAnalysisRecursionDepth && \"Limit Search Depth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2901, __extension__ __PRETTY_FUNCTION__));

if (auto *FVTy = dyn_cast<FixedVectorType>(Ty)) {
  assert((static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2906, __extension__ __PRETTY_FUNCTION__))
      FVTy->getNumElements() == DemandedElts.getBitWidth() &&(static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2906, __extension__ __PRETTY_FUNCTION__))
      "DemandedElt width should equal the fixed vector number of elements")(static_cast <bool> (FVTy->getNumElements() == DemandedElts
.getBitWidth() && "DemandedElt width should equal the fixed vector number of elements"
) ? void (0) : __assert_fail ("FVTy->getNumElements() == DemandedElts.getBitWidth() && \"DemandedElt width should equal the fixed vector number of elements\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2906, __extension__ __PRETTY_FUNCTION__));
} else {
  assert(DemandedElts == APInt(1, 1) &&(static_cast <bool> (DemandedElts == APInt(1, 1) &&
 "DemandedElt width should be 1 for scalars") ? void (0) : __assert_fail
 ("DemandedElts == APInt(1, 1) && \"DemandedElt width should be 1 for scalars\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2909, __extension__ __PRETTY_FUNCTION__))
         "DemandedElt width should be 1 for scalars")(static_cast <bool> (DemandedElts == APInt(1, 1) &&
 "DemandedElt width should be 1 for scalars") ? void (0) : __assert_fail
 ("DemandedElts == APInt(1, 1) && \"DemandedElt width should be 1 for scalars\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 2909, __extension__ __PRETTY_FUNCTION__));
}
2911#endif

// We return the minimum number of sign bits that are guaranteed to be present
// in V, so for undef we have to conservatively return 1.  We don't have the
// same behavior for poison though -- that's a FIXME today.

Type *ScalarTy = Ty->getScalarType();
unsigned TyBits = ScalarTy->isPointerTy() ?
  Q.DL.getPointerTypeSizeInBits(ScalarTy) :
  Q.DL.getTypeSizeInBits(ScalarTy);

unsigned Tmp, Tmp2;
unsigned FirstAnswer = 1;

// Note that ConstantInt is handled by the general computeKnownBits case
// below.

if (Depth == MaxAnalysisRecursionDepth)
  return 1;

if (auto *U = dyn_cast<Operator>(V)) {
  switch (Operator::getOpcode(V)) {
  default: break;
  case Instruction::SExt:
    Tmp = TyBits - U->getOperand(0)->getType()->getScalarSizeInBits();
    return ComputeNumSignBits(U->getOperand(0), Depth + 1, Q) + Tmp;

  case Instruction::SDiv: {
    const APInt *Denominator;
    // sdiv X, C -> adds log(C) sign bits.
    if (match(U->getOperand(1), m_APInt(Denominator))) {

      // Ignore non-positive denominator.
      if (!Denominator->isStrictlyPositive())
        break;

      // Calculate the incoming numerator bits.
      unsigned NumBits = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);

      // Add floor(log(C)) bits to the numerator bits.
      return std::min(TyBits, NumBits + Denominator->logBase2());
    }
    break;
  }

  case Instruction::SRem: {
    Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);

    const APInt *Denominator;
    // srem X, C -> we know that the result is within [-C+1,C) when C is a
    // positive constant.  This let us put a lower bound on the number of sign
    // bits.
    if (match(U->getOperand(1), m_APInt(Denominator))) {

      // Ignore non-positive denominator.
      if (Denominator->isStrictlyPositive()) {
        // Calculate the leading sign bit constraints by examining the
        // denominator.  Given that the denominator is positive, there are two
        // cases:
        //
        //  1. The numerator is positive. The result range is [0,C) and
        //     [0,C) u< (1 << ceilLogBase2(C)).
        //
        //  2. The numerator is negative. Then the result range is (-C,0] and
        //     integers in (-C,0] are either 0 or >u (-1 << ceilLogBase2(C)).
        //
        // Thus a lower bound on the number of sign bits is `TyBits -
        // ceilLogBase2(C)`.

        unsigned ResBits = TyBits - Denominator->ceilLogBase2();
        Tmp = std::max(Tmp, ResBits);
      }
    }
    return Tmp;
  }

  case Instruction::AShr: {
    Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
    // ashr X, C   -> adds C sign bits.  Vectors too.
    const APInt *ShAmt;
    if (match(U->getOperand(1), m_APInt(ShAmt))) {
      if (ShAmt->uge(TyBits))
        break; // Bad shift.
      unsigned ShAmtLimited = ShAmt->getZExtValue();
      Tmp += ShAmtLimited;
      if (Tmp > TyBits) Tmp = TyBits;
    }
    return Tmp;
  }
  case Instruction::Shl: {
    const APInt *ShAmt;
    if (match(U->getOperand(1), m_APInt(ShAmt))) {
      // shl destroys sign bits.
      Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
      if (ShAmt->uge(TyBits) ||   // Bad shift.
          ShAmt->uge(Tmp)) break; // Shifted all sign bits out.
      Tmp2 = ShAmt->getZExtValue();
      return Tmp - Tmp2;
    }
    break;
  }
  case Instruction::And:
  case Instruction::Or:
  case Instruction::Xor: // NOT is handled here.
    // Logical binary ops preserve the number of sign bits at the worst.
    Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
    if (Tmp != 1) {
      Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
      FirstAnswer = std::min(Tmp, Tmp2);
      // We computed what we know about the sign bits as our first
      // answer. Now proceed to the generic code that uses
      // computeKnownBits, and pick whichever answer is better.
    }
    break;

  case Instruction::Select: {
    // If we have a clamp pattern, we know that the number of sign bits will
    // be the minimum of the clamp min/max range.
    const Value *X;
    const APInt *CLow, *CHigh;
    if (isSignedMinMaxClamp(U, X, CLow, CHigh))
      return std::min(CLow->getNumSignBits(), CHigh->getNumSignBits());

    Tmp = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
    if (Tmp == 1) break;
    Tmp2 = ComputeNumSignBits(U->getOperand(2), Depth + 1, Q);
    return std::min(Tmp, Tmp2);
  }

  case Instruction::Add:
    // Add can have at most one carry bit.  Thus we know that the output
    // is, at worst, one more bit than the inputs.
    Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
    if (Tmp == 1) break;

    // Special case decrementing a value (ADD X, -1):
    if (const auto *CRHS = dyn_cast<Constant>(U->getOperand(1)))
      if (CRHS->isAllOnesValue()) {
        KnownBits Known(TyBits);
        computeKnownBits(U->getOperand(0), Known, Depth + 1, Q);

        // If the input is known to be 0 or 1, the output is 0/-1, which is
        // all sign bits set.
        if ((Known.Zero | 1).isAllOnesValue())
          return TyBits;

        // If we are subtracting one from a positive number, there is no carry
        // out of the result.
        if (Known.isNonNegative())
          return Tmp;
      }

    Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
    if (Tmp2 == 1) break;
    return std::min(Tmp, Tmp2) - 1;

  case Instruction::Sub:
    Tmp2 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
    if (Tmp2 == 1) break;

    // Handle NEG.
    if (const auto *CLHS = dyn_cast<Constant>(U->getOperand(0)))
      if (CLHS->isNullValue()) {
        KnownBits Known(TyBits);
        computeKnownBits(U->getOperand(1), Known, Depth + 1, Q);
        // If the input is known to be 0 or 1, the output is 0/-1, which is
        // all sign bits set.
        if ((Known.Zero | 1).isAllOnesValue())
          return TyBits;

        // If the input is known to be positive (the sign bit is known clear),
        // the output of the NEG has the same number of sign bits as the
        // input.
        if (Known.isNonNegative())
          return Tmp2;

        // Otherwise, we treat this like a SUB.
      }

    // Sub can have at most one carry bit.  Thus we know that the output
    // is, at worst, one more bit than the inputs.
    Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
    if (Tmp == 1) break;
    return std::min(Tmp, Tmp2) - 1;

  case Instruction::Mul: {
    // The output of the Mul can be at most twice the valid bits in the
    // inputs.
    unsigned SignBitsOp0 = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
    if (SignBitsOp0 == 1) break;
    unsigned SignBitsOp1 = ComputeNumSignBits(U->getOperand(1), Depth + 1, Q);
    if (SignBitsOp1 == 1) break;
    unsigned OutValidBits =
        (TyBits - SignBitsOp0 + 1) + (TyBits - SignBitsOp1 + 1);
    return OutValidBits > TyBits ? 1 : TyBits - OutValidBits + 1;
  }

  case Instruction::PHI: {
    const PHINode *PN = cast<PHINode>(U);
    unsigned NumIncomingValues = PN->getNumIncomingValues();
    // Don't analyze large in-degree PHIs.
    if (NumIncomingValues > 4) break;
    // Unreachable blocks may have zero-operand PHI nodes.
    if (NumIncomingValues == 0) break;

    // Take the minimum of all incoming values.  This can't infinitely loop
    // because of our depth threshold.
    Query RecQ = Q;
    Tmp = TyBits;
    for (unsigned i = 0, e = NumIncomingValues; i != e; ++i) {
      if (Tmp == 1) return Tmp;
      RecQ.CxtI = PN->getIncomingBlock(i)->getTerminator();
      Tmp = std::min(
          Tmp, ComputeNumSignBits(PN->getIncomingValue(i), Depth + 1, RecQ));
    }
    return Tmp;
  }

  case Instruction::Trunc:
    // FIXME: it's tricky to do anything useful for this, but it is an
    // important case for targets like X86.
    break;

  case Instruction::ExtractElement:
    // Look through extract element. At the moment we keep this simple and
    // skip tracking the specific element. But at least we might find
    // information valid for all elements of the vector (for example if vector
    // is sign extended, shifted, etc).
    return ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);

  case Instruction::ShuffleVector: {
    // Collect the minimum number of sign bits that are shared by every vector
    // element referenced by the shuffle.
    auto *Shuf = dyn_cast<ShuffleVectorInst>(U);
    if (!Shuf) {
      // FIXME: Add support for shufflevector constant expressions.
      return 1;
    }
    APInt DemandedLHS, DemandedRHS;
    // For undef elements, we don't know anything about the common state of
    // the shuffle result.
    if (!getShuffleDemandedElts(Shuf, DemandedElts, DemandedLHS, DemandedRHS))
      return 1;
    Tmp = std::numeric_limits<unsigned>::max();
    if (!!DemandedLHS) {
      const Value *LHS = Shuf->getOperand(0);
      Tmp = ComputeNumSignBits(LHS, DemandedLHS, Depth + 1, Q);
    }
    // If we don't know anything, early out and try computeKnownBits
    // fall-back.
    if (Tmp == 1)
      break;
    if (!!DemandedRHS) {
      const Value *RHS = Shuf->getOperand(1);
      Tmp2 = ComputeNumSignBits(RHS, DemandedRHS, Depth + 1, Q);
      Tmp = std::min(Tmp, Tmp2);
    }
    // If we don't know anything, early out and try computeKnownBits
    // fall-back.
    if (Tmp == 1)
      break;
    assert(Tmp <= TyBits && "Failed to determine minimum sign bits")(static_cast <bool> (Tmp <= TyBits && "Failed to determine minimum sign bits"
) ? void (0) : __assert_fail ("Tmp <= TyBits && \"Failed to determine minimum sign bits\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3172, __extension__ __PRETTY_FUNCTION__));
    return Tmp;
  }
  case Instruction::Call: {
    if (const auto *II = dyn_cast<IntrinsicInst>(U)) {
      switch (II->getIntrinsicID()) {
      default: break;
      case Intrinsic::abs:
        Tmp = ComputeNumSignBits(U->getOperand(0), Depth + 1, Q);
        if (Tmp == 1) break;

        // Absolute value reduces number of sign bits by at most 1.
        return Tmp - 1;
      }
    }
  }
  }
}

// Finally, if we can prove that the top bits of the result are 0's or 1's,
// use this information.

// If we can examine all elements of a vector constant successfully, we're
// done (we can't do any better than that). If not, keep trying.
if (unsigned VecSignBits =
        computeNumSignBitsVectorConstant(V, DemandedElts, TyBits))
  return VecSignBits;

KnownBits Known(TyBits);
computeKnownBits(V, DemandedElts, Known, Depth, Q);

// If we know that the sign bit is either zero or one, determine the number of
// identical bits in the top of the input value.
return std::max(FirstAnswer, Known.countMinSignBits());
3206}

3208/// This function computes the integer multiple of Base that equals V.
3209/// If successful, it returns true and returns the multiple in
3210/// Multiple. If unsuccessful, it returns false. It looks
3211/// through SExt instructions only if LookThroughSExt is true.
3212bool llvm::ComputeMultiple(Value *V, unsigned Base, Value *&Multiple,
                         bool LookThroughSExt, unsigned Depth) {
assert(V && "No Value?")(static_cast <bool> (V && "No Value?") ? void (
0) : __assert_fail ("V && \"No Value?\"", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3214, __extension__ __PRETTY_FUNCTION__));
assert(Depth <= MaxAnalysisRecursionDepth && "Limit Search Depth")(static_cast <bool> (Depth <= MaxAnalysisRecursionDepth
 && "Limit Search Depth") ? void (0) : __assert_fail (
"Depth <= MaxAnalysisRecursionDepth && \"Limit Search Depth\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3215, __extension__ __PRETTY_FUNCTION__));
assert(V->getType()->isIntegerTy() && "Not integer or pointer type!")(static_cast <bool> (V->getType()->isIntegerTy() &&
 "Not integer or pointer type!") ? void (0) : __assert_fail (
"V->getType()->isIntegerTy() && \"Not integer or pointer type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3216, __extension__ __PRETTY_FUNCTION__));

Type *T = V->getType();

ConstantInt *CI = dyn_cast<ConstantInt>(V);

if (Base == 0)
  return false;

if (Base == 1) {
  Multiple = V;
  return true;
}

ConstantExpr *CO = dyn_cast<ConstantExpr>(V);
Constant *BaseVal = ConstantInt::get(T, Base);
if (CO && CO == BaseVal) {
  // Multiple is 1.
  Multiple = ConstantInt::get(T, 1);
  return true;
}

if (CI && CI->getZExtValue() % Base == 0) {
  Multiple = ConstantInt::get(T, CI->getZExtValue() / Base);
  return true;
}

if (Depth == MaxAnalysisRecursionDepth) return false;

Operator *I = dyn_cast<Operator>(V);
if (!I) return false;

switch (I->getOpcode()) {
default: break;
case Instruction::SExt:
  if (!LookThroughSExt) return false;
  // otherwise fall through to ZExt
  LLVM_FALLTHROUGH[[gnu::fallthrough]];
case Instruction::ZExt:
  return ComputeMultiple(I->getOperand(0), Base, Multiple,
                         LookThroughSExt, Depth+1);
case Instruction::Shl:
case Instruction::Mul: {
  Value *Op0 = I->getOperand(0);
  Value *Op1 = I->getOperand(1);

  if (I->getOpcode() == Instruction::Shl) {
    ConstantInt *Op1CI = dyn_cast<ConstantInt>(Op1);
    if (!Op1CI) return false;
    // Turn Op0 << Op1 into Op0 * 2^Op1
    APInt Op1Int = Op1CI->getValue();
    uint64_t BitToSet = Op1Int.getLimitedValue(Op1Int.getBitWidth() - 1);
    APInt API(Op1Int.getBitWidth(), 0);
    API.setBit(BitToSet);
    Op1 = ConstantInt::get(V->getContext(), API);
  }

  Value *Mul0 = nullptr;
  if (ComputeMultiple(Op0, Base, Mul0, LookThroughSExt, Depth+1)) {
    if (Constant *Op1C = dyn_cast<Constant>(Op1))
      if (Constant *MulC = dyn_cast<Constant>(Mul0)) {
        if (Op1C->getType()->getPrimitiveSizeInBits().getFixedSize() <
            MulC->getType()->getPrimitiveSizeInBits().getFixedSize())
          Op1C = ConstantExpr::getZExt(Op1C, MulC->getType());
        if (Op1C->getType()->getPrimitiveSizeInBits().getFixedSize() >
            MulC->getType()->getPrimitiveSizeInBits().getFixedSize())
          MulC = ConstantExpr::getZExt(MulC, Op1C->getType());

        // V == Base * (Mul0 * Op1), so return (Mul0 * Op1)
        Multiple = ConstantExpr::getMul(MulC, Op1C);
        return true;
      }

    if (ConstantInt *Mul0CI = dyn_cast<ConstantInt>(Mul0))
      if (Mul0CI->getValue() == 1) {
        // V == Base * Op1, so return Op1
        Multiple = Op1;
        return true;
      }
  }

  Value *Mul1 = nullptr;
  if (ComputeMultiple(Op1, Base, Mul1, LookThroughSExt, Depth+1)) {
    if (Constant *Op0C = dyn_cast<Constant>(Op0))
      if (Constant *MulC = dyn_cast<Constant>(Mul1)) {
        if (Op0C->getType()->getPrimitiveSizeInBits().getFixedSize() <
            MulC->getType()->getPrimitiveSizeInBits().getFixedSize())
          Op0C = ConstantExpr::getZExt(Op0C, MulC->getType());
        if (Op0C->getType()->getPrimitiveSizeInBits().getFixedSize() >
            MulC->getType()->getPrimitiveSizeInBits().getFixedSize())
          MulC = ConstantExpr::getZExt(MulC, Op0C->getType());

        // V == Base * (Mul1 * Op0), so return (Mul1 * Op0)
        Multiple = ConstantExpr::getMul(MulC, Op0C);
        return true;
      }

    if (ConstantInt *Mul1CI = dyn_cast<ConstantInt>(Mul1))
      if (Mul1CI->getValue() == 1) {
        // V == Base * Op0, so return Op0
        Multiple = Op0;
        return true;
      }
  }
}
}

// We could not determine if V is a multiple of Base.
return false;
3325}

3327Intrinsic::ID llvm::getIntrinsicForCallSite(const CallBase &CB,
                                          const TargetLibraryInfo *TLI) {
const Function *F = CB.getCalledFunction();
if (!F)
  return Intrinsic::not_intrinsic;

if (F->isIntrinsic())
  return F->getIntrinsicID();

// We are going to infer semantics of a library function based on mapping it
// to an LLVM intrinsic. Check that the library function is available from
// this callbase and in this environment.
LibFunc Func;
if (F->hasLocalLinkage() || !TLI || !TLI->getLibFunc(CB, Func) ||
    !CB.onlyReadsMemory())
  return Intrinsic::not_intrinsic;

switch (Func) {
default:
  break;
case LibFunc_sin:
case LibFunc_sinf:
case LibFunc_sinl:
  return Intrinsic::sin;
case LibFunc_cos:
case LibFunc_cosf:
case LibFunc_cosl:
  return Intrinsic::cos;
case LibFunc_exp:
case LibFunc_expf:
case LibFunc_expl:
  return Intrinsic::exp;
case LibFunc_exp2:
case LibFunc_exp2f:
case LibFunc_exp2l:
  return Intrinsic::exp2;
case LibFunc_log:
case LibFunc_logf:
case LibFunc_logl:
  return Intrinsic::log;
case LibFunc_log10:
case LibFunc_log10f:
case LibFunc_log10l:
  return Intrinsic::log10;
case LibFunc_log2:
case LibFunc_log2f:
case LibFunc_log2l:
  return Intrinsic::log2;
case LibFunc_fabs:
case LibFunc_fabsf:
case LibFunc_fabsl:
  return Intrinsic::fabs;
case LibFunc_fmin:
case LibFunc_fminf:
case LibFunc_fminl:
  return Intrinsic::minnum;
case LibFunc_fmax:
case LibFunc_fmaxf:
case LibFunc_fmaxl:
  return Intrinsic::maxnum;
case LibFunc_copysign:
case LibFunc_copysignf:
case LibFunc_copysignl:
  return Intrinsic::copysign;
case LibFunc_floor:
case LibFunc_floorf:
case LibFunc_floorl:
  return Intrinsic::floor;
case LibFunc_ceil:
case LibFunc_ceilf:
case LibFunc_ceill:
  return Intrinsic::ceil;
case LibFunc_trunc:
case LibFunc_truncf:
case LibFunc_truncl:
  return Intrinsic::trunc;
case LibFunc_rint:
case LibFunc_rintf:
case LibFunc_rintl:
  return Intrinsic::rint;
case LibFunc_nearbyint:
case LibFunc_nearbyintf:
case LibFunc_nearbyintl:
  return Intrinsic::nearbyint;
case LibFunc_round:
case LibFunc_roundf:
case LibFunc_roundl:
  return Intrinsic::round;
case LibFunc_roundeven:
case LibFunc_roundevenf:
case LibFunc_roundevenl:
  return Intrinsic::roundeven;
case LibFunc_pow:
case LibFunc_powf:
case LibFunc_powl:
  return Intrinsic::pow;
case LibFunc_sqrt:
case LibFunc_sqrtf:
case LibFunc_sqrtl:
  return Intrinsic::sqrt;
}

return Intrinsic::not_intrinsic;
3430}

3432/// Return true if we can prove that the specified FP value is never equal to
3433/// -0.0.
3434/// NOTE: Do not check 'nsz' here because that fast-math-flag does not guarantee
3435///       that a value is not -0.0. It only guarantees that -0.0 may be treated
3436///       the same as +0.0 in floating-point ops.
3437///
3438/// NOTE: this function will need to be revisited when we support non-default
3439/// rounding modes!
3440bool llvm::CannotBeNegativeZero(const Value *V, const TargetLibraryInfo *TLI,
                              unsigned Depth) {
if (auto *CFP = dyn_cast<ConstantFP>(V))
  return !CFP->getValueAPF().isNegZero();

if (Depth == MaxAnalysisRecursionDepth)
  return false;

auto *Op = dyn_cast<Operator>(V);
if (!Op)
  return false;

// (fadd x, 0.0) is guaranteed to return +0.0, not -0.0.
if (match(Op, m_FAdd(m_Value(), m_PosZeroFP())))
  return true;

// sitofp and uitofp turn into +0.0 for zero.
if (isa<SIToFPInst>(Op) || isa<UIToFPInst>(Op))
  return true;

if (auto *Call = dyn_cast<CallInst>(Op)) {
  Intrinsic::ID IID = getIntrinsicForCallSite(*Call, TLI);
  switch (IID) {
  default:
    break;
  // sqrt(-0.0) = -0.0, no other negative results are possible.
  case Intrinsic::sqrt:
  case Intrinsic::canonicalize:
    return CannotBeNegativeZero(Call->getArgOperand(0), TLI, Depth + 1);
  // fabs(x) != -0.0
  case Intrinsic::fabs:
    return true;
  }
}

return false;
3476}

3478/// If \p SignBitOnly is true, test for a known 0 sign bit rather than a
3479/// standard ordered compare. e.g. make -0.0 olt 0.0 be true because of the sign
3480/// bit despite comparing equal.
3481static bool cannotBeOrderedLessThanZeroImpl(const Value *V,
                                          const TargetLibraryInfo *TLI,
                                          bool SignBitOnly,
                                          unsigned Depth) {
// TODO: This function does not do the right thing when SignBitOnly is true
// and we're lowering to a hypothetical IEEE 754-compliant-but-evil platform
// which flips the sign bits of NaNs.  See
// https://llvm.org/bugs/show_bug.cgi?id=31702.

if (const ConstantFP *CFP = dyn_cast<ConstantFP>(V)) {
  return !CFP->getValueAPF().isNegative() ||
         (!SignBitOnly && CFP->getValueAPF().isZero());
}

// Handle vector of constants.
if (auto *CV = dyn_cast<Constant>(V)) {
  if (auto *CVFVTy = dyn_cast<FixedVectorType>(CV->getType())) {
    unsigned NumElts = CVFVTy->getNumElements();
    for (unsigned i = 0; i != NumElts; ++i) {
      auto *CFP = dyn_cast_or_null<ConstantFP>(CV->getAggregateElement(i));
      if (!CFP)
        return false;
      if (CFP->getValueAPF().isNegative() &&
          (SignBitOnly || !CFP->getValueAPF().isZero()))
        return false;
    }

    // All non-negative ConstantFPs.
    return true;
  }
}

if (Depth == MaxAnalysisRecursionDepth)
  return false;

const Operator *I = dyn_cast<Operator>(V);
if (!I)
  return false;

switch (I->getOpcode()) {
default:
  break;
// Unsigned integers are always nonnegative.
case Instruction::UIToFP:
  return true;
case Instruction::FMul:
case Instruction::FDiv:
  // X * X is always non-negative or a NaN.
  // X / X is always exactly 1.0 or a NaN.
  if (I->getOperand(0) == I->getOperand(1) &&
      (!SignBitOnly || cast<FPMathOperator>(I)->hasNoNaNs()))
    return true;

  LLVM_FALLTHROUGH[[gnu::fallthrough]];
case Instruction::FAdd:
case Instruction::FRem:
  return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                         Depth + 1) &&
         cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
                                         Depth + 1);
case Instruction::Select:
  return cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
                                         Depth + 1) &&
         cannotBeOrderedLessThanZeroImpl(I->getOperand(2), TLI, SignBitOnly,
                                         Depth + 1);
case Instruction::FPExt:
case Instruction::FPTrunc:
  // Widening/narrowing never change sign.
  return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                         Depth + 1);
case Instruction::ExtractElement:
  // Look through extract element. At the moment we keep this simple and skip
  // tracking the specific element. But at least we might find information
  // valid for all elements of the vector.
  return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                         Depth + 1);
case Instruction::Call:
  const auto *CI = cast<CallInst>(I);
  Intrinsic::ID IID = getIntrinsicForCallSite(*CI, TLI);
  switch (IID) {
  default:
    break;
  case Intrinsic::maxnum: {
    Value *V0 = I->getOperand(0), *V1 = I->getOperand(1);
    auto isPositiveNum = [&](Value *V) {
      if (SignBitOnly) {
        // With SignBitOnly, this is tricky because the result of
        // maxnum(+0.0, -0.0) is unspecified. Just check if the operand is
        // a constant strictly greater than 0.0.
        const APFloat *C;
        return match(V, m_APFloat(C)) &&
               *C > APFloat::getZero(C->getSemantics());
      }

      // -0.0 compares equal to 0.0, so if this operand is at least -0.0,
      // maxnum can't be ordered-less-than-zero.
      return isKnownNeverNaN(V, TLI) &&
             cannotBeOrderedLessThanZeroImpl(V, TLI, false, Depth + 1);
    };

    // TODO: This could be improved. We could also check that neither operand
    //       has its sign bit set (and at least 1 is not-NAN?).
    return isPositiveNum(V0) || isPositiveNum(V1);
  }

  case Intrinsic::maximum:
    return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                           Depth + 1) ||
           cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
                                           Depth + 1);
  case Intrinsic::minnum:
  case Intrinsic::minimum:
    return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                           Depth + 1) &&
           cannotBeOrderedLessThanZeroImpl(I->getOperand(1), TLI, SignBitOnly,
                                           Depth + 1);
  case Intrinsic::exp:
  case Intrinsic::exp2:
  case Intrinsic::fabs:
    return true;

  case Intrinsic::sqrt:
    // sqrt(x) is always >= -0 or NaN.  Moreover, sqrt(x) == -0 iff x == -0.
    if (!SignBitOnly)
      return true;
    return CI->hasNoNaNs() && (CI->hasNoSignedZeros() ||
                               CannotBeNegativeZero(CI->getOperand(0), TLI));

  case Intrinsic::powi:
    if (ConstantInt *Exponent = dyn_cast<ConstantInt>(I->getOperand(1))) {
      // powi(x,n) is non-negative if n is even.
      if (Exponent->getBitWidth() <= 64 && Exponent->getSExtValue() % 2u == 0)
        return true;
    }
    // TODO: This is not correct.  Given that exp is an integer, here are the
    // ways that pow can return a negative value:
    //
    //   pow(x, exp)    --> negative if exp is odd and x is negative.
    //   pow(-0, exp)   --> -inf if exp is negative odd.
    //   pow(-0, exp)   --> -0 if exp is positive odd.
    //   pow(-inf, exp) --> -0 if exp is negative odd.
    //   pow(-inf, exp) --> -inf if exp is positive odd.
    //
    // Therefore, if !SignBitOnly, we can return true if x >= +0 or x is NaN,
    // but we must return false if x == -0.  Unfortunately we do not currently
    // have a way of expressing this constraint.  See details in
    // https://llvm.org/bugs/show_bug.cgi?id=31702.
    return cannotBeOrderedLessThanZeroImpl(I->getOperand(0), TLI, SignBitOnly,
                                           Depth + 1);

  case Intrinsic::fma:
  case Intrinsic::fmuladd:
    // x*x+y is non-negative if y is non-negative.
    return I->getOperand(0) == I->getOperand(1) &&
           (!SignBitOnly || cast<FPMathOperator>(I)->hasNoNaNs()) &&
           cannotBeOrderedLessThanZeroImpl(I->getOperand(2), TLI, SignBitOnly,
                                           Depth + 1);
  }
  break;
}
return false;
3642}

3644bool llvm::CannotBeOrderedLessThanZero(const Value *V,
                                     const TargetLibraryInfo *TLI) {
return cannotBeOrderedLessThanZeroImpl(V, TLI, false, 0);
3647}

3649bool llvm::SignBitMustBeZero(const Value *V, const TargetLibraryInfo *TLI) {
return cannotBeOrderedLessThanZeroImpl(V, TLI, true, 0);
3651}

3653bool llvm::isKnownNeverInfinity(const Value *V, const TargetLibraryInfo *TLI,
                              unsigned Depth) {
assert(V->getType()->isFPOrFPVectorTy() && "Querying for Inf on non-FP type")(static_cast <bool> (V->getType()->isFPOrFPVectorTy
() && "Querying for Inf on non-FP type") ? void (0) :
 __assert_fail ("V->getType()->isFPOrFPVectorTy() && \"Querying for Inf on non-FP type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3655, __extension__ __PRETTY_FUNCTION__));

// If we're told that infinities won't happen, assume they won't.
if (auto *FPMathOp = dyn_cast<FPMathOperator>(V))
  if (FPMathOp->hasNoInfs())
    return true;

// Handle scalar constants.
if (auto *CFP = dyn_cast<ConstantFP>(V))
  return !CFP->isInfinity();

if (Depth == MaxAnalysisRecursionDepth)
  return false;

if (auto *Inst = dyn_cast<Instruction>(V)) {
  switch (Inst->getOpcode()) {
  case Instruction::Select: {
    return isKnownNeverInfinity(Inst->getOperand(1), TLI, Depth + 1) &&
           isKnownNeverInfinity(Inst->getOperand(2), TLI, Depth + 1);
  }
  case Instruction::SIToFP:
  case Instruction::UIToFP: {
    // Get width of largest magnitude integer (remove a bit if signed).
    // This still works for a signed minimum value because the largest FP
    // value is scaled by some fraction close to 2.0 (1.0 + 0.xxxx).
    int IntSize = Inst->getOperand(0)->getType()->getScalarSizeInBits();
    if (Inst->getOpcode() == Instruction::SIToFP)
      --IntSize;

    // If the exponent of the largest finite FP value can hold the largest
    // integer, the result of the cast must be finite.
    Type *FPTy = Inst->getType()->getScalarType();
    return ilogb(APFloat::getLargest(FPTy->getFltSemantics())) >= IntSize;
  }
  default:
    break;
  }
}

// try to handle fixed width vector constants
auto *VFVTy = dyn_cast<FixedVectorType>(V->getType());
if (VFVTy && isa<Constant>(V)) {
  // For vectors, verify that each element is not infinity.
  unsigned NumElts = VFVTy->getNumElements();
  for (unsigned i = 0; i != NumElts; ++i) {
    Constant *Elt = cast<Constant>(V)->getAggregateElement(i);
    if (!Elt)
      return false;
    if (isa<UndefValue>(Elt))
      continue;
    auto *CElt = dyn_cast<ConstantFP>(Elt);
    if (!CElt || CElt->isInfinity())
      return false;
  }
  // All elements were confirmed non-infinity or undefined.
  return true;
}

// was not able to prove that V never contains infinity
return false;
3715}

3717bool llvm::isKnownNeverNaN(const Value *V, const TargetLibraryInfo *TLI,
                         unsigned Depth) {
assert(V->getType()->isFPOrFPVectorTy() && "Querying for NaN on non-FP type")(static_cast <bool> (V->getType()->isFPOrFPVectorTy
() && "Querying for NaN on non-FP type") ? void (0) :
 __assert_fail ("V->getType()->isFPOrFPVectorTy() && \"Querying for NaN on non-FP type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3719, __extension__ __PRETTY_FUNCTION__));

// If we're told that NaNs won't happen, assume they won't.
if (auto *FPMathOp = dyn_cast<FPMathOperator>(V))
  if (FPMathOp->hasNoNaNs())
    return true;

// Handle scalar constants.
if (auto *CFP = dyn_cast<ConstantFP>(V))
  return !CFP->isNaN();

if (Depth == MaxAnalysisRecursionDepth)
  return false;

if (auto *Inst = dyn_cast<Instruction>(V)) {
  switch (Inst->getOpcode()) {
  case Instruction::FAdd:
  case Instruction::FSub:
    // Adding positive and negative infinity produces NaN.
    return isKnownNeverNaN(Inst->getOperand(0), TLI, Depth + 1) &&
           isKnownNeverNaN(Inst->getOperand(1), TLI, Depth + 1) &&
           (isKnownNeverInfinity(Inst->getOperand(0), TLI, Depth + 1) ||
            isKnownNeverInfinity(Inst->getOperand(1), TLI, Depth + 1));

  case Instruction::FMul:
    // Zero multiplied with infinity produces NaN.
    // FIXME: If neither side can be zero fmul never produces NaN.
    return isKnownNeverNaN(Inst->getOperand(0), TLI, Depth + 1) &&
           isKnownNeverInfinity(Inst->getOperand(0), TLI, Depth + 1) &&
           isKnownNeverNaN(Inst->getOperand(1), TLI, Depth + 1) &&
           isKnownNeverInfinity(Inst->getOperand(1), TLI, Depth + 1);

  case Instruction::FDiv:
  case Instruction::FRem:
    // FIXME: Only 0/0, Inf/Inf, Inf REM x and x REM 0 produce NaN.
    return false;

  case Instruction::Select: {
    return isKnownNeverNaN(Inst->getOperand(1), TLI, Depth + 1) &&
           isKnownNeverNaN(Inst->getOperand(2), TLI, Depth + 1);
  }
  case Instruction::SIToFP:
  case Instruction::UIToFP:
    return true;
  case Instruction::FPTrunc:
  case Instruction::FPExt:
    return isKnownNeverNaN(Inst->getOperand(0), TLI, Depth + 1);
  default:
    break;
  }
}

if (const auto *II = dyn_cast<IntrinsicInst>(V)) {
  switch (II->getIntrinsicID()) {
  case Intrinsic::canonicalize:
  case Intrinsic::fabs:
  case Intrinsic::copysign:
  case Intrinsic::exp:
  case Intrinsic::exp2:
  case Intrinsic::floor:
  case Intrinsic::ceil:
  case Intrinsic::trunc:
  case Intrinsic::rint:
  case Intrinsic::nearbyint:
  case Intrinsic::round:
  case Intrinsic::roundeven:
    return isKnownNeverNaN(II->getArgOperand(0), TLI, Depth + 1);
  case Intrinsic::sqrt:
    return isKnownNeverNaN(II->getArgOperand(0), TLI, Depth + 1) &&
           CannotBeOrderedLessThanZero(II->getArgOperand(0), TLI);
  case Intrinsic::minnum:
  case Intrinsic::maxnum:
    // If either operand is not NaN, the result is not NaN.
    return isKnownNeverNaN(II->getArgOperand(0), TLI, Depth + 1) ||
           isKnownNeverNaN(II->getArgOperand(1), TLI, Depth + 1);
  default:
    return false;
  }
}

// Try to handle fixed width vector constants
auto *VFVTy = dyn_cast<FixedVectorType>(V->getType());
if (VFVTy && isa<Constant>(V)) {
  // For vectors, verify that each element is not NaN.
  unsigned NumElts = VFVTy->getNumElements();
  for (unsigned i = 0; i != NumElts; ++i) {
    Constant *Elt = cast<Constant>(V)->getAggregateElement(i);
    if (!Elt)
      return false;
    if (isa<UndefValue>(Elt))
      continue;
    auto *CElt = dyn_cast<ConstantFP>(Elt);
    if (!CElt || CElt->isNaN())
      return false;
  }
  // All elements were confirmed not-NaN or undefined.
  return true;
}

// Was not able to prove that V never contains NaN
return false;
3820}

3822Value *llvm::isBytewiseValue(Value *V, const DataLayout &DL) {

// All byte-wide stores are splatable, even of arbitrary variables.
if (V->getType()->isIntegerTy(8))
  return V;

LLVMContext &Ctx = V->getContext();

// Undef don't care.
auto *UndefInt8 = UndefValue::get(Type::getInt8Ty(Ctx));
if (isa<UndefValue>(V))
  return UndefInt8;

// Return Undef for zero-sized type.
if (!DL.getTypeStoreSize(V->getType()).isNonZero())
  return UndefInt8;

Constant *C = dyn_cast<Constant>(V);
if (!C) {
  // Conceptually, we could handle things like:
  //   %a = zext i8 %X to i16
  //   %b = shl i16 %a, 8
  //   %c = or i16 %a, %b
  // but until there is an example that actually needs this, it doesn't seem
  // worth worrying about.
  return nullptr;
}

// Handle 'null' ConstantArrayZero etc.
if (C->isNullValue())
  return Constant::getNullValue(Type::getInt8Ty(Ctx));

// Constant floating-point values can be handled as integer values if the
// corresponding integer value is "byteable".  An important case is 0.0.
if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
  Type *Ty = nullptr;
  if (CFP->getType()->isHalfTy())
    Ty = Type::getInt16Ty(Ctx);
  else if (CFP->getType()->isFloatTy())
    Ty = Type::getInt32Ty(Ctx);
  else if (CFP->getType()->isDoubleTy())
    Ty = Type::getInt64Ty(Ctx);
  // Don't handle long double formats, which have strange constraints.
  return Ty ? isBytewiseValue(ConstantExpr::getBitCast(CFP, Ty), DL)
            : nullptr;
}

// We can handle constant integers that are multiple of 8 bits.
if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) {
  if (CI->getBitWidth() % 8 == 0) {
    assert(CI->getBitWidth() > 8 && "8 bits should be handled above!")(static_cast <bool> (CI->getBitWidth() > 8 &&
 "8 bits should be handled above!") ? void (0) : __assert_fail
 ("CI->getBitWidth() > 8 && \"8 bits should be handled above!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3872, __extension__ __PRETTY_FUNCTION__));
    if (!CI->getValue().isSplat(8))
      return nullptr;
    return ConstantInt::get(Ctx, CI->getValue().trunc(8));
  }
}

if (auto *CE = dyn_cast<ConstantExpr>(C)) {
  if (CE->getOpcode() == Instruction::IntToPtr) {
    if (auto *PtrTy = dyn_cast<PointerType>(CE->getType())) {
      unsigned BitWidth = DL.getPointerSizeInBits(PtrTy->getAddressSpace());
      return isBytewiseValue(
          ConstantExpr::getIntegerCast(CE->getOperand(0),
                                       Type::getIntNTy(Ctx, BitWidth), false),
          DL);
    }
  }
}

auto Merge = [&](Value *LHS, Value *RHS) -> Value * {
  if (LHS == RHS)
    return LHS;
  if (!LHS || !RHS)
    return nullptr;
  if (LHS == UndefInt8)
    return RHS;
  if (RHS == UndefInt8)
    return LHS;
  return nullptr;
};

if (ConstantDataSequential *CA = dyn_cast<ConstantDataSequential>(C)) {
  Value *Val = UndefInt8;
  for (unsigned I = 0, E = CA->getNumElements(); I != E; ++I)
    if (!(Val = Merge(Val, isBytewiseValue(CA->getElementAsConstant(I), DL))))
      return nullptr;
  return Val;
}

if (isa<ConstantAggregate>(C)) {
  Value *Val = UndefInt8;
  for (unsigned I = 0, E = C->getNumOperands(); I != E; ++I)
    if (!(Val = Merge(Val, isBytewiseValue(C->getOperand(I), DL))))
      return nullptr;
  return Val;
}

// Don't try to handle the handful of other constants.
return nullptr;
3921}

3923// This is the recursive version of BuildSubAggregate. It takes a few different
3924// arguments. Idxs is the index within the nested struct From that we are
3925// looking at now (which is of type IndexedType). IdxSkip is the number of
3926// indices from Idxs that should be left out when inserting into the resulting
3927// struct. To is the result struct built so far, new insertvalue instructions
3928// build on that.
3929static Value *BuildSubAggregate(Value *From, Value* To, Type *IndexedType,
                              SmallVectorImpl<unsigned> &Idxs,
                              unsigned IdxSkip,
                              Instruction *InsertBefore) {
StructType *STy = dyn_cast<StructType>(IndexedType);
1
Assuming 'IndexedType' is a 'StructType'→
if (STy1.1
'STy' is non-null
1
'STy' is non-null
) {
2
←
Taking true branch→
  // Save the original To argument so we can modify it
  Value *OrigTo = To;
  // General case, the type indexed by Idxs is a struct
  for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
3
←
Assuming 'i' is equal to 'e'→
4
←
Loop condition is false. Execution continues on line 3957→
    // Process each struct element recursively
    Idxs.push_back(i);
    Value *PrevTo = To;
    To = BuildSubAggregate(From, To, STy->getElementType(i), Idxs, IdxSkip,
                           InsertBefore);
    Idxs.pop_back();
    if (!To) {
      // Couldn't find any inserted value for this index? Cleanup
      while (PrevTo != OrigTo) {
        InsertValueInst* Del = cast<InsertValueInst>(PrevTo);
        PrevTo = Del->getAggregateOperand();
        Del->eraseFromParent();
      }
      // Stop processing elements
      break;
    }
  }
  // If we successfully found a value for each of our subaggregates
  if (To)
5
←
Assuming 'To' is null→
6
←
Taking false branch→
    return To;
}
// Base case, the type indexed by SourceIdxs is not a struct, or not all of
// the struct's elements had a value that was inserted directly. In the latter
// case, perhaps we can't determine each of the subelements individually, but
// we might be able to find the complete struct somewhere.

// Find the value that is at that particular spot
Value *V = FindInsertedValue(From, Idxs);

if (!V)
7
←
Assuming 'V' is non-null→
8
←
Taking false branch→
  return nullptr;

// Insert the value in the new (sub) aggregate
return InsertValueInst::Create(To, V, makeArrayRef(Idxs).slice(IdxSkip),
9
←
Passing null pointer value via 1st parameter 'Agg'→
10
←
Calling 'InsertValueInst::Create'→
                               "tmp", InsertBefore);
3974}

3976// This helper takes a nested struct and extracts a part of it (which is again a
3977// struct) into a new value. For example, given the struct:
3978// { a, { b, { c, d }, e } }
3979// and the indices "1, 1" this returns
3980// { c, d }.
3981//
3982// It does this by inserting an insertvalue for each element in the resulting
3983// struct, as opposed to just inserting a single struct. This will only work if
3984// each of the elements of the substruct are known (ie, inserted into From by an
3985// insertvalue instruction somewhere).
3986//
3987// All inserted insertvalue instructions are inserted before InsertBefore
3988static Value *BuildSubAggregate(Value *From, ArrayRef<unsigned> idx_range,
                              Instruction *InsertBefore) {
assert(InsertBefore && "Must have someplace to insert!")(static_cast <bool> (InsertBefore && "Must have someplace to insert!"
) ? void (0) : __assert_fail ("InsertBefore && \"Must have someplace to insert!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 3990, __extension__ __PRETTY_FUNCTION__));
Type *IndexedType = ExtractValueInst::getIndexedType(From->getType(),
                                                           idx_range);
Value *To = UndefValue::get(IndexedType);
SmallVector<unsigned, 10> Idxs(idx_range.begin(), idx_range.end());
unsigned IdxSkip = Idxs.size();

return BuildSubAggregate(From, To, IndexedType, Idxs, IdxSkip, InsertBefore);
3998}

4000/// Given an aggregate and a sequence of indices, see if the scalar value
4001/// indexed is already around as a register, for example if it was inserted
4002/// directly into the aggregate.
4003///
4004/// If InsertBefore is not null, this function will duplicate (modified)
4005/// insertvalues when a part of a nested struct is extracted.
4006Value *llvm::FindInsertedValue(Value *V, ArrayRef<unsigned> idx_range,
                             Instruction *InsertBefore) {
// Nothing to index? Just return V then (this is useful at the end of our
// recursion).
if (idx_range.empty())
  return V;
// We have indices, so V should have an indexable type.
assert((V->getType()->isStructTy() || V->getType()->isArrayTy()) &&(static_cast <bool> ((V->getType()->isStructTy() ||
 V->getType()->isArrayTy()) && "Not looking at a struct or array?"
) ? void (0) : __assert_fail ("(V->getType()->isStructTy() || V->getType()->isArrayTy()) && \"Not looking at a struct or array?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4014, __extension__ __PRETTY_FUNCTION__))
       "Not looking at a struct or array?")(static_cast <bool> ((V->getType()->isStructTy() ||
 V->getType()->isArrayTy()) && "Not looking at a struct or array?"
) ? void (0) : __assert_fail ("(V->getType()->isStructTy() || V->getType()->isArrayTy()) && \"Not looking at a struct or array?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4014, __extension__ __PRETTY_FUNCTION__));
assert(ExtractValueInst::getIndexedType(V->getType(), idx_range) &&(static_cast <bool> (ExtractValueInst::getIndexedType(V
->getType(), idx_range) && "Invalid indices for type?"
) ? void (0) : __assert_fail ("ExtractValueInst::getIndexedType(V->getType(), idx_range) && \"Invalid indices for type?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4016, __extension__ __PRETTY_FUNCTION__))
       "Invalid indices for type?")(static_cast <bool> (ExtractValueInst::getIndexedType(V
->getType(), idx_range) && "Invalid indices for type?"
) ? void (0) : __assert_fail ("ExtractValueInst::getIndexedType(V->getType(), idx_range) && \"Invalid indices for type?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4016, __extension__ __PRETTY_FUNCTION__));

if (Constant *C = dyn_cast<Constant>(V)) {
  C = C->getAggregateElement(idx_range[0]);
  if (!C) return nullptr;
  return FindInsertedValue(C, idx_range.slice(1), InsertBefore);
}

if (InsertValueInst *I = dyn_cast<InsertValueInst>(V)) {
  // Loop the indices for the insertvalue instruction in parallel with the
  // requested indices
  const unsigned *req_idx = idx_range.begin();
  for (const unsigned *i = I->idx_begin(), *e = I->idx_end();
       i != e; ++i, ++req_idx) {
    if (req_idx == idx_range.end()) {
      // We can't handle this without inserting insertvalues
      if (!InsertBefore)
        return nullptr;

      // The requested index identifies a part of a nested aggregate. Handle
      // this specially. For example,
      // %A = insertvalue { i32, {i32, i32 } } undef, i32 10, 1, 0
      // %B = insertvalue { i32, {i32, i32 } } %A, i32 11, 1, 1
      // %C = extractvalue {i32, { i32, i32 } } %B, 1
      // This can be changed into
      // %A = insertvalue {i32, i32 } undef, i32 10, 0
      // %C = insertvalue {i32, i32 } %A, i32 11, 1
      // which allows the unused 0,0 element from the nested struct to be
      // removed.
      return BuildSubAggregate(V, makeArrayRef(idx_range.begin(), req_idx),
                               InsertBefore);
    }

    // This insert value inserts something else than what we are looking for.
    // See if the (aggregate) value inserted into has the value we are
    // looking for, then.
    if (*req_idx != *i)
      return FindInsertedValue(I->getAggregateOperand(), idx_range,
                               InsertBefore);
  }
  // If we end up here, the indices of the insertvalue match with those
  // requested (though possibly only partially). Now we recursively look at
  // the inserted value, passing any remaining indices.
  return FindInsertedValue(I->getInsertedValueOperand(),
                           makeArrayRef(req_idx, idx_range.end()),
                           InsertBefore);
}

if (ExtractValueInst *I = dyn_cast<ExtractValueInst>(V)) {
  // If we're extracting a value from an aggregate that was extracted from
  // something else, we can extract from that something else directly instead.
  // However, we will need to chain I's indices with the requested indices.

  // Calculate the number of indices required
  unsigned size = I->getNumIndices() + idx_range.size();
  // Allocate some space to put the new indices in
  SmallVector<unsigned, 5> Idxs;
  Idxs.reserve(size);
  // Add indices from the extract value instruction
  Idxs.append(I->idx_begin(), I->idx_end());

  // Add requested indices
  Idxs.append(idx_range.begin(), idx_range.end());

  assert(Idxs.size() == size(static_cast <bool> (Idxs.size() == size && "Number of indices added not correct?"
) ? void (0) : __assert_fail ("Idxs.size() == size && \"Number of indices added not correct?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4081, __extension__ __PRETTY_FUNCTION__))
         && "Number of indices added not correct?")(static_cast <bool> (Idxs.size() == size && "Number of indices added not correct?"
) ? void (0) : __assert_fail ("Idxs.size() == size && \"Number of indices added not correct?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4081, __extension__ __PRETTY_FUNCTION__));

  return FindInsertedValue(I->getAggregateOperand(), Idxs, InsertBefore);
}
// Otherwise, we don't know (such as, extracting from a function return value
// or load instruction)
return nullptr;
4088}

4090bool llvm::isGEPBasedOnPointerToString(const GEPOperator *GEP,
                                     unsigned CharSize) {
// Make sure the GEP has exactly three arguments.
if (GEP->getNumOperands() != 3)
  return false;

// Make sure the index-ee is a pointer to array of \p CharSize integers.
// CharSize.
ArrayType *AT = dyn_cast<ArrayType>(GEP->getSourceElementType());
if (!AT || !AT->getElementType()->isIntegerTy(CharSize))
  return false;

// Check to make sure that the first operand of the GEP is an integer and
// has value 0 so that we are sure we're indexing into the initializer.
const ConstantInt *FirstIdx = dyn_cast<ConstantInt>(GEP->getOperand(1));
if (!FirstIdx || !FirstIdx->isZero())
  return false;

return true;
4109}

4111bool llvm::getConstantDataArrayInfo(const Value *V,
                                  ConstantDataArraySlice &Slice,
                                  unsigned ElementSize, uint64_t Offset) {
assert(V)(static_cast <bool> (V) ? void (0) : __assert_fail ("V"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4114, __extension__ __PRETTY_FUNCTION__));

// Look through bitcast instructions and geps.
V = V->stripPointerCasts();

// If the value is a GEP instruction or constant expression, treat it as an
// offset.
if (const GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
  // The GEP operator should be based on a pointer to string constant, and is
  // indexing into the string constant.
  if (!isGEPBasedOnPointerToString(GEP, ElementSize))
    return false;

  // If the second index isn't a ConstantInt, then this is a variable index
  // into the array.  If this occurs, we can't say anything meaningful about
  // the string.
  uint64_t StartIdx = 0;
  if (const ConstantInt *CI = dyn_cast<ConstantInt>(GEP->getOperand(2)))
    StartIdx = CI->getZExtValue();
  else
    return false;
  return getConstantDataArrayInfo(GEP->getOperand(0), Slice, ElementSize,
                                  StartIdx + Offset);
}

// The GEP instruction, constant or instruction, must reference a global
// variable that is a constant and is initialized. The referenced constant
// initializer is the array that we'll use for optimization.
const GlobalVariable *GV = dyn_cast<GlobalVariable>(V);
if (!GV || !GV->isConstant() || !GV->hasDefinitiveInitializer())
  return false;

const ConstantDataArray *Array;
ArrayType *ArrayTy;
if (GV->getInitializer()->isNullValue()) {
  Type *GVTy = GV->getValueType();
  if ( (ArrayTy = dyn_cast<ArrayType>(GVTy)) ) {
    // A zeroinitializer for the array; there is no ConstantDataArray.
    Array = nullptr;
  } else {
    const DataLayout &DL = GV->getParent()->getDataLayout();
    uint64_t SizeInBytes = DL.getTypeStoreSize(GVTy).getFixedSize();
    uint64_t Length = SizeInBytes / (ElementSize / 8);
    if (Length <= Offset)
      return false;

    Slice.Array = nullptr;
    Slice.Offset = 0;
    Slice.Length = Length - Offset;
    return true;
  }
} else {
  // This must be a ConstantDataArray.
  Array = dyn_cast<ConstantDataArray>(GV->getInitializer());
  if (!Array)
    return false;
  ArrayTy = Array->getType();
}
if (!ArrayTy->getElementType()->isIntegerTy(ElementSize))
  return false;

uint64_t NumElts = ArrayTy->getArrayNumElements();
if (Offset > NumElts)
  return false;

Slice.Array = Array;
Slice.Offset = Offset;
Slice.Length = NumElts - Offset;
return true;
4183}

4185/// This function computes the length of a null-terminated C string pointed to
4186/// by V. If successful, it returns true and returns the string in Str.
4187/// If unsuccessful, it returns false.
4188bool llvm::getConstantStringInfo(const Value *V, StringRef &Str,
                               uint64_t Offset, bool TrimAtNul) {
ConstantDataArraySlice Slice;
if (!getConstantDataArrayInfo(V, Slice, 8, Offset))
  return false;

if (Slice.Array == nullptr) {
  if (TrimAtNul) {
    Str = StringRef();
    return true;
  }
  if (Slice.Length == 1) {
    Str = StringRef("", 1);
    return true;
  }
  // We cannot instantiate a StringRef as we do not have an appropriate string
  // of 0s at hand.
  return false;
}

// Start out with the entire array in the StringRef.
Str = Slice.Array->getAsString();
// Skip over 'offset' bytes.
Str = Str.substr(Slice.Offset);

if (TrimAtNul) {
  // Trim off the \0 and anything after it.  If the array is not nul
  // terminated, we just return the whole end of string.  The client may know
  // some other way that the string is length-bound.
  Str = Str.substr(0, Str.find('\0'));
}
return true;
4220}

4222// These next two are very similar to the above, but also look through PHI
4223// nodes.
4224// TODO: See if we can integrate these two together.

4226/// If we can compute the length of the string pointed to by
4227/// the specified pointer, return 'len+1'.  If we can't, return 0.
4228static uint64_t GetStringLengthH(const Value *V,
                               SmallPtrSetImpl<const PHINode*> &PHIs,
                               unsigned CharSize) {
// Look through noop bitcast instructions.
V = V->stripPointerCasts();

// If this is a PHI node, there are two cases: either we have already seen it
// or we haven't.
if (const PHINode *PN = dyn_cast<PHINode>(V)) {
  if (!PHIs.insert(PN).second)
    return ~0ULL;  // already in the set.

  // If it was new, see if all the input strings are the same length.
  uint64_t LenSoFar = ~0ULL;
  for (Value *IncValue : PN->incoming_values()) {
    uint64_t Len = GetStringLengthH(IncValue, PHIs, CharSize);
    if (Len == 0) return 0; // Unknown length -> unknown.

    if (Len == ~0ULL) continue;

    if (Len != LenSoFar && LenSoFar != ~0ULL)
      return 0;    // Disagree -> unknown.
    LenSoFar = Len;
  }

  // Success, all agree.
  return LenSoFar;
}

// strlen(select(c,x,y)) -> strlen(x) ^ strlen(y)
if (const SelectInst *SI = dyn_cast<SelectInst>(V)) {
  uint64_t Len1 = GetStringLengthH(SI->getTrueValue(), PHIs, CharSize);
  if (Len1 == 0) return 0;
  uint64_t Len2 = GetStringLengthH(SI->getFalseValue(), PHIs, CharSize);
  if (Len2 == 0) return 0;
  if (Len1 == ~0ULL) return Len2;
  if (Len2 == ~0ULL) return Len1;
  if (Len1 != Len2) return 0;
  return Len1;
}

// Otherwise, see if we can read the string.
ConstantDataArraySlice Slice;
if (!getConstantDataArrayInfo(V, Slice, CharSize))
  return 0;

if (Slice.Array == nullptr)
  return 1;

// Search for nul characters
unsigned NullIndex = 0;
for (unsigned E = Slice.Length; NullIndex < E; ++NullIndex) {
  if (Slice.Array->getElementAsInteger(Slice.Offset + NullIndex) == 0)
    break;
}

return NullIndex + 1;
4285}

4287/// If we can compute the length of the string pointed to by
4288/// the specified pointer, return 'len+1'.  If we can't, return 0.
4289uint64_t llvm::GetStringLength(const Value *V, unsigned CharSize) {
if (!V->getType()->isPointerTy())
  return 0;

SmallPtrSet<const PHINode*, 32> PHIs;
uint64_t Len = GetStringLengthH(V, PHIs, CharSize);
// If Len is ~0ULL, we had an infinite phi cycle: this is dead code, so return
// an empty string as a length.
return Len == ~0ULL ? 1 : Len;
4298}

4300const Value *
4301llvm::getArgumentAliasingToReturnedPointer(const CallBase *Call,
                                         bool MustPreserveNullness) {
assert(Call &&(static_cast <bool> (Call && "getArgumentAliasingToReturnedPointer only works on nonnull calls"
) ? void (0) : __assert_fail ("Call && \"getArgumentAliasingToReturnedPointer only works on nonnull calls\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4304, __extension__ __PRETTY_FUNCTION__))
       "getArgumentAliasingToReturnedPointer only works on nonnull calls")(static_cast <bool> (Call && "getArgumentAliasingToReturnedPointer only works on nonnull calls"
) ? void (0) : __assert_fail ("Call && \"getArgumentAliasingToReturnedPointer only works on nonnull calls\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4304, __extension__ __PRETTY_FUNCTION__));
if (const Value *RV = Call->getReturnedArgOperand())
  return RV;
// This can be used only as a aliasing property.
if (isIntrinsicReturningPointerAliasingArgumentWithoutCapturing(
        Call, MustPreserveNullness))
  return Call->getArgOperand(0);
return nullptr;
4312}

4314bool llvm::isIntrinsicReturningPointerAliasingArgumentWithoutCapturing(
  const CallBase *Call, bool MustPreserveNullness) {
switch (Call->getIntrinsicID()) {
case Intrinsic::launder_invariant_group:
case Intrinsic::strip_invariant_group:
case Intrinsic::aarch64_irg:
case Intrinsic::aarch64_tagp:
  return true;
case Intrinsic::ptrmask:
  return !MustPreserveNullness;
default:
  return false;
}
4327}

4329/// \p PN defines a loop-variant pointer to an object.  Check if the
4330/// previous iteration of the loop was referring to the same object as \p PN.
4331static bool isSameUnderlyingObjectInLoop(const PHINode *PN,
                                       const LoopInfo *LI) {
// Find the loop-defined value.
Loop *L = LI->getLoopFor(PN->getParent());
if (PN->getNumIncomingValues() != 2)
  return true;

// Find the value from previous iteration.
auto *PrevValue = dyn_cast<Instruction>(PN->getIncomingValue(0));
if (!PrevValue || LI->getLoopFor(PrevValue->getParent()) != L)
  PrevValue = dyn_cast<Instruction>(PN->getIncomingValue(1));
if (!PrevValue || LI->getLoopFor(PrevValue->getParent()) != L)
  return true;

// If a new pointer is loaded in the loop, the pointer references a different
// object in every iteration.  E.g.:
//    for (i)
//       int *p = a[i];
//       ...
if (auto *Load = dyn_cast<LoadInst>(PrevValue))
  if (!L->isLoopInvariant(Load->getPointerOperand()))
    return false;
return true;
4354}

4356const Value *llvm::getUnderlyingObject(const Value *V, unsigned MaxLookup) {
if (!V->getType()->isPointerTy())
  return V;
for (unsigned Count = 0; MaxLookup == 0 || Count < MaxLookup; ++Count) {
  if (auto *GEP = dyn_cast<GEPOperator>(V)) {
    V = GEP->getPointerOperand();
  } else if (Operator::getOpcode(V) == Instruction::BitCast ||
             Operator::getOpcode(V) == Instruction::AddrSpaceCast) {
    V = cast<Operator>(V)->getOperand(0);
    if (!V->getType()->isPointerTy())
      return V;
  } else if (auto *GA = dyn_cast<GlobalAlias>(V)) {
    if (GA->isInterposable())
      return V;
    V = GA->getAliasee();
  } else {
    if (auto *PHI = dyn_cast<PHINode>(V)) {
      // Look through single-arg phi nodes created by LCSSA.
      if (PHI->getNumIncomingValues() == 1) {
        V = PHI->getIncomingValue(0);
        continue;
      }
    } else if (auto *Call = dyn_cast<CallBase>(V)) {
      // CaptureTracking can know about special capturing properties of some
      // intrinsics like launder.invariant.group, that can't be expressed with
      // the attributes, but have properties like returning aliasing pointer.
      // Because some analysis may assume that nocaptured pointer is not
      // returned from some special intrinsic (because function would have to
      // be marked with returns attribute), it is crucial to use this function
      // because it should be in sync with CaptureTracking. Not using it may
      // cause weird miscompilations where 2 aliasing pointers are assumed to
      // noalias.
      if (auto *RP = getArgumentAliasingToReturnedPointer(Call, false)) {
        V = RP;
        continue;
      }
    }

    return V;
  }
  assert(V->getType()->isPointerTy() && "Unexpected operand type!")(static_cast <bool> (V->getType()->isPointerTy() &&
 "Unexpected operand type!") ? void (0) : __assert_fail ("V->getType()->isPointerTy() && \"Unexpected operand type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4396, __extension__ __PRETTY_FUNCTION__));
}
return V;
4399}

4401void llvm::getUnderlyingObjects(const Value *V,
                              SmallVectorImpl<const Value *> &Objects,
                              LoopInfo *LI, unsigned MaxLookup) {
SmallPtrSet<const Value *, 4> Visited;
SmallVector<const Value *, 4> Worklist;
Worklist.push_back(V);
do {
  const Value *P = Worklist.pop_back_val();
  P = getUnderlyingObject(P, MaxLookup);

  if (!Visited.insert(P).second)
    continue;

  if (auto *SI = dyn_cast<SelectInst>(P)) {
    Worklist.push_back(SI->getTrueValue());
    Worklist.push_back(SI->getFalseValue());
    continue;
  }

  if (auto *PN = dyn_cast<PHINode>(P)) {
    // If this PHI changes the underlying object in every iteration of the
    // loop, don't look through it.  Consider:
    //   int **A;
    //   for (i) {
    //     Prev = Curr;     // Prev = PHI (Prev_0, Curr)
    //     Curr = A[i];
    //     *Prev, *Curr;
    //
    // Prev is tracking Curr one iteration behind so they refer to different
    // underlying objects.
    if (!LI || !LI->isLoopHeader(PN->getParent()) ||
        isSameUnderlyingObjectInLoop(PN, LI))
      append_range(Worklist, PN->incoming_values());
    continue;
  }

  Objects.push_back(P);
} while (!Worklist.empty());
4439}

4441/// This is the function that does the work of looking through basic
4442/// ptrtoint+arithmetic+inttoptr sequences.
4443static const Value *getUnderlyingObjectFromInt(const Value *V) {
do {
  if (const Operator *U = dyn_cast<Operator>(V)) {
    // If we find a ptrtoint, we can transfer control back to the
    // regular getUnderlyingObjectFromInt.
    if (U->getOpcode() == Instruction::PtrToInt)
      return U->getOperand(0);
    // If we find an add of a constant, a multiplied value, or a phi, it's
    // likely that the other operand will lead us to the base
    // object. We don't have to worry about the case where the
    // object address is somehow being computed by the multiply,
    // because our callers only care when the result is an
    // identifiable object.
    if (U->getOpcode() != Instruction::Add ||
        (!isa<ConstantInt>(U->getOperand(1)) &&
         Operator::getOpcode(U->getOperand(1)) != Instruction::Mul &&
         !isa<PHINode>(U->getOperand(1))))
      return V;
    V = U->getOperand(0);
  } else {
    return V;
  }
  assert(V->getType()->isIntegerTy() && "Unexpected operand type!")(static_cast <bool> (V->getType()->isIntegerTy() &&
 "Unexpected operand type!") ? void (0) : __assert_fail ("V->getType()->isIntegerTy() && \"Unexpected operand type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4465, __extension__ __PRETTY_FUNCTION__));
} while (true);
4467}

4469/// This is a wrapper around getUnderlyingObjects and adds support for basic
4470/// ptrtoint+arithmetic+inttoptr sequences.
4471/// It returns false if unidentified object is found in getUnderlyingObjects.
4472bool llvm::getUnderlyingObjectsForCodeGen(const Value *V,
                                        SmallVectorImpl<Value *> &Objects) {
SmallPtrSet<const Value *, 16> Visited;
SmallVector<const Value *, 4> Working(1, V);
do {
  V = Working.pop_back_val();

  SmallVector<const Value *, 4> Objs;
  getUnderlyingObjects(V, Objs);

  for (const Value *V : Objs) {
    if (!Visited.insert(V).second)
      continue;
    if (Operator::getOpcode(V) == Instruction::IntToPtr) {
      const Value *O =
        getUnderlyingObjectFromInt(cast<User>(V)->getOperand(0));
      if (O->getType()->isPointerTy()) {
        Working.push_back(O);
        continue;
      }
    }
    // If getUnderlyingObjects fails to find an identifiable object,
    // getUnderlyingObjectsForCodeGen also fails for safety.
    if (!isIdentifiedObject(V)) {
      Objects.clear();
      return false;
    }
    Objects.push_back(const_cast<Value *>(V));
  }
} while (!Working.empty());
return true;
4503}

4505AllocaInst *llvm::findAllocaForValue(Value *V, bool OffsetZero) {
AllocaInst *Result = nullptr;
SmallPtrSet<Value *, 4> Visited;
SmallVector<Value *, 4> Worklist;

auto AddWork = [&](Value *V) {
  if (Visited.insert(V).second)
    Worklist.push_back(V);
};

AddWork(V);
do {
  V = Worklist.pop_back_val();
  assert(Visited.count(V))(static_cast <bool> (Visited.count(V)) ? void (0) : __assert_fail
 ("Visited.count(V)", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4518, __extension__ __PRETTY_FUNCTION__));

  if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
    if (Result && Result != AI)
      return nullptr;
    Result = AI;
  } else if (CastInst *CI = dyn_cast<CastInst>(V)) {
    AddWork(CI->getOperand(0));
  } else if (PHINode *PN = dyn_cast<PHINode>(V)) {
    for (Value *IncValue : PN->incoming_values())
      AddWork(IncValue);
  } else if (auto *SI = dyn_cast<SelectInst>(V)) {
    AddWork(SI->getTrueValue());
    AddWork(SI->getFalseValue());
  } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(V)) {
    if (OffsetZero && !GEP->hasAllZeroIndices())
      return nullptr;
    AddWork(GEP->getPointerOperand());
  } else {
    return nullptr;
  }
} while (!Worklist.empty());

return Result;
4542}

4544static bool onlyUsedByLifetimeMarkersOrDroppableInstsHelper(
  const Value *V, bool AllowLifetime, bool AllowDroppable) {
for (const User *U : V->users()) {
  const IntrinsicInst *II = dyn_cast<IntrinsicInst>(U);
  if (!II)
    return false;

  if (AllowLifetime && II->isLifetimeStartOrEnd())
    continue;

  if (AllowDroppable && II->isDroppable())
    continue;

  return false;
}
return true;
4560}

4562bool llvm::onlyUsedByLifetimeMarkers(const Value *V) {
return onlyUsedByLifetimeMarkersOrDroppableInstsHelper(
    V, /* AllowLifetime */ true, /* AllowDroppable */ false);
4565}
4566bool llvm::onlyUsedByLifetimeMarkersOrDroppableInsts(const Value *V) {
return onlyUsedByLifetimeMarkersOrDroppableInstsHelper(
    V, /* AllowLifetime */ true, /* AllowDroppable */ true);
4569}

4571bool llvm::mustSuppressSpeculation(const LoadInst &LI) {
if (!LI.isUnordered())
  return true;
const Function &F = *LI.getFunction();
// Speculative load may create a race that did not exist in the source.
return F.hasFnAttribute(Attribute::SanitizeThread) ||
  // Speculative load may load data from dirty regions.
  F.hasFnAttribute(Attribute::SanitizeAddress) ||
  F.hasFnAttribute(Attribute::SanitizeHWAddress);
4580}


4583bool llvm::isSafeToSpeculativelyExecute(const Value *V,
                                      const Instruction *CtxI,
                                      const DominatorTree *DT,
                                      const TargetLibraryInfo *TLI) {
const Operator *Inst = dyn_cast<Operator>(V);
if (!Inst)
  return false;

for (unsigned i = 0, e = Inst->getNumOperands(); i != e; ++i)
  if (Constant *C = dyn_cast<Constant>(Inst->getOperand(i)))
    if (C->canTrap())
      return false;

switch (Inst->getOpcode()) {
default:
  return true;
case Instruction::UDiv:
case Instruction::URem: {
  // x / y is undefined if y == 0.
  const APInt *V;
  if (match(Inst->getOperand(1), m_APInt(V)))
    return *V != 0;
  return false;
}
case Instruction::SDiv:
case Instruction::SRem: {
  // x / y is undefined if y == 0 or x == INT_MIN and y == -1
  const APInt *Numerator, *Denominator;
  if (!match(Inst->getOperand(1), m_APInt(Denominator)))
    return false;
  // We cannot hoist this division if the denominator is 0.
  if (*Denominator == 0)
    return false;
  // It's safe to hoist if the denominator is not 0 or -1.
  if (!Denominator->isAllOnesValue())
    return true;
  // At this point we know that the denominator is -1.  It is safe to hoist as
  // long we know that the numerator is not INT_MIN.
  if (match(Inst->getOperand(0), m_APInt(Numerator)))
    return !Numerator->isMinSignedValue();
  // The numerator *might* be MinSignedValue.
  return false;
}
case Instruction::Load: {
  const LoadInst *LI = cast<LoadInst>(Inst);
  if (mustSuppressSpeculation(*LI))
    return false;
  const DataLayout &DL = LI->getModule()->getDataLayout();
  return isDereferenceableAndAlignedPointer(
      LI->getPointerOperand(), LI->getType(), MaybeAlign(LI->getAlignment()),
      DL, CtxI, DT, TLI);
}
case Instruction::Call: {
  auto *CI = cast<const CallInst>(Inst);
  const Function *Callee = CI->getCalledFunction();

  // The called function could have undefined behavior or side-effects, even
  // if marked readnone nounwind.
  return Callee && Callee->isSpeculatable();
}
case Instruction::VAArg:
case Instruction::Alloca:
case Instruction::Invoke:
case Instruction::CallBr:
case Instruction::PHI:
case Instruction::Store:
case Instruction::Ret:
case Instruction::Br:
case Instruction::IndirectBr:
case Instruction::Switch:
case Instruction::Unreachable:
case Instruction::Fence:
case Instruction::AtomicRMW:
case Instruction::AtomicCmpXchg:
case Instruction::LandingPad:
case Instruction::Resume:
case Instruction::CatchSwitch:
case Instruction::CatchPad:
case Instruction::CatchRet:
case Instruction::CleanupPad:
case Instruction::CleanupRet:
  return false; // Misc instructions which have effects
}
4666}

4668bool llvm::mayBeMemoryDependent(const Instruction &I) {
return I.mayReadOrWriteMemory() || !isSafeToSpeculativelyExecute(&I);
4670}

4672/// Convert ConstantRange OverflowResult into ValueTracking OverflowResult.
4673static OverflowResult mapOverflowResult(ConstantRange::OverflowResult OR) {
switch (OR) {
  case ConstantRange::OverflowResult::MayOverflow:
    return OverflowResult::MayOverflow;
  case ConstantRange::OverflowResult::AlwaysOverflowsLow:
    return OverflowResult::AlwaysOverflowsLow;
  case ConstantRange::OverflowResult::AlwaysOverflowsHigh:
    return OverflowResult::AlwaysOverflowsHigh;
  case ConstantRange::OverflowResult::NeverOverflows:
    return OverflowResult::NeverOverflows;
}
llvm_unreachable("Unknown OverflowResult")::llvm::llvm_unreachable_internal("Unknown OverflowResult", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4684);
4685}

4687/// Combine constant ranges from computeConstantRange() and computeKnownBits().
4688static ConstantRange computeConstantRangeIncludingKnownBits(
  const Value *V, bool ForSigned, const DataLayout &DL, unsigned Depth,
  AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT,
  OptimizationRemarkEmitter *ORE = nullptr, bool UseInstrInfo = true) {
KnownBits Known = computeKnownBits(
    V, DL, Depth, AC, CxtI, DT, ORE, UseInstrInfo);
ConstantRange CR1 = ConstantRange::fromKnownBits(Known, ForSigned);
ConstantRange CR2 = computeConstantRange(V, UseInstrInfo);
ConstantRange::PreferredRangeType RangeType =
    ForSigned ? ConstantRange::Signed : ConstantRange::Unsigned;
return CR1.intersectWith(CR2, RangeType);
4699}

4701OverflowResult llvm::computeOverflowForUnsignedMul(
  const Value *LHS, const Value *RHS, const DataLayout &DL,
  AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT,
  bool UseInstrInfo) {
KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT,
                                      nullptr, UseInstrInfo);
KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT,
                                      nullptr, UseInstrInfo);
ConstantRange LHSRange = ConstantRange::fromKnownBits(LHSKnown, false);
ConstantRange RHSRange = ConstantRange::fromKnownBits(RHSKnown, false);
return mapOverflowResult(LHSRange.unsignedMulMayOverflow(RHSRange));
4712}

4714OverflowResult
4715llvm::computeOverflowForSignedMul(const Value *LHS, const Value *RHS,
                                const DataLayout &DL, AssumptionCache *AC,
                                const Instruction *CxtI,
                                const DominatorTree *DT, bool UseInstrInfo) {
// Multiplying n * m significant bits yields a result of n + m significant
// bits. If the total number of significant bits does not exceed the
// result bit width (minus 1), there is no overflow.
// This means if we have enough leading sign bits in the operands
// we can guarantee that the result does not overflow.
// Ref: "Hacker's Delight" by Henry Warren
unsigned BitWidth = LHS->getType()->getScalarSizeInBits();

// Note that underestimating the number of sign bits gives a more
// conservative answer.
unsigned SignBits = ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) +
                    ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT);

// First handle the easy case: if we have enough sign bits there's
// definitely no overflow.
if (SignBits > BitWidth + 1)
  return OverflowResult::NeverOverflows;

// There are two ambiguous cases where there can be no overflow:
//   SignBits == BitWidth + 1    and
//   SignBits == BitWidth
// The second case is difficult to check, therefore we only handle the
// first case.
if (SignBits == BitWidth + 1) {
  // It overflows only when both arguments are negative and the true
  // product is exactly the minimum negative number.
  // E.g. mul i16 with 17 sign bits: 0xff00 * 0xff80 = 0x8000
  // For simplicity we just check if at least one side is not negative.
  KnownBits LHSKnown = computeKnownBits(LHS, DL, /*Depth=*/0, AC, CxtI, DT,
                                        nullptr, UseInstrInfo);
  KnownBits RHSKnown = computeKnownBits(RHS, DL, /*Depth=*/0, AC, CxtI, DT,
                                        nullptr, UseInstrInfo);
  if (LHSKnown.isNonNegative() || RHSKnown.isNonNegative())
    return OverflowResult::NeverOverflows;
}
return OverflowResult::MayOverflow;
4755}

4757OverflowResult llvm::computeOverflowForUnsignedAdd(
  const Value *LHS, const Value *RHS, const DataLayout &DL,
  AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT,
  bool UseInstrInfo) {
ConstantRange LHSRange = computeConstantRangeIncludingKnownBits(
    LHS, /*ForSigned=*/false, DL, /*Depth=*/0, AC, CxtI, DT,
    nullptr, UseInstrInfo);
ConstantRange RHSRange = computeConstantRangeIncludingKnownBits(
    RHS, /*ForSigned=*/false, DL, /*Depth=*/0, AC, CxtI, DT,
    nullptr, UseInstrInfo);
return mapOverflowResult(LHSRange.unsignedAddMayOverflow(RHSRange));
4768}

4770static OverflowResult computeOverflowForSignedAdd(const Value *LHS,
                                                const Value *RHS,
                                                const AddOperator *Add,
                                                const DataLayout &DL,
                                                AssumptionCache *AC,
                                                const Instruction *CxtI,
                                                const DominatorTree *DT) {
if (Add && Add->hasNoSignedWrap()) {
  return OverflowResult::NeverOverflows;
}

// If LHS and RHS each have at least two sign bits, the addition will look
// like
//
// XX..... +
// YY.....
//
// If the carry into the most significant position is 0, X and Y can't both
// be 1 and therefore the carry out of the addition is also 0.
//
// If the carry into the most significant position is 1, X and Y can't both
// be 0 and therefore the carry out of the addition is also 1.
//
// Since the carry into the most significant position is always equal to
// the carry out of the addition, there is no signed overflow.
if (ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) > 1 &&
    ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT) > 1)
  return OverflowResult::NeverOverflows;

ConstantRange LHSRange = computeConstantRangeIncludingKnownBits(
    LHS, /*ForSigned=*/true, DL, /*Depth=*/0, AC, CxtI, DT);
ConstantRange RHSRange = computeConstantRangeIncludingKnownBits(
    RHS, /*ForSigned=*/true, DL, /*Depth=*/0, AC, CxtI, DT);
OverflowResult OR =
    mapOverflowResult(LHSRange.signedAddMayOverflow(RHSRange));
if (OR != OverflowResult::MayOverflow)
  return OR;

// The remaining code needs Add to be available. Early returns if not so.
if (!Add)
  return OverflowResult::MayOverflow;

// If the sign of Add is the same as at least one of the operands, this add
// CANNOT overflow. If this can be determined from the known bits of the
// operands the above signedAddMayOverflow() check will have already done so.
// The only other way to improve on the known bits is from an assumption, so
// call computeKnownBitsFromAssume() directly.
bool LHSOrRHSKnownNonNegative =
    (LHSRange.isAllNonNegative() || RHSRange.isAllNonNegative());
bool LHSOrRHSKnownNegative =
    (LHSRange.isAllNegative() || RHSRange.isAllNegative());
if (LHSOrRHSKnownNonNegative || LHSOrRHSKnownNegative) {
  KnownBits AddKnown(LHSRange.getBitWidth());
  computeKnownBitsFromAssume(
      Add, AddKnown, /*Depth=*/0, Query(DL, AC, CxtI, DT, true));
  if ((AddKnown.isNonNegative() && LHSOrRHSKnownNonNegative) ||
      (AddKnown.isNegative() && LHSOrRHSKnownNegative))
    return OverflowResult::NeverOverflows;
}

return OverflowResult::MayOverflow;
4831}

4833OverflowResult llvm::computeOverflowForUnsignedSub(const Value *LHS,
                                                 const Value *RHS,
                                                 const DataLayout &DL,
                                                 AssumptionCache *AC,
                                                 const Instruction *CxtI,
                                                 const DominatorTree *DT) {
// Checking for conditions implied by dominating conditions may be expensive.
// Limit it to usub_with_overflow calls for now.
if (match(CxtI,
          m_Intrinsic<Intrinsic::usub_with_overflow>(m_Value(), m_Value())))
  if (auto C =
          isImpliedByDomCondition(CmpInst::ICMP_UGE, LHS, RHS, CxtI, DL)) {
    if (*C)
      return OverflowResult::NeverOverflows;
    return OverflowResult::AlwaysOverflowsLow;
  }
ConstantRange LHSRange = computeConstantRangeIncludingKnownBits(
    LHS, /*ForSigned=*/false, DL, /*Depth=*/0, AC, CxtI, DT);
ConstantRange RHSRange = computeConstantRangeIncludingKnownBits(
    RHS, /*ForSigned=*/false, DL, /*Depth=*/0, AC, CxtI, DT);
return mapOverflowResult(LHSRange.unsignedSubMayOverflow(RHSRange));
4854}

4856OverflowResult llvm::computeOverflowForSignedSub(const Value *LHS,
                                               const Value *RHS,
                                               const DataLayout &DL,
                                               AssumptionCache *AC,
                                               const Instruction *CxtI,
                                               const DominatorTree *DT) {
// If LHS and RHS each have at least two sign bits, the subtraction
// cannot overflow.
if (ComputeNumSignBits(LHS, DL, 0, AC, CxtI, DT) > 1 &&
    ComputeNumSignBits(RHS, DL, 0, AC, CxtI, DT) > 1)
  return OverflowResult::NeverOverflows;

ConstantRange LHSRange = computeConstantRangeIncludingKnownBits(
    LHS, /*ForSigned=*/true, DL, /*Depth=*/0, AC, CxtI, DT);
ConstantRange RHSRange = computeConstantRangeIncludingKnownBits(
    RHS, /*ForSigned=*/true, DL, /*Depth=*/0, AC, CxtI, DT);
return mapOverflowResult(LHSRange.signedSubMayOverflow(RHSRange));
4873}

4875bool llvm::isOverflowIntrinsicNoWrap(const WithOverflowInst *WO,
                                   const DominatorTree &DT) {
SmallVector<const BranchInst *, 2> GuardingBranches;
SmallVector<const ExtractValueInst *, 2> Results;

for (const User *U : WO->users()) {
  if (const auto *EVI = dyn_cast<ExtractValueInst>(U)) {
    assert(EVI->getNumIndices() == 1 && "Obvious from CI's type")(static_cast <bool> (EVI->getNumIndices() == 1 &&
 "Obvious from CI's type") ? void (0) : __assert_fail ("EVI->getNumIndices() == 1 && \"Obvious from CI's type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4882, __extension__ __PRETTY_FUNCTION__));

    if (EVI->getIndices()[0] == 0)
      Results.push_back(EVI);
    else {
      assert(EVI->getIndices()[0] == 1 && "Obvious from CI's type")(static_cast <bool> (EVI->getIndices()[0] == 1 &&
 "Obvious from CI's type") ? void (0) : __assert_fail ("EVI->getIndices()[0] == 1 && \"Obvious from CI's type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4887, __extension__ __PRETTY_FUNCTION__));

      for (const auto *U : EVI->users())
        if (const auto *B = dyn_cast<BranchInst>(U)) {
          assert(B->isConditional() && "How else is it using an i1?")(static_cast <bool> (B->isConditional() && "How else is it using an i1?"
) ? void (0) : __assert_fail ("B->isConditional() && \"How else is it using an i1?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 4891, __extension__ __PRETTY_FUNCTION__));
          GuardingBranches.push_back(B);
        }
    }
  } else {
    // We are using the aggregate directly in a way we don't want to analyze
    // here (storing it to a global, say).
    return false;
  }
}

auto AllUsesGuardedByBranch = [&](const BranchInst *BI) {
  BasicBlockEdge NoWrapEdge(BI->getParent(), BI->getSuccessor(1));
  if (!NoWrapEdge.isSingleEdge())
    return false;

  // Check if all users of the add are provably no-wrap.
  for (const auto *Result : Results) {
    // If the extractvalue itself is not executed on overflow, the we don't
    // need to check each use separately, since domination is transitive.
    if (DT.dominates(NoWrapEdge, Result->getParent()))
      continue;

    for (auto &RU : Result->uses())
      if (!DT.dominates(NoWrapEdge, RU))
        return false;
  }

  return true;
};

return llvm::any_of(GuardingBranches, AllUsesGuardedByBranch);
4923}

4925static bool canCreateUndefOrPoison(const Operator *Op, bool PoisonOnly) {
// See whether I has flags that may create poison
if (const auto *OvOp = dyn_cast<OverflowingBinaryOperator>(Op)) {
  if (OvOp->hasNoSignedWrap() || OvOp->hasNoUnsignedWrap())
    return true;
}
if (const auto *ExactOp = dyn_cast<PossiblyExactOperator>(Op))
  if (ExactOp->isExact())
    return true;
if (const auto *FP = dyn_cast<FPMathOperator>(Op)) {
  auto FMF = FP->getFastMathFlags();
  if (FMF.noNaNs() || FMF.noInfs())
    return true;
}

unsigned Opcode = Op->getOpcode();

// Check whether opcode is a poison/undef-generating operation
switch (Opcode) {
case Instruction::Shl:
case Instruction::AShr:
case Instruction::LShr: {
  // Shifts return poison if shiftwidth is larger than the bitwidth.
  if (auto *C = dyn_cast<Constant>(Op->getOperand(1))) {
    SmallVector<Constant *, 4> ShiftAmounts;
    if (auto *FVTy = dyn_cast<FixedVectorType>(C->getType())) {
      unsigned NumElts = FVTy->getNumElements();
      for (unsigned i = 0; i < NumElts; ++i)
        ShiftAmounts.push_back(C->getAggregateElement(i));
    } else if (isa<ScalableVectorType>(C->getType()))
      return true; // Can't tell, just return true to be safe
    else
      ShiftAmounts.push_back(C);

    bool Safe = llvm::all_of(ShiftAmounts, [](Constant *C) {
      auto *CI = dyn_cast_or_null<ConstantInt>(C);
      return CI && CI->getValue().ult(C->getType()->getIntegerBitWidth());
    });
    return !Safe;
  }
  return true;
}
case Instruction::FPToSI:
case Instruction::FPToUI:
  // fptosi/ui yields poison if the resulting value does not fit in the
  // destination type.
  return true;
case Instruction::Call:
  if (auto *II = dyn_cast<IntrinsicInst>(Op)) {
    switch (II->getIntrinsicID()) {
    // TODO: Add more intrinsics.
    case Intrinsic::ctpop:
    case Intrinsic::sadd_with_overflow:
    case Intrinsic::ssub_with_overflow:
    case Intrinsic::smul_with_overflow:
    case Intrinsic::uadd_with_overflow:
    case Intrinsic::usub_with_overflow:
    case Intrinsic::umul_with_overflow:
      return false;
    }
  }
  LLVM_FALLTHROUGH[[gnu::fallthrough]];
case Instruction::CallBr:
case Instruction::Invoke: {
  const auto *CB = cast<CallBase>(Op);
  return !CB->hasRetAttr(Attribute::NoUndef);
}
case Instruction::InsertElement:
case Instruction::ExtractElement: {
  // If index exceeds the length of the vector, it returns poison
  auto *VTy = cast<VectorType>(Op->getOperand(0)->getType());
  unsigned IdxOp = Op->getOpcode() == Instruction::InsertElement ? 2 : 1;
  auto *Idx = dyn_cast<ConstantInt>(Op->getOperand(IdxOp));
  if (!Idx || Idx->getValue().uge(VTy->getElementCount().getKnownMinValue()))
    return true;
  return false;
}
case Instruction::ShuffleVector: {
  // shufflevector may return undef.
  if (PoisonOnly)
    return false;
  ArrayRef<int> Mask = isa<ConstantExpr>(Op)
                           ? cast<ConstantExpr>(Op)->getShuffleMask()
                           : cast<ShuffleVectorInst>(Op)->getShuffleMask();
  return is_contained(Mask, UndefMaskElem);
}
case Instruction::FNeg:
case Instruction::PHI:
case Instruction::Select:
case Instruction::URem:
case Instruction::SRem:
case Instruction::ExtractValue:
case Instruction::InsertValue:
case Instruction::Freeze:
case Instruction::ICmp:
case Instruction::FCmp:
  return false;
case Instruction::GetElementPtr: {
  const auto *GEP = cast<GEPOperator>(Op);
  return GEP->isInBounds();
}
default: {
  const auto *CE = dyn_cast<ConstantExpr>(Op);
  if (isa<CastInst>(Op) || (CE && CE->isCast()))
    return false;
  else if (Instruction::isBinaryOp(Opcode))
    return false;
  // Be conservative and return true.
  return true;
}
}
5036}

5038bool llvm::canCreateUndefOrPoison(const Operator *Op) {
return ::canCreateUndefOrPoison(Op, /*PoisonOnly=*/false);
5040}

5042bool llvm::canCreatePoison(const Operator *Op) {
return ::canCreateUndefOrPoison(Op, /*PoisonOnly=*/true);
5044}

5046static bool directlyImpliesPoison(const Value *ValAssumedPoison,
                                const Value *V, unsigned Depth) {
if (ValAssumedPoison == V)
  return true;

const unsigned MaxDepth = 2;
if (Depth >= MaxDepth)
  return false;

if (const auto *I = dyn_cast<Instruction>(V)) {
  if (propagatesPoison(cast<Operator>(I)))
    return any_of(I->operands(), [=](const Value *Op) {
      return directlyImpliesPoison(ValAssumedPoison, Op, Depth + 1);
    });

  // 'select ValAssumedPoison, _, _' is poison.
  if (const auto *SI = dyn_cast<SelectInst>(I))
    return directlyImpliesPoison(ValAssumedPoison, SI->getCondition(),
                                 Depth + 1);
  // V  = extractvalue V0, idx
  // V2 = extractvalue V0, idx2
  // V0's elements are all poison or not. (e.g., add_with_overflow)
  const WithOverflowInst *II;
  if (match(I, m_ExtractValue(m_WithOverflowInst(II))) &&
      (match(ValAssumedPoison, m_ExtractValue(m_Specific(II))) ||
       llvm::is_contained(II->arg_operands(), ValAssumedPoison)))
    return true;
}
return false;
5075}

5077static bool impliesPoison(const Value *ValAssumedPoison, const Value *V,
                        unsigned Depth) {
if (isGuaranteedNotToBeUndefOrPoison(ValAssumedPoison))
  return true;

if (directlyImpliesPoison(ValAssumedPoison, V, /* Depth */ 0))
  return true;

const unsigned MaxDepth = 2;
if (Depth >= MaxDepth)
  return false;

const auto *I = dyn_cast<Instruction>(ValAssumedPoison);
if (I && !canCreatePoison(cast<Operator>(I))) {
  return all_of(I->operands(), [=](const Value *Op) {
    return impliesPoison(Op, V, Depth + 1);
  });
}
return false;
5096}

5098bool llvm::impliesPoison(const Value *ValAssumedPoison, const Value *V) {
return ::impliesPoison(ValAssumedPoison, V, /* Depth */ 0);
5100}

5102static bool programUndefinedIfUndefOrPoison(const Value *V,
                                          bool PoisonOnly);

5105static bool isGuaranteedNotToBeUndefOrPoison(const Value *V,
                                           AssumptionCache *AC,
                                           const Instruction *CtxI,
                                           const DominatorTree *DT,
                                           unsigned Depth, bool PoisonOnly) {
if (Depth >= MaxAnalysisRecursionDepth)
  return false;

if (isa<MetadataAsValue>(V))
  return false;

if (const auto *A = dyn_cast<Argument>(V)) {
  if (A->hasAttribute(Attribute::NoUndef))
    return true;
}

if (auto *C = dyn_cast<Constant>(V)) {
  if (isa<UndefValue>(C))
    return PoisonOnly && !isa<PoisonValue>(C);

  if (isa<ConstantInt>(C) || isa<GlobalVariable>(C) || isa<ConstantFP>(V) ||
      isa<ConstantPointerNull>(C) || isa<Function>(C))
    return true;

  if (C->getType()->isVectorTy() && !isa<ConstantExpr>(C))
    return (PoisonOnly ? !C->containsPoisonElement()
                       : !C->containsUndefOrPoisonElement()) &&
           !C->containsConstantExpression();
}

// Strip cast operations from a pointer value.
// Note that stripPointerCastsSameRepresentation can strip off getelementptr
// inbounds with zero offset. To guarantee that the result isn't poison, the
// stripped pointer is checked as it has to be pointing into an allocated
// object or be null `null` to ensure `inbounds` getelement pointers with a
// zero offset could not produce poison.
// It can strip off addrspacecast that do not change bit representation as
// well. We believe that such addrspacecast is equivalent to no-op.
auto *StrippedV = V->stripPointerCastsSameRepresentation();
if (isa<AllocaInst>(StrippedV) || isa<GlobalVariable>(StrippedV) ||
    isa<Function>(StrippedV) || isa<ConstantPointerNull>(StrippedV))
  return true;

auto OpCheck = [&](const Value *V) {
  return isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth + 1,
                                          PoisonOnly);
};

if (auto *Opr = dyn_cast<Operator>(V)) {
  // If the value is a freeze instruction, then it can never
  // be undef or poison.
  if (isa<FreezeInst>(V))
    return true;

  if (const auto *CB = dyn_cast<CallBase>(V)) {
    if (CB->hasRetAttr(Attribute::NoUndef))
      return true;
  }

  if (const auto *PN = dyn_cast<PHINode>(V)) {
    unsigned Num = PN->getNumIncomingValues();
    bool IsWellDefined = true;
    for (unsigned i = 0; i < Num; ++i) {
      auto *TI = PN->getIncomingBlock(i)->getTerminator();
      if (!isGuaranteedNotToBeUndefOrPoison(PN->getIncomingValue(i), AC, TI,
                                            DT, Depth + 1, PoisonOnly)) {
        IsWellDefined = false;
        break;
      }
    }
    if (IsWellDefined)
      return true;
  } else if (!canCreateUndefOrPoison(Opr) && all_of(Opr->operands(), OpCheck))
    return true;
}

if (auto *I = dyn_cast<LoadInst>(V))
  if (I->getMetadata(LLVMContext::MD_noundef))
    return true;

if (programUndefinedIfUndefOrPoison(V, PoisonOnly))
  return true;

// CxtI may be null or a cloned instruction.
if (!CtxI || !CtxI->getParent() || !DT)
  return false;

auto *DNode = DT->getNode(CtxI->getParent());
if (!DNode)
  // Unreachable block
  return false;

// If V is used as a branch condition before reaching CtxI, V cannot be
// undef or poison.
//   br V, BB1, BB2
// BB1:
//   CtxI ; V cannot be undef or poison here
auto *Dominator = DNode->getIDom();
while (Dominator) {
  auto *TI = Dominator->getBlock()->getTerminator();

  Value *Cond = nullptr;
  if (auto BI = dyn_cast<BranchInst>(TI)) {
    if (BI->isConditional())
      Cond = BI->getCondition();
  } else if (auto SI = dyn_cast<SwitchInst>(TI)) {
    Cond = SI->getCondition();
  }

  if (Cond) {
    if (Cond == V)
      return true;
    else if (PoisonOnly && isa<Operator>(Cond)) {
      // For poison, we can analyze further
      auto *Opr = cast<Operator>(Cond);
      if (propagatesPoison(Opr) && is_contained(Opr->operand_values(), V))
        return true;
    }
  }

  Dominator = Dominator->getIDom();
}

SmallVector<Attribute::AttrKind, 2> AttrKinds{Attribute::NoUndef};
if (getKnowledgeValidInContext(V, AttrKinds, CtxI, DT, AC))
  return true;

return false;
5233}

5235bool llvm::isGuaranteedNotToBeUndefOrPoison(const Value *V, AssumptionCache *AC,
                                          const Instruction *CtxI,
                                          const DominatorTree *DT,
                                          unsigned Depth) {
return ::isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth, false);
5240}

5242bool llvm::isGuaranteedNotToBePoison(const Value *V, AssumptionCache *AC,
                                   const Instruction *CtxI,
                                   const DominatorTree *DT, unsigned Depth) {
return ::isGuaranteedNotToBeUndefOrPoison(V, AC, CtxI, DT, Depth, true);
5246}

5248OverflowResult llvm::computeOverflowForSignedAdd(const AddOperator *Add,
                                               const DataLayout &DL,
                                               AssumptionCache *AC,
                                               const Instruction *CxtI,
                                               const DominatorTree *DT) {
return ::computeOverflowForSignedAdd(Add->getOperand(0), Add->getOperand(1),
                                     Add, DL, AC, CxtI, DT);
5255}

5257OverflowResult llvm::computeOverflowForSignedAdd(const Value *LHS,
                                               const Value *RHS,
                                               const DataLayout &DL,
                                               AssumptionCache *AC,
                                               const Instruction *CxtI,
                                               const DominatorTree *DT) {
return ::computeOverflowForSignedAdd(LHS, RHS, nullptr, DL, AC, CxtI, DT);
5264}

5266bool llvm::isGuaranteedToTransferExecutionToSuccessor(const Instruction *I) {
// Note: An atomic operation isn't guaranteed to return in a reasonable amount
// of time because it's possible for another thread to interfere with it for an
// arbitrary length of time, but programs aren't allowed to rely on that.

// If there is no successor, then execution can't transfer to it.
if (isa<ReturnInst>(I))
  return false;
if (isa<UnreachableInst>(I))
  return false;

// Note: Do not add new checks here; instead, change Instruction::mayThrow or
// Instruction::willReturn.
//
// FIXME: Move this check into Instruction::willReturn.
if (isa<CatchPadInst>(I)) {
  switch (classifyEHPersonality(I->getFunction()->getPersonalityFn())) {
  default:
    // A catchpad may invoke exception object constructors and such, which
    // in some languages can be arbitrary code, so be conservative by default.
    return false;
  case EHPersonality::CoreCLR:
    // For CoreCLR, it just involves a type test.
    return true;
  }
}

// An instruction that returns without throwing must transfer control flow
// to a successor.
return !I->mayThrow() && I->willReturn();
5296}

5298bool llvm::isGuaranteedToTransferExecutionToSuccessor(const BasicBlock *BB) {
// TODO: This is slightly conservative for invoke instruction since exiting
// via an exception *is* normal control for them.
for (const Instruction &I : *BB)
  if (!isGuaranteedToTransferExecutionToSuccessor(&I))
    return false;
return true;
5305}

5307bool llvm::isGuaranteedToExecuteForEveryIteration(const Instruction *I,
                                                const Loop *L) {
// The loop header is guaranteed to be executed for every iteration.
//
// FIXME: Relax this constraint to cover all basic blocks that are
// guaranteed to be executed at every iteration.
if (I->getParent() != L->getHeader()) return false;

for (const Instruction &LI : *L->getHeader()) {
  if (&LI == I) return true;
  if (!isGuaranteedToTransferExecutionToSuccessor(&LI)) return false;
}
llvm_unreachable("Instruction not contained in its own parent basic block.")::llvm::llvm_unreachable_internal("Instruction not contained in its own parent basic block."
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 5319);
5320}

5322bool llvm::propagatesPoison(const Operator *I) {
switch (I->getOpcode()) {
case Instruction::Freeze:
case Instruction::Select:
case Instruction::PHI:
case Instruction::Invoke:
  return false;
case Instruction::Call:
  if (auto *II = dyn_cast<IntrinsicInst>(I)) {
    switch (II->getIntrinsicID()) {
    // TODO: Add more intrinsics.
    case Intrinsic::sadd_with_overflow:
    case Intrinsic::ssub_with_overflow:
    case Intrinsic::smul_with_overflow:
    case Intrinsic::uadd_with_overflow:
    case Intrinsic::usub_with_overflow:
    case Intrinsic::umul_with_overflow:
      // If an input is a vector containing a poison element, the
      // two output vectors (calculated results, overflow bits)'
      // corresponding lanes are poison.
      return true;
    case Intrinsic::ctpop:
      return true;
    }
  }
  return false;
case Instruction::ICmp:
case Instruction::FCmp:
case Instruction::GetElementPtr:
  return true;
default:
  if (isa<BinaryOperator>(I) || isa<UnaryOperator>(I) || isa<CastInst>(I))
    return true;

  // Be conservative and return false.
  return false;
}
5359}

5361void llvm::getGuaranteedWellDefinedOps(
  const Instruction *I, SmallPtrSetImpl<const Value *> &Operands) {
switch (I->getOpcode()) {
  case Instruction::Store:
    Operands.insert(cast<StoreInst>(I)->getPointerOperand());
    break;

  case Instruction::Load:
    Operands.insert(cast<LoadInst>(I)->getPointerOperand());
    break;

  // Since dereferenceable attribute imply noundef, atomic operations
  // also implicitly have noundef pointers too
  case Instruction::AtomicCmpXchg:
    Operands.insert(cast<AtomicCmpXchgInst>(I)->getPointerOperand());
    break;

  case Instruction::AtomicRMW:
    Operands.insert(cast<AtomicRMWInst>(I)->getPointerOperand());
    break;

  case Instruction::Call:
  case Instruction::Invoke: {
    const CallBase *CB = cast<CallBase>(I);
    if (CB->isIndirectCall())
      Operands.insert(CB->getCalledOperand());
    for (unsigned i = 0; i < CB->arg_size(); ++i) {
      if (CB->paramHasAttr(i, Attribute::NoUndef) ||
          CB->paramHasAttr(i, Attribute::Dereferenceable))
        Operands.insert(CB->getArgOperand(i));
    }
    break;
  }

  default:
    break;
}
5398}

5400void llvm::getGuaranteedNonPoisonOps(const Instruction *I,
                                   SmallPtrSetImpl<const Value *> &Operands) {
getGuaranteedWellDefinedOps(I, Operands);
switch (I->getOpcode()) {
// Divisors of these operations are allowed to be partially undef.
case Instruction::UDiv:
case Instruction::SDiv:
case Instruction::URem:
case Instruction::SRem:
  Operands.insert(I->getOperand(1));
  break;

default:
  break;
}
5415}

5417bool llvm::mustTriggerUB(const Instruction *I,
                       const SmallSet<const Value *, 16>& KnownPoison) {
SmallPtrSet<const Value *, 4> NonPoisonOps;
getGuaranteedNonPoisonOps(I, NonPoisonOps);

for (const auto *V : NonPoisonOps)
  if (KnownPoison.count(V))
    return true;

return false;
5427}

5429static bool programUndefinedIfUndefOrPoison(const Value *V,
                                          bool PoisonOnly) {
// We currently only look for uses of values within the same basic
// block, as that makes it easier to guarantee that the uses will be
// executed given that Inst is executed.
//
// FIXME: Expand this to consider uses beyond the same basic block. To do
// this, look out for the distinction between post-dominance and strong
// post-dominance.
const BasicBlock *BB = nullptr;
BasicBlock::const_iterator Begin;
if (const auto *Inst = dyn_cast<Instruction>(V)) {
  BB = Inst->getParent();
  Begin = Inst->getIterator();
  Begin++;
} else if (const auto *Arg = dyn_cast<Argument>(V)) {
  BB = &Arg->getParent()->getEntryBlock();
  Begin = BB->begin();
} else {
  return false;
}

// Limit number of instructions we look at, to avoid scanning through large
// blocks. The current limit is chosen arbitrarily.
unsigned ScanLimit = 32;
BasicBlock::const_iterator End = BB->end();

if (!PoisonOnly) {
  // Since undef does not propagate eagerly, be conservative & just check
  // whether a value is directly passed to an instruction that must take
  // well-defined operands.

  for (auto &I : make_range(Begin, End)) {
    if (isa<DbgInfoIntrinsic>(I))
      continue;
    if (--ScanLimit == 0)
      break;

    SmallPtrSet<const Value *, 4> WellDefinedOps;
    getGuaranteedWellDefinedOps(&I, WellDefinedOps);
    if (WellDefinedOps.contains(V))
      return true;

    if (!isGuaranteedToTransferExecutionToSuccessor(&I))
      break;
  }
  return false;
}

// Set of instructions that we have proved will yield poison if Inst
// does.
SmallSet<const Value *, 16> YieldsPoison;
SmallSet<const BasicBlock *, 4> Visited;

YieldsPoison.insert(V);
auto Propagate = [&](const User *User) {
  if (propagatesPoison(cast<Operator>(User)))
    YieldsPoison.insert(User);
};
for_each(V->users(), Propagate);
Visited.insert(BB);

while (true) {
  for (auto &I : make_range(Begin, End)) {
    if (isa<DbgInfoIntrinsic>(I))
      continue;
    if (--ScanLimit == 0)
      return false;
    if (mustTriggerUB(&I, YieldsPoison))
      return true;
    if (!isGuaranteedToTransferExecutionToSuccessor(&I))
      return false;

    // Mark poison that propagates from I through uses of I.
    if (YieldsPoison.count(&I))
      for_each(I.users(), Propagate);
  }

  BB = BB->getSingleSuccessor();
  if (!BB || !Visited.insert(BB).second)
    break;

  Begin = BB->getFirstNonPHI()->getIterator();
  End = BB->end();
}
return false;
5515}

5517bool llvm::programUndefinedIfUndefOrPoison(const Instruction *Inst) {
return ::programUndefinedIfUndefOrPoison(Inst, false);
5519}

5521bool llvm::programUndefinedIfPoison(const Instruction *Inst) {
return ::programUndefinedIfUndefOrPoison(Inst, true);
5523}

5525static bool isKnownNonNaN(const Value *V, FastMathFlags FMF) {
if (FMF.noNaNs())
  return true;

if (auto *C = dyn_cast<ConstantFP>(V))
  return !C->isNaN();

if (auto *C = dyn_cast<ConstantDataVector>(V)) {
  if (!C->getElementType()->isFloatingPointTy())
    return false;
  for (unsigned I = 0, E = C->getNumElements(); I < E; ++I) {
    if (C->getElementAsAPFloat(I).isNaN())
      return false;
  }
  return true;
}

if (isa<ConstantAggregateZero>(V))
  return true;

return false;
5546}

5548static bool isKnownNonZero(const Value *V) {
if (auto *C = dyn_cast<ConstantFP>(V))
  return !C->isZero();

if (auto *C = dyn_cast<ConstantDataVector>(V)) {
  if (!C->getElementType()->isFloatingPointTy())
    return false;
  for (unsigned I = 0, E = C->getNumElements(); I < E; ++I) {
    if (C->getElementAsAPFloat(I).isZero())
      return false;
  }
  return true;
}

return false;
5563}

5565/// Match clamp pattern for float types without care about NaNs or signed zeros.
5566/// Given non-min/max outer cmp/select from the clamp pattern this
5567/// function recognizes if it can be substitued by a "canonical" min/max
5568/// pattern.
5569static SelectPatternResult matchFastFloatClamp(CmpInst::Predicate Pred,
                                             Value *CmpLHS, Value *CmpRHS,
                                             Value *TrueVal, Value *FalseVal,
                                             Value *&LHS, Value *&RHS) {
// Try to match
//   X < C1 ? C1 : Min(X, C2) --> Max(C1, Min(X, C2))
//   X > C1 ? C1 : Max(X, C2) --> Min(C1, Max(X, C2))
// and return description of the outer Max/Min.

// First, check if select has inverse order:
if (CmpRHS == FalseVal) {
  std::swap(TrueVal, FalseVal);
  Pred = CmpInst::getInversePredicate(Pred);
}

// Assume success now. If there's no match, callers should not use these anyway.
LHS = TrueVal;
RHS = FalseVal;

const APFloat *FC1;
if (CmpRHS != TrueVal || !match(CmpRHS, m_APFloat(FC1)) || !FC1->isFinite())
  return {SPF_UNKNOWN, SPNB_NA, false};

const APFloat *FC2;
switch (Pred) {
case CmpInst::FCMP_OLT:
case CmpInst::FCMP_OLE:
case CmpInst::FCMP_ULT:
case CmpInst::FCMP_ULE:
  if (match(FalseVal,
            m_CombineOr(m_OrdFMin(m_Specific(CmpLHS), m_APFloat(FC2)),
                        m_UnordFMin(m_Specific(CmpLHS), m_APFloat(FC2)))) &&
      *FC1 < *FC2)
    return {SPF_FMAXNUM, SPNB_RETURNS_ANY, false};
  break;
case CmpInst::FCMP_OGT:
case CmpInst::FCMP_OGE:
case CmpInst::FCMP_UGT:
case CmpInst::FCMP_UGE:
  if (match(FalseVal,
            m_CombineOr(m_OrdFMax(m_Specific(CmpLHS), m_APFloat(FC2)),
                        m_UnordFMax(m_Specific(CmpLHS), m_APFloat(FC2)))) &&
      *FC1 > *FC2)
    return {SPF_FMINNUM, SPNB_RETURNS_ANY, false};
  break;
default:
  break;
}

return {SPF_UNKNOWN, SPNB_NA, false};
5619}

5621/// Recognize variations of:
5622///   CLAMP(v,l,h) ==> ((v) < (l) ? (l) : ((v) > (h) ? (h) : (v)))
5623static SelectPatternResult matchClamp(CmpInst::Predicate Pred,
                                    Value *CmpLHS, Value *CmpRHS,
                                    Value *TrueVal, Value *FalseVal) {
// Swap the select operands and predicate to match the patterns below.
if (CmpRHS != TrueVal) {
  Pred = ICmpInst::getSwappedPredicate(Pred);
  std::swap(TrueVal, FalseVal);
}
const APInt *C1;
if (CmpRHS == TrueVal && match(CmpRHS, m_APInt(C1))) {
  const APInt *C2;
  // (X <s C1) ? C1 : SMIN(X, C2) ==> SMAX(SMIN(X, C2), C1)
  if (match(FalseVal, m_SMin(m_Specific(CmpLHS), m_APInt(C2))) &&
      C1->slt(*C2) && Pred == CmpInst::ICMP_SLT)
    return {SPF_SMAX, SPNB_NA, false};

  // (X >s C1) ? C1 : SMAX(X, C2) ==> SMIN(SMAX(X, C2), C1)
  if (match(FalseVal, m_SMax(m_Specific(CmpLHS), m_APInt(C2))) &&
      C1->sgt(*C2) && Pred == CmpInst::ICMP_SGT)
    return {SPF_SMIN, SPNB_NA, false};

  // (X <u C1) ? C1 : UMIN(X, C2) ==> UMAX(UMIN(X, C2), C1)
  if (match(FalseVal, m_UMin(m_Specific(CmpLHS), m_APInt(C2))) &&
      C1->ult(*C2) && Pred == CmpInst::ICMP_ULT)
    return {SPF_UMAX, SPNB_NA, false};

  // (X >u C1) ? C1 : UMAX(X, C2) ==> UMIN(UMAX(X, C2), C1)
  if (match(FalseVal, m_UMax(m_Specific(CmpLHS), m_APInt(C2))) &&
      C1->ugt(*C2) && Pred == CmpInst::ICMP_UGT)
    return {SPF_UMIN, SPNB_NA, false};
}
return {SPF_UNKNOWN, SPNB_NA, false};
5655}

5657/// Recognize variations of:
5658///   a < c ? min(a,b) : min(b,c) ==> min(min(a,b),min(b,c))
5659static SelectPatternResult matchMinMaxOfMinMax(CmpInst::Predicate Pred,
                                             Value *CmpLHS, Value *CmpRHS,
                                             Value *TVal, Value *FVal,
                                             unsigned Depth) {
// TODO: Allow FP min/max with nnan/nsz.
assert(CmpInst::isIntPredicate(Pred) && "Expected integer comparison")(static_cast <bool> (CmpInst::isIntPredicate(Pred) &&
 "Expected integer comparison") ? void (0) : __assert_fail ("CmpInst::isIntPredicate(Pred) && \"Expected integer comparison\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 5664, __extension__ __PRETTY_FUNCTION__));

Value *A = nullptr, *B = nullptr;
SelectPatternResult L = matchSelectPattern(TVal, A, B, nullptr, Depth + 1);
if (!SelectPatternResult::isMinOrMax(L.Flavor))
  return {SPF_UNKNOWN, SPNB_NA, false};

Value *C = nullptr, *D = nullptr;
SelectPatternResult R = matchSelectPattern(FVal, C, D, nullptr, Depth + 1);
if (L.Flavor != R.Flavor)
  return {SPF_UNKNOWN, SPNB_NA, false};

// We have something like: x Pred y ? min(a, b) : min(c, d).
// Try to match the compare to the min/max operations of the select operands.
// First, make sure we have the right compare predicate.
switch (L.Flavor) {
case SPF_SMIN:
  if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE) {
    Pred = ICmpInst::getSwappedPredicate(Pred);
    std::swap(CmpLHS, CmpRHS);
  }
  if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE)
    break;
  return {SPF_UNKNOWN, SPNB_NA, false};
case SPF_SMAX:
  if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SLE) {
    Pred = ICmpInst::getSwappedPredicate(Pred);
    std::swap(CmpLHS, CmpRHS);
  }
  if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SGE)
    break;
  return {SPF_UNKNOWN, SPNB_NA, false};
case SPF_UMIN:
  if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE) {
    Pred = ICmpInst::getSwappedPredicate(Pred);
    std::swap(CmpLHS, CmpRHS);
  }
  if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE)
    break;
  return {SPF_UNKNOWN, SPNB_NA, false};
case SPF_UMAX:
  if (Pred == ICmpInst::ICMP_ULT || Pred == ICmpInst::ICMP_ULE) {
    Pred = ICmpInst::getSwappedPredicate(Pred);
    std::swap(CmpLHS, CmpRHS);
  }
  if (Pred == ICmpInst::ICMP_UGT || Pred == ICmpInst::ICMP_UGE)
    break;
  return {SPF_UNKNOWN, SPNB_NA, false};
default:
  return {SPF_UNKNOWN, SPNB_NA, false};
}

// If there is a common operand in the already matched min/max and the other
// min/max operands match the compare operands (either directly or inverted),
// then this is min/max of the same flavor.

// a pred c ? m(a, b) : m(c, b) --> m(m(a, b), m(c, b))
// ~c pred ~a ? m(a, b) : m(c, b) --> m(m(a, b), m(c, b))
if (D == B) {
  if ((CmpLHS == A && CmpRHS == C) || (match(C, m_Not(m_Specific(CmpLHS))) &&
                                       match(A, m_Not(m_Specific(CmpRHS)))))
    return {L.Flavor, SPNB_NA, false};
}
// a pred d ? m(a, b) : m(b, d) --> m(m(a, b), m(b, d))
// ~d pred ~a ? m(a, b) : m(b, d) --> m(m(a, b), m(b, d))
if (C == B) {
  if ((CmpLHS == A && CmpRHS == D) || (match(D, m_Not(m_Specific(CmpLHS))) &&
                                       match(A, m_Not(m_Specific(CmpRHS)))))
    return {L.Flavor, SPNB_NA, false};
}
// b pred c ? m(a, b) : m(c, a) --> m(m(a, b), m(c, a))
// ~c pred ~b ? m(a, b) : m(c, a) --> m(m(a, b), m(c, a))
if (D == A) {
  if ((CmpLHS == B && CmpRHS == C) || (match(C, m_Not(m_Specific(CmpLHS))) &&
                                       match(B, m_Not(m_Specific(CmpRHS)))))
    return {L.Flavor, SPNB_NA, false};
}
// b pred d ? m(a, b) : m(a, d) --> m(m(a, b), m(a, d))
// ~d pred ~b ? m(a, b) : m(a, d) --> m(m(a, b), m(a, d))
if (C == A) {
  if ((CmpLHS == B && CmpRHS == D) || (match(D, m_Not(m_Specific(CmpLHS))) &&
                                       match(B, m_Not(m_Specific(CmpRHS)))))
    return {L.Flavor, SPNB_NA, false};
}

return {SPF_UNKNOWN, SPNB_NA, false};
5750}

5752/// If the input value is the result of a 'not' op, constant integer, or vector
5753/// splat of a constant integer, return the bitwise-not source value.
5754/// TODO: This could be extended to handle non-splat vector integer constants.
5755static Value *getNotValue(Value *V) {
Value *NotV;
if (match(V, m_Not(m_Value(NotV))))
  return NotV;

const APInt *C;
if (match(V, m_APInt(C)))
  return ConstantInt::get(V->getType(), ~(*C));

return nullptr;
5765}

5767/// Match non-obvious integer minimum and maximum sequences.
5768static SelectPatternResult matchMinMax(CmpInst::Predicate Pred,
                                     Value *CmpLHS, Value *CmpRHS,
                                     Value *TrueVal, Value *FalseVal,
                                     Value *&LHS, Value *&RHS,
                                     unsigned Depth) {
// Assume success. If there's no match, callers should not use these anyway.
LHS = TrueVal;
RHS = FalseVal;

SelectPatternResult SPR = matchClamp(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal);
if (SPR.Flavor != SelectPatternFlavor::SPF_UNKNOWN)
  return SPR;

SPR = matchMinMaxOfMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, Depth);
if (SPR.Flavor != SelectPatternFlavor::SPF_UNKNOWN)
  return SPR;

// Look through 'not' ops to find disguised min/max.
// (X > Y) ? ~X : ~Y ==> (~X < ~Y) ? ~X : ~Y ==> MIN(~X, ~Y)
// (X < Y) ? ~X : ~Y ==> (~X > ~Y) ? ~X : ~Y ==> MAX(~X, ~Y)
if (CmpLHS == getNotValue(TrueVal) && CmpRHS == getNotValue(FalseVal)) {
  switch (Pred) {
  case CmpInst::ICMP_SGT: return {SPF_SMIN, SPNB_NA, false};
  case CmpInst::ICMP_SLT: return {SPF_SMAX, SPNB_NA, false};
  case CmpInst::ICMP_UGT: return {SPF_UMIN, SPNB_NA, false};
  case CmpInst::ICMP_ULT: return {SPF_UMAX, SPNB_NA, false};
  default: break;
  }
}

// (X > Y) ? ~Y : ~X ==> (~X < ~Y) ? ~Y : ~X ==> MAX(~Y, ~X)
// (X < Y) ? ~Y : ~X ==> (~X > ~Y) ? ~Y : ~X ==> MIN(~Y, ~X)
if (CmpLHS == getNotValue(FalseVal) && CmpRHS == getNotValue(TrueVal)) {
  switch (Pred) {
  case CmpInst::ICMP_SGT: return {SPF_SMAX, SPNB_NA, false};
  case CmpInst::ICMP_SLT: return {SPF_SMIN, SPNB_NA, false};
  case CmpInst::ICMP_UGT: return {SPF_UMAX, SPNB_NA, false};
  case CmpInst::ICMP_ULT: return {SPF_UMIN, SPNB_NA, false};
  default: break;
  }
}

if (Pred != CmpInst::ICMP_SGT && Pred != CmpInst::ICMP_SLT)
  return {SPF_UNKNOWN, SPNB_NA, false};

// Z = X -nsw Y
// (X >s Y) ? 0 : Z ==> (Z >s 0) ? 0 : Z ==> SMIN(Z, 0)
// (X <s Y) ? 0 : Z ==> (Z <s 0) ? 0 : Z ==> SMAX(Z, 0)
if (match(TrueVal, m_Zero()) &&
    match(FalseVal, m_NSWSub(m_Specific(CmpLHS), m_Specific(CmpRHS))))
  return {Pred == CmpInst::ICMP_SGT ? SPF_SMIN : SPF_SMAX, SPNB_NA, false};

// Z = X -nsw Y
// (X >s Y) ? Z : 0 ==> (Z >s 0) ? Z : 0 ==> SMAX(Z, 0)
// (X <s Y) ? Z : 0 ==> (Z <s 0) ? Z : 0 ==> SMIN(Z, 0)
if (match(FalseVal, m_Zero()) &&
    match(TrueVal, m_NSWSub(m_Specific(CmpLHS), m_Specific(CmpRHS))))
  return {Pred == CmpInst::ICMP_SGT ? SPF_SMAX : SPF_SMIN, SPNB_NA, false};

const APInt *C1;
if (!match(CmpRHS, m_APInt(C1)))
  return {SPF_UNKNOWN, SPNB_NA, false};

// An unsigned min/max can be written with a signed compare.
const APInt *C2;
if ((CmpLHS == TrueVal && match(FalseVal, m_APInt(C2))) ||
    (CmpLHS == FalseVal && match(TrueVal, m_APInt(C2)))) {
  // Is the sign bit set?
  // (X <s 0) ? X : MAXVAL ==> (X >u MAXVAL) ? X : MAXVAL ==> UMAX
  // (X <s 0) ? MAXVAL : X ==> (X >u MAXVAL) ? MAXVAL : X ==> UMIN
  if (Pred == CmpInst::ICMP_SLT && C1->isNullValue() &&
      C2->isMaxSignedValue())
    return {CmpLHS == TrueVal ? SPF_UMAX : SPF_UMIN, SPNB_NA, false};

  // Is the sign bit clear?
  // (X >s -1) ? MINVAL : X ==> (X <u MINVAL) ? MINVAL : X ==> UMAX
  // (X >s -1) ? X : MINVAL ==> (X <u MINVAL) ? X : MINVAL ==> UMIN
  if (Pred == CmpInst::ICMP_SGT && C1->isAllOnesValue() &&
      C2->isMinSignedValue())
    return {CmpLHS == FalseVal ? SPF_UMAX : SPF_UMIN, SPNB_NA, false};
}

return {SPF_UNKNOWN, SPNB_NA, false};
5851}

5853bool llvm::isKnownNegation(const Value *X, const Value *Y, bool NeedNSW) {
assert(X && Y && "Invalid operand")(static_cast <bool> (X && Y && "Invalid operand"
) ? void (0) : __assert_fail ("X && Y && \"Invalid operand\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 5854, __extension__ __PRETTY_FUNCTION__));

// X = sub (0, Y) || X = sub nsw (0, Y)
if ((!NeedNSW && match(X, m_Sub(m_ZeroInt(), m_Specific(Y)))) ||
    (NeedNSW && match(X, m_NSWSub(m_ZeroInt(), m_Specific(Y)))))
  return true;

// Y = sub (0, X) || Y = sub nsw (0, X)
if ((!NeedNSW && match(Y, m_Sub(m_ZeroInt(), m_Specific(X)))) ||
    (NeedNSW && match(Y, m_NSWSub(m_ZeroInt(), m_Specific(X)))))
  return true;

// X = sub (A, B), Y = sub (B, A) || X = sub nsw (A, B), Y = sub nsw (B, A)
Value *A, *B;
return (!NeedNSW && (match(X, m_Sub(m_Value(A), m_Value(B))) &&
                      match(Y, m_Sub(m_Specific(B), m_Specific(A))))) ||
       (NeedNSW && (match(X, m_NSWSub(m_Value(A), m_Value(B))) &&
                     match(Y, m_NSWSub(m_Specific(B), m_Specific(A)))));
5872}

5874static SelectPatternResult matchSelectPattern(CmpInst::Predicate Pred,
                                            FastMathFlags FMF,
                                            Value *CmpLHS, Value *CmpRHS,
                                            Value *TrueVal, Value *FalseVal,
                                            Value *&LHS, Value *&RHS,
                                            unsigned Depth) {
if (CmpInst::isFPPredicate(Pred)) {
  // IEEE-754 ignores the sign of 0.0 in comparisons. So if the select has one
  // 0.0 operand, set the compare's 0.0 operands to that same value for the
  // purpose of identifying min/max. Disregard vector constants with undefined
  // elements because those can not be back-propagated for analysis.
  Value *OutputZeroVal = nullptr;
  if (match(TrueVal, m_AnyZeroFP()) && !match(FalseVal, m_AnyZeroFP()) &&
      !cast<Constant>(TrueVal)->containsUndefOrPoisonElement())
    OutputZeroVal = TrueVal;
  else if (match(FalseVal, m_AnyZeroFP()) && !match(TrueVal, m_AnyZeroFP()) &&
           !cast<Constant>(FalseVal)->containsUndefOrPoisonElement())
    OutputZeroVal = FalseVal;

  if (OutputZeroVal) {
    if (match(CmpLHS, m_AnyZeroFP()))
      CmpLHS = OutputZeroVal;
    if (match(CmpRHS, m_AnyZeroFP()))
      CmpRHS = OutputZeroVal;
  }
}

LHS = CmpLHS;
RHS = CmpRHS;

// Signed zero may return inconsistent results between implementations.
//  (0.0 <= -0.0) ? 0.0 : -0.0 // Returns 0.0
//  minNum(0.0, -0.0)          // May return -0.0 or 0.0 (IEEE 754-2008 5.3.1)
// Therefore, we behave conservatively and only proceed if at least one of the
// operands is known to not be zero or if we don't care about signed zero.
switch (Pred) {
default: break;
// FIXME: Include OGT/OLT/UGT/ULT.
case CmpInst::FCMP_OGE: case CmpInst::FCMP_OLE:
case CmpInst::FCMP_UGE: case CmpInst::FCMP_ULE:
  if (!FMF.noSignedZeros() && !isKnownNonZero(CmpLHS) &&
      !isKnownNonZero(CmpRHS))
    return {SPF_UNKNOWN, SPNB_NA, false};
}

SelectPatternNaNBehavior NaNBehavior = SPNB_NA;
bool Ordered = false;

// When given one NaN and one non-NaN input:
//   - maxnum/minnum (C99 fmaxf()/fminf()) return the non-NaN input.
//   - A simple C99 (a < b ? a : b) construction will return 'b' (as the
//     ordered comparison fails), which could be NaN or non-NaN.
// so here we discover exactly what NaN behavior is required/accepted.
if (CmpInst::isFPPredicate(Pred)) {
  bool LHSSafe = isKnownNonNaN(CmpLHS, FMF);
  bool RHSSafe = isKnownNonNaN(CmpRHS, FMF);

  if (LHSSafe && RHSSafe) {
    // Both operands are known non-NaN.
    NaNBehavior = SPNB_RETURNS_ANY;
  } else if (CmpInst::isOrdered(Pred)) {
    // An ordered comparison will return false when given a NaN, so it
    // returns the RHS.
    Ordered = true;
    if (LHSSafe)
      // LHS is non-NaN, so if RHS is NaN then NaN will be returned.
      NaNBehavior = SPNB_RETURNS_NAN;
    else if (RHSSafe)
      NaNBehavior = SPNB_RETURNS_OTHER;
    else
      // Completely unsafe.
      return {SPF_UNKNOWN, SPNB_NA, false};
  } else {
    Ordered = false;
    // An unordered comparison will return true when given a NaN, so it
    // returns the LHS.
    if (LHSSafe)
      // LHS is non-NaN, so if RHS is NaN then non-NaN will be returned.
      NaNBehavior = SPNB_RETURNS_OTHER;
    else if (RHSSafe)
      NaNBehavior = SPNB_RETURNS_NAN;
    else
      // Completely unsafe.
      return {SPF_UNKNOWN, SPNB_NA, false};
  }
}

if (TrueVal == CmpRHS && FalseVal == CmpLHS) {
  std::swap(CmpLHS, CmpRHS);
  Pred = CmpInst::getSwappedPredicate(Pred);
  if (NaNBehavior == SPNB_RETURNS_NAN)
    NaNBehavior = SPNB_RETURNS_OTHER;
  else if (NaNBehavior == SPNB_RETURNS_OTHER)
    NaNBehavior = SPNB_RETURNS_NAN;
  Ordered = !Ordered;
}

// ([if]cmp X, Y) ? X : Y
if (TrueVal == CmpLHS && FalseVal == CmpRHS) {
  switch (Pred) {
  default: return {SPF_UNKNOWN, SPNB_NA, false}; // Equality.
  case ICmpInst::ICMP_UGT:
  case ICmpInst::ICMP_UGE: return {SPF_UMAX, SPNB_NA, false};
  case ICmpInst::ICMP_SGT:
  case ICmpInst::ICMP_SGE: return {SPF_SMAX, SPNB_NA, false};
  case ICmpInst::ICMP_ULT:
  case ICmpInst::ICMP_ULE: return {SPF_UMIN, SPNB_NA, false};
  case ICmpInst::ICMP_SLT:
  case ICmpInst::ICMP_SLE: return {SPF_SMIN, SPNB_NA, false};
  case FCmpInst::FCMP_UGT:
  case FCmpInst::FCMP_UGE:
  case FCmpInst::FCMP_OGT:
  case FCmpInst::FCMP_OGE: return {SPF_FMAXNUM, NaNBehavior, Ordered};
  case FCmpInst::FCMP_ULT:
  case FCmpInst::FCMP_ULE:
  case FCmpInst::FCMP_OLT:
  case FCmpInst::FCMP_OLE: return {SPF_FMINNUM, NaNBehavior, Ordered};
  }
}

if (isKnownNegation(TrueVal, FalseVal)) {
  // Sign-extending LHS does not change its sign, so TrueVal/FalseVal can
  // match against either LHS or sext(LHS).
  auto MaybeSExtCmpLHS =
      m_CombineOr(m_Specific(CmpLHS), m_SExt(m_Specific(CmpLHS)));
  auto ZeroOrAllOnes = m_CombineOr(m_ZeroInt(), m_AllOnes());
  auto ZeroOrOne = m_CombineOr(m_ZeroInt(), m_One());
  if (match(TrueVal, MaybeSExtCmpLHS)) {
    // Set the return values. If the compare uses the negated value (-X >s 0),
    // swap the return values because the negated value is always 'RHS'.
    LHS = TrueVal;
    RHS = FalseVal;
    if (match(CmpLHS, m_Neg(m_Specific(FalseVal))))
      std::swap(LHS, RHS);

    // (X >s 0) ? X : -X or (X >s -1) ? X : -X --> ABS(X)
    // (-X >s 0) ? -X : X or (-X >s -1) ? -X : X --> ABS(X)
    if (Pred == ICmpInst::ICMP_SGT && match(CmpRHS, ZeroOrAllOnes))
      return {SPF_ABS, SPNB_NA, false};

    // (X >=s 0) ? X : -X or (X >=s 1) ? X : -X --> ABS(X)
    if (Pred == ICmpInst::ICMP_SGE && match(CmpRHS, ZeroOrOne))
      return {SPF_ABS, SPNB_NA, false};

    // (X <s 0) ? X : -X or (X <s 1) ? X : -X --> NABS(X)
    // (-X <s 0) ? -X : X or (-X <s 1) ? -X : X --> NABS(X)
    if (Pred == ICmpInst::ICMP_SLT && match(CmpRHS, ZeroOrOne))
      return {SPF_NABS, SPNB_NA, false};
  }
  else if (match(FalseVal, MaybeSExtCmpLHS)) {
    // Set the return values. If the compare uses the negated value (-X >s 0),
    // swap the return values because the negated value is always 'RHS'.
    LHS = FalseVal;
    RHS = TrueVal;
    if (match(CmpLHS, m_Neg(m_Specific(TrueVal))))
      std::swap(LHS, RHS);

    // (X >s 0) ? -X : X or (X >s -1) ? -X : X --> NABS(X)
    // (-X >s 0) ? X : -X or (-X >s -1) ? X : -X --> NABS(X)
    if (Pred == ICmpInst::ICMP_SGT && match(CmpRHS, ZeroOrAllOnes))
      return {SPF_NABS, SPNB_NA, false};

    // (X <s 0) ? -X : X or (X <s 1) ? -X : X --> ABS(X)
    // (-X <s 0) ? X : -X or (-X <s 1) ? X : -X --> ABS(X)
    if (Pred == ICmpInst::ICMP_SLT && match(CmpRHS, ZeroOrOne))
      return {SPF_ABS, SPNB_NA, false};
  }
}

if (CmpInst::isIntPredicate(Pred))
  return matchMinMax(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, LHS, RHS, Depth);

// According to (IEEE 754-2008 5.3.1), minNum(0.0, -0.0) and similar
// may return either -0.0 or 0.0, so fcmp/select pair has stricter
// semantics than minNum. Be conservative in such case.
if (NaNBehavior != SPNB_RETURNS_ANY ||
    (!FMF.noSignedZeros() && !isKnownNonZero(CmpLHS) &&
     !isKnownNonZero(CmpRHS)))
  return {SPF_UNKNOWN, SPNB_NA, false};

return matchFastFloatClamp(Pred, CmpLHS, CmpRHS, TrueVal, FalseVal, LHS, RHS);
6055}

6057/// Helps to match a select pattern in case of a type mismatch.
6058///
6059/// The function processes the case when type of true and false values of a
6060/// select instruction differs from type of the cmp instruction operands because
6061/// of a cast instruction. The function checks if it is legal to move the cast
6062/// operation after "select". If yes, it returns the new second value of
6063/// "select" (with the assumption that cast is moved):
6064/// 1. As operand of cast instruction when both values of "select" are same cast
6065/// instructions.
6066/// 2. As restored constant (by applying reverse cast operation) when the first
6067/// value of the "select" is a cast operation and the second value is a
6068/// constant.
6069/// NOTE: We return only the new second value because the first value could be
6070/// accessed as operand of cast instruction.
6071static Value *lookThroughCast(CmpInst *CmpI, Value *V1, Value *V2,
                            Instruction::CastOps *CastOp) {
auto *Cast1 = dyn_cast<CastInst>(V1);
if (!Cast1)
  return nullptr;

*CastOp = Cast1->getOpcode();
Type *SrcTy = Cast1->getSrcTy();
if (auto *Cast2 = dyn_cast<CastInst>(V2)) {
  // If V1 and V2 are both the same cast from the same type, look through V1.
  if (*CastOp == Cast2->getOpcode() && SrcTy == Cast2->getSrcTy())
    return Cast2->getOperand(0);
  return nullptr;
}

auto *C = dyn_cast<Constant>(V2);
if (!C)
  return nullptr;

Constant *CastedTo = nullptr;
switch (*CastOp) {
case Instruction::ZExt:
  if (CmpI->isUnsigned())
    CastedTo = ConstantExpr::getTrunc(C, SrcTy);
  break;
case Instruction::SExt:
  if (CmpI->isSigned())
    CastedTo = ConstantExpr::getTrunc(C, SrcTy, true);
  break;
case Instruction::Trunc:
  Constant *CmpConst;
  if (match(CmpI->getOperand(1), m_Constant(CmpConst)) &&
      CmpConst->getType() == SrcTy) {
    // Here we have the following case:
    //
    //   %cond = cmp iN %x, CmpConst
    //   %tr = trunc iN %x to iK
    //   %narrowsel = select i1 %cond, iK %t, iK C
    //
    // We can always move trunc after select operation:
    //
    //   %cond = cmp iN %x, CmpConst
    //   %widesel = select i1 %cond, iN %x, iN CmpConst
    //   %tr = trunc iN %widesel to iK
    //
    // Note that C could be extended in any way because we don't care about
    // upper bits after truncation. It can't be abs pattern, because it would
    // look like:
    //
    //   select i1 %cond, x, -x.
    //
    // So only min/max pattern could be matched. Such match requires widened C
    // == CmpConst. That is why set widened C = CmpConst, condition trunc
    // CmpConst == C is checked below.
    CastedTo = CmpConst;
  } else {
    CastedTo = ConstantExpr::getIntegerCast(C, SrcTy, CmpI->isSigned());
  }
  break;
case Instruction::FPTrunc:
  CastedTo = ConstantExpr::getFPExtend(C, SrcTy, true);
  break;
case Instruction::FPExt:
  CastedTo = ConstantExpr::getFPTrunc(C, SrcTy, true);
  break;
case Instruction::FPToUI:
  CastedTo = ConstantExpr::getUIToFP(C, SrcTy, true);
  break;
case Instruction::FPToSI:
  CastedTo = ConstantExpr::getSIToFP(C, SrcTy, true);
  break;
case Instruction::UIToFP:
  CastedTo = ConstantExpr::getFPToUI(C, SrcTy, true);
  break;
case Instruction::SIToFP:
  CastedTo = ConstantExpr::getFPToSI(C, SrcTy, true);
  break;
default:
  break;
}

if (!CastedTo)
  return nullptr;

// Make sure the cast doesn't lose any information.
Constant *CastedBack =
    ConstantExpr::getCast(*CastOp, CastedTo, C->getType(), true);
if (CastedBack != C)
  return nullptr;

return CastedTo;
6162}

6164SelectPatternResult llvm::matchSelectPattern(Value *V, Value *&LHS, Value *&RHS,
                                           Instruction::CastOps *CastOp,
                                           unsigned Depth) {
if (Depth >= MaxAnalysisRecursionDepth)
  return {SPF_UNKNOWN, SPNB_NA, false};

SelectInst *SI = dyn_cast<SelectInst>(V);
if (!SI) return {SPF_UNKNOWN, SPNB_NA, false};

CmpInst *CmpI = dyn_cast<CmpInst>(SI->getCondition());
if (!CmpI) return {SPF_UNKNOWN, SPNB_NA, false};

Value *TrueVal = SI->getTrueValue();
Value *FalseVal = SI->getFalseValue();

return llvm::matchDecomposedSelectPattern(CmpI, TrueVal, FalseVal, LHS, RHS,
                                          CastOp, Depth);
6181}

6183SelectPatternResult llvm::matchDecomposedSelectPattern(
  CmpInst *CmpI, Value *TrueVal, Value *FalseVal, Value *&LHS, Value *&RHS,
  Instruction::CastOps *CastOp, unsigned Depth) {
CmpInst::Predicate Pred = CmpI->getPredicate();
Value *CmpLHS = CmpI->getOperand(0);
Value *CmpRHS = CmpI->getOperand(1);
FastMathFlags FMF;
if (isa<FPMathOperator>(CmpI))
  FMF = CmpI->getFastMathFlags();

// Bail out early.
if (CmpI->isEquality())
  return {SPF_UNKNOWN, SPNB_NA, false};

// Deal with type mismatches.
if (CastOp && CmpLHS->getType() != TrueVal->getType()) {
  if (Value *C = lookThroughCast(CmpI, TrueVal, FalseVal, CastOp)) {
    // If this is a potential fmin/fmax with a cast to integer, then ignore
    // -0.0 because there is no corresponding integer value.
    if (*CastOp == Instruction::FPToSI || *CastOp == Instruction::FPToUI)
      FMF.setNoSignedZeros();
    return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS,
                                cast<CastInst>(TrueVal)->getOperand(0), C,
                                LHS, RHS, Depth);
  }
  if (Value *C = lookThroughCast(CmpI, FalseVal, TrueVal, CastOp)) {
    // If this is a potential fmin/fmax with a cast to integer, then ignore
    // -0.0 because there is no corresponding integer value.
    if (*CastOp == Instruction::FPToSI || *CastOp == Instruction::FPToUI)
      FMF.setNoSignedZeros();
    return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS,
                                C, cast<CastInst>(FalseVal)->getOperand(0),
                                LHS, RHS, Depth);
  }
}
return ::matchSelectPattern(Pred, FMF, CmpLHS, CmpRHS, TrueVal, FalseVal,
                            LHS, RHS, Depth);
6220}

6222CmpInst::Predicate llvm::getMinMaxPred(SelectPatternFlavor SPF, bool Ordered) {
if (SPF == SPF_SMIN) return ICmpInst::ICMP_SLT;
if (SPF == SPF_UMIN) return ICmpInst::ICMP_ULT;
if (SPF == SPF_SMAX) return ICmpInst::ICMP_SGT;
if (SPF == SPF_UMAX) return ICmpInst::ICMP_UGT;
if (SPF == SPF_FMINNUM)
  return Ordered ? FCmpInst::FCMP_OLT : FCmpInst::FCMP_ULT;
if (SPF == SPF_FMAXNUM)
  return Ordered ? FCmpInst::FCMP_OGT : FCmpInst::FCMP_UGT;
llvm_unreachable("unhandled!")::llvm::llvm_unreachable_internal("unhandled!", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6231);
6232}

6234SelectPatternFlavor llvm::getInverseMinMaxFlavor(SelectPatternFlavor SPF) {
if (SPF == SPF_SMIN) return SPF_SMAX;
if (SPF == SPF_UMIN) return SPF_UMAX;
if (SPF == SPF_SMAX) return SPF_SMIN;
if (SPF == SPF_UMAX) return SPF_UMIN;
llvm_unreachable("unhandled!")::llvm::llvm_unreachable_internal("unhandled!", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6239);
6240}

6242Intrinsic::ID llvm::getInverseMinMaxIntrinsic(Intrinsic::ID MinMaxID) {
switch (MinMaxID) {
case Intrinsic::smax: return Intrinsic::smin;
case Intrinsic::smin: return Intrinsic::smax;
case Intrinsic::umax: return Intrinsic::umin;
case Intrinsic::umin: return Intrinsic::umax;
default: llvm_unreachable("Unexpected intrinsic")::llvm::llvm_unreachable_internal("Unexpected intrinsic", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6248);
}
6250}

6252CmpInst::Predicate llvm::getInverseMinMaxPred(SelectPatternFlavor SPF) {
return getMinMaxPred(getInverseMinMaxFlavor(SPF));
6254}

6256APInt llvm::getMinMaxLimit(SelectPatternFlavor SPF, unsigned BitWidth) {
switch (SPF) {
case SPF_SMAX: return APInt::getSignedMaxValue(BitWidth);
case SPF_SMIN: return APInt::getSignedMinValue(BitWidth);
case SPF_UMAX: return APInt::getMaxValue(BitWidth);
case SPF_UMIN: return APInt::getMinValue(BitWidth);
default: llvm_unreachable("Unexpected flavor")::llvm::llvm_unreachable_internal("Unexpected flavor", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6262);
}
6264}

6266std::pair<Intrinsic::ID, bool>
6267llvm::canConvertToMinOrMaxIntrinsic(ArrayRef<Value *> VL) {
// Check if VL contains select instructions that can be folded into a min/max
// vector intrinsic and return the intrinsic if it is possible.
// TODO: Support floating point min/max.
bool AllCmpSingleUse = true;
SelectPatternResult SelectPattern;
SelectPattern.Flavor = SPF_UNKNOWN;
if (all_of(VL, [&SelectPattern, &AllCmpSingleUse](Value *I) {
      Value *LHS, *RHS;
      auto CurrentPattern = matchSelectPattern(I, LHS, RHS);
      if (!SelectPatternResult::isMinOrMax(CurrentPattern.Flavor) ||
          CurrentPattern.Flavor == SPF_FMINNUM ||
          CurrentPattern.Flavor == SPF_FMAXNUM ||
          !I->getType()->isIntOrIntVectorTy())
        return false;
      if (SelectPattern.Flavor != SPF_UNKNOWN &&
          SelectPattern.Flavor != CurrentPattern.Flavor)
        return false;
      SelectPattern = CurrentPattern;
      AllCmpSingleUse &=
          match(I, m_Select(m_OneUse(m_Value()), m_Value(), m_Value()));
      return true;
    })) {
  switch (SelectPattern.Flavor) {
  case SPF_SMIN:
    return {Intrinsic::smin, AllCmpSingleUse};
  case SPF_UMIN:
    return {Intrinsic::umin, AllCmpSingleUse};
  case SPF_SMAX:
    return {Intrinsic::smax, AllCmpSingleUse};
  case SPF_UMAX:
    return {Intrinsic::umax, AllCmpSingleUse};
  default:
    llvm_unreachable("unexpected select pattern flavor")::llvm::llvm_unreachable_internal("unexpected select pattern flavor"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6300);
  }
}
return {Intrinsic::not_intrinsic, false};
6304}

6306bool llvm::matchSimpleRecurrence(const PHINode *P, BinaryOperator *&BO,
                               Value *&Start, Value *&Step) {
// Handle the case of a simple two-predecessor recurrence PHI.
// There's a lot more that could theoretically be done here, but
// this is sufficient to catch some interesting cases.
if (P->getNumIncomingValues() != 2)
  return false;

for (unsigned i = 0; i != 2; ++i) {
  Value *L = P->getIncomingValue(i);
  Value *R = P->getIncomingValue(!i);
  Operator *LU = dyn_cast<Operator>(L);
  if (!LU)
    continue;
  unsigned Opcode = LU->getOpcode();

  switch (Opcode) {
  default:
    continue;
  // TODO: Expand list -- xor, div, gep, uaddo, etc..
  case Instruction::LShr:
  case Instruction::AShr:
  case Instruction::Shl:
  case Instruction::Add:
  case Instruction::Sub:
  case Instruction::And:
  case Instruction::Or:
  case Instruction::Mul: {
    Value *LL = LU->getOperand(0);
    Value *LR = LU->getOperand(1);
    // Find a recurrence.
    if (LL == P)
      L = LR;
    else if (LR == P)
      L = LL;
    else
      continue; // Check for recurrence with L and R flipped.

    break; // Match!
  }
  };

  // We have matched a recurrence of the form:
  //   %iv = [R, %entry], [%iv.next, %backedge]
  //   %iv.next = binop %iv, L
  // OR
  //   %iv = [R, %entry], [%iv.next, %backedge]
  //   %iv.next = binop L, %iv
  BO = cast<BinaryOperator>(LU);
  Start = R;
  Step = L;
  return true;
}
return false;
6360}

6362bool llvm::matchSimpleRecurrence(const BinaryOperator *I, PHINode *&P,
                               Value *&Start, Value *&Step) {
BinaryOperator *BO = nullptr;
P = dyn_cast<PHINode>(I->getOperand(0));
if (!P)
  P = dyn_cast<PHINode>(I->getOperand(1));
return P && matchSimpleRecurrence(P, BO, Start, Step) && BO == I;
6369}

6371/// Return true if "icmp Pred LHS RHS" is always true.
6372static bool isTruePredicate(CmpInst::Predicate Pred, const Value *LHS,
                          const Value *RHS, const DataLayout &DL,
                          unsigned Depth) {
assert(!LHS->getType()->isVectorTy() && "TODO: extend to handle vectors!")(static_cast <bool> (!LHS->getType()->isVectorTy(
) && "TODO: extend to handle vectors!") ? void (0) : __assert_fail
 ("!LHS->getType()->isVectorTy() && \"TODO: extend to handle vectors!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6375, __extension__ __PRETTY_FUNCTION__));
if (ICmpInst::isTrueWhenEqual(Pred) && LHS == RHS)
  return true;

switch (Pred) {
default:
  return false;

case CmpInst::ICMP_SLE: {
  const APInt *C;

  // LHS s<= LHS +_{nsw} C   if C >= 0
  if (match(RHS, m_NSWAdd(m_Specific(LHS), m_APInt(C))))
    return !C->isNegative();
  return false;
}

case CmpInst::ICMP_ULE: {
  const APInt *C;

  // LHS u<= LHS +_{nuw} C   for any C
  if (match(RHS, m_NUWAdd(m_Specific(LHS), m_APInt(C))))
    return true;

  // Match A to (X +_{nuw} CA) and B to (X +_{nuw} CB)
  auto MatchNUWAddsToSameValue = [&](const Value *A, const Value *B,
                                     const Value *&X,
                                     const APInt *&CA, const APInt *&CB) {
    if (match(A, m_NUWAdd(m_Value(X), m_APInt(CA))) &&
        match(B, m_NUWAdd(m_Specific(X), m_APInt(CB))))
      return true;

    // If X & C == 0 then (X | C) == X +_{nuw} C
    if (match(A, m_Or(m_Value(X), m_APInt(CA))) &&
        match(B, m_Or(m_Specific(X), m_APInt(CB)))) {
      KnownBits Known(CA->getBitWidth());
      computeKnownBits(X, Known, DL, Depth + 1, /*AC*/ nullptr,
                       /*CxtI*/ nullptr, /*DT*/ nullptr);
      if (CA->isSubsetOf(Known.Zero) && CB->isSubsetOf(Known.Zero))
        return true;
    }

    return false;
  };

  const Value *X;
  const APInt *CLHS, *CRHS;
  if (MatchNUWAddsToSameValue(LHS, RHS, X, CLHS, CRHS))
    return CLHS->ule(*CRHS);

  return false;
}
}
6428}

6430/// Return true if "icmp Pred BLHS BRHS" is true whenever "icmp Pred
6431/// ALHS ARHS" is true.  Otherwise, return None.
6432static Optional<bool>
6433isImpliedCondOperands(CmpInst::Predicate Pred, const Value *ALHS,
                    const Value *ARHS, const Value *BLHS, const Value *BRHS,
                    const DataLayout &DL, unsigned Depth) {
switch (Pred) {
default:
  return None;

case CmpInst::ICMP_SLT:
case CmpInst::ICMP_SLE:
  if (isTruePredicate(CmpInst::ICMP_SLE, BLHS, ALHS, DL, Depth) &&
      isTruePredicate(CmpInst::ICMP_SLE, ARHS, BRHS, DL, Depth))
    return true;
  return None;

case CmpInst::ICMP_ULT:
case CmpInst::ICMP_ULE:
  if (isTruePredicate(CmpInst::ICMP_ULE, BLHS, ALHS, DL, Depth) &&
      isTruePredicate(CmpInst::ICMP_ULE, ARHS, BRHS, DL, Depth))
    return true;
  return None;
}
6454}

6456/// Return true if the operands of the two compares match.  IsSwappedOps is true
6457/// when the operands match, but are swapped.
6458static bool isMatchingOps(const Value *ALHS, const Value *ARHS,
                        const Value *BLHS, const Value *BRHS,
                        bool &IsSwappedOps) {

bool IsMatchingOps = (ALHS == BLHS && ARHS == BRHS);
IsSwappedOps = (ALHS == BRHS && ARHS == BLHS);
return IsMatchingOps || IsSwappedOps;
6465}

6467/// Return true if "icmp1 APred X, Y" implies "icmp2 BPred X, Y" is true.
6468/// Return false if "icmp1 APred X, Y" implies "icmp2 BPred X, Y" is false.
6469/// Otherwise, return None if we can't infer anything.
6470static Optional<bool> isImpliedCondMatchingOperands(CmpInst::Predicate APred,
                                                  CmpInst::Predicate BPred,
                                                  bool AreSwappedOps) {
// Canonicalize the predicate as if the operands were not commuted.
if (AreSwappedOps)
  BPred = ICmpInst::getSwappedPredicate(BPred);

if (CmpInst::isImpliedTrueByMatchingCmp(APred, BPred))
  return true;
if (CmpInst::isImpliedFalseByMatchingCmp(APred, BPred))
  return false;

return None;
6483}

6485/// Return true if "icmp APred X, C1" implies "icmp BPred X, C2" is true.
6486/// Return false if "icmp APred X, C1" implies "icmp BPred X, C2" is false.
6487/// Otherwise, return None if we can't infer anything.
6488static Optional<bool>
6489isImpliedCondMatchingImmOperands(CmpInst::Predicate APred,
                               const ConstantInt *C1,
                               CmpInst::Predicate BPred,
                               const ConstantInt *C2) {
ConstantRange DomCR =
    ConstantRange::makeExactICmpRegion(APred, C1->getValue());
ConstantRange CR = ConstantRange::makeExactICmpRegion(BPred, C2->getValue());
ConstantRange Intersection = DomCR.intersectWith(CR);
ConstantRange Difference = DomCR.difference(CR);
if (Intersection.isEmptySet())
  return false;
if (Difference.isEmptySet())
  return true;
return None;
6503}

6505/// Return true if LHS implies RHS is true.  Return false if LHS implies RHS is
6506/// false.  Otherwise, return None if we can't infer anything.
6507static Optional<bool> isImpliedCondICmps(const ICmpInst *LHS,
                                       CmpInst::Predicate BPred,
                                       const Value *BLHS, const Value *BRHS,
                                       const DataLayout &DL, bool LHSIsTrue,
                                       unsigned Depth) {
Value *ALHS = LHS->getOperand(0);
Value *ARHS = LHS->getOperand(1);

// The rest of the logic assumes the LHS condition is true.  If that's not the
// case, invert the predicate to make it so.
CmpInst::Predicate APred =
    LHSIsTrue ? LHS->getPredicate() : LHS->getInversePredicate();

// Can we infer anything when the two compares have matching operands?
bool AreSwappedOps;
if (isMatchingOps(ALHS, ARHS, BLHS, BRHS, AreSwappedOps)) {
  if (Optional<bool> Implication = isImpliedCondMatchingOperands(
          APred, BPred, AreSwappedOps))
    return Implication;
  // No amount of additional analysis will infer the second condition, so
  // early exit.
  return None;
}

// Can we infer anything when the LHS operands match and the RHS operands are
// constants (not necessarily matching)?
if (ALHS == BLHS && isa<ConstantInt>(ARHS) && isa<ConstantInt>(BRHS)) {
  if (Optional<bool> Implication = isImpliedCondMatchingImmOperands(
          APred, cast<ConstantInt>(ARHS), BPred, cast<ConstantInt>(BRHS)))
    return Implication;
  // No amount of additional analysis will infer the second condition, so
  // early exit.
  return None;
}

if (APred == BPred)
  return isImpliedCondOperands(APred, ALHS, ARHS, BLHS, BRHS, DL, Depth);
return None;
6545}

6547/// Return true if LHS implies RHS is true.  Return false if LHS implies RHS is
6548/// false.  Otherwise, return None if we can't infer anything.  We expect the
6549/// RHS to be an icmp and the LHS to be an 'and', 'or', or a 'select' instruction.
6550static Optional<bool>
6551isImpliedCondAndOr(const Instruction *LHS, CmpInst::Predicate RHSPred,
                 const Value *RHSOp0, const Value *RHSOp1,
                 const DataLayout &DL, bool LHSIsTrue, unsigned Depth) {
// The LHS must be an 'or', 'and', or a 'select' instruction.
assert((LHS->getOpcode() == Instruction::And ||(static_cast <bool> ((LHS->getOpcode() == Instruction
::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode
() == Instruction::Select) && "Expected LHS to be 'and', 'or', or 'select'."
) ? void (0) : __assert_fail ("(LHS->getOpcode() == Instruction::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode() == Instruction::Select) && \"Expected LHS to be 'and', 'or', or 'select'.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6558, __extension__ __PRETTY_FUNCTION__))
        LHS->getOpcode() == Instruction::Or ||(static_cast <bool> ((LHS->getOpcode() == Instruction
::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode
() == Instruction::Select) && "Expected LHS to be 'and', 'or', or 'select'."
) ? void (0) : __assert_fail ("(LHS->getOpcode() == Instruction::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode() == Instruction::Select) && \"Expected LHS to be 'and', 'or', or 'select'.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6558, __extension__ __PRETTY_FUNCTION__))
        LHS->getOpcode() == Instruction::Select) &&(static_cast <bool> ((LHS->getOpcode() == Instruction
::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode
() == Instruction::Select) && "Expected LHS to be 'and', 'or', or 'select'."
) ? void (0) : __assert_fail ("(LHS->getOpcode() == Instruction::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode() == Instruction::Select) && \"Expected LHS to be 'and', 'or', or 'select'.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6558, __extension__ __PRETTY_FUNCTION__))
       "Expected LHS to be 'and', 'or', or 'select'.")(static_cast <bool> ((LHS->getOpcode() == Instruction
::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode
() == Instruction::Select) && "Expected LHS to be 'and', 'or', or 'select'."
) ? void (0) : __assert_fail ("(LHS->getOpcode() == Instruction::And || LHS->getOpcode() == Instruction::Or || LHS->getOpcode() == Instruction::Select) && \"Expected LHS to be 'and', 'or', or 'select'.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6558, __extension__ __PRETTY_FUNCTION__));

assert(Depth <= MaxAnalysisRecursionDepth && "Hit recursion limit")(static_cast <bool> (Depth <= MaxAnalysisRecursionDepth
 && "Hit recursion limit") ? void (0) : __assert_fail
 ("Depth <= MaxAnalysisRecursionDepth && \"Hit recursion limit\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6560, __extension__ __PRETTY_FUNCTION__));

// If the result of an 'or' is false, then we know both legs of the 'or' are
// false.  Similarly, if the result of an 'and' is true, then we know both
// legs of the 'and' are true.
const Value *ALHS, *ARHS;
if ((!LHSIsTrue && match(LHS, m_LogicalOr(m_Value(ALHS), m_Value(ARHS)))) ||
    (LHSIsTrue && match(LHS, m_LogicalAnd(m_Value(ALHS), m_Value(ARHS))))) {
  // FIXME: Make this non-recursion.
  if (Optional<bool> Implication = isImpliedCondition(
          ALHS, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue, Depth + 1))
    return Implication;
  if (Optional<bool> Implication = isImpliedCondition(
          ARHS, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue, Depth + 1))
    return Implication;
  return None;
}
return None;
6578}

6580Optional<bool>
6581llvm::isImpliedCondition(const Value *LHS, CmpInst::Predicate RHSPred,
                       const Value *RHSOp0, const Value *RHSOp1,
                       const DataLayout &DL, bool LHSIsTrue, unsigned Depth) {
// Bail out when we hit the limit.
if (Depth == MaxAnalysisRecursionDepth)
  return None;

// A mismatch occurs when we compare a scalar cmp to a vector cmp, for
// example.
if (RHSOp0->getType()->isVectorTy() != LHS->getType()->isVectorTy())
  return None;

Type *OpTy = LHS->getType();
assert(OpTy->isIntOrIntVectorTy(1) && "Expected integer type only!")(static_cast <bool> (OpTy->isIntOrIntVectorTy(1) &&
 "Expected integer type only!") ? void (0) : __assert_fail ("OpTy->isIntOrIntVectorTy(1) && \"Expected integer type only!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6594, __extension__ __PRETTY_FUNCTION__));

// FIXME: Extending the code below to handle vectors.
if (OpTy->isVectorTy())
  return None;

assert(OpTy->isIntegerTy(1) && "implied by above")(static_cast <bool> (OpTy->isIntegerTy(1) &&
 "implied by above") ? void (0) : __assert_fail ("OpTy->isIntegerTy(1) && \"implied by above\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6600, __extension__ __PRETTY_FUNCTION__));

// Both LHS and RHS are icmps.
const ICmpInst *LHSCmp = dyn_cast<ICmpInst>(LHS);
if (LHSCmp)
  return isImpliedCondICmps(LHSCmp, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue,
                            Depth);

/// The LHS should be an 'or', 'and', or a 'select' instruction.  We expect
/// the RHS to be an icmp.
/// FIXME: Add support for and/or/select on the RHS.
if (const Instruction *LHSI = dyn_cast<Instruction>(LHS)) {
  if ((LHSI->getOpcode() == Instruction::And ||
       LHSI->getOpcode() == Instruction::Or ||
       LHSI->getOpcode() == Instruction::Select))
    return isImpliedCondAndOr(LHSI, RHSPred, RHSOp0, RHSOp1, DL, LHSIsTrue,
                              Depth);
}
return None;
6619}

6621Optional<bool> llvm::isImpliedCondition(const Value *LHS, const Value *RHS,
                                      const DataLayout &DL, bool LHSIsTrue,
                                      unsigned Depth) {
// LHS ==> RHS by definition
if (LHS == RHS)
  return LHSIsTrue;

const ICmpInst *RHSCmp = dyn_cast<ICmpInst>(RHS);
if (RHSCmp)
  return isImpliedCondition(LHS, RHSCmp->getPredicate(),
                            RHSCmp->getOperand(0), RHSCmp->getOperand(1), DL,
                            LHSIsTrue, Depth);
return None;
6634}

6636// Returns a pair (Condition, ConditionIsTrue), where Condition is a branch
6637// condition dominating ContextI or nullptr, if no condition is found.
6638static std::pair<Value *, bool>
6639getDomPredecessorCondition(const Instruction *ContextI) {
if (!ContextI || !ContextI->getParent())
  return {nullptr, false};

// TODO: This is a poor/cheap way to determine dominance. Should we use a
// dominator tree (eg, from a SimplifyQuery) instead?
const BasicBlock *ContextBB = ContextI->getParent();
const BasicBlock *PredBB = ContextBB->getSinglePredecessor();
if (!PredBB)
  return {nullptr, false};

// We need a conditional branch in the predecessor.
Value *PredCond;
BasicBlock *TrueBB, *FalseBB;
if (!match(PredBB->getTerminator(), m_Br(m_Value(PredCond), TrueBB, FalseBB)))
  return {nullptr, false};

// The branch should get simplified. Don't bother simplifying this condition.
if (TrueBB == FalseBB)
  return {nullptr, false};

assert((TrueBB == ContextBB || FalseBB == ContextBB) &&(static_cast <bool> ((TrueBB == ContextBB || FalseBB ==
 ContextBB) && "Predecessor block does not point to successor?"
) ? void (0) : __assert_fail ("(TrueBB == ContextBB || FalseBB == ContextBB) && \"Predecessor block does not point to successor?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6661, __extension__ __PRETTY_FUNCTION__))
       "Predecessor block does not point to successor?")(static_cast <bool> ((TrueBB == ContextBB || FalseBB ==
 ContextBB) && "Predecessor block does not point to successor?"
) ? void (0) : __assert_fail ("(TrueBB == ContextBB || FalseBB == ContextBB) && \"Predecessor block does not point to successor?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6661, __extension__ __PRETTY_FUNCTION__));

// Is this condition implied by the predecessor condition?
return {PredCond, TrueBB == ContextBB};
6665}

6667Optional<bool> llvm::isImpliedByDomCondition(const Value *Cond,
                                           const Instruction *ContextI,
                                           const DataLayout &DL) {
assert(Cond->getType()->isIntOrIntVectorTy(1) && "Condition must be bool")(static_cast <bool> (Cond->getType()->isIntOrIntVectorTy
(1) && "Condition must be bool") ? void (0) : __assert_fail
 ("Cond->getType()->isIntOrIntVectorTy(1) && \"Condition must be bool\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6670, __extension__ __PRETTY_FUNCTION__));
auto PredCond = getDomPredecessorCondition(ContextI);
if (PredCond.first)
  return isImpliedCondition(PredCond.first, Cond, DL, PredCond.second);
return None;
6675}

6677Optional<bool> llvm::isImpliedByDomCondition(CmpInst::Predicate Pred,
                                           const Value *LHS, const Value *RHS,
                                           const Instruction *ContextI,
                                           const DataLayout &DL) {
auto PredCond = getDomPredecessorCondition(ContextI);
if (PredCond.first)
  return isImpliedCondition(PredCond.first, Pred, LHS, RHS, DL,
                            PredCond.second);
return None;
6686}

6688static void setLimitsForBinOp(const BinaryOperator &BO, APInt &Lower,
                            APInt &Upper, const InstrInfoQuery &IIQ) {
unsigned Width = Lower.getBitWidth();
const APInt *C;
switch (BO.getOpcode()) {
case Instruction::Add:
  if (match(BO.getOperand(1), m_APInt(C)) && !C->isNullValue()) {
    // FIXME: If we have both nuw and nsw, we should reduce the range further.
    if (IIQ.hasNoUnsignedWrap(cast<OverflowingBinaryOperator>(&BO))) {
      // 'add nuw x, C' produces [C, UINT_MAX].
      Lower = *C;
    } else if (IIQ.hasNoSignedWrap(cast<OverflowingBinaryOperator>(&BO))) {
      if (C->isNegative()) {
        // 'add nsw x, -C' produces [SINT_MIN, SINT_MAX - C].
        Lower = APInt::getSignedMinValue(Width);
        Upper = APInt::getSignedMaxValue(Width) + *C + 1;
      } else {
        // 'add nsw x, +C' produces [SINT_MIN + C, SINT_MAX].
        Lower = APInt::getSignedMinValue(Width) + *C;
        Upper = APInt::getSignedMaxValue(Width) + 1;
      }
    }
  }
  break;

case Instruction::And:
  if (match(BO.getOperand(1), m_APInt(C)))
    // 'and x, C' produces [0, C].
    Upper = *C + 1;
  break;

case Instruction::Or:
  if (match(BO.getOperand(1), m_APInt(C)))
    // 'or x, C' produces [C, UINT_MAX].
    Lower = *C;
  break;

case Instruction::AShr:
  if (match(BO.getOperand(1), m_APInt(C)) && C->ult(Width)) {
    // 'ashr x, C' produces [INT_MIN >> C, INT_MAX >> C].
    Lower = APInt::getSignedMinValue(Width).ashr(*C);
    Upper = APInt::getSignedMaxValue(Width).ashr(*C) + 1;
  } else if (match(BO.getOperand(0), m_APInt(C))) {
    unsigned ShiftAmount = Width - 1;
    if (!C->isNullValue() && IIQ.isExact(&BO))
      ShiftAmount = C->countTrailingZeros();
    if (C->isNegative()) {
      // 'ashr C, x' produces [C, C >> (Width-1)]
      Lower = *C;
      Upper = C->ashr(ShiftAmount) + 1;
    } else {
      // 'ashr C, x' produces [C >> (Width-1), C]
      Lower = C->ashr(ShiftAmount);
      Upper = *C + 1;
    }
  }
  break;

case Instruction::LShr:
  if (match(BO.getOperand(1), m_APInt(C)) && C->ult(Width)) {
    // 'lshr x, C' produces [0, UINT_MAX >> C].
    Upper = APInt::getAllOnesValue(Width).lshr(*C) + 1;
  } else if (match(BO.getOperand(0), m_APInt(C))) {
    // 'lshr C, x' produces [C >> (Width-1), C].
    unsigned ShiftAmount = Width - 1;
    if (!C->isNullValue() && IIQ.isExact(&BO))
      ShiftAmount = C->countTrailingZeros();
    Lower = C->lshr(ShiftAmount);
    Upper = *C + 1;
  }
  break;

case Instruction::Shl:
  if (match(BO.getOperand(0), m_APInt(C))) {
    if (IIQ.hasNoUnsignedWrap(&BO)) {
      // 'shl nuw C, x' produces [C, C << CLZ(C)]
      Lower = *C;
      Upper = Lower.shl(Lower.countLeadingZeros()) + 1;
    } else if (BO.hasNoSignedWrap()) { // TODO: What if both nuw+nsw?
      if (C->isNegative()) {
        // 'shl nsw C, x' produces [C << CLO(C)-1, C]
        unsigned ShiftAmount = C->countLeadingOnes() - 1;
        Lower = C->shl(ShiftAmount);
        Upper = *C + 1;
      } else {
        // 'shl nsw C, x' produces [C, C << CLZ(C)-1]
        unsigned ShiftAmount = C->countLeadingZeros() - 1;
        Lower = *C;
        Upper = C->shl(ShiftAmount) + 1;
      }
    }
  }
  break;

case Instruction::SDiv:
  if (match(BO.getOperand(1), m_APInt(C))) {
    APInt IntMin = APInt::getSignedMinValue(Width);
    APInt IntMax = APInt::getSignedMaxValue(Width);
    if (C->isAllOnesValue()) {
      // 'sdiv x, -1' produces [INT_MIN + 1, INT_MAX]
      //    where C != -1 and C != 0 and C != 1
      Lower = IntMin + 1;
      Upper = IntMax + 1;
    } else if (C->countLeadingZeros() < Width - 1) {
      // 'sdiv x, C' produces [INT_MIN / C, INT_MAX / C]
      //    where C != -1 and C != 0 and C != 1
      Lower = IntMin.sdiv(*C);
      Upper = IntMax.sdiv(*C);
      if (Lower.sgt(Upper))
        std::swap(Lower, Upper);
      Upper = Upper + 1;
      assert(Upper != Lower && "Upper part of range has wrapped!")(static_cast <bool> (Upper != Lower && "Upper part of range has wrapped!"
) ? void (0) : __assert_fail ("Upper != Lower && \"Upper part of range has wrapped!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6799, __extension__ __PRETTY_FUNCTION__));
    }
  } else if (match(BO.getOperand(0), m_APInt(C))) {
    if (C->isMinSignedValue()) {
      // 'sdiv INT_MIN, x' produces [INT_MIN, INT_MIN / -2].
      Lower = *C;
      Upper = Lower.lshr(1) + 1;
    } else {
      // 'sdiv C, x' produces [-|C|, |C|].
      Upper = C->abs() + 1;
      Lower = (-Upper) + 1;
    }
  }
  break;

case Instruction::UDiv:
  if (match(BO.getOperand(1), m_APInt(C)) && !C->isNullValue()) {
    // 'udiv x, C' produces [0, UINT_MAX / C].
    Upper = APInt::getMaxValue(Width).udiv(*C) + 1;
  } else if (match(BO.getOperand(0), m_APInt(C))) {
    // 'udiv C, x' produces [0, C].
    Upper = *C + 1;
  }
  break;

case Instruction::SRem:
  if (match(BO.getOperand(1), m_APInt(C))) {
    // 'srem x, C' produces (-|C|, |C|).
    Upper = C->abs();
    Lower = (-Upper) + 1;
  }
  break;

case Instruction::URem:
  if (match(BO.getOperand(1), m_APInt(C)))
    // 'urem x, C' produces [0, C).
    Upper = *C;
  break;

default:
  break;
}
6841}

6843static void setLimitsForIntrinsic(const IntrinsicInst &II, APInt &Lower,
                                APInt &Upper) {
unsigned Width = Lower.getBitWidth();
const APInt *C;
switch (II.getIntrinsicID()) {
case Intrinsic::ctpop:
case Intrinsic::ctlz:
case Intrinsic::cttz:
  // Maximum of set/clear bits is the bit width.
  assert(Lower == 0 && "Expected lower bound to be zero")(static_cast <bool> (Lower == 0 && "Expected lower bound to be zero"
) ? void (0) : __assert_fail ("Lower == 0 && \"Expected lower bound to be zero\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6852, __extension__ __PRETTY_FUNCTION__));
  Upper = Width + 1;
  break;
case Intrinsic::uadd_sat:
  // uadd.sat(x, C) produces [C, UINT_MAX].
  if (match(II.getOperand(0), m_APInt(C)) ||
      match(II.getOperand(1), m_APInt(C)))
    Lower = *C;
  break;
case Intrinsic::sadd_sat:
  if (match(II.getOperand(0), m_APInt(C)) ||
      match(II.getOperand(1), m_APInt(C))) {
    if (C->isNegative()) {
      // sadd.sat(x, -C) produces [SINT_MIN, SINT_MAX + (-C)].
      Lower = APInt::getSignedMinValue(Width);
      Upper = APInt::getSignedMaxValue(Width) + *C + 1;
    } else {
      // sadd.sat(x, +C) produces [SINT_MIN + C, SINT_MAX].
      Lower = APInt::getSignedMinValue(Width) + *C;
      Upper = APInt::getSignedMaxValue(Width) + 1;
    }
  }
  break;
case Intrinsic::usub_sat:
  // usub.sat(C, x) produces [0, C].
  if (match(II.getOperand(0), m_APInt(C)))
    Upper = *C + 1;
  // usub.sat(x, C) produces [0, UINT_MAX - C].
  else if (match(II.getOperand(1), m_APInt(C)))
    Upper = APInt::getMaxValue(Width) - *C + 1;
  break;
case Intrinsic::ssub_sat:
  if (match(II.getOperand(0), m_APInt(C))) {
    if (C->isNegative()) {
      // ssub.sat(-C, x) produces [SINT_MIN, -SINT_MIN + (-C)].
      Lower = APInt::getSignedMinValue(Width);
      Upper = *C - APInt::getSignedMinValue(Width) + 1;
    } else {
      // ssub.sat(+C, x) produces [-SINT_MAX + C, SINT_MAX].
      Lower = *C - APInt::getSignedMaxValue(Width);
      Upper = APInt::getSignedMaxValue(Width) + 1;
    }
  } else if (match(II.getOperand(1), m_APInt(C))) {
    if (C->isNegative()) {
      // ssub.sat(x, -C) produces [SINT_MIN - (-C), SINT_MAX]:
      Lower = APInt::getSignedMinValue(Width) - *C;
      Upper = APInt::getSignedMaxValue(Width) + 1;
    } else {
      // ssub.sat(x, +C) produces [SINT_MIN, SINT_MAX - C].
      Lower = APInt::getSignedMinValue(Width);
      Upper = APInt::getSignedMaxValue(Width) - *C + 1;
    }
  }
  break;
case Intrinsic::umin:
case Intrinsic::umax:
case Intrinsic::smin:
case Intrinsic::smax:
  if (!match(II.getOperand(0), m_APInt(C)) &&
      !match(II.getOperand(1), m_APInt(C)))
    break;

  switch (II.getIntrinsicID()) {
  case Intrinsic::umin:
    Upper = *C + 1;
    break;
  case Intrinsic::umax:
    Lower = *C;
    break;
  case Intrinsic::smin:
    Lower = APInt::getSignedMinValue(Width);
    Upper = *C + 1;
    break;
  case Intrinsic::smax:
    Lower = *C;
    Upper = APInt::getSignedMaxValue(Width) + 1;
    break;
  default:
    llvm_unreachable("Must be min/max intrinsic")::llvm::llvm_unreachable_internal("Must be min/max intrinsic"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 6930);
  }
  break;
case Intrinsic::abs:
  // If abs of SIGNED_MIN is poison, then the result is [0..SIGNED_MAX],
  // otherwise it is [0..SIGNED_MIN], as -SIGNED_MIN == SIGNED_MIN.
  if (match(II.getOperand(1), m_One()))
    Upper = APInt::getSignedMaxValue(Width) + 1;
  else
    Upper = APInt::getSignedMinValue(Width) + 1;
  break;
default:
  break;
}
6944}

6946static void setLimitsForSelectPattern(const SelectInst &SI, APInt &Lower,
                                    APInt &Upper, const InstrInfoQuery &IIQ) {
const Value *LHS = nullptr, *RHS = nullptr;
SelectPatternResult R = matchSelectPattern(&SI, LHS, RHS);
if (R.Flavor == SPF_UNKNOWN)
  return;

unsigned BitWidth = SI.getType()->getScalarSizeInBits();

if (R.Flavor == SelectPatternFlavor::SPF_ABS) {
  // If the negation part of the abs (in RHS) has the NSW flag,
  // then the result of abs(X) is [0..SIGNED_MAX],
  // otherwise it is [0..SIGNED_MIN], as -SIGNED_MIN == SIGNED_MIN.
  Lower = APInt::getNullValue(BitWidth);
  if (match(RHS, m_Neg(m_Specific(LHS))) &&
      IIQ.hasNoSignedWrap(cast<Instruction>(RHS)))
    Upper = APInt::getSignedMaxValue(BitWidth) + 1;
  else
    Upper = APInt::getSignedMinValue(BitWidth) + 1;
  return;
}

if (R.Flavor == SelectPatternFlavor::SPF_NABS) {
  // The result of -abs(X) is <= 0.
  Lower = APInt::getSignedMinValue(BitWidth);
  Upper = APInt(BitWidth, 1);
  return;
}

const APInt *C;
if (!match(LHS, m_APInt(C)) && !match(RHS, m_APInt(C)))
  return;

switch (R.Flavor) {
  case SPF_UMIN:
    Upper = *C + 1;
    break;
  case SPF_UMAX:
    Lower = *C;
    break;
  case SPF_SMIN:
    Lower = APInt::getSignedMinValue(BitWidth);
    Upper = *C + 1;
    break;
  case SPF_SMAX:
    Lower = *C;
    Upper = APInt::getSignedMaxValue(BitWidth) + 1;
    break;
  default:
    break;
}
6997}

6999ConstantRange llvm::computeConstantRange(const Value *V, bool UseInstrInfo,
                                       AssumptionCache *AC,
                                       const Instruction *CtxI,
                                       unsigned Depth) {
assert(V->getType()->isIntOrIntVectorTy() && "Expected integer instruction")(static_cast <bool> (V->getType()->isIntOrIntVectorTy
() && "Expected integer instruction") ? void (0) : __assert_fail
 ("V->getType()->isIntOrIntVectorTy() && \"Expected integer instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 7003, __extension__ __PRETTY_FUNCTION__));

if (Depth == MaxAnalysisRecursionDepth)
  return ConstantRange::getFull(V->getType()->getScalarSizeInBits());

const APInt *C;
if (match(V, m_APInt(C)))
  return ConstantRange(*C);

InstrInfoQuery IIQ(UseInstrInfo);
unsigned BitWidth = V->getType()->getScalarSizeInBits();
APInt Lower = APInt(BitWidth, 0);
APInt Upper = APInt(BitWidth, 0);
if (auto *BO = dyn_cast<BinaryOperator>(V))
  setLimitsForBinOp(*BO, Lower, Upper, IIQ);
else if (auto *II = dyn_cast<IntrinsicInst>(V))
  setLimitsForIntrinsic(*II, Lower, Upper);
else if (auto *SI = dyn_cast<SelectInst>(V))
  setLimitsForSelectPattern(*SI, Lower, Upper, IIQ);

ConstantRange CR = ConstantRange::getNonEmpty(Lower, Upper);

if (auto *I = dyn_cast<Instruction>(V))
  if (auto *Range = IIQ.getMetadata(I, LLVMContext::MD_range))
    CR = CR.intersectWith(getConstantRangeFromMetadata(*Range));

if (CtxI && AC) {
  // Try to restrict the range based on information from assumptions.
  for (auto &AssumeVH : AC->assumptionsFor(V)) {
    if (!AssumeVH)
      continue;
    CallInst *I = cast<CallInst>(AssumeVH);
    assert(I->getParent()->getParent() == CtxI->getParent()->getParent() &&(static_cast <bool> (I->getParent()->getParent() ==
 CtxI->getParent()->getParent() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getParent()->getParent() == CtxI->getParent()->getParent() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 7036, __extension__ __PRETTY_FUNCTION__))
           "Got assumption for the wrong function!")(static_cast <bool> (I->getParent()->getParent() ==
 CtxI->getParent()->getParent() && "Got assumption for the wrong function!"
) ? void (0) : __assert_fail ("I->getParent()->getParent() == CtxI->getParent()->getParent() && \"Got assumption for the wrong function!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 7036, __extension__ __PRETTY_FUNCTION__));
    assert(I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume &&(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 7038, __extension__ __PRETTY_FUNCTION__))
           "must be an assume intrinsic")(static_cast <bool> (I->getCalledFunction()->getIntrinsicID
() == Intrinsic::assume && "must be an assume intrinsic"
) ? void (0) : __assert_fail ("I->getCalledFunction()->getIntrinsicID() == Intrinsic::assume && \"must be an assume intrinsic\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/lib/Analysis/ValueTracking.cpp"
, 7038, __extension__ __PRETTY_FUNCTION__));

    if (!isValidAssumeForContext(I, CtxI, nullptr))
      continue;
    Value *Arg = I->getArgOperand(0);
    ICmpInst *Cmp = dyn_cast<ICmpInst>(Arg);
    // Currently we just use information from comparisons.
    if (!Cmp || Cmp->getOperand(0) != V)
      continue;
    ConstantRange RHS = computeConstantRange(Cmp->getOperand(1), UseInstrInfo,
                                             AC, I, Depth + 1);
    CR = CR.intersectWith(
        ConstantRange::makeAllowedICmpRegion(Cmp->getPredicate(), RHS));
  }
}

return CR;
7055}

7057static Optional<int64_t>
7058getOffsetFromIndex(const GEPOperator *GEP, unsigned Idx, const DataLayout &DL) {
// Skip over the first indices.
gep_type_iterator GTI = gep_type_begin(GEP);
for (unsigned i = 1; i != Idx; ++i, ++GTI)
  /*skip along*/;

// Compute the offset implied by the rest of the indices.
int64_t Offset = 0;
for (unsigned i = Idx, e = GEP->getNumOperands(); i != e; ++i, ++GTI) {
  ConstantInt *OpC = dyn_cast<ConstantInt>(GEP->getOperand(i));
  if (!OpC)
    return None;
  if (OpC->isZero())
    continue; // No offset.

  // Handle struct indices, which add their field offset to the pointer.
  if (StructType *STy = GTI.getStructTypeOrNull()) {
    Offset += DL.getStructLayout(STy)->getElementOffset(OpC->getZExtValue());
    continue;
  }

  // Otherwise, we have a sequential type like an array or fixed-length
  // vector. Multiply the index by the ElementSize.
  TypeSize Size = DL.getTypeAllocSize(GTI.getIndexedType());
  if (Size.isScalable())
    return None;
  Offset += Size.getFixedSize() * OpC->getSExtValue();
}

return Offset;
7088}

7090Optional<int64_t> llvm::isPointerOffset(const Value *Ptr1, const Value *Ptr2,
                                      const DataLayout &DL) {
Ptr1 = Ptr1->stripPointerCasts();
Ptr2 = Ptr2->stripPointerCasts();

// Handle the trivial case first.
if (Ptr1 == Ptr2) {
  return 0;
}

const GEPOperator *GEP1 = dyn_cast<GEPOperator>(Ptr1);
const GEPOperator *GEP2 = dyn_cast<GEPOperator>(Ptr2);

// If one pointer is a GEP see if the GEP is a constant offset from the base,
// as in "P" and "gep P, 1".
// Also do this iteratively to handle the the following case:
//   Ptr_t1 = GEP Ptr1, c1
//   Ptr_t2 = GEP Ptr_t1, c2
//   Ptr2 = GEP Ptr_t2, c3
// where we will return c1+c2+c3.
// TODO: Handle the case when both Ptr1 and Ptr2 are GEPs of some common base
// -- replace getOffsetFromBase with getOffsetAndBase, check that the bases
// are the same, and return the difference between offsets.
auto getOffsetFromBase = [&DL](const GEPOperator *GEP,
                               const Value *Ptr) -> Optional<int64_t> {
  const GEPOperator *GEP_T = GEP;
  int64_t OffsetVal = 0;
  bool HasSameBase = false;
  while (GEP_T) {
    auto Offset = getOffsetFromIndex(GEP_T, 1, DL);
    if (!Offset)
      return None;
    OffsetVal += *Offset;
    auto Op0 = GEP_T->getOperand(0)->stripPointerCasts();
    if (Op0 == Ptr) {
      HasSameBase = true;
      break;
    }
    GEP_T = dyn_cast<GEPOperator>(Op0);
  }
  if (!HasSameBase)
    return None;
  return OffsetVal;
};

if (GEP1) {
  auto Offset = getOffsetFromBase(GEP1, Ptr2);
  if (Offset)
    return -*Offset;
}
if (GEP2) {
  auto Offset = getOffsetFromBase(GEP2, Ptr1);
  if (Offset)
    return Offset;
}

// Right now we handle the case when Ptr1/Ptr2 are both GEPs with an identical
// base.  After that base, they may have some number of common (and
// potentially variable) indices.  After that they handle some constant
// offset, which determines their offset from each other.  At this point, we
// handle no other case.
if (!GEP1 || !GEP2 || GEP1->getOperand(0) != GEP2->getOperand(0))
  return None;

// Skip any common indices and track the GEP types.
unsigned Idx = 1;
for (; Idx != GEP1->getNumOperands() && Idx != GEP2->getNumOperands(); ++Idx)
  if (GEP1->getOperand(Idx) != GEP2->getOperand(Idx))
    break;

auto Offset1 = getOffsetFromIndex(GEP1, Idx, DL);
auto Offset2 = getOffsetFromIndex(GEP2, Idx, DL);
if (!Offset1 || !Offset2)
  return None;
return *Offset2 - *Offset1;
7165}

←

/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h

1//===- llvm/Instructions.h - Instruction subclass definitions ---*- 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 exposes the class definitions of all of the subclasses of the
10// Instruction class.  This is meant to be an easy way to get access to all
11// instruction subclasses.
12//
13//===----------------------------------------------------------------------===//

15#ifndef LLVM_IR_INSTRUCTIONS_H
16#define LLVM_IR_INSTRUCTIONS_H

18#include "llvm/ADT/ArrayRef.h"
19#include "llvm/ADT/Bitfields.h"
20#include "llvm/ADT/MapVector.h"
21#include "llvm/ADT/None.h"
22#include "llvm/ADT/STLExtras.h"
23#include "llvm/ADT/SmallVector.h"
24#include "llvm/ADT/StringRef.h"
25#include "llvm/ADT/Twine.h"
26#include "llvm/ADT/iterator.h"
27#include "llvm/ADT/iterator_range.h"
28#include "llvm/IR/Attributes.h"
29#include "llvm/IR/BasicBlock.h"
30#include "llvm/IR/CallingConv.h"
31#include "llvm/IR/CFG.h"
32#include "llvm/IR/Constant.h"
33#include "llvm/IR/DerivedTypes.h"
34#include "llvm/IR/Function.h"
35#include "llvm/IR/InstrTypes.h"
36#include "llvm/IR/Instruction.h"
37#include "llvm/IR/OperandTraits.h"
38#include "llvm/IR/Type.h"
39#include "llvm/IR/Use.h"
40#include "llvm/IR/User.h"
41#include "llvm/IR/Value.h"
42#include "llvm/Support/AtomicOrdering.h"
43#include "llvm/Support/Casting.h"
44#include "llvm/Support/ErrorHandling.h"
45#include <cassert>
46#include <cstddef>
47#include <cstdint>
48#include <iterator>

50namespace llvm {

52class APInt;
53class ConstantInt;
54class DataLayout;
55class LLVMContext;

57//===----------------------------------------------------------------------===//
58//                                AllocaInst Class
59//===----------------------------------------------------------------------===//

61/// an instruction to allocate memory on the stack
62class AllocaInst : public UnaryInstruction {
Type *AllocatedType;

using AlignmentField = AlignmentBitfieldElementT<0>;
using UsedWithInAllocaField = BoolBitfieldElementT<AlignmentField::NextBit>;
using SwiftErrorField = BoolBitfieldElementT<UsedWithInAllocaField::NextBit>;
static_assert(Bitfield::areContiguous<AlignmentField, UsedWithInAllocaField,
                                      SwiftErrorField>(),
              "Bitfields must be contiguous");

72protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

AllocaInst *cloneImpl() const;

78public:
explicit AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
                    const Twine &Name, Instruction *InsertBefore);
AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
           const Twine &Name, BasicBlock *InsertAtEnd);

AllocaInst(Type *Ty, unsigned AddrSpace, const Twine &Name,
           Instruction *InsertBefore);
AllocaInst(Type *Ty, unsigned AddrSpace,
           const Twine &Name, BasicBlock *InsertAtEnd);

AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, Align Align,
           const Twine &Name = "", Instruction *InsertBefore = nullptr);
AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize, Align Align,
           const Twine &Name, BasicBlock *InsertAtEnd);

/// Return true if there is an allocation size parameter to the allocation
/// instruction that is not 1.
bool isArrayAllocation() const;

/// Get the number of elements allocated. For a simple allocation of a single
/// element, this will return a constant 1 value.
const Value *getArraySize() const { return getOperand(0); }
Value *getArraySize() { return getOperand(0); }

/// Overload to return most specific pointer type.
PointerType *getType() const {
  return cast<PointerType>(Instruction::getType());
}

/// Get allocation size in bits. Returns None if size can't be determined,
/// e.g. in case of a VLA.
Optional<TypeSize> getAllocationSizeInBits(const DataLayout &DL) const;

/// Return the type that is being allocated by the instruction.
Type *getAllocatedType() const { return AllocatedType; }
/// for use only in special circumstances that need to generically
/// transform a whole instruction (eg: IR linking and vectorization).
void setAllocatedType(Type *Ty) { AllocatedType = Ty; }

/// Return the alignment of the memory that is being allocated by the
/// instruction.
Align getAlign() const {
  return Align(1ULL << getSubclassData<AlignmentField>());
}

void setAlignment(Align Align) {
  setSubclassData<AlignmentField>(Log2(Align));
}

// FIXME: Remove this one transition to Align is over.
unsigned getAlignment() const { return getAlign().value(); }

/// Return true if this alloca is in the entry block of the function and is a
/// constant size. If so, the code generator will fold it into the
/// prolog/epilog code, so it is basically free.
bool isStaticAlloca() const;

/// Return true if this alloca is used as an inalloca argument to a call. Such
/// allocas are never considered static even if they are in the entry block.
bool isUsedWithInAlloca() const {
  return getSubclassData<UsedWithInAllocaField>();
}

/// Specify whether this alloca is used to represent the arguments to a call.
void setUsedWithInAlloca(bool V) {
  setSubclassData<UsedWithInAllocaField>(V);
}

/// Return true if this alloca is used as a swifterror argument to a call.
bool isSwiftError() const { return getSubclassData<SwiftErrorField>(); }
/// Specify whether this alloca is used to represent a swifterror.
void setSwiftError(bool V) { setSubclassData<SwiftErrorField>(V); }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::Alloca);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

160private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}
167};

169//===----------------------------------------------------------------------===//
170//                                LoadInst Class
171//===----------------------------------------------------------------------===//

173/// An instruction for reading from memory. This uses the SubclassData field in
174/// Value to store whether or not the load is volatile.
175class LoadInst : public UnaryInstruction {
using VolatileField = BoolBitfieldElementT<0>;
using AlignmentField = AlignmentBitfieldElementT<VolatileField::NextBit>;
using OrderingField = AtomicOrderingBitfieldElementT<AlignmentField::NextBit>;
static_assert(
    Bitfield::areContiguous<VolatileField, AlignmentField, OrderingField>(),
    "Bitfields must be contiguous");

void AssertOK();

185protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

LoadInst *cloneImpl() const;

191public:
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr,
         Instruction *InsertBefore);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, BasicBlock *InsertAtEnd);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         Instruction *InsertBefore);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         BasicBlock *InsertAtEnd);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         Align Align, Instruction *InsertBefore = nullptr);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         Align Align, BasicBlock *InsertAtEnd);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         Align Align, AtomicOrdering Order,
         SyncScope::ID SSID = SyncScope::System,
         Instruction *InsertBefore = nullptr);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         Align Align, AtomicOrdering Order, SyncScope::ID SSID,
         BasicBlock *InsertAtEnd);

/// Return true if this is a load from a volatile memory location.
bool isVolatile() const { return getSubclassData<VolatileField>(); }

/// Specify whether this is a volatile load or not.
void setVolatile(bool V) { setSubclassData<VolatileField>(V); }

/// Return the alignment of the access that is being performed.
/// FIXME: Remove this function once transition to Align is over.
/// Use getAlign() instead.
unsigned getAlignment() const { return getAlign().value(); }

/// Return the alignment of the access that is being performed.
Align getAlign() const {
  return Align(1ULL << (getSubclassData<AlignmentField>()));
}

void setAlignment(Align Align) {
  setSubclassData<AlignmentField>(Log2(Align));
}

/// Returns the ordering constraint of this load instruction.
AtomicOrdering getOrdering() const {
  return getSubclassData<OrderingField>();
}
/// Sets the ordering constraint of this load instruction.  May not be Release
/// or AcquireRelease.
void setOrdering(AtomicOrdering Ordering) {
  setSubclassData<OrderingField>(Ordering);
}

/// Returns the synchronization scope ID of this load instruction.
SyncScope::ID getSyncScopeID() const {
  return SSID;
}

/// Sets the synchronization scope ID of this load instruction.
void setSyncScopeID(SyncScope::ID SSID) {
  this->SSID = SSID;
}

/// Sets the ordering constraint and the synchronization scope ID of this load
/// instruction.
void setAtomic(AtomicOrdering Ordering,
               SyncScope::ID SSID = SyncScope::System) {
  setOrdering(Ordering);
  setSyncScopeID(SSID);
}

bool isSimple() const { return !isAtomic() && !isVolatile(); }

bool isUnordered() const {
  return (getOrdering() == AtomicOrdering::NotAtomic ||
          getOrdering() == AtomicOrdering::Unordered) &&
         !isVolatile();
}

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }
Type *getPointerOperandType() const { return getPointerOperand()->getType(); }

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperandType()->getPointerAddressSpace();
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Load;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

285private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}

/// The synchronization scope ID of this load instruction.  Not quite enough
/// room in SubClassData for everything, so synchronization scope ID gets its
/// own field.
SyncScope::ID SSID;
297};

299//===----------------------------------------------------------------------===//
300//                                StoreInst Class
301//===----------------------------------------------------------------------===//

303/// An instruction for storing to memory.
304class StoreInst : public Instruction {
using VolatileField = BoolBitfieldElementT<0>;
using AlignmentField = AlignmentBitfieldElementT<VolatileField::NextBit>;
using OrderingField = AtomicOrderingBitfieldElementT<AlignmentField::NextBit>;
static_assert(
    Bitfield::areContiguous<VolatileField, AlignmentField, OrderingField>(),
    "Bitfields must be contiguous");

void AssertOK();

314protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

StoreInst *cloneImpl() const;

320public:
StoreInst(Value *Val, Value *Ptr, Instruction *InsertBefore);
StoreInst(Value *Val, Value *Ptr, BasicBlock *InsertAtEnd);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, Instruction *InsertBefore);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, BasicBlock *InsertAtEnd);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align,
          Instruction *InsertBefore = nullptr);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align,
          BasicBlock *InsertAtEnd);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align,
          AtomicOrdering Order, SyncScope::ID SSID = SyncScope::System,
          Instruction *InsertBefore = nullptr);
StoreInst(Value *Val, Value *Ptr, bool isVolatile, Align Align,
          AtomicOrdering Order, SyncScope::ID SSID, BasicBlock *InsertAtEnd);

// allocate space for exactly two operands
void *operator new(size_t S) { return User::operator new(S, 2); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

/// Return true if this is a store to a volatile memory location.
bool isVolatile() const { return getSubclassData<VolatileField>(); }

/// Specify whether this is a volatile store or not.
void setVolatile(bool V) { setSubclassData<VolatileField>(V); }

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Return the alignment of the access that is being performed
/// FIXME: Remove this function once transition to Align is over.
/// Use getAlign() instead.
unsigned getAlignment() const { return getAlign().value(); }

Align getAlign() const {
  return Align(1ULL << (getSubclassData<AlignmentField>()));
}

void setAlignment(Align Align) {
  setSubclassData<AlignmentField>(Log2(Align));
}

/// Returns the ordering constraint of this store instruction.
AtomicOrdering getOrdering() const {
  return getSubclassData<OrderingField>();
}

/// Sets the ordering constraint of this store instruction.  May not be
/// Acquire or AcquireRelease.
void setOrdering(AtomicOrdering Ordering) {
  setSubclassData<OrderingField>(Ordering);
}

/// Returns the synchronization scope ID of this store instruction.
SyncScope::ID getSyncScopeID() const {
  return SSID;
}

/// Sets the synchronization scope ID of this store instruction.
void setSyncScopeID(SyncScope::ID SSID) {
  this->SSID = SSID;
}

/// Sets the ordering constraint and the synchronization scope ID of this
/// store instruction.
void setAtomic(AtomicOrdering Ordering,
               SyncScope::ID SSID = SyncScope::System) {
  setOrdering(Ordering);
  setSyncScopeID(SSID);
}

bool isSimple() const { return !isAtomic() && !isVolatile(); }

bool isUnordered() const {
  return (getOrdering() == AtomicOrdering::NotAtomic ||
          getOrdering() == AtomicOrdering::Unordered) &&
         !isVolatile();
}

Value *getValueOperand() { return getOperand(0); }
const Value *getValueOperand() const { return getOperand(0); }

Value *getPointerOperand() { return getOperand(1); }
const Value *getPointerOperand() const { return getOperand(1); }
static unsigned getPointerOperandIndex() { return 1U; }
Type *getPointerOperandType() const { return getPointerOperand()->getType(); }

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperandType()->getPointerAddressSpace();
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Store;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

419private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}

/// The synchronization scope ID of this store instruction.  Not quite enough
/// room in SubClassData for everything, so synchronization scope ID gets its
/// own field.
SyncScope::ID SSID;
431};

433template <>
434struct OperandTraits<StoreInst> : public FixedNumOperandTraits<StoreInst, 2> {
435};

437DEFINE_TRANSPARENT_OPERAND_ACCESSORS(StoreInst, Value)StoreInst::op_iterator StoreInst::op_begin() { return OperandTraits
<StoreInst>::op_begin(this); } StoreInst::const_op_iterator
 StoreInst::op_begin() const { return OperandTraits<StoreInst
>::op_begin(const_cast<StoreInst*>(this)); } StoreInst
::op_iterator StoreInst::op_end() { return OperandTraits<StoreInst
>::op_end(this); } StoreInst::const_op_iterator StoreInst::
op_end() const { return OperandTraits<StoreInst>::op_end
(const_cast<StoreInst*>(this)); } Value *StoreInst::getOperand
(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture
 < OperandTraits<StoreInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 437, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<StoreInst>::op_begin(const_cast
<StoreInst*>(this))[i_nocapture].get()); } void StoreInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<StoreInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 437, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
StoreInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned StoreInst::getNumOperands() const { return OperandTraits
<StoreInst>::operands(this); } template <int Idx_nocapture
> Use &StoreInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
StoreInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

439//===----------------------------------------------------------------------===//
440//                                FenceInst Class
441//===----------------------------------------------------------------------===//

443/// An instruction for ordering other memory operations.
444class FenceInst : public Instruction {
using OrderingField = AtomicOrderingBitfieldElementT<0>;

void Init(AtomicOrdering Ordering, SyncScope::ID SSID);

449protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

FenceInst *cloneImpl() const;

455public:
// Ordering may only be Acquire, Release, AcquireRelease, or
// SequentiallyConsistent.
FenceInst(LLVMContext &C, AtomicOrdering Ordering,
          SyncScope::ID SSID = SyncScope::System,
          Instruction *InsertBefore = nullptr);
FenceInst(LLVMContext &C, AtomicOrdering Ordering, SyncScope::ID SSID,
          BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t S) { return User::operator new(S, 0); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

/// Returns the ordering constraint of this fence instruction.
AtomicOrdering getOrdering() const {
  return getSubclassData<OrderingField>();
}

/// Sets the ordering constraint of this fence instruction.  May only be
/// Acquire, Release, AcquireRelease, or SequentiallyConsistent.
void setOrdering(AtomicOrdering Ordering) {
  setSubclassData<OrderingField>(Ordering);
}

/// Returns the synchronization scope ID of this fence instruction.
SyncScope::ID getSyncScopeID() const {
  return SSID;
}

/// Sets the synchronization scope ID of this fence instruction.
void setSyncScopeID(SyncScope::ID SSID) {
  this->SSID = SSID;
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Fence;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

497private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}

/// The synchronization scope ID of this fence instruction.  Not quite enough
/// room in SubClassData for everything, so synchronization scope ID gets its
/// own field.
SyncScope::ID SSID;
509};

511//===----------------------------------------------------------------------===//
512//                                AtomicCmpXchgInst Class
513//===----------------------------------------------------------------------===//

515/// An instruction that atomically checks whether a
516/// specified value is in a memory location, and, if it is, stores a new value
517/// there. The value returned by this instruction is a pair containing the
518/// original value as first element, and an i1 indicating success (true) or
519/// failure (false) as second element.
520///
521class AtomicCmpXchgInst : public Instruction {
void Init(Value *Ptr, Value *Cmp, Value *NewVal, Align Align,
          AtomicOrdering SuccessOrdering, AtomicOrdering FailureOrdering,
          SyncScope::ID SSID);

template <unsigned Offset>
using AtomicOrderingBitfieldElement =
    typename Bitfield::Element<AtomicOrdering, Offset, 3,
                               AtomicOrdering::LAST>;

531protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

AtomicCmpXchgInst *cloneImpl() const;

537public:
AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal, Align Alignment,
                  AtomicOrdering SuccessOrdering,
                  AtomicOrdering FailureOrdering, SyncScope::ID SSID,
                  Instruction *InsertBefore = nullptr);
AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal, Align Alignment,
                  AtomicOrdering SuccessOrdering,
                  AtomicOrdering FailureOrdering, SyncScope::ID SSID,
                  BasicBlock *InsertAtEnd);

// allocate space for exactly three operands
void *operator new(size_t S) { return User::operator new(S, 3); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

using VolatileField = BoolBitfieldElementT<0>;
using WeakField = BoolBitfieldElementT<VolatileField::NextBit>;
using SuccessOrderingField =
    AtomicOrderingBitfieldElementT<WeakField::NextBit>;
using FailureOrderingField =
    AtomicOrderingBitfieldElementT<SuccessOrderingField::NextBit>;
using AlignmentField =
    AlignmentBitfieldElementT<FailureOrderingField::NextBit>;
static_assert(
    Bitfield::areContiguous<VolatileField, WeakField, SuccessOrderingField,
                            FailureOrderingField, AlignmentField>(),
    "Bitfields must be contiguous");

/// Return the alignment of the memory that is being allocated by the
/// instruction.
Align getAlign() const {
  return Align(1ULL << getSubclassData<AlignmentField>());
}

void setAlignment(Align Align) {
  setSubclassData<AlignmentField>(Log2(Align));
}

/// Return true if this is a cmpxchg from a volatile memory
/// location.
///
bool isVolatile() const { return getSubclassData<VolatileField>(); }

/// Specify whether this is a volatile cmpxchg.
///
void setVolatile(bool V) { setSubclassData<VolatileField>(V); }

/// Return true if this cmpxchg may spuriously fail.
bool isWeak() const { return getSubclassData<WeakField>(); }

void setWeak(bool IsWeak) { setSubclassData<WeakField>(IsWeak); }

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

static bool isValidSuccessOrdering(AtomicOrdering Ordering) {
  return Ordering != AtomicOrdering::NotAtomic &&
         Ordering != AtomicOrdering::Unordered;
}

static bool isValidFailureOrdering(AtomicOrdering Ordering) {
  return Ordering != AtomicOrdering::NotAtomic &&
         Ordering != AtomicOrdering::Unordered &&
         Ordering != AtomicOrdering::AcquireRelease &&
         Ordering != AtomicOrdering::Release;
}

/// Returns the success ordering constraint of this cmpxchg instruction.
AtomicOrdering getSuccessOrdering() const {
  return getSubclassData<SuccessOrderingField>();
}

/// Sets the success ordering constraint of this cmpxchg instruction.
void setSuccessOrdering(AtomicOrdering Ordering) {
  assert(isValidSuccessOrdering(Ordering) &&(static_cast <bool> (isValidSuccessOrdering(Ordering) &&
 "invalid CmpXchg success ordering") ? void (0) : __assert_fail
 ("isValidSuccessOrdering(Ordering) && \"invalid CmpXchg success ordering\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 611, __extension__ __PRETTY_FUNCTION__))
         "invalid CmpXchg success ordering")(static_cast <bool> (isValidSuccessOrdering(Ordering) &&
 "invalid CmpXchg success ordering") ? void (0) : __assert_fail
 ("isValidSuccessOrdering(Ordering) && \"invalid CmpXchg success ordering\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 611, __extension__ __PRETTY_FUNCTION__));
  setSubclassData<SuccessOrderingField>(Ordering);
}

/// Returns the failure ordering constraint of this cmpxchg instruction.
AtomicOrdering getFailureOrdering() const {
  return getSubclassData<FailureOrderingField>();
}

/// Sets the failure ordering constraint of this cmpxchg instruction.
void setFailureOrdering(AtomicOrdering Ordering) {
  assert(isValidFailureOrdering(Ordering) &&(static_cast <bool> (isValidFailureOrdering(Ordering) &&
 "invalid CmpXchg failure ordering") ? void (0) : __assert_fail
 ("isValidFailureOrdering(Ordering) && \"invalid CmpXchg failure ordering\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 623, __extension__ __PRETTY_FUNCTION__))
         "invalid CmpXchg failure ordering")(static_cast <bool> (isValidFailureOrdering(Ordering) &&
 "invalid CmpXchg failure ordering") ? void (0) : __assert_fail
 ("isValidFailureOrdering(Ordering) && \"invalid CmpXchg failure ordering\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 623, __extension__ __PRETTY_FUNCTION__));
  setSubclassData<FailureOrderingField>(Ordering);
}

/// Returns a single ordering which is at least as strong as both the
/// success and failure orderings for this cmpxchg.
AtomicOrdering getMergedOrdering() const {
  if (getFailureOrdering() == AtomicOrdering::SequentiallyConsistent)
    return AtomicOrdering::SequentiallyConsistent;
  if (getFailureOrdering() == AtomicOrdering::Acquire) {
    if (getSuccessOrdering() == AtomicOrdering::Monotonic)
      return AtomicOrdering::Acquire;
    if (getSuccessOrdering() == AtomicOrdering::Release)
      return AtomicOrdering::AcquireRelease;
  }
  return getSuccessOrdering();
}

/// Returns the synchronization scope ID of this cmpxchg instruction.
SyncScope::ID getSyncScopeID() const {
  return SSID;
}

/// Sets the synchronization scope ID of this cmpxchg instruction.
void setSyncScopeID(SyncScope::ID SSID) {
  this->SSID = SSID;
}

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

Value *getCompareOperand() { return getOperand(1); }
const Value *getCompareOperand() const { return getOperand(1); }

Value *getNewValOperand() { return getOperand(2); }
const Value *getNewValOperand() const { return getOperand(2); }

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperand()->getType()->getPointerAddressSpace();
}

/// Returns the strongest permitted ordering on failure, given the
/// desired ordering on success.
///
/// If the comparison in a cmpxchg operation fails, there is no atomic store
/// so release semantics cannot be provided. So this function drops explicit
/// Release requests from the AtomicOrdering. A SequentiallyConsistent
/// operation would remain SequentiallyConsistent.
static AtomicOrdering
getStrongestFailureOrdering(AtomicOrdering SuccessOrdering) {
  switch (SuccessOrdering) {
  default:
    llvm_unreachable("invalid cmpxchg success ordering")::llvm::llvm_unreachable_internal("invalid cmpxchg success ordering"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 677);
  case AtomicOrdering::Release:
  case AtomicOrdering::Monotonic:
    return AtomicOrdering::Monotonic;
  case AtomicOrdering::AcquireRelease:
  case AtomicOrdering::Acquire:
    return AtomicOrdering::Acquire;
  case AtomicOrdering::SequentiallyConsistent:
    return AtomicOrdering::SequentiallyConsistent;
  }
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::AtomicCmpXchg;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

697private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}

/// The synchronization scope ID of this cmpxchg instruction.  Not quite
/// enough room in SubClassData for everything, so synchronization scope ID
/// gets its own field.
SyncScope::ID SSID;
709};

711template <>
712struct OperandTraits<AtomicCmpXchgInst> :
  public FixedNumOperandTraits<AtomicCmpXchgInst, 3> {
714};

716DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicCmpXchgInst, Value)AtomicCmpXchgInst::op_iterator AtomicCmpXchgInst::op_begin() {
 return OperandTraits<AtomicCmpXchgInst>::op_begin(this
); } AtomicCmpXchgInst::const_op_iterator AtomicCmpXchgInst::
op_begin() const { return OperandTraits<AtomicCmpXchgInst>
::op_begin(const_cast<AtomicCmpXchgInst*>(this)); } AtomicCmpXchgInst
::op_iterator AtomicCmpXchgInst::op_end() { return OperandTraits
<AtomicCmpXchgInst>::op_end(this); } AtomicCmpXchgInst::
const_op_iterator AtomicCmpXchgInst::op_end() const { return OperandTraits
<AtomicCmpXchgInst>::op_end(const_cast<AtomicCmpXchgInst
*>(this)); } Value *AtomicCmpXchgInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<AtomicCmpXchgInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 716, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<AtomicCmpXchgInst>::op_begin
(const_cast<AtomicCmpXchgInst*>(this))[i_nocapture].get
()); } void AtomicCmpXchgInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<AtomicCmpXchgInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 716, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
AtomicCmpXchgInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned AtomicCmpXchgInst::getNumOperands() const { return
 OperandTraits<AtomicCmpXchgInst>::operands(this); } template
 <int Idx_nocapture> Use &AtomicCmpXchgInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &AtomicCmpXchgInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

718//===----------------------------------------------------------------------===//
719//                                AtomicRMWInst Class
720//===----------------------------------------------------------------------===//

722/// an instruction that atomically reads a memory location,
723/// combines it with another value, and then stores the result back.  Returns
724/// the old value.
725///
726class AtomicRMWInst : public Instruction {
727protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

AtomicRMWInst *cloneImpl() const;

733public:
/// This enumeration lists the possible modifications atomicrmw can make.  In
/// the descriptions, 'p' is the pointer to the instruction's memory location,
/// 'old' is the initial value of *p, and 'v' is the other value passed to the
/// instruction.  These instructions always return 'old'.
enum BinOp : unsigned {
  /// *p = v
  Xchg,
  /// *p = old + v
  Add,
  /// *p = old - v
  Sub,
  /// *p = old & v
  And,
  /// *p = ~(old & v)
  Nand,
  /// *p = old | v
  Or,
  /// *p = old ^ v
  Xor,
  /// *p = old >signed v ? old : v
  Max,
  /// *p = old <signed v ? old : v
  Min,
  /// *p = old >unsigned v ? old : v
  UMax,
  /// *p = old <unsigned v ? old : v
  UMin,

  /// *p = old + v
  FAdd,

  /// *p = old - v
  FSub,

  FIRST_BINOP = Xchg,
  LAST_BINOP = FSub,
  BAD_BINOP
};

773private:
template <unsigned Offset>
using AtomicOrderingBitfieldElement =
    typename Bitfield::Element<AtomicOrdering, Offset, 3,
                               AtomicOrdering::LAST>;

template <unsigned Offset>
using BinOpBitfieldElement =
    typename Bitfield::Element<BinOp, Offset, 4, BinOp::LAST_BINOP>;

783public:
AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment,
              AtomicOrdering Ordering, SyncScope::ID SSID,
              Instruction *InsertBefore = nullptr);
AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val, Align Alignment,
              AtomicOrdering Ordering, SyncScope::ID SSID,
              BasicBlock *InsertAtEnd);

// allocate space for exactly two operands
void *operator new(size_t S) { return User::operator new(S, 2); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

using VolatileField = BoolBitfieldElementT<0>;
using AtomicOrderingField =
    AtomicOrderingBitfieldElementT<VolatileField::NextBit>;
using OperationField = BinOpBitfieldElement<AtomicOrderingField::NextBit>;
using AlignmentField = AlignmentBitfieldElementT<OperationField::NextBit>;
static_assert(Bitfield::areContiguous<VolatileField, AtomicOrderingField,
                                      OperationField, AlignmentField>(),
              "Bitfields must be contiguous");

BinOp getOperation() const { return getSubclassData<OperationField>(); }

static StringRef getOperationName(BinOp Op);

static bool isFPOperation(BinOp Op) {
  switch (Op) {
  case AtomicRMWInst::FAdd:
  case AtomicRMWInst::FSub:
    return true;
  default:
    return false;
  }
}

void setOperation(BinOp Operation) {
  setSubclassData<OperationField>(Operation);
}

/// Return the alignment of the memory that is being allocated by the
/// instruction.
Align getAlign() const {
  return Align(1ULL << getSubclassData<AlignmentField>());
}

void setAlignment(Align Align) {
  setSubclassData<AlignmentField>(Log2(Align));
}

/// Return true if this is a RMW on a volatile memory location.
///
bool isVolatile() const { return getSubclassData<VolatileField>(); }

/// Specify whether this is a volatile RMW or not.
///
void setVolatile(bool V) { setSubclassData<VolatileField>(V); }

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Returns the ordering constraint of this rmw instruction.
AtomicOrdering getOrdering() const {
  return getSubclassData<AtomicOrderingField>();
}

/// Sets the ordering constraint of this rmw instruction.
void setOrdering(AtomicOrdering Ordering) {
  assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "atomicrmw instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 851, __extension__ __PRETTY_FUNCTION__))
         "atomicrmw instructions can only be atomic.")(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "atomicrmw instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 851, __extension__ __PRETTY_FUNCTION__));
  setSubclassData<AtomicOrderingField>(Ordering);
}

/// Returns the synchronization scope ID of this rmw instruction.
SyncScope::ID getSyncScopeID() const {
  return SSID;
}

/// Sets the synchronization scope ID of this rmw instruction.
void setSyncScopeID(SyncScope::ID SSID) {
  this->SSID = SSID;
}

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

Value *getValOperand() { return getOperand(1); }
const Value *getValOperand() const { return getOperand(1); }

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperand()->getType()->getPointerAddressSpace();
}

bool isFloatingPointOperation() const {
  return isFPOperation(getOperation());
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::AtomicRMW;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

889private:
void Init(BinOp Operation, Value *Ptr, Value *Val, Align Align,
          AtomicOrdering Ordering, SyncScope::ID SSID);

// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}

/// The synchronization scope ID of this rmw instruction.  Not quite enough
/// room in SubClassData for everything, so synchronization scope ID gets its
/// own field.
SyncScope::ID SSID;
904};

906template <>
907struct OperandTraits<AtomicRMWInst>
  : public FixedNumOperandTraits<AtomicRMWInst,2> {
909};

911DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicRMWInst, Value)AtomicRMWInst::op_iterator AtomicRMWInst::op_begin() { return
 OperandTraits<AtomicRMWInst>::op_begin(this); } AtomicRMWInst
::const_op_iterator AtomicRMWInst::op_begin() const { return OperandTraits
<AtomicRMWInst>::op_begin(const_cast<AtomicRMWInst*>
(this)); } AtomicRMWInst::op_iterator AtomicRMWInst::op_end()
 { return OperandTraits<AtomicRMWInst>::op_end(this); }
 AtomicRMWInst::const_op_iterator AtomicRMWInst::op_end() const
 { return OperandTraits<AtomicRMWInst>::op_end(const_cast
<AtomicRMWInst*>(this)); } Value *AtomicRMWInst::getOperand
(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture
 < OperandTraits<AtomicRMWInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 911, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<AtomicRMWInst>::op_begin(const_cast
<AtomicRMWInst*>(this))[i_nocapture].get()); } void AtomicRMWInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<AtomicRMWInst
>::operands(this) && "setOperand() out of range!")
 ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 911, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
AtomicRMWInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned AtomicRMWInst::getNumOperands() const { return OperandTraits
<AtomicRMWInst>::operands(this); } template <int Idx_nocapture
> Use &AtomicRMWInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &AtomicRMWInst::Op() const { return this->OpFrom
<Idx_nocapture>(this); }

913//===----------------------------------------------------------------------===//
914//                             GetElementPtrInst Class
915//===----------------------------------------------------------------------===//

917// checkGEPType - Simple wrapper function to give a better assertion failure
918// message on bad indexes for a gep instruction.
919//
920inline Type *checkGEPType(Type *Ty) {
assert(Ty && "Invalid GetElementPtrInst indices for type!")(static_cast <bool> (Ty && "Invalid GetElementPtrInst indices for type!"
) ? void (0) : __assert_fail ("Ty && \"Invalid GetElementPtrInst indices for type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 921, __extension__ __PRETTY_FUNCTION__));
return Ty;
923}

925/// an instruction for type-safe pointer arithmetic to
926/// access elements of arrays and structs
927///
928class GetElementPtrInst : public Instruction {
Type *SourceElementType;
Type *ResultElementType;

GetElementPtrInst(const GetElementPtrInst &GEPI);

/// Constructors - Create a getelementptr instruction with a base pointer an
/// list of indices. The first ctor can optionally insert before an existing
/// instruction, the second appends the new instruction to the specified
/// BasicBlock.
inline GetElementPtrInst(Type *PointeeType, Value *Ptr,
                         ArrayRef<Value *> IdxList, unsigned Values,
                         const Twine &NameStr, Instruction *InsertBefore);
inline GetElementPtrInst(Type *PointeeType, Value *Ptr,
                         ArrayRef<Value *> IdxList, unsigned Values,
                         const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr);

947protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

GetElementPtrInst *cloneImpl() const;

953public:
static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr,
                                 ArrayRef<Value *> IdxList,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + unsigned(IdxList.size());
  assert(PointeeType && "Must specify element type")(static_cast <bool> (PointeeType && "Must specify element type"
) ? void (0) : __assert_fail ("PointeeType && \"Must specify element type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 959, __extension__ __PRETTY_FUNCTION__));
  assert(cast<PointerType>(Ptr->getType()->getScalarType())(static_cast <bool> (cast<PointerType>(Ptr->getType
()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType
)) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 961, __extension__ __PRETTY_FUNCTION__))
             ->isOpaqueOrPointeeTypeMatches(PointeeType))(static_cast <bool> (cast<PointerType>(Ptr->getType
()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType
)) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 961, __extension__ __PRETTY_FUNCTION__));
  return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values,
                                        NameStr, InsertBefore);
}

static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr,
                                 ArrayRef<Value *> IdxList,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + unsigned(IdxList.size());
  assert(PointeeType && "Must specify element type")(static_cast <bool> (PointeeType && "Must specify element type"
) ? void (0) : __assert_fail ("PointeeType && \"Must specify element type\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 971, __extension__ __PRETTY_FUNCTION__));
  assert(cast<PointerType>(Ptr->getType()->getScalarType())(static_cast <bool> (cast<PointerType>(Ptr->getType
()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType
)) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 973, __extension__ __PRETTY_FUNCTION__))
             ->isOpaqueOrPointeeTypeMatches(PointeeType))(static_cast <bool> (cast<PointerType>(Ptr->getType
()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType
)) ? void (0) : __assert_fail ("cast<PointerType>(Ptr->getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(PointeeType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 973, __extension__ __PRETTY_FUNCTION__));
  return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values,
                                        NameStr, InsertAtEnd);
}

LLVM_ATTRIBUTE_DEPRECATED(static GetElementPtrInst *CreateInBounds([[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr = "", Instruction
 *InsertBefore = nullptr)
      Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr = "",[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr = "", Instruction
 *InsertBefore = nullptr)
      Instruction *InsertBefore = nullptr),[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr = "", Instruction
 *InsertBefore = nullptr)
    "Use the version with explicit element type instead")[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr = "", Instruction
 *InsertBefore = nullptr) {
  return CreateInBounds(
      Ptr->getType()->getScalarType()->getPointerElementType(), Ptr, IdxList,
      NameStr, InsertBefore);
}

/// Create an "inbounds" getelementptr. See the documentation for the
/// "inbounds" flag in LangRef.html for details.
static GetElementPtrInst *
CreateInBounds(Type *PointeeType, Value *Ptr, ArrayRef<Value *> IdxList,
               const Twine &NameStr = "",
               Instruction *InsertBefore = nullptr) {
  GetElementPtrInst *GEP =
      Create(PointeeType, Ptr, IdxList, NameStr, InsertBefore);
  GEP->setIsInBounds(true);
  return GEP;
}

LLVM_ATTRIBUTE_DEPRECATED(static GetElementPtrInst *CreateInBounds([[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr, BasicBlock
 *InsertAtEnd)
      Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr,[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr, BasicBlock
 *InsertAtEnd)
      BasicBlock *InsertAtEnd),[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr, BasicBlock
 *InsertAtEnd)
    "Use the version with explicit element type instead")[[deprecated("Use the version with explicit element type instead"
)]] static GetElementPtrInst *CreateInBounds( Value *Ptr, ArrayRef
<Value *> IdxList, const Twine &NameStr, BasicBlock
 *InsertAtEnd) {
  return CreateInBounds(
      Ptr->getType()->getScalarType()->getPointerElementType(), Ptr, IdxList,
      NameStr, InsertAtEnd);
}

static GetElementPtrInst *CreateInBounds(Type *PointeeType, Value *Ptr,
                                         ArrayRef<Value *> IdxList,
                                         const Twine &NameStr,
                                         BasicBlock *InsertAtEnd) {
  GetElementPtrInst *GEP =
      Create(PointeeType, Ptr, IdxList, NameStr, InsertAtEnd);
  GEP->setIsInBounds(true);
  return GEP;
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

Type *getSourceElementType() const { return SourceElementType; }

void setSourceElementType(Type *Ty) { SourceElementType = Ty; }
void setResultElementType(Type *Ty) { ResultElementType = Ty; }

Type *getResultElementType() const {
  assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1028, __extension__ __PRETTY_FUNCTION__))
             ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1028, __extension__ __PRETTY_FUNCTION__));
  return ResultElementType;
}

/// Returns the address space of this instruction's pointer type.
unsigned getAddressSpace() const {
  // Note that this is always the same as the pointer operand's address space
  // and that is cheaper to compute, so cheat here.
  return getPointerAddressSpace();
}

/// Returns the result type of a getelementptr with the given source
/// element type and indexes.
///
/// Null is returned if the indices are invalid for the specified
/// source element type.
static Type *getIndexedType(Type *Ty, ArrayRef<Value *> IdxList);
static Type *getIndexedType(Type *Ty, ArrayRef<Constant *> IdxList);
static Type *getIndexedType(Type *Ty, ArrayRef<uint64_t> IdxList);

/// Return the type of the element at the given index of an indexable
/// type.  This is equivalent to "getIndexedType(Agg, {Zero, Idx})".
///
/// Returns null if the type can't be indexed, or the given index is not
/// legal for the given type.
static Type *getTypeAtIndex(Type *Ty, Value *Idx);
static Type *getTypeAtIndex(Type *Ty, uint64_t Idx);

inline op_iterator       idx_begin()       { return op_begin()+1; }
inline const_op_iterator idx_begin() const { return op_begin()+1; }
inline op_iterator       idx_end()         { return op_end(); }
inline const_op_iterator idx_end()   const { return op_end(); }

inline iterator_range<op_iterator> indices() {
  return make_range(idx_begin(), idx_end());
}

inline iterator_range<const_op_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getPointerOperand() {
  return getOperand(0);
}
const Value *getPointerOperand() const {
  return getOperand(0);
}
static unsigned getPointerOperandIndex() {
  return 0U;    // get index for modifying correct operand.
}

/// Method to return the pointer operand as a
/// PointerType.
Type *getPointerOperandType() const {
  return getPointerOperand()->getType();
}

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperandType()->getPointerAddressSpace();
}

/// Returns the pointer type returned by the GEP
/// instruction, which may be a vector of pointers.
static Type *getGEPReturnType(Type *ElTy, Value *Ptr,
                              ArrayRef<Value *> IdxList) {
  PointerType *OrigPtrTy = cast<PointerType>(Ptr->getType()->getScalarType());
  unsigned AddrSpace = OrigPtrTy->getAddressSpace();
  Type *ResultElemTy = checkGEPType(getIndexedType(ElTy, IdxList));
  Type *PtrTy = OrigPtrTy->isOpaque()
    ? PointerType::get(OrigPtrTy->getContext(), AddrSpace)
    : PointerType::get(ResultElemTy, AddrSpace);
  // Vector GEP
  if (auto *PtrVTy = dyn_cast<VectorType>(Ptr->getType())) {
    ElementCount EltCount = PtrVTy->getElementCount();
    return VectorType::get(PtrTy, EltCount);
  }
  for (Value *Index : IdxList)
    if (auto *IndexVTy = dyn_cast<VectorType>(Index->getType())) {
      ElementCount EltCount = IndexVTy->getElementCount();
      return VectorType::get(PtrTy, EltCount);
    }
  // Scalar GEP
  return PtrTy;
}

unsigned getNumIndices() const {  // Note: always non-negative
  return getNumOperands() - 1;
}

bool hasIndices() const {
  return getNumOperands() > 1;
}

/// Return true if all of the indices of this GEP are
/// zeros.  If so, the result pointer and the first operand have the same
/// value, just potentially different types.
bool hasAllZeroIndices() const;

/// Return true if all of the indices of this GEP are
/// constant integers.  If so, the result pointer and the first operand have
/// a constant offset between them.
bool hasAllConstantIndices() const;

/// Set or clear the inbounds flag on this GEP instruction.
/// See LangRef.html for the meaning of inbounds on a getelementptr.
void setIsInBounds(bool b = true);

/// Determine whether the GEP has the inbounds flag.
bool isInBounds() const;

/// Accumulate the constant address offset of this GEP if possible.
///
/// This routine accepts an APInt into which it will accumulate the constant
/// offset of this GEP if the GEP is in fact constant. If the GEP is not
/// all-constant, it returns false and the value of the offset APInt is
/// undefined (it is *not* preserved!). The APInt passed into this routine
/// must be at least as wide as the IntPtr type for the address space of
/// the base GEP pointer.
bool accumulateConstantOffset(const DataLayout &DL, APInt &Offset) const;
bool collectOffset(const DataLayout &DL, unsigned BitWidth,
                   MapVector<Value *, APInt> &VariableOffsets,
                   APInt &ConstantOffset) const;
// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::GetElementPtr);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1158};

1160template <>
1161struct OperandTraits<GetElementPtrInst> :
public VariadicOperandTraits<GetElementPtrInst, 1> {
1163};

1165GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr,
                                   ArrayRef<Value *> IdxList, unsigned Values,
                                   const Twine &NameStr,
                                   Instruction *InsertBefore)
  : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr,
                OperandTraits<GetElementPtrInst>::op_end(this) - Values,
                Values, InsertBefore),
    SourceElementType(PointeeType),
    ResultElementType(getIndexedType(PointeeType, IdxList)) {
assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1175, __extension__ __PRETTY_FUNCTION__))
           ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1175, __extension__ __PRETTY_FUNCTION__));
init(Ptr, IdxList, NameStr);
1177}

1179GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr,
                                   ArrayRef<Value *> IdxList, unsigned Values,
                                   const Twine &NameStr,
                                   BasicBlock *InsertAtEnd)
  : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr,
                OperandTraits<GetElementPtrInst>::op_end(this) - Values,
                Values, InsertAtEnd),
    SourceElementType(PointeeType),
    ResultElementType(getIndexedType(PointeeType, IdxList)) {
assert(cast<PointerType>(getType()->getScalarType())(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1189, __extension__ __PRETTY_FUNCTION__))
           ->isOpaqueOrPointeeTypeMatches(ResultElementType))(static_cast <bool> (cast<PointerType>(getType()->
getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType
)) ? void (0) : __assert_fail ("cast<PointerType>(getType()->getScalarType()) ->isOpaqueOrPointeeTypeMatches(ResultElementType)"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1189, __extension__ __PRETTY_FUNCTION__));
init(Ptr, IdxList, NameStr);
1191}

1193DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrInst, Value)GetElementPtrInst::op_iterator GetElementPtrInst::op_begin() {
 return OperandTraits<GetElementPtrInst>::op_begin(this
); } GetElementPtrInst::const_op_iterator GetElementPtrInst::
op_begin() const { return OperandTraits<GetElementPtrInst>
::op_begin(const_cast<GetElementPtrInst*>(this)); } GetElementPtrInst
::op_iterator GetElementPtrInst::op_end() { return OperandTraits
<GetElementPtrInst>::op_end(this); } GetElementPtrInst::
const_op_iterator GetElementPtrInst::op_end() const { return OperandTraits
<GetElementPtrInst>::op_end(const_cast<GetElementPtrInst
*>(this)); } Value *GetElementPtrInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<GetElementPtrInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1193, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<GetElementPtrInst>::op_begin
(const_cast<GetElementPtrInst*>(this))[i_nocapture].get
()); } void GetElementPtrInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<GetElementPtrInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1193, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
GetElementPtrInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned GetElementPtrInst::getNumOperands() const { return
 OperandTraits<GetElementPtrInst>::operands(this); } template
 <int Idx_nocapture> Use &GetElementPtrInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &GetElementPtrInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

1195//===----------------------------------------------------------------------===//
1196//                               ICmpInst Class
1197//===----------------------------------------------------------------------===//

1199/// This instruction compares its operands according to the predicate given
1200/// to the constructor. It only operates on integers or pointers. The operands
1201/// must be identical types.
1202/// Represent an integer comparison operator.
1203class ICmpInst: public CmpInst {
void AssertOK() {
  assert(isIntPredicate() &&(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value"
) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1206, __extension__ __PRETTY_FUNCTION__))
         "Invalid ICmp predicate value")(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value"
) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1206, __extension__ __PRETTY_FUNCTION__));
  assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to ICmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1208, __extension__ __PRETTY_FUNCTION__))
        "Both operands to ICmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to ICmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1208, __extension__ __PRETTY_FUNCTION__));
  // Check that the operands are the right type
  assert((getOperand(0)->getType()->isIntOrIntVectorTy() ||(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1212, __extension__ __PRETTY_FUNCTION__))
          getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1212, __extension__ __PRETTY_FUNCTION__))
         "Invalid operand types for ICmp instruction")(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1212, __extension__ __PRETTY_FUNCTION__));
}

1215protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical ICmpInst
ICmpInst *cloneImpl() const;

1222public:
/// Constructor with insert-before-instruction semantics.
ICmpInst(
  Instruction *InsertBefore,  ///< Where to insert
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr,
            InsertBefore) {
1233#ifndef NDEBUG
AssertOK();
1235#endif
}

/// Constructor with insert-at-end semantics.
ICmpInst(
  BasicBlock &InsertAtEnd, ///< Block to insert into.
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr,
            &InsertAtEnd) {
1248#ifndef NDEBUG
AssertOK();
1250#endif
}

/// Constructor with no-insertion semantics
ICmpInst(
  Predicate pred, ///< The predicate to use for the comparison
  Value *LHS,     ///< The left-hand-side of the expression
  Value *RHS,     ///< The right-hand-side of the expression
  const Twine &NameStr = "" ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr) {
1261#ifndef NDEBUG
AssertOK();
1263#endif
}

/// For example, EQ->EQ, SLE->SLE, UGT->SGT, etc.
/// @returns the predicate that would be the result if the operand were
/// regarded as signed.
/// Return the signed version of the predicate
Predicate getSignedPredicate() const {
  return getSignedPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction.
/// Return the signed version of the predicate.
static Predicate getSignedPredicate(Predicate pred);

/// For example, EQ->EQ, SLE->ULE, UGT->UGT, etc.
/// @returns the predicate that would be the result if the operand were
/// regarded as unsigned.
/// Return the unsigned version of the predicate
Predicate getUnsignedPredicate() const {
  return getUnsignedPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction.
/// Return the unsigned version of the predicate.
static Predicate getUnsignedPredicate(Predicate pred);

/// Return true if this predicate is either EQ or NE.  This also
/// tests for commutativity.
static bool isEquality(Predicate P) {
  return P == ICMP_EQ || P == ICMP_NE;
}

/// Return true if this predicate is either EQ or NE.  This also
/// tests for commutativity.
bool isEquality() const {
  return isEquality(getPredicate());
}

/// @returns true if the predicate of this ICmpInst is commutative
/// Determine if this relation is commutative.
bool isCommutative() const { return isEquality(); }

/// Return true if the predicate is relational (not EQ or NE).
///
bool isRelational() const {
  return !isEquality();
}

/// Return true if the predicate is relational (not EQ or NE).
///
static bool isRelational(Predicate P) {
  return !isEquality(P);
}

/// Return true if the predicate is SGT or UGT.
///
static bool isGT(Predicate P) {
  return P == ICMP_SGT || P == ICMP_UGT;
}

/// Return true if the predicate is SLT or ULT.
///
static bool isLT(Predicate P) {
  return P == ICMP_SLT || P == ICMP_ULT;
}

/// Return true if the predicate is SGE or UGE.
///
static bool isGE(Predicate P) {
  return P == ICMP_SGE || P == ICMP_UGE;
}

/// Return true if the predicate is SLE or ULE.
///
static bool isLE(Predicate P) {
  return P == ICMP_SLE || P == ICMP_ULE;
}

/// Exchange the two operands to this instruction in such a way that it does
/// not modify the semantics of the instruction. The predicate value may be
/// changed to retain the same result if the predicate is order dependent
/// (e.g. ult).
/// Swap operands and adjust predicate.
void swapOperands() {
  setPredicate(getSwappedPredicate());
  Op<0>().swap(Op<1>());
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::ICmp;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1359};

1361//===----------------------------------------------------------------------===//
1362//                               FCmpInst Class
1363//===----------------------------------------------------------------------===//

1365/// This instruction compares its operands according to the predicate given
1366/// to the constructor. It only operates on floating point values or packed
1367/// vectors of floating point values. The operands must be identical types.
1368/// Represents a floating point comparison operator.
1369class FCmpInst: public CmpInst {
void AssertOK() {
  assert(isFPPredicate() && "Invalid FCmp predicate value")(static_cast <bool> (isFPPredicate() && "Invalid FCmp predicate value"
) ? void (0) : __assert_fail ("isFPPredicate() && \"Invalid FCmp predicate value\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1371, __extension__ __PRETTY_FUNCTION__));
  assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to FCmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1373, __extension__ __PRETTY_FUNCTION__))
         "Both operands to FCmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to FCmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1373, __extension__ __PRETTY_FUNCTION__));
  // Check that the operands are the right type
  assert(getOperand(0)->getType()->isFPOrFPVectorTy() &&(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy
() && "Invalid operand types for FCmp instruction") ?
 void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1376, __extension__ __PRETTY_FUNCTION__))
         "Invalid operand types for FCmp instruction")(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy
() && "Invalid operand types for FCmp instruction") ?
 void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1376, __extension__ __PRETTY_FUNCTION__));
}

1379protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FCmpInst
FCmpInst *cloneImpl() const;

1386public:
/// Constructor with insert-before-instruction semantics.
FCmpInst(
  Instruction *InsertBefore, ///< Where to insert
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::FCmp, pred, LHS, RHS, NameStr,
            InsertBefore) {
  AssertOK();
}

/// Constructor with insert-at-end semantics.
FCmpInst(
  BasicBlock &InsertAtEnd, ///< Block to insert into.
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::FCmp, pred, LHS, RHS, NameStr,
            &InsertAtEnd) {
  AssertOK();
}

/// Constructor with no-insertion semantics
FCmpInst(
  Predicate Pred, ///< The predicate to use for the comparison
  Value *LHS,     ///< The left-hand-side of the expression
  Value *RHS,     ///< The right-hand-side of the expression
  const Twine &NameStr = "", ///< Name of the instruction
  Instruction *FlagsSource = nullptr
) : CmpInst(makeCmpResultType(LHS->getType()), Instruction::FCmp, Pred, LHS,
            RHS, NameStr, nullptr, FlagsSource) {
  AssertOK();
}

/// @returns true if the predicate of this instruction is EQ or NE.
/// Determine if this is an equality predicate.
static bool isEquality(Predicate Pred) {
  return Pred == FCMP_OEQ || Pred == FCMP_ONE || Pred == FCMP_UEQ ||
         Pred == FCMP_UNE;
}

/// @returns true if the predicate of this instruction is EQ or NE.
/// Determine if this is an equality predicate.
bool isEquality() const { return isEquality(getPredicate()); }

/// @returns true if the predicate of this instruction is commutative.
/// Determine if this is a commutative predicate.
bool isCommutative() const {
  return isEquality() ||
         getPredicate() == FCMP_FALSE ||
         getPredicate() == FCMP_TRUE ||
         getPredicate() == FCMP_ORD ||
         getPredicate() == FCMP_UNO;
}

/// @returns true if the predicate is relational (not EQ or NE).
/// Determine if this a relational predicate.
bool isRelational() const { return !isEquality(); }

/// Exchange the two operands to this instruction in such a way that it does
/// not modify the semantics of the instruction. The predicate value may be
/// changed to retain the same result if the predicate is order dependent
/// (e.g. ult).
/// Swap operands and adjust predicate.
void swapOperands() {
  setPredicate(getSwappedPredicate());
  Op<0>().swap(Op<1>());
}

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::FCmp;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1467};

1469//===----------------------------------------------------------------------===//
1470/// This class represents a function call, abstracting a target
1471/// machine's calling convention.  This class uses low bit of the SubClassData
1472/// field to indicate whether or not this is a tail call.  The rest of the bits
1473/// hold the calling convention of the call.
1474///
1475class CallInst : public CallBase {
CallInst(const CallInst &CI);

/// Construct a CallInst given a range of arguments.
/// Construct a CallInst from a range of arguments
inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                Instruction *InsertBefore);

inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                const Twine &NameStr, Instruction *InsertBefore)
    : CallInst(Ty, Func, Args, None, NameStr, InsertBefore) {}

/// Construct a CallInst given a range of arguments.
/// Construct a CallInst from a range of arguments
inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

explicit CallInst(FunctionType *Ty, Value *F, const Twine &NameStr,
                  Instruction *InsertBefore);

CallInst(FunctionType *ty, Value *F, const Twine &NameStr,
         BasicBlock *InsertAtEnd);

void init(FunctionType *FTy, Value *Func, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr);
void init(FunctionType *FTy, Value *Func, const Twine &NameStr);

/// Compute the number of operands to allocate.
static int ComputeNumOperands(int NumArgs, int NumBundleInputs = 0) {
  // We need one operand for the called function, plus the input operand
  // counts provided.
  return 1 + NumArgs + NumBundleInputs;
}

1511protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

CallInst *cloneImpl() const;

1517public:
static CallInst *Create(FunctionType *Ty, Value *F, const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  return new (ComputeNumOperands(0)) CallInst(Ty, F, NameStr, InsertBefore);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        const Twine &NameStr,
                        Instruction *InsertBefore = nullptr) {
  return new (ComputeNumOperands(Args.size()))
      CallInst(Ty, Func, Args, None, NameStr, InsertBefore);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles = None,
                        const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  const int NumOperands =
      ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
  const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      CallInst(Ty, Func, Args, Bundles, NameStr, InsertBefore);
}

static CallInst *Create(FunctionType *Ty, Value *F, const Twine &NameStr,
                        BasicBlock *InsertAtEnd) {
  return new (ComputeNumOperands(0)) CallInst(Ty, F, NameStr, InsertAtEnd);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return new (ComputeNumOperands(Args.size()))
      CallInst(Ty, Func, Args, None, NameStr, InsertAtEnd);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  const int NumOperands =
      ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
  const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      CallInst(Ty, Func, Args, Bundles, NameStr, InsertAtEnd);
}

static CallInst *Create(FunctionCallee Func, const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), NameStr,
                InsertBefore);
}

static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles = None,
                        const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), Args, Bundles,
                NameStr, InsertBefore);
}

static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args,
                        const Twine &NameStr,
                        Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), Args, NameStr,
                InsertBefore);
}

static CallInst *Create(FunctionCallee Func, const Twine &NameStr,
                        BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), NameStr,
                InsertAtEnd);
}

static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), Args, NameStr,
                InsertAtEnd);
}

static CallInst *Create(FunctionCallee Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), Args, Bundles,
                NameStr, InsertAtEnd);
}

/// Create a clone of \p CI with a different set of operand bundles and
/// insert it before \p InsertPt.
///
/// The returned call instruction is identical \p CI in every way except that
/// the operand bundles for the new instruction are set to the operand bundles
/// in \p Bundles.
static CallInst *Create(CallInst *CI, ArrayRef<OperandBundleDef> Bundles,
                        Instruction *InsertPt = nullptr);

/// Generate the IR for a call to malloc:
/// 1. Compute the malloc call's argument as the specified type's size,
///    possibly multiplied by the array size if the array size is not
///    constant 1.
/// 2. Call malloc with that argument.
/// 3. Bitcast the result of the malloc call to the specified type.
static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 ArrayRef<OperandBundleDef> Bundles = None,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 ArrayRef<OperandBundleDef> Bundles = None,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
/// Generate the IR for a call to the builtin free function.
static Instruction *CreateFree(Value *Source, Instruction *InsertBefore);
static Instruction *CreateFree(Value *Source, BasicBlock *InsertAtEnd);
static Instruction *CreateFree(Value *Source,
                               ArrayRef<OperandBundleDef> Bundles,
                               Instruction *InsertBefore);
static Instruction *CreateFree(Value *Source,
                               ArrayRef<OperandBundleDef> Bundles,
                               BasicBlock *InsertAtEnd);

// Note that 'musttail' implies 'tail'.
enum TailCallKind : unsigned {
  TCK_None = 0,
  TCK_Tail = 1,
  TCK_MustTail = 2,
  TCK_NoTail = 3,
  TCK_LAST = TCK_NoTail
};

using TailCallKindField = Bitfield::Element<TailCallKind, 0, 2, TCK_LAST>;
static_assert(
    Bitfield::areContiguous<TailCallKindField, CallBase::CallingConvField>(),
    "Bitfields must be contiguous");

TailCallKind getTailCallKind() const {
  return getSubclassData<TailCallKindField>();
}

bool isTailCall() const {
  TailCallKind Kind = getTailCallKind();
  return Kind == TCK_Tail || Kind == TCK_MustTail;
}

bool isMustTailCall() const { return getTailCallKind() == TCK_MustTail; }

bool isNoTailCall() const { return getTailCallKind() == TCK_NoTail; }

void setTailCallKind(TailCallKind TCK) {
  setSubclassData<TailCallKindField>(TCK);
}

void setTailCall(bool IsTc = true) {
  setTailCallKind(IsTc ? TCK_Tail : TCK_None);
}

/// Return true if the call can return twice
bool canReturnTwice() const { return hasFnAttr(Attribute::ReturnsTwice); }
void setCanReturnTwice() { addFnAttr(Attribute::ReturnsTwice); }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Call;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

/// Updates profile metadata by scaling it by \p S / \p T.
void updateProfWeight(uint64_t S, uint64_t T);

1701private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}
1708};

1710CallInst::CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                 ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                 BasicBlock *InsertAtEnd)
  : CallBase(Ty->getReturnType(), Instruction::Call,
             OperandTraits<CallBase>::op_end(this) -
                 (Args.size() + CountBundleInputs(Bundles) + 1),
             unsigned(Args.size() + CountBundleInputs(Bundles) + 1),
             InsertAtEnd) {
init(Ty, Func, Args, Bundles, NameStr);
1719}

1721CallInst::CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                 ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                 Instruction *InsertBefore)
  : CallBase(Ty->getReturnType(), Instruction::Call,
             OperandTraits<CallBase>::op_end(this) -
                 (Args.size() + CountBundleInputs(Bundles) + 1),
             unsigned(Args.size() + CountBundleInputs(Bundles) + 1),
             InsertBefore) {
init(Ty, Func, Args, Bundles, NameStr);
1730}

1732//===----------------------------------------------------------------------===//
1733//                               SelectInst Class
1734//===----------------------------------------------------------------------===//

1736/// This class represents the LLVM 'select' instruction.
1737///
1738class SelectInst : public Instruction {
SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr,
           Instruction *InsertBefore)
  : Instruction(S1->getType(), Instruction::Select,
                &Op<0>(), 3, InsertBefore) {
  init(C, S1, S2);
  setName(NameStr);
}

SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr,
           BasicBlock *InsertAtEnd)
  : Instruction(S1->getType(), Instruction::Select,
                &Op<0>(), 3, InsertAtEnd) {
  init(C, S1, S2);
  setName(NameStr);
}

void init(Value *C, Value *S1, Value *S2) {
  assert(!areInvalidOperands(C, S1, S2) && "Invalid operands for select")(static_cast <bool> (!areInvalidOperands(C, S1, S2) &&
 "Invalid operands for select") ? void (0) : __assert_fail ("!areInvalidOperands(C, S1, S2) && \"Invalid operands for select\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1756, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = C;
  Op<1>() = S1;
  Op<2>() = S2;
}

1762protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

SelectInst *cloneImpl() const;

1768public:
static SelectInst *Create(Value *C, Value *S1, Value *S2,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr,
                          Instruction *MDFrom = nullptr) {
  SelectInst *Sel = new(3) SelectInst(C, S1, S2, NameStr, InsertBefore);
  if (MDFrom)
    Sel->copyMetadata(*MDFrom);
  return Sel;
}

static SelectInst *Create(Value *C, Value *S1, Value *S2,
                          const Twine &NameStr,
                          BasicBlock *InsertAtEnd) {
  return new(3) SelectInst(C, S1, S2, NameStr, InsertAtEnd);
}

const Value *getCondition() const { return Op<0>(); }
const Value *getTrueValue() const { return Op<1>(); }
const Value *getFalseValue() const { return Op<2>(); }
Value *getCondition() { return Op<0>(); }
Value *getTrueValue() { return Op<1>(); }
Value *getFalseValue() { return Op<2>(); }

void setCondition(Value *V) { Op<0>() = V; }
void setTrueValue(Value *V) { Op<1>() = V; }
void setFalseValue(Value *V) { Op<2>() = V; }

/// Swap the true and false values of the select instruction.
/// This doesn't swap prof metadata.
void swapValues() { Op<1>().swap(Op<2>()); }

/// Return a string if the specified operands are invalid
/// for a select operation, otherwise return null.
static const char *areInvalidOperands(Value *Cond, Value *True, Value *False);

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

OtherOps getOpcode() const {
  return static_cast<OtherOps>(Instruction::getOpcode());
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Select;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1818};

1820template <>
1821struct OperandTraits<SelectInst> : public FixedNumOperandTraits<SelectInst, 3> {
1822};

1824DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectInst, Value)SelectInst::op_iterator SelectInst::op_begin() { return OperandTraits
<SelectInst>::op_begin(this); } SelectInst::const_op_iterator
 SelectInst::op_begin() const { return OperandTraits<SelectInst
>::op_begin(const_cast<SelectInst*>(this)); } SelectInst
::op_iterator SelectInst::op_end() { return OperandTraits<
SelectInst>::op_end(this); } SelectInst::const_op_iterator
 SelectInst::op_end() const { return OperandTraits<SelectInst
>::op_end(const_cast<SelectInst*>(this)); } Value *SelectInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<SelectInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1824, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<SelectInst>::op_begin(const_cast
<SelectInst*>(this))[i_nocapture].get()); } void SelectInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<SelectInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1824, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
SelectInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned SelectInst::getNumOperands() const { return OperandTraits
<SelectInst>::operands(this); } template <int Idx_nocapture
> Use &SelectInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
SelectInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

1826//===----------------------------------------------------------------------===//
1827//                                VAArgInst Class
1828//===----------------------------------------------------------------------===//

1830/// This class represents the va_arg llvm instruction, which returns
1831/// an argument of the specified type given a va_list and increments that list
1832///
1833class VAArgInst : public UnaryInstruction {
1834protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

VAArgInst *cloneImpl() const;

1840public:
VAArgInst(Value *List, Type *Ty, const Twine &NameStr = "",
           Instruction *InsertBefore = nullptr)
  : UnaryInstruction(Ty, VAArg, List, InsertBefore) {
  setName(NameStr);
}

VAArgInst(Value *List, Type *Ty, const Twine &NameStr,
          BasicBlock *InsertAtEnd)
  : UnaryInstruction(Ty, VAArg, List, InsertAtEnd) {
  setName(NameStr);
}

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == VAArg;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1864};

1866//===----------------------------------------------------------------------===//
1867//                                ExtractElementInst Class
1868//===----------------------------------------------------------------------===//

1870/// This instruction extracts a single (scalar)
1871/// element from a VectorType value
1872///
1873class ExtractElementInst : public Instruction {
ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr = "",
                   Instruction *InsertBefore = nullptr);
ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr,
                   BasicBlock *InsertAtEnd);

1879protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ExtractElementInst *cloneImpl() const;

1885public:
static ExtractElementInst *Create(Value *Vec, Value *Idx,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertBefore);
}

static ExtractElementInst *Create(Value *Vec, Value *Idx,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertAtEnd);
}

/// Return true if an extractelement instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *Vec, const Value *Idx);

Value *getVectorOperand() { return Op<0>(); }
Value *getIndexOperand() { return Op<1>(); }
const Value *getVectorOperand() const { return Op<0>(); }
const Value *getIndexOperand() const { return Op<1>(); }

VectorType *getVectorOperandType() const {
  return cast<VectorType>(getVectorOperand()->getType());
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::ExtractElement;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1921};

1923template <>
1924struct OperandTraits<ExtractElementInst> :
public FixedNumOperandTraits<ExtractElementInst, 2> {
1926};

1928DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementInst, Value)ExtractElementInst::op_iterator ExtractElementInst::op_begin(
) { return OperandTraits<ExtractElementInst>::op_begin(
this); } ExtractElementInst::const_op_iterator ExtractElementInst
::op_begin() const { return OperandTraits<ExtractElementInst
>::op_begin(const_cast<ExtractElementInst*>(this)); }
 ExtractElementInst::op_iterator ExtractElementInst::op_end()
 { return OperandTraits<ExtractElementInst>::op_end(this
); } ExtractElementInst::const_op_iterator ExtractElementInst
::op_end() const { return OperandTraits<ExtractElementInst
>::op_end(const_cast<ExtractElementInst*>(this)); } Value
 *ExtractElementInst::getOperand(unsigned i_nocapture) const {
 (static_cast <bool> (i_nocapture < OperandTraits<
ExtractElementInst>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1928, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ExtractElementInst>::op_begin
(const_cast<ExtractElementInst*>(this))[i_nocapture].get
()); } void ExtractElementInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<ExtractElementInst>::operands(this)
 && "setOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1928, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ExtractElementInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned ExtractElementInst::getNumOperands() const { return
 OperandTraits<ExtractElementInst>::operands(this); } template
 <int Idx_nocapture> Use &ExtractElementInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &ExtractElementInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

1930//===----------------------------------------------------------------------===//
1931//                                InsertElementInst Class
1932//===----------------------------------------------------------------------===//

1934/// This instruction inserts a single (scalar)
1935/// element into a VectorType value
1936///
1937class InsertElementInst : public Instruction {
InsertElementInst(Value *Vec, Value *NewElt, Value *Idx,
                  const Twine &NameStr = "",
                  Instruction *InsertBefore = nullptr);
InsertElementInst(Value *Vec, Value *NewElt, Value *Idx, const Twine &NameStr,
                  BasicBlock *InsertAtEnd);

1944protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

InsertElementInst *cloneImpl() const;

1950public:
static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertBefore);
}

static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertAtEnd);
}

/// Return true if an insertelement instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *Vec, const Value *NewElt,
                            const Value *Idx);

/// Overload to return most specific vector type.
///
VectorType *getType() const {
  return cast<VectorType>(Instruction::getType());
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::InsertElement;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
1984};

1986template <>
1987struct OperandTraits<InsertElementInst> :
public FixedNumOperandTraits<InsertElementInst, 3> {
1989};

1991DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementInst, Value)InsertElementInst::op_iterator InsertElementInst::op_begin() {
 return OperandTraits<InsertElementInst>::op_begin(this
); } InsertElementInst::const_op_iterator InsertElementInst::
op_begin() const { return OperandTraits<InsertElementInst>
::op_begin(const_cast<InsertElementInst*>(this)); } InsertElementInst
::op_iterator InsertElementInst::op_end() { return OperandTraits
<InsertElementInst>::op_end(this); } InsertElementInst::
const_op_iterator InsertElementInst::op_end() const { return OperandTraits
<InsertElementInst>::op_end(const_cast<InsertElementInst
*>(this)); } Value *InsertElementInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<InsertElementInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1991, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<InsertElementInst>::op_begin
(const_cast<InsertElementInst*>(this))[i_nocapture].get
()); } void InsertElementInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<InsertElementInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 1991, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
InsertElementInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned InsertElementInst::getNumOperands() const { return
 OperandTraits<InsertElementInst>::operands(this); } template
 <int Idx_nocapture> Use &InsertElementInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &InsertElementInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

1993//===----------------------------------------------------------------------===//
1994//                           ShuffleVectorInst Class
1995//===----------------------------------------------------------------------===//

1997constexpr int UndefMaskElem = -1;

1999/// This instruction constructs a fixed permutation of two
2000/// input vectors.
2001///
2002/// For each element of the result vector, the shuffle mask selects an element
2003/// from one of the input vectors to copy to the result. Non-negative elements
2004/// in the mask represent an index into the concatenated pair of input vectors.
2005/// UndefMaskElem (-1) specifies that the result element is undefined.
2006///
2007/// For scalable vectors, all the elements of the mask must be 0 or -1. This
2008/// requirement may be relaxed in the future.
2009class ShuffleVectorInst : public Instruction {
SmallVector<int, 4> ShuffleMask;
Constant *ShuffleMaskForBitcode;

2013protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ShuffleVectorInst *cloneImpl() const;

2019public:
ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                  const Twine &NameStr = "",
                  Instruction *InsertBefor = nullptr);
ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                  const Twine &NameStr, BasicBlock *InsertAtEnd);
ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask,
                  const Twine &NameStr = "",
                  Instruction *InsertBefor = nullptr);
ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask,
                  const Twine &NameStr, BasicBlock *InsertAtEnd);

void *operator new(size_t S) { return User::operator new(S, 2); }
void operator delete(void *Ptr) { return User::operator delete(Ptr); }

/// Swap the operands and adjust the mask to preserve the semantics
/// of the instruction.
void commute();

/// Return true if a shufflevector instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *V1, const Value *V2,
                            const Value *Mask);
static bool isValidOperands(const Value *V1, const Value *V2,
                            ArrayRef<int> Mask);

/// Overload to return most specific vector type.
///
VectorType *getType() const {
  return cast<VectorType>(Instruction::getType());
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Return the shuffle mask value of this instruction for the given element
/// index. Return UndefMaskElem if the element is undef.
int getMaskValue(unsigned Elt) const { return ShuffleMask[Elt]; }

/// Convert the input shuffle mask operand to a vector of integers. Undefined
/// elements of the mask are returned as UndefMaskElem.
static void getShuffleMask(const Constant *Mask,
                           SmallVectorImpl<int> &Result);

/// Return the mask for this instruction as a vector of integers. Undefined
/// elements of the mask are returned as UndefMaskElem.
void getShuffleMask(SmallVectorImpl<int> &Result) const {
  Result.assign(ShuffleMask.begin(), ShuffleMask.end());
}

/// Return the mask for this instruction, for use in bitcode.
///
/// TODO: This is temporary until we decide a new bitcode encoding for
/// shufflevector.
Constant *getShuffleMaskForBitcode() const { return ShuffleMaskForBitcode; }

static Constant *convertShuffleMaskForBitcode(ArrayRef<int> Mask,
                                              Type *ResultTy);

void setShuffleMask(ArrayRef<int> Mask);

ArrayRef<int> getShuffleMask() const { return ShuffleMask; }

/// Return true if this shuffle returns a vector with a different number of
/// elements than its source vectors.
/// Examples: shufflevector <4 x n> A, <4 x n> B, <1,2,3>
///           shufflevector <4 x n> A, <4 x n> B, <1,2,3,4,5>
bool changesLength() const {
  unsigned NumSourceElts = cast<VectorType>(Op<0>()->getType())
                               ->getElementCount()
                               .getKnownMinValue();
  unsigned NumMaskElts = ShuffleMask.size();
  return NumSourceElts != NumMaskElts;
}

/// Return true if this shuffle returns a vector with a greater number of
/// elements than its source vectors.
/// Example: shufflevector <2 x n> A, <2 x n> B, <1,2,3>
bool increasesLength() const {
  unsigned NumSourceElts = cast<VectorType>(Op<0>()->getType())
                               ->getElementCount()
                               .getKnownMinValue();
  unsigned NumMaskElts = ShuffleMask.size();
  return NumSourceElts < NumMaskElts;
}

/// Return true if this shuffle mask chooses elements from exactly one source
/// vector.
/// Example: <7,5,undef,7>
/// This assumes that vector operands are the same length as the mask.
static bool isSingleSourceMask(ArrayRef<int> Mask);
static bool isSingleSourceMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2111, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isSingleSourceMask(MaskAsInts);
}

/// Return true if this shuffle chooses elements from exactly one source
/// vector without changing the length of that vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <3,0,undef,3>
/// TODO: Optionally allow length-changing shuffles.
bool isSingleSource() const {
  return !changesLength() && isSingleSourceMask(ShuffleMask);
}

/// Return true if this shuffle mask chooses elements from exactly one source
/// vector without lane crossings. A shuffle using this mask is not
/// necessarily a no-op because it may change the number of elements from its
/// input vectors or it may provide demanded bits knowledge via undef lanes.
/// Example: <undef,undef,2,3>
static bool isIdentityMask(ArrayRef<int> Mask);
static bool isIdentityMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2132, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isIdentityMask(MaskAsInts);
}

/// Return true if this shuffle chooses elements from exactly one source
/// vector without lane crossings and does not change the number of elements
/// from its input vectors.
/// Example: shufflevector <4 x n> A, <4 x n> B, <4,undef,6,undef>
bool isIdentity() const {
  return !changesLength() && isIdentityMask(ShuffleMask);
}

/// Return true if this shuffle lengthens exactly one source vector with
/// undefs in the high elements.
bool isIdentityWithPadding() const;

/// Return true if this shuffle extracts the first N elements of exactly one
/// source vector.
bool isIdentityWithExtract() const;

/// Return true if this shuffle concatenates its 2 source vectors. This
/// returns false if either input is undefined. In that case, the shuffle is
/// is better classified as an identity with padding operation.
bool isConcat() const;

/// Return true if this shuffle mask chooses elements from its source vectors
/// without lane crossings. A shuffle using this mask would be
/// equivalent to a vector select with a constant condition operand.
/// Example: <4,1,6,undef>
/// This returns false if the mask does not choose from both input vectors.
/// In that case, the shuffle is better classified as an identity shuffle.
/// This assumes that vector operands are the same length as the mask
/// (a length-changing shuffle can never be equivalent to a vector select).
static bool isSelectMask(ArrayRef<int> Mask);
static bool isSelectMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2169, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isSelectMask(MaskAsInts);
}

/// Return true if this shuffle chooses elements from its source vectors
/// without lane crossings and all operands have the same number of elements.
/// In other words, this shuffle is equivalent to a vector select with a
/// constant condition operand.
/// Example: shufflevector <4 x n> A, <4 x n> B, <undef,1,6,3>
/// This returns false if the mask does not choose from both input vectors.
/// In that case, the shuffle is better classified as an identity shuffle.
/// TODO: Optionally allow length-changing shuffles.
bool isSelect() const {
  return !changesLength() && isSelectMask(ShuffleMask);
}

/// Return true if this shuffle mask swaps the order of elements from exactly
/// one source vector.
/// Example: <7,6,undef,4>
/// This assumes that vector operands are the same length as the mask.
static bool isReverseMask(ArrayRef<int> Mask);
static bool isReverseMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2193, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isReverseMask(MaskAsInts);
}

/// Return true if this shuffle swaps the order of elements from exactly
/// one source vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <3,undef,1,undef>
/// TODO: Optionally allow length-changing shuffles.
bool isReverse() const {
  return !changesLength() && isReverseMask(ShuffleMask);
}

/// Return true if this shuffle mask chooses all elements with the same value
/// as the first element of exactly one source vector.
/// Example: <4,undef,undef,4>
/// This assumes that vector operands are the same length as the mask.
static bool isZeroEltSplatMask(ArrayRef<int> Mask);
static bool isZeroEltSplatMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2213, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isZeroEltSplatMask(MaskAsInts);
}

/// Return true if all elements of this shuffle are the same value as the
/// first element of exactly one source vector without changing the length
/// of that vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <undef,0,undef,0>
/// TODO: Optionally allow length-changing shuffles.
/// TODO: Optionally allow splats from other elements.
bool isZeroEltSplat() const {
  return !changesLength() && isZeroEltSplatMask(ShuffleMask);
}

/// Return true if this shuffle mask is a transpose mask.
/// Transpose vector masks transpose a 2xn matrix. They read corresponding
/// even- or odd-numbered vector elements from two n-dimensional source
/// vectors and write each result into consecutive elements of an
/// n-dimensional destination vector. Two shuffles are necessary to complete
/// the transpose, one for the even elements and another for the odd elements.
/// This description closely follows how the TRN1 and TRN2 AArch64
/// instructions operate.
///
/// For example, a simple 2x2 matrix can be transposed with:
///
///   ; Original matrix
///   m0 = < a, b >
///   m1 = < c, d >
///
///   ; Transposed matrix
///   t0 = < a, c > = shufflevector m0, m1, < 0, 2 >
///   t1 = < b, d > = shufflevector m0, m1, < 1, 3 >
///
/// For matrices having greater than n columns, the resulting nx2 transposed
/// matrix is stored in two result vectors such that one vector contains
/// interleaved elements from all the even-numbered rows and the other vector
/// contains interleaved elements from all the odd-numbered rows. For example,
/// a 2x4 matrix can be transposed with:
///
///   ; Original matrix
///   m0 = < a, b, c, d >
///   m1 = < e, f, g, h >
///
///   ; Transposed matrix
///   t0 = < a, e, c, g > = shufflevector m0, m1 < 0, 4, 2, 6 >
///   t1 = < b, f, d, h > = shufflevector m0, m1 < 1, 5, 3, 7 >
static bool isTransposeMask(ArrayRef<int> Mask);
static bool isTransposeMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2263, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isTransposeMask(MaskAsInts);
}

/// Return true if this shuffle transposes the elements of its inputs without
/// changing the length of the vectors. This operation may also be known as a
/// merge or interleave. See the description for isTransposeMask() for the
/// exact specification.
/// Example: shufflevector <4 x n> A, <4 x n> B, <0,4,2,6>
bool isTranspose() const {
  return !changesLength() && isTransposeMask(ShuffleMask);
}

/// Return true if this shuffle mask is an extract subvector mask.
/// A valid extract subvector mask returns a smaller vector from a single
/// source operand. The base extraction index is returned as well.
static bool isExtractSubvectorMask(ArrayRef<int> Mask, int NumSrcElts,
                                   int &Index);
static bool isExtractSubvectorMask(const Constant *Mask, int NumSrcElts,
                                   int &Index) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2285, __extension__ __PRETTY_FUNCTION__));
  // Not possible to express a shuffle mask for a scalable vector for this
  // case.
  if (isa<ScalableVectorType>(Mask->getType()))
    return false;
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isExtractSubvectorMask(MaskAsInts, NumSrcElts, Index);
}

/// Return true if this shuffle mask is an extract subvector mask.
bool isExtractSubvectorMask(int &Index) const {
  // Not possible to express a shuffle mask for a scalable vector for this
  // case.
  if (isa<ScalableVectorType>(getType()))
    return false;

  int NumSrcElts =
      cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
  return isExtractSubvectorMask(ShuffleMask, NumSrcElts, Index);
}

/// Return true if this shuffle mask is an insert subvector mask.
/// A valid insert subvector mask inserts the lowest elements of a second
/// source operand into an in-place first source operand operand.
/// Both the sub vector width and the insertion index is returned.
static bool isInsertSubvectorMask(ArrayRef<int> Mask, int NumSrcElts,
                                  int &NumSubElts, int &Index);
static bool isInsertSubvectorMask(const Constant *Mask, int NumSrcElts,
                                  int &NumSubElts, int &Index) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2315, __extension__ __PRETTY_FUNCTION__));
  // Not possible to express a shuffle mask for a scalable vector for this
  // case.
  if (isa<ScalableVectorType>(Mask->getType()))
    return false;
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isInsertSubvectorMask(MaskAsInts, NumSrcElts, NumSubElts, Index);
}

/// Return true if this shuffle mask is an insert subvector mask.
bool isInsertSubvectorMask(int &NumSubElts, int &Index) const {
  // Not possible to express a shuffle mask for a scalable vector for this
  // case.
  if (isa<ScalableVectorType>(getType()))
    return false;

  int NumSrcElts =
      cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
  return isInsertSubvectorMask(ShuffleMask, NumSrcElts, NumSubElts, Index);
}

/// Change values in a shuffle permute mask assuming the two vector operands
/// of length InVecNumElts have swapped position.
static void commuteShuffleMask(MutableArrayRef<int> Mask,
                               unsigned InVecNumElts) {
  for (int &Idx : Mask) {
    if (Idx == -1)
      continue;
    Idx = Idx < (int)InVecNumElts ? Idx + InVecNumElts : Idx - InVecNumElts;
    assert(Idx >= 0 && Idx < (int)InVecNumElts * 2 &&(static_cast <bool> (Idx >= 0 && Idx < (int
)InVecNumElts * 2 && "shufflevector mask index out of range"
) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2346, __extension__ __PRETTY_FUNCTION__))
           "shufflevector mask index out of range")(static_cast <bool> (Idx >= 0 && Idx < (int
)InVecNumElts * 2 && "shufflevector mask index out of range"
) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2346, __extension__ __PRETTY_FUNCTION__));
  }
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::ShuffleVector;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
2357};

2359template <>
2360struct OperandTraits<ShuffleVectorInst>
  : public FixedNumOperandTraits<ShuffleVectorInst, 2> {};

2363DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorInst, Value)ShuffleVectorInst::op_iterator ShuffleVectorInst::op_begin() {
 return OperandTraits<ShuffleVectorInst>::op_begin(this
); } ShuffleVectorInst::const_op_iterator ShuffleVectorInst::
op_begin() const { return OperandTraits<ShuffleVectorInst>
::op_begin(const_cast<ShuffleVectorInst*>(this)); } ShuffleVectorInst
::op_iterator ShuffleVectorInst::op_end() { return OperandTraits
<ShuffleVectorInst>::op_end(this); } ShuffleVectorInst::
const_op_iterator ShuffleVectorInst::op_end() const { return OperandTraits
<ShuffleVectorInst>::op_end(const_cast<ShuffleVectorInst
*>(this)); } Value *ShuffleVectorInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<ShuffleVectorInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2363, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ShuffleVectorInst>::op_begin
(const_cast<ShuffleVectorInst*>(this))[i_nocapture].get
()); } void ShuffleVectorInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<ShuffleVectorInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2363, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ShuffleVectorInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned ShuffleVectorInst::getNumOperands() const { return
 OperandTraits<ShuffleVectorInst>::operands(this); } template
 <int Idx_nocapture> Use &ShuffleVectorInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &ShuffleVectorInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

2365//===----------------------------------------------------------------------===//
2366//                                ExtractValueInst Class
2367//===----------------------------------------------------------------------===//

2369/// This instruction extracts a struct member or array
2370/// element value from an aggregate value.
2371///
2372class ExtractValueInst : public UnaryInstruction {
SmallVector<unsigned, 4> Indices;

ExtractValueInst(const ExtractValueInst &EVI);

/// Constructors - Create a extractvalue instruction with a base aggregate
/// value and a list of indices.  The first ctor can optionally insert before
/// an existing instruction, the second appends the new instruction to the
/// specified BasicBlock.
inline ExtractValueInst(Value *Agg,
                        ArrayRef<unsigned> Idxs,
                        const Twine &NameStr,
                        Instruction *InsertBefore);
inline ExtractValueInst(Value *Agg,
                        ArrayRef<unsigned> Idxs,
                        const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(ArrayRef<unsigned> Idxs, const Twine &NameStr);

2391protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ExtractValueInst *cloneImpl() const;

2397public:
static ExtractValueInst *Create(Value *Agg,
                                ArrayRef<unsigned> Idxs,
                                const Twine &NameStr = "",
                                Instruction *InsertBefore = nullptr) {
  return new
    ExtractValueInst(Agg, Idxs, NameStr, InsertBefore);
}

static ExtractValueInst *Create(Value *Agg,
                                ArrayRef<unsigned> Idxs,
                                const Twine &NameStr,
                                BasicBlock *InsertAtEnd) {
  return new ExtractValueInst(Agg, Idxs, NameStr, InsertAtEnd);
}

/// Returns the type of the element that would be extracted
/// with an extractvalue instruction with the specified parameters.
///
/// Null is returned if the indices are invalid for the specified type.
static Type *getIndexedType(Type *Agg, ArrayRef<unsigned> Idxs);

using idx_iterator = const unsigned*;

inline idx_iterator idx_begin() const { return Indices.begin(); }
inline idx_iterator idx_end()   const { return Indices.end(); }
inline iterator_range<idx_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getAggregateOperand() {
  return getOperand(0);
}
const Value *getAggregateOperand() const {
  return getOperand(0);
}
static unsigned getAggregateOperandIndex() {
  return 0U;                      // get index for modifying correct operand
}

ArrayRef<unsigned> getIndices() const {
  return Indices;
}

unsigned getNumIndices() const {
  return (unsigned)Indices.size();
}

bool hasIndices() const {
  return true;
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::ExtractValue;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
2456};

2458ExtractValueInst::ExtractValueInst(Value *Agg,
                                 ArrayRef<unsigned> Idxs,
                                 const Twine &NameStr,
                                 Instruction *InsertBefore)
: UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)),
                   ExtractValue, Agg, InsertBefore) {
init(Idxs, NameStr);
2465}

2467ExtractValueInst::ExtractValueInst(Value *Agg,
                                 ArrayRef<unsigned> Idxs,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd)
: UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)),
                   ExtractValue, Agg, InsertAtEnd) {
init(Idxs, NameStr);
2474}

2476//===----------------------------------------------------------------------===//
2477//                                InsertValueInst Class
2478//===----------------------------------------------------------------------===//

2480/// This instruction inserts a struct field of array element
2481/// value into an aggregate value.
2482///
2483class InsertValueInst : public Instruction {
SmallVector<unsigned, 4> Indices;

InsertValueInst(const InsertValueInst &IVI);

/// Constructors - Create a insertvalue instruction with a base aggregate
/// value, a value to insert, and a list of indices.  The first ctor can
/// optionally insert before an existing instruction, the second appends
/// the new instruction to the specified BasicBlock.
inline InsertValueInst(Value *Agg, Value *Val,
                       ArrayRef<unsigned> Idxs,
                       const Twine &NameStr,
                       Instruction *InsertBefore);
inline InsertValueInst(Value *Agg, Value *Val,
                       ArrayRef<unsigned> Idxs,
                       const Twine &NameStr, BasicBlock *InsertAtEnd);

/// Constructors - These two constructors are convenience methods because one
/// and two index insertvalue instructions are so common.
InsertValueInst(Value *Agg, Value *Val, unsigned Idx,
                const Twine &NameStr = "",
                Instruction *InsertBefore = nullptr);
InsertValueInst(Value *Agg, Value *Val, unsigned Idx, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

void init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
          const Twine &NameStr);

2511protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

InsertValueInst *cloneImpl() const;

2517public:
// allocate space for exactly two operands
void *operator new(size_t S) { return User::operator new(S, 2); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

static InsertValueInst *Create(Value *Agg, Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr = "",
                               Instruction *InsertBefore = nullptr) {
  return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertBefore);
11
←
Passing null pointer value via 1st parameter 'Agg'→
12
←
Calling constructor for 'InsertValueInst'→
}

static InsertValueInst *Create(Value *Agg, Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               BasicBlock *InsertAtEnd) {
  return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertAtEnd);
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

using idx_iterator = const unsigned*;

inline idx_iterator idx_begin() const { return Indices.begin(); }
inline idx_iterator idx_end()   const { return Indices.end(); }
inline iterator_range<idx_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getAggregateOperand() {
  return getOperand(0);
}
const Value *getAggregateOperand() const {
  return getOperand(0);
}
static unsigned getAggregateOperandIndex() {
  return 0U;                      // get index for modifying correct operand
}

Value *getInsertedValueOperand() {
  return getOperand(1);
}
const Value *getInsertedValueOperand() const {
  return getOperand(1);
}
static unsigned getInsertedValueOperandIndex() {
  return 1U;                      // get index for modifying correct operand
}

ArrayRef<unsigned> getIndices() const {
  return Indices;
}

unsigned getNumIndices() const {
  return (unsigned)Indices.size();
}

bool hasIndices() const {
  return true;
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::InsertValue;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
2586};

2588template <>
2589struct OperandTraits<InsertValueInst> :
public FixedNumOperandTraits<InsertValueInst, 2> {
2591};

2593InsertValueInst::InsertValueInst(Value *Agg,
                               Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               Instruction *InsertBefore)
: Instruction(Agg->getType(), InsertValue,
13
←
Called C++ object pointer is null
              OperandTraits<InsertValueInst>::op_begin(this),
              2, InsertBefore) {
init(Agg, Val, Idxs, NameStr);
2602}

2604InsertValueInst::InsertValueInst(Value *Agg,
                               Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               BasicBlock *InsertAtEnd)
: Instruction(Agg->getType(), InsertValue,
              OperandTraits<InsertValueInst>::op_begin(this),
              2, InsertAtEnd) {
init(Agg, Val, Idxs, NameStr);
2613}

2615DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueInst, Value)InsertValueInst::op_iterator InsertValueInst::op_begin() { return
 OperandTraits<InsertValueInst>::op_begin(this); } InsertValueInst
::const_op_iterator InsertValueInst::op_begin() const { return
 OperandTraits<InsertValueInst>::op_begin(const_cast<
InsertValueInst*>(this)); } InsertValueInst::op_iterator InsertValueInst
::op_end() { return OperandTraits<InsertValueInst>::op_end
(this); } InsertValueInst::const_op_iterator InsertValueInst::
op_end() const { return OperandTraits<InsertValueInst>::
op_end(const_cast<InsertValueInst*>(this)); } Value *InsertValueInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<InsertValueInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2615, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<InsertValueInst>::op_begin
(const_cast<InsertValueInst*>(this))[i_nocapture].get()
); } void InsertValueInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<InsertValueInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2615, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
InsertValueInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned InsertValueInst::getNumOperands() const { return
 OperandTraits<InsertValueInst>::operands(this); } template
 <int Idx_nocapture> Use &InsertValueInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &InsertValueInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

2617//===----------------------------------------------------------------------===//
2618//                               PHINode Class
2619//===----------------------------------------------------------------------===//

2621// PHINode - The PHINode class is used to represent the magical mystical PHI
2622// node, that can not exist in nature, but can be synthesized in a computer
2623// scientist's overactive imagination.
2624//
2625class PHINode : public Instruction {
/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

PHINode(const PHINode &PN);

explicit PHINode(Type *Ty, unsigned NumReservedValues,
                 const Twine &NameStr = "",
                 Instruction *InsertBefore = nullptr)
  : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertBefore),
    ReservedSpace(NumReservedValues) {
  assert(!Ty->isTokenTy() && "PHI nodes cannot have token type!")(static_cast <bool> (!Ty->isTokenTy() && "PHI nodes cannot have token type!"
) ? void (0) : __assert_fail ("!Ty->isTokenTy() && \"PHI nodes cannot have token type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2637, __extension__ __PRETTY_FUNCTION__));
  setName(NameStr);
  allocHungoffUses(ReservedSpace);
}

PHINode(Type *Ty, unsigned NumReservedValues, const Twine &NameStr,
        BasicBlock *InsertAtEnd)
  : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertAtEnd),
    ReservedSpace(NumReservedValues) {
  assert(!Ty->isTokenTy() && "PHI nodes cannot have token type!")(static_cast <bool> (!Ty->isTokenTy() && "PHI nodes cannot have token type!"
) ? void (0) : __assert_fail ("!Ty->isTokenTy() && \"PHI nodes cannot have token type!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2646, __extension__ __PRETTY_FUNCTION__));
  setName(NameStr);
  allocHungoffUses(ReservedSpace);
}

2651protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

PHINode *cloneImpl() const;

// allocHungoffUses - this is more complicated than the generic
// User::allocHungoffUses, because we have to allocate Uses for the incoming
// values and pointers to the incoming blocks, all in one allocation.
void allocHungoffUses(unsigned N) {
  User::allocHungoffUses(N, /* IsPhi */ true);
}

2664public:
/// Constructors - NumReservedValues is a hint for the number of incoming
/// edges that this phi node will have (use 0 if you really have no idea).
static PHINode *Create(Type *Ty, unsigned NumReservedValues,
                       const Twine &NameStr = "",
                       Instruction *InsertBefore = nullptr) {
  return new PHINode(Ty, NumReservedValues, NameStr, InsertBefore);
}

static PHINode *Create(Type *Ty, unsigned NumReservedValues,
                       const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return new PHINode(Ty, NumReservedValues, NameStr, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Block iterator interface. This provides access to the list of incoming
// basic blocks, which parallels the list of incoming values.

using block_iterator = BasicBlock **;
using const_block_iterator = BasicBlock * const *;

block_iterator block_begin() {
  return reinterpret_cast<block_iterator>(op_begin() + ReservedSpace);
}

const_block_iterator block_begin() const {
  return reinterpret_cast<const_block_iterator>(op_begin() + ReservedSpace);
}

block_iterator block_end() {
  return block_begin() + getNumOperands();
}

const_block_iterator block_end() const {
  return block_begin() + getNumOperands();
}

iterator_range<block_iterator> blocks() {
  return make_range(block_begin(), block_end());
}

iterator_range<const_block_iterator> blocks() const {
  return make_range(block_begin(), block_end());
}

op_range incoming_values() { return operands(); }

const_op_range incoming_values() const { return operands(); }

/// Return the number of incoming edges
///
unsigned getNumIncomingValues() const { return getNumOperands(); }

/// Return incoming value number x
///
Value *getIncomingValue(unsigned i) const {
  return getOperand(i);
}
void setIncomingValue(unsigned i, Value *V) {
  assert(V && "PHI node got a null value!")(static_cast <bool> (V && "PHI node got a null value!"
) ? void (0) : __assert_fail ("V && \"PHI node got a null value!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2725, __extension__ __PRETTY_FUNCTION__));
  assert(getType() == V->getType() &&(static_cast <bool> (getType() == V->getType() &&
 "All operands to PHI node must be the same type as the PHI node!"
) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2727, __extension__ __PRETTY_FUNCTION__))
         "All operands to PHI node must be the same type as the PHI node!")(static_cast <bool> (getType() == V->getType() &&
 "All operands to PHI node must be the same type as the PHI node!"
) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2727, __extension__ __PRETTY_FUNCTION__));
  setOperand(i, V);
}

static unsigned getOperandNumForIncomingValue(unsigned i) {
  return i;
}

static unsigned getIncomingValueNumForOperand(unsigned i) {
  return i;
}

/// Return incoming basic block number @p i.
///
BasicBlock *getIncomingBlock(unsigned i) const {
  return block_begin()[i];
}

/// Return incoming basic block corresponding
/// to an operand of the PHI.
///
BasicBlock *getIncomingBlock(const Use &U) const {
  assert(this == U.getUser() && "Iterator doesn't point to PHI's Uses?")(static_cast <bool> (this == U.getUser() && "Iterator doesn't point to PHI's Uses?"
) ? void (0) : __assert_fail ("this == U.getUser() && \"Iterator doesn't point to PHI's Uses?\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2749, __extension__ __PRETTY_FUNCTION__));
  return getIncomingBlock(unsigned(&U - op_begin()));
}

/// Return incoming basic block corresponding
/// to value use iterator.
///
BasicBlock *getIncomingBlock(Value::const_user_iterator I) const {
  return getIncomingBlock(I.getUse());
}

void setIncomingBlock(unsigned i, BasicBlock *BB) {
  assert(BB && "PHI node got a null basic block!")(static_cast <bool> (BB && "PHI node got a null basic block!"
) ? void (0) : __assert_fail ("BB && \"PHI node got a null basic block!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2761, __extension__ __PRETTY_FUNCTION__));
  block_begin()[i] = BB;
}

/// Replace every incoming basic block \p Old to basic block \p New.
void replaceIncomingBlockWith(const BasicBlock *Old, BasicBlock *New) {
  assert(New && Old && "PHI node got a null basic block!")(static_cast <bool> (New && Old && "PHI node got a null basic block!"
) ? void (0) : __assert_fail ("New && Old && \"PHI node got a null basic block!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2767, __extension__ __PRETTY_FUNCTION__));
  for (unsigned Op = 0, NumOps = getNumOperands(); Op != NumOps; ++Op)
    if (getIncomingBlock(Op) == Old)
      setIncomingBlock(Op, New);
}

/// Add an incoming value to the end of the PHI list
///
void addIncoming(Value *V, BasicBlock *BB) {
  if (getNumOperands() == ReservedSpace)
    growOperands();  // Get more space!
  // Initialize some new operands.
  setNumHungOffUseOperands(getNumOperands() + 1);
  setIncomingValue(getNumOperands() - 1, V);
  setIncomingBlock(getNumOperands() - 1, BB);
}

/// Remove an incoming value.  This is useful if a
/// predecessor basic block is deleted.  The value removed is returned.
///
/// If the last incoming value for a PHI node is removed (and DeletePHIIfEmpty
/// is true), the PHI node is destroyed and any uses of it are replaced with
/// dummy values.  The only time there should be zero incoming values to a PHI
/// node is when the block is dead, so this strategy is sound.
///
Value *removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty = true);

Value *removeIncomingValue(const BasicBlock *BB, bool DeletePHIIfEmpty=true) {
  int Idx = getBasicBlockIndex(BB);
  assert(Idx >= 0 && "Invalid basic block argument to remove!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument to remove!"
) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument to remove!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2796, __extension__ __PRETTY_FUNCTION__));
  return removeIncomingValue(Idx, DeletePHIIfEmpty);
}

/// Return the first index of the specified basic
/// block in the value list for this PHI.  Returns -1 if no instance.
///
int getBasicBlockIndex(const BasicBlock *BB) const {
  for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
    if (block_begin()[i] == BB)
      return i;
  return -1;
}

Value *getIncomingValueForBlock(const BasicBlock *BB) const {
  int Idx = getBasicBlockIndex(BB);
  assert(Idx >= 0 && "Invalid basic block argument!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument!"
) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2812, __extension__ __PRETTY_FUNCTION__));
  return getIncomingValue(Idx);
}

/// Set every incoming value(s) for block \p BB to \p V.
void setIncomingValueForBlock(const BasicBlock *BB, Value *V) {
  assert(BB && "PHI node got a null basic block!")(static_cast <bool> (BB && "PHI node got a null basic block!"
) ? void (0) : __assert_fail ("BB && \"PHI node got a null basic block!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2818, __extension__ __PRETTY_FUNCTION__));
  bool Found = false;
  for (unsigned Op = 0, NumOps = getNumOperands(); Op != NumOps; ++Op)
    if (getIncomingBlock(Op) == BB) {
      Found = true;
      setIncomingValue(Op, V);
    }
  (void)Found;
  assert(Found && "Invalid basic block argument to set!")(static_cast <bool> (Found && "Invalid basic block argument to set!"
) ? void (0) : __assert_fail ("Found && \"Invalid basic block argument to set!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2826, __extension__ __PRETTY_FUNCTION__));
}

/// If the specified PHI node always merges together the
/// same value, return the value, otherwise return null.
Value *hasConstantValue() const;

/// Whether the specified PHI node always merges
/// together the same value, assuming undefs are equal to a unique
/// non-undef value.
bool hasConstantOrUndefValue() const;

/// If the PHI node is complete which means all of its parent's predecessors
/// have incoming value in this PHI, return true, otherwise return false.
bool isComplete() const {
  return llvm::all_of(predecessors(getParent()),
                      [this](const BasicBlock *Pred) {
                        return getBasicBlockIndex(Pred) >= 0;
                      });
}

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::PHI;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

2855private:
void growOperands();
2857};

2859template <>
2860struct OperandTraits<PHINode> : public HungoffOperandTraits<2> {
2861};

2863DEFINE_TRANSPARENT_OPERAND_ACCESSORS(PHINode, Value)PHINode::op_iterator PHINode::op_begin() { return OperandTraits
<PHINode>::op_begin(this); } PHINode::const_op_iterator
 PHINode::op_begin() const { return OperandTraits<PHINode>
::op_begin(const_cast<PHINode*>(this)); } PHINode::op_iterator
 PHINode::op_end() { return OperandTraits<PHINode>::op_end
(this); } PHINode::const_op_iterator PHINode::op_end() const {
 return OperandTraits<PHINode>::op_end(const_cast<PHINode
*>(this)); } Value *PHINode::getOperand(unsigned i_nocapture
) const { (static_cast <bool> (i_nocapture < OperandTraits
<PHINode>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2863, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<PHINode>::op_begin(const_cast
<PHINode*>(this))[i_nocapture].get()); } void PHINode::
setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<PHINode>::
operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2863, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
PHINode>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned
 PHINode::getNumOperands() const { return OperandTraits<PHINode
>::operands(this); } template <int Idx_nocapture> Use
 &PHINode::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
PHINode::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

2865//===----------------------------------------------------------------------===//
2866//                           LandingPadInst Class
2867//===----------------------------------------------------------------------===//

2869//===---------------------------------------------------------------------------
2870/// The landingpad instruction holds all of the information
2871/// necessary to generate correct exception handling. The landingpad instruction
2872/// cannot be moved from the top of a landing pad block, which itself is
2873/// accessible only from the 'unwind' edge of an invoke. This uses the
2874/// SubclassData field in Value to store whether or not the landingpad is a
2875/// cleanup.
2876///
2877class LandingPadInst : public Instruction {
using CleanupField = BoolBitfieldElementT<0>;

/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

LandingPadInst(const LandingPadInst &LP);

2886public:
enum ClauseType { Catch, Filter };

2889private:
explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                        const Twine &NameStr, Instruction *InsertBefore);
explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                        const Twine &NameStr, BasicBlock *InsertAtEnd);

// Allocate space for exactly zero operands.
void *operator new(size_t S) { return User::operator new(S); }

void growOperands(unsigned Size);
void init(unsigned NumReservedValues, const Twine &NameStr);

2901protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

LandingPadInst *cloneImpl() const;

2907public:
void operator delete(void *Ptr) { User::operator delete(Ptr); }

/// Constructors - NumReservedClauses is a hint for the number of incoming
/// clauses that this landingpad will have (use 0 if you really have no idea).
static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses,
                              const Twine &NameStr = "",
                              Instruction *InsertBefore = nullptr);
static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses,
                              const Twine &NameStr, BasicBlock *InsertAtEnd);

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Return 'true' if this landingpad instruction is a
/// cleanup. I.e., it should be run when unwinding even if its landing pad
/// doesn't catch the exception.
bool isCleanup() const { return getSubclassData<CleanupField>(); }

/// Indicate that this landingpad instruction is a cleanup.
void setCleanup(bool V) { setSubclassData<CleanupField>(V); }

/// Add a catch or filter clause to the landing pad.
void addClause(Constant *ClauseVal);

/// Get the value of the clause at index Idx. Use isCatch/isFilter to
/// determine what type of clause this is.
Constant *getClause(unsigned Idx) const {
  return cast<Constant>(getOperandList()[Idx]);
}

/// Return 'true' if the clause and index Idx is a catch clause.
bool isCatch(unsigned Idx) const {
  return !isa<ArrayType>(getOperandList()[Idx]->getType());
}

/// Return 'true' if the clause and index Idx is a filter clause.
bool isFilter(unsigned Idx) const {
  return isa<ArrayType>(getOperandList()[Idx]->getType());
}

/// Get the number of clauses for this landing pad.
unsigned getNumClauses() const { return getNumOperands(); }

/// Grow the size of the operand list to accommodate the new
/// number of clauses.
void reserveClauses(unsigned Size) { growOperands(Size); }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::LandingPad;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
2962};

2964template <>
2965struct OperandTraits<LandingPadInst> : public HungoffOperandTraits<1> {
2966};

2968DEFINE_TRANSPARENT_OPERAND_ACCESSORS(LandingPadInst, Value)LandingPadInst::op_iterator LandingPadInst::op_begin() { return
 OperandTraits<LandingPadInst>::op_begin(this); } LandingPadInst
::const_op_iterator LandingPadInst::op_begin() const { return
 OperandTraits<LandingPadInst>::op_begin(const_cast<
LandingPadInst*>(this)); } LandingPadInst::op_iterator LandingPadInst
::op_end() { return OperandTraits<LandingPadInst>::op_end
(this); } LandingPadInst::const_op_iterator LandingPadInst::op_end
() const { return OperandTraits<LandingPadInst>::op_end
(const_cast<LandingPadInst*>(this)); } Value *LandingPadInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<LandingPadInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2968, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<LandingPadInst>::op_begin(
const_cast<LandingPadInst*>(this))[i_nocapture].get());
 } void LandingPadInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<LandingPadInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 2968, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
LandingPadInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned LandingPadInst::getNumOperands() const { return OperandTraits
<LandingPadInst>::operands(this); } template <int Idx_nocapture
> Use &LandingPadInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &LandingPadInst::Op() const { return this->
OpFrom<Idx_nocapture>(this); }

2970//===----------------------------------------------------------------------===//
2971//                               ReturnInst Class
2972//===----------------------------------------------------------------------===//

2974//===---------------------------------------------------------------------------
2975/// Return a value (possibly void), from a function.  Execution
2976/// does not continue in this function any longer.
2977///
2978class ReturnInst : public Instruction {
ReturnInst(const ReturnInst &RI);

2981private:
// ReturnInst constructors:
// ReturnInst()                  - 'ret void' instruction
// ReturnInst(    null)          - 'ret void' instruction
// ReturnInst(Value* X)          - 'ret X'    instruction
// ReturnInst(    null, Inst *I) - 'ret void' instruction, insert before I
// ReturnInst(Value* X, Inst *I) - 'ret X'    instruction, insert before I
// ReturnInst(    null, BB *B)   - 'ret void' instruction, insert @ end of B
// ReturnInst(Value* X, BB *B)   - 'ret X'    instruction, insert @ end of B
//
// NOTE: If the Value* passed is of type void then the constructor behaves as
// if it was passed NULL.
explicit ReturnInst(LLVMContext &C, Value *retVal = nullptr,
                    Instruction *InsertBefore = nullptr);
ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd);
explicit ReturnInst(LLVMContext &C, BasicBlock *InsertAtEnd);

2998protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ReturnInst *cloneImpl() const;

3004public:
static ReturnInst* Create(LLVMContext &C, Value *retVal = nullptr,
                          Instruction *InsertBefore = nullptr) {
  return new(!!retVal) ReturnInst(C, retVal, InsertBefore);
}

static ReturnInst* Create(LLVMContext &C, Value *retVal,
                          BasicBlock *InsertAtEnd) {
  return new(!!retVal) ReturnInst(C, retVal, InsertAtEnd);
}

static ReturnInst* Create(LLVMContext &C, BasicBlock *InsertAtEnd) {
  return new(0) ReturnInst(C, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessor. Returns null if there is no return value.
Value *getReturnValue() const {
  return getNumOperands() != 0 ? getOperand(0) : nullptr;
}

unsigned getNumSuccessors() const { return 0; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::Ret);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

3037private:
BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3039);
}

void setSuccessor(unsigned idx, BasicBlock *B) {
  llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3043);
}
3045};

3047template <>
3048struct OperandTraits<ReturnInst> : public VariadicOperandTraits<ReturnInst> {
3049};

3051DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ReturnInst, Value)ReturnInst::op_iterator ReturnInst::op_begin() { return OperandTraits
<ReturnInst>::op_begin(this); } ReturnInst::const_op_iterator
 ReturnInst::op_begin() const { return OperandTraits<ReturnInst
>::op_begin(const_cast<ReturnInst*>(this)); } ReturnInst
::op_iterator ReturnInst::op_end() { return OperandTraits<
ReturnInst>::op_end(this); } ReturnInst::const_op_iterator
 ReturnInst::op_end() const { return OperandTraits<ReturnInst
>::op_end(const_cast<ReturnInst*>(this)); } Value *ReturnInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<ReturnInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3051, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ReturnInst>::op_begin(const_cast
<ReturnInst*>(this))[i_nocapture].get()); } void ReturnInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<ReturnInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3051, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned ReturnInst::getNumOperands() const { return OperandTraits
<ReturnInst>::operands(this); } template <int Idx_nocapture
> Use &ReturnInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
ReturnInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3053//===----------------------------------------------------------------------===//
3054//                               BranchInst Class
3055//===----------------------------------------------------------------------===//

3057//===---------------------------------------------------------------------------
3058/// Conditional or Unconditional Branch instruction.
3059///
3060class BranchInst : public Instruction {
/// Ops list - Branches are strange.  The operands are ordered:
///  [Cond, FalseDest,] TrueDest.  This makes some accessors faster because
/// they don't have to check for cond/uncond branchness. These are mostly
/// accessed relative from op_end().
BranchInst(const BranchInst &BI);
// BranchInst constructors (where {B, T, F} are blocks, and C is a condition):
// BranchInst(BB *B)                           - 'br B'
// BranchInst(BB* T, BB *F, Value *C)          - 'br C, T, F'
// BranchInst(BB* B, Inst *I)                  - 'br B'        insert before I
// BranchInst(BB* T, BB *F, Value *C, Inst *I) - 'br C, T, F', insert before I
// BranchInst(BB* B, BB *I)                    - 'br B'        insert at end
// BranchInst(BB* T, BB *F, Value *C, BB *I)   - 'br C, T, F', insert at end
explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = nullptr);
BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
           Instruction *InsertBefore = nullptr);
BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd);
BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
           BasicBlock *InsertAtEnd);

void AssertOK();

3082protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

BranchInst *cloneImpl() const;

3088public:
/// Iterator type that casts an operand to a basic block.
///
/// This only makes sense because the successors are stored as adjacent
/// operands for branch instructions.
struct succ_op_iterator
    : iterator_adaptor_base<succ_op_iterator, value_op_iterator,
                            std::random_access_iterator_tag, BasicBlock *,
                            ptrdiff_t, BasicBlock *, BasicBlock *> {
  explicit succ_op_iterator(value_op_iterator I) : iterator_adaptor_base(I) {}

  BasicBlock *operator*() const { return cast<BasicBlock>(*I); }
  BasicBlock *operator->() const { return operator*(); }
};

/// The const version of `succ_op_iterator`.
struct const_succ_op_iterator
    : iterator_adaptor_base<const_succ_op_iterator, const_value_op_iterator,
                            std::random_access_iterator_tag,
                            const BasicBlock *, ptrdiff_t, const BasicBlock *,
                            const BasicBlock *> {
  explicit const_succ_op_iterator(const_value_op_iterator I)
      : iterator_adaptor_base(I) {}

  const BasicBlock *operator*() const { return cast<BasicBlock>(*I); }
  const BasicBlock *operator->() const { return operator*(); }
};

static BranchInst *Create(BasicBlock *IfTrue,
                          Instruction *InsertBefore = nullptr) {
  return new(1) BranchInst(IfTrue, InsertBefore);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
                          Value *Cond, Instruction *InsertBefore = nullptr) {
  return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) {
  return new(1) BranchInst(IfTrue, InsertAtEnd);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
                          Value *Cond, BasicBlock *InsertAtEnd) {
  return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertAtEnd);
}

/// Transparently provide more efficient getOperand methods.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

bool isUnconditional() const { return getNumOperands() == 1; }
bool isConditional()   const { return getNumOperands() == 3; }

Value *getCondition() const {
  assert(isConditional() && "Cannot get condition of an uncond branch!")(static_cast <bool> (isConditional() && "Cannot get condition of an uncond branch!"
) ? void (0) : __assert_fail ("isConditional() && \"Cannot get condition of an uncond branch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3142, __extension__ __PRETTY_FUNCTION__));
  return Op<-3>();
}

void setCondition(Value *V) {
  assert(isConditional() && "Cannot set condition of unconditional branch!")(static_cast <bool> (isConditional() && "Cannot set condition of unconditional branch!"
) ? void (0) : __assert_fail ("isConditional() && \"Cannot set condition of unconditional branch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3147, __extension__ __PRETTY_FUNCTION__));
  Op<-3>() = V;
}

unsigned getNumSuccessors() const { return 1+isConditional(); }

BasicBlock *getSuccessor(unsigned i) const {
  assert(i < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (i < getNumSuccessors() &&
 "Successor # out of range for Branch!") ? void (0) : __assert_fail
 ("i < getNumSuccessors() && \"Successor # out of range for Branch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3154, __extension__ __PRETTY_FUNCTION__));
  return cast_or_null<BasicBlock>((&Op<-1>() - i)->get());
}

void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  assert(idx < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (idx < getNumSuccessors() &&
 "Successor # out of range for Branch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() && \"Successor # out of range for Branch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3159, __extension__ __PRETTY_FUNCTION__));
  *(&Op<-1>() - idx) = NewSucc;
}

/// Swap the successors of this branch instruction.
///
/// Swaps the successors of the branch instruction. This also swaps any
/// branch weight metadata associated with the instruction so that it
/// continues to map correctly to each operand.
void swapSuccessors();

iterator_range<succ_op_iterator> successors() {
  return make_range(
      succ_op_iterator(std::next(value_op_begin(), isConditional() ? 1 : 0)),
      succ_op_iterator(value_op_end()));
}

iterator_range<const_succ_op_iterator> successors() const {
  return make_range(const_succ_op_iterator(
                        std::next(value_op_begin(), isConditional() ? 1 : 0)),
                    const_succ_op_iterator(value_op_end()));
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::Br);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
3189};

3191template <>
3192struct OperandTraits<BranchInst> : public VariadicOperandTraits<BranchInst, 1> {
3193};

3195DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BranchInst, Value)BranchInst::op_iterator BranchInst::op_begin() { return OperandTraits
<BranchInst>::op_begin(this); } BranchInst::const_op_iterator
 BranchInst::op_begin() const { return OperandTraits<BranchInst
>::op_begin(const_cast<BranchInst*>(this)); } BranchInst
::op_iterator BranchInst::op_end() { return OperandTraits<
BranchInst>::op_end(this); } BranchInst::const_op_iterator
 BranchInst::op_end() const { return OperandTraits<BranchInst
>::op_end(const_cast<BranchInst*>(this)); } Value *BranchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<BranchInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3195, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<BranchInst>::op_begin(const_cast
<BranchInst*>(this))[i_nocapture].get()); } void BranchInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<BranchInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3195, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
BranchInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned BranchInst::getNumOperands() const { return OperandTraits
<BranchInst>::operands(this); } template <int Idx_nocapture
> Use &BranchInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
BranchInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3197//===----------------------------------------------------------------------===//
3198//                               SwitchInst Class
3199//===----------------------------------------------------------------------===//

3201//===---------------------------------------------------------------------------
3202/// Multiway switch
3203///
3204class SwitchInst : public Instruction {
unsigned ReservedSpace;

// Operand[0]    = Value to switch on
// Operand[1]    = Default basic block destination
// Operand[2n  ] = Value to match
// Operand[2n+1] = BasicBlock to go to on match
SwitchInst(const SwitchInst &SI);

/// Create a new switch instruction, specifying a value to switch on and a
/// default destination. The number of additional cases can be specified here
/// to make memory allocation more efficient. This constructor can also
/// auto-insert before another instruction.
SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
           Instruction *InsertBefore);

/// Create a new switch instruction, specifying a value to switch on and a
/// default destination. The number of additional cases can be specified here
/// to make memory allocation more efficient. This constructor also
/// auto-inserts at the end of the specified BasicBlock.
SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
           BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t S) { return User::operator new(S); }

void init(Value *Value, BasicBlock *Default, unsigned NumReserved);
void growOperands();

3233protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

SwitchInst *cloneImpl() const;

3239public:
void operator delete(void *Ptr) { User::operator delete(Ptr); }

// -2
static const unsigned DefaultPseudoIndex = static_cast<unsigned>(~0L-1);

template <typename CaseHandleT> class CaseIteratorImpl;

/// A handle to a particular switch case. It exposes a convenient interface
/// to both the case value and the successor block.
///
/// We define this as a template and instantiate it to form both a const and
/// non-const handle.
template <typename SwitchInstT, typename ConstantIntT, typename BasicBlockT>
class CaseHandleImpl {
  // Directly befriend both const and non-const iterators.
  friend class SwitchInst::CaseIteratorImpl<
      CaseHandleImpl<SwitchInstT, ConstantIntT, BasicBlockT>>;

protected:
  // Expose the switch type we're parameterized with to the iterator.
  using SwitchInstType = SwitchInstT;

  SwitchInstT *SI;
  ptrdiff_t Index;

  CaseHandleImpl() = default;
  CaseHandleImpl(SwitchInstT *SI, ptrdiff_t Index) : SI(SI), Index(Index) {}

public:
  /// Resolves case value for current case.
  ConstantIntT *getCaseValue() const {
    assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3272, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3272, __extension__ __PRETTY_FUNCTION__));
    return reinterpret_cast<ConstantIntT *>(SI->getOperand(2 + Index * 2));
  }

  /// Resolves successor for current case.
  BasicBlockT *getCaseSuccessor() const {
    assert(((unsigned)Index < SI->getNumCases() ||(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3280, __extension__ __PRETTY_FUNCTION__))
            (unsigned)Index == DefaultPseudoIndex) &&(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3280, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3280, __extension__ __PRETTY_FUNCTION__));
    return SI->getSuccessor(getSuccessorIndex());
  }

  /// Returns number of current case.
  unsigned getCaseIndex() const { return Index; }

  /// Returns successor index for current case successor.
  unsigned getSuccessorIndex() const {
    assert(((unsigned)Index == DefaultPseudoIndex ||(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3291, __extension__ __PRETTY_FUNCTION__))
            (unsigned)Index < SI->getNumCases()) &&(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3291, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3291, __extension__ __PRETTY_FUNCTION__));
    return (unsigned)Index != DefaultPseudoIndex ? Index + 1 : 0;
  }

  bool operator==(const CaseHandleImpl &RHS) const {
    assert(SI == RHS.SI && "Incompatible operators.")(static_cast <bool> (SI == RHS.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("SI == RHS.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3296, __extension__ __PRETTY_FUNCTION__));
    return Index == RHS.Index;
  }
};

using ConstCaseHandle =
    CaseHandleImpl<const SwitchInst, const ConstantInt, const BasicBlock>;

class CaseHandle
    : public CaseHandleImpl<SwitchInst, ConstantInt, BasicBlock> {
  friend class SwitchInst::CaseIteratorImpl<CaseHandle>;

public:
  CaseHandle(SwitchInst *SI, ptrdiff_t Index) : CaseHandleImpl(SI, Index) {}

  /// Sets the new value for current case.
  void setValue(ConstantInt *V) {
    assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3314, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3314, __extension__ __PRETTY_FUNCTION__));
    SI->setOperand(2 + Index*2, reinterpret_cast<Value*>(V));
  }

  /// Sets the new successor for current case.
  void setSuccessor(BasicBlock *S) {
    SI->setSuccessor(getSuccessorIndex(), S);
  }
};

template <typename CaseHandleT>
class CaseIteratorImpl
    : public iterator_facade_base<CaseIteratorImpl<CaseHandleT>,
                                  std::random_access_iterator_tag,
                                  CaseHandleT> {
  using SwitchInstT = typename CaseHandleT::SwitchInstType;

  CaseHandleT Case;

public:
  /// Default constructed iterator is in an invalid state until assigned to
  /// a case for a particular switch.
  CaseIteratorImpl() = default;

  /// Initializes case iterator for given SwitchInst and for given
  /// case number.
  CaseIteratorImpl(SwitchInstT *SI, unsigned CaseNum) : Case(SI, CaseNum) {}

  /// Initializes case iterator for given SwitchInst and for given
  /// successor index.
  static CaseIteratorImpl fromSuccessorIndex(SwitchInstT *SI,
                                             unsigned SuccessorIndex) {
    assert(SuccessorIndex < SI->getNumSuccessors() &&(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors
() && "Successor index # out of range!") ? void (0) :
 __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3347, __extension__ __PRETTY_FUNCTION__))
           "Successor index # out of range!")(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors
() && "Successor index # out of range!") ? void (0) :
 __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3347, __extension__ __PRETTY_FUNCTION__));
    return SuccessorIndex != 0 ? CaseIteratorImpl(SI, SuccessorIndex - 1)
                               : CaseIteratorImpl(SI, DefaultPseudoIndex);
  }

  /// Support converting to the const variant. This will be a no-op for const
  /// variant.
  operator CaseIteratorImpl<ConstCaseHandle>() const {
    return CaseIteratorImpl<ConstCaseHandle>(Case.SI, Case.Index);
  }

  CaseIteratorImpl &operator+=(ptrdiff_t N) {
    // Check index correctness after addition.
    // Note: Index == getNumCases() means end().
    assert(Case.Index + N >= 0 &&(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3363, __extension__ __PRETTY_FUNCTION__))
           (unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3363, __extension__ __PRETTY_FUNCTION__))
           "Case.Index out the number of cases.")(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3363, __extension__ __PRETTY_FUNCTION__));
    Case.Index += N;
    return *this;
  }
  CaseIteratorImpl &operator-=(ptrdiff_t N) {
    // Check index correctness after subtraction.
    // Note: Case.Index == getNumCases() means end().
    assert(Case.Index - N >= 0 &&(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3372, __extension__ __PRETTY_FUNCTION__))
           (unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3372, __extension__ __PRETTY_FUNCTION__))
           "Case.Index out the number of cases.")(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3372, __extension__ __PRETTY_FUNCTION__));
    Case.Index -= N;
    return *this;
  }
  ptrdiff_t operator-(const CaseIteratorImpl &RHS) const {
    assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3377, __extension__ __PRETTY_FUNCTION__));
    return Case.Index - RHS.Case.Index;
  }
  bool operator==(const CaseIteratorImpl &RHS) const {
    return Case == RHS.Case;
  }
  bool operator<(const CaseIteratorImpl &RHS) const {
    assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3384, __extension__ __PRETTY_FUNCTION__));
    return Case.Index < RHS.Case.Index;
  }
  CaseHandleT &operator*() { return Case; }
  const CaseHandleT &operator*() const { return Case; }
};

using CaseIt = CaseIteratorImpl<CaseHandle>;
using ConstCaseIt = CaseIteratorImpl<ConstCaseHandle>;

static SwitchInst *Create(Value *Value, BasicBlock *Default,
                          unsigned NumCases,
                          Instruction *InsertBefore = nullptr) {
  return new SwitchInst(Value, Default, NumCases, InsertBefore);
}

static SwitchInst *Create(Value *Value, BasicBlock *Default,
                          unsigned NumCases, BasicBlock *InsertAtEnd) {
  return new SwitchInst(Value, Default, NumCases, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for Switch stmt
Value *getCondition() const { return getOperand(0); }
void setCondition(Value *V) { setOperand(0, V); }

BasicBlock *getDefaultDest() const {
  return cast<BasicBlock>(getOperand(1));
}

void setDefaultDest(BasicBlock *DefaultCase) {
  setOperand(1, reinterpret_cast<Value*>(DefaultCase));
}

/// Return the number of 'cases' in this switch instruction, excluding the
/// default case.
unsigned getNumCases() const {
  return getNumOperands()/2 - 1;
}

/// Returns a read/write iterator that points to the first case in the
/// SwitchInst.
CaseIt case_begin() {
  return CaseIt(this, 0);
}

/// Returns a read-only iterator that points to the first case in the
/// SwitchInst.
ConstCaseIt case_begin() const {
  return ConstCaseIt(this, 0);
}

/// Returns a read/write iterator that points one past the last in the
/// SwitchInst.
CaseIt case_end() {
  return CaseIt(this, getNumCases());
}

/// Returns a read-only iterator that points one past the last in the
/// SwitchInst.
ConstCaseIt case_end() const {
  return ConstCaseIt(this, getNumCases());
}

/// Iteration adapter for range-for loops.
iterator_range<CaseIt> cases() {
  return make_range(case_begin(), case_end());
}

/// Constant iteration adapter for range-for loops.
iterator_range<ConstCaseIt> cases() const {
  return make_range(case_begin(), case_end());
}

/// Returns an iterator that points to the default case.
/// Note: this iterator allows to resolve successor only. Attempt
/// to resolve case value causes an assertion.
/// Also note, that increment and decrement also causes an assertion and
/// makes iterator invalid.
CaseIt case_default() {
  return CaseIt(this, DefaultPseudoIndex);
}
ConstCaseIt case_default() const {
  return ConstCaseIt(this, DefaultPseudoIndex);
}

/// Search all of the case values for the specified constant. If it is
/// explicitly handled, return the case iterator of it, otherwise return
/// default case iterator to indicate that it is handled by the default
/// handler.
CaseIt findCaseValue(const ConstantInt *C) {
  CaseIt I = llvm::find_if(
      cases(), [C](CaseHandle &Case) { return Case.getCaseValue() == C; });
  if (I != case_end())
    return I;

  return case_default();
}
ConstCaseIt findCaseValue(const ConstantInt *C) const {
  ConstCaseIt I = llvm::find_if(cases(), [C](ConstCaseHandle &Case) {
    return Case.getCaseValue() == C;
  });
  if (I != case_end())
    return I;

  return case_default();
}

/// Finds the unique case value for a given successor. Returns null if the
/// successor is not found, not unique, or is the default case.
ConstantInt *findCaseDest(BasicBlock *BB) {
  if (BB == getDefaultDest())
    return nullptr;

  ConstantInt *CI = nullptr;
  for (auto Case : cases()) {
    if (Case.getCaseSuccessor() != BB)
      continue;

    if (CI)
      return nullptr; // Multiple cases lead to BB.

    CI = Case.getCaseValue();
  }

  return CI;
}

/// Add an entry to the switch instruction.
/// Note:
/// This action invalidates case_end(). Old case_end() iterator will
/// point to the added case.
void addCase(ConstantInt *OnVal, BasicBlock *Dest);

/// This method removes the specified case and its successor from the switch
/// instruction. Note that this operation may reorder the remaining cases at
/// index idx and above.
/// Note:
/// This action invalidates iterators for all cases following the one removed,
/// including the case_end() iterator. It returns an iterator for the next
/// case.
CaseIt removeCase(CaseIt I);

unsigned getNumSuccessors() const { return getNumOperands()/2; }
BasicBlock *getSuccessor(unsigned idx) const {
  assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() &&
"Successor idx out of range for switch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() &&\"Successor idx out of range for switch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3531, __extension__ __PRETTY_FUNCTION__));
  return cast<BasicBlock>(getOperand(idx*2+1));
}
void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  assert(idx < getNumSuccessors() && "Successor # out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() &&
 "Successor # out of range for switch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() && \"Successor # out of range for switch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3535, __extension__ __PRETTY_FUNCTION__));
  setOperand(idx * 2 + 1, NewSucc);
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Switch;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
3546};

3548/// A wrapper class to simplify modification of SwitchInst cases along with
3549/// their prof branch_weights metadata.
3550class SwitchInstProfUpdateWrapper {
SwitchInst &SI;
Optional<SmallVector<uint32_t, 8> > Weights = None;
bool Changed = false;

3555protected:
static MDNode *getProfBranchWeightsMD(const SwitchInst &SI);

MDNode *buildProfBranchWeightsMD();

void init();

3562public:
using CaseWeightOpt = Optional<uint32_t>;
SwitchInst *operator->() { return &SI; }
SwitchInst &operator*() { return SI; }
operator SwitchInst *() { return &SI; }

SwitchInstProfUpdateWrapper(SwitchInst &SI) : SI(SI) { init(); }

~SwitchInstProfUpdateWrapper() {
  if (Changed)
    SI.setMetadata(LLVMContext::MD_prof, buildProfBranchWeightsMD());
}

/// Delegate the call to the underlying SwitchInst::removeCase() and remove
/// correspondent branch weight.
SwitchInst::CaseIt removeCase(SwitchInst::CaseIt I);

/// Delegate the call to the underlying SwitchInst::addCase() and set the
/// specified branch weight for the added case.
void addCase(ConstantInt *OnVal, BasicBlock *Dest, CaseWeightOpt W);

/// Delegate the call to the underlying SwitchInst::eraseFromParent() and mark
/// this object to not touch the underlying SwitchInst in destructor.
SymbolTableList<Instruction>::iterator eraseFromParent();

void setSuccessorWeight(unsigned idx, CaseWeightOpt W);
CaseWeightOpt getSuccessorWeight(unsigned idx);

static CaseWeightOpt getSuccessorWeight(const SwitchInst &SI, unsigned idx);
3591};

3593template <>
3594struct OperandTraits<SwitchInst> : public HungoffOperandTraits<2> {
3595};

3597DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SwitchInst, Value)SwitchInst::op_iterator SwitchInst::op_begin() { return OperandTraits
<SwitchInst>::op_begin(this); } SwitchInst::const_op_iterator
 SwitchInst::op_begin() const { return OperandTraits<SwitchInst
>::op_begin(const_cast<SwitchInst*>(this)); } SwitchInst
::op_iterator SwitchInst::op_end() { return OperandTraits<
SwitchInst>::op_end(this); } SwitchInst::const_op_iterator
 SwitchInst::op_end() const { return OperandTraits<SwitchInst
>::op_end(const_cast<SwitchInst*>(this)); } Value *SwitchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<SwitchInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3597, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<SwitchInst>::op_begin(const_cast
<SwitchInst*>(this))[i_nocapture].get()); } void SwitchInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<SwitchInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3597, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
SwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned SwitchInst::getNumOperands() const { return OperandTraits
<SwitchInst>::operands(this); } template <int Idx_nocapture
> Use &SwitchInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
SwitchInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3599//===----------------------------------------------------------------------===//
3600//                             IndirectBrInst Class
3601//===----------------------------------------------------------------------===//

3603//===---------------------------------------------------------------------------
3604/// Indirect Branch Instruction.
3605///
3606class IndirectBrInst : public Instruction {
unsigned ReservedSpace;

// Operand[0]   = Address to jump to
// Operand[n+1] = n-th destination
IndirectBrInst(const IndirectBrInst &IBI);

/// Create a new indirectbr instruction, specifying an
/// Address to jump to.  The number of expected destinations can be specified
/// here to make memory allocation more efficient.  This constructor can also
/// autoinsert before another instruction.
IndirectBrInst(Value *Address, unsigned NumDests, Instruction *InsertBefore);

/// Create a new indirectbr instruction, specifying an
/// Address to jump to.  The number of expected destinations can be specified
/// here to make memory allocation more efficient.  This constructor also
/// autoinserts at the end of the specified BasicBlock.
IndirectBrInst(Value *Address, unsigned NumDests, BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t S) { return User::operator new(S); }

void init(Value *Address, unsigned NumDests);
void growOperands();

3631protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

IndirectBrInst *cloneImpl() const;

3637public:
void operator delete(void *Ptr) { User::operator delete(Ptr); }

/// Iterator type that casts an operand to a basic block.
///
/// This only makes sense because the successors are stored as adjacent
/// operands for indirectbr instructions.
struct succ_op_iterator
    : iterator_adaptor_base<succ_op_iterator, value_op_iterator,
                            std::random_access_iterator_tag, BasicBlock *,
                            ptrdiff_t, BasicBlock *, BasicBlock *> {
  explicit succ_op_iterator(value_op_iterator I) : iterator_adaptor_base(I) {}

  BasicBlock *operator*() const { return cast<BasicBlock>(*I); }
  BasicBlock *operator->() const { return operator*(); }
};

/// The const version of `succ_op_iterator`.
struct const_succ_op_iterator
    : iterator_adaptor_base<const_succ_op_iterator, const_value_op_iterator,
                            std::random_access_iterator_tag,
                            const BasicBlock *, ptrdiff_t, const BasicBlock *,
                            const BasicBlock *> {
  explicit const_succ_op_iterator(const_value_op_iterator I)
      : iterator_adaptor_base(I) {}

  const BasicBlock *operator*() const { return cast<BasicBlock>(*I); }
  const BasicBlock *operator->() const { return operator*(); }
};

static IndirectBrInst *Create(Value *Address, unsigned NumDests,
                              Instruction *InsertBefore = nullptr) {
  return new IndirectBrInst(Address, NumDests, InsertBefore);
}

static IndirectBrInst *Create(Value *Address, unsigned NumDests,
                              BasicBlock *InsertAtEnd) {
  return new IndirectBrInst(Address, NumDests, InsertAtEnd);
}

/// Provide fast operand accessors.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for IndirectBrInst instruction.
Value *getAddress() { return getOperand(0); }
const Value *getAddress() const { return getOperand(0); }
void setAddress(Value *V) { setOperand(0, V); }

/// return the number of possible destinations in this
/// indirectbr instruction.
unsigned getNumDestinations() const { return getNumOperands()-1; }

/// Return the specified destination.
BasicBlock *getDestination(unsigned i) { return getSuccessor(i); }
const BasicBlock *getDestination(unsigned i) const { return getSuccessor(i); }

/// Add a destination.
///
void addDestination(BasicBlock *Dest);

/// This method removes the specified successor from the
/// indirectbr instruction.
void removeDestination(unsigned i);

unsigned getNumSuccessors() const { return getNumOperands()-1; }
BasicBlock *getSuccessor(unsigned i) const {
  return cast<BasicBlock>(getOperand(i+1));
}
void setSuccessor(unsigned i, BasicBlock *NewSucc) {
  setOperand(i + 1, NewSucc);
}

iterator_range<succ_op_iterator> successors() {
  return make_range(succ_op_iterator(std::next(value_op_begin())),
                    succ_op_iterator(value_op_end()));
}

iterator_range<const_succ_op_iterator> successors() const {
  return make_range(const_succ_op_iterator(std::next(value_op_begin())),
                    const_succ_op_iterator(value_op_end()));
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::IndirectBr;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
3726};

3728template <>
3729struct OperandTraits<IndirectBrInst> : public HungoffOperandTraits<1> {
3730};

3732DEFINE_TRANSPARENT_OPERAND_ACCESSORS(IndirectBrInst, Value)IndirectBrInst::op_iterator IndirectBrInst::op_begin() { return
 OperandTraits<IndirectBrInst>::op_begin(this); } IndirectBrInst
::const_op_iterator IndirectBrInst::op_begin() const { return
 OperandTraits<IndirectBrInst>::op_begin(const_cast<
IndirectBrInst*>(this)); } IndirectBrInst::op_iterator IndirectBrInst
::op_end() { return OperandTraits<IndirectBrInst>::op_end
(this); } IndirectBrInst::const_op_iterator IndirectBrInst::op_end
() const { return OperandTraits<IndirectBrInst>::op_end
(const_cast<IndirectBrInst*>(this)); } Value *IndirectBrInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<IndirectBrInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3732, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<IndirectBrInst>::op_begin(
const_cast<IndirectBrInst*>(this))[i_nocapture].get());
 } void IndirectBrInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<IndirectBrInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3732, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
IndirectBrInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned IndirectBrInst::getNumOperands() const { return OperandTraits
<IndirectBrInst>::operands(this); } template <int Idx_nocapture
> Use &IndirectBrInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &IndirectBrInst::Op() const { return this->
OpFrom<Idx_nocapture>(this); }

3734//===----------------------------------------------------------------------===//
3735//                               InvokeInst Class
3736//===----------------------------------------------------------------------===//

3738/// Invoke instruction.  The SubclassData field is used to hold the
3739/// calling convention of the call.
3740///
3741class InvokeInst : public CallBase {
/// The number of operands for this call beyond the called function,
/// arguments, and operand bundles.
static constexpr int NumExtraOperands = 2;

/// The index from the end of the operand array to the normal destination.
static constexpr int NormalDestOpEndIdx = -3;

/// The index from the end of the operand array to the unwind destination.
static constexpr int UnwindDestOpEndIdx = -2;

InvokeInst(const InvokeInst &BI);

/// Construct an InvokeInst given a range of arguments.
///
/// Construct an InvokeInst from a range of arguments
inline InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                  BasicBlock *IfException, ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                  const Twine &NameStr, Instruction *InsertBefore);

inline InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                  BasicBlock *IfException, ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                  const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
          BasicBlock *IfException, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr);

/// Compute the number of operands to allocate.
static int ComputeNumOperands(int NumArgs, int NumBundleInputs = 0) {
  // We need one operand for the called function, plus our extra operands and
  // the input operand counts provided.
  return 1 + NumExtraOperands + NumArgs + NumBundleInputs;
}

3778protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

InvokeInst *cloneImpl() const;

3784public:
static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  int NumOperands = ComputeNumOperands(Args.size());
  return new (NumOperands)
      InvokeInst(Ty, Func, IfNormal, IfException, Args, None, NumOperands,
                 NameStr, InsertBefore);
}

static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  int NumOperands =
      ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      InvokeInst(Ty, Func, IfNormal, IfException, Args, Bundles, NumOperands,
                 NameStr, InsertBefore);
}

static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  int NumOperands = ComputeNumOperands(Args.size());
  return new (NumOperands)
      InvokeInst(Ty, Func, IfNormal, IfException, Args, None, NumOperands,
                 NameStr, InsertAtEnd);
}

static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  int NumOperands =
      ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      InvokeInst(Ty, Func, IfNormal, IfException, Args, Bundles, NumOperands,
                 NameStr, InsertAtEnd);
}

static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), IfNormal,
                IfException, Args, None, NameStr, InsertBefore);
}

static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), IfNormal,
                IfException, Args, Bundles, NameStr, InsertBefore);
}

static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), IfNormal,
                IfException, Args, NameStr, InsertAtEnd);
}

static InvokeInst *Create(FunctionCallee Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), IfNormal,
                IfException, Args, Bundles, NameStr, InsertAtEnd);
}

/// Create a clone of \p II with a different set of operand bundles and
/// insert it before \p InsertPt.
///
/// The returned invoke instruction is identical to \p II in every way except
/// that the operand bundles for the new instruction are set to the operand
/// bundles in \p Bundles.
static InvokeInst *Create(InvokeInst *II, ArrayRef<OperandBundleDef> Bundles,
                          Instruction *InsertPt = nullptr);

// get*Dest - Return the destination basic blocks...
BasicBlock *getNormalDest() const {
  return cast<BasicBlock>(Op<NormalDestOpEndIdx>());
}
BasicBlock *getUnwindDest() const {
  return cast<BasicBlock>(Op<UnwindDestOpEndIdx>());
}
void setNormalDest(BasicBlock *B) {
  Op<NormalDestOpEndIdx>() = reinterpret_cast<Value *>(B);
}
void setUnwindDest(BasicBlock *B) {
  Op<UnwindDestOpEndIdx>() = reinterpret_cast<Value *>(B);
}

/// Get the landingpad instruction from the landing pad
/// block (the unwind destination).
LandingPadInst *getLandingPadInst() const;

BasicBlock *getSuccessor(unsigned i) const {
  assert(i < 2 && "Successor # out of range for invoke!")(static_cast <bool> (i < 2 && "Successor # out of range for invoke!"
) ? void (0) : __assert_fail ("i < 2 && \"Successor # out of range for invoke!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3891, __extension__ __PRETTY_FUNCTION__));
  return i == 0 ? getNormalDest() : getUnwindDest();
}

void setSuccessor(unsigned i, BasicBlock *NewSucc) {
  assert(i < 2 && "Successor # out of range for invoke!")(static_cast <bool> (i < 2 && "Successor # out of range for invoke!"
) ? void (0) : __assert_fail ("i < 2 && \"Successor # out of range for invoke!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 3896, __extension__ __PRETTY_FUNCTION__));
  if (i == 0)
    setNormalDest(NewSucc);
  else
    setUnwindDest(NewSucc);
}

unsigned getNumSuccessors() const { return 2; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::Invoke);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

3913private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}
3920};

3922InvokeInst::InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                     BasicBlock *IfException, ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                     const Twine &NameStr, Instruction *InsertBefore)
  : CallBase(Ty->getReturnType(), Instruction::Invoke,
             OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands,
             InsertBefore) {
init(Ty, Func, IfNormal, IfException, Args, Bundles, NameStr);
3930}

3932InvokeInst::InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                     BasicBlock *IfException, ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                     const Twine &NameStr, BasicBlock *InsertAtEnd)
  : CallBase(Ty->getReturnType(), Instruction::Invoke,
             OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands,
             InsertAtEnd) {
init(Ty, Func, IfNormal, IfException, Args, Bundles, NameStr);
3940}

3942//===----------------------------------------------------------------------===//
3943//                              CallBrInst Class
3944//===----------------------------------------------------------------------===//

3946/// CallBr instruction, tracking function calls that may not return control but
3947/// instead transfer it to a third location. The SubclassData field is used to
3948/// hold the calling convention of the call.
3949///
3950class CallBrInst : public CallBase {

unsigned NumIndirectDests;

CallBrInst(const CallBrInst &BI);

/// Construct a CallBrInst given a range of arguments.
///
/// Construct a CallBrInst from a range of arguments
inline CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest,
                  ArrayRef<BasicBlock *> IndirectDests,
                  ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                  const Twine &NameStr, Instruction *InsertBefore);

inline CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest,
                  ArrayRef<BasicBlock *> IndirectDests,
                  ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                  const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(FunctionType *FTy, Value *Func, BasicBlock *DefaultDest,
          ArrayRef<BasicBlock *> IndirectDests, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr);

/// Should the Indirect Destinations change, scan + update the Arg list.
void updateArgBlockAddresses(unsigned i, BasicBlock *B);

/// Compute the number of operands to allocate.
static int ComputeNumOperands(int NumArgs, int NumIndirectDests,
                              int NumBundleInputs = 0) {
  // We need one operand for the called function, plus our extra operands and
  // the input operand counts provided.
  return 2 + NumIndirectDests + NumArgs + NumBundleInputs;
}

3986protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

CallBrInst *cloneImpl() const;

3992public:
static CallBrInst *Create(FunctionType *Ty, Value *Func,
                          BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args, const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
  return new (NumOperands)
      CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, None,
                 NumOperands, NameStr, InsertBefore);
}

static CallBrInst *Create(FunctionType *Ty, Value *Func,
                          BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
                                       CountBundleInputs(Bundles));
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, Bundles,
                 NumOperands, NameStr, InsertBefore);
}

static CallBrInst *Create(FunctionType *Ty, Value *Func,
                          BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args, const Twine &NameStr,
                          BasicBlock *InsertAtEnd) {
  int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
  return new (NumOperands)
      CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, None,
                 NumOperands, NameStr, InsertAtEnd);
}

static CallBrInst *Create(FunctionType *Ty, Value *Func,
                          BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
                                       CountBundleInputs(Bundles));
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (NumOperands, DescriptorBytes)
      CallBrInst(Ty, Func, DefaultDest, IndirectDests, Args, Bundles,
                 NumOperands, NameStr, InsertAtEnd);
}

static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args, const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest,
                IndirectDests, Args, NameStr, InsertBefore);
}

static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest,
                IndirectDests, Args, Bundles, NameStr, InsertBefore);
}

static CallBrInst *Create(FunctionCallee Func, BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args, const Twine &NameStr,
                          BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest,
                IndirectDests, Args, NameStr, InsertAtEnd);
}

static CallBrInst *Create(FunctionCallee Func,
                          BasicBlock *DefaultDest,
                          ArrayRef<BasicBlock *> IndirectDests,
                          ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return Create(Func.getFunctionType(), Func.getCallee(), DefaultDest,
                IndirectDests, Args, Bundles, NameStr, InsertAtEnd);
}

/// Create a clone of \p CBI with a different set of operand bundles and
/// insert it before \p InsertPt.
///
/// The returned callbr instruction is identical to \p CBI in every way
/// except that the operand bundles for the new instruction are set to the
/// operand bundles in \p Bundles.
static CallBrInst *Create(CallBrInst *CBI,
                          ArrayRef<OperandBundleDef> Bundles,
                          Instruction *InsertPt = nullptr);

/// Return the number of callbr indirect dest labels.
///
unsigned getNumIndirectDests() const { return NumIndirectDests; }

/// getIndirectDestLabel - Return the i-th indirect dest label.
///
Value *getIndirectDestLabel(unsigned i) const {
  assert(i < getNumIndirectDests() && "Out of bounds!")(static_cast <bool> (i < getNumIndirectDests() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumIndirectDests() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4099, __extension__ __PRETTY_FUNCTION__));
  return getOperand(i + getNumArgOperands() + getNumTotalBundleOperands() +
                    1);
}

Value *getIndirectDestLabelUse(unsigned i) const {
  assert(i < getNumIndirectDests() && "Out of bounds!")(static_cast <bool> (i < getNumIndirectDests() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumIndirectDests() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4105, __extension__ __PRETTY_FUNCTION__));
  return getOperandUse(i + getNumArgOperands() + getNumTotalBundleOperands() +
                       1);
}

// Return the destination basic blocks...
BasicBlock *getDefaultDest() const {
  return cast<BasicBlock>(*(&Op<-1>() - getNumIndirectDests() - 1));
}
BasicBlock *getIndirectDest(unsigned i) const {
  return cast_or_null<BasicBlock>(*(&Op<-1>() - getNumIndirectDests() + i));
}
SmallVector<BasicBlock *, 16> getIndirectDests() const {
  SmallVector<BasicBlock *, 16> IndirectDests;
  for (unsigned i = 0, e = getNumIndirectDests(); i < e; ++i)
    IndirectDests.push_back(getIndirectDest(i));
  return IndirectDests;
}
void setDefaultDest(BasicBlock *B) {
  *(&Op<-1>() - getNumIndirectDests() - 1) = reinterpret_cast<Value *>(B);
}
void setIndirectDest(unsigned i, BasicBlock *B) {
  updateArgBlockAddresses(i, B);
  *(&Op<-1>() - getNumIndirectDests() + i) = reinterpret_cast<Value *>(B);
}

BasicBlock *getSuccessor(unsigned i) const {
  assert(i < getNumSuccessors() + 1 &&(static_cast <bool> (i < getNumSuccessors() + 1 &&
 "Successor # out of range for callbr!") ? void (0) : __assert_fail
 ("i < getNumSuccessors() + 1 && \"Successor # out of range for callbr!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4133, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for callbr!")(static_cast <bool> (i < getNumSuccessors() + 1 &&
 "Successor # out of range for callbr!") ? void (0) : __assert_fail
 ("i < getNumSuccessors() + 1 && \"Successor # out of range for callbr!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4133, __extension__ __PRETTY_FUNCTION__));
  return i == 0 ? getDefaultDest() : getIndirectDest(i - 1);
}

void setSuccessor(unsigned i, BasicBlock *NewSucc) {
  assert(i < getNumIndirectDests() + 1 &&(static_cast <bool> (i < getNumIndirectDests() + 1 &&
 "Successor # out of range for callbr!") ? void (0) : __assert_fail
 ("i < getNumIndirectDests() + 1 && \"Successor # out of range for callbr!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4139, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for callbr!")(static_cast <bool> (i < getNumIndirectDests() + 1 &&
 "Successor # out of range for callbr!") ? void (0) : __assert_fail
 ("i < getNumIndirectDests() + 1 && \"Successor # out of range for callbr!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4139, __extension__ __PRETTY_FUNCTION__));
  return i == 0 ? setDefaultDest(NewSucc) : setIndirectDest(i - 1, NewSucc);
}

unsigned getNumSuccessors() const { return getNumIndirectDests() + 1; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::CallBr);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

4153private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}
4160};

4162CallBrInst::CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest,
                     ArrayRef<BasicBlock *> IndirectDests,
                     ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                     const Twine &NameStr, Instruction *InsertBefore)
  : CallBase(Ty->getReturnType(), Instruction::CallBr,
             OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands,
             InsertBefore) {
init(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, NameStr);
4171}

4173CallBrInst::CallBrInst(FunctionType *Ty, Value *Func, BasicBlock *DefaultDest,
                     ArrayRef<BasicBlock *> IndirectDests,
                     ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, int NumOperands,
                     const Twine &NameStr, BasicBlock *InsertAtEnd)
  : CallBase(Ty->getReturnType(), Instruction::CallBr,
             OperandTraits<CallBase>::op_end(this) - NumOperands, NumOperands,
             InsertAtEnd) {
init(Ty, Func, DefaultDest, IndirectDests, Args, Bundles, NameStr);
4182}

4184//===----------------------------------------------------------------------===//
4185//                              ResumeInst Class
4186//===----------------------------------------------------------------------===//

4188//===---------------------------------------------------------------------------
4189/// Resume the propagation of an exception.
4190///
4191class ResumeInst : public Instruction {
ResumeInst(const ResumeInst &RI);

explicit ResumeInst(Value *Exn, Instruction *InsertBefore=nullptr);
ResumeInst(Value *Exn, BasicBlock *InsertAtEnd);

4197protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ResumeInst *cloneImpl() const;

4203public:
static ResumeInst *Create(Value *Exn, Instruction *InsertBefore = nullptr) {
  return new(1) ResumeInst(Exn, InsertBefore);
}

static ResumeInst *Create(Value *Exn, BasicBlock *InsertAtEnd) {
  return new(1) ResumeInst(Exn, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessor.
Value *getValue() const { return Op<0>(); }

unsigned getNumSuccessors() const { return 0; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Resume;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

4228private:
BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4230);
}

void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4234);
}
4236};

4238template <>
4239struct OperandTraits<ResumeInst> :
  public FixedNumOperandTraits<ResumeInst, 1> {
4241};

4243DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ResumeInst, Value)ResumeInst::op_iterator ResumeInst::op_begin() { return OperandTraits
<ResumeInst>::op_begin(this); } ResumeInst::const_op_iterator
 ResumeInst::op_begin() const { return OperandTraits<ResumeInst
>::op_begin(const_cast<ResumeInst*>(this)); } ResumeInst
::op_iterator ResumeInst::op_end() { return OperandTraits<
ResumeInst>::op_end(this); } ResumeInst::const_op_iterator
 ResumeInst::op_end() const { return OperandTraits<ResumeInst
>::op_end(const_cast<ResumeInst*>(this)); } Value *ResumeInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<ResumeInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4243, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ResumeInst>::op_begin(const_cast
<ResumeInst*>(this))[i_nocapture].get()); } void ResumeInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<ResumeInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4243, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ResumeInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned ResumeInst::getNumOperands() const { return OperandTraits
<ResumeInst>::operands(this); } template <int Idx_nocapture
> Use &ResumeInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
ResumeInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

4245//===----------------------------------------------------------------------===//
4246//                         CatchSwitchInst Class
4247//===----------------------------------------------------------------------===//
4248class CatchSwitchInst : public Instruction {
using UnwindDestField = BoolBitfieldElementT<0>;

/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

// Operand[0] = Outer scope
// Operand[1] = Unwind block destination
// Operand[n] = BasicBlock to go to on match
CatchSwitchInst(const CatchSwitchInst &CSI);

/// Create a new switch instruction, specifying a
/// default destination.  The number of additional handlers can be specified
/// here to make memory allocation more efficient.
/// This constructor can also autoinsert before another instruction.
CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                unsigned NumHandlers, const Twine &NameStr,
                Instruction *InsertBefore);

/// Create a new switch instruction, specifying a
/// default destination.  The number of additional handlers can be specified
/// here to make memory allocation more efficient.
/// This constructor also autoinserts at the end of the specified BasicBlock.
CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                unsigned NumHandlers, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t S) { return User::operator new(S); }

void init(Value *ParentPad, BasicBlock *UnwindDest, unsigned NumReserved);
void growOperands(unsigned Size);

4282protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

CatchSwitchInst *cloneImpl() const;

4288public:
void operator delete(void *Ptr) { return User::operator delete(Ptr); }

static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumHandlers,
                               const Twine &NameStr = "",
                               Instruction *InsertBefore = nullptr) {
  return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr,
                             InsertBefore);
}

static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumHandlers, const Twine &NameStr,
                               BasicBlock *InsertAtEnd) {
  return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr,
                             InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for CatchSwitch stmt
Value *getParentPad() const { return getOperand(0); }
void setParentPad(Value *ParentPad) { setOperand(0, ParentPad); }

// Accessor Methods for CatchSwitch stmt
bool hasUnwindDest() const { return getSubclassData<UnwindDestField>(); }
bool unwindsToCaller() const { return !hasUnwindDest(); }
BasicBlock *getUnwindDest() const {
  if (hasUnwindDest())
    return cast<BasicBlock>(getOperand(1));
  return nullptr;
}
void setUnwindDest(BasicBlock *UnwindDest) {
  assert(UnwindDest)(static_cast <bool> (UnwindDest) ? void (0) : __assert_fail
 ("UnwindDest", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4322, __extension__ __PRETTY_FUNCTION__));
  assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail
 ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4323, __extension__ __PRETTY_FUNCTION__));
  setOperand(1, UnwindDest);
}

/// return the number of 'handlers' in this catchswitch
/// instruction, except the default handler
unsigned getNumHandlers() const {
  if (hasUnwindDest())
    return getNumOperands() - 2;
  return getNumOperands() - 1;
}

4335private:
static BasicBlock *handler_helper(Value *V) { return cast<BasicBlock>(V); }
static const BasicBlock *handler_helper(const Value *V) {
  return cast<BasicBlock>(V);
}

4341public:
using DerefFnTy = BasicBlock *(*)(Value *);
using handler_iterator = mapped_iterator<op_iterator, DerefFnTy>;
using handler_range = iterator_range<handler_iterator>;
using ConstDerefFnTy = const BasicBlock *(*)(const Value *);
using const_handler_iterator =
    mapped_iterator<const_op_iterator, ConstDerefFnTy>;
using const_handler_range = iterator_range<const_handler_iterator>;

/// Returns an iterator that points to the first handler in CatchSwitchInst.
handler_iterator handler_begin() {
  op_iterator It = op_begin() + 1;
  if (hasUnwindDest())
    ++It;
  return handler_iterator(It, DerefFnTy(handler_helper));
}

/// Returns an iterator that points to the first handler in the
/// CatchSwitchInst.
const_handler_iterator handler_begin() const {
  const_op_iterator It = op_begin() + 1;
  if (hasUnwindDest())
    ++It;
  return const_handler_iterator(It, ConstDerefFnTy(handler_helper));
}

/// Returns a read-only iterator that points one past the last
/// handler in the CatchSwitchInst.
handler_iterator handler_end() {
  return handler_iterator(op_end(), DerefFnTy(handler_helper));
}

/// Returns an iterator that points one past the last handler in the
/// CatchSwitchInst.
const_handler_iterator handler_end() const {
  return const_handler_iterator(op_end(), ConstDerefFnTy(handler_helper));
}

/// iteration adapter for range-for loops.
handler_range handlers() {
  return make_range(handler_begin(), handler_end());
}

/// iteration adapter for range-for loops.
const_handler_range handlers() const {
  return make_range(handler_begin(), handler_end());
}

/// Add an entry to the switch instruction...
/// Note:
/// This action invalidates handler_end(). Old handler_end() iterator will
/// point to the added handler.
void addHandler(BasicBlock *Dest);

void removeHandler(handler_iterator HI);

unsigned getNumSuccessors() const { return getNumOperands() - 1; }
BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4400, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4400, __extension__ __PRETTY_FUNCTION__));
  return cast<BasicBlock>(getOperand(Idx + 1));
}
void setSuccessor(unsigned Idx, BasicBlock *NewSucc) {
  assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4405, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4405, __extension__ __PRETTY_FUNCTION__));
  setOperand(Idx + 1, NewSucc);
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::CatchSwitch;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4416};

4418template <>
4419struct OperandTraits<CatchSwitchInst> : public HungoffOperandTraits<2> {};

4421DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchSwitchInst, Value)CatchSwitchInst::op_iterator CatchSwitchInst::op_begin() { return
 OperandTraits<CatchSwitchInst>::op_begin(this); } CatchSwitchInst
::const_op_iterator CatchSwitchInst::op_begin() const { return
 OperandTraits<CatchSwitchInst>::op_begin(const_cast<
CatchSwitchInst*>(this)); } CatchSwitchInst::op_iterator CatchSwitchInst
::op_end() { return OperandTraits<CatchSwitchInst>::op_end
(this); } CatchSwitchInst::const_op_iterator CatchSwitchInst::
op_end() const { return OperandTraits<CatchSwitchInst>::
op_end(const_cast<CatchSwitchInst*>(this)); } Value *CatchSwitchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<CatchSwitchInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4421, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CatchSwitchInst>::op_begin
(const_cast<CatchSwitchInst*>(this))[i_nocapture].get()
); } void CatchSwitchInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<CatchSwitchInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4421, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CatchSwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CatchSwitchInst::getNumOperands() const { return
 OperandTraits<CatchSwitchInst>::operands(this); } template
 <int Idx_nocapture> Use &CatchSwitchInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &CatchSwitchInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

4423//===----------------------------------------------------------------------===//
4424//                               CleanupPadInst Class
4425//===----------------------------------------------------------------------===//
4426class CleanupPadInst : public FuncletPadInst {
4427private:
explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args,
                        unsigned Values, const Twine &NameStr,
                        Instruction *InsertBefore)
    : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values,
                     NameStr, InsertBefore) {}
explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args,
                        unsigned Values, const Twine &NameStr,
                        BasicBlock *InsertAtEnd)
    : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values,
                     NameStr, InsertAtEnd) {}

4439public:
static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args = None,
                              const Twine &NameStr = "",
                              Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CleanupPadInst(ParentPad, Args, Values, NameStr, InsertBefore);
}

static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args,
                              const Twine &NameStr, BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CleanupPadInst(ParentPad, Args, Values, NameStr, InsertAtEnd);
}

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::CleanupPad;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4462};

4464//===----------------------------------------------------------------------===//
4465//                               CatchPadInst Class
4466//===----------------------------------------------------------------------===//
4467class CatchPadInst : public FuncletPadInst {
4468private:
explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args,
                      unsigned Values, const Twine &NameStr,
                      Instruction *InsertBefore)
    : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values,
                     NameStr, InsertBefore) {}
explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args,
                      unsigned Values, const Twine &NameStr,
                      BasicBlock *InsertAtEnd)
    : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values,
                     NameStr, InsertAtEnd) {}

4480public:
static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args,
                            const Twine &NameStr = "",
                            Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertBefore);
}

static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args,
                            const Twine &NameStr, BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertAtEnd);
}

/// Convenience accessors
CatchSwitchInst *getCatchSwitch() const {
  return cast<CatchSwitchInst>(Op<-1>());
}
void setCatchSwitch(Value *CatchSwitch) {
  assert(CatchSwitch)(static_cast <bool> (CatchSwitch) ? void (0) : __assert_fail
 ("CatchSwitch", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4501, __extension__ __PRETTY_FUNCTION__));
  Op<-1>() = CatchSwitch;
}

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::CatchPad;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4512};

4514//===----------------------------------------------------------------------===//
4515//                               CatchReturnInst Class
4516//===----------------------------------------------------------------------===//

4518class CatchReturnInst : public Instruction {
CatchReturnInst(const CatchReturnInst &RI);
CatchReturnInst(Value *CatchPad, BasicBlock *BB, Instruction *InsertBefore);
CatchReturnInst(Value *CatchPad, BasicBlock *BB, BasicBlock *InsertAtEnd);

void init(Value *CatchPad, BasicBlock *BB);

4525protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

CatchReturnInst *cloneImpl() const;

4531public:
static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB,
                               Instruction *InsertBefore = nullptr) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4534, __extension__ __PRETTY_FUNCTION__));
  assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4535, __extension__ __PRETTY_FUNCTION__));
  return new (2) CatchReturnInst(CatchPad, BB, InsertBefore);
}

static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB,
                               BasicBlock *InsertAtEnd) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4541, __extension__ __PRETTY_FUNCTION__));
  assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4542, __extension__ __PRETTY_FUNCTION__));
  return new (2) CatchReturnInst(CatchPad, BB, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessors.
CatchPadInst *getCatchPad() const { return cast<CatchPadInst>(Op<0>()); }
void setCatchPad(CatchPadInst *CatchPad) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4552, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = CatchPad;
}

BasicBlock *getSuccessor() const { return cast<BasicBlock>(Op<1>()); }
void setSuccessor(BasicBlock *NewSucc) {
  assert(NewSucc)(static_cast <bool> (NewSucc) ? void (0) : __assert_fail
 ("NewSucc", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4558, __extension__ __PRETTY_FUNCTION__));
  Op<1>() = NewSucc;
}
unsigned getNumSuccessors() const { return 1; }

/// Get the parentPad of this catchret's catchpad's catchswitch.
/// The successor block is implicitly a member of this funclet.
Value *getCatchSwitchParentPad() const {
  return getCatchPad()->getCatchSwitch()->getParentPad();
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::CatchRet);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

4577private:
BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchret!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4579, __extension__ __PRETTY_FUNCTION__));
  return getSuccessor();
}

void setSuccessor(unsigned Idx, BasicBlock *B) {
  assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchret!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4584, __extension__ __PRETTY_FUNCTION__));
  setSuccessor(B);
}
4587};

4589template <>
4590struct OperandTraits<CatchReturnInst>
  : public FixedNumOperandTraits<CatchReturnInst, 2> {};

4593DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchReturnInst, Value)CatchReturnInst::op_iterator CatchReturnInst::op_begin() { return
 OperandTraits<CatchReturnInst>::op_begin(this); } CatchReturnInst
::const_op_iterator CatchReturnInst::op_begin() const { return
 OperandTraits<CatchReturnInst>::op_begin(const_cast<
CatchReturnInst*>(this)); } CatchReturnInst::op_iterator CatchReturnInst
::op_end() { return OperandTraits<CatchReturnInst>::op_end
(this); } CatchReturnInst::const_op_iterator CatchReturnInst::
op_end() const { return OperandTraits<CatchReturnInst>::
op_end(const_cast<CatchReturnInst*>(this)); } Value *CatchReturnInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<CatchReturnInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4593, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CatchReturnInst>::op_begin
(const_cast<CatchReturnInst*>(this))[i_nocapture].get()
); } void CatchReturnInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<CatchReturnInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4593, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CatchReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CatchReturnInst::getNumOperands() const { return
 OperandTraits<CatchReturnInst>::operands(this); } template
 <int Idx_nocapture> Use &CatchReturnInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &CatchReturnInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

4595//===----------------------------------------------------------------------===//
4596//                               CleanupReturnInst Class
4597//===----------------------------------------------------------------------===//

4599class CleanupReturnInst : public Instruction {
using UnwindDestField = BoolBitfieldElementT<0>;

4602private:
CleanupReturnInst(const CleanupReturnInst &RI);
CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values,
                  Instruction *InsertBefore = nullptr);
CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values,
                  BasicBlock *InsertAtEnd);

void init(Value *CleanupPad, BasicBlock *UnwindBB);

4611protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

CleanupReturnInst *cloneImpl() const;

4617public:
static CleanupReturnInst *Create(Value *CleanupPad,
                                 BasicBlock *UnwindBB = nullptr,
                                 Instruction *InsertBefore = nullptr) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4621, __extension__ __PRETTY_FUNCTION__));
  unsigned Values = 1;
  if (UnwindBB)
    ++Values;
  return new (Values)
      CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertBefore);
}

static CleanupReturnInst *Create(Value *CleanupPad, BasicBlock *UnwindBB,
                                 BasicBlock *InsertAtEnd) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4631, __extension__ __PRETTY_FUNCTION__));
  unsigned Values = 1;
  if (UnwindBB)
    ++Values;
  return new (Values)
      CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

bool hasUnwindDest() const { return getSubclassData<UnwindDestField>(); }
bool unwindsToCaller() const { return !hasUnwindDest(); }

/// Convenience accessor.
CleanupPadInst *getCleanupPad() const {
  return cast<CleanupPadInst>(Op<0>());
}
void setCleanupPad(CleanupPadInst *CleanupPad) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4650, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = CleanupPad;
}

unsigned getNumSuccessors() const { return hasUnwindDest() ? 1 : 0; }

BasicBlock *getUnwindDest() const {
  return hasUnwindDest() ? cast<BasicBlock>(Op<1>()) : nullptr;
}
void setUnwindDest(BasicBlock *NewDest) {
  assert(NewDest)(static_cast <bool> (NewDest) ? void (0) : __assert_fail
 ("NewDest", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4660, __extension__ __PRETTY_FUNCTION__));
  assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail
 ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4661, __extension__ __PRETTY_FUNCTION__));
  Op<1>() = NewDest;
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return (I->getOpcode() == Instruction::CleanupRet);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

4673private:
BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail
 ("Idx == 0", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4675, __extension__ __PRETTY_FUNCTION__));
  return getUnwindDest();
}

void setSuccessor(unsigned Idx, BasicBlock *B) {
  assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail
 ("Idx == 0", "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4680, __extension__ __PRETTY_FUNCTION__));
  setUnwindDest(B);
}

// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
template <typename Bitfield>
void setSubclassData(typename Bitfield::Type Value) {
  Instruction::setSubclassData<Bitfield>(Value);
}
4690};

4692template <>
4693struct OperandTraits<CleanupReturnInst>
  : public VariadicOperandTraits<CleanupReturnInst, /*MINARITY=*/1> {};

4696DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CleanupReturnInst, Value)CleanupReturnInst::op_iterator CleanupReturnInst::op_begin() {
 return OperandTraits<CleanupReturnInst>::op_begin(this
); } CleanupReturnInst::const_op_iterator CleanupReturnInst::
op_begin() const { return OperandTraits<CleanupReturnInst>
::op_begin(const_cast<CleanupReturnInst*>(this)); } CleanupReturnInst
::op_iterator CleanupReturnInst::op_end() { return OperandTraits
<CleanupReturnInst>::op_end(this); } CleanupReturnInst::
const_op_iterator CleanupReturnInst::op_end() const { return OperandTraits
<CleanupReturnInst>::op_end(const_cast<CleanupReturnInst
*>(this)); } Value *CleanupReturnInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<CleanupReturnInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4696, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CleanupReturnInst>::op_begin
(const_cast<CleanupReturnInst*>(this))[i_nocapture].get
()); } void CleanupReturnInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<CleanupReturnInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4696, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CleanupReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CleanupReturnInst::getNumOperands() const { return
 OperandTraits<CleanupReturnInst>::operands(this); } template
 <int Idx_nocapture> Use &CleanupReturnInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &CleanupReturnInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

4698//===----------------------------------------------------------------------===//
4699//                           UnreachableInst Class
4700//===----------------------------------------------------------------------===//

4702//===---------------------------------------------------------------------------
4703/// This function has undefined behavior.  In particular, the
4704/// presence of this instruction indicates some higher level knowledge that the
4705/// end of the block cannot be reached.
4706///
4707class UnreachableInst : public Instruction {
4708protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

UnreachableInst *cloneImpl() const;

4714public:
explicit UnreachableInst(LLVMContext &C, Instruction *InsertBefore = nullptr);
explicit UnreachableInst(LLVMContext &C, BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t S) { return User::operator new(S, 0); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

unsigned getNumSuccessors() const { return 0; }

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Unreachable;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

4732private:
BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4734);
}

void setSuccessor(unsigned idx, BasicBlock *B) {
  llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!"
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 4738);
}
4740};

4742//===----------------------------------------------------------------------===//
4743//                                 TruncInst Class
4744//===----------------------------------------------------------------------===//

4746/// This class represents a truncation of integer types.
4747class TruncInst : public CastInst {
4748protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical TruncInst
TruncInst *cloneImpl() const;

4755public:
/// Constructor with insert-before-instruction semantics
TruncInst(
  Value *S,                           ///< The value to be truncated
  Type *Ty,                           ///< The (smaller) type to truncate to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
TruncInst(
  Value *S,                     ///< The value to be truncated
  Type *Ty,                     ///< The (smaller) type to truncate to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == Trunc;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4779};

4781//===----------------------------------------------------------------------===//
4782//                                 ZExtInst Class
4783//===----------------------------------------------------------------------===//

4785/// This class represents zero extension of integer types.
4786class ZExtInst : public CastInst {
4787protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical ZExtInst
ZExtInst *cloneImpl() const;

4794public:
/// Constructor with insert-before-instruction semantics
ZExtInst(
  Value *S,                           ///< The value to be zero extended
  Type *Ty,                           ///< The type to zero extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end semantics.
ZExtInst(
  Value *S,                     ///< The value to be zero extended
  Type *Ty,                     ///< The type to zero extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == ZExt;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4818};

4820//===----------------------------------------------------------------------===//
4821//                                 SExtInst Class
4822//===----------------------------------------------------------------------===//

4824/// This class represents a sign extension of integer types.
4825class SExtInst : public CastInst {
4826protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical SExtInst
SExtInst *cloneImpl() const;

4833public:
/// Constructor with insert-before-instruction semantics
SExtInst(
  Value *S,                           ///< The value to be sign extended
  Type *Ty,                           ///< The type to sign extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
SExtInst(
  Value *S,                     ///< The value to be sign extended
  Type *Ty,                     ///< The type to sign extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == SExt;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4857};

4859//===----------------------------------------------------------------------===//
4860//                                 FPTruncInst Class
4861//===----------------------------------------------------------------------===//

4863/// This class represents a truncation of floating point types.
4864class FPTruncInst : public CastInst {
4865protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPTruncInst
FPTruncInst *cloneImpl() const;

4872public:
/// Constructor with insert-before-instruction semantics
FPTruncInst(
  Value *S,                           ///< The value to be truncated
  Type *Ty,                           ///< The type to truncate to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-before-instruction semantics
FPTruncInst(
  Value *S,                     ///< The value to be truncated
  Type *Ty,                     ///< The type to truncate to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == FPTrunc;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4896};

4898//===----------------------------------------------------------------------===//
4899//                                 FPExtInst Class
4900//===----------------------------------------------------------------------===//

4902/// This class represents an extension of floating point types.
4903class FPExtInst : public CastInst {
4904protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPExtInst
FPExtInst *cloneImpl() const;

4911public:
/// Constructor with insert-before-instruction semantics
FPExtInst(
  Value *S,                           ///< The value to be extended
  Type *Ty,                           ///< The type to extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPExtInst(
  Value *S,                     ///< The value to be extended
  Type *Ty,                     ///< The type to extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == FPExt;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4935};

4937//===----------------------------------------------------------------------===//
4938//                                 UIToFPInst Class
4939//===----------------------------------------------------------------------===//

4941/// This class represents a cast unsigned integer to floating point.
4942class UIToFPInst : public CastInst {
4943protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical UIToFPInst
UIToFPInst *cloneImpl() const;

4950public:
/// Constructor with insert-before-instruction semantics
UIToFPInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
UIToFPInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == UIToFP;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
4974};

4976//===----------------------------------------------------------------------===//
4977//                                 SIToFPInst Class
4978//===----------------------------------------------------------------------===//

4980/// This class represents a cast from signed integer to floating point.
4981class SIToFPInst : public CastInst {
4982protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical SIToFPInst
SIToFPInst *cloneImpl() const;

4989public:
/// Constructor with insert-before-instruction semantics
SIToFPInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
SIToFPInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == SIToFP;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5013};

5015//===----------------------------------------------------------------------===//
5016//                                 FPToUIInst Class
5017//===----------------------------------------------------------------------===//

5019/// This class represents a cast from floating point to unsigned integer
5020class FPToUIInst  : public CastInst {
5021protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPToUIInst
FPToUIInst *cloneImpl() const;

5028public:
/// Constructor with insert-before-instruction semantics
FPToUIInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPToUIInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< Where to insert the new instruction
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == FPToUI;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5052};

5054//===----------------------------------------------------------------------===//
5055//                                 FPToSIInst Class
5056//===----------------------------------------------------------------------===//

5058/// This class represents a cast from floating point to signed integer.
5059class FPToSIInst  : public CastInst {
5060protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPToSIInst
FPToSIInst *cloneImpl() const;

5067public:
/// Constructor with insert-before-instruction semantics
FPToSIInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPToSIInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == FPToSI;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5091};

5093//===----------------------------------------------------------------------===//
5094//                                 IntToPtrInst Class
5095//===----------------------------------------------------------------------===//

5097/// This class represents a cast from an integer to a pointer.
5098class IntToPtrInst : public CastInst {
5099public:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Constructor with insert-before-instruction semantics
IntToPtrInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
IntToPtrInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Clone an identical IntToPtrInst.
IntToPtrInst *cloneImpl() const;

/// Returns the address space of this instruction's pointer type.
unsigned getAddressSpace() const {
  return getType()->getPointerAddressSpace();
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == IntToPtr;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5134};

5136//===----------------------------------------------------------------------===//
5137//                                 PtrToIntInst Class
5138//===----------------------------------------------------------------------===//

5140/// This class represents a cast from a pointer to an integer.
5141class PtrToIntInst : public CastInst {
5142protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical PtrToIntInst.
PtrToIntInst *cloneImpl() const;

5149public:
/// Constructor with insert-before-instruction semantics
PtrToIntInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
PtrToIntInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Gets the pointer operand.
Value *getPointerOperand() { return getOperand(0); }
/// Gets the pointer operand.
const Value *getPointerOperand() const { return getOperand(0); }
/// Gets the operand index of the pointer operand.
static unsigned getPointerOperandIndex() { return 0U; }

/// Returns the address space of the pointer operand.
unsigned getPointerAddressSpace() const {
  return getPointerOperand()->getType()->getPointerAddressSpace();
}

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == PtrToInt;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5185};

5187//===----------------------------------------------------------------------===//
5188//                             BitCastInst Class
5189//===----------------------------------------------------------------------===//

5191/// This class represents a no-op cast from one type to another.
5192class BitCastInst : public CastInst {
5193protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical BitCastInst.
BitCastInst *cloneImpl() const;

5200public:
/// Constructor with insert-before-instruction semantics
BitCastInst(
  Value *S,                           ///< The value to be casted
  Type *Ty,                           ///< The type to casted to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
BitCastInst(
  Value *S,                     ///< The value to be casted
  Type *Ty,                     ///< The type to casted to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == BitCast;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5224};

5226//===----------------------------------------------------------------------===//
5227//                          AddrSpaceCastInst Class
5228//===----------------------------------------------------------------------===//

5230/// This class represents a conversion between pointers from one address space
5231/// to another.
5232class AddrSpaceCastInst : public CastInst {
5233protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical AddrSpaceCastInst.
AddrSpaceCastInst *cloneImpl() const;

5240public:
/// Constructor with insert-before-instruction semantics
AddrSpaceCastInst(
  Value *S,                           ///< The value to be casted
  Type *Ty,                           ///< The type to casted to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
AddrSpaceCastInst(
  Value *S,                     ///< The value to be casted
  Type *Ty,                     ///< The type to casted to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

// Methods for support type inquiry through isa, cast, and dyn_cast:
static bool classof(const Instruction *I) {
  return I->getOpcode() == AddrSpaceCast;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

/// Gets the pointer operand.
Value *getPointerOperand() {
  return getOperand(0);
}

/// Gets the pointer operand.
const Value *getPointerOperand() const {
  return getOperand(0);
}

/// Gets the operand index of the pointer operand.
static unsigned getPointerOperandIndex() {
  return 0U;
}

/// Returns the address space of the pointer operand.
unsigned getSrcAddressSpace() const {
  return getPointerOperand()->getType()->getPointerAddressSpace();
}

/// Returns the address space of the result.
unsigned getDestAddressSpace() const {
  return getType()->getPointerAddressSpace();
}
5289};

5291/// A helper function that returns the pointer operand of a load or store
5292/// instruction. Returns nullptr if not load or store.
5293inline const Value *getLoadStorePointerOperand(const Value *V) {
if (auto *Load = dyn_cast<LoadInst>(V))
  return Load->getPointerOperand();
if (auto *Store = dyn_cast<StoreInst>(V))
  return Store->getPointerOperand();
return nullptr;
5299}
5300inline Value *getLoadStorePointerOperand(Value *V) {
return const_cast<Value *>(
    getLoadStorePointerOperand(static_cast<const Value *>(V)));
5303}

5305/// A helper function that returns the pointer operand of a load, store
5306/// or GEP instruction. Returns nullptr if not load, store, or GEP.
5307inline const Value *getPointerOperand(const Value *V) {
if (auto *Ptr = getLoadStorePointerOperand(V))
  return Ptr;
if (auto *Gep = dyn_cast<GetElementPtrInst>(V))
  return Gep->getPointerOperand();
return nullptr;
5313}
5314inline Value *getPointerOperand(Value *V) {
return const_cast<Value *>(getPointerOperand(static_cast<const Value *>(V)));
5316}

5318/// A helper function that returns the alignment of load or store instruction.
5319inline Align getLoadStoreAlignment(Value *I) {
assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5321, __extension__ __PRETTY_FUNCTION__))
       "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5321, __extension__ __PRETTY_FUNCTION__));
if (auto *LI = dyn_cast<LoadInst>(I))
  return LI->getAlign();
return cast<StoreInst>(I)->getAlign();
5325}

5327/// A helper function that returns the address space of the pointer operand of
5328/// load or store instruction.
5329inline unsigned getLoadStoreAddressSpace(Value *I) {
assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5331, __extension__ __PRETTY_FUNCTION__))
       "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5331, __extension__ __PRETTY_FUNCTION__));
if (auto *LI = dyn_cast<LoadInst>(I))
  return LI->getPointerAddressSpace();
return cast<StoreInst>(I)->getPointerAddressSpace();
5335}

5337/// A helper function that returns the type of a load or store instruction.
5338inline Type *getLoadStoreType(Value *I) {
assert((isa<LoadInst>(I) || isa<StoreInst>(I)) &&(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5340, __extension__ __PRETTY_FUNCTION__))
       "Expected Load or Store instruction")(static_cast <bool> ((isa<LoadInst>(I) || isa<
StoreInst>(I)) && "Expected Load or Store instruction"
) ? void (0) : __assert_fail ("(isa<LoadInst>(I) || isa<StoreInst>(I)) && \"Expected Load or Store instruction\""
, "/build/llvm-toolchain-snapshot-14~++20210828111110+16086d47c0d0/llvm/include/llvm/IR/Instructions.h"
, 5340, __extension__ __PRETTY_FUNCTION__));
if (auto *LI = dyn_cast<LoadInst>(I))
  return LI->getType();
return cast<StoreInst>(I)->getValueOperand()->getType();
5344}

5346//===----------------------------------------------------------------------===//
5347//                              FreezeInst Class
5348//===----------------------------------------------------------------------===//

5350/// This class represents a freeze function that returns random concrete
5351/// value if an operand is either a poison value or an undef value
5352class FreezeInst : public UnaryInstruction {
5353protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FreezeInst
FreezeInst *cloneImpl() const;

5360public:
explicit FreezeInst(Value *S,
                    const Twine &NameStr = "",
                    Instruction *InsertBefore = nullptr);
FreezeInst(Value *S, const Twine &NameStr, BasicBlock *InsertAtEnd);

// Methods for support type inquiry through isa, cast, and dyn_cast:
static inline bool classof(const Instruction *I) {
  return I->getOpcode() == Freeze;
}
static inline bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
5373};

5375} // end namespace llvm

5377#endif // LLVM_IR_INSTRUCTIONS_H