/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp

Bug Summary

File:	lib/Analysis/InstructionSimplify.cpp
Warning:	line 427, column 21 Called C++ object pointer is null

Annotated Source Code

Press '?' to see keyboard shortcuts

Show analyzer invocation

clang -cc1 -triple x86_64-pc-linux-gnu -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name InstructionSimplify.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-eagerly-assume -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 -mrelocation-model pic -pic-level 2 -mthread-model posix -fmath-errno -masm-verbose -mconstructor-aliases -munwind-tables -fuse-init-array -target-cpu x86-64 -dwarf-column-info -debugger-tuning=gdb -momit-leaf-frame-pointer -ffunction-sections -fdata-sections -resource-dir /usr/lib/llvm-7/lib/clang/7.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-7~svn338205/build-llvm/lib/Analysis -I /build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis -I /build/llvm-toolchain-snapshot-7~svn338205/build-llvm/include -I /build/llvm-toolchain-snapshot-7~svn338205/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/8/../../../../include/c++/8 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/8/../../../../include/x86_64-linux-gnu/c++/8 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/8/../../../../include/x86_64-linux-gnu/c++/8 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/8/../../../../include/c++/8/backward -internal-isystem /usr/include/clang/7.0.0/include/ -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-7/lib/clang/7.0.0/include -internal-externc-isystem /usr/lib/gcc/x86_64-linux-gnu/8/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-comment -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-7~svn338205/build-llvm/lib/Analysis -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-07-29-043837-17923-1 -x c++ /build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp -faddrsig

/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp

→

1//===- InstructionSimplify.cpp - Fold instruction operands ----------------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements routines for folding instructions into simpler forms
11// that do not require creating new instructions.  This does constant folding
12// ("add i32 1, 1" -> "2") but can also handle non-constant operands, either
13// returning a constant ("and i32 %x, 0" -> "0") or an already existing value
14// ("and i32 %x, %x" -> "%x").  All operands are assumed to have already been
15// simplified: This is usually true and assuming it simplifies the logic (if
16// they have not been simplified then results are correct but maybe suboptimal).
17//
18//===----------------------------------------------------------------------===//

20#include "llvm/Analysis/InstructionSimplify.h"
21#include "llvm/ADT/SetVector.h"
22#include "llvm/ADT/Statistic.h"
23#include "llvm/Analysis/AliasAnalysis.h"
24#include "llvm/Analysis/AssumptionCache.h"
25#include "llvm/Analysis/CaptureTracking.h"
26#include "llvm/Analysis/CmpInstAnalysis.h"
27#include "llvm/Analysis/ConstantFolding.h"
28#include "llvm/Analysis/LoopAnalysisManager.h"
29#include "llvm/Analysis/MemoryBuiltins.h"
30#include "llvm/Analysis/ValueTracking.h"
31#include "llvm/Analysis/VectorUtils.h"
32#include "llvm/IR/ConstantRange.h"
33#include "llvm/IR/DataLayout.h"
34#include "llvm/IR/Dominators.h"
35#include "llvm/IR/GetElementPtrTypeIterator.h"
36#include "llvm/IR/GlobalAlias.h"
37#include "llvm/IR/Operator.h"
38#include "llvm/IR/PatternMatch.h"
39#include "llvm/IR/ValueHandle.h"
40#include "llvm/Support/KnownBits.h"
41#include <algorithm>
42using namespace llvm;
43using namespace llvm::PatternMatch;

45#define DEBUG_TYPE"instsimplify" "instsimplify"

47enum { RecursionLimit = 3 };

49STATISTIC(NumExpand,  "Number of expansions")static llvm::Statistic NumExpand = {"instsimplify", "NumExpand"
, "Number of expansions", {0}, {false}};
50STATISTIC(NumReassoc, "Number of reassociations")static llvm::Statistic NumReassoc = {"instsimplify", "NumReassoc"
, "Number of reassociations", {0}, {false}};

52static Value *SimplifyAndInst(Value *, Value *, const SimplifyQuery &, unsigned);
53static Value *SimplifyBinOp(unsigned, Value *, Value *, const SimplifyQuery &,
                          unsigned);
55static Value *SimplifyFPBinOp(unsigned, Value *, Value *, const FastMathFlags &,
                            const SimplifyQuery &, unsigned);
57static Value *SimplifyCmpInst(unsigned, Value *, Value *, const SimplifyQuery &,
                            unsigned);
59static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                             const SimplifyQuery &Q, unsigned MaxRecurse);
61static Value *SimplifyOrInst(Value *, Value *, const SimplifyQuery &, unsigned);
62static Value *SimplifyXorInst(Value *, Value *, const SimplifyQuery &, unsigned);
63static Value *SimplifyCastInst(unsigned, Value *, Type *,
                             const SimplifyQuery &, unsigned);
65static Value *SimplifyGEPInst(Type *, ArrayRef<Value *>, const SimplifyQuery &,
                            unsigned);

68/// Fold
69///   %A = icmp ne/eq i8 %X, %V1
70///   %B = icmp ne/eq i8 %X, %V2
71///   %C = or/and i1 %A, %B
72///   %D = select i1 %C, i8 %X, i8 %V1
73/// To
74///   %X/%V1
75static Value *foldSelectWithBinaryOp(Value *Cond, Value *TrueVal,
                                   Value *FalseVal) {
BinaryOperator::BinaryOps BinOpCode;
if (auto *BO = dyn_cast<BinaryOperator>(Cond))
  BinOpCode = BO->getOpcode();
else
  return nullptr;

CmpInst::Predicate ExpectedPred;
if (BinOpCode == BinaryOperator::Or) {
  ExpectedPred = ICmpInst::ICMP_NE;
} else if (BinOpCode == BinaryOperator::And) {
  ExpectedPred = ICmpInst::ICMP_EQ;
} else
  return nullptr;

CmpInst::Predicate Pred1, Pred2;
if (!match(
        Cond,
        m_c_BinOp(m_c_ICmp(Pred1, m_Specific(TrueVal), m_Specific(FalseVal)),
                  m_c_ICmp(Pred2, m_Specific(TrueVal), m_Value()))) ||
    Pred1 != Pred2 || Pred1 != ExpectedPred)
  return nullptr;

return BinOpCode == BinaryOperator::Or ? TrueVal : FalseVal;
100}

102/// For a boolean type or a vector of boolean type, return false or a vector
103/// with every element false.
104static Constant *getFalse(Type *Ty) {
return ConstantInt::getFalse(Ty);
106}

108/// For a boolean type or a vector of boolean type, return true or a vector
109/// with every element true.
110static Constant *getTrue(Type *Ty) {
return ConstantInt::getTrue(Ty);
112}

114/// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"?
115static bool isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS,
                        Value *RHS) {
CmpInst *Cmp = dyn_cast<CmpInst>(V);
if (!Cmp)
  return false;
CmpInst::Predicate CPred = Cmp->getPredicate();
Value *CLHS = Cmp->getOperand(0), *CRHS = Cmp->getOperand(1);
if (CPred == Pred && CLHS == LHS && CRHS == RHS)
  return true;
return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS &&
  CRHS == LHS;
126}

128/// Does the given value dominate the specified phi node?
129static bool valueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
Instruction *I = dyn_cast<Instruction>(V);
if (!I)
  // Arguments and constants dominate all instructions.
  return true;

// If we are processing instructions (and/or basic blocks) that have not been
// fully added to a function, the parent nodes may still be null. Simply
// return the conservative answer in these cases.
if (!I->getParent() || !P->getParent() || !I->getFunction())
  return false;

// If we have a DominatorTree then do a precise test.
if (DT)
  return DT->dominates(I, P);

// Otherwise, if the instruction is in the entry block and is not an invoke,
// then it obviously dominates all phi nodes.
if (I->getParent() == &I->getFunction()->getEntryBlock() &&
    !isa<InvokeInst>(I))
  return true;

return false;
152}

154/// Simplify "A op (B op' C)" by distributing op over op', turning it into
155/// "(A op B) op' (A op C)".  Here "op" is given by Opcode and "op'" is
156/// given by OpcodeToExpand, while "A" corresponds to LHS and "B op' C" to RHS.
157/// Also performs the transform "(A op' B) op C" -> "(A op C) op' (B op C)".
158/// Returns the simplified value, or null if no simplification was performed.
159static Value *ExpandBinOp(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS,
                        Instruction::BinaryOps OpcodeToExpand,
                        const SimplifyQuery &Q, unsigned MaxRecurse) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return nullptr;

// Check whether the expression has the form "(A op' B) op C".
if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS))
  if (Op0->getOpcode() == OpcodeToExpand) {
    // It does!  Try turning it into "(A op C) op' (B op C)".
    Value *A = Op0->getOperand(0), *B = Op0->getOperand(1), *C = RHS;
    // Do "A op C" and "B op C" both simplify?
    if (Value *L = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse))
      if (Value *R = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
        // They do! Return "L op' R" if it simplifies or is already available.
        // If "L op' R" equals "A op' B" then "L op' R" is just the LHS.
        if ((L == A && R == B) || (Instruction::isCommutative(OpcodeToExpand)
                                   && L == B && R == A)) {
          ++NumExpand;
          return LHS;
        }
        // Otherwise return "L op' R" if it simplifies.
        if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
          ++NumExpand;
          return V;
        }
      }
  }

// Check whether the expression has the form "A op (B op' C)".
if (BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS))
  if (Op1->getOpcode() == OpcodeToExpand) {
    // It does!  Try turning it into "(A op B) op' (A op C)".
    Value *A = LHS, *B = Op1->getOperand(0), *C = Op1->getOperand(1);
    // Do "A op B" and "A op C" both simplify?
    if (Value *L = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse))
      if (Value *R = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse)) {
        // They do! Return "L op' R" if it simplifies or is already available.
        // If "L op' R" equals "B op' C" then "L op' R" is just the RHS.
        if ((L == B && R == C) || (Instruction::isCommutative(OpcodeToExpand)
                                   && L == C && R == B)) {
          ++NumExpand;
          return RHS;
        }
        // Otherwise return "L op' R" if it simplifies.
        if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
          ++NumExpand;
          return V;
        }
      }
  }

return nullptr;
213}

215/// Generic simplifications for associative binary operations.
216/// Returns the simpler value, or null if none was found.
217static Value *SimplifyAssociativeBinOp(Instruction::BinaryOps Opcode,
                                     Value *LHS, Value *RHS,
                                     const SimplifyQuery &Q,
                                     unsigned MaxRecurse) {
assert(Instruction::isAssociative(Opcode) && "Not an associative operation!")(static_cast <bool> (Instruction::isAssociative(Opcode)
 && "Not an associative operation!") ? void (0) : __assert_fail
 ("Instruction::isAssociative(Opcode) && \"Not an associative operation!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 221, __extension__ __PRETTY_FUNCTION__));

// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return nullptr;

BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS);
BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS);

// Transform: "(A op B) op C" ==> "A op (B op C)" if it simplifies completely.
if (Op0 && Op0->getOpcode() == Opcode) {
  Value *A = Op0->getOperand(0);
  Value *B = Op0->getOperand(1);
  Value *C = RHS;

  // Does "B op C" simplify?
  if (Value *V = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
    // It does!  Return "A op V" if it simplifies or is already available.
    // If V equals B then "A op V" is just the LHS.
    if (V == B) return LHS;
    // Otherwise return "A op V" if it simplifies.
    if (Value *W = SimplifyBinOp(Opcode, A, V, Q, MaxRecurse)) {
      ++NumReassoc;
      return W;
    }
  }
}

// Transform: "A op (B op C)" ==> "(A op B) op C" if it simplifies completely.
if (Op1 && Op1->getOpcode() == Opcode) {
  Value *A = LHS;
  Value *B = Op1->getOperand(0);
  Value *C = Op1->getOperand(1);

  // Does "A op B" simplify?
  if (Value *V = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse)) {
    // It does!  Return "V op C" if it simplifies or is already available.
    // If V equals B then "V op C" is just the RHS.
    if (V == B) return RHS;
    // Otherwise return "V op C" if it simplifies.
    if (Value *W = SimplifyBinOp(Opcode, V, C, Q, MaxRecurse)) {
      ++NumReassoc;
      return W;
    }
  }
}

// The remaining transforms require commutativity as well as associativity.
if (!Instruction::isCommutative(Opcode))
  return nullptr;

// Transform: "(A op B) op C" ==> "(C op A) op B" if it simplifies completely.
if (Op0 && Op0->getOpcode() == Opcode) {
  Value *A = Op0->getOperand(0);
  Value *B = Op0->getOperand(1);
  Value *C = RHS;

  // Does "C op A" simplify?
  if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) {
    // It does!  Return "V op B" if it simplifies or is already available.
    // If V equals A then "V op B" is just the LHS.
    if (V == A) return LHS;
    // Otherwise return "V op B" if it simplifies.
    if (Value *W = SimplifyBinOp(Opcode, V, B, Q, MaxRecurse)) {
      ++NumReassoc;
      return W;
    }
  }
}

// Transform: "A op (B op C)" ==> "B op (C op A)" if it simplifies completely.
if (Op1 && Op1->getOpcode() == Opcode) {
  Value *A = LHS;
  Value *B = Op1->getOperand(0);
  Value *C = Op1->getOperand(1);

  // Does "C op A" simplify?
  if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) {
    // It does!  Return "B op V" if it simplifies or is already available.
    // If V equals C then "B op V" is just the RHS.
    if (V == C) return RHS;
    // Otherwise return "B op V" if it simplifies.
    if (Value *W = SimplifyBinOp(Opcode, B, V, Q, MaxRecurse)) {
      ++NumReassoc;
      return W;
    }
  }
}

return nullptr;
311}

313/// In the case of a binary operation with a select instruction as an operand,
314/// try to simplify the binop by seeing whether evaluating it on both branches
315/// of the select results in the same value. Returns the common value if so,
316/// otherwise returns null.
317static Value *ThreadBinOpOverSelect(Instruction::BinaryOps Opcode, Value *LHS,
                                  Value *RHS, const SimplifyQuery &Q,
                                  unsigned MaxRecurse) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return nullptr;

SelectInst *SI;
if (isa<SelectInst>(LHS)) {
  SI = cast<SelectInst>(LHS);
} else {
  assert(isa<SelectInst>(RHS) && "No select instruction operand!")(static_cast <bool> (isa<SelectInst>(RHS) &&
 "No select instruction operand!") ? void (0) : __assert_fail
 ("isa<SelectInst>(RHS) && \"No select instruction operand!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 328, __extension__ __PRETTY_FUNCTION__));
  SI = cast<SelectInst>(RHS);
}

// Evaluate the BinOp on the true and false branches of the select.
Value *TV;
Value *FV;
if (SI == LHS) {
  TV = SimplifyBinOp(Opcode, SI->getTrueValue(), RHS, Q, MaxRecurse);
  FV = SimplifyBinOp(Opcode, SI->getFalseValue(), RHS, Q, MaxRecurse);
} else {
  TV = SimplifyBinOp(Opcode, LHS, SI->getTrueValue(), Q, MaxRecurse);
  FV = SimplifyBinOp(Opcode, LHS, SI->getFalseValue(), Q, MaxRecurse);
}

// If they simplified to the same value, then return the common value.
// If they both failed to simplify then return null.
if (TV == FV)
  return TV;

// If one branch simplified to undef, return the other one.
if (TV && isa<UndefValue>(TV))
  return FV;
if (FV && isa<UndefValue>(FV))
  return TV;

// If applying the operation did not change the true and false select values,
// then the result of the binop is the select itself.
if (TV == SI->getTrueValue() && FV == SI->getFalseValue())
  return SI;

// If one branch simplified and the other did not, and the simplified
// value is equal to the unsimplified one, return the simplified value.
// For example, select (cond, X, X & Z) & Z -> X & Z.
if ((FV && !TV) || (TV && !FV)) {
  // Check that the simplified value has the form "X op Y" where "op" is the
  // same as the original operation.
  Instruction *Simplified = dyn_cast<Instruction>(FV ? FV : TV);
  if (Simplified && Simplified->getOpcode() == unsigned(Opcode)) {
    // The value that didn't simplify is "UnsimplifiedLHS op UnsimplifiedRHS".
    // We already know that "op" is the same as for the simplified value.  See
    // if the operands match too.  If so, return the simplified value.
    Value *UnsimplifiedBranch = FV ? SI->getTrueValue() : SI->getFalseValue();
    Value *UnsimplifiedLHS = SI == LHS ? UnsimplifiedBranch : LHS;
    Value *UnsimplifiedRHS = SI == LHS ? RHS : UnsimplifiedBranch;
    if (Simplified->getOperand(0) == UnsimplifiedLHS &&
        Simplified->getOperand(1) == UnsimplifiedRHS)
      return Simplified;
    if (Simplified->isCommutative() &&
        Simplified->getOperand(1) == UnsimplifiedLHS &&
        Simplified->getOperand(0) == UnsimplifiedRHS)
      return Simplified;
  }
}

return nullptr;
384}

386/// In the case of a comparison with a select instruction, try to simplify the
387/// comparison by seeing whether both branches of the select result in the same
388/// value. Returns the common value if so, otherwise returns null.
389static Value *ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS,
                                Value *RHS, const SimplifyQuery &Q,
                                unsigned MaxRecurse) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
18
←
Taking false branch→
  return nullptr;

// Make sure the select is on the LHS.
if (!isa<SelectInst>(LHS)) {
19
←
Taking true branch→
  std::swap(LHS, RHS);
  Pred = CmpInst::getSwappedPredicate(Pred);
}
assert(isa<SelectInst>(LHS) && "Not comparing with a select instruction!")(static_cast <bool> (isa<SelectInst>(LHS) &&
 "Not comparing with a select instruction!") ? void (0) : __assert_fail
 ("isa<SelectInst>(LHS) && \"Not comparing with a select instruction!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 401, __extension__ __PRETTY_FUNCTION__));
SelectInst *SI = cast<SelectInst>(LHS);
Value *Cond = SI->getCondition();
20
←
Calling 'SelectInst::getCondition'→
23
←
Returning from 'SelectInst::getCondition'→
24
←
'Cond' initialized here→
Value *TV = SI->getTrueValue();
Value *FV = SI->getFalseValue();

// Now that we have "cmp select(Cond, TV, FV), RHS", analyse it.
// Does "cmp TV, RHS" simplify?
Value *TCmp = SimplifyCmpInst(Pred, TV, RHS, Q, MaxRecurse);
if (TCmp == Cond) {
25
←
Assuming 'TCmp' is not equal to 'Cond'→
26
←
Taking false branch→
  // It not only simplified, it simplified to the select condition.  Replace
  // it with 'true'.
  TCmp = getTrue(Cond->getType());
} else if (!TCmp) {
27
←
Assuming 'TCmp' is non-null→
28
←
Taking false branch→
  // It didn't simplify.  However if "cmp TV, RHS" is equal to the select
  // condition then we can replace it with 'true'.  Otherwise give up.
  if (!isSameCompare(Cond, Pred, TV, RHS))
    return nullptr;
  TCmp = getTrue(Cond->getType());
}

// Does "cmp FV, RHS" simplify?
Value *FCmp = SimplifyCmpInst(Pred, FV, RHS, Q, MaxRecurse);
if (FCmp == Cond) {
29
←
Assuming 'FCmp' is equal to 'Cond'→
30
←
Assuming pointer value is null→
31
←
Taking true branch→
  // It not only simplified, it simplified to the select condition.  Replace
  // it with 'false'.
  FCmp = getFalse(Cond->getType());
32
←
Called C++ object pointer is null
} else if (!FCmp) {
  // It didn't simplify.  However if "cmp FV, RHS" is equal to the select
  // condition then we can replace it with 'false'.  Otherwise give up.
  if (!isSameCompare(Cond, Pred, FV, RHS))
    return nullptr;
  FCmp = getFalse(Cond->getType());
}

// If both sides simplified to the same value, then use it as the result of
// the original comparison.
if (TCmp == FCmp)
  return TCmp;

// The remaining cases only make sense if the select condition has the same
// type as the result of the comparison, so bail out if this is not so.
if (Cond->getType()->isVectorTy() != RHS->getType()->isVectorTy())
  return nullptr;
// If the false value simplified to false, then the result of the compare
// is equal to "Cond && TCmp".  This also catches the case when the false
// value simplified to false and the true value to true, returning "Cond".
if (match(FCmp, m_Zero()))
  if (Value *V = SimplifyAndInst(Cond, TCmp, Q, MaxRecurse))
    return V;
// If the true value simplified to true, then the result of the compare
// is equal to "Cond || FCmp".
if (match(TCmp, m_One()))
  if (Value *V = SimplifyOrInst(Cond, FCmp, Q, MaxRecurse))
    return V;
// Finally, if the false value simplified to true and the true value to
// false, then the result of the compare is equal to "!Cond".
if (match(FCmp, m_One()) && match(TCmp, m_Zero()))
  if (Value *V =
      SimplifyXorInst(Cond, Constant::getAllOnesValue(Cond->getType()),
                      Q, MaxRecurse))
    return V;

return nullptr;
465}

467/// In the case of a binary operation with an operand that is a PHI instruction,
468/// try to simplify the binop by seeing whether evaluating it on the incoming
469/// phi values yields the same result for every value. If so returns the common
470/// value, otherwise returns null.
471static Value *ThreadBinOpOverPHI(Instruction::BinaryOps Opcode, Value *LHS,
                               Value *RHS, const SimplifyQuery &Q,
                               unsigned MaxRecurse) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return nullptr;

PHINode *PI;
if (isa<PHINode>(LHS)) {
  PI = cast<PHINode>(LHS);
  // Bail out if RHS and the phi may be mutually interdependent due to a loop.
  if (!valueDominatesPHI(RHS, PI, Q.DT))
    return nullptr;
} else {
  assert(isa<PHINode>(RHS) && "No PHI instruction operand!")(static_cast <bool> (isa<PHINode>(RHS) &&
 "No PHI instruction operand!") ? void (0) : __assert_fail ("isa<PHINode>(RHS) && \"No PHI instruction operand!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 485, __extension__ __PRETTY_FUNCTION__));
  PI = cast<PHINode>(RHS);
  // Bail out if LHS and the phi may be mutually interdependent due to a loop.
  if (!valueDominatesPHI(LHS, PI, Q.DT))
    return nullptr;
}

// Evaluate the BinOp on the incoming phi values.
Value *CommonValue = nullptr;
for (Value *Incoming : PI->incoming_values()) {
  // If the incoming value is the phi node itself, it can safely be skipped.
  if (Incoming == PI) continue;
  Value *V = PI == LHS ?
    SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) :
    SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse);
  // If the operation failed to simplify, or simplified to a different value
  // to previously, then give up.
  if (!V || (CommonValue && V != CommonValue))
    return nullptr;
  CommonValue = V;
}

return CommonValue;
508}

510/// In the case of a comparison with a PHI instruction, try to simplify the
511/// comparison by seeing whether comparing with all of the incoming phi values
512/// yields the same result every time. If so returns the common result,
513/// otherwise returns null.
514static Value *ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return nullptr;

// Make sure the phi is on the LHS.
if (!isa<PHINode>(LHS)) {
  std::swap(LHS, RHS);
  Pred = CmpInst::getSwappedPredicate(Pred);
}
assert(isa<PHINode>(LHS) && "Not comparing with a phi instruction!")(static_cast <bool> (isa<PHINode>(LHS) &&
 "Not comparing with a phi instruction!") ? void (0) : __assert_fail
 ("isa<PHINode>(LHS) && \"Not comparing with a phi instruction!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 525, __extension__ __PRETTY_FUNCTION__));
PHINode *PI = cast<PHINode>(LHS);

// Bail out if RHS and the phi may be mutually interdependent due to a loop.
if (!valueDominatesPHI(RHS, PI, Q.DT))
  return nullptr;

// Evaluate the BinOp on the incoming phi values.
Value *CommonValue = nullptr;
for (Value *Incoming : PI->incoming_values()) {
  // If the incoming value is the phi node itself, it can safely be skipped.
  if (Incoming == PI) continue;
  Value *V = SimplifyCmpInst(Pred, Incoming, RHS, Q, MaxRecurse);
  // If the operation failed to simplify, or simplified to a different value
  // to previously, then give up.
  if (!V || (CommonValue && V != CommonValue))
    return nullptr;
  CommonValue = V;
}

return CommonValue;
546}

548static Constant *foldOrCommuteConstant(Instruction::BinaryOps Opcode,
                                     Value *&Op0, Value *&Op1,
                                     const SimplifyQuery &Q) {
if (auto *CLHS = dyn_cast<Constant>(Op0)) {
  if (auto *CRHS = dyn_cast<Constant>(Op1))
    return ConstantFoldBinaryOpOperands(Opcode, CLHS, CRHS, Q.DL);

  // Canonicalize the constant to the RHS if this is a commutative operation.
  if (Instruction::isCommutative(Opcode))
    std::swap(Op0, Op1);
}
return nullptr;
560}

562/// Given operands for an Add, see if we can fold the result.
563/// If not, this returns null.
564static Value *SimplifyAddInst(Value *Op0, Value *Op1, bool IsNSW, bool IsNUW,
                            const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::Add, Op0, Op1, Q))
  return C;

// X + undef -> undef
if (match(Op1, m_Undef()))
  return Op1;

// X + 0 -> X
if (match(Op1, m_Zero()))
  return Op0;

// If two operands are negative, return 0.
if (isKnownNegation(Op0, Op1))
  return Constant::getNullValue(Op0->getType());

// X + (Y - X) -> Y
// (Y - X) + X -> Y
// Eg: X + -X -> 0
Value *Y = nullptr;
if (match(Op1, m_Sub(m_Value(Y), m_Specific(Op0))) ||
    match(Op0, m_Sub(m_Value(Y), m_Specific(Op1))))
  return Y;

// X + ~X -> -1   since   ~X = -X-1
Type *Ty = Op0->getType();
if (match(Op0, m_Not(m_Specific(Op1))) ||
    match(Op1, m_Not(m_Specific(Op0))))
  return Constant::getAllOnesValue(Ty);

// add nsw/nuw (xor Y, signmask), signmask --> Y
// The no-wrapping add guarantees that the top bit will be set by the add.
// Therefore, the xor must be clearing the already set sign bit of Y.
if ((IsNSW || IsNUW) && match(Op1, m_SignMask()) &&
    match(Op0, m_Xor(m_Value(Y), m_SignMask())))
  return Y;

// add nuw %x, -1  ->  -1, because %x can only be 0.
if (IsNUW && match(Op1, m_AllOnes()))
  return Op1; // Which is -1.

/// i1 add -> xor.
if (MaxRecurse && Op0->getType()->isIntOrIntVectorTy(1))
  if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
    return V;

// Try some generic simplifications for associative operations.
if (Value *V = SimplifyAssociativeBinOp(Instruction::Add, Op0, Op1, Q,
                                        MaxRecurse))
  return V;

// Threading Add over selects and phi nodes is pointless, so don't bother.
// Threading over the select in "A + select(cond, B, C)" means evaluating
// "A+B" and "A+C" and seeing if they are equal; but they are equal if and
// only if B and C are equal.  If B and C are equal then (since we assume
// that operands have already been simplified) "select(cond, B, C)" should
// have been simplified to the common value of B and C already.  Analysing
// "A+B" and "A+C" thus gains nothing, but costs compile time.  Similarly
// for threading over phi nodes.

return nullptr;
626}

628Value *llvm::SimplifyAddInst(Value *Op0, Value *Op1, bool IsNSW, bool IsNUW,
                           const SimplifyQuery &Query) {
return ::SimplifyAddInst(Op0, Op1, IsNSW, IsNUW, Query, RecursionLimit);
631}

633/// Compute the base pointer and cumulative constant offsets for V.
634///
635/// This strips all constant offsets off of V, leaving it the base pointer, and
636/// accumulates the total constant offset applied in the returned constant. It
637/// returns 0 if V is not a pointer, and returns the constant '0' if there are
638/// no constant offsets applied.
639///
640/// This is very similar to GetPointerBaseWithConstantOffset except it doesn't
641/// follow non-inbounds geps. This allows it to remain usable for icmp ult/etc.
642/// folding.
643static Constant *stripAndComputeConstantOffsets(const DataLayout &DL, Value *&V,
                                              bool AllowNonInbounds = false) {
assert(V->getType()->isPtrOrPtrVectorTy())(static_cast <bool> (V->getType()->isPtrOrPtrVectorTy
()) ? void (0) : __assert_fail ("V->getType()->isPtrOrPtrVectorTy()"
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 645, __extension__ __PRETTY_FUNCTION__));

Type *IntPtrTy = DL.getIntPtrType(V->getType())->getScalarType();
APInt Offset = APInt::getNullValue(IntPtrTy->getIntegerBitWidth());

// Even though we don't look through PHI nodes, we could be called on an
// instruction in an unreachable block, which may be on a cycle.
SmallPtrSet<Value *, 4> Visited;
Visited.insert(V);
do {
  if (GEPOperator *GEP = dyn_cast<GEPOperator>(V)) {
    if ((!AllowNonInbounds && !GEP->isInBounds()) ||
        !GEP->accumulateConstantOffset(DL, Offset))
      break;
    V = GEP->getPointerOperand();
  } else if (Operator::getOpcode(V) == Instruction::BitCast) {
    V = cast<Operator>(V)->getOperand(0);
  } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(V)) {
    if (GA->isInterposable())
      break;
    V = GA->getAliasee();
  } else {
    if (auto CS = CallSite(V))
      if (Value *RV = CS.getReturnedArgOperand()) {
        V = RV;
        continue;
      }
    break;
  }
  assert(V->getType()->isPtrOrPtrVectorTy() && "Unexpected operand type!")(static_cast <bool> (V->getType()->isPtrOrPtrVectorTy
() && "Unexpected operand type!") ? void (0) : __assert_fail
 ("V->getType()->isPtrOrPtrVectorTy() && \"Unexpected operand type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 674, __extension__ __PRETTY_FUNCTION__));
} while (Visited.insert(V).second);

Constant *OffsetIntPtr = ConstantInt::get(IntPtrTy, Offset);
if (V->getType()->isVectorTy())
  return ConstantVector::getSplat(V->getType()->getVectorNumElements(),
                                  OffsetIntPtr);
return OffsetIntPtr;
682}

684/// Compute the constant difference between two pointer values.
685/// If the difference is not a constant, returns zero.
686static Constant *computePointerDifference(const DataLayout &DL, Value *LHS,
                                        Value *RHS) {
Constant *LHSOffset = stripAndComputeConstantOffsets(DL, LHS);
Constant *RHSOffset = stripAndComputeConstantOffsets(DL, RHS);

// If LHS and RHS are not related via constant offsets to the same base
// value, there is nothing we can do here.
if (LHS != RHS)
  return nullptr;

// Otherwise, the difference of LHS - RHS can be computed as:
//    LHS - RHS
//  = (LHSOffset + Base) - (RHSOffset + Base)
//  = LHSOffset - RHSOffset
return ConstantExpr::getSub(LHSOffset, RHSOffset);
701}

703/// Given operands for a Sub, see if we can fold the result.
704/// If not, this returns null.
705static Value *SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
                            const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::Sub, Op0, Op1, Q))
  return C;

// X - undef -> undef
// undef - X -> undef
if (match(Op0, m_Undef()) || match(Op1, m_Undef()))
  return UndefValue::get(Op0->getType());

// X - 0 -> X
if (match(Op1, m_Zero()))
  return Op0;

// X - X -> 0
if (Op0 == Op1)
  return Constant::getNullValue(Op0->getType());

// Is this a negation?
if (match(Op0, m_Zero())) {
  // 0 - X -> 0 if the sub is NUW.
  if (isNUW)
    return Constant::getNullValue(Op0->getType());

  KnownBits Known = computeKnownBits(Op1, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
  if (Known.Zero.isMaxSignedValue()) {
    // Op1 is either 0 or the minimum signed value. If the sub is NSW, then
    // Op1 must be 0 because negating the minimum signed value is undefined.
    if (isNSW)
      return Constant::getNullValue(Op0->getType());

    // 0 - X -> X if X is 0 or the minimum signed value.
    return Op1;
  }
}

// (X + Y) - Z -> X + (Y - Z) or Y + (X - Z) if everything simplifies.
// For example, (X + Y) - Y -> X; (Y + X) - Y -> X
Value *X = nullptr, *Y = nullptr, *Z = Op1;
if (MaxRecurse && match(Op0, m_Add(m_Value(X), m_Value(Y)))) { // (X + Y) - Z
  // See if "V === Y - Z" simplifies.
  if (Value *V = SimplifyBinOp(Instruction::Sub, Y, Z, Q, MaxRecurse-1))
    // It does!  Now see if "X + V" simplifies.
    if (Value *W = SimplifyBinOp(Instruction::Add, X, V, Q, MaxRecurse-1)) {
      // It does, we successfully reassociated!
      ++NumReassoc;
      return W;
    }
  // See if "V === X - Z" simplifies.
  if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
    // It does!  Now see if "Y + V" simplifies.
    if (Value *W = SimplifyBinOp(Instruction::Add, Y, V, Q, MaxRecurse-1)) {
      // It does, we successfully reassociated!
      ++NumReassoc;
      return W;
    }
}

// X - (Y + Z) -> (X - Y) - Z or (X - Z) - Y if everything simplifies.
// For example, X - (X + 1) -> -1
X = Op0;
if (MaxRecurse && match(Op1, m_Add(m_Value(Y), m_Value(Z)))) { // X - (Y + Z)
  // See if "V === X - Y" simplifies.
  if (Value *V = SimplifyBinOp(Instruction::Sub, X, Y, Q, MaxRecurse-1))
    // It does!  Now see if "V - Z" simplifies.
    if (Value *W = SimplifyBinOp(Instruction::Sub, V, Z, Q, MaxRecurse-1)) {
      // It does, we successfully reassociated!
      ++NumReassoc;
      return W;
    }
  // See if "V === X - Z" simplifies.
  if (Value *V = SimplifyBinOp(Instruction::Sub, X, Z, Q, MaxRecurse-1))
    // It does!  Now see if "V - Y" simplifies.
    if (Value *W = SimplifyBinOp(Instruction::Sub, V, Y, Q, MaxRecurse-1)) {
      // It does, we successfully reassociated!
      ++NumReassoc;
      return W;
    }
}

// Z - (X - Y) -> (Z - X) + Y if everything simplifies.
// For example, X - (X - Y) -> Y.
Z = Op0;
if (MaxRecurse && match(Op1, m_Sub(m_Value(X), m_Value(Y)))) // Z - (X - Y)
  // See if "V === Z - X" simplifies.
  if (Value *V = SimplifyBinOp(Instruction::Sub, Z, X, Q, MaxRecurse-1))
    // It does!  Now see if "V + Y" simplifies.
    if (Value *W = SimplifyBinOp(Instruction::Add, V, Y, Q, MaxRecurse-1)) {
      // It does, we successfully reassociated!
      ++NumReassoc;
      return W;
    }

// trunc(X) - trunc(Y) -> trunc(X - Y) if everything simplifies.
if (MaxRecurse && match(Op0, m_Trunc(m_Value(X))) &&
    match(Op1, m_Trunc(m_Value(Y))))
  if (X->getType() == Y->getType())
    // See if "V === X - Y" simplifies.
    if (Value *V = SimplifyBinOp(Instruction::Sub, X, Y, Q, MaxRecurse-1))
      // It does!  Now see if "trunc V" simplifies.
      if (Value *W = SimplifyCastInst(Instruction::Trunc, V, Op0->getType(),
                                      Q, MaxRecurse - 1))
        // It does, return the simplified "trunc V".
        return W;

// Variations on GEP(base, I, ...) - GEP(base, i, ...) -> GEP(null, I-i, ...).
if (match(Op0, m_PtrToInt(m_Value(X))) &&
    match(Op1, m_PtrToInt(m_Value(Y))))
  if (Constant *Result = computePointerDifference(Q.DL, X, Y))
    return ConstantExpr::getIntegerCast(Result, Op0->getType(), true);

// i1 sub -> xor.
if (MaxRecurse && Op0->getType()->isIntOrIntVectorTy(1))
  if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
    return V;

// Threading Sub over selects and phi nodes is pointless, so don't bother.
// Threading over the select in "A - select(cond, B, C)" means evaluating
// "A-B" and "A-C" and seeing if they are equal; but they are equal if and
// only if B and C are equal.  If B and C are equal then (since we assume
// that operands have already been simplified) "select(cond, B, C)" should
// have been simplified to the common value of B and C already.  Analysing
// "A-B" and "A-C" thus gains nothing, but costs compile time.  Similarly
// for threading over phi nodes.

return nullptr;
831}

833Value *llvm::SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
                           const SimplifyQuery &Q) {
return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Q, RecursionLimit);
836}

838/// Given operands for a Mul, see if we can fold the result.
839/// If not, this returns null.
840static Value *SimplifyMulInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                            unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::Mul, Op0, Op1, Q))
  return C;

// X * undef -> 0
// X * 0 -> 0
if (match(Op1, m_CombineOr(m_Undef(), m_Zero())))
  return Constant::getNullValue(Op0->getType());

// X * 1 -> X
if (match(Op1, m_One()))
  return Op0;

// (X / Y) * Y -> X if the division is exact.
Value *X = nullptr;
if (match(Op0, m_Exact(m_IDiv(m_Value(X), m_Specific(Op1)))) || // (X / Y) * Y
    match(Op1, m_Exact(m_IDiv(m_Value(X), m_Specific(Op0)))))   // Y * (X / Y)
  return X;

// i1 mul -> and.
if (MaxRecurse && Op0->getType()->isIntOrIntVectorTy(1))
  if (Value *V = SimplifyAndInst(Op0, Op1, Q, MaxRecurse-1))
    return V;

// Try some generic simplifications for associative operations.
if (Value *V = SimplifyAssociativeBinOp(Instruction::Mul, Op0, Op1, Q,
                                        MaxRecurse))
  return V;

// Mul distributes over Add. Try some generic simplifications based on this.
if (Value *V = ExpandBinOp(Instruction::Mul, Op0, Op1, Instruction::Add,
                           Q, MaxRecurse))
  return V;

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Instruction::Mul, Op0, Op1, Q,
                                       MaxRecurse))
    return V;

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Instruction::Mul, Op0, Op1, Q,
                                    MaxRecurse))
    return V;

return nullptr;
890}

892Value *llvm::SimplifyMulInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyMulInst(Op0, Op1, Q, RecursionLimit);
894}

896/// Check for common or similar folds of integer division or integer remainder.
897/// This applies to all 4 opcodes (sdiv/udiv/srem/urem).
898static Value *simplifyDivRem(Value *Op0, Value *Op1, bool IsDiv) {
Type *Ty = Op0->getType();

// X / undef -> undef
// X % undef -> undef
if (match(Op1, m_Undef()))
  return Op1;

// X / 0 -> undef
// X % 0 -> undef
// We don't need to preserve faults!
if (match(Op1, m_Zero()))
  return UndefValue::get(Ty);

// If any element of a constant divisor vector is zero or undef, the whole op
// is undef.
auto *Op1C = dyn_cast<Constant>(Op1);
if (Op1C && Ty->isVectorTy()) {
  unsigned NumElts = Ty->getVectorNumElements();
  for (unsigned i = 0; i != NumElts; ++i) {
    Constant *Elt = Op1C->getAggregateElement(i);
    if (Elt && (Elt->isNullValue() || isa<UndefValue>(Elt)))
      return UndefValue::get(Ty);
  }
}

// undef / X -> 0
// undef % X -> 0
if (match(Op0, m_Undef()))
  return Constant::getNullValue(Ty);

// 0 / X -> 0
// 0 % X -> 0
if (match(Op0, m_Zero()))
  return Constant::getNullValue(Op0->getType());

// X / X -> 1
// X % X -> 0
if (Op0 == Op1)
  return IsDiv ? ConstantInt::get(Ty, 1) : Constant::getNullValue(Ty);

// X / 1 -> X
// X % 1 -> 0
// If this is a boolean op (single-bit element type), we can't have
// division-by-zero or remainder-by-zero, so assume the divisor is 1.
// Similarly, if we're zero-extending a boolean divisor, then assume it's a 1.
Value *X;
if (match(Op1, m_One()) || Ty->isIntOrIntVectorTy(1) ||
    (match(Op1, m_ZExt(m_Value(X))) && X->getType()->isIntOrIntVectorTy(1)))
  return IsDiv ? Op0 : Constant::getNullValue(Ty);

return nullptr;
950}

952/// Given a predicate and two operands, return true if the comparison is true.
953/// This is a helper for div/rem simplification where we return some other value
954/// when we can prove a relationship between the operands.
955static bool isICmpTrue(ICmpInst::Predicate Pred, Value *LHS, Value *RHS,
                     const SimplifyQuery &Q, unsigned MaxRecurse) {
Value *V = SimplifyICmpInst(Pred, LHS, RHS, Q, MaxRecurse);
Constant *C = dyn_cast_or_null<Constant>(V);
return (C && C->isAllOnesValue());
960}

962/// Return true if we can simplify X / Y to 0. Remainder can adapt that answer
963/// to simplify X % Y to X.
964static bool isDivZero(Value *X, Value *Y, const SimplifyQuery &Q,
                    unsigned MaxRecurse, bool IsSigned) {
// Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--)
  return false;

if (IsSigned) {
  // |X| / |Y| --> 0
  //
  // We require that 1 operand is a simple constant. That could be extended to
  // 2 variables if we computed the sign bit for each.
  //
  // Make sure that a constant is not the minimum signed value because taking
  // the abs() of that is undefined.
  Type *Ty = X->getType();
  const APInt *C;
  if (match(X, m_APInt(C)) && !C->isMinSignedValue()) {
    // Is the variable divisor magnitude always greater than the constant
    // dividend magnitude?
    // |Y| > |C| --> Y < -abs(C) or Y > abs(C)
    Constant *PosDividendC = ConstantInt::get(Ty, C->abs());
    Constant *NegDividendC = ConstantInt::get(Ty, -C->abs());
    if (isICmpTrue(CmpInst::ICMP_SLT, Y, NegDividendC, Q, MaxRecurse) ||
        isICmpTrue(CmpInst::ICMP_SGT, Y, PosDividendC, Q, MaxRecurse))
      return true;
  }
  if (match(Y, m_APInt(C))) {
    // Special-case: we can't take the abs() of a minimum signed value. If
    // that's the divisor, then all we have to do is prove that the dividend
    // is also not the minimum signed value.
    if (C->isMinSignedValue())
      return isICmpTrue(CmpInst::ICMP_NE, X, Y, Q, MaxRecurse);

    // Is the variable dividend magnitude always less than the constant
    // divisor magnitude?
    // |X| < |C| --> X > -abs(C) and X < abs(C)
    Constant *PosDivisorC = ConstantInt::get(Ty, C->abs());
    Constant *NegDivisorC = ConstantInt::get(Ty, -C->abs());
    if (isICmpTrue(CmpInst::ICMP_SGT, X, NegDivisorC, Q, MaxRecurse) &&
        isICmpTrue(CmpInst::ICMP_SLT, X, PosDivisorC, Q, MaxRecurse))
      return true;
  }
  return false;
}

// IsSigned == false.
// Is the dividend unsigned less than the divisor?
return isICmpTrue(ICmpInst::ICMP_ULT, X, Y, Q, MaxRecurse);
1012}

1014/// These are simplifications common to SDiv and UDiv.
1015static Value *simplifyDiv(Instruction::BinaryOps Opcode, Value *Op0, Value *Op1,
                        const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
  return C;

if (Value *V = simplifyDivRem(Op0, Op1, true))
  return V;

bool IsSigned = Opcode == Instruction::SDiv;

// (X * Y) / Y -> X if the multiplication does not overflow.
Value *X;
if (match(Op0, m_c_Mul(m_Value(X), m_Specific(Op1)))) {
  auto *Mul = cast<OverflowingBinaryOperator>(Op0);
  // If the Mul does not overflow, then we are good to go.
  if ((IsSigned && Mul->hasNoSignedWrap()) ||
      (!IsSigned && Mul->hasNoUnsignedWrap()))
    return X;
  // If X has the form X = A / Y, then X * Y cannot overflow.
  if ((IsSigned && match(X, m_SDiv(m_Value(), m_Specific(Op1)))) ||
      (!IsSigned && match(X, m_UDiv(m_Value(), m_Specific(Op1)))))
    return X;
}

// (X rem Y) / Y -> 0
if ((IsSigned && match(Op0, m_SRem(m_Value(), m_Specific(Op1)))) ||
    (!IsSigned && match(Op0, m_URem(m_Value(), m_Specific(Op1)))))
  return Constant::getNullValue(Op0->getType());

// (X /u C1) /u C2 -> 0 if C1 * C2 overflow
ConstantInt *C1, *C2;
if (!IsSigned && match(Op0, m_UDiv(m_Value(X), m_ConstantInt(C1))) &&
    match(Op1, m_ConstantInt(C2))) {
  bool Overflow;
  (void)C1->getValue().umul_ov(C2->getValue(), Overflow);
  if (Overflow)
    return Constant::getNullValue(Op0->getType());
}

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

if (isDivZero(Op0, Op1, Q, MaxRecurse, IsSigned))
  return Constant::getNullValue(Op0->getType());

return nullptr;
1070}

1072/// These are simplifications common to SRem and URem.
1073static Value *simplifyRem(Instruction::BinaryOps Opcode, Value *Op0, Value *Op1,
                        const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
  return C;

if (Value *V = simplifyDivRem(Op0, Op1, false))
  return V;

// (X % Y) % Y -> X % Y
if ((Opcode == Instruction::SRem &&
     match(Op0, m_SRem(m_Value(), m_Specific(Op1)))) ||
    (Opcode == Instruction::URem &&
     match(Op0, m_URem(m_Value(), m_Specific(Op1)))))
  return Op0;

// (X << Y) % X -> 0
if ((Opcode == Instruction::SRem &&
     match(Op0, m_NSWShl(m_Specific(Op1), m_Value()))) ||
    (Opcode == Instruction::URem &&
     match(Op0, m_NUWShl(m_Specific(Op1), m_Value()))))
  return Constant::getNullValue(Op0->getType());

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

// If X / Y == 0, then X % Y == X.
if (isDivZero(Op0, Op1, Q, MaxRecurse, Opcode == Instruction::SRem))
  return Op0;

return nullptr;
1112}

1114/// Given operands for an SDiv, see if we can fold the result.
1115/// If not, this returns null.
1116static Value *SimplifySDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                             unsigned MaxRecurse) {
// If two operands are negated and no signed overflow, return -1.
if (isKnownNegation(Op0, Op1, /*NeedNSW=*/true))
  return Constant::getAllOnesValue(Op0->getType());

return simplifyDiv(Instruction::SDiv, Op0, Op1, Q, MaxRecurse);
1123}

1125Value *llvm::SimplifySDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifySDivInst(Op0, Op1, Q, RecursionLimit);
1127}

1129/// Given operands for a UDiv, see if we can fold the result.
1130/// If not, this returns null.
1131static Value *SimplifyUDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                             unsigned MaxRecurse) {
return simplifyDiv(Instruction::UDiv, Op0, Op1, Q, MaxRecurse);
1134}

1136Value *llvm::SimplifyUDivInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyUDivInst(Op0, Op1, Q, RecursionLimit);
1138}

1140/// Given operands for an SRem, see if we can fold the result.
1141/// If not, this returns null.
1142static Value *SimplifySRemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                             unsigned MaxRecurse) {
// If the divisor is 0, the result is undefined, so assume the divisor is -1.
// srem Op0, (sext i1 X) --> srem Op0, -1 --> 0
Value *X;
if (match(Op1, m_SExt(m_Value(X))) && X->getType()->isIntOrIntVectorTy(1))
  return ConstantInt::getNullValue(Op0->getType());

// If the two operands are negated, return 0.
if (isKnownNegation(Op0, Op1))
  return ConstantInt::getNullValue(Op0->getType());

return simplifyRem(Instruction::SRem, Op0, Op1, Q, MaxRecurse);
1155}

1157Value *llvm::SimplifySRemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifySRemInst(Op0, Op1, Q, RecursionLimit);
1159}

1161/// Given operands for a URem, see if we can fold the result.
1162/// If not, this returns null.
1163static Value *SimplifyURemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                             unsigned MaxRecurse) {
return simplifyRem(Instruction::URem, Op0, Op1, Q, MaxRecurse);
1166}

1168Value *llvm::SimplifyURemInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyURemInst(Op0, Op1, Q, RecursionLimit);
1170}

1172/// Returns true if a shift by \c Amount always yields undef.
1173static bool isUndefShift(Value *Amount) {
Constant *C = dyn_cast<Constant>(Amount);
if (!C)
  return false;

// X shift by undef -> undef because it may shift by the bitwidth.
if (isa<UndefValue>(C))
  return true;

// Shifting by the bitwidth or more is undefined.
if (ConstantInt *CI = dyn_cast<ConstantInt>(C))
  if (CI->getValue().getLimitedValue() >=
      CI->getType()->getScalarSizeInBits())
    return true;

// If all lanes of a vector shift are undefined the whole shift is.
if (isa<ConstantVector>(C) || isa<ConstantDataVector>(C)) {
  for (unsigned I = 0, E = C->getType()->getVectorNumElements(); I != E; ++I)
    if (!isUndefShift(C->getAggregateElement(I)))
      return false;
  return true;
}

return false;
1197}

1199/// Given operands for an Shl, LShr or AShr, see if we can fold the result.
1200/// If not, this returns null.
1201static Value *SimplifyShift(Instruction::BinaryOps Opcode, Value *Op0,
                          Value *Op1, const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Opcode, Op0, Op1, Q))
  return C;

// 0 shift by X -> 0
if (match(Op0, m_Zero()))
  return Constant::getNullValue(Op0->getType());

// X shift by 0 -> X
// Shift-by-sign-extended bool must be shift-by-0 because shift-by-all-ones
// would be poison.
Value *X;
if (match(Op1, m_Zero()) ||
    (match(Op1, m_SExt(m_Value(X))) && X->getType()->isIntOrIntVectorTy(1)))
  return Op0;

// Fold undefined shifts.
if (isUndefShift(Op1))
  return UndefValue::get(Op0->getType());

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Opcode, Op0, Op1, Q, MaxRecurse))
    return V;

// If any bits in the shift amount make that value greater than or equal to
// the number of bits in the type, the shift is undefined.
KnownBits Known = computeKnownBits(Op1, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
if (Known.One.getLimitedValue() >= Known.getBitWidth())
  return UndefValue::get(Op0->getType());

// If all valid bits in the shift amount are known zero, the first operand is
// unchanged.
unsigned NumValidShiftBits = Log2_32_Ceil(Known.getBitWidth());
if (Known.countMinTrailingZeros() >= NumValidShiftBits)
  return Op0;

return nullptr;
1247}

1249/// Given operands for an Shl, LShr or AShr, see if we can
1250/// fold the result.  If not, this returns null.
1251static Value *SimplifyRightShift(Instruction::BinaryOps Opcode, Value *Op0,
                               Value *Op1, bool isExact, const SimplifyQuery &Q,
                               unsigned MaxRecurse) {
if (Value *V = SimplifyShift(Opcode, Op0, Op1, Q, MaxRecurse))
  return V;

// X >> X -> 0
if (Op0 == Op1)
  return Constant::getNullValue(Op0->getType());

// undef >> X -> 0
// undef >> X -> undef (if it's exact)
if (match(Op0, m_Undef()))
  return isExact ? Op0 : Constant::getNullValue(Op0->getType());

// The low bit cannot be shifted out of an exact shift if it is set.
if (isExact) {
  KnownBits Op0Known = computeKnownBits(Op0, Q.DL, /*Depth=*/0, Q.AC, Q.CxtI, Q.DT);
  if (Op0Known.One[0])
    return Op0;
}

return nullptr;
1274}

1276/// Given operands for an Shl, see if we can fold the result.
1277/// If not, this returns null.
1278static Value *SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
                            const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Value *V = SimplifyShift(Instruction::Shl, Op0, Op1, Q, MaxRecurse))
  return V;

// undef << X -> 0
// undef << X -> undef if (if it's NSW/NUW)
if (match(Op0, m_Undef()))
  return isNSW || isNUW ? Op0 : Constant::getNullValue(Op0->getType());

// (X >> A) << A -> X
Value *X;
if (match(Op0, m_Exact(m_Shr(m_Value(X), m_Specific(Op1)))))
  return X;

// shl nuw i8 C, %x  ->  C  iff C has sign bit set.
if (isNUW && match(Op0, m_Negative()))
  return Op0;
// NOTE: could use computeKnownBits() / LazyValueInfo,
// but the cost-benefit analysis suggests it isn't worth it.

return nullptr;
1300}

1302Value *llvm::SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
                           const SimplifyQuery &Q) {
return ::SimplifyShlInst(Op0, Op1, isNSW, isNUW, Q, RecursionLimit);
1305}

1307/// Given operands for an LShr, see if we can fold the result.
1308/// If not, this returns null.
1309static Value *SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Value *V = SimplifyRightShift(Instruction::LShr, Op0, Op1, isExact, Q,
                                  MaxRecurse))
    return V;

// (X << A) >> A -> X
Value *X;
if (match(Op0, m_NUWShl(m_Value(X), m_Specific(Op1))))
  return X;

return nullptr;
1321}

1323Value *llvm::SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact,
                            const SimplifyQuery &Q) {
return ::SimplifyLShrInst(Op0, Op1, isExact, Q, RecursionLimit);
1326}

1328/// Given operands for an AShr, see if we can fold the result.
1329/// If not, this returns null.
1330static Value *SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Value *V = SimplifyRightShift(Instruction::AShr, Op0, Op1, isExact, Q,
                                  MaxRecurse))
  return V;

// all ones >>a X -> -1
// Do not return Op0 because it may contain undef elements if it's a vector.
if (match(Op0, m_AllOnes()))
  return Constant::getAllOnesValue(Op0->getType());

// (X << A) >> A -> X
Value *X;
if (match(Op0, m_NSWShl(m_Value(X), m_Specific(Op1))))
  return X;

// Arithmetic shifting an all-sign-bit value is a no-op.
unsigned NumSignBits = ComputeNumSignBits(Op0, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
if (NumSignBits == Op0->getType()->getScalarSizeInBits())
  return Op0;

return nullptr;
1352}

1354Value *llvm::SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact,
                            const SimplifyQuery &Q) {
return ::SimplifyAShrInst(Op0, Op1, isExact, Q, RecursionLimit);
1357}

1359/// Commuted variants are assumed to be handled by calling this function again
1360/// with the parameters swapped.
1361static Value *simplifyUnsignedRangeCheck(ICmpInst *ZeroICmp,
                                       ICmpInst *UnsignedICmp, bool IsAnd) {
Value *X, *Y;

ICmpInst::Predicate EqPred;
if (!match(ZeroICmp, m_ICmp(EqPred, m_Value(Y), m_Zero())) ||
    !ICmpInst::isEquality(EqPred))
  return nullptr;

ICmpInst::Predicate UnsignedPred;
if (match(UnsignedICmp, m_ICmp(UnsignedPred, m_Value(X), m_Specific(Y))) &&
    ICmpInst::isUnsigned(UnsignedPred))
  ;
else if (match(UnsignedICmp,
               m_ICmp(UnsignedPred, m_Specific(Y), m_Value(X))) &&
         ICmpInst::isUnsigned(UnsignedPred))
  UnsignedPred = ICmpInst::getSwappedPredicate(UnsignedPred);
else
  return nullptr;

// X < Y && Y != 0  -->  X < Y
// X < Y || Y != 0  -->  Y != 0
if (UnsignedPred == ICmpInst::ICMP_ULT && EqPred == ICmpInst::ICMP_NE)
  return IsAnd ? UnsignedICmp : ZeroICmp;

// X >= Y || Y != 0  -->  true
// X >= Y || Y == 0  -->  X >= Y
if (UnsignedPred == ICmpInst::ICMP_UGE && !IsAnd) {
  if (EqPred == ICmpInst::ICMP_NE)
    return getTrue(UnsignedICmp->getType());
  return UnsignedICmp;
}

// X < Y && Y == 0  -->  false
if (UnsignedPred == ICmpInst::ICMP_ULT && EqPred == ICmpInst::ICMP_EQ &&
    IsAnd)
  return getFalse(UnsignedICmp->getType());

return nullptr;
1400}

1402/// Commuted variants are assumed to be handled by calling this function again
1403/// with the parameters swapped.
1404static Value *simplifyAndOfICmpsWithSameOperands(ICmpInst *Op0, ICmpInst *Op1) {
ICmpInst::Predicate Pred0, Pred1;
Value *A ,*B;
if (!match(Op0, m_ICmp(Pred0, m_Value(A), m_Value(B))) ||
    !match(Op1, m_ICmp(Pred1, m_Specific(A), m_Specific(B))))
  return nullptr;

// We have (icmp Pred0, A, B) & (icmp Pred1, A, B).
// If Op1 is always implied true by Op0, then Op0 is a subset of Op1, and we
// can eliminate Op1 from this 'and'.
if (ICmpInst::isImpliedTrueByMatchingCmp(Pred0, Pred1))
  return Op0;

// Check for any combination of predicates that are guaranteed to be disjoint.
if ((Pred0 == ICmpInst::getInversePredicate(Pred1)) ||
    (Pred0 == ICmpInst::ICMP_EQ && ICmpInst::isFalseWhenEqual(Pred1)) ||
    (Pred0 == ICmpInst::ICMP_SLT && Pred1 == ICmpInst::ICMP_SGT) ||
    (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_UGT))
  return getFalse(Op0->getType());

return nullptr;
1425}

1427/// Commuted variants are assumed to be handled by calling this function again
1428/// with the parameters swapped.
1429static Value *simplifyOrOfICmpsWithSameOperands(ICmpInst *Op0, ICmpInst *Op1) {
ICmpInst::Predicate Pred0, Pred1;
Value *A ,*B;
if (!match(Op0, m_ICmp(Pred0, m_Value(A), m_Value(B))) ||
    !match(Op1, m_ICmp(Pred1, m_Specific(A), m_Specific(B))))
  return nullptr;

// We have (icmp Pred0, A, B) | (icmp Pred1, A, B).
// If Op1 is always implied true by Op0, then Op0 is a subset of Op1, and we
// can eliminate Op0 from this 'or'.
if (ICmpInst::isImpliedTrueByMatchingCmp(Pred0, Pred1))
  return Op1;

// Check for any combination of predicates that cover the entire range of
// possibilities.
if ((Pred0 == ICmpInst::getInversePredicate(Pred1)) ||
    (Pred0 == ICmpInst::ICMP_NE && ICmpInst::isTrueWhenEqual(Pred1)) ||
    (Pred0 == ICmpInst::ICMP_SLE && Pred1 == ICmpInst::ICMP_SGE) ||
    (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_UGE))
  return getTrue(Op0->getType());

return nullptr;
1451}

1453/// Test if a pair of compares with a shared operand and 2 constants has an
1454/// empty set intersection, full set union, or if one compare is a superset of
1455/// the other.
1456static Value *simplifyAndOrOfICmpsWithConstants(ICmpInst *Cmp0, ICmpInst *Cmp1,
                                              bool IsAnd) {
// Look for this pattern: {and/or} (icmp X, C0), (icmp X, C1)).
if (Cmp0->getOperand(0) != Cmp1->getOperand(0))
  return nullptr;

const APInt *C0, *C1;
if (!match(Cmp0->getOperand(1), m_APInt(C0)) ||
    !match(Cmp1->getOperand(1), m_APInt(C1)))
  return nullptr;

auto Range0 = ConstantRange::makeExactICmpRegion(Cmp0->getPredicate(), *C0);
auto Range1 = ConstantRange::makeExactICmpRegion(Cmp1->getPredicate(), *C1);

// For and-of-compares, check if the intersection is empty:
// (icmp X, C0) && (icmp X, C1) --> empty set --> false
if (IsAnd && Range0.intersectWith(Range1).isEmptySet())
  return getFalse(Cmp0->getType());

// For or-of-compares, check if the union is full:
// (icmp X, C0) || (icmp X, C1) --> full set --> true
if (!IsAnd && Range0.unionWith(Range1).isFullSet())
  return getTrue(Cmp0->getType());

// Is one range a superset of the other?
// If this is and-of-compares, take the smaller set:
// (icmp sgt X, 4) && (icmp sgt X, 42) --> icmp sgt X, 42
// If this is or-of-compares, take the larger set:
// (icmp sgt X, 4) || (icmp sgt X, 42) --> icmp sgt X, 4
if (Range0.contains(Range1))
  return IsAnd ? Cmp1 : Cmp0;
if (Range1.contains(Range0))
  return IsAnd ? Cmp0 : Cmp1;

return nullptr;
1491}

1493static Value *simplifyAndOrOfICmpsWithZero(ICmpInst *Cmp0, ICmpInst *Cmp1,
                                         bool IsAnd) {
ICmpInst::Predicate P0 = Cmp0->getPredicate(), P1 = Cmp1->getPredicate();
if (!match(Cmp0->getOperand(1), m_Zero()) ||
    !match(Cmp1->getOperand(1), m_Zero()) || P0 != P1)
  return nullptr;

if ((IsAnd && P0 != ICmpInst::ICMP_NE) || (!IsAnd && P1 != ICmpInst::ICMP_EQ))
  return nullptr;

// We have either "(X == 0 || Y == 0)" or "(X != 0 && Y != 0)".
Value *X = Cmp0->getOperand(0);
Value *Y = Cmp1->getOperand(0);

// If one of the compares is a masked version of a (not) null check, then
// that compare implies the other, so we eliminate the other. Optionally, look
// through a pointer-to-int cast to match a null check of a pointer type.

// (X == 0) || (([ptrtoint] X & ?) == 0) --> ([ptrtoint] X & ?) == 0
// (X == 0) || ((? & [ptrtoint] X) == 0) --> (? & [ptrtoint] X) == 0
// (X != 0) && (([ptrtoint] X & ?) != 0) --> ([ptrtoint] X & ?) != 0
// (X != 0) && ((? & [ptrtoint] X) != 0) --> (? & [ptrtoint] X) != 0
if (match(Y, m_c_And(m_Specific(X), m_Value())) ||
    match(Y, m_c_And(m_PtrToInt(m_Specific(X)), m_Value())))
  return Cmp1;

// (([ptrtoint] Y & ?) == 0) || (Y == 0) --> ([ptrtoint] Y & ?) == 0
// ((? & [ptrtoint] Y) == 0) || (Y == 0) --> (? & [ptrtoint] Y) == 0
// (([ptrtoint] Y & ?) != 0) && (Y != 0) --> ([ptrtoint] Y & ?) != 0
// ((? & [ptrtoint] Y) != 0) && (Y != 0) --> (? & [ptrtoint] Y) != 0
if (match(X, m_c_And(m_Specific(Y), m_Value())) ||
    match(X, m_c_And(m_PtrToInt(m_Specific(Y)), m_Value())))
  return Cmp0;

return nullptr;
1528}

1530static Value *simplifyAndOfICmpsWithAdd(ICmpInst *Op0, ICmpInst *Op1) {
// (icmp (add V, C0), C1) & (icmp V, C0)
ICmpInst::Predicate Pred0, Pred1;
const APInt *C0, *C1;
Value *V;
if (!match(Op0, m_ICmp(Pred0, m_Add(m_Value(V), m_APInt(C0)), m_APInt(C1))))
  return nullptr;

if (!match(Op1, m_ICmp(Pred1, m_Specific(V), m_Value())))
  return nullptr;

auto *AddInst = cast<BinaryOperator>(Op0->getOperand(0));
if (AddInst->getOperand(1) != Op1->getOperand(1))
  return nullptr;

Type *ITy = Op0->getType();
bool isNSW = AddInst->hasNoSignedWrap();
bool isNUW = AddInst->hasNoUnsignedWrap();

const APInt Delta = *C1 - *C0;
if (C0->isStrictlyPositive()) {
  if (Delta == 2) {
    if (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_SGT)
      return getFalse(ITy);
    if (Pred0 == ICmpInst::ICMP_SLT && Pred1 == ICmpInst::ICMP_SGT && isNSW)
      return getFalse(ITy);
  }
  if (Delta == 1) {
    if (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_SGT)
      return getFalse(ITy);
    if (Pred0 == ICmpInst::ICMP_SLE && Pred1 == ICmpInst::ICMP_SGT && isNSW)
      return getFalse(ITy);
  }
}
if (C0->getBoolValue() && isNUW) {
  if (Delta == 2)
    if (Pred0 == ICmpInst::ICMP_ULT && Pred1 == ICmpInst::ICMP_UGT)
      return getFalse(ITy);
  if (Delta == 1)
    if (Pred0 == ICmpInst::ICMP_ULE && Pred1 == ICmpInst::ICMP_UGT)
      return getFalse(ITy);
}

return nullptr;
1574}

1576static Value *simplifyAndOfICmps(ICmpInst *Op0, ICmpInst *Op1) {
if (Value *X = simplifyUnsignedRangeCheck(Op0, Op1, /*IsAnd=*/true))
  return X;
if (Value *X = simplifyUnsignedRangeCheck(Op1, Op0, /*IsAnd=*/true))
  return X;

if (Value *X = simplifyAndOfICmpsWithSameOperands(Op0, Op1))
  return X;
if (Value *X = simplifyAndOfICmpsWithSameOperands(Op1, Op0))
  return X;

if (Value *X = simplifyAndOrOfICmpsWithConstants(Op0, Op1, true))
  return X;

if (Value *X = simplifyAndOrOfICmpsWithZero(Op0, Op1, true))
  return X;

if (Value *X = simplifyAndOfICmpsWithAdd(Op0, Op1))
  return X;
if (Value *X = simplifyAndOfICmpsWithAdd(Op1, Op0))
  return X;

return nullptr;
1599}

1601static Value *simplifyOrOfICmpsWithAdd(ICmpInst *Op0, ICmpInst *Op1) {
// (icmp (add V, C0), C1) | (icmp V, C0)
ICmpInst::Predicate Pred0, Pred1;
const APInt *C0, *C1;
Value *V;
if (!match(Op0, m_ICmp(Pred0, m_Add(m_Value(V), m_APInt(C0)), m_APInt(C1))))
  return nullptr;

if (!match(Op1, m_ICmp(Pred1, m_Specific(V), m_Value())))
  return nullptr;

auto *AddInst = cast<BinaryOperator>(Op0->getOperand(0));
if (AddInst->getOperand(1) != Op1->getOperand(1))
  return nullptr;

Type *ITy = Op0->getType();
bool isNSW = AddInst->hasNoSignedWrap();
bool isNUW = AddInst->hasNoUnsignedWrap();

const APInt Delta = *C1 - *C0;
if (C0->isStrictlyPositive()) {
  if (Delta == 2) {
    if (Pred0 == ICmpInst::ICMP_UGE && Pred1 == ICmpInst::ICMP_SLE)
      return getTrue(ITy);
    if (Pred0 == ICmpInst::ICMP_SGE && Pred1 == ICmpInst::ICMP_SLE && isNSW)
      return getTrue(ITy);
  }
  if (Delta == 1) {
    if (Pred0 == ICmpInst::ICMP_UGT && Pred1 == ICmpInst::ICMP_SLE)
      return getTrue(ITy);
    if (Pred0 == ICmpInst::ICMP_SGT && Pred1 == ICmpInst::ICMP_SLE && isNSW)
      return getTrue(ITy);
  }
}
if (C0->getBoolValue() && isNUW) {
  if (Delta == 2)
    if (Pred0 == ICmpInst::ICMP_UGE && Pred1 == ICmpInst::ICMP_ULE)
      return getTrue(ITy);
  if (Delta == 1)
    if (Pred0 == ICmpInst::ICMP_UGT && Pred1 == ICmpInst::ICMP_ULE)
      return getTrue(ITy);
}

return nullptr;
1645}

1647static Value *simplifyOrOfICmps(ICmpInst *Op0, ICmpInst *Op1) {
if (Value *X = simplifyUnsignedRangeCheck(Op0, Op1, /*IsAnd=*/false))
  return X;
if (Value *X = simplifyUnsignedRangeCheck(Op1, Op0, /*IsAnd=*/false))
  return X;

if (Value *X = simplifyOrOfICmpsWithSameOperands(Op0, Op1))
  return X;
if (Value *X = simplifyOrOfICmpsWithSameOperands(Op1, Op0))
  return X;

if (Value *X = simplifyAndOrOfICmpsWithConstants(Op0, Op1, false))
  return X;

if (Value *X = simplifyAndOrOfICmpsWithZero(Op0, Op1, false))
  return X;

if (Value *X = simplifyOrOfICmpsWithAdd(Op0, Op1))
  return X;
if (Value *X = simplifyOrOfICmpsWithAdd(Op1, Op0))
  return X;

return nullptr;
1670}

1672static Value *simplifyAndOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS, bool IsAnd) {
Value *LHS0 = LHS->getOperand(0), *LHS1 = LHS->getOperand(1);
Value *RHS0 = RHS->getOperand(0), *RHS1 = RHS->getOperand(1);
if (LHS0->getType() != RHS0->getType())
  return nullptr;

FCmpInst::Predicate PredL = LHS->getPredicate(), PredR = RHS->getPredicate();
if ((PredL == FCmpInst::FCMP_ORD && PredR == FCmpInst::FCMP_ORD && IsAnd) ||
    (PredL == FCmpInst::FCMP_UNO && PredR == FCmpInst::FCMP_UNO && !IsAnd)) {
  // (fcmp ord NNAN, X) & (fcmp ord X, Y) --> fcmp ord X, Y
  // (fcmp ord NNAN, X) & (fcmp ord Y, X) --> fcmp ord Y, X
  // (fcmp ord X, NNAN) & (fcmp ord X, Y) --> fcmp ord X, Y
  // (fcmp ord X, NNAN) & (fcmp ord Y, X) --> fcmp ord Y, X
  // (fcmp uno NNAN, X) | (fcmp uno X, Y) --> fcmp uno X, Y
  // (fcmp uno NNAN, X) | (fcmp uno Y, X) --> fcmp uno Y, X
  // (fcmp uno X, NNAN) | (fcmp uno X, Y) --> fcmp uno X, Y
  // (fcmp uno X, NNAN) | (fcmp uno Y, X) --> fcmp uno Y, X
  if ((isKnownNeverNaN(LHS0) && (LHS1 == RHS0 || LHS1 == RHS1)) ||
      (isKnownNeverNaN(LHS1) && (LHS0 == RHS0 || LHS0 == RHS1)))
    return RHS;

  // (fcmp ord X, Y) & (fcmp ord NNAN, X) --> fcmp ord X, Y
  // (fcmp ord Y, X) & (fcmp ord NNAN, X) --> fcmp ord Y, X
  // (fcmp ord X, Y) & (fcmp ord X, NNAN) --> fcmp ord X, Y
  // (fcmp ord Y, X) & (fcmp ord X, NNAN) --> fcmp ord Y, X
  // (fcmp uno X, Y) | (fcmp uno NNAN, X) --> fcmp uno X, Y
  // (fcmp uno Y, X) | (fcmp uno NNAN, X) --> fcmp uno Y, X
  // (fcmp uno X, Y) | (fcmp uno X, NNAN) --> fcmp uno X, Y
  // (fcmp uno Y, X) | (fcmp uno X, NNAN) --> fcmp uno Y, X
  if ((isKnownNeverNaN(RHS0) && (RHS1 == LHS0 || RHS1 == LHS1)) ||
      (isKnownNeverNaN(RHS1) && (RHS0 == LHS0 || RHS0 == LHS1)))
    return LHS;
}

return nullptr;
1707}

1709static Value *simplifyAndOrOfCmps(Value *Op0, Value *Op1, bool IsAnd) {
// Look through casts of the 'and' operands to find compares.
auto *Cast0 = dyn_cast<CastInst>(Op0);
auto *Cast1 = dyn_cast<CastInst>(Op1);
if (Cast0 && Cast1 && Cast0->getOpcode() == Cast1->getOpcode() &&
    Cast0->getSrcTy() == Cast1->getSrcTy()) {
  Op0 = Cast0->getOperand(0);
  Op1 = Cast1->getOperand(0);
}

Value *V = nullptr;
auto *ICmp0 = dyn_cast<ICmpInst>(Op0);
auto *ICmp1 = dyn_cast<ICmpInst>(Op1);
if (ICmp0 && ICmp1)
  V = IsAnd ? simplifyAndOfICmps(ICmp0, ICmp1) :
              simplifyOrOfICmps(ICmp0, ICmp1);

auto *FCmp0 = dyn_cast<FCmpInst>(Op0);
auto *FCmp1 = dyn_cast<FCmpInst>(Op1);
if (FCmp0 && FCmp1)
  V = simplifyAndOrOfFCmps(FCmp0, FCmp1, IsAnd);

if (!V)
  return nullptr;
if (!Cast0)
  return V;

// If we looked through casts, we can only handle a constant simplification
// because we are not allowed to create a cast instruction here.
if (auto *C = dyn_cast<Constant>(V))
  return ConstantExpr::getCast(Cast0->getOpcode(), C, Cast0->getType());

return nullptr;
1742}

1744/// Given operands for an And, see if we can fold the result.
1745/// If not, this returns null.
1746static Value *SimplifyAndInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                            unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::And, Op0, Op1, Q))
  return C;

// X & undef -> 0
if (match(Op1, m_Undef()))
  return Constant::getNullValue(Op0->getType());

// X & X = X
if (Op0 == Op1)
  return Op0;

// X & 0 = 0
if (match(Op1, m_Zero()))
  return Constant::getNullValue(Op0->getType());

// X & -1 = X
if (match(Op1, m_AllOnes()))
  return Op0;

// A & ~A  =  ~A & A  =  0
if (match(Op0, m_Not(m_Specific(Op1))) ||
    match(Op1, m_Not(m_Specific(Op0))))
  return Constant::getNullValue(Op0->getType());

// (A | ?) & A = A
if (match(Op0, m_c_Or(m_Specific(Op1), m_Value())))
  return Op1;

// A & (A | ?) = A
if (match(Op1, m_c_Or(m_Specific(Op0), m_Value())))
  return Op0;

// A mask that only clears known zeros of a shifted value is a no-op.
Value *X;
const APInt *Mask;
const APInt *ShAmt;
if (match(Op1, m_APInt(Mask))) {
  // If all bits in the inverted and shifted mask are clear:
  // and (shl X, ShAmt), Mask --> shl X, ShAmt
  if (match(Op0, m_Shl(m_Value(X), m_APInt(ShAmt))) &&
      (~(*Mask)).lshr(*ShAmt).isNullValue())
    return Op0;

  // If all bits in the inverted and shifted mask are clear:
  // and (lshr X, ShAmt), Mask --> lshr X, ShAmt
  if (match(Op0, m_LShr(m_Value(X), m_APInt(ShAmt))) &&
      (~(*Mask)).shl(*ShAmt).isNullValue())
    return Op0;
}

// A & (-A) = A if A is a power of two or zero.
if (match(Op0, m_Neg(m_Specific(Op1))) ||
    match(Op1, m_Neg(m_Specific(Op0)))) {
  if (isKnownToBeAPowerOfTwo(Op0, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
                             Q.DT))
    return Op0;
  if (isKnownToBeAPowerOfTwo(Op1, Q.DL, /*OrZero*/ true, 0, Q.AC, Q.CxtI,
                             Q.DT))
    return Op1;
}

if (Value *V = simplifyAndOrOfCmps(Op0, Op1, true))
  return V;

// Try some generic simplifications for associative operations.
if (Value *V = SimplifyAssociativeBinOp(Instruction::And, Op0, Op1, Q,
                                        MaxRecurse))
  return V;

// And distributes over Or.  Try some generic simplifications based on this.
if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Or,
                           Q, MaxRecurse))
  return V;

// And distributes over Xor.  Try some generic simplifications based on this.
if (Value *V = ExpandBinOp(Instruction::And, Op0, Op1, Instruction::Xor,
                           Q, MaxRecurse))
  return V;

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Instruction::And, Op0, Op1, Q,
                                       MaxRecurse))
    return V;

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Instruction::And, Op0, Op1, Q,
                                    MaxRecurse))
    return V;

return nullptr;
1842}

1844Value *llvm::SimplifyAndInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyAndInst(Op0, Op1, Q, RecursionLimit);
1846}

1848/// Given operands for an Or, see if we can fold the result.
1849/// If not, this returns null.
1850static Value *SimplifyOrInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                           unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::Or, Op0, Op1, Q))
  return C;

// X | undef -> -1
// X | -1 = -1
// Do not return Op1 because it may contain undef elements if it's a vector.
if (match(Op1, m_Undef()) || match(Op1, m_AllOnes()))
  return Constant::getAllOnesValue(Op0->getType());

// X | X = X
// X | 0 = X
if (Op0 == Op1 || match(Op1, m_Zero()))
  return Op0;

// A | ~A  =  ~A | A  =  -1
if (match(Op0, m_Not(m_Specific(Op1))) ||
    match(Op1, m_Not(m_Specific(Op0))))
  return Constant::getAllOnesValue(Op0->getType());

// (A & ?) | A = A
if (match(Op0, m_c_And(m_Specific(Op1), m_Value())))
  return Op1;

// A | (A & ?) = A
if (match(Op1, m_c_And(m_Specific(Op0), m_Value())))
  return Op0;

// ~(A & ?) | A = -1
if (match(Op0, m_Not(m_c_And(m_Specific(Op1), m_Value()))))
  return Constant::getAllOnesValue(Op1->getType());

// A | ~(A & ?) = -1
if (match(Op1, m_Not(m_c_And(m_Specific(Op1), m_Value()))))
  return Constant::getAllOnesValue(Op0->getType());

Value *A, *B;
// (A & ~B) | (A ^ B) -> (A ^ B)
// (~B & A) | (A ^ B) -> (A ^ B)
// (A & ~B) | (B ^ A) -> (B ^ A)
// (~B & A) | (B ^ A) -> (B ^ A)
if (match(Op1, m_Xor(m_Value(A), m_Value(B))) &&
    (match(Op0, m_c_And(m_Specific(A), m_Not(m_Specific(B)))) ||
     match(Op0, m_c_And(m_Not(m_Specific(A)), m_Specific(B)))))
  return Op1;

// Commute the 'or' operands.
// (A ^ B) | (A & ~B) -> (A ^ B)
// (A ^ B) | (~B & A) -> (A ^ B)
// (B ^ A) | (A & ~B) -> (B ^ A)
// (B ^ A) | (~B & A) -> (B ^ A)
if (match(Op0, m_Xor(m_Value(A), m_Value(B))) &&
    (match(Op1, m_c_And(m_Specific(A), m_Not(m_Specific(B)))) ||
     match(Op1, m_c_And(m_Not(m_Specific(A)), m_Specific(B)))))
  return Op0;

// (A & B) | (~A ^ B) -> (~A ^ B)
// (B & A) | (~A ^ B) -> (~A ^ B)
// (A & B) | (B ^ ~A) -> (B ^ ~A)
// (B & A) | (B ^ ~A) -> (B ^ ~A)
if (match(Op0, m_And(m_Value(A), m_Value(B))) &&
    (match(Op1, m_c_Xor(m_Specific(A), m_Not(m_Specific(B)))) ||
     match(Op1, m_c_Xor(m_Not(m_Specific(A)), m_Specific(B)))))
  return Op1;

// (~A ^ B) | (A & B) -> (~A ^ B)
// (~A ^ B) | (B & A) -> (~A ^ B)
// (B ^ ~A) | (A & B) -> (B ^ ~A)
// (B ^ ~A) | (B & A) -> (B ^ ~A)
if (match(Op1, m_And(m_Value(A), m_Value(B))) &&
    (match(Op0, m_c_Xor(m_Specific(A), m_Not(m_Specific(B)))) ||
     match(Op0, m_c_Xor(m_Not(m_Specific(A)), m_Specific(B)))))
  return Op0;

if (Value *V = simplifyAndOrOfCmps(Op0, Op1, false))
  return V;

// Try some generic simplifications for associative operations.
if (Value *V = SimplifyAssociativeBinOp(Instruction::Or, Op0, Op1, Q,
                                        MaxRecurse))
  return V;

// Or distributes over And.  Try some generic simplifications based on this.
if (Value *V = ExpandBinOp(Instruction::Or, Op0, Op1, Instruction::And, Q,
                           MaxRecurse))
  return V;

// If the operation is with the result of a select instruction, check whether
// operating on either branch of the select always yields the same value.
if (isa<SelectInst>(Op0) || isa<SelectInst>(Op1))
  if (Value *V = ThreadBinOpOverSelect(Instruction::Or, Op0, Op1, Q,
                                       MaxRecurse))
    return V;

// (A & C1)|(B & C2)
const APInt *C1, *C2;
if (match(Op0, m_And(m_Value(A), m_APInt(C1))) &&
    match(Op1, m_And(m_Value(B), m_APInt(C2)))) {
  if (*C1 == ~*C2) {
    // (A & C1)|(B & C2)
    // If we have: ((V + N) & C1) | (V & C2)
    // .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
    // replace with V+N.
    Value *N;
    if (C2->isMask() && // C2 == 0+1+
        match(A, m_c_Add(m_Specific(B), m_Value(N)))) {
      // Add commutes, try both ways.
      if (MaskedValueIsZero(N, *C2, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
        return A;
    }
    // Or commutes, try both ways.
    if (C1->isMask() &&
        match(B, m_c_Add(m_Specific(A), m_Value(N)))) {
      // Add commutes, try both ways.
      if (MaskedValueIsZero(N, *C1, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
        return B;
    }
  }
}

// If the operation is with the result of a phi instruction, check whether
// operating on all incoming values of the phi always yields the same value.
if (isa<PHINode>(Op0) || isa<PHINode>(Op1))
  if (Value *V = ThreadBinOpOverPHI(Instruction::Or, Op0, Op1, Q, MaxRecurse))
    return V;

return nullptr;
1978}

1980Value *llvm::SimplifyOrInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyOrInst(Op0, Op1, Q, RecursionLimit);
1982}

1984/// Given operands for a Xor, see if we can fold the result.
1985/// If not, this returns null.
1986static Value *SimplifyXorInst(Value *Op0, Value *Op1, const SimplifyQuery &Q,
                            unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::Xor, Op0, Op1, Q))
  return C;

// A ^ undef -> undef
if (match(Op1, m_Undef()))
  return Op1;

// A ^ 0 = A
if (match(Op1, m_Zero()))
  return Op0;

// A ^ A = 0
if (Op0 == Op1)
  return Constant::getNullValue(Op0->getType());

// A ^ ~A  =  ~A ^ A  =  -1
if (match(Op0, m_Not(m_Specific(Op1))) ||
    match(Op1, m_Not(m_Specific(Op0))))
  return Constant::getAllOnesValue(Op0->getType());

// Try some generic simplifications for associative operations.
if (Value *V = SimplifyAssociativeBinOp(Instruction::Xor, Op0, Op1, Q,
                                        MaxRecurse))
  return V;

// Threading Xor over selects and phi nodes is pointless, so don't bother.
// Threading over the select in "A ^ select(cond, B, C)" means evaluating
// "A^B" and "A^C" and seeing if they are equal; but they are equal if and
// only if B and C are equal.  If B and C are equal then (since we assume
// that operands have already been simplified) "select(cond, B, C)" should
// have been simplified to the common value of B and C already.  Analysing
// "A^B" and "A^C" thus gains nothing, but costs compile time.  Similarly
// for threading over phi nodes.

return nullptr;
2023}

2025Value *llvm::SimplifyXorInst(Value *Op0, Value *Op1, const SimplifyQuery &Q) {
return ::SimplifyXorInst(Op0, Op1, Q, RecursionLimit);
2027}


2030static Type *GetCompareTy(Value *Op) {
return CmpInst::makeCmpResultType(Op->getType());
2032}

2034/// Rummage around inside V looking for something equivalent to the comparison
2035/// "LHS Pred RHS". Return such a value if found, otherwise return null.
2036/// Helper function for analyzing max/min idioms.
2037static Value *ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred,
                                       Value *LHS, Value *RHS) {
SelectInst *SI = dyn_cast<SelectInst>(V);
if (!SI)
  return nullptr;
CmpInst *Cmp = dyn_cast<CmpInst>(SI->getCondition());
if (!Cmp)
  return nullptr;
Value *CmpLHS = Cmp->getOperand(0), *CmpRHS = Cmp->getOperand(1);
if (Pred == Cmp->getPredicate() && LHS == CmpLHS && RHS == CmpRHS)
  return Cmp;
if (Pred == CmpInst::getSwappedPredicate(Cmp->getPredicate()) &&
    LHS == CmpRHS && RHS == CmpLHS)
  return Cmp;
return nullptr;
2052}

2054// A significant optimization not implemented here is assuming that alloca
2055// addresses are not equal to incoming argument values. They don't *alias*,
2056// as we say, but that doesn't mean they aren't equal, so we take a
2057// conservative approach.
2058//
2059// This is inspired in part by C++11 5.10p1:
2060//   "Two pointers of the same type compare equal if and only if they are both
2061//    null, both point to the same function, or both represent the same
2062//    address."
2063//
2064// This is pretty permissive.
2065//
2066// It's also partly due to C11 6.5.9p6:
2067//   "Two pointers compare equal if and only if both are null pointers, both are
2068//    pointers to the same object (including a pointer to an object and a
2069//    subobject at its beginning) or function, both are pointers to one past the
2070//    last element of the same array object, or one is a pointer to one past the
2071//    end of one array object and the other is a pointer to the start of a
2072//    different array object that happens to immediately follow the first array
2073//    object in the address space.)
2074//
2075// C11's version is more restrictive, however there's no reason why an argument
2076// couldn't be a one-past-the-end value for a stack object in the caller and be
2077// equal to the beginning of a stack object in the callee.
2078//
2079// If the C and C++ standards are ever made sufficiently restrictive in this
2080// area, it may be possible to update LLVM's semantics accordingly and reinstate
2081// this optimization.
2082static Constant *
2083computePointerICmp(const DataLayout &DL, const TargetLibraryInfo *TLI,
                 const DominatorTree *DT, CmpInst::Predicate Pred,
                 AssumptionCache *AC, const Instruction *CxtI,
                 Value *LHS, Value *RHS) {
// First, skip past any trivial no-ops.
LHS = LHS->stripPointerCasts();
RHS = RHS->stripPointerCasts();

// A non-null pointer is not equal to a null pointer.
if (llvm::isKnownNonZero(LHS, DL) && isa<ConstantPointerNull>(RHS) &&
    (Pred == CmpInst::ICMP_EQ || Pred == CmpInst::ICMP_NE))
  return ConstantInt::get(GetCompareTy(LHS),
                          !CmpInst::isTrueWhenEqual(Pred));

// We can only fold certain predicates on pointer comparisons.
switch (Pred) {
default:
  return nullptr;

  // Equality comaprisons are easy to fold.
case CmpInst::ICMP_EQ:
case CmpInst::ICMP_NE:
  break;

  // We can only handle unsigned relational comparisons because 'inbounds' on
  // a GEP only protects against unsigned wrapping.
case CmpInst::ICMP_UGT:
case CmpInst::ICMP_UGE:
case CmpInst::ICMP_ULT:
case CmpInst::ICMP_ULE:
  // However, we have to switch them to their signed variants to handle
  // negative indices from the base pointer.
  Pred = ICmpInst::getSignedPredicate(Pred);
  break;
}

// Strip off any constant offsets so that we can reason about them.
// It's tempting to use getUnderlyingObject or even just stripInBoundsOffsets
// here and compare base addresses like AliasAnalysis does, however there are
// numerous hazards. AliasAnalysis and its utilities rely on special rules
// governing loads and stores which don't apply to icmps. Also, AliasAnalysis
// doesn't need to guarantee pointer inequality when it says NoAlias.
Constant *LHSOffset = stripAndComputeConstantOffsets(DL, LHS);
Constant *RHSOffset = stripAndComputeConstantOffsets(DL, RHS);

// If LHS and RHS are related via constant offsets to the same base
// value, we can replace it with an icmp which just compares the offsets.
if (LHS == RHS)
  return ConstantExpr::getICmp(Pred, LHSOffset, RHSOffset);

// Various optimizations for (in)equality comparisons.
if (Pred == CmpInst::ICMP_EQ || Pred == CmpInst::ICMP_NE) {
  // Different non-empty allocations that exist at the same time have
  // different addresses (if the program can tell). Global variables always
  // exist, so they always exist during the lifetime of each other and all
  // allocas. Two different allocas usually have different addresses...
  //
  // However, if there's an @llvm.stackrestore dynamically in between two
  // allocas, they may have the same address. It's tempting to reduce the
  // scope of the problem by only looking at *static* allocas here. That would
  // cover the majority of allocas while significantly reducing the likelihood
  // of having an @llvm.stackrestore pop up in the middle. However, it's not
  // actually impossible for an @llvm.stackrestore to pop up in the middle of
  // an entry block. Also, if we have a block that's not attached to a
  // function, we can't tell if it's "static" under the current definition.
  // Theoretically, this problem could be fixed by creating a new kind of
  // instruction kind specifically for static allocas. Such a new instruction
  // could be required to be at the top of the entry block, thus preventing it
  // from being subject to a @llvm.stackrestore. Instcombine could even
  // convert regular allocas into these special allocas. It'd be nifty.
  // However, until then, this problem remains open.
  //
  // So, we'll assume that two non-empty allocas have different addresses
  // for now.
  //
  // With all that, if the offsets are within the bounds of their allocations
  // (and not one-past-the-end! so we can't use inbounds!), and their
  // allocations aren't the same, the pointers are not equal.
  //
  // Note that it's not necessary to check for LHS being a global variable
  // address, due to canonicalization and constant folding.
  if (isa<AllocaInst>(LHS) &&
      (isa<AllocaInst>(RHS) || isa<GlobalVariable>(RHS))) {
    ConstantInt *LHSOffsetCI = dyn_cast<ConstantInt>(LHSOffset);
    ConstantInt *RHSOffsetCI = dyn_cast<ConstantInt>(RHSOffset);
    uint64_t LHSSize, RHSSize;
    ObjectSizeOpts Opts;
    Opts.NullIsUnknownSize =
        NullPointerIsDefined(cast<AllocaInst>(LHS)->getFunction());
    if (LHSOffsetCI && RHSOffsetCI &&
        getObjectSize(LHS, LHSSize, DL, TLI, Opts) &&
        getObjectSize(RHS, RHSSize, DL, TLI, Opts)) {
      const APInt &LHSOffsetValue = LHSOffsetCI->getValue();
      const APInt &RHSOffsetValue = RHSOffsetCI->getValue();
      if (!LHSOffsetValue.isNegative() &&
          !RHSOffsetValue.isNegative() &&
          LHSOffsetValue.ult(LHSSize) &&
          RHSOffsetValue.ult(RHSSize)) {
        return ConstantInt::get(GetCompareTy(LHS),
                                !CmpInst::isTrueWhenEqual(Pred));
      }
    }

    // Repeat the above check but this time without depending on DataLayout
    // or being able to compute a precise size.
    if (!cast<PointerType>(LHS->getType())->isEmptyTy() &&
        !cast<PointerType>(RHS->getType())->isEmptyTy() &&
        LHSOffset->isNullValue() &&
        RHSOffset->isNullValue())
      return ConstantInt::get(GetCompareTy(LHS),
                              !CmpInst::isTrueWhenEqual(Pred));
  }

  // Even if an non-inbounds GEP occurs along the path we can still optimize
  // equality comparisons concerning the result. We avoid walking the whole
  // chain again by starting where the last calls to
  // stripAndComputeConstantOffsets left off and accumulate the offsets.
  Constant *LHSNoBound = stripAndComputeConstantOffsets(DL, LHS, true);
  Constant *RHSNoBound = stripAndComputeConstantOffsets(DL, RHS, true);
  if (LHS == RHS)
    return ConstantExpr::getICmp(Pred,
                                 ConstantExpr::getAdd(LHSOffset, LHSNoBound),
                                 ConstantExpr::getAdd(RHSOffset, RHSNoBound));

  // If one side of the equality comparison must come from a noalias call
  // (meaning a system memory allocation function), and the other side must
  // come from a pointer that cannot overlap with dynamically-allocated
  // memory within the lifetime of the current function (allocas, byval
  // arguments, globals), then determine the comparison result here.
  SmallVector<Value *, 8> LHSUObjs, RHSUObjs;
  GetUnderlyingObjects(LHS, LHSUObjs, DL);
  GetUnderlyingObjects(RHS, RHSUObjs, DL);

  // Is the set of underlying objects all noalias calls?
  auto IsNAC = [](ArrayRef<Value *> Objects) {
    return all_of(Objects, isNoAliasCall);
  };

  // Is the set of underlying objects all things which must be disjoint from
  // noalias calls. For allocas, we consider only static ones (dynamic
  // allocas might be transformed into calls to malloc not simultaneously
  // live with the compared-to allocation). For globals, we exclude symbols
  // that might be resolve lazily to symbols in another dynamically-loaded
  // library (and, thus, could be malloc'ed by the implementation).
  auto IsAllocDisjoint = [](ArrayRef<Value *> Objects) {
    return all_of(Objects, [](Value *V) {
      if (const AllocaInst *AI = dyn_cast<AllocaInst>(V))
        return AI->getParent() && AI->getFunction() && AI->isStaticAlloca();
      if (const GlobalValue *GV = dyn_cast<GlobalValue>(V))
        return (GV->hasLocalLinkage() || GV->hasHiddenVisibility() ||
                GV->hasProtectedVisibility() || GV->hasGlobalUnnamedAddr()) &&
               !GV->isThreadLocal();
      if (const Argument *A = dyn_cast<Argument>(V))
        return A->hasByValAttr();
      return false;
    });
  };

  if ((IsNAC(LHSUObjs) && IsAllocDisjoint(RHSUObjs)) ||
      (IsNAC(RHSUObjs) && IsAllocDisjoint(LHSUObjs)))
      return ConstantInt::get(GetCompareTy(LHS),
                              !CmpInst::isTrueWhenEqual(Pred));

  // Fold comparisons for non-escaping pointer even if the allocation call
  // cannot be elided. We cannot fold malloc comparison to null. Also, the
  // dynamic allocation call could be either of the operands.
  Value *MI = nullptr;
  if (isAllocLikeFn(LHS, TLI) &&
      llvm::isKnownNonZero(RHS, DL, 0, nullptr, CxtI, DT))
    MI = LHS;
  else if (isAllocLikeFn(RHS, TLI) &&
           llvm::isKnownNonZero(LHS, DL, 0, nullptr, CxtI, DT))
    MI = RHS;
  // FIXME: We should also fold the compare when the pointer escapes, but the
  // compare dominates the pointer escape
  if (MI && !PointerMayBeCaptured(MI, true, true))
    return ConstantInt::get(GetCompareTy(LHS),
                            CmpInst::isFalseWhenEqual(Pred));
}

// Otherwise, fail.
return nullptr;
2265}

2267/// Fold an icmp when its operands have i1 scalar type.
2268static Value *simplifyICmpOfBools(CmpInst::Predicate Pred, Value *LHS,
                                Value *RHS, const SimplifyQuery &Q) {
Type *ITy = GetCompareTy(LHS); // The return type.
Type *OpTy = LHS->getType();   // The operand type.
if (!OpTy->isIntOrIntVectorTy(1))
  return nullptr;

// A boolean compared to true/false can be simplified in 14 out of the 20
// (10 predicates * 2 constants) possible combinations. Cases not handled here
// require a 'not' of the LHS, so those must be transformed in InstCombine.
if (match(RHS, m_Zero())) {
  switch (Pred) {
  case CmpInst::ICMP_NE:  // X !=  0 -> X
  case CmpInst::ICMP_UGT: // X >u  0 -> X
  case CmpInst::ICMP_SLT: // X <s  0 -> X
    return LHS;

  case CmpInst::ICMP_ULT: // X <u  0 -> false
  case CmpInst::ICMP_SGT: // X >s  0 -> false
    return getFalse(ITy);

  case CmpInst::ICMP_UGE: // X >=u 0 -> true
  case CmpInst::ICMP_SLE: // X <=s 0 -> true
    return getTrue(ITy);

  default: break;
  }
} else if (match(RHS, m_One())) {
  switch (Pred) {
  case CmpInst::ICMP_EQ:  // X ==   1 -> X
  case CmpInst::ICMP_UGE: // X >=u  1 -> X
  case CmpInst::ICMP_SLE: // X <=s -1 -> X
    return LHS;

  case CmpInst::ICMP_UGT: // X >u   1 -> false
  case CmpInst::ICMP_SLT: // X <s  -1 -> false
    return getFalse(ITy);

  case CmpInst::ICMP_ULE: // X <=u  1 -> true
  case CmpInst::ICMP_SGE: // X >=s -1 -> true
    return getTrue(ITy);

  default: break;
  }
}

switch (Pred) {
default:
  break;
case ICmpInst::ICMP_UGE:
  if (isImpliedCondition(RHS, LHS, Q.DL).getValueOr(false))
    return getTrue(ITy);
  break;
case ICmpInst::ICMP_SGE:
  /// For signed comparison, the values for an i1 are 0 and -1
  /// respectively. This maps into a truth table of:
  /// LHS | RHS | LHS >=s RHS   | LHS implies RHS
  ///  0  |  0  |  1 (0 >= 0)   |  1
  ///  0  |  1  |  1 (0 >= -1)  |  1
  ///  1  |  0  |  0 (-1 >= 0)  |  0
  ///  1  |  1  |  1 (-1 >= -1) |  1
  if (isImpliedCondition(LHS, RHS, Q.DL).getValueOr(false))
    return getTrue(ITy);
  break;
case ICmpInst::ICMP_ULE:
  if (isImpliedCondition(LHS, RHS, Q.DL).getValueOr(false))
    return getTrue(ITy);
  break;
}

return nullptr;
2339}

2341/// Try hard to fold icmp with zero RHS because this is a common case.
2342static Value *simplifyICmpWithZero(CmpInst::Predicate Pred, Value *LHS,
                                 Value *RHS, const SimplifyQuery &Q) {
if (!match(RHS, m_Zero()))
  return nullptr;

Type *ITy = GetCompareTy(LHS); // The return type.
switch (Pred) {
default:
  llvm_unreachable("Unknown ICmp predicate!")::llvm::llvm_unreachable_internal("Unknown ICmp predicate!", "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 2350);
case ICmpInst::ICMP_ULT:
  return getFalse(ITy);
case ICmpInst::ICMP_UGE:
  return getTrue(ITy);
case ICmpInst::ICMP_EQ:
case ICmpInst::ICMP_ULE:
  if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
    return getFalse(ITy);
  break;
case ICmpInst::ICMP_NE:
case ICmpInst::ICMP_UGT:
  if (isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
    return getTrue(ITy);
  break;
case ICmpInst::ICMP_SLT: {
  KnownBits LHSKnown = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
  if (LHSKnown.isNegative())
    return getTrue(ITy);
  if (LHSKnown.isNonNegative())
    return getFalse(ITy);
  break;
}
case ICmpInst::ICMP_SLE: {
  KnownBits LHSKnown = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
  if (LHSKnown.isNegative())
    return getTrue(ITy);
  if (LHSKnown.isNonNegative() &&
      isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
    return getFalse(ITy);
  break;
}
case ICmpInst::ICMP_SGE: {
  KnownBits LHSKnown = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
  if (LHSKnown.isNegative())
    return getFalse(ITy);
  if (LHSKnown.isNonNegative())
    return getTrue(ITy);
  break;
}
case ICmpInst::ICMP_SGT: {
  KnownBits LHSKnown = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
  if (LHSKnown.isNegative())
    return getFalse(ITy);
  if (LHSKnown.isNonNegative() &&
      isKnownNonZero(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT))
    return getTrue(ITy);
  break;
}
}

return nullptr;
2402}

2404/// Many binary operators with a constant operand have an easy-to-compute
2405/// range of outputs. This can be used to fold a comparison to always true or
2406/// always false.
2407static void setLimitsForBinOp(BinaryOperator &BO, APInt &Lower, APInt &Upper) {
unsigned Width = Lower.getBitWidth();
const APInt *C;
switch (BO.getOpcode()) {
case Instruction::Add:
  if (match(BO.getOperand(1), m_APInt(C)) && !C->isNullValue()) {
    // FIXME: If we have both nuw and nsw, we should reduce the range further.
    if (BO.hasNoUnsignedWrap()) {
      // 'add nuw x, C' produces [C, UINT_MAX].
      Lower = *C;
    } else if (BO.hasNoSignedWrap()) {
      if (C->isNegative()) {
        // 'add nsw x, -C' produces [SINT_MIN, SINT_MAX - C].
        Lower = APInt::getSignedMinValue(Width);
        Upper = APInt::getSignedMaxValue(Width) + *C + 1;
      } else {
        // 'add nsw x, +C' produces [SINT_MIN + C, SINT_MAX].
        Lower = APInt::getSignedMinValue(Width) + *C;
        Upper = APInt::getSignedMaxValue(Width) + 1;
      }
    }
  }
  break;

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

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

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

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

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

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

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

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

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

default:
  break;
}
2559}

2561static Value *simplifyICmpWithConstant(CmpInst::Predicate Pred, Value *LHS,
                                     Value *RHS) {
Type *ITy = GetCompareTy(RHS); // The return type.

Value *X;
// Sign-bit checks can be optimized to true/false after unsigned
// floating-point casts:
// icmp slt (bitcast (uitofp X)),  0 --> false
// icmp sgt (bitcast (uitofp X)), -1 --> true
if (match(LHS, m_BitCast(m_UIToFP(m_Value(X))))) {
  if (Pred == ICmpInst::ICMP_SLT && match(RHS, m_Zero()))
    return ConstantInt::getFalse(ITy);
  if (Pred == ICmpInst::ICMP_SGT && match(RHS, m_AllOnes()))
    return ConstantInt::getTrue(ITy);
}

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

// Rule out tautological comparisons (eg., ult 0 or uge 0).
ConstantRange RHS_CR = ConstantRange::makeExactICmpRegion(Pred, *C);
if (RHS_CR.isEmptySet())
  return ConstantInt::getFalse(ITy);
if (RHS_CR.isFullSet())
  return ConstantInt::getTrue(ITy);

// Find the range of possible values for binary operators.
unsigned Width = C->getBitWidth();
APInt Lower = APInt(Width, 0);
APInt Upper = APInt(Width, 0);
if (auto *BO = dyn_cast<BinaryOperator>(LHS))
  setLimitsForBinOp(*BO, Lower, Upper);

ConstantRange LHS_CR =
    Lower != Upper ? ConstantRange(Lower, Upper) : ConstantRange(Width, true);

if (auto *I = dyn_cast<Instruction>(LHS))
  if (auto *Ranges = I->getMetadata(LLVMContext::MD_range))
    LHS_CR = LHS_CR.intersectWith(getConstantRangeFromMetadata(*Ranges));

if (!LHS_CR.isFullSet()) {
  if (RHS_CR.contains(LHS_CR))
    return ConstantInt::getTrue(ITy);
  if (RHS_CR.inverse().contains(LHS_CR))
    return ConstantInt::getFalse(ITy);
}

return nullptr;
2610}

2612/// TODO: A large part of this logic is duplicated in InstCombine's
2613/// foldICmpBinOp(). We should be able to share that and avoid the code
2614/// duplication.
2615static Value *simplifyICmpWithBinOp(CmpInst::Predicate Pred, Value *LHS,
                                  Value *RHS, const SimplifyQuery &Q,
                                  unsigned MaxRecurse) {
Type *ITy = GetCompareTy(LHS); // The return type.

BinaryOperator *LBO = dyn_cast<BinaryOperator>(LHS);
BinaryOperator *RBO = dyn_cast<BinaryOperator>(RHS);
if (MaxRecurse && (LBO || RBO)) {
  // Analyze the case when either LHS or RHS is an add instruction.
  Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr;
  // LHS = A + B (or A and B are null); RHS = C + D (or C and D are null).
  bool NoLHSWrapProblem = false, NoRHSWrapProblem = false;
  if (LBO && LBO->getOpcode() == Instruction::Add) {
    A = LBO->getOperand(0);
    B = LBO->getOperand(1);
    NoLHSWrapProblem =
        ICmpInst::isEquality(Pred) ||
        (CmpInst::isUnsigned(Pred) && LBO->hasNoUnsignedWrap()) ||
        (CmpInst::isSigned(Pred) && LBO->hasNoSignedWrap());
  }
  if (RBO && RBO->getOpcode() == Instruction::Add) {
    C = RBO->getOperand(0);
    D = RBO->getOperand(1);
    NoRHSWrapProblem =
        ICmpInst::isEquality(Pred) ||
        (CmpInst::isUnsigned(Pred) && RBO->hasNoUnsignedWrap()) ||
        (CmpInst::isSigned(Pred) && RBO->hasNoSignedWrap());
  }

  // icmp (X+Y), X -> icmp Y, 0 for equalities or if there is no overflow.
  if ((A == RHS || B == RHS) && NoLHSWrapProblem)
    if (Value *V = SimplifyICmpInst(Pred, A == RHS ? B : A,
                                    Constant::getNullValue(RHS->getType()), Q,
                                    MaxRecurse - 1))
      return V;

  // icmp X, (X+Y) -> icmp 0, Y for equalities or if there is no overflow.
  if ((C == LHS || D == LHS) && NoRHSWrapProblem)
    if (Value *V =
            SimplifyICmpInst(Pred, Constant::getNullValue(LHS->getType()),
                             C == LHS ? D : C, Q, MaxRecurse - 1))
      return V;

  // icmp (X+Y), (X+Z) -> icmp Y,Z for equalities or if there is no overflow.
  if (A && C && (A == C || A == D || B == C || B == D) && NoLHSWrapProblem &&
      NoRHSWrapProblem) {
    // Determine Y and Z in the form icmp (X+Y), (X+Z).
    Value *Y, *Z;
    if (A == C) {
      // C + B == C + D  ->  B == D
      Y = B;
      Z = D;
    } else if (A == D) {
      // D + B == C + D  ->  B == C
      Y = B;
      Z = C;
    } else if (B == C) {
      // A + C == C + D  ->  A == D
      Y = A;
      Z = D;
    } else {
      assert(B == D)(static_cast <bool> (B == D) ? void (0) : __assert_fail
 ("B == D", "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 2676, __extension__ __PRETTY_FUNCTION__));
      // A + D == C + D  ->  A == C
      Y = A;
      Z = C;
    }
    if (Value *V = SimplifyICmpInst(Pred, Y, Z, Q, MaxRecurse - 1))
      return V;
  }
}

{
  Value *Y = nullptr;
  // icmp pred (or X, Y), X
  if (LBO && match(LBO, m_c_Or(m_Value(Y), m_Specific(RHS)))) {
    if (Pred == ICmpInst::ICMP_ULT)
      return getFalse(ITy);
    if (Pred == ICmpInst::ICMP_UGE)
      return getTrue(ITy);

    if (Pred == ICmpInst::ICMP_SLT || Pred == ICmpInst::ICMP_SGE) {
      KnownBits RHSKnown = computeKnownBits(RHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
      KnownBits YKnown = computeKnownBits(Y, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
      if (RHSKnown.isNonNegative() && YKnown.isNegative())
        return Pred == ICmpInst::ICMP_SLT ? getTrue(ITy) : getFalse(ITy);
      if (RHSKnown.isNegative() || YKnown.isNonNegative())
        return Pred == ICmpInst::ICMP_SLT ? getFalse(ITy) : getTrue(ITy);
    }
  }
  // icmp pred X, (or X, Y)
  if (RBO && match(RBO, m_c_Or(m_Value(Y), m_Specific(LHS)))) {
    if (Pred == ICmpInst::ICMP_ULE)
      return getTrue(ITy);
    if (Pred == ICmpInst::ICMP_UGT)
      return getFalse(ITy);

    if (Pred == ICmpInst::ICMP_SGT || Pred == ICmpInst::ICMP_SLE) {
      KnownBits LHSKnown = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
      KnownBits YKnown = computeKnownBits(Y, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
      if (LHSKnown.isNonNegative() && YKnown.isNegative())
        return Pred == ICmpInst::ICMP_SGT ? getTrue(ITy) : getFalse(ITy);
      if (LHSKnown.isNegative() || YKnown.isNonNegative())
        return Pred == ICmpInst::ICMP_SGT ? getFalse(ITy) : getTrue(ITy);
    }
  }
}

// icmp pred (and X, Y), X
if (LBO && match(LBO, m_c_And(m_Value(), m_Specific(RHS)))) {
  if (Pred == ICmpInst::ICMP_UGT)
    return getFalse(ITy);
  if (Pred == ICmpInst::ICMP_ULE)
    return getTrue(ITy);
}
// icmp pred X, (and X, Y)
if (RBO && match(RBO, m_c_And(m_Value(), m_Specific(LHS)))) {
  if (Pred == ICmpInst::ICMP_UGE)
    return getTrue(ITy);
  if (Pred == ICmpInst::ICMP_ULT)
    return getFalse(ITy);
}

// 0 - (zext X) pred C
if (!CmpInst::isUnsigned(Pred) && match(LHS, m_Neg(m_ZExt(m_Value())))) {
  if (ConstantInt *RHSC = dyn_cast<ConstantInt>(RHS)) {
    if (RHSC->getValue().isStrictlyPositive()) {
      if (Pred == ICmpInst::ICMP_SLT)
        return ConstantInt::getTrue(RHSC->getContext());
      if (Pred == ICmpInst::ICMP_SGE)
        return ConstantInt::getFalse(RHSC->getContext());
      if (Pred == ICmpInst::ICMP_EQ)
        return ConstantInt::getFalse(RHSC->getContext());
      if (Pred == ICmpInst::ICMP_NE)
        return ConstantInt::getTrue(RHSC->getContext());
    }
    if (RHSC->getValue().isNonNegative()) {
      if (Pred == ICmpInst::ICMP_SLE)
        return ConstantInt::getTrue(RHSC->getContext());
      if (Pred == ICmpInst::ICMP_SGT)
        return ConstantInt::getFalse(RHSC->getContext());
    }
  }
}

// icmp pred (urem X, Y), Y
if (LBO && match(LBO, m_URem(m_Value(), m_Specific(RHS)))) {
  switch (Pred) {
  default:
    break;
  case ICmpInst::ICMP_SGT:
  case ICmpInst::ICMP_SGE: {
    KnownBits Known = computeKnownBits(RHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
    if (!Known.isNonNegative())
      break;
    LLVM_FALLTHROUGH[[clang::fallthrough]];
  }
  case ICmpInst::ICMP_EQ:
  case ICmpInst::ICMP_UGT:
  case ICmpInst::ICMP_UGE:
    return getFalse(ITy);
  case ICmpInst::ICMP_SLT:
  case ICmpInst::ICMP_SLE: {
    KnownBits Known = computeKnownBits(RHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
    if (!Known.isNonNegative())
      break;
    LLVM_FALLTHROUGH[[clang::fallthrough]];
  }
  case ICmpInst::ICMP_NE:
  case ICmpInst::ICMP_ULT:
  case ICmpInst::ICMP_ULE:
    return getTrue(ITy);
  }
}

// icmp pred X, (urem Y, X)
if (RBO && match(RBO, m_URem(m_Value(), m_Specific(LHS)))) {
  switch (Pred) {
  default:
    break;
  case ICmpInst::ICMP_SGT:
  case ICmpInst::ICMP_SGE: {
    KnownBits Known = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
    if (!Known.isNonNegative())
      break;
    LLVM_FALLTHROUGH[[clang::fallthrough]];
  }
  case ICmpInst::ICMP_NE:
  case ICmpInst::ICMP_UGT:
  case ICmpInst::ICMP_UGE:
    return getTrue(ITy);
  case ICmpInst::ICMP_SLT:
  case ICmpInst::ICMP_SLE: {
    KnownBits Known = computeKnownBits(LHS, Q.DL, 0, Q.AC, Q.CxtI, Q.DT);
    if (!Known.isNonNegative())
      break;
    LLVM_FALLTHROUGH[[clang::fallthrough]];
  }
  case ICmpInst::ICMP_EQ:
  case ICmpInst::ICMP_ULT:
  case ICmpInst::ICMP_ULE:
    return getFalse(ITy);
  }
}

// x >> y <=u x
// x udiv y <=u x.
if (LBO && (match(LBO, m_LShr(m_Specific(RHS), m_Value())) ||
            match(LBO, m_UDiv(m_Specific(RHS), m_Value())))) {
  // icmp pred (X op Y), X
  if (Pred == ICmpInst::ICMP_UGT)
    return getFalse(ITy);
  if (Pred == ICmpInst::ICMP_ULE)
    return getTrue(ITy);
}

// x >=u x >> y
// x >=u x udiv y.
if (RBO && (match(RBO, m_LShr(m_Specific(LHS), m_Value())) ||
            match(RBO, m_UDiv(m_Specific(LHS), m_Value())))) {
  // icmp pred X, (X op Y)
  if (Pred == ICmpInst::ICMP_ULT)
    return getFalse(ITy);
  if (Pred == ICmpInst::ICMP_UGE)
    return getTrue(ITy);
}

// handle:
//   CI2 << X == CI
//   CI2 << X != CI
//
//   where CI2 is a power of 2 and CI isn't
if (auto *CI = dyn_cast<ConstantInt>(RHS)) {
  const APInt *CI2Val, *CIVal = &CI->getValue();
  if (LBO && match(LBO, m_Shl(m_APInt(CI2Val), m_Value())) &&
      CI2Val->isPowerOf2()) {
    if (!CIVal->isPowerOf2()) {
      // CI2 << X can equal zero in some circumstances,
      // this simplification is unsafe if CI is zero.
      //
      // We know it is safe if:
      // - The shift is nsw, we can't shift out the one bit.
      // - The shift is nuw, we can't shift out the one bit.
      // - CI2 is one
      // - CI isn't zero
      if (LBO->hasNoSignedWrap() || LBO->hasNoUnsignedWrap() ||
          CI2Val->isOneValue() || !CI->isZero()) {
        if (Pred == ICmpInst::ICMP_EQ)
          return ConstantInt::getFalse(RHS->getContext());
        if (Pred == ICmpInst::ICMP_NE)
          return ConstantInt::getTrue(RHS->getContext());
      }
    }
    if (CIVal->isSignMask() && CI2Val->isOneValue()) {
      if (Pred == ICmpInst::ICMP_UGT)
        return ConstantInt::getFalse(RHS->getContext());
      if (Pred == ICmpInst::ICMP_ULE)
        return ConstantInt::getTrue(RHS->getContext());
    }
  }
}

if (MaxRecurse && LBO && RBO && LBO->getOpcode() == RBO->getOpcode() &&
    LBO->getOperand(1) == RBO->getOperand(1)) {
  switch (LBO->getOpcode()) {
  default:
    break;
  case Instruction::UDiv:
  case Instruction::LShr:
    if (ICmpInst::isSigned(Pred) || !LBO->isExact() || !RBO->isExact())
      break;
    if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
                                    RBO->getOperand(0), Q, MaxRecurse - 1))
        return V;
    break;
  case Instruction::SDiv:
    if (!ICmpInst::isEquality(Pred) || !LBO->isExact() || !RBO->isExact())
      break;
    if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
                                    RBO->getOperand(0), Q, MaxRecurse - 1))
      return V;
    break;
  case Instruction::AShr:
    if (!LBO->isExact() || !RBO->isExact())
      break;
    if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
                                    RBO->getOperand(0), Q, MaxRecurse - 1))
      return V;
    break;
  case Instruction::Shl: {
    bool NUW = LBO->hasNoUnsignedWrap() && RBO->hasNoUnsignedWrap();
    bool NSW = LBO->hasNoSignedWrap() && RBO->hasNoSignedWrap();
    if (!NUW && !NSW)
      break;
    if (!NSW && ICmpInst::isSigned(Pred))
      break;
    if (Value *V = SimplifyICmpInst(Pred, LBO->getOperand(0),
                                    RBO->getOperand(0), Q, MaxRecurse - 1))
      return V;
    break;
  }
  }
}
return nullptr;
2918}

2920/// Simplify integer comparisons where at least one operand of the compare
2921/// matches an integer min/max idiom.
2922static Value *simplifyICmpWithMinMax(CmpInst::Predicate Pred, Value *LHS,
                                   Value *RHS, const SimplifyQuery &Q,
                                   unsigned MaxRecurse) {
Type *ITy = GetCompareTy(LHS); // The return type.
Value *A, *B;
CmpInst::Predicate P = CmpInst::BAD_ICMP_PREDICATE;
CmpInst::Predicate EqP; // Chosen so that "A == max/min(A,B)" iff "A EqP B".

// Signed variants on "max(a,b)>=a -> true".
if (match(LHS, m_SMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) {
  if (A != RHS)
    std::swap(A, B);       // smax(A, B) pred A.
  EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B".
  // We analyze this as smax(A, B) pred A.
  P = Pred;
} else if (match(RHS, m_SMax(m_Value(A), m_Value(B))) &&
           (A == LHS || B == LHS)) {
  if (A != LHS)
    std::swap(A, B);       // A pred smax(A, B).
  EqP = CmpInst::ICMP_SGE; // "A == smax(A, B)" iff "A sge B".
  // We analyze this as smax(A, B) swapped-pred A.
  P = CmpInst::getSwappedPredicate(Pred);
} else if (match(LHS, m_SMin(m_Value(A), m_Value(B))) &&
           (A == RHS || B == RHS)) {
  if (A != RHS)
    std::swap(A, B);       // smin(A, B) pred A.
  EqP = CmpInst::ICMP_SLE; // "A == smin(A, B)" iff "A sle B".
  // We analyze this as smax(-A, -B) swapped-pred -A.
  // Note that we do not need to actually form -A or -B thanks to EqP.
  P = CmpInst::getSwappedPredicate(Pred);
} else if (match(RHS, m_SMin(m_Value(A), m_Value(B))) &&
           (A == LHS || B == LHS)) {
  if (A != LHS)
    std::swap(A, B);       // A pred smin(A, B).
  EqP = CmpInst::ICMP_SLE; // "A == smin(A, B)" iff "A sle B".
  // We analyze this as smax(-A, -B) pred -A.
  // Note that we do not need to actually form -A or -B thanks to EqP.
  P = Pred;
}
if (P != CmpInst::BAD_ICMP_PREDICATE) {
  // Cases correspond to "max(A, B) p A".
  switch (P) {
  default:
    break;
  case CmpInst::ICMP_EQ:
  case CmpInst::ICMP_SLE:
    // Equivalent to "A EqP B".  This may be the same as the condition tested
    // in the max/min; if so, we can just return that.
    if (Value *V = ExtractEquivalentCondition(LHS, EqP, A, B))
      return V;
    if (Value *V = ExtractEquivalentCondition(RHS, EqP, A, B))
      return V;
    // Otherwise, see if "A EqP B" simplifies.
    if (MaxRecurse)
      if (Value *V = SimplifyICmpInst(EqP, A, B, Q, MaxRecurse - 1))
        return V;
    break;
  case CmpInst::ICMP_NE:
  case CmpInst::ICMP_SGT: {
    CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP);
    // Equivalent to "A InvEqP B".  This may be the same as the condition
    // tested in the max/min; if so, we can just return that.
    if (Value *V = ExtractEquivalentCondition(LHS, InvEqP, A, B))
      return V;
    if (Value *V = ExtractEquivalentCondition(RHS, InvEqP, A, B))
      return V;
    // Otherwise, see if "A InvEqP B" simplifies.
    if (MaxRecurse)
      if (Value *V = SimplifyICmpInst(InvEqP, A, B, Q, MaxRecurse - 1))
        return V;
    break;
  }
  case CmpInst::ICMP_SGE:
    // Always true.
    return getTrue(ITy);
  case CmpInst::ICMP_SLT:
    // Always false.
    return getFalse(ITy);
  }
}

// Unsigned variants on "max(a,b)>=a -> true".
P = CmpInst::BAD_ICMP_PREDICATE;
if (match(LHS, m_UMax(m_Value(A), m_Value(B))) && (A == RHS || B == RHS)) {
  if (A != RHS)
    std::swap(A, B);       // umax(A, B) pred A.
  EqP = CmpInst::ICMP_UGE; // "A == umax(A, B)" iff "A uge B".
  // We analyze this as umax(A, B) pred A.
  P = Pred;
} else if (match(RHS, m_UMax(m_Value(A), m_Value(B))) &&
           (A == LHS || B == LHS)) {
  if (A != LHS)
    std::swap(A, B);       // A pred umax(A, B).
  EqP = CmpInst::ICMP_UGE; // "A == umax(A, B)" iff "A uge B".
  // We analyze this as umax(A, B) swapped-pred A.
  P = CmpInst::getSwappedPredicate(Pred);
} else if (match(LHS, m_UMin(m_Value(A), m_Value(B))) &&
           (A == RHS || B == RHS)) {
  if (A != RHS)
    std::swap(A, B);       // umin(A, B) pred A.
  EqP = CmpInst::ICMP_ULE; // "A == umin(A, B)" iff "A ule B".
  // We analyze this as umax(-A, -B) swapped-pred -A.
  // Note that we do not need to actually form -A or -B thanks to EqP.
  P = CmpInst::getSwappedPredicate(Pred);
} else if (match(RHS, m_UMin(m_Value(A), m_Value(B))) &&
           (A == LHS || B == LHS)) {
  if (A != LHS)
    std::swap(A, B);       // A pred umin(A, B).
  EqP = CmpInst::ICMP_ULE; // "A == umin(A, B)" iff "A ule B".
  // We analyze this as umax(-A, -B) pred -A.
  // Note that we do not need to actually form -A or -B thanks to EqP.
  P = Pred;
}
if (P != CmpInst::BAD_ICMP_PREDICATE) {
  // Cases correspond to "max(A, B) p A".
  switch (P) {
  default:
    break;
  case CmpInst::ICMP_EQ:
  case CmpInst::ICMP_ULE:
    // Equivalent to "A EqP B".  This may be the same as the condition tested
    // in the max/min; if so, we can just return that.
    if (Value *V = ExtractEquivalentCondition(LHS, EqP, A, B))
      return V;
    if (Value *V = ExtractEquivalentCondition(RHS, EqP, A, B))
      return V;
    // Otherwise, see if "A EqP B" simplifies.
    if (MaxRecurse)
      if (Value *V = SimplifyICmpInst(EqP, A, B, Q, MaxRecurse - 1))
        return V;
    break;
  case CmpInst::ICMP_NE:
  case CmpInst::ICMP_UGT: {
    CmpInst::Predicate InvEqP = CmpInst::getInversePredicate(EqP);
    // Equivalent to "A InvEqP B".  This may be the same as the condition
    // tested in the max/min; if so, we can just return that.
    if (Value *V = ExtractEquivalentCondition(LHS, InvEqP, A, B))
      return V;
    if (Value *V = ExtractEquivalentCondition(RHS, InvEqP, A, B))
      return V;
    // Otherwise, see if "A InvEqP B" simplifies.
    if (MaxRecurse)
      if (Value *V = SimplifyICmpInst(InvEqP, A, B, Q, MaxRecurse - 1))
        return V;
    break;
  }
  case CmpInst::ICMP_UGE:
    // Always true.
    return getTrue(ITy);
  case CmpInst::ICMP_ULT:
    // Always false.
    return getFalse(ITy);
  }
}

// Variants on "max(x,y) >= min(x,z)".
Value *C, *D;
if (match(LHS, m_SMax(m_Value(A), m_Value(B))) &&
    match(RHS, m_SMin(m_Value(C), m_Value(D))) &&
    (A == C || A == D || B == C || B == D)) {
  // max(x, ?) pred min(x, ?).
  if (Pred == CmpInst::ICMP_SGE)
    // Always true.
    return getTrue(ITy);
  if (Pred == CmpInst::ICMP_SLT)
    // Always false.
    return getFalse(ITy);
} else if (match(LHS, m_SMin(m_Value(A), m_Value(B))) &&
           match(RHS, m_SMax(m_Value(C), m_Value(D))) &&
           (A == C || A == D || B == C || B == D)) {
  // min(x, ?) pred max(x, ?).
  if (Pred == CmpInst::ICMP_SLE)
    // Always true.
    return getTrue(ITy);
  if (Pred == CmpInst::ICMP_SGT)
    // Always false.
    return getFalse(ITy);
} else if (match(LHS, m_UMax(m_Value(A), m_Value(B))) &&
           match(RHS, m_UMin(m_Value(C), m_Value(D))) &&
           (A == C || A == D || B == C || B == D)) {
  // max(x, ?) pred min(x, ?).
  if (Pred == CmpInst::ICMP_UGE)
    // Always true.
    return getTrue(ITy);
  if (Pred == CmpInst::ICMP_ULT)
    // Always false.
    return getFalse(ITy);
} else if (match(LHS, m_UMin(m_Value(A), m_Value(B))) &&
           match(RHS, m_UMax(m_Value(C), m_Value(D))) &&
           (A == C || A == D || B == C || B == D)) {
  // min(x, ?) pred max(x, ?).
  if (Pred == CmpInst::ICMP_ULE)
    // Always true.
    return getTrue(ITy);
  if (Pred == CmpInst::ICMP_UGT)
    // Always false.
    return getFalse(ITy);
}

return nullptr;
3122}

3124/// Given operands for an ICmpInst, see if we can fold the result.
3125/// If not, this returns null.
3126static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate;
assert(CmpInst::isIntPredicate(Pred) && "Not an integer compare!")(static_cast <bool> (CmpInst::isIntPredicate(Pred) &&
 "Not an integer compare!") ? void (0) : __assert_fail ("CmpInst::isIntPredicate(Pred) && \"Not an integer compare!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3129, __extension__ __PRETTY_FUNCTION__));

if (Constant *CLHS = dyn_cast<Constant>(LHS)) {
  if (Constant *CRHS = dyn_cast<Constant>(RHS))
    return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.DL, Q.TLI);

  // If we have a constant, make sure it is on the RHS.
  std::swap(LHS, RHS);
  Pred = CmpInst::getSwappedPredicate(Pred);
}

Type *ITy = GetCompareTy(LHS); // The return type.

// icmp X, X -> true/false
// icmp X, undef -> true/false because undef could be X.
if (LHS == RHS || isa<UndefValue>(RHS))
  return ConstantInt::get(ITy, CmpInst::isTrueWhenEqual(Pred));

if (Value *V = simplifyICmpOfBools(Pred, LHS, RHS, Q))
  return V;

if (Value *V = simplifyICmpWithZero(Pred, LHS, RHS, Q))
  return V;

if (Value *V = simplifyICmpWithConstant(Pred, LHS, RHS))
  return V;

// If both operands have range metadata, use the metadata
// to simplify the comparison.
if (isa<Instruction>(RHS) && isa<Instruction>(LHS)) {
  auto RHS_Instr = cast<Instruction>(RHS);
  auto LHS_Instr = cast<Instruction>(LHS);

  if (RHS_Instr->getMetadata(LLVMContext::MD_range) &&
      LHS_Instr->getMetadata(LLVMContext::MD_range)) {
    auto RHS_CR = getConstantRangeFromMetadata(
        *RHS_Instr->getMetadata(LLVMContext::MD_range));
    auto LHS_CR = getConstantRangeFromMetadata(
        *LHS_Instr->getMetadata(LLVMContext::MD_range));

    auto Satisfied_CR = ConstantRange::makeSatisfyingICmpRegion(Pred, RHS_CR);
    if (Satisfied_CR.contains(LHS_CR))
      return ConstantInt::getTrue(RHS->getContext());

    auto InversedSatisfied_CR = ConstantRange::makeSatisfyingICmpRegion(
              CmpInst::getInversePredicate(Pred), RHS_CR);
    if (InversedSatisfied_CR.contains(LHS_CR))
      return ConstantInt::getFalse(RHS->getContext());
  }
}

// Compare of cast, for example (zext X) != 0 -> X != 0
if (isa<CastInst>(LHS) && (isa<Constant>(RHS) || isa<CastInst>(RHS))) {
  Instruction *LI = cast<CastInst>(LHS);
  Value *SrcOp = LI->getOperand(0);
  Type *SrcTy = SrcOp->getType();
  Type *DstTy = LI->getType();

  // Turn icmp (ptrtoint x), (ptrtoint/constant) into a compare of the input
  // if the integer type is the same size as the pointer type.
  if (MaxRecurse && isa<PtrToIntInst>(LI) &&
      Q.DL.getTypeSizeInBits(SrcTy) == DstTy->getPrimitiveSizeInBits()) {
    if (Constant *RHSC = dyn_cast<Constant>(RHS)) {
      // Transfer the cast to the constant.
      if (Value *V = SimplifyICmpInst(Pred, SrcOp,
                                      ConstantExpr::getIntToPtr(RHSC, SrcTy),
                                      Q, MaxRecurse-1))
        return V;
    } else if (PtrToIntInst *RI = dyn_cast<PtrToIntInst>(RHS)) {
      if (RI->getOperand(0)->getType() == SrcTy)
        // Compare without the cast.
        if (Value *V = SimplifyICmpInst(Pred, SrcOp, RI->getOperand(0),
                                        Q, MaxRecurse-1))
          return V;
    }
  }

  if (isa<ZExtInst>(LHS)) {
    // Turn icmp (zext X), (zext Y) into a compare of X and Y if they have the
    // same type.
    if (ZExtInst *RI = dyn_cast<ZExtInst>(RHS)) {
      if (MaxRecurse && SrcTy == RI->getOperand(0)->getType())
        // Compare X and Y.  Note that signed predicates become unsigned.
        if (Value *V = SimplifyICmpInst(ICmpInst::getUnsignedPredicate(Pred),
                                        SrcOp, RI->getOperand(0), Q,
                                        MaxRecurse-1))
          return V;
    }
    // Turn icmp (zext X), Cst into a compare of X and Cst if Cst is extended
    // too.  If not, then try to deduce the result of the comparison.
    else if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
      // Compute the constant that would happen if we truncated to SrcTy then
      // reextended to DstTy.
      Constant *Trunc = ConstantExpr::getTrunc(CI, SrcTy);
      Constant *RExt = ConstantExpr::getCast(CastInst::ZExt, Trunc, DstTy);

      // If the re-extended constant didn't change then this is effectively
      // also a case of comparing two zero-extended values.
      if (RExt == CI && MaxRecurse)
        if (Value *V = SimplifyICmpInst(ICmpInst::getUnsignedPredicate(Pred),
                                      SrcOp, Trunc, Q, MaxRecurse-1))
          return V;

      // Otherwise the upper bits of LHS are zero while RHS has a non-zero bit
      // there.  Use this to work out the result of the comparison.
      if (RExt != CI) {
        switch (Pred) {
        default: llvm_unreachable("Unknown ICmp predicate!")::llvm::llvm_unreachable_internal("Unknown ICmp predicate!", "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3236);
        // LHS <u RHS.
        case ICmpInst::ICMP_EQ:
        case ICmpInst::ICMP_UGT:
        case ICmpInst::ICMP_UGE:
          return ConstantInt::getFalse(CI->getContext());

        case ICmpInst::ICMP_NE:
        case ICmpInst::ICMP_ULT:
        case ICmpInst::ICMP_ULE:
          return ConstantInt::getTrue(CI->getContext());

        // LHS is non-negative.  If RHS is negative then LHS >s LHS.  If RHS
        // is non-negative then LHS <s RHS.
        case ICmpInst::ICMP_SGT:
        case ICmpInst::ICMP_SGE:
          return CI->getValue().isNegative() ?
            ConstantInt::getTrue(CI->getContext()) :
            ConstantInt::getFalse(CI->getContext());

        case ICmpInst::ICMP_SLT:
        case ICmpInst::ICMP_SLE:
          return CI->getValue().isNegative() ?
            ConstantInt::getFalse(CI->getContext()) :
            ConstantInt::getTrue(CI->getContext());
        }
      }
    }
  }

  if (isa<SExtInst>(LHS)) {
    // Turn icmp (sext X), (sext Y) into a compare of X and Y if they have the
    // same type.
    if (SExtInst *RI = dyn_cast<SExtInst>(RHS)) {
      if (MaxRecurse && SrcTy == RI->getOperand(0)->getType())
        // Compare X and Y.  Note that the predicate does not change.
        if (Value *V = SimplifyICmpInst(Pred, SrcOp, RI->getOperand(0),
                                        Q, MaxRecurse-1))
          return V;
    }
    // Turn icmp (sext X), Cst into a compare of X and Cst if Cst is extended
    // too.  If not, then try to deduce the result of the comparison.
    else if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
      // Compute the constant that would happen if we truncated to SrcTy then
      // reextended to DstTy.
      Constant *Trunc = ConstantExpr::getTrunc(CI, SrcTy);
      Constant *RExt = ConstantExpr::getCast(CastInst::SExt, Trunc, DstTy);

      // If the re-extended constant didn't change then this is effectively
      // also a case of comparing two sign-extended values.
      if (RExt == CI && MaxRecurse)
        if (Value *V = SimplifyICmpInst(Pred, SrcOp, Trunc, Q, MaxRecurse-1))
          return V;

      // Otherwise the upper bits of LHS are all equal, while RHS has varying
      // bits there.  Use this to work out the result of the comparison.
      if (RExt != CI) {
        switch (Pred) {
        default: llvm_unreachable("Unknown ICmp predicate!")::llvm::llvm_unreachable_internal("Unknown ICmp predicate!", "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3294);
        case ICmpInst::ICMP_EQ:
          return ConstantInt::getFalse(CI->getContext());
        case ICmpInst::ICMP_NE:
          return ConstantInt::getTrue(CI->getContext());

        // If RHS is non-negative then LHS <s RHS.  If RHS is negative then
        // LHS >s RHS.
        case ICmpInst::ICMP_SGT:
        case ICmpInst::ICMP_SGE:
          return CI->getValue().isNegative() ?
            ConstantInt::getTrue(CI->getContext()) :
            ConstantInt::getFalse(CI->getContext());
        case ICmpInst::ICMP_SLT:
        case ICmpInst::ICMP_SLE:
          return CI->getValue().isNegative() ?
            ConstantInt::getFalse(CI->getContext()) :
            ConstantInt::getTrue(CI->getContext());

        // If LHS is non-negative then LHS <u RHS.  If LHS is negative then
        // LHS >u RHS.
        case ICmpInst::ICMP_UGT:
        case ICmpInst::ICMP_UGE:
          // Comparison is true iff the LHS <s 0.
          if (MaxRecurse)
            if (Value *V = SimplifyICmpInst(ICmpInst::ICMP_SLT, SrcOp,
                                            Constant::getNullValue(SrcTy),
                                            Q, MaxRecurse-1))
              return V;
          break;
        case ICmpInst::ICMP_ULT:
        case ICmpInst::ICMP_ULE:
          // Comparison is true iff the LHS >=s 0.
          if (MaxRecurse)
            if (Value *V = SimplifyICmpInst(ICmpInst::ICMP_SGE, SrcOp,
                                            Constant::getNullValue(SrcTy),
                                            Q, MaxRecurse-1))
              return V;
          break;
        }
      }
    }
  }
}

// icmp eq|ne X, Y -> false|true if X != Y
if (ICmpInst::isEquality(Pred) &&
    isKnownNonEqual(LHS, RHS, Q.DL, Q.AC, Q.CxtI, Q.DT)) {
  return Pred == ICmpInst::ICMP_NE ? getTrue(ITy) : getFalse(ITy);
}

if (Value *V = simplifyICmpWithBinOp(Pred, LHS, RHS, Q, MaxRecurse))
  return V;

if (Value *V = simplifyICmpWithMinMax(Pred, LHS, RHS, Q, MaxRecurse))
  return V;

// Simplify comparisons of related pointers using a powerful, recursive
// GEP-walk when we have target data available..
if (LHS->getType()->isPointerTy())
  if (auto *C = computePointerICmp(Q.DL, Q.TLI, Q.DT, Pred, Q.AC, Q.CxtI, LHS,
                                   RHS))
    return C;
if (auto *CLHS = dyn_cast<PtrToIntOperator>(LHS))
  if (auto *CRHS = dyn_cast<PtrToIntOperator>(RHS))
    if (Q.DL.getTypeSizeInBits(CLHS->getPointerOperandType()) ==
            Q.DL.getTypeSizeInBits(CLHS->getType()) &&
        Q.DL.getTypeSizeInBits(CRHS->getPointerOperandType()) ==
            Q.DL.getTypeSizeInBits(CRHS->getType()))
      if (auto *C = computePointerICmp(Q.DL, Q.TLI, Q.DT, Pred, Q.AC, Q.CxtI,
                                       CLHS->getPointerOperand(),
                                       CRHS->getPointerOperand()))
        return C;

if (GetElementPtrInst *GLHS = dyn_cast<GetElementPtrInst>(LHS)) {
  if (GEPOperator *GRHS = dyn_cast<GEPOperator>(RHS)) {
    if (GLHS->getPointerOperand() == GRHS->getPointerOperand() &&
        GLHS->hasAllConstantIndices() && GRHS->hasAllConstantIndices() &&
        (ICmpInst::isEquality(Pred) ||
         (GLHS->isInBounds() && GRHS->isInBounds() &&
          Pred == ICmpInst::getSignedPredicate(Pred)))) {
      // The bases are equal and the indices are constant.  Build a constant
      // expression GEP with the same indices and a null base pointer to see
      // what constant folding can make out of it.
      Constant *Null = Constant::getNullValue(GLHS->getPointerOperandType());
      SmallVector<Value *, 4> IndicesLHS(GLHS->idx_begin(), GLHS->idx_end());
      Constant *NewLHS = ConstantExpr::getGetElementPtr(
          GLHS->getSourceElementType(), Null, IndicesLHS);

      SmallVector<Value *, 4> IndicesRHS(GRHS->idx_begin(), GRHS->idx_end());
      Constant *NewRHS = ConstantExpr::getGetElementPtr(
          GLHS->getSourceElementType(), Null, IndicesRHS);
      return ConstantExpr::getICmp(Pred, NewLHS, NewRHS);
    }
  }
}

// If the comparison is with the result of a select instruction, check whether
// comparing with either branch of the select always yields the same value.
if (isa<SelectInst>(LHS) || isa<SelectInst>(RHS))
  if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, Q, MaxRecurse))
    return V;

// If the comparison is with the result of a phi instruction, check whether
// doing the compare with each incoming phi value yields a common result.
if (isa<PHINode>(LHS) || isa<PHINode>(RHS))
  if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, Q, MaxRecurse))
    return V;

return nullptr;
3404}

3406Value *llvm::SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                            const SimplifyQuery &Q) {
return ::SimplifyICmpInst(Predicate, LHS, RHS, Q, RecursionLimit);
3409}

3411/// Given operands for an FCmpInst, see if we can fold the result.
3412/// If not, this returns null.
3413static Value *SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                             FastMathFlags FMF, const SimplifyQuery &Q,
                             unsigned MaxRecurse) {
CmpInst::Predicate Pred = (CmpInst::Predicate)Predicate;
assert(CmpInst::isFPPredicate(Pred) && "Not an FP compare!")(static_cast <bool> (CmpInst::isFPPredicate(Pred) &&
 "Not an FP compare!") ? void (0) : __assert_fail ("CmpInst::isFPPredicate(Pred) && \"Not an FP compare!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3417, __extension__ __PRETTY_FUNCTION__));

if (Constant *CLHS = dyn_cast<Constant>(LHS)) {
4
←
Taking false branch→
  if (Constant *CRHS = dyn_cast<Constant>(RHS))
    return ConstantFoldCompareInstOperands(Pred, CLHS, CRHS, Q.DL, Q.TLI);

  // If we have a constant, make sure it is on the RHS.
  std::swap(LHS, RHS);
  Pred = CmpInst::getSwappedPredicate(Pred);
}

// Fold trivial predicates.
Type *RetTy = GetCompareTy(LHS);
if (Pred == FCmpInst::FCMP_FALSE)
5
←
Assuming 'Pred' is not equal to FCMP_FALSE→
6
←
Taking false branch→
  return getFalse(RetTy);
if (Pred == FCmpInst::FCMP_TRUE)
7
←
Assuming 'Pred' is not equal to FCMP_TRUE→
8
←
Taking false branch→
  return getTrue(RetTy);

// UNO/ORD predicates can be trivially folded if NaNs are ignored.
if (FMF.noNaNs()) {
9
←
Taking false branch→
  if (Pred == FCmpInst::FCMP_UNO)
    return getFalse(RetTy);
  if (Pred == FCmpInst::FCMP_ORD)
    return getTrue(RetTy);
}

// NaN is unordered; NaN is not ordered.
assert((FCmpInst::isOrdered(Pred) || FCmpInst::isUnordered(Pred)) &&(static_cast <bool> ((FCmpInst::isOrdered(Pred) || FCmpInst
::isUnordered(Pred)) && "Comparison must be either ordered or unordered"
) ? void (0) : __assert_fail ("(FCmpInst::isOrdered(Pred) || FCmpInst::isUnordered(Pred)) && \"Comparison must be either ordered or unordered\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3445, __extension__ __PRETTY_FUNCTION__))
       "Comparison must be either ordered or unordered")(static_cast <bool> ((FCmpInst::isOrdered(Pred) || FCmpInst
::isUnordered(Pred)) && "Comparison must be either ordered or unordered"
) ? void (0) : __assert_fail ("(FCmpInst::isOrdered(Pred) || FCmpInst::isUnordered(Pred)) && \"Comparison must be either ordered or unordered\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3445, __extension__ __PRETTY_FUNCTION__));
if (match(RHS, m_NaN()))
10
←
Assuming the condition is false→
11
←
Taking false branch→
  return ConstantInt::get(RetTy, CmpInst::isUnordered(Pred));

// fcmp pred x, undef  and  fcmp pred undef, x
// fold to true if unordered, false if ordered
if (isa<UndefValue>(LHS) || isa<UndefValue>(RHS)) {
12
←
Taking false branch→
  // Choosing NaN for the undef will always make unordered comparison succeed
  // and ordered comparison fail.
  return ConstantInt::get(RetTy, CmpInst::isUnordered(Pred));
}

// fcmp x,x -> true/false.  Not all compares are foldable.
if (LHS == RHS) {
13
←
Assuming 'LHS' is not equal to 'RHS'→
14
←
Taking false branch→
  if (CmpInst::isTrueWhenEqual(Pred))
    return getTrue(RetTy);
  if (CmpInst::isFalseWhenEqual(Pred))
    return getFalse(RetTy);
}

// Handle fcmp with constant RHS.
const APFloat *C;
if (match(RHS, m_APFloat(C))) {
15
←
Taking false branch→
  // Check whether the constant is an infinity.
  if (C->isInfinity()) {
    if (C->isNegative()) {
      switch (Pred) {
      case FCmpInst::FCMP_OLT:
        // No value is ordered and less than negative infinity.
        return getFalse(RetTy);
      case FCmpInst::FCMP_UGE:
        // All values are unordered with or at least negative infinity.
        return getTrue(RetTy);
      default:
        break;
      }
    } else {
      switch (Pred) {
      case FCmpInst::FCMP_OGT:
        // No value is ordered and greater than infinity.
        return getFalse(RetTy);
      case FCmpInst::FCMP_ULE:
        // All values are unordered with and at most infinity.
        return getTrue(RetTy);
      default:
        break;
      }
    }
  }
  if (C->isZero()) {
    switch (Pred) {
    case FCmpInst::FCMP_UGE:
      if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
        return getTrue(RetTy);
      break;
    case FCmpInst::FCMP_OLT:
      // X < 0
      if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
        return getFalse(RetTy);
      break;
    default:
      break;
    }
  } else if (C->isNegative()) {
    assert(!C->isNaN() && "Unexpected NaN constant!")(static_cast <bool> (!C->isNaN() && "Unexpected NaN constant!"
) ? void (0) : __assert_fail ("!C->isNaN() && \"Unexpected NaN constant!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 3509, __extension__ __PRETTY_FUNCTION__));
    // TODO: We can catch more cases by using a range check rather than
    //       relying on CannotBeOrderedLessThanZero.
    switch (Pred) {
    case FCmpInst::FCMP_UGE:
    case FCmpInst::FCMP_UGT:
    case FCmpInst::FCMP_UNE:
      // (X >= 0) implies (X > C) when (C < 0)
      if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
        return getTrue(RetTy);
      break;
    case FCmpInst::FCMP_OEQ:
    case FCmpInst::FCMP_OLE:
    case FCmpInst::FCMP_OLT:
      // (X >= 0) implies !(X < C) when (C < 0)
      if (CannotBeOrderedLessThanZero(LHS, Q.TLI))
        return getFalse(RetTy);
      break;
    default:
      break;
    }
  }
}

// If the comparison is with the result of a select instruction, check whether
// comparing with either branch of the select always yields the same value.
if (isa<SelectInst>(LHS) || isa<SelectInst>(RHS))
16
←
Taking true branch→
  if (Value *V = ThreadCmpOverSelect(Pred, LHS, RHS, Q, MaxRecurse))
17
←
Calling 'ThreadCmpOverSelect'→
    return V;

// If the comparison is with the result of a phi instruction, check whether
// doing the compare with each incoming phi value yields a common result.
if (isa<PHINode>(LHS) || isa<PHINode>(RHS))
  if (Value *V = ThreadCmpOverPHI(Pred, LHS, RHS, Q, MaxRecurse))
    return V;

return nullptr;
3546}

3548Value *llvm::SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                            FastMathFlags FMF, const SimplifyQuery &Q) {
return ::SimplifyFCmpInst(Predicate, LHS, RHS, FMF, Q, RecursionLimit);
3551}

3553/// See if V simplifies when its operand Op is replaced with RepOp.
3554static const Value *SimplifyWithOpReplaced(Value *V, Value *Op, Value *RepOp,
                                         const SimplifyQuery &Q,
                                         unsigned MaxRecurse) {
// Trivial replacement.
if (V == Op)
  return RepOp;

// We cannot replace a constant, and shouldn't even try.
if (isa<Constant>(Op))
  return nullptr;

auto *I = dyn_cast<Instruction>(V);
if (!I)
  return nullptr;

// If this is a binary operator, try to simplify it with the replaced op.
if (auto *B = dyn_cast<BinaryOperator>(I)) {
  // Consider:
  //   %cmp = icmp eq i32 %x, 2147483647
  //   %add = add nsw i32 %x, 1
  //   %sel = select i1 %cmp, i32 -2147483648, i32 %add
  //
  // We can't replace %sel with %add unless we strip away the flags.
  if (isa<OverflowingBinaryOperator>(B))
    if (B->hasNoSignedWrap() || B->hasNoUnsignedWrap())
      return nullptr;
  if (isa<PossiblyExactOperator>(B))
    if (B->isExact())
      return nullptr;

  if (MaxRecurse) {
    if (B->getOperand(0) == Op)
      return SimplifyBinOp(B->getOpcode(), RepOp, B->getOperand(1), Q,
                           MaxRecurse - 1);
    if (B->getOperand(1) == Op)
      return SimplifyBinOp(B->getOpcode(), B->getOperand(0), RepOp, Q,
                           MaxRecurse - 1);
  }
}

// Same for CmpInsts.
if (CmpInst *C = dyn_cast<CmpInst>(I)) {
  if (MaxRecurse) {
    if (C->getOperand(0) == Op)
      return SimplifyCmpInst(C->getPredicate(), RepOp, C->getOperand(1), Q,
                             MaxRecurse - 1);
    if (C->getOperand(1) == Op)
      return SimplifyCmpInst(C->getPredicate(), C->getOperand(0), RepOp, Q,
                             MaxRecurse - 1);
  }
}

// Same for GEPs.
if (auto *GEP = dyn_cast<GetElementPtrInst>(I)) {
  if (MaxRecurse) {
    SmallVector<Value *, 8> NewOps(GEP->getNumOperands());
    transform(GEP->operands(), NewOps.begin(),
              [&](Value *V) { return V == Op ? RepOp : V; });
    return SimplifyGEPInst(GEP->getSourceElementType(), NewOps, Q,
                           MaxRecurse - 1);
  }
}

// TODO: We could hand off more cases to instsimplify here.

// If all operands are constant after substituting Op for RepOp then we can
// constant fold the instruction.
if (Constant *CRepOp = dyn_cast<Constant>(RepOp)) {
  // Build a list of all constant operands.
  SmallVector<Constant *, 8> ConstOps;
  for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) {
    if (I->getOperand(i) == Op)
      ConstOps.push_back(CRepOp);
    else if (Constant *COp = dyn_cast<Constant>(I->getOperand(i)))
      ConstOps.push_back(COp);
    else
      break;
  }

  // All operands were constants, fold it.
  if (ConstOps.size() == I->getNumOperands()) {
    if (CmpInst *C = dyn_cast<CmpInst>(I))
      return ConstantFoldCompareInstOperands(C->getPredicate(), ConstOps[0],
                                             ConstOps[1], Q.DL, Q.TLI);

    if (LoadInst *LI = dyn_cast<LoadInst>(I))
      if (!LI->isVolatile())
        return ConstantFoldLoadFromConstPtr(ConstOps[0], LI->getType(), Q.DL);

    return ConstantFoldInstOperands(I, ConstOps, Q.DL, Q.TLI);
  }
}

return nullptr;
3648}

3650/// Try to simplify a select instruction when its condition operand is an
3651/// integer comparison where one operand of the compare is a constant.
3652static Value *simplifySelectBitTest(Value *TrueVal, Value *FalseVal, Value *X,
                                  const APInt *Y, bool TrueWhenUnset) {
const APInt *C;

// (X & Y) == 0 ? X & ~Y : X  --> X
// (X & Y) != 0 ? X & ~Y : X  --> X & ~Y
if (FalseVal == X && match(TrueVal, m_And(m_Specific(X), m_APInt(C))) &&
    *Y == ~*C)
  return TrueWhenUnset ? FalseVal : TrueVal;

// (X & Y) == 0 ? X : X & ~Y  --> X & ~Y
// (X & Y) != 0 ? X : X & ~Y  --> X
if (TrueVal == X && match(FalseVal, m_And(m_Specific(X), m_APInt(C))) &&
    *Y == ~*C)
  return TrueWhenUnset ? FalseVal : TrueVal;

if (Y->isPowerOf2()) {
  // (X & Y) == 0 ? X | Y : X  --> X | Y
  // (X & Y) != 0 ? X | Y : X  --> X
  if (FalseVal == X && match(TrueVal, m_Or(m_Specific(X), m_APInt(C))) &&
      *Y == *C)
    return TrueWhenUnset ? TrueVal : FalseVal;

  // (X & Y) == 0 ? X : X | Y  --> X
  // (X & Y) != 0 ? X : X | Y  --> X | Y
  if (TrueVal == X && match(FalseVal, m_Or(m_Specific(X), m_APInt(C))) &&
      *Y == *C)
    return TrueWhenUnset ? TrueVal : FalseVal;
}

return nullptr;
3683}

3685/// An alternative way to test if a bit is set or not uses sgt/slt instead of
3686/// eq/ne.
3687static Value *simplifySelectWithFakeICmpEq(Value *CmpLHS, Value *CmpRHS,
                                         ICmpInst::Predicate Pred,
                                         Value *TrueVal, Value *FalseVal) {
Value *X;
APInt Mask;
if (!decomposeBitTestICmp(CmpLHS, CmpRHS, Pred, X, Mask))
  return nullptr;

return simplifySelectBitTest(TrueVal, FalseVal, X, &Mask,
                             Pred == ICmpInst::ICMP_EQ);
3697}

3699/// Try to simplify a select instruction when its condition operand is an
3700/// integer comparison.
3701static Value *simplifySelectWithICmpCond(Value *CondVal, Value *TrueVal,
                                       Value *FalseVal, const SimplifyQuery &Q,
                                       unsigned MaxRecurse) {
ICmpInst::Predicate Pred;
Value *CmpLHS, *CmpRHS;
if (!match(CondVal, m_ICmp(Pred, m_Value(CmpLHS), m_Value(CmpRHS))))
  return nullptr;

if (ICmpInst::isEquality(Pred) && match(CmpRHS, m_Zero())) {
  Value *X;
  const APInt *Y;
  if (match(CmpLHS, m_And(m_Value(X), m_APInt(Y))))
    if (Value *V = simplifySelectBitTest(TrueVal, FalseVal, X, Y,
                                         Pred == ICmpInst::ICMP_EQ))
      return V;
}

// Check for other compares that behave like bit test.
if (Value *V = simplifySelectWithFakeICmpEq(CmpLHS, CmpRHS, Pred,
                                            TrueVal, FalseVal))
  return V;

// If we have an equality comparison, then we know the value in one of the
// arms of the select. See if substituting this value into the arm and
// simplifying the result yields the same value as the other arm.
if (Pred == ICmpInst::ICMP_EQ) {
  if (SimplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
          TrueVal ||
      SimplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
          TrueVal)
    return FalseVal;
  if (SimplifyWithOpReplaced(TrueVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
          FalseVal ||
      SimplifyWithOpReplaced(TrueVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
          FalseVal)
    return FalseVal;
} else if (Pred == ICmpInst::ICMP_NE) {
  if (SimplifyWithOpReplaced(TrueVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
          FalseVal ||
      SimplifyWithOpReplaced(TrueVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
          FalseVal)
    return TrueVal;
  if (SimplifyWithOpReplaced(FalseVal, CmpLHS, CmpRHS, Q, MaxRecurse) ==
          TrueVal ||
      SimplifyWithOpReplaced(FalseVal, CmpRHS, CmpLHS, Q, MaxRecurse) ==
          TrueVal)
    return TrueVal;
}

return nullptr;
3751}

3753/// Given operands for a SelectInst, see if we can fold the result.
3754/// If not, this returns null.
3755static Value *SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal,
                               const SimplifyQuery &Q, unsigned MaxRecurse) {
if (auto *CondC = dyn_cast<Constant>(Cond)) {
  if (auto *TrueC = dyn_cast<Constant>(TrueVal))
    if (auto *FalseC = dyn_cast<Constant>(FalseVal))
      return ConstantFoldSelectInstruction(CondC, TrueC, FalseC);

  // select undef, X, Y -> X or Y
  if (isa<UndefValue>(CondC))
    return isa<Constant>(FalseVal) ? FalseVal : TrueVal;

  // TODO: Vector constants with undef elements don't simplify.

  // select true, X, Y  -> X
  if (CondC->isAllOnesValue())
    return TrueVal;
  // select false, X, Y -> Y
  if (CondC->isNullValue())
    return FalseVal;
}

// select ?, X, X -> X
if (TrueVal == FalseVal)
  return TrueVal;

if (isa<UndefValue>(TrueVal))   // select ?, undef, X -> X
  return FalseVal;
if (isa<UndefValue>(FalseVal))   // select ?, X, undef -> X
  return TrueVal;

if (Value *V =
        simplifySelectWithICmpCond(Cond, TrueVal, FalseVal, Q, MaxRecurse))
  return V;

if (Value *V = foldSelectWithBinaryOp(Cond, TrueVal, FalseVal))
  return V;

return nullptr;
3793}

3795Value *llvm::SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal,
                              const SimplifyQuery &Q) {
return ::SimplifySelectInst(Cond, TrueVal, FalseVal, Q, RecursionLimit);
3798}

3800/// Given operands for an GetElementPtrInst, see if we can fold the result.
3801/// If not, this returns null.
3802static Value *SimplifyGEPInst(Type *SrcTy, ArrayRef<Value *> Ops,
                            const SimplifyQuery &Q, unsigned) {
// The type of the GEP pointer operand.
unsigned AS =
    cast<PointerType>(Ops[0]->getType()->getScalarType())->getAddressSpace();

// getelementptr P -> P.
if (Ops.size() == 1)
  return Ops[0];

// Compute the (pointer) type returned by the GEP instruction.
Type *LastType = GetElementPtrInst::getIndexedType(SrcTy, Ops.slice(1));
Type *GEPTy = PointerType::get(LastType, AS);
if (VectorType *VT = dyn_cast<VectorType>(Ops[0]->getType()))
  GEPTy = VectorType::get(GEPTy, VT->getNumElements());
else if (VectorType *VT = dyn_cast<VectorType>(Ops[1]->getType()))
  GEPTy = VectorType::get(GEPTy, VT->getNumElements());

if (isa<UndefValue>(Ops[0]))
  return UndefValue::get(GEPTy);

if (Ops.size() == 2) {
  // getelementptr P, 0 -> P.
  if (match(Ops[1], m_Zero()) && Ops[0]->getType() == GEPTy)
    return Ops[0];

  Type *Ty = SrcTy;
  if (Ty->isSized()) {
    Value *P;
    uint64_t C;
    uint64_t TyAllocSize = Q.DL.getTypeAllocSize(Ty);
    // getelementptr P, N -> P if P points to a type of zero size.
    if (TyAllocSize == 0 && Ops[0]->getType() == GEPTy)
      return Ops[0];

    // The following transforms are only safe if the ptrtoint cast
    // doesn't truncate the pointers.
    if (Ops[1]->getType()->getScalarSizeInBits() ==
        Q.DL.getIndexSizeInBits(AS)) {
      auto PtrToIntOrZero = [GEPTy](Value *P) -> Value * {
        if (match(P, m_Zero()))
          return Constant::getNullValue(GEPTy);
        Value *Temp;
        if (match(P, m_PtrToInt(m_Value(Temp))))
          if (Temp->getType() == GEPTy)
            return Temp;
        return nullptr;
      };

      // getelementptr V, (sub P, V) -> P if P points to a type of size 1.
      if (TyAllocSize == 1 &&
          match(Ops[1], m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0])))))
        if (Value *R = PtrToIntOrZero(P))
          return R;

      // getelementptr V, (ashr (sub P, V), C) -> Q
      // if P points to a type of size 1 << C.
      if (match(Ops[1],
                m_AShr(m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0]))),
                       m_ConstantInt(C))) &&
          TyAllocSize == 1ULL << C)
        if (Value *R = PtrToIntOrZero(P))
          return R;

      // getelementptr V, (sdiv (sub P, V), C) -> Q
      // if P points to a type of size C.
      if (match(Ops[1],
                m_SDiv(m_Sub(m_Value(P), m_PtrToInt(m_Specific(Ops[0]))),
                       m_SpecificInt(TyAllocSize))))
        if (Value *R = PtrToIntOrZero(P))
          return R;
    }
  }
}

if (Q.DL.getTypeAllocSize(LastType) == 1 &&
    all_of(Ops.slice(1).drop_back(1),
           [](Value *Idx) { return match(Idx, m_Zero()); })) {
  unsigned IdxWidth =
      Q.DL.getIndexSizeInBits(Ops[0]->getType()->getPointerAddressSpace());
  if (Q.DL.getTypeSizeInBits(Ops.back()->getType()) == IdxWidth) {
    APInt BasePtrOffset(IdxWidth, 0);
    Value *StrippedBasePtr =
        Ops[0]->stripAndAccumulateInBoundsConstantOffsets(Q.DL,
                                                          BasePtrOffset);

    // gep (gep V, C), (sub 0, V) -> C
    if (match(Ops.back(),
              m_Sub(m_Zero(), m_PtrToInt(m_Specific(StrippedBasePtr))))) {
      auto *CI = ConstantInt::get(GEPTy->getContext(), BasePtrOffset);
      return ConstantExpr::getIntToPtr(CI, GEPTy);
    }
    // gep (gep V, C), (xor V, -1) -> C-1
    if (match(Ops.back(),
              m_Xor(m_PtrToInt(m_Specific(StrippedBasePtr)), m_AllOnes()))) {
      auto *CI = ConstantInt::get(GEPTy->getContext(), BasePtrOffset - 1);
      return ConstantExpr::getIntToPtr(CI, GEPTy);
    }
  }
}

// Check to see if this is constant foldable.
if (!all_of(Ops, [](Value *V) { return isa<Constant>(V); }))
  return nullptr;

auto *CE = ConstantExpr::getGetElementPtr(SrcTy, cast<Constant>(Ops[0]),
                                          Ops.slice(1));
if (auto *CEFolded = ConstantFoldConstant(CE, Q.DL))
  return CEFolded;
return CE;
3912}

3914Value *llvm::SimplifyGEPInst(Type *SrcTy, ArrayRef<Value *> Ops,
                           const SimplifyQuery &Q) {
return ::SimplifyGEPInst(SrcTy, Ops, Q, RecursionLimit);
3917}

3919/// Given operands for an InsertValueInst, see if we can fold the result.
3920/// If not, this returns null.
3921static Value *SimplifyInsertValueInst(Value *Agg, Value *Val,
                                    ArrayRef<unsigned> Idxs, const SimplifyQuery &Q,
                                    unsigned) {
if (Constant *CAgg = dyn_cast<Constant>(Agg))
  if (Constant *CVal = dyn_cast<Constant>(Val))
    return ConstantFoldInsertValueInstruction(CAgg, CVal, Idxs);

// insertvalue x, undef, n -> x
if (match(Val, m_Undef()))
  return Agg;

// insertvalue x, (extractvalue y, n), n
if (ExtractValueInst *EV = dyn_cast<ExtractValueInst>(Val))
  if (EV->getAggregateOperand()->getType() == Agg->getType() &&
      EV->getIndices() == Idxs) {
    // insertvalue undef, (extractvalue y, n), n -> y
    if (match(Agg, m_Undef()))
      return EV->getAggregateOperand();

    // insertvalue y, (extractvalue y, n), n -> y
    if (Agg == EV->getAggregateOperand())
      return Agg;
  }

return nullptr;
3946}

3948Value *llvm::SimplifyInsertValueInst(Value *Agg, Value *Val,
                                   ArrayRef<unsigned> Idxs,
                                   const SimplifyQuery &Q) {
return ::SimplifyInsertValueInst(Agg, Val, Idxs, Q, RecursionLimit);
3952}

3954Value *llvm::SimplifyInsertElementInst(Value *Vec, Value *Val, Value *Idx,
                                     const SimplifyQuery &Q) {
// Try to constant fold.
auto *VecC = dyn_cast<Constant>(Vec);
auto *ValC = dyn_cast<Constant>(Val);
auto *IdxC = dyn_cast<Constant>(Idx);
if (VecC && ValC && IdxC)
  return ConstantFoldInsertElementInstruction(VecC, ValC, IdxC);

// Fold into undef if index is out of bounds.
if (auto *CI = dyn_cast<ConstantInt>(Idx)) {
  uint64_t NumElements = cast<VectorType>(Vec->getType())->getNumElements();
  if (CI->uge(NumElements))
    return UndefValue::get(Vec->getType());
}

// If index is undef, it might be out of bounds (see above case)
if (isa<UndefValue>(Idx))
  return UndefValue::get(Vec->getType());

return nullptr;
3975}

3977/// Given operands for an ExtractValueInst, see if we can fold the result.
3978/// If not, this returns null.
3979static Value *SimplifyExtractValueInst(Value *Agg, ArrayRef<unsigned> Idxs,
                                     const SimplifyQuery &, unsigned) {
if (auto *CAgg = dyn_cast<Constant>(Agg))
  return ConstantFoldExtractValueInstruction(CAgg, Idxs);

// extractvalue x, (insertvalue y, elt, n), n -> elt
unsigned NumIdxs = Idxs.size();
for (auto *IVI = dyn_cast<InsertValueInst>(Agg); IVI != nullptr;
     IVI = dyn_cast<InsertValueInst>(IVI->getAggregateOperand())) {
  ArrayRef<unsigned> InsertValueIdxs = IVI->getIndices();
  unsigned NumInsertValueIdxs = InsertValueIdxs.size();
  unsigned NumCommonIdxs = std::min(NumInsertValueIdxs, NumIdxs);
  if (InsertValueIdxs.slice(0, NumCommonIdxs) ==
      Idxs.slice(0, NumCommonIdxs)) {
    if (NumIdxs == NumInsertValueIdxs)
      return IVI->getInsertedValueOperand();
    break;
  }
}

return nullptr;
4000}

4002Value *llvm::SimplifyExtractValueInst(Value *Agg, ArrayRef<unsigned> Idxs,
                                    const SimplifyQuery &Q) {
return ::SimplifyExtractValueInst(Agg, Idxs, Q, RecursionLimit);
4005}

4007/// Given operands for an ExtractElementInst, see if we can fold the result.
4008/// If not, this returns null.
4009static Value *SimplifyExtractElementInst(Value *Vec, Value *Idx, const SimplifyQuery &,
                                       unsigned) {
if (auto *CVec = dyn_cast<Constant>(Vec)) {
  if (auto *CIdx = dyn_cast<Constant>(Idx))
    return ConstantFoldExtractElementInstruction(CVec, CIdx);

  // The index is not relevant if our vector is a splat.
  if (auto *Splat = CVec->getSplatValue())
    return Splat;

  if (isa<UndefValue>(Vec))
    return UndefValue::get(Vec->getType()->getVectorElementType());
}

// If extracting a specified index from the vector, see if we can recursively
// find a previously computed scalar that was inserted into the vector.
if (auto *IdxC = dyn_cast<ConstantInt>(Idx)) {
  if (IdxC->getValue().uge(Vec->getType()->getVectorNumElements()))
    // definitely out of bounds, thus undefined result
    return UndefValue::get(Vec->getType()->getVectorElementType());
  if (Value *Elt = findScalarElement(Vec, IdxC->getZExtValue()))
    return Elt;
}

// An undef extract index can be arbitrarily chosen to be an out-of-range
// index value, which would result in the instruction being undef.
if (isa<UndefValue>(Idx))
  return UndefValue::get(Vec->getType()->getVectorElementType());

return nullptr;
4039}

4041Value *llvm::SimplifyExtractElementInst(Value *Vec, Value *Idx,
                                      const SimplifyQuery &Q) {
return ::SimplifyExtractElementInst(Vec, Idx, Q, RecursionLimit);
4044}

4046/// See if we can fold the given phi. If not, returns null.
4047static Value *SimplifyPHINode(PHINode *PN, const SimplifyQuery &Q) {
// If all of the PHI's incoming values are the same then replace the PHI node
// with the common value.
Value *CommonValue = nullptr;
bool HasUndefInput = false;
for (Value *Incoming : PN->incoming_values()) {
  // If the incoming value is the phi node itself, it can safely be skipped.
  if (Incoming == PN) continue;
  if (isa<UndefValue>(Incoming)) {
    // Remember that we saw an undef value, but otherwise ignore them.
    HasUndefInput = true;
    continue;
  }
  if (CommonValue && Incoming != CommonValue)
    return nullptr;  // Not the same, bail out.
  CommonValue = Incoming;
}

// If CommonValue is null then all of the incoming values were either undef or
// equal to the phi node itself.
if (!CommonValue)
  return UndefValue::get(PN->getType());

// If we have a PHI node like phi(X, undef, X), where X is defined by some
// instruction, we cannot return X as the result of the PHI node unless it
// dominates the PHI block.
if (HasUndefInput)
  return valueDominatesPHI(CommonValue, PN, Q.DT) ? CommonValue : nullptr;

return CommonValue;
4077}

4079static Value *SimplifyCastInst(unsigned CastOpc, Value *Op,
                             Type *Ty, const SimplifyQuery &Q, unsigned MaxRecurse) {
if (auto *C = dyn_cast<Constant>(Op))
  return ConstantFoldCastOperand(CastOpc, C, Ty, Q.DL);

if (auto *CI = dyn_cast<CastInst>(Op)) {
  auto *Src = CI->getOperand(0);
  Type *SrcTy = Src->getType();
  Type *MidTy = CI->getType();
  Type *DstTy = Ty;
  if (Src->getType() == Ty) {
    auto FirstOp = static_cast<Instruction::CastOps>(CI->getOpcode());
    auto SecondOp = static_cast<Instruction::CastOps>(CastOpc);
    Type *SrcIntPtrTy =
        SrcTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(SrcTy) : nullptr;
    Type *MidIntPtrTy =
        MidTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(MidTy) : nullptr;
    Type *DstIntPtrTy =
        DstTy->isPtrOrPtrVectorTy() ? Q.DL.getIntPtrType(DstTy) : nullptr;
    if (CastInst::isEliminableCastPair(FirstOp, SecondOp, SrcTy, MidTy, DstTy,
                                       SrcIntPtrTy, MidIntPtrTy,
                                       DstIntPtrTy) == Instruction::BitCast)
      return Src;
  }
}

// bitcast x -> x
if (CastOpc == Instruction::BitCast)
  if (Op->getType() == Ty)
    return Op;

return nullptr;
4111}

4113Value *llvm::SimplifyCastInst(unsigned CastOpc, Value *Op, Type *Ty,
                            const SimplifyQuery &Q) {
return ::SimplifyCastInst(CastOpc, Op, Ty, Q, RecursionLimit);
4116}

4118/// For the given destination element of a shuffle, peek through shuffles to
4119/// match a root vector source operand that contains that element in the same
4120/// vector lane (ie, the same mask index), so we can eliminate the shuffle(s).
4121static Value *foldIdentityShuffles(int DestElt, Value *Op0, Value *Op1,
                                 int MaskVal, Value *RootVec,
                                 unsigned MaxRecurse) {
if (!MaxRecurse--)
  return nullptr;

// Bail out if any mask value is undefined. That kind of shuffle may be
// simplified further based on demanded bits or other folds.
if (MaskVal == -1)
  return nullptr;

// The mask value chooses which source operand we need to look at next.
int InVecNumElts = Op0->getType()->getVectorNumElements();
int RootElt = MaskVal;
Value *SourceOp = Op0;
if (MaskVal >= InVecNumElts) {
  RootElt = MaskVal - InVecNumElts;
  SourceOp = Op1;
}

// If the source operand is a shuffle itself, look through it to find the
// matching root vector.
if (auto *SourceShuf = dyn_cast<ShuffleVectorInst>(SourceOp)) {
  return foldIdentityShuffles(
      DestElt, SourceShuf->getOperand(0), SourceShuf->getOperand(1),
      SourceShuf->getMaskValue(RootElt), RootVec, MaxRecurse);
}

// TODO: Look through bitcasts? What if the bitcast changes the vector element
// size?

// The source operand is not a shuffle. Initialize the root vector value for
// this shuffle if that has not been done yet.
if (!RootVec)
  RootVec = SourceOp;

// Give up as soon as a source operand does not match the existing root value.
if (RootVec != SourceOp)
  return nullptr;

// The element must be coming from the same lane in the source vector
// (although it may have crossed lanes in intermediate shuffles).
if (RootElt != DestElt)
  return nullptr;

return RootVec;
4167}

4169static Value *SimplifyShuffleVectorInst(Value *Op0, Value *Op1, Constant *Mask,
                                      Type *RetTy, const SimplifyQuery &Q,
                                      unsigned MaxRecurse) {
if (isa<UndefValue>(Mask))
  return UndefValue::get(RetTy);

Type *InVecTy = Op0->getType();
unsigned MaskNumElts = Mask->getType()->getVectorNumElements();
unsigned InVecNumElts = InVecTy->getVectorNumElements();

SmallVector<int, 32> Indices;
ShuffleVectorInst::getShuffleMask(Mask, Indices);
assert(MaskNumElts == Indices.size() &&(static_cast <bool> (MaskNumElts == Indices.size() &&
 "Size of Indices not same as number of mask elements?") ? void
 (0) : __assert_fail ("MaskNumElts == Indices.size() && \"Size of Indices not same as number of mask elements?\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 4182, __extension__ __PRETTY_FUNCTION__))
       "Size of Indices not same as number of mask elements?")(static_cast <bool> (MaskNumElts == Indices.size() &&
 "Size of Indices not same as number of mask elements?") ? void
 (0) : __assert_fail ("MaskNumElts == Indices.size() && \"Size of Indices not same as number of mask elements?\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 4182, __extension__ __PRETTY_FUNCTION__));

// Canonicalization: If mask does not select elements from an input vector,
// replace that input vector with undef.
bool MaskSelects0 = false, MaskSelects1 = false;
for (unsigned i = 0; i != MaskNumElts; ++i) {
  if (Indices[i] == -1)
    continue;
  if ((unsigned)Indices[i] < InVecNumElts)
    MaskSelects0 = true;
  else
    MaskSelects1 = true;
}
if (!MaskSelects0)
  Op0 = UndefValue::get(InVecTy);
if (!MaskSelects1)
  Op1 = UndefValue::get(InVecTy);

auto *Op0Const = dyn_cast<Constant>(Op0);
auto *Op1Const = dyn_cast<Constant>(Op1);

// If all operands are constant, constant fold the shuffle.
if (Op0Const && Op1Const)
  return ConstantFoldShuffleVectorInstruction(Op0Const, Op1Const, Mask);

// Canonicalization: if only one input vector is constant, it shall be the
// second one.
if (Op0Const && !Op1Const) {
  std::swap(Op0, Op1);
  ShuffleVectorInst::commuteShuffleMask(Indices, InVecNumElts);
}

// A shuffle of a splat is always the splat itself. Legal if the shuffle's
// value type is same as the input vectors' type.
if (auto *OpShuf = dyn_cast<ShuffleVectorInst>(Op0))
  if (isa<UndefValue>(Op1) && RetTy == InVecTy &&
      OpShuf->getMask()->getSplatValue())
    return Op0;

// Don't fold a shuffle with undef mask elements. This may get folded in a
// better way using demanded bits or other analysis.
// TODO: Should we allow this?
if (find(Indices, -1) != Indices.end())
  return nullptr;

// Check if every element of this shuffle can be mapped back to the
// corresponding element of a single root vector. If so, we don't need this
// shuffle. This handles simple identity shuffles as well as chains of
// shuffles that may widen/narrow and/or move elements across lanes and back.
Value *RootVec = nullptr;
for (unsigned i = 0; i != MaskNumElts; ++i) {
  // Note that recursion is limited for each vector element, so if any element
  // exceeds the limit, this will fail to simplify.
  RootVec =
      foldIdentityShuffles(i, Op0, Op1, Indices[i], RootVec, MaxRecurse);

  // We can't replace a widening/narrowing shuffle with one of its operands.
  if (!RootVec || RootVec->getType() != RetTy)
    return nullptr;
}
return RootVec;
4243}

4245/// Given operands for a ShuffleVectorInst, fold the result or return null.
4246Value *llvm::SimplifyShuffleVectorInst(Value *Op0, Value *Op1, Constant *Mask,
                                     Type *RetTy, const SimplifyQuery &Q) {
return ::SimplifyShuffleVectorInst(Op0, Op1, Mask, RetTy, Q, RecursionLimit);
4249}

4251static Constant *propagateNaN(Constant *In) {
// If the input is a vector with undef elements, just return a default NaN.
if (!In->isNaN())
  return ConstantFP::getNaN(In->getType());

// Propagate the existing NaN constant when possible.
// TODO: Should we quiet a signaling NaN?
return In;
4259}

4261static Constant *simplifyFPBinop(Value *Op0, Value *Op1) {
if (isa<UndefValue>(Op0) || isa<UndefValue>(Op1))
  return ConstantFP::getNaN(Op0->getType());

if (match(Op0, m_NaN()))
  return propagateNaN(cast<Constant>(Op0));
if (match(Op1, m_NaN()))
  return propagateNaN(cast<Constant>(Op1));

return nullptr;
4271}

4273/// Given operands for an FAdd, see if we can fold the result.  If not, this
4274/// returns null.
4275static Value *SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::FAdd, Op0, Op1, Q))
  return C;

if (Constant *C = simplifyFPBinop(Op0, Op1))
  return C;

// fadd X, -0 ==> X
if (match(Op1, m_NegZeroFP()))
  return Op0;

// fadd X, 0 ==> X, when we know X is not -0
if (match(Op1, m_PosZeroFP()) &&
    (FMF.noSignedZeros() || CannotBeNegativeZero(Op0, Q.TLI)))
  return Op0;

// With nnan: (+/-0.0 - X) + X --> 0.0 (and commuted variant)
// We don't have to explicitly exclude infinities (ninf): INF + -INF == NaN.
// Negative zeros are allowed because we always end up with positive zero:
// X = -0.0: (-0.0 - (-0.0)) + (-0.0) == ( 0.0) + (-0.0) == 0.0
// X = -0.0: ( 0.0 - (-0.0)) + (-0.0) == ( 0.0) + (-0.0) == 0.0
// X =  0.0: (-0.0 - ( 0.0)) + ( 0.0) == (-0.0) + ( 0.0) == 0.0
// X =  0.0: ( 0.0 - ( 0.0)) + ( 0.0) == ( 0.0) + ( 0.0) == 0.0
if (FMF.noNaNs() && (match(Op0, m_FSub(m_AnyZeroFP(), m_Specific(Op1))) ||
                     match(Op1, m_FSub(m_AnyZeroFP(), m_Specific(Op0)))))
  return ConstantFP::getNullValue(Op0->getType());

return nullptr;
4304}

4306/// Given operands for an FSub, see if we can fold the result.  If not, this
4307/// returns null.
4308static Value *SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::FSub, Op0, Op1, Q))
  return C;

if (Constant *C = simplifyFPBinop(Op0, Op1))
  return C;

// fsub X, +0 ==> X
if (match(Op1, m_PosZeroFP()))
  return Op0;

// fsub X, -0 ==> X, when we know X is not -0
if (match(Op1, m_NegZeroFP()) &&
    (FMF.noSignedZeros() || CannotBeNegativeZero(Op0, Q.TLI)))
  return Op0;

// fsub -0.0, (fsub -0.0, X) ==> X
Value *X;
if (match(Op0, m_NegZeroFP()) &&
    match(Op1, m_FSub(m_NegZeroFP(), m_Value(X))))
  return X;

// fsub 0.0, (fsub 0.0, X) ==> X if signed zeros are ignored.
if (FMF.noSignedZeros() && match(Op0, m_AnyZeroFP()) &&
    match(Op1, m_FSub(m_AnyZeroFP(), m_Value(X))))
  return X;

// fsub nnan x, x ==> 0.0
if (FMF.noNaNs() && Op0 == Op1)
  return Constant::getNullValue(Op0->getType());

return nullptr;
4341}

4343/// Given the operands for an FMul, see if we can fold the result
4344static Value *SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                             const SimplifyQuery &Q, unsigned MaxRecurse) {
if (Constant *C = foldOrCommuteConstant(Instruction::FMul, Op0, Op1, Q))
  return C;

if (Constant *C = simplifyFPBinop(Op0, Op1))
  return C;

// fmul X, 1.0 ==> X
if (match(Op1, m_FPOne()))
  return Op0;

// fmul nnan nsz X, 0 ==> 0
if (FMF.noNaNs() && FMF.noSignedZeros() && match(Op1, m_AnyZeroFP()))
  return ConstantFP::getNullValue(Op0->getType());

// sqrt(X) * sqrt(X) --> X, if we can:
// 1. Remove the intermediate rounding (reassociate).
// 2. Ignore non-zero negative numbers because sqrt would produce NAN.
// 3. Ignore -0.0 because sqrt(-0.0) == -0.0, but -0.0 * -0.0 == 0.0.
Value *X;
if (Op0 == Op1 && match(Op0, m_Intrinsic<Intrinsic::sqrt>(m_Value(X))) &&
    FMF.allowReassoc() && FMF.noNaNs() && FMF.noSignedZeros())
  return X;

return nullptr;
4370}

4372Value *llvm::SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                            const SimplifyQuery &Q) {
return ::SimplifyFAddInst(Op0, Op1, FMF, Q, RecursionLimit);
4375}


4378Value *llvm::SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                            const SimplifyQuery &Q) {
return ::SimplifyFSubInst(Op0, Op1, FMF, Q, RecursionLimit);
4381}

4383Value *llvm::SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                            const SimplifyQuery &Q) {
return ::SimplifyFMulInst(Op0, Op1, FMF, Q, RecursionLimit);
4386}

4388static Value *SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                             const SimplifyQuery &Q, unsigned) {
if (Constant *C = foldOrCommuteConstant(Instruction::FDiv, Op0, Op1, Q))
  return C;

if (Constant *C = simplifyFPBinop(Op0, Op1))
  return C;

// X / 1.0 -> X
if (match(Op1, m_FPOne()))
  return Op0;

// 0 / X -> 0
// Requires that NaNs are off (X could be zero) and signed zeroes are
// ignored (X could be positive or negative, so the output sign is unknown).
if (FMF.noNaNs() && FMF.noSignedZeros() && match(Op0, m_AnyZeroFP()))
  return ConstantFP::getNullValue(Op0->getType());

if (FMF.noNaNs()) {
  // X / X -> 1.0 is legal when NaNs are ignored.
  // We can ignore infinities because INF/INF is NaN.
  if (Op0 == Op1)
    return ConstantFP::get(Op0->getType(), 1.0);

  // (X * Y) / Y --> X if we can reassociate to the above form.
  Value *X;
  if (FMF.allowReassoc() && match(Op0, m_c_FMul(m_Value(X), m_Specific(Op1))))
    return X;

  // -X /  X -> -1.0 and
  //  X / -X -> -1.0 are legal when NaNs are ignored.
  // We can ignore signed zeros because +-0.0/+-0.0 is NaN and ignored.
  if ((BinaryOperator::isFNeg(Op0, /*IgnoreZeroSign=*/true) &&
       BinaryOperator::getFNegArgument(Op0) == Op1) ||
      (BinaryOperator::isFNeg(Op1, /*IgnoreZeroSign=*/true) &&
       BinaryOperator::getFNegArgument(Op1) == Op0))
    return ConstantFP::get(Op0->getType(), -1.0);
}

return nullptr;
4428}

4430Value *llvm::SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                            const SimplifyQuery &Q) {
return ::SimplifyFDivInst(Op0, Op1, FMF, Q, RecursionLimit);
4433}

4435static Value *SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                             const SimplifyQuery &Q, unsigned) {
if (Constant *C = foldOrCommuteConstant(Instruction::FRem, Op0, Op1, Q))
  return C;

if (Constant *C = simplifyFPBinop(Op0, Op1))
  return C;

// Unlike fdiv, the result of frem always matches the sign of the dividend.
// The constant match may include undef elements in a vector, so return a full
// zero constant as the result.
if (FMF.noNaNs()) {
  // +0 % X -> 0
  if (match(Op0, m_PosZeroFP()))
    return ConstantFP::getNullValue(Op0->getType());
  // -0 % X -> -0
  if (match(Op0, m_NegZeroFP()))
    return ConstantFP::getNegativeZero(Op0->getType());
}

return nullptr;
4456}

4458Value *llvm::SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF,
                            const SimplifyQuery &Q) {
return ::SimplifyFRemInst(Op0, Op1, FMF, Q, RecursionLimit);
4461}

4463//=== Helper functions for higher up the class hierarchy.

4465/// Given operands for a BinaryOperator, see if we can fold the result.
4466/// If not, this returns null.
4467static Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
                          const SimplifyQuery &Q, unsigned MaxRecurse) {
switch (Opcode) {
case Instruction::Add:
  return SimplifyAddInst(LHS, RHS, false, false, Q, MaxRecurse);
case Instruction::Sub:
  return SimplifySubInst(LHS, RHS, false, false, Q, MaxRecurse);
case Instruction::Mul:
  return SimplifyMulInst(LHS, RHS, Q, MaxRecurse);
case Instruction::SDiv:
  return SimplifySDivInst(LHS, RHS, Q, MaxRecurse);
case Instruction::UDiv:
  return SimplifyUDivInst(LHS, RHS, Q, MaxRecurse);
case Instruction::SRem:
  return SimplifySRemInst(LHS, RHS, Q, MaxRecurse);
case Instruction::URem:
  return SimplifyURemInst(LHS, RHS, Q, MaxRecurse);
case Instruction::Shl:
  return SimplifyShlInst(LHS, RHS, false, false, Q, MaxRecurse);
case Instruction::LShr:
  return SimplifyLShrInst(LHS, RHS, false, Q, MaxRecurse);
case Instruction::AShr:
  return SimplifyAShrInst(LHS, RHS, false, Q, MaxRecurse);
case Instruction::And:
  return SimplifyAndInst(LHS, RHS, Q, MaxRecurse);
case Instruction::Or:
  return SimplifyOrInst(LHS, RHS, Q, MaxRecurse);
case Instruction::Xor:
  return SimplifyXorInst(LHS, RHS, Q, MaxRecurse);
case Instruction::FAdd:
  return SimplifyFAddInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
case Instruction::FSub:
  return SimplifyFSubInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
case Instruction::FMul:
  return SimplifyFMulInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
case Instruction::FDiv:
  return SimplifyFDivInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
case Instruction::FRem:
  return SimplifyFRemInst(LHS, RHS, FastMathFlags(), Q, MaxRecurse);
default:
  llvm_unreachable("Unexpected opcode")::llvm::llvm_unreachable_internal("Unexpected opcode", "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 4507);
}
4509}

4511/// Given operands for a BinaryOperator, see if we can fold the result.
4512/// If not, this returns null.
4513/// In contrast to SimplifyBinOp, try to use FastMathFlag when folding the
4514/// result. In case we don't need FastMathFlags, simply fall to SimplifyBinOp.
4515static Value *SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS,
                            const FastMathFlags &FMF, const SimplifyQuery &Q,
                            unsigned MaxRecurse) {
switch (Opcode) {
case Instruction::FAdd:
  return SimplifyFAddInst(LHS, RHS, FMF, Q, MaxRecurse);
case Instruction::FSub:
  return SimplifyFSubInst(LHS, RHS, FMF, Q, MaxRecurse);
case Instruction::FMul:
  return SimplifyFMulInst(LHS, RHS, FMF, Q, MaxRecurse);
case Instruction::FDiv:
  return SimplifyFDivInst(LHS, RHS, FMF, Q, MaxRecurse);
default:
  return SimplifyBinOp(Opcode, LHS, RHS, Q, MaxRecurse);
}
4530}

4532Value *llvm::SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
                         const SimplifyQuery &Q) {
return ::SimplifyBinOp(Opcode, LHS, RHS, Q, RecursionLimit);
4535}

4537Value *llvm::SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS,
                           FastMathFlags FMF, const SimplifyQuery &Q) {
return ::SimplifyFPBinOp(Opcode, LHS, RHS, FMF, Q, RecursionLimit);
4540}

4542/// Given operands for a CmpInst, see if we can fold the result.
4543static Value *SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                            const SimplifyQuery &Q, unsigned MaxRecurse) {
if (CmpInst::isIntPredicate((CmpInst::Predicate)Predicate))
2
←
Taking false branch→
  return SimplifyICmpInst(Predicate, LHS, RHS, Q, MaxRecurse);
return SimplifyFCmpInst(Predicate, LHS, RHS, FastMathFlags(), Q, MaxRecurse);
3
←
Calling 'SimplifyFCmpInst'→
4548}

4550Value *llvm::SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS,
                           const SimplifyQuery &Q) {
return ::SimplifyCmpInst(Predicate, LHS, RHS, Q, RecursionLimit);
1
Calling 'SimplifyCmpInst'→
4553}

4555static bool IsIdempotent(Intrinsic::ID ID) {
switch (ID) {
default: return false;

// Unary idempotent: f(f(x)) = f(x)
case Intrinsic::fabs:
case Intrinsic::floor:
case Intrinsic::ceil:
case Intrinsic::trunc:
case Intrinsic::rint:
case Intrinsic::nearbyint:
case Intrinsic::round:
case Intrinsic::canonicalize:
  return true;
}
4570}

4572static Value *SimplifyRelativeLoad(Constant *Ptr, Constant *Offset,
                                 const DataLayout &DL) {
GlobalValue *PtrSym;
APInt PtrOffset;
if (!IsConstantOffsetFromGlobal(Ptr, PtrSym, PtrOffset, DL))
  return nullptr;

Type *Int8PtrTy = Type::getInt8PtrTy(Ptr->getContext());
Type *Int32Ty = Type::getInt32Ty(Ptr->getContext());
Type *Int32PtrTy = Int32Ty->getPointerTo();
Type *Int64Ty = Type::getInt64Ty(Ptr->getContext());

auto *OffsetConstInt = dyn_cast<ConstantInt>(Offset);
if (!OffsetConstInt || OffsetConstInt->getType()->getBitWidth() > 64)
  return nullptr;

uint64_t OffsetInt = OffsetConstInt->getSExtValue();
if (OffsetInt % 4 != 0)
  return nullptr;

Constant *C = ConstantExpr::getGetElementPtr(
    Int32Ty, ConstantExpr::getBitCast(Ptr, Int32PtrTy),
    ConstantInt::get(Int64Ty, OffsetInt / 4));
Constant *Loaded = ConstantFoldLoadFromConstPtr(C, Int32Ty, DL);
if (!Loaded)
  return nullptr;

auto *LoadedCE = dyn_cast<ConstantExpr>(Loaded);
if (!LoadedCE)
  return nullptr;

if (LoadedCE->getOpcode() == Instruction::Trunc) {
  LoadedCE = dyn_cast<ConstantExpr>(LoadedCE->getOperand(0));
  if (!LoadedCE)
    return nullptr;
}

if (LoadedCE->getOpcode() != Instruction::Sub)
  return nullptr;

auto *LoadedLHS = dyn_cast<ConstantExpr>(LoadedCE->getOperand(0));
if (!LoadedLHS || LoadedLHS->getOpcode() != Instruction::PtrToInt)
  return nullptr;
auto *LoadedLHSPtr = LoadedLHS->getOperand(0);

Constant *LoadedRHS = LoadedCE->getOperand(1);
GlobalValue *LoadedRHSSym;
APInt LoadedRHSOffset;
if (!IsConstantOffsetFromGlobal(LoadedRHS, LoadedRHSSym, LoadedRHSOffset,
                                DL) ||
    PtrSym != LoadedRHSSym || PtrOffset != LoadedRHSOffset)
  return nullptr;

return ConstantExpr::getBitCast(LoadedLHSPtr, Int8PtrTy);
4626}

4628static bool maskIsAllZeroOrUndef(Value *Mask) {
auto *ConstMask = dyn_cast<Constant>(Mask);
if (!ConstMask)
  return false;
if (ConstMask->isNullValue() || isa<UndefValue>(ConstMask))
  return true;
for (unsigned I = 0, E = ConstMask->getType()->getVectorNumElements(); I != E;
     ++I) {
  if (auto *MaskElt = ConstMask->getAggregateElement(I))
    if (MaskElt->isNullValue() || isa<UndefValue>(MaskElt))
      continue;
  return false;
}
return true;
4642}

4644template <typename IterTy>
4645static Value *SimplifyIntrinsic(Function *F, IterTy ArgBegin, IterTy ArgEnd,
                              const SimplifyQuery &Q, unsigned MaxRecurse) {
Intrinsic::ID IID = F->getIntrinsicID();
unsigned NumOperands = std::distance(ArgBegin, ArgEnd);

// Unary Ops
if (NumOperands == 1) {
  // Perform idempotent optimizations
  if (IsIdempotent(IID)) {
    if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(*ArgBegin)) {
      if (II->getIntrinsicID() == IID)
        return II;
    }
  }

  Value *IIOperand = *ArgBegin;
  Value *X;
  switch (IID) {
  case Intrinsic::fabs: {
    if (SignBitMustBeZero(IIOperand, Q.TLI))
      return IIOperand;
    return nullptr;
  }
  case Intrinsic::bswap: {
    // bswap(bswap(x)) -> x
    if (match(IIOperand, m_BSwap(m_Value(X))))
      return X;
    return nullptr;
  }
  case Intrinsic::bitreverse: {
    // bitreverse(bitreverse(x)) -> x
    if (match(IIOperand, m_BitReverse(m_Value(X))))
      return X;
    return nullptr;
  }
  case Intrinsic::exp: {
    // exp(log(x)) -> x
    if (Q.CxtI->hasAllowReassoc() &&
        match(IIOperand, m_Intrinsic<Intrinsic::log>(m_Value(X))))
      return X;
    return nullptr;
  }
  case Intrinsic::exp2: {
    // exp2(log2(x)) -> x
    if (Q.CxtI->hasAllowReassoc() &&
        match(IIOperand, m_Intrinsic<Intrinsic::log2>(m_Value(X))))
      return X;
    return nullptr;
  }
  case Intrinsic::log: {
    // log(exp(x)) -> x
    if (Q.CxtI->hasAllowReassoc() &&
        match(IIOperand, m_Intrinsic<Intrinsic::exp>(m_Value(X))))
      return X;
    return nullptr;
  }
  case Intrinsic::log2: {
    // log2(exp2(x)) -> x
    if (Q.CxtI->hasAllowReassoc() &&
        match(IIOperand, m_Intrinsic<Intrinsic::exp2>(m_Value(X)))) {
      return X;
    }
    return nullptr;
  }
  default:
    return nullptr;
  }
}

// Binary Ops
if (NumOperands == 2) {
  Value *LHS = *ArgBegin;
  Value *RHS = *(ArgBegin + 1);
  Type *ReturnType = F->getReturnType();

  switch (IID) {
  case Intrinsic::usub_with_overflow:
  case Intrinsic::ssub_with_overflow: {
    // X - X -> { 0, false }
    if (LHS == RHS)
      return Constant::getNullValue(ReturnType);

    // X - undef -> undef
    // undef - X -> undef
    if (isa<UndefValue>(LHS) || isa<UndefValue>(RHS))
      return UndefValue::get(ReturnType);

    return nullptr;
  }
  case Intrinsic::uadd_with_overflow:
  case Intrinsic::sadd_with_overflow: {
    // X + undef -> undef
    if (isa<UndefValue>(LHS) || isa<UndefValue>(RHS))
      return UndefValue::get(ReturnType);

    return nullptr;
  }
  case Intrinsic::umul_with_overflow:
  case Intrinsic::smul_with_overflow: {
    // 0 * X -> { 0, false }
    // X * 0 -> { 0, false }
    if (match(LHS, m_Zero()) || match(RHS, m_Zero()))
      return Constant::getNullValue(ReturnType);

    // undef * X -> { 0, false }
    // X * undef -> { 0, false }
    if (match(LHS, m_Undef()) || match(RHS, m_Undef()))
      return Constant::getNullValue(ReturnType);

    return nullptr;
  }
  case Intrinsic::load_relative: {
    Constant *C0 = dyn_cast<Constant>(LHS);
    Constant *C1 = dyn_cast<Constant>(RHS);
    if (C0 && C1)
      return SimplifyRelativeLoad(C0, C1, Q.DL);
    return nullptr;
  }
  case Intrinsic::powi:
    if (ConstantInt *Power = dyn_cast<ConstantInt>(RHS)) {
      // powi(x, 0) -> 1.0
      if (Power->isZero())
        return ConstantFP::get(LHS->getType(), 1.0);
      // powi(x, 1) -> x
      if (Power->isOne())
        return LHS;
    }
    return nullptr;
  case Intrinsic::maxnum:
  case Intrinsic::minnum:
    // If one argument is NaN, return the other argument.
    if (match(LHS, m_NaN()))
      return RHS;
    if (match(RHS, m_NaN()))
      return LHS;
    return nullptr;
  default:
    return nullptr;
  }
}

// Simplify calls to llvm.masked.load.*
switch (IID) {
case Intrinsic::masked_load: {
  Value *MaskArg = ArgBegin[2];
  Value *PassthruArg = ArgBegin[3];
  // If the mask is all zeros or undef, the "passthru" argument is the result.
  if (maskIsAllZeroOrUndef(MaskArg))
    return PassthruArg;
  return nullptr;
}
default:
  return nullptr;
}
4799}

4801template <typename IterTy>
4802static Value *SimplifyCall(ImmutableCallSite CS, Value *V, IterTy ArgBegin,
                         IterTy ArgEnd, const SimplifyQuery &Q,
                         unsigned MaxRecurse) {
Type *Ty = V->getType();
if (PointerType *PTy = dyn_cast<PointerType>(Ty))
  Ty = PTy->getElementType();
FunctionType *FTy = cast<FunctionType>(Ty);

// call undef -> undef
// call null -> undef
if (isa<UndefValue>(V) || isa<ConstantPointerNull>(V))
  return UndefValue::get(FTy->getReturnType());

Function *F = dyn_cast<Function>(V);
if (!F)
  return nullptr;

if (F->isIntrinsic())
  if (Value *Ret = SimplifyIntrinsic(F, ArgBegin, ArgEnd, Q, MaxRecurse))
    return Ret;

if (!canConstantFoldCallTo(CS, F))
  return nullptr;

SmallVector<Constant *, 4> ConstantArgs;
ConstantArgs.reserve(ArgEnd - ArgBegin);
for (IterTy I = ArgBegin, E = ArgEnd; I != E; ++I) {
  Constant *C = dyn_cast<Constant>(*I);
  if (!C)
    return nullptr;
  ConstantArgs.push_back(C);
}

return ConstantFoldCall(CS, F, ConstantArgs, Q.TLI);
4836}

4838Value *llvm::SimplifyCall(ImmutableCallSite CS, Value *V,
                        User::op_iterator ArgBegin, User::op_iterator ArgEnd,
                        const SimplifyQuery &Q) {
return ::SimplifyCall(CS, V, ArgBegin, ArgEnd, Q, RecursionLimit);
4842}

4844Value *llvm::SimplifyCall(ImmutableCallSite CS, Value *V,
                        ArrayRef<Value *> Args, const SimplifyQuery &Q) {
return ::SimplifyCall(CS, V, Args.begin(), Args.end(), Q, RecursionLimit);
4847}

4849Value *llvm::SimplifyCall(ImmutableCallSite ICS, const SimplifyQuery &Q) {
CallSite CS(const_cast<Instruction*>(ICS.getInstruction()));
return ::SimplifyCall(CS, CS.getCalledValue(), CS.arg_begin(), CS.arg_end(),
                      Q, RecursionLimit);
4853}

4855/// See if we can compute a simplified version of this instruction.
4856/// If not, this returns null.

4858Value *llvm::SimplifyInstruction(Instruction *I, const SimplifyQuery &SQ,
                               OptimizationRemarkEmitter *ORE) {
const SimplifyQuery Q = SQ.CxtI ? SQ : SQ.getWithInstruction(I);
Value *Result;

switch (I->getOpcode()) {
default:
  Result = ConstantFoldInstruction(I, Q.DL, Q.TLI);
  break;
case Instruction::FAdd:
  Result = SimplifyFAddInst(I->getOperand(0), I->getOperand(1),
                            I->getFastMathFlags(), Q);
  break;
case Instruction::Add:
  Result = SimplifyAddInst(I->getOperand(0), I->getOperand(1),
                           cast<BinaryOperator>(I)->hasNoSignedWrap(),
                           cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
  break;
case Instruction::FSub:
  Result = SimplifyFSubInst(I->getOperand(0), I->getOperand(1),
                            I->getFastMathFlags(), Q);
  break;
case Instruction::Sub:
  Result = SimplifySubInst(I->getOperand(0), I->getOperand(1),
                           cast<BinaryOperator>(I)->hasNoSignedWrap(),
                           cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
  break;
case Instruction::FMul:
  Result = SimplifyFMulInst(I->getOperand(0), I->getOperand(1),
                            I->getFastMathFlags(), Q);
  break;
case Instruction::Mul:
  Result = SimplifyMulInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::SDiv:
  Result = SimplifySDivInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::UDiv:
  Result = SimplifyUDivInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::FDiv:
  Result = SimplifyFDivInst(I->getOperand(0), I->getOperand(1),
                            I->getFastMathFlags(), Q);
  break;
case Instruction::SRem:
  Result = SimplifySRemInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::URem:
  Result = SimplifyURemInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::FRem:
  Result = SimplifyFRemInst(I->getOperand(0), I->getOperand(1),
                            I->getFastMathFlags(), Q);
  break;
case Instruction::Shl:
  Result = SimplifyShlInst(I->getOperand(0), I->getOperand(1),
                           cast<BinaryOperator>(I)->hasNoSignedWrap(),
                           cast<BinaryOperator>(I)->hasNoUnsignedWrap(), Q);
  break;
case Instruction::LShr:
  Result = SimplifyLShrInst(I->getOperand(0), I->getOperand(1),
                            cast<BinaryOperator>(I)->isExact(), Q);
  break;
case Instruction::AShr:
  Result = SimplifyAShrInst(I->getOperand(0), I->getOperand(1),
                            cast<BinaryOperator>(I)->isExact(), Q);
  break;
case Instruction::And:
  Result = SimplifyAndInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::Or:
  Result = SimplifyOrInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::Xor:
  Result = SimplifyXorInst(I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::ICmp:
  Result = SimplifyICmpInst(cast<ICmpInst>(I)->getPredicate(),
                            I->getOperand(0), I->getOperand(1), Q);
  break;
case Instruction::FCmp:
  Result =
      SimplifyFCmpInst(cast<FCmpInst>(I)->getPredicate(), I->getOperand(0),
                       I->getOperand(1), I->getFastMathFlags(), Q);
  break;
case Instruction::Select:
  Result = SimplifySelectInst(I->getOperand(0), I->getOperand(1),
                              I->getOperand(2), Q);
  break;
case Instruction::GetElementPtr: {
  SmallVector<Value *, 8> Ops(I->op_begin(), I->op_end());
  Result = SimplifyGEPInst(cast<GetElementPtrInst>(I)->getSourceElementType(),
                           Ops, Q);
  break;
}
case Instruction::InsertValue: {
  InsertValueInst *IV = cast<InsertValueInst>(I);
  Result = SimplifyInsertValueInst(IV->getAggregateOperand(),
                                   IV->getInsertedValueOperand(),
                                   IV->getIndices(), Q);
  break;
}
case Instruction::InsertElement: {
  auto *IE = cast<InsertElementInst>(I);
  Result = SimplifyInsertElementInst(IE->getOperand(0), IE->getOperand(1),
                                     IE->getOperand(2), Q);
  break;
}
case Instruction::ExtractValue: {
  auto *EVI = cast<ExtractValueInst>(I);
  Result = SimplifyExtractValueInst(EVI->getAggregateOperand(),
                                    EVI->getIndices(), Q);
  break;
}
case Instruction::ExtractElement: {
  auto *EEI = cast<ExtractElementInst>(I);
  Result = SimplifyExtractElementInst(EEI->getVectorOperand(),
                                      EEI->getIndexOperand(), Q);
  break;
}
case Instruction::ShuffleVector: {
  auto *SVI = cast<ShuffleVectorInst>(I);
  Result = SimplifyShuffleVectorInst(SVI->getOperand(0), SVI->getOperand(1),
                                     SVI->getMask(), SVI->getType(), Q);
  break;
}
case Instruction::PHI:
  Result = SimplifyPHINode(cast<PHINode>(I), Q);
  break;
case Instruction::Call: {
  CallSite CS(cast<CallInst>(I));
  Result = SimplifyCall(CS, Q);
  break;
}
4992#define HANDLE_CAST_INST(num, opc, clas) case Instruction::opc:
4993#include "llvm/IR/Instruction.def"
4994#undef HANDLE_CAST_INST
  Result =
      SimplifyCastInst(I->getOpcode(), I->getOperand(0), I->getType(), Q);
  break;
case Instruction::Alloca:
  // No simplifications for Alloca and it can't be constant folded.
  Result = nullptr;
  break;
}

// In general, it is possible for computeKnownBits to determine all bits in a
// value even when the operands are not all constants.
if (!Result && I->getType()->isIntOrIntVectorTy()) {
  KnownBits Known = computeKnownBits(I, Q.DL, /*Depth*/ 0, Q.AC, I, Q.DT, ORE);
  if (Known.isConstant())
    Result = ConstantInt::get(I->getType(), Known.getConstant());
}

/// If called on unreachable code, the above logic may report that the
/// instruction simplified to itself.  Make life easier for users by
/// detecting that case here, returning a safe value instead.
return Result == I ? UndefValue::get(I->getType()) : Result;
5016}

5018/// Implementation of recursive simplification through an instruction's
5019/// uses.
5020///
5021/// This is the common implementation of the recursive simplification routines.
5022/// If we have a pre-simplified value in 'SimpleV', that is forcibly used to
5023/// replace the instruction 'I'. Otherwise, we simply add 'I' to the list of
5024/// instructions to process and attempt to simplify it using
5025/// InstructionSimplify.
5026///
5027/// This routine returns 'true' only when *it* simplifies something. The passed
5028/// in simplified value does not count toward this.
5029static bool replaceAndRecursivelySimplifyImpl(Instruction *I, Value *SimpleV,
                                            const TargetLibraryInfo *TLI,
                                            const DominatorTree *DT,
                                            AssumptionCache *AC) {
bool Simplified = false;
SmallSetVector<Instruction *, 8> Worklist;
const DataLayout &DL = I->getModule()->getDataLayout();

// If we have an explicit value to collapse to, do that round of the
// simplification loop by hand initially.
if (SimpleV) {
  for (User *U : I->users())
    if (U != I)
      Worklist.insert(cast<Instruction>(U));

  // Replace the instruction with its simplified value.
  I->replaceAllUsesWith(SimpleV);

  // Gracefully handle edge cases where the instruction is not wired into any
  // parent block.
  if (I->getParent() && !I->isEHPad() && !isa<TerminatorInst>(I) &&
      !I->mayHaveSideEffects())
    I->eraseFromParent();
} else {
  Worklist.insert(I);
}

// Note that we must test the size on each iteration, the worklist can grow.
for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
  I = Worklist[Idx];

  // See if this instruction simplifies.
  SimpleV = SimplifyInstruction(I, {DL, TLI, DT, AC});
  if (!SimpleV)
    continue;

  Simplified = true;

  // Stash away all the uses of the old instruction so we can check them for
  // recursive simplifications after a RAUW. This is cheaper than checking all
  // uses of To on the recursive step in most cases.
  for (User *U : I->users())
    Worklist.insert(cast<Instruction>(U));

  // Replace the instruction with its simplified value.
  I->replaceAllUsesWith(SimpleV);

  // Gracefully handle edge cases where the instruction is not wired into any
  // parent block.
  if (I->getParent() && !I->isEHPad() && !isa<TerminatorInst>(I) &&
      !I->mayHaveSideEffects())
    I->eraseFromParent();
}
return Simplified;
5083}

5085bool llvm::recursivelySimplifyInstruction(Instruction *I,
                                        const TargetLibraryInfo *TLI,
                                        const DominatorTree *DT,
                                        AssumptionCache *AC) {
return replaceAndRecursivelySimplifyImpl(I, nullptr, TLI, DT, AC);
5090}

5092bool llvm::replaceAndRecursivelySimplify(Instruction *I, Value *SimpleV,
                                       const TargetLibraryInfo *TLI,
                                       const DominatorTree *DT,
                                       AssumptionCache *AC) {
assert(I != SimpleV && "replaceAndRecursivelySimplify(X,X) is not valid!")(static_cast <bool> (I != SimpleV && "replaceAndRecursivelySimplify(X,X) is not valid!"
) ? void (0) : __assert_fail ("I != SimpleV && \"replaceAndRecursivelySimplify(X,X) is not valid!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 5096, __extension__ __PRETTY_FUNCTION__));
assert(SimpleV && "Must provide a simplified value.")(static_cast <bool> (SimpleV && "Must provide a simplified value."
) ? void (0) : __assert_fail ("SimpleV && \"Must provide a simplified value.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/lib/Analysis/InstructionSimplify.cpp"
, 5097, __extension__ __PRETTY_FUNCTION__));
return replaceAndRecursivelySimplifyImpl(I, SimpleV, TLI, DT, AC);
5099}

5101namespace llvm {
5102const SimplifyQuery getBestSimplifyQuery(Pass &P, Function &F) {
auto *DTWP = P.getAnalysisIfAvailable<DominatorTreeWrapperPass>();
auto *DT = DTWP ? &DTWP->getDomTree() : nullptr;
auto *TLIWP = P.getAnalysisIfAvailable<TargetLibraryInfoWrapperPass>();
auto *TLI = TLIWP ? &TLIWP->getTLI() : nullptr;
auto *ACWP = P.getAnalysisIfAvailable<AssumptionCacheTracker>();
auto *AC = ACWP ? &ACWP->getAssumptionCache(F) : nullptr;
return {F.getParent()->getDataLayout(), TLI, DT, AC};
5110}

5112const SimplifyQuery getBestSimplifyQuery(LoopStandardAnalysisResults &AR,
                                       const DataLayout &DL) {
return {DL, &AR.TLI, &AR.DT, &AR.AC};
5115}

5117template <class T, class... TArgs>
5118const SimplifyQuery getBestSimplifyQuery(AnalysisManager<T, TArgs...> &AM,
                                       Function &F) {
auto *DT = AM.template getCachedResult<DominatorTreeAnalysis>(F);
auto *TLI = AM.template getCachedResult<TargetLibraryAnalysis>(F);
auto *AC = AM.template getCachedResult<AssumptionAnalysis>(F);
return {F.getParent()->getDataLayout(), TLI, DT, AC};
5124}
5125template const SimplifyQuery getBestSimplifyQuery(AnalysisManager<Function> &,
                                                Function &);
5127}

←

/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h

1//===- llvm/Instructions.h - Instruction subclass definitions ---*- C++ -*-===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file exposes the class definitions of all of the subclasses of the
11// Instruction class.  This is meant to be an easy way to get access to all
12// instruction subclasses.
13//
14//===----------------------------------------------------------------------===//

16#ifndef LLVM_IR_INSTRUCTIONS_H
17#define LLVM_IR_INSTRUCTIONS_H

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

48namespace llvm {

50class APInt;
51class ConstantInt;
52class DataLayout;
53class LLVMContext;

55//===----------------------------------------------------------------------===//
56//                                AllocaInst Class
57//===----------------------------------------------------------------------===//

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

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

AllocaInst *cloneImpl() const;

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

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

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

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

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

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

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

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

/// Return the alignment of the memory that is being allocated by the
/// instruction.
unsigned getAlignment() const {
  return (1u << (getSubclassDataFromInstruction() & 31)) >> 1;
}
void setAlignment(unsigned Align);

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

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

/// Specify whether this alloca is used to represent the arguments to a call.
void setUsedWithInAlloca(bool V) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~32) |
                             (V ? 32 : 0));
}

/// Return true if this alloca is used as a swifterror argument to a call.
bool isSwiftError() const {
  return getSubclassDataFromInstruction() & 64;
}

/// Specify whether this alloca is used to represent a swifterror.
void setSwiftError(bool V) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~64) |
                             (V ? 64 : 0));
}

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

154private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}
160};

162//===----------------------------------------------------------------------===//
163//                                LoadInst Class
164//===----------------------------------------------------------------------===//

166/// An instruction for reading from memory. This uses the SubclassData field in
167/// Value to store whether or not the load is volatile.
168class LoadInst : public UnaryInstruction {
void AssertOK();

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

LoadInst *cloneImpl() const;

177public:
LoadInst(Value *Ptr, const Twine &NameStr, Instruction *InsertBefore);
LoadInst(Value *Ptr, const Twine &NameStr, BasicBlock *InsertAtEnd);
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile = false,
         Instruction *InsertBefore = nullptr);
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile = false,
         Instruction *InsertBefore = nullptr)
    : LoadInst(cast<PointerType>(Ptr->getType())->getElementType(), Ptr,
               NameStr, isVolatile, InsertBefore) {}
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile,
         BasicBlock *InsertAtEnd);
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile, unsigned Align,
         Instruction *InsertBefore = nullptr)
    : LoadInst(cast<PointerType>(Ptr->getType())->getElementType(), Ptr,
               NameStr, isVolatile, Align, InsertBefore) {}
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         unsigned Align, Instruction *InsertBefore = nullptr);
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile,
         unsigned Align, BasicBlock *InsertAtEnd);
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile, unsigned Align,
         AtomicOrdering Order, SyncScope::ID SSID = SyncScope::System,
         Instruction *InsertBefore = nullptr)
    : LoadInst(cast<PointerType>(Ptr->getType())->getElementType(), Ptr,
               NameStr, isVolatile, Align, Order, SSID, InsertBefore) {}
LoadInst(Type *Ty, Value *Ptr, const Twine &NameStr, bool isVolatile,
         unsigned Align, AtomicOrdering Order,
         SyncScope::ID SSID = SyncScope::System,
         Instruction *InsertBefore = nullptr);
LoadInst(Value *Ptr, const Twine &NameStr, bool isVolatile,
         unsigned Align, AtomicOrdering Order, SyncScope::ID SSID,
         BasicBlock *InsertAtEnd);
LoadInst(Value *Ptr, const char *NameStr, Instruction *InsertBefore);
LoadInst(Value *Ptr, const char *NameStr, BasicBlock *InsertAtEnd);
LoadInst(Type *Ty, Value *Ptr, const char *NameStr = nullptr,
         bool isVolatile = false, Instruction *InsertBefore = nullptr);
explicit LoadInst(Value *Ptr, const char *NameStr = nullptr,
                  bool isVolatile = false,
                  Instruction *InsertBefore = nullptr)
    : LoadInst(cast<PointerType>(Ptr->getType())->getElementType(), Ptr,
               NameStr, isVolatile, InsertBefore) {}
LoadInst(Value *Ptr, const char *NameStr, bool isVolatile,
         BasicBlock *InsertAtEnd);

/// Return true if this is a load from a volatile memory location.
bool isVolatile() const { return getSubclassDataFromInstruction() & 1; }

/// Specify whether this is a volatile load or not.
void setVolatile(bool V) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~1) |
                             (V ? 1 : 0));
}

/// Return the alignment of the access that is being performed.
unsigned getAlignment() const {
  return (1 << ((getSubclassDataFromInstruction() >> 1) & 31)) >> 1;
}

void setAlignment(unsigned Align);

/// Returns the ordering constraint of this load instruction.
AtomicOrdering getOrdering() const {
  return AtomicOrdering((getSubclassDataFromInstruction() >> 7) & 7);
}

/// Sets the ordering constraint of this load instruction.  May not be Release
/// or AcquireRelease.
void setOrdering(AtomicOrdering Ordering) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~(7 << 7)) |
                             ((unsigned)Ordering << 7));
}

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

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

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

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

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

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

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

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

292private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}

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

305//===----------------------------------------------------------------------===//
306//                                StoreInst Class
307//===----------------------------------------------------------------------===//

309/// An instruction for storing to memory.
310class StoreInst : public Instruction {
void AssertOK();

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

StoreInst *cloneImpl() const;

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

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

/// Return true if this is a store to a volatile memory location.
bool isVolatile() const { return getSubclassDataFromInstruction() & 1; }

/// Specify whether this is a volatile store or not.
void setVolatile(bool V) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~1) |
                             (V ? 1 : 0));
}

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

/// Return the alignment of the access that is being performed
unsigned getAlignment() const {
  return (1 << ((getSubclassDataFromInstruction() >> 1) & 31)) >> 1;
}

void setAlignment(unsigned Align);

/// Returns the ordering constraint of this store instruction.
AtomicOrdering getOrdering() const {
  return AtomicOrdering((getSubclassDataFromInstruction() >> 7) & 7);
}

/// Sets the ordering constraint of this store instruction.  May not be
/// Acquire or AcquireRelease.
void setOrdering(AtomicOrdering Ordering) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~(7 << 7)) |
                             ((unsigned)Ordering << 7));
}

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

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

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

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

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

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

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

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

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

420private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}

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

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

437DEFINE_TRANSPARENT_OPERAND_ACCESSORS(StoreInst, Value)StoreInst::op_iterator StoreInst::op_begin() { return OperandTraits
<StoreInst>::op_begin(this); } StoreInst::const_op_iterator
 StoreInst::op_begin() const { return OperandTraits<StoreInst
>::op_begin(const_cast<StoreInst*>(this)); } StoreInst
::op_iterator StoreInst::op_end() { return OperandTraits<StoreInst
>::op_end(this); } StoreInst::const_op_iterator StoreInst::
op_end() const { return OperandTraits<StoreInst>::op_end
(const_cast<StoreInst*>(this)); } Value *StoreInst::getOperand
(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture
 < OperandTraits<StoreInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 437, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<StoreInst>::op_begin(const_cast
<StoreInst*>(this))[i_nocapture].get()); } void StoreInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<StoreInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<StoreInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 437, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
StoreInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned StoreInst::getNumOperands() const { return OperandTraits
<StoreInst>::operands(this); } template <int Idx_nocapture
> Use &StoreInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
StoreInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

439//===----------------------------------------------------------------------===//
440//                                FenceInst Class
441//===----------------------------------------------------------------------===//

443/// An instruction for ordering other memory operations.
444class FenceInst : public Instruction {
void Init(AtomicOrdering Ordering, SyncScope::ID SSID);

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

FenceInst *cloneImpl() const;

453public:
// Ordering may only be Acquire, Release, AcquireRelease, or
// SequentiallyConsistent.
FenceInst(LLVMContext &C, AtomicOrdering Ordering,
          SyncScope::ID SSID = SyncScope::System,
          Instruction *InsertBefore = nullptr);
FenceInst(LLVMContext &C, AtomicOrdering Ordering, SyncScope::ID SSID,
          BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t s) {
  return User::operator new(s, 0);
}

/// Returns the ordering constraint of this fence instruction.
AtomicOrdering getOrdering() const {
  return AtomicOrdering(getSubclassDataFromInstruction() >> 1);
}

/// Sets the ordering constraint of this fence instruction.  May only be
/// Acquire, Release, AcquireRelease, or SequentiallyConsistent.
void setOrdering(AtomicOrdering Ordering) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & 1) |
                             ((unsigned)Ordering << 1));
}

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

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

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

497private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}

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

510//===----------------------------------------------------------------------===//
511//                                AtomicCmpXchgInst Class
512//===----------------------------------------------------------------------===//

514/// an instruction that atomically checks whether a
515/// specified value is in a memory location, and, if it is, stores a new value
516/// there.  Returns the value that was loaded.
517///
518class AtomicCmpXchgInst : public Instruction {
void Init(Value *Ptr, Value *Cmp, Value *NewVal,
          AtomicOrdering SuccessOrdering, AtomicOrdering FailureOrdering,
          SyncScope::ID SSID);

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

AtomicCmpXchgInst *cloneImpl() const;

529public:
AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
                  AtomicOrdering SuccessOrdering,
                  AtomicOrdering FailureOrdering,
                  SyncScope::ID SSID, Instruction *InsertBefore = nullptr);
AtomicCmpXchgInst(Value *Ptr, Value *Cmp, Value *NewVal,
                  AtomicOrdering SuccessOrdering,
                  AtomicOrdering FailureOrdering,
                  SyncScope::ID SSID, BasicBlock *InsertAtEnd);

// allocate space for exactly three operands
void *operator new(size_t s) {
  return User::operator new(s, 3);
}

/// Return true if this is a cmpxchg from a volatile memory
/// location.
///
bool isVolatile() const {
  return getSubclassDataFromInstruction() & 1;
}

/// Specify whether this is a volatile cmpxchg.
///
void setVolatile(bool V) {
   setInstructionSubclassData((getSubclassDataFromInstruction() & ~1) |
                              (unsigned)V);
}

/// Return true if this cmpxchg may spuriously fail.
bool isWeak() const {
  return getSubclassDataFromInstruction() & 0x100;
}

void setWeak(bool IsWeak) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~0x100) |
                             (IsWeak << 8));
}

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

/// Returns the success ordering constraint of this cmpxchg instruction.
AtomicOrdering getSuccessOrdering() const {
  return AtomicOrdering((getSubclassDataFromInstruction() >> 2) & 7);
}

/// Sets the success ordering constraint of this cmpxchg instruction.
void setSuccessOrdering(AtomicOrdering Ordering) {
  assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "CmpXchg instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"CmpXchg instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 579, __extension__ __PRETTY_FUNCTION__))
         "CmpXchg instructions can only be atomic.")(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "CmpXchg instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"CmpXchg instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 579, __extension__ __PRETTY_FUNCTION__));
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~0x1c) |
                             ((unsigned)Ordering << 2));
}

/// Returns the failure ordering constraint of this cmpxchg instruction.
AtomicOrdering getFailureOrdering() const {
  return AtomicOrdering((getSubclassDataFromInstruction() >> 5) & 7);
}

/// Sets the failure ordering constraint of this cmpxchg instruction.
void setFailureOrdering(AtomicOrdering Ordering) {
  assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "CmpXchg instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"CmpXchg instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 592, __extension__ __PRETTY_FUNCTION__))
         "CmpXchg instructions can only be atomic.")(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "CmpXchg instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"CmpXchg instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 592, __extension__ __PRETTY_FUNCTION__));
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~0xe0) |
                             ((unsigned)Ordering << 5));
}

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

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

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

Value *getCompareOperand() { return getOperand(1); }
const Value *getCompareOperand() const { return getOperand(1); }

Value *getNewValOperand() { return getOperand(2); }
const Value *getNewValOperand() const { return getOperand(2); }

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

/// Returns the strongest permitted ordering on failure, given the
/// desired ordering on success.
///
/// If the comparison in a cmpxchg operation fails, there is no atomic store
/// so release semantics cannot be provided. So this function drops explicit
/// Release requests from the AtomicOrdering. A SequentiallyConsistent
/// operation would remain SequentiallyConsistent.
static AtomicOrdering
getStrongestFailureOrdering(AtomicOrdering SuccessOrdering) {
  switch (SuccessOrdering) {
  default:
    llvm_unreachable("invalid cmpxchg success ordering")::llvm::llvm_unreachable_internal("invalid cmpxchg success ordering"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 633);
  case AtomicOrdering::Release:
  case AtomicOrdering::Monotonic:
    return AtomicOrdering::Monotonic;
  case AtomicOrdering::AcquireRelease:
  case AtomicOrdering::Acquire:
    return AtomicOrdering::Acquire;
  case AtomicOrdering::SequentiallyConsistent:
    return AtomicOrdering::SequentiallyConsistent;
  }
}

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

653private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}

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

666template <>
667struct OperandTraits<AtomicCmpXchgInst> :
  public FixedNumOperandTraits<AtomicCmpXchgInst, 3> {
669};

671DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicCmpXchgInst, Value)AtomicCmpXchgInst::op_iterator AtomicCmpXchgInst::op_begin() {
 return OperandTraits<AtomicCmpXchgInst>::op_begin(this
); } AtomicCmpXchgInst::const_op_iterator AtomicCmpXchgInst::
op_begin() const { return OperandTraits<AtomicCmpXchgInst>
::op_begin(const_cast<AtomicCmpXchgInst*>(this)); } AtomicCmpXchgInst
::op_iterator AtomicCmpXchgInst::op_end() { return OperandTraits
<AtomicCmpXchgInst>::op_end(this); } AtomicCmpXchgInst::
const_op_iterator AtomicCmpXchgInst::op_end() const { return OperandTraits
<AtomicCmpXchgInst>::op_end(const_cast<AtomicCmpXchgInst
*>(this)); } Value *AtomicCmpXchgInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<AtomicCmpXchgInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 671, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<AtomicCmpXchgInst>::op_begin
(const_cast<AtomicCmpXchgInst*>(this))[i_nocapture].get
()); } void AtomicCmpXchgInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<AtomicCmpXchgInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicCmpXchgInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 671, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
AtomicCmpXchgInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned AtomicCmpXchgInst::getNumOperands() const { return
 OperandTraits<AtomicCmpXchgInst>::operands(this); } template
 <int Idx_nocapture> Use &AtomicCmpXchgInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &AtomicCmpXchgInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

673//===----------------------------------------------------------------------===//
674//                                AtomicRMWInst Class
675//===----------------------------------------------------------------------===//

677/// an instruction that atomically reads a memory location,
678/// combines it with another value, and then stores the result back.  Returns
679/// the old value.
680///
681class AtomicRMWInst : public Instruction {
682protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

AtomicRMWInst *cloneImpl() const;

688public:
/// This enumeration lists the possible modifications atomicrmw can make.  In
/// the descriptions, 'p' is the pointer to the instruction's memory location,
/// 'old' is the initial value of *p, and 'v' is the other value passed to the
/// instruction.  These instructions always return 'old'.
enum BinOp {
  /// *p = v
  Xchg,
  /// *p = old + v
  Add,
  /// *p = old - v
  Sub,
  /// *p = old & v
  And,
  /// *p = ~(old & v)
  Nand,
  /// *p = old | v
  Or,
  /// *p = old ^ v
  Xor,
  /// *p = old >signed v ? old : v
  Max,
  /// *p = old <signed v ? old : v
  Min,
  /// *p = old >unsigned v ? old : v
  UMax,
  /// *p = old <unsigned v ? old : v
  UMin,

  FIRST_BINOP = Xchg,
  LAST_BINOP = UMin,
  BAD_BINOP
};

AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
              AtomicOrdering Ordering, SyncScope::ID SSID,
              Instruction *InsertBefore = nullptr);
AtomicRMWInst(BinOp Operation, Value *Ptr, Value *Val,
              AtomicOrdering Ordering, SyncScope::ID SSID,
              BasicBlock *InsertAtEnd);

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

BinOp getOperation() const {
  return static_cast<BinOp>(getSubclassDataFromInstruction() >> 5);
}

void setOperation(BinOp Operation) {
  unsigned short SubclassData = getSubclassDataFromInstruction();
  setInstructionSubclassData((SubclassData & 31) |
                             (Operation << 5));
}

/// Return true if this is a RMW on a volatile memory location.
///
bool isVolatile() const {
  return getSubclassDataFromInstruction() & 1;
}

/// Specify whether this is a volatile RMW or not.
///
void setVolatile(bool V) {
   setInstructionSubclassData((getSubclassDataFromInstruction() & ~1) |
                              (unsigned)V);
}

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

/// Returns the ordering constraint of this rmw instruction.
AtomicOrdering getOrdering() const {
  return AtomicOrdering((getSubclassDataFromInstruction() >> 2) & 7);
}

/// Sets the ordering constraint of this rmw instruction.
void setOrdering(AtomicOrdering Ordering) {
  assert(Ordering != AtomicOrdering::NotAtomic &&(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "atomicrmw instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 768, __extension__ __PRETTY_FUNCTION__))
         "atomicrmw instructions can only be atomic.")(static_cast <bool> (Ordering != AtomicOrdering::NotAtomic
 && "atomicrmw instructions can only be atomic.") ? void
 (0) : __assert_fail ("Ordering != AtomicOrdering::NotAtomic && \"atomicrmw instructions can only be atomic.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 768, __extension__ __PRETTY_FUNCTION__));
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~(7 << 2)) |
                             ((unsigned)Ordering << 2));
}

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

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

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

Value *getValOperand() { return getOperand(1); }
const Value *getValOperand() const { return getOperand(1); }

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

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

803private:
void Init(BinOp Operation, Value *Ptr, Value *Val,
          AtomicOrdering Ordering, SyncScope::ID SSID);

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

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

819template <>
820struct OperandTraits<AtomicRMWInst>
  : public FixedNumOperandTraits<AtomicRMWInst,2> {
822};

824DEFINE_TRANSPARENT_OPERAND_ACCESSORS(AtomicRMWInst, Value)AtomicRMWInst::op_iterator AtomicRMWInst::op_begin() { return
 OperandTraits<AtomicRMWInst>::op_begin(this); } AtomicRMWInst
::const_op_iterator AtomicRMWInst::op_begin() const { return OperandTraits
<AtomicRMWInst>::op_begin(const_cast<AtomicRMWInst*>
(this)); } AtomicRMWInst::op_iterator AtomicRMWInst::op_end()
 { return OperandTraits<AtomicRMWInst>::op_end(this); }
 AtomicRMWInst::const_op_iterator AtomicRMWInst::op_end() const
 { return OperandTraits<AtomicRMWInst>::op_end(const_cast
<AtomicRMWInst*>(this)); } Value *AtomicRMWInst::getOperand
(unsigned i_nocapture) const { (static_cast <bool> (i_nocapture
 < OperandTraits<AtomicRMWInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 824, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<AtomicRMWInst>::op_begin(const_cast
<AtomicRMWInst*>(this))[i_nocapture].get()); } void AtomicRMWInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<AtomicRMWInst
>::operands(this) && "setOperand() out of range!")
 ? void (0) : __assert_fail ("i_nocapture < OperandTraits<AtomicRMWInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 824, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
AtomicRMWInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned AtomicRMWInst::getNumOperands() const { return OperandTraits
<AtomicRMWInst>::operands(this); } template <int Idx_nocapture
> Use &AtomicRMWInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &AtomicRMWInst::Op() const { return this->OpFrom
<Idx_nocapture>(this); }

826//===----------------------------------------------------------------------===//
827//                             GetElementPtrInst Class
828//===----------------------------------------------------------------------===//

830// checkGEPType - Simple wrapper function to give a better assertion failure
831// message on bad indexes for a gep instruction.
832//
833inline Type *checkGEPType(Type *Ty) {
assert(Ty && "Invalid GetElementPtrInst indices for type!")(static_cast <bool> (Ty && "Invalid GetElementPtrInst indices for type!"
) ? void (0) : __assert_fail ("Ty && \"Invalid GetElementPtrInst indices for type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 834, __extension__ __PRETTY_FUNCTION__));
return Ty;
836}

838/// an instruction for type-safe pointer arithmetic to
839/// access elements of arrays and structs
840///
841class GetElementPtrInst : public Instruction {
Type *SourceElementType;
Type *ResultElementType;

GetElementPtrInst(const GetElementPtrInst &GEPI);

/// Constructors - Create a getelementptr instruction with a base pointer an
/// list of indices. The first ctor can optionally insert before an existing
/// instruction, the second appends the new instruction to the specified
/// BasicBlock.
inline GetElementPtrInst(Type *PointeeType, Value *Ptr,
                         ArrayRef<Value *> IdxList, unsigned Values,
                         const Twine &NameStr, Instruction *InsertBefore);
inline GetElementPtrInst(Type *PointeeType, Value *Ptr,
                         ArrayRef<Value *> IdxList, unsigned Values,
                         const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(Value *Ptr, ArrayRef<Value *> IdxList, const Twine &NameStr);

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

GetElementPtrInst *cloneImpl() const;

866public:
static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr,
                                 ArrayRef<Value *> IdxList,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + unsigned(IdxList.size());
  if (!PointeeType)
    PointeeType =
        cast<PointerType>(Ptr->getType()->getScalarType())->getElementType();
  else
    assert((static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 878, __extension__ __PRETTY_FUNCTION__))
        PointeeType ==(static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 878, __extension__ __PRETTY_FUNCTION__))
        cast<PointerType>(Ptr->getType()->getScalarType())->getElementType())(static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 878, __extension__ __PRETTY_FUNCTION__));
  return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values,
                                        NameStr, InsertBefore);
}

static GetElementPtrInst *Create(Type *PointeeType, Value *Ptr,
                                 ArrayRef<Value *> IdxList,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + unsigned(IdxList.size());
  if (!PointeeType)
    PointeeType =
        cast<PointerType>(Ptr->getType()->getScalarType())->getElementType();
  else
    assert((static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 894, __extension__ __PRETTY_FUNCTION__))
        PointeeType ==(static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 894, __extension__ __PRETTY_FUNCTION__))
        cast<PointerType>(Ptr->getType()->getScalarType())->getElementType())(static_cast <bool> (PointeeType == cast<PointerType
>(Ptr->getType()->getScalarType())->getElementType
()) ? void (0) : __assert_fail ("PointeeType == cast<PointerType>(Ptr->getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 894, __extension__ __PRETTY_FUNCTION__));
  return new (Values) GetElementPtrInst(PointeeType, Ptr, IdxList, Values,
                                        NameStr, InsertAtEnd);
}

/// Create an "inbounds" getelementptr. See the documentation for the
/// "inbounds" flag in LangRef.html for details.
static GetElementPtrInst *CreateInBounds(Value *Ptr,
                                         ArrayRef<Value *> IdxList,
                                         const Twine &NameStr = "",
                                         Instruction *InsertBefore = nullptr){
  return CreateInBounds(nullptr, Ptr, IdxList, NameStr, InsertBefore);
}

static GetElementPtrInst *
CreateInBounds(Type *PointeeType, Value *Ptr, ArrayRef<Value *> IdxList,
               const Twine &NameStr = "",
               Instruction *InsertBefore = nullptr) {
  GetElementPtrInst *GEP =
      Create(PointeeType, Ptr, IdxList, NameStr, InsertBefore);
  GEP->setIsInBounds(true);
  return GEP;
}

static GetElementPtrInst *CreateInBounds(Value *Ptr,
                                         ArrayRef<Value *> IdxList,
                                         const Twine &NameStr,
                                         BasicBlock *InsertAtEnd) {
  return CreateInBounds(nullptr, Ptr, IdxList, NameStr, InsertAtEnd);
}

static GetElementPtrInst *CreateInBounds(Type *PointeeType, Value *Ptr,
                                         ArrayRef<Value *> IdxList,
                                         const Twine &NameStr,
                                         BasicBlock *InsertAtEnd) {
  GetElementPtrInst *GEP =
      Create(PointeeType, Ptr, IdxList, NameStr, InsertAtEnd);
  GEP->setIsInBounds(true);
  return GEP;
}

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

Type *getSourceElementType() const { return SourceElementType; }

void setSourceElementType(Type *Ty) { SourceElementType = Ty; }
void setResultElementType(Type *Ty) { ResultElementType = Ty; }

Type *getResultElementType() const {
  assert(ResultElementType ==(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 945, __extension__ __PRETTY_FUNCTION__))
         cast<PointerType>(getType()->getScalarType())->getElementType())(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 945, __extension__ __PRETTY_FUNCTION__));
  return ResultElementType;
}

/// Returns the address space of this instruction's pointer type.
unsigned getAddressSpace() const {
  // Note that this is always the same as the pointer operand's address space
  // and that is cheaper to compute, so cheat here.
  return getPointerAddressSpace();
}

/// Returns the type of the element that would be loaded with
/// a load instruction with the specified parameters.
///
/// Null is returned if the indices are invalid for the specified
/// pointer type.
///
static Type *getIndexedType(Type *Ty, ArrayRef<Value *> IdxList);
static Type *getIndexedType(Type *Ty, ArrayRef<Constant *> IdxList);
static Type *getIndexedType(Type *Ty, ArrayRef<uint64_t> IdxList);

inline op_iterator       idx_begin()       { return op_begin()+1; }
inline const_op_iterator idx_begin() const { return op_begin()+1; }
inline op_iterator       idx_end()         { return op_end(); }
inline const_op_iterator idx_end()   const { return op_end(); }

inline iterator_range<op_iterator> indices() {
  return make_range(idx_begin(), idx_end());
}

inline iterator_range<const_op_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getPointerOperand() {
  return getOperand(0);
}
const Value *getPointerOperand() const {
  return getOperand(0);
}
static unsigned getPointerOperandIndex() {
  return 0U;    // get index for modifying correct operand.
}

/// Method to return the pointer operand as a
/// PointerType.
Type *getPointerOperandType() const {
  return getPointerOperand()->getType();
}

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

/// Returns the pointer type returned by the GEP
/// instruction, which may be a vector of pointers.
static Type *getGEPReturnType(Value *Ptr, ArrayRef<Value *> IdxList) {
  return getGEPReturnType(
    cast<PointerType>(Ptr->getType()->getScalarType())->getElementType(),
    Ptr, IdxList);
}
static Type *getGEPReturnType(Type *ElTy, Value *Ptr,
                              ArrayRef<Value *> IdxList) {
  Type *PtrTy = PointerType::get(checkGEPType(getIndexedType(ElTy, IdxList)),
                                 Ptr->getType()->getPointerAddressSpace());
  // Vector GEP
  if (Ptr->getType()->isVectorTy()) {
    unsigned NumElem = Ptr->getType()->getVectorNumElements();
    return VectorType::get(PtrTy, NumElem);
  }
  for (Value *Index : IdxList)
    if (Index->getType()->isVectorTy()) {
      unsigned NumElem = Index->getType()->getVectorNumElements();
      return VectorType::get(PtrTy, NumElem);
    }
  // Scalar GEP
  return PtrTy;
}

unsigned getNumIndices() const {  // Note: always non-negative
  return getNumOperands() - 1;
}

bool hasIndices() const {
  return getNumOperands() > 1;
}

/// Return true if all of the indices of this GEP are
/// zeros.  If so, the result pointer and the first operand have the same
/// value, just potentially different types.
bool hasAllZeroIndices() const;

/// Return true if all of the indices of this GEP are
/// constant integers.  If so, the result pointer and the first operand have
/// a constant offset between them.
bool hasAllConstantIndices() const;

/// Set or clear the inbounds flag on this GEP instruction.
/// See LangRef.html for the meaning of inbounds on a getelementptr.
void setIsInBounds(bool b = true);

/// Determine whether the GEP has the inbounds flag.
bool isInBounds() const;

/// Accumulate the constant address offset of this GEP if possible.
///
/// This routine accepts an APInt into which it will accumulate the constant
/// offset of this GEP if the GEP is in fact constant. If the GEP is not
/// all-constant, it returns false and the value of the offset APInt is
/// undefined (it is *not* preserved!). The APInt passed into this routine
/// must be at least as wide as the IntPtr type for the address space of
/// the base GEP pointer.
bool accumulateConstantOffset(const DataLayout &DL, APInt &Offset) const;

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

1069template <>
1070struct OperandTraits<GetElementPtrInst> :
public VariadicOperandTraits<GetElementPtrInst, 1> {
1072};

1074GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr,
                                   ArrayRef<Value *> IdxList, unsigned Values,
                                   const Twine &NameStr,
                                   Instruction *InsertBefore)
  : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr,
                OperandTraits<GetElementPtrInst>::op_end(this) - Values,
                Values, InsertBefore),
    SourceElementType(PointeeType),
    ResultElementType(getIndexedType(PointeeType, IdxList)) {
assert(ResultElementType ==(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1084, __extension__ __PRETTY_FUNCTION__))
       cast<PointerType>(getType()->getScalarType())->getElementType())(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1084, __extension__ __PRETTY_FUNCTION__));
init(Ptr, IdxList, NameStr);
1086}

1088GetElementPtrInst::GetElementPtrInst(Type *PointeeType, Value *Ptr,
                                   ArrayRef<Value *> IdxList, unsigned Values,
                                   const Twine &NameStr,
                                   BasicBlock *InsertAtEnd)
  : Instruction(getGEPReturnType(PointeeType, Ptr, IdxList), GetElementPtr,
                OperandTraits<GetElementPtrInst>::op_end(this) - Values,
                Values, InsertAtEnd),
    SourceElementType(PointeeType),
    ResultElementType(getIndexedType(PointeeType, IdxList)) {
assert(ResultElementType ==(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1098, __extension__ __PRETTY_FUNCTION__))
       cast<PointerType>(getType()->getScalarType())->getElementType())(static_cast <bool> (ResultElementType == cast<PointerType
>(getType()->getScalarType())->getElementType()) ? void
 (0) : __assert_fail ("ResultElementType == cast<PointerType>(getType()->getScalarType())->getElementType()"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1098, __extension__ __PRETTY_FUNCTION__));
init(Ptr, IdxList, NameStr);
1100}

1102DEFINE_TRANSPARENT_OPERAND_ACCESSORS(GetElementPtrInst, Value)GetElementPtrInst::op_iterator GetElementPtrInst::op_begin() {
 return OperandTraits<GetElementPtrInst>::op_begin(this
); } GetElementPtrInst::const_op_iterator GetElementPtrInst::
op_begin() const { return OperandTraits<GetElementPtrInst>
::op_begin(const_cast<GetElementPtrInst*>(this)); } GetElementPtrInst
::op_iterator GetElementPtrInst::op_end() { return OperandTraits
<GetElementPtrInst>::op_end(this); } GetElementPtrInst::
const_op_iterator GetElementPtrInst::op_end() const { return OperandTraits
<GetElementPtrInst>::op_end(const_cast<GetElementPtrInst
*>(this)); } Value *GetElementPtrInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<GetElementPtrInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1102, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<GetElementPtrInst>::op_begin
(const_cast<GetElementPtrInst*>(this))[i_nocapture].get
()); } void GetElementPtrInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<GetElementPtrInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<GetElementPtrInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1102, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
GetElementPtrInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned GetElementPtrInst::getNumOperands() const { return
 OperandTraits<GetElementPtrInst>::operands(this); } template
 <int Idx_nocapture> Use &GetElementPtrInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &GetElementPtrInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

1104//===----------------------------------------------------------------------===//
1105//                               ICmpInst Class
1106//===----------------------------------------------------------------------===//

1108/// This instruction compares its operands according to the predicate given
1109/// to the constructor. It only operates on integers or pointers. The operands
1110/// must be identical types.
1111/// Represent an integer comparison operator.
1112class ICmpInst: public CmpInst {
void AssertOK() {
  assert(isIntPredicate() &&(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value"
) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1115, __extension__ __PRETTY_FUNCTION__))
         "Invalid ICmp predicate value")(static_cast <bool> (isIntPredicate() && "Invalid ICmp predicate value"
) ? void (0) : __assert_fail ("isIntPredicate() && \"Invalid ICmp predicate value\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1115, __extension__ __PRETTY_FUNCTION__));
  assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to ICmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1117, __extension__ __PRETTY_FUNCTION__))
        "Both operands to ICmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to ICmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to ICmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1117, __extension__ __PRETTY_FUNCTION__));
  // Check that the operands are the right type
  assert((getOperand(0)->getType()->isIntOrIntVectorTy() ||(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1121, __extension__ __PRETTY_FUNCTION__))
          getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1121, __extension__ __PRETTY_FUNCTION__))
         "Invalid operand types for ICmp instruction")(static_cast <bool> ((getOperand(0)->getType()->isIntOrIntVectorTy
() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) &&
 "Invalid operand types for ICmp instruction") ? void (0) : __assert_fail
 ("(getOperand(0)->getType()->isIntOrIntVectorTy() || getOperand(0)->getType()->isPtrOrPtrVectorTy()) && \"Invalid operand types for ICmp instruction\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1121, __extension__ __PRETTY_FUNCTION__));
}

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

/// Clone an identical ICmpInst
ICmpInst *cloneImpl() const;

1131public:
/// Constructor with insert-before-instruction semantics.
ICmpInst(
  Instruction *InsertBefore,  ///< Where to insert
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr,
            InsertBefore) {
1142#ifndef NDEBUG
AssertOK();
1144#endif
}

/// Constructor with insert-at-end semantics.
ICmpInst(
  BasicBlock &InsertAtEnd, ///< Block to insert into.
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr,
            &InsertAtEnd) {
1157#ifndef NDEBUG
AssertOK();
1159#endif
}

/// Constructor with no-insertion semantics
ICmpInst(
  Predicate pred, ///< The predicate to use for the comparison
  Value *LHS,     ///< The left-hand-side of the expression
  Value *RHS,     ///< The right-hand-side of the expression
  const Twine &NameStr = "" ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::ICmp, pred, LHS, RHS, NameStr) {
1170#ifndef NDEBUG
AssertOK();
1172#endif
}

/// For example, EQ->EQ, SLE->SLE, UGT->SGT, etc.
/// @returns the predicate that would be the result if the operand were
/// regarded as signed.
/// Return the signed version of the predicate
Predicate getSignedPredicate() const {
  return getSignedPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction.
/// Return the signed version of the predicate.
static Predicate getSignedPredicate(Predicate pred);

/// For example, EQ->EQ, SLE->ULE, UGT->UGT, etc.
/// @returns the predicate that would be the result if the operand were
/// regarded as unsigned.
/// Return the unsigned version of the predicate
Predicate getUnsignedPredicate() const {
  return getUnsignedPredicate(getPredicate());
}

/// This is a static version that you can use without an instruction.
/// Return the unsigned version of the predicate.
static Predicate getUnsignedPredicate(Predicate pred);

/// Return true if this predicate is either EQ or NE.  This also
/// tests for commutativity.
static bool isEquality(Predicate P) {
  return P == ICMP_EQ || P == ICMP_NE;
}

/// Return true if this predicate is either EQ or NE.  This also
/// tests for commutativity.
bool isEquality() const {
  return isEquality(getPredicate());
}

/// @returns true if the predicate of this ICmpInst is commutative
/// Determine if this relation is commutative.
bool isCommutative() const { return isEquality(); }

/// Return true if the predicate is relational (not EQ or NE).
///
bool isRelational() const {
  return !isEquality();
}

/// Return true if the predicate is relational (not EQ or NE).
///
static bool isRelational(Predicate P) {
  return !isEquality(P);
}

/// Exchange the two operands to this instruction in such a way that it does
/// not modify the semantics of the instruction. The predicate value may be
/// changed to retain the same result if the predicate is order dependent
/// (e.g. ult).
/// Swap operands and adjust predicate.
void swapOperands() {
  setPredicate(getSwappedPredicate());
  Op<0>().swap(Op<1>());
}

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

1246//===----------------------------------------------------------------------===//
1247//                               FCmpInst Class
1248//===----------------------------------------------------------------------===//

1250/// This instruction compares its operands according to the predicate given
1251/// to the constructor. It only operates on floating point values or packed
1252/// vectors of floating point values. The operands must be identical types.
1253/// Represents a floating point comparison operator.
1254class FCmpInst: public CmpInst {
void AssertOK() {
  assert(isFPPredicate() && "Invalid FCmp predicate value")(static_cast <bool> (isFPPredicate() && "Invalid FCmp predicate value"
) ? void (0) : __assert_fail ("isFPPredicate() && \"Invalid FCmp predicate value\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1256, __extension__ __PRETTY_FUNCTION__));
  assert(getOperand(0)->getType() == getOperand(1)->getType() &&(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to FCmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1258, __extension__ __PRETTY_FUNCTION__))
         "Both operands to FCmp instruction are not of the same type!")(static_cast <bool> (getOperand(0)->getType() == getOperand
(1)->getType() && "Both operands to FCmp instruction are not of the same type!"
) ? void (0) : __assert_fail ("getOperand(0)->getType() == getOperand(1)->getType() && \"Both operands to FCmp instruction are not of the same type!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1258, __extension__ __PRETTY_FUNCTION__));
  // Check that the operands are the right type
  assert(getOperand(0)->getType()->isFPOrFPVectorTy() &&(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy
() && "Invalid operand types for FCmp instruction") ?
 void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1261, __extension__ __PRETTY_FUNCTION__))
         "Invalid operand types for FCmp instruction")(static_cast <bool> (getOperand(0)->getType()->isFPOrFPVectorTy
() && "Invalid operand types for FCmp instruction") ?
 void (0) : __assert_fail ("getOperand(0)->getType()->isFPOrFPVectorTy() && \"Invalid operand types for FCmp instruction\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1261, __extension__ __PRETTY_FUNCTION__));
}

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

/// Clone an identical FCmpInst
FCmpInst *cloneImpl() const;

1271public:
/// Constructor with insert-before-instruction semantics.
FCmpInst(
  Instruction *InsertBefore, ///< Where to insert
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::FCmp, pred, LHS, RHS, NameStr,
            InsertBefore) {
  AssertOK();
}

/// Constructor with insert-at-end semantics.
FCmpInst(
  BasicBlock &InsertAtEnd, ///< Block to insert into.
  Predicate pred,  ///< The predicate to use for the comparison
  Value *LHS,      ///< The left-hand-side of the expression
  Value *RHS,      ///< The right-hand-side of the expression
  const Twine &NameStr = ""  ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::FCmp, pred, LHS, RHS, NameStr,
            &InsertAtEnd) {
  AssertOK();
}

/// Constructor with no-insertion semantics
FCmpInst(
  Predicate pred, ///< The predicate to use for the comparison
  Value *LHS,     ///< The left-hand-side of the expression
  Value *RHS,     ///< The right-hand-side of the expression
  const Twine &NameStr = "" ///< Name of the instruction
) : CmpInst(makeCmpResultType(LHS->getType()),
            Instruction::FCmp, pred, LHS, RHS, NameStr) {
  AssertOK();
}

/// @returns true if the predicate of this instruction is EQ or NE.
/// Determine if this is an equality predicate.
static bool isEquality(Predicate Pred) {
  return Pred == FCMP_OEQ || Pred == FCMP_ONE || Pred == FCMP_UEQ ||
         Pred == FCMP_UNE;
}

/// @returns true if the predicate of this instruction is EQ or NE.
/// Determine if this is an equality predicate.
bool isEquality() const { return isEquality(getPredicate()); }

/// @returns true if the predicate of this instruction is commutative.
/// Determine if this is a commutative predicate.
bool isCommutative() const {
  return isEquality() ||
         getPredicate() == FCMP_FALSE ||
         getPredicate() == FCMP_TRUE ||
         getPredicate() == FCMP_ORD ||
         getPredicate() == FCMP_UNO;
}

/// @returns true if the predicate is relational (not EQ or NE).
/// Determine if this a relational predicate.
bool isRelational() const { return !isEquality(); }

/// Exchange the two operands to this instruction in such a way that it does
/// not modify the semantics of the instruction. The predicate value may be
/// changed to retain the same result if the predicate is order dependent
/// (e.g. ult).
/// Swap operands and adjust predicate.
void swapOperands() {
  setPredicate(getSwappedPredicate());
  Op<0>().swap(Op<1>());
}

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

1353class CallInst;
1354class InvokeInst;

1356template <class T> struct CallBaseParent { using type = Instruction; };

1358template <> struct CallBaseParent<InvokeInst> { using type = TerminatorInst; };

1360//===----------------------------------------------------------------------===//
1361/// Base class for all callable instructions (InvokeInst and CallInst)
1362/// Holds everything related to calling a function, abstracting from the base
1363/// type @p BaseInstTy and the concrete instruction @p InstTy
1364///
1365template <class InstTy>
1366class CallBase : public CallBaseParent<InstTy>::type,
               public OperandBundleUser<InstTy, User::op_iterator> {
1368protected:
AttributeList Attrs; ///< parameter attributes for callable
FunctionType *FTy;
using BaseInstTy = typename CallBaseParent<InstTy>::type;

template <class... ArgsTy>
CallBase(AttributeList const &A, FunctionType *FT, ArgsTy &&... Args)
    : BaseInstTy(std::forward<ArgsTy>(Args)...), Attrs(A), FTy(FT) {}
bool hasDescriptor() const { return Value::HasDescriptor; }

using BaseInstTy::BaseInstTy;

using OperandBundleUser<InstTy,
                        User::op_iterator>::isFnAttrDisallowedByOpBundle;
using OperandBundleUser<InstTy, User::op_iterator>::getNumTotalBundleOperands;
using OperandBundleUser<InstTy, User::op_iterator>::bundleOperandHasAttr;
using Instruction::getSubclassDataFromInstruction;
using Instruction::setInstructionSubclassData;

1387public:
using Instruction::getContext;
using OperandBundleUser<InstTy, User::op_iterator>::hasOperandBundles;
using OperandBundleUser<InstTy,
                        User::op_iterator>::getBundleOperandsStartIndex;

static bool classof(const Instruction *I) {
  llvm_unreachable(::llvm::llvm_unreachable_internal("CallBase is not meant to be used as part of the classof hierarchy"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1395)
      "CallBase is not meant to be used as part of the classof hierarchy")::llvm::llvm_unreachable_internal("CallBase is not meant to be used as part of the classof hierarchy"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1395);
}

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

FunctionType *getFunctionType() const { return FTy; }

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

/// Return the number of call arguments.
///
unsigned getNumArgOperands() const {
  return getNumOperands() - getNumTotalBundleOperands() - InstTy::ArgOffset;
}

/// getArgOperand/setArgOperand - Return/set the i-th call argument.
///
Value *getArgOperand(unsigned i) const {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast <bool> (i < getNumArgOperands() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumArgOperands() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1423, __extension__ __PRETTY_FUNCTION__));
  return getOperand(i);
}
void setArgOperand(unsigned i, Value *v) {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast <bool> (i < getNumArgOperands() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumArgOperands() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1427, __extension__ __PRETTY_FUNCTION__));
  setOperand(i, v);
}

/// Return the iterator pointing to the beginning of the argument list.
User::op_iterator arg_begin() { return op_begin(); }

/// Return the iterator pointing to the end of the argument list.
User::op_iterator arg_end() {
  // [ call args ], [ operand bundles ], callee
  return op_end() - getNumTotalBundleOperands() - InstTy::ArgOffset;
}

/// Iteration adapter for range-for loops.
iterator_range<User::op_iterator> arg_operands() {
  return make_range(arg_begin(), arg_end());
}

/// Return the iterator pointing to the beginning of the argument list.
User::const_op_iterator arg_begin() const { return op_begin(); }

/// Return the iterator pointing to the end of the argument list.
User::const_op_iterator arg_end() const {
  // [ call args ], [ operand bundles ], callee
  return op_end() - getNumTotalBundleOperands() - InstTy::ArgOffset;
}

/// Iteration adapter for range-for loops.
iterator_range<User::const_op_iterator> arg_operands() const {
  return make_range(arg_begin(), arg_end());
}

/// Wrappers for getting the \c Use of a call argument.
const Use &getArgOperandUse(unsigned i) const {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast <bool> (i < getNumArgOperands() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumArgOperands() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1461, __extension__ __PRETTY_FUNCTION__));
  return User::getOperandUse(i);
}
Use &getArgOperandUse(unsigned i) {
  assert(i < getNumArgOperands() && "Out of bounds!")(static_cast <bool> (i < getNumArgOperands() &&
 "Out of bounds!") ? void (0) : __assert_fail ("i < getNumArgOperands() && \"Out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1465, __extension__ __PRETTY_FUNCTION__));
  return User::getOperandUse(i);
}

/// If one of the arguments has the 'returned' attribute, return its
/// operand value. Otherwise, return nullptr.
Value *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;
}

User::op_iterator op_begin() {
  return OperandTraits<CallBase>::op_begin(this);
}

User::const_op_iterator op_begin() const {
  return OperandTraits<CallBase>::op_begin(const_cast<CallBase *>(this));
}

User::op_iterator op_end() { return OperandTraits<CallBase>::op_end(this); }

User::const_op_iterator op_end() const {
  return OperandTraits<CallBase>::op_end(const_cast<CallBase *>(this));
}

Value *getOperand(unsigned i_nocapture) const {
  assert(i_nocapture < OperandTraits<CallBase>::operands(this) &&(static_cast <bool> (i_nocapture < OperandTraits<
CallBase>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CallBase>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1500, __extension__ __PRETTY_FUNCTION__))
         "getOperand() out of range!")(static_cast <bool> (i_nocapture < OperandTraits<
CallBase>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CallBase>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1500, __extension__ __PRETTY_FUNCTION__));
  return cast_or_null<Value>(OperandTraits<CallBase>::op_begin(
                                 const_cast<CallBase *>(this))[i_nocapture]
                                 .get());
}

void setOperand(unsigned i_nocapture, Value *Val_nocapture) {
  assert(i_nocapture < OperandTraits<CallBase>::operands(this) &&(static_cast <bool> (i_nocapture < OperandTraits<
CallBase>::operands(this) && "setOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CallBase>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1508, __extension__ __PRETTY_FUNCTION__))
         "setOperand() out of range!")(static_cast <bool> (i_nocapture < OperandTraits<
CallBase>::operands(this) && "setOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CallBase>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1508, __extension__ __PRETTY_FUNCTION__));
  OperandTraits<CallBase>::op_begin(this)[i_nocapture] = Val_nocapture;
}

unsigned getNumOperands() const {
  return OperandTraits<CallBase>::operands(this);
}
template <int Idx_nocapture> Use &Op() {
  return User::OpFrom<Idx_nocapture>(this);
}
template <int Idx_nocapture> const Use &Op() const {
  return User::OpFrom<Idx_nocapture>(this);
}

/// Return the function called, or null if this is an
/// indirect function invocation.
///
Function *getCalledFunction() const {
  return dyn_cast<Function>(Op<-InstTy::ArgOffset>());
}

/// Determine whether this call has the given attribute.
bool hasFnAttr(Attribute::AttrKind Kind) const {
  assert(Kind != Attribute::NoBuiltin &&(static_cast <bool> (Kind != Attribute::NoBuiltin &&
 "Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin"
) ? void (0) : __assert_fail ("Kind != Attribute::NoBuiltin && \"Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1532, __extension__ __PRETTY_FUNCTION__))
         "Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin")(static_cast <bool> (Kind != Attribute::NoBuiltin &&
 "Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin"
) ? void (0) : __assert_fail ("Kind != Attribute::NoBuiltin && \"Use CallBase::isNoBuiltin() to check for Attribute::NoBuiltin\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1532, __extension__ __PRETTY_FUNCTION__));
  return hasFnAttrImpl(Kind);
}

/// Determine whether this call has the given attribute.
bool hasFnAttr(StringRef Kind) const { return hasFnAttrImpl(Kind); }

/// getCallingConv/setCallingConv - Get or set the calling convention of this
/// function call.
CallingConv::ID getCallingConv() const {
  return static_cast<CallingConv::ID>(getSubclassDataFromInstruction() >> 2);
}
void setCallingConv(CallingConv::ID CC) {
  auto ID = static_cast<unsigned>(CC);
  assert(!(ID & ~CallingConv::MaxID) && "Unsupported calling convention")(static_cast <bool> (!(ID & ~CallingConv::MaxID) &&
 "Unsupported calling convention") ? void (0) : __assert_fail
 ("!(ID & ~CallingConv::MaxID) && \"Unsupported calling convention\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1546, __extension__ __PRETTY_FUNCTION__));
  setInstructionSubclassData((getSubclassDataFromInstruction() & 3) |
                             (ID << 2));
}


/// adds the attribute to the list of attributes.
void addAttribute(unsigned i, Attribute::AttrKind Kind) {
  AttributeList PAL = getAttributes();
  PAL = PAL.addAttribute(getContext(), i, Kind);
  setAttributes(PAL);
}

/// adds the attribute to the list of attributes.
void addAttribute(unsigned i, Attribute Attr) {
  AttributeList PAL = getAttributes();
  PAL = PAL.addAttribute(getContext(), i, Attr);
  setAttributes(PAL);
}

/// Adds the attribute to the indicated argument
void addParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1568, __extension__ __PRETTY_FUNCTION__));
  AttributeList PAL = getAttributes();
  PAL = PAL.addParamAttribute(getContext(), ArgNo, Kind);
  setAttributes(PAL);
}

/// Adds the attribute to the indicated argument
void addParamAttr(unsigned ArgNo, Attribute Attr) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1576, __extension__ __PRETTY_FUNCTION__));
  AttributeList PAL = getAttributes();
  PAL = PAL.addParamAttribute(getContext(), ArgNo, Attr);
  setAttributes(PAL);
}

/// removes the attribute from the list of attributes.
void removeAttribute(unsigned i, Attribute::AttrKind Kind) {
  AttributeList PAL = getAttributes();
  PAL = PAL.removeAttribute(getContext(), i, Kind);
  setAttributes(PAL);
}

/// removes the attribute from the list of attributes.
void removeAttribute(unsigned i, StringRef Kind) {
  AttributeList PAL = getAttributes();
  PAL = PAL.removeAttribute(getContext(), i, Kind);
  setAttributes(PAL);
}

/// Removes the attribute from the given argument
void removeParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1598, __extension__ __PRETTY_FUNCTION__));
  AttributeList PAL = getAttributes();
  PAL = PAL.removeParamAttribute(getContext(), ArgNo, Kind);
  setAttributes(PAL);
}

/// Removes the attribute from the given argument
void removeParamAttr(unsigned ArgNo, StringRef Kind) {
  assert(ArgNo < getNumArgOperands() && "Out of bounds")(static_cast <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1606, __extension__ __PRETTY_FUNCTION__));
  AttributeList PAL = getAttributes();
  PAL = PAL.removeParamAttribute(getContext(), ArgNo, Kind);
  setAttributes(PAL);
}

/// adds the dereferenceable attribute to the list of attributes.
void addDereferenceableAttr(unsigned i, uint64_t Bytes) {
  AttributeList PAL = getAttributes();
  PAL = PAL.addDereferenceableAttr(getContext(), i, Bytes);
  setAttributes(PAL);
}

/// adds the dereferenceable_or_null attribute to the list of
/// attributes.
void addDereferenceableOrNullAttr(unsigned i, uint64_t Bytes) {
  AttributeList PAL = getAttributes();
  PAL = PAL.addDereferenceableOrNullAttr(getContext(), i, Bytes);
  setAttributes(PAL);
}

/// Determine whether the return value has the given attribute.
bool hasRetAttr(Attribute::AttrKind Kind) const {
  if (Attrs.hasAttribute(AttributeList::ReturnIndex, Kind))
    return true;

  // Look at the callee, if available.
  if (const Function *F = getCalledFunction())
    return F->getAttributes().hasAttribute(AttributeList::ReturnIndex, Kind);
  return false;
}

/// Determine whether the argument or parameter has the given attribute.
bool paramHasAttr(unsigned ArgNo, Attribute::AttrKind Kind) const {
  assert(ArgNo < getNumArgOperands() && "Param index out of bounds!")(static_cast <bool> (ArgNo < getNumArgOperands() &&
 "Param index out of bounds!") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Param index out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1640, __extension__ __PRETTY_FUNCTION__));

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

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

/// Get the attribute of a given kind at a position.
Attribute getAttribute(unsigned i, StringRef Kind) const {
  return getAttributes().getAttribute(i, 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 <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1661, __extension__ __PRETTY_FUNCTION__));
  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 <bool> (ArgNo < getNumArgOperands() &&
 "Out of bounds") ? void (0) : __assert_fail ("ArgNo < getNumArgOperands() && \"Out of bounds\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1667, __extension__ __PRETTY_FUNCTION__));
  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 {
  // There are getNumOperands() - (InstTy::ArgOffset - 1) data operands.
  // The last operand is the callee.
  assert(i < (getNumOperands() - InstTy::ArgOffset + 1) &&(static_cast <bool> (i < (getNumOperands() - InstTy::
ArgOffset + 1) && "Data operand index out of bounds!"
) ? void (0) : __assert_fail ("i < (getNumOperands() - InstTy::ArgOffset + 1) && \"Data operand index out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1687, __extension__ __PRETTY_FUNCTION__))
         "Data operand index out of bounds!")(static_cast <bool> (i < (getNumOperands() - InstTy::
ArgOffset + 1) && "Data operand index out of bounds!"
) ? void (0) : __assert_fail ("i < (getNumOperands() - InstTy::ArgOffset + 1) && \"Data operand index out of bounds!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1687, __extension__ __PRETTY_FUNCTION__));

  // 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 <bool> (hasOperandBundles() && i >=
 (getBundleOperandsStartIndex() + 1) && "Must be either a call argument or an operand bundle!"
) ? void (0) : __assert_fail ("hasOperandBundles() && i >= (getBundleOperandsStartIndex() + 1) && \"Must be either a call argument or an operand bundle!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1702, __extension__ __PRETTY_FUNCTION__))
         "Must be either a call argument or an operand bundle!")(static_cast <bool> (hasOperandBundles() && i >=
 (getBundleOperandsStartIndex() + 1) && "Must be either a call argument or an operand bundle!"
) ? void (0) : __assert_fail ("hasOperandBundles() && i >= (getBundleOperandsStartIndex() + 1) && \"Must be either a call argument or an operand bundle!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1702, __extension__ __PRETTY_FUNCTION__));
  return bundleOperandHasAttr(i - 1, Kind);
}

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

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

/// Extract the number of dereferenceable bytes for a call or
/// parameter (0=unknown).
uint64_t getDereferenceableBytes(unsigned i) const {
  return Attrs.getDereferenceableBytes(i);
}

/// Extract the number of dereferenceable_or_null bytes for a call or
/// parameter (0=unknown).
uint64_t getDereferenceableOrNullBytes(unsigned i) const {
  return Attrs.getDereferenceableOrNullBytes(i);
}

/// Determine if the return value is marked with NoAlias attribute.
bool returnDoesNotAlias() const {
  return Attrs.hasAttribute(AttributeList::ReturnIndex, Attribute::NoAlias);
}

/// 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() {
  addAttribute(AttributeList::FunctionIndex, Attribute::NoInline);
}
/// Determine if the call does not access memory.
bool doesNotAccessMemory() const {
  return hasFnAttr(Attribute::ReadNone);
}
void setDoesNotAccessMemory() {
  addAttribute(AttributeList::FunctionIndex, Attribute::ReadNone);
}

/// Determine if the call does not access or only reads memory.
bool onlyReadsMemory() const {
  return doesNotAccessMemory() || hasFnAttr(Attribute::ReadOnly);
}
void setOnlyReadsMemory() {
  addAttribute(AttributeList::FunctionIndex, Attribute::ReadOnly);
}

/// Determine if the call does not access or only writes memory.
bool doesNotReadMemory() const {
  return doesNotAccessMemory() || hasFnAttr(Attribute::WriteOnly);
}
void setDoesNotReadMemory() {
  addAttribute(AttributeList::FunctionIndex, 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() {
  addAttribute(AttributeList::FunctionIndex, 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() {
  addAttribute(AttributeList::FunctionIndex, 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() {
  addAttribute(AttributeList::FunctionIndex, Attribute::InaccessibleMemOrArgMemOnly);
}
/// Determine if the call cannot return.
bool doesNotReturn() const { return hasFnAttr(Attribute::NoReturn); }
void setDoesNotReturn() {
  addAttribute(AttributeList::FunctionIndex, 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() {
  addAttribute(AttributeList::FunctionIndex, Attribute::NoUnwind);
}

/// Determine if the invoke cannot be duplicated.
bool cannotDuplicate() const {return hasFnAttr(Attribute::NoDuplicate); }
void setCannotDuplicate() {
  addAttribute(AttributeList::FunctionIndex, Attribute::NoDuplicate);
}

/// Determine if the invoke is convergent
bool isConvergent() const { return hasFnAttr(Attribute::Convergent); }
void setConvergent() {
  addAttribute(AttributeList::FunctionIndex, Attribute::Convergent);
}
void setNotConvergent() {
  removeAttribute(AttributeList::FunctionIndex, 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);
}
/// Get a pointer to the function that is invoked by this
/// instruction.
const Value *getCalledValue() const { return Op<-InstTy::ArgOffset>(); }
Value *getCalledValue() { return Op<-InstTy::ArgOffset>(); }

/// Set the function called.
void setCalledFunction(Value* Fn) {
  setCalledFunction(
      cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType()),
      Fn);
}
void setCalledFunction(FunctionType *FTy, Value *Fn) {
  this->FTy = FTy;
  assert(FTy == cast<FunctionType>((static_cast <bool> (FTy == cast<FunctionType>( cast
<PointerType>(Fn->getType())->getElementType())) ?
 void (0) : __assert_fail ("FTy == cast<FunctionType>( cast<PointerType>(Fn->getType())->getElementType())"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1854, __extension__ __PRETTY_FUNCTION__))
                    cast<PointerType>(Fn->getType())->getElementType()))(static_cast <bool> (FTy == cast<FunctionType>( cast
<PointerType>(Fn->getType())->getElementType())) ?
 void (0) : __assert_fail ("FTy == cast<FunctionType>( cast<PointerType>(Fn->getType())->getElementType())"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 1854, __extension__ __PRETTY_FUNCTION__));
  Op<-InstTy::ArgOffset>() = Fn;
}

1858protected:
template <typename AttrKind> bool hasFnAttrImpl(AttrKind Kind) const {
  if (Attrs.hasAttribute(AttributeList::FunctionIndex, 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;

  if (const Function *F = getCalledFunction())
    return F->getAttributes().hasAttribute(AttributeList::FunctionIndex,
                                           Kind);
  return false;
}
1873};

1875//===----------------------------------------------------------------------===//
1876/// This class represents a function call, abstracting a target
1877/// machine's calling convention.  This class uses low bit of the SubClassData
1878/// field to indicate whether or not this is a tail call.  The rest of the bits
1879/// hold the calling convention of the call.
1880///
1881class CallInst : public CallBase<CallInst> {
friend class OperandBundleUser<CallInst, User::op_iterator>;

CallInst(const CallInst &CI);

/// Construct a CallInst given a range of arguments.
/// Construct a CallInst from a range of arguments
inline CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                Instruction *InsertBefore);

inline CallInst(Value *Func, ArrayRef<Value *> Args,
                ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                Instruction *InsertBefore)
    : CallInst(cast<FunctionType>(
                   cast<PointerType>(Func->getType())->getElementType()),
               Func, Args, Bundles, NameStr, InsertBefore) {}

inline CallInst(Value *Func, ArrayRef<Value *> Args, const Twine &NameStr,
                Instruction *InsertBefore)
    : CallInst(Func, Args, None, NameStr, InsertBefore) {}

/// Construct a CallInst given a range of arguments.
/// Construct a CallInst from a range of arguments
inline CallInst(Value *Func, ArrayRef<Value *> Args,
                ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

explicit CallInst(Value *F, const Twine &NameStr, Instruction *InsertBefore);

CallInst(Value *F, const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(Value *Func, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr) {
  init(cast<FunctionType>(
           cast<PointerType>(Func->getType())->getElementType()),
       Func, Args, Bundles, NameStr);
}
void init(FunctionType *FTy, Value *Func, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr);
void init(Value *Func, const Twine &NameStr);

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

CallInst *cloneImpl() const;

1929public:
static constexpr int ArgOffset = 1;

static CallInst *Create(Value *Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles = None,
                        const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  return Create(cast<FunctionType>(
                    cast<PointerType>(Func->getType())->getElementType()),
                Func, Args, Bundles, NameStr, InsertBefore);
}

static CallInst *Create(Value *Func, ArrayRef<Value *> Args,
                        const Twine &NameStr,
                        Instruction *InsertBefore = nullptr) {
  return Create(cast<FunctionType>(
                    cast<PointerType>(Func->getType())->getElementType()),
                Func, Args, None, NameStr, InsertBefore);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        const Twine &NameStr,
                        Instruction *InsertBefore = nullptr) {
  return new (unsigned(Args.size() + 1))
      CallInst(Ty, Func, Args, None, NameStr, InsertBefore);
}

static CallInst *Create(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles = None,
                        const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  const unsigned TotalOps =
      unsigned(Args.size()) + CountBundleInputs(Bundles) + 1;
  const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (TotalOps, DescriptorBytes)
      CallInst(Ty, Func, Args, Bundles, NameStr, InsertBefore);
}

static CallInst *Create(Value *Func, ArrayRef<Value *> Args,
                        ArrayRef<OperandBundleDef> Bundles,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  const unsigned TotalOps =
      unsigned(Args.size()) + CountBundleInputs(Bundles) + 1;
  const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (TotalOps, DescriptorBytes)
      CallInst(Func, Args, Bundles, NameStr, InsertAtEnd);
}

static CallInst *Create(Value *Func, ArrayRef<Value *> Args,
                        const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return new (unsigned(Args.size() + 1))
      CallInst(Func, Args, None, NameStr, InsertAtEnd);
}

static CallInst *Create(Value *F, const Twine &NameStr = "",
                        Instruction *InsertBefore = nullptr) {
  return new (1) CallInst(F, NameStr, InsertBefore);
}

static CallInst *Create(Value *F, const Twine &NameStr,
                        BasicBlock *InsertAtEnd) {
  return new (1) CallInst(F, NameStr, InsertAtEnd);
}

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

/// Generate the IR for a call to malloc:
/// 1. Compute the malloc call's argument as the specified type's size,
///    possibly multiplied by the array size if the array size is not
///    constant 1.
/// 2. Call malloc with that argument.
/// 3. Bitcast the result of the malloc call to the specified type.
static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(Instruction *InsertBefore, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 ArrayRef<OperandBundleDef> Bundles = None,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
static Instruction *CreateMalloc(BasicBlock *InsertAtEnd, Type *IntPtrTy,
                                 Type *AllocTy, Value *AllocSize,
                                 Value *ArraySize = nullptr,
                                 ArrayRef<OperandBundleDef> Bundles = None,
                                 Function *MallocF = nullptr,
                                 const Twine &Name = "");
/// Generate the IR for a call to the builtin free function.
static Instruction *CreateFree(Value *Source, Instruction *InsertBefore);
static Instruction *CreateFree(Value *Source, BasicBlock *InsertAtEnd);
static Instruction *CreateFree(Value *Source,
                               ArrayRef<OperandBundleDef> Bundles,
                               Instruction *InsertBefore);
static Instruction *CreateFree(Value *Source,
                               ArrayRef<OperandBundleDef> Bundles,
                               BasicBlock *InsertAtEnd);

// Note that 'musttail' implies 'tail'.
enum TailCallKind {
  TCK_None = 0,
  TCK_Tail = 1,
  TCK_MustTail = 2,
  TCK_NoTail = 3
};
TailCallKind getTailCallKind() const {
  return TailCallKind(getSubclassDataFromInstruction() & 3);
}

bool isTailCall() const {
  unsigned Kind = getSubclassDataFromInstruction() & 3;
  return Kind == TCK_Tail || Kind == TCK_MustTail;
}

bool isMustTailCall() const {
  return (getSubclassDataFromInstruction() & 3) == TCK_MustTail;
}

bool isNoTailCall() const {
  return (getSubclassDataFromInstruction() & 3) == TCK_NoTail;
}

void setTailCall(bool isTC = true) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~3) |
                             unsigned(isTC ? TCK_Tail : TCK_None));
}

void setTailCallKind(TailCallKind TCK) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~3) |
                             unsigned(TCK));
}

/// Return true if the call can return twice
bool canReturnTwice() const { return hasFnAttr(Attribute::ReturnsTwice); }
void setCanReturnTwice() {
  addAttribute(AttributeList::FunctionIndex, Attribute::ReturnsTwice);
}

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

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

2093private:
// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}
2099};

2101template <>
2102struct OperandTraits<CallBase<CallInst>>
  : public VariadicOperandTraits<CallBase<CallInst>, 1> {};

2105CallInst::CallInst(Value *Func, ArrayRef<Value *> Args,
                 ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                 BasicBlock *InsertAtEnd)
  : CallBase<CallInst>(
        cast<FunctionType>(
            cast<PointerType>(Func->getType())->getElementType())
            ->getReturnType(),
        Instruction::Call,
        OperandTraits<CallBase<CallInst>>::op_end(this) -
            (Args.size() + CountBundleInputs(Bundles) + 1),
        unsigned(Args.size() + CountBundleInputs(Bundles) + 1), InsertAtEnd) {
init(Func, Args, Bundles, NameStr);
2117}

2119CallInst::CallInst(FunctionType *Ty, Value *Func, ArrayRef<Value *> Args,
                 ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr,
                 Instruction *InsertBefore)
  : CallBase<CallInst>(Ty->getReturnType(), Instruction::Call,
                       OperandTraits<CallBase<CallInst>>::op_end(this) -
                           (Args.size() + CountBundleInputs(Bundles) + 1),
                       unsigned(Args.size() + CountBundleInputs(Bundles) + 1),
                       InsertBefore) {
init(Ty, Func, Args, Bundles, NameStr);
2128}

2130//===----------------------------------------------------------------------===//
2131//                               SelectInst Class
2132//===----------------------------------------------------------------------===//

2134/// This class represents the LLVM 'select' instruction.
2135///
2136class SelectInst : public Instruction {
SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr,
           Instruction *InsertBefore)
  : Instruction(S1->getType(), Instruction::Select,
                &Op<0>(), 3, InsertBefore) {
  init(C, S1, S2);
  setName(NameStr);
}

SelectInst(Value *C, Value *S1, Value *S2, const Twine &NameStr,
           BasicBlock *InsertAtEnd)
  : Instruction(S1->getType(), Instruction::Select,
                &Op<0>(), 3, InsertAtEnd) {
  init(C, S1, S2);
  setName(NameStr);
}

void init(Value *C, Value *S1, Value *S2) {
  assert(!areInvalidOperands(C, S1, S2) && "Invalid operands for select")(static_cast <bool> (!areInvalidOperands(C, S1, S2) &&
 "Invalid operands for select") ? void (0) : __assert_fail ("!areInvalidOperands(C, S1, S2) && \"Invalid operands for select\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2154, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = C;
  Op<1>() = S1;
  Op<2>() = S2;
}

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

SelectInst *cloneImpl() const;

2166public:
static SelectInst *Create(Value *C, Value *S1, Value *S2,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr,
                          Instruction *MDFrom = nullptr) {
  SelectInst *Sel = new(3) SelectInst(C, S1, S2, NameStr, InsertBefore);
  if (MDFrom)
    Sel->copyMetadata(*MDFrom);
  return Sel;
}

static SelectInst *Create(Value *C, Value *S1, Value *S2,
                          const Twine &NameStr,
                          BasicBlock *InsertAtEnd) {
  return new(3) SelectInst(C, S1, S2, NameStr, InsertAtEnd);
}

const Value *getCondition() const { return Op<0>(); }
const Value *getTrueValue() const { return Op<1>(); }
const Value *getFalseValue() const { return Op<2>(); }
Value *getCondition() { return Op<0>(); }
21
←
Calling 'Use::operator llvm::Value *'→
22
←
Returning from 'Use::operator llvm::Value *'→
Value *getTrueValue() { return Op<1>(); }
Value *getFalseValue() { return Op<2>(); }

void setCondition(Value *V) { Op<0>() = V; }
void setTrueValue(Value *V) { Op<1>() = V; }
void setFalseValue(Value *V) { Op<2>() = V; }

/// Return a string if the specified operands are invalid
/// for a select operation, otherwise return null.
static const char *areInvalidOperands(Value *Cond, Value *True, Value *False);

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

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

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

2214template <>
2215struct OperandTraits<SelectInst> : public FixedNumOperandTraits<SelectInst, 3> {
2216};

2218DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SelectInst, Value)SelectInst::op_iterator SelectInst::op_begin() { return OperandTraits
<SelectInst>::op_begin(this); } SelectInst::const_op_iterator
 SelectInst::op_begin() const { return OperandTraits<SelectInst
>::op_begin(const_cast<SelectInst*>(this)); } SelectInst
::op_iterator SelectInst::op_end() { return OperandTraits<
SelectInst>::op_end(this); } SelectInst::const_op_iterator
 SelectInst::op_end() const { return OperandTraits<SelectInst
>::op_end(const_cast<SelectInst*>(this)); } Value *SelectInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<SelectInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2218, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<SelectInst>::op_begin(const_cast
<SelectInst*>(this))[i_nocapture].get()); } void SelectInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<SelectInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<SelectInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2218, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
SelectInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned SelectInst::getNumOperands() const { return OperandTraits
<SelectInst>::operands(this); } template <int Idx_nocapture
> Use &SelectInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
SelectInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

2220//===----------------------------------------------------------------------===//
2221//                                VAArgInst Class
2222//===----------------------------------------------------------------------===//

2224/// This class represents the va_arg llvm instruction, which returns
2225/// an argument of the specified type given a va_list and increments that list
2226///
2227class VAArgInst : public UnaryInstruction {
2228protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

VAArgInst *cloneImpl() const;

2234public:
VAArgInst(Value *List, Type *Ty, const Twine &NameStr = "",
           Instruction *InsertBefore = nullptr)
  : UnaryInstruction(Ty, VAArg, List, InsertBefore) {
  setName(NameStr);
}

VAArgInst(Value *List, Type *Ty, const Twine &NameStr,
          BasicBlock *InsertAtEnd)
  : UnaryInstruction(Ty, VAArg, List, InsertAtEnd) {
  setName(NameStr);
}

Value *getPointerOperand() { return getOperand(0); }
const Value *getPointerOperand() const { return getOperand(0); }
static unsigned getPointerOperandIndex() { return 0U; }

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

2260//===----------------------------------------------------------------------===//
2261//                                ExtractElementInst Class
2262//===----------------------------------------------------------------------===//

2264/// This instruction extracts a single (scalar)
2265/// element from a VectorType value
2266///
2267class ExtractElementInst : public Instruction {
ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr = "",
                   Instruction *InsertBefore = nullptr);
ExtractElementInst(Value *Vec, Value *Idx, const Twine &NameStr,
                   BasicBlock *InsertAtEnd);

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

ExtractElementInst *cloneImpl() const;

2279public:
static ExtractElementInst *Create(Value *Vec, Value *Idx,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertBefore);
}

static ExtractElementInst *Create(Value *Vec, Value *Idx,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  return new(2) ExtractElementInst(Vec, Idx, NameStr, InsertAtEnd);
}

/// Return true if an extractelement instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *Vec, const Value *Idx);

Value *getVectorOperand() { return Op<0>(); }
Value *getIndexOperand() { return Op<1>(); }
const Value *getVectorOperand() const { return Op<0>(); }
const Value *getIndexOperand() const { return Op<1>(); }

VectorType *getVectorOperandType() const {
  return cast<VectorType>(getVectorOperand()->getType());
}

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

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

2317template <>
2318struct OperandTraits<ExtractElementInst> :
public FixedNumOperandTraits<ExtractElementInst, 2> {
2320};

2322DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ExtractElementInst, Value)ExtractElementInst::op_iterator ExtractElementInst::op_begin(
) { return OperandTraits<ExtractElementInst>::op_begin(
this); } ExtractElementInst::const_op_iterator ExtractElementInst
::op_begin() const { return OperandTraits<ExtractElementInst
>::op_begin(const_cast<ExtractElementInst*>(this)); }
 ExtractElementInst::op_iterator ExtractElementInst::op_end()
 { return OperandTraits<ExtractElementInst>::op_end(this
); } ExtractElementInst::const_op_iterator ExtractElementInst
::op_end() const { return OperandTraits<ExtractElementInst
>::op_end(const_cast<ExtractElementInst*>(this)); } Value
 *ExtractElementInst::getOperand(unsigned i_nocapture) const {
 (static_cast <bool> (i_nocapture < OperandTraits<
ExtractElementInst>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2322, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ExtractElementInst>::op_begin
(const_cast<ExtractElementInst*>(this))[i_nocapture].get
()); } void ExtractElementInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<ExtractElementInst>::operands(this)
 && "setOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ExtractElementInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2322, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ExtractElementInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned ExtractElementInst::getNumOperands() const { return
 OperandTraits<ExtractElementInst>::operands(this); } template
 <int Idx_nocapture> Use &ExtractElementInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &ExtractElementInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

2324//===----------------------------------------------------------------------===//
2325//                                InsertElementInst Class
2326//===----------------------------------------------------------------------===//

2328/// This instruction inserts a single (scalar)
2329/// element into a VectorType value
2330///
2331class InsertElementInst : public Instruction {
InsertElementInst(Value *Vec, Value *NewElt, Value *Idx,
                  const Twine &NameStr = "",
                  Instruction *InsertBefore = nullptr);
InsertElementInst(Value *Vec, Value *NewElt, Value *Idx, const Twine &NameStr,
                  BasicBlock *InsertAtEnd);

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

InsertElementInst *cloneImpl() const;

2344public:
static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx,
                                 const Twine &NameStr = "",
                                 Instruction *InsertBefore = nullptr) {
  return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertBefore);
}

static InsertElementInst *Create(Value *Vec, Value *NewElt, Value *Idx,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd) {
  return new(3) InsertElementInst(Vec, NewElt, Idx, NameStr, InsertAtEnd);
}

/// Return true if an insertelement instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *Vec, const Value *NewElt,
                            const Value *Idx);

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

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

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

2380template <>
2381struct OperandTraits<InsertElementInst> :
public FixedNumOperandTraits<InsertElementInst, 3> {
2383};

2385DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertElementInst, Value)InsertElementInst::op_iterator InsertElementInst::op_begin() {
 return OperandTraits<InsertElementInst>::op_begin(this
); } InsertElementInst::const_op_iterator InsertElementInst::
op_begin() const { return OperandTraits<InsertElementInst>
::op_begin(const_cast<InsertElementInst*>(this)); } InsertElementInst
::op_iterator InsertElementInst::op_end() { return OperandTraits
<InsertElementInst>::op_end(this); } InsertElementInst::
const_op_iterator InsertElementInst::op_end() const { return OperandTraits
<InsertElementInst>::op_end(const_cast<InsertElementInst
*>(this)); } Value *InsertElementInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<InsertElementInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2385, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<InsertElementInst>::op_begin
(const_cast<InsertElementInst*>(this))[i_nocapture].get
()); } void InsertElementInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<InsertElementInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertElementInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2385, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
InsertElementInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned InsertElementInst::getNumOperands() const { return
 OperandTraits<InsertElementInst>::operands(this); } template
 <int Idx_nocapture> Use &InsertElementInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &InsertElementInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

2387//===----------------------------------------------------------------------===//
2388//                           ShuffleVectorInst Class
2389//===----------------------------------------------------------------------===//

2391/// This instruction constructs a fixed permutation of two
2392/// input vectors.
2393///
2394class ShuffleVectorInst : public Instruction {
2395protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

ShuffleVectorInst *cloneImpl() const;

2401public:
ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                  const Twine &NameStr = "",
                  Instruction *InsertBefor = nullptr);
ShuffleVectorInst(Value *V1, Value *V2, Value *Mask,
                  const Twine &NameStr, BasicBlock *InsertAtEnd);

// allocate space for exactly three operands
void *operator new(size_t s) {
  return User::operator new(s, 3);
}

/// Return true if a shufflevector instruction can be
/// formed with the specified operands.
static bool isValidOperands(const Value *V1, const Value *V2,
                            const Value *Mask);

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

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

Constant *getMask() const {
  return cast<Constant>(getOperand(2));
}

/// Return the shuffle mask value for the specified element of the mask.
/// Return -1 if the element is undef.
static int getMaskValue(const Constant *Mask, unsigned Elt);

/// Return the shuffle mask value of this instruction for the given element
/// index. Return -1 if the element is undef.
int getMaskValue(unsigned Elt) const {
  return getMaskValue(getMask(), Elt);
}

/// Convert the input shuffle mask operand to a vector of integers. Undefined
/// elements of the mask are returned as -1.
static void getShuffleMask(const Constant *Mask,
                           SmallVectorImpl<int> &Result);

/// Return the mask for this instruction as a vector of integers. Undefined
/// elements of the mask are returned as -1.
void getShuffleMask(SmallVectorImpl<int> &Result) const {
  return getShuffleMask(getMask(), Result);
}

SmallVector<int, 16> getShuffleMask() const {
  SmallVector<int, 16> Mask;
  getShuffleMask(Mask);
  return Mask;
}

/// Return true if this shuffle returns a vector with a different number of
/// elements than its source elements.
/// Example: shufflevector <4 x n> A, <4 x n> B, <1,2>
bool changesLength() const {
  unsigned NumSourceElts = Op<0>()->getType()->getVectorNumElements();
  unsigned NumMaskElts = getMask()->getType()->getVectorNumElements();
  return NumSourceElts != NumMaskElts;
}

/// Return true if this shuffle mask chooses elements from exactly one source
/// vector.
/// Example: <7,5,undef,7>
/// This assumes that vector operands are the same length as the mask.
static bool isSingleSourceMask(ArrayRef<int> Mask);
static bool isSingleSourceMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2473, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isSingleSourceMask(MaskAsInts);
}

/// Return true if this shuffle chooses elements from exactly one source
/// vector without changing the length of that vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <3,0,undef,3>
/// TODO: Optionally allow length-changing shuffles.
bool isSingleSource() const {
  return !changesLength() && isSingleSourceMask(getMask());
}

/// Return true if this shuffle mask chooses elements from exactly one source
/// vector without lane crossings. A shuffle using this mask is not
/// necessarily a no-op because it may change the number of elements from its
/// input vectors or it may provide demanded bits knowledge via undef lanes.
/// Example: <undef,undef,2,3>
static bool isIdentityMask(ArrayRef<int> Mask);
static bool isIdentityMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2494, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isIdentityMask(MaskAsInts);
}

/// Return true if this shuffle mask chooses elements from exactly one source
/// vector without lane crossings and does not change the number of elements
/// from its input vectors.
/// Example: shufflevector <4 x n> A, <4 x n> B, <4,undef,6,undef>
/// TODO: Optionally allow length-changing shuffles.
bool isIdentity() const {
  return !changesLength() && isIdentityMask(getShuffleMask());
}

/// Return true if this shuffle mask chooses elements from its source vectors
/// without lane crossings. A shuffle using this mask would be
/// equivalent to a vector select with a constant condition operand.
/// Example: <4,1,6,undef>
/// This returns false if the mask does not choose from both input vectors.
/// In that case, the shuffle is better classified as an identity shuffle.
/// This assumes that vector operands are the same length as the mask
/// (a length-changing shuffle can never be equivalent to a vector select).
static bool isSelectMask(ArrayRef<int> Mask);
static bool isSelectMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2519, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isSelectMask(MaskAsInts);
}

/// Return true if this shuffle chooses elements from its source vectors
/// without lane crossings and all operands have the same number of elements.
/// In other words, this shuffle is equivalent to a vector select with a
/// constant condition operand.
/// Example: shufflevector <4 x n> A, <4 x n> B, <undef,1,6,3>
/// This returns false if the mask does not choose from both input vectors.
/// In that case, the shuffle is better classified as an identity shuffle.
/// TODO: Optionally allow length-changing shuffles.
bool isSelect() const {
  return !changesLength() && isSelectMask(getMask());
}

/// Return true if this shuffle mask swaps the order of elements from exactly
/// one source vector.
/// Example: <7,6,undef,4>
/// This assumes that vector operands are the same length as the mask.
static bool isReverseMask(ArrayRef<int> Mask);
static bool isReverseMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2543, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isReverseMask(MaskAsInts);
}

/// Return true if this shuffle swaps the order of elements from exactly
/// one source vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <3,undef,1,undef>
/// TODO: Optionally allow length-changing shuffles.
bool isReverse() const {
  return !changesLength() && isReverseMask(getMask());
}

/// Return true if this shuffle mask chooses all elements with the same value
/// as the first element of exactly one source vector.
/// Example: <4,undef,undef,4>
/// This assumes that vector operands are the same length as the mask.
static bool isZeroEltSplatMask(ArrayRef<int> Mask);
static bool isZeroEltSplatMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2563, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isZeroEltSplatMask(MaskAsInts);
}

/// Return true if all elements of this shuffle are the same value as the
/// first element of exactly one source vector without changing the length
/// of that vector.
/// Example: shufflevector <4 x n> A, <4 x n> B, <undef,0,undef,0>
/// TODO: Optionally allow length-changing shuffles.
/// TODO: Optionally allow splats from other elements.
bool isZeroEltSplat() const {
  return !changesLength() && isZeroEltSplatMask(getMask());
}

/// Return true if this shuffle mask is a transpose mask.
/// Transpose vector masks transpose a 2xn matrix. They read corresponding
/// even- or odd-numbered vector elements from two n-dimensional source
/// vectors and write each result into consecutive elements of an
/// n-dimensional destination vector. Two shuffles are necessary to complete
/// the transpose, one for the even elements and another for the odd elements.
/// This description closely follows how the TRN1 and TRN2 AArch64
/// instructions operate.
///
/// For example, a simple 2x2 matrix can be transposed with:
///
///   ; Original matrix
///   m0 = < a, b >
///   m1 = < c, d >
///
///   ; Transposed matrix
///   t0 = < a, c > = shufflevector m0, m1, < 0, 2 >
///   t1 = < b, d > = shufflevector m0, m1, < 1, 3 >
///
/// For matrices having greater than n columns, the resulting nx2 transposed
/// matrix is stored in two result vectors such that one vector contains
/// interleaved elements from all the even-numbered rows and the other vector
/// contains interleaved elements from all the odd-numbered rows. For example,
/// a 2x4 matrix can be transposed with:
///
///   ; Original matrix
///   m0 = < a, b, c, d >
///   m1 = < e, f, g, h >
///
///   ; Transposed matrix
///   t0 = < a, e, c, g > = shufflevector m0, m1 < 0, 4, 2, 6 >
///   t1 = < b, f, d, h > = shufflevector m0, m1 < 1, 5, 3, 7 >
static bool isTransposeMask(ArrayRef<int> Mask);
static bool isTransposeMask(const Constant *Mask) {
  assert(Mask->getType()->isVectorTy() && "Shuffle needs vector constant.")(static_cast <bool> (Mask->getType()->isVectorTy(
) && "Shuffle needs vector constant.") ? void (0) : __assert_fail
 ("Mask->getType()->isVectorTy() && \"Shuffle needs vector constant.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2613, __extension__ __PRETTY_FUNCTION__));
  SmallVector<int, 16> MaskAsInts;
  getShuffleMask(Mask, MaskAsInts);
  return isTransposeMask(MaskAsInts);
}

/// Return true if this shuffle transposes the elements of its inputs without
/// changing the length of the vectors. This operation may also be known as a
/// merge or interleave. See the description for isTransposeMask() for the
/// exact specification.
/// Example: shufflevector <4 x n> A, <4 x n> B, <0,4,2,6>
bool isTranspose() const {
  return !changesLength() && isTransposeMask(getMask());
}

/// Change values in a shuffle permute mask assuming the two vector operands
/// of length InVecNumElts have swapped position.
static void commuteShuffleMask(MutableArrayRef<int> Mask,
                               unsigned InVecNumElts) {
  for (int &Idx : Mask) {
    if (Idx == -1)
      continue;
    Idx = Idx < (int)InVecNumElts ? Idx + InVecNumElts : Idx - InVecNumElts;
    assert(Idx >= 0 && Idx < (int)InVecNumElts * 2 &&(static_cast <bool> (Idx >= 0 && Idx < (int
)InVecNumElts * 2 && "shufflevector mask index out of range"
) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2637, __extension__ __PRETTY_FUNCTION__))
           "shufflevector mask index out of range")(static_cast <bool> (Idx >= 0 && Idx < (int
)InVecNumElts * 2 && "shufflevector mask index out of range"
) ? void (0) : __assert_fail ("Idx >= 0 && Idx < (int)InVecNumElts * 2 && \"shufflevector mask index out of range\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2637, __extension__ __PRETTY_FUNCTION__));
  }
}

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

2650template <>
2651struct OperandTraits<ShuffleVectorInst> :
public FixedNumOperandTraits<ShuffleVectorInst, 3> {
2653};

2655DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ShuffleVectorInst, Value)ShuffleVectorInst::op_iterator ShuffleVectorInst::op_begin() {
 return OperandTraits<ShuffleVectorInst>::op_begin(this
); } ShuffleVectorInst::const_op_iterator ShuffleVectorInst::
op_begin() const { return OperandTraits<ShuffleVectorInst>
::op_begin(const_cast<ShuffleVectorInst*>(this)); } ShuffleVectorInst
::op_iterator ShuffleVectorInst::op_end() { return OperandTraits
<ShuffleVectorInst>::op_end(this); } ShuffleVectorInst::
const_op_iterator ShuffleVectorInst::op_end() const { return OperandTraits
<ShuffleVectorInst>::op_end(const_cast<ShuffleVectorInst
*>(this)); } Value *ShuffleVectorInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<ShuffleVectorInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2655, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ShuffleVectorInst>::op_begin
(const_cast<ShuffleVectorInst*>(this))[i_nocapture].get
()); } void ShuffleVectorInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<ShuffleVectorInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<ShuffleVectorInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2655, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ShuffleVectorInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned ShuffleVectorInst::getNumOperands() const { return
 OperandTraits<ShuffleVectorInst>::operands(this); } template
 <int Idx_nocapture> Use &ShuffleVectorInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &ShuffleVectorInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

2657//===----------------------------------------------------------------------===//
2658//                                ExtractValueInst Class
2659//===----------------------------------------------------------------------===//

2661/// This instruction extracts a struct member or array
2662/// element value from an aggregate value.
2663///
2664class ExtractValueInst : public UnaryInstruction {
SmallVector<unsigned, 4> Indices;

ExtractValueInst(const ExtractValueInst &EVI);

/// Constructors - Create a extractvalue instruction with a base aggregate
/// value and a list of indices.  The first ctor can optionally insert before
/// an existing instruction, the second appends the new instruction to the
/// specified BasicBlock.
inline ExtractValueInst(Value *Agg,
                        ArrayRef<unsigned> Idxs,
                        const Twine &NameStr,
                        Instruction *InsertBefore);
inline ExtractValueInst(Value *Agg,
                        ArrayRef<unsigned> Idxs,
                        const Twine &NameStr, BasicBlock *InsertAtEnd);

void init(ArrayRef<unsigned> Idxs, const Twine &NameStr);

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

ExtractValueInst *cloneImpl() const;

2689public:
static ExtractValueInst *Create(Value *Agg,
                                ArrayRef<unsigned> Idxs,
                                const Twine &NameStr = "",
                                Instruction *InsertBefore = nullptr) {
  return new
    ExtractValueInst(Agg, Idxs, NameStr, InsertBefore);
}

static ExtractValueInst *Create(Value *Agg,
                                ArrayRef<unsigned> Idxs,
                                const Twine &NameStr,
                                BasicBlock *InsertAtEnd) {
  return new ExtractValueInst(Agg, Idxs, NameStr, InsertAtEnd);
}

/// Returns the type of the element that would be extracted
/// with an extractvalue instruction with the specified parameters.
///
/// Null is returned if the indices are invalid for the specified type.
static Type *getIndexedType(Type *Agg, ArrayRef<unsigned> Idxs);

using idx_iterator = const unsigned*;

inline idx_iterator idx_begin() const { return Indices.begin(); }
inline idx_iterator idx_end()   const { return Indices.end(); }
inline iterator_range<idx_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getAggregateOperand() {
  return getOperand(0);
}
const Value *getAggregateOperand() const {
  return getOperand(0);
}
static unsigned getAggregateOperandIndex() {
  return 0U;                      // get index for modifying correct operand
}

ArrayRef<unsigned> getIndices() const {
  return Indices;
}

unsigned getNumIndices() const {
  return (unsigned)Indices.size();
}

bool hasIndices() const {
  return true;
}

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

2750ExtractValueInst::ExtractValueInst(Value *Agg,
                                 ArrayRef<unsigned> Idxs,
                                 const Twine &NameStr,
                                 Instruction *InsertBefore)
: UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)),
                   ExtractValue, Agg, InsertBefore) {
init(Idxs, NameStr);
2757}

2759ExtractValueInst::ExtractValueInst(Value *Agg,
                                 ArrayRef<unsigned> Idxs,
                                 const Twine &NameStr,
                                 BasicBlock *InsertAtEnd)
: UnaryInstruction(checkGEPType(getIndexedType(Agg->getType(), Idxs)),
                   ExtractValue, Agg, InsertAtEnd) {
init(Idxs, NameStr);
2766}

2768//===----------------------------------------------------------------------===//
2769//                                InsertValueInst Class
2770//===----------------------------------------------------------------------===//

2772/// This instruction inserts a struct field of array element
2773/// value into an aggregate value.
2774///
2775class InsertValueInst : public Instruction {
SmallVector<unsigned, 4> Indices;

InsertValueInst(const InsertValueInst &IVI);

/// Constructors - Create a insertvalue instruction with a base aggregate
/// value, a value to insert, and a list of indices.  The first ctor can
/// optionally insert before an existing instruction, the second appends
/// the new instruction to the specified BasicBlock.
inline InsertValueInst(Value *Agg, Value *Val,
                       ArrayRef<unsigned> Idxs,
                       const Twine &NameStr,
                       Instruction *InsertBefore);
inline InsertValueInst(Value *Agg, Value *Val,
                       ArrayRef<unsigned> Idxs,
                       const Twine &NameStr, BasicBlock *InsertAtEnd);

/// Constructors - These two constructors are convenience methods because one
/// and two index insertvalue instructions are so common.
InsertValueInst(Value *Agg, Value *Val, unsigned Idx,
                const Twine &NameStr = "",
                Instruction *InsertBefore = nullptr);
InsertValueInst(Value *Agg, Value *Val, unsigned Idx, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

void init(Value *Agg, Value *Val, ArrayRef<unsigned> Idxs,
          const Twine &NameStr);

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

InsertValueInst *cloneImpl() const;

2809public:
// allocate space for exactly two operands
void *operator new(size_t s) {
  return User::operator new(s, 2);
}

static InsertValueInst *Create(Value *Agg, Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr = "",
                               Instruction *InsertBefore = nullptr) {
  return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertBefore);
}

static InsertValueInst *Create(Value *Agg, Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               BasicBlock *InsertAtEnd) {
  return new InsertValueInst(Agg, Val, Idxs, NameStr, InsertAtEnd);
}

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

using idx_iterator = const unsigned*;

inline idx_iterator idx_begin() const { return Indices.begin(); }
inline idx_iterator idx_end()   const { return Indices.end(); }
inline iterator_range<idx_iterator> indices() const {
  return make_range(idx_begin(), idx_end());
}

Value *getAggregateOperand() {
  return getOperand(0);
}
const Value *getAggregateOperand() const {
  return getOperand(0);
}
static unsigned getAggregateOperandIndex() {
  return 0U;                      // get index for modifying correct operand
}

Value *getInsertedValueOperand() {
  return getOperand(1);
}
const Value *getInsertedValueOperand() const {
  return getOperand(1);
}
static unsigned getInsertedValueOperandIndex() {
  return 1U;                      // get index for modifying correct operand
}

ArrayRef<unsigned> getIndices() const {
  return Indices;
}

unsigned getNumIndices() const {
  return (unsigned)Indices.size();
}

bool hasIndices() const {
  return true;
}

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

2881template <>
2882struct OperandTraits<InsertValueInst> :
public FixedNumOperandTraits<InsertValueInst, 2> {
2884};

2886InsertValueInst::InsertValueInst(Value *Agg,
                               Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               Instruction *InsertBefore)
: Instruction(Agg->getType(), InsertValue,
              OperandTraits<InsertValueInst>::op_begin(this),
              2, InsertBefore) {
init(Agg, Val, Idxs, NameStr);
2895}

2897InsertValueInst::InsertValueInst(Value *Agg,
                               Value *Val,
                               ArrayRef<unsigned> Idxs,
                               const Twine &NameStr,
                               BasicBlock *InsertAtEnd)
: Instruction(Agg->getType(), InsertValue,
              OperandTraits<InsertValueInst>::op_begin(this),
              2, InsertAtEnd) {
init(Agg, Val, Idxs, NameStr);
2906}

2908DEFINE_TRANSPARENT_OPERAND_ACCESSORS(InsertValueInst, Value)InsertValueInst::op_iterator InsertValueInst::op_begin() { return
 OperandTraits<InsertValueInst>::op_begin(this); } InsertValueInst
::const_op_iterator InsertValueInst::op_begin() const { return
 OperandTraits<InsertValueInst>::op_begin(const_cast<
InsertValueInst*>(this)); } InsertValueInst::op_iterator InsertValueInst
::op_end() { return OperandTraits<InsertValueInst>::op_end
(this); } InsertValueInst::const_op_iterator InsertValueInst::
op_end() const { return OperandTraits<InsertValueInst>::
op_end(const_cast<InsertValueInst*>(this)); } Value *InsertValueInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<InsertValueInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2908, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<InsertValueInst>::op_begin
(const_cast<InsertValueInst*>(this))[i_nocapture].get()
); } void InsertValueInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<InsertValueInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<InsertValueInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 2908, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
InsertValueInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned InsertValueInst::getNumOperands() const { return
 OperandTraits<InsertValueInst>::operands(this); } template
 <int Idx_nocapture> Use &InsertValueInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &InsertValueInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

2910//===----------------------------------------------------------------------===//
2911//                               PHINode Class
2912//===----------------------------------------------------------------------===//

2914// PHINode - The PHINode class is used to represent the magical mystical PHI
2915// node, that can not exist in nature, but can be synthesized in a computer
2916// scientist's overactive imagination.
2917//
2918class PHINode : public Instruction {
/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

PHINode(const PHINode &PN);

explicit PHINode(Type *Ty, unsigned NumReservedValues,
                 const Twine &NameStr = "",
                 Instruction *InsertBefore = nullptr)
  : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertBefore),
    ReservedSpace(NumReservedValues) {
  setName(NameStr);
  allocHungoffUses(ReservedSpace);
}

PHINode(Type *Ty, unsigned NumReservedValues, const Twine &NameStr,
        BasicBlock *InsertAtEnd)
  : Instruction(Ty, Instruction::PHI, nullptr, 0, InsertAtEnd),
    ReservedSpace(NumReservedValues) {
  setName(NameStr);
  allocHungoffUses(ReservedSpace);
}

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

PHINode *cloneImpl() const;

// allocHungoffUses - this is more complicated than the generic
// User::allocHungoffUses, because we have to allocate Uses for the incoming
// values and pointers to the incoming blocks, all in one allocation.
void allocHungoffUses(unsigned N) {
  User::allocHungoffUses(N, /* IsPhi */ true);
}

2955public:
/// Constructors - NumReservedValues is a hint for the number of incoming
/// edges that this phi node will have (use 0 if you really have no idea).
static PHINode *Create(Type *Ty, unsigned NumReservedValues,
                       const Twine &NameStr = "",
                       Instruction *InsertBefore = nullptr) {
  return new PHINode(Ty, NumReservedValues, NameStr, InsertBefore);
}

static PHINode *Create(Type *Ty, unsigned NumReservedValues,
                       const Twine &NameStr, BasicBlock *InsertAtEnd) {
  return new PHINode(Ty, NumReservedValues, NameStr, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Block iterator interface. This provides access to the list of incoming
// basic blocks, which parallels the list of incoming values.

using block_iterator = BasicBlock **;
using const_block_iterator = BasicBlock * const *;

block_iterator block_begin() {
  Use::UserRef *ref =
    reinterpret_cast<Use::UserRef*>(op_begin() + ReservedSpace);
  return reinterpret_cast<block_iterator>(ref + 1);
}

const_block_iterator block_begin() const {
  const Use::UserRef *ref =
    reinterpret_cast<const Use::UserRef*>(op_begin() + ReservedSpace);
  return reinterpret_cast<const_block_iterator>(ref + 1);
}

block_iterator block_end() {
  return block_begin() + getNumOperands();
}

const_block_iterator block_end() const {
  return block_begin() + getNumOperands();
}

iterator_range<block_iterator> blocks() {
  return make_range(block_begin(), block_end());
}

iterator_range<const_block_iterator> blocks() const {
  return make_range(block_begin(), block_end());
}

op_range incoming_values() { return operands(); }

const_op_range incoming_values() const { return operands(); }

/// Return the number of incoming edges
///
unsigned getNumIncomingValues() const { return getNumOperands(); }

/// Return incoming value number x
///
Value *getIncomingValue(unsigned i) const {
  return getOperand(i);
}
void setIncomingValue(unsigned i, Value *V) {
  assert(V && "PHI node got a null value!")(static_cast <bool> (V && "PHI node got a null value!"
) ? void (0) : __assert_fail ("V && \"PHI node got a null value!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3020, __extension__ __PRETTY_FUNCTION__));
  assert(getType() == V->getType() &&(static_cast <bool> (getType() == V->getType() &&
 "All operands to PHI node must be the same type as the PHI node!"
) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3022, __extension__ __PRETTY_FUNCTION__))
         "All operands to PHI node must be the same type as the PHI node!")(static_cast <bool> (getType() == V->getType() &&
 "All operands to PHI node must be the same type as the PHI node!"
) ? void (0) : __assert_fail ("getType() == V->getType() && \"All operands to PHI node must be the same type as the PHI node!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3022, __extension__ __PRETTY_FUNCTION__));
  setOperand(i, V);
}

static unsigned getOperandNumForIncomingValue(unsigned i) {
  return i;
}

static unsigned getIncomingValueNumForOperand(unsigned i) {
  return i;
}

/// Return incoming basic block number @p i.
///
BasicBlock *getIncomingBlock(unsigned i) const {
  return block_begin()[i];
}

/// Return incoming basic block corresponding
/// to an operand of the PHI.
///
BasicBlock *getIncomingBlock(const Use &U) const {
  assert(this == U.getUser() && "Iterator doesn't point to PHI's Uses?")(static_cast <bool> (this == U.getUser() && "Iterator doesn't point to PHI's Uses?"
) ? void (0) : __assert_fail ("this == U.getUser() && \"Iterator doesn't point to PHI's Uses?\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3044, __extension__ __PRETTY_FUNCTION__));
  return getIncomingBlock(unsigned(&U - op_begin()));
}

/// Return incoming basic block corresponding
/// to value use iterator.
///
BasicBlock *getIncomingBlock(Value::const_user_iterator I) const {
  return getIncomingBlock(I.getUse());
}

void setIncomingBlock(unsigned i, BasicBlock *BB) {
  assert(BB && "PHI node got a null basic block!")(static_cast <bool> (BB && "PHI node got a null basic block!"
) ? void (0) : __assert_fail ("BB && \"PHI node got a null basic block!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3056, __extension__ __PRETTY_FUNCTION__));
  block_begin()[i] = BB;
}

/// Add an incoming value to the end of the PHI list
///
void addIncoming(Value *V, BasicBlock *BB) {
  if (getNumOperands() == ReservedSpace)
    growOperands();  // Get more space!
  // Initialize some new operands.
  setNumHungOffUseOperands(getNumOperands() + 1);
  setIncomingValue(getNumOperands() - 1, V);
  setIncomingBlock(getNumOperands() - 1, BB);
}

/// Remove an incoming value.  This is useful if a
/// predecessor basic block is deleted.  The value removed is returned.
///
/// If the last incoming value for a PHI node is removed (and DeletePHIIfEmpty
/// is true), the PHI node is destroyed and any uses of it are replaced with
/// dummy values.  The only time there should be zero incoming values to a PHI
/// node is when the block is dead, so this strategy is sound.
///
Value *removeIncomingValue(unsigned Idx, bool DeletePHIIfEmpty = true);

Value *removeIncomingValue(const BasicBlock *BB, bool DeletePHIIfEmpty=true) {
  int Idx = getBasicBlockIndex(BB);
  assert(Idx >= 0 && "Invalid basic block argument to remove!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument to remove!"
) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument to remove!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3083, __extension__ __PRETTY_FUNCTION__));
  return removeIncomingValue(Idx, DeletePHIIfEmpty);
}

/// Return the first index of the specified basic
/// block in the value list for this PHI.  Returns -1 if no instance.
///
int getBasicBlockIndex(const BasicBlock *BB) const {
  for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
    if (block_begin()[i] == BB)
      return i;
  return -1;
}

Value *getIncomingValueForBlock(const BasicBlock *BB) const {
  int Idx = getBasicBlockIndex(BB);
  assert(Idx >= 0 && "Invalid basic block argument!")(static_cast <bool> (Idx >= 0 && "Invalid basic block argument!"
) ? void (0) : __assert_fail ("Idx >= 0 && \"Invalid basic block argument!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3099, __extension__ __PRETTY_FUNCTION__));
  return getIncomingValue(Idx);
}

/// If the specified PHI node always merges together the
/// same value, return the value, otherwise return null.
Value *hasConstantValue() const;

/// Whether the specified PHI node always merges
/// together the same value, assuming undefs are equal to a unique
/// non-undef value.
bool hasConstantOrUndefValue() const;

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

3120private:
void growOperands();
3122};

3124template <>
3125struct OperandTraits<PHINode> : public HungoffOperandTraits<2> {
3126};

3128DEFINE_TRANSPARENT_OPERAND_ACCESSORS(PHINode, Value)PHINode::op_iterator PHINode::op_begin() { return OperandTraits
<PHINode>::op_begin(this); } PHINode::const_op_iterator
 PHINode::op_begin() const { return OperandTraits<PHINode>
::op_begin(const_cast<PHINode*>(this)); } PHINode::op_iterator
 PHINode::op_end() { return OperandTraits<PHINode>::op_end
(this); } PHINode::const_op_iterator PHINode::op_end() const {
 return OperandTraits<PHINode>::op_end(const_cast<PHINode
*>(this)); } Value *PHINode::getOperand(unsigned i_nocapture
) const { (static_cast <bool> (i_nocapture < OperandTraits
<PHINode>::operands(this) && "getOperand() out of range!"
) ? void (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3128, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<PHINode>::op_begin(const_cast
<PHINode*>(this))[i_nocapture].get()); } void PHINode::
setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<PHINode>::
operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<PHINode>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3128, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
PHINode>::op_begin(this)[i_nocapture] = Val_nocapture; } unsigned
 PHINode::getNumOperands() const { return OperandTraits<PHINode
>::operands(this); } template <int Idx_nocapture> Use
 &PHINode::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
PHINode::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3130//===----------------------------------------------------------------------===//
3131//                           LandingPadInst Class
3132//===----------------------------------------------------------------------===//

3134//===---------------------------------------------------------------------------
3135/// The landingpad instruction holds all of the information
3136/// necessary to generate correct exception handling. The landingpad instruction
3137/// cannot be moved from the top of a landing pad block, which itself is
3138/// accessible only from the 'unwind' edge of an invoke. This uses the
3139/// SubclassData field in Value to store whether or not the landingpad is a
3140/// cleanup.
3141///
3142class LandingPadInst : public Instruction {
/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

LandingPadInst(const LandingPadInst &LP);

3149public:
enum ClauseType { Catch, Filter };

3152private:
explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                        const Twine &NameStr, Instruction *InsertBefore);
explicit LandingPadInst(Type *RetTy, unsigned NumReservedValues,
                        const Twine &NameStr, BasicBlock *InsertAtEnd);

// Allocate space for exactly zero operands.
void *operator new(size_t s) {
  return User::operator new(s);
}

void growOperands(unsigned Size);
void init(unsigned NumReservedValues, const Twine &NameStr);

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

LandingPadInst *cloneImpl() const;

3172public:
/// Constructors - NumReservedClauses is a hint for the number of incoming
/// clauses that this landingpad will have (use 0 if you really have no idea).
static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses,
                              const Twine &NameStr = "",
                              Instruction *InsertBefore = nullptr);
static LandingPadInst *Create(Type *RetTy, unsigned NumReservedClauses,
                              const Twine &NameStr, BasicBlock *InsertAtEnd);

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Return 'true' if this landingpad instruction is a
/// cleanup. I.e., it should be run when unwinding even if its landing pad
/// doesn't catch the exception.
bool isCleanup() const { return getSubclassDataFromInstruction() & 1; }

/// Indicate that this landingpad instruction is a cleanup.
void setCleanup(bool V) {
  setInstructionSubclassData((getSubclassDataFromInstruction() & ~1) |
                             (V ? 1 : 0));
}

/// Add a catch or filter clause to the landing pad.
void addClause(Constant *ClauseVal);

/// Get the value of the clause at index Idx. Use isCatch/isFilter to
/// determine what type of clause this is.
Constant *getClause(unsigned Idx) const {
  return cast<Constant>(getOperandList()[Idx]);
}

/// Return 'true' if the clause and index Idx is a catch clause.
bool isCatch(unsigned Idx) const {
  return !isa<ArrayType>(getOperandList()[Idx]->getType());
}

/// Return 'true' if the clause and index Idx is a filter clause.
bool isFilter(unsigned Idx) const {
  return isa<ArrayType>(getOperandList()[Idx]->getType());
}

/// Get the number of clauses for this landing pad.
unsigned getNumClauses() const { return getNumOperands(); }

/// Grow the size of the operand list to accommodate the new
/// number of clauses.
void reserveClauses(unsigned Size) { growOperands(Size); }

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

3230template <>
3231struct OperandTraits<LandingPadInst> : public HungoffOperandTraits<1> {
3232};

3234DEFINE_TRANSPARENT_OPERAND_ACCESSORS(LandingPadInst, Value)LandingPadInst::op_iterator LandingPadInst::op_begin() { return
 OperandTraits<LandingPadInst>::op_begin(this); } LandingPadInst
::const_op_iterator LandingPadInst::op_begin() const { return
 OperandTraits<LandingPadInst>::op_begin(const_cast<
LandingPadInst*>(this)); } LandingPadInst::op_iterator LandingPadInst
::op_end() { return OperandTraits<LandingPadInst>::op_end
(this); } LandingPadInst::const_op_iterator LandingPadInst::op_end
() const { return OperandTraits<LandingPadInst>::op_end
(const_cast<LandingPadInst*>(this)); } Value *LandingPadInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<LandingPadInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3234, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<LandingPadInst>::op_begin(
const_cast<LandingPadInst*>(this))[i_nocapture].get());
 } void LandingPadInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<LandingPadInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<LandingPadInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3234, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
LandingPadInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned LandingPadInst::getNumOperands() const { return OperandTraits
<LandingPadInst>::operands(this); } template <int Idx_nocapture
> Use &LandingPadInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &LandingPadInst::Op() const { return this->
OpFrom<Idx_nocapture>(this); }

3236//===----------------------------------------------------------------------===//
3237//                               ReturnInst Class
3238//===----------------------------------------------------------------------===//

3240//===---------------------------------------------------------------------------
3241/// Return a value (possibly void), from a function.  Execution
3242/// does not continue in this function any longer.
3243///
3244class ReturnInst : public TerminatorInst {
ReturnInst(const ReturnInst &RI);

3247private:
// ReturnInst constructors:
// ReturnInst()                  - 'ret void' instruction
// ReturnInst(    null)          - 'ret void' instruction
// ReturnInst(Value* X)          - 'ret X'    instruction
// ReturnInst(    null, Inst *I) - 'ret void' instruction, insert before I
// ReturnInst(Value* X, Inst *I) - 'ret X'    instruction, insert before I
// ReturnInst(    null, BB *B)   - 'ret void' instruction, insert @ end of B
// ReturnInst(Value* X, BB *B)   - 'ret X'    instruction, insert @ end of B
//
// NOTE: If the Value* passed is of type void then the constructor behaves as
// if it was passed NULL.
explicit ReturnInst(LLVMContext &C, Value *retVal = nullptr,
                    Instruction *InsertBefore = nullptr);
ReturnInst(LLVMContext &C, Value *retVal, BasicBlock *InsertAtEnd);
explicit ReturnInst(LLVMContext &C, BasicBlock *InsertAtEnd);

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

ReturnInst *cloneImpl() const;

3270public:
static ReturnInst* Create(LLVMContext &C, Value *retVal = nullptr,
                          Instruction *InsertBefore = nullptr) {
  return new(!!retVal) ReturnInst(C, retVal, InsertBefore);
}

static ReturnInst* Create(LLVMContext &C, Value *retVal,
                          BasicBlock *InsertAtEnd) {
  return new(!!retVal) ReturnInst(C, retVal, InsertAtEnd);
}

static ReturnInst* Create(LLVMContext &C, BasicBlock *InsertAtEnd) {
  return new(0) ReturnInst(C, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessor. Returns null if there is no return value.
Value *getReturnValue() const {
  return getNumOperands() != 0 ? getOperand(0) : nullptr;
}

unsigned getNumSuccessors() const { return 0; }

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

3303private:
friend TerminatorInst;

BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3307);
}

void setSuccessor(unsigned idx, BasicBlock *B) {
  llvm_unreachable("ReturnInst has no successors!")::llvm::llvm_unreachable_internal("ReturnInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3311);
}
3313};

3315template <>
3316struct OperandTraits<ReturnInst> : public VariadicOperandTraits<ReturnInst> {
3317};

3319DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ReturnInst, Value)ReturnInst::op_iterator ReturnInst::op_begin() { return OperandTraits
<ReturnInst>::op_begin(this); } ReturnInst::const_op_iterator
 ReturnInst::op_begin() const { return OperandTraits<ReturnInst
>::op_begin(const_cast<ReturnInst*>(this)); } ReturnInst
::op_iterator ReturnInst::op_end() { return OperandTraits<
ReturnInst>::op_end(this); } ReturnInst::const_op_iterator
 ReturnInst::op_end() const { return OperandTraits<ReturnInst
>::op_end(const_cast<ReturnInst*>(this)); } Value *ReturnInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<ReturnInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3319, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ReturnInst>::op_begin(const_cast
<ReturnInst*>(this))[i_nocapture].get()); } void ReturnInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<ReturnInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<ReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3319, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned ReturnInst::getNumOperands() const { return OperandTraits
<ReturnInst>::operands(this); } template <int Idx_nocapture
> Use &ReturnInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
ReturnInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3321//===----------------------------------------------------------------------===//
3322//                               BranchInst Class
3323//===----------------------------------------------------------------------===//

3325//===---------------------------------------------------------------------------
3326/// Conditional or Unconditional Branch instruction.
3327///
3328class BranchInst : public TerminatorInst {
/// Ops list - Branches are strange.  The operands are ordered:
///  [Cond, FalseDest,] TrueDest.  This makes some accessors faster because
/// they don't have to check for cond/uncond branchness. These are mostly
/// accessed relative from op_end().
BranchInst(const BranchInst &BI);
// BranchInst constructors (where {B, T, F} are blocks, and C is a condition):
// BranchInst(BB *B)                           - 'br B'
// BranchInst(BB* T, BB *F, Value *C)          - 'br C, T, F'
// BranchInst(BB* B, Inst *I)                  - 'br B'        insert before I
// BranchInst(BB* T, BB *F, Value *C, Inst *I) - 'br C, T, F', insert before I
// BranchInst(BB* B, BB *I)                    - 'br B'        insert at end
// BranchInst(BB* T, BB *F, Value *C, BB *I)   - 'br C, T, F', insert at end
explicit BranchInst(BasicBlock *IfTrue, Instruction *InsertBefore = nullptr);
BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
           Instruction *InsertBefore = nullptr);
BranchInst(BasicBlock *IfTrue, BasicBlock *InsertAtEnd);
BranchInst(BasicBlock *IfTrue, BasicBlock *IfFalse, Value *Cond,
           BasicBlock *InsertAtEnd);

void AssertOK();

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

BranchInst *cloneImpl() const;

3356public:
static BranchInst *Create(BasicBlock *IfTrue,
                          Instruction *InsertBefore = nullptr) {
  return new(1) BranchInst(IfTrue, InsertBefore);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
                          Value *Cond, Instruction *InsertBefore = nullptr) {
  return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertBefore);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *InsertAtEnd) {
  return new(1) BranchInst(IfTrue, InsertAtEnd);
}

static BranchInst *Create(BasicBlock *IfTrue, BasicBlock *IfFalse,
                          Value *Cond, BasicBlock *InsertAtEnd) {
  return new(3) BranchInst(IfTrue, IfFalse, Cond, InsertAtEnd);
}

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

bool isUnconditional() const { return getNumOperands() == 1; }
bool isConditional()   const { return getNumOperands() == 3; }

Value *getCondition() const {
  assert(isConditional() && "Cannot get condition of an uncond branch!")(static_cast <bool> (isConditional() && "Cannot get condition of an uncond branch!"
) ? void (0) : __assert_fail ("isConditional() && \"Cannot get condition of an uncond branch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3383, __extension__ __PRETTY_FUNCTION__));
  return Op<-3>();
}

void setCondition(Value *V) {
  assert(isConditional() && "Cannot set condition of unconditional branch!")(static_cast <bool> (isConditional() && "Cannot set condition of unconditional branch!"
) ? void (0) : __assert_fail ("isConditional() && \"Cannot set condition of unconditional branch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3388, __extension__ __PRETTY_FUNCTION__));
  Op<-3>() = V;
}

unsigned getNumSuccessors() const { return 1+isConditional(); }

BasicBlock *getSuccessor(unsigned i) const {
  assert(i < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (i < getNumSuccessors() &&
 "Successor # out of range for Branch!") ? void (0) : __assert_fail
 ("i < getNumSuccessors() && \"Successor # out of range for Branch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3395, __extension__ __PRETTY_FUNCTION__));
  return cast_or_null<BasicBlock>((&Op<-1>() - i)->get());
}

void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  assert(idx < getNumSuccessors() && "Successor # out of range for Branch!")(static_cast <bool> (idx < getNumSuccessors() &&
 "Successor # out of range for Branch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() && \"Successor # out of range for Branch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3400, __extension__ __PRETTY_FUNCTION__));
  *(&Op<-1>() - idx) = NewSucc;
}

/// Swap the successors of this branch instruction.
///
/// Swaps the successors of the branch instruction. This also swaps any
/// branch weight metadata associated with the instruction so that it
/// continues to map correctly to each operand.
void swapSuccessors();

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

3420template <>
3421struct OperandTraits<BranchInst> : public VariadicOperandTraits<BranchInst, 1> {
3422};

3424DEFINE_TRANSPARENT_OPERAND_ACCESSORS(BranchInst, Value)BranchInst::op_iterator BranchInst::op_begin() { return OperandTraits
<BranchInst>::op_begin(this); } BranchInst::const_op_iterator
 BranchInst::op_begin() const { return OperandTraits<BranchInst
>::op_begin(const_cast<BranchInst*>(this)); } BranchInst
::op_iterator BranchInst::op_end() { return OperandTraits<
BranchInst>::op_end(this); } BranchInst::const_op_iterator
 BranchInst::op_end() const { return OperandTraits<BranchInst
>::op_end(const_cast<BranchInst*>(this)); } Value *BranchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<BranchInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3424, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<BranchInst>::op_begin(const_cast
<BranchInst*>(this))[i_nocapture].get()); } void BranchInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<BranchInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<BranchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3424, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
BranchInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned BranchInst::getNumOperands() const { return OperandTraits
<BranchInst>::operands(this); } template <int Idx_nocapture
> Use &BranchInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
BranchInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3426//===----------------------------------------------------------------------===//
3427//                               SwitchInst Class
3428//===----------------------------------------------------------------------===//

3430//===---------------------------------------------------------------------------
3431/// Multiway switch
3432///
3433class SwitchInst : public TerminatorInst {
unsigned ReservedSpace;

// Operand[0]    = Value to switch on
// Operand[1]    = Default basic block destination
// Operand[2n  ] = Value to match
// Operand[2n+1] = BasicBlock to go to on match
SwitchInst(const SwitchInst &SI);

/// Create a new switch instruction, specifying a value to switch on and a
/// default destination. The number of additional cases can be specified here
/// to make memory allocation more efficient. This constructor can also
/// auto-insert before another instruction.
SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
           Instruction *InsertBefore);

/// Create a new switch instruction, specifying a value to switch on and a
/// default destination. The number of additional cases can be specified here
/// to make memory allocation more efficient. This constructor also
/// auto-inserts at the end of the specified BasicBlock.
SwitchInst(Value *Value, BasicBlock *Default, unsigned NumCases,
           BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t s) {
  return User::operator new(s);
}

void init(Value *Value, BasicBlock *Default, unsigned NumReserved);
void growOperands();

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

SwitchInst *cloneImpl() const;

3470public:
// -2
static const unsigned DefaultPseudoIndex = static_cast<unsigned>(~0L-1);

template <typename CaseHandleT> class CaseIteratorImpl;

/// A handle to a particular switch case. It exposes a convenient interface
/// to both the case value and the successor block.
///
/// We define this as a template and instantiate it to form both a const and
/// non-const handle.
template <typename SwitchInstT, typename ConstantIntT, typename BasicBlockT>
class CaseHandleImpl {
  // Directly befriend both const and non-const iterators.
  friend class SwitchInst::CaseIteratorImpl<
      CaseHandleImpl<SwitchInstT, ConstantIntT, BasicBlockT>>;

protected:
  // Expose the switch type we're parameterized with to the iterator.
  using SwitchInstType = SwitchInstT;

  SwitchInstT *SI;
  ptrdiff_t Index;

  CaseHandleImpl() = default;
  CaseHandleImpl(SwitchInstT *SI, ptrdiff_t Index) : SI(SI), Index(Index) {}

public:
  /// Resolves case value for current case.
  ConstantIntT *getCaseValue() const {
    assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3501, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3501, __extension__ __PRETTY_FUNCTION__));
    return reinterpret_cast<ConstantIntT *>(SI->getOperand(2 + Index * 2));
  }

  /// Resolves successor for current case.
  BasicBlockT *getCaseSuccessor() const {
    assert(((unsigned)Index < SI->getNumCases() ||(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3509, __extension__ __PRETTY_FUNCTION__))
            (unsigned)Index == DefaultPseudoIndex) &&(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3509, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> (((unsigned)Index < SI->getNumCases
() || (unsigned)Index == DefaultPseudoIndex) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index < SI->getNumCases() || (unsigned)Index == DefaultPseudoIndex) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3509, __extension__ __PRETTY_FUNCTION__));
    return SI->getSuccessor(getSuccessorIndex());
  }

  /// Returns number of current case.
  unsigned getCaseIndex() const { return Index; }

  /// Returns TerminatorInst's successor index for current case successor.
  unsigned getSuccessorIndex() const {
    assert(((unsigned)Index == DefaultPseudoIndex ||(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3520, __extension__ __PRETTY_FUNCTION__))
            (unsigned)Index < SI->getNumCases()) &&(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3520, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> (((unsigned)Index == DefaultPseudoIndex
 || (unsigned)Index < SI->getNumCases()) && "Index out the number of cases."
) ? void (0) : __assert_fail ("((unsigned)Index == DefaultPseudoIndex || (unsigned)Index < SI->getNumCases()) && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3520, __extension__ __PRETTY_FUNCTION__));
    return (unsigned)Index != DefaultPseudoIndex ? Index + 1 : 0;
  }

  bool operator==(const CaseHandleImpl &RHS) const {
    assert(SI == RHS.SI && "Incompatible operators.")(static_cast <bool> (SI == RHS.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("SI == RHS.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3525, __extension__ __PRETTY_FUNCTION__));
    return Index == RHS.Index;
  }
};

using ConstCaseHandle =
    CaseHandleImpl<const SwitchInst, const ConstantInt, const BasicBlock>;

class CaseHandle
    : public CaseHandleImpl<SwitchInst, ConstantInt, BasicBlock> {
  friend class SwitchInst::CaseIteratorImpl<CaseHandle>;

public:
  CaseHandle(SwitchInst *SI, ptrdiff_t Index) : CaseHandleImpl(SI, Index) {}

  /// Sets the new value for current case.
  void setValue(ConstantInt *V) {
    assert((unsigned)Index < SI->getNumCases() &&(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3543, __extension__ __PRETTY_FUNCTION__))
           "Index out the number of cases.")(static_cast <bool> ((unsigned)Index < SI->getNumCases
() && "Index out the number of cases.") ? void (0) : __assert_fail
 ("(unsigned)Index < SI->getNumCases() && \"Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3543, __extension__ __PRETTY_FUNCTION__));
    SI->setOperand(2 + Index*2, reinterpret_cast<Value*>(V));
  }

  /// Sets the new successor for current case.
  void setSuccessor(BasicBlock *S) {
    SI->setSuccessor(getSuccessorIndex(), S);
  }
};

template <typename CaseHandleT>
class CaseIteratorImpl
    : public iterator_facade_base<CaseIteratorImpl<CaseHandleT>,
                                  std::random_access_iterator_tag,
                                  CaseHandleT> {
  using SwitchInstT = typename CaseHandleT::SwitchInstType;

  CaseHandleT Case;

public:
  /// Default constructed iterator is in an invalid state until assigned to
  /// a case for a particular switch.
  CaseIteratorImpl() = default;

  /// Initializes case iterator for given SwitchInst and for given
  /// case number.
  CaseIteratorImpl(SwitchInstT *SI, unsigned CaseNum) : Case(SI, CaseNum) {}

  /// Initializes case iterator for given SwitchInst and for given
  /// TerminatorInst's successor index.
  static CaseIteratorImpl fromSuccessorIndex(SwitchInstT *SI,
                                             unsigned SuccessorIndex) {
    assert(SuccessorIndex < SI->getNumSuccessors() &&(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors
() && "Successor index # out of range!") ? void (0) :
 __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3576, __extension__ __PRETTY_FUNCTION__))
           "Successor index # out of range!")(static_cast <bool> (SuccessorIndex < SI->getNumSuccessors
() && "Successor index # out of range!") ? void (0) :
 __assert_fail ("SuccessorIndex < SI->getNumSuccessors() && \"Successor index # out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3576, __extension__ __PRETTY_FUNCTION__));
    return SuccessorIndex != 0 ? CaseIteratorImpl(SI, SuccessorIndex - 1)
                               : CaseIteratorImpl(SI, DefaultPseudoIndex);
  }

  /// Support converting to the const variant. This will be a no-op for const
  /// variant.
  operator CaseIteratorImpl<ConstCaseHandle>() const {
    return CaseIteratorImpl<ConstCaseHandle>(Case.SI, Case.Index);
  }

  CaseIteratorImpl &operator+=(ptrdiff_t N) {
    // Check index correctness after addition.
    // Note: Index == getNumCases() means end().
    assert(Case.Index + N >= 0 &&(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3592, __extension__ __PRETTY_FUNCTION__))
           (unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3592, __extension__ __PRETTY_FUNCTION__))
           "Case.Index out the number of cases.")(static_cast <bool> (Case.Index + N >= 0 && (
unsigned)(Case.Index + N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index + N >= 0 && (unsigned)(Case.Index + N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3592, __extension__ __PRETTY_FUNCTION__));
    Case.Index += N;
    return *this;
  }
  CaseIteratorImpl &operator-=(ptrdiff_t N) {
    // Check index correctness after subtraction.
    // Note: Case.Index == getNumCases() means end().
    assert(Case.Index - N >= 0 &&(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3601, __extension__ __PRETTY_FUNCTION__))
           (unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3601, __extension__ __PRETTY_FUNCTION__))
           "Case.Index out the number of cases.")(static_cast <bool> (Case.Index - N >= 0 && (
unsigned)(Case.Index - N) <= Case.SI->getNumCases() &&
 "Case.Index out the number of cases.") ? void (0) : __assert_fail
 ("Case.Index - N >= 0 && (unsigned)(Case.Index - N) <= Case.SI->getNumCases() && \"Case.Index out the number of cases.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3601, __extension__ __PRETTY_FUNCTION__));
    Case.Index -= N;
    return *this;
  }
  ptrdiff_t operator-(const CaseIteratorImpl &RHS) const {
    assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3606, __extension__ __PRETTY_FUNCTION__));
    return Case.Index - RHS.Case.Index;
  }
  bool operator==(const CaseIteratorImpl &RHS) const {
    return Case == RHS.Case;
  }
  bool operator<(const CaseIteratorImpl &RHS) const {
    assert(Case.SI == RHS.Case.SI && "Incompatible operators.")(static_cast <bool> (Case.SI == RHS.Case.SI && "Incompatible operators."
) ? void (0) : __assert_fail ("Case.SI == RHS.Case.SI && \"Incompatible operators.\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3613, __extension__ __PRETTY_FUNCTION__));
    return Case.Index < RHS.Case.Index;
  }
  CaseHandleT &operator*() { return Case; }
  const CaseHandleT &operator*() const { return Case; }
};

using CaseIt = CaseIteratorImpl<CaseHandle>;
using ConstCaseIt = CaseIteratorImpl<ConstCaseHandle>;

static SwitchInst *Create(Value *Value, BasicBlock *Default,
                          unsigned NumCases,
                          Instruction *InsertBefore = nullptr) {
  return new SwitchInst(Value, Default, NumCases, InsertBefore);
}

static SwitchInst *Create(Value *Value, BasicBlock *Default,
                          unsigned NumCases, BasicBlock *InsertAtEnd) {
  return new SwitchInst(Value, Default, NumCases, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for Switch stmt
Value *getCondition() const { return getOperand(0); }
void setCondition(Value *V) { setOperand(0, V); }

BasicBlock *getDefaultDest() const {
  return cast<BasicBlock>(getOperand(1));
}

void setDefaultDest(BasicBlock *DefaultCase) {
  setOperand(1, reinterpret_cast<Value*>(DefaultCase));
}

/// Return the number of 'cases' in this switch instruction, excluding the
/// default case.
unsigned getNumCases() const {
  return getNumOperands()/2 - 1;
}

/// Returns a read/write iterator that points to the first case in the
/// SwitchInst.
CaseIt case_begin() {
  return CaseIt(this, 0);
}

/// Returns a read-only iterator that points to the first case in the
/// SwitchInst.
ConstCaseIt case_begin() const {
  return ConstCaseIt(this, 0);
}

/// Returns a read/write iterator that points one past the last in the
/// SwitchInst.
CaseIt case_end() {
  return CaseIt(this, getNumCases());
}

/// Returns a read-only iterator that points one past the last in the
/// SwitchInst.
ConstCaseIt case_end() const {
  return ConstCaseIt(this, getNumCases());
}

/// Iteration adapter for range-for loops.
iterator_range<CaseIt> cases() {
  return make_range(case_begin(), case_end());
}

/// Constant iteration adapter for range-for loops.
iterator_range<ConstCaseIt> cases() const {
  return make_range(case_begin(), case_end());
}

/// Returns an iterator that points to the default case.
/// Note: this iterator allows to resolve successor only. Attempt
/// to resolve case value causes an assertion.
/// Also note, that increment and decrement also causes an assertion and
/// makes iterator invalid.
CaseIt case_default() {
  return CaseIt(this, DefaultPseudoIndex);
}
ConstCaseIt case_default() const {
  return ConstCaseIt(this, DefaultPseudoIndex);
}

/// Search all of the case values for the specified constant. If it is
/// explicitly handled, return the case iterator of it, otherwise return
/// default case iterator to indicate that it is handled by the default
/// handler.
CaseIt findCaseValue(const ConstantInt *C) {
  CaseIt I = llvm::find_if(
      cases(), [C](CaseHandle &Case) { return Case.getCaseValue() == C; });
  if (I != case_end())
    return I;

  return case_default();
}
ConstCaseIt findCaseValue(const ConstantInt *C) const {
  ConstCaseIt I = llvm::find_if(cases(), [C](ConstCaseHandle &Case) {
    return Case.getCaseValue() == C;
  });
  if (I != case_end())
    return I;

  return case_default();
}

/// Finds the unique case value for a given successor. Returns null if the
/// successor is not found, not unique, or is the default case.
ConstantInt *findCaseDest(BasicBlock *BB) {
  if (BB == getDefaultDest())
    return nullptr;

  ConstantInt *CI = nullptr;
  for (auto Case : cases()) {
    if (Case.getCaseSuccessor() != BB)
      continue;

    if (CI)
      return nullptr; // Multiple cases lead to BB.

    CI = Case.getCaseValue();
  }

  return CI;
}

/// Add an entry to the switch instruction.
/// Note:
/// This action invalidates case_end(). Old case_end() iterator will
/// point to the added case.
void addCase(ConstantInt *OnVal, BasicBlock *Dest);

/// This method removes the specified case and its successor from the switch
/// instruction. Note that this operation may reorder the remaining cases at
/// index idx and above.
/// Note:
/// This action invalidates iterators for all cases following the one removed,
/// including the case_end() iterator. It returns an iterator for the next
/// case.
CaseIt removeCase(CaseIt I);

unsigned getNumSuccessors() const { return getNumOperands()/2; }
BasicBlock *getSuccessor(unsigned idx) const {
  assert(idx < getNumSuccessors() &&"Successor idx out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() &&
"Successor idx out of range for switch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() &&\"Successor idx out of range for switch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3760, __extension__ __PRETTY_FUNCTION__));
  return cast<BasicBlock>(getOperand(idx*2+1));
}
void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  assert(idx < getNumSuccessors() && "Successor # out of range for switch!")(static_cast <bool> (idx < getNumSuccessors() &&
 "Successor # out of range for switch!") ? void (0) : __assert_fail
 ("idx < getNumSuccessors() && \"Successor # out of range for switch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3764, __extension__ __PRETTY_FUNCTION__));
  setOperand(idx * 2 + 1, NewSucc);
}

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

3777template <>
3778struct OperandTraits<SwitchInst> : public HungoffOperandTraits<2> {
3779};

3781DEFINE_TRANSPARENT_OPERAND_ACCESSORS(SwitchInst, Value)SwitchInst::op_iterator SwitchInst::op_begin() { return OperandTraits
<SwitchInst>::op_begin(this); } SwitchInst::const_op_iterator
 SwitchInst::op_begin() const { return OperandTraits<SwitchInst
>::op_begin(const_cast<SwitchInst*>(this)); } SwitchInst
::op_iterator SwitchInst::op_end() { return OperandTraits<
SwitchInst>::op_end(this); } SwitchInst::const_op_iterator
 SwitchInst::op_end() const { return OperandTraits<SwitchInst
>::op_end(const_cast<SwitchInst*>(this)); } Value *SwitchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<SwitchInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3781, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<SwitchInst>::op_begin(const_cast
<SwitchInst*>(this))[i_nocapture].get()); } void SwitchInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<SwitchInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<SwitchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3781, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
SwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned SwitchInst::getNumOperands() const { return OperandTraits
<SwitchInst>::operands(this); } template <int Idx_nocapture
> Use &SwitchInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
SwitchInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

3783//===----------------------------------------------------------------------===//
3784//                             IndirectBrInst Class
3785//===----------------------------------------------------------------------===//

3787//===---------------------------------------------------------------------------
3788/// Indirect Branch Instruction.
3789///
3790class IndirectBrInst : public TerminatorInst {
unsigned ReservedSpace;

// Operand[0]   = Address to jump to
// Operand[n+1] = n-th destination
IndirectBrInst(const IndirectBrInst &IBI);

/// Create a new indirectbr instruction, specifying an
/// Address to jump to.  The number of expected destinations can be specified
/// here to make memory allocation more efficient.  This constructor can also
/// autoinsert before another instruction.
IndirectBrInst(Value *Address, unsigned NumDests, Instruction *InsertBefore);

/// Create a new indirectbr instruction, specifying an
/// Address to jump to.  The number of expected destinations can be specified
/// here to make memory allocation more efficient.  This constructor also
/// autoinserts at the end of the specified BasicBlock.
IndirectBrInst(Value *Address, unsigned NumDests, BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t s) {
  return User::operator new(s);
}

void init(Value *Address, unsigned NumDests);
void growOperands();

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

IndirectBrInst *cloneImpl() const;

3823public:
static IndirectBrInst *Create(Value *Address, unsigned NumDests,
                              Instruction *InsertBefore = nullptr) {
  return new IndirectBrInst(Address, NumDests, InsertBefore);
}

static IndirectBrInst *Create(Value *Address, unsigned NumDests,
                              BasicBlock *InsertAtEnd) {
  return new IndirectBrInst(Address, NumDests, InsertAtEnd);
}

/// Provide fast operand accessors.
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for IndirectBrInst instruction.
Value *getAddress() { return getOperand(0); }
const Value *getAddress() const { return getOperand(0); }
void setAddress(Value *V) { setOperand(0, V); }

/// return the number of possible destinations in this
/// indirectbr instruction.
unsigned getNumDestinations() const { return getNumOperands()-1; }

/// Return the specified destination.
BasicBlock *getDestination(unsigned i) { return getSuccessor(i); }
const BasicBlock *getDestination(unsigned i) const { return getSuccessor(i); }

/// Add a destination.
///
void addDestination(BasicBlock *Dest);

/// This method removes the specified successor from the
/// indirectbr instruction.
void removeDestination(unsigned i);

unsigned getNumSuccessors() const { return getNumOperands()-1; }
BasicBlock *getSuccessor(unsigned i) const {
  return cast<BasicBlock>(getOperand(i+1));
}
void setSuccessor(unsigned i, BasicBlock *NewSucc) {
  setOperand(i + 1, NewSucc);
}

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

3875template <>
3876struct OperandTraits<IndirectBrInst> : public HungoffOperandTraits<1> {
3877};

3879DEFINE_TRANSPARENT_OPERAND_ACCESSORS(IndirectBrInst, Value)IndirectBrInst::op_iterator IndirectBrInst::op_begin() { return
 OperandTraits<IndirectBrInst>::op_begin(this); } IndirectBrInst
::const_op_iterator IndirectBrInst::op_begin() const { return
 OperandTraits<IndirectBrInst>::op_begin(const_cast<
IndirectBrInst*>(this)); } IndirectBrInst::op_iterator IndirectBrInst
::op_end() { return OperandTraits<IndirectBrInst>::op_end
(this); } IndirectBrInst::const_op_iterator IndirectBrInst::op_end
() const { return OperandTraits<IndirectBrInst>::op_end
(const_cast<IndirectBrInst*>(this)); } Value *IndirectBrInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<IndirectBrInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3879, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<IndirectBrInst>::op_begin(
const_cast<IndirectBrInst*>(this))[i_nocapture].get());
 } void IndirectBrInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<IndirectBrInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<IndirectBrInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 3879, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
IndirectBrInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned IndirectBrInst::getNumOperands() const { return OperandTraits
<IndirectBrInst>::operands(this); } template <int Idx_nocapture
> Use &IndirectBrInst::Op() { return this->OpFrom<
Idx_nocapture>(this); } template <int Idx_nocapture>
 const Use &IndirectBrInst::Op() const { return this->
OpFrom<Idx_nocapture>(this); }

3881//===----------------------------------------------------------------------===//
3882//                               InvokeInst Class
3883//===----------------------------------------------------------------------===//

3885/// Invoke instruction.  The SubclassData field is used to hold the
3886/// calling convention of the call.
3887///
3888class InvokeInst : public CallBase<InvokeInst> {
friend class OperandBundleUser<InvokeInst, User::op_iterator>;

InvokeInst(const InvokeInst &BI);

/// Construct an InvokeInst given a range of arguments.
///
/// Construct an InvokeInst from a range of arguments
inline InvokeInst(Value *Func, BasicBlock *IfNormal, BasicBlock *IfException,
                  ArrayRef<Value *> Args, ArrayRef<OperandBundleDef> Bundles,
                  unsigned Values, const Twine &NameStr,
                  Instruction *InsertBefore)
    : InvokeInst(cast<FunctionType>(
                     cast<PointerType>(Func->getType())->getElementType()),
                 Func, IfNormal, IfException, Args, Bundles, Values, NameStr,
                 InsertBefore) {}

inline InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                  BasicBlock *IfException, ArrayRef<Value *> Args,
                  ArrayRef<OperandBundleDef> Bundles, unsigned Values,
                  const Twine &NameStr, Instruction *InsertBefore);
/// Construct an InvokeInst given a range of arguments.
///
/// Construct an InvokeInst from a range of arguments
inline InvokeInst(Value *Func, BasicBlock *IfNormal, BasicBlock *IfException,
                  ArrayRef<Value *> Args, ArrayRef<OperandBundleDef> Bundles,
                  unsigned Values, const Twine &NameStr,
                  BasicBlock *InsertAtEnd);


void init(Value *Func, BasicBlock *IfNormal, BasicBlock *IfException,
          ArrayRef<Value *> Args, ArrayRef<OperandBundleDef> Bundles,
          const Twine &NameStr) {
  init(cast<FunctionType>(
           cast<PointerType>(Func->getType())->getElementType()),
       Func, IfNormal, IfException, Args, Bundles, NameStr);
}

void init(FunctionType *FTy, Value *Func, BasicBlock *IfNormal,
          BasicBlock *IfException, ArrayRef<Value *> Args,
          ArrayRef<OperandBundleDef> Bundles, const Twine &NameStr);

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

InvokeInst *cloneImpl() const;

3936public:
static constexpr int ArgOffset = 3;
static InvokeInst *Create(Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  return Create(cast<FunctionType>(
                    cast<PointerType>(Func->getType())->getElementType()),
                Func, IfNormal, IfException, Args, None, NameStr,
                InsertBefore);
}

static InvokeInst *Create(Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  return Create(cast<FunctionType>(
                    cast<PointerType>(Func->getType())->getElementType()),
                Func, IfNormal, IfException, Args, Bundles, NameStr,
                InsertBefore);
}

static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          const Twine &NameStr,
                          Instruction *InsertBefore = nullptr) {
  unsigned Values = unsigned(Args.size()) + 3;
  return new (Values) InvokeInst(Ty, Func, IfNormal, IfException, Args, None,
                                 Values, NameStr, InsertBefore);
}

static InvokeInst *Create(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles = None,
                          const Twine &NameStr = "",
                          Instruction *InsertBefore = nullptr) {
  unsigned Values = unsigned(Args.size()) + CountBundleInputs(Bundles) + 3;
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (Values, DescriptorBytes)
      InvokeInst(Ty, Func, IfNormal, IfException, Args, Bundles, Values,
                 NameStr, InsertBefore);
}

static InvokeInst *Create(Value *Func,
                          BasicBlock *IfNormal, BasicBlock *IfException,
                          ArrayRef<Value *> Args, const Twine &NameStr,
                          BasicBlock *InsertAtEnd) {
  unsigned Values = unsigned(Args.size()) + 3;
  return new (Values) InvokeInst(Func, IfNormal, IfException, Args, None,
                                 Values, NameStr, InsertAtEnd);
}

static InvokeInst *Create(Value *Func, BasicBlock *IfNormal,
                          BasicBlock *IfException, ArrayRef<Value *> Args,
                          ArrayRef<OperandBundleDef> Bundles,
                          const Twine &NameStr, BasicBlock *InsertAtEnd) {
  unsigned Values = unsigned(Args.size()) + CountBundleInputs(Bundles) + 3;
  unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);

  return new (Values, DescriptorBytes)
      InvokeInst(Func, IfNormal, IfException, Args, Bundles, Values, NameStr,
                 InsertAtEnd);
}

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

/// 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() {
  addAttribute(AttributeList::FunctionIndex, Attribute::NoUnwind);
}

/// Return the function called, or null if this is an
/// indirect function invocation.
///
Function *getCalledFunction() const {
  return dyn_cast<Function>(Op<-3>());
}

/// Get a pointer to the function that is invoked by this
/// instruction
const Value *getCalledValue() const { return Op<-3>(); }
      Value *getCalledValue()       { return Op<-3>(); }

/// Set the function called.
void setCalledFunction(Value* Fn) {
  setCalledFunction(
      cast<FunctionType>(cast<PointerType>(Fn->getType())->getElementType()),
      Fn);
}
void setCalledFunction(FunctionType *FTy, Value *Fn) {
  this->FTy = FTy;
  assert(FTy == cast<FunctionType>((static_cast <bool> (FTy == cast<FunctionType>( cast
<PointerType>(Fn->getType())->getElementType())) ?
 void (0) : __assert_fail ("FTy == cast<FunctionType>( cast<PointerType>(Fn->getType())->getElementType())"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4041, __extension__ __PRETTY_FUNCTION__))
                    cast<PointerType>(Fn->getType())->getElementType()))(static_cast <bool> (FTy == cast<FunctionType>( cast
<PointerType>(Fn->getType())->getElementType())) ?
 void (0) : __assert_fail ("FTy == cast<FunctionType>( cast<PointerType>(Fn->getType())->getElementType())"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4041, __extension__ __PRETTY_FUNCTION__));
  Op<-3>() = Fn;
}

// get*Dest - Return the destination basic blocks...
BasicBlock *getNormalDest() const {
  return cast<BasicBlock>(Op<-2>());
}
BasicBlock *getUnwindDest() const {
  return cast<BasicBlock>(Op<-1>());
}
void setNormalDest(BasicBlock *B) {
  Op<-2>() = reinterpret_cast<Value*>(B);
}
void setUnwindDest(BasicBlock *B) {
  Op<-1>() = reinterpret_cast<Value*>(B);
}

/// Get the landingpad instruction from the landing pad
/// block (the unwind destination).
LandingPadInst *getLandingPadInst() const;

BasicBlock *getSuccessor(unsigned i) const {
  assert(i < 2 && "Successor # out of range for invoke!")(static_cast <bool> (i < 2 && "Successor # out of range for invoke!"
) ? void (0) : __assert_fail ("i < 2 && \"Successor # out of range for invoke!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4064, __extension__ __PRETTY_FUNCTION__));
  return i == 0 ? getNormalDest() : getUnwindDest();
}

void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  assert(idx < 2 && "Successor # out of range for invoke!")(static_cast <bool> (idx < 2 && "Successor # out of range for invoke!"
) ? void (0) : __assert_fail ("idx < 2 && \"Successor # out of range for invoke!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4069, __extension__ __PRETTY_FUNCTION__));
  *(&Op<-2>() + idx) = reinterpret_cast<Value*>(NewSucc);
}

unsigned getNumSuccessors() const { return 2; }

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

4083private:

// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}
4090};

4092template <>
4093struct OperandTraits<CallBase<InvokeInst>>
  : public VariadicOperandTraits<CallBase<InvokeInst>, 3> {};

4096InvokeInst::InvokeInst(FunctionType *Ty, Value *Func, BasicBlock *IfNormal,
                     BasicBlock *IfException, ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, unsigned Values,
                     const Twine &NameStr, Instruction *InsertBefore)
  : CallBase<InvokeInst>(Ty->getReturnType(), Instruction::Invoke,
                         OperandTraits<CallBase<InvokeInst>>::op_end(this) -
                             Values,
                         Values, InsertBefore) {
init(Ty, Func, IfNormal, IfException, Args, Bundles, NameStr);
4105}

4107InvokeInst::InvokeInst(Value *Func, BasicBlock *IfNormal,
                     BasicBlock *IfException, ArrayRef<Value *> Args,
                     ArrayRef<OperandBundleDef> Bundles, unsigned Values,
                     const Twine &NameStr, BasicBlock *InsertAtEnd)
  : CallBase<InvokeInst>(
        cast<FunctionType>(
            cast<PointerType>(Func->getType())->getElementType())
            ->getReturnType(),
        Instruction::Invoke,
        OperandTraits<CallBase<InvokeInst>>::op_end(this) - Values, Values,
        InsertAtEnd) {
init(Func, IfNormal, IfException, Args, Bundles, NameStr);
4119}


4122//===----------------------------------------------------------------------===//
4123//                              ResumeInst Class
4124//===----------------------------------------------------------------------===//

4126//===---------------------------------------------------------------------------
4127/// Resume the propagation of an exception.
4128///
4129class ResumeInst : public TerminatorInst {
ResumeInst(const ResumeInst &RI);

explicit ResumeInst(Value *Exn, Instruction *InsertBefore=nullptr);
ResumeInst(Value *Exn, BasicBlock *InsertAtEnd);

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

ResumeInst *cloneImpl() const;

4141public:
static ResumeInst *Create(Value *Exn, Instruction *InsertBefore = nullptr) {
  return new(1) ResumeInst(Exn, InsertBefore);
}

static ResumeInst *Create(Value *Exn, BasicBlock *InsertAtEnd) {
  return new(1) ResumeInst(Exn, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessor.
Value *getValue() const { return Op<0>(); }

unsigned getNumSuccessors() const { return 0; }

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

4166private:
friend TerminatorInst;

BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4170);
}

void setSuccessor(unsigned idx, BasicBlock *NewSucc) {
  llvm_unreachable("ResumeInst has no successors!")::llvm::llvm_unreachable_internal("ResumeInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4174);
}
4176};

4178template <>
4179struct OperandTraits<ResumeInst> :
  public FixedNumOperandTraits<ResumeInst, 1> {
4181};

4183DEFINE_TRANSPARENT_OPERAND_ACCESSORS(ResumeInst, Value)ResumeInst::op_iterator ResumeInst::op_begin() { return OperandTraits
<ResumeInst>::op_begin(this); } ResumeInst::const_op_iterator
 ResumeInst::op_begin() const { return OperandTraits<ResumeInst
>::op_begin(const_cast<ResumeInst*>(this)); } ResumeInst
::op_iterator ResumeInst::op_end() { return OperandTraits<
ResumeInst>::op_end(this); } ResumeInst::const_op_iterator
 ResumeInst::op_end() const { return OperandTraits<ResumeInst
>::op_end(const_cast<ResumeInst*>(this)); } Value *ResumeInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<ResumeInst>::operands
(this) && "getOperand() out of range!") ? void (0) : __assert_fail
 ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4183, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<ResumeInst>::op_begin(const_cast
<ResumeInst*>(this))[i_nocapture].get()); } void ResumeInst
::setOperand(unsigned i_nocapture, Value *Val_nocapture) { (static_cast
 <bool> (i_nocapture < OperandTraits<ResumeInst>
::operands(this) && "setOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<ResumeInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4183, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
ResumeInst>::op_begin(this)[i_nocapture] = Val_nocapture; }
 unsigned ResumeInst::getNumOperands() const { return OperandTraits
<ResumeInst>::operands(this); } template <int Idx_nocapture
> Use &ResumeInst::Op() { return this->OpFrom<Idx_nocapture
>(this); } template <int Idx_nocapture> const Use &
ResumeInst::Op() const { return this->OpFrom<Idx_nocapture
>(this); }

4185//===----------------------------------------------------------------------===//
4186//                         CatchSwitchInst Class
4187//===----------------------------------------------------------------------===//
4188class CatchSwitchInst : public TerminatorInst {
/// The number of operands actually allocated.  NumOperands is
/// the number actually in use.
unsigned ReservedSpace;

// Operand[0] = Outer scope
// Operand[1] = Unwind block destination
// Operand[n] = BasicBlock to go to on match
CatchSwitchInst(const CatchSwitchInst &CSI);

/// Create a new switch instruction, specifying a
/// default destination.  The number of additional handlers can be specified
/// here to make memory allocation more efficient.
/// This constructor can also autoinsert before another instruction.
CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                unsigned NumHandlers, const Twine &NameStr,
                Instruction *InsertBefore);

/// Create a new switch instruction, specifying a
/// default destination.  The number of additional handlers can be specified
/// here to make memory allocation more efficient.
/// This constructor also autoinserts at the end of the specified BasicBlock.
CatchSwitchInst(Value *ParentPad, BasicBlock *UnwindDest,
                unsigned NumHandlers, const Twine &NameStr,
                BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t s) { return User::operator new(s); }

void init(Value *ParentPad, BasicBlock *UnwindDest, unsigned NumReserved);
void growOperands(unsigned Size);

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

CatchSwitchInst *cloneImpl() const;

4226public:
static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumHandlers,
                               const Twine &NameStr = "",
                               Instruction *InsertBefore = nullptr) {
  return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr,
                             InsertBefore);
}

static CatchSwitchInst *Create(Value *ParentPad, BasicBlock *UnwindDest,
                               unsigned NumHandlers, const Twine &NameStr,
                               BasicBlock *InsertAtEnd) {
  return new CatchSwitchInst(ParentPad, UnwindDest, NumHandlers, NameStr,
                             InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

// Accessor Methods for CatchSwitch stmt
Value *getParentPad() const { return getOperand(0); }
void setParentPad(Value *ParentPad) { setOperand(0, ParentPad); }

// Accessor Methods for CatchSwitch stmt
bool hasUnwindDest() const { return getSubclassDataFromInstruction() & 1; }
bool unwindsToCaller() const { return !hasUnwindDest(); }
BasicBlock *getUnwindDest() const {
  if (hasUnwindDest())
    return cast<BasicBlock>(getOperand(1));
  return nullptr;
}
void setUnwindDest(BasicBlock *UnwindDest) {
  assert(UnwindDest)(static_cast <bool> (UnwindDest) ? void (0) : __assert_fail
 ("UnwindDest", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4258, __extension__ __PRETTY_FUNCTION__));
  assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail
 ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4259, __extension__ __PRETTY_FUNCTION__));
  setOperand(1, UnwindDest);
}

/// return the number of 'handlers' in this catchswitch
/// instruction, except the default handler
unsigned getNumHandlers() const {
  if (hasUnwindDest())
    return getNumOperands() - 2;
  return getNumOperands() - 1;
}

4271private:
static BasicBlock *handler_helper(Value *V) { return cast<BasicBlock>(V); }
static const BasicBlock *handler_helper(const Value *V) {
  return cast<BasicBlock>(V);
}

4277public:
using DerefFnTy = BasicBlock *(*)(Value *);
using handler_iterator = mapped_iterator<op_iterator, DerefFnTy>;
using handler_range = iterator_range<handler_iterator>;
using ConstDerefFnTy = const BasicBlock *(*)(const Value *);
using const_handler_iterator =
    mapped_iterator<const_op_iterator, ConstDerefFnTy>;
using const_handler_range = iterator_range<const_handler_iterator>;

/// Returns an iterator that points to the first handler in CatchSwitchInst.
handler_iterator handler_begin() {
  op_iterator It = op_begin() + 1;
  if (hasUnwindDest())
    ++It;
  return handler_iterator(It, DerefFnTy(handler_helper));
}

/// Returns an iterator that points to the first handler in the
/// CatchSwitchInst.
const_handler_iterator handler_begin() const {
  const_op_iterator It = op_begin() + 1;
  if (hasUnwindDest())
    ++It;
  return const_handler_iterator(It, ConstDerefFnTy(handler_helper));
}

/// Returns a read-only iterator that points one past the last
/// handler in the CatchSwitchInst.
handler_iterator handler_end() {
  return handler_iterator(op_end(), DerefFnTy(handler_helper));
}

/// Returns an iterator that points one past the last handler in the
/// CatchSwitchInst.
const_handler_iterator handler_end() const {
  return const_handler_iterator(op_end(), ConstDerefFnTy(handler_helper));
}

/// iteration adapter for range-for loops.
handler_range handlers() {
  return make_range(handler_begin(), handler_end());
}

/// iteration adapter for range-for loops.
const_handler_range handlers() const {
  return make_range(handler_begin(), handler_end());
}

/// Add an entry to the switch instruction...
/// Note:
/// This action invalidates handler_end(). Old handler_end() iterator will
/// point to the added handler.
void addHandler(BasicBlock *Dest);

void removeHandler(handler_iterator HI);

unsigned getNumSuccessors() const { return getNumOperands() - 1; }
BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4336, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4336, __extension__ __PRETTY_FUNCTION__));
  return cast<BasicBlock>(getOperand(Idx + 1));
}
void setSuccessor(unsigned Idx, BasicBlock *NewSucc) {
  assert(Idx < getNumSuccessors() &&(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4341, __extension__ __PRETTY_FUNCTION__))
         "Successor # out of range for catchswitch!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchswitch!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchswitch!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4341, __extension__ __PRETTY_FUNCTION__));
  setOperand(Idx + 1, NewSucc);
}

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

4354template <>
4355struct OperandTraits<CatchSwitchInst> : public HungoffOperandTraits<2> {};

4357DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchSwitchInst, Value)CatchSwitchInst::op_iterator CatchSwitchInst::op_begin() { return
 OperandTraits<CatchSwitchInst>::op_begin(this); } CatchSwitchInst
::const_op_iterator CatchSwitchInst::op_begin() const { return
 OperandTraits<CatchSwitchInst>::op_begin(const_cast<
CatchSwitchInst*>(this)); } CatchSwitchInst::op_iterator CatchSwitchInst
::op_end() { return OperandTraits<CatchSwitchInst>::op_end
(this); } CatchSwitchInst::const_op_iterator CatchSwitchInst::
op_end() const { return OperandTraits<CatchSwitchInst>::
op_end(const_cast<CatchSwitchInst*>(this)); } Value *CatchSwitchInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<CatchSwitchInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4357, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CatchSwitchInst>::op_begin
(const_cast<CatchSwitchInst*>(this))[i_nocapture].get()
); } void CatchSwitchInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<CatchSwitchInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchSwitchInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4357, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CatchSwitchInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CatchSwitchInst::getNumOperands() const { return
 OperandTraits<CatchSwitchInst>::operands(this); } template
 <int Idx_nocapture> Use &CatchSwitchInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &CatchSwitchInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

4359//===----------------------------------------------------------------------===//
4360//                               CleanupPadInst Class
4361//===----------------------------------------------------------------------===//
4362class CleanupPadInst : public FuncletPadInst {
4363private:
explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args,
                        unsigned Values, const Twine &NameStr,
                        Instruction *InsertBefore)
    : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values,
                     NameStr, InsertBefore) {}
explicit CleanupPadInst(Value *ParentPad, ArrayRef<Value *> Args,
                        unsigned Values, const Twine &NameStr,
                        BasicBlock *InsertAtEnd)
    : FuncletPadInst(Instruction::CleanupPad, ParentPad, Args, Values,
                     NameStr, InsertAtEnd) {}

4375public:
static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args = None,
                              const Twine &NameStr = "",
                              Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CleanupPadInst(ParentPad, Args, Values, NameStr, InsertBefore);
}

static CleanupPadInst *Create(Value *ParentPad, ArrayRef<Value *> Args,
                              const Twine &NameStr, BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CleanupPadInst(ParentPad, Args, Values, NameStr, InsertAtEnd);
}

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

4400//===----------------------------------------------------------------------===//
4401//                               CatchPadInst Class
4402//===----------------------------------------------------------------------===//
4403class CatchPadInst : public FuncletPadInst {
4404private:
explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args,
                      unsigned Values, const Twine &NameStr,
                      Instruction *InsertBefore)
    : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values,
                     NameStr, InsertBefore) {}
explicit CatchPadInst(Value *CatchSwitch, ArrayRef<Value *> Args,
                      unsigned Values, const Twine &NameStr,
                      BasicBlock *InsertAtEnd)
    : FuncletPadInst(Instruction::CatchPad, CatchSwitch, Args, Values,
                     NameStr, InsertAtEnd) {}

4416public:
static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args,
                            const Twine &NameStr = "",
                            Instruction *InsertBefore = nullptr) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertBefore);
}

static CatchPadInst *Create(Value *CatchSwitch, ArrayRef<Value *> Args,
                            const Twine &NameStr, BasicBlock *InsertAtEnd) {
  unsigned Values = 1 + Args.size();
  return new (Values)
      CatchPadInst(CatchSwitch, Args, Values, NameStr, InsertAtEnd);
}

/// Convenience accessors
CatchSwitchInst *getCatchSwitch() const {
  return cast<CatchSwitchInst>(Op<-1>());
}
void setCatchSwitch(Value *CatchSwitch) {
  assert(CatchSwitch)(static_cast <bool> (CatchSwitch) ? void (0) : __assert_fail
 ("CatchSwitch", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4437, __extension__ __PRETTY_FUNCTION__));
  Op<-1>() = CatchSwitch;
}

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

4450//===----------------------------------------------------------------------===//
4451//                               CatchReturnInst Class
4452//===----------------------------------------------------------------------===//

4454class CatchReturnInst : public TerminatorInst {
CatchReturnInst(const CatchReturnInst &RI);
CatchReturnInst(Value *CatchPad, BasicBlock *BB, Instruction *InsertBefore);
CatchReturnInst(Value *CatchPad, BasicBlock *BB, BasicBlock *InsertAtEnd);

void init(Value *CatchPad, BasicBlock *BB);

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

CatchReturnInst *cloneImpl() const;

4467public:
static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB,
                               Instruction *InsertBefore = nullptr) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4470, __extension__ __PRETTY_FUNCTION__));
  assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4471, __extension__ __PRETTY_FUNCTION__));
  return new (2) CatchReturnInst(CatchPad, BB, InsertBefore);
}

static CatchReturnInst *Create(Value *CatchPad, BasicBlock *BB,
                               BasicBlock *InsertAtEnd) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4477, __extension__ __PRETTY_FUNCTION__));
  assert(BB)(static_cast <bool> (BB) ? void (0) : __assert_fail ("BB"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4478, __extension__ __PRETTY_FUNCTION__));
  return new (2) CatchReturnInst(CatchPad, BB, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

/// Convenience accessors.
CatchPadInst *getCatchPad() const { return cast<CatchPadInst>(Op<0>()); }
void setCatchPad(CatchPadInst *CatchPad) {
  assert(CatchPad)(static_cast <bool> (CatchPad) ? void (0) : __assert_fail
 ("CatchPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4488, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = CatchPad;
}

BasicBlock *getSuccessor() const { return cast<BasicBlock>(Op<1>()); }
void setSuccessor(BasicBlock *NewSucc) {
  assert(NewSucc)(static_cast <bool> (NewSucc) ? void (0) : __assert_fail
 ("NewSucc", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4494, __extension__ __PRETTY_FUNCTION__));
  Op<1>() = NewSucc;
}
unsigned getNumSuccessors() const { return 1; }

/// Get the parentPad of this catchret's catchpad's catchswitch.
/// The successor block is implicitly a member of this funclet.
Value *getCatchSwitchParentPad() const {
  return getCatchPad()->getCatchSwitch()->getParentPad();
}

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

4513private:
friend TerminatorInst;

BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchret!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4517, __extension__ __PRETTY_FUNCTION__));
  return getSuccessor();
}

void setSuccessor(unsigned Idx, BasicBlock *B) {
  assert(Idx < getNumSuccessors() && "Successor # out of range for catchret!")(static_cast <bool> (Idx < getNumSuccessors() &&
 "Successor # out of range for catchret!") ? void (0) : __assert_fail
 ("Idx < getNumSuccessors() && \"Successor # out of range for catchret!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4522, __extension__ __PRETTY_FUNCTION__));
  setSuccessor(B);
}
4525};

4527template <>
4528struct OperandTraits<CatchReturnInst>
  : public FixedNumOperandTraits<CatchReturnInst, 2> {};

4531DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CatchReturnInst, Value)CatchReturnInst::op_iterator CatchReturnInst::op_begin() { return
 OperandTraits<CatchReturnInst>::op_begin(this); } CatchReturnInst
::const_op_iterator CatchReturnInst::op_begin() const { return
 OperandTraits<CatchReturnInst>::op_begin(const_cast<
CatchReturnInst*>(this)); } CatchReturnInst::op_iterator CatchReturnInst
::op_end() { return OperandTraits<CatchReturnInst>::op_end
(this); } CatchReturnInst::const_op_iterator CatchReturnInst::
op_end() const { return OperandTraits<CatchReturnInst>::
op_end(const_cast<CatchReturnInst*>(this)); } Value *CatchReturnInst
::getOperand(unsigned i_nocapture) const { (static_cast <bool
> (i_nocapture < OperandTraits<CatchReturnInst>::
operands(this) && "getOperand() out of range!") ? void
 (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4531, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CatchReturnInst>::op_begin
(const_cast<CatchReturnInst*>(this))[i_nocapture].get()
); } void CatchReturnInst::setOperand(unsigned i_nocapture, Value
 *Val_nocapture) { (static_cast <bool> (i_nocapture <
 OperandTraits<CatchReturnInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CatchReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4531, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CatchReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CatchReturnInst::getNumOperands() const { return
 OperandTraits<CatchReturnInst>::operands(this); } template
 <int Idx_nocapture> Use &CatchReturnInst::Op() { return
 this->OpFrom<Idx_nocapture>(this); } template <int
 Idx_nocapture> const Use &CatchReturnInst::Op() const
 { return this->OpFrom<Idx_nocapture>(this); }

4533//===----------------------------------------------------------------------===//
4534//                               CleanupReturnInst Class
4535//===----------------------------------------------------------------------===//

4537class CleanupReturnInst : public TerminatorInst {
4538private:
CleanupReturnInst(const CleanupReturnInst &RI);
CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values,
                  Instruction *InsertBefore = nullptr);
CleanupReturnInst(Value *CleanupPad, BasicBlock *UnwindBB, unsigned Values,
                  BasicBlock *InsertAtEnd);

void init(Value *CleanupPad, BasicBlock *UnwindBB);

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

CleanupReturnInst *cloneImpl() const;

4553public:
static CleanupReturnInst *Create(Value *CleanupPad,
                                 BasicBlock *UnwindBB = nullptr,
                                 Instruction *InsertBefore = nullptr) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4557, __extension__ __PRETTY_FUNCTION__));
  unsigned Values = 1;
  if (UnwindBB)
    ++Values;
  return new (Values)
      CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertBefore);
}

static CleanupReturnInst *Create(Value *CleanupPad, BasicBlock *UnwindBB,
                                 BasicBlock *InsertAtEnd) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4567, __extension__ __PRETTY_FUNCTION__));
  unsigned Values = 1;
  if (UnwindBB)
    ++Values;
  return new (Values)
      CleanupReturnInst(CleanupPad, UnwindBB, Values, InsertAtEnd);
}

/// Provide fast operand accessors
DECLARE_TRANSPARENT_OPERAND_ACCESSORS(Value)public: inline Value *getOperand(unsigned) const; inline void
 setOperand(unsigned, Value*); inline op_iterator op_begin();
 inline const_op_iterator op_begin() const; inline op_iterator
 op_end(); inline const_op_iterator op_end() const; protected
: template <int> inline Use &Op(); template <int
> inline const Use &Op() const; public: inline unsigned
 getNumOperands() const;

bool hasUnwindDest() const { return getSubclassDataFromInstruction() & 1; }
bool unwindsToCaller() const { return !hasUnwindDest(); }

/// Convenience accessor.
CleanupPadInst *getCleanupPad() const {
  return cast<CleanupPadInst>(Op<0>());
}
void setCleanupPad(CleanupPadInst *CleanupPad) {
  assert(CleanupPad)(static_cast <bool> (CleanupPad) ? void (0) : __assert_fail
 ("CleanupPad", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4586, __extension__ __PRETTY_FUNCTION__));
  Op<0>() = CleanupPad;
}

unsigned getNumSuccessors() const { return hasUnwindDest() ? 1 : 0; }

BasicBlock *getUnwindDest() const {
  return hasUnwindDest() ? cast<BasicBlock>(Op<1>()) : nullptr;
}
void setUnwindDest(BasicBlock *NewDest) {
  assert(NewDest)(static_cast <bool> (NewDest) ? void (0) : __assert_fail
 ("NewDest", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4596, __extension__ __PRETTY_FUNCTION__));
  assert(hasUnwindDest())(static_cast <bool> (hasUnwindDest()) ? void (0) : __assert_fail
 ("hasUnwindDest()", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4597, __extension__ __PRETTY_FUNCTION__));
  Op<1>() = NewDest;
}

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

4609private:
friend TerminatorInst;

BasicBlock *getSuccessor(unsigned Idx) const {
  assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail
 ("Idx == 0", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4613, __extension__ __PRETTY_FUNCTION__));
  return getUnwindDest();
}

void setSuccessor(unsigned Idx, BasicBlock *B) {
  assert(Idx == 0)(static_cast <bool> (Idx == 0) ? void (0) : __assert_fail
 ("Idx == 0", "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4618, __extension__ __PRETTY_FUNCTION__));
  setUnwindDest(B);
}

// Shadow Instruction::setInstructionSubclassData with a private forwarding
// method so that subclasses cannot accidentally use it.
void setInstructionSubclassData(unsigned short D) {
  Instruction::setInstructionSubclassData(D);
}
4627};

4629template <>
4630struct OperandTraits<CleanupReturnInst>
  : public VariadicOperandTraits<CleanupReturnInst, /*MINARITY=*/1> {};

4633DEFINE_TRANSPARENT_OPERAND_ACCESSORS(CleanupReturnInst, Value)CleanupReturnInst::op_iterator CleanupReturnInst::op_begin() {
 return OperandTraits<CleanupReturnInst>::op_begin(this
); } CleanupReturnInst::const_op_iterator CleanupReturnInst::
op_begin() const { return OperandTraits<CleanupReturnInst>
::op_begin(const_cast<CleanupReturnInst*>(this)); } CleanupReturnInst
::op_iterator CleanupReturnInst::op_end() { return OperandTraits
<CleanupReturnInst>::op_end(this); } CleanupReturnInst::
const_op_iterator CleanupReturnInst::op_end() const { return OperandTraits
<CleanupReturnInst>::op_end(const_cast<CleanupReturnInst
*>(this)); } Value *CleanupReturnInst::getOperand(unsigned
 i_nocapture) const { (static_cast <bool> (i_nocapture <
 OperandTraits<CleanupReturnInst>::operands(this) &&
 "getOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"getOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4633, __extension__ __PRETTY_FUNCTION__)); return cast_or_null
<Value>( OperandTraits<CleanupReturnInst>::op_begin
(const_cast<CleanupReturnInst*>(this))[i_nocapture].get
()); } void CleanupReturnInst::setOperand(unsigned i_nocapture
, Value *Val_nocapture) { (static_cast <bool> (i_nocapture
 < OperandTraits<CleanupReturnInst>::operands(this) &&
 "setOperand() out of range!") ? void (0) : __assert_fail ("i_nocapture < OperandTraits<CleanupReturnInst>::operands(this) && \"setOperand() out of range!\""
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4633, __extension__ __PRETTY_FUNCTION__)); OperandTraits<
CleanupReturnInst>::op_begin(this)[i_nocapture] = Val_nocapture
; } unsigned CleanupReturnInst::getNumOperands() const { return
 OperandTraits<CleanupReturnInst>::operands(this); } template
 <int Idx_nocapture> Use &CleanupReturnInst::Op() {
 return this->OpFrom<Idx_nocapture>(this); } template
 <int Idx_nocapture> const Use &CleanupReturnInst::
Op() const { return this->OpFrom<Idx_nocapture>(this
); }

4635//===----------------------------------------------------------------------===//
4636//                           UnreachableInst Class
4637//===----------------------------------------------------------------------===//

4639//===---------------------------------------------------------------------------
4640/// This function has undefined behavior.  In particular, the
4641/// presence of this instruction indicates some higher level knowledge that the
4642/// end of the block cannot be reached.
4643///
4644class UnreachableInst : public TerminatorInst {
4645protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

UnreachableInst *cloneImpl() const;

4651public:
explicit UnreachableInst(LLVMContext &C, Instruction *InsertBefore = nullptr);
explicit UnreachableInst(LLVMContext &C, BasicBlock *InsertAtEnd);

// allocate space for exactly zero operands
void *operator new(size_t s) {
  return User::operator new(s, 0);
}

unsigned getNumSuccessors() const { return 0; }

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

4670private:
friend TerminatorInst;

BasicBlock *getSuccessor(unsigned idx) const {
  llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4674);
}

void setSuccessor(unsigned idx, BasicBlock *B) {
  llvm_unreachable("UnreachableInst has no successors!")::llvm::llvm_unreachable_internal("UnreachableInst has no successors!"
, "/build/llvm-toolchain-snapshot-7~svn338205/include/llvm/IR/Instructions.h"
, 4678);
}
4680};

4682//===----------------------------------------------------------------------===//
4683//                                 TruncInst Class
4684//===----------------------------------------------------------------------===//

4686/// This class represents a truncation of integer types.
4687class TruncInst : public CastInst {
4688protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical TruncInst
TruncInst *cloneImpl() const;

4695public:
/// Constructor with insert-before-instruction semantics
TruncInst(
  Value *S,                           ///< The value to be truncated
  Type *Ty,                           ///< The (smaller) type to truncate to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
TruncInst(
  Value *S,                     ///< The value to be truncated
  Type *Ty,                     ///< The (smaller) type to truncate to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4721//===----------------------------------------------------------------------===//
4722//                                 ZExtInst Class
4723//===----------------------------------------------------------------------===//

4725/// This class represents zero extension of integer types.
4726class ZExtInst : public CastInst {
4727protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical ZExtInst
ZExtInst *cloneImpl() const;

4734public:
/// Constructor with insert-before-instruction semantics
ZExtInst(
  Value *S,                           ///< The value to be zero extended
  Type *Ty,                           ///< The type to zero extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end semantics.
ZExtInst(
  Value *S,                     ///< The value to be zero extended
  Type *Ty,                     ///< The type to zero extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4760//===----------------------------------------------------------------------===//
4761//                                 SExtInst Class
4762//===----------------------------------------------------------------------===//

4764/// This class represents a sign extension of integer types.
4765class SExtInst : public CastInst {
4766protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical SExtInst
SExtInst *cloneImpl() const;

4773public:
/// Constructor with insert-before-instruction semantics
SExtInst(
  Value *S,                           ///< The value to be sign extended
  Type *Ty,                           ///< The type to sign extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
SExtInst(
  Value *S,                     ///< The value to be sign extended
  Type *Ty,                     ///< The type to sign extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4799//===----------------------------------------------------------------------===//
4800//                                 FPTruncInst Class
4801//===----------------------------------------------------------------------===//

4803/// This class represents a truncation of floating point types.
4804class FPTruncInst : public CastInst {
4805protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPTruncInst
FPTruncInst *cloneImpl() const;

4812public:
/// Constructor with insert-before-instruction semantics
FPTruncInst(
  Value *S,                           ///< The value to be truncated
  Type *Ty,                           ///< The type to truncate to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-before-instruction semantics
FPTruncInst(
  Value *S,                     ///< The value to be truncated
  Type *Ty,                     ///< The type to truncate to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4838//===----------------------------------------------------------------------===//
4839//                                 FPExtInst Class
4840//===----------------------------------------------------------------------===//

4842/// This class represents an extension of floating point types.
4843class FPExtInst : public CastInst {
4844protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPExtInst
FPExtInst *cloneImpl() const;

4851public:
/// Constructor with insert-before-instruction semantics
FPExtInst(
  Value *S,                           ///< The value to be extended
  Type *Ty,                           ///< The type to extend to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPExtInst(
  Value *S,                     ///< The value to be extended
  Type *Ty,                     ///< The type to extend to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4877//===----------------------------------------------------------------------===//
4878//                                 UIToFPInst Class
4879//===----------------------------------------------------------------------===//

4881/// This class represents a cast unsigned integer to floating point.
4882class UIToFPInst : public CastInst {
4883protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical UIToFPInst
UIToFPInst *cloneImpl() const;

4890public:
/// Constructor with insert-before-instruction semantics
UIToFPInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
UIToFPInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4916//===----------------------------------------------------------------------===//
4917//                                 SIToFPInst Class
4918//===----------------------------------------------------------------------===//

4920/// This class represents a cast from signed integer to floating point.
4921class SIToFPInst : public CastInst {
4922protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical SIToFPInst
SIToFPInst *cloneImpl() const;

4929public:
/// Constructor with insert-before-instruction semantics
SIToFPInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
SIToFPInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

4955//===----------------------------------------------------------------------===//
4956//                                 FPToUIInst Class
4957//===----------------------------------------------------------------------===//

4959/// This class represents a cast from floating point to unsigned integer
4960class FPToUIInst  : public CastInst {
4961protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPToUIInst
FPToUIInst *cloneImpl() const;

4968public:
/// Constructor with insert-before-instruction semantics
FPToUIInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPToUIInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< Where to insert the new instruction
);

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

4994//===----------------------------------------------------------------------===//
4995//                                 FPToSIInst Class
4996//===----------------------------------------------------------------------===//

4998/// This class represents a cast from floating point to signed integer.
4999class FPToSIInst  : public CastInst {
5000protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical FPToSIInst
FPToSIInst *cloneImpl() const;

5007public:
/// Constructor with insert-before-instruction semantics
FPToSIInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
FPToSIInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

5033//===----------------------------------------------------------------------===//
5034//                                 IntToPtrInst Class
5035//===----------------------------------------------------------------------===//

5037/// This class represents a cast from an integer to a pointer.
5038class IntToPtrInst : public CastInst {
5039public:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Constructor with insert-before-instruction semantics
IntToPtrInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
IntToPtrInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Clone an identical IntToPtrInst.
IntToPtrInst *cloneImpl() const;

/// Returns the address space of this instruction's pointer type.
unsigned getAddressSpace() const {
  return getType()->getPointerAddressSpace();
}

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

5076//===----------------------------------------------------------------------===//
5077//                                 PtrToIntInst Class
5078//===----------------------------------------------------------------------===//

5080/// This class represents a cast from a pointer to an integer.
5081class PtrToIntInst : public CastInst {
5082protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical PtrToIntInst.
PtrToIntInst *cloneImpl() const;

5089public:
/// Constructor with insert-before-instruction semantics
PtrToIntInst(
  Value *S,                           ///< The value to be converted
  Type *Ty,                           ///< The type to convert to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
PtrToIntInst(
  Value *S,                     ///< The value to be converted
  Type *Ty,                     ///< The type to convert to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

/// Gets the pointer operand.
Value *getPointerOperand() { return getOperand(0); }
/// Gets the pointer operand.
const Value *getPointerOperand() const { return getOperand(0); }
/// Gets the operand index of the pointer operand.
static unsigned getPointerOperandIndex() { return 0U; }

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

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

5127//===----------------------------------------------------------------------===//
5128//                             BitCastInst Class
5129//===----------------------------------------------------------------------===//

5131/// This class represents a no-op cast from one type to another.
5132class BitCastInst : public CastInst {
5133protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical BitCastInst.
BitCastInst *cloneImpl() const;

5140public:
/// Constructor with insert-before-instruction semantics
BitCastInst(
  Value *S,                           ///< The value to be casted
  Type *Ty,                           ///< The type to casted to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
BitCastInst(
  Value *S,                     ///< The value to be casted
  Type *Ty,                     ///< The type to casted to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

5166//===----------------------------------------------------------------------===//
5167//                          AddrSpaceCastInst Class
5168//===----------------------------------------------------------------------===//

5170/// This class represents a conversion between pointers from one address space
5171/// to another.
5172class AddrSpaceCastInst : public CastInst {
5173protected:
// Note: Instruction needs to be a friend here to call cloneImpl.
friend class Instruction;

/// Clone an identical AddrSpaceCastInst.
AddrSpaceCastInst *cloneImpl() const;

5180public:
/// Constructor with insert-before-instruction semantics
AddrSpaceCastInst(
  Value *S,                           ///< The value to be casted
  Type *Ty,                           ///< The type to casted to
  const Twine &NameStr = "",          ///< A name for the new instruction
  Instruction *InsertBefore = nullptr ///< Where to insert the new instruction
);

/// Constructor with insert-at-end-of-block semantics
AddrSpaceCastInst(
  Value *S,                     ///< The value to be casted
  Type *Ty,                     ///< The type to casted to
  const Twine &NameStr,         ///< A name for the new instruction
  BasicBlock *InsertAtEnd       ///< The block to insert the instruction into
);

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

/// Gets the pointer operand.
Value *getPointerOperand() {
  return getOperand(0);
}

/// Gets the pointer operand.
const Value *getPointerOperand() const {
  return getOperand(0);
}

/// Gets the operand index of the pointer operand.
static unsigned getPointerOperandIndex() {
  return 0U;
}

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

/// Returns the address space of the result.
unsigned getDestAddressSpace() const {
  return getType()->getPointerAddressSpace();
}
5229};

5231/// A helper function that returns the pointer operand of a load or store
5232/// instruction. Returns nullptr if not load or store.
5233inline Value *getLoadStorePointerOperand(Value *V) {
if (auto *Load = dyn_cast<LoadInst>(V))
  return Load->getPointerOperand();
if (auto *Store = dyn_cast<StoreInst>(V))
  return Store->getPointerOperand();
return nullptr;
5239}

5241/// A helper function that returns the pointer operand of a load, store
5242/// or GEP instruction. Returns nullptr if not load, store, or GEP.
5243inline Value *getPointerOperand(Value *V) {
if (auto *Ptr = getLoadStorePointerOperand(V))
  return Ptr;
if (auto *Gep = dyn_cast<GetElementPtrInst>(V))
  return Gep->getPointerOperand();
return nullptr;
5249}

5251} // end namespace llvm

5253#endif // LLVM_IR_INSTRUCTIONS_H