/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/lib/IR/Instructions.cpp

Bug Summary

File:	llvm/lib/IR/Instructions.cpp
Warning:	line 440, column 3 Returning null reference

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 Instructions.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~++20210903100615+fd66b44ec19e/build-llvm/lib/IR -resource-dir /usr/lib/llvm-14/lib/clang/14.0.0 -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/lib/IR -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/lib/IR -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/build-llvm/include -I /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/include -D 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~++20210903100615+fd66b44ec19e/build-llvm/lib/IR -fdebug-prefix-map=/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e=. -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-09-04-040900-46481-1 -x c++ /build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/lib/IR/Instructions.cpp

/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/lib/IR/Instructions.cpp

→

1//===- Instructions.cpp - Implement the LLVM instructions -----------------===//
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 implements all of the non-inline methods for the LLVM instruction
10// classes.
11//
12//===----------------------------------------------------------------------===//

14#include "llvm/IR/Instructions.h"
15#include "LLVMContextImpl.h"
16#include "llvm/ADT/None.h"
17#include "llvm/ADT/SmallVector.h"
18#include "llvm/ADT/Twine.h"
19#include "llvm/IR/Attributes.h"
20#include "llvm/IR/BasicBlock.h"
21#include "llvm/IR/Constant.h"
22#include "llvm/IR/Constants.h"
23#include "llvm/IR/DataLayout.h"
24#include "llvm/IR/DerivedTypes.h"
25#include "llvm/IR/Function.h"
26#include "llvm/IR/InstrTypes.h"
27#include "llvm/IR/Instruction.h"
28#include "llvm/IR/Intrinsics.h"
29#include "llvm/IR/LLVMContext.h"
30#include "llvm/IR/MDBuilder.h"
31#include "llvm/IR/Metadata.h"
32#include "llvm/IR/Module.h"
33#include "llvm/IR/Operator.h"
34#include "llvm/IR/Type.h"
35#include "llvm/IR/Value.h"
36#include "llvm/Support/AtomicOrdering.h"
37#include "llvm/Support/Casting.h"
38#include "llvm/Support/ErrorHandling.h"
39#include "llvm/Support/MathExtras.h"
40#include "llvm/Support/TypeSize.h"
41#include <algorithm>
42#include <cassert>
43#include <cstdint>
44#include <vector>

46using namespace llvm;

48static cl::opt<bool> DisableI2pP2iOpt(
  "disable-i2p-p2i-opt", cl::init(false),
  cl::desc("Disables inttoptr/ptrtoint roundtrip optimization"));

52//===----------------------------------------------------------------------===//
53//                            AllocaInst Class
54//===----------------------------------------------------------------------===//

56Optional<TypeSize>
57AllocaInst::getAllocationSizeInBits(const DataLayout &DL) const {
TypeSize Size = DL.getTypeAllocSizeInBits(getAllocatedType());
if (isArrayAllocation()) {
  auto *C = dyn_cast<ConstantInt>(getArraySize());
  if (!C)
    return None;
  assert(!Size.isScalable() && "Array elements cannot have a scalable size")(static_cast<void> (0));
  Size *= C->getZExtValue();
}
return Size;
67}

69//===----------------------------------------------------------------------===//
70//                              SelectInst Class
71//===----------------------------------------------------------------------===//

73/// areInvalidOperands - Return a string if the specified operands are invalid
74/// for a select operation, otherwise return null.
75const char *SelectInst::areInvalidOperands(Value *Op0, Value *Op1, Value *Op2) {
if (Op1->getType() != Op2->getType())
  return "both values to select must have same type";

if (Op1->getType()->isTokenTy())
  return "select values cannot have token type";

if (VectorType *VT = dyn_cast<VectorType>(Op0->getType())) {
  // Vector select.
  if (VT->getElementType() != Type::getInt1Ty(Op0->getContext()))
    return "vector select condition element type must be i1";
  VectorType *ET = dyn_cast<VectorType>(Op1->getType());
  if (!ET)
    return "selected values for vector select must be vectors";
  if (ET->getElementCount() != VT->getElementCount())
    return "vector select requires selected vectors to have "
                 "the same vector length as select condition";
} else if (Op0->getType() != Type::getInt1Ty(Op0->getContext())) {
  return "select condition must be i1 or <n x i1>";
}
return nullptr;
96}

98//===----------------------------------------------------------------------===//
99//                               PHINode Class
100//===----------------------------------------------------------------------===//

102PHINode::PHINode(const PHINode &PN)
  : Instruction(PN.getType(), Instruction::PHI, nullptr, PN.getNumOperands()),
    ReservedSpace(PN.getNumOperands()) {
allocHungoffUses(PN.getNumOperands());
std::copy(PN.op_begin(), PN.op_end(), op_begin());
std::copy(PN.block_begin(), PN.block_end(), block_begin());
SubclassOptionalData = PN.SubclassOptionalData;
109}

111// removeIncomingValue - Remove an incoming value.  This is useful if a
112// predecessor basic block is deleted.
113Value *PHINode::removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty) {
Value *Removed = getIncomingValue(Idx);

// Move everything after this operand down.
//
// FIXME: we could just swap with the end of the list, then erase.  However,
// clients might not expect this to happen.  The code as it is thrashes the
// use/def lists, which is kinda lame.
std::copy(op_begin() + Idx + 1, op_end(), op_begin() + Idx);
std::copy(block_begin() + Idx + 1, block_end(), block_begin() + Idx);

// Nuke the last value.
Op<-1>().set(nullptr);
setNumHungOffUseOperands(getNumOperands() - 1);

// If the PHI node is dead, because it has zero entries, nuke it now.
if (getNumOperands() == 0 && DeletePHIIfEmpty) {
  // If anyone is using this PHI, make them use a dummy value instead...
  replaceAllUsesWith(UndefValue::get(getType()));
  eraseFromParent();
}
return Removed;
135}

137/// growOperands - grow operands - This grows the operand list in response
138/// to a push_back style of operation.  This grows the number of ops by 1.5
139/// times.
140///
141void PHINode::growOperands() {
unsigned e = getNumOperands();
unsigned NumOps = e + e / 2;
if (NumOps < 2) NumOps = 2;      // 2 op PHI nodes are VERY common.

ReservedSpace = NumOps;
growHungoffUses(ReservedSpace, /* IsPhi */ true);
148}

150/// hasConstantValue - If the specified PHI node always merges together the same
151/// value, return the value, otherwise return null.
152Value *PHINode::hasConstantValue() const {
// Exploit the fact that phi nodes always have at least one entry.
Value *ConstantValue = getIncomingValue(0);
for (unsigned i = 1, e = getNumIncomingValues(); i != e; ++i)
  if (getIncomingValue(i) != ConstantValue && getIncomingValue(i) != this) {
    if (ConstantValue != this)
      return nullptr; // Incoming values not all the same.
     // The case where the first value is this PHI.
    ConstantValue = getIncomingValue(i);
  }
if (ConstantValue == this)
  return UndefValue::get(getType());
return ConstantValue;
165}

167/// hasConstantOrUndefValue - Whether the specified PHI node always merges
168/// together the same value, assuming that undefs result in the same value as
169/// non-undefs.
170/// Unlike \ref hasConstantValue, this does not return a value because the
171/// unique non-undef incoming value need not dominate the PHI node.
172bool PHINode::hasConstantOrUndefValue() const {
Value *ConstantValue = nullptr;
for (unsigned i = 0, e = getNumIncomingValues(); i != e; ++i) {
  Value *Incoming = getIncomingValue(i);
  if (Incoming != this && !isa<UndefValue>(Incoming)) {
    if (ConstantValue && ConstantValue != Incoming)
      return false;
    ConstantValue = Incoming;
  }
}
return true;
183}

185//===----------------------------------------------------------------------===//
186//                       LandingPadInst Implementation
187//===----------------------------------------------------------------------===//

189LandingPadInst::LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                             const Twine &NameStr, Instruction *InsertBefore)
  : Instruction(RetTy, Instruction::LandingPad, nullptr, 0, InsertBefore) {
init(NumReservedValues, NameStr);
193}

195LandingPadInst::LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                             const Twine &NameStr, BasicBlock *InsertAtEnd)
  : Instruction(RetTy, Instruction::LandingPad, nullptr, 0, InsertAtEnd) {
init(NumReservedValues, NameStr);
199}

201LandingPadInst::LandingPadInst(const LandingPadInst &LP)
  : Instruction(LP.getType(), Instruction::LandingPad, nullptr,
                LP.getNumOperands()),
    ReservedSpace(LP.getNumOperands()) {
allocHungoffUses(LP.getNumOperands());
Use *OL = getOperandList();
const Use *InOL = LP.getOperandList();
for (unsigned I = 0, E = ReservedSpace; I != E; ++I)
  OL[I] = InOL[I];

setCleanup(LP.isCleanup());
212}

214LandingPadInst *LandingPadInst::Create(Type *RetTy, unsigned NumReservedClauses,
                                     const Twine &NameStr,
                                     Instruction *InsertBefore) {
return new LandingPadInst(RetTy, NumReservedClauses, NameStr, InsertBefore);
218}

220LandingPadInst *LandingPadInst::Create(Type *RetTy, unsigned NumReservedClauses,
                                     const Twine &NameStr,
                                     BasicBlock *InsertAtEnd) {
return new LandingPadInst(RetTy, NumReservedClauses, NameStr, InsertAtEnd);
224}

226void LandingPadInst::init(unsigned NumReservedValues, const Twine &NameStr) {
ReservedSpace = NumReservedValues;
setNumHungOffUseOperands(0);
allocHungoffUses(ReservedSpace);
setName(NameStr);
setCleanup(false);
232}

234/// growOperands - grow operands - This grows the operand list in response to a
235/// push_back style of operation. This grows the number of ops by 2 times.
236void LandingPadInst::growOperands(unsigned Size) {
unsigned e = getNumOperands();
if (ReservedSpace >= e + Size) return;
ReservedSpace = (std::max(e, 1U) + Size / 2) * 2;
growHungoffUses(ReservedSpace);
241}

243void LandingPadInst::addClause(Constant *Val) {
unsigned OpNo = getNumOperands();
growOperands(1);
assert(OpNo < ReservedSpace && "Growing didn't work!")(static_cast<void> (0));
setNumHungOffUseOperands(getNumOperands() + 1);
getOperandList()[OpNo] = Val;
249}

251//===----------------------------------------------------------------------===//
252//                        CallBase Implementation
253//===----------------------------------------------------------------------===//

255CallBase *CallBase::Create(CallBase *CB, ArrayRef<OperandBundleDef> Bundles,
                         Instruction *InsertPt) {
switch (CB->getOpcode()) {
case Instruction::Call:
  return CallInst::Create(cast<CallInst>(CB), Bundles, InsertPt);
case Instruction::Invoke:
  return InvokeInst::Create(cast<InvokeInst>(CB), Bundles, InsertPt);
case Instruction::CallBr:
  return CallBrInst::Create(cast<CallBrInst>(CB), Bundles, InsertPt);
default:
  llvm_unreachable("Unknown CallBase sub-class!")__builtin_unreachable();
}
267}

269CallBase *CallBase::Create(CallBase *CI, OperandBundleDef OpB,
                         Instruction *InsertPt) {
SmallVector<OperandBundleDef, 2> OpDefs;
for (unsigned i = 0, e = CI->getNumOperandBundles(); i < e; ++i) {
  auto ChildOB = CI->getOperandBundleAt(i);
  if (ChildOB.getTagName() != OpB.getTag())
    OpDefs.emplace_back(ChildOB);
}
OpDefs.emplace_back(OpB);
return CallBase::Create(CI, OpDefs, InsertPt);
279}


282Function *CallBase::getCaller() { return getParent()->getParent(); }

284unsigned CallBase::getNumSubclassExtraOperandsDynamic() const {
assert(getOpcode() == Instruction::CallBr && "Unexpected opcode!")(static_cast<void> (0));
return cast<CallBrInst>(this)->getNumIndirectDests() + 1;
287}

289bool CallBase::isIndirectCall() const {
const Value *V = getCalledOperand();
if (isa<Function>(V) || isa<Constant>(V))
  return false;
return !isInlineAsm();
294}

296/// Tests if this call site must be tail call optimized. Only a CallInst can
297/// be tail call optimized.
298bool CallBase::isMustTailCall() const {
if (auto *CI = dyn_cast<CallInst>(this))
  return CI->isMustTailCall();
return false;
302}

304/// Tests if this call site is marked as a tail call.
305bool CallBase::isTailCall() const {
if (auto *CI = dyn_cast<CallInst>(this))
  return CI->isTailCall();
return false;
309}

311Intrinsic::ID CallBase::getIntrinsicID() const {
if (auto *F = getCalledFunction())
  return F->getIntrinsicID();
return Intrinsic::not_intrinsic;
315}

317bool CallBase::isReturnNonNull() const {
if (hasRetAttr(Attribute::NonNull))
  return true;

if (getRetDereferenceableBytes() > 0 &&
    !NullPointerIsDefined(getCaller(), getType()->getPointerAddressSpace()))
  return true;

return false;
326}

328Value *CallBase::getReturnedArgOperand() const {
unsigned Index;

if (Attrs.hasAttrSomewhere(Attribute::Returned, &Index) && Index)
  return getArgOperand(Index - AttributeList::FirstArgIndex);
if (const Function *F = getCalledFunction())
  if (F->getAttributes().hasAttrSomewhere(Attribute::Returned, &Index) &&
      Index)
    return getArgOperand(Index - AttributeList::FirstArgIndex);

return nullptr;
339}

341/// Determine whether the argument or parameter has the given attribute.
342bool CallBase::paramHasAttr(unsigned ArgNo, Attribute::AttrKind Kind) const {
assert(ArgNo < getNumArgOperands() && "Param index out of bounds!")(static_cast<void> (0));

if (Attrs.hasParamAttr(ArgNo, Kind))
  return true;
if (const Function *F = getCalledFunction())
  return F->getAttributes().hasParamAttr(ArgNo, Kind);
return false;
350}

352bool CallBase::hasFnAttrOnCalledFunction(Attribute::AttrKind Kind) const {
if (const Function *F = getCalledFunction())
  return F->getAttributes().hasFnAttr(Kind);
return false;
356}

358bool CallBase::hasFnAttrOnCalledFunction(StringRef Kind) const {
if (const Function *F = getCalledFunction())
  return F->getAttributes().hasFnAttr(Kind);
return false;
362}

364void CallBase::getOperandBundlesAsDefs(
  SmallVectorImpl<OperandBundleDef> &Defs) const {
for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i)
  Defs.emplace_back(getOperandBundleAt(i));
368}

370CallBase::op_iterator
371CallBase::populateBundleOperandInfos(ArrayRef<OperandBundleDef> Bundles,
                                   const unsigned BeginIndex) {
auto It = op_begin() + BeginIndex;
for (auto &B : Bundles)
  It = std::copy(B.input_begin(), B.input_end(), It);

auto *ContextImpl = getContext().pImpl;
auto BI = Bundles.begin();
unsigned CurrentIndex = BeginIndex;

for (auto &BOI : bundle_op_infos()) {
  assert(BI != Bundles.end() && "Incorrect allocation?")(static_cast<void> (0));

  BOI.Tag = ContextImpl->getOrInsertBundleTag(BI->getTag());
  BOI.Begin = CurrentIndex;
  BOI.End = CurrentIndex + BI->input_size();
  CurrentIndex = BOI.End;
  BI++;
}

assert(BI == Bundles.end() && "Incorrect allocation?")(static_cast<void> (0));

return It;
394}

396CallBase::BundleOpInfo &CallBase::getBundleOpInfoForOperand(unsigned OpIdx) {
/// When there isn't many bundles, we do a simple linear search.
/// Else fallback to a binary-search that use the fact that bundles usually
/// have similar number of argument to get faster convergence.
if (bundle_op_info_end() - bundle_op_info_begin() < 8) {
1
Assuming the condition is false→
2
←
Taking false branch→
  for (auto &BOI : bundle_op_infos())
    if (BOI.Begin <= OpIdx && OpIdx < BOI.End)
      return BOI;

  llvm_unreachable("Did not find operand bundle for operand!")__builtin_unreachable();
}

assert(OpIdx >= arg_size() && "the Idx is not in the operand bundles")(static_cast<void> (0));
assert(bundle_op_info_end() - bundle_op_info_begin() > 0 &&(static_cast<void> (0))
       OpIdx < std::prev(bundle_op_info_end())->End &&(static_cast<void> (0))
       "The Idx isn't in the operand bundle")(static_cast<void> (0));

/// We need a decimal number below and to prevent using floating point numbers
/// we use an intergal value multiplied by this constant.
constexpr unsigned NumberScaling = 1024;

bundle_op_iterator Begin = bundle_op_info_begin();
3
←
Calling 'CallBase::bundle_op_info_begin'→
8
←
Returning from 'CallBase::bundle_op_info_begin'→
9
←
'Begin' initialized here→
bundle_op_iterator End = bundle_op_info_end();
bundle_op_iterator Current = Begin;
10
←
'Current' initialized to the value of 'Begin'→

while (Begin != End) {
11
←
Assuming 'Begin' is equal to 'End'→
12
←
Loop condition is false. Execution continues on line 438→
  unsigned ScaledOperandPerBundle =
      NumberScaling * (std::prev(End)->End - Begin->Begin) / (End - Begin);
  Current = Begin + (((OpIdx - Begin->Begin) * NumberScaling) /
                     ScaledOperandPerBundle);
  if (Current >= End)
    Current = std::prev(End);
  assert(Current < End && Current >= Begin &&(static_cast<void> (0))
         "the operand bundle doesn't cover every value in the range")(static_cast<void> (0));
  if (OpIdx >= Current->Begin && OpIdx < Current->End)
    break;
  if (OpIdx >= Current->End)
    Begin = Current + 1;
  else
    End = Current;
}

assert(OpIdx >= Current->Begin && OpIdx < Current->End &&(static_cast<void> (0))
       "the operand bundle doesn't cover every value in the range")(static_cast<void> (0));
return *Current;
13
←
Returning null reference
441}

443CallBase *CallBase::addOperandBundle(CallBase *CB, uint32_t ID,
                                   OperandBundleDef OB,
                                   Instruction *InsertPt) {
if (CB->getOperandBundle(ID))
  return CB;

SmallVector<OperandBundleDef, 1> Bundles;
CB->getOperandBundlesAsDefs(Bundles);
Bundles.push_back(OB);
return Create(CB, Bundles, InsertPt);
453}

455CallBase *CallBase::removeOperandBundle(CallBase *CB, uint32_t ID,
                                      Instruction *InsertPt) {
SmallVector<OperandBundleDef, 1> Bundles;
bool CreateNew = false;

for (unsigned I = 0, E = CB->getNumOperandBundles(); I != E; ++I) {
  auto Bundle = CB->getOperandBundleAt(I);
  if (Bundle.getTagID() == ID) {
    CreateNew = true;
    continue;
  }
  Bundles.emplace_back(Bundle);
}

return CreateNew ? Create(CB, Bundles, InsertPt) : CB;
470}

472bool CallBase::hasReadingOperandBundles() const {
// Implementation note: this is a conservative implementation of operand
// bundle semantics, where *any* non-assume operand bundle forces a callsite
// to be at least readonly.
return hasOperandBundles() && getIntrinsicID() != Intrinsic::assume;
477}

479//===----------------------------------------------------------------------===//
480//                        CallInst Implementation
481//===----------------------------------------------------------------------===//

483void CallInst::init(FunctionType *FTy, Value *Func, ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr) {
this->FTy = FTy;
assert(getNumOperands() == Args.size() + CountBundleInputs(Bundles) + 1 &&(static_cast<void> (0))
       "NumOperands not set up?")(static_cast<void> (0));

489#ifndef NDEBUG1
assert((Args.size() == FTy->getNumParams() ||(static_cast<void> (0))
        (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&(static_cast<void> (0))
       "Calling a function with bad signature!")(static_cast<void> (0));

for (unsigned i = 0; i != Args.size(); ++i)
  assert((i >= FTy->getNumParams() ||(static_cast<void> (0))
          FTy->getParamType(i) == Args[i]->getType()) &&(static_cast<void> (0))
         "Calling a function with a bad signature!")(static_cast<void> (0));
498#endif

// Set operands in order of their index to match use-list-order
// prediction.
llvm::copy(Args, op_begin());
setCalledOperand(Func);

auto It = populateBundleOperandInfos(Bundles, Args.size());
(void)It;
assert(It + 1 == op_end() && "Should add up!")(static_cast<void> (0));

setName(NameStr);
510}

512void CallInst::init(FunctionType *FTy, Value *Func, const Twine &NameStr) {
this->FTy = FTy;
assert(getNumOperands() == 1 && "NumOperands not set up?")(static_cast<void> (0));
setCalledOperand(Func);

assert(FTy->getNumParams() == 0 && "Calling a function with bad signature")(static_cast<void> (0));

setName(NameStr);
520}

522CallInst::CallInst(FunctionType *Ty, Value *Func, const Twine &Name,
                 Instruction *InsertBefore)
  : CallBase(Ty->getReturnType(), Instruction::Call,
             OperandTraits<CallBase>::op_end(this) - 1, 1, InsertBefore) {
init(Ty, Func, Name);
527}

529CallInst::CallInst(FunctionType *Ty, Value *Func, const Twine &Name,
                 BasicBlock *InsertAtEnd)
  : CallBase(Ty->getReturnType(), Instruction::Call,
             OperandTraits<CallBase>::op_end(this) - 1, 1, InsertAtEnd) {
init(Ty, Func, Name);
534}

536CallInst::CallInst(const CallInst &CI)
  : CallBase(CI.Attrs, CI.FTy, CI.getType(), Instruction::Call,
             OperandTraits<CallBase>::op_end(this) - CI.getNumOperands(),
             CI.getNumOperands()) {
setTailCallKind(CI.getTailCallKind());
setCallingConv(CI.getCallingConv());

std::copy(CI.op_begin(), CI.op_end(), op_begin());
std::copy(CI.bundle_op_info_begin(), CI.bundle_op_info_end(),
          bundle_op_info_begin());
SubclassOptionalData = CI.SubclassOptionalData;
547}

549CallInst *CallInst::Create(CallInst *CI, ArrayRef<OperandBundleDef> OpB,
                         Instruction *InsertPt) {
std::vector<Value *> Args(CI->arg_begin(), CI->arg_end());

auto *NewCI = CallInst::Create(CI->getFunctionType(), CI->getCalledOperand(),
                               Args, OpB, CI->getName(), InsertPt);
NewCI->setTailCallKind(CI->getTailCallKind());
NewCI->setCallingConv(CI->getCallingConv());
NewCI->SubclassOptionalData = CI->SubclassOptionalData;
NewCI->setAttributes(CI->getAttributes());
NewCI->setDebugLoc(CI->getDebugLoc());
return NewCI;
561}

563// Update profile weight for call instruction by scaling it using the ratio
564// of S/T. The meaning of "branch_weights" meta data for call instruction is
565// transfered to represent call count.
566void CallInst::updateProfWeight(uint64_t S, uint64_t T) {
auto *ProfileData = getMetadata(LLVMContext::MD_prof);
if (ProfileData == nullptr)
  return;

auto *ProfDataName = dyn_cast<MDString>(ProfileData->getOperand(0));
if (!ProfDataName || (!ProfDataName->getString().equals("branch_weights") &&
                      !ProfDataName->getString().equals("VP")))
  return;

if (T == 0) {
  LLVM_DEBUG(dbgs() << "Attempting to update profile weights will result in "do { } while (false)
                       "div by 0. Ignoring. Likely the function "do { } while (false)
                    << getParent()->getParent()->getName()do { } while (false)
                    << " has 0 entry count, and contains call instructions "do { } while (false)
                       "with non-zero prof info.")do { } while (false);
  return;
}

MDBuilder MDB(getContext());
SmallVector<Metadata *, 3> Vals;
Vals.push_back(ProfileData->getOperand(0));
APInt APS(128, S), APT(128, T);
if (ProfDataName->getString().equals("branch_weights") &&
    ProfileData->getNumOperands() > 0) {
  // Using APInt::div may be expensive, but most cases should fit 64 bits.
  APInt Val(128, mdconst::dyn_extract<ConstantInt>(ProfileData->getOperand(1))
                     ->getValue()
                     .getZExtValue());
  Val *= APS;
  Vals.push_back(MDB.createConstant(
      ConstantInt::get(Type::getInt32Ty(getContext()),
                       Val.udiv(APT).getLimitedValue(UINT32_MAX(4294967295U)))));
} else if (ProfDataName->getString().equals("VP"))
  for (unsigned i = 1; i < ProfileData->getNumOperands(); i += 2) {
    // The first value is the key of the value profile, which will not change.
    Vals.push_back(ProfileData->getOperand(i));
    uint64_t Count =
        mdconst::dyn_extract<ConstantInt>(ProfileData->getOperand(i + 1))
            ->getValue()
            .getZExtValue();
    // Don't scale the magic number.
    if (Count == NOMORE_ICP_MAGICNUM) {
      Vals.push_back(ProfileData->getOperand(i + 1));
      continue;
    }
    // Using APInt::div may be expensive, but most cases should fit 64 bits.
    APInt Val(128, Count);
    Val *= APS;
    Vals.push_back(MDB.createConstant(
        ConstantInt::get(Type::getInt64Ty(getContext()),
                         Val.udiv(APT).getLimitedValue())));
  }
setMetadata(LLVMContext::MD_prof, MDNode::get(getContext(), Vals));
620}

622/// IsConstantOne - Return true only if val is constant int 1
623static bool IsConstantOne(Value *val) {
assert(val && "IsConstantOne does not work with nullptr val")(static_cast<void> (0));
const ConstantInt *CVal = dyn_cast<ConstantInt>(val);
return CVal && CVal->isOne();
627}

629static Instruction *createMalloc(Instruction *InsertBefore,
                               BasicBlock *InsertAtEnd, Type *IntPtrTy,
                               Type *AllocTy, Value *AllocSize,
                               Value *ArraySize,
                               ArrayRef<OperandBundleDef> OpB,
                               Function *MallocF, const Twine &Name) {
assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&(static_cast<void> (0))
       "createMalloc needs either InsertBefore or InsertAtEnd")(static_cast<void> (0));

// malloc(type) becomes:
//       bitcast (i8* malloc(typeSize)) to type*
// malloc(type, arraySize) becomes:
//       bitcast (i8* malloc(typeSize*arraySize)) to type*
if (!ArraySize)
  ArraySize = ConstantInt::get(IntPtrTy, 1);
else if (ArraySize->getType() != IntPtrTy) {
  if (InsertBefore)
    ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
                                            "", InsertBefore);
  else
    ArraySize = CastInst::CreateIntegerCast(ArraySize, IntPtrTy, false,
                                            "", InsertAtEnd);
}

if (!IsConstantOne(ArraySize)) {
  if (IsConstantOne(AllocSize)) {
    AllocSize = ArraySize;         // Operand * 1 = Operand
  } else if (Constant *CO = dyn_cast<Constant>(ArraySize)) {
    Constant *Scale = ConstantExpr::getIntegerCast(CO, IntPtrTy,
                                                   false /*ZExt*/);
    // Malloc arg is constant product of type size and array size
    AllocSize = ConstantExpr::getMul(Scale, cast<Constant>(AllocSize));
  } else {
    // Multiply type size by the array size...
    if (InsertBefore)
      AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
                                            "mallocsize", InsertBefore);
    else
      AllocSize = BinaryOperator::CreateMul(ArraySize, AllocSize,
                                            "mallocsize", InsertAtEnd);
  }
}

assert(AllocSize->getType() == IntPtrTy && "malloc arg is wrong size")(static_cast<void> (0));
// Create the call to Malloc.
BasicBlock *BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
Module *M = BB->getParent()->getParent();
Type *BPTy = Type::getInt8PtrTy(BB->getContext());
FunctionCallee MallocFunc = MallocF;
if (!MallocFunc)
  // prototype malloc as "void *malloc(size_t)"
  MallocFunc = M->getOrInsertFunction("malloc", BPTy, IntPtrTy);
PointerType *AllocPtrType = PointerType::getUnqual(AllocTy);
CallInst *MCall = nullptr;
Instruction *Result = nullptr;
if (InsertBefore) {
  MCall = CallInst::Create(MallocFunc, AllocSize, OpB, "malloccall",
                           InsertBefore);
  Result = MCall;
  if (Result->getType() != AllocPtrType)
    // Create a cast instruction to convert to the right type...
    Result = new BitCastInst(MCall, AllocPtrType, Name, InsertBefore);
} else {
  MCall = CallInst::Create(MallocFunc, AllocSize, OpB, "malloccall");
  Result = MCall;
  if (Result->getType() != AllocPtrType) {
    InsertAtEnd->getInstList().push_back(MCall);
    // Create a cast instruction to convert to the right type...
    Result = new BitCastInst(MCall, AllocPtrType, Name);
  }
}
MCall->setTailCall();
if (Function *F = dyn_cast<Function>(MallocFunc.getCallee())) {
  MCall->setCallingConv(F->getCallingConv());
  if (!F->returnDoesNotAlias())
    F->setReturnDoesNotAlias();
}
assert(!MCall->getType()->isVoidTy() && "Malloc has void return type")(static_cast<void> (0));

return Result;
709}

711/// CreateMalloc - Generate the IR for a call to malloc:
712/// 1. Compute the malloc call's argument as the specified type's size,
713///    possibly multiplied by the array size if the array size is not
714///    constant 1.
715/// 2. Call malloc with that argument.
716/// 3. Bitcast the result of the malloc call to the specified type.
717Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
                                  Type *IntPtrTy, Type *AllocTy,
                                  Value *AllocSize, Value *ArraySize,
                                  Function *MallocF,
                                  const Twine &Name) {
return createMalloc(InsertBefore, nullptr, IntPtrTy, AllocTy, AllocSize,
                    ArraySize, None, MallocF, Name);
724}
725Instruction *CallInst::CreateMalloc(Instruction *InsertBefore,
                                  Type *IntPtrTy, Type *AllocTy,
                                  Value *AllocSize, Value *ArraySize,
                                  ArrayRef<OperandBundleDef> OpB,
                                  Function *MallocF,
                                  const Twine &Name) {
return createMalloc(InsertBefore, nullptr, IntPtrTy, AllocTy, AllocSize,
                    ArraySize, OpB, MallocF, Name);
733}

735/// CreateMalloc - Generate the IR for a call to malloc:
736/// 1. Compute the malloc call's argument as the specified type's size,
737///    possibly multiplied by the array size if the array size is not
738///    constant 1.
739/// 2. Call malloc with that argument.
740/// 3. Bitcast the result of the malloc call to the specified type.
741/// Note: This function does not add the bitcast to the basic block, that is the
742/// responsibility of the caller.
743Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
                                  Type *IntPtrTy, Type *AllocTy,
                                  Value *AllocSize, Value *ArraySize,
                                  Function *MallocF, const Twine &Name) {
return createMalloc(nullptr, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
                    ArraySize, None, MallocF, Name);
749}
750Instruction *CallInst::CreateMalloc(BasicBlock *InsertAtEnd,
                                  Type *IntPtrTy, Type *AllocTy,
                                  Value *AllocSize, Value *ArraySize,
                                  ArrayRef<OperandBundleDef> OpB,
                                  Function *MallocF, const Twine &Name) {
return createMalloc(nullptr, InsertAtEnd, IntPtrTy, AllocTy, AllocSize,
                    ArraySize, OpB, MallocF, Name);
757}

759static Instruction *createFree(Value *Source,
                             ArrayRef<OperandBundleDef> Bundles,
                             Instruction *InsertBefore,
                             BasicBlock *InsertAtEnd) {
assert(((!InsertBefore && InsertAtEnd) || (InsertBefore && !InsertAtEnd)) &&(static_cast<void> (0))
       "createFree needs either InsertBefore or InsertAtEnd")(static_cast<void> (0));
assert(Source->getType()->isPointerTy() &&(static_cast<void> (0))
       "Can not free something of nonpointer type!")(static_cast<void> (0));

BasicBlock *BB = InsertBefore ? InsertBefore->getParent() : InsertAtEnd;
Module *M = BB->getParent()->getParent();

Type *VoidTy = Type::getVoidTy(M->getContext());
Type *IntPtrTy = Type::getInt8PtrTy(M->getContext());
// prototype free as "void free(void*)"
FunctionCallee FreeFunc = M->getOrInsertFunction("free", VoidTy, IntPtrTy);
CallInst *Result = nullptr;
Value *PtrCast = Source;
if (InsertBefore) {
  if (Source->getType() != IntPtrTy)
    PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertBefore);
  Result = CallInst::Create(FreeFunc, PtrCast, Bundles, "", InsertBefore);
} else {
  if (Source->getType() != IntPtrTy)
    PtrCast = new BitCastInst(Source, IntPtrTy, "", InsertAtEnd);
  Result = CallInst::Create(FreeFunc, PtrCast, Bundles, "");
}
Result->setTailCall();
if (Function *F = dyn_cast<Function>(FreeFunc.getCallee()))
  Result->setCallingConv(F->getCallingConv());

return Result;
791}

793/// CreateFree - Generate the IR for a call to the builtin free function.
794Instruction *CallInst::CreateFree(Value *Source, Instruction *InsertBefore) {
return createFree(Source, None, InsertBefore, nullptr);
796}
797Instruction *CallInst::CreateFree(Value *Source,
                                ArrayRef<OperandBundleDef> Bundles,
                                Instruction *InsertBefore) {
return createFree(Source, Bundles, InsertBefore, nullptr);
801}

803/// CreateFree - Generate the IR for a call to the builtin free function.
804/// Note: This function does not add the call to the basic block, that is the
805/// responsibility of the caller.
806Instruction *CallInst::CreateFree(Value *Source, BasicBlock *InsertAtEnd) {
Instruction *FreeCall = createFree(Source, None, nullptr, InsertAtEnd);
assert(FreeCall && "CreateFree did not create a CallInst")(static_cast<void> (0));
return FreeCall;
810}
811Instruction *CallInst::CreateFree(Value *Source,
                                ArrayRef<OperandBundleDef> Bundles,
                                BasicBlock *InsertAtEnd) {
Instruction *FreeCall = createFree(Source, Bundles, nullptr, InsertAtEnd);
assert(FreeCall && "CreateFree did not create a CallInst")(static_cast<void> (0));
return FreeCall;
817}

819//===----------------------------------------------------------------------===//
820//                        InvokeInst Implementation
821//===----------------------------------------------------------------------===//

823void InvokeInst::init(FunctionType *FTy, Value *Fn, BasicBlock *IfNormal,
                    BasicBlock *IfException, ArrayRef<Value *> Args,
                    ArrayRef<OperandBundleDef> Bundles,
                    const Twine &NameStr) {
this->FTy = FTy;

assert((int)getNumOperands() ==(static_cast<void> (0))
           ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)) &&(static_cast<void> (0))
       "NumOperands not set up?")(static_cast<void> (0));

833#ifndef NDEBUG1
assert(((Args.size() == FTy->getNumParams()) ||(static_cast<void> (0))
        (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&(static_cast<void> (0))
       "Invoking a function with bad signature")(static_cast<void> (0));

for (unsigned i = 0, e = Args.size(); i != e; i++)
  assert((i >= FTy->getNumParams() ||(static_cast<void> (0))
          FTy->getParamType(i) == Args[i]->getType()) &&(static_cast<void> (0))
         "Invoking a function with a bad signature!")(static_cast<void> (0));
842#endif

// Set operands in order of their index to match use-list-order
// prediction.
llvm::copy(Args, op_begin());
setNormalDest(IfNormal);
setUnwindDest(IfException);
setCalledOperand(Fn);

auto It = populateBundleOperandInfos(Bundles, Args.size());
(void)It;
assert(It + 3 == op_end() && "Should add up!")(static_cast<void> (0));

setName(NameStr);
856}

858InvokeInst::InvokeInst(const InvokeInst &II)
  : CallBase(II.Attrs, II.FTy, II.getType(), Instruction::Invoke,
             OperandTraits<CallBase>::op_end(this) - II.getNumOperands(),
             II.getNumOperands()) {
setCallingConv(II.getCallingConv());
std::copy(II.op_begin(), II.op_end(), op_begin());
std::copy(II.bundle_op_info_begin(), II.bundle_op_info_end(),
          bundle_op_info_begin());
SubclassOptionalData = II.SubclassOptionalData;
867}

869InvokeInst *InvokeInst::Create(InvokeInst *II, ArrayRef<OperandBundleDef> OpB,
                             Instruction *InsertPt) {
std::vector<Value *> Args(II->arg_begin(), II->arg_end());

auto *NewII = InvokeInst::Create(
    II->getFunctionType(), II->getCalledOperand(), II->getNormalDest(),
    II->getUnwindDest(), Args, OpB, II->getName(), InsertPt);
NewII->setCallingConv(II->getCallingConv());
NewII->SubclassOptionalData = II->SubclassOptionalData;
NewII->setAttributes(II->getAttributes());
NewII->setDebugLoc(II->getDebugLoc());
return NewII;
881}

883LandingPadInst *InvokeInst::getLandingPadInst() const {
return cast<LandingPadInst>(getUnwindDest()->getFirstNonPHI());
885}

887//===----------------------------------------------------------------------===//
888//                        CallBrInst Implementation
889//===----------------------------------------------------------------------===//

891void CallBrInst::init(FunctionType *FTy, Value *Fn, BasicBlock *Fallthrough,
                    ArrayRef<BasicBlock *> IndirectDests,
                    ArrayRef<Value *> Args,
                    ArrayRef<OperandBundleDef> Bundles,
                    const Twine &NameStr) {
this->FTy = FTy;

assert((int)getNumOperands() ==(static_cast<void> (0))
           ComputeNumOperands(Args.size(), IndirectDests.size(),(static_cast<void> (0))
                              CountBundleInputs(Bundles)) &&(static_cast<void> (0))
       "NumOperands not set up?")(static_cast<void> (0));

903#ifndef NDEBUG1
assert(((Args.size() == FTy->getNumParams()) ||(static_cast<void> (0))
        (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&(static_cast<void> (0))
       "Calling a function with bad signature")(static_cast<void> (0));

for (unsigned i = 0, e = Args.size(); i != e; i++)
  assert((i >= FTy->getNumParams() ||(static_cast<void> (0))
          FTy->getParamType(i) == Args[i]->getType()) &&(static_cast<void> (0))
         "Calling a function with a bad signature!")(static_cast<void> (0));
912#endif

// Set operands in order of their index to match use-list-order
// prediction.
std::copy(Args.begin(), Args.end(), op_begin());
NumIndirectDests = IndirectDests.size();
setDefaultDest(Fallthrough);
for (unsigned i = 0; i != NumIndirectDests; ++i)
  setIndirectDest(i, IndirectDests[i]);
setCalledOperand(Fn);

auto It = populateBundleOperandInfos(Bundles, Args.size());
(void)It;
assert(It + 2 + IndirectDests.size() == op_end() && "Should add up!")(static_cast<void> (0));

setName(NameStr);
928}

930void CallBrInst::updateArgBlockAddresses(unsigned i, BasicBlock *B) {
assert(getNumIndirectDests() > i && "IndirectDest # out of range for callbr")(static_cast<void> (0));
if (BasicBlock *OldBB = getIndirectDest(i)) {
  BlockAddress *Old = BlockAddress::get(OldBB);
  BlockAddress *New = BlockAddress::get(B);
  for (unsigned ArgNo = 0, e = getNumArgOperands(); ArgNo != e; ++ArgNo)
    if (dyn_cast<BlockAddress>(getArgOperand(ArgNo)) == Old)
      setArgOperand(ArgNo, New);
}
939}

941CallBrInst::CallBrInst(const CallBrInst &CBI)
  : CallBase(CBI.Attrs, CBI.FTy, CBI.getType(), Instruction::CallBr,
             OperandTraits<CallBase>::op_end(this) - CBI.getNumOperands(),
             CBI.getNumOperands()) {
setCallingConv(CBI.getCallingConv());
std::copy(CBI.op_begin(), CBI.op_end(), op_begin());
std::copy(CBI.bundle_op_info_begin(), CBI.bundle_op_info_end(),
          bundle_op_info_begin());
SubclassOptionalData = CBI.SubclassOptionalData;
NumIndirectDests = CBI.NumIndirectDests;
951}

953CallBrInst *CallBrInst::Create(CallBrInst *CBI, ArrayRef<OperandBundleDef> OpB,
                             Instruction *InsertPt) {
std::vector<Value *> Args(CBI->arg_begin(), CBI->arg_end());

auto *NewCBI = CallBrInst::Create(
    CBI->getFunctionType(), CBI->getCalledOperand(), CBI->getDefaultDest(),
    CBI->getIndirectDests(), Args, OpB, CBI->getName(), InsertPt);
NewCBI->setCallingConv(CBI->getCallingConv());
NewCBI->SubclassOptionalData = CBI->SubclassOptionalData;
NewCBI->setAttributes(CBI->getAttributes());
NewCBI->setDebugLoc(CBI->getDebugLoc());
NewCBI->NumIndirectDests = CBI->NumIndirectDests;
return NewCBI;
966}

968//===----------------------------------------------------------------------===//
969//                        ReturnInst Implementation
970//===----------------------------------------------------------------------===//

972ReturnInst::ReturnInst(const ReturnInst &RI)
  : Instruction(Type::getVoidTy(RI.getContext()), Instruction::Ret,
                OperandTraits<ReturnInst>::op_end(this) - RI.getNumOperands(),
                RI.getNumOperands()) {
if (RI.getNumOperands())
  Op<0>() = RI.Op<0>();
SubclassOptionalData = RI.SubclassOptionalData;
979}

981ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(C), Instruction::Ret,
                OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
                InsertBefore) {
if (retVal)
  Op<0>() = retVal;
987}

989ReturnInst::ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(C), Instruction::Ret,
                OperandTraits<ReturnInst>::op_end(this) - !!retVal, !!retVal,
                InsertAtEnd) {
if (retVal)
  Op<0>() = retVal;
995}

997ReturnInst::ReturnInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(Context), Instruction::Ret,
                OperandTraits<ReturnInst>::op_end(this), 0, InsertAtEnd) {}

1001//===----------------------------------------------------------------------===//
1002//                        ResumeInst Implementation
1003//===----------------------------------------------------------------------===//

1005ResumeInst::ResumeInst(const ResumeInst &RI)
  : Instruction(Type::getVoidTy(RI.getContext()), Instruction::Resume,
                OperandTraits<ResumeInst>::op_begin(this), 1) {
Op<0>() = RI.Op<0>();
1009}

1011ResumeInst::ResumeInst(Value *Exn, Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
                OperandTraits<ResumeInst>::op_begin(this), 1, InsertBefore) {
Op<0>() = Exn;
1015}

1017ResumeInst::ResumeInst(Value *Exn, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(Exn->getContext()), Instruction::Resume,
                OperandTraits<ResumeInst>::op_begin(this), 1, InsertAtEnd) {
Op<0>() = Exn;
1021}

1023//===----------------------------------------------------------------------===//
1024//                        CleanupReturnInst Implementation
1025//===----------------------------------------------------------------------===//

1027CleanupReturnInst::CleanupReturnInst(const CleanupReturnInst &CRI)
  : Instruction(CRI.getType(), Instruction::CleanupRet,
                OperandTraits<CleanupReturnInst>::op_end(this) -
                    CRI.getNumOperands(),
                CRI.getNumOperands()) {
setSubclassData<Instruction::OpaqueField>(
    CRI.getSubclassData<Instruction::OpaqueField>());
Op<0>() = CRI.Op<0>();
if (CRI.hasUnwindDest())
  Op<1>() = CRI.Op<1>();
1037}

1039void CleanupReturnInst::init(Value *CleanupPad, BasicBlock *UnwindBB) {
if (UnwindBB)
  setSubclassData<UnwindDestField>(true);

Op<0>() = CleanupPad;
if (UnwindBB)
  Op<1>() = UnwindBB;
1046}

1048CleanupReturnInst::CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB,
                                   unsigned Values, Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(CleanupPad->getContext()),
                Instruction::CleanupRet,
                OperandTraits<CleanupReturnInst>::op_end(this) - Values,
                Values, InsertBefore) {
init(CleanupPad, UnwindBB);
1055}

1057CleanupReturnInst::CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB,
                                   unsigned Values, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(CleanupPad->getContext()),
                Instruction::CleanupRet,
                OperandTraits<CleanupReturnInst>::op_end(this) - Values,
                Values, InsertAtEnd) {
init(CleanupPad, UnwindBB);
1064}

1066//===----------------------------------------------------------------------===//
1067//                        CatchReturnInst Implementation
1068//===----------------------------------------------------------------------===//
1069void CatchReturnInst::init(Value *CatchPad, BasicBlock *BB) {
Op<0>() = CatchPad;
Op<1>() = BB;
1072}

1074CatchReturnInst::CatchReturnInst(const CatchReturnInst &CRI)
  : Instruction(Type::getVoidTy(CRI.getContext()), Instruction::CatchRet,
                OperandTraits<CatchReturnInst>::op_begin(this), 2) {
Op<0>() = CRI.Op<0>();
Op<1>() = CRI.Op<1>();
1079}

1081CatchReturnInst::CatchReturnInst(Value *CatchPad, BasicBlock *BB,
                               Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(BB->getContext()), Instruction::CatchRet,
                OperandTraits<CatchReturnInst>::op_begin(this), 2,
                InsertBefore) {
init(CatchPad, BB);
1087}

1089CatchReturnInst::CatchReturnInst(Value *CatchPad, BasicBlock *BB,
                               BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(BB->getContext()), Instruction::CatchRet,
                OperandTraits<CatchReturnInst>::op_begin(this), 2,
                InsertAtEnd) {
init(CatchPad, BB);
1095}

1097//===----------------------------------------------------------------------===//
1098//                       CatchSwitchInst Implementation
1099//===----------------------------------------------------------------------===//

1101CatchSwitchInst::CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumReservedValues,
                               const Twine &NameStr,
                               Instruction *InsertBefore)
  : Instruction(ParentPad->getType(), Instruction::CatchSwitch, nullptr, 0,
                InsertBefore) {
if (UnwindDest)
  ++NumReservedValues;
init(ParentPad, UnwindDest, NumReservedValues + 1);
setName(NameStr);
1111}

1113CatchSwitchInst::CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumReservedValues,
                               const Twine &NameStr, BasicBlock *InsertAtEnd)
  : Instruction(ParentPad->getType(), Instruction::CatchSwitch, nullptr, 0,
                InsertAtEnd) {
if (UnwindDest)
  ++NumReservedValues;
init(ParentPad, UnwindDest, NumReservedValues + 1);
setName(NameStr);
1122}

1124CatchSwitchInst::CatchSwitchInst(const CatchSwitchInst &CSI)
  : Instruction(CSI.getType(), Instruction::CatchSwitch, nullptr,
                CSI.getNumOperands()) {
init(CSI.getParentPad(), CSI.getUnwindDest(), CSI.getNumOperands());
setNumHungOffUseOperands(ReservedSpace);
Use *OL = getOperandList();
const Use *InOL = CSI.getOperandList();
for (unsigned I = 1, E = ReservedSpace; I != E; ++I)
  OL[I] = InOL[I];
1133}

1135void CatchSwitchInst::init(Value *ParentPad, BasicBlock *UnwindDest,
                         unsigned NumReservedValues) {
assert(ParentPad && NumReservedValues)(static_cast<void> (0));

ReservedSpace = NumReservedValues;
setNumHungOffUseOperands(UnwindDest ? 2 : 1);
allocHungoffUses(ReservedSpace);

Op<0>() = ParentPad;
if (UnwindDest) {
  setSubclassData<UnwindDestField>(true);
  setUnwindDest(UnwindDest);
}
1148}

1150/// growOperands - grow operands - This grows the operand list in response to a
1151/// push_back style of operation. This grows the number of ops by 2 times.
1152void CatchSwitchInst::growOperands(unsigned Size) {
unsigned NumOperands = getNumOperands();
assert(NumOperands >= 1)(static_cast<void> (0));
if (ReservedSpace >= NumOperands + Size)
  return;
ReservedSpace = (NumOperands + Size / 2) * 2;
growHungoffUses(ReservedSpace);
1159}

1161void CatchSwitchInst::addHandler(BasicBlock *Handler) {
unsigned OpNo = getNumOperands();
growOperands(1);
assert(OpNo < ReservedSpace && "Growing didn't work!")(static_cast<void> (0));
setNumHungOffUseOperands(getNumOperands() + 1);
getOperandList()[OpNo] = Handler;
1167}

1169void CatchSwitchInst::removeHandler(handler_iterator HI) {
// Move all subsequent handlers up one.
Use *EndDst = op_end() - 1;
for (Use *CurDst = HI.getCurrent(); CurDst != EndDst; ++CurDst)
  *CurDst = *(CurDst + 1);
// Null out the last handler use.
*EndDst = nullptr;

setNumHungOffUseOperands(getNumOperands() - 1);
1178}

1180//===----------------------------------------------------------------------===//
1181//                        FuncletPadInst Implementation
1182//===----------------------------------------------------------------------===//
1183void FuncletPadInst::init(Value *ParentPad, ArrayRef<Value *> Args,
                        const Twine &NameStr) {
assert(getNumOperands() == 1 + Args.size() && "NumOperands not set up?")(static_cast<void> (0));
llvm::copy(Args, op_begin());
setParentPad(ParentPad);
setName(NameStr);
1189}

1191FuncletPadInst::FuncletPadInst(const FuncletPadInst &FPI)
  : Instruction(FPI.getType(), FPI.getOpcode(),
                OperandTraits<FuncletPadInst>::op_end(this) -
                    FPI.getNumOperands(),
                FPI.getNumOperands()) {
std::copy(FPI.op_begin(), FPI.op_end(), op_begin());
setParentPad(FPI.getParentPad());
1198}

1200FuncletPadInst::FuncletPadInst(Instruction::FuncletPadOps Op, Value *ParentPad,
                             ArrayRef<Value *> Args, unsigned Values,
                             const Twine &NameStr, Instruction *InsertBefore)
  : Instruction(ParentPad->getType(), Op,
                OperandTraits<FuncletPadInst>::op_end(this) - Values, Values,
                InsertBefore) {
init(ParentPad, Args, NameStr);
1207}

1209FuncletPadInst::FuncletPadInst(Instruction::FuncletPadOps Op, Value *ParentPad,
                             ArrayRef<Value *> Args, unsigned Values,
                             const Twine &NameStr, BasicBlock *InsertAtEnd)
  : Instruction(ParentPad->getType(), Op,
                OperandTraits<FuncletPadInst>::op_end(this) - Values, Values,
                InsertAtEnd) {
init(ParentPad, Args, NameStr);
1216}

1218//===----------------------------------------------------------------------===//
1219//                      UnreachableInst Implementation
1220//===----------------------------------------------------------------------===//

1222UnreachableInst::UnreachableInst(LLVMContext &Context,
                               Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(Context), Instruction::Unreachable, nullptr,
                0, InsertBefore) {}
1226UnreachableInst::UnreachableInst(LLVMContext &Context, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(Context), Instruction::Unreachable, nullptr,
                0, InsertAtEnd) {}

1230//===----------------------------------------------------------------------===//
1231//                        BranchInst Implementation
1232//===----------------------------------------------------------------------===//

1234void BranchInst::AssertOK() {
if (isConditional())
  assert(getCondition()->getType()->isIntegerTy(1) &&(static_cast<void> (0))
         "May only branch on boolean predicates!")(static_cast<void> (0));
1238}

1240BranchInst::BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
                OperandTraits<BranchInst>::op_end(this) - 1, 1,
                InsertBefore) {
assert(IfTrue && "Branch destination may not be null!")(static_cast<void> (0));
Op<-1>() = IfTrue;
1246}

1248BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
                     Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
                OperandTraits<BranchInst>::op_end(this) - 3, 3,
                InsertBefore) {
// Assign in order of operand index to make use-list order predictable.
Op<-3>() = Cond;
Op<-2>() = IfFalse;
Op<-1>() = IfTrue;
1257#ifndef NDEBUG1
AssertOK();
1259#endif
1260}

1262BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
                OperandTraits<BranchInst>::op_end(this) - 1, 1, InsertAtEnd) {
assert(IfTrue && "Branch destination may not be null!")(static_cast<void> (0));
Op<-1>() = IfTrue;
1267}

1269BranchInst::BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
                     BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(IfTrue->getContext()), Instruction::Br,
                OperandTraits<BranchInst>::op_end(this) - 3, 3, InsertAtEnd) {
// Assign in order of operand index to make use-list order predictable.
Op<-3>() = Cond;
Op<-2>() = IfFalse;
Op<-1>() = IfTrue;
1277#ifndef NDEBUG1
AssertOK();
1279#endif
1280}

1282BranchInst::BranchInst(const BranchInst &BI)
  : Instruction(Type::getVoidTy(BI.getContext()), Instruction::Br,
                OperandTraits<BranchInst>::op_end(this) - BI.getNumOperands(),
                BI.getNumOperands()) {
// Assign in order of operand index to make use-list order predictable.
if (BI.getNumOperands() != 1) {
  assert(BI.getNumOperands() == 3 && "BR can have 1 or 3 operands!")(static_cast<void> (0));
  Op<-3>() = BI.Op<-3>();
  Op<-2>() = BI.Op<-2>();
}
Op<-1>() = BI.Op<-1>();
SubclassOptionalData = BI.SubclassOptionalData;
1294}

1296void BranchInst::swapSuccessors() {
assert(isConditional() &&(static_cast<void> (0))
       "Cannot swap successors of an unconditional branch")(static_cast<void> (0));
Op<-1>().swap(Op<-2>());

// Update profile metadata if present and it matches our structural
// expectations.
swapProfMetadata();
1304}

1306//===----------------------------------------------------------------------===//
1307//                        AllocaInst Implementation
1308//===----------------------------------------------------------------------===//

1310static Value *getAISize(LLVMContext &Context, Value *Amt) {
if (!Amt)
  Amt = ConstantInt::get(Type::getInt32Ty(Context), 1);
else {
  assert(!isa<BasicBlock>(Amt) &&(static_cast<void> (0))
         "Passed basic block into allocation size parameter! Use other ctor")(static_cast<void> (0));
  assert(Amt->getType()->isIntegerTy() &&(static_cast<void> (0))
         "Allocation array size is not an integer!")(static_cast<void> (0));
}
return Amt;
1320}

1322static Align computeAllocaDefaultAlign(Type *Ty, BasicBlock *BB) {
assert(BB && "Insertion BB cannot be null when alignment not provided!")(static_cast<void> (0));
assert(BB->getParent() &&(static_cast<void> (0))
       "BB must be in a Function when alignment not provided!")(static_cast<void> (0));
const DataLayout &DL = BB->getModule()->getDataLayout();
return DL.getPrefTypeAlign(Ty);
1328}

1330static Align computeAllocaDefaultAlign(Type *Ty, Instruction *I) {
assert(I && "Insertion position cannot be null when alignment not provided!")(static_cast<void> (0));
return computeAllocaDefaultAlign(Ty, I->getParent());
1333}

1335AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, const Twine &Name,
                     Instruction *InsertBefore)
: AllocaInst(Ty, AddrSpace, /*ArraySize=*/nullptr, Name, InsertBefore) {}

1339AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, const Twine &Name,
                     BasicBlock *InsertAtEnd)
: AllocaInst(Ty, AddrSpace, /*ArraySize=*/nullptr, Name, InsertAtEnd) {}

1343AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
                     const Twine &Name, Instruction *InsertBefore)
  : AllocaInst(Ty, AddrSpace, ArraySize,
               computeAllocaDefaultAlign(Ty, InsertBefore), Name,
               InsertBefore) {}

1349AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
                     const Twine &Name, BasicBlock *InsertAtEnd)
  : AllocaInst(Ty, AddrSpace, ArraySize,
               computeAllocaDefaultAlign(Ty, InsertAtEnd), Name,
               InsertAtEnd) {}

1355AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
                     Align Align, const Twine &Name,
                     Instruction *InsertBefore)
  : UnaryInstruction(PointerType::get(Ty, AddrSpace), Alloca,
                     getAISize(Ty->getContext(), ArraySize), InsertBefore),
    AllocatedType(Ty) {
setAlignment(Align);
assert(!Ty->isVoidTy() && "Cannot allocate void!")(static_cast<void> (0));
setName(Name);
1364}

1366AllocaInst::AllocaInst(Type *Ty, unsigned AddrSpace, Value *ArraySize,
                     Align Align, const Twine &Name, BasicBlock *InsertAtEnd)
  : UnaryInstruction(PointerType::get(Ty, AddrSpace), Alloca,
                     getAISize(Ty->getContext(), ArraySize), InsertAtEnd),
    AllocatedType(Ty) {
setAlignment(Align);
assert(!Ty->isVoidTy() && "Cannot allocate void!")(static_cast<void> (0));
setName(Name);
1374}


1377bool AllocaInst::isArrayAllocation() const {
if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(0)))
  return !CI->isOne();
return true;
1381}

1383/// isStaticAlloca - Return true if this alloca is in the entry block of the
1384/// function and is a constant size.  If so, the code generator will fold it
1385/// into the prolog/epilog code, so it is basically free.
1386bool AllocaInst::isStaticAlloca() const {
// Must be constant size.
if (!isa<ConstantInt>(getArraySize())) return false;

// Must be in the entry block.
const BasicBlock *Parent = getParent();
return Parent == &Parent->getParent()->front() && !isUsedWithInAlloca();
1393}

1395//===----------------------------------------------------------------------===//
1396//                           LoadInst Implementation
1397//===----------------------------------------------------------------------===//

1399void LoadInst::AssertOK() {
assert(getOperand(0)->getType()->isPointerTy() &&(static_cast<void> (0))
       "Ptr must have pointer type.")(static_cast<void> (0));
assert(!(isAtomic() && getAlignment() == 0) &&(static_cast<void> (0))
       "Alignment required for atomic load")(static_cast<void> (0));
1404}

1406static Align computeLoadStoreDefaultAlign(Type *Ty, BasicBlock *BB) {
assert(BB && "Insertion BB cannot be null when alignment not provided!")(static_cast<void> (0));
assert(BB->getParent() &&(static_cast<void> (0))
       "BB must be in a Function when alignment not provided!")(static_cast<void> (0));
const DataLayout &DL = BB->getModule()->getDataLayout();
return DL.getABITypeAlign(Ty);
1412}

1414static Align computeLoadStoreDefaultAlign(Type *Ty, Instruction *I) {
assert(I && "Insertion position cannot be null when alignment not provided!")(static_cast<void> (0));
return computeLoadStoreDefaultAlign(Ty, I->getParent());
1417}

1419LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name,
                 Instruction *InsertBef)
  : LoadInst(Ty, Ptr, Name, /*isVolatile=*/false, InsertBef) {}

1423LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name,
                 BasicBlock *InsertAE)
  : LoadInst(Ty, Ptr, Name, /*isVolatile=*/false, InsertAE) {}

1427LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 Instruction *InsertBef)
  : LoadInst(Ty, Ptr, Name, isVolatile,
             computeLoadStoreDefaultAlign(Ty, InsertBef), InsertBef) {}

1432LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 BasicBlock *InsertAE)
  : LoadInst(Ty, Ptr, Name, isVolatile,
             computeLoadStoreDefaultAlign(Ty, InsertAE), InsertAE) {}

1437LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 Align Align, Instruction *InsertBef)
  : LoadInst(Ty, Ptr, Name, isVolatile, Align, AtomicOrdering::NotAtomic,
             SyncScope::System, InsertBef) {}

1442LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 Align Align, BasicBlock *InsertAE)
  : LoadInst(Ty, Ptr, Name, isVolatile, Align, AtomicOrdering::NotAtomic,
             SyncScope::System, InsertAE) {}

1447LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 Align Align, AtomicOrdering Order, SyncScope::ID SSID,
                 Instruction *InsertBef)
  : UnaryInstruction(Ty, Load, Ptr, InsertBef) {
assert(cast<PointerType>(Ptr->getType())->isOpaqueOrPointeeTypeMatches(Ty))(static_cast<void> (0));
setVolatile(isVolatile);
setAlignment(Align);
setAtomic(Order, SSID);
AssertOK();
setName(Name);
1457}

1459LoadInst::LoadInst(Type *Ty, Value *Ptr, const Twine &Name, bool isVolatile,
                 Align Align, AtomicOrdering Order, SyncScope::ID SSID,
                 BasicBlock *InsertAE)
  : UnaryInstruction(Ty, Load, Ptr, InsertAE) {
assert(cast<PointerType>(Ptr->getType())->isOpaqueOrPointeeTypeMatches(Ty))(static_cast<void> (0));
setVolatile(isVolatile);
setAlignment(Align);
setAtomic(Order, SSID);
AssertOK();
setName(Name);
1469}

1471//===----------------------------------------------------------------------===//
1472//                           StoreInst Implementation
1473//===----------------------------------------------------------------------===//

1475void StoreInst::AssertOK() {
assert(getOperand(0) && getOperand(1) && "Both operands must be non-null!")(static_cast<void> (0));
assert(getOperand(1)->getType()->isPointerTy() &&(static_cast<void> (0))
       "Ptr must have pointer type!")(static_cast<void> (0));
assert(cast<PointerType>(getOperand(1)->getType())(static_cast<void> (0))
           ->isOpaqueOrPointeeTypeMatches(getOperand(0)->getType()) &&(static_cast<void> (0))
       "Ptr must be a pointer to Val type!")(static_cast<void> (0));
assert(!(isAtomic() && getAlignment() == 0) &&(static_cast<void> (0))
       "Alignment required for atomic store")(static_cast<void> (0));
1484}

1486StoreInst::StoreInst(Value *val, Value *addr, Instruction *InsertBefore)
  : StoreInst(val, addr, /*isVolatile=*/false, InsertBefore) {}

1489StoreInst::StoreInst(Value *val, Value *addr, BasicBlock *InsertAtEnd)
  : StoreInst(val, addr, /*isVolatile=*/false, InsertAtEnd) {}

1492StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
                   Instruction *InsertBefore)
  : StoreInst(val, addr, isVolatile,
              computeLoadStoreDefaultAlign(val->getType(), InsertBefore),
              InsertBefore) {}

1498StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile,
                   BasicBlock *InsertAtEnd)
  : StoreInst(val, addr, isVolatile,
              computeLoadStoreDefaultAlign(val->getType(), InsertAtEnd),
              InsertAtEnd) {}

1504StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, Align Align,
                   Instruction *InsertBefore)
  : StoreInst(val, addr, isVolatile, Align, AtomicOrdering::NotAtomic,
              SyncScope::System, InsertBefore) {}

1509StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, Align Align,
                   BasicBlock *InsertAtEnd)
  : StoreInst(val, addr, isVolatile, Align, AtomicOrdering::NotAtomic,
              SyncScope::System, InsertAtEnd) {}

1514StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, Align Align,
                   AtomicOrdering Order, SyncScope::ID SSID,
                   Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(val->getContext()), Store,
                OperandTraits<StoreInst>::op_begin(this),
                OperandTraits<StoreInst>::operands(this), InsertBefore) {
Op<0>() = val;
Op<1>() = addr;
setVolatile(isVolatile);
setAlignment(Align);
setAtomic(Order, SSID);
AssertOK();
1526}

1528StoreInst::StoreInst(Value *val, Value *addr, bool isVolatile, Align Align,
                   AtomicOrdering Order, SyncScope::ID SSID,
                   BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(val->getContext()), Store,
                OperandTraits<StoreInst>::op_begin(this),
                OperandTraits<StoreInst>::operands(this), InsertAtEnd) {
Op<0>() = val;
Op<1>() = addr;
setVolatile(isVolatile);
setAlignment(Align);
setAtomic(Order, SSID);
AssertOK();
1540}


1543//===----------------------------------------------------------------------===//
1544//                       AtomicCmpXchgInst Implementation
1545//===----------------------------------------------------------------------===//

1547void AtomicCmpXchgInst::Init(Value *Ptr, Value *Cmp, Value *NewVal,
                           Align Alignment, AtomicOrdering SuccessOrdering,
                           AtomicOrdering FailureOrdering,
                           SyncScope::ID SSID) {
Op<0>() = Ptr;
Op<1>() = Cmp;
Op<2>() = NewVal;
setSuccessOrdering(SuccessOrdering);
setFailureOrdering(FailureOrdering);
setSyncScopeID(SSID);
setAlignment(Alignment);

assert(getOperand(0) && getOperand(1) && getOperand(2) &&(static_cast<void> (0))
       "All operands must be non-null!")(static_cast<void> (0));
assert(getOperand(0)->getType()->isPointerTy() &&(static_cast<void> (0))
       "Ptr must have pointer type!")(static_cast<void> (0));
assert(cast<PointerType>(getOperand(0)->getType())(static_cast<void> (0))
           ->isOpaqueOrPointeeTypeMatches(getOperand(1)->getType()) &&(static_cast<void> (0))
       "Ptr must be a pointer to Cmp type!")(static_cast<void> (0));
assert(cast<PointerType>(getOperand(0)->getType())(static_cast<void> (0))
           ->isOpaqueOrPointeeTypeMatches(getOperand(2)->getType()) &&(static_cast<void> (0))
       "Ptr must be a pointer to NewVal type!")(static_cast<void> (0));
assert(getOperand(1)->getType() == getOperand(2)->getType() &&(static_cast<void> (0))
       "Cmp type and NewVal type must be same!")(static_cast<void> (0));
1571}

1573AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
                                   Align Alignment,
                                   AtomicOrdering SuccessOrdering,
                                   AtomicOrdering FailureOrdering,
                                   SyncScope::ID SSID,
                                   Instruction *InsertBefore)
  : Instruction(
        StructType::get(Cmp->getType(), Type::getInt1Ty(Cmp->getContext())),
        AtomicCmpXchg, OperandTraits<AtomicCmpXchgInst>::op_begin(this),
        OperandTraits<AtomicCmpXchgInst>::operands(this), InsertBefore) {
Init(Ptr, Cmp, NewVal, Alignment, SuccessOrdering, FailureOrdering, SSID);
1584}

1586AtomicCmpXchgInst::AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
                                   Align Alignment,
                                   AtomicOrdering SuccessOrdering,
                                   AtomicOrdering FailureOrdering,
                                   SyncScope::ID SSID,
                                   BasicBlock *InsertAtEnd)
  : Instruction(
        StructType::get(Cmp->getType(), Type::getInt1Ty(Cmp->getContext())),
        AtomicCmpXchg, OperandTraits<AtomicCmpXchgInst>::op_begin(this),
        OperandTraits<AtomicCmpXchgInst>::operands(this), InsertAtEnd) {
Init(Ptr, Cmp, NewVal, Alignment, SuccessOrdering, FailureOrdering, SSID);
1597}

1599//===----------------------------------------------------------------------===//
1600//                       AtomicRMWInst Implementation
1601//===----------------------------------------------------------------------===//

1603void AtomicRMWInst::Init(BinOp Operation, Value *Ptr, Value *Val,
                       Align Alignment, AtomicOrdering Ordering,
                       SyncScope::ID SSID) {
Op<0>() = Ptr;
Op<1>() = Val;
setOperation(Operation);
setOrdering(Ordering);
setSyncScopeID(SSID);
setAlignment(Alignment);

assert(getOperand(0) && getOperand(1) &&(static_cast<void> (0))
       "All operands must be non-null!")(static_cast<void> (0));
assert(getOperand(0)->getType()->isPointerTy() &&(static_cast<void> (0))
       "Ptr must have pointer type!")(static_cast<void> (0));
assert(cast<PointerType>(getOperand(0)->getType())(static_cast<void> (0))
           ->isOpaqueOrPointeeTypeMatches(getOperand(1)->getType()) &&(static_cast<void> (0))
       "Ptr must be a pointer to Val type!")(static_cast<void> (0));
assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast<void> (0))
       "AtomicRMW instructions must be atomic!")(static_cast<void> (0));
1622}

1624AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
                           Align Alignment, AtomicOrdering Ordering,
                           SyncScope::ID SSID, Instruction *InsertBefore)
  : Instruction(Val->getType(), AtomicRMW,
                OperandTraits<AtomicRMWInst>::op_begin(this),
                OperandTraits<AtomicRMWInst>::operands(this), InsertBefore) {
Init(Operation, Ptr, Val, Alignment, Ordering, SSID);
1631}

1633AtomicRMWInst::AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
                           Align Alignment, AtomicOrdering Ordering,
                           SyncScope::ID SSID, BasicBlock *InsertAtEnd)
  : Instruction(Val->getType(), AtomicRMW,
                OperandTraits<AtomicRMWInst>::op_begin(this),
                OperandTraits<AtomicRMWInst>::operands(this), InsertAtEnd) {
Init(Operation, Ptr, Val, Alignment, Ordering, SSID);
1640}

1642StringRef AtomicRMWInst::getOperationName(BinOp Op) {
switch (Op) {
case AtomicRMWInst::Xchg:
  return "xchg";
case AtomicRMWInst::Add:
  return "add";
case AtomicRMWInst::Sub:
  return "sub";
case AtomicRMWInst::And:
  return "and";
case AtomicRMWInst::Nand:
  return "nand";
case AtomicRMWInst::Or:
  return "or";
case AtomicRMWInst::Xor:
  return "xor";
case AtomicRMWInst::Max:
  return "max";
case AtomicRMWInst::Min:
  return "min";
case AtomicRMWInst::UMax:
  return "umax";
case AtomicRMWInst::UMin:
  return "umin";
case AtomicRMWInst::FAdd:
  return "fadd";
case AtomicRMWInst::FSub:
  return "fsub";
case AtomicRMWInst::BAD_BINOP:
  return "<invalid operation>";
}

llvm_unreachable("invalid atomicrmw operation")__builtin_unreachable();
1675}

1677//===----------------------------------------------------------------------===//
1678//                       FenceInst Implementation
1679//===----------------------------------------------------------------------===//

1681FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
                   SyncScope::ID SSID,
                   Instruction *InsertBefore)
: Instruction(Type::getVoidTy(C), Fence, nullptr, 0, InsertBefore) {
setOrdering(Ordering);
setSyncScopeID(SSID);
1687}

1689FenceInst::FenceInst(LLVMContext &C, AtomicOrdering Ordering,
                   SyncScope::ID SSID,
                   BasicBlock *InsertAtEnd)
: Instruction(Type::getVoidTy(C), Fence, nullptr, 0, InsertAtEnd) {
setOrdering(Ordering);
setSyncScopeID(SSID);
1695}

1697//===----------------------------------------------------------------------===//
1698//                       GetElementPtrInst Implementation
1699//===----------------------------------------------------------------------===//

1701void GetElementPtrInst::init(Value *Ptr, ArrayRef<Value *> IdxList,
                           const Twine &Name) {
assert(getNumOperands() == 1 + IdxList.size() &&(static_cast<void> (0))
       "NumOperands not initialized?")(static_cast<void> (0));
Op<0>() = Ptr;
llvm::copy(IdxList, op_begin() + 1);
setName(Name);
1708}

1710GetElementPtrInst::GetElementPtrInst(const GetElementPtrInst &GEPI)
  : Instruction(GEPI.getType(), GetElementPtr,
                OperandTraits<GetElementPtrInst>::op_end(this) -
                    GEPI.getNumOperands(),
                GEPI.getNumOperands()),
    SourceElementType(GEPI.SourceElementType),
    ResultElementType(GEPI.ResultElementType) {
std::copy(GEPI.op_begin(), GEPI.op_end(), op_begin());
SubclassOptionalData = GEPI.SubclassOptionalData;
1719}

1721Type *GetElementPtrInst::getTypeAtIndex(Type *Ty, Value *Idx) {
if (auto *Struct = dyn_cast<StructType>(Ty)) {
  if (!Struct->indexValid(Idx))
    return nullptr;
  return Struct->getTypeAtIndex(Idx);
}
if (!Idx->getType()->isIntOrIntVectorTy())
  return nullptr;
if (auto *Array = dyn_cast<ArrayType>(Ty))
  return Array->getElementType();
if (auto *Vector = dyn_cast<VectorType>(Ty))
  return Vector->getElementType();
return nullptr;
1734}

1736Type *GetElementPtrInst::getTypeAtIndex(Type *Ty, uint64_t Idx) {
if (auto *Struct = dyn_cast<StructType>(Ty)) {
  if (Idx >= Struct->getNumElements())
    return nullptr;
  return Struct->getElementType(Idx);
}
if (auto *Array = dyn_cast<ArrayType>(Ty))
  return Array->getElementType();
if (auto *Vector = dyn_cast<VectorType>(Ty))
  return Vector->getElementType();
return nullptr;
1747}

1749template <typename IndexTy>
1750static Type *getIndexedTypeInternal(Type *Ty, ArrayRef<IndexTy> IdxList) {
if (IdxList.empty())
  return Ty;
for (IndexTy V : IdxList.slice(1)) {
  Ty = GetElementPtrInst::getTypeAtIndex(Ty, V);
  if (!Ty)
    return Ty;
}
return Ty;
1759}

1761Type *GetElementPtrInst::getIndexedType(Type *Ty, ArrayRef<Value *> IdxList) {
return getIndexedTypeInternal(Ty, IdxList);
1763}

1765Type *GetElementPtrInst::getIndexedType(Type *Ty,
                                      ArrayRef<Constant *> IdxList) {
return getIndexedTypeInternal(Ty, IdxList);
1768}

1770Type *GetElementPtrInst::getIndexedType(Type *Ty, ArrayRef<uint64_t> IdxList) {
return getIndexedTypeInternal(Ty, IdxList);
1772}

1774/// hasAllZeroIndices - Return true if all of the indices of this GEP are
1775/// zeros.  If so, the result pointer and the first operand have the same
1776/// value, just potentially different types.
1777bool GetElementPtrInst::hasAllZeroIndices() const {
for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
  if (ConstantInt *CI = dyn_cast<ConstantInt>(getOperand(i))) {
    if (!CI->isZero()) return false;
  } else {
    return false;
  }
}
return true;
1786}

1788/// hasAllConstantIndices - Return true if all of the indices of this GEP are
1789/// constant integers.  If so, the result pointer and the first operand have
1790/// a constant offset between them.
1791bool GetElementPtrInst::hasAllConstantIndices() const {
for (unsigned i = 1, e = getNumOperands(); i != e; ++i) {
  if (!isa<ConstantInt>(getOperand(i)))
    return false;
}
return true;
1797}

1799void GetElementPtrInst::setIsInBounds(bool B) {
cast<GEPOperator>(this)->setIsInBounds(B);
1801}

1803bool GetElementPtrInst::isInBounds() const {
return cast<GEPOperator>(this)->isInBounds();
1805}

1807bool GetElementPtrInst::accumulateConstantOffset(const DataLayout &DL,
                                               APInt &Offset) const {
// Delegate to the generic GEPOperator implementation.
return cast<GEPOperator>(this)->accumulateConstantOffset(DL, Offset);
1811}

1813bool GetElementPtrInst::collectOffset(
  const DataLayout &DL, unsigned BitWidth,
  MapVector<Value *, APInt> &VariableOffsets,
  APInt &ConstantOffset) const {
// Delegate to the generic GEPOperator implementation.
return cast<GEPOperator>(this)->collectOffset(DL, BitWidth, VariableOffsets,
                                              ConstantOffset);
1820}

1822//===----------------------------------------------------------------------===//
1823//                           ExtractElementInst Implementation
1824//===----------------------------------------------------------------------===//

1826ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
                                     const Twine &Name,
                                     Instruction *InsertBef)
: Instruction(cast<VectorType>(Val->getType())->getElementType(),
              ExtractElement,
              OperandTraits<ExtractElementInst>::op_begin(this),
              2, InsertBef) {
assert(isValidOperands(Val, Index) &&(static_cast<void> (0))
       "Invalid extractelement instruction operands!")(static_cast<void> (0));
Op<0>() = Val;
Op<1>() = Index;
setName(Name);
1838}

1840ExtractElementInst::ExtractElementInst(Value *Val, Value *Index,
                                     const Twine &Name,
                                     BasicBlock *InsertAE)
: Instruction(cast<VectorType>(Val->getType())->getElementType(),
              ExtractElement,
              OperandTraits<ExtractElementInst>::op_begin(this),
              2, InsertAE) {
assert(isValidOperands(Val, Index) &&(static_cast<void> (0))
       "Invalid extractelement instruction operands!")(static_cast<void> (0));

Op<0>() = Val;
Op<1>() = Index;
setName(Name);
1853}

1855bool ExtractElementInst::isValidOperands(const Value *Val, const Value *Index) {
if (!Val->getType()->isVectorTy() || !Index->getType()->isIntegerTy())
  return false;
return true;
1859}

1861//===----------------------------------------------------------------------===//
1862//                           InsertElementInst Implementation
1863//===----------------------------------------------------------------------===//

1865InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
                                   const Twine &Name,
                                   Instruction *InsertBef)
: Instruction(Vec->getType(), InsertElement,
              OperandTraits<InsertElementInst>::op_begin(this),
              3, InsertBef) {
assert(isValidOperands(Vec, Elt, Index) &&(static_cast<void> (0))
       "Invalid insertelement instruction operands!")(static_cast<void> (0));
Op<0>() = Vec;
Op<1>() = Elt;
Op<2>() = Index;
setName(Name);
1877}

1879InsertElementInst::InsertElementInst(Value *Vec, Value *Elt, Value *Index,
                                   const Twine &Name,
                                   BasicBlock *InsertAE)
: Instruction(Vec->getType(), InsertElement,
              OperandTraits<InsertElementInst>::op_begin(this),
              3, InsertAE) {
assert(isValidOperands(Vec, Elt, Index) &&(static_cast<void> (0))
       "Invalid insertelement instruction operands!")(static_cast<void> (0));

Op<0>() = Vec;
Op<1>() = Elt;
Op<2>() = Index;
setName(Name);
1892}

1894bool InsertElementInst::isValidOperands(const Value *Vec, const Value *Elt,
                                      const Value *Index) {
if (!Vec->getType()->isVectorTy())
  return false;   // First operand of insertelement must be vector type.

if (Elt->getType() != cast<VectorType>(Vec->getType())->getElementType())
  return false;// Second operand of insertelement must be vector element type.

if (!Index->getType()->isIntegerTy())
  return false;  // Third operand of insertelement must be i32.
return true;
1905}

1907//===----------------------------------------------------------------------===//
1908//                      ShuffleVectorInst Implementation
1909//===----------------------------------------------------------------------===//

1911ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                                   const Twine &Name,
                                   Instruction *InsertBefore)
  : Instruction(
        VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
                        cast<VectorType>(Mask->getType())->getElementCount()),
        ShuffleVector, OperandTraits<ShuffleVectorInst>::op_begin(this),
        OperandTraits<ShuffleVectorInst>::operands(this), InsertBefore) {
assert(isValidOperands(V1, V2, Mask) &&(static_cast<void> (0))
       "Invalid shuffle vector instruction operands!")(static_cast<void> (0));

Op<0>() = V1;
Op<1>() = V2;
SmallVector<int, 16> MaskArr;
getShuffleMask(cast<Constant>(Mask), MaskArr);
setShuffleMask(MaskArr);
setName(Name);
1928}

1930ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                                   const Twine &Name, BasicBlock *InsertAtEnd)
  : Instruction(
        VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
                        cast<VectorType>(Mask->getType())->getElementCount()),
        ShuffleVector, OperandTraits<ShuffleVectorInst>::op_begin(this),
        OperandTraits<ShuffleVectorInst>::operands(this), InsertAtEnd) {
assert(isValidOperands(V1, V2, Mask) &&(static_cast<void> (0))
       "Invalid shuffle vector instruction operands!")(static_cast<void> (0));

Op<0>() = V1;
Op<1>() = V2;
SmallVector<int, 16> MaskArr;
getShuffleMask(cast<Constant>(Mask), MaskArr);
setShuffleMask(MaskArr);
setName(Name);
1946}

1948ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask,
                                   const Twine &Name,
                                   Instruction *InsertBefore)
  : Instruction(
        VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
                        Mask.size(), isa<ScalableVectorType>(V1->getType())),
        ShuffleVector, OperandTraits<ShuffleVectorInst>::op_begin(this),
        OperandTraits<ShuffleVectorInst>::operands(this), InsertBefore) {
assert(isValidOperands(V1, V2, Mask) &&(static_cast<void> (0))
       "Invalid shuffle vector instruction operands!")(static_cast<void> (0));
Op<0>() = V1;
Op<1>() = V2;
setShuffleMask(Mask);
setName(Name);
1962}

1964ShuffleVectorInst::ShuffleVectorInst(Value *V1, Value *V2, ArrayRef<int> Mask,
                                   const Twine &Name, BasicBlock *InsertAtEnd)
  : Instruction(
        VectorType::get(cast<VectorType>(V1->getType())->getElementType(),
                        Mask.size(), isa<ScalableVectorType>(V1->getType())),
        ShuffleVector, OperandTraits<ShuffleVectorInst>::op_begin(this),
        OperandTraits<ShuffleVectorInst>::operands(this), InsertAtEnd) {
assert(isValidOperands(V1, V2, Mask) &&(static_cast<void> (0))
       "Invalid shuffle vector instruction operands!")(static_cast<void> (0));

Op<0>() = V1;
Op<1>() = V2;
setShuffleMask(Mask);
setName(Name);
1978}

1980void ShuffleVectorInst::commute() {
int NumOpElts = cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
int NumMaskElts = ShuffleMask.size();
SmallVector<int, 16> NewMask(NumMaskElts);
for (int i = 0; i != NumMaskElts; ++i) {
  int MaskElt = getMaskValue(i);
  if (MaskElt == UndefMaskElem) {
    NewMask[i] = UndefMaskElem;
    continue;
  }
  assert(MaskElt >= 0 && MaskElt < 2 * NumOpElts && "Out-of-range mask")(static_cast<void> (0));
  MaskElt = (MaskElt < NumOpElts) ? MaskElt + NumOpElts : MaskElt - NumOpElts;
  NewMask[i] = MaskElt;
}
setShuffleMask(NewMask);
Op<0>().swap(Op<1>());
1996}

1998bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
                                      ArrayRef<int> Mask) {
// V1 and V2 must be vectors of the same type.
if (!isa<VectorType>(V1->getType()) || V1->getType() != V2->getType())
  return false;

// Make sure the mask elements make sense.
int V1Size =
    cast<VectorType>(V1->getType())->getElementCount().getKnownMinValue();
for (int Elem : Mask)
  if (Elem != UndefMaskElem && Elem >= V1Size * 2)
    return false;

if (isa<ScalableVectorType>(V1->getType()))
  if ((Mask[0] != 0 && Mask[0] != UndefMaskElem) || !is_splat(Mask))
    return false;

return true;
2016}

2018bool ShuffleVectorInst::isValidOperands(const Value *V1, const Value *V2,
                                      const Value *Mask) {
// V1 and V2 must be vectors of the same type.
if (!V1->getType()->isVectorTy() || V1->getType() != V2->getType())
  return false;

// Mask must be vector of i32, and must be the same kind of vector as the
// input vectors
auto *MaskTy = dyn_cast<VectorType>(Mask->getType());
if (!MaskTy || !MaskTy->getElementType()->isIntegerTy(32) ||
    isa<ScalableVectorType>(MaskTy) != isa<ScalableVectorType>(V1->getType()))
  return false;

// Check to see if Mask is valid.
if (isa<UndefValue>(Mask) || isa<ConstantAggregateZero>(Mask))
  return true;

if (const auto *MV = dyn_cast<ConstantVector>(Mask)) {
  unsigned V1Size = cast<FixedVectorType>(V1->getType())->getNumElements();
  for (Value *Op : MV->operands()) {
    if (auto *CI = dyn_cast<ConstantInt>(Op)) {
      if (CI->uge(V1Size*2))
        return false;
    } else if (!isa<UndefValue>(Op)) {
      return false;
    }
  }
  return true;
}

if (const auto *CDS = dyn_cast<ConstantDataSequential>(Mask)) {
  unsigned V1Size = cast<FixedVectorType>(V1->getType())->getNumElements();
  for (unsigned i = 0, e = cast<FixedVectorType>(MaskTy)->getNumElements();
       i != e; ++i)
    if (CDS->getElementAsInteger(i) >= V1Size*2)
      return false;
  return true;
}

return false;
2058}

2060void ShuffleVectorInst::getShuffleMask(const Constant *Mask,
                                     SmallVectorImpl<int> &Result) {
ElementCount EC = cast<VectorType>(Mask->getType())->getElementCount();

if (isa<ConstantAggregateZero>(Mask)) {
  Result.resize(EC.getKnownMinValue(), 0);
  return;
}

Result.reserve(EC.getKnownMinValue());

if (EC.isScalable()) {
  assert((isa<ConstantAggregateZero>(Mask) || isa<UndefValue>(Mask)) &&(static_cast<void> (0))
         "Scalable vector shuffle mask must be undef or zeroinitializer")(static_cast<void> (0));
  int MaskVal = isa<UndefValue>(Mask) ? -1 : 0;
  for (unsigned I = 0; I < EC.getKnownMinValue(); ++I)
    Result.emplace_back(MaskVal);
  return;
}

unsigned NumElts = EC.getKnownMinValue();

if (auto *CDS = dyn_cast<ConstantDataSequential>(Mask)) {
  for (unsigned i = 0; i != NumElts; ++i)
    Result.push_back(CDS->getElementAsInteger(i));
  return;
}
for (unsigned i = 0; i != NumElts; ++i) {
  Constant *C = Mask->getAggregateElement(i);
  Result.push_back(isa<UndefValue>(C) ? -1 :
                   cast<ConstantInt>(C)->getZExtValue());
}
2092}

2094void ShuffleVectorInst::setShuffleMask(ArrayRef<int> Mask) {
ShuffleMask.assign(Mask.begin(), Mask.end());
ShuffleMaskForBitcode = convertShuffleMaskForBitcode(Mask, getType());
2097}

2099Constant *ShuffleVectorInst::convertShuffleMaskForBitcode(ArrayRef<int> Mask,
                                                        Type *ResultTy) {
Type *Int32Ty = Type::getInt32Ty(ResultTy->getContext());
if (isa<ScalableVectorType>(ResultTy)) {
  assert(is_splat(Mask) && "Unexpected shuffle")(static_cast<void> (0));
  Type *VecTy = VectorType::get(Int32Ty, Mask.size(), true);
  if (Mask[0] == 0)
    return Constant::getNullValue(VecTy);
  return UndefValue::get(VecTy);
}
SmallVector<Constant *, 16> MaskConst;
for (int Elem : Mask) {
  if (Elem == UndefMaskElem)
    MaskConst.push_back(UndefValue::get(Int32Ty));
  else
    MaskConst.push_back(ConstantInt::get(Int32Ty, Elem));
}
return ConstantVector::get(MaskConst);
2117}

2119static bool isSingleSourceMaskImpl(ArrayRef<int> Mask, int NumOpElts) {
assert(!Mask.empty() && "Shuffle mask must contain elements")(static_cast<void> (0));
bool UsesLHS = false;
bool UsesRHS = false;
for (int I : Mask) {
  if (I == -1)
    continue;
  assert(I >= 0 && I < (NumOpElts * 2) &&(static_cast<void> (0))
         "Out-of-bounds shuffle mask element")(static_cast<void> (0));
  UsesLHS |= (I < NumOpElts);
  UsesRHS |= (I >= NumOpElts);
  if (UsesLHS && UsesRHS)
    return false;
}
// Allow for degenerate case: completely undef mask means neither source is used.
return UsesLHS || UsesRHS;
2135}

2137bool ShuffleVectorInst::isSingleSourceMask(ArrayRef<int> Mask) {
// We don't have vector operand size information, so assume operands are the
// same size as the mask.
return isSingleSourceMaskImpl(Mask, Mask.size());
2141}

2143static bool isIdentityMaskImpl(ArrayRef<int> Mask, int NumOpElts) {
if (!isSingleSourceMaskImpl(Mask, NumOpElts))
  return false;
for (int i = 0, NumMaskElts = Mask.size(); i < NumMaskElts; ++i) {
  if (Mask[i] == -1)
    continue;
  if (Mask[i] != i && Mask[i] != (NumOpElts + i))
    return false;
}
return true;
2153}

2155bool ShuffleVectorInst::isIdentityMask(ArrayRef<int> Mask) {
// We don't have vector operand size information, so assume operands are the
// same size as the mask.
return isIdentityMaskImpl(Mask, Mask.size());
2159}

2161bool ShuffleVectorInst::isReverseMask(ArrayRef<int> Mask) {
if (!isSingleSourceMask(Mask))
  return false;
for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
  if (Mask[i] == -1)
    continue;
  if (Mask[i] != (NumElts - 1 - i) && Mask[i] != (NumElts + NumElts - 1 - i))
    return false;
}
return true;
2171}

2173bool ShuffleVectorInst::isZeroEltSplatMask(ArrayRef<int> Mask) {
if (!isSingleSourceMask(Mask))
  return false;
for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
  if (Mask[i] == -1)
    continue;
  if (Mask[i] != 0 && Mask[i] != NumElts)
    return false;
}
return true;
2183}

2185bool ShuffleVectorInst::isSelectMask(ArrayRef<int> Mask) {
// Select is differentiated from identity. It requires using both sources.
if (isSingleSourceMask(Mask))
  return false;
for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
  if (Mask[i] == -1)
    continue;
  if (Mask[i] != i && Mask[i] != (NumElts + i))
    return false;
}
return true;
2196}

2198bool ShuffleVectorInst::isTransposeMask(ArrayRef<int> Mask) {
// Example masks that will return true:
// v1 = <a, b, c, d>
// v2 = <e, f, g, h>
// trn1 = shufflevector v1, v2 <0, 4, 2, 6> = <a, e, c, g>
// trn2 = shufflevector v1, v2 <1, 5, 3, 7> = <b, f, d, h>

// 1. The number of elements in the mask must be a power-of-2 and at least 2.
int NumElts = Mask.size();
if (NumElts < 2 || !isPowerOf2_32(NumElts))
  return false;

// 2. The first element of the mask must be either a 0 or a 1.
if (Mask[0] != 0 && Mask[0] != 1)
  return false;

// 3. The difference between the first 2 elements must be equal to the
// number of elements in the mask.
if ((Mask[1] - Mask[0]) != NumElts)
  return false;

// 4. The difference between consecutive even-numbered and odd-numbered
// elements must be equal to 2.
for (int i = 2; i < NumElts; ++i) {
  int MaskEltVal = Mask[i];
  if (MaskEltVal == -1)
    return false;
  int MaskEltPrevVal = Mask[i - 2];
  if (MaskEltVal - MaskEltPrevVal != 2)
    return false;
}
return true;
2230}

2232bool ShuffleVectorInst::isExtractSubvectorMask(ArrayRef<int> Mask,
                                             int NumSrcElts, int &Index) {
// Must extract from a single source.
if (!isSingleSourceMaskImpl(Mask, NumSrcElts))
  return false;

// Must be smaller (else this is an Identity shuffle).
if (NumSrcElts <= (int)Mask.size())
  return false;

// Find start of extraction, accounting that we may start with an UNDEF.
int SubIndex = -1;
for (int i = 0, e = Mask.size(); i != e; ++i) {
  int M = Mask[i];
  if (M < 0)
    continue;
  int Offset = (M % NumSrcElts) - i;
  if (0 <= SubIndex && SubIndex != Offset)
    return false;
  SubIndex = Offset;
}

if (0 <= SubIndex && SubIndex + (int)Mask.size() <= NumSrcElts) {
  Index = SubIndex;
  return true;
}
return false;
2259}

2261bool ShuffleVectorInst::isInsertSubvectorMask(ArrayRef<int> Mask,
                                            int NumSrcElts, int &NumSubElts,
                                            int &Index) {
int NumMaskElts = Mask.size();

// Don't try to match if we're shuffling to a smaller size.
if (NumMaskElts < NumSrcElts)
  return false;

// TODO: We don't recognize self-insertion/widening.
if (isSingleSourceMaskImpl(Mask, NumSrcElts))
  return false;

// Determine which mask elements are attributed to which source.
APInt UndefElts = APInt::getNullValue(NumMaskElts);
APInt Src0Elts = APInt::getNullValue(NumMaskElts);
APInt Src1Elts = APInt::getNullValue(NumMaskElts);
bool Src0Identity = true;
bool Src1Identity = true;

for (int i = 0; i != NumMaskElts; ++i) {
  int M = Mask[i];
  if (M < 0) {
    UndefElts.setBit(i);
    continue;
  }
  if (M < NumSrcElts) {
    Src0Elts.setBit(i);
    Src0Identity &= (M == i);
    continue;
  }
  Src1Elts.setBit(i);
  Src1Identity &= (M == (i + NumSrcElts));
  continue;
}
assert((Src0Elts | Src1Elts | UndefElts).isAllOnesValue() &&(static_cast<void> (0))
       "unknown shuffle elements")(static_cast<void> (0));
assert(!Src0Elts.isNullValue() && !Src1Elts.isNullValue() &&(static_cast<void> (0))
       "2-source shuffle not found")(static_cast<void> (0));

// Determine lo/hi span ranges.
// TODO: How should we handle undefs at the start of subvector insertions?
int Src0Lo = Src0Elts.countTrailingZeros();
int Src1Lo = Src1Elts.countTrailingZeros();
int Src0Hi = NumMaskElts - Src0Elts.countLeadingZeros();
int Src1Hi = NumMaskElts - Src1Elts.countLeadingZeros();

// If src0 is in place, see if the src1 elements is inplace within its own
// span.
if (Src0Identity) {
  int NumSub1Elts = Src1Hi - Src1Lo;
  ArrayRef<int> Sub1Mask = Mask.slice(Src1Lo, NumSub1Elts);
  if (isIdentityMaskImpl(Sub1Mask, NumSrcElts)) {
    NumSubElts = NumSub1Elts;
    Index = Src1Lo;
    return true;
  }
}

// If src1 is in place, see if the src0 elements is inplace within its own
// span.
if (Src1Identity) {
  int NumSub0Elts = Src0Hi - Src0Lo;
  ArrayRef<int> Sub0Mask = Mask.slice(Src0Lo, NumSub0Elts);
  if (isIdentityMaskImpl(Sub0Mask, NumSrcElts)) {
    NumSubElts = NumSub0Elts;
    Index = Src0Lo;
    return true;
  }
}

return false;
2333}

2335bool ShuffleVectorInst::isIdentityWithPadding() const {
if (isa<UndefValue>(Op<2>()))
  return false;

// FIXME: Not currently possible to express a shuffle mask for a scalable
// vector for this case.
if (isa<ScalableVectorType>(getType()))
  return false;

int NumOpElts = cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
int NumMaskElts = cast<FixedVectorType>(getType())->getNumElements();
if (NumMaskElts <= NumOpElts)
  return false;

// The first part of the mask must choose elements from exactly 1 source op.
ArrayRef<int> Mask = getShuffleMask();
if (!isIdentityMaskImpl(Mask, NumOpElts))
  return false;

// All extending must be with undef elements.
for (int i = NumOpElts; i < NumMaskElts; ++i)
  if (Mask[i] != -1)
    return false;

return true;
2360}

2362bool ShuffleVectorInst::isIdentityWithExtract() const {
if (isa<UndefValue>(Op<2>()))
  return false;

// FIXME: Not currently possible to express a shuffle mask for a scalable
// vector for this case.
if (isa<ScalableVectorType>(getType()))
  return false;

int NumOpElts = cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
int NumMaskElts = cast<FixedVectorType>(getType())->getNumElements();
if (NumMaskElts >= NumOpElts)
  return false;

return isIdentityMaskImpl(getShuffleMask(), NumOpElts);
2377}

2379bool ShuffleVectorInst::isConcat() const {
// Vector concatenation is differentiated from identity with padding.
if (isa<UndefValue>(Op<0>()) || isa<UndefValue>(Op<1>()) ||
    isa<UndefValue>(Op<2>()))
  return false;

// FIXME: Not currently possible to express a shuffle mask for a scalable
// vector for this case.
if (isa<ScalableVectorType>(getType()))
  return false;

int NumOpElts = cast<FixedVectorType>(Op<0>()->getType())->getNumElements();
int NumMaskElts = cast<FixedVectorType>(getType())->getNumElements();
if (NumMaskElts != NumOpElts * 2)
  return false;

// Use the mask length rather than the operands' vector lengths here. We
// already know that the shuffle returns a vector twice as long as the inputs,
// and neither of the inputs are undef vectors. If the mask picks consecutive
// elements from both inputs, then this is a concatenation of the inputs.
return isIdentityMaskImpl(getShuffleMask(), NumMaskElts);
2400}

2402//===----------------------------------------------------------------------===//
2403//                             InsertValueInst Class
2404//===----------------------------------------------------------------------===//

2406void InsertValueInst::init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
                         const Twine &Name) {
assert(getNumOperands() == 2 && "NumOperands not initialized?")(static_cast<void> (0));

// There's no fundamental reason why we require at least one index
// (other than weirdness with &*IdxBegin being invalid; see
// getelementptr's init routine for example). But there's no
// present need to support it.
assert(!Idxs.empty() && "InsertValueInst must have at least one index")(static_cast<void> (0));

assert(ExtractValueInst::getIndexedType(Agg->getType(), Idxs) ==(static_cast<void> (0))
       Val->getType() && "Inserted value must match indexed type!")(static_cast<void> (0));
Op<0>() = Agg;
Op<1>() = Val;

Indices.append(Idxs.begin(), Idxs.end());
setName(Name);
2423}

2425InsertValueInst::InsertValueInst(const InsertValueInst &IVI)
: Instruction(IVI.getType(), InsertValue,
              OperandTraits<InsertValueInst>::op_begin(this), 2),
  Indices(IVI.Indices) {
Op<0>() = IVI.getOperand(0);
Op<1>() = IVI.getOperand(1);
SubclassOptionalData = IVI.SubclassOptionalData;
2432}

2434//===----------------------------------------------------------------------===//
2435//                             ExtractValueInst Class
2436//===----------------------------------------------------------------------===//

2438void ExtractValueInst::init(ArrayRef<unsigned> Idxs, const Twine &Name) {
assert(getNumOperands() == 1 && "NumOperands not initialized?")(static_cast<void> (0));

// There's no fundamental reason why we require at least one index.
// But there's no present need to support it.
assert(!Idxs.empty() && "ExtractValueInst must have at least one index")(static_cast<void> (0));

Indices.append(Idxs.begin(), Idxs.end());
setName(Name);
2447}

2449ExtractValueInst::ExtractValueInst(const ExtractValueInst &EVI)
: UnaryInstruction(EVI.getType(), ExtractValue, EVI.getOperand(0)),
  Indices(EVI.Indices) {
SubclassOptionalData = EVI.SubclassOptionalData;
2453}

2455// getIndexedType - Returns the type of the element that would be extracted
2456// with an extractvalue instruction with the specified parameters.
2457//
2458// A null type is returned if the indices are invalid for the specified
2459// pointer type.
2460//
2461Type *ExtractValueInst::getIndexedType(Type *Agg,
                                     ArrayRef<unsigned> Idxs) {
for (unsigned Index : Idxs) {
  // We can't use CompositeType::indexValid(Index) here.
  // indexValid() always returns true for arrays because getelementptr allows
  // out-of-bounds indices. Since we don't allow those for extractvalue and
  // insertvalue we need to check array indexing manually.
  // Since the only other types we can index into are struct types it's just
  // as easy to check those manually as well.
  if (ArrayType *AT = dyn_cast<ArrayType>(Agg)) {
    if (Index >= AT->getNumElements())
      return nullptr;
    Agg = AT->getElementType();
  } else if (StructType *ST = dyn_cast<StructType>(Agg)) {
    if (Index >= ST->getNumElements())
      return nullptr;
    Agg = ST->getElementType(Index);
  } else {
    // Not a valid type to index into.
    return nullptr;
  }
}
return const_cast<Type*>(Agg);
2484}

2486//===----------------------------------------------------------------------===//
2487//                             UnaryOperator Class
2488//===----------------------------------------------------------------------===//

2490UnaryOperator::UnaryOperator(UnaryOps iType, Value *S,
                           Type *Ty, const Twine &Name,
                           Instruction *InsertBefore)
: UnaryInstruction(Ty, iType, S, InsertBefore) {
Op<0>() = S;
setName(Name);
AssertOK();
2497}

2499UnaryOperator::UnaryOperator(UnaryOps iType, Value *S,
                           Type *Ty, const Twine &Name,
                           BasicBlock *InsertAtEnd)
: UnaryInstruction(Ty, iType, S, InsertAtEnd) {
Op<0>() = S;
setName(Name);
AssertOK();
2506}

2508UnaryOperator *UnaryOperator::Create(UnaryOps Op, Value *S,
                                   const Twine &Name,
                                   Instruction *InsertBefore) {
return new UnaryOperator(Op, S, S->getType(), Name, InsertBefore);
2512}

2514UnaryOperator *UnaryOperator::Create(UnaryOps Op, Value *S,
                                   const Twine &Name,
                                   BasicBlock *InsertAtEnd) {
UnaryOperator *Res = Create(Op, S, Name);
InsertAtEnd->getInstList().push_back(Res);
return Res;
2520}

2522void UnaryOperator::AssertOK() {
Value *LHS = getOperand(0);
(void)LHS; // Silence warnings.
2525#ifndef NDEBUG1
switch (getOpcode()) {
case FNeg:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Unary operation should return same type as operand!")(static_cast<void> (0));
  assert(getType()->isFPOrFPVectorTy() &&(static_cast<void> (0))
         "Tried to create a floating-point operation on a "(static_cast<void> (0))
         "non-floating-point type!")(static_cast<void> (0));
  break;
default: llvm_unreachable("Invalid opcode provided")__builtin_unreachable();
}
2536#endif
2537}

2539//===----------------------------------------------------------------------===//
2540//                             BinaryOperator Class
2541//===----------------------------------------------------------------------===//

2543BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
                             Type *Ty, const Twine &Name,
                             Instruction *InsertBefore)
: Instruction(Ty, iType,
              OperandTraits<BinaryOperator>::op_begin(this),
              OperandTraits<BinaryOperator>::operands(this),
              InsertBefore) {
Op<0>() = S1;
Op<1>() = S2;
setName(Name);
AssertOK();
2554}

2556BinaryOperator::BinaryOperator(BinaryOps iType, Value *S1, Value *S2,
                             Type *Ty, const Twine &Name,
                             BasicBlock *InsertAtEnd)
: Instruction(Ty, iType,
              OperandTraits<BinaryOperator>::op_begin(this),
              OperandTraits<BinaryOperator>::operands(this),
              InsertAtEnd) {
Op<0>() = S1;
Op<1>() = S2;
setName(Name);
AssertOK();
2567}

2569void BinaryOperator::AssertOK() {
Value *LHS = getOperand(0), *RHS = getOperand(1);
(void)LHS; (void)RHS; // Silence warnings.
assert(LHS->getType() == RHS->getType() &&(static_cast<void> (0))
       "Binary operator operand types must match!")(static_cast<void> (0));
2574#ifndef NDEBUG1
switch (getOpcode()) {
case Add: case Sub:
case Mul:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isIntOrIntVectorTy() &&(static_cast<void> (0))
         "Tried to create an integer operation on a non-integer type!")(static_cast<void> (0));
  break;
case FAdd: case FSub:
case FMul:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isFPOrFPVectorTy() &&(static_cast<void> (0))
         "Tried to create a floating-point operation on a "(static_cast<void> (0))
         "non-floating-point type!")(static_cast<void> (0));
  break;
case UDiv:
case SDiv:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isIntOrIntVectorTy() &&(static_cast<void> (0))
         "Incorrect operand type (not integer) for S/UDIV")(static_cast<void> (0));
  break;
case FDiv:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isFPOrFPVectorTy() &&(static_cast<void> (0))
         "Incorrect operand type (not floating point) for FDIV")(static_cast<void> (0));
  break;
case URem:
case SRem:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isIntOrIntVectorTy() &&(static_cast<void> (0))
         "Incorrect operand type (not integer) for S/UREM")(static_cast<void> (0));
  break;
case FRem:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Arithmetic operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isFPOrFPVectorTy() &&(static_cast<void> (0))
         "Incorrect operand type (not floating point) for FREM")(static_cast<void> (0));
  break;
case Shl:
case LShr:
case AShr:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Shift operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isIntOrIntVectorTy() &&(static_cast<void> (0))
         "Tried to create a shift operation on a non-integral type!")(static_cast<void> (0));
  break;
case And: case Or:
case Xor:
  assert(getType() == LHS->getType() &&(static_cast<void> (0))
         "Logical operation should return same type as operands!")(static_cast<void> (0));
  assert(getType()->isIntOrIntVectorTy() &&(static_cast<void> (0))
         "Tried to create a logical operation on a non-integral type!")(static_cast<void> (0));
  break;
default: llvm_unreachable("Invalid opcode provided")__builtin_unreachable();
}
2634#endif
2635}

2637BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
                                     const Twine &Name,
                                     Instruction *InsertBefore) {
assert(S1->getType() == S2->getType() &&(static_cast<void> (0))
       "Cannot create binary operator with two operands of differing type!")(static_cast<void> (0));
return new BinaryOperator(Op, S1, S2, S1->getType(), Name, InsertBefore);
2643}

2645BinaryOperator *BinaryOperator::Create(BinaryOps Op, Value *S1, Value *S2,
                                     const Twine &Name,
                                     BasicBlock *InsertAtEnd) {
BinaryOperator *Res = Create(Op, S1, S2, Name);
InsertAtEnd->getInstList().push_back(Res);
return Res;
2651}

2653BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
                                        Instruction *InsertBefore) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return new BinaryOperator(Instruction::Sub,
                          zero, Op,
                          Op->getType(), Name, InsertBefore);
2659}

2661BinaryOperator *BinaryOperator::CreateNeg(Value *Op, const Twine &Name,
                                        BasicBlock *InsertAtEnd) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return new BinaryOperator(Instruction::Sub,
                          zero, Op,
                          Op->getType(), Name, InsertAtEnd);
2667}

2669BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
                                           Instruction *InsertBefore) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertBefore);
2673}

2675BinaryOperator *BinaryOperator::CreateNSWNeg(Value *Op, const Twine &Name,
                                           BasicBlock *InsertAtEnd) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return BinaryOperator::CreateNSWSub(zero, Op, Name, InsertAtEnd);
2679}

2681BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
                                           Instruction *InsertBefore) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertBefore);
2685}

2687BinaryOperator *BinaryOperator::CreateNUWNeg(Value *Op, const Twine &Name,
                                           BasicBlock *InsertAtEnd) {
Value *zero = ConstantFP::getZeroValueForNegation(Op->getType());
return BinaryOperator::CreateNUWSub(zero, Op, Name, InsertAtEnd);
2691}

2693BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
                                        Instruction *InsertBefore) {
Constant *C = Constant::getAllOnesValue(Op->getType());
return new BinaryOperator(Instruction::Xor, Op, C,
                          Op->getType(), Name, InsertBefore);
2698}

2700BinaryOperator *BinaryOperator::CreateNot(Value *Op, const Twine &Name,
                                        BasicBlock *InsertAtEnd) {
Constant *AllOnes = Constant::getAllOnesValue(Op->getType());
return new BinaryOperator(Instruction::Xor, Op, AllOnes,
                          Op->getType(), Name, InsertAtEnd);
2705}

2707// Exchange the two operands to this instruction. This instruction is safe to
2708// use on any binary instruction and does not modify the semantics of the
2709// instruction. If the instruction is order-dependent (SetLT f.e.), the opcode
2710// is changed.
2711bool BinaryOperator::swapOperands() {
if (!isCommutative())
  return true; // Can't commute operands
Op<0>().swap(Op<1>());
return false;
2716}

2718//===----------------------------------------------------------------------===//
2719//                             FPMathOperator Class
2720//===----------------------------------------------------------------------===//

2722float FPMathOperator::getFPAccuracy() const {
const MDNode *MD =
    cast<Instruction>(this)->getMetadata(LLVMContext::MD_fpmath);
if (!MD)
  return 0.0;
ConstantFP *Accuracy = mdconst::extract<ConstantFP>(MD->getOperand(0));
return Accuracy->getValueAPF().convertToFloat();
2729}

2731//===----------------------------------------------------------------------===//
2732//                                CastInst Class
2733//===----------------------------------------------------------------------===//

2735// Just determine if this cast only deals with integral->integral conversion.
2736bool CastInst::isIntegerCast() const {
switch (getOpcode()) {
  default: return false;
  case Instruction::ZExt:
  case Instruction::SExt:
  case Instruction::Trunc:
    return true;
  case Instruction::BitCast:
    return getOperand(0)->getType()->isIntegerTy() &&
      getType()->isIntegerTy();
}
2747}

2749bool CastInst::isLosslessCast() const {
// Only BitCast can be lossless, exit fast if we're not BitCast
if (getOpcode() != Instruction::BitCast)
  return false;

// Identity cast is always lossless
Type *SrcTy = getOperand(0)->getType();
Type *DstTy = getType();
if (SrcTy == DstTy)
  return true;

// Pointer to pointer is always lossless.
if (SrcTy->isPointerTy())
  return DstTy->isPointerTy();
return false;  // Other types have no identity values
2764}

2766/// This function determines if the CastInst does not require any bits to be
2767/// changed in order to effect the cast. Essentially, it identifies cases where
2768/// no code gen is necessary for the cast, hence the name no-op cast.  For
2769/// example, the following are all no-op casts:
2770/// # bitcast i32* %x to i8*
2771/// # bitcast <2 x i32> %x to <4 x i16>
2772/// # ptrtoint i32* %x to i32     ; on 32-bit plaforms only
2773/// Determine if the described cast is a no-op.
2774bool CastInst::isNoopCast(Instruction::CastOps Opcode,
                        Type *SrcTy,
                        Type *DestTy,
                        const DataLayout &DL) {
assert(castIsValid(Opcode, SrcTy, DestTy) && "method precondition")(static_cast<void> (0));
switch (Opcode) {
  default: llvm_unreachable("Invalid CastOp")__builtin_unreachable();
  case Instruction::Trunc:
  case Instruction::ZExt:
  case Instruction::SExt:
  case Instruction::FPTrunc:
  case Instruction::FPExt:
  case Instruction::UIToFP:
  case Instruction::SIToFP:
  case Instruction::FPToUI:
  case Instruction::FPToSI:
  case Instruction::AddrSpaceCast:
    // TODO: Target informations may give a more accurate answer here.
    return false;
  case Instruction::BitCast:
    return true;  // BitCast never modifies bits.
  case Instruction::PtrToInt:
    return DL.getIntPtrType(SrcTy)->getScalarSizeInBits() ==
           DestTy->getScalarSizeInBits();
  case Instruction::IntToPtr:
    return DL.getIntPtrType(DestTy)->getScalarSizeInBits() ==
           SrcTy->getScalarSizeInBits();
}
2802}

2804bool CastInst::isNoopCast(const DataLayout &DL) const {
return isNoopCast(getOpcode(), getOperand(0)->getType(), getType(), DL);
2806}

2808/// This function determines if a pair of casts can be eliminated and what
2809/// opcode should be used in the elimination. This assumes that there are two
2810/// instructions like this:
2811/// *  %F = firstOpcode SrcTy %x to MidTy
2812/// *  %S = secondOpcode MidTy %F to DstTy
2813/// The function returns a resultOpcode so these two casts can be replaced with:
2814/// *  %Replacement = resultOpcode %SrcTy %x to DstTy
2815/// If no such cast is permitted, the function returns 0.
2816unsigned CastInst::isEliminableCastPair(
Instruction::CastOps firstOp, Instruction::CastOps secondOp,
Type *SrcTy, Type *MidTy, Type *DstTy, Type *SrcIntPtrTy, Type *MidIntPtrTy,
Type *DstIntPtrTy) {
// Define the 144 possibilities for these two cast instructions. The values
// in this matrix determine what to do in a given situation and select the
// case in the switch below.  The rows correspond to firstOp, the columns
// correspond to secondOp.  In looking at the table below, keep in mind
// the following cast properties:
//
//          Size Compare       Source               Destination
// Operator  Src ? Size   Type       Sign         Type       Sign
// -------- ------------ -------------------   ---------------------
// TRUNC         >       Integer      Any        Integral     Any
// ZEXT          <       Integral   Unsigned     Integer      Any
// SEXT          <       Integral    Signed      Integer      Any
// FPTOUI       n/a      FloatPt      n/a        Integral   Unsigned
// FPTOSI       n/a      FloatPt      n/a        Integral    Signed
// UITOFP       n/a      Integral   Unsigned     FloatPt      n/a
// SITOFP       n/a      Integral    Signed      FloatPt      n/a
// FPTRUNC       >       FloatPt      n/a        FloatPt      n/a
// FPEXT         <       FloatPt      n/a        FloatPt      n/a
// PTRTOINT     n/a      Pointer      n/a        Integral   Unsigned
// INTTOPTR     n/a      Integral   Unsigned     Pointer      n/a
// BITCAST       =       FirstClass   n/a       FirstClass    n/a
// ADDRSPCST    n/a      Pointer      n/a        Pointer      n/a
//
// NOTE: some transforms are safe, but we consider them to be non-profitable.
// For example, we could merge "fptoui double to i32" + "zext i32 to i64",
// into "fptoui double to i64", but this loses information about the range
// of the produced value (we no longer know the top-part is all zeros).
// Further this conversion is often much more expensive for typical hardware,
// and causes issues when building libgcc.  We disallow fptosi+sext for the
// same reason.
const unsigned numCastOps =
  Instruction::CastOpsEnd - Instruction::CastOpsBegin;
static const uint8_t CastResults[numCastOps][numCastOps] = {
  // T        F  F  U  S  F  F  P  I  B  A  -+
  // R  Z  S  P  P  I  I  T  P  2  N  T  S   |
  // U  E  E  2  2  2  2  R  E  I  T  C  C   +- secondOp
  // N  X  X  U  S  F  F  N  X  N  2  V  V   |
  // C  T  T  I  I  P  P  C  T  T  P  T  T  -+
  {  1, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // Trunc         -+
  {  8, 1, 9,99,99, 2,17,99,99,99, 2, 3, 0}, // ZExt           |
  {  8, 0, 1,99,99, 0, 2,99,99,99, 0, 3, 0}, // SExt           |
  {  0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToUI         |
  {  0, 0, 0,99,99, 0, 0,99,99,99, 0, 3, 0}, // FPToSI         |
  { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // UIToFP         +- firstOp
  { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // SIToFP         |
  { 99,99,99, 0, 0,99,99, 0, 0,99,99, 4, 0}, // FPTrunc        |
  { 99,99,99, 2, 2,99,99, 8, 2,99,99, 4, 0}, // FPExt          |
  {  1, 0, 0,99,99, 0, 0,99,99,99, 7, 3, 0}, // PtrToInt       |
  { 99,99,99,99,99,99,99,99,99,11,99,15, 0}, // IntToPtr       |
  {  5, 5, 5, 6, 6, 5, 5, 6, 6,16, 5, 1,14}, // BitCast        |
  {  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,13,12}, // AddrSpaceCast -+
};

// TODO: This logic could be encoded into the table above and handled in the
// switch below.
// If either of the casts are a bitcast from scalar to vector, disallow the
// merging. However, any pair of bitcasts are allowed.
bool IsFirstBitcast  = (firstOp == Instruction::BitCast);
bool IsSecondBitcast = (secondOp == Instruction::BitCast);
bool AreBothBitcasts = IsFirstBitcast && IsSecondBitcast;

// Check if any of the casts convert scalars <-> vectors.
if ((IsFirstBitcast  && isa<VectorType>(SrcTy) != isa<VectorType>(MidTy)) ||
    (IsSecondBitcast && isa<VectorType>(MidTy) != isa<VectorType>(DstTy)))
  if (!AreBothBitcasts)
    return 0;

int ElimCase = CastResults[firstOp-Instruction::CastOpsBegin]
                          [secondOp-Instruction::CastOpsBegin];
switch (ElimCase) {
  case 0:
    // Categorically disallowed.
    return 0;
  case 1:
    // Allowed, use first cast's opcode.
    return firstOp;
  case 2:
    // Allowed, use second cast's opcode.
    return secondOp;
  case 3:
    // No-op cast in second op implies firstOp as long as the DestTy
    // is integer and we are not converting between a vector and a
    // non-vector type.
    if (!SrcTy->isVectorTy() && DstTy->isIntegerTy())
      return firstOp;
    return 0;
  case 4:
    // No-op cast in second op implies firstOp as long as the DestTy
    // is floating point.
    if (DstTy->isFloatingPointTy())
      return firstOp;
    return 0;
  case 5:
    // No-op cast in first op implies secondOp as long as the SrcTy
    // is an integer.
    if (SrcTy->isIntegerTy())
      return secondOp;
    return 0;
  case 6:
    // No-op cast in first op implies secondOp as long as the SrcTy
    // is a floating point.
    if (SrcTy->isFloatingPointTy())
      return secondOp;
    return 0;
  case 7: {
    // Disable inttoptr/ptrtoint optimization if enabled.
    if (DisableI2pP2iOpt)
      return 0;

    // Cannot simplify if address spaces are different!
    if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
      return 0;

    unsigned MidSize = MidTy->getScalarSizeInBits();
    // We can still fold this without knowing the actual sizes as long we
    // know that the intermediate pointer is the largest possible
    // pointer size.
    // FIXME: Is this always true?
    if (MidSize == 64)
      return Instruction::BitCast;

    // ptrtoint, inttoptr -> bitcast (ptr -> ptr) if int size is >= ptr size.
    if (!SrcIntPtrTy || DstIntPtrTy != SrcIntPtrTy)
      return 0;
    unsigned PtrSize = SrcIntPtrTy->getScalarSizeInBits();
    if (MidSize >= PtrSize)
      return Instruction::BitCast;
    return 0;
  }
  case 8: {
    // ext, trunc -> bitcast,    if the SrcTy and DstTy are same size
    // ext, trunc -> ext,        if sizeof(SrcTy) < sizeof(DstTy)
    // ext, trunc -> trunc,      if sizeof(SrcTy) > sizeof(DstTy)
    unsigned SrcSize = SrcTy->getScalarSizeInBits();
    unsigned DstSize = DstTy->getScalarSizeInBits();
    if (SrcSize == DstSize)
      return Instruction::BitCast;
    else if (SrcSize < DstSize)
      return firstOp;
    return secondOp;
  }
  case 9:
    // zext, sext -> zext, because sext can't sign extend after zext
    return Instruction::ZExt;
  case 11: {
    // inttoptr, ptrtoint -> bitcast if SrcSize<=PtrSize and SrcSize==DstSize
    if (!MidIntPtrTy)
      return 0;
    unsigned PtrSize = MidIntPtrTy->getScalarSizeInBits();
    unsigned SrcSize = SrcTy->getScalarSizeInBits();
    unsigned DstSize = DstTy->getScalarSizeInBits();
    if (SrcSize <= PtrSize && SrcSize == DstSize)
      return Instruction::BitCast;
    return 0;
  }
  case 12:
    // addrspacecast, addrspacecast -> bitcast,       if SrcAS == DstAS
    // addrspacecast, addrspacecast -> addrspacecast, if SrcAS != DstAS
    if (SrcTy->getPointerAddressSpace() != DstTy->getPointerAddressSpace())
      return Instruction::AddrSpaceCast;
    return Instruction::BitCast;
  case 13:
    // FIXME: this state can be merged with (1), but the following assert
    // is useful to check the correcteness of the sequence due to semantic
    // change of bitcast.
    assert((static_cast<void> (0))
      SrcTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      MidTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      DstTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      SrcTy->getPointerAddressSpace() != MidTy->getPointerAddressSpace() &&(static_cast<void> (0))
      MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&(static_cast<void> (0))
      "Illegal addrspacecast, bitcast sequence!")(static_cast<void> (0));
    // Allowed, use first cast's opcode
    return firstOp;
  case 14: {
    // bitcast, addrspacecast -> addrspacecast if the element type of
    // bitcast's source is the same as that of addrspacecast's destination.
    PointerType *SrcPtrTy = cast<PointerType>(SrcTy->getScalarType());
    PointerType *DstPtrTy = cast<PointerType>(DstTy->getScalarType());
    if (SrcPtrTy->hasSameElementTypeAs(DstPtrTy))
      return Instruction::AddrSpaceCast;
    return 0;
  }
  case 15:
    // FIXME: this state can be merged with (1), but the following assert
    // is useful to check the correcteness of the sequence due to semantic
    // change of bitcast.
    assert((static_cast<void> (0))
      SrcTy->isIntOrIntVectorTy() &&(static_cast<void> (0))
      MidTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      DstTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      MidTy->getPointerAddressSpace() == DstTy->getPointerAddressSpace() &&(static_cast<void> (0))
      "Illegal inttoptr, bitcast sequence!")(static_cast<void> (0));
    // Allowed, use first cast's opcode
    return firstOp;
  case 16:
    // FIXME: this state can be merged with (2), but the following assert
    // is useful to check the correcteness of the sequence due to semantic
    // change of bitcast.
    assert((static_cast<void> (0))
      SrcTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      MidTy->isPtrOrPtrVectorTy() &&(static_cast<void> (0))
      DstTy->isIntOrIntVectorTy() &&(static_cast<void> (0))
      SrcTy->getPointerAddressSpace() == MidTy->getPointerAddressSpace() &&(static_cast<void> (0))
      "Illegal bitcast, ptrtoint sequence!")(static_cast<void> (0));
    // Allowed, use second cast's opcode
    return secondOp;
  case 17:
    // (sitofp (zext x)) -> (uitofp x)
    return Instruction::UIToFP;
  case 99:
    // Cast combination can't happen (error in input). This is for all cases
    // where the MidTy is not the same for the two cast instructions.
    llvm_unreachable("Invalid Cast Combination")__builtin_unreachable();
  default:
    llvm_unreachable("Error in CastResults table!!!")__builtin_unreachable();
}
3037}

3039CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
const Twine &Name, Instruction *InsertBefore) {
assert(castIsValid(op, S, Ty) && "Invalid cast!")(static_cast<void> (0));
// Construct and return the appropriate CastInst subclass
switch (op) {
case Trunc:         return new TruncInst         (S, Ty, Name, InsertBefore);
case ZExt:          return new ZExtInst          (S, Ty, Name, InsertBefore);
case SExt:          return new SExtInst          (S, Ty, Name, InsertBefore);
case FPTrunc:       return new FPTruncInst       (S, Ty, Name, InsertBefore);
case FPExt:         return new FPExtInst         (S, Ty, Name, InsertBefore);
case UIToFP:        return new UIToFPInst        (S, Ty, Name, InsertBefore);
case SIToFP:        return new SIToFPInst        (S, Ty, Name, InsertBefore);
case FPToUI:        return new FPToUIInst        (S, Ty, Name, InsertBefore);
case FPToSI:        return new FPToSIInst        (S, Ty, Name, InsertBefore);
case PtrToInt:      return new PtrToIntInst      (S, Ty, Name, InsertBefore);
case IntToPtr:      return new IntToPtrInst      (S, Ty, Name, InsertBefore);
case BitCast:       return new BitCastInst       (S, Ty, Name, InsertBefore);
case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertBefore);
default: llvm_unreachable("Invalid opcode provided")__builtin_unreachable();
}
3059}

3061CastInst *CastInst::Create(Instruction::CastOps op, Value *S, Type *Ty,
const Twine &Name, BasicBlock *InsertAtEnd) {
assert(castIsValid(op, S, Ty) && "Invalid cast!")(static_cast<void> (0));
// Construct and return the appropriate CastInst subclass
switch (op) {
case Trunc:         return new TruncInst         (S, Ty, Name, InsertAtEnd);
case ZExt:          return new ZExtInst          (S, Ty, Name, InsertAtEnd);
case SExt:          return new SExtInst          (S, Ty, Name, InsertAtEnd);
case FPTrunc:       return new FPTruncInst       (S, Ty, Name, InsertAtEnd);
case FPExt:         return new FPExtInst         (S, Ty, Name, InsertAtEnd);
case UIToFP:        return new UIToFPInst        (S, Ty, Name, InsertAtEnd);
case SIToFP:        return new SIToFPInst        (S, Ty, Name, InsertAtEnd);
case FPToUI:        return new FPToUIInst        (S, Ty, Name, InsertAtEnd);
case FPToSI:        return new FPToSIInst        (S, Ty, Name, InsertAtEnd);
case PtrToInt:      return new PtrToIntInst      (S, Ty, Name, InsertAtEnd);
case IntToPtr:      return new IntToPtrInst      (S, Ty, Name, InsertAtEnd);
case BitCast:       return new BitCastInst       (S, Ty, Name, InsertAtEnd);
case AddrSpaceCast: return new AddrSpaceCastInst (S, Ty, Name, InsertAtEnd);
default: llvm_unreachable("Invalid opcode provided")__builtin_unreachable();
}
3081}

3083CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
                                      const Twine &Name,
                                      Instruction *InsertBefore) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
return Create(Instruction::ZExt, S, Ty, Name, InsertBefore);
3089}

3091CastInst *CastInst::CreateZExtOrBitCast(Value *S, Type *Ty,
                                      const Twine &Name,
                                      BasicBlock *InsertAtEnd) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
return Create(Instruction::ZExt, S, Ty, Name, InsertAtEnd);
3097}

3099CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
                                      const Twine &Name,
                                      Instruction *InsertBefore) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
return Create(Instruction::SExt, S, Ty, Name, InsertBefore);
3105}

3107CastInst *CastInst::CreateSExtOrBitCast(Value *S, Type *Ty,
                                      const Twine &Name,
                                      BasicBlock *InsertAtEnd) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
return Create(Instruction::SExt, S, Ty, Name, InsertAtEnd);
3113}

3115CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
                                       const Twine &Name,
                                       Instruction *InsertBefore) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
return Create(Instruction::Trunc, S, Ty, Name, InsertBefore);
3121}

3123CastInst *CastInst::CreateTruncOrBitCast(Value *S, Type *Ty,
                                       const Twine &Name,
                                       BasicBlock *InsertAtEnd) {
if (S->getType()->getScalarSizeInBits() == Ty->getScalarSizeInBits())
  return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
return Create(Instruction::Trunc, S, Ty, Name, InsertAtEnd);
3129}

3131CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
                                    const Twine &Name,
                                    BasicBlock *InsertAtEnd) {
assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));
assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));
assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast")(static_cast<void> (0));
assert((!Ty->isVectorTy() ||(static_cast<void> (0))
        cast<VectorType>(Ty)->getElementCount() ==(static_cast<void> (0))
            cast<VectorType>(S->getType())->getElementCount()) &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));

if (Ty->isIntOrIntVectorTy())
  return Create(Instruction::PtrToInt, S, Ty, Name, InsertAtEnd);

return CreatePointerBitCastOrAddrSpaceCast(S, Ty, Name, InsertAtEnd);
3147}

3149/// Create a BitCast or a PtrToInt cast instruction
3150CastInst *CastInst::CreatePointerCast(Value *S, Type *Ty,
                                    const Twine &Name,
                                    Instruction *InsertBefore) {
assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));
assert((Ty->isIntOrIntVectorTy() || Ty->isPtrOrPtrVectorTy()) &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));
assert(Ty->isVectorTy() == S->getType()->isVectorTy() && "Invalid cast")(static_cast<void> (0));
assert((!Ty->isVectorTy() ||(static_cast<void> (0))
        cast<VectorType>(Ty)->getElementCount() ==(static_cast<void> (0))
            cast<VectorType>(S->getType())->getElementCount()) &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));

if (Ty->isIntOrIntVectorTy())
  return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);

return CreatePointerBitCastOrAddrSpaceCast(S, Ty, Name, InsertBefore);
3166}

3168CastInst *CastInst::CreatePointerBitCastOrAddrSpaceCast(
Value *S, Type *Ty,
const Twine &Name,
BasicBlock *InsertAtEnd) {
assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));
assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));

if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
  return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertAtEnd);

return Create(Instruction::BitCast, S, Ty, Name, InsertAtEnd);
3179}

3181CastInst *CastInst::CreatePointerBitCastOrAddrSpaceCast(
Value *S, Type *Ty,
const Twine &Name,
Instruction *InsertBefore) {
assert(S->getType()->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));
assert(Ty->isPtrOrPtrVectorTy() && "Invalid cast")(static_cast<void> (0));

if (S->getType()->getPointerAddressSpace() != Ty->getPointerAddressSpace())
  return Create(Instruction::AddrSpaceCast, S, Ty, Name, InsertBefore);

return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
3192}

3194CastInst *CastInst::CreateBitOrPointerCast(Value *S, Type *Ty,
                                         const Twine &Name,
                                         Instruction *InsertBefore) {
if (S->getType()->isPointerTy() && Ty->isIntegerTy())
  return Create(Instruction::PtrToInt, S, Ty, Name, InsertBefore);
if (S->getType()->isIntegerTy() && Ty->isPointerTy())
  return Create(Instruction::IntToPtr, S, Ty, Name, InsertBefore);

return Create(Instruction::BitCast, S, Ty, Name, InsertBefore);
3203}

3205CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
                                    bool isSigned, const Twine &Name,
                                    Instruction *InsertBefore) {
assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&(static_cast<void> (0))
       "Invalid integer cast")(static_cast<void> (0));
unsigned SrcBits = C->getType()->getScalarSizeInBits();
unsigned DstBits = Ty->getScalarSizeInBits();
Instruction::CastOps opcode =
  (SrcBits == DstBits ? Instruction::BitCast :
   (SrcBits > DstBits ? Instruction::Trunc :
    (isSigned ? Instruction::SExt : Instruction::ZExt)));
return Create(opcode, C, Ty, Name, InsertBefore);
3217}

3219CastInst *CastInst::CreateIntegerCast(Value *C, Type *Ty,
                                    bool isSigned, const Twine &Name,
                                    BasicBlock *InsertAtEnd) {
assert(C->getType()->isIntOrIntVectorTy() && Ty->isIntOrIntVectorTy() &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));
unsigned SrcBits = C->getType()->getScalarSizeInBits();
unsigned DstBits = Ty->getScalarSizeInBits();
Instruction::CastOps opcode =
  (SrcBits == DstBits ? Instruction::BitCast :
   (SrcBits > DstBits ? Instruction::Trunc :
    (isSigned ? Instruction::SExt : Instruction::ZExt)));
return Create(opcode, C, Ty, Name, InsertAtEnd);
3231}

3233CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
                               const Twine &Name,
                               Instruction *InsertBefore) {
assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));
unsigned SrcBits = C->getType()->getScalarSizeInBits();
unsigned DstBits = Ty->getScalarSizeInBits();
Instruction::CastOps opcode =
  (SrcBits == DstBits ? Instruction::BitCast :
   (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
return Create(opcode, C, Ty, Name, InsertBefore);
3244}

3246CastInst *CastInst::CreateFPCast(Value *C, Type *Ty,
                               const Twine &Name,
                               BasicBlock *InsertAtEnd) {
assert(C->getType()->isFPOrFPVectorTy() && Ty->isFPOrFPVectorTy() &&(static_cast<void> (0))
       "Invalid cast")(static_cast<void> (0));
unsigned SrcBits = C->getType()->getScalarSizeInBits();
unsigned DstBits = Ty->getScalarSizeInBits();
Instruction::CastOps opcode =
  (SrcBits == DstBits ? Instruction::BitCast :
   (SrcBits > DstBits ? Instruction::FPTrunc : Instruction::FPExt));
return Create(opcode, C, Ty, Name, InsertAtEnd);
3257}

3259bool CastInst::isBitCastable(Type *SrcTy, Type *DestTy) {
if (!SrcTy->isFirstClassType() || !DestTy->isFirstClassType())
  return false;

if (SrcTy == DestTy)
  return true;

if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy)) {
  if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy)) {
    if (SrcVecTy->getElementCount() == DestVecTy->getElementCount()) {
      // An element by element cast. Valid if casting the elements is valid.
      SrcTy = SrcVecTy->getElementType();
      DestTy = DestVecTy->getElementType();
    }
  }
}

if (PointerType *DestPtrTy = dyn_cast<PointerType>(DestTy)) {
  if (PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy)) {
    return SrcPtrTy->getAddressSpace() == DestPtrTy->getAddressSpace();
  }
}

TypeSize SrcBits = SrcTy->getPrimitiveSizeInBits();   // 0 for ptr
TypeSize DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr

// Could still have vectors of pointers if the number of elements doesn't
// match
if (SrcBits.getKnownMinSize() == 0 || DestBits.getKnownMinSize() == 0)
  return false;

if (SrcBits != DestBits)
  return false;

if (DestTy->isX86_MMXTy() || SrcTy->isX86_MMXTy())
  return false;

return true;
3297}

3299bool CastInst::isBitOrNoopPointerCastable(Type *SrcTy, Type *DestTy,
                                        const DataLayout &DL) {
// ptrtoint and inttoptr are not allowed on non-integral pointers
if (auto *PtrTy = dyn_cast<PointerType>(SrcTy))
  if (auto *IntTy = dyn_cast<IntegerType>(DestTy))
    return (IntTy->getBitWidth() == DL.getPointerTypeSizeInBits(PtrTy) &&
            !DL.isNonIntegralPointerType(PtrTy));
if (auto *PtrTy = dyn_cast<PointerType>(DestTy))
  if (auto *IntTy = dyn_cast<IntegerType>(SrcTy))
    return (IntTy->getBitWidth() == DL.getPointerTypeSizeInBits(PtrTy) &&
            !DL.isNonIntegralPointerType(PtrTy));

return isBitCastable(SrcTy, DestTy);
3312}

3314// Provide a way to get a "cast" where the cast opcode is inferred from the
3315// types and size of the operand. This, basically, is a parallel of the
3316// logic in the castIsValid function below.  This axiom should hold:
3317//   castIsValid( getCastOpcode(Val, Ty), Val, Ty)
3318// should not assert in castIsValid. In other words, this produces a "correct"
3319// casting opcode for the arguments passed to it.
3320Instruction::CastOps
3321CastInst::getCastOpcode(
const Value *Src, bool SrcIsSigned, Type *DestTy, bool DestIsSigned) {
Type *SrcTy = Src->getType();

assert(SrcTy->isFirstClassType() && DestTy->isFirstClassType() &&(static_cast<void> (0))
       "Only first class types are castable!")(static_cast<void> (0));

if (SrcTy == DestTy)
  return BitCast;

// FIXME: Check address space sizes here
if (VectorType *SrcVecTy = dyn_cast<VectorType>(SrcTy))
  if (VectorType *DestVecTy = dyn_cast<VectorType>(DestTy))
    if (SrcVecTy->getElementCount() == DestVecTy->getElementCount()) {
      // An element by element cast.  Find the appropriate opcode based on the
      // element types.
      SrcTy = SrcVecTy->getElementType();
      DestTy = DestVecTy->getElementType();
    }

// Get the bit sizes, we'll need these
unsigned SrcBits = SrcTy->getPrimitiveSizeInBits();   // 0 for ptr
unsigned DestBits = DestTy->getPrimitiveSizeInBits(); // 0 for ptr

// Run through the possibilities ...
if (DestTy->isIntegerTy()) {                      // Casting to integral
  if (SrcTy->isIntegerTy()) {                     // Casting from integral
    if (DestBits < SrcBits)
      return Trunc;                               // int -> smaller int
    else if (DestBits > SrcBits) {                // its an extension
      if (SrcIsSigned)
        return SExt;                              // signed -> SEXT
      else
        return ZExt;                              // unsigned -> ZEXT
    } else {
      return BitCast;                             // Same size, No-op cast
    }
  } else if (SrcTy->isFloatingPointTy()) {        // Casting from floating pt
    if (DestIsSigned)
      return FPToSI;                              // FP -> sint
    else
      return FPToUI;                              // FP -> uint
  } else if (SrcTy->isVectorTy()) {
    assert(DestBits == SrcBits &&(static_cast<void> (0))
           "Casting vector to integer of different width")(static_cast<void> (0));
    return BitCast;                             // Same size, no-op cast
  } else {
    assert(SrcTy->isPointerTy() &&(static_cast<void> (0))
           "Casting from a value that is not first-class type")(static_cast<void> (0));
    return PtrToInt;                              // ptr -> int
  }
} else if (DestTy->isFloatingPointTy()) {         // Casting to floating pt
  if (SrcTy->isIntegerTy()) {                     // Casting from integral
    if (SrcIsSigned)
      return SIToFP;                              // sint -> FP
    else
      return UIToFP;                              // uint -> FP
  } else if (SrcTy->isFloatingPointTy()) {        // Casting from floating pt
    if (DestBits < SrcBits) {
      return FPTrunc;                             // FP -> smaller FP
    } else if (DestBits > SrcBits) {
      return FPExt;                               // FP -> larger FP
    } else  {
      return BitCast;                             // same size, no-op cast
    }
  } else if (SrcTy->isVectorTy()) {
    assert(DestBits == SrcBits &&(static_cast<void> (0))
           "Casting vector to floating point of different width")(static_cast<void> (0));
    return BitCast;                             // same size, no-op cast
  }
  llvm_unreachable("Casting pointer or non-first class to float")__builtin_unreachable();
} else if (DestTy->isVectorTy()) {
  assert(DestBits == SrcBits &&(static_cast<void> (0))
         "Illegal cast to vector (wrong type or size)")(static_cast<void> (0));
  return BitCast;
} else if (DestTy->isPointerTy()) {
  if (SrcTy->isPointerTy()) {
    if (DestTy->getPointerAddressSpace() != SrcTy->getPointerAddressSpace())
      return AddrSpaceCast;
    return BitCast;                               // ptr -> ptr
  } else if (SrcTy->isIntegerTy()) {
    return IntToPtr;                              // int -> ptr
  }
  llvm_unreachable("Casting pointer to other than pointer or int")__builtin_unreachable();
} else if (DestTy->isX86_MMXTy()) {
  if (SrcTy->isVectorTy()) {
    assert(DestBits == SrcBits && "Casting vector of wrong width to X86_MMX")(static_cast<void> (0));
    return BitCast;                               // 64-bit vector to MMX
  }
  llvm_unreachable("Illegal cast to X86_MMX")__builtin_unreachable();
}
llvm_unreachable("Casting to type that is not first-class")__builtin_unreachable();
3413}

3415//===----------------------------------------------------------------------===//
3416//                    CastInst SubClass Constructors
3417//===----------------------------------------------------------------------===//

3419/// Check that the construction parameters for a CastInst are correct. This
3420/// could be broken out into the separate constructors but it is useful to have
3421/// it in one place and to eliminate the redundant code for getting the sizes
3422/// of the types involved.
3423bool
3424CastInst::castIsValid(Instruction::CastOps op, Type *SrcTy, Type *DstTy) {
if (!SrcTy->isFirstClassType() || !DstTy->isFirstClassType() ||
    SrcTy->isAggregateType() || DstTy->isAggregateType())
  return false;

// Get the size of the types in bits, and whether we are dealing
// with vector types, we'll need this later.
bool SrcIsVec = isa<VectorType>(SrcTy);
bool DstIsVec = isa<VectorType>(DstTy);
unsigned SrcScalarBitSize = SrcTy->getScalarSizeInBits();
unsigned DstScalarBitSize = DstTy->getScalarSizeInBits();

// If these are vector types, get the lengths of the vectors (using zero for
// scalar types means that checking that vector lengths match also checks that
// scalars are not being converted to vectors or vectors to scalars).
ElementCount SrcEC = SrcIsVec ? cast<VectorType>(SrcTy)->getElementCount()
                              : ElementCount::getFixed(0);
ElementCount DstEC = DstIsVec ? cast<VectorType>(DstTy)->getElementCount()
                              : ElementCount::getFixed(0);

// Switch on the opcode provided
switch (op) {
default: return false; // This is an input error
case Instruction::Trunc:
  return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
         SrcEC == DstEC && SrcScalarBitSize > DstScalarBitSize;
case Instruction::ZExt:
  return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
         SrcEC == DstEC && SrcScalarBitSize < DstScalarBitSize;
case Instruction::SExt:
  return SrcTy->isIntOrIntVectorTy() && DstTy->isIntOrIntVectorTy() &&
         SrcEC == DstEC && SrcScalarBitSize < DstScalarBitSize;
case Instruction::FPTrunc:
  return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
         SrcEC == DstEC && SrcScalarBitSize > DstScalarBitSize;
case Instruction::FPExt:
  return SrcTy->isFPOrFPVectorTy() && DstTy->isFPOrFPVectorTy() &&
         SrcEC == DstEC && SrcScalarBitSize < DstScalarBitSize;
case Instruction::UIToFP:
case Instruction::SIToFP:
  return SrcTy->isIntOrIntVectorTy() && DstTy->isFPOrFPVectorTy() &&
         SrcEC == DstEC;
case Instruction::FPToUI:
case Instruction::FPToSI:
  return SrcTy->isFPOrFPVectorTy() && DstTy->isIntOrIntVectorTy() &&
         SrcEC == DstEC;
case Instruction::PtrToInt:
  if (SrcEC != DstEC)
    return false;
  return SrcTy->isPtrOrPtrVectorTy() && DstTy->isIntOrIntVectorTy();
case Instruction::IntToPtr:
  if (SrcEC != DstEC)
    return false;
  return SrcTy->isIntOrIntVectorTy() && DstTy->isPtrOrPtrVectorTy();
case Instruction::BitCast: {
  PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy->getScalarType());
  PointerType *DstPtrTy = dyn_cast<PointerType>(DstTy->getScalarType());

  // BitCast implies a no-op cast of type only. No bits change.
  // However, you can't cast pointers to anything but pointers.
  if (!SrcPtrTy != !DstPtrTy)
    return false;

  // For non-pointer cases, the cast is okay if the source and destination bit
  // widths are identical.
  if (!SrcPtrTy)
    return SrcTy->getPrimitiveSizeInBits() == DstTy->getPrimitiveSizeInBits();

  // If both are pointers then the address spaces must match.
  if (SrcPtrTy->getAddressSpace() != DstPtrTy->getAddressSpace())
    return false;

  // A vector of pointers must have the same number of elements.
  if (SrcIsVec && DstIsVec)
    return SrcEC == DstEC;
  if (SrcIsVec)
    return SrcEC == ElementCount::getFixed(1);
  if (DstIsVec)
    return DstEC == ElementCount::getFixed(1);

  return true;
}
case Instruction::AddrSpaceCast: {
  PointerType *SrcPtrTy = dyn_cast<PointerType>(SrcTy->getScalarType());
  if (!SrcPtrTy)
    return false;

  PointerType *DstPtrTy = dyn_cast<PointerType>(DstTy->getScalarType());
  if (!DstPtrTy)
    return false;

  if (SrcPtrTy->getAddressSpace() == DstPtrTy->getAddressSpace())
    return false;

  return SrcEC == DstEC;
}
}
3521}

3523TruncInst::TruncInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3525) : CastInst(Ty, Trunc, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc")(static_cast<void> (0));
3527}

3529TruncInst::TruncInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3531) : CastInst(Ty, Trunc, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal Trunc")(static_cast<void> (0));
3533}

3535ZExtInst::ZExtInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3537)  : CastInst(Ty, ZExt, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt")(static_cast<void> (0));
3539}

3541ZExtInst::ZExtInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3543)  : CastInst(Ty, ZExt, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal ZExt")(static_cast<void> (0));
3545}
3546SExtInst::SExtInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3548) : CastInst(Ty, SExt, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt")(static_cast<void> (0));
3550}

3552SExtInst::SExtInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3554)  : CastInst(Ty, SExt, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal SExt")(static_cast<void> (0));
3556}

3558FPTruncInst::FPTruncInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3560) : CastInst(Ty, FPTrunc, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc")(static_cast<void> (0));
3562}

3564FPTruncInst::FPTruncInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3566) : CastInst(Ty, FPTrunc, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPTrunc")(static_cast<void> (0));
3568}

3570FPExtInst::FPExtInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3572) : CastInst(Ty, FPExt, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt")(static_cast<void> (0));
3574}

3576FPExtInst::FPExtInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3578) : CastInst(Ty, FPExt, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPExt")(static_cast<void> (0));
3580}

3582UIToFPInst::UIToFPInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3584) : CastInst(Ty, UIToFP, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP")(static_cast<void> (0));
3586}

3588UIToFPInst::UIToFPInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3590) : CastInst(Ty, UIToFP, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal UIToFP")(static_cast<void> (0));
3592}

3594SIToFPInst::SIToFPInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3596) : CastInst(Ty, SIToFP, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP")(static_cast<void> (0));
3598}

3600SIToFPInst::SIToFPInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3602) : CastInst(Ty, SIToFP, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal SIToFP")(static_cast<void> (0));
3604}

3606FPToUIInst::FPToUIInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3608) : CastInst(Ty, FPToUI, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI")(static_cast<void> (0));
3610}

3612FPToUIInst::FPToUIInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3614) : CastInst(Ty, FPToUI, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToUI")(static_cast<void> (0));
3616}

3618FPToSIInst::FPToSIInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3620) : CastInst(Ty, FPToSI, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI")(static_cast<void> (0));
3622}

3624FPToSIInst::FPToSIInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3626) : CastInst(Ty, FPToSI, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal FPToSI")(static_cast<void> (0));
3628}

3630PtrToIntInst::PtrToIntInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3632) : CastInst(Ty, PtrToInt, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt")(static_cast<void> (0));
3634}

3636PtrToIntInst::PtrToIntInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3638) : CastInst(Ty, PtrToInt, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal PtrToInt")(static_cast<void> (0));
3640}

3642IntToPtrInst::IntToPtrInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3644) : CastInst(Ty, IntToPtr, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr")(static_cast<void> (0));
3646}

3648IntToPtrInst::IntToPtrInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3650) : CastInst(Ty, IntToPtr, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal IntToPtr")(static_cast<void> (0));
3652}

3654BitCastInst::BitCastInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3656) : CastInst(Ty, BitCast, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast")(static_cast<void> (0));
3658}

3660BitCastInst::BitCastInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3662) : CastInst(Ty, BitCast, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal BitCast")(static_cast<void> (0));
3664}

3666AddrSpaceCastInst::AddrSpaceCastInst(
Value *S, Type *Ty, const Twine &Name, Instruction *InsertBefore
3668) : CastInst(Ty, AddrSpaceCast, S, Name, InsertBefore) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast")(static_cast<void> (0));
3670}

3672AddrSpaceCastInst::AddrSpaceCastInst(
Value *S, Type *Ty, const Twine &Name, BasicBlock *InsertAtEnd
3674) : CastInst(Ty, AddrSpaceCast, S, Name, InsertAtEnd) {
assert(castIsValid(getOpcode(), S, Ty) && "Illegal AddrSpaceCast")(static_cast<void> (0));
3676}

3678//===----------------------------------------------------------------------===//
3679//                               CmpInst Classes
3680//===----------------------------------------------------------------------===//

3682CmpInst::CmpInst(Type *ty, OtherOps op, Predicate predicate, Value *LHS,
               Value *RHS, const Twine &Name, Instruction *InsertBefore,
               Instruction *FlagsSource)
: Instruction(ty, op,
              OperandTraits<CmpInst>::op_begin(this),
              OperandTraits<CmpInst>::operands(this),
              InsertBefore) {
Op<0>() = LHS;
Op<1>() = RHS;
setPredicate((Predicate)predicate);
setName(Name);
if (FlagsSource)
  copyIRFlags(FlagsSource);
3695}

3697CmpInst::CmpInst(Type *ty, OtherOps op, Predicate predicate, Value *LHS,
               Value *RHS, const Twine &Name, BasicBlock *InsertAtEnd)
: Instruction(ty, op,
              OperandTraits<CmpInst>::op_begin(this),
              OperandTraits<CmpInst>::operands(this),
              InsertAtEnd) {
Op<0>() = LHS;
Op<1>() = RHS;
setPredicate((Predicate)predicate);
setName(Name);
3707}

3709CmpInst *
3710CmpInst::Create(OtherOps Op, Predicate predicate, Value *S1, Value *S2,
              const Twine &Name, Instruction *InsertBefore) {
if (Op == Instruction::ICmp) {
  if (InsertBefore)
    return new ICmpInst(InsertBefore, CmpInst::Predicate(predicate),
                        S1, S2, Name);
  else
    return new ICmpInst(CmpInst::Predicate(predicate),
                        S1, S2, Name);
}

if (InsertBefore)
  return new FCmpInst(InsertBefore, CmpInst::Predicate(predicate),
                      S1, S2, Name);
else
  return new FCmpInst(CmpInst::Predicate(predicate),
                      S1, S2, Name);
3727}

3729CmpInst *
3730CmpInst::Create(OtherOps Op, Predicate predicate, Value *S1, Value *S2,
              const Twine &Name, BasicBlock *InsertAtEnd) {
if (Op == Instruction::ICmp) {
  return new ICmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
                      S1, S2, Name);
}
return new FCmpInst(*InsertAtEnd, CmpInst::Predicate(predicate),
                    S1, S2, Name);
3738}

3740void CmpInst::swapOperands() {
if (ICmpInst *IC = dyn_cast<ICmpInst>(this))
  IC->swapOperands();
else
  cast<FCmpInst>(this)->swapOperands();
3745}

3747bool CmpInst::isCommutative() const {
if (const ICmpInst *IC = dyn_cast<ICmpInst>(this))
  return IC->isCommutative();
return cast<FCmpInst>(this)->isCommutative();
3751}

3753bool CmpInst::isEquality(Predicate P) {
if (ICmpInst::isIntPredicate(P))
  return ICmpInst::isEquality(P);
if (FCmpInst::isFPPredicate(P))
  return FCmpInst::isEquality(P);
llvm_unreachable("Unsupported predicate kind")__builtin_unreachable();
3759}

3761CmpInst::Predicate CmpInst::getInversePredicate(Predicate pred) {
switch (pred) {
  default: llvm_unreachable("Unknown cmp predicate!")__builtin_unreachable();
  case ICMP_EQ: return ICMP_NE;
  case ICMP_NE: return ICMP_EQ;
  case ICMP_UGT: return ICMP_ULE;
  case ICMP_ULT: return ICMP_UGE;
  case ICMP_UGE: return ICMP_ULT;
  case ICMP_ULE: return ICMP_UGT;
  case ICMP_SGT: return ICMP_SLE;
  case ICMP_SLT: return ICMP_SGE;
  case ICMP_SGE: return ICMP_SLT;
  case ICMP_SLE: return ICMP_SGT;

  case FCMP_OEQ: return FCMP_UNE;
  case FCMP_ONE: return FCMP_UEQ;
  case FCMP_OGT: return FCMP_ULE;
  case FCMP_OLT: return FCMP_UGE;
  case FCMP_OGE: return FCMP_ULT;
  case FCMP_OLE: return FCMP_UGT;
  case FCMP_UEQ: return FCMP_ONE;
  case FCMP_UNE: return FCMP_OEQ;
  case FCMP_UGT: return FCMP_OLE;
  case FCMP_ULT: return FCMP_OGE;
  case FCMP_UGE: return FCMP_OLT;
  case FCMP_ULE: return FCMP_OGT;
  case FCMP_ORD: return FCMP_UNO;
  case FCMP_UNO: return FCMP_ORD;
  case FCMP_TRUE: return FCMP_FALSE;
  case FCMP_FALSE: return FCMP_TRUE;
}
3792}

3794StringRef CmpInst::getPredicateName(Predicate Pred) {
switch (Pred) {
default:                   return "unknown";
case FCmpInst::FCMP_FALSE: return "false";
case FCmpInst::FCMP_OEQ:   return "oeq";
case FCmpInst::FCMP_OGT:   return "ogt";
case FCmpInst::FCMP_OGE:   return "oge";
case FCmpInst::FCMP_OLT:   return "olt";
case FCmpInst::FCMP_OLE:   return "ole";
case FCmpInst::FCMP_ONE:   return "one";
case FCmpInst::FCMP_ORD:   return "ord";
case FCmpInst::FCMP_UNO:   return "uno";
case FCmpInst::FCMP_UEQ:   return "ueq";
case FCmpInst::FCMP_UGT:   return "ugt";
case FCmpInst::FCMP_UGE:   return "uge";
case FCmpInst::FCMP_ULT:   return "ult";
case FCmpInst::FCMP_ULE:   return "ule";
case FCmpInst::FCMP_UNE:   return "une";
case FCmpInst::FCMP_TRUE:  return "true";
case ICmpInst::ICMP_EQ:    return "eq";
case ICmpInst::ICMP_NE:    return "ne";
case ICmpInst::ICMP_SGT:   return "sgt";
case ICmpInst::ICMP_SGE:   return "sge";
case ICmpInst::ICMP_SLT:   return "slt";
case ICmpInst::ICMP_SLE:   return "sle";
case ICmpInst::ICMP_UGT:   return "ugt";
case ICmpInst::ICMP_UGE:   return "uge";
case ICmpInst::ICMP_ULT:   return "ult";
case ICmpInst::ICMP_ULE:   return "ule";
}
3824}

3826ICmpInst::Predicate ICmpInst::getSignedPredicate(Predicate pred) {
switch (pred) {
  default: llvm_unreachable("Unknown icmp predicate!")__builtin_unreachable();
  case ICMP_EQ: case ICMP_NE:
  case ICMP_SGT: case ICMP_SLT: case ICMP_SGE: case ICMP_SLE:
     return pred;
  case ICMP_UGT: return ICMP_SGT;
  case ICMP_ULT: return ICMP_SLT;
  case ICMP_UGE: return ICMP_SGE;
  case ICMP_ULE: return ICMP_SLE;
}
3837}

3839ICmpInst::Predicate ICmpInst::getUnsignedPredicate(Predicate pred) {
switch (pred) {
  default: llvm_unreachable("Unknown icmp predicate!")__builtin_unreachable();
  case ICMP_EQ: case ICMP_NE:
  case ICMP_UGT: case ICMP_ULT: case ICMP_UGE: case ICMP_ULE:
     return pred;
  case ICMP_SGT: return ICMP_UGT;
  case ICMP_SLT: return ICMP_ULT;
  case ICMP_SGE: return ICMP_UGE;
  case ICMP_SLE: return ICMP_ULE;
}
3850}

3852CmpInst::Predicate CmpInst::getSwappedPredicate(Predicate pred) {
switch (pred) {
  default: llvm_unreachable("Unknown cmp predicate!")__builtin_unreachable();
  case ICMP_EQ: case ICMP_NE:
    return pred;
  case ICMP_SGT: return ICMP_SLT;
  case ICMP_SLT: return ICMP_SGT;
  case ICMP_SGE: return ICMP_SLE;
  case ICMP_SLE: return ICMP_SGE;
  case ICMP_UGT: return ICMP_ULT;
  case ICMP_ULT: return ICMP_UGT;
  case ICMP_UGE: return ICMP_ULE;
  case ICMP_ULE: return ICMP_UGE;

  case FCMP_FALSE: case FCMP_TRUE:
  case FCMP_OEQ: case FCMP_ONE:
  case FCMP_UEQ: case FCMP_UNE:
  case FCMP_ORD: case FCMP_UNO:
    return pred;
  case FCMP_OGT: return FCMP_OLT;
  case FCMP_OLT: return FCMP_OGT;
  case FCMP_OGE: return FCMP_OLE;
  case FCMP_OLE: return FCMP_OGE;
  case FCMP_UGT: return FCMP_ULT;
  case FCMP_ULT: return FCMP_UGT;
  case FCMP_UGE: return FCMP_ULE;
  case FCMP_ULE: return FCMP_UGE;
}
3880}

3882bool CmpInst::isNonStrictPredicate(Predicate pred) {
switch (pred) {
case ICMP_SGE:
case ICMP_SLE:
case ICMP_UGE:
case ICMP_ULE:
case FCMP_OGE:
case FCMP_OLE:
case FCMP_UGE:
case FCMP_ULE:
  return true;
default:
  return false;
}
3896}

3898bool CmpInst::isStrictPredicate(Predicate pred) {
switch (pred) {
case ICMP_SGT:
case ICMP_SLT:
case ICMP_UGT:
case ICMP_ULT:
case FCMP_OGT:
case FCMP_OLT:
case FCMP_UGT:
case FCMP_ULT:
  return true;
default:
  return false;
}
3912}

3914CmpInst::Predicate CmpInst::getStrictPredicate(Predicate pred) {
switch (pred) {
case ICMP_SGE:
  return ICMP_SGT;
case ICMP_SLE:
  return ICMP_SLT;
case ICMP_UGE:
  return ICMP_UGT;
case ICMP_ULE:
  return ICMP_ULT;
case FCMP_OGE:
  return FCMP_OGT;
case FCMP_OLE:
  return FCMP_OLT;
case FCMP_UGE:
  return FCMP_UGT;
case FCMP_ULE:
  return FCMP_ULT;
default:
  return pred;
}
3935}

3937CmpInst::Predicate CmpInst::getNonStrictPredicate(Predicate pred) {
switch (pred) {
case ICMP_SGT:
  return ICMP_SGE;
case ICMP_SLT:
  return ICMP_SLE;
case ICMP_UGT:
  return ICMP_UGE;
case ICMP_ULT:
  return ICMP_ULE;
case FCMP_OGT:
  return FCMP_OGE;
case FCMP_OLT:
  return FCMP_OLE;
case FCMP_UGT:
  return FCMP_UGE;
case FCMP_ULT:
  return FCMP_ULE;
default:
  return pred;
}
3958}

3960CmpInst::Predicate CmpInst::getFlippedStrictnessPredicate(Predicate pred) {
assert(CmpInst::isRelational(pred) && "Call only with relational predicate!")(static_cast<void> (0));

if (isStrictPredicate(pred))
  return getNonStrictPredicate(pred);
if (isNonStrictPredicate(pred))
  return getStrictPredicate(pred);

llvm_unreachable("Unknown predicate!")__builtin_unreachable();
3969}

3971CmpInst::Predicate CmpInst::getSignedPredicate(Predicate pred) {
assert(CmpInst::isUnsigned(pred) && "Call only with unsigned predicates!")(static_cast<void> (0));

switch (pred) {
default:
  llvm_unreachable("Unknown predicate!")__builtin_unreachable();
case CmpInst::ICMP_ULT:
  return CmpInst::ICMP_SLT;
case CmpInst::ICMP_ULE:
  return CmpInst::ICMP_SLE;
case CmpInst::ICMP_UGT:
  return CmpInst::ICMP_SGT;
case CmpInst::ICMP_UGE:
  return CmpInst::ICMP_SGE;
}
3986}

3988CmpInst::Predicate CmpInst::getUnsignedPredicate(Predicate pred) {
assert(CmpInst::isSigned(pred) && "Call only with signed predicates!")(static_cast<void> (0));

switch (pred) {
default:
  llvm_unreachable("Unknown predicate!")__builtin_unreachable();
case CmpInst::ICMP_SLT:
  return CmpInst::ICMP_ULT;
case CmpInst::ICMP_SLE:
  return CmpInst::ICMP_ULE;
case CmpInst::ICMP_SGT:
  return CmpInst::ICMP_UGT;
case CmpInst::ICMP_SGE:
  return CmpInst::ICMP_UGE;
}
4003}

4005bool CmpInst::isUnsigned(Predicate predicate) {
switch (predicate) {
  default: return false;
  case ICmpInst::ICMP_ULT: case ICmpInst::ICMP_ULE: case ICmpInst::ICMP_UGT:
  case ICmpInst::ICMP_UGE: return true;
}
4011}

4013bool CmpInst::isSigned(Predicate predicate) {
switch (predicate) {
  default: return false;
  case ICmpInst::ICMP_SLT: case ICmpInst::ICMP_SLE: case ICmpInst::ICMP_SGT:
  case ICmpInst::ICMP_SGE: return true;
}
4019}

4021CmpInst::Predicate CmpInst::getFlippedSignednessPredicate(Predicate pred) {
assert(CmpInst::isRelational(pred) &&(static_cast<void> (0))
       "Call only with non-equality predicates!")(static_cast<void> (0));

if (isSigned(pred))
  return getUnsignedPredicate(pred);
if (isUnsigned(pred))
  return getSignedPredicate(pred);

llvm_unreachable("Unknown predicate!")__builtin_unreachable();
4031}

4033bool CmpInst::isOrdered(Predicate predicate) {
switch (predicate) {
  default: return false;
  case FCmpInst::FCMP_OEQ: case FCmpInst::FCMP_ONE: case FCmpInst::FCMP_OGT:
  case FCmpInst::FCMP_OLT: case FCmpInst::FCMP_OGE: case FCmpInst::FCMP_OLE:
  case FCmpInst::FCMP_ORD: return true;
}
4040}

4042bool CmpInst::isUnordered(Predicate predicate) {
switch (predicate) {
  default: return false;
  case FCmpInst::FCMP_UEQ: case FCmpInst::FCMP_UNE: case FCmpInst::FCMP_UGT:
  case FCmpInst::FCMP_ULT: case FCmpInst::FCMP_UGE: case FCmpInst::FCMP_ULE:
  case FCmpInst::FCMP_UNO: return true;
}
4049}

4051bool CmpInst::isTrueWhenEqual(Predicate predicate) {
switch(predicate) {
  default: return false;
  case ICMP_EQ:   case ICMP_UGE: case ICMP_ULE: case ICMP_SGE: case ICMP_SLE:
  case FCMP_TRUE: case FCMP_UEQ: case FCMP_UGE: case FCMP_ULE: return true;
}
4057}

4059bool CmpInst::isFalseWhenEqual(Predicate predicate) {
switch(predicate) {
case ICMP_NE:    case ICMP_UGT: case ICMP_ULT: case ICMP_SGT: case ICMP_SLT:
case FCMP_FALSE: case FCMP_ONE: case FCMP_OGT: case FCMP_OLT: return true;
default: return false;
}
4065}

4067bool CmpInst::isImpliedTrueByMatchingCmp(Predicate Pred1, Predicate Pred2) {
// If the predicates match, then we know the first condition implies the
// second is true.
if (Pred1 == Pred2)
  return true;

switch (Pred1) {
default:
  break;
case ICMP_EQ:
  // A == B implies A >=u B, A <=u B, A >=s B, and A <=s B are true.
  return Pred2 == ICMP_UGE || Pred2 == ICMP_ULE || Pred2 == ICMP_SGE ||
         Pred2 == ICMP_SLE;
case ICMP_UGT: // A >u B implies A != B and A >=u B are true.
  return Pred2 == ICMP_NE || Pred2 == ICMP_UGE;
case ICMP_ULT: // A <u B implies A != B and A <=u B are true.
  return Pred2 == ICMP_NE || Pred2 == ICMP_ULE;
case ICMP_SGT: // A >s B implies A != B and A >=s B are true.
  return Pred2 == ICMP_NE || Pred2 == ICMP_SGE;
case ICMP_SLT: // A <s B implies A != B and A <=s B are true.
  return Pred2 == ICMP_NE || Pred2 == ICMP_SLE;
}
return false;
4090}

4092bool CmpInst::isImpliedFalseByMatchingCmp(Predicate Pred1, Predicate Pred2) {
return isImpliedTrueByMatchingCmp(Pred1, getInversePredicate(Pred2));
4094}

4096//===----------------------------------------------------------------------===//
4097//                        SwitchInst Implementation
4098//===----------------------------------------------------------------------===//

4100void SwitchInst::init(Value *Value, BasicBlock *Default, unsigned NumReserved) {
assert(Value && Default && NumReserved)(static_cast<void> (0));
ReservedSpace = NumReserved;
setNumHungOffUseOperands(2);
allocHungoffUses(ReservedSpace);

Op<0>() = Value;
Op<1>() = Default;
4108}

4110/// SwitchInst ctor - Create a new switch instruction, specifying a value to
4111/// switch on and a default destination.  The number of additional cases can
4112/// be specified here to make memory allocation more efficient.  This
4113/// constructor can also autoinsert before another instruction.
4114SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
                     Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(Value->getContext()), Instruction::Switch,
                nullptr, 0, InsertBefore) {
init(Value, Default, 2+NumCases*2);
4119}

4121/// SwitchInst ctor - Create a new switch instruction, specifying a value to
4122/// switch on and a default destination.  The number of additional cases can
4123/// be specified here to make memory allocation more efficient.  This
4124/// constructor also autoinserts at the end of the specified BasicBlock.
4125SwitchInst::SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
                     BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(Value->getContext()), Instruction::Switch,
                nullptr, 0, InsertAtEnd) {
init(Value, Default, 2+NumCases*2);
4130}

4132SwitchInst::SwitchInst(const SwitchInst &SI)
  : Instruction(SI.getType(), Instruction::Switch, nullptr, 0) {
init(SI.getCondition(), SI.getDefaultDest(), SI.getNumOperands());
setNumHungOffUseOperands(SI.getNumOperands());
Use *OL = getOperandList();
const Use *InOL = SI.getOperandList();
for (unsigned i = 2, E = SI.getNumOperands(); i != E; i += 2) {
  OL[i] = InOL[i];
  OL[i+1] = InOL[i+1];
}
SubclassOptionalData = SI.SubclassOptionalData;
4143}

4145/// addCase - Add an entry to the switch instruction...
4146///
4147void SwitchInst::addCase(ConstantInt *OnVal, BasicBlock *Dest) {
unsigned NewCaseIdx = getNumCases();
unsigned OpNo = getNumOperands();
if (OpNo+2 > ReservedSpace)
  growOperands();  // Get more space!
// Initialize some new operands.
assert(OpNo+1 < ReservedSpace && "Growing didn't work!")(static_cast<void> (0));
setNumHungOffUseOperands(OpNo+2);
CaseHandle Case(this, NewCaseIdx);
Case.setValue(OnVal);
Case.setSuccessor(Dest);
4158}

4160/// removeCase - This method removes the specified case and its successor
4161/// from the switch instruction.
4162SwitchInst::CaseIt SwitchInst::removeCase(CaseIt I) {
unsigned idx = I->getCaseIndex();

assert(2 + idx*2 < getNumOperands() && "Case index out of range!!!")(static_cast<void> (0));

unsigned NumOps = getNumOperands();
Use *OL = getOperandList();

// Overwrite this case with the end of the list.
if (2 + (idx + 1) * 2 != NumOps) {
  OL[2 + idx * 2] = OL[NumOps - 2];
  OL[2 + idx * 2 + 1] = OL[NumOps - 1];
}

// Nuke the last value.
OL[NumOps-2].set(nullptr);
OL[NumOps-2+1].set(nullptr);
setNumHungOffUseOperands(NumOps-2);

return CaseIt(this, idx);
4182}

4184/// growOperands - grow operands - This grows the operand list in response
4185/// to a push_back style of operation.  This grows the number of ops by 3 times.
4186///
4187void SwitchInst::growOperands() {
unsigned e = getNumOperands();
unsigned NumOps = e*3;

ReservedSpace = NumOps;
growHungoffUses(ReservedSpace);
4193}

4195MDNode *
4196SwitchInstProfUpdateWrapper::getProfBranchWeightsMD(const SwitchInst &SI) {
if (MDNode *ProfileData = SI.getMetadata(LLVMContext::MD_prof))
  if (auto *MDName = dyn_cast<MDString>(ProfileData->getOperand(0)))
    if (MDName->getString() == "branch_weights")
      return ProfileData;
return nullptr;
4202}

4204MDNode *SwitchInstProfUpdateWrapper::buildProfBranchWeightsMD() {
assert(Changed && "called only if metadata has changed")(static_cast<void> (0));

if (!Weights)
  return nullptr;

assert(SI.getNumSuccessors() == Weights->size() &&(static_cast<void> (0))
       "num of prof branch_weights must accord with num of successors")(static_cast<void> (0));

bool AllZeroes =
    all_of(Weights.getValue(), [](uint32_t W) { return W == 0; });

if (AllZeroes || Weights.getValue().size() < 2)
  return nullptr;

return MDBuilder(SI.getParent()->getContext()).createBranchWeights(*Weights);
4220}

4222void SwitchInstProfUpdateWrapper::init() {
MDNode *ProfileData = getProfBranchWeightsMD(SI);
if (!ProfileData)
  return;

if (ProfileData->getNumOperands() != SI.getNumSuccessors() + 1) {
  llvm_unreachable("number of prof branch_weights metadata operands does "__builtin_unreachable()
                   "not correspond to number of succesors")__builtin_unreachable();
}

SmallVector<uint32_t, 8> Weights;
for (unsigned CI = 1, CE = SI.getNumSuccessors(); CI <= CE; ++CI) {
  ConstantInt *C = mdconst::extract<ConstantInt>(ProfileData->getOperand(CI));
  uint32_t CW = C->getValue().getZExtValue();
  Weights.push_back(CW);
}
this->Weights = std::move(Weights);
4239}

4241SwitchInst::CaseIt
4242SwitchInstProfUpdateWrapper::removeCase(SwitchInst::CaseIt I) {
if (Weights) {
  assert(SI.getNumSuccessors() == Weights->size() &&(static_cast<void> (0))
         "num of prof branch_weights must accord with num of successors")(static_cast<void> (0));
  Changed = true;
  // Copy the last case to the place of the removed one and shrink.
  // This is tightly coupled with the way SwitchInst::removeCase() removes
  // the cases in SwitchInst::removeCase(CaseIt).
  Weights.getValue()[I->getCaseIndex() + 1] = Weights.getValue().back();
  Weights.getValue().pop_back();
}
return SI.removeCase(I);
4254}

4256void SwitchInstProfUpdateWrapper::addCase(
  ConstantInt *OnVal, BasicBlock *Dest,
  SwitchInstProfUpdateWrapper::CaseWeightOpt W) {
SI.addCase(OnVal, Dest);

if (!Weights && W && *W) {
  Changed = true;
  Weights = SmallVector<uint32_t, 8>(SI.getNumSuccessors(), 0);
  Weights.getValue()[SI.getNumSuccessors() - 1] = *W;
} else if (Weights) {
  Changed = true;
  Weights.getValue().push_back(W ? *W : 0);
}
if (Weights)
  assert(SI.getNumSuccessors() == Weights->size() &&(static_cast<void> (0))
         "num of prof branch_weights must accord with num of successors")(static_cast<void> (0));
4272}

4274SymbolTableList<Instruction>::iterator
4275SwitchInstProfUpdateWrapper::eraseFromParent() {
// Instruction is erased. Mark as unchanged to not touch it in the destructor.
Changed = false;
if (Weights)
  Weights->resize(0);
return SI.eraseFromParent();
4281}

4283SwitchInstProfUpdateWrapper::CaseWeightOpt
4284SwitchInstProfUpdateWrapper::getSuccessorWeight(unsigned idx) {
if (!Weights)
  return None;
return Weights.getValue()[idx];
4288}

4290void SwitchInstProfUpdateWrapper::setSuccessorWeight(
  unsigned idx, SwitchInstProfUpdateWrapper::CaseWeightOpt W) {
if (!W)
  return;

if (!Weights && *W)
  Weights = SmallVector<uint32_t, 8>(SI.getNumSuccessors(), 0);

if (Weights) {
  auto &OldW = Weights.getValue()[idx];
  if (*W != OldW) {
    Changed = true;
    OldW = *W;
  }
}
4305}

4307SwitchInstProfUpdateWrapper::CaseWeightOpt
4308SwitchInstProfUpdateWrapper::getSuccessorWeight(const SwitchInst &SI,
                                              unsigned idx) {
if (MDNode *ProfileData = getProfBranchWeightsMD(SI))
  if (ProfileData->getNumOperands() == SI.getNumSuccessors() + 1)
    return mdconst::extract<ConstantInt>(ProfileData->getOperand(idx + 1))
        ->getValue()
        .getZExtValue();

return None;
4317}

4319//===----------------------------------------------------------------------===//
4320//                        IndirectBrInst Implementation
4321//===----------------------------------------------------------------------===//

4323void IndirectBrInst::init(Value *Address, unsigned NumDests) {
assert(Address && Address->getType()->isPointerTy() &&(static_cast<void> (0))
       "Address of indirectbr must be a pointer")(static_cast<void> (0));
ReservedSpace = 1+NumDests;
setNumHungOffUseOperands(1);
allocHungoffUses(ReservedSpace);

Op<0>() = Address;
4331}


4334/// growOperands - grow operands - This grows the operand list in response
4335/// to a push_back style of operation.  This grows the number of ops by 2 times.
4336///
4337void IndirectBrInst::growOperands() {
unsigned e = getNumOperands();
unsigned NumOps = e*2;

ReservedSpace = NumOps;
growHungoffUses(ReservedSpace);
4343}

4345IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
                             Instruction *InsertBefore)
  : Instruction(Type::getVoidTy(Address->getContext()),
                Instruction::IndirectBr, nullptr, 0, InsertBefore) {
init(Address, NumCases);
4350}

4352IndirectBrInst::IndirectBrInst(Value *Address, unsigned NumCases,
                             BasicBlock *InsertAtEnd)
  : Instruction(Type::getVoidTy(Address->getContext()),
                Instruction::IndirectBr, nullptr, 0, InsertAtEnd) {
init(Address, NumCases);
4357}

4359IndirectBrInst::IndirectBrInst(const IndirectBrInst &IBI)
  : Instruction(Type::getVoidTy(IBI.getContext()), Instruction::IndirectBr,
                nullptr, IBI.getNumOperands()) {
allocHungoffUses(IBI.getNumOperands());
Use *OL = getOperandList();
const Use *InOL = IBI.getOperandList();
for (unsigned i = 0, E = IBI.getNumOperands(); i != E; ++i)
  OL[i] = InOL[i];
SubclassOptionalData = IBI.SubclassOptionalData;
4368}

4370/// addDestination - Add a destination.
4371///
4372void IndirectBrInst::addDestination(BasicBlock *DestBB) {
unsigned OpNo = getNumOperands();
if (OpNo+1 > ReservedSpace)
  growOperands();  // Get more space!
// Initialize some new operands.
assert(OpNo < ReservedSpace && "Growing didn't work!")(static_cast<void> (0));
setNumHungOffUseOperands(OpNo+1);
getOperandList()[OpNo] = DestBB;
4380}

4382/// removeDestination - This method removes the specified successor from the
4383/// indirectbr instruction.
4384void IndirectBrInst::removeDestination(unsigned idx) {
assert(idx < getNumOperands()-1 && "Successor index out of range!")(static_cast<void> (0));

unsigned NumOps = getNumOperands();
Use *OL = getOperandList();

// Replace this value with the last one.
OL[idx+1] = OL[NumOps-1];

// Nuke the last value.
OL[NumOps-1].set(nullptr);
setNumHungOffUseOperands(NumOps-1);
4396}

4398//===----------------------------------------------------------------------===//
4399//                            FreezeInst Implementation
4400//===----------------------------------------------------------------------===//

4402FreezeInst::FreezeInst(Value *S,
                     const Twine &Name, Instruction *InsertBefore)
  : UnaryInstruction(S->getType(), Freeze, S, InsertBefore) {
setName(Name);
4406}

4408FreezeInst::FreezeInst(Value *S,
                     const Twine &Name, BasicBlock *InsertAtEnd)
  : UnaryInstruction(S->getType(), Freeze, S, InsertAtEnd) {
setName(Name);
4412}

4414//===----------------------------------------------------------------------===//
4415//                           cloneImpl() implementations
4416//===----------------------------------------------------------------------===//

4418// Define these methods here so vtables don't get emitted into every translation
4419// unit that uses these classes.

4421GetElementPtrInst *GetElementPtrInst::cloneImpl() const {
return new (getNumOperands()) GetElementPtrInst(*this);
4423}

4425UnaryOperator *UnaryOperator::cloneImpl() const {
return Create(getOpcode(), Op<0>());
4427}

4429BinaryOperator *BinaryOperator::cloneImpl() const {
return Create(getOpcode(), Op<0>(), Op<1>());
4431}

4433FCmpInst *FCmpInst::cloneImpl() const {
return new FCmpInst(getPredicate(), Op<0>(), Op<1>());
4435}

4437ICmpInst *ICmpInst::cloneImpl() const {
return new ICmpInst(getPredicate(), Op<0>(), Op<1>());
4439}

4441ExtractValueInst *ExtractValueInst::cloneImpl() const {
return new ExtractValueInst(*this);
4443}

4445InsertValueInst *InsertValueInst::cloneImpl() const {
return new InsertValueInst(*this);
4447}

4449AllocaInst *AllocaInst::cloneImpl() const {
AllocaInst *Result =
    new AllocaInst(getAllocatedType(), getType()->getAddressSpace(),
                   getOperand(0), getAlign());
Result->setUsedWithInAlloca(isUsedWithInAlloca());
Result->setSwiftError(isSwiftError());
return Result;
4456}

4458LoadInst *LoadInst::cloneImpl() const {
return new LoadInst(getType(), getOperand(0), Twine(), isVolatile(),
                    getAlign(), getOrdering(), getSyncScopeID());
4461}

4463StoreInst *StoreInst::cloneImpl() const {
return new StoreInst(getOperand(0), getOperand(1), isVolatile(), getAlign(),
                     getOrdering(), getSyncScopeID());
4466}

4468AtomicCmpXchgInst *AtomicCmpXchgInst::cloneImpl() const {
AtomicCmpXchgInst *Result = new AtomicCmpXchgInst(
    getOperand(0), getOperand(1), getOperand(2), getAlign(),
    getSuccessOrdering(), getFailureOrdering(), getSyncScopeID());
Result->setVolatile(isVolatile());
Result->setWeak(isWeak());
return Result;
4475}

4477AtomicRMWInst *AtomicRMWInst::cloneImpl() const {
AtomicRMWInst *Result =
    new AtomicRMWInst(getOperation(), getOperand(0), getOperand(1),
                      getAlign(), getOrdering(), getSyncScopeID());
Result->setVolatile(isVolatile());
return Result;
4483}

4485FenceInst *FenceInst::cloneImpl() const {
return new FenceInst(getContext(), getOrdering(), getSyncScopeID());
4487}

4489TruncInst *TruncInst::cloneImpl() const {
return new TruncInst(getOperand(0), getType());
4491}

4493ZExtInst *ZExtInst::cloneImpl() const {
return new ZExtInst(getOperand(0), getType());
4495}

4497SExtInst *SExtInst::cloneImpl() const {
return new SExtInst(getOperand(0), getType());
4499}

4501FPTruncInst *FPTruncInst::cloneImpl() const {
return new FPTruncInst(getOperand(0), getType());
4503}

4505FPExtInst *FPExtInst::cloneImpl() const {
return new FPExtInst(getOperand(0), getType());
4507}

4509UIToFPInst *UIToFPInst::cloneImpl() const {
return new UIToFPInst(getOperand(0), getType());
4511}

4513SIToFPInst *SIToFPInst::cloneImpl() const {
return new SIToFPInst(getOperand(0), getType());
4515}

4517FPToUIInst *FPToUIInst::cloneImpl() const {
return new FPToUIInst(getOperand(0), getType());
4519}

4521FPToSIInst *FPToSIInst::cloneImpl() const {
return new FPToSIInst(getOperand(0), getType());
4523}

4525PtrToIntInst *PtrToIntInst::cloneImpl() const {
return new PtrToIntInst(getOperand(0), getType());
4527}

4529IntToPtrInst *IntToPtrInst::cloneImpl() const {
return new IntToPtrInst(getOperand(0), getType());
4531}

4533BitCastInst *BitCastInst::cloneImpl() const {
return new BitCastInst(getOperand(0), getType());
4535}

4537AddrSpaceCastInst *AddrSpaceCastInst::cloneImpl() const {
return new AddrSpaceCastInst(getOperand(0), getType());
4539}

4541CallInst *CallInst::cloneImpl() const {
if (hasOperandBundles()) {
  unsigned DescriptorBytes = getNumOperandBundles() * sizeof(BundleOpInfo);
  return new(getNumOperands(), DescriptorBytes) CallInst(*this);
}
return  new(getNumOperands()) CallInst(*this);
4547}

4549SelectInst *SelectInst::cloneImpl() const {
return SelectInst::Create(getOperand(0), getOperand(1), getOperand(2));
4551}

4553VAArgInst *VAArgInst::cloneImpl() const {
return new VAArgInst(getOperand(0), getType());
4555}

4557ExtractElementInst *ExtractElementInst::cloneImpl() const {
return ExtractElementInst::Create(getOperand(0), getOperand(1));
4559}

4561InsertElementInst *InsertElementInst::cloneImpl() const {
return InsertElementInst::Create(getOperand(0), getOperand(1), getOperand(2));
4563}

4565ShuffleVectorInst *ShuffleVectorInst::cloneImpl() const {
return new ShuffleVectorInst(getOperand(0), getOperand(1), getShuffleMask());
4567}

4569PHINode *PHINode::cloneImpl() const { return new PHINode(*this); }

4571LandingPadInst *LandingPadInst::cloneImpl() const {
return new LandingPadInst(*this);
4573}

4575ReturnInst *ReturnInst::cloneImpl() const {
return new(getNumOperands()) ReturnInst(*this);
4577}

4579BranchInst *BranchInst::cloneImpl() const {
return new(getNumOperands()) BranchInst(*this);
4581}

4583SwitchInst *SwitchInst::cloneImpl() const { return new SwitchInst(*this); }

4585IndirectBrInst *IndirectBrInst::cloneImpl() const {
return new IndirectBrInst(*this);
4587}

4589InvokeInst *InvokeInst::cloneImpl() const {
if (hasOperandBundles()) {
  unsigned DescriptorBytes = getNumOperandBundles() * sizeof(BundleOpInfo);
  return new(getNumOperands(), DescriptorBytes) InvokeInst(*this);
}
return new(getNumOperands()) InvokeInst(*this);
4595}

4597CallBrInst *CallBrInst::cloneImpl() const {
if (hasOperandBundles()) {
  unsigned DescriptorBytes = getNumOperandBundles() * sizeof(BundleOpInfo);
  return new (getNumOperands(), DescriptorBytes) CallBrInst(*this);
}
return new (getNumOperands()) CallBrInst(*this);
4603}

4605ResumeInst *ResumeInst::cloneImpl() const { return new (1) ResumeInst(*this); }

4607CleanupReturnInst *CleanupReturnInst::cloneImpl() const {
return new (getNumOperands()) CleanupReturnInst(*this);
4609}

4611CatchReturnInst *CatchReturnInst::cloneImpl() const {
return new (getNumOperands()) CatchReturnInst(*this);
4613}

4615CatchSwitchInst *CatchSwitchInst::cloneImpl() const {
return new CatchSwitchInst(*this);
4617}

4619FuncletPadInst *FuncletPadInst::cloneImpl() const {
return new (getNumOperands()) FuncletPadInst(*this);
4621}

4623UnreachableInst *UnreachableInst::cloneImpl() const {
LLVMContext &Context = getContext();
return new UnreachableInst(Context);
4626}

4628FreezeInst *FreezeInst::cloneImpl() const {
return new FreezeInst(getOperand(0));
4630}

←

/build/llvm-toolchain-snapshot-14~++20210903100615+fd66b44ec19e/llvm/include/llvm/IR/InstrTypes.h

1//===- llvm/InstrTypes.h - Important Instruction subclasses -----*- 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 defines various meta classes of instructions that exist in the VM
10// representation.  Specific concrete subclasses of these may be found in the
11// i*.h files...
12//
13//===----------------------------------------------------------------------===//

15#ifndef LLVM_IR_INSTRTYPES_H
16#define LLVM_IR_INSTRTYPES_H

18#include "llvm/ADT/ArrayRef.h"
19#include "llvm/ADT/None.h"
20#include "llvm/ADT/Optional.h"
21#include "llvm/ADT/STLExtras.h"
22#include "llvm/ADT/StringMap.h"
23#include "llvm/ADT/StringRef.h"
24#include "llvm/ADT/Twine.h"
25#include "llvm/ADT/iterator_range.h"
26#include "llvm/IR/Attributes.h"
27#include "llvm/IR/CallingConv.h"
28#include "llvm/IR/Constants.h"
29#include "llvm/IR/DerivedTypes.h"
30#include "llvm/IR/Function.h"
31#include "llvm/IR/Instruction.h"
32#include "llvm/IR/LLVMContext.h"
33#include "llvm/IR/OperandTraits.h"
34#include "llvm/IR/Type.h"
35#include "llvm/IR/User.h"
36#include "llvm/IR/Value.h"
37#include "llvm/Support/Casting.h"
38#include "llvm/Support/ErrorHandling.h"
39#include <algorithm>
40#include <cassert>
41#include <cstddef>
42#include <cstdint>
43#include <iterator>
44#include <string>
45#include <vector>

47namespace llvm {

49namespace Intrinsic {
50typedef unsigned ID;
51}

53//===----------------------------------------------------------------------===//
54//                          UnaryInstruction Class
55//===----------------------------------------------------------------------===//

57class UnaryInstruction : public Instruction {
58protected:
UnaryInstruction(Type *Ty, unsigned iType, Value *V,
                 Instruction *IB = nullptr)
  : Instruction(Ty, iType, &Op<0>(), 1, IB) {
  Op<0>() = V;
}
UnaryInstruction(Type *Ty, unsigned iType, Value *V, BasicBlock *IAE)
  : Instruction(Ty, iType, &Op<0>(), 1, IAE) {
  Op<0>() = V;
}

69public:
// allocate space for exactly one operand
void *operator new(size_t S) { return User::operator new(S, 1); }
void operator delete(void *Ptr) { User::operator delete(Ptr); }

/// 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->isUnaryOp() ||
         I->getOpcode() == Instruction::Alloca ||
         I->getOpcode() == Instruction::Load ||
         I->getOpcode() == Instruction::VAArg ||
         I->getOpcode() == Instruction::ExtractValue ||
         (I->getOpcode() >= CastOpsBegin && I->getOpcode() < CastOpsEnd);
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}
89};

91template <>
92struct OperandTraits<UnaryInstruction> :
public FixedNumOperandTraits<UnaryInstruction, 1> {
94};

96DEFINE_TRANSPARENT_OPERAND_ACCESSORS(UnaryInstruction, Value)UnaryInstruction::op_iterator UnaryInstruction::op_begin() { return
 OperandTraits<UnaryInstruction>::op_begin(this); } UnaryInstruction
::const_op_iterator UnaryInstruction::op_begin() const { return
 OperandTraits<UnaryInstruction>::op_begin(const_cast<
UnaryInstruction*>(this)); } UnaryInstruction::op_iterator
 UnaryInstruction::op_end() { return OperandTraits<UnaryInstruction
>::op_end(this); } UnaryInstruction::const_op_iterator UnaryInstruction
::op_end() const { return OperandTraits<UnaryInstruction>
::op_end(const_cast<UnaryInstruction*>(this)); } Value *
UnaryInstruction::getOperand(unsigned i_nocapture) const { (static_cast
<void> (0)); return cast_or_null<Value>( OperandTraits
<UnaryInstruction>::op_begin(const_cast<UnaryInstruction
*>(this))[i_nocapture].get()); } void UnaryInstruction::setOperand
(unsigned i_nocapture, Value *Val_nocapture) { (static_cast<
void> (0)); OperandTraits<UnaryInstruction>::op_begin
(this)[i_nocapture] = Val_nocapture; } unsigned UnaryInstruction
::getNumOperands() const { return OperandTraits<UnaryInstruction
>::operands(this); } template <int Idx_nocapture> Use
 &UnaryInstruction::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
UnaryInstruction::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

98//===----------------------------------------------------------------------===//
99//                                UnaryOperator Class
100//===----------------------------------------------------------------------===//

102class UnaryOperator : public UnaryInstruction {
void AssertOK();

105protected:
UnaryOperator(UnaryOps iType, Value *S, Type *Ty,
              const Twine &Name, Instruction *InsertBefore);
UnaryOperator(UnaryOps iType, Value *S, Type *Ty,
              const Twine &Name, BasicBlock *InsertAtEnd);

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

UnaryOperator *cloneImpl() const;

116public:

/// Construct a unary instruction, given the opcode and an operand.
/// Optionally (if InstBefore is specified) insert the instruction
/// into a BasicBlock right before the specified instruction.  The specified
/// Instruction is allowed to be a dereferenced end iterator.
///
static UnaryOperator *Create(UnaryOps Op, Value *S,
                             const Twine &Name = Twine(),
                             Instruction *InsertBefore = nullptr);

/// Construct a unary instruction, given the opcode and an operand.
/// Also automatically insert this instruction to the end of the
/// BasicBlock specified.
///
static UnaryOperator *Create(UnaryOps Op, Value *S,
                             const Twine &Name,
                             BasicBlock *InsertAtEnd);

/// These methods just forward to Create, and are useful when you
/// statically know what type of instruction you're going to create.  These
/// helpers just save some typing.
138#define HANDLE_UNARY_INST(N, OPC, CLASS) \
static UnaryOperator *Create##OPC(Value *V, const Twine &Name = "") {\
  return Create(Instruction::OPC, V, Name);\
}
142#include "llvm/IR/Instruction.def"
143#define HANDLE_UNARY_INST(N, OPC, CLASS) \
static UnaryOperator *Create##OPC(Value *V, const Twine &Name, \
                                  BasicBlock *BB) {\
  return Create(Instruction::OPC, V, Name, BB);\
}
148#include "llvm/IR/Instruction.def"
149#define HANDLE_UNARY_INST(N, OPC, CLASS) \
static UnaryOperator *Create##OPC(Value *V, const Twine &Name, \
                                  Instruction *I) {\
  return Create(Instruction::OPC, V, Name, I);\
}
154#include "llvm/IR/Instruction.def"

static UnaryOperator *
CreateWithCopiedFlags(UnaryOps Opc, Value *V, Instruction *CopyO,
                      const Twine &Name = "",
                      Instruction *InsertBefore = nullptr) {
  UnaryOperator *UO = Create(Opc, V, Name, InsertBefore);
  UO->copyIRFlags(CopyO);
  return UO;
}

static UnaryOperator *CreateFNegFMF(Value *Op, Instruction *FMFSource,
                                    const Twine &Name = "",
                                    Instruction *InsertBefore = nullptr) {
  return CreateWithCopiedFlags(Instruction::FNeg, Op, FMFSource, Name,
                               InsertBefore);
}

UnaryOps getOpcode() const {
  return static_cast<UnaryOps>(Instruction::getOpcode());
}

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

185//===----------------------------------------------------------------------===//
186//                           BinaryOperator Class
187//===----------------------------------------------------------------------===//

189class BinaryOperator : public Instruction {
void AssertOK();

192protected:
BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
               const Twine &Name, Instruction *InsertBefore);
BinaryOperator(BinaryOps iType, Value *S1, Value *S2, Type *Ty,
               const Twine &Name, BasicBlock *InsertAtEnd);

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

BinaryOperator *cloneImpl() const;

203public:
// 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); }

/// 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;

/// Construct a binary instruction, given the opcode and the two
/// operands.  Optionally (if InstBefore is specified) insert the instruction
/// into a BasicBlock right before the specified instruction.  The specified
/// Instruction is allowed to be a dereferenced end iterator.
///
static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
                              const Twine &Name = Twine(),
                              Instruction *InsertBefore = nullptr);

/// Construct a binary instruction, given the opcode and the two
/// operands.  Also automatically insert this instruction to the end of the
/// BasicBlock specified.
///
static BinaryOperator *Create(BinaryOps Op, Value *S1, Value *S2,
                              const Twine &Name, BasicBlock *InsertAtEnd);

/// These methods just forward to Create, and are useful when you
/// statically know what type of instruction you're going to create.  These
/// helpers just save some typing.
230#define HANDLE_BINARY_INST(N, OPC, CLASS) \
static BinaryOperator *Create##OPC(Value *V1, Value *V2, \
                                   const Twine &Name = "") {\
  return Create(Instruction::OPC, V1, V2, Name);\
}
235#include "llvm/IR/Instruction.def"
236#define HANDLE_BINARY_INST(N, OPC, CLASS) \
static BinaryOperator *Create##OPC(Value *V1, Value *V2, \
                                   const Twine &Name, BasicBlock *BB) {\
  return Create(Instruction::OPC, V1, V2, Name, BB);\
}
241#include "llvm/IR/Instruction.def"
242#define HANDLE_BINARY_INST(N, OPC, CLASS) \
static BinaryOperator *Create##OPC(Value *V1, Value *V2, \
                                   const Twine &Name, Instruction *I) {\
  return Create(Instruction::OPC, V1, V2, Name, I);\
}
247#include "llvm/IR/Instruction.def"

static BinaryOperator *
CreateWithCopiedFlags(BinaryOps Opc, Value *V1, Value *V2, Instruction *CopyO,
                      const Twine &Name = "",
                      Instruction *InsertBefore = nullptr) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, InsertBefore);
  BO->copyIRFlags(CopyO);
  return BO;
}

static BinaryOperator *CreateFAddFMF(Value *V1, Value *V2,
                                     Instruction *FMFSource,
                                     const Twine &Name = "") {
  return CreateWithCopiedFlags(Instruction::FAdd, V1, V2, FMFSource, Name);
}
static BinaryOperator *CreateFSubFMF(Value *V1, Value *V2,
                                     Instruction *FMFSource,
                                     const Twine &Name = "") {
  return CreateWithCopiedFlags(Instruction::FSub, V1, V2, FMFSource, Name);
}
static BinaryOperator *CreateFMulFMF(Value *V1, Value *V2,
                                     Instruction *FMFSource,
                                     const Twine &Name = "") {
  return CreateWithCopiedFlags(Instruction::FMul, V1, V2, FMFSource, Name);
}
static BinaryOperator *CreateFDivFMF(Value *V1, Value *V2,
                                     Instruction *FMFSource,
                                     const Twine &Name = "") {
  return CreateWithCopiedFlags(Instruction::FDiv, V1, V2, FMFSource, Name);
}
static BinaryOperator *CreateFRemFMF(Value *V1, Value *V2,
                                     Instruction *FMFSource,
                                     const Twine &Name = "") {
  return CreateWithCopiedFlags(Instruction::FRem, V1, V2, FMFSource, Name);
}

static BinaryOperator *CreateNSW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name = "") {
  BinaryOperator *BO = Create(Opc, V1, V2, Name);
  BO->setHasNoSignedWrap(true);
  return BO;
}
static BinaryOperator *CreateNSW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name, BasicBlock *BB) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, BB);
  BO->setHasNoSignedWrap(true);
  return BO;
}
static BinaryOperator *CreateNSW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name, Instruction *I) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, I);
  BO->setHasNoSignedWrap(true);
  return BO;
}

static BinaryOperator *CreateNUW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name = "") {
  BinaryOperator *BO = Create(Opc, V1, V2, Name);
  BO->setHasNoUnsignedWrap(true);
  return BO;
}
static BinaryOperator *CreateNUW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name, BasicBlock *BB) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, BB);
  BO->setHasNoUnsignedWrap(true);
  return BO;
}
static BinaryOperator *CreateNUW(BinaryOps Opc, Value *V1, Value *V2,
                                 const Twine &Name, Instruction *I) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, I);
  BO->setHasNoUnsignedWrap(true);
  return BO;
}

static BinaryOperator *CreateExact(BinaryOps Opc, Value *V1, Value *V2,
                                   const Twine &Name = "") {
  BinaryOperator *BO = Create(Opc, V1, V2, Name);
  BO->setIsExact(true);
  return BO;
}
static BinaryOperator *CreateExact(BinaryOps Opc, Value *V1, Value *V2,
                                   const Twine &Name, BasicBlock *BB) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, BB);
  BO->setIsExact(true);
  return BO;
}
static BinaryOperator *CreateExact(BinaryOps Opc, Value *V1, Value *V2,
                                   const Twine &Name, Instruction *I) {
  BinaryOperator *BO = Create(Opc, V1, V2, Name, I);
  BO->setIsExact(true);
  return BO;
}

341#define DEFINE_HELPERS(OPC, NUWNSWEXACT)                                       \
static BinaryOperator *Create##NUWNSWEXACT##OPC(Value *V1, Value *V2,        \
                                                const Twine &Name = "") {    \
  return Create##NUWNSWEXACT(Instruction::OPC, V1, V2, Name);                \
}                                                                            \
static BinaryOperator *Create##NUWNSWEXACT##OPC(                             \
    Value *V1, Value *V2, const Twine &Name, BasicBlock *BB) {               \
  return Create##NUWNSWEXACT(Instruction::OPC, V1, V2, Name, BB);            \
}                                                                            \
static BinaryOperator *Create##NUWNSWEXACT##OPC(                             \
    Value *V1, Value *V2, const Twine &Name, Instruction *I) {               \
  return Create##NUWNSWEXACT(Instruction::OPC, V1, V2, Name, I);             \
}

DEFINE_HELPERS(Add, NSW) // CreateNSWAdd
DEFINE_HELPERS(Add, NUW) // CreateNUWAdd
DEFINE_HELPERS(Sub, NSW) // CreateNSWSub
DEFINE_HELPERS(Sub, NUW) // CreateNUWSub
DEFINE_HELPERS(Mul, NSW) // CreateNSWMul
DEFINE_HELPERS(Mul, NUW) // CreateNUWMul
DEFINE_HELPERS(Shl, NSW) // CreateNSWShl
DEFINE_HELPERS(Shl, NUW) // CreateNUWShl

DEFINE_HELPERS(SDiv, Exact)  // CreateExactSDiv
DEFINE_HELPERS(UDiv, Exact)  // CreateExactUDiv
DEFINE_HELPERS(AShr, Exact)  // CreateExactAShr
DEFINE_HELPERS(LShr, Exact)  // CreateExactLShr

369#undef DEFINE_HELPERS

/// Helper functions to construct and inspect unary operations (NEG and NOT)
/// via binary operators SUB and XOR:
///
/// Create the NEG and NOT instructions out of SUB and XOR instructions.
///
static BinaryOperator *CreateNeg(Value *Op, const Twine &Name = "",
                                 Instruction *InsertBefore = nullptr);
static BinaryOperator *CreateNeg(Value *Op, const Twine &Name,
                                 BasicBlock *InsertAtEnd);
static BinaryOperator *CreateNSWNeg(Value *Op, const Twine &Name = "",
                                    Instruction *InsertBefore = nullptr);
static BinaryOperator *CreateNSWNeg(Value *Op, const Twine &Name,
                                    BasicBlock *InsertAtEnd);
static BinaryOperator *CreateNUWNeg(Value *Op, const Twine &Name = "",
                                    Instruction *InsertBefore = nullptr);
static BinaryOperator *CreateNUWNeg(Value *Op, const Twine &Name,
                                    BasicBlock *InsertAtEnd);
static BinaryOperator *CreateNot(Value *Op, const Twine &Name = "",
                                 Instruction *InsertBefore = nullptr);
static BinaryOperator *CreateNot(Value *Op, const Twine &Name,
                                 BasicBlock *InsertAtEnd);

BinaryOps getOpcode() const {
  return static_cast<BinaryOps>(Instruction::getOpcode());
}

/// Exchange the two operands to this instruction.
/// This instruction is safe to use on any binary instruction and
/// does not modify the semantics of the instruction.  If the instruction
/// cannot be reversed (ie, it's a Div), then return true.
///
bool swapOperands();

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

413template <>
414struct OperandTraits<BinaryOperator> :
public FixedNumOperandTraits<BinaryOperator, 2> {
416};

418DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BinaryOperator, Value)BinaryOperator::op_iterator BinaryOperator::op_begin() { return
 OperandTraits<BinaryOperator>::op_begin(this); } BinaryOperator
::const_op_iterator BinaryOperator::op_begin() const { return
 OperandTraits<BinaryOperator>::op_begin(const_cast<
BinaryOperator*>(this)); } BinaryOperator::op_iterator BinaryOperator
::op_end() { return OperandTraits<BinaryOperator>::op_end
(this); } BinaryOperator::const_op_iterator BinaryOperator::op_end
() const { return OperandTraits<BinaryOperator>::op_end
(const_cast<BinaryOperator*>(this)); } Value *BinaryOperator
::getOperand(unsigned i_nocapture) const { (static_cast<void
> (0)); return cast_or_null<Value>( OperandTraits<
BinaryOperator>::op_begin(const_cast<BinaryOperator*>
(this))[i_nocapture].get()); } void BinaryOperator::setOperand
(unsigned i_nocapture, Value *Val_nocapture) { (static_cast<
void> (0)); OperandTraits<BinaryOperator>::op_begin(
this)[i_nocapture] = Val_nocapture; } unsigned BinaryOperator
::getNumOperands() const { return OperandTraits<BinaryOperator
>::operands(this); } template <int Idx_nocapture> Use
 &BinaryOperator::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
BinaryOperator::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

420//===----------------------------------------------------------------------===//
421//                               CastInst Class
422//===----------------------------------------------------------------------===//

424/// This is the base class for all instructions that perform data
425/// casts. It is simply provided so that instruction category testing
426/// can be performed with code like:
427///
428/// if (isa<CastInst>(Instr)) { ... }
429/// Base class of casting instructions.
430class CastInst : public UnaryInstruction {
431protected:
/// Constructor with insert-before-instruction semantics for subclasses
CastInst(Type *Ty, unsigned iType, Value *S,
         const Twine &NameStr = "", Instruction *InsertBefore = nullptr)
  : UnaryInstruction(Ty, iType, S, InsertBefore) {
  setName(NameStr);
}
/// Constructor with insert-at-end-of-block semantics for subclasses
CastInst(Type *Ty, unsigned iType, Value *S,
         const Twine &NameStr, BasicBlock *InsertAtEnd)
  : UnaryInstruction(Ty, iType, S, InsertAtEnd) {
  setName(NameStr);
}

445public:
/// Provides a way to construct any of the CastInst subclasses using an
/// opcode instead of the subclass's constructor. The opcode must be in the
/// CastOps category (Instruction::isCast(opcode) returns true). This
/// constructor has insert-before-instruction semantics to automatically
/// insert the new CastInst before InsertBefore (if it is non-null).
/// Construct any of the CastInst subclasses
static CastInst *Create(
  Instruction::CastOps,    ///< The opcode of the cast instruction
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);
/// Provides a way to construct any of the CastInst subclasses using an
/// opcode instead of the subclass's constructor. The opcode must be in the
/// CastOps category. This constructor has insert-at-end-of-block semantics
/// to automatically insert the new CastInst at the end of InsertAtEnd (if
/// its non-null).
/// Construct any of the CastInst subclasses
static CastInst *Create(
  Instruction::CastOps,    ///< The opcode for the cast instruction
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a ZExt or BitCast cast instruction
static CastInst *CreateZExtOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a ZExt or BitCast cast instruction
static CastInst *CreateZExtOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a SExt or BitCast cast instruction
static CastInst *CreateSExtOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a SExt or BitCast cast instruction
static CastInst *CreateSExtOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a BitCast AddrSpaceCast, or a PtrToInt cast instruction.
static CastInst *CreatePointerCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a BitCast, AddrSpaceCast or a PtrToInt cast instruction.
static CastInst *CreatePointerCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a BitCast or an AddrSpaceCast cast instruction.
static CastInst *CreatePointerBitCastOrAddrSpaceCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a BitCast or an AddrSpaceCast cast instruction.
static CastInst *CreatePointerBitCastOrAddrSpaceCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a BitCast, a PtrToInt, or an IntToPTr cast instruction.
///
/// If the value is a pointer type and the destination an integer type,
/// creates a PtrToInt cast. If the value is an integer type and the
/// destination a pointer type, creates an IntToPtr cast. Otherwise, creates
/// a bitcast.
static CastInst *CreateBitOrPointerCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a ZExt, BitCast, or Trunc for int -> int casts.
static CastInst *CreateIntegerCast(
  Value *S,                ///< The pointer value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  bool isSigned,           ///< Whether to regard S as signed or not
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a ZExt, BitCast, or Trunc for int -> int casts.
static CastInst *CreateIntegerCast(
  Value *S,                ///< The integer value to be casted (operand 0)
  Type *Ty,          ///< The integer type to which operand is casted
  bool isSigned,           ///< Whether to regard S as signed or not
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create an FPExt, BitCast, or FPTrunc for fp -> fp casts
static CastInst *CreateFPCast(
  Value *S,                ///< The floating point value to be casted
  Type *Ty,          ///< The floating point type to cast to
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create an FPExt, BitCast, or FPTrunc for fp -> fp casts
static CastInst *CreateFPCast(
  Value *S,                ///< The floating point value to be casted
  Type *Ty,          ///< The floating point type to cast to
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Create a Trunc or BitCast cast instruction
static CastInst *CreateTruncOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which cast should be made
  const Twine &Name = "", ///< Name for the instruction
  Instruction *InsertBefore = nullptr ///< Place to insert the instruction
);

/// Create a Trunc or BitCast cast instruction
static CastInst *CreateTruncOrBitCast(
  Value *S,                ///< The value to be casted (operand 0)
  Type *Ty,          ///< The type to which operand is casted
  const Twine &Name, ///< The name for the instruction
  BasicBlock *InsertAtEnd  ///< The block to insert the instruction into
);

/// Check whether a bitcast between these types is valid
static bool isBitCastable(
  Type *SrcTy, ///< The Type from which the value should be cast.
  Type *DestTy ///< The Type to which the value should be cast.
);

/// Check whether a bitcast, inttoptr, or ptrtoint cast between these
/// types is valid and a no-op.
///
/// This ensures that any pointer<->integer cast has enough bits in the
/// integer and any other cast is a bitcast.
static bool isBitOrNoopPointerCastable(
    Type *SrcTy,  ///< The Type from which the value should be cast.
    Type *DestTy, ///< The Type to which the value should be cast.
    const DataLayout &DL);

/// Returns the opcode necessary to cast Val into Ty using usual casting
/// rules.
/// Infer the opcode for cast operand and type
static Instruction::CastOps getCastOpcode(
  const Value *Val, ///< The value to cast
  bool SrcIsSigned, ///< Whether to treat the source as signed
  Type *Ty,   ///< The Type to which the value should be casted
  bool DstIsSigned  ///< Whether to treate the dest. as signed
);

/// There are several places where we need to know if a cast instruction
/// only deals with integer source and destination types. To simplify that
/// logic, this method is provided.
/// @returns true iff the cast has only integral typed operand and dest type.
/// Determine if this is an integer-only cast.
bool isIntegerCast() const;

/// A lossless cast is one that does not alter the basic value. It implies
/// a no-op cast but is more stringent, preventing things like int->float,
/// long->double, or int->ptr.
/// @returns true iff the cast is lossless.
/// Determine if this is a lossless cast.
bool isLosslessCast() const;

/// A no-op cast is one that can be effected without changing any bits.
/// It implies that the source and destination types are the same size. The
/// DataLayout argument is to determine the pointer size when examining casts
/// involving Integer and Pointer types. They are no-op casts if the integer
/// is the same size as the pointer. However, pointer size varies with
/// platform.  Note that a precondition of this method is that the cast is
/// legal - i.e. the instruction formed with these operands would verify.
static bool isNoopCast(
  Instruction::CastOps Opcode, ///< Opcode of cast
  Type *SrcTy,         ///< SrcTy of cast
  Type *DstTy,         ///< DstTy of cast
  const DataLayout &DL ///< DataLayout to get the Int Ptr type from.
);

/// Determine if this cast is a no-op cast.
///
/// \param DL is the DataLayout to determine pointer size.
bool isNoopCast(const DataLayout &DL) const;

/// Determine how a pair of casts can be eliminated, if they can be at all.
/// This is a helper function for both CastInst and ConstantExpr.
/// @returns 0 if the CastInst pair can't be eliminated, otherwise
/// returns Instruction::CastOps value for a cast that can replace
/// the pair, casting SrcTy to DstTy.
/// Determine if a cast pair is eliminable
static unsigned isEliminableCastPair(
  Instruction::CastOps firstOpcode,  ///< Opcode of first cast
  Instruction::CastOps secondOpcode, ///< Opcode of second cast
  Type *SrcTy, ///< SrcTy of 1st cast
  Type *MidTy, ///< DstTy of 1st cast & SrcTy of 2nd cast
  Type *DstTy, ///< DstTy of 2nd cast
  Type *SrcIntPtrTy, ///< Integer type corresponding to Ptr SrcTy, or null
  Type *MidIntPtrTy, ///< Integer type corresponding to Ptr MidTy, or null
  Type *DstIntPtrTy  ///< Integer type corresponding to Ptr DstTy, or null
);

/// Return the opcode of this CastInst
Instruction::CastOps getOpcode() const {
  return Instruction::CastOps(Instruction::getOpcode());
}

/// Return the source type, as a convenience
Type* getSrcTy() const { return getOperand(0)->getType(); }
/// Return the destination type, as a convenience
Type* getDestTy() const { return getType(); }

/// This method can be used to determine if a cast from SrcTy to DstTy using
/// Opcode op is valid or not.
/// @returns true iff the proposed cast is valid.
/// Determine if a cast is valid without creating one.
static bool castIsValid(Instruction::CastOps op, Type *SrcTy, Type *DstTy);
static bool castIsValid(Instruction::CastOps op, Value *S, Type *DstTy) {
  return castIsValid(op, S->getType(), DstTy);
}

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

704//===----------------------------------------------------------------------===//
705//                               CmpInst Class
706//===----------------------------------------------------------------------===//

708/// This class is the base class for the comparison instructions.
709/// Abstract base class of comparison instructions.
710class CmpInst : public Instruction {
711public:
/// This enumeration lists the possible predicates for CmpInst subclasses.
/// Values in the range 0-31 are reserved for FCmpInst, while values in the
/// range 32-64 are reserved for ICmpInst. This is necessary to ensure the
/// predicate values are not overlapping between the classes.
///
/// Some passes (e.g. InstCombine) depend on the bit-wise characteristics of
/// FCMP_* values. Changing the bit patterns requires a potential change to
/// those passes.
enum Predicate : unsigned {
  // Opcode            U L G E    Intuitive operation
  FCMP_FALSE = 0, ///< 0 0 0 0    Always false (always folded)
  FCMP_OEQ = 1,   ///< 0 0 0 1    True if ordered and equal
  FCMP_OGT = 2,   ///< 0 0 1 0    True if ordered and greater than
  FCMP_OGE = 3,   ///< 0 0 1 1    True if ordered and greater than or equal
  FCMP_OLT = 4,   ///< 0 1 0 0    True if ordered and less than
  FCMP_OLE = 5,   ///< 0 1 0 1    True if ordered and less than or equal
  FCMP_ONE = 6,   ///< 0 1 1 0    True if ordered and operands are unequal
  FCMP_ORD = 7,   ///< 0 1 1 1    True if ordered (no nans)
  FCMP_UNO = 8,   ///< 1 0 0 0    True if unordered: isnan(X) | isnan(Y)
  FCMP_UEQ = 9,   ///< 1 0 0 1    True if unordered or equal
  FCMP_UGT = 10,  ///< 1 0 1 0    True if unordered or greater than
  FCMP_UGE = 11,  ///< 1 0 1 1    True if unordered, greater than, or equal
  FCMP_ULT = 12,  ///< 1 1 0 0    True if unordered or less than
  FCMP_ULE = 13,  ///< 1 1 0 1    True if unordered, less than, or equal
  FCMP_UNE = 14,  ///< 1 1 1 0    True if unordered or not equal
  FCMP_TRUE = 15, ///< 1 1 1 1    Always true (always folded)
  FIRST_FCMP_PREDICATE = FCMP_FALSE,
  LAST_FCMP_PREDICATE = FCMP_TRUE,
  BAD_FCMP_PREDICATE = FCMP_TRUE + 1,
  ICMP_EQ = 32,  ///< equal
  ICMP_NE = 33,  ///< not equal
  ICMP_UGT = 34, ///< unsigned greater than
  ICMP_UGE = 35, ///< unsigned greater or equal
  ICMP_ULT = 36, ///< unsigned less than
  ICMP_ULE = 37, ///< unsigned less or equal
  ICMP_SGT = 38, ///< signed greater than
  ICMP_SGE = 39, ///< signed greater or equal
  ICMP_SLT = 40, ///< signed less than
  ICMP_SLE = 41, ///< signed less or equal
  FIRST_ICMP_PREDICATE = ICMP_EQ,
  LAST_ICMP_PREDICATE = ICMP_SLE,
  BAD_ICMP_PREDICATE = ICMP_SLE + 1
};
using PredicateField =
    Bitfield::Element<Predicate, 0, 6, LAST_ICMP_PREDICATE>;

758protected:
CmpInst(Type *ty, Instruction::OtherOps op, Predicate pred,
        Value *LHS, Value *RHS, const Twine &Name = "",
        Instruction *InsertBefore = nullptr,
        Instruction *FlagsSource = nullptr);

CmpInst(Type *ty, Instruction::OtherOps op, Predicate pred,
        Value *LHS, Value *RHS, const Twine &Name,
        BasicBlock *InsertAtEnd);

768public:
// 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); }

/// Construct a compare instruction, given the opcode, the predicate and
/// the two operands.  Optionally (if InstBefore is specified) insert the
/// instruction into a BasicBlock right before the specified instruction.
/// The specified Instruction is allowed to be a dereferenced end iterator.
/// Create a CmpInst
static CmpInst *Create(OtherOps Op,
                       Predicate predicate, Value *S1,
                       Value *S2, const Twine &Name = "",
                       Instruction *InsertBefore = nullptr);

/// Construct a compare instruction, given the opcode, the predicate and the
/// two operands.  Also automatically insert this instruction to the end of
/// the BasicBlock specified.
/// Create a CmpInst
static CmpInst *Create(OtherOps Op, Predicate predicate, Value *S1,
                       Value *S2, const Twine &Name, BasicBlock *InsertAtEnd);

/// Get the opcode casted to the right type
OtherOps getOpcode() const {
  return static_cast<OtherOps>(Instruction::getOpcode());
}

/// Return the predicate for this instruction.
Predicate getPredicate() const { return getSubclassData<PredicateField>(); }

/// Set the predicate for this instruction to the specified value.
void setPredicate(Predicate P) { setSubclassData<PredicateField>(P); }

static bool isFPPredicate(Predicate P) {
  static_assert(FIRST_FCMP_PREDICATE == 0,
                "FIRST_FCMP_PREDICATE is required to be 0");
  return P <= LAST_FCMP_PREDICATE;
}

static bool isIntPredicate(Predicate P) {
  return P >= FIRST_ICMP_PREDICATE && P <= LAST_ICMP_PREDICATE;
}

static StringRef getPredicateName(Predicate P);

bool isFPPredicate() const { return isFPPredicate(getPredicate()); }
bool isIntPredicate() const { return isIntPredicate(getPredicate()); }

/// For example, EQ -> NE, UGT -> ULE, SLT -> SGE,
///              OEQ -> UNE, UGT -> OLE, OLT -> UGE, etc.
/// @returns the inverse predicate for the instruction's current predicate.
/// Return the inverse of the instruction's predicate.
Predicate getInversePredicate() const {
  return getInversePredicate(getPredicate());
}

/// For example, EQ -> NE, UGT -> ULE, SLT -> SGE,
///              OEQ -> UNE, UGT -> OLE, OLT -> UGE, etc.
/// @returns the inverse predicate for predicate provided in \p pred.
/// Return the inverse of a given predicate
static Predicate getInversePredicate(Predicate pred);

/// For example, EQ->EQ, SLE->SGE, ULT->UGT,
///              OEQ->OEQ, ULE->UGE, OLT->OGT, etc.
/// @returns the predicate that would be the result of exchanging the two
/// operands of the CmpInst instruction without changing the result
/// produced.
/// Return the predicate as if the operands were swapped
Predicate getSwappedPredicate() const {
  return getSwappedPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction
/// available.
/// Return the predicate as if the operands were swapped.
static Predicate getSwappedPredicate(Predicate pred);

/// This is a static version that you can use without an instruction
/// available.
/// @returns true if the comparison predicate is strict, false otherwise.
static bool isStrictPredicate(Predicate predicate);

/// @returns true if the comparison predicate is strict, false otherwise.
/// Determine if this instruction is using an strict comparison predicate.
bool isStrictPredicate() const { return isStrictPredicate(getPredicate()); }

/// This is a static version that you can use without an instruction
/// available.
/// @returns true if the comparison predicate is non-strict, false otherwise.
static bool isNonStrictPredicate(Predicate predicate);

/// @returns true if the comparison predicate is non-strict, false otherwise.
/// Determine if this instruction is using an non-strict comparison predicate.
bool isNonStrictPredicate() const {
  return isNonStrictPredicate(getPredicate());
}

/// For example, SGE -> SGT, SLE -> SLT, ULE -> ULT, UGE -> UGT.
/// Returns the strict version of non-strict comparisons.
Predicate getStrictPredicate() const {
  return getStrictPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction
/// available.
/// @returns the strict version of comparison provided in \p pred.
/// If \p pred is not a strict comparison predicate, returns \p pred.
/// Returns the strict version of non-strict comparisons.
static Predicate getStrictPredicate(Predicate pred);

/// For example, SGT -> SGE, SLT -> SLE, ULT -> ULE, UGT -> UGE.
/// Returns the non-strict version of strict comparisons.
Predicate getNonStrictPredicate() const {
  return getNonStrictPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction
/// available.
/// @returns the non-strict version of comparison provided in \p pred.
/// If \p pred is not a strict comparison predicate, returns \p pred.
/// Returns the non-strict version of strict comparisons.
static Predicate getNonStrictPredicate(Predicate pred);

/// This is a static version that you can use without an instruction
/// available.
/// Return the flipped strictness of predicate
static Predicate getFlippedStrictnessPredicate(Predicate pred);

/// For predicate of kind "is X or equal to 0" returns the predicate "is X".
/// For predicate of kind "is X" returns the predicate "is X or equal to 0".
/// does not support other kind of predicates.
/// @returns the predicate that does not contains is equal to zero if
/// it had and vice versa.
/// Return the flipped strictness of predicate
Predicate getFlippedStrictnessPredicate() const {
  return getFlippedStrictnessPredicate(getPredicate());
}

/// 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;

/// This is just a convenience that dispatches to the subclasses.
/// Swap the operands and adjust predicate accordingly to retain
/// the same comparison.
void swapOperands();

/// This is just a convenience that dispatches to the subclasses.
/// Determine if this CmpInst is commutative.
bool isCommutative() const;

/// Determine if this is an equals/not equals predicate.
/// This is a static version that you can use without an instruction
/// available.
static bool isEquality(Predicate pred);

/// Determine if this is an equals/not equals predicate.
bool isEquality() const { return isEquality(getPredicate()); }

/// 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 relational (not EQ or NE).
bool isRelational() const { return !isEquality(); }

/// @returns true if the comparison is signed, false otherwise.
/// Determine if this instruction is using a signed comparison.
bool isSigned() const {
  return isSigned(getPredicate());
}

/// @returns true if the comparison is unsigned, false otherwise.
/// Determine if this instruction is using an unsigned comparison.
bool isUnsigned() const {
  return isUnsigned(getPredicate());
}

/// For example, ULT->SLT, ULE->SLE, UGT->SGT, UGE->SGE, SLT->Failed assert
/// @returns the signed version of the unsigned predicate pred.
/// return the signed version of a predicate
static Predicate getSignedPredicate(Predicate pred);

/// For example, ULT->SLT, ULE->SLE, UGT->SGT, UGE->SGE, SLT->Failed assert
/// @returns the signed version of the predicate for this instruction (which
/// has to be an unsigned predicate).
/// return the signed version of a predicate
Predicate getSignedPredicate() {
  return getSignedPredicate(getPredicate());
}

/// For example, SLT->ULT, SLE->ULE, SGT->UGT, SGE->UGE, ULT->Failed assert
/// @returns the unsigned version of the signed predicate pred.
static Predicate getUnsignedPredicate(Predicate pred);

/// For example, SLT->ULT, SLE->ULE, SGT->UGT, SGE->UGE, ULT->Failed assert
/// @returns the unsigned version of the predicate for this instruction (which
/// has to be an signed predicate).
/// return the unsigned version of a predicate
Predicate getUnsignedPredicate() {
  return getUnsignedPredicate(getPredicate());
}

/// For example, SLT->ULT, ULT->SLT, SLE->ULE, ULE->SLE, EQ->Failed assert
/// @returns the unsigned version of the signed predicate pred or
///          the signed version of the signed predicate pred.
static Predicate getFlippedSignednessPredicate(Predicate pred);

/// For example, SLT->ULT, ULT->SLT, SLE->ULE, ULE->SLE, EQ->Failed assert
/// @returns the unsigned version of the signed predicate pred or
///          the signed version of the signed predicate pred.
Predicate getFlippedSignednessPredicate() {
  return getFlippedSignednessPredicate(getPredicate());
}

/// This is just a convenience.
/// Determine if this is true when both operands are the same.
bool isTrueWhenEqual() const {
  return isTrueWhenEqual(getPredicate());
}

/// This is just a convenience.
/// Determine if this is false when both operands are the same.
bool isFalseWhenEqual() const {
  return isFalseWhenEqual(getPredicate());
}

/// @returns true if the predicate is unsigned, false otherwise.
/// Determine if the predicate is an unsigned operation.
static bool isUnsigned(Predicate predicate);

/// @returns true if the predicate is signed, false otherwise.
/// Determine if the predicate is an signed operation.
static bool isSigned(Predicate predicate);

/// Determine if the predicate is an ordered operation.
static bool isOrdered(Predicate predicate);

/// Determine if the predicate is an unordered operation.
static bool isUnordered(Predicate predicate);

/// Determine if the predicate is true when comparing a value with itself.
static bool isTrueWhenEqual(Predicate predicate);

/// Determine if the predicate is false when comparing a value with itself.
static bool isFalseWhenEqual(Predicate predicate);

/// Determine if Pred1 implies Pred2 is true when two compares have matching
/// operands.
static bool isImpliedTrueByMatchingCmp(Predicate Pred1, Predicate Pred2);

/// Determine if Pred1 implies Pred2 is false when two compares have matching
/// operands.
static bool isImpliedFalseByMatchingCmp(Predicate Pred1, Predicate Pred2);

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

/// Create a result type for fcmp/icmp
static Type* makeCmpResultType(Type* opnd_type) {
  if (VectorType* vt = dyn_cast<VectorType>(opnd_type)) {
    return VectorType::get(Type::getInt1Ty(opnd_type->getContext()),
                           vt->getElementCount());
  }
  return Type::getInt1Ty(opnd_type->getContext());
}

1039private:
// Shadow Value::setValueSubclassData with a private forwarding method so that
// subclasses cannot accidentally use it.
void setValueSubclassData(unsigned short D) {
  Value::setValueSubclassData(D);
}
1045};

1047// FIXME: these are redundant if CmpInst < BinaryOperator
1048template <>
1049struct OperandTraits<CmpInst> : public FixedNumOperandTraits<CmpInst, 2> {
1050};

1052DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CmpInst, Value)CmpInst::op_iterator CmpInst::op_begin() { return OperandTraits
<CmpInst>::op_begin(this); } CmpInst::const_op_iterator
 CmpInst::op_begin() const { return OperandTraits<CmpInst>
::op_begin(const_cast<CmpInst*>(this)); } CmpInst::op_iterator
 CmpInst::op_end() { return OperandTraits<CmpInst>::op_end
(this); } CmpInst::const_op_iterator CmpInst::op_end() const {
 return OperandTraits<CmpInst>::op_end(const_cast<CmpInst
*>(this)); } Value *CmpInst::getOperand(unsigned i_nocapture
) const { (static_cast<void> (0)); return cast_or_null<
Value>( OperandTraits<CmpInst>::op_begin(const_cast<
CmpInst*>(this))[i_nocapture].get()); } void CmpInst::setOperand
(unsigned i_nocapture, Value *Val_nocapture) { (static_cast<
void> (0)); OperandTraits<CmpInst>::op_begin(this)[i_nocapture
] = Val_nocapture; } unsigned CmpInst::getNumOperands() const
 { return OperandTraits<CmpInst>::operands(this); } template
 <int Idx_nocapture> Use &CmpInst::Op() { return this
->OpFrom<Idx_nocapture>(this); } template <int Idx_nocapture
> const Use &CmpInst::Op() const { return this->OpFrom
<Idx_nocapture>(this); }

1054/// A lightweight accessor for an operand bundle meant to be passed
1055/// around by value.
1056struct OperandBundleUse {
ArrayRef<Use> Inputs;

OperandBundleUse() = default;
explicit OperandBundleUse(StringMapEntry<uint32_t> *Tag, ArrayRef<Use> Inputs)
    : Inputs(Inputs), Tag(Tag) {}

/// Return true if the operand at index \p Idx in this operand bundle
/// has the attribute A.
bool operandHasAttr(unsigned Idx, Attribute::AttrKind A) const {
  if (isDeoptOperandBundle())
    if (A == Attribute::ReadOnly || A == Attribute::NoCapture)
      return Inputs[Idx]->getType()->isPointerTy();

  // Conservative answer:  no operands have any attributes.
  return false;
}

/// Return the tag of this operand bundle as a string.
StringRef getTagName() const {
  return Tag->getKey();
}

/// Return the tag of this operand bundle as an integer.
///
/// Operand bundle tags are interned by LLVMContextImpl::getOrInsertBundleTag,
/// and this function returns the unique integer getOrInsertBundleTag
/// associated the tag of this operand bundle to.
uint32_t getTagID() const {
  return Tag->getValue();
}

/// Return true if this is a "deopt" operand bundle.
bool isDeoptOperandBundle() const {
  return getTagID() == LLVMContext::OB_deopt;
}

/// Return true if this is a "funclet" operand bundle.
bool isFuncletOperandBundle() const {
  return getTagID() == LLVMContext::OB_funclet;
}

/// Return true if this is a "cfguardtarget" operand bundle.
bool isCFGuardTargetOperandBundle() const {
  return getTagID() == LLVMContext::OB_cfguardtarget;
}

1103private:
/// Pointer to an entry in LLVMContextImpl::getOrInsertBundleTag.
StringMapEntry<uint32_t> *Tag;
1106};

1108/// A container for an operand bundle being viewed as a set of values
1109/// rather than a set of uses.
1110///
1111/// Unlike OperandBundleUse, OperandBundleDefT owns the memory it carries, and
1112/// so it is possible to create and pass around "self-contained" instances of
1113/// OperandBundleDef and ConstOperandBundleDef.
1114template <typename InputTy> class OperandBundleDefT {
std::string Tag;
std::vector<InputTy> Inputs;

1118public:
explicit OperandBundleDefT(std::string Tag, std::vector<InputTy> Inputs)
    : Tag(std::move(Tag)), Inputs(std::move(Inputs)) {}
explicit OperandBundleDefT(std::string Tag, ArrayRef<InputTy> Inputs)
    : Tag(std::move(Tag)), Inputs(Inputs) {}

explicit OperandBundleDefT(const OperandBundleUse &OBU) {
  Tag = std::string(OBU.getTagName());
  llvm::append_range(Inputs, OBU.Inputs);
}

ArrayRef<InputTy> inputs() const { return Inputs; }

using input_iterator = typename std::vector<InputTy>::const_iterator;

size_t input_size() const { return Inputs.size(); }
input_iterator input_begin() const { return Inputs.begin(); }
input_iterator input_end() const { return Inputs.end(); }

StringRef getTag() const { return Tag; }
1138};

1140using OperandBundleDef = OperandBundleDefT<Value *>;
1141using ConstOperandBundleDef = OperandBundleDefT<const Value *>;

1143//===----------------------------------------------------------------------===//
1144//                               CallBase Class
1145//===----------------------------------------------------------------------===//

1147/// Base class for all callable instructions (InvokeInst and CallInst)
1148/// Holds everything related to calling a function.
1149///
1150/// All call-like instructions are required to use a common operand layout:
1151/// - Zero or more arguments to the call,
1152/// - Zero or more operand bundles with zero or more operand inputs each
1153///   bundle,
1154/// - Zero or more subclass controlled operands
1155/// - The called function.
1156///
1157/// This allows this base class to easily access the called function and the
1158/// start of the arguments without knowing how many other operands a particular
1159/// subclass requires. Note that accessing the end of the argument list isn't
1160/// as cheap as most other operations on the base class.
1161class CallBase : public Instruction {
1162protected:
// The first two bits are reserved by CallInst for fast retrieval,
using CallInstReservedField = Bitfield::Element<unsigned, 0, 2>;
using CallingConvField =
    Bitfield::Element<CallingConv::ID, CallInstReservedField::NextBit, 10,
                      CallingConv::MaxID>;
static_assert(
    Bitfield::areContiguous<CallInstReservedField, CallingConvField>(),
    "Bitfields must be contiguous");

/// The last operand is the called operand.
static constexpr int CalledOperandOpEndIdx = -1;

AttributeList Attrs; ///< parameter attributes for callable
FunctionType *FTy;

template <class... ArgsTy>
CallBase(AttributeList const &A, FunctionType *FT, ArgsTy &&... Args)
    : Instruction(std::forward<ArgsTy>(Args)...), Attrs(A), FTy(FT) {}

using Instruction::Instruction;

bool hasDescriptor() const { return Value::HasDescriptor; }

unsigned getNumSubclassExtraOperands() const {
  switch (getOpcode()) {
  case Instruction::Call:
    return 0;
  case Instruction::Invoke:
    return 2;
  case Instruction::CallBr:
    return getNumSubclassExtraOperandsDynamic();
  }
  llvm_unreachable("Invalid opcode!")__builtin_unreachable();
}

/// Get the number of extra operands for instructions that don't have a fixed
/// number of extra operands.
unsigned getNumSubclassExtraOperandsDynamic() const;

1202public:
using Instruction::getContext;

/// Create a clone of \p CB with a different set of operand bundles and
/// insert it before \p InsertPt.
///
/// The returned call instruction is identical \p CB in every way except that
/// the operand bundles for the new instruction are set to the operand bundles
/// in \p Bundles.
static CallBase *Create(CallBase *CB, ArrayRef<OperandBundleDef> Bundles,
                        Instruction *InsertPt = nullptr);

/// Create a clone of \p CB with the operand bundle with the tag matching
/// \p Bundle's tag replaced with Bundle, and insert it before \p InsertPt.
///
/// The returned call instruction is identical \p CI in every way except that
/// the specified operand bundle has been replaced.
static CallBase *Create(CallBase *CB,
                        OperandBundleDef Bundle,
                        Instruction *InsertPt = nullptr);

/// Create a clone of \p CB with operand bundle \p OB added.
static CallBase *addOperandBundle(CallBase *CB, uint32_t ID,
                                  OperandBundleDef OB,
                                  Instruction *InsertPt = nullptr);

/// Create a clone of \p CB with operand bundle \p ID removed.
static CallBase *removeOperandBundle(CallBase *CB, uint32_t ID,
                                     Instruction *InsertPt = nullptr);

static bool classof(const Instruction *I) {
  return I->getOpcode() == Instruction::Call ||
         I->getOpcode() == Instruction::Invoke ||
         I->getOpcode() == Instruction::CallBr;
}
static bool classof(const Value *V) {
  return isa<Instruction>(V) && classof(cast<Instruction>(V));
}

FunctionType *getFunctionType() const { return FTy; }

void mutateFunctionType(FunctionType *FTy) {
  Value::mutateType(FTy->getReturnType());
  this->FTy = FTy;
}

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;

/// data_operands_begin/data_operands_end - Return iterators iterating over
/// the call / invoke argument list and bundle operands.  For invokes, this is
/// the set of instruction operands except the invoke target and the two
/// successor blocks; and for calls this is the set of instruction operands
/// except the call target.
User::op_iterator data_operands_begin() { return op_begin(); }
User::const_op_iterator data_operands_begin() const {
  return const_cast<CallBase *>(this)->data_operands_begin();
}
User::op_iterator data_operands_end() {
  // Walk from the end of the operands over the called operand and any
  // subclass operands.
  return op_end() - getNumSubclassExtraOperands() - 1;
}
User::const_op_iterator data_operands_end() const {
  return const_cast<CallBase *>(this)->data_operands_end();
}
iterator_range<User::op_iterator> data_ops() {
  return make_range(data_operands_begin(), data_operands_end());
}
iterator_range<User::const_op_iterator> data_ops() const {
  return make_range(data_operands_begin(), data_operands_end());
}
bool data_operands_empty() const {
  return data_operands_end() == data_operands_begin();
}
unsigned data_operands_size() const {
  return std::distance(data_operands_begin(), data_operands_end());
}

bool isDataOperand(const Use *U) const {
  assert(this == U->getUser() &&(static_cast<void> (0))
         "Only valid to query with a use of this instruction!")(static_cast<void> (0));
  return data_operands_begin() <= U && U < data_operands_end();
}
bool isDataOperand(Value::const_user_iterator UI) const {
  return isDataOperand(&UI.getUse());
}

/// Given a value use iterator, return the data operand corresponding to it.
/// Iterator must actually correspond to a data operand.
unsigned getDataOperandNo(Value::const_user_iterator UI) const {
  return getDataOperandNo(&UI.getUse());
}

/// Given a use for a data operand, get the data operand number that
/// corresponds to it.
unsigned getDataOperandNo(const Use *U) const {
  assert(isDataOperand(U) && "Data operand # out of range!")(static_cast<void> (0));
  return U - data_operands_begin();
}

/// Return the iterator pointing to the beginning of the argument list.
User::op_iterator arg_begin() { return op_begin(); }
User::const_op_iterator arg_begin() const {
  return const_cast<CallBase *>(this)->arg_begin();
}

/// Return the iterator pointing to the end of the argument list.
User::op_iterator arg_end() {
  // From the end of the data operands, walk backwards past the bundle
  // operands.
  return data_operands_end() - getNumTotalBundleOperands();
}
User::const_op_iterator arg_end() const {
  return const_cast<CallBase *>(this)->arg_end();
}

/// Iteration adapter for range-for loops.
iterator_range<User::op_iterator> args() {
  return make_range(arg_begin(), arg_end());
}
iterator_range<User::const_op_iterator> args() const {
  return make_range(arg_begin(), arg_end());
}
bool arg_empty() const { return arg_end() == arg_begin(); }
unsigned arg_size() const { return arg_end() - arg_begin(); }

// Legacy API names that duplicate the above and will be removed once users
// are migrated.
iterator_range<User::op_iterator> arg_operands() {
  return make_range(arg_begin(), arg_end());
}
iterator_range<User::const_op_iterator> arg_operands() const {
  return make_range(arg_begin(), arg_end());
}
unsigned getNumArgOperands() const { return arg_size(); }

Value *getArgOperand(unsigned i) const {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast<void> (0));
  return getOperand(i);
}

void setArgOperand(unsigned i, Value *v) {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast<void> (0));
  setOperand(i, v);
}

/// Wrappers for getting the \c Use of a call argument.
const Use &getArgOperandUse(unsigned i) const {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast<void> (0));
  return User::getOperandUse(i);
}
Use &getArgOperandUse(unsigned i) {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast<void> (0));
  return User::getOperandUse(i);
}

bool isArgOperand(const Use *U) const {
  assert(this == U->getUser() &&(static_cast<void> (0))
         "Only valid to query with a use of this instruction!")(static_cast<void> (0));
  return arg_begin() <= U && U < arg_end();
}
bool isArgOperand(Value::const_user_iterator UI) const {
  return isArgOperand(&UI.getUse());
}

/// Given a use for a arg operand, get the arg operand number that
/// corresponds to it.
unsigned getArgOperandNo(const Use *U) const {
  assert(isArgOperand(U) && "Arg operand # out of range!")(static_cast<void> (0));
  return U - arg_begin();
}

/// Given a value use iterator, return the arg operand number corresponding to
/// it. Iterator must actually correspond to a data operand.
unsigned getArgOperandNo(Value::const_user_iterator UI) const {
  return getArgOperandNo(&UI.getUse());
}

/// Returns true if this CallSite passes the given Value* as an argument to
/// the called function.
bool hasArgument(const Value *V) const {
  return llvm::is_contained(args(), V);
}

Value *getCalledOperand() const { return Op<CalledOperandOpEndIdx>(); }

const Use &getCalledOperandUse() const { return Op<CalledOperandOpEndIdx>(); }
Use &getCalledOperandUse() { return Op<CalledOperandOpEndIdx>(); }

/// Returns the function called, or null if this is an
/// indirect function invocation.
Function *getCalledFunction() const {
  return dyn_cast_or_null<Function>(getCalledOperand());
}

/// Return true if the callsite is an indirect call.
bool isIndirectCall() const;

/// Determine whether the passed iterator points to the callee operand's Use.
bool isCallee(Value::const_user_iterator UI) const {
  return isCallee(&UI.getUse());
}

/// Determine whether this Use is the callee operand's Use.
bool isCallee(const Use *U) const { return &getCalledOperandUse() == U; }

/// Helper to get the caller (the parent function).
Function *getCaller();
const Function *getCaller() const {
  return const_cast<CallBase *>(this)->getCaller();
}

/// Tests if this call site must be tail call optimized. Only a CallInst can
/// be tail call optimized.
bool isMustTailCall() const;

/// Tests if this call site is marked as a tail call.
bool isTailCall() const;

/// Returns the intrinsic ID of the intrinsic called or
/// Intrinsic::not_intrinsic if the called function is not an intrinsic, or if
/// this is an indirect call.
Intrinsic::ID getIntrinsicID() const;

void setCalledOperand(Value *V) { Op<CalledOperandOpEndIdx>() = V; }

/// Sets the function called, including updating the function type.
void setCalledFunction(Function *Fn) {
  setCalledFunction(Fn->getFunctionType(), Fn);
}

/// Sets the function called, including updating the function type.
void setCalledFunction(FunctionCallee Fn) {
  setCalledFunction(Fn.getFunctionType(), Fn.getCallee());
}

/// Sets the function called, including updating to the specified function
/// type.
void setCalledFunction(FunctionType *FTy, Value *Fn) {
  this->FTy = FTy;
  assert(cast<PointerType>(Fn->getType())->isOpaqueOrPointeeTypeMatches(FTy))(static_cast<void> (0));
  // This function doesn't mutate the return type, only the function
  // type. Seems broken, but I'm just gonna stick an assert in for now.
  assert(getType() == FTy->getReturnType())(static_cast<void> (0));
  setCalledOperand(Fn);
}

CallingConv::ID getCallingConv() const {
  return getSubclassData<CallingConvField>();
}

void setCallingConv(CallingConv::ID CC) {
  setSubclassData<CallingConvField>(CC);
}

/// Check if this call is an inline asm statement.
bool isInlineAsm() const { return isa<InlineAsm>(getCalledOperand()); }

/// \name Attribute API
///
/// These methods access and modify attributes on this call (including
/// looking through to the attributes on the called function when necessary).
///@{

/// Return the parameter attributes for this call.
///
AttributeList getAttributes() const { return Attrs; }

/// Set the parameter attributes for this call.
///
void setAttributes(AttributeList A) { Attrs = A; }

/// Determine whether this call has the given attribute. If it does not
/// then determine if the called function has the attribute, but only if
/// the attribute is allowed for the call.
bool hasFnAttr(Attribute::AttrKind Kind) const {
  assert(Kind != Attribute::NoBuiltin &&(static_cast<void> (0))
         "Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin")(static_cast<void> (0));
  return hasFnAttrImpl(Kind);
}

/// Determine whether this call has the given attribute. If it does not
/// then determine if the called function has the attribute, but only if
/// the attribute is allowed for the call.
bool hasFnAttr(StringRef Kind) const { return hasFnAttrImpl(Kind); }

// TODO: remove non-AtIndex versions of these methods.
/// adds the attribute to the list of attributes.
void addAttributeAtIndex(unsigned i, Attribute::AttrKind Kind) {
  Attrs = Attrs.addAttributeAtIndex(getContext(), i, Kind);
}

/// adds the attribute to the list of attributes.
void addAttributeAtIndex(unsigned i, Attribute Attr) {
  Attrs = Attrs.addAttributeAtIndex(getContext(), i, Attr);
}

/// Adds the attribute to the function.
void addFnAttr(Attribute::AttrKind Kind) {
  Attrs = Attrs.addFnAttribute(getContext(), Kind);
}

/// Adds the attribute to the function.
void addFnAttr(Attribute Attr) {
  Attrs = Attrs.addFnAttribute(getContext(), Attr);
}

/// Adds the attribute to the return value.
void addRetAttr(Attribute::AttrKind Kind) {
  Attrs = Attrs.addRetAttribute(getContext(), Kind);
}

/// Adds the attribute to the return value.
void addRetAttr(Attribute Attr) {
  Attrs = Attrs.addRetAttribute(getContext(), Attr);
}

/// Adds the attribute to the indicated argument
void addParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  Attrs = Attrs.addParamAttribute(getContext(), ArgNo, Kind);
}

/// Adds the attribute to the indicated argument
void addParamAttr(unsigned ArgNo, Attribute Attr) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  Attrs = Attrs.addParamAttribute(getContext(), ArgNo, Attr);
}

/// removes the attribute from the list of attributes.
void removeAttributeAtIndex(unsigned i, Attribute::AttrKind Kind) {
  Attrs = Attrs.removeAttributeAtIndex(getContext(), i, Kind);
}

/// removes the attribute from the list of attributes.
void removeAttributeAtIndex(unsigned i, StringRef Kind) {
  Attrs = Attrs.removeAttributeAtIndex(getContext(), i, Kind);
}

/// Removes the attributes from the function
void removeFnAttrs(const AttrBuilder &AttrsToRemove) {
  Attrs = Attrs.removeFnAttributes(getContext(), AttrsToRemove);
}

/// Removes the attribute from the function
void removeFnAttr(Attribute::AttrKind Kind) {
  Attrs = Attrs.removeFnAttribute(getContext(), Kind);
}

/// Removes the attribute from the return value
void removeRetAttr(Attribute::AttrKind Kind) {
  Attrs = Attrs.removeRetAttribute(getContext(), Kind);
}

/// Removes the attributes from the return value
void removeRetAttrs(const AttrBuilder &AttrsToRemove) {
  Attrs = Attrs.removeRetAttributes(getContext(), AttrsToRemove);
}

/// Removes the attribute from the given argument
void removeParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  Attrs = Attrs.removeParamAttribute(getContext(), ArgNo, Kind);
}

/// Removes the attribute from the given argument
void removeParamAttr(unsigned ArgNo, StringRef Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  Attrs = Attrs.removeParamAttribute(getContext(), ArgNo, Kind);
}

/// Removes the attributes from the given argument
void removeParamAttrs(unsigned ArgNo, const AttrBuilder &AttrsToRemove) {
  Attrs = Attrs.removeParamAttributes(getContext(), ArgNo, AttrsToRemove);
}

/// adds the dereferenceable attribute to the list of attributes.
void addDereferenceableParamAttr(unsigned i, uint64_t Bytes) {
  Attrs = Attrs.addDereferenceableParamAttr(getContext(), i, Bytes);
}

/// adds the dereferenceable attribute to the list of attributes.
void addDereferenceableRetAttr(uint64_t Bytes) {
  Attrs = Attrs.addDereferenceableRetAttr(getContext(), Bytes);
}

/// Determine whether the return value has the given attribute.
bool hasRetAttr(Attribute::AttrKind Kind) const {
  return hasRetAttrImpl(Kind);
}
/// Determine whether the return value has the given attribute.
bool hasRetAttr(StringRef Kind) const { return hasRetAttrImpl(Kind); }

/// Determine whether the argument or parameter has the given attribute.
bool paramHasAttr(unsigned ArgNo, Attribute::AttrKind Kind) const;

/// Get the attribute of a given kind at a position.
Attribute getAttributeAtIndex(unsigned i, Attribute::AttrKind Kind) const {
  return getAttributes().getAttributeAtIndex(i, Kind);
}

/// Get the attribute of a given kind at a position.
Attribute getAttributeAtIndex(unsigned i, StringRef Kind) const {
  return getAttributes().getAttributeAtIndex(i, Kind);
}

/// Get the attribute of a given kind for the function.
Attribute getFnAttr(StringRef Kind) const {
  return getAttributes().getFnAttr(Kind);
}

/// Get the attribute of a given kind for the function.
Attribute getFnAttr(Attribute::AttrKind Kind) const {
  return getAttributes().getFnAttr(Kind);
}

/// Get the attribute of a given kind from a given arg
Attribute getParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) const {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  return getAttributes().getParamAttr(ArgNo, Kind);
}

/// Get the attribute of a given kind from a given arg
Attribute getParamAttr(unsigned ArgNo, StringRef Kind) const {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast<void> (0));
  return getAttributes().getParamAttr(ArgNo, Kind);
}

/// Return true if the data operand at index \p i has the attribute \p
/// A.
///
/// Data operands include call arguments and values used in operand bundles,
/// but does not include the callee operand.  This routine dispatches to the
/// underlying AttributeList or the OperandBundleUser as appropriate.
///
/// The index \p i is interpreted as
///
///  \p i == Attribute::ReturnIndex  -> the return value
///  \p i in [1, arg_size + 1)  -> argument number (\p i - 1)
///  \p i in [arg_size + 1, data_operand_size + 1) -> bundle operand at index
///     (\p i - 1) in the operand list.
bool dataOperandHasImpliedAttr(unsigned i, Attribute::AttrKind Kind) const {
  // Note that we have to add one because `i` isn't zero-indexed.
  assert(i < (getNumArgOperands() + getNumTotalBundleOperands() + 1) &&(static_cast<void> (0))
         "Data operand index out of bounds!")(static_cast<void> (0));

  // The attribute A can either be directly specified, if the operand in
  // question is a call argument; or be indirectly implied by the kind of its
  // containing operand bundle, if the operand is a bundle operand.

  if (i == AttributeList::ReturnIndex)
    return hasRetAttr(Kind);

  // FIXME: Avoid these i - 1 calculations and update the API to use
  // zero-based indices.
  if (i < (getNumArgOperands() + 1))
    return paramHasAttr(i - 1, Kind);

  assert(hasOperandBundles() && i >= (getBundleOperandsStartIndex() + 1) &&(static_cast<void> (0))
         "Must be either a call argument or an operand bundle!")(static_cast<void> (0));
  return bundleOperandHasAttr(i - 1, Kind);
}

/// Determine whether this data operand is not captured.
// FIXME: Once this API is no longer duplicated in `CallSite`, rename this to
// better indicate that this may return a conservative answer.
bool doesNotCapture(unsigned OpNo) const {
  return dataOperandHasImpliedAttr(OpNo + 1, Attribute::NoCapture);
}

/// Determine whether this argument is passed by value.
bool isByValArgument(unsigned ArgNo) const {
  return paramHasAttr(ArgNo, Attribute::ByVal);
}

/// Determine whether this argument is passed in an alloca.
bool isInAllocaArgument(unsigned ArgNo) const {
  return paramHasAttr(ArgNo, Attribute::InAlloca);
}

/// Determine whether this argument is passed by value, in an alloca, or is
/// preallocated.
bool isPassPointeeByValueArgument(unsigned ArgNo) const {
  return paramHasAttr(ArgNo, Attribute::ByVal) ||
         paramHasAttr(ArgNo, Attribute::InAlloca) ||
         paramHasAttr(ArgNo, Attribute::Preallocated);
}

/// Determine whether passing undef to this argument is undefined behavior.
/// If passing undef to this argument is UB, passing poison is UB as well
/// because poison is more undefined than undef.
bool isPassingUndefUB(unsigned ArgNo) const {
  return paramHasAttr(ArgNo, Attribute::NoUndef) ||
         // dereferenceable implies noundef.
         paramHasAttr(ArgNo, Attribute::Dereferenceable) ||
         // dereferenceable implies noundef, and null is a well-defined value.
         paramHasAttr(ArgNo, Attribute::DereferenceableOrNull);
}

/// Determine if there are is an inalloca argument. Only the last argument can
/// have the inalloca attribute.
bool hasInAllocaArgument() const {
  return !arg_empty() && paramHasAttr(arg_size() - 1, Attribute::InAlloca);
}

// FIXME: Once this API is no longer duplicated in `CallSite`, rename this to
// better indicate that this may return a conservative answer.
bool doesNotAccessMemory(unsigned OpNo) const {
  return dataOperandHasImpliedAttr(OpNo + 1, Attribute::ReadNone);
}

// FIXME: Once this API is no longer duplicated in `CallSite`, rename this to
// better indicate that this may return a conservative answer.
bool onlyReadsMemory(unsigned OpNo) const {
  return dataOperandHasImpliedAttr(OpNo + 1, Attribute::ReadOnly) ||
         dataOperandHasImpliedAttr(OpNo + 1, Attribute::ReadNone);
}

// FIXME: Once this API is no longer duplicated in `CallSite`, rename this to
// better indicate that this may return a conservative answer.
bool doesNotReadMemory(unsigned OpNo) const {
  return dataOperandHasImpliedAttr(OpNo + 1, Attribute::WriteOnly) ||
         dataOperandHasImpliedAttr(OpNo + 1, Attribute::ReadNone);
}

/// Extract the alignment of the return value.
MaybeAlign getRetAlign() const { return Attrs.getRetAlignment(); }

/// Extract the alignment for a call or parameter (0=unknown).
MaybeAlign getParamAlign(unsigned ArgNo) const {
  return Attrs.getParamAlignment(ArgNo);
}

MaybeAlign getParamStackAlign(unsigned ArgNo) const {
  return Attrs.getParamStackAlignment(ArgNo);
}

/// Extract the byval type for a call or parameter.
Type *getParamByValType(unsigned ArgNo) const {
  if (auto *Ty = Attrs.getParamByValType(ArgNo))
    return Ty;
  if (const Function *F = getCalledFunction())
    return F->getAttributes().getParamByValType(ArgNo);
  return nullptr;
}

/// Extract the preallocated type for a call or parameter.
Type *getParamPreallocatedType(unsigned ArgNo) const {
  if (auto *Ty = Attrs.getParamPreallocatedType(ArgNo))
    return Ty;
  if (const Function *F = getCalledFunction())
    return F->getAttributes().getParamPreallocatedType(ArgNo);
  return nullptr;
}

/// Extract the preallocated type for a call or parameter.
Type *getParamInAllocaType(unsigned ArgNo) const {
  if (auto *Ty = Attrs.getParamInAllocaType(ArgNo))
    return Ty;
  if (const Function *F = getCalledFunction())
    return F->getAttributes().getParamInAllocaType(ArgNo);
  return nullptr;
}

/// Extract the number of dereferenceable bytes for a call or
/// parameter (0=unknown).
uint64_t getRetDereferenceableBytes() const {
  return Attrs.getRetDereferenceableBytes();
}

/// Extract the number of dereferenceable bytes for a call or
/// parameter (0=unknown).
uint64_t getParamDereferenceableBytes(unsigned i) const {
  return Attrs.getParamDereferenceableBytes(i);
}

/// Extract the number of dereferenceable_or_null bytes for a call
/// (0=unknown).
uint64_t getRetDereferenceableOrNullBytes() const {
  return Attrs.getRetDereferenceableOrNullBytes();
}

/// Extract the number of dereferenceable_or_null bytes for a
/// parameter (0=unknown).
uint64_t getParamDereferenceableOrNullBytes(unsigned i) const {
  return Attrs.getParamDereferenceableOrNullBytes(i);
}

/// Return true if the return value is known to be not null.
/// This may be because it has the nonnull attribute, or because at least
/// one byte is dereferenceable and the pointer is in addrspace(0).
bool isReturnNonNull() const;

/// Determine if the return value is marked with NoAlias attribute.
bool returnDoesNotAlias() const {
  return Attrs.hasRetAttr(Attribute::NoAlias);
}

/// If one of the arguments has the 'returned' attribute, returns its
/// operand value. Otherwise, return nullptr.
Value *getReturnedArgOperand() const;

/// Return true if the call should not be treated as a call to a
/// builtin.
bool isNoBuiltin() const {
  return hasFnAttrImpl(Attribute::NoBuiltin) &&
         !hasFnAttrImpl(Attribute::Builtin);
}

/// Determine if the call requires strict floating point semantics.
bool isStrictFP() const { return hasFnAttr(Attribute::StrictFP); }

/// Return true if the call should not be inlined.
bool isNoInline() const { return hasFnAttr(Attribute::NoInline); }
void setIsNoInline() { addFnAttr(Attribute::NoInline); }
/// Determine if the call does not access memory.
bool doesNotAccessMemory() const { return hasFnAttr(Attribute::ReadNone); }
void setDoesNotAccessMemory() { addFnAttr(Attribute::ReadNone); }

/// Determine if the call does not access or only reads memory.
bool onlyReadsMemory() const {
  return doesNotAccessMemory() || hasFnAttr(Attribute::ReadOnly);
}

void setOnlyReadsMemory() { addFnAttr(Attribute::ReadOnly); }

/// Determine if the call does not access or only writes memory.
bool doesNotReadMemory() const {
  return doesNotAccessMemory() || hasFnAttr(Attribute::WriteOnly);
}
void setDoesNotReadMemory() { addFnAttr(Attribute::WriteOnly); }

/// Determine if the call can access memmory only using pointers based
/// on its arguments.
bool onlyAccessesArgMemory() const {
  return hasFnAttr(Attribute::ArgMemOnly);
}
void setOnlyAccessesArgMemory() { addFnAttr(Attribute::ArgMemOnly); }

/// Determine if the function may only access memory that is
/// inaccessible from the IR.
bool onlyAccessesInaccessibleMemory() const {
  return hasFnAttr(Attribute::InaccessibleMemOnly);
}
void setOnlyAccessesInaccessibleMemory() {
  addFnAttr(Attribute::InaccessibleMemOnly);
}

/// Determine if the function may only access memory that is
/// either inaccessible from the IR or pointed to by its arguments.
bool onlyAccessesInaccessibleMemOrArgMem() const {
  return hasFnAttr(Attribute::InaccessibleMemOrArgMemOnly);
}
void setOnlyAccessesInaccessibleMemOrArgMem() {
  addFnAttr(Attribute::InaccessibleMemOrArgMemOnly);
}
/// Determine if the call cannot return.
bool doesNotReturn() const { return hasFnAttr(Attribute::NoReturn); }
void setDoesNotReturn() { addFnAttr(Attribute::NoReturn); }

/// Determine if the call should not perform indirect branch tracking.
bool doesNoCfCheck() const { return hasFnAttr(Attribute::NoCfCheck); }

/// Determine if the call cannot unwind.
bool doesNotThrow() const { return hasFnAttr(Attribute::NoUnwind); }
void setDoesNotThrow() { addFnAttr(Attribute::NoUnwind); }

/// Determine if the invoke cannot be duplicated.
bool cannotDuplicate() const { return hasFnAttr(Attribute::NoDuplicate); }
void setCannotDuplicate() { addFnAttr(Attribute::NoDuplicate); }

/// Determine if the call cannot be tail merged.
bool cannotMerge() const { return hasFnAttr(Attribute::NoMerge); }
void setCannotMerge() { addFnAttr(Attribute::NoMerge); }

/// Determine if the invoke is convergent
bool isConvergent() const { return hasFnAttr(Attribute::Convergent); }
void setConvergent() { addFnAttr(Attribute::Convergent); }
void setNotConvergent() { removeFnAttr(Attribute::Convergent); }

/// Determine if the call returns a structure through first
/// pointer argument.
bool hasStructRetAttr() const {
  if (getNumArgOperands() == 0)
    return false;

  // Be friendly and also check the callee.
  return paramHasAttr(0, Attribute::StructRet);
}

/// Determine if any call argument is an aggregate passed by value.
bool hasByValArgument() const {
  return Attrs.hasAttrSomewhere(Attribute::ByVal);
}

///@{
// End of attribute API.

/// \name Operand Bundle API
///
/// This group of methods provides the API to access and manipulate operand
/// bundles on this call.
/// @{

/// Return the number of operand bundles associated with this User.
unsigned getNumOperandBundles() const {
  return std::distance(bundle_op_info_begin(), bundle_op_info_end());
}

/// Return true if this User has any operand bundles.
bool hasOperandBundles() const { return getNumOperandBundles() != 0; }

/// Return the index of the first bundle operand in the Use array.
unsigned getBundleOperandsStartIndex() const {
  assert(hasOperandBundles() && "Don't call otherwise!")(static_cast<void> (0));
  return bundle_op_info_begin()->Begin;
}

/// Return the index of the last bundle operand in the Use array.
unsigned getBundleOperandsEndIndex() const {
  assert(hasOperandBundles() && "Don't call otherwise!")(static_cast<void> (0));
  return bundle_op_info_end()[-1].End;
}

/// Return true if the operand at index \p Idx is a bundle operand.
bool isBundleOperand(unsigned Idx) const {
  return hasOperandBundles() && Idx >= getBundleOperandsStartIndex() &&
         Idx < getBundleOperandsEndIndex();
}

/// Returns true if the use is a bundle operand.
bool isBundleOperand(const Use *U) const {
  assert(this == U->getUser() &&(static_cast<void> (0))
         "Only valid to query with a use of this instruction!")(static_cast<void> (0));
  return hasOperandBundles() && isBundleOperand(U - op_begin());
}
bool isBundleOperand(Value::const_user_iterator UI) const {
  return isBundleOperand(&UI.getUse());
}

/// Return the total number operands (not operand bundles) used by
/// every operand bundle in this OperandBundleUser.
unsigned getNumTotalBundleOperands() const {
  if (!hasOperandBundles())
    return 0;

  unsigned Begin = getBundleOperandsStartIndex();
  unsigned End = getBundleOperandsEndIndex();

  assert(Begin <= End && "Should be!")(static_cast<void> (0));
  return End - Begin;
}

/// Return the operand bundle at a specific index.
OperandBundleUse getOperandBundleAt(unsigned Index) const {
  assert(Index < getNumOperandBundles() && "Index out of bounds!")(static_cast<void> (0));
  return operandBundleFromBundleOpInfo(*(bundle_op_info_begin() + Index));
}

/// Return the number of operand bundles with the tag Name attached to
/// this instruction.
unsigned countOperandBundlesOfType(StringRef Name) const {
  unsigned Count = 0;
  for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i)
    if (getOperandBundleAt(i).getTagName() == Name)
      Count++;

  return Count;
}

/// Return the number of operand bundles with the tag ID attached to
/// this instruction.
unsigned countOperandBundlesOfType(uint32_t ID) const {
  unsigned Count = 0;
  for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i)
    if (getOperandBundleAt(i).getTagID() == ID)
      Count++;

  return Count;
}

/// Return an operand bundle by name, if present.
///
/// It is an error to call this for operand bundle types that may have
/// multiple instances of them on the same instruction.
Optional<OperandBundleUse> getOperandBundle(StringRef Name) const {
  assert(countOperandBundlesOfType(Name) < 2 && "Precondition violated!")(static_cast<void> (0));

  for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i) {
    OperandBundleUse U = getOperandBundleAt(i);
    if (U.getTagName() == Name)
      return U;
  }

  return None;
}

/// Return an operand bundle by tag ID, if present.
///
/// It is an error to call this for operand bundle types that may have
/// multiple instances of them on the same instruction.
Optional<OperandBundleUse> getOperandBundle(uint32_t ID) const {
  assert(countOperandBundlesOfType(ID) < 2 && "Precondition violated!")(static_cast<void> (0));

  for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i) {
    OperandBundleUse U = getOperandBundleAt(i);
    if (U.getTagID() == ID)
      return U;
  }

  return None;
}

/// Return the list of operand bundles attached to this instruction as
/// a vector of OperandBundleDefs.
///
/// This function copies the OperandBundeUse instances associated with this
/// OperandBundleUser to a vector of OperandBundleDefs.  Note:
/// OperandBundeUses and OperandBundleDefs are non-trivially *different*
/// representations of operand bundles (see documentation above).
void getOperandBundlesAsDefs(SmallVectorImpl<OperandBundleDef> &Defs) const;

/// Return the operand bundle for the operand at index OpIdx.
///
/// It is an error to call this with an OpIdx that does not correspond to an
/// bundle operand.
OperandBundleUse getOperandBundleForOperand(unsigned OpIdx) const {
  return operandBundleFromBundleOpInfo(getBundleOpInfoForOperand(OpIdx));
}

/// Return true if this operand bundle user has operand bundles that
/// may read from the heap.
bool hasReadingOperandBundles() const;

/// Return true if this operand bundle user has operand bundles that
/// may write to the heap.
bool hasClobberingOperandBundles() const {
  for (auto &BOI : bundle_op_infos()) {
    if (BOI.Tag->second == LLVMContext::OB_deopt ||
        BOI.Tag->second == LLVMContext::OB_funclet)
      continue;

    // This instruction has an operand bundle that is not known to us.
    // Assume the worst.
    return true;
  }

  return false;
}

/// Return true if the bundle operand at index \p OpIdx has the
/// attribute \p A.
bool bundleOperandHasAttr(unsigned OpIdx,  Attribute::AttrKind A) const {
  auto &BOI = getBundleOpInfoForOperand(OpIdx);
  auto OBU = operandBundleFromBundleOpInfo(BOI);
  return OBU.operandHasAttr(OpIdx - BOI.Begin, A);
}

/// Return true if \p Other has the same sequence of operand bundle
/// tags with the same number of operands on each one of them as this
/// OperandBundleUser.
bool hasIdenticalOperandBundleSchema(const CallBase &Other) const {
  if (getNumOperandBundles() != Other.getNumOperandBundles())
    return false;

  return std::equal(bundle_op_info_begin(), bundle_op_info_end(),
                    Other.bundle_op_info_begin());
}

/// Return true if this operand bundle user contains operand bundles
/// with tags other than those specified in \p IDs.
bool hasOperandBundlesOtherThan(ArrayRef<uint32_t> IDs) const {
  for (unsigned i = 0, e = getNumOperandBundles(); i != e; ++i) {
    uint32_t ID = getOperandBundleAt(i).getTagID();
    if (!is_contained(IDs, ID))
      return true;
  }
  return false;
}

/// Is the function attribute S disallowed by some operand bundle on
/// this operand bundle user?
bool isFnAttrDisallowedByOpBundle(StringRef S) const {
  // Operand bundles only possibly disallow readnone, readonly and argmemonly
  // attributes.  All String attributes are fine.
  return false;
}

/// Is the function attribute A disallowed by some operand bundle on
/// this operand bundle user?
bool isFnAttrDisallowedByOpBundle(Attribute::AttrKind A) const {
  switch (A) {
  default:
    return false;

  case Attribute::InaccessibleMemOrArgMemOnly:
    return hasReadingOperandBundles();

  case Attribute::InaccessibleMemOnly:
    return hasReadingOperandBundles();

  case Attribute::ArgMemOnly:
    return hasReadingOperandBundles();

  case Attribute::ReadNone:
    return hasReadingOperandBundles();

  case Attribute::ReadOnly:
    return hasClobberingOperandBundles();
  }

  llvm_unreachable("switch has a default case!")__builtin_unreachable();
}

/// Used to keep track of an operand bundle.  See the main comment on
/// OperandBundleUser above.
struct BundleOpInfo {
  /// The operand bundle tag, interned by
  /// LLVMContextImpl::getOrInsertBundleTag.
  StringMapEntry<uint32_t> *Tag;

  /// The index in the Use& vector where operands for this operand
  /// bundle starts.
  uint32_t Begin;

  /// The index in the Use& vector where operands for this operand
  /// bundle ends.
  uint32_t End;

  bool operator==(const BundleOpInfo &Other) const {
    return Tag == Other.Tag && Begin == Other.Begin && End == Other.End;
  }
};

/// Simple helper function to map a BundleOpInfo to an
/// OperandBundleUse.
OperandBundleUse
operandBundleFromBundleOpInfo(const BundleOpInfo &BOI) const {
  auto begin = op_begin();
  ArrayRef<Use> Inputs(begin + BOI.Begin, begin + BOI.End);
  return OperandBundleUse(BOI.Tag, Inputs);
}

using bundle_op_iterator = BundleOpInfo *;
using const_bundle_op_iterator = const BundleOpInfo *;

/// Return the start of the list of BundleOpInfo instances associated
/// with this OperandBundleUser.
///
/// OperandBundleUser uses the descriptor area co-allocated with the host User
/// to store some meta information about which operands are "normal" operands,
/// and which ones belong to some operand bundle.
///
/// The layout of an operand bundle user is
///
///          +-----------uint32_t End-------------------------------------+
///          |                                                            |
///          |  +--------uint32_t Begin--------------------+              |
///          |  |                                          |              |
///          ^  ^                                          v              v
///  |------|------|----|----|----|----|----|---------|----|---------|----|-----
///  | BOI0 | BOI1 | .. | DU | U0 | U1 | .. | BOI0_U0 | .. | BOI1_U0 | .. | Un
///  |------|------|----|----|----|----|----|---------|----|---------|----|-----
///   v  v                                  ^              ^
///   |  |                                  |              |
///   |  +--------uint32_t Begin------------+              |
///   |                                                    |
///   +-----------uint32_t End-----------------------------+
///
///
/// BOI0, BOI1 ... are descriptions of operand bundles in this User's use
/// list. These descriptions are installed and managed by this class, and
/// they're all instances of OperandBundleUser<T>::BundleOpInfo.
///
/// DU is an additional descriptor installed by User's 'operator new' to keep
/// track of the 'BOI0 ... BOIN' co-allocation.  OperandBundleUser does not
/// access or modify DU in any way, it's an implementation detail private to
/// User.
///
/// The regular Use& vector for the User starts at U0.  The operand bundle
/// uses are part of the Use& vector, just like normal uses.  In the diagram
/// above, the operand bundle uses start at BOI0_U0.  Each instance of
/// BundleOpInfo has information about a contiguous set of uses constituting
/// an operand bundle, and the total set of operand bundle uses themselves
/// form a contiguous set of uses (i.e. there are no gaps between uses
/// corresponding to individual operand bundles).
///
/// This class does not know the location of the set of operand bundle uses
/// within the use list -- that is decided by the User using this class via
/// the BeginIdx argument in populateBundleOperandInfos.
///
/// Currently operand bundle users with hung-off operands are not supported.
bundle_op_iterator bundle_op_info_begin() {
  if (!hasDescriptor())
4
←
Assuming the condition is false→
5
←
Taking false branch→
    return nullptr;

  uint8_t *BytesBegin = getDescriptor().begin();
6
←
'BytesBegin' initialized here→
  return reinterpret_cast<bundle_op_iterator>(BytesBegin);
7
←
Returning pointer (loaded from 'BytesBegin')→
}

/// Return the start of the list of BundleOpInfo instances associated
/// with this OperandBundleUser.
const_bundle_op_iterator bundle_op_info_begin() const {
  auto *NonConstThis = const_cast<CallBase *>(this);
  return NonConstThis->bundle_op_info_begin();
}

/// Return the end of the list of BundleOpInfo instances associated
/// with this OperandBundleUser.
bundle_op_iterator bundle_op_info_end() {
  if (!hasDescriptor())
    return nullptr;

  uint8_t *BytesEnd = getDescriptor().end();
  return reinterpret_cast<bundle_op_iterator>(BytesEnd);
}

/// Return the end of the list of BundleOpInfo instances associated
/// with this OperandBundleUser.
const_bundle_op_iterator bundle_op_info_end() const {
  auto *NonConstThis = const_cast<CallBase *>(this);
  return NonConstThis->bundle_op_info_end();
}

/// Return the range [\p bundle_op_info_begin, \p bundle_op_info_end).
iterator_range<bundle_op_iterator> bundle_op_infos() {
  return make_range(bundle_op_info_begin(), bundle_op_info_end());
}

/// Return the range [\p bundle_op_info_begin, \p bundle_op_info_end).
iterator_range<const_bundle_op_iterator> bundle_op_infos() const {
  return make_range(bundle_op_info_begin(), bundle_op_info_end());
}

/// Populate the BundleOpInfo instances and the Use& vector from \p
/// Bundles.  Return the op_iterator pointing to the Use& one past the last
/// last bundle operand use.
///
/// Each \p OperandBundleDef instance is tracked by a OperandBundleInfo
/// instance allocated in this User's descriptor.
op_iterator populateBundleOperandInfos(ArrayRef<OperandBundleDef> Bundles,
                                       const unsigned BeginIndex);

2245public:
/// Return the BundleOpInfo for the operand at index OpIdx.
///
/// It is an error to call this with an OpIdx that does not correspond to an
/// bundle operand.
BundleOpInfo &getBundleOpInfoForOperand(unsigned OpIdx);
const BundleOpInfo &getBundleOpInfoForOperand(unsigned OpIdx) const {
  return const_cast<CallBase *>(this)->getBundleOpInfoForOperand(OpIdx);
}

2255protected:
/// Return the total number of values used in \p Bundles.
static unsigned CountBundleInputs(ArrayRef<OperandBundleDef> Bundles) {
  unsigned Total = 0;
  for (auto &B : Bundles)
    Total += B.input_size();
  return Total;
}

/// @}
// End of operand bundle API.

2267private:
bool hasFnAttrOnCalledFunction(Attribute::AttrKind Kind) const;
bool hasFnAttrOnCalledFunction(StringRef Kind) const;

template <typename AttrKind> bool hasFnAttrImpl(AttrKind Kind) const {
  if (Attrs.hasFnAttr(Kind))
    return true;

  // Operand bundles override attributes on the called function, but don't
  // override attributes directly present on the call instruction.
  if (isFnAttrDisallowedByOpBundle(Kind))
    return false;

  return hasFnAttrOnCalledFunction(Kind);
}

/// Determine whether the return value has the given attribute. Supports
/// Attribute::AttrKind and StringRef as \p AttrKind types.
template <typename AttrKind> bool hasRetAttrImpl(AttrKind Kind) const {
  if (Attrs.hasRetAttr(Kind))
    return true;

  // Look at the callee, if available.
  if (const Function *F = getCalledFunction())
    return F->getAttributes().hasRetAttr(Kind);
  return false;
}
2294};

2296template <>
2297struct OperandTraits<CallBase> : public VariadicOperandTraits<CallBase, 1> {};

2299DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CallBase, Value)CallBase::op_iterator CallBase::op_begin() { return OperandTraits
<CallBase>::op_begin(this); } CallBase::const_op_iterator
 CallBase::op_begin() const { return OperandTraits<CallBase
>::op_begin(const_cast<CallBase*>(this)); } CallBase
::op_iterator CallBase::op_end() { return OperandTraits<CallBase
>::op_end(this); } CallBase::const_op_iterator CallBase::op_end
() const { return OperandTraits<CallBase>::op_end(const_cast
<CallBase*>(this)); } Value *CallBase::getOperand(unsigned
 i_nocapture) const { (static_cast<void> (0)); return cast_or_null
<Value>( OperandTraits<CallBase>::op_begin(const_cast
<CallBase*>(this))[i_nocapture].get()); } void CallBase
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
<void> (0)); OperandTraits<CallBase>::op_begin(this
)[i_nocapture] = Val_nocapture; } unsigned CallBase::getNumOperands
() const { return OperandTraits<CallBase>::operands(this
); } template <int Idx_nocapture> Use &CallBase::Op
() { return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &CallBase::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

2301//===----------------------------------------------------------------------===//
2302//                           FuncletPadInst Class
2303//===----------------------------------------------------------------------===//
2304class FuncletPadInst : public Instruction {
2305private:
FuncletPadInst(const FuncletPadInst &CPI);

explicit FuncletPadInst(Instruction::FuncletPadOps Op, Value *ParentPad,
                        ArrayRef<Value *> Args, unsigned Values,
                        const Twine &NameStr, Instruction *InsertBefore);
explicit FuncletPadInst(Instruction::FuncletPadOps Op, Value *ParentPad,
                        ArrayRef<Value *> Args, unsigned Values,
                        const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(Value *ParentPad, ArrayRef<Value *> Args, const Twine &NameStr);

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

FuncletPadInst *cloneImpl() const;

2325public:
/// 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;

/// getNumArgOperands - Return the number of funcletpad arguments.
///
unsigned getNumArgOperands() const { return getNumOperands() - 1; }

/// Convenience accessors

/// Return the outer EH-pad this funclet is nested within.
///
/// Note: This returns the associated CatchSwitchInst if this FuncletPadInst
/// is a CatchPadInst.
Value *getParentPad() const { return Op<-1>(); }
void setParentPad(Value *ParentPad) {
  assert(ParentPad)(static_cast<void> (0));
  Op<-1>() = ParentPad;
}

/// getArgOperand/setArgOperand - Return/set the i-th funcletpad argument.
///
Value *getArgOperand(unsigned i) const { return getOperand(i); }
void setArgOperand(unsigned i, Value *v) { setOperand(i, v); }

/// arg_operands - iteration adapter for range-for loops.
op_range arg_operands() { return op_range(op_begin(), op_end() - 1); }

/// arg_operands - iteration adapter for range-for loops.
const_op_range arg_operands() const {
  return const_op_range(op_begin(), op_end() - 1);
}

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

2365template <>
2366struct OperandTraits<FuncletPadInst>
  : public VariadicOperandTraits<FuncletPadInst, /*MINARITY=*/1> {};

2369DEFINE_TRANSPARENT_OPERAND_ACCESSORS(FuncletPadInst, Value)FuncletPadInst::op_iterator FuncletPadInst::op_begin() { return
 OperandTraits<FuncletPadInst>::op_begin(this); } FuncletPadInst
::const_op_iterator FuncletPadInst::op_begin() const { return
 OperandTraits<FuncletPadInst>::op_begin(const_cast<
FuncletPadInst*>(this)); } FuncletPadInst::op_iterator FuncletPadInst
::op_end() { return OperandTraits<FuncletPadInst>::op_end
(this); } FuncletPadInst::const_op_iterator FuncletPadInst::op_end
() const { return OperandTraits<FuncletPadInst>::op_end
(const_cast<FuncletPadInst*>(this)); } Value *FuncletPadInst
::getOperand(unsigned i_nocapture) const { (static_cast<void
> (0)); return cast_or_null<Value>( OperandTraits<
FuncletPadInst>::op_begin(const_cast<FuncletPadInst*>
(this))[i_nocapture].get()); } void FuncletPadInst::setOperand
(unsigned i_nocapture, Value *Val_nocapture) { (static_cast<
void> (0)); OperandTraits<FuncletPadInst>::op_begin(
this)[i_nocapture] = Val_nocapture; } unsigned FuncletPadInst
::getNumOperands() const { return OperandTraits<FuncletPadInst
>::operands(this); } template <int Idx_nocapture> Use
 &FuncletPadInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
FuncletPadInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

2371} // end namespace llvm

2373#endif // LLVM_IR_INSTRTYPES_H