/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp

Bug Summary

File:	lib/Target/SystemZ/SystemZISelLowering.cpp
Warning:	line 4567, column 41 The result of the left shift is undefined due to shifting by '18446744073709551615', which is greater or equal to the width of type 'uint64_t'

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 SystemZISelLowering.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -analyzer-config-compatibility-mode=true -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-8/lib/clang/8.0.0 -D _DEBUG -D _GNU_SOURCE -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D __STDC_LIMIT_MACROS -I /build/llvm-toolchain-snapshot-8~svn350071/build-llvm/lib/Target/SystemZ -I /build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ -I /build/llvm-toolchain-snapshot-8~svn350071/build-llvm/include -I /build/llvm-toolchain-snapshot-8~svn350071/include -U NDEBUG -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/x86_64-linux-gnu/c++/6.3.0 -internal-isystem /usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/backward -internal-isystem /usr/include/clang/8.0.0/include/ -internal-isystem /usr/local/include -internal-isystem /usr/lib/llvm-8/lib/clang/8.0.0/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-comment -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /build/llvm-toolchain-snapshot-8~svn350071/build-llvm/lib/Target/SystemZ -fdebug-prefix-map=/build/llvm-toolchain-snapshot-8~svn350071=. -ferror-limit 19 -fmessage-length 0 -fvisibility-inlines-hidden -stack-protector 2 -fobjc-runtime=gcc -fdiagnostics-show-option -vectorize-loops -vectorize-slp -analyzer-output=html -analyzer-config stable-report-filename=true -o /tmp/scan-build-2018-12-27-042839-1215-1 -x c++ /build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp -faddrsig

/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp

→

1//===-- SystemZISelLowering.cpp - SystemZ DAG lowering implementation -----===//
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 the SystemZTargetLowering class.
11//
12//===----------------------------------------------------------------------===//

14#include "SystemZISelLowering.h"
15#include "SystemZCallingConv.h"
16#include "SystemZConstantPoolValue.h"
17#include "SystemZMachineFunctionInfo.h"
18#include "SystemZTargetMachine.h"
19#include "llvm/CodeGen/CallingConvLower.h"
20#include "llvm/CodeGen/MachineInstrBuilder.h"
21#include "llvm/CodeGen/MachineRegisterInfo.h"
22#include "llvm/CodeGen/TargetLoweringObjectFileImpl.h"
23#include "llvm/IR/Intrinsics.h"
24#include "llvm/IR/IntrinsicInst.h"
25#include "llvm/Support/CommandLine.h"
26#include "llvm/Support/KnownBits.h"
27#include <cctype>

29using namespace llvm;

31#define DEBUG_TYPE"systemz-lower" "systemz-lower"

33namespace {
34// Represents information about a comparison.
35struct Comparison {
Comparison(SDValue Op0In, SDValue Op1In)
  : Op0(Op0In), Op1(Op1In), Opcode(0), ICmpType(0), CCValid(0), CCMask(0) {}

// The operands to the comparison.
SDValue Op0, Op1;

// The opcode that should be used to compare Op0 and Op1.
unsigned Opcode;

// A SystemZICMP value.  Only used for integer comparisons.
unsigned ICmpType;

// The mask of CC values that Opcode can produce.
unsigned CCValid;

// The mask of CC values for which the original condition is true.
unsigned CCMask;
53};
54} // end anonymous namespace

56// Classify VT as either 32 or 64 bit.
57static bool is32Bit(EVT VT) {
switch (VT.getSimpleVT().SimpleTy) {
case MVT::i32:
  return true;
case MVT::i64:
  return false;
default:
  llvm_unreachable("Unsupported type")::llvm::llvm_unreachable_internal("Unsupported type", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 64);
}
66}

68// Return a version of MachineOperand that can be safely used before the
69// final use.
70static MachineOperand earlyUseOperand(MachineOperand Op) {
if (Op.isReg())
  Op.setIsKill(false);
return Op;
74}

76SystemZTargetLowering::SystemZTargetLowering(const TargetMachine &TM,
                                           const SystemZSubtarget &STI)
  : TargetLowering(TM), Subtarget(STI) {
MVT PtrVT = MVT::getIntegerVT(8 * TM.getPointerSize(0));

// Set up the register classes.
if (Subtarget.hasHighWord())
  addRegisterClass(MVT::i32, &SystemZ::GRX32BitRegClass);
else
  addRegisterClass(MVT::i32, &SystemZ::GR32BitRegClass);
addRegisterClass(MVT::i64, &SystemZ::GR64BitRegClass);
if (Subtarget.hasVector()) {
  addRegisterClass(MVT::f32, &SystemZ::VR32BitRegClass);
  addRegisterClass(MVT::f64, &SystemZ::VR64BitRegClass);
} else {
  addRegisterClass(MVT::f32, &SystemZ::FP32BitRegClass);
  addRegisterClass(MVT::f64, &SystemZ::FP64BitRegClass);
}
if (Subtarget.hasVectorEnhancements1())
  addRegisterClass(MVT::f128, &SystemZ::VR128BitRegClass);
else
  addRegisterClass(MVT::f128, &SystemZ::FP128BitRegClass);

if (Subtarget.hasVector()) {
  addRegisterClass(MVT::v16i8, &SystemZ::VR128BitRegClass);
  addRegisterClass(MVT::v8i16, &SystemZ::VR128BitRegClass);
  addRegisterClass(MVT::v4i32, &SystemZ::VR128BitRegClass);
  addRegisterClass(MVT::v2i64, &SystemZ::VR128BitRegClass);
  addRegisterClass(MVT::v4f32, &SystemZ::VR128BitRegClass);
  addRegisterClass(MVT::v2f64, &SystemZ::VR128BitRegClass);
}

// Compute derived properties from the register classes
computeRegisterProperties(Subtarget.getRegisterInfo());

// Set up special registers.
setStackPointerRegisterToSaveRestore(SystemZ::R15D);

// TODO: It may be better to default to latency-oriented scheduling, however
// LLVM's current latency-oriented scheduler can't handle physreg definitions
// such as SystemZ has with CC, so set this to the register-pressure
// scheduler, because it can.
setSchedulingPreference(Sched::RegPressure);

setBooleanContents(ZeroOrOneBooleanContent);
setBooleanVectorContents(ZeroOrNegativeOneBooleanContent);

// Instructions are strings of 2-byte aligned 2-byte values.
setMinFunctionAlignment(2);
// For performance reasons we prefer 16-byte alignment.
setPrefFunctionAlignment(4);

// Handle operations that are handled in a similar way for all types.
for (unsigned I = MVT::FIRST_INTEGER_VALUETYPE;
     I <= MVT::LAST_FP_VALUETYPE;
     ++I) {
  MVT VT = MVT::SimpleValueType(I);
  if (isTypeLegal(VT)) {
    // Lower SET_CC into an IPM-based sequence.
    setOperationAction(ISD::SETCC, VT, Custom);

    // Expand SELECT(C, A, B) into SELECT_CC(X, 0, A, B, NE).
    setOperationAction(ISD::SELECT, VT, Expand);

    // Lower SELECT_CC and BR_CC into separate comparisons and branches.
    setOperationAction(ISD::SELECT_CC, VT, Custom);
    setOperationAction(ISD::BR_CC,     VT, Custom);
  }
}

// Expand jump table branches as address arithmetic followed by an
// indirect jump.
setOperationAction(ISD::BR_JT, MVT::Other, Expand);

// Expand BRCOND into a BR_CC (see above).
setOperationAction(ISD::BRCOND, MVT::Other, Expand);

// Handle integer types.
for (unsigned I = MVT::FIRST_INTEGER_VALUETYPE;
     I <= MVT::LAST_INTEGER_VALUETYPE;
     ++I) {
  MVT VT = MVT::SimpleValueType(I);
  if (isTypeLegal(VT)) {
    // Expand individual DIV and REMs into DIVREMs.
    setOperationAction(ISD::SDIV, VT, Expand);
    setOperationAction(ISD::UDIV, VT, Expand);
    setOperationAction(ISD::SREM, VT, Expand);
    setOperationAction(ISD::UREM, VT, Expand);
    setOperationAction(ISD::SDIVREM, VT, Custom);
    setOperationAction(ISD::UDIVREM, VT, Custom);

    // Support addition/subtraction with overflow.
    setOperationAction(ISD::SADDO, VT, Custom);
    setOperationAction(ISD::SSUBO, VT, Custom);

    // Support addition/subtraction with carry.
    setOperationAction(ISD::UADDO, VT, Custom);
    setOperationAction(ISD::USUBO, VT, Custom);

    // Support carry in as value rather than glue.
    setOperationAction(ISD::ADDCARRY, VT, Custom);
    setOperationAction(ISD::SUBCARRY, VT, Custom);

    // Lower ATOMIC_LOAD and ATOMIC_STORE into normal volatile loads and
    // stores, putting a serialization instruction after the stores.
    setOperationAction(ISD::ATOMIC_LOAD,  VT, Custom);
    setOperationAction(ISD::ATOMIC_STORE, VT, Custom);

    // Lower ATOMIC_LOAD_SUB into ATOMIC_LOAD_ADD if LAA and LAAG are
    // available, or if the operand is constant.
    setOperationAction(ISD::ATOMIC_LOAD_SUB, VT, Custom);

    // Use POPCNT on z196 and above.
    if (Subtarget.hasPopulationCount())
      setOperationAction(ISD::CTPOP, VT, Custom);
    else
      setOperationAction(ISD::CTPOP, VT, Expand);

    // No special instructions for these.
    setOperationAction(ISD::CTTZ,            VT, Expand);
    setOperationAction(ISD::ROTR,            VT, Expand);

    // Use *MUL_LOHI where possible instead of MULH*.
    setOperationAction(ISD::MULHS, VT, Expand);
    setOperationAction(ISD::MULHU, VT, Expand);
    setOperationAction(ISD::SMUL_LOHI, VT, Custom);
    setOperationAction(ISD::UMUL_LOHI, VT, Custom);

    // Only z196 and above have native support for conversions to unsigned.
    // On z10, promoting to i64 doesn't generate an inexact condition for
    // values that are outside the i32 range but in the i64 range, so use
    // the default expansion.
    if (!Subtarget.hasFPExtension())
      setOperationAction(ISD::FP_TO_UINT, VT, Expand);
  }
}

// Type legalization will convert 8- and 16-bit atomic operations into
// forms that operate on i32s (but still keeping the original memory VT).
// Lower them into full i32 operations.
setOperationAction(ISD::ATOMIC_SWAP,      MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_ADD,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_SUB,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_AND,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_OR,   MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_XOR,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_NAND, MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_MIN,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_MAX,  MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_UMIN, MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_LOAD_UMAX, MVT::i32, Custom);

// Even though i128 is not a legal type, we still need to custom lower
// the atomic operations in order to exploit SystemZ instructions.
setOperationAction(ISD::ATOMIC_LOAD,     MVT::i128, Custom);
setOperationAction(ISD::ATOMIC_STORE,    MVT::i128, Custom);

// We can use the CC result of compare-and-swap to implement
// the "success" result of ATOMIC_CMP_SWAP_WITH_SUCCESS.
setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i32, Custom);
setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i64, Custom);
setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, MVT::i128, Custom);

setOperationAction(ISD::ATOMIC_FENCE, MVT::Other, Custom);

// Traps are legal, as we will convert them to "j .+2".
setOperationAction(ISD::TRAP, MVT::Other, Legal);

// z10 has instructions for signed but not unsigned FP conversion.
// Handle unsigned 32-bit types as signed 64-bit types.
if (!Subtarget.hasFPExtension()) {
  setOperationAction(ISD::UINT_TO_FP, MVT::i32, Promote);
  setOperationAction(ISD::UINT_TO_FP, MVT::i64, Expand);
}

// We have native support for a 64-bit CTLZ, via FLOGR.
setOperationAction(ISD::CTLZ, MVT::i32, Promote);
setOperationAction(ISD::CTLZ, MVT::i64, Legal);

// Give LowerOperation the chance to replace 64-bit ORs with subregs.
setOperationAction(ISD::OR, MVT::i64, Custom);

// FIXME: Can we support these natively?
setOperationAction(ISD::SRL_PARTS, MVT::i64, Expand);
setOperationAction(ISD::SHL_PARTS, MVT::i64, Expand);
setOperationAction(ISD::SRA_PARTS, MVT::i64, Expand);

// We have native instructions for i8, i16 and i32 extensions, but not i1.
setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1, Expand);
for (MVT VT : MVT::integer_valuetypes()) {
  setLoadExtAction(ISD::SEXTLOAD, VT, MVT::i1, Promote);
  setLoadExtAction(ISD::ZEXTLOAD, VT, MVT::i1, Promote);
  setLoadExtAction(ISD::EXTLOAD,  VT, MVT::i1, Promote);
}

// Handle the various types of symbolic address.
setOperationAction(ISD::ConstantPool,     PtrVT, Custom);
setOperationAction(ISD::GlobalAddress,    PtrVT, Custom);
setOperationAction(ISD::GlobalTLSAddress, PtrVT, Custom);
setOperationAction(ISD::BlockAddress,     PtrVT, Custom);
setOperationAction(ISD::JumpTable,        PtrVT, Custom);

// We need to handle dynamic allocations specially because of the
// 160-byte area at the bottom of the stack.
setOperationAction(ISD::DYNAMIC_STACKALLOC, PtrVT, Custom);
setOperationAction(ISD::GET_DYNAMIC_AREA_OFFSET, PtrVT, Custom);

// Use custom expanders so that we can force the function to use
// a frame pointer.
setOperationAction(ISD::STACKSAVE,    MVT::Other, Custom);
setOperationAction(ISD::STACKRESTORE, MVT::Other, Custom);

// Handle prefetches with PFD or PFDRL.
setOperationAction(ISD::PREFETCH, MVT::Other, Custom);

for (MVT VT : MVT::vector_valuetypes()) {
  // Assume by default that all vector operations need to be expanded.
  for (unsigned Opcode = 0; Opcode < ISD::BUILTIN_OP_END; ++Opcode)
    if (getOperationAction(Opcode, VT) == Legal)
      setOperationAction(Opcode, VT, Expand);

  // Likewise all truncating stores and extending loads.
  for (MVT InnerVT : MVT::vector_valuetypes()) {
    setTruncStoreAction(VT, InnerVT, Expand);
    setLoadExtAction(ISD::SEXTLOAD, VT, InnerVT, Expand);
    setLoadExtAction(ISD::ZEXTLOAD, VT, InnerVT, Expand);
    setLoadExtAction(ISD::EXTLOAD, VT, InnerVT, Expand);
  }

  if (isTypeLegal(VT)) {
    // These operations are legal for anything that can be stored in a
    // vector register, even if there is no native support for the format
    // as such.  In particular, we can do these for v4f32 even though there
    // are no specific instructions for that format.
    setOperationAction(ISD::LOAD, VT, Legal);
    setOperationAction(ISD::STORE, VT, Legal);
    setOperationAction(ISD::VSELECT, VT, Legal);
    setOperationAction(ISD::BITCAST, VT, Legal);
    setOperationAction(ISD::UNDEF, VT, Legal);

    // Likewise, except that we need to replace the nodes with something
    // more specific.
    setOperationAction(ISD::BUILD_VECTOR, VT, Custom);
    setOperationAction(ISD::VECTOR_SHUFFLE, VT, Custom);
  }
}

// Handle integer vector types.
for (MVT VT : MVT::integer_vector_valuetypes()) {
  if (isTypeLegal(VT)) {
    // These operations have direct equivalents.
    setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT, Legal);
    setOperationAction(ISD::INSERT_VECTOR_ELT, VT, Legal);
    setOperationAction(ISD::ADD, VT, Legal);
    setOperationAction(ISD::SUB, VT, Legal);
    if (VT != MVT::v2i64)
      setOperationAction(ISD::MUL, VT, Legal);
    setOperationAction(ISD::AND, VT, Legal);
    setOperationAction(ISD::OR, VT, Legal);
    setOperationAction(ISD::XOR, VT, Legal);
    if (Subtarget.hasVectorEnhancements1())
      setOperationAction(ISD::CTPOP, VT, Legal);
    else
      setOperationAction(ISD::CTPOP, VT, Custom);
    setOperationAction(ISD::CTTZ, VT, Legal);
    setOperationAction(ISD::CTLZ, VT, Legal);

    // Convert a GPR scalar to a vector by inserting it into element 0.
    setOperationAction(ISD::SCALAR_TO_VECTOR, VT, Custom);

    // Use a series of unpacks for extensions.
    setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, VT, Custom);
    setOperationAction(ISD::ZERO_EXTEND_VECTOR_INREG, VT, Custom);

    // Detect shifts by a scalar amount and convert them into
    // V*_BY_SCALAR.
    setOperationAction(ISD::SHL, VT, Custom);
    setOperationAction(ISD::SRA, VT, Custom);
    setOperationAction(ISD::SRL, VT, Custom);

    // At present ROTL isn't matched by DAGCombiner.  ROTR should be
    // converted into ROTL.
    setOperationAction(ISD::ROTL, VT, Expand);
    setOperationAction(ISD::ROTR, VT, Expand);

    // Map SETCCs onto one of VCE, VCH or VCHL, swapping the operands
    // and inverting the result as necessary.
    setOperationAction(ISD::SETCC, VT, Custom);
  }
}

if (Subtarget.hasVector()) {
  // There should be no need to check for float types other than v2f64
  // since <2 x f32> isn't a legal type.
  setOperationAction(ISD::FP_TO_SINT, MVT::v2i64, Legal);
  setOperationAction(ISD::FP_TO_SINT, MVT::v2f64, Legal);
  setOperationAction(ISD::FP_TO_UINT, MVT::v2i64, Legal);
  setOperationAction(ISD::FP_TO_UINT, MVT::v2f64, Legal);
  setOperationAction(ISD::SINT_TO_FP, MVT::v2i64, Legal);
  setOperationAction(ISD::SINT_TO_FP, MVT::v2f64, Legal);
  setOperationAction(ISD::UINT_TO_FP, MVT::v2i64, Legal);
  setOperationAction(ISD::UINT_TO_FP, MVT::v2f64, Legal);
}

// Handle floating-point types.
for (unsigned I = MVT::FIRST_FP_VALUETYPE;
     I <= MVT::LAST_FP_VALUETYPE;
     ++I) {
  MVT VT = MVT::SimpleValueType(I);
  if (isTypeLegal(VT)) {
    // We can use FI for FRINT.
    setOperationAction(ISD::FRINT, VT, Legal);

    // We can use the extended form of FI for other rounding operations.
    if (Subtarget.hasFPExtension()) {
      setOperationAction(ISD::FNEARBYINT, VT, Legal);
      setOperationAction(ISD::FFLOOR, VT, Legal);
      setOperationAction(ISD::FCEIL, VT, Legal);
      setOperationAction(ISD::FTRUNC, VT, Legal);
      setOperationAction(ISD::FROUND, VT, Legal);
    }

    // No special instructions for these.
    setOperationAction(ISD::FSIN, VT, Expand);
    setOperationAction(ISD::FCOS, VT, Expand);
    setOperationAction(ISD::FSINCOS, VT, Expand);
    setOperationAction(ISD::FREM, VT, Expand);
    setOperationAction(ISD::FPOW, VT, Expand);
  }
}

// Handle floating-point vector types.
if (Subtarget.hasVector()) {
  // Scalar-to-vector conversion is just a subreg.
  setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v4f32, Legal);
  setOperationAction(ISD::SCALAR_TO_VECTOR, MVT::v2f64, Legal);

  // Some insertions and extractions can be done directly but others
  // need to go via integers.
  setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v4f32, Custom);
  setOperationAction(ISD::INSERT_VECTOR_ELT, MVT::v2f64, Custom);
  setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v4f32, Custom);
  setOperationAction(ISD::EXTRACT_VECTOR_ELT, MVT::v2f64, Custom);

  // These operations have direct equivalents.
  setOperationAction(ISD::FADD, MVT::v2f64, Legal);
  setOperationAction(ISD::FNEG, MVT::v2f64, Legal);
  setOperationAction(ISD::FSUB, MVT::v2f64, Legal);
  setOperationAction(ISD::FMUL, MVT::v2f64, Legal);
  setOperationAction(ISD::FMA, MVT::v2f64, Legal);
  setOperationAction(ISD::FDIV, MVT::v2f64, Legal);
  setOperationAction(ISD::FABS, MVT::v2f64, Legal);
  setOperationAction(ISD::FSQRT, MVT::v2f64, Legal);
  setOperationAction(ISD::FRINT, MVT::v2f64, Legal);
  setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Legal);
  setOperationAction(ISD::FFLOOR, MVT::v2f64, Legal);
  setOperationAction(ISD::FCEIL, MVT::v2f64, Legal);
  setOperationAction(ISD::FTRUNC, MVT::v2f64, Legal);
  setOperationAction(ISD::FROUND, MVT::v2f64, Legal);
}

// The vector enhancements facility 1 has instructions for these.
if (Subtarget.hasVectorEnhancements1()) {
  setOperationAction(ISD::FADD, MVT::v4f32, Legal);
  setOperationAction(ISD::FNEG, MVT::v4f32, Legal);
  setOperationAction(ISD::FSUB, MVT::v4f32, Legal);
  setOperationAction(ISD::FMUL, MVT::v4f32, Legal);
  setOperationAction(ISD::FMA, MVT::v4f32, Legal);
  setOperationAction(ISD::FDIV, MVT::v4f32, Legal);
  setOperationAction(ISD::FABS, MVT::v4f32, Legal);
  setOperationAction(ISD::FSQRT, MVT::v4f32, Legal);
  setOperationAction(ISD::FRINT, MVT::v4f32, Legal);
  setOperationAction(ISD::FNEARBYINT, MVT::v4f32, Legal);
  setOperationAction(ISD::FFLOOR, MVT::v4f32, Legal);
  setOperationAction(ISD::FCEIL, MVT::v4f32, Legal);
  setOperationAction(ISD::FTRUNC, MVT::v4f32, Legal);
  setOperationAction(ISD::FROUND, MVT::v4f32, Legal);

  setOperationAction(ISD::FMAXNUM, MVT::f64, Legal);
  setOperationAction(ISD::FMAXIMUM, MVT::f64, Legal);
  setOperationAction(ISD::FMINNUM, MVT::f64, Legal);
  setOperationAction(ISD::FMINIMUM, MVT::f64, Legal);

  setOperationAction(ISD::FMAXNUM, MVT::v2f64, Legal);
  setOperationAction(ISD::FMAXIMUM, MVT::v2f64, Legal);
  setOperationAction(ISD::FMINNUM, MVT::v2f64, Legal);
  setOperationAction(ISD::FMINIMUM, MVT::v2f64, Legal);

  setOperationAction(ISD::FMAXNUM, MVT::f32, Legal);
  setOperationAction(ISD::FMAXIMUM, MVT::f32, Legal);
  setOperationAction(ISD::FMINNUM, MVT::f32, Legal);
  setOperationAction(ISD::FMINIMUM, MVT::f32, Legal);

  setOperationAction(ISD::FMAXNUM, MVT::v4f32, Legal);
  setOperationAction(ISD::FMAXIMUM, MVT::v4f32, Legal);
  setOperationAction(ISD::FMINNUM, MVT::v4f32, Legal);
  setOperationAction(ISD::FMINIMUM, MVT::v4f32, Legal);

  setOperationAction(ISD::FMAXNUM, MVT::f128, Legal);
  setOperationAction(ISD::FMAXIMUM, MVT::f128, Legal);
  setOperationAction(ISD::FMINNUM, MVT::f128, Legal);
  setOperationAction(ISD::FMINIMUM, MVT::f128, Legal);
}

// We have fused multiply-addition for f32 and f64 but not f128.
setOperationAction(ISD::FMA, MVT::f32,  Legal);
setOperationAction(ISD::FMA, MVT::f64,  Legal);
if (Subtarget.hasVectorEnhancements1())
  setOperationAction(ISD::FMA, MVT::f128, Legal);
else
  setOperationAction(ISD::FMA, MVT::f128, Expand);

// We don't have a copysign instruction on vector registers.
if (Subtarget.hasVectorEnhancements1())
  setOperationAction(ISD::FCOPYSIGN, MVT::f128, Expand);

// Needed so that we don't try to implement f128 constant loads using
// a load-and-extend of a f80 constant (in cases where the constant
// would fit in an f80).
for (MVT VT : MVT::fp_valuetypes())
  setLoadExtAction(ISD::EXTLOAD, VT, MVT::f80, Expand);

// We don't have extending load instruction on vector registers.
if (Subtarget.hasVectorEnhancements1()) {
  setLoadExtAction(ISD::EXTLOAD, MVT::f128, MVT::f32, Expand);
  setLoadExtAction(ISD::EXTLOAD, MVT::f128, MVT::f64, Expand);
}

// Floating-point truncation and stores need to be done separately.
setTruncStoreAction(MVT::f64,  MVT::f32, Expand);
setTruncStoreAction(MVT::f128, MVT::f32, Expand);
setTruncStoreAction(MVT::f128, MVT::f64, Expand);

// We have 64-bit FPR<->GPR moves, but need special handling for
// 32-bit forms.
if (!Subtarget.hasVector()) {
  setOperationAction(ISD::BITCAST, MVT::i32, Custom);
  setOperationAction(ISD::BITCAST, MVT::f32, Custom);
}

// VASTART and VACOPY need to deal with the SystemZ-specific varargs
// structure, but VAEND is a no-op.
setOperationAction(ISD::VASTART, MVT::Other, Custom);
setOperationAction(ISD::VACOPY,  MVT::Other, Custom);
setOperationAction(ISD::VAEND,   MVT::Other, Expand);

// Codes for which we want to perform some z-specific combinations.
setTargetDAGCombine(ISD::ZERO_EXTEND);
setTargetDAGCombine(ISD::SIGN_EXTEND);
setTargetDAGCombine(ISD::SIGN_EXTEND_INREG);
setTargetDAGCombine(ISD::LOAD);
setTargetDAGCombine(ISD::STORE);
setTargetDAGCombine(ISD::EXTRACT_VECTOR_ELT);
setTargetDAGCombine(ISD::FP_ROUND);
setTargetDAGCombine(ISD::FP_EXTEND);
setTargetDAGCombine(ISD::BSWAP);
setTargetDAGCombine(ISD::SDIV);
setTargetDAGCombine(ISD::UDIV);
setTargetDAGCombine(ISD::SREM);
setTargetDAGCombine(ISD::UREM);

// Handle intrinsics.
setOperationAction(ISD::INTRINSIC_W_CHAIN, MVT::Other, Custom);
setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);

// We want to use MVC in preference to even a single load/store pair.
MaxStoresPerMemcpy = 0;
MaxStoresPerMemcpyOptSize = 0;

// The main memset sequence is a byte store followed by an MVC.
// Two STC or MV..I stores win over that, but the kind of fused stores
// generated by target-independent code don't when the byte value is
// variable.  E.g.  "STC <reg>;MHI <reg>,257;STH <reg>" is not better
// than "STC;MVC".  Handle the choice in target-specific code instead.
MaxStoresPerMemset = 0;
MaxStoresPerMemsetOptSize = 0;
552}

554EVT SystemZTargetLowering::getSetCCResultType(const DataLayout &DL,
                                            LLVMContext &, EVT VT) const {
if (!VT.isVector())
  return MVT::i32;
return VT.changeVectorElementTypeToInteger();
559}

561bool SystemZTargetLowering::isFMAFasterThanFMulAndFAdd(EVT VT) const {
VT = VT.getScalarType();

if (!VT.isSimple())
  return false;

switch (VT.getSimpleVT().SimpleTy) {
case MVT::f32:
case MVT::f64:
  return true;
case MVT::f128:
  return Subtarget.hasVectorEnhancements1();
default:
  break;
}

return false;
578}

580bool SystemZTargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
// We can load zero using LZ?R and negative zero using LZ?R;LC?BR.
return Imm.isZero() || Imm.isNegZero();
583}

585bool SystemZTargetLowering::isLegalICmpImmediate(int64_t Imm) const {
// We can use CGFI or CLGFI.
return isInt<32>(Imm) || isUInt<32>(Imm);
588}

590bool SystemZTargetLowering::isLegalAddImmediate(int64_t Imm) const {
// We can use ALGFI or SLGFI.
return isUInt<32>(Imm) || isUInt<32>(-Imm);
593}

595bool SystemZTargetLowering::allowsMisalignedMemoryAccesses(EVT VT,
                                                         unsigned,
                                                         unsigned,
                                                         bool *Fast) const {
// Unaligned accesses should never be slower than the expanded version.
// We check specifically for aligned accesses in the few cases where
// they are required.
if (Fast)
  *Fast = true;
return true;
605}

607// Information about the addressing mode for a memory access.
608struct AddressingMode {
// True if a long displacement is supported.
bool LongDisplacement;

// True if use of index register is supported.
bool IndexReg;

AddressingMode(bool LongDispl, bool IdxReg) :
  LongDisplacement(LongDispl), IndexReg(IdxReg) {}
617};

619// Return the desired addressing mode for a Load which has only one use (in
620// the same block) which is a Store.
621static AddressingMode getLoadStoreAddrMode(bool HasVector,
                                        Type *Ty) {
// With vector support a Load->Store combination may be combined to either
// an MVC or vector operations and it seems to work best to allow the
// vector addressing mode.
if (HasVector)
  return AddressingMode(false/*LongDispl*/, true/*IdxReg*/);

// Otherwise only the MVC case is special.
bool MVC = Ty->isIntegerTy(8);
return AddressingMode(!MVC/*LongDispl*/, !MVC/*IdxReg*/);
632}

634// Return the addressing mode which seems most desirable given an LLVM
635// Instruction pointer.
636static AddressingMode
637supportedAddressingMode(Instruction *I, bool HasVector) {
if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
  switch (II->getIntrinsicID()) {
  default: break;
  case Intrinsic::memset:
  case Intrinsic::memmove:
  case Intrinsic::memcpy:
    return AddressingMode(false/*LongDispl*/, false/*IdxReg*/);
  }
}

if (isa<LoadInst>(I) && I->hasOneUse()) {
  auto *SingleUser = dyn_cast<Instruction>(*I->user_begin());
  if (SingleUser->getParent() == I->getParent()) {
    if (isa<ICmpInst>(SingleUser)) {
      if (auto *C = dyn_cast<ConstantInt>(SingleUser->getOperand(1)))
        if (C->getBitWidth() <= 64 &&
            (isInt<16>(C->getSExtValue()) || isUInt<16>(C->getZExtValue())))
          // Comparison of memory with 16 bit signed / unsigned immediate
          return AddressingMode(false/*LongDispl*/, false/*IdxReg*/);
    } else if (isa<StoreInst>(SingleUser))
      // Load->Store
      return getLoadStoreAddrMode(HasVector, I->getType());
  }
} else if (auto *StoreI = dyn_cast<StoreInst>(I)) {
  if (auto *LoadI = dyn_cast<LoadInst>(StoreI->getValueOperand()))
    if (LoadI->hasOneUse() && LoadI->getParent() == I->getParent())
      // Load->Store
      return getLoadStoreAddrMode(HasVector, LoadI->getType());
}

if (HasVector && (isa<LoadInst>(I) || isa<StoreInst>(I))) {

  // * Use LDE instead of LE/LEY for z13 to avoid partial register
  //   dependencies (LDE only supports small offsets).
  // * Utilize the vector registers to hold floating point
  //   values (vector load / store instructions only support small
  //   offsets).

  Type *MemAccessTy = (isa<LoadInst>(I) ? I->getType() :
                       I->getOperand(0)->getType());
  bool IsFPAccess = MemAccessTy->isFloatingPointTy();
  bool IsVectorAccess = MemAccessTy->isVectorTy();

  // A store of an extracted vector element will be combined into a VSTE type
  // instruction.
  if (!IsVectorAccess && isa<StoreInst>(I)) {
    Value *DataOp = I->getOperand(0);
    if (isa<ExtractElementInst>(DataOp))
      IsVectorAccess = true;
  }

  // A load which gets inserted into a vector element will be combined into a
  // VLE type instruction.
  if (!IsVectorAccess && isa<LoadInst>(I) && I->hasOneUse()) {
    User *LoadUser = *I->user_begin();
    if (isa<InsertElementInst>(LoadUser))
      IsVectorAccess = true;
  }

  if (IsFPAccess || IsVectorAccess)
    return AddressingMode(false/*LongDispl*/, true/*IdxReg*/);
}

return AddressingMode(true/*LongDispl*/, true/*IdxReg*/);
702}

704bool SystemZTargetLowering::isLegalAddressingMode(const DataLayout &DL,
     const AddrMode &AM, Type *Ty, unsigned AS, Instruction *I) const {
// Punt on globals for now, although they can be used in limited
// RELATIVE LONG cases.
if (AM.BaseGV)
  return false;

// Require a 20-bit signed offset.
if (!isInt<20>(AM.BaseOffs))
  return false;

AddressingMode SupportedAM(true, true);
if (I != nullptr)
  SupportedAM = supportedAddressingMode(I, Subtarget.hasVector());

if (!SupportedAM.LongDisplacement && !isUInt<12>(AM.BaseOffs))
  return false;

if (!SupportedAM.IndexReg)
  // No indexing allowed.
  return AM.Scale == 0;
else
  // Indexing is OK but no scale factor can be applied.
  return AM.Scale == 0 || AM.Scale == 1;
728}

730bool SystemZTargetLowering::isTruncateFree(Type *FromType, Type *ToType) const {
if (!FromType->isIntegerTy() || !ToType->isIntegerTy())
  return false;
unsigned FromBits = FromType->getPrimitiveSizeInBits();
unsigned ToBits = ToType->getPrimitiveSizeInBits();
return FromBits > ToBits;
736}

738bool SystemZTargetLowering::isTruncateFree(EVT FromVT, EVT ToVT) const {
if (!FromVT.isInteger() || !ToVT.isInteger())
  return false;
unsigned FromBits = FromVT.getSizeInBits();
unsigned ToBits = ToVT.getSizeInBits();
return FromBits > ToBits;
744}

746//===----------------------------------------------------------------------===//
747// Inline asm support
748//===----------------------------------------------------------------------===//

750TargetLowering::ConstraintType
751SystemZTargetLowering::getConstraintType(StringRef Constraint) const {
if (Constraint.size() == 1) {
  switch (Constraint[0]) {
  case 'a': // Address register
  case 'd': // Data register (equivalent to 'r')
  case 'f': // Floating-point register
  case 'h': // High-part register
  case 'r': // General-purpose register
  case 'v': // Vector register
    return C_RegisterClass;

  case 'Q': // Memory with base and unsigned 12-bit displacement
  case 'R': // Likewise, plus an index
  case 'S': // Memory with base and signed 20-bit displacement
  case 'T': // Likewise, plus an index
  case 'm': // Equivalent to 'T'.
    return C_Memory;

  case 'I': // Unsigned 8-bit constant
  case 'J': // Unsigned 12-bit constant
  case 'K': // Signed 16-bit constant
  case 'L': // Signed 20-bit displacement (on all targets we support)
  case 'M': // 0x7fffffff
    return C_Other;

  default:
    break;
  }
}
return TargetLowering::getConstraintType(Constraint);
781}

783TargetLowering::ConstraintWeight SystemZTargetLowering::
784getSingleConstraintMatchWeight(AsmOperandInfo &info,
                             const char *constraint) const {
ConstraintWeight weight = CW_Invalid;
Value *CallOperandVal = info.CallOperandVal;
// If we don't have a value, we can't do a match,
// but allow it at the lowest weight.
if (!CallOperandVal)
  return CW_Default;
Type *type = CallOperandVal->getType();
// Look at the constraint type.
switch (*constraint) {
default:
  weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
  break;

case 'a': // Address register
case 'd': // Data register (equivalent to 'r')
case 'h': // High-part register
case 'r': // General-purpose register
  if (CallOperandVal->getType()->isIntegerTy())
    weight = CW_Register;
  break;

case 'f': // Floating-point register
  if (type->isFloatingPointTy())
    weight = CW_Register;
  break;

case 'v': // Vector register
  if ((type->isVectorTy() || type->isFloatingPointTy()) &&
      Subtarget.hasVector())
    weight = CW_Register;
  break;

case 'I': // Unsigned 8-bit constant
  if (auto *C = dyn_cast<ConstantInt>(CallOperandVal))
    if (isUInt<8>(C->getZExtValue()))
      weight = CW_Constant;
  break;

case 'J': // Unsigned 12-bit constant
  if (auto *C = dyn_cast<ConstantInt>(CallOperandVal))
    if (isUInt<12>(C->getZExtValue()))
      weight = CW_Constant;
  break;

case 'K': // Signed 16-bit constant
  if (auto *C = dyn_cast<ConstantInt>(CallOperandVal))
    if (isInt<16>(C->getSExtValue()))
      weight = CW_Constant;
  break;

case 'L': // Signed 20-bit displacement (on all targets we support)
  if (auto *C = dyn_cast<ConstantInt>(CallOperandVal))
    if (isInt<20>(C->getSExtValue()))
      weight = CW_Constant;
  break;

case 'M': // 0x7fffffff
  if (auto *C = dyn_cast<ConstantInt>(CallOperandVal))
    if (C->getZExtValue() == 0x7fffffff)
      weight = CW_Constant;
  break;
}
return weight;
849}

851// Parse a "{tNNN}" register constraint for which the register type "t"
852// has already been verified.  MC is the class associated with "t" and
853// Map maps 0-based register numbers to LLVM register numbers.
854static std::pair<unsigned, const TargetRegisterClass *>
855parseRegisterNumber(StringRef Constraint, const TargetRegisterClass *RC,
                  const unsigned *Map, unsigned Size) {
assert(*(Constraint.end()-1) == '}' && "Missing '}'")((*(Constraint.end()-1) == '}' && "Missing '}'") ? static_cast
<void> (0) : __assert_fail ("*(Constraint.end()-1) == '}' && \"Missing '}'\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 857, __PRETTY_FUNCTION__));
if (isdigit(Constraint[2])) {
  unsigned Index;
  bool Failed =
      Constraint.slice(2, Constraint.size() - 1).getAsInteger(10, Index);
  if (!Failed && Index < Size && Map[Index])
    return std::make_pair(Map[Index], RC);
}
return std::make_pair(0U, nullptr);
866}

868std::pair<unsigned, const TargetRegisterClass *>
869SystemZTargetLowering::getRegForInlineAsmConstraint(
  const TargetRegisterInfo *TRI, StringRef Constraint, MVT VT) const {
if (Constraint.size() == 1) {
  // GCC Constraint Letters
  switch (Constraint[0]) {
  default: break;
  case 'd': // Data register (equivalent to 'r')
  case 'r': // General-purpose register
    if (VT == MVT::i64)
      return std::make_pair(0U, &SystemZ::GR64BitRegClass);
    else if (VT == MVT::i128)
      return std::make_pair(0U, &SystemZ::GR128BitRegClass);
    return std::make_pair(0U, &SystemZ::GR32BitRegClass);

  case 'a': // Address register
    if (VT == MVT::i64)
      return std::make_pair(0U, &SystemZ::ADDR64BitRegClass);
    else if (VT == MVT::i128)
      return std::make_pair(0U, &SystemZ::ADDR128BitRegClass);
    return std::make_pair(0U, &SystemZ::ADDR32BitRegClass);

  case 'h': // High-part register (an LLVM extension)
    return std::make_pair(0U, &SystemZ::GRH32BitRegClass);

  case 'f': // Floating-point register
    if (VT == MVT::f64)
      return std::make_pair(0U, &SystemZ::FP64BitRegClass);
    else if (VT == MVT::f128)
      return std::make_pair(0U, &SystemZ::FP128BitRegClass);
    return std::make_pair(0U, &SystemZ::FP32BitRegClass);

  case 'v': // Vector register
    if (Subtarget.hasVector()) {
      if (VT == MVT::f32)
        return std::make_pair(0U, &SystemZ::VR32BitRegClass);
      if (VT == MVT::f64)
        return std::make_pair(0U, &SystemZ::VR64BitRegClass);
      return std::make_pair(0U, &SystemZ::VR128BitRegClass);
    }
    break;
  }
}
if (Constraint.size() > 0 && Constraint[0] == '{') {
  // We need to override the default register parsing for GPRs and FPRs
  // because the interpretation depends on VT.  The internal names of
  // the registers are also different from the external names
  // (F0D and F0S instead of F0, etc.).
  if (Constraint[1] == 'r') {
    if (VT == MVT::i32)
      return parseRegisterNumber(Constraint, &SystemZ::GR32BitRegClass,
                                 SystemZMC::GR32Regs, 16);
    if (VT == MVT::i128)
      return parseRegisterNumber(Constraint, &SystemZ::GR128BitRegClass,
                                 SystemZMC::GR128Regs, 16);
    return parseRegisterNumber(Constraint, &SystemZ::GR64BitRegClass,
                               SystemZMC::GR64Regs, 16);
  }
  if (Constraint[1] == 'f') {
    if (VT == MVT::f32)
      return parseRegisterNumber(Constraint, &SystemZ::FP32BitRegClass,
                                 SystemZMC::FP32Regs, 16);
    if (VT == MVT::f128)
      return parseRegisterNumber(Constraint, &SystemZ::FP128BitRegClass,
                                 SystemZMC::FP128Regs, 16);
    return parseRegisterNumber(Constraint, &SystemZ::FP64BitRegClass,
                               SystemZMC::FP64Regs, 16);
  }
  if (Constraint[1] == 'v') {
    if (VT == MVT::f32)
      return parseRegisterNumber(Constraint, &SystemZ::VR32BitRegClass,
                                 SystemZMC::VR32Regs, 32);
    if (VT == MVT::f64)
      return parseRegisterNumber(Constraint, &SystemZ::VR64BitRegClass,
                                 SystemZMC::VR64Regs, 32);
    return parseRegisterNumber(Constraint, &SystemZ::VR128BitRegClass,
                               SystemZMC::VR128Regs, 32);
  }
}
return TargetLowering::getRegForInlineAsmConstraint(TRI, Constraint, VT);
948}

950void SystemZTargetLowering::
951LowerAsmOperandForConstraint(SDValue Op, std::string &Constraint,
                           std::vector<SDValue> &Ops,
                           SelectionDAG &DAG) const {
// Only support length 1 constraints for now.
if (Constraint.length() == 1) {
  switch (Constraint[0]) {
  case 'I': // Unsigned 8-bit constant
    if (auto *C = dyn_cast<ConstantSDNode>(Op))
      if (isUInt<8>(C->getZExtValue()))
        Ops.push_back(DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
                                            Op.getValueType()));
    return;

  case 'J': // Unsigned 12-bit constant
    if (auto *C = dyn_cast<ConstantSDNode>(Op))
      if (isUInt<12>(C->getZExtValue()))
        Ops.push_back(DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
                                            Op.getValueType()));
    return;

  case 'K': // Signed 16-bit constant
    if (auto *C = dyn_cast<ConstantSDNode>(Op))
      if (isInt<16>(C->getSExtValue()))
        Ops.push_back(DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op),
                                            Op.getValueType()));
    return;

  case 'L': // Signed 20-bit displacement (on all targets we support)
    if (auto *C = dyn_cast<ConstantSDNode>(Op))
      if (isInt<20>(C->getSExtValue()))
        Ops.push_back(DAG.getTargetConstant(C->getSExtValue(), SDLoc(Op),
                                            Op.getValueType()));
    return;

  case 'M': // 0x7fffffff
    if (auto *C = dyn_cast<ConstantSDNode>(Op))
      if (C->getZExtValue() == 0x7fffffff)
        Ops.push_back(DAG.getTargetConstant(C->getZExtValue(), SDLoc(Op),
                                            Op.getValueType()));
    return;
  }
}
TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
994}

996//===----------------------------------------------------------------------===//
997// Calling conventions
998//===----------------------------------------------------------------------===//

1000#include "SystemZGenCallingConv.inc"

1002const MCPhysReg *SystemZTargetLowering::getScratchRegisters(
CallingConv::ID) const {
static const MCPhysReg ScratchRegs[] = { SystemZ::R0D, SystemZ::R1D,
                                         SystemZ::R14D, 0 };
return ScratchRegs;
1007}

1009bool SystemZTargetLowering::allowTruncateForTailCall(Type *FromType,
                                                   Type *ToType) const {
return isTruncateFree(FromType, ToType);
1012}

1014bool SystemZTargetLowering::mayBeEmittedAsTailCall(const CallInst *CI) const {
return CI->isTailCall();
1016}

1018// We do not yet support 128-bit single-element vector types.  If the user
1019// attempts to use such types as function argument or return type, prefer
1020// to error out instead of emitting code violating the ABI.
1021static void VerifyVectorType(MVT VT, EVT ArgVT) {
if (ArgVT.isVector() && !VT.isVector())
  report_fatal_error("Unsupported vector argument or return type");
1024}

1026static void VerifyVectorTypes(const SmallVectorImpl<ISD::InputArg> &Ins) {
for (unsigned i = 0; i < Ins.size(); ++i)
  VerifyVectorType(Ins[i].VT, Ins[i].ArgVT);
1029}

1031static void VerifyVectorTypes(const SmallVectorImpl<ISD::OutputArg> &Outs) {
for (unsigned i = 0; i < Outs.size(); ++i)
  VerifyVectorType(Outs[i].VT, Outs[i].ArgVT);
1034}

1036// Value is a value that has been passed to us in the location described by VA
1037// (and so has type VA.getLocVT()).  Convert Value to VA.getValVT(), chaining
1038// any loads onto Chain.
1039static SDValue convertLocVTToValVT(SelectionDAG &DAG, const SDLoc &DL,
                                 CCValAssign &VA, SDValue Chain,
                                 SDValue Value) {
// If the argument has been promoted from a smaller type, insert an
// assertion to capture this.
if (VA.getLocInfo() == CCValAssign::SExt)
  Value = DAG.getNode(ISD::AssertSext, DL, VA.getLocVT(), Value,
                      DAG.getValueType(VA.getValVT()));
else if (VA.getLocInfo() == CCValAssign::ZExt)
  Value = DAG.getNode(ISD::AssertZext, DL, VA.getLocVT(), Value,
                      DAG.getValueType(VA.getValVT()));

if (VA.isExtInLoc())
  Value = DAG.getNode(ISD::TRUNCATE, DL, VA.getValVT(), Value);
else if (VA.getLocInfo() == CCValAssign::BCvt) {
  // If this is a short vector argument loaded from the stack,
  // extend from i64 to full vector size and then bitcast.
  assert(VA.getLocVT() == MVT::i64)((VA.getLocVT() == MVT::i64) ? static_cast<void> (0) : __assert_fail
 ("VA.getLocVT() == MVT::i64", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1056, __PRETTY_FUNCTION__));
  assert(VA.getValVT().isVector())((VA.getValVT().isVector()) ? static_cast<void> (0) : __assert_fail
 ("VA.getValVT().isVector()", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1057, __PRETTY_FUNCTION__));
  Value = DAG.getBuildVector(MVT::v2i64, DL, {Value, DAG.getUNDEF(MVT::i64)});
  Value = DAG.getNode(ISD::BITCAST, DL, VA.getValVT(), Value);
} else
  assert(VA.getLocInfo() == CCValAssign::Full && "Unsupported getLocInfo")((VA.getLocInfo() == CCValAssign::Full && "Unsupported getLocInfo"
) ? static_cast<void> (0) : __assert_fail ("VA.getLocInfo() == CCValAssign::Full && \"Unsupported getLocInfo\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1061, __PRETTY_FUNCTION__));
return Value;
1063}

1065// Value is a value of type VA.getValVT() that we need to copy into
1066// the location described by VA.  Return a copy of Value converted to
1067// VA.getValVT().  The caller is responsible for handling indirect values.
1068static SDValue convertValVTToLocVT(SelectionDAG &DAG, const SDLoc &DL,
                                 CCValAssign &VA, SDValue Value) {
switch (VA.getLocInfo()) {
case CCValAssign::SExt:
  return DAG.getNode(ISD::SIGN_EXTEND, DL, VA.getLocVT(), Value);
case CCValAssign::ZExt:
  return DAG.getNode(ISD::ZERO_EXTEND, DL, VA.getLocVT(), Value);
case CCValAssign::AExt:
  return DAG.getNode(ISD::ANY_EXTEND, DL, VA.getLocVT(), Value);
case CCValAssign::BCvt:
  // If this is a short vector argument to be stored to the stack,
  // bitcast to v2i64 and then extract first element.
  assert(VA.getLocVT() == MVT::i64)((VA.getLocVT() == MVT::i64) ? static_cast<void> (0) : __assert_fail
 ("VA.getLocVT() == MVT::i64", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1080, __PRETTY_FUNCTION__));
  assert(VA.getValVT().isVector())((VA.getValVT().isVector()) ? static_cast<void> (0) : __assert_fail
 ("VA.getValVT().isVector()", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1081, __PRETTY_FUNCTION__));
  Value = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, Value);
  return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, VA.getLocVT(), Value,
                     DAG.getConstant(0, DL, MVT::i32));
case CCValAssign::Full:
  return Value;
default:
  llvm_unreachable("Unhandled getLocInfo()")::llvm::llvm_unreachable_internal("Unhandled getLocInfo()", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1088);
}
1090}

1092SDValue SystemZTargetLowering::LowerFormalArguments(
  SDValue Chain, CallingConv::ID CallConv, bool IsVarArg,
  const SmallVectorImpl<ISD::InputArg> &Ins, const SDLoc &DL,
  SelectionDAG &DAG, SmallVectorImpl<SDValue> &InVals) const {
MachineFunction &MF = DAG.getMachineFunction();
MachineFrameInfo &MFI = MF.getFrameInfo();
MachineRegisterInfo &MRI = MF.getRegInfo();
SystemZMachineFunctionInfo *FuncInfo =
    MF.getInfo<SystemZMachineFunctionInfo>();
auto *TFL =
    static_cast<const SystemZFrameLowering *>(Subtarget.getFrameLowering());
EVT PtrVT = getPointerTy(DAG.getDataLayout());

// Detect unsupported vector argument types.
if (Subtarget.hasVector())
  VerifyVectorTypes(Ins);

// Assign locations to all of the incoming arguments.
SmallVector<CCValAssign, 16> ArgLocs;
SystemZCCState CCInfo(CallConv, IsVarArg, MF, ArgLocs, *DAG.getContext());
CCInfo.AnalyzeFormalArguments(Ins, CC_SystemZ);

unsigned NumFixedGPRs = 0;
unsigned NumFixedFPRs = 0;
for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
  SDValue ArgValue;
  CCValAssign &VA = ArgLocs[I];
  EVT LocVT = VA.getLocVT();
  if (VA.isRegLoc()) {
    // Arguments passed in registers
    const TargetRegisterClass *RC;
    switch (LocVT.getSimpleVT().SimpleTy) {
    default:
      // Integers smaller than i64 should be promoted to i64.
      llvm_unreachable("Unexpected argument type")::llvm::llvm_unreachable_internal("Unexpected argument type",
 "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1126);
    case MVT::i32:
      NumFixedGPRs += 1;
      RC = &SystemZ::GR32BitRegClass;
      break;
    case MVT::i64:
      NumFixedGPRs += 1;
      RC = &SystemZ::GR64BitRegClass;
      break;
    case MVT::f32:
      NumFixedFPRs += 1;
      RC = &SystemZ::FP32BitRegClass;
      break;
    case MVT::f64:
      NumFixedFPRs += 1;
      RC = &SystemZ::FP64BitRegClass;
      break;
    case MVT::v16i8:
    case MVT::v8i16:
    case MVT::v4i32:
    case MVT::v2i64:
    case MVT::v4f32:
    case MVT::v2f64:
      RC = &SystemZ::VR128BitRegClass;
      break;
    }

    unsigned VReg = MRI.createVirtualRegister(RC);
    MRI.addLiveIn(VA.getLocReg(), VReg);
    ArgValue = DAG.getCopyFromReg(Chain, DL, VReg, LocVT);
  } else {
    assert(VA.isMemLoc() && "Argument not register or memory")((VA.isMemLoc() && "Argument not register or memory")
 ? static_cast<void> (0) : __assert_fail ("VA.isMemLoc() && \"Argument not register or memory\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1157, __PRETTY_FUNCTION__));

    // Create the frame index object for this incoming parameter.
    int FI = MFI.CreateFixedObject(LocVT.getSizeInBits() / 8,
                                   VA.getLocMemOffset(), true);

    // Create the SelectionDAG nodes corresponding to a load
    // from this parameter.  Unpromoted ints and floats are
    // passed as right-justified 8-byte values.
    SDValue FIN = DAG.getFrameIndex(FI, PtrVT);
    if (VA.getLocVT() == MVT::i32 || VA.getLocVT() == MVT::f32)
      FIN = DAG.getNode(ISD::ADD, DL, PtrVT, FIN,
                        DAG.getIntPtrConstant(4, DL));
    ArgValue = DAG.getLoad(LocVT, DL, Chain, FIN,
                           MachinePointerInfo::getFixedStack(MF, FI));
  }

  // Convert the value of the argument register into the value that's
  // being passed.
  if (VA.getLocInfo() == CCValAssign::Indirect) {
    InVals.push_back(DAG.getLoad(VA.getValVT(), DL, Chain, ArgValue,
                                 MachinePointerInfo()));
    // If the original argument was split (e.g. i128), we need
    // to load all parts of it here (using the same address).
    unsigned ArgIndex = Ins[I].OrigArgIndex;
    assert (Ins[I].PartOffset == 0)((Ins[I].PartOffset == 0) ? static_cast<void> (0) : __assert_fail
 ("Ins[I].PartOffset == 0", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1182, __PRETTY_FUNCTION__));
    while (I + 1 != E && Ins[I + 1].OrigArgIndex == ArgIndex) {
      CCValAssign &PartVA = ArgLocs[I + 1];
      unsigned PartOffset = Ins[I + 1].PartOffset;
      SDValue Address = DAG.getNode(ISD::ADD, DL, PtrVT, ArgValue,
                                    DAG.getIntPtrConstant(PartOffset, DL));
      InVals.push_back(DAG.getLoad(PartVA.getValVT(), DL, Chain, Address,
                                   MachinePointerInfo()));
      ++I;
    }
  } else
    InVals.push_back(convertLocVTToValVT(DAG, DL, VA, Chain, ArgValue));
}

if (IsVarArg) {
  // Save the number of non-varargs registers for later use by va_start, etc.
  FuncInfo->setVarArgsFirstGPR(NumFixedGPRs);
  FuncInfo->setVarArgsFirstFPR(NumFixedFPRs);

  // Likewise the address (in the form of a frame index) of where the
  // first stack vararg would be.  The 1-byte size here is arbitrary.
  int64_t StackSize = CCInfo.getNextStackOffset();
  FuncInfo->setVarArgsFrameIndex(MFI.CreateFixedObject(1, StackSize, true));

  // ...and a similar frame index for the caller-allocated save area
  // that will be used to store the incoming registers.
  int64_t RegSaveOffset = TFL->getOffsetOfLocalArea();
  unsigned RegSaveIndex = MFI.CreateFixedObject(1, RegSaveOffset, true);
  FuncInfo->setRegSaveFrameIndex(RegSaveIndex);

  // Store the FPR varargs in the reserved frame slots.  (We store the
  // GPRs as part of the prologue.)
  if (NumFixedFPRs < SystemZ::NumArgFPRs) {
    SDValue MemOps[SystemZ::NumArgFPRs];
    for (unsigned I = NumFixedFPRs; I < SystemZ::NumArgFPRs; ++I) {
      unsigned Offset = TFL->getRegSpillOffset(SystemZ::ArgFPRs[I]);
      int FI = MFI.CreateFixedObject(8, RegSaveOffset + Offset, true);
      SDValue FIN = DAG.getFrameIndex(FI, getPointerTy(DAG.getDataLayout()));
      unsigned VReg = MF.addLiveIn(SystemZ::ArgFPRs[I],
                                   &SystemZ::FP64BitRegClass);
      SDValue ArgValue = DAG.getCopyFromReg(Chain, DL, VReg, MVT::f64);
      MemOps[I] = DAG.getStore(ArgValue.getValue(1), DL, ArgValue, FIN,
                               MachinePointerInfo::getFixedStack(MF, FI));
    }
    // Join the stores, which are independent of one another.
    Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
                        makeArrayRef(&MemOps[NumFixedFPRs],
                                     SystemZ::NumArgFPRs-NumFixedFPRs));
  }
}

return Chain;
1234}

1236static bool canUseSiblingCall(const CCState &ArgCCInfo,
                            SmallVectorImpl<CCValAssign> &ArgLocs,
                            SmallVectorImpl<ISD::OutputArg> &Outs) {
// Punt if there are any indirect or stack arguments, or if the call
// needs the callee-saved argument register R6, or if the call uses
// the callee-saved register arguments SwiftSelf and SwiftError.
for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
  CCValAssign &VA = ArgLocs[I];
  if (VA.getLocInfo() == CCValAssign::Indirect)
    return false;
  if (!VA.isRegLoc())
    return false;
  unsigned Reg = VA.getLocReg();
  if (Reg == SystemZ::R6H || Reg == SystemZ::R6L || Reg == SystemZ::R6D)
    return false;
  if (Outs[I].Flags.isSwiftSelf() || Outs[I].Flags.isSwiftError())
    return false;
}
return true;
1255}

1257SDValue
1258SystemZTargetLowering::LowerCall(CallLoweringInfo &CLI,
                               SmallVectorImpl<SDValue> &InVals) const {
SelectionDAG &DAG = CLI.DAG;
SDLoc &DL = CLI.DL;
SmallVectorImpl<ISD::OutputArg> &Outs = CLI.Outs;
SmallVectorImpl<SDValue> &OutVals = CLI.OutVals;
SmallVectorImpl<ISD::InputArg> &Ins = CLI.Ins;
SDValue Chain = CLI.Chain;
SDValue Callee = CLI.Callee;
bool &IsTailCall = CLI.IsTailCall;
CallingConv::ID CallConv = CLI.CallConv;
bool IsVarArg = CLI.IsVarArg;
MachineFunction &MF = DAG.getMachineFunction();
EVT PtrVT = getPointerTy(MF.getDataLayout());

// Detect unsupported vector argument and return types.
if (Subtarget.hasVector()) {
  VerifyVectorTypes(Outs);
  VerifyVectorTypes(Ins);
}

// Analyze the operands of the call, assigning locations to each operand.
SmallVector<CCValAssign, 16> ArgLocs;
SystemZCCState ArgCCInfo(CallConv, IsVarArg, MF, ArgLocs, *DAG.getContext());
ArgCCInfo.AnalyzeCallOperands(Outs, CC_SystemZ);

// We don't support GuaranteedTailCallOpt, only automatically-detected
// sibling calls.
if (IsTailCall && !canUseSiblingCall(ArgCCInfo, ArgLocs, Outs))
  IsTailCall = false;

// Get a count of how many bytes are to be pushed on the stack.
unsigned NumBytes = ArgCCInfo.getNextStackOffset();

// Mark the start of the call.
if (!IsTailCall)
  Chain = DAG.getCALLSEQ_START(Chain, NumBytes, 0, DL);

// Copy argument values to their designated locations.
SmallVector<std::pair<unsigned, SDValue>, 9> RegsToPass;
SmallVector<SDValue, 8> MemOpChains;
SDValue StackPtr;
for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
  CCValAssign &VA = ArgLocs[I];
  SDValue ArgValue = OutVals[I];

  if (VA.getLocInfo() == CCValAssign::Indirect) {
    // Store the argument in a stack slot and pass its address.
    SDValue SpillSlot = DAG.CreateStackTemporary(Outs[I].ArgVT);
    int FI = cast<FrameIndexSDNode>(SpillSlot)->getIndex();
    MemOpChains.push_back(
        DAG.getStore(Chain, DL, ArgValue, SpillSlot,
                     MachinePointerInfo::getFixedStack(MF, FI)));
    // If the original argument was split (e.g. i128), we need
    // to store all parts of it here (and pass just one address).
    unsigned ArgIndex = Outs[I].OrigArgIndex;
    assert (Outs[I].PartOffset == 0)((Outs[I].PartOffset == 0) ? static_cast<void> (0) : __assert_fail
 ("Outs[I].PartOffset == 0", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1314, __PRETTY_FUNCTION__));
    while (I + 1 != E && Outs[I + 1].OrigArgIndex == ArgIndex) {
      SDValue PartValue = OutVals[I + 1];
      unsigned PartOffset = Outs[I + 1].PartOffset;
      SDValue Address = DAG.getNode(ISD::ADD, DL, PtrVT, SpillSlot,
                                    DAG.getIntPtrConstant(PartOffset, DL));
      MemOpChains.push_back(
          DAG.getStore(Chain, DL, PartValue, Address,
                       MachinePointerInfo::getFixedStack(MF, FI)));
      ++I;
    }
    ArgValue = SpillSlot;
  } else
    ArgValue = convertValVTToLocVT(DAG, DL, VA, ArgValue);

  if (VA.isRegLoc())
    // Queue up the argument copies and emit them at the end.
    RegsToPass.push_back(std::make_pair(VA.getLocReg(), ArgValue));
  else {
    assert(VA.isMemLoc() && "Argument not register or memory")((VA.isMemLoc() && "Argument not register or memory")
 ? static_cast<void> (0) : __assert_fail ("VA.isMemLoc() && \"Argument not register or memory\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1333, __PRETTY_FUNCTION__));

    // Work out the address of the stack slot.  Unpromoted ints and
    // floats are passed as right-justified 8-byte values.
    if (!StackPtr.getNode())
      StackPtr = DAG.getCopyFromReg(Chain, DL, SystemZ::R15D, PtrVT);
    unsigned Offset = SystemZMC::CallFrameSize + VA.getLocMemOffset();
    if (VA.getLocVT() == MVT::i32 || VA.getLocVT() == MVT::f32)
      Offset += 4;
    SDValue Address = DAG.getNode(ISD::ADD, DL, PtrVT, StackPtr,
                                  DAG.getIntPtrConstant(Offset, DL));

    // Emit the store.
    MemOpChains.push_back(
        DAG.getStore(Chain, DL, ArgValue, Address, MachinePointerInfo()));
  }
}

// Join the stores, which are independent of one another.
if (!MemOpChains.empty())
  Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOpChains);

// Accept direct calls by converting symbolic call addresses to the
// associated Target* opcodes.  Force %r1 to be used for indirect
// tail calls.
SDValue Glue;
if (auto *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
  Callee = DAG.getTargetGlobalAddress(G->getGlobal(), DL, PtrVT);
  Callee = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Callee);
} else if (auto *E = dyn_cast<ExternalSymbolSDNode>(Callee)) {
  Callee = DAG.getTargetExternalSymbol(E->getSymbol(), PtrVT);
  Callee = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Callee);
} else if (IsTailCall) {
  Chain = DAG.getCopyToReg(Chain, DL, SystemZ::R1D, Callee, Glue);
  Glue = Chain.getValue(1);
  Callee = DAG.getRegister(SystemZ::R1D, Callee.getValueType());
}

// Build a sequence of copy-to-reg nodes, chained and glued together.
for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I) {
  Chain = DAG.getCopyToReg(Chain, DL, RegsToPass[I].first,
                           RegsToPass[I].second, Glue);
  Glue = Chain.getValue(1);
}

// The first call operand is the chain and the second is the target address.
SmallVector<SDValue, 8> Ops;
Ops.push_back(Chain);
Ops.push_back(Callee);

// Add argument registers to the end of the list so that they are
// known live into the call.
for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I)
  Ops.push_back(DAG.getRegister(RegsToPass[I].first,
                                RegsToPass[I].second.getValueType()));

// Add a register mask operand representing the call-preserved registers.
const TargetRegisterInfo *TRI = Subtarget.getRegisterInfo();
const uint32_t *Mask = TRI->getCallPreservedMask(MF, CallConv);
assert(Mask && "Missing call preserved mask for calling convention")((Mask && "Missing call preserved mask for calling convention"
) ? static_cast<void> (0) : __assert_fail ("Mask && \"Missing call preserved mask for calling convention\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1392, __PRETTY_FUNCTION__));
Ops.push_back(DAG.getRegisterMask(Mask));

// Glue the call to the argument copies, if any.
if (Glue.getNode())
  Ops.push_back(Glue);

// Emit the call.
SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
if (IsTailCall)
  return DAG.getNode(SystemZISD::SIBCALL, DL, NodeTys, Ops);
Chain = DAG.getNode(SystemZISD::CALL, DL, NodeTys, Ops);
Glue = Chain.getValue(1);

// Mark the end of the call, which is glued to the call itself.
Chain = DAG.getCALLSEQ_END(Chain,
                           DAG.getConstant(NumBytes, DL, PtrVT, true),
                           DAG.getConstant(0, DL, PtrVT, true),
                           Glue, DL);
Glue = Chain.getValue(1);

// Assign locations to each value returned by this call.
SmallVector<CCValAssign, 16> RetLocs;
CCState RetCCInfo(CallConv, IsVarArg, MF, RetLocs, *DAG.getContext());
RetCCInfo.AnalyzeCallResult(Ins, RetCC_SystemZ);

// Copy all of the result registers out of their specified physreg.
for (unsigned I = 0, E = RetLocs.size(); I != E; ++I) {
  CCValAssign &VA = RetLocs[I];

  // Copy the value out, gluing the copy to the end of the call sequence.
  SDValue RetValue = DAG.getCopyFromReg(Chain, DL, VA.getLocReg(),
                                        VA.getLocVT(), Glue);
  Chain = RetValue.getValue(1);
  Glue = RetValue.getValue(2);

  // Convert the value of the return register into the value that's
  // being returned.
  InVals.push_back(convertLocVTToValVT(DAG, DL, VA, Chain, RetValue));
}

return Chain;
1434}

1436bool SystemZTargetLowering::
1437CanLowerReturn(CallingConv::ID CallConv,
             MachineFunction &MF, bool isVarArg,
             const SmallVectorImpl<ISD::OutputArg> &Outs,
             LLVMContext &Context) const {
// Detect unsupported vector return types.
if (Subtarget.hasVector())
  VerifyVectorTypes(Outs);

// Special case that we cannot easily detect in RetCC_SystemZ since
// i128 is not a legal type.
for (auto &Out : Outs)
  if (Out.ArgVT == MVT::i128)
    return false;

SmallVector<CCValAssign, 16> RetLocs;
CCState RetCCInfo(CallConv, isVarArg, MF, RetLocs, Context);
return RetCCInfo.CheckReturn(Outs, RetCC_SystemZ);
1454}

1456SDValue
1457SystemZTargetLowering::LowerReturn(SDValue Chain, CallingConv::ID CallConv,
                                 bool IsVarArg,
                                 const SmallVectorImpl<ISD::OutputArg> &Outs,
                                 const SmallVectorImpl<SDValue> &OutVals,
                                 const SDLoc &DL, SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();

// Detect unsupported vector return types.
if (Subtarget.hasVector())
  VerifyVectorTypes(Outs);

// Assign locations to each returned value.
SmallVector<CCValAssign, 16> RetLocs;
CCState RetCCInfo(CallConv, IsVarArg, MF, RetLocs, *DAG.getContext());
RetCCInfo.AnalyzeReturn(Outs, RetCC_SystemZ);

// Quick exit for void returns
if (RetLocs.empty())
  return DAG.getNode(SystemZISD::RET_FLAG, DL, MVT::Other, Chain);

// Copy the result values into the output registers.
SDValue Glue;
SmallVector<SDValue, 4> RetOps;
RetOps.push_back(Chain);
for (unsigned I = 0, E = RetLocs.size(); I != E; ++I) {
  CCValAssign &VA = RetLocs[I];
  SDValue RetValue = OutVals[I];

  // Make the return register live on exit.
  assert(VA.isRegLoc() && "Can only return in registers!")((VA.isRegLoc() && "Can only return in registers!") ?
 static_cast<void> (0) : __assert_fail ("VA.isRegLoc() && \"Can only return in registers!\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1486, __PRETTY_FUNCTION__));

  // Promote the value as required.
  RetValue = convertValVTToLocVT(DAG, DL, VA, RetValue);

  // Chain and glue the copies together.
  unsigned Reg = VA.getLocReg();
  Chain = DAG.getCopyToReg(Chain, DL, Reg, RetValue, Glue);
  Glue = Chain.getValue(1);
  RetOps.push_back(DAG.getRegister(Reg, VA.getLocVT()));
}

// Update chain and glue.
RetOps[0] = Chain;
if (Glue.getNode())
  RetOps.push_back(Glue);

return DAG.getNode(SystemZISD::RET_FLAG, DL, MVT::Other, RetOps);
1504}

1506// Return true if Op is an intrinsic node with chain that returns the CC value
1507// as its only (other) argument.  Provide the associated SystemZISD opcode and
1508// the mask of valid CC values if so.
1509static bool isIntrinsicWithCCAndChain(SDValue Op, unsigned &Opcode,
                                    unsigned &CCValid) {
unsigned Id = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
switch (Id) {
case Intrinsic::s390_tbegin:
  Opcode = SystemZISD::TBEGIN;
  CCValid = SystemZ::CCMASK_TBEGIN;
  return true;

case Intrinsic::s390_tbegin_nofloat:
  Opcode = SystemZISD::TBEGIN_NOFLOAT;
  CCValid = SystemZ::CCMASK_TBEGIN;
  return true;

case Intrinsic::s390_tend:
  Opcode = SystemZISD::TEND;
  CCValid = SystemZ::CCMASK_TEND;
  return true;

default:
  return false;
}
1531}

1533// Return true if Op is an intrinsic node without chain that returns the
1534// CC value as its final argument.  Provide the associated SystemZISD
1535// opcode and the mask of valid CC values if so.
1536static bool isIntrinsicWithCC(SDValue Op, unsigned &Opcode, unsigned &CCValid) {
unsigned Id = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
switch (Id) {
case Intrinsic::s390_vpkshs:
case Intrinsic::s390_vpksfs:
case Intrinsic::s390_vpksgs:
  Opcode = SystemZISD::PACKS_CC;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vpklshs:
case Intrinsic::s390_vpklsfs:
case Intrinsic::s390_vpklsgs:
  Opcode = SystemZISD::PACKLS_CC;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vceqbs:
case Intrinsic::s390_vceqhs:
case Intrinsic::s390_vceqfs:
case Intrinsic::s390_vceqgs:
  Opcode = SystemZISD::VICMPES;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vchbs:
case Intrinsic::s390_vchhs:
case Intrinsic::s390_vchfs:
case Intrinsic::s390_vchgs:
  Opcode = SystemZISD::VICMPHS;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vchlbs:
case Intrinsic::s390_vchlhs:
case Intrinsic::s390_vchlfs:
case Intrinsic::s390_vchlgs:
  Opcode = SystemZISD::VICMPHLS;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vtm:
  Opcode = SystemZISD::VTM;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vfaebs:
case Intrinsic::s390_vfaehs:
case Intrinsic::s390_vfaefs:
  Opcode = SystemZISD::VFAE_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfaezbs:
case Intrinsic::s390_vfaezhs:
case Intrinsic::s390_vfaezfs:
  Opcode = SystemZISD::VFAEZ_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfeebs:
case Intrinsic::s390_vfeehs:
case Intrinsic::s390_vfeefs:
  Opcode = SystemZISD::VFEE_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfeezbs:
case Intrinsic::s390_vfeezhs:
case Intrinsic::s390_vfeezfs:
  Opcode = SystemZISD::VFEEZ_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfenebs:
case Intrinsic::s390_vfenehs:
case Intrinsic::s390_vfenefs:
  Opcode = SystemZISD::VFENE_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfenezbs:
case Intrinsic::s390_vfenezhs:
case Intrinsic::s390_vfenezfs:
  Opcode = SystemZISD::VFENEZ_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vistrbs:
case Intrinsic::s390_vistrhs:
case Intrinsic::s390_vistrfs:
  Opcode = SystemZISD::VISTR_CC;
  CCValid = SystemZ::CCMASK_0 | SystemZ::CCMASK_3;
  return true;

case Intrinsic::s390_vstrcbs:
case Intrinsic::s390_vstrchs:
case Intrinsic::s390_vstrcfs:
  Opcode = SystemZISD::VSTRC_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vstrczbs:
case Intrinsic::s390_vstrczhs:
case Intrinsic::s390_vstrczfs:
  Opcode = SystemZISD::VSTRCZ_CC;
  CCValid = SystemZ::CCMASK_ANY;
  return true;

case Intrinsic::s390_vfcedbs:
case Intrinsic::s390_vfcesbs:
  Opcode = SystemZISD::VFCMPES;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vfchdbs:
case Intrinsic::s390_vfchsbs:
  Opcode = SystemZISD::VFCMPHS;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vfchedbs:
case Intrinsic::s390_vfchesbs:
  Opcode = SystemZISD::VFCMPHES;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_vftcidb:
case Intrinsic::s390_vftcisb:
  Opcode = SystemZISD::VFTCI;
  CCValid = SystemZ::CCMASK_VCMP;
  return true;

case Intrinsic::s390_tdc:
  Opcode = SystemZISD::TDC;
  CCValid = SystemZ::CCMASK_TDC;
  return true;

default:
  return false;
}
1677}

1679// Emit an intrinsic with chain and an explicit CC register result.
1680static SDNode *emitIntrinsicWithCCAndChain(SelectionDAG &DAG, SDValue Op,
                                         unsigned Opcode) {
// Copy all operands except the intrinsic ID.
unsigned NumOps = Op.getNumOperands();
SmallVector<SDValue, 6> Ops;
Ops.reserve(NumOps - 1);
Ops.push_back(Op.getOperand(0));
for (unsigned I = 2; I < NumOps; ++I)
  Ops.push_back(Op.getOperand(I));

assert(Op->getNumValues() == 2 && "Expected only CC result and chain")((Op->getNumValues() == 2 && "Expected only CC result and chain"
) ? static_cast<void> (0) : __assert_fail ("Op->getNumValues() == 2 && \"Expected only CC result and chain\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1690, __PRETTY_FUNCTION__));
SDVTList RawVTs = DAG.getVTList(MVT::i32, MVT::Other);
SDValue Intr = DAG.getNode(Opcode, SDLoc(Op), RawVTs, Ops);
SDValue OldChain = SDValue(Op.getNode(), 1);
SDValue NewChain = SDValue(Intr.getNode(), 1);
DAG.ReplaceAllUsesOfValueWith(OldChain, NewChain);
return Intr.getNode();
1697}

1699// Emit an intrinsic with an explicit CC register result.
1700static SDNode *emitIntrinsicWithCC(SelectionDAG &DAG, SDValue Op,
                                 unsigned Opcode) {
// Copy all operands except the intrinsic ID.
unsigned NumOps = Op.getNumOperands();
SmallVector<SDValue, 6> Ops;
Ops.reserve(NumOps - 1);
for (unsigned I = 1; I < NumOps; ++I)
  Ops.push_back(Op.getOperand(I));

SDValue Intr = DAG.getNode(Opcode, SDLoc(Op), Op->getVTList(), Ops);
return Intr.getNode();
1711}

1713// CC is a comparison that will be implemented using an integer or
1714// floating-point comparison.  Return the condition code mask for
1715// a branch on true.  In the integer case, CCMASK_CMP_UO is set for
1716// unsigned comparisons and clear for signed ones.  In the floating-point
1717// case, CCMASK_CMP_UO has its normal mask meaning (unordered).
1718static unsigned CCMaskForCondCode(ISD::CondCode CC) {
1719#define CONV(X) \
case ISD::SET##X: return SystemZ::CCMASK_CMP_##X; \
case ISD::SETO##X: return SystemZ::CCMASK_CMP_##X; \
case ISD::SETU##X: return SystemZ::CCMASK_CMP_UO | SystemZ::CCMASK_CMP_##X

switch (CC) {
default:
  llvm_unreachable("Invalid integer condition!")::llvm::llvm_unreachable_internal("Invalid integer condition!"
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 1726);

CONV(EQ);
CONV(NE);
CONV(GT);
CONV(GE);
CONV(LT);
CONV(LE);

case ISD::SETO:  return SystemZ::CCMASK_CMP_O;
case ISD::SETUO: return SystemZ::CCMASK_CMP_UO;
}
1738#undef CONV
1739}

1741// If C can be converted to a comparison against zero, adjust the operands
1742// as necessary.
1743static void adjustZeroCmp(SelectionDAG &DAG, const SDLoc &DL, Comparison &C) {
if (C.ICmpType == SystemZICMP::UnsignedOnly)
  return;

auto *ConstOp1 = dyn_cast<ConstantSDNode>(C.Op1.getNode());
if (!ConstOp1)
  return;

int64_t Value = ConstOp1->getSExtValue();
if ((Value == -1 && C.CCMask == SystemZ::CCMASK_CMP_GT) ||
    (Value == -1 && C.CCMask == SystemZ::CCMASK_CMP_LE) ||
    (Value == 1 && C.CCMask == SystemZ::CCMASK_CMP_LT) ||
    (Value == 1 && C.CCMask == SystemZ::CCMASK_CMP_GE)) {
  C.CCMask ^= SystemZ::CCMASK_CMP_EQ;
  C.Op1 = DAG.getConstant(0, DL, C.Op1.getValueType());
}
1759}

1761// If a comparison described by C is suitable for CLI(Y), CHHSI or CLHHSI,
1762// adjust the operands as necessary.
1763static void adjustSubwordCmp(SelectionDAG &DAG, const SDLoc &DL,
                           Comparison &C) {
// For us to make any changes, it must a comparison between a single-use
// load and a constant.
if (!C.Op0.hasOneUse() ||
    C.Op0.getOpcode() != ISD::LOAD ||
    C.Op1.getOpcode() != ISD::Constant)
  return;

// We must have an 8- or 16-bit load.
auto *Load = cast<LoadSDNode>(C.Op0);
unsigned NumBits = Load->getMemoryVT().getStoreSizeInBits();
if (NumBits != 8 && NumBits != 16)
  return;

// The load must be an extending one and the constant must be within the
// range of the unextended value.
auto *ConstOp1 = cast<ConstantSDNode>(C.Op1);
uint64_t Value = ConstOp1->getZExtValue();
uint64_t Mask = (1 << NumBits) - 1;
if (Load->getExtensionType() == ISD::SEXTLOAD) {
  // Make sure that ConstOp1 is in range of C.Op0.
  int64_t SignedValue = ConstOp1->getSExtValue();
  if (uint64_t(SignedValue) + (uint64_t(1) << (NumBits - 1)) > Mask)
    return;
  if (C.ICmpType != SystemZICMP::SignedOnly) {
    // Unsigned comparison between two sign-extended values is equivalent
    // to unsigned comparison between two zero-extended values.
    Value &= Mask;
  } else if (NumBits == 8) {
    // Try to treat the comparison as unsigned, so that we can use CLI.
    // Adjust CCMask and Value as necessary.
    if (Value == 0 && C.CCMask == SystemZ::CCMASK_CMP_LT)
      // Test whether the high bit of the byte is set.
      Value = 127, C.CCMask = SystemZ::CCMASK_CMP_GT;
    else if (Value == 0 && C.CCMask == SystemZ::CCMASK_CMP_GE)
      // Test whether the high bit of the byte is clear.
      Value = 128, C.CCMask = SystemZ::CCMASK_CMP_LT;
    else
      // No instruction exists for this combination.
      return;
    C.ICmpType = SystemZICMP::UnsignedOnly;
  }
} else if (Load->getExtensionType() == ISD::ZEXTLOAD) {
  if (Value > Mask)
    return;
  // If the constant is in range, we can use any comparison.
  C.ICmpType = SystemZICMP::Any;
} else
  return;

// Make sure that the first operand is an i32 of the right extension type.
ISD::LoadExtType ExtType = (C.ICmpType == SystemZICMP::SignedOnly ?
                            ISD::SEXTLOAD :
                            ISD::ZEXTLOAD);
if (C.Op0.getValueType() != MVT::i32 ||
    Load->getExtensionType() != ExtType) {
  C.Op0 = DAG.getExtLoad(ExtType, SDLoc(Load), MVT::i32, Load->getChain(),
                         Load->getBasePtr(), Load->getPointerInfo(),
                         Load->getMemoryVT(), Load->getAlignment(),
                         Load->getMemOperand()->getFlags());
  // Update the chain uses.
  DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 1), C.Op0.getValue(1));
}

// Make sure that the second operand is an i32 with the right value.
if (C.Op1.getValueType() != MVT::i32 ||
    Value != ConstOp1->getZExtValue())
  C.Op1 = DAG.getConstant(Value, DL, MVT::i32);
1832}

1834// Return true if Op is either an unextended load, or a load suitable
1835// for integer register-memory comparisons of type ICmpType.
1836static bool isNaturalMemoryOperand(SDValue Op, unsigned ICmpType) {
auto *Load = dyn_cast<LoadSDNode>(Op.getNode());
if (Load) {
  // There are no instructions to compare a register with a memory byte.
  if (Load->getMemoryVT() == MVT::i8)
    return false;
  // Otherwise decide on extension type.
  switch (Load->getExtensionType()) {
  case ISD::NON_EXTLOAD:
    return true;
  case ISD::SEXTLOAD:
    return ICmpType != SystemZICMP::UnsignedOnly;
  case ISD::ZEXTLOAD:
    return ICmpType != SystemZICMP::SignedOnly;
  default:
    break;
  }
}
return false;
1855}

1857// Return true if it is better to swap the operands of C.
1858static bool shouldSwapCmpOperands(const Comparison &C) {
// Leave f128 comparisons alone, since they have no memory forms.
if (C.Op0.getValueType() == MVT::f128)
  return false;

// Always keep a floating-point constant second, since comparisons with
// zero can use LOAD TEST and comparisons with other constants make a
// natural memory operand.
if (isa<ConstantFPSDNode>(C.Op1))
  return false;

// Never swap comparisons with zero since there are many ways to optimize
// those later.
auto *ConstOp1 = dyn_cast<ConstantSDNode>(C.Op1);
if (ConstOp1 && ConstOp1->getZExtValue() == 0)
  return false;

// Also keep natural memory operands second if the loaded value is
// only used here.  Several comparisons have memory forms.
if (isNaturalMemoryOperand(C.Op1, C.ICmpType) && C.Op1.hasOneUse())
  return false;

// Look for cases where Cmp0 is a single-use load and Cmp1 isn't.
// In that case we generally prefer the memory to be second.
if (isNaturalMemoryOperand(C.Op0, C.ICmpType) && C.Op0.hasOneUse()) {
  // The only exceptions are when the second operand is a constant and
  // we can use things like CHHSI.
  if (!ConstOp1)
    return true;
  // The unsigned memory-immediate instructions can handle 16-bit
  // unsigned integers.
  if (C.ICmpType != SystemZICMP::SignedOnly &&
      isUInt<16>(ConstOp1->getZExtValue()))
    return false;
  // The signed memory-immediate instructions can handle 16-bit
  // signed integers.
  if (C.ICmpType != SystemZICMP::UnsignedOnly &&
      isInt<16>(ConstOp1->getSExtValue()))
    return false;
  return true;
}

// Try to promote the use of CGFR and CLGFR.
unsigned Opcode0 = C.Op0.getOpcode();
if (C.ICmpType != SystemZICMP::UnsignedOnly && Opcode0 == ISD::SIGN_EXTEND)
  return true;
if (C.ICmpType != SystemZICMP::SignedOnly && Opcode0 == ISD::ZERO_EXTEND)
  return true;
if (C.ICmpType != SystemZICMP::SignedOnly &&
    Opcode0 == ISD::AND &&
    C.Op0.getOperand(1).getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(C.Op0.getOperand(1))->getZExtValue() == 0xffffffff)
  return true;

return false;
1913}

1915// Return a version of comparison CC mask CCMask in which the LT and GT
1916// actions are swapped.
1917static unsigned reverseCCMask(unsigned CCMask) {
return ((CCMask & SystemZ::CCMASK_CMP_EQ) |
        (CCMask & SystemZ::CCMASK_CMP_GT ? SystemZ::CCMASK_CMP_LT : 0) |
        (CCMask & SystemZ::CCMASK_CMP_LT ? SystemZ::CCMASK_CMP_GT : 0) |
        (CCMask & SystemZ::CCMASK_CMP_UO));
1922}

1924// Check whether C tests for equality between X and Y and whether X - Y
1925// or Y - X is also computed.  In that case it's better to compare the
1926// result of the subtraction against zero.
1927static void adjustForSubtraction(SelectionDAG &DAG, const SDLoc &DL,
                               Comparison &C) {
if (C.CCMask == SystemZ::CCMASK_CMP_EQ ||
    C.CCMask == SystemZ::CCMASK_CMP_NE) {
  for (auto I = C.Op0->use_begin(), E = C.Op0->use_end(); I != E; ++I) {
    SDNode *N = *I;
    if (N->getOpcode() == ISD::SUB &&
        ((N->getOperand(0) == C.Op0 && N->getOperand(1) == C.Op1) ||
         (N->getOperand(0) == C.Op1 && N->getOperand(1) == C.Op0))) {
      C.Op0 = SDValue(N, 0);
      C.Op1 = DAG.getConstant(0, DL, N->getValueType(0));
      return;
    }
  }
}
1942}

1944// Check whether C compares a floating-point value with zero and if that
1945// floating-point value is also negated.  In this case we can use the
1946// negation to set CC, so avoiding separate LOAD AND TEST and
1947// LOAD (NEGATIVE/COMPLEMENT) instructions.
1948static void adjustForFNeg(Comparison &C) {
auto *C1 = dyn_cast<ConstantFPSDNode>(C.Op1);
if (C1 && C1->isZero()) {
  for (auto I = C.Op0->use_begin(), E = C.Op0->use_end(); I != E; ++I) {
    SDNode *N = *I;
    if (N->getOpcode() == ISD::FNEG) {
      C.Op0 = SDValue(N, 0);
      C.CCMask = reverseCCMask(C.CCMask);
      return;
    }
  }
}
1960}

1962// Check whether C compares (shl X, 32) with 0 and whether X is
1963// also sign-extended.  In that case it is better to test the result
1964// of the sign extension using LTGFR.
1965//
1966// This case is important because InstCombine transforms a comparison
1967// with (sext (trunc X)) into a comparison with (shl X, 32).
1968static void adjustForLTGFR(Comparison &C) {
// Check for a comparison between (shl X, 32) and 0.
if (C.Op0.getOpcode() == ISD::SHL &&
    C.Op0.getValueType() == MVT::i64 &&
    C.Op1.getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(C.Op1)->getZExtValue() == 0) {
  auto *C1 = dyn_cast<ConstantSDNode>(C.Op0.getOperand(1));
  if (C1 && C1->getZExtValue() == 32) {
    SDValue ShlOp0 = C.Op0.getOperand(0);
    // See whether X has any SIGN_EXTEND_INREG uses.
    for (auto I = ShlOp0->use_begin(), E = ShlOp0->use_end(); I != E; ++I) {
      SDNode *N = *I;
      if (N->getOpcode() == ISD::SIGN_EXTEND_INREG &&
          cast<VTSDNode>(N->getOperand(1))->getVT() == MVT::i32) {
        C.Op0 = SDValue(N, 0);
        return;
      }
    }
  }
}
1988}

1990// If C compares the truncation of an extending load, try to compare
1991// the untruncated value instead.  This exposes more opportunities to
1992// reuse CC.
1993static void adjustICmpTruncate(SelectionDAG &DAG, const SDLoc &DL,
                             Comparison &C) {
if (C.Op0.getOpcode() == ISD::TRUNCATE &&
    C.Op0.getOperand(0).getOpcode() == ISD::LOAD &&
    C.Op1.getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(C.Op1)->getZExtValue() == 0) {
  auto *L = cast<LoadSDNode>(C.Op0.getOperand(0));
  if (L->getMemoryVT().getStoreSizeInBits() <= C.Op0.getValueSizeInBits()) {
    unsigned Type = L->getExtensionType();
    if ((Type == ISD::ZEXTLOAD && C.ICmpType != SystemZICMP::SignedOnly) ||
        (Type == ISD::SEXTLOAD && C.ICmpType != SystemZICMP::UnsignedOnly)) {
      C.Op0 = C.Op0.getOperand(0);
      C.Op1 = DAG.getConstant(0, DL, C.Op0.getValueType());
    }
  }
}
2009}

2011// Return true if shift operation N has an in-range constant shift value.
2012// Store it in ShiftVal if so.
2013static bool isSimpleShift(SDValue N, unsigned &ShiftVal) {
auto *Shift = dyn_cast<ConstantSDNode>(N.getOperand(1));
if (!Shift)
  return false;

uint64_t Amount = Shift->getZExtValue();
if (Amount >= N.getValueSizeInBits())
  return false;

ShiftVal = Amount;
return true;
2024}

2026// Check whether an AND with Mask is suitable for a TEST UNDER MASK
2027// instruction and whether the CC value is descriptive enough to handle
2028// a comparison of type Opcode between the AND result and CmpVal.
2029// CCMask says which comparison result is being tested and BitSize is
2030// the number of bits in the operands.  If TEST UNDER MASK can be used,
2031// return the corresponding CC mask, otherwise return 0.
2032static unsigned getTestUnderMaskCond(unsigned BitSize, unsigned CCMask,
                                   uint64_t Mask, uint64_t CmpVal,
                                   unsigned ICmpType) {
assert(Mask != 0 && "ANDs with zero should have been removed by now")((Mask != 0 && "ANDs with zero should have been removed by now"
) ? static_cast<void> (0) : __assert_fail ("Mask != 0 && \"ANDs with zero should have been removed by now\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2035, __PRETTY_FUNCTION__));

// Check whether the mask is suitable for TMHH, TMHL, TMLH or TMLL.
if (!SystemZ::isImmLL(Mask) && !SystemZ::isImmLH(Mask) &&
    !SystemZ::isImmHL(Mask) && !SystemZ::isImmHH(Mask))
  return 0;

// Work out the masks for the lowest and highest bits.
unsigned HighShift = 63 - countLeadingZeros(Mask);
uint64_t High = uint64_t(1) << HighShift;
uint64_t Low = uint64_t(1) << countTrailingZeros(Mask);

// Signed ordered comparisons are effectively unsigned if the sign
// bit is dropped.
bool EffectivelyUnsigned = (ICmpType != SystemZICMP::SignedOnly);

// Check for equality comparisons with 0, or the equivalent.
if (CmpVal == 0) {
  if (CCMask == SystemZ::CCMASK_CMP_EQ)
    return SystemZ::CCMASK_TM_ALL_0;
  if (CCMask == SystemZ::CCMASK_CMP_NE)
    return SystemZ::CCMASK_TM_SOME_1;
}
if (EffectivelyUnsigned && CmpVal > 0 && CmpVal <= Low) {
  if (CCMask == SystemZ::CCMASK_CMP_LT)
    return SystemZ::CCMASK_TM_ALL_0;
  if (CCMask == SystemZ::CCMASK_CMP_GE)
    return SystemZ::CCMASK_TM_SOME_1;
}
if (EffectivelyUnsigned && CmpVal < Low) {
  if (CCMask == SystemZ::CCMASK_CMP_LE)
    return SystemZ::CCMASK_TM_ALL_0;
  if (CCMask == SystemZ::CCMASK_CMP_GT)
    return SystemZ::CCMASK_TM_SOME_1;
}

// Check for equality comparisons with the mask, or the equivalent.
if (CmpVal == Mask) {
  if (CCMask == SystemZ::CCMASK_CMP_EQ)
    return SystemZ::CCMASK_TM_ALL_1;
  if (CCMask == SystemZ::CCMASK_CMP_NE)
    return SystemZ::CCMASK_TM_SOME_0;
}
if (EffectivelyUnsigned && CmpVal >= Mask - Low && CmpVal < Mask) {
  if (CCMask == SystemZ::CCMASK_CMP_GT)
    return SystemZ::CCMASK_TM_ALL_1;
  if (CCMask == SystemZ::CCMASK_CMP_LE)
    return SystemZ::CCMASK_TM_SOME_0;
}
if (EffectivelyUnsigned && CmpVal > Mask - Low && CmpVal <= Mask) {
  if (CCMask == SystemZ::CCMASK_CMP_GE)
    return SystemZ::CCMASK_TM_ALL_1;
  if (CCMask == SystemZ::CCMASK_CMP_LT)
    return SystemZ::CCMASK_TM_SOME_0;
}

// Check for ordered comparisons with the top bit.
if (EffectivelyUnsigned && CmpVal >= Mask - High && CmpVal < High) {
  if (CCMask == SystemZ::CCMASK_CMP_LE)
    return SystemZ::CCMASK_TM_MSB_0;
  if (CCMask == SystemZ::CCMASK_CMP_GT)
    return SystemZ::CCMASK_TM_MSB_1;
}
if (EffectivelyUnsigned && CmpVal > Mask - High && CmpVal <= High) {
  if (CCMask == SystemZ::CCMASK_CMP_LT)
    return SystemZ::CCMASK_TM_MSB_0;
  if (CCMask == SystemZ::CCMASK_CMP_GE)
    return SystemZ::CCMASK_TM_MSB_1;
}

// If there are just two bits, we can do equality checks for Low and High
// as well.
if (Mask == Low + High) {
  if (CCMask == SystemZ::CCMASK_CMP_EQ && CmpVal == Low)
    return SystemZ::CCMASK_TM_MIXED_MSB_0;
  if (CCMask == SystemZ::CCMASK_CMP_NE && CmpVal == Low)
    return SystemZ::CCMASK_TM_MIXED_MSB_0 ^ SystemZ::CCMASK_ANY;
  if (CCMask == SystemZ::CCMASK_CMP_EQ && CmpVal == High)
    return SystemZ::CCMASK_TM_MIXED_MSB_1;
  if (CCMask == SystemZ::CCMASK_CMP_NE && CmpVal == High)
    return SystemZ::CCMASK_TM_MIXED_MSB_1 ^ SystemZ::CCMASK_ANY;
}

// Looks like we've exhausted our options.
return 0;
2120}

2122// See whether C can be implemented as a TEST UNDER MASK instruction.
2123// Update the arguments with the TM version if so.
2124static void adjustForTestUnderMask(SelectionDAG &DAG, const SDLoc &DL,
                                 Comparison &C) {
// Check that we have a comparison with a constant.
auto *ConstOp1 = dyn_cast<ConstantSDNode>(C.Op1);
if (!ConstOp1)
  return;
uint64_t CmpVal = ConstOp1->getZExtValue();

// Check whether the nonconstant input is an AND with a constant mask.
Comparison NewC(C);
uint64_t MaskVal;
ConstantSDNode *Mask = nullptr;
if (C.Op0.getOpcode() == ISD::AND) {
  NewC.Op0 = C.Op0.getOperand(0);
  NewC.Op1 = C.Op0.getOperand(1);
  Mask = dyn_cast<ConstantSDNode>(NewC.Op1);
  if (!Mask)
    return;
  MaskVal = Mask->getZExtValue();
} else {
  // There is no instruction to compare with a 64-bit immediate
  // so use TMHH instead if possible.  We need an unsigned ordered
  // comparison with an i64 immediate.
  if (NewC.Op0.getValueType() != MVT::i64 ||
      NewC.CCMask == SystemZ::CCMASK_CMP_EQ ||
      NewC.CCMask == SystemZ::CCMASK_CMP_NE ||
      NewC.ICmpType == SystemZICMP::SignedOnly)
    return;
  // Convert LE and GT comparisons into LT and GE.
  if (NewC.CCMask == SystemZ::CCMASK_CMP_LE ||
      NewC.CCMask == SystemZ::CCMASK_CMP_GT) {
    if (CmpVal == uint64_t(-1))
      return;
    CmpVal += 1;
    NewC.CCMask ^= SystemZ::CCMASK_CMP_EQ;
  }
  // If the low N bits of Op1 are zero than the low N bits of Op0 can
  // be masked off without changing the result.
  MaskVal = -(CmpVal & -CmpVal);
  NewC.ICmpType = SystemZICMP::UnsignedOnly;
}
if (!MaskVal)
  return;

// Check whether the combination of mask, comparison value and comparison
// type are suitable.
unsigned BitSize = NewC.Op0.getValueSizeInBits();
unsigned NewCCMask, ShiftVal;
if (NewC.ICmpType != SystemZICMP::SignedOnly &&
    NewC.Op0.getOpcode() == ISD::SHL &&
    isSimpleShift(NewC.Op0, ShiftVal) &&
    (MaskVal >> ShiftVal != 0) &&
    ((CmpVal >> ShiftVal) << ShiftVal) == CmpVal &&
    (NewCCMask = getTestUnderMaskCond(BitSize, NewC.CCMask,
                                      MaskVal >> ShiftVal,
                                      CmpVal >> ShiftVal,
                                      SystemZICMP::Any))) {
  NewC.Op0 = NewC.Op0.getOperand(0);
  MaskVal >>= ShiftVal;
} else if (NewC.ICmpType != SystemZICMP::SignedOnly &&
           NewC.Op0.getOpcode() == ISD::SRL &&
           isSimpleShift(NewC.Op0, ShiftVal) &&
           (MaskVal << ShiftVal != 0) &&
           ((CmpVal << ShiftVal) >> ShiftVal) == CmpVal &&
           (NewCCMask = getTestUnderMaskCond(BitSize, NewC.CCMask,
                                             MaskVal << ShiftVal,
                                             CmpVal << ShiftVal,
                                             SystemZICMP::UnsignedOnly))) {
  NewC.Op0 = NewC.Op0.getOperand(0);
  MaskVal <<= ShiftVal;
} else {
  NewCCMask = getTestUnderMaskCond(BitSize, NewC.CCMask, MaskVal, CmpVal,
                                   NewC.ICmpType);
  if (!NewCCMask)
    return;
}

// Go ahead and make the change.
C.Opcode = SystemZISD::TM;
C.Op0 = NewC.Op0;
if (Mask && Mask->getZExtValue() == MaskVal)
  C.Op1 = SDValue(Mask, 0);
else
  C.Op1 = DAG.getConstant(MaskVal, DL, C.Op0.getValueType());
C.CCValid = SystemZ::CCMASK_TM;
C.CCMask = NewCCMask;
2210}

2212// See whether the comparison argument contains a redundant AND
2213// and remove it if so.  This sometimes happens due to the generic
2214// BRCOND expansion.
2215static void adjustForRedundantAnd(SelectionDAG &DAG, const SDLoc &DL,
                                Comparison &C) {
if (C.Op0.getOpcode() != ISD::AND)
  return;
auto *Mask = dyn_cast<ConstantSDNode>(C.Op0.getOperand(1));
if (!Mask)
  return;
KnownBits Known = DAG.computeKnownBits(C.Op0.getOperand(0));
if ((~Known.Zero).getZExtValue() & ~Mask->getZExtValue())
  return;

C.Op0 = C.Op0.getOperand(0);
2227}

2229// Return a Comparison that tests the condition-code result of intrinsic
2230// node Call against constant integer CC using comparison code Cond.
2231// Opcode is the opcode of the SystemZISD operation for the intrinsic
2232// and CCValid is the set of possible condition-code results.
2233static Comparison getIntrinsicCmp(SelectionDAG &DAG, unsigned Opcode,
                                SDValue Call, unsigned CCValid, uint64_t CC,
                                ISD::CondCode Cond) {
Comparison C(Call, SDValue());
C.Opcode = Opcode;
C.CCValid = CCValid;
if (Cond == ISD::SETEQ)
  // bit 3 for CC==0, bit 0 for CC==3, always false for CC>3.
  C.CCMask = CC < 4 ? 1 << (3 - CC) : 0;
else if (Cond == ISD::SETNE)
  // ...and the inverse of that.
  C.CCMask = CC < 4 ? ~(1 << (3 - CC)) : -1;
else if (Cond == ISD::SETLT || Cond == ISD::SETULT)
  // bits above bit 3 for CC==0 (always false), bits above bit 0 for CC==3,
  // always true for CC>3.
  C.CCMask = CC < 4 ? ~0U << (4 - CC) : -1;
else if (Cond == ISD::SETGE || Cond == ISD::SETUGE)
  // ...and the inverse of that.
  C.CCMask = CC < 4 ? ~(~0U << (4 - CC)) : 0;
else if (Cond == ISD::SETLE || Cond == ISD::SETULE)
  // bit 3 and above for CC==0, bit 0 and above for CC==3 (always true),
  // always true for CC>3.
  C.CCMask = CC < 4 ? ~0U << (3 - CC) : -1;
else if (Cond == ISD::SETGT || Cond == ISD::SETUGT)
  // ...and the inverse of that.
  C.CCMask = CC < 4 ? ~(~0U << (3 - CC)) : 0;
else
  llvm_unreachable("Unexpected integer comparison type")::llvm::llvm_unreachable_internal("Unexpected integer comparison type"
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2260);
C.CCMask &= CCValid;
return C;
2263}

2265// Decide how to implement a comparison of type Cond between CmpOp0 with CmpOp1.
2266static Comparison getCmp(SelectionDAG &DAG, SDValue CmpOp0, SDValue CmpOp1,
                       ISD::CondCode Cond, const SDLoc &DL) {
if (CmpOp1.getOpcode() == ISD::Constant) {
  uint64_t Constant = cast<ConstantSDNode>(CmpOp1)->getZExtValue();
  unsigned Opcode, CCValid;
  if (CmpOp0.getOpcode() == ISD::INTRINSIC_W_CHAIN &&
      CmpOp0.getResNo() == 0 && CmpOp0->hasNUsesOfValue(1, 0) &&
      isIntrinsicWithCCAndChain(CmpOp0, Opcode, CCValid))
    return getIntrinsicCmp(DAG, Opcode, CmpOp0, CCValid, Constant, Cond);
  if (CmpOp0.getOpcode() == ISD::INTRINSIC_WO_CHAIN &&
      CmpOp0.getResNo() == CmpOp0->getNumValues() - 1 &&
      isIntrinsicWithCC(CmpOp0, Opcode, CCValid))
    return getIntrinsicCmp(DAG, Opcode, CmpOp0, CCValid, Constant, Cond);
}
Comparison C(CmpOp0, CmpOp1);
C.CCMask = CCMaskForCondCode(Cond);
if (C.Op0.getValueType().isFloatingPoint()) {
  C.CCValid = SystemZ::CCMASK_FCMP;
  C.Opcode = SystemZISD::FCMP;
  adjustForFNeg(C);
} else {
  C.CCValid = SystemZ::CCMASK_ICMP;
  C.Opcode = SystemZISD::ICMP;
  // Choose the type of comparison.  Equality and inequality tests can
  // use either signed or unsigned comparisons.  The choice also doesn't
  // matter if both sign bits are known to be clear.  In those cases we
  // want to give the main isel code the freedom to choose whichever
  // form fits best.
  if (C.CCMask == SystemZ::CCMASK_CMP_EQ ||
      C.CCMask == SystemZ::CCMASK_CMP_NE ||
      (DAG.SignBitIsZero(C.Op0) && DAG.SignBitIsZero(C.Op1)))
    C.ICmpType = SystemZICMP::Any;
  else if (C.CCMask & SystemZ::CCMASK_CMP_UO)
    C.ICmpType = SystemZICMP::UnsignedOnly;
  else
    C.ICmpType = SystemZICMP::SignedOnly;
  C.CCMask &= ~SystemZ::CCMASK_CMP_UO;
  adjustForRedundantAnd(DAG, DL, C);
  adjustZeroCmp(DAG, DL, C);
  adjustSubwordCmp(DAG, DL, C);
  adjustForSubtraction(DAG, DL, C);
  adjustForLTGFR(C);
  adjustICmpTruncate(DAG, DL, C);
}

if (shouldSwapCmpOperands(C)) {
  std::swap(C.Op0, C.Op1);
  C.CCMask = reverseCCMask(C.CCMask);
}

adjustForTestUnderMask(DAG, DL, C);
return C;
2318}

2320// Emit the comparison instruction described by C.
2321static SDValue emitCmp(SelectionDAG &DAG, const SDLoc &DL, Comparison &C) {
if (!C.Op1.getNode()) {
  SDNode *Node;
  switch (C.Op0.getOpcode()) {
  case ISD::INTRINSIC_W_CHAIN:
    Node = emitIntrinsicWithCCAndChain(DAG, C.Op0, C.Opcode);
    return SDValue(Node, 0);
  case ISD::INTRINSIC_WO_CHAIN:
    Node = emitIntrinsicWithCC(DAG, C.Op0, C.Opcode);
    return SDValue(Node, Node->getNumValues() - 1);
  default:
    llvm_unreachable("Invalid comparison operands")::llvm::llvm_unreachable_internal("Invalid comparison operands"
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2332);
  }
}
if (C.Opcode == SystemZISD::ICMP)
  return DAG.getNode(SystemZISD::ICMP, DL, MVT::i32, C.Op0, C.Op1,
                     DAG.getConstant(C.ICmpType, DL, MVT::i32));
if (C.Opcode == SystemZISD::TM) {
  bool RegisterOnly = (bool(C.CCMask & SystemZ::CCMASK_TM_MIXED_MSB_0) !=
                       bool(C.CCMask & SystemZ::CCMASK_TM_MIXED_MSB_1));
  return DAG.getNode(SystemZISD::TM, DL, MVT::i32, C.Op0, C.Op1,
                     DAG.getConstant(RegisterOnly, DL, MVT::i32));
}
return DAG.getNode(C.Opcode, DL, MVT::i32, C.Op0, C.Op1);
2345}

2347// Implement a 32-bit *MUL_LOHI operation by extending both operands to
2348// 64 bits.  Extend is the extension type to use.  Store the high part
2349// in Hi and the low part in Lo.
2350static void lowerMUL_LOHI32(SelectionDAG &DAG, const SDLoc &DL, unsigned Extend,
                          SDValue Op0, SDValue Op1, SDValue &Hi,
                          SDValue &Lo) {
Op0 = DAG.getNode(Extend, DL, MVT::i64, Op0);
Op1 = DAG.getNode(Extend, DL, MVT::i64, Op1);
SDValue Mul = DAG.getNode(ISD::MUL, DL, MVT::i64, Op0, Op1);
Hi = DAG.getNode(ISD::SRL, DL, MVT::i64, Mul,
                 DAG.getConstant(32, DL, MVT::i64));
Hi = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, Hi);
Lo = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, Mul);
2360}

2362// Lower a binary operation that produces two VT results, one in each
2363// half of a GR128 pair.  Op0 and Op1 are the VT operands to the operation,
2364// and Opcode performs the GR128 operation.  Store the even register result
2365// in Even and the odd register result in Odd.
2366static void lowerGR128Binary(SelectionDAG &DAG, const SDLoc &DL, EVT VT,
                           unsigned Opcode, SDValue Op0, SDValue Op1,
                           SDValue &Even, SDValue &Odd) {
SDValue Result = DAG.getNode(Opcode, DL, MVT::Untyped, Op0, Op1);
bool Is32Bit = is32Bit(VT);
Even = DAG.getTargetExtractSubreg(SystemZ::even128(Is32Bit), DL, VT, Result);
Odd = DAG.getTargetExtractSubreg(SystemZ::odd128(Is32Bit), DL, VT, Result);
2373}

2375// Return an i32 value that is 1 if the CC value produced by CCReg is
2376// in the mask CCMask and 0 otherwise.  CC is known to have a value
2377// in CCValid, so other values can be ignored.
2378static SDValue emitSETCC(SelectionDAG &DAG, const SDLoc &DL, SDValue CCReg,
                       unsigned CCValid, unsigned CCMask) {
SDValue Ops[] = { DAG.getConstant(1, DL, MVT::i32),
                  DAG.getConstant(0, DL, MVT::i32),
                  DAG.getConstant(CCValid, DL, MVT::i32),
                  DAG.getConstant(CCMask, DL, MVT::i32), CCReg };
return DAG.getNode(SystemZISD::SELECT_CCMASK, DL, MVT::i32, Ops);
2385}

2387// Return the SystemISD vector comparison operation for CC, or 0 if it cannot
2388// be done directly.  IsFP is true if CC is for a floating-point rather than
2389// integer comparison.
2390static unsigned getVectorComparison(ISD::CondCode CC, bool IsFP) {
switch (CC) {
case ISD::SETOEQ:
case ISD::SETEQ:
  return IsFP ? SystemZISD::VFCMPE : SystemZISD::VICMPE;

case ISD::SETOGE:
case ISD::SETGE:
  return IsFP ? SystemZISD::VFCMPHE : static_cast<SystemZISD::NodeType>(0);

case ISD::SETOGT:
case ISD::SETGT:
  return IsFP ? SystemZISD::VFCMPH : SystemZISD::VICMPH;

case ISD::SETUGT:
  return IsFP ? static_cast<SystemZISD::NodeType>(0) : SystemZISD::VICMPHL;

default:
  return 0;
}
2410}

2412// Return the SystemZISD vector comparison operation for CC or its inverse,
2413// or 0 if neither can be done directly.  Indicate in Invert whether the
2414// result is for the inverse of CC.  IsFP is true if CC is for a
2415// floating-point rather than integer comparison.
2416static unsigned getVectorComparisonOrInvert(ISD::CondCode CC, bool IsFP,
                                          bool &Invert) {
if (unsigned Opcode = getVectorComparison(CC, IsFP)) {
  Invert = false;
  return Opcode;
}

CC = ISD::getSetCCInverse(CC, !IsFP);
if (unsigned Opcode = getVectorComparison(CC, IsFP)) {
  Invert = true;
  return Opcode;
}

return 0;
2430}

2432// Return a v2f64 that contains the extended form of elements Start and Start+1
2433// of v4f32 value Op.
2434static SDValue expandV4F32ToV2F64(SelectionDAG &DAG, int Start, const SDLoc &DL,
                                SDValue Op) {
int Mask[] = { Start, -1, Start + 1, -1 };
Op = DAG.getVectorShuffle(MVT::v4f32, DL, Op, DAG.getUNDEF(MVT::v4f32), Mask);
return DAG.getNode(SystemZISD::VEXTEND, DL, MVT::v2f64, Op);
2439}

2441// Build a comparison of vectors CmpOp0 and CmpOp1 using opcode Opcode,
2442// producing a result of type VT.
2443SDValue SystemZTargetLowering::getVectorCmp(SelectionDAG &DAG, unsigned Opcode,
                                          const SDLoc &DL, EVT VT,
                                          SDValue CmpOp0,
                                          SDValue CmpOp1) const {
// There is no hardware support for v4f32 (unless we have the vector
// enhancements facility 1), so extend the vector into two v2f64s
// and compare those.
if (CmpOp0.getValueType() == MVT::v4f32 &&
    !Subtarget.hasVectorEnhancements1()) {
  SDValue H0 = expandV4F32ToV2F64(DAG, 0, DL, CmpOp0);
  SDValue L0 = expandV4F32ToV2F64(DAG, 2, DL, CmpOp0);
  SDValue H1 = expandV4F32ToV2F64(DAG, 0, DL, CmpOp1);
  SDValue L1 = expandV4F32ToV2F64(DAG, 2, DL, CmpOp1);
  SDValue HRes = DAG.getNode(Opcode, DL, MVT::v2i64, H0, H1);
  SDValue LRes = DAG.getNode(Opcode, DL, MVT::v2i64, L0, L1);
  return DAG.getNode(SystemZISD::PACK, DL, VT, HRes, LRes);
}
return DAG.getNode(Opcode, DL, VT, CmpOp0, CmpOp1);
2461}

2463// Lower a vector comparison of type CC between CmpOp0 and CmpOp1, producing
2464// an integer mask of type VT.
2465SDValue SystemZTargetLowering::lowerVectorSETCC(SelectionDAG &DAG,
                                              const SDLoc &DL, EVT VT,
                                              ISD::CondCode CC,
                                              SDValue CmpOp0,
                                              SDValue CmpOp1) const {
bool IsFP = CmpOp0.getValueType().isFloatingPoint();
bool Invert = false;
SDValue Cmp;
switch (CC) {
  // Handle tests for order using (or (ogt y x) (oge x y)).
case ISD::SETUO:
  Invert = true;
  LLVM_FALLTHROUGH[[clang::fallthrough]];
case ISD::SETO: {
  assert(IsFP && "Unexpected integer comparison")((IsFP && "Unexpected integer comparison") ? static_cast
<void> (0) : __assert_fail ("IsFP && \"Unexpected integer comparison\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2479, __PRETTY_FUNCTION__));
  SDValue LT = getVectorCmp(DAG, SystemZISD::VFCMPH, DL, VT, CmpOp1, CmpOp0);
  SDValue GE = getVectorCmp(DAG, SystemZISD::VFCMPHE, DL, VT, CmpOp0, CmpOp1);
  Cmp = DAG.getNode(ISD::OR, DL, VT, LT, GE);
  break;
}

  // Handle <> tests using (or (ogt y x) (ogt x y)).
case ISD::SETUEQ:
  Invert = true;
  LLVM_FALLTHROUGH[[clang::fallthrough]];
case ISD::SETONE: {
  assert(IsFP && "Unexpected integer comparison")((IsFP && "Unexpected integer comparison") ? static_cast
<void> (0) : __assert_fail ("IsFP && \"Unexpected integer comparison\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2491, __PRETTY_FUNCTION__));
  SDValue LT = getVectorCmp(DAG, SystemZISD::VFCMPH, DL, VT, CmpOp1, CmpOp0);
  SDValue GT = getVectorCmp(DAG, SystemZISD::VFCMPH, DL, VT, CmpOp0, CmpOp1);
  Cmp = DAG.getNode(ISD::OR, DL, VT, LT, GT);
  break;
}

  // Otherwise a single comparison is enough.  It doesn't really
  // matter whether we try the inversion or the swap first, since
  // there are no cases where both work.
default:
  if (unsigned Opcode = getVectorComparisonOrInvert(CC, IsFP, Invert))
    Cmp = getVectorCmp(DAG, Opcode, DL, VT, CmpOp0, CmpOp1);
  else {
    CC = ISD::getSetCCSwappedOperands(CC);
    if (unsigned Opcode = getVectorComparisonOrInvert(CC, IsFP, Invert))
      Cmp = getVectorCmp(DAG, Opcode, DL, VT, CmpOp1, CmpOp0);
    else
      llvm_unreachable("Unhandled comparison")::llvm::llvm_unreachable_internal("Unhandled comparison", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2509);
  }
  break;
}
if (Invert) {
  SDValue Mask = DAG.getNode(SystemZISD::BYTE_MASK, DL, MVT::v16i8,
                             DAG.getConstant(65535, DL, MVT::i32));
  Mask = DAG.getNode(ISD::BITCAST, DL, VT, Mask);
  Cmp = DAG.getNode(ISD::XOR, DL, VT, Cmp, Mask);
}
return Cmp;
2520}

2522SDValue SystemZTargetLowering::lowerSETCC(SDValue Op,
                                        SelectionDAG &DAG) const {
SDValue CmpOp0   = Op.getOperand(0);
SDValue CmpOp1   = Op.getOperand(1);
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(2))->get();
SDLoc DL(Op);
EVT VT = Op.getValueType();
if (VT.isVector())
  return lowerVectorSETCC(DAG, DL, VT, CC, CmpOp0, CmpOp1);

Comparison C(getCmp(DAG, CmpOp0, CmpOp1, CC, DL));
SDValue CCReg = emitCmp(DAG, DL, C);
return emitSETCC(DAG, DL, CCReg, C.CCValid, C.CCMask);
2535}

2537SDValue SystemZTargetLowering::lowerBR_CC(SDValue Op, SelectionDAG &DAG) const {
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(1))->get();
SDValue CmpOp0   = Op.getOperand(2);
SDValue CmpOp1   = Op.getOperand(3);
SDValue Dest     = Op.getOperand(4);
SDLoc DL(Op);

Comparison C(getCmp(DAG, CmpOp0, CmpOp1, CC, DL));
SDValue CCReg = emitCmp(DAG, DL, C);
return DAG.getNode(SystemZISD::BR_CCMASK, DL, Op.getValueType(),
                   Op.getOperand(0), DAG.getConstant(C.CCValid, DL, MVT::i32),
                   DAG.getConstant(C.CCMask, DL, MVT::i32), Dest, CCReg);
2549}

2551// Return true if Pos is CmpOp and Neg is the negative of CmpOp,
2552// allowing Pos and Neg to be wider than CmpOp.
2553static bool isAbsolute(SDValue CmpOp, SDValue Pos, SDValue Neg) {
return (Neg.getOpcode() == ISD::SUB &&
        Neg.getOperand(0).getOpcode() == ISD::Constant &&
        cast<ConstantSDNode>(Neg.getOperand(0))->getZExtValue() == 0 &&
        Neg.getOperand(1) == Pos &&
        (Pos == CmpOp ||
         (Pos.getOpcode() == ISD::SIGN_EXTEND &&
          Pos.getOperand(0) == CmpOp)));
2561}

2563// Return the absolute or negative absolute of Op; IsNegative decides which.
2564static SDValue getAbsolute(SelectionDAG &DAG, const SDLoc &DL, SDValue Op,
                         bool IsNegative) {
Op = DAG.getNode(SystemZISD::IABS, DL, Op.getValueType(), Op);
if (IsNegative)
  Op = DAG.getNode(ISD::SUB, DL, Op.getValueType(),
                   DAG.getConstant(0, DL, Op.getValueType()), Op);
return Op;
2571}

2573SDValue SystemZTargetLowering::lowerSELECT_CC(SDValue Op,
                                            SelectionDAG &DAG) const {
SDValue CmpOp0   = Op.getOperand(0);
SDValue CmpOp1   = Op.getOperand(1);
SDValue TrueOp   = Op.getOperand(2);
SDValue FalseOp  = Op.getOperand(3);
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(4))->get();
SDLoc DL(Op);

Comparison C(getCmp(DAG, CmpOp0, CmpOp1, CC, DL));

// Check for absolute and negative-absolute selections, including those
// where the comparison value is sign-extended (for LPGFR and LNGFR).
// This check supplements the one in DAGCombiner.
if (C.Opcode == SystemZISD::ICMP &&
    C.CCMask != SystemZ::CCMASK_CMP_EQ &&
    C.CCMask != SystemZ::CCMASK_CMP_NE &&
    C.Op1.getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(C.Op1)->getZExtValue() == 0) {
  if (isAbsolute(C.Op0, TrueOp, FalseOp))
    return getAbsolute(DAG, DL, TrueOp, C.CCMask & SystemZ::CCMASK_CMP_LT);
  if (isAbsolute(C.Op0, FalseOp, TrueOp))
    return getAbsolute(DAG, DL, FalseOp, C.CCMask & SystemZ::CCMASK_CMP_GT);
}

SDValue CCReg = emitCmp(DAG, DL, C);
SDValue Ops[] = {TrueOp, FalseOp, DAG.getConstant(C.CCValid, DL, MVT::i32),
                 DAG.getConstant(C.CCMask, DL, MVT::i32), CCReg};

return DAG.getNode(SystemZISD::SELECT_CCMASK, DL, Op.getValueType(), Ops);
2603}

2605SDValue SystemZTargetLowering::lowerGlobalAddress(GlobalAddressSDNode *Node,
                                                SelectionDAG &DAG) const {
SDLoc DL(Node);
const GlobalValue *GV = Node->getGlobal();
int64_t Offset = Node->getOffset();
EVT PtrVT = getPointerTy(DAG.getDataLayout());
CodeModel::Model CM = DAG.getTarget().getCodeModel();

SDValue Result;
if (Subtarget.isPC32DBLSymbol(GV, CM)) {
  // Assign anchors at 1<<12 byte boundaries.
  uint64_t Anchor = Offset & ~uint64_t(0xfff);
  Result = DAG.getTargetGlobalAddress(GV, DL, PtrVT, Anchor);
  Result = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Result);

  // The offset can be folded into the address if it is aligned to a halfword.
  Offset -= Anchor;
  if (Offset != 0 && (Offset & 1) == 0) {
    SDValue Full = DAG.getTargetGlobalAddress(GV, DL, PtrVT, Anchor + Offset);
    Result = DAG.getNode(SystemZISD::PCREL_OFFSET, DL, PtrVT, Full, Result);
    Offset = 0;
  }
} else {
  Result = DAG.getTargetGlobalAddress(GV, DL, PtrVT, 0, SystemZII::MO_GOT);
  Result = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Result);
  Result = DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), Result,
                       MachinePointerInfo::getGOT(DAG.getMachineFunction()));
}

// If there was a non-zero offset that we didn't fold, create an explicit
// addition for it.
if (Offset != 0)
  Result = DAG.getNode(ISD::ADD, DL, PtrVT, Result,
                       DAG.getConstant(Offset, DL, PtrVT));

return Result;
2641}

2643SDValue SystemZTargetLowering::lowerTLSGetOffset(GlobalAddressSDNode *Node,
                                               SelectionDAG &DAG,
                                               unsigned Opcode,
                                               SDValue GOTOffset) const {
SDLoc DL(Node);
EVT PtrVT = getPointerTy(DAG.getDataLayout());
SDValue Chain = DAG.getEntryNode();
SDValue Glue;

// __tls_get_offset takes the GOT offset in %r2 and the GOT in %r12.
SDValue GOT = DAG.getGLOBAL_OFFSET_TABLE(PtrVT);
Chain = DAG.getCopyToReg(Chain, DL, SystemZ::R12D, GOT, Glue);
Glue = Chain.getValue(1);
Chain = DAG.getCopyToReg(Chain, DL, SystemZ::R2D, GOTOffset, Glue);
Glue = Chain.getValue(1);

// The first call operand is the chain and the second is the TLS symbol.
SmallVector<SDValue, 8> Ops;
Ops.push_back(Chain);
Ops.push_back(DAG.getTargetGlobalAddress(Node->getGlobal(), DL,
                                         Node->getValueType(0),
                                         0, 0));

// Add argument registers to the end of the list so that they are
// known live into the call.
Ops.push_back(DAG.getRegister(SystemZ::R2D, PtrVT));
Ops.push_back(DAG.getRegister(SystemZ::R12D, PtrVT));

// Add a register mask operand representing the call-preserved registers.
const TargetRegisterInfo *TRI = Subtarget.getRegisterInfo();
const uint32_t *Mask =
    TRI->getCallPreservedMask(DAG.getMachineFunction(), CallingConv::C);
assert(Mask && "Missing call preserved mask for calling convention")((Mask && "Missing call preserved mask for calling convention"
) ? static_cast<void> (0) : __assert_fail ("Mask && \"Missing call preserved mask for calling convention\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2675, __PRETTY_FUNCTION__));
Ops.push_back(DAG.getRegisterMask(Mask));

// Glue the call to the argument copies.
Ops.push_back(Glue);

// Emit the call.
SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
Chain = DAG.getNode(Opcode, DL, NodeTys, Ops);
Glue = Chain.getValue(1);

// Copy the return value from %r2.
return DAG.getCopyFromReg(Chain, DL, SystemZ::R2D, PtrVT, Glue);
2688}

2690SDValue SystemZTargetLowering::lowerThreadPointer(const SDLoc &DL,
                                                SelectionDAG &DAG) const {
SDValue Chain = DAG.getEntryNode();
EVT PtrVT = getPointerTy(DAG.getDataLayout());

// The high part of the thread pointer is in access register 0.
SDValue TPHi = DAG.getCopyFromReg(Chain, DL, SystemZ::A0, MVT::i32);
TPHi = DAG.getNode(ISD::ANY_EXTEND, DL, PtrVT, TPHi);

// The low part of the thread pointer is in access register 1.
SDValue TPLo = DAG.getCopyFromReg(Chain, DL, SystemZ::A1, MVT::i32);
TPLo = DAG.getNode(ISD::ZERO_EXTEND, DL, PtrVT, TPLo);

// Merge them into a single 64-bit address.
SDValue TPHiShifted = DAG.getNode(ISD::SHL, DL, PtrVT, TPHi,
                                  DAG.getConstant(32, DL, PtrVT));
return DAG.getNode(ISD::OR, DL, PtrVT, TPHiShifted, TPLo);
2707}

2709SDValue SystemZTargetLowering::lowerGlobalTLSAddress(GlobalAddressSDNode *Node,
                                                   SelectionDAG &DAG) const {
if (DAG.getTarget().useEmulatedTLS())
  return LowerToTLSEmulatedModel(Node, DAG);
SDLoc DL(Node);
const GlobalValue *GV = Node->getGlobal();
EVT PtrVT = getPointerTy(DAG.getDataLayout());
TLSModel::Model model = DAG.getTarget().getTLSModel(GV);

SDValue TP = lowerThreadPointer(DL, DAG);

// Get the offset of GA from the thread pointer, based on the TLS model.
SDValue Offset;
switch (model) {
  case TLSModel::GeneralDynamic: {
    // Load the GOT offset of the tls_index (module ID / per-symbol offset).
    SystemZConstantPoolValue *CPV =
      SystemZConstantPoolValue::Create(GV, SystemZCP::TLSGD);

    Offset = DAG.getConstantPool(CPV, PtrVT, 8);
    Offset = DAG.getLoad(
        PtrVT, DL, DAG.getEntryNode(), Offset,
        MachinePointerInfo::getConstantPool(DAG.getMachineFunction()));

    // Call __tls_get_offset to retrieve the offset.
    Offset = lowerTLSGetOffset(Node, DAG, SystemZISD::TLS_GDCALL, Offset);
    break;
  }

  case TLSModel::LocalDynamic: {
    // Load the GOT offset of the module ID.
    SystemZConstantPoolValue *CPV =
      SystemZConstantPoolValue::Create(GV, SystemZCP::TLSLDM);

    Offset = DAG.getConstantPool(CPV, PtrVT, 8);
    Offset = DAG.getLoad(
        PtrVT, DL, DAG.getEntryNode(), Offset,
        MachinePointerInfo::getConstantPool(DAG.getMachineFunction()));

    // Call __tls_get_offset to retrieve the module base offset.
    Offset = lowerTLSGetOffset(Node, DAG, SystemZISD::TLS_LDCALL, Offset);

    // Note: The SystemZLDCleanupPass will remove redundant computations
    // of the module base offset.  Count total number of local-dynamic
    // accesses to trigger execution of that pass.
    SystemZMachineFunctionInfo* MFI =
      DAG.getMachineFunction().getInfo<SystemZMachineFunctionInfo>();
    MFI->incNumLocalDynamicTLSAccesses();

    // Add the per-symbol offset.
    CPV = SystemZConstantPoolValue::Create(GV, SystemZCP::DTPOFF);

    SDValue DTPOffset = DAG.getConstantPool(CPV, PtrVT, 8);
    DTPOffset = DAG.getLoad(
        PtrVT, DL, DAG.getEntryNode(), DTPOffset,
        MachinePointerInfo::getConstantPool(DAG.getMachineFunction()));

    Offset = DAG.getNode(ISD::ADD, DL, PtrVT, Offset, DTPOffset);
    break;
  }

  case TLSModel::InitialExec: {
    // Load the offset from the GOT.
    Offset = DAG.getTargetGlobalAddress(GV, DL, PtrVT, 0,
                                        SystemZII::MO_INDNTPOFF);
    Offset = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Offset);
    Offset =
        DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), Offset,
                    MachinePointerInfo::getGOT(DAG.getMachineFunction()));
    break;
  }

  case TLSModel::LocalExec: {
    // Force the offset into the constant pool and load it from there.
    SystemZConstantPoolValue *CPV =
      SystemZConstantPoolValue::Create(GV, SystemZCP::NTPOFF);

    Offset = DAG.getConstantPool(CPV, PtrVT, 8);
    Offset = DAG.getLoad(
        PtrVT, DL, DAG.getEntryNode(), Offset,
        MachinePointerInfo::getConstantPool(DAG.getMachineFunction()));
    break;
  }
}

// Add the base and offset together.
return DAG.getNode(ISD::ADD, DL, PtrVT, TP, Offset);
2796}

2798SDValue SystemZTargetLowering::lowerBlockAddress(BlockAddressSDNode *Node,
                                               SelectionDAG &DAG) const {
SDLoc DL(Node);
const BlockAddress *BA = Node->getBlockAddress();
int64_t Offset = Node->getOffset();
EVT PtrVT = getPointerTy(DAG.getDataLayout());

SDValue Result = DAG.getTargetBlockAddress(BA, PtrVT, Offset);
Result = DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Result);
return Result;
2808}

2810SDValue SystemZTargetLowering::lowerJumpTable(JumpTableSDNode *JT,
                                            SelectionDAG &DAG) const {
SDLoc DL(JT);
EVT PtrVT = getPointerTy(DAG.getDataLayout());
SDValue Result = DAG.getTargetJumpTable(JT->getIndex(), PtrVT);

// Use LARL to load the address of the table.
return DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Result);
2818}

2820SDValue SystemZTargetLowering::lowerConstantPool(ConstantPoolSDNode *CP,
                                               SelectionDAG &DAG) const {
SDLoc DL(CP);
EVT PtrVT = getPointerTy(DAG.getDataLayout());

SDValue Result;
if (CP->isMachineConstantPoolEntry())
  Result = DAG.getTargetConstantPool(CP->getMachineCPVal(), PtrVT,
                                     CP->getAlignment());
else
  Result = DAG.getTargetConstantPool(CP->getConstVal(), PtrVT,
                                     CP->getAlignment(), CP->getOffset());

// Use LARL to load the address of the constant pool entry.
return DAG.getNode(SystemZISD::PCREL_WRAPPER, DL, PtrVT, Result);
2835}

2837SDValue SystemZTargetLowering::lowerFRAMEADDR(SDValue Op,
                                            SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();
MachineFrameInfo &MFI = MF.getFrameInfo();
MFI.setFrameAddressIsTaken(true);

SDLoc DL(Op);
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
EVT PtrVT = getPointerTy(DAG.getDataLayout());

// If the back chain frame index has not been allocated yet, do so.
SystemZMachineFunctionInfo *FI = MF.getInfo<SystemZMachineFunctionInfo>();
int BackChainIdx = FI->getFramePointerSaveIndex();
if (!BackChainIdx) {
  // By definition, the frame address is the address of the back chain.
  BackChainIdx = MFI.CreateFixedObject(8, -SystemZMC::CallFrameSize, false);
  FI->setFramePointerSaveIndex(BackChainIdx);
}
SDValue BackChain = DAG.getFrameIndex(BackChainIdx, PtrVT);

// FIXME The frontend should detect this case.
if (Depth > 0) {
  report_fatal_error("Unsupported stack frame traversal count");
}

return BackChain;
2863}

2865SDValue SystemZTargetLowering::lowerRETURNADDR(SDValue Op,
                                             SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();
MachineFrameInfo &MFI = MF.getFrameInfo();
MFI.setReturnAddressIsTaken(true);

if (verifyReturnAddressArgumentIsConstant(Op, DAG))
  return SDValue();

SDLoc DL(Op);
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
EVT PtrVT = getPointerTy(DAG.getDataLayout());

// FIXME The frontend should detect this case.
if (Depth > 0) {
  report_fatal_error("Unsupported stack frame traversal count");
}

// Return R14D, which has the return address. Mark it an implicit live-in.
unsigned LinkReg = MF.addLiveIn(SystemZ::R14D, &SystemZ::GR64BitRegClass);
return DAG.getCopyFromReg(DAG.getEntryNode(), DL, LinkReg, PtrVT);
2886}

2888SDValue SystemZTargetLowering::lowerBITCAST(SDValue Op,
                                          SelectionDAG &DAG) const {
SDLoc DL(Op);
SDValue In = Op.getOperand(0);
EVT InVT = In.getValueType();
EVT ResVT = Op.getValueType();

// Convert loads directly.  This is normally done by DAGCombiner,
// but we need this case for bitcasts that are created during lowering
// and which are then lowered themselves.
if (auto *LoadN = dyn_cast<LoadSDNode>(In))
  if (ISD::isNormalLoad(LoadN)) {
    SDValue NewLoad = DAG.getLoad(ResVT, DL, LoadN->getChain(),
                                  LoadN->getBasePtr(), LoadN->getMemOperand());
    // Update the chain uses.
    DAG.ReplaceAllUsesOfValueWith(SDValue(LoadN, 1), NewLoad.getValue(1));
    return NewLoad;
  }

if (InVT == MVT::i32 && ResVT == MVT::f32) {
  SDValue In64;
  if (Subtarget.hasHighWord()) {
    SDNode *U64 = DAG.getMachineNode(TargetOpcode::IMPLICIT_DEF, DL,
                                     MVT::i64);
    In64 = DAG.getTargetInsertSubreg(SystemZ::subreg_h32, DL,
                                     MVT::i64, SDValue(U64, 0), In);
  } else {
    In64 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, In);
    In64 = DAG.getNode(ISD::SHL, DL, MVT::i64, In64,
                       DAG.getConstant(32, DL, MVT::i64));
  }
  SDValue Out64 = DAG.getNode(ISD::BITCAST, DL, MVT::f64, In64);
  return DAG.getTargetExtractSubreg(SystemZ::subreg_h32,
                                    DL, MVT::f32, Out64);
}
if (InVT == MVT::f32 && ResVT == MVT::i32) {
  SDNode *U64 = DAG.getMachineNode(TargetOpcode::IMPLICIT_DEF, DL, MVT::f64);
  SDValue In64 = DAG.getTargetInsertSubreg(SystemZ::subreg_h32, DL,
                                           MVT::f64, SDValue(U64, 0), In);
  SDValue Out64 = DAG.getNode(ISD::BITCAST, DL, MVT::i64, In64);
  if (Subtarget.hasHighWord())
    return DAG.getTargetExtractSubreg(SystemZ::subreg_h32, DL,
                                      MVT::i32, Out64);
  SDValue Shift = DAG.getNode(ISD::SRL, DL, MVT::i64, Out64,
                              DAG.getConstant(32, DL, MVT::i64));
  return DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, Shift);
}
llvm_unreachable("Unexpected bitcast combination")::llvm::llvm_unreachable_internal("Unexpected bitcast combination"
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 2935);
2936}

2938SDValue SystemZTargetLowering::lowerVASTART(SDValue Op,
                                          SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();
SystemZMachineFunctionInfo *FuncInfo =
  MF.getInfo<SystemZMachineFunctionInfo>();
EVT PtrVT = getPointerTy(DAG.getDataLayout());

SDValue Chain   = Op.getOperand(0);
SDValue Addr    = Op.getOperand(1);
const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
SDLoc DL(Op);

// The initial values of each field.
const unsigned NumFields = 4;
SDValue Fields[NumFields] = {
  DAG.getConstant(FuncInfo->getVarArgsFirstGPR(), DL, PtrVT),
  DAG.getConstant(FuncInfo->getVarArgsFirstFPR(), DL, PtrVT),
  DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT),
  DAG.getFrameIndex(FuncInfo->getRegSaveFrameIndex(), PtrVT)
};

// Store each field into its respective slot.
SDValue MemOps[NumFields];
unsigned Offset = 0;
for (unsigned I = 0; I < NumFields; ++I) {
  SDValue FieldAddr = Addr;
  if (Offset != 0)
    FieldAddr = DAG.getNode(ISD::ADD, DL, PtrVT, FieldAddr,
                            DAG.getIntPtrConstant(Offset, DL));
  MemOps[I] = DAG.getStore(Chain, DL, Fields[I], FieldAddr,
                           MachinePointerInfo(SV, Offset));
  Offset += 8;
}
return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, MemOps);
2972}

2974SDValue SystemZTargetLowering::lowerVACOPY(SDValue Op,
                                         SelectionDAG &DAG) const {
SDValue Chain      = Op.getOperand(0);
SDValue DstPtr     = Op.getOperand(1);
SDValue SrcPtr     = Op.getOperand(2);
const Value *DstSV = cast<SrcValueSDNode>(Op.getOperand(3))->getValue();
const Value *SrcSV = cast<SrcValueSDNode>(Op.getOperand(4))->getValue();
SDLoc DL(Op);

return DAG.getMemcpy(Chain, DL, DstPtr, SrcPtr, DAG.getIntPtrConstant(32, DL),
                     /*Align*/8, /*isVolatile*/false, /*AlwaysInline*/false,
                     /*isTailCall*/false,
                     MachinePointerInfo(DstSV), MachinePointerInfo(SrcSV));
2987}

2989SDValue SystemZTargetLowering::
2990lowerDYNAMIC_STACKALLOC(SDValue Op, SelectionDAG &DAG) const {
const TargetFrameLowering *TFI = Subtarget.getFrameLowering();
MachineFunction &MF = DAG.getMachineFunction();
bool RealignOpt = !MF.getFunction().hasFnAttribute("no-realign-stack");
bool StoreBackchain = MF.getFunction().hasFnAttribute("backchain");

SDValue Chain = Op.getOperand(0);
SDValue Size  = Op.getOperand(1);
SDValue Align = Op.getOperand(2);
SDLoc DL(Op);

// If user has set the no alignment function attribute, ignore
// alloca alignments.
uint64_t AlignVal = (RealignOpt ?
                     dyn_cast<ConstantSDNode>(Align)->getZExtValue() : 0);

uint64_t StackAlign = TFI->getStackAlignment();
uint64_t RequiredAlign = std::max(AlignVal, StackAlign);
uint64_t ExtraAlignSpace = RequiredAlign - StackAlign;

unsigned SPReg = getStackPointerRegisterToSaveRestore();
SDValue NeededSpace = Size;

// Get a reference to the stack pointer.
SDValue OldSP = DAG.getCopyFromReg(Chain, DL, SPReg, MVT::i64);

// If we need a backchain, save it now.
SDValue Backchain;
if (StoreBackchain)
  Backchain = DAG.getLoad(MVT::i64, DL, Chain, OldSP, MachinePointerInfo());

// Add extra space for alignment if needed.
if (ExtraAlignSpace)
  NeededSpace = DAG.getNode(ISD::ADD, DL, MVT::i64, NeededSpace,
                            DAG.getConstant(ExtraAlignSpace, DL, MVT::i64));

// Get the new stack pointer value.
SDValue NewSP = DAG.getNode(ISD::SUB, DL, MVT::i64, OldSP, NeededSpace);

// Copy the new stack pointer back.
Chain = DAG.getCopyToReg(Chain, DL, SPReg, NewSP);

// The allocated data lives above the 160 bytes allocated for the standard
// frame, plus any outgoing stack arguments.  We don't know how much that
// amounts to yet, so emit a special ADJDYNALLOC placeholder.
SDValue ArgAdjust = DAG.getNode(SystemZISD::ADJDYNALLOC, DL, MVT::i64);
SDValue Result = DAG.getNode(ISD::ADD, DL, MVT::i64, NewSP, ArgAdjust);

// Dynamically realign if needed.
if (RequiredAlign > StackAlign) {
  Result =
    DAG.getNode(ISD::ADD, DL, MVT::i64, Result,
                DAG.getConstant(ExtraAlignSpace, DL, MVT::i64));
  Result =
    DAG.getNode(ISD::AND, DL, MVT::i64, Result,
                DAG.getConstant(~(RequiredAlign - 1), DL, MVT::i64));
}

if (StoreBackchain)
  Chain = DAG.getStore(Chain, DL, Backchain, NewSP, MachinePointerInfo());

SDValue Ops[2] = { Result, Chain };
return DAG.getMergeValues(Ops, DL);
3053}

3055SDValue SystemZTargetLowering::lowerGET_DYNAMIC_AREA_OFFSET(
  SDValue Op, SelectionDAG &DAG) const {
SDLoc DL(Op);

return DAG.getNode(SystemZISD::ADJDYNALLOC, DL, MVT::i64);
3060}

3062SDValue SystemZTargetLowering::lowerSMUL_LOHI(SDValue Op,
                                            SelectionDAG &DAG) const {
EVT VT = Op.getValueType();
SDLoc DL(Op);
SDValue Ops[2];
if (is32Bit(VT))
  // Just do a normal 64-bit multiplication and extract the results.
  // We define this so that it can be used for constant division.
  lowerMUL_LOHI32(DAG, DL, ISD::SIGN_EXTEND, Op.getOperand(0),
                  Op.getOperand(1), Ops[1], Ops[0]);
else if (Subtarget.hasMiscellaneousExtensions2())
  // SystemZISD::SMUL_LOHI returns the low result in the odd register and
  // the high result in the even register.  ISD::SMUL_LOHI is defined to
  // return the low half first, so the results are in reverse order.
  lowerGR128Binary(DAG, DL, VT, SystemZISD::SMUL_LOHI,
                   Op.getOperand(0), Op.getOperand(1), Ops[1], Ops[0]);
else {
  // Do a full 128-bit multiplication based on SystemZISD::UMUL_LOHI:
  //
  //   (ll * rl) + ((lh * rl) << 64) + ((ll * rh) << 64)
  //
  // but using the fact that the upper halves are either all zeros
  // or all ones:
  //
  //   (ll * rl) - ((lh & rl) << 64) - ((ll & rh) << 64)
  //
  // and grouping the right terms together since they are quicker than the
  // multiplication:
  //
  //   (ll * rl) - (((lh & rl) + (ll & rh)) << 64)
  SDValue C63 = DAG.getConstant(63, DL, MVT::i64);
  SDValue LL = Op.getOperand(0);
  SDValue RL = Op.getOperand(1);
  SDValue LH = DAG.getNode(ISD::SRA, DL, VT, LL, C63);
  SDValue RH = DAG.getNode(ISD::SRA, DL, VT, RL, C63);
  // SystemZISD::UMUL_LOHI returns the low result in the odd register and
  // the high result in the even register.  ISD::SMUL_LOHI is defined to
  // return the low half first, so the results are in reverse order.
  lowerGR128Binary(DAG, DL, VT, SystemZISD::UMUL_LOHI,
                   LL, RL, Ops[1], Ops[0]);
  SDValue NegLLTimesRH = DAG.getNode(ISD::AND, DL, VT, LL, RH);
  SDValue NegLHTimesRL = DAG.getNode(ISD::AND, DL, VT, LH, RL);
  SDValue NegSum = DAG.getNode(ISD::ADD, DL, VT, NegLLTimesRH, NegLHTimesRL);
  Ops[1] = DAG.getNode(ISD::SUB, DL, VT, Ops[1], NegSum);
}
return DAG.getMergeValues(Ops, DL);
3108}

3110SDValue SystemZTargetLowering::lowerUMUL_LOHI(SDValue Op,
                                            SelectionDAG &DAG) const {
EVT VT = Op.getValueType();
SDLoc DL(Op);
SDValue Ops[2];
if (is32Bit(VT))
  // Just do a normal 64-bit multiplication and extract the results.
  // We define this so that it can be used for constant division.
  lowerMUL_LOHI32(DAG, DL, ISD::ZERO_EXTEND, Op.getOperand(0),
                  Op.getOperand(1), Ops[1], Ops[0]);
else
  // SystemZISD::UMUL_LOHI returns the low result in the odd register and
  // the high result in the even register.  ISD::UMUL_LOHI is defined to
  // return the low half first, so the results are in reverse order.
  lowerGR128Binary(DAG, DL, VT, SystemZISD::UMUL_LOHI,
                   Op.getOperand(0), Op.getOperand(1), Ops[1], Ops[0]);
return DAG.getMergeValues(Ops, DL);
3127}

3129SDValue SystemZTargetLowering::lowerSDIVREM(SDValue Op,
                                          SelectionDAG &DAG) const {
SDValue Op0 = Op.getOperand(0);
SDValue Op1 = Op.getOperand(1);
EVT VT = Op.getValueType();
SDLoc DL(Op);

// We use DSGF for 32-bit division.  This means the first operand must
// always be 64-bit, and the second operand should be 32-bit whenever
// that is possible, to improve performance.
if (is32Bit(VT))
  Op0 = DAG.getNode(ISD::SIGN_EXTEND, DL, MVT::i64, Op0);
else if (DAG.ComputeNumSignBits(Op1) > 32)
  Op1 = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, Op1);

// DSG(F) returns the remainder in the even register and the
// quotient in the odd register.
SDValue Ops[2];
lowerGR128Binary(DAG, DL, VT, SystemZISD::SDIVREM, Op0, Op1, Ops[1], Ops[0]);
return DAG.getMergeValues(Ops, DL);
3149}

3151SDValue SystemZTargetLowering::lowerUDIVREM(SDValue Op,
                                          SelectionDAG &DAG) const {
EVT VT = Op.getValueType();
SDLoc DL(Op);

// DL(G) returns the remainder in the even register and the
// quotient in the odd register.
SDValue Ops[2];
lowerGR128Binary(DAG, DL, VT, SystemZISD::UDIVREM,
                 Op.getOperand(0), Op.getOperand(1), Ops[1], Ops[0]);
return DAG.getMergeValues(Ops, DL);
3162}

3164SDValue SystemZTargetLowering::lowerOR(SDValue Op, SelectionDAG &DAG) const {
assert(Op.getValueType() == MVT::i64 && "Should be 64-bit operation")((Op.getValueType() == MVT::i64 && "Should be 64-bit operation"
) ? static_cast<void> (0) : __assert_fail ("Op.getValueType() == MVT::i64 && \"Should be 64-bit operation\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3165, __PRETTY_FUNCTION__));

// Get the known-zero masks for each operand.
SDValue Ops[] = {Op.getOperand(0), Op.getOperand(1)};
KnownBits Known[2] = {DAG.computeKnownBits(Ops[0]),
                      DAG.computeKnownBits(Ops[1])};

// See if the upper 32 bits of one operand and the lower 32 bits of the
// other are known zero.  They are the low and high operands respectively.
uint64_t Masks[] = { Known[0].Zero.getZExtValue(),
                     Known[1].Zero.getZExtValue() };
unsigned High, Low;
if ((Masks[0] >> 32) == 0xffffffff && uint32_t(Masks[1]) == 0xffffffff)
  High = 1, Low = 0;
else if ((Masks[1] >> 32) == 0xffffffff && uint32_t(Masks[0]) == 0xffffffff)
  High = 0, Low = 1;
else
  return Op;

SDValue LowOp = Ops[Low];
SDValue HighOp = Ops[High];

// If the high part is a constant, we're better off using IILH.
if (HighOp.getOpcode() == ISD::Constant)
  return Op;

// If the low part is a constant that is outside the range of LHI,
// then we're better off using IILF.
if (LowOp.getOpcode() == ISD::Constant) {
  int64_t Value = int32_t(cast<ConstantSDNode>(LowOp)->getZExtValue());
  if (!isInt<16>(Value))
    return Op;
}

// Check whether the high part is an AND that doesn't change the
// high 32 bits and just masks out low bits.  We can skip it if so.
if (HighOp.getOpcode() == ISD::AND &&
    HighOp.getOperand(1).getOpcode() == ISD::Constant) {
  SDValue HighOp0 = HighOp.getOperand(0);
  uint64_t Mask = cast<ConstantSDNode>(HighOp.getOperand(1))->getZExtValue();
  if (DAG.MaskedValueIsZero(HighOp0, APInt(64, ~(Mask | 0xffffffff))))
    HighOp = HighOp0;
}

// Take advantage of the fact that all GR32 operations only change the
// low 32 bits by truncating Low to an i32 and inserting it directly
// using a subreg.  The interesting cases are those where the truncation
// can be folded.
SDLoc DL(Op);
SDValue Low32 = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, LowOp);
return DAG.getTargetInsertSubreg(SystemZ::subreg_l32, DL,
                                 MVT::i64, HighOp, Low32);
3217}

3219// Lower SADDO/SSUBO/UADDO/USUBO nodes.
3220SDValue SystemZTargetLowering::lowerXALUO(SDValue Op,
                                        SelectionDAG &DAG) const {
SDNode *N = Op.getNode();
SDValue LHS = N->getOperand(0);
SDValue RHS = N->getOperand(1);
SDLoc DL(N);
unsigned BaseOp = 0;
unsigned CCValid = 0;
unsigned CCMask = 0;

switch (Op.getOpcode()) {
default: llvm_unreachable("Unknown instruction!")::llvm::llvm_unreachable_internal("Unknown instruction!", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3231);
case ISD::SADDO:
  BaseOp = SystemZISD::SADDO;
  CCValid = SystemZ::CCMASK_ARITH;
  CCMask = SystemZ::CCMASK_ARITH_OVERFLOW;
  break;
case ISD::SSUBO:
  BaseOp = SystemZISD::SSUBO;
  CCValid = SystemZ::CCMASK_ARITH;
  CCMask = SystemZ::CCMASK_ARITH_OVERFLOW;
  break;
case ISD::UADDO:
  BaseOp = SystemZISD::UADDO;
  CCValid = SystemZ::CCMASK_LOGICAL;
  CCMask = SystemZ::CCMASK_LOGICAL_CARRY;
  break;
case ISD::USUBO:
  BaseOp = SystemZISD::USUBO;
  CCValid = SystemZ::CCMASK_LOGICAL;
  CCMask = SystemZ::CCMASK_LOGICAL_BORROW;
  break;
}

SDVTList VTs = DAG.getVTList(N->getValueType(0), MVT::i32);
SDValue Result = DAG.getNode(BaseOp, DL, VTs, LHS, RHS);

SDValue SetCC = emitSETCC(DAG, DL, Result.getValue(1), CCValid, CCMask);
if (N->getValueType(1) == MVT::i1)
  SetCC = DAG.getNode(ISD::TRUNCATE, DL, MVT::i1, SetCC);

return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Result, SetCC);
3262}

3264// Lower ADDCARRY/SUBCARRY nodes.
3265SDValue SystemZTargetLowering::lowerADDSUBCARRY(SDValue Op,
                                              SelectionDAG &DAG) const {

SDNode *N = Op.getNode();
MVT VT = N->getSimpleValueType(0);

// Let legalize expand this if it isn't a legal type yet.
if (!DAG.getTargetLoweringInfo().isTypeLegal(VT))
  return SDValue();

SDValue LHS = N->getOperand(0);
SDValue RHS = N->getOperand(1);
SDValue Carry = Op.getOperand(2);
SDLoc DL(N);
unsigned BaseOp = 0;
unsigned CCValid = 0;
unsigned CCMask = 0;

switch (Op.getOpcode()) {
default: llvm_unreachable("Unknown instruction!")::llvm::llvm_unreachable_internal("Unknown instruction!", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3284);
case ISD::ADDCARRY:
  BaseOp = SystemZISD::ADDCARRY;
  CCValid = SystemZ::CCMASK_LOGICAL;
  CCMask = SystemZ::CCMASK_LOGICAL_CARRY;
  break;
case ISD::SUBCARRY:
  BaseOp = SystemZISD::SUBCARRY;
  CCValid = SystemZ::CCMASK_LOGICAL;
  CCMask = SystemZ::CCMASK_LOGICAL_BORROW;
  break;
}

// Set the condition code from the carry flag.
Carry = DAG.getNode(SystemZISD::GET_CCMASK, DL, MVT::i32, Carry,
                    DAG.getConstant(CCValid, DL, MVT::i32),
                    DAG.getConstant(CCMask, DL, MVT::i32));

SDVTList VTs = DAG.getVTList(VT, MVT::i32);
SDValue Result = DAG.getNode(BaseOp, DL, VTs, LHS, RHS, Carry);

SDValue SetCC = emitSETCC(DAG, DL, Result.getValue(1), CCValid, CCMask);
if (N->getValueType(1) == MVT::i1)
  SetCC = DAG.getNode(ISD::TRUNCATE, DL, MVT::i1, SetCC);

return DAG.getNode(ISD::MERGE_VALUES, DL, N->getVTList(), Result, SetCC);
3310}

3312SDValue SystemZTargetLowering::lowerCTPOP(SDValue Op,
                                        SelectionDAG &DAG) const {
EVT VT = Op.getValueType();
SDLoc DL(Op);
Op = Op.getOperand(0);

// Handle vector types via VPOPCT.
if (VT.isVector()) {
  Op = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Op);
  Op = DAG.getNode(SystemZISD::POPCNT, DL, MVT::v16i8, Op);
  switch (VT.getScalarSizeInBits()) {
  case 8:
    break;
  case 16: {
    Op = DAG.getNode(ISD::BITCAST, DL, VT, Op);
    SDValue Shift = DAG.getConstant(8, DL, MVT::i32);
    SDValue Tmp = DAG.getNode(SystemZISD::VSHL_BY_SCALAR, DL, VT, Op, Shift);
    Op = DAG.getNode(ISD::ADD, DL, VT, Op, Tmp);
    Op = DAG.getNode(SystemZISD::VSRL_BY_SCALAR, DL, VT, Op, Shift);
    break;
  }
  case 32: {
    SDValue Tmp = DAG.getNode(SystemZISD::BYTE_MASK, DL, MVT::v16i8,
                              DAG.getConstant(0, DL, MVT::i32));
    Op = DAG.getNode(SystemZISD::VSUM, DL, VT, Op, Tmp);
    break;
  }
  case 64: {
    SDValue Tmp = DAG.getNode(SystemZISD::BYTE_MASK, DL, MVT::v16i8,
                              DAG.getConstant(0, DL, MVT::i32));
    Op = DAG.getNode(SystemZISD::VSUM, DL, MVT::v4i32, Op, Tmp);
    Op = DAG.getNode(SystemZISD::VSUM, DL, VT, Op, Tmp);
    break;
  }
  default:
    llvm_unreachable("Unexpected type")::llvm::llvm_unreachable_internal("Unexpected type", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3347);
  }
  return Op;
}

// Get the known-zero mask for the operand.
KnownBits Known = DAG.computeKnownBits(Op);
unsigned NumSignificantBits = (~Known.Zero).getActiveBits();
if (NumSignificantBits == 0)
  return DAG.getConstant(0, DL, VT);

// Skip known-zero high parts of the operand.
int64_t OrigBitSize = VT.getSizeInBits();
int64_t BitSize = (int64_t)1 << Log2_32_Ceil(NumSignificantBits);
BitSize = std::min(BitSize, OrigBitSize);

// The POPCNT instruction counts the number of bits in each byte.
Op = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, Op);
Op = DAG.getNode(SystemZISD::POPCNT, DL, MVT::i64, Op);
Op = DAG.getNode(ISD::TRUNCATE, DL, VT, Op);

// Add up per-byte counts in a binary tree.  All bits of Op at
// position larger than BitSize remain zero throughout.
for (int64_t I = BitSize / 2; I >= 8; I = I / 2) {
  SDValue Tmp = DAG.getNode(ISD::SHL, DL, VT, Op, DAG.getConstant(I, DL, VT));
  if (BitSize != OrigBitSize)
    Tmp = DAG.getNode(ISD::AND, DL, VT, Tmp,
                      DAG.getConstant(((uint64_t)1 << BitSize) - 1, DL, VT));
  Op = DAG.getNode(ISD::ADD, DL, VT, Op, Tmp);
}

// Extract overall result from high byte.
if (BitSize > 8)
  Op = DAG.getNode(ISD::SRL, DL, VT, Op,
                   DAG.getConstant(BitSize - 8, DL, VT));

return Op;
3384}

3386SDValue SystemZTargetLowering::lowerATOMIC_FENCE(SDValue Op,
                                               SelectionDAG &DAG) const {
SDLoc DL(Op);
AtomicOrdering FenceOrdering = static_cast<AtomicOrdering>(
  cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue());
SyncScope::ID FenceSSID = static_cast<SyncScope::ID>(
  cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue());

// The only fence that needs an instruction is a sequentially-consistent
// cross-thread fence.
if (FenceOrdering == AtomicOrdering::SequentiallyConsistent &&
    FenceSSID == SyncScope::System) {
  return SDValue(DAG.getMachineNode(SystemZ::Serialize, DL, MVT::Other,
                                    Op.getOperand(0)),
                 0);
}

// MEMBARRIER is a compiler barrier; it codegens to a no-op.
return DAG.getNode(SystemZISD::MEMBARRIER, DL, MVT::Other, Op.getOperand(0));
3405}

3407// Op is an atomic load.  Lower it into a normal volatile load.
3408SDValue SystemZTargetLowering::lowerATOMIC_LOAD(SDValue Op,
                                              SelectionDAG &DAG) const {
auto *Node = cast<AtomicSDNode>(Op.getNode());
return DAG.getExtLoad(ISD::EXTLOAD, SDLoc(Op), Op.getValueType(),
                      Node->getChain(), Node->getBasePtr(),
                      Node->getMemoryVT(), Node->getMemOperand());
3414}

3416// Op is an atomic store.  Lower it into a normal volatile store.
3417SDValue SystemZTargetLowering::lowerATOMIC_STORE(SDValue Op,
                                               SelectionDAG &DAG) const {
auto *Node = cast<AtomicSDNode>(Op.getNode());
SDValue Chain = DAG.getTruncStore(Node->getChain(), SDLoc(Op), Node->getVal(),
                                  Node->getBasePtr(), Node->getMemoryVT(),
                                  Node->getMemOperand());
// We have to enforce sequential consistency by performing a
// serialization operation after the store.
if (Node->getOrdering() == AtomicOrdering::SequentiallyConsistent)
  Chain = SDValue(DAG.getMachineNode(SystemZ::Serialize, SDLoc(Op),
                                     MVT::Other, Chain), 0);
return Chain;
3429}

3431// Op is an 8-, 16-bit or 32-bit ATOMIC_LOAD_* operation.  Lower the first
3432// two into the fullword ATOMIC_LOADW_* operation given by Opcode.
3433SDValue SystemZTargetLowering::lowerATOMIC_LOAD_OP(SDValue Op,
                                                 SelectionDAG &DAG,
                                                 unsigned Opcode) const {
auto *Node = cast<AtomicSDNode>(Op.getNode());

// 32-bit operations need no code outside the main loop.
EVT NarrowVT = Node->getMemoryVT();
EVT WideVT = MVT::i32;
if (NarrowVT == WideVT)
  return Op;

int64_t BitSize = NarrowVT.getSizeInBits();
SDValue ChainIn = Node->getChain();
SDValue Addr = Node->getBasePtr();
SDValue Src2 = Node->getVal();
MachineMemOperand *MMO = Node->getMemOperand();
SDLoc DL(Node);
EVT PtrVT = Addr.getValueType();

// Convert atomic subtracts of constants into additions.
if (Opcode == SystemZISD::ATOMIC_LOADW_SUB)
  if (auto *Const = dyn_cast<ConstantSDNode>(Src2)) {
    Opcode = SystemZISD::ATOMIC_LOADW_ADD;
    Src2 = DAG.getConstant(-Const->getSExtValue(), DL, Src2.getValueType());
  }

// Get the address of the containing word.
SDValue AlignedAddr = DAG.getNode(ISD::AND, DL, PtrVT, Addr,
                                  DAG.getConstant(-4, DL, PtrVT));

// Get the number of bits that the word must be rotated left in order
// to bring the field to the top bits of a GR32.
SDValue BitShift = DAG.getNode(ISD::SHL, DL, PtrVT, Addr,
                               DAG.getConstant(3, DL, PtrVT));
BitShift = DAG.getNode(ISD::TRUNCATE, DL, WideVT, BitShift);

// Get the complementing shift amount, for rotating a field in the top
// bits back to its proper position.
SDValue NegBitShift = DAG.getNode(ISD::SUB, DL, WideVT,
                                  DAG.getConstant(0, DL, WideVT), BitShift);

// Extend the source operand to 32 bits and prepare it for the inner loop.
// ATOMIC_SWAPW uses RISBG to rotate the field left, but all other
// operations require the source to be shifted in advance.  (This shift
// can be folded if the source is constant.)  For AND and NAND, the lower
// bits must be set, while for other opcodes they should be left clear.
if (Opcode != SystemZISD::ATOMIC_SWAPW)
  Src2 = DAG.getNode(ISD::SHL, DL, WideVT, Src2,
                     DAG.getConstant(32 - BitSize, DL, WideVT));
if (Opcode == SystemZISD::ATOMIC_LOADW_AND ||
    Opcode == SystemZISD::ATOMIC_LOADW_NAND)
  Src2 = DAG.getNode(ISD::OR, DL, WideVT, Src2,
                     DAG.getConstant(uint32_t(-1) >> BitSize, DL, WideVT));

// Construct the ATOMIC_LOADW_* node.
SDVTList VTList = DAG.getVTList(WideVT, MVT::Other);
SDValue Ops[] = { ChainIn, AlignedAddr, Src2, BitShift, NegBitShift,
                  DAG.getConstant(BitSize, DL, WideVT) };
SDValue AtomicOp = DAG.getMemIntrinsicNode(Opcode, DL, VTList, Ops,
                                           NarrowVT, MMO);

// Rotate the result of the final CS so that the field is in the lower
// bits of a GR32, then truncate it.
SDValue ResultShift = DAG.getNode(ISD::ADD, DL, WideVT, BitShift,
                                  DAG.getConstant(BitSize, DL, WideVT));
SDValue Result = DAG.getNode(ISD::ROTL, DL, WideVT, AtomicOp, ResultShift);

SDValue RetOps[2] = { Result, AtomicOp.getValue(1) };
return DAG.getMergeValues(RetOps, DL);
3502}

3504// Op is an ATOMIC_LOAD_SUB operation.  Lower 8- and 16-bit operations
3505// into ATOMIC_LOADW_SUBs and decide whether to convert 32- and 64-bit
3506// operations into additions.
3507SDValue SystemZTargetLowering::lowerATOMIC_LOAD_SUB(SDValue Op,
                                                  SelectionDAG &DAG) const {
auto *Node = cast<AtomicSDNode>(Op.getNode());
EVT MemVT = Node->getMemoryVT();
if (MemVT == MVT::i32 || MemVT == MVT::i64) {
  // A full-width operation.
  assert(Op.getValueType() == MemVT && "Mismatched VTs")((Op.getValueType() == MemVT && "Mismatched VTs") ? static_cast
<void> (0) : __assert_fail ("Op.getValueType() == MemVT && \"Mismatched VTs\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3513, __PRETTY_FUNCTION__));
  SDValue Src2 = Node->getVal();
  SDValue NegSrc2;
  SDLoc DL(Src2);

  if (auto *Op2 = dyn_cast<ConstantSDNode>(Src2)) {
    // Use an addition if the operand is constant and either LAA(G) is
    // available or the negative value is in the range of A(G)FHI.
    int64_t Value = (-Op2->getAPIntValue()).getSExtValue();
    if (isInt<32>(Value) || Subtarget.hasInterlockedAccess1())
      NegSrc2 = DAG.getConstant(Value, DL, MemVT);
  } else if (Subtarget.hasInterlockedAccess1())
    // Use LAA(G) if available.
    NegSrc2 = DAG.getNode(ISD::SUB, DL, MemVT, DAG.getConstant(0, DL, MemVT),
                          Src2);

  if (NegSrc2.getNode())
    return DAG.getAtomic(ISD::ATOMIC_LOAD_ADD, DL, MemVT,
                         Node->getChain(), Node->getBasePtr(), NegSrc2,
                         Node->getMemOperand());

  // Use the node as-is.
  return Op;
}

return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_SUB);
3539}

3541// Lower 8/16/32/64-bit ATOMIC_CMP_SWAP_WITH_SUCCESS node.
3542SDValue SystemZTargetLowering::lowerATOMIC_CMP_SWAP(SDValue Op,
                                                  SelectionDAG &DAG) const {
auto *Node = cast<AtomicSDNode>(Op.getNode());
SDValue ChainIn = Node->getOperand(0);
SDValue Addr = Node->getOperand(1);
SDValue CmpVal = Node->getOperand(2);
SDValue SwapVal = Node->getOperand(3);
MachineMemOperand *MMO = Node->getMemOperand();
SDLoc DL(Node);

// We have native support for 32-bit and 64-bit compare and swap, but we
// still need to expand extracting the "success" result from the CC.
EVT NarrowVT = Node->getMemoryVT();
EVT WideVT = NarrowVT == MVT::i64 ? MVT::i64 : MVT::i32;
if (NarrowVT == WideVT) {
  SDVTList Tys = DAG.getVTList(WideVT, MVT::i32, MVT::Other);
  SDValue Ops[] = { ChainIn, Addr, CmpVal, SwapVal };
  SDValue AtomicOp = DAG.getMemIntrinsicNode(SystemZISD::ATOMIC_CMP_SWAP,
                                             DL, Tys, Ops, NarrowVT, MMO);
  SDValue Success = emitSETCC(DAG, DL, AtomicOp.getValue(1),
                              SystemZ::CCMASK_CS, SystemZ::CCMASK_CS_EQ);

  DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), AtomicOp.getValue(0));
  DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
  DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), AtomicOp.getValue(2));
  return SDValue();
}

// Convert 8-bit and 16-bit compare and swap to a loop, implemented
// via a fullword ATOMIC_CMP_SWAPW operation.
int64_t BitSize = NarrowVT.getSizeInBits();
EVT PtrVT = Addr.getValueType();

// Get the address of the containing word.
SDValue AlignedAddr = DAG.getNode(ISD::AND, DL, PtrVT, Addr,
                                  DAG.getConstant(-4, DL, PtrVT));

// Get the number of bits that the word must be rotated left in order
// to bring the field to the top bits of a GR32.
SDValue BitShift = DAG.getNode(ISD::SHL, DL, PtrVT, Addr,
                               DAG.getConstant(3, DL, PtrVT));
BitShift = DAG.getNode(ISD::TRUNCATE, DL, WideVT, BitShift);

// Get the complementing shift amount, for rotating a field in the top
// bits back to its proper position.
SDValue NegBitShift = DAG.getNode(ISD::SUB, DL, WideVT,
                                  DAG.getConstant(0, DL, WideVT), BitShift);

// Construct the ATOMIC_CMP_SWAPW node.
SDVTList VTList = DAG.getVTList(WideVT, MVT::i32, MVT::Other);
SDValue Ops[] = { ChainIn, AlignedAddr, CmpVal, SwapVal, BitShift,
                  NegBitShift, DAG.getConstant(BitSize, DL, WideVT) };
SDValue AtomicOp = DAG.getMemIntrinsicNode(SystemZISD::ATOMIC_CMP_SWAPW, DL,
                                           VTList, Ops, NarrowVT, MMO);
SDValue Success = emitSETCC(DAG, DL, AtomicOp.getValue(1),
                            SystemZ::CCMASK_ICMP, SystemZ::CCMASK_CMP_EQ);

DAG.ReplaceAllUsesOfValueWith(Op.getValue(0), AtomicOp.getValue(0));
DAG.ReplaceAllUsesOfValueWith(Op.getValue(1), Success);
DAG.ReplaceAllUsesOfValueWith(Op.getValue(2), AtomicOp.getValue(2));
return SDValue();
3603}

3605SDValue SystemZTargetLowering::lowerSTACKSAVE(SDValue Op,
                                            SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();
MF.getInfo<SystemZMachineFunctionInfo>()->setManipulatesSP(true);
return DAG.getCopyFromReg(Op.getOperand(0), SDLoc(Op),
                          SystemZ::R15D, Op.getValueType());
3611}

3613SDValue SystemZTargetLowering::lowerSTACKRESTORE(SDValue Op,
                                               SelectionDAG &DAG) const {
MachineFunction &MF = DAG.getMachineFunction();
MF.getInfo<SystemZMachineFunctionInfo>()->setManipulatesSP(true);
bool StoreBackchain = MF.getFunction().hasFnAttribute("backchain");

SDValue Chain = Op.getOperand(0);
SDValue NewSP = Op.getOperand(1);
SDValue Backchain;
SDLoc DL(Op);

if (StoreBackchain) {
  SDValue OldSP = DAG.getCopyFromReg(Chain, DL, SystemZ::R15D, MVT::i64);
  Backchain = DAG.getLoad(MVT::i64, DL, Chain, OldSP, MachinePointerInfo());
}

Chain = DAG.getCopyToReg(Chain, DL, SystemZ::R15D, NewSP);

if (StoreBackchain)
  Chain = DAG.getStore(Chain, DL, Backchain, NewSP, MachinePointerInfo());

return Chain;
3635}

3637SDValue SystemZTargetLowering::lowerPREFETCH(SDValue Op,
                                           SelectionDAG &DAG) const {
bool IsData = cast<ConstantSDNode>(Op.getOperand(4))->getZExtValue();
if (!IsData)
  // Just preserve the chain.
  return Op.getOperand(0);

SDLoc DL(Op);
bool IsWrite = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
unsigned Code = IsWrite ? SystemZ::PFD_WRITE : SystemZ::PFD_READ;
auto *Node = cast<MemIntrinsicSDNode>(Op.getNode());
SDValue Ops[] = {
  Op.getOperand(0),
  DAG.getConstant(Code, DL, MVT::i32),
  Op.getOperand(1)
};
return DAG.getMemIntrinsicNode(SystemZISD::PREFETCH, DL,
                               Node->getVTList(), Ops,
                               Node->getMemoryVT(), Node->getMemOperand());
3656}

3658// Convert condition code in CCReg to an i32 value.
3659static SDValue getCCResult(SelectionDAG &DAG, SDValue CCReg) {
SDLoc DL(CCReg);
SDValue IPM = DAG.getNode(SystemZISD::IPM, DL, MVT::i32, CCReg);
return DAG.getNode(ISD::SRL, DL, MVT::i32, IPM,
                   DAG.getConstant(SystemZ::IPM_CC, DL, MVT::i32));
3664}

3666SDValue
3667SystemZTargetLowering::lowerINTRINSIC_W_CHAIN(SDValue Op,
                                            SelectionDAG &DAG) const {
unsigned Opcode, CCValid;
if (isIntrinsicWithCCAndChain(Op, Opcode, CCValid)) {
  assert(Op->getNumValues() == 2 && "Expected only CC result and chain")((Op->getNumValues() == 2 && "Expected only CC result and chain"
) ? static_cast<void> (0) : __assert_fail ("Op->getNumValues() == 2 && \"Expected only CC result and chain\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3671, __PRETTY_FUNCTION__));
  SDNode *Node = emitIntrinsicWithCCAndChain(DAG, Op, Opcode);
  SDValue CC = getCCResult(DAG, SDValue(Node, 0));
  DAG.ReplaceAllUsesOfValueWith(SDValue(Op.getNode(), 0), CC);
  return SDValue();
}

return SDValue();
3679}

3681SDValue
3682SystemZTargetLowering::lowerINTRINSIC_WO_CHAIN(SDValue Op,
                                             SelectionDAG &DAG) const {
unsigned Opcode, CCValid;
if (isIntrinsicWithCC(Op, Opcode, CCValid)) {
  SDNode *Node = emitIntrinsicWithCC(DAG, Op, Opcode);
  if (Op->getNumValues() == 1)
    return getCCResult(DAG, SDValue(Node, 0));
  assert(Op->getNumValues() == 2 && "Expected a CC and non-CC result")((Op->getNumValues() == 2 && "Expected a CC and non-CC result"
) ? static_cast<void> (0) : __assert_fail ("Op->getNumValues() == 2 && \"Expected a CC and non-CC result\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 3689, __PRETTY_FUNCTION__));
  return DAG.getNode(ISD::MERGE_VALUES, SDLoc(Op), Op->getVTList(),
                     SDValue(Node, 0), getCCResult(DAG, SDValue(Node, 1)));
}

unsigned Id = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
switch (Id) {
case Intrinsic::thread_pointer:
  return lowerThreadPointer(SDLoc(Op), DAG);

case Intrinsic::s390_vpdi:
  return DAG.getNode(SystemZISD::PERMUTE_DWORDS, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));

case Intrinsic::s390_vperm:
  return DAG.getNode(SystemZISD::PERMUTE, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1), Op.getOperand(2), Op.getOperand(3));

case Intrinsic::s390_vuphb:
case Intrinsic::s390_vuphh:
case Intrinsic::s390_vuphf:
  return DAG.getNode(SystemZISD::UNPACK_HIGH, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1));

case Intrinsic::s390_vuplhb:
case Intrinsic::s390_vuplhh:
case Intrinsic::s390_vuplhf:
  return DAG.getNode(SystemZISD::UNPACKL_HIGH, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1));

case Intrinsic::s390_vuplb:
case Intrinsic::s390_vuplhw:
case Intrinsic::s390_vuplf:
  return DAG.getNode(SystemZISD::UNPACK_LOW, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1));

case Intrinsic::s390_vupllb:
case Intrinsic::s390_vupllh:
case Intrinsic::s390_vupllf:
  return DAG.getNode(SystemZISD::UNPACKL_LOW, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1));

case Intrinsic::s390_vsumb:
case Intrinsic::s390_vsumh:
case Intrinsic::s390_vsumgh:
case Intrinsic::s390_vsumgf:
case Intrinsic::s390_vsumqf:
case Intrinsic::s390_vsumqg:
  return DAG.getNode(SystemZISD::VSUM, SDLoc(Op), Op.getValueType(),
                     Op.getOperand(1), Op.getOperand(2));
}

return SDValue();
3742}

3744namespace {
3745// Says that SystemZISD operation Opcode can be used to perform the equivalent
3746// of a VPERM with permute vector Bytes.  If Opcode takes three operands,
3747// Operand is the constant third operand, otherwise it is the number of
3748// bytes in each element of the result.
3749struct Permute {
unsigned Opcode;
unsigned Operand;
unsigned char Bytes[SystemZ::VectorBytes];
3753};
3754}

3756static const Permute PermuteForms[] = {
// VMRHG
{ SystemZISD::MERGE_HIGH, 8,
  { 0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23 } },
// VMRHF
{ SystemZISD::MERGE_HIGH, 4,
  { 0, 1, 2, 3, 16, 17, 18, 19, 4, 5, 6, 7, 20, 21, 22, 23 } },
// VMRHH
{ SystemZISD::MERGE_HIGH, 2,
  { 0, 1, 16, 17, 2, 3, 18, 19, 4, 5, 20, 21, 6, 7, 22, 23 } },
// VMRHB
{ SystemZISD::MERGE_HIGH, 1,
  { 0, 16, 1, 17, 2, 18, 3, 19, 4, 20, 5, 21, 6, 22, 7, 23 } },
// VMRLG
{ SystemZISD::MERGE_LOW, 8,
  { 8, 9, 10, 11, 12, 13, 14, 15, 24, 25, 26, 27, 28, 29, 30, 31 } },
// VMRLF
{ SystemZISD::MERGE_LOW, 4,
  { 8, 9, 10, 11, 24, 25, 26, 27, 12, 13, 14, 15, 28, 29, 30, 31 } },
// VMRLH
{ SystemZISD::MERGE_LOW, 2,
  { 8, 9, 24, 25, 10, 11, 26, 27, 12, 13, 28, 29, 14, 15, 30, 31 } },
// VMRLB
{ SystemZISD::MERGE_LOW, 1,
  { 8, 24, 9, 25, 10, 26, 11, 27, 12, 28, 13, 29, 14, 30, 15, 31 } },
// VPKG
{ SystemZISD::PACK, 4,
  { 4, 5, 6, 7, 12, 13, 14, 15, 20, 21, 22, 23, 28, 29, 30, 31 } },
// VPKF
{ SystemZISD::PACK, 2,
  { 2, 3, 6, 7, 10, 11, 14, 15, 18, 19, 22, 23, 26, 27, 30, 31 } },
// VPKH
{ SystemZISD::PACK, 1,
  { 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31 } },
// VPDI V1, V2, 4  (low half of V1, high half of V2)
{ SystemZISD::PERMUTE_DWORDS, 4,
  { 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23 } },
// VPDI V1, V2, 1  (high half of V1, low half of V2)
{ SystemZISD::PERMUTE_DWORDS, 1,
  { 0, 1, 2, 3, 4, 5, 6, 7, 24, 25, 26, 27, 28, 29, 30, 31 } }
3796};

3798// Called after matching a vector shuffle against a particular pattern.
3799// Both the original shuffle and the pattern have two vector operands.
3800// OpNos[0] is the operand of the original shuffle that should be used for
3801// operand 0 of the pattern, or -1 if operand 0 of the pattern can be anything.
3802// OpNos[1] is the same for operand 1 of the pattern.  Resolve these -1s and
3803// set OpNo0 and OpNo1 to the shuffle operands that should actually be used
3804// for operands 0 and 1 of the pattern.
3805static bool chooseShuffleOpNos(int *OpNos, unsigned &OpNo0, unsigned &OpNo1) {
if (OpNos[0] < 0) {
  if (OpNos[1] < 0)
    return false;
  OpNo0 = OpNo1 = OpNos[1];
} else if (OpNos[1] < 0) {
  OpNo0 = OpNo1 = OpNos[0];
} else {
  OpNo0 = OpNos[0];
  OpNo1 = OpNos[1];
}
return true;
3817}

3819// Bytes is a VPERM-like permute vector, except that -1 is used for
3820// undefined bytes.  Return true if the VPERM can be implemented using P.
3821// When returning true set OpNo0 to the VPERM operand that should be
3822// used for operand 0 of P and likewise OpNo1 for operand 1 of P.
3823//
3824// For example, if swapping the VPERM operands allows P to match, OpNo0
3825// will be 1 and OpNo1 will be 0.  If instead Bytes only refers to one
3826// operand, but rewriting it to use two duplicated operands allows it to
3827// match P, then OpNo0 and OpNo1 will be the same.
3828static bool matchPermute(const SmallVectorImpl<int> &Bytes, const Permute &P,
                       unsigned &OpNo0, unsigned &OpNo1) {
int OpNos[] = { -1, -1 };
for (unsigned I = 0; I < SystemZ::VectorBytes; ++I) {
  int Elt = Bytes[I];
  if (Elt >= 0) {
    // Make sure that the two permute vectors use the same suboperand
    // byte number.  Only the operand numbers (the high bits) are
    // allowed to differ.
    if ((Elt ^ P.Bytes[I]) & (SystemZ::VectorBytes - 1))
      return false;
    int ModelOpNo = P.Bytes[I] / SystemZ::VectorBytes;
    int RealOpNo = unsigned(Elt) / SystemZ::VectorBytes;
    // Make sure that the operand mappings are consistent with previous
    // elements.
    if (OpNos[ModelOpNo] == 1 - RealOpNo)
      return false;
    OpNos[ModelOpNo] = RealOpNo;
  }
}
return chooseShuffleOpNos(OpNos, OpNo0, OpNo1);
3849}

3851// As above, but search for a matching permute.
3852static const Permute *matchPermute(const SmallVectorImpl<int> &Bytes,
                                 unsigned &OpNo0, unsigned &OpNo1) {
for (auto &P : PermuteForms)
  if (matchPermute(Bytes, P, OpNo0, OpNo1))
    return &P;
return nullptr;
3858}

3860// Bytes is a VPERM-like permute vector, except that -1 is used for
3861// undefined bytes.  This permute is an operand of an outer permute.
3862// See whether redistributing the -1 bytes gives a shuffle that can be
3863// implemented using P.  If so, set Transform to a VPERM-like permute vector
3864// that, when applied to the result of P, gives the original permute in Bytes.
3865static bool matchDoublePermute(const SmallVectorImpl<int> &Bytes,
                             const Permute &P,
                             SmallVectorImpl<int> &Transform) {
unsigned To = 0;
for (unsigned From = 0; From < SystemZ::VectorBytes; ++From) {
  int Elt = Bytes[From];
  if (Elt < 0)
    // Byte number From of the result is undefined.
    Transform[From] = -1;
  else {
    while (P.Bytes[To] != Elt) {
      To += 1;
      if (To == SystemZ::VectorBytes)
        return false;
    }
    Transform[From] = To;
  }
}
return true;
3884}

3886// As above, but search for a matching permute.
3887static const Permute *matchDoublePermute(const SmallVectorImpl<int> &Bytes,
                                       SmallVectorImpl<int> &Transform) {
for (auto &P : PermuteForms)
  if (matchDoublePermute(Bytes, P, Transform))
    return &P;
return nullptr;
3893}

3895// Convert the mask of the given shuffle op into a byte-level mask,
3896// as if it had type vNi8.
3897static bool getVPermMask(SDValue ShuffleOp,
                       SmallVectorImpl<int> &Bytes) {
EVT VT = ShuffleOp.getValueType();
unsigned NumElements = VT.getVectorNumElements();
unsigned BytesPerElement = VT.getVectorElementType().getStoreSize();

if (auto *VSN = dyn_cast<ShuffleVectorSDNode>(ShuffleOp)) {
  Bytes.resize(NumElements * BytesPerElement, -1);
  for (unsigned I = 0; I < NumElements; ++I) {
    int Index = VSN->getMaskElt(I);
    if (Index >= 0)
      for (unsigned J = 0; J < BytesPerElement; ++J)
        Bytes[I * BytesPerElement + J] = Index * BytesPerElement + J;
  }
  return true;
}
if (SystemZISD::SPLAT == ShuffleOp.getOpcode() &&
    isa<ConstantSDNode>(ShuffleOp.getOperand(1))) {
  unsigned Index = ShuffleOp.getConstantOperandVal(1);
  Bytes.resize(NumElements * BytesPerElement, -1);
  for (unsigned I = 0; I < NumElements; ++I)
    for (unsigned J = 0; J < BytesPerElement; ++J)
      Bytes[I * BytesPerElement + J] = Index * BytesPerElement + J;
  return true;
}
return false;
3923}

3925// Bytes is a VPERM-like permute vector, except that -1 is used for
3926// undefined bytes.  See whether bytes [Start, Start + BytesPerElement) of
3927// the result come from a contiguous sequence of bytes from one input.
3928// Set Base to the selector for the first byte if so.
3929static bool getShuffleInput(const SmallVectorImpl<int> &Bytes, unsigned Start,
                          unsigned BytesPerElement, int &Base) {
Base = -1;
for (unsigned I = 0; I < BytesPerElement; ++I) {
  if (Bytes[Start + I] >= 0) {
    unsigned Elem = Bytes[Start + I];
    if (Base < 0) {
      Base = Elem - I;
      // Make sure the bytes would come from one input operand.
      if (unsigned(Base) % Bytes.size() + BytesPerElement > Bytes.size())
        return false;
    } else if (unsigned(Base) != Elem - I)
      return false;
  }
}
return true;
3945}

3947// Bytes is a VPERM-like permute vector, except that -1 is used for
3948// undefined bytes.  Return true if it can be performed using VSLDI.
3949// When returning true, set StartIndex to the shift amount and OpNo0
3950// and OpNo1 to the VPERM operands that should be used as the first
3951// and second shift operand respectively.
3952static bool isShlDoublePermute(const SmallVectorImpl<int> &Bytes,
                             unsigned &StartIndex, unsigned &OpNo0,
                             unsigned &OpNo1) {
int OpNos[] = { -1, -1 };
int Shift = -1;
for (unsigned I = 0; I < 16; ++I) {
  int Index = Bytes[I];
  if (Index >= 0) {
    int ExpectedShift = (Index - I) % SystemZ::VectorBytes;
    int ModelOpNo = unsigned(ExpectedShift + I) / SystemZ::VectorBytes;
    int RealOpNo = unsigned(Index) / SystemZ::VectorBytes;
    if (Shift < 0)
      Shift = ExpectedShift;
    else if (Shift != ExpectedShift)
      return false;
    // Make sure that the operand mappings are consistent with previous
    // elements.
    if (OpNos[ModelOpNo] == 1 - RealOpNo)
      return false;
    OpNos[ModelOpNo] = RealOpNo;
  }
}
StartIndex = Shift;
return chooseShuffleOpNos(OpNos, OpNo0, OpNo1);
3976}

3978// Create a node that performs P on operands Op0 and Op1, casting the
3979// operands to the appropriate type.  The type of the result is determined by P.
3980static SDValue getPermuteNode(SelectionDAG &DAG, const SDLoc &DL,
                            const Permute &P, SDValue Op0, SDValue Op1) {
// VPDI (PERMUTE_DWORDS) always operates on v2i64s.  The input
// elements of a PACK are twice as wide as the outputs.
unsigned InBytes = (P.Opcode == SystemZISD::PERMUTE_DWORDS ? 8 :
                    P.Opcode == SystemZISD::PACK ? P.Operand * 2 :
                    P.Operand);
// Cast both operands to the appropriate type.
MVT InVT = MVT::getVectorVT(MVT::getIntegerVT(InBytes * 8),
                            SystemZ::VectorBytes / InBytes);
Op0 = DAG.getNode(ISD::BITCAST, DL, InVT, Op0);
Op1 = DAG.getNode(ISD::BITCAST, DL, InVT, Op1);
SDValue Op;
if (P.Opcode == SystemZISD::PERMUTE_DWORDS) {
  SDValue Op2 = DAG.getConstant(P.Operand, DL, MVT::i32);
  Op = DAG.getNode(SystemZISD::PERMUTE_DWORDS, DL, InVT, Op0, Op1, Op2);
} else if (P.Opcode == SystemZISD::PACK) {
  MVT OutVT = MVT::getVectorVT(MVT::getIntegerVT(P.Operand * 8),
                               SystemZ::VectorBytes / P.Operand);
  Op = DAG.getNode(SystemZISD::PACK, DL, OutVT, Op0, Op1);
} else {
  Op = DAG.getNode(P.Opcode, DL, InVT, Op0, Op1);
}
return Op;
4004}

4006// Bytes is a VPERM-like permute vector, except that -1 is used for
4007// undefined bytes.  Implement it on operands Ops[0] and Ops[1] using
4008// VSLDI or VPERM.
4009static SDValue getGeneralPermuteNode(SelectionDAG &DAG, const SDLoc &DL,
                                   SDValue *Ops,
                                   const SmallVectorImpl<int> &Bytes) {
for (unsigned I = 0; I < 2; ++I)
  Ops[I] = DAG.getNode(ISD::BITCAST, DL, MVT::v16i8, Ops[I]);

// First see whether VSLDI can be used.
unsigned StartIndex, OpNo0, OpNo1;
if (isShlDoublePermute(Bytes, StartIndex, OpNo0, OpNo1))
  return DAG.getNode(SystemZISD::SHL_DOUBLE, DL, MVT::v16i8, Ops[OpNo0],
                     Ops[OpNo1], DAG.getConstant(StartIndex, DL, MVT::i32));

// Fall back on VPERM.  Construct an SDNode for the permute vector.
SDValue IndexNodes[SystemZ::VectorBytes];
for (unsigned I = 0; I < SystemZ::VectorBytes; ++I)
  if (Bytes[I] >= 0)
    IndexNodes[I] = DAG.getConstant(Bytes[I], DL, MVT::i32);
  else
    IndexNodes[I] = DAG.getUNDEF(MVT::i32);
SDValue Op2 = DAG.getBuildVector(MVT::v16i8, DL, IndexNodes);
return DAG.getNode(SystemZISD::PERMUTE, DL, MVT::v16i8, Ops[0], Ops[1], Op2);
4030}

4032namespace {
4033// Describes a general N-operand vector shuffle.
4034struct GeneralShuffle {
GeneralShuffle(EVT vt) : VT(vt) {}
void addUndef();
bool add(SDValue, unsigned);
SDValue getNode(SelectionDAG &, const SDLoc &);

// The operands of the shuffle.
SmallVector<SDValue, SystemZ::VectorBytes> Ops;

// Index I is -1 if byte I of the result is undefined.  Otherwise the
// result comes from byte Bytes[I] % SystemZ::VectorBytes of operand
// Bytes[I] / SystemZ::VectorBytes.
SmallVector<int, SystemZ::VectorBytes> Bytes;

// The type of the shuffle result.
EVT VT;
4050};
4051}

4053// Add an extra undefined element to the shuffle.
4054void GeneralShuffle::addUndef() {
unsigned BytesPerElement = VT.getVectorElementType().getStoreSize();
for (unsigned I = 0; I < BytesPerElement; ++I)
  Bytes.push_back(-1);
4058}

4060// Add an extra element to the shuffle, taking it from element Elem of Op.
4061// A null Op indicates a vector input whose value will be calculated later;
4062// there is at most one such input per shuffle and it always has the same
4063// type as the result. Aborts and returns false if the source vector elements
4064// of an EXTRACT_VECTOR_ELT are smaller than the destination elements. Per
4065// LLVM they become implicitly extended, but this is rare and not optimized.
4066bool GeneralShuffle::add(SDValue Op, unsigned Elem) {
unsigned BytesPerElement = VT.getVectorElementType().getStoreSize();

// The source vector can have wider elements than the result,
// either through an explicit TRUNCATE or because of type legalization.
// We want the least significant part.
EVT FromVT = Op.getNode() ? Op.getValueType() : VT;
unsigned FromBytesPerElement = FromVT.getVectorElementType().getStoreSize();

// Return false if the source elements are smaller than their destination
// elements.
if (FromBytesPerElement < BytesPerElement)
  return false;

unsigned Byte = ((Elem * FromBytesPerElement) % SystemZ::VectorBytes +
                 (FromBytesPerElement - BytesPerElement));

// Look through things like shuffles and bitcasts.
while (Op.getNode()) {
  if (Op.getOpcode() == ISD::BITCAST)
    Op = Op.getOperand(0);
  else if (Op.getOpcode() == ISD::VECTOR_SHUFFLE && Op.hasOneUse()) {
    // See whether the bytes we need come from a contiguous part of one
    // operand.
    SmallVector<int, SystemZ::VectorBytes> OpBytes;
    if (!getVPermMask(Op, OpBytes))
      break;
    int NewByte;
    if (!getShuffleInput(OpBytes, Byte, BytesPerElement, NewByte))
      break;
    if (NewByte < 0) {
      addUndef();
      return true;
    }
    Op = Op.getOperand(unsigned(NewByte) / SystemZ::VectorBytes);
    Byte = unsigned(NewByte) % SystemZ::VectorBytes;
  } else if (Op.isUndef()) {
    addUndef();
    return true;
  } else
    break;
}

// Make sure that the source of the extraction is in Ops.
unsigned OpNo = 0;
for (; OpNo < Ops.size(); ++OpNo)
  if (Ops[OpNo] == Op)
    break;
if (OpNo == Ops.size())
  Ops.push_back(Op);

// Add the element to Bytes.
unsigned Base = OpNo * SystemZ::VectorBytes + Byte;
for (unsigned I = 0; I < BytesPerElement; ++I)
  Bytes.push_back(Base + I);

return true;
4123}

4125// Return SDNodes for the completed shuffle.
4126SDValue GeneralShuffle::getNode(SelectionDAG &DAG, const SDLoc &DL) {
assert(Bytes.size() == SystemZ::VectorBytes && "Incomplete vector")((Bytes.size() == SystemZ::VectorBytes && "Incomplete vector"
) ? static_cast<void> (0) : __assert_fail ("Bytes.size() == SystemZ::VectorBytes && \"Incomplete vector\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4127, __PRETTY_FUNCTION__));

if (Ops.size() == 0)
  return DAG.getUNDEF(VT);

// Make sure that there are at least two shuffle operands.
if (Ops.size() == 1)
  Ops.push_back(DAG.getUNDEF(MVT::v16i8));

// Create a tree of shuffles, deferring root node until after the loop.
// Try to redistribute the undefined elements of non-root nodes so that
// the non-root shuffles match something like a pack or merge, then adjust
// the parent node's permute vector to compensate for the new order.
// Among other things, this copes with vectors like <2 x i16> that were
// padded with undefined elements during type legalization.
//
// In the best case this redistribution will lead to the whole tree
// using packs and merges.  It should rarely be a loss in other cases.
unsigned Stride = 1;
for (; Stride * 2 < Ops.size(); Stride *= 2) {
  for (unsigned I = 0; I < Ops.size() - Stride; I += Stride * 2) {
    SDValue SubOps[] = { Ops[I], Ops[I + Stride] };

    // Create a mask for just these two operands.
    SmallVector<int, SystemZ::VectorBytes> NewBytes(SystemZ::VectorBytes);
    for (unsigned J = 0; J < SystemZ::VectorBytes; ++J) {
      unsigned OpNo = unsigned(Bytes[J]) / SystemZ::VectorBytes;
      unsigned Byte = unsigned(Bytes[J]) % SystemZ::VectorBytes;
      if (OpNo == I)
        NewBytes[J] = Byte;
      else if (OpNo == I + Stride)
        NewBytes[J] = SystemZ::VectorBytes + Byte;
      else
        NewBytes[J] = -1;
    }
    // See if it would be better to reorganize NewMask to avoid using VPERM.
    SmallVector<int, SystemZ::VectorBytes> NewBytesMap(SystemZ::VectorBytes);
    if (const Permute *P = matchDoublePermute(NewBytes, NewBytesMap)) {
      Ops[I] = getPermuteNode(DAG, DL, *P, SubOps[0], SubOps[1]);
      // Applying NewBytesMap to Ops[I] gets back to NewBytes.
      for (unsigned J = 0; J < SystemZ::VectorBytes; ++J) {
        if (NewBytes[J] >= 0) {
          assert(unsigned(NewBytesMap[J]) < SystemZ::VectorBytes &&((unsigned(NewBytesMap[J]) < SystemZ::VectorBytes &&
 "Invalid double permute") ? static_cast<void> (0) : __assert_fail
 ("unsigned(NewBytesMap[J]) < SystemZ::VectorBytes && \"Invalid double permute\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4170, __PRETTY_FUNCTION__))
                 "Invalid double permute")((unsigned(NewBytesMap[J]) < SystemZ::VectorBytes &&
 "Invalid double permute") ? static_cast<void> (0) : __assert_fail
 ("unsigned(NewBytesMap[J]) < SystemZ::VectorBytes && \"Invalid double permute\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4170, __PRETTY_FUNCTION__));
          Bytes[J] = I * SystemZ::VectorBytes + NewBytesMap[J];
        } else
          assert(NewBytesMap[J] < 0 && "Invalid double permute")((NewBytesMap[J] < 0 && "Invalid double permute") ?
 static_cast<void> (0) : __assert_fail ("NewBytesMap[J] < 0 && \"Invalid double permute\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4173, __PRETTY_FUNCTION__));
      }
    } else {
      // Just use NewBytes on the operands.
      Ops[I] = getGeneralPermuteNode(DAG, DL, SubOps, NewBytes);
      for (unsigned J = 0; J < SystemZ::VectorBytes; ++J)
        if (NewBytes[J] >= 0)
          Bytes[J] = I * SystemZ::VectorBytes + J;
    }
  }
}

// Now we just have 2 inputs.  Put the second operand in Ops[1].
if (Stride > 1) {
  Ops[1] = Ops[Stride];
  for (unsigned I = 0; I < SystemZ::VectorBytes; ++I)
    if (Bytes[I] >= int(SystemZ::VectorBytes))
      Bytes[I] -= (Stride - 1) * SystemZ::VectorBytes;
}

// Look for an instruction that can do the permute without resorting
// to VPERM.
unsigned OpNo0, OpNo1;
SDValue Op;
if (const Permute *P = matchPermute(Bytes, OpNo0, OpNo1))
  Op = getPermuteNode(DAG, DL, *P, Ops[OpNo0], Ops[OpNo1]);
else
  Op = getGeneralPermuteNode(DAG, DL, &Ops[0], Bytes);
return DAG.getNode(ISD::BITCAST, DL, VT, Op);
4202}

4204// Return true if the given BUILD_VECTOR is a scalar-to-vector conversion.
4205static bool isScalarToVector(SDValue Op) {
for (unsigned I = 1, E = Op.getNumOperands(); I != E; ++I)
  if (!Op.getOperand(I).isUndef())
    return false;
return true;
4210}

4212// Return a vector of type VT that contains Value in the first element.
4213// The other elements don't matter.
4214static SDValue buildScalarToVector(SelectionDAG &DAG, const SDLoc &DL, EVT VT,
                                 SDValue Value) {
// If we have a constant, replicate it to all elements and let the
// BUILD_VECTOR lowering take care of it.
if (Value.getOpcode() == ISD::Constant ||
    Value.getOpcode() == ISD::ConstantFP) {
  SmallVector<SDValue, 16> Ops(VT.getVectorNumElements(), Value);
  return DAG.getBuildVector(VT, DL, Ops);
}
if (Value.isUndef())
  return DAG.getUNDEF(VT);
return DAG.getNode(ISD::SCALAR_TO_VECTOR, DL, VT, Value);
4226}

4228// Return a vector of type VT in which Op0 is in element 0 and Op1 is in
4229// element 1.  Used for cases in which replication is cheap.
4230static SDValue buildMergeScalars(SelectionDAG &DAG, const SDLoc &DL, EVT VT,
                               SDValue Op0, SDValue Op1) {
if (Op0.isUndef()) {
  if (Op1.isUndef())
    return DAG.getUNDEF(VT);
  return DAG.getNode(SystemZISD::REPLICATE, DL, VT, Op1);
}
if (Op1.isUndef())
  return DAG.getNode(SystemZISD::REPLICATE, DL, VT, Op0);
return DAG.getNode(SystemZISD::MERGE_HIGH, DL, VT,
                   buildScalarToVector(DAG, DL, VT, Op0),
                   buildScalarToVector(DAG, DL, VT, Op1));
4242}

4244// Extend GPR scalars Op0 and Op1 to doublewords and return a v2i64
4245// vector for them.
4246static SDValue joinDwords(SelectionDAG &DAG, const SDLoc &DL, SDValue Op0,
                        SDValue Op1) {
if (Op0.isUndef() && Op1.isUndef())
  return DAG.getUNDEF(MVT::v2i64);
// If one of the two inputs is undefined then replicate the other one,
// in order to avoid using another register unnecessarily.
if (Op0.isUndef())
  Op0 = Op1 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, Op1);
else if (Op1.isUndef())
  Op0 = Op1 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, Op0);
else {
  Op0 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, Op0);
  Op1 = DAG.getNode(ISD::ANY_EXTEND, DL, MVT::i64, Op1);
}
return DAG.getNode(SystemZISD::JOIN_DWORDS, DL, MVT::v2i64, Op0, Op1);
4261}

4263// Try to represent constant BUILD_VECTOR node BVN using a
4264// SystemZISD::BYTE_MASK-style mask.  Store the mask value in Mask
4265// on success.
4266static bool tryBuildVectorByteMask(BuildVectorSDNode *BVN, uint64_t &Mask) {
EVT ElemVT = BVN->getValueType(0).getVectorElementType();
unsigned BytesPerElement = ElemVT.getStoreSize();
for (unsigned I = 0, E = BVN->getNumOperands(); I != E; ++I) {
  SDValue Op = BVN->getOperand(I);
  if (!Op.isUndef()) {
    uint64_t Value;
    if (Op.getOpcode() == ISD::Constant)
      Value = cast<ConstantSDNode>(Op)->getZExtValue();
    else if (Op.getOpcode() == ISD::ConstantFP)
      Value = (cast<ConstantFPSDNode>(Op)->getValueAPF().bitcastToAPInt()
               .getZExtValue());
    else
      return false;
    for (unsigned J = 0; J < BytesPerElement; ++J) {
      uint64_t Byte = (Value >> (J * 8)) & 0xff;
      if (Byte == 0xff)
        Mask |= 1ULL << ((E - I - 1) * BytesPerElement + J);
      else if (Byte != 0)
        return false;
    }
  }
}
return true;
4290}

4292// Try to load a vector constant in which BitsPerElement-bit value Value
4293// is replicated to fill the vector.  VT is the type of the resulting
4294// constant, which may have elements of a different size from BitsPerElement.
4295// Return the SDValue of the constant on success, otherwise return
4296// an empty value.
4297static SDValue tryBuildVectorReplicate(SelectionDAG &DAG,
                                     const SystemZInstrInfo *TII,
                                     const SDLoc &DL, EVT VT, uint64_t Value,
                                     unsigned BitsPerElement) {
// Signed 16-bit values can be replicated using VREPI.
// Mark the constants as opaque or DAGCombiner will convert back to
// BUILD_VECTOR.
int64_t SignedValue = SignExtend64(Value, BitsPerElement);
if (isInt<16>(SignedValue)) {
  MVT VecVT = MVT::getVectorVT(MVT::getIntegerVT(BitsPerElement),
                               SystemZ::VectorBits / BitsPerElement);
  SDValue Op = DAG.getNode(
      SystemZISD::REPLICATE, DL, VecVT,
      DAG.getConstant(SignedValue, DL, MVT::i32, false, true /*isOpaque*/));
  return DAG.getNode(ISD::BITCAST, DL, VT, Op);
}
// See whether rotating the constant left some N places gives a value that
// is one less than a power of 2 (i.e. all zeros followed by all ones).
// If so we can use VGM.
unsigned Start, End;
if (TII->isRxSBGMask(Value, BitsPerElement, Start, End)) {
  // isRxSBGMask returns the bit numbers for a full 64-bit value,
  // with 0 denoting 1 << 63 and 63 denoting 1.  Convert them to
  // bit numbers for an BitsPerElement value, so that 0 denotes
  // 1 << (BitsPerElement-1).
  Start -= 64 - BitsPerElement;
  End -= 64 - BitsPerElement;
  MVT VecVT = MVT::getVectorVT(MVT::getIntegerVT(BitsPerElement),
                               SystemZ::VectorBits / BitsPerElement);
  SDValue Op = DAG.getNode(
      SystemZISD::ROTATE_MASK, DL, VecVT,
      DAG.getConstant(Start, DL, MVT::i32, false, true /*isOpaque*/),
      DAG.getConstant(End, DL, MVT::i32, false, true /*isOpaque*/));
  return DAG.getNode(ISD::BITCAST, DL, VT, Op);
}
return SDValue();
4333}

4335// If a BUILD_VECTOR contains some EXTRACT_VECTOR_ELTs, it's usually
4336// better to use VECTOR_SHUFFLEs on them, only using BUILD_VECTOR for
4337// the non-EXTRACT_VECTOR_ELT elements.  See if the given BUILD_VECTOR
4338// would benefit from this representation and return it if so.
4339static SDValue tryBuildVectorShuffle(SelectionDAG &DAG,
                                   BuildVectorSDNode *BVN) {
EVT VT = BVN->getValueType(0);
unsigned NumElements = VT.getVectorNumElements();

// Represent the BUILD_VECTOR as an N-operand VECTOR_SHUFFLE-like operation
// on byte vectors.  If there are non-EXTRACT_VECTOR_ELT elements that still
// need a BUILD_VECTOR, add an additional placeholder operand for that
// BUILD_VECTOR and store its operands in ResidueOps.
GeneralShuffle GS(VT);
SmallVector<SDValue, SystemZ::VectorBytes> ResidueOps;
bool FoundOne = false;
for (unsigned I = 0; I < NumElements; ++I) {
  SDValue Op = BVN->getOperand(I);
  if (Op.getOpcode() == ISD::TRUNCATE)
    Op = Op.getOperand(0);
  if (Op.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
      Op.getOperand(1).getOpcode() == ISD::Constant) {
    unsigned Elem = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
    if (!GS.add(Op.getOperand(0), Elem))
      return SDValue();
    FoundOne = true;
  } else if (Op.isUndef()) {
    GS.addUndef();
  } else {
    if (!GS.add(SDValue(), ResidueOps.size()))
      return SDValue();
    ResidueOps.push_back(BVN->getOperand(I));
  }
}

// Nothing to do if there are no EXTRACT_VECTOR_ELTs.
if (!FoundOne)
  return SDValue();

// Create the BUILD_VECTOR for the remaining elements, if any.
if (!ResidueOps.empty()) {
  while (ResidueOps.size() < NumElements)
    ResidueOps.push_back(DAG.getUNDEF(ResidueOps[0].getValueType()));
  for (auto &Op : GS.Ops) {
    if (!Op.getNode()) {
      Op = DAG.getBuildVector(VT, SDLoc(BVN), ResidueOps);
      break;
    }
  }
}
return GS.getNode(DAG, SDLoc(BVN));
4386}

4388// Combine GPR scalar values Elems into a vector of type VT.
4389static SDValue buildVector(SelectionDAG &DAG, const SDLoc &DL, EVT VT,
                         SmallVectorImpl<SDValue> &Elems) {
// See whether there is a single replicated value.
SDValue Single;
unsigned int NumElements = Elems.size();
unsigned int Count = 0;
for (auto Elem : Elems) {
  if (!Elem.isUndef()) {
    if (!Single.getNode())
      Single = Elem;
    else if (Elem != Single) {
      Single = SDValue();
      break;
    }
    Count += 1;
  }
}
// There are three cases here:
//
// - if the only defined element is a loaded one, the best sequence
//   is a replicating load.
//
// - otherwise, if the only defined element is an i64 value, we will
//   end up with the same VLVGP sequence regardless of whether we short-cut
//   for replication or fall through to the later code.
//
// - otherwise, if the only defined element is an i32 or smaller value,
//   we would need 2 instructions to replicate it: VLVGP followed by VREPx.
//   This is only a win if the single defined element is used more than once.
//   In other cases we're better off using a single VLVGx.
if (Single.getNode() && (Count > 1 || Single.getOpcode() == ISD::LOAD))
  return DAG.getNode(SystemZISD::REPLICATE, DL, VT, Single);

// If all elements are loads, use VLREP/VLEs (below).
bool AllLoads = true;
for (auto Elem : Elems)
  if (Elem.getOpcode() != ISD::LOAD || cast<LoadSDNode>(Elem)->isIndexed()) {
    AllLoads = false;
    break;
  }

// The best way of building a v2i64 from two i64s is to use VLVGP.
if (VT == MVT::v2i64 && !AllLoads)
  return joinDwords(DAG, DL, Elems[0], Elems[1]);

// Use a 64-bit merge high to combine two doubles.
if (VT == MVT::v2f64 && !AllLoads)
  return buildMergeScalars(DAG, DL, VT, Elems[0], Elems[1]);

// Build v4f32 values directly from the FPRs:
//
//   <Axxx> <Bxxx> <Cxxxx> <Dxxx>
//         V              V         VMRHF
//      <ABxx>         <CDxx>
//                V                 VMRHG
//              <ABCD>
if (VT == MVT::v4f32 && !AllLoads) {
  SDValue Op01 = buildMergeScalars(DAG, DL, VT, Elems[0], Elems[1]);
  SDValue Op23 = buildMergeScalars(DAG, DL, VT, Elems[2], Elems[3]);
  // Avoid unnecessary undefs by reusing the other operand.
  if (Op01.isUndef())
    Op01 = Op23;
  else if (Op23.isUndef())
    Op23 = Op01;
  // Merging identical replications is a no-op.
  if (Op01.getOpcode() == SystemZISD::REPLICATE && Op01 == Op23)
    return Op01;
  Op01 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, Op01);
  Op23 = DAG.getNode(ISD::BITCAST, DL, MVT::v2i64, Op23);
  SDValue Op = DAG.getNode(SystemZISD::MERGE_HIGH,
                           DL, MVT::v2i64, Op01, Op23);
  return DAG.getNode(ISD::BITCAST, DL, VT, Op);
}

// Collect the constant terms.
SmallVector<SDValue, SystemZ::VectorBytes> Constants(NumElements, SDValue());
SmallVector<bool, SystemZ::VectorBytes> Done(NumElements, false);

unsigned NumConstants = 0;
for (unsigned I = 0; I < NumElements; ++I) {
  SDValue Elem = Elems[I];
  if (Elem.getOpcode() == ISD::Constant ||
      Elem.getOpcode() == ISD::ConstantFP) {
    NumConstants += 1;
    Constants[I] = Elem;
    Done[I] = true;
  }
}
// If there was at least one constant, fill in the other elements of
// Constants with undefs to get a full vector constant and use that
// as the starting point.
SDValue Result;
SDValue ReplicatedVal;
if (NumConstants > 0) {
  for (unsigned I = 0; I < NumElements; ++I)
    if (!Constants[I].getNode())
      Constants[I] = DAG.getUNDEF(Elems[I].getValueType());
  Result = DAG.getBuildVector(VT, DL, Constants);
} else {
  // Otherwise try to use VLREP or VLVGP to start the sequence in order to
  // avoid a false dependency on any previous contents of the vector
  // register.

  // Use a VLREP if at least one element is a load. Make sure to replicate
  // the load with the most elements having its value.
  std::map<const SDNode*, unsigned> UseCounts;
  SDNode *LoadMaxUses = nullptr;
  for (unsigned I = 0; I < NumElements; ++I)
    if (Elems[I].getOpcode() == ISD::LOAD &&
        cast<LoadSDNode>(Elems[I])->isUnindexed()) {
      SDNode *Ld = Elems[I].getNode();
      UseCounts[Ld]++;
      if (LoadMaxUses == nullptr || UseCounts[LoadMaxUses] < UseCounts[Ld])
        LoadMaxUses = Ld;
    }
  if (LoadMaxUses != nullptr) {
    ReplicatedVal = SDValue(LoadMaxUses, 0);
    Result = DAG.getNode(SystemZISD::REPLICATE, DL, VT, ReplicatedVal);
  } else {
    // Try to use VLVGP.
    unsigned I1 = NumElements / 2 - 1;
    unsigned I2 = NumElements - 1;
    bool Def1 = !Elems[I1].isUndef();
    bool Def2 = !Elems[I2].isUndef();
    if (Def1 || Def2) {
      SDValue Elem1 = Elems[Def1 ? I1 : I2];
      SDValue Elem2 = Elems[Def2 ? I2 : I1];
      Result = DAG.getNode(ISD::BITCAST, DL, VT,
                           joinDwords(DAG, DL, Elem1, Elem2));
      Done[I1] = true;
      Done[I2] = true;
    } else
      Result = DAG.getUNDEF(VT);
  }
}

// Use VLVGx to insert the other elements.
for (unsigned I = 0; I < NumElements; ++I)
  if (!Done[I] && !Elems[I].isUndef() && Elems[I] != ReplicatedVal)
    Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT, Result, Elems[I],
                         DAG.getConstant(I, DL, MVT::i32));
return Result;
4531}

4533SDValue SystemZTargetLowering::lowerBUILD_VECTOR(SDValue Op,
                                               SelectionDAG &DAG) const {
const SystemZInstrInfo *TII =
  static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
auto *BVN = cast<BuildVectorSDNode>(Op.getNode());
SDLoc DL(Op);
EVT VT = Op.getValueType();

if (BVN->isConstant()) {
3
←
Assuming the condition is true→
4
←
Taking true branch→
  // Try using VECTOR GENERATE BYTE MASK.  This is the architecturally-
  // preferred way of creating all-zero and all-one vectors so give it
  // priority over other methods below.
  uint64_t Mask = 0;
  if (tryBuildVectorByteMask(BVN, Mask)) {
5
←
Taking false branch→
    SDValue Op = DAG.getNode(
        SystemZISD::BYTE_MASK, DL, MVT::v16i8,
        DAG.getConstant(Mask, DL, MVT::i32, false, true /*isOpaque*/));
    return DAG.getNode(ISD::BITCAST, DL, VT, Op);
  }

  // Try using some form of replication.
  APInt SplatBits, SplatUndef;
  unsigned SplatBitSize;
  bool HasAnyUndefs;
  if (BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize, HasAnyUndefs,
6
←
Assuming the condition is true→
8
←
Taking true branch→
                           8, true) &&
      SplatBitSize <= 64) {
7
←
Assuming 'SplatBitSize' is <= 64→
    // First try assuming that any undefined bits above the highest set bit
    // and below the lowest set bit are 1s.  This increases the likelihood of
    // being able to use a sign-extended element value in VECTOR REPLICATE
    // IMMEDIATE or a wraparound mask in VECTOR GENERATE MASK.
    uint64_t SplatBitsZ = SplatBits.getZExtValue();
    uint64_t SplatUndefZ = SplatUndef.getZExtValue();
    uint64_t Lower = (SplatUndefZ
                      & ((uint64_t(1) << findFirstSet(SplatBitsZ)) - 1));
9
←
Calling 'findFirstSet<unsigned long>'→
16
←
Returning from 'findFirstSet<unsigned long>'→
17
←
The result of the left shift is undefined due to shifting by '18446744073709551615', which is greater or equal to the width of type 'uint64_t'
    uint64_t Upper = (SplatUndefZ
                      & ~((uint64_t(1) << findLastSet(SplatBitsZ)) - 1));
    uint64_t Value = SplatBitsZ | Upper | Lower;
    SDValue Op = tryBuildVectorReplicate(DAG, TII, DL, VT, Value,
                                         SplatBitSize);
    if (Op.getNode())
      return Op;

    // Now try assuming that any undefined bits between the first and
    // last defined set bits are set.  This increases the chances of
    // using a non-wraparound mask.
    uint64_t Middle = SplatUndefZ & ~Upper & ~Lower;
    Value = SplatBitsZ | Middle;
    Op = tryBuildVectorReplicate(DAG, TII, DL, VT, Value, SplatBitSize);
    if (Op.getNode())
      return Op;
  }

  // Fall back to loading it from memory.
  return SDValue();
}

// See if we should use shuffles to construct the vector from other vectors.
if (SDValue Res = tryBuildVectorShuffle(DAG, BVN))
  return Res;

// Detect SCALAR_TO_VECTOR conversions.
if (isOperationLegal(ISD::SCALAR_TO_VECTOR, VT) && isScalarToVector(Op))
  return buildScalarToVector(DAG, DL, VT, Op.getOperand(0));

// Otherwise use buildVector to build the vector up from GPRs.
unsigned NumElements = Op.getNumOperands();
SmallVector<SDValue, SystemZ::VectorBytes> Ops(NumElements);
for (unsigned I = 0; I < NumElements; ++I)
  Ops[I] = Op.getOperand(I);
return buildVector(DAG, DL, VT, Ops);
4604}

4606SDValue SystemZTargetLowering::lowerVECTOR_SHUFFLE(SDValue Op,
                                                 SelectionDAG &DAG) const {
auto *VSN = cast<ShuffleVectorSDNode>(Op.getNode());
SDLoc DL(Op);
EVT VT = Op.getValueType();
unsigned NumElements = VT.getVectorNumElements();

if (VSN->isSplat()) {
  SDValue Op0 = Op.getOperand(0);
  unsigned Index = VSN->getSplatIndex();
  assert(Index < VT.getVectorNumElements() &&((Index < VT.getVectorNumElements() && "Splat index should be defined and in first operand"
) ? static_cast<void> (0) : __assert_fail ("Index < VT.getVectorNumElements() && \"Splat index should be defined and in first operand\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4617, __PRETTY_FUNCTION__))
         "Splat index should be defined and in first operand")((Index < VT.getVectorNumElements() && "Splat index should be defined and in first operand"
) ? static_cast<void> (0) : __assert_fail ("Index < VT.getVectorNumElements() && \"Splat index should be defined and in first operand\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4617, __PRETTY_FUNCTION__));
  // See whether the value we're splatting is directly available as a scalar.
  if ((Index == 0 && Op0.getOpcode() == ISD::SCALAR_TO_VECTOR) ||
      Op0.getOpcode() == ISD::BUILD_VECTOR)
    return DAG.getNode(SystemZISD::REPLICATE, DL, VT, Op0.getOperand(Index));
  // Otherwise keep it as a vector-to-vector operation.
  return DAG.getNode(SystemZISD::SPLAT, DL, VT, Op.getOperand(0),
                     DAG.getConstant(Index, DL, MVT::i32));
}

GeneralShuffle GS(VT);
for (unsigned I = 0; I < NumElements; ++I) {
  int Elt = VSN->getMaskElt(I);
  if (Elt < 0)
    GS.addUndef();
  else if (!GS.add(Op.getOperand(unsigned(Elt) / NumElements),
                   unsigned(Elt) % NumElements))
    return SDValue();
}
return GS.getNode(DAG, SDLoc(VSN));
4637}

4639SDValue SystemZTargetLowering::lowerSCALAR_TO_VECTOR(SDValue Op,
                                                   SelectionDAG &DAG) const {
SDLoc DL(Op);
// Just insert the scalar into element 0 of an undefined vector.
return DAG.getNode(ISD::INSERT_VECTOR_ELT, DL,
                   Op.getValueType(), DAG.getUNDEF(Op.getValueType()),
                   Op.getOperand(0), DAG.getConstant(0, DL, MVT::i32));
4646}

4648SDValue SystemZTargetLowering::lowerINSERT_VECTOR_ELT(SDValue Op,
                                                    SelectionDAG &DAG) const {
// Handle insertions of floating-point values.
SDLoc DL(Op);
SDValue Op0 = Op.getOperand(0);
SDValue Op1 = Op.getOperand(1);
SDValue Op2 = Op.getOperand(2);
EVT VT = Op.getValueType();

// Insertions into constant indices of a v2f64 can be done using VPDI.
// However, if the inserted value is a bitcast or a constant then it's
// better to use GPRs, as below.
if (VT == MVT::v2f64 &&
    Op1.getOpcode() != ISD::BITCAST &&
    Op1.getOpcode() != ISD::ConstantFP &&
    Op2.getOpcode() == ISD::Constant) {
  uint64_t Index = cast<ConstantSDNode>(Op2)->getZExtValue();
  unsigned Mask = VT.getVectorNumElements() - 1;
  if (Index <= Mask)
    return Op;
}

// Otherwise bitcast to the equivalent integer form and insert via a GPR.
MVT IntVT = MVT::getIntegerVT(VT.getScalarSizeInBits());
MVT IntVecVT = MVT::getVectorVT(IntVT, VT.getVectorNumElements());
SDValue Res = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, IntVecVT,
                          DAG.getNode(ISD::BITCAST, DL, IntVecVT, Op0),
                          DAG.getNode(ISD::BITCAST, DL, IntVT, Op1), Op2);
return DAG.getNode(ISD::BITCAST, DL, VT, Res);
4677}

4679SDValue
4680SystemZTargetLowering::lowerEXTRACT_VECTOR_ELT(SDValue Op,
                                             SelectionDAG &DAG) const {
// Handle extractions of floating-point values.
SDLoc DL(Op);
SDValue Op0 = Op.getOperand(0);
SDValue Op1 = Op.getOperand(1);
EVT VT = Op.getValueType();
EVT VecVT = Op0.getValueType();

// Extractions of constant indices can be done directly.
if (auto *CIndexN = dyn_cast<ConstantSDNode>(Op1)) {
  uint64_t Index = CIndexN->getZExtValue();
  unsigned Mask = VecVT.getVectorNumElements() - 1;
  if (Index <= Mask)
    return Op;
}

// Otherwise bitcast to the equivalent integer form and extract via a GPR.
MVT IntVT = MVT::getIntegerVT(VT.getSizeInBits());
MVT IntVecVT = MVT::getVectorVT(IntVT, VecVT.getVectorNumElements());
SDValue Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, IntVT,
                          DAG.getNode(ISD::BITCAST, DL, IntVecVT, Op0), Op1);
return DAG.getNode(ISD::BITCAST, DL, VT, Res);
4703}

4705SDValue
4706SystemZTargetLowering::lowerExtendVectorInreg(SDValue Op, SelectionDAG &DAG,
                                            unsigned UnpackHigh) const {
SDValue PackedOp = Op.getOperand(0);
EVT OutVT = Op.getValueType();
EVT InVT = PackedOp.getValueType();
unsigned ToBits = OutVT.getScalarSizeInBits();
unsigned FromBits = InVT.getScalarSizeInBits();
do {
  FromBits *= 2;
  EVT OutVT = MVT::getVectorVT(MVT::getIntegerVT(FromBits),
                               SystemZ::VectorBits / FromBits);
  PackedOp = DAG.getNode(UnpackHigh, SDLoc(PackedOp), OutVT, PackedOp);
} while (FromBits != ToBits);
return PackedOp;
4720}

4722SDValue SystemZTargetLowering::lowerShift(SDValue Op, SelectionDAG &DAG,
                                        unsigned ByScalar) const {
// Look for cases where a vector shift can use the *_BY_SCALAR form.
SDValue Op0 = Op.getOperand(0);
SDValue Op1 = Op.getOperand(1);
SDLoc DL(Op);
EVT VT = Op.getValueType();
unsigned ElemBitSize = VT.getScalarSizeInBits();

// See whether the shift vector is a splat represented as BUILD_VECTOR.
if (auto *BVN = dyn_cast<BuildVectorSDNode>(Op1)) {
  APInt SplatBits, SplatUndef;
  unsigned SplatBitSize;
  bool HasAnyUndefs;
  // Check for constant splats.  Use ElemBitSize as the minimum element
  // width and reject splats that need wider elements.
  if (BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize, HasAnyUndefs,
                           ElemBitSize, true) &&
      SplatBitSize == ElemBitSize) {
    SDValue Shift = DAG.getConstant(SplatBits.getZExtValue() & 0xfff,
                                    DL, MVT::i32);
    return DAG.getNode(ByScalar, DL, VT, Op0, Shift);
  }
  // Check for variable splats.
  BitVector UndefElements;
  SDValue Splat = BVN->getSplatValue(&UndefElements);
  if (Splat) {
    // Since i32 is the smallest legal type, we either need a no-op
    // or a truncation.
    SDValue Shift = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32, Splat);
    return DAG.getNode(ByScalar, DL, VT, Op0, Shift);
  }
}

// See whether the shift vector is a splat represented as SHUFFLE_VECTOR,
// and the shift amount is directly available in a GPR.
if (auto *VSN = dyn_cast<ShuffleVectorSDNode>(Op1)) {
  if (VSN->isSplat()) {
    SDValue VSNOp0 = VSN->getOperand(0);
    unsigned Index = VSN->getSplatIndex();
    assert(Index < VT.getVectorNumElements() &&((Index < VT.getVectorNumElements() && "Splat index should be defined and in first operand"
) ? static_cast<void> (0) : __assert_fail ("Index < VT.getVectorNumElements() && \"Splat index should be defined and in first operand\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4763, __PRETTY_FUNCTION__))
           "Splat index should be defined and in first operand")((Index < VT.getVectorNumElements() && "Splat index should be defined and in first operand"
) ? static_cast<void> (0) : __assert_fail ("Index < VT.getVectorNumElements() && \"Splat index should be defined and in first operand\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4763, __PRETTY_FUNCTION__));
    if ((Index == 0 && VSNOp0.getOpcode() == ISD::SCALAR_TO_VECTOR) ||
        VSNOp0.getOpcode() == ISD::BUILD_VECTOR) {
      // Since i32 is the smallest legal type, we either need a no-op
      // or a truncation.
      SDValue Shift = DAG.getNode(ISD::TRUNCATE, DL, MVT::i32,
                                  VSNOp0.getOperand(Index));
      return DAG.getNode(ByScalar, DL, VT, Op0, Shift);
    }
  }
}

// Otherwise just treat the current form as legal.
return Op;
4777}

4779SDValue SystemZTargetLowering::LowerOperation(SDValue Op,
                                            SelectionDAG &DAG) const {
switch (Op.getOpcode()) {
1
Control jumps to 'case BUILD_VECTOR:'  at line 4872→
case ISD::FRAMEADDR:
  return lowerFRAMEADDR(Op, DAG);
case ISD::RETURNADDR:
  return lowerRETURNADDR(Op, DAG);
case ISD::BR_CC:
  return lowerBR_CC(Op, DAG);
case ISD::SELECT_CC:
  return lowerSELECT_CC(Op, DAG);
case ISD::SETCC:
  return lowerSETCC(Op, DAG);
case ISD::GlobalAddress:
  return lowerGlobalAddress(cast<GlobalAddressSDNode>(Op), DAG);
case ISD::GlobalTLSAddress:
  return lowerGlobalTLSAddress(cast<GlobalAddressSDNode>(Op), DAG);
case ISD::BlockAddress:
  return lowerBlockAddress(cast<BlockAddressSDNode>(Op), DAG);
case ISD::JumpTable:
  return lowerJumpTable(cast<JumpTableSDNode>(Op), DAG);
case ISD::ConstantPool:
  return lowerConstantPool(cast<ConstantPoolSDNode>(Op), DAG);
case ISD::BITCAST:
  return lowerBITCAST(Op, DAG);
case ISD::VASTART:
  return lowerVASTART(Op, DAG);
case ISD::VACOPY:
  return lowerVACOPY(Op, DAG);
case ISD::DYNAMIC_STACKALLOC:
  return lowerDYNAMIC_STACKALLOC(Op, DAG);
case ISD::GET_DYNAMIC_AREA_OFFSET:
  return lowerGET_DYNAMIC_AREA_OFFSET(Op, DAG);
case ISD::SMUL_LOHI:
  return lowerSMUL_LOHI(Op, DAG);
case ISD::UMUL_LOHI:
  return lowerUMUL_LOHI(Op, DAG);
case ISD::SDIVREM:
  return lowerSDIVREM(Op, DAG);
case ISD::UDIVREM:
  return lowerUDIVREM(Op, DAG);
case ISD::SADDO:
case ISD::SSUBO:
case ISD::UADDO:
case ISD::USUBO:
  return lowerXALUO(Op, DAG);
case ISD::ADDCARRY:
case ISD::SUBCARRY:
  return lowerADDSUBCARRY(Op, DAG);
case ISD::OR:
  return lowerOR(Op, DAG);
case ISD::CTPOP:
  return lowerCTPOP(Op, DAG);
case ISD::ATOMIC_FENCE:
  return lowerATOMIC_FENCE(Op, DAG);
case ISD::ATOMIC_SWAP:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_SWAPW);
case ISD::ATOMIC_STORE:
  return lowerATOMIC_STORE(Op, DAG);
case ISD::ATOMIC_LOAD:
  return lowerATOMIC_LOAD(Op, DAG);
case ISD::ATOMIC_LOAD_ADD:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_ADD);
case ISD::ATOMIC_LOAD_SUB:
  return lowerATOMIC_LOAD_SUB(Op, DAG);
case ISD::ATOMIC_LOAD_AND:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_AND);
case ISD::ATOMIC_LOAD_OR:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_OR);
case ISD::ATOMIC_LOAD_XOR:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_XOR);
case ISD::ATOMIC_LOAD_NAND:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_NAND);
case ISD::ATOMIC_LOAD_MIN:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_MIN);
case ISD::ATOMIC_LOAD_MAX:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_MAX);
case ISD::ATOMIC_LOAD_UMIN:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_UMIN);
case ISD::ATOMIC_LOAD_UMAX:
  return lowerATOMIC_LOAD_OP(Op, DAG, SystemZISD::ATOMIC_LOADW_UMAX);
case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS:
  return lowerATOMIC_CMP_SWAP(Op, DAG);
case ISD::STACKSAVE:
  return lowerSTACKSAVE(Op, DAG);
case ISD::STACKRESTORE:
  return lowerSTACKRESTORE(Op, DAG);
case ISD::PREFETCH:
  return lowerPREFETCH(Op, DAG);
case ISD::INTRINSIC_W_CHAIN:
  return lowerINTRINSIC_W_CHAIN(Op, DAG);
case ISD::INTRINSIC_WO_CHAIN:
  return lowerINTRINSIC_WO_CHAIN(Op, DAG);
case ISD::BUILD_VECTOR:
  return lowerBUILD_VECTOR(Op, DAG);
2
←
Calling 'SystemZTargetLowering::lowerBUILD_VECTOR'→
case ISD::VECTOR_SHUFFLE:
  return lowerVECTOR_SHUFFLE(Op, DAG);
case ISD::SCALAR_TO_VECTOR:
  return lowerSCALAR_TO_VECTOR(Op, DAG);
case ISD::INSERT_VECTOR_ELT:
  return lowerINSERT_VECTOR_ELT(Op, DAG);
case ISD::EXTRACT_VECTOR_ELT:
  return lowerEXTRACT_VECTOR_ELT(Op, DAG);
case ISD::SIGN_EXTEND_VECTOR_INREG:
  return lowerExtendVectorInreg(Op, DAG, SystemZISD::UNPACK_HIGH);
case ISD::ZERO_EXTEND_VECTOR_INREG:
  return lowerExtendVectorInreg(Op, DAG, SystemZISD::UNPACKL_HIGH);
case ISD::SHL:
  return lowerShift(Op, DAG, SystemZISD::VSHL_BY_SCALAR);
case ISD::SRL:
  return lowerShift(Op, DAG, SystemZISD::VSRL_BY_SCALAR);
case ISD::SRA:
  return lowerShift(Op, DAG, SystemZISD::VSRA_BY_SCALAR);
default:
  llvm_unreachable("Unexpected node to lower")::llvm::llvm_unreachable_internal("Unexpected node to lower",
 "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4893);
}
4895}

4897// Lower operations with invalid operand or result types (currently used
4898// only for 128-bit integer types).

4900static SDValue lowerI128ToGR128(SelectionDAG &DAG, SDValue In) {
SDLoc DL(In);
SDValue Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i64, In,
                         DAG.getIntPtrConstant(0, DL));
SDValue Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, DL, MVT::i64, In,
                         DAG.getIntPtrConstant(1, DL));
SDNode *Pair = DAG.getMachineNode(SystemZ::PAIR128, DL,
                                  MVT::Untyped, Hi, Lo);
return SDValue(Pair, 0);
4909}

4911static SDValue lowerGR128ToI128(SelectionDAG &DAG, SDValue In) {
SDLoc DL(In);
SDValue Hi = DAG.getTargetExtractSubreg(SystemZ::subreg_h64,
                                        DL, MVT::i64, In);
SDValue Lo = DAG.getTargetExtractSubreg(SystemZ::subreg_l64,
                                        DL, MVT::i64, In);
return DAG.getNode(ISD::BUILD_PAIR, DL, MVT::i128, Lo, Hi);
4918}

4920void
4921SystemZTargetLowering::LowerOperationWrapper(SDNode *N,
                                           SmallVectorImpl<SDValue> &Results,
                                           SelectionDAG &DAG) const {
switch (N->getOpcode()) {
case ISD::ATOMIC_LOAD: {
  SDLoc DL(N);
  SDVTList Tys = DAG.getVTList(MVT::Untyped, MVT::Other);
  SDValue Ops[] = { N->getOperand(0), N->getOperand(1) };
  MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
  SDValue Res = DAG.getMemIntrinsicNode(SystemZISD::ATOMIC_LOAD_128,
                                        DL, Tys, Ops, MVT::i128, MMO);
  Results.push_back(lowerGR128ToI128(DAG, Res));
  Results.push_back(Res.getValue(1));
  break;
}
case ISD::ATOMIC_STORE: {
  SDLoc DL(N);
  SDVTList Tys = DAG.getVTList(MVT::Other);
  SDValue Ops[] = { N->getOperand(0),
                    lowerI128ToGR128(DAG, N->getOperand(2)),
                    N->getOperand(1) };
  MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
  SDValue Res = DAG.getMemIntrinsicNode(SystemZISD::ATOMIC_STORE_128,
                                        DL, Tys, Ops, MVT::i128, MMO);
  // We have to enforce sequential consistency by performing a
  // serialization operation after the store.
  if (cast<AtomicSDNode>(N)->getOrdering() ==
      AtomicOrdering::SequentiallyConsistent)
    Res = SDValue(DAG.getMachineNode(SystemZ::Serialize, DL,
                                     MVT::Other, Res), 0);
  Results.push_back(Res);
  break;
}
case ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS: {
  SDLoc DL(N);
  SDVTList Tys = DAG.getVTList(MVT::Untyped, MVT::i32, MVT::Other);
  SDValue Ops[] = { N->getOperand(0), N->getOperand(1),
                    lowerI128ToGR128(DAG, N->getOperand(2)),
                    lowerI128ToGR128(DAG, N->getOperand(3)) };
  MachineMemOperand *MMO = cast<AtomicSDNode>(N)->getMemOperand();
  SDValue Res = DAG.getMemIntrinsicNode(SystemZISD::ATOMIC_CMP_SWAP_128,
                                        DL, Tys, Ops, MVT::i128, MMO);
  SDValue Success = emitSETCC(DAG, DL, Res.getValue(1),
                              SystemZ::CCMASK_CS, SystemZ::CCMASK_CS_EQ);
  Success = DAG.getZExtOrTrunc(Success, DL, N->getValueType(1));
  Results.push_back(lowerGR128ToI128(DAG, Res));
  Results.push_back(Success);
  Results.push_back(Res.getValue(2));
  break;
}
default:
  llvm_unreachable("Unexpected node to lower")::llvm::llvm_unreachable_internal("Unexpected node to lower",
 "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 4972);
}
4974}

4976void
4977SystemZTargetLowering::ReplaceNodeResults(SDNode *N,
                                        SmallVectorImpl<SDValue> &Results,
                                        SelectionDAG &DAG) const {
return LowerOperationWrapper(N, Results, DAG);
4981}

4983const char *SystemZTargetLowering::getTargetNodeName(unsigned Opcode) const {
4984#define OPCODE(NAME) case SystemZISD::NAME: return "SystemZISD::" #NAME
switch ((SystemZISD::NodeType)Opcode) {
  case SystemZISD::FIRST_NUMBER: break;
  OPCODE(RET_FLAG);
  OPCODE(CALL);
  OPCODE(SIBCALL);
  OPCODE(TLS_GDCALL);
  OPCODE(TLS_LDCALL);
  OPCODE(PCREL_WRAPPER);
  OPCODE(PCREL_OFFSET);
  OPCODE(IABS);
  OPCODE(ICMP);
  OPCODE(FCMP);
  OPCODE(TM);
  OPCODE(BR_CCMASK);
  OPCODE(SELECT_CCMASK);
  OPCODE(ADJDYNALLOC);
  OPCODE(POPCNT);
  OPCODE(SMUL_LOHI);
  OPCODE(UMUL_LOHI);
  OPCODE(SDIVREM);
  OPCODE(UDIVREM);
  OPCODE(SADDO);
  OPCODE(SSUBO);
  OPCODE(UADDO);
  OPCODE(USUBO);
  OPCODE(ADDCARRY);
  OPCODE(SUBCARRY);
  OPCODE(GET_CCMASK);
  OPCODE(MVC);
  OPCODE(MVC_LOOP);
  OPCODE(NC);
  OPCODE(NC_LOOP);
  OPCODE(OC);
  OPCODE(OC_LOOP);
  OPCODE(XC);
  OPCODE(XC_LOOP);
  OPCODE(CLC);
  OPCODE(CLC_LOOP);
  OPCODE(STPCPY);
  OPCODE(STRCMP);
  OPCODE(SEARCH_STRING);
  OPCODE(IPM);
  OPCODE(MEMBARRIER);
  OPCODE(TBEGIN);
  OPCODE(TBEGIN_NOFLOAT);
  OPCODE(TEND);
  OPCODE(BYTE_MASK);
  OPCODE(ROTATE_MASK);
  OPCODE(REPLICATE);
  OPCODE(JOIN_DWORDS);
  OPCODE(SPLAT);
  OPCODE(MERGE_HIGH);
  OPCODE(MERGE_LOW);
  OPCODE(SHL_DOUBLE);
  OPCODE(PERMUTE_DWORDS);
  OPCODE(PERMUTE);
  OPCODE(PACK);
  OPCODE(PACKS_CC);
  OPCODE(PACKLS_CC);
  OPCODE(UNPACK_HIGH);
  OPCODE(UNPACKL_HIGH);
  OPCODE(UNPACK_LOW);
  OPCODE(UNPACKL_LOW);
  OPCODE(VSHL_BY_SCALAR);
  OPCODE(VSRL_BY_SCALAR);
  OPCODE(VSRA_BY_SCALAR);
  OPCODE(VSUM);
  OPCODE(VICMPE);
  OPCODE(VICMPH);
  OPCODE(VICMPHL);
  OPCODE(VICMPES);
  OPCODE(VICMPHS);
  OPCODE(VICMPHLS);
  OPCODE(VFCMPE);
  OPCODE(VFCMPH);
  OPCODE(VFCMPHE);
  OPCODE(VFCMPES);
  OPCODE(VFCMPHS);
  OPCODE(VFCMPHES);
  OPCODE(VFTCI);
  OPCODE(VEXTEND);
  OPCODE(VROUND);
  OPCODE(VTM);
  OPCODE(VFAE_CC);
  OPCODE(VFAEZ_CC);
  OPCODE(VFEE_CC);
  OPCODE(VFEEZ_CC);
  OPCODE(VFENE_CC);
  OPCODE(VFENEZ_CC);
  OPCODE(VISTR_CC);
  OPCODE(VSTRC_CC);
  OPCODE(VSTRCZ_CC);
  OPCODE(TDC);
  OPCODE(ATOMIC_SWAPW);
  OPCODE(ATOMIC_LOADW_ADD);
  OPCODE(ATOMIC_LOADW_SUB);
  OPCODE(ATOMIC_LOADW_AND);
  OPCODE(ATOMIC_LOADW_OR);
  OPCODE(ATOMIC_LOADW_XOR);
  OPCODE(ATOMIC_LOADW_NAND);
  OPCODE(ATOMIC_LOADW_MIN);
  OPCODE(ATOMIC_LOADW_MAX);
  OPCODE(ATOMIC_LOADW_UMIN);
  OPCODE(ATOMIC_LOADW_UMAX);
  OPCODE(ATOMIC_CMP_SWAPW);
  OPCODE(ATOMIC_CMP_SWAP);
  OPCODE(ATOMIC_LOAD_128);
  OPCODE(ATOMIC_STORE_128);
  OPCODE(ATOMIC_CMP_SWAP_128);
  OPCODE(LRV);
  OPCODE(STRV);
  OPCODE(PREFETCH);
}
return nullptr;
5099#undef OPCODE
5100}

5102// Return true if VT is a vector whose elements are a whole number of bytes
5103// in width. Also check for presence of vector support.
5104bool SystemZTargetLowering::canTreatAsByteVector(EVT VT) const {
if (!Subtarget.hasVector())
  return false;

return VT.isVector() && VT.getScalarSizeInBits() % 8 == 0 && VT.isSimple();
5109}

5111// Try to simplify an EXTRACT_VECTOR_ELT from a vector of type VecVT
5112// producing a result of type ResVT.  Op is a possibly bitcast version
5113// of the input vector and Index is the index (based on type VecVT) that
5114// should be extracted.  Return the new extraction if a simplification
5115// was possible or if Force is true.
5116SDValue SystemZTargetLowering::combineExtract(const SDLoc &DL, EVT ResVT,
                                            EVT VecVT, SDValue Op,
                                            unsigned Index,
                                            DAGCombinerInfo &DCI,
                                            bool Force) const {
SelectionDAG &DAG = DCI.DAG;

// The number of bytes being extracted.
unsigned BytesPerElement = VecVT.getVectorElementType().getStoreSize();

for (;;) {
  unsigned Opcode = Op.getOpcode();
  if (Opcode == ISD::BITCAST)
    // Look through bitcasts.
    Op = Op.getOperand(0);
  else if ((Opcode == ISD::VECTOR_SHUFFLE || Opcode == SystemZISD::SPLAT) &&
           canTreatAsByteVector(Op.getValueType())) {
    // Get a VPERM-like permute mask and see whether the bytes covered
    // by the extracted element are a contiguous sequence from one
    // source operand.
    SmallVector<int, SystemZ::VectorBytes> Bytes;
    if (!getVPermMask(Op, Bytes))
      break;
    int First;
    if (!getShuffleInput(Bytes, Index * BytesPerElement,
                         BytesPerElement, First))
      break;
    if (First < 0)
      return DAG.getUNDEF(ResVT);
    // Make sure the contiguous sequence starts at a multiple of the
    // original element size.
    unsigned Byte = unsigned(First) % Bytes.size();
    if (Byte % BytesPerElement != 0)
      break;
    // We can get the extracted value directly from an input.
    Index = Byte / BytesPerElement;
    Op = Op.getOperand(unsigned(First) / Bytes.size());
    Force = true;
  } else if (Opcode == ISD::BUILD_VECTOR &&
             canTreatAsByteVector(Op.getValueType())) {
    // We can only optimize this case if the BUILD_VECTOR elements are
    // at least as wide as the extracted value.
    EVT OpVT = Op.getValueType();
    unsigned OpBytesPerElement = OpVT.getVectorElementType().getStoreSize();
    if (OpBytesPerElement < BytesPerElement)
      break;
    // Make sure that the least-significant bit of the extracted value
    // is the least significant bit of an input.
    unsigned End = (Index + 1) * BytesPerElement;
    if (End % OpBytesPerElement != 0)
      break;
    // We're extracting the low part of one operand of the BUILD_VECTOR.
    Op = Op.getOperand(End / OpBytesPerElement - 1);
    if (!Op.getValueType().isInteger()) {
      EVT VT = MVT::getIntegerVT(Op.getValueSizeInBits());
      Op = DAG.getNode(ISD::BITCAST, DL, VT, Op);
      DCI.AddToWorklist(Op.getNode());
    }
    EVT VT = MVT::getIntegerVT(ResVT.getSizeInBits());
    Op = DAG.getNode(ISD::TRUNCATE, DL, VT, Op);
    if (VT != ResVT) {
      DCI.AddToWorklist(Op.getNode());
      Op = DAG.getNode(ISD::BITCAST, DL, ResVT, Op);
    }
    return Op;
  } else if ((Opcode == ISD::SIGN_EXTEND_VECTOR_INREG ||
              Opcode == ISD::ZERO_EXTEND_VECTOR_INREG ||
              Opcode == ISD::ANY_EXTEND_VECTOR_INREG) &&
             canTreatAsByteVector(Op.getValueType()) &&
             canTreatAsByteVector(Op.getOperand(0).getValueType())) {
    // Make sure that only the unextended bits are significant.
    EVT ExtVT = Op.getValueType();
    EVT OpVT = Op.getOperand(0).getValueType();
    unsigned ExtBytesPerElement = ExtVT.getVectorElementType().getStoreSize();
    unsigned OpBytesPerElement = OpVT.getVectorElementType().getStoreSize();
    unsigned Byte = Index * BytesPerElement;
    unsigned SubByte = Byte % ExtBytesPerElement;
    unsigned MinSubByte = ExtBytesPerElement - OpBytesPerElement;
    if (SubByte < MinSubByte ||
        SubByte + BytesPerElement > ExtBytesPerElement)
      break;
    // Get the byte offset of the unextended element
    Byte = Byte / ExtBytesPerElement * OpBytesPerElement;
    // ...then add the byte offset relative to that element.
    Byte += SubByte - MinSubByte;
    if (Byte % BytesPerElement != 0)
      break;
    Op = Op.getOperand(0);
    Index = Byte / BytesPerElement;
    Force = true;
  } else
    break;
}
if (Force) {
  if (Op.getValueType() != VecVT) {
    Op = DAG.getNode(ISD::BITCAST, DL, VecVT, Op);
    DCI.AddToWorklist(Op.getNode());
  }
  return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, ResVT, Op,
                     DAG.getConstant(Index, DL, MVT::i32));
}
return SDValue();
5218}

5220// Optimize vector operations in scalar value Op on the basis that Op
5221// is truncated to TruncVT.
5222SDValue SystemZTargetLowering::combineTruncateExtract(
  const SDLoc &DL, EVT TruncVT, SDValue Op, DAGCombinerInfo &DCI) const {
// If we have (trunc (extract_vector_elt X, Y)), try to turn it into
// (extract_vector_elt (bitcast X), Y'), where (bitcast X) has elements
// of type TruncVT.
if (Op.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
    TruncVT.getSizeInBits() % 8 == 0) {
  SDValue Vec = Op.getOperand(0);
  EVT VecVT = Vec.getValueType();
  if (canTreatAsByteVector(VecVT)) {
    if (auto *IndexN = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
      unsigned BytesPerElement = VecVT.getVectorElementType().getStoreSize();
      unsigned TruncBytes = TruncVT.getStoreSize();
      if (BytesPerElement % TruncBytes == 0) {
        // Calculate the value of Y' in the above description.  We are
        // splitting the original elements into Scale equal-sized pieces
        // and for truncation purposes want the last (least-significant)
        // of these pieces for IndexN.  This is easiest to do by calculating
        // the start index of the following element and then subtracting 1.
        unsigned Scale = BytesPerElement / TruncBytes;
        unsigned NewIndex = (IndexN->getZExtValue() + 1) * Scale - 1;

        // Defer the creation of the bitcast from X to combineExtract,
        // which might be able to optimize the extraction.
        VecVT = MVT::getVectorVT(MVT::getIntegerVT(TruncBytes * 8),
                                 VecVT.getStoreSize() / TruncBytes);
        EVT ResVT = (TruncBytes < 4 ? MVT::i32 : TruncVT);
        return combineExtract(DL, ResVT, VecVT, Vec, NewIndex, DCI, true);
      }
    }
  }
}
return SDValue();
5255}

5257SDValue SystemZTargetLowering::combineZERO_EXTEND(
  SDNode *N, DAGCombinerInfo &DCI) const {
// Convert (zext (select_ccmask C1, C2)) into (select_ccmask C1', C2')
SelectionDAG &DAG = DCI.DAG;
SDValue N0 = N->getOperand(0);
EVT VT = N->getValueType(0);
if (N0.getOpcode() == SystemZISD::SELECT_CCMASK) {
  auto *TrueOp = dyn_cast<ConstantSDNode>(N0.getOperand(0));
  auto *FalseOp = dyn_cast<ConstantSDNode>(N0.getOperand(1));
  if (TrueOp && FalseOp) {
    SDLoc DL(N0);
    SDValue Ops[] = { DAG.getConstant(TrueOp->getZExtValue(), DL, VT),
                      DAG.getConstant(FalseOp->getZExtValue(), DL, VT),
                      N0.getOperand(2), N0.getOperand(3), N0.getOperand(4) };
    SDValue NewSelect = DAG.getNode(SystemZISD::SELECT_CCMASK, DL, VT, Ops);
    // If N0 has multiple uses, change other uses as well.
    if (!N0.hasOneUse()) {
      SDValue TruncSelect =
        DAG.getNode(ISD::TRUNCATE, DL, N0.getValueType(), NewSelect);
      DCI.CombineTo(N0.getNode(), TruncSelect);
    }
    return NewSelect;
  }
}
return SDValue();
5282}

5284SDValue SystemZTargetLowering::combineSIGN_EXTEND_INREG(
  SDNode *N, DAGCombinerInfo &DCI) const {
// Convert (sext_in_reg (setcc LHS, RHS, COND), i1)
// and (sext_in_reg (any_extend (setcc LHS, RHS, COND)), i1)
// into (select_cc LHS, RHS, -1, 0, COND)
SelectionDAG &DAG = DCI.DAG;
SDValue N0 = N->getOperand(0);
EVT VT = N->getValueType(0);
EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
if (N0.hasOneUse() && N0.getOpcode() == ISD::ANY_EXTEND)
  N0 = N0.getOperand(0);
if (EVT == MVT::i1 && N0.hasOneUse() && N0.getOpcode() == ISD::SETCC) {
  SDLoc DL(N0);
  SDValue Ops[] = { N0.getOperand(0), N0.getOperand(1),
                    DAG.getConstant(-1, DL, VT), DAG.getConstant(0, DL, VT),
                    N0.getOperand(2) };
  return DAG.getNode(ISD::SELECT_CC, DL, VT, Ops);
}
return SDValue();
5303}

5305SDValue SystemZTargetLowering::combineSIGN_EXTEND(
  SDNode *N, DAGCombinerInfo &DCI) const {
// Convert (sext (ashr (shl X, C1), C2)) to
// (ashr (shl (anyext X), C1'), C2')), since wider shifts are as
// cheap as narrower ones.
SelectionDAG &DAG = DCI.DAG;
SDValue N0 = N->getOperand(0);
EVT VT = N->getValueType(0);
if (N0.hasOneUse() && N0.getOpcode() == ISD::SRA) {
  auto *SraAmt = dyn_cast<ConstantSDNode>(N0.getOperand(1));
  SDValue Inner = N0.getOperand(0);
  if (SraAmt && Inner.hasOneUse() && Inner.getOpcode() == ISD::SHL) {
    if (auto *ShlAmt = dyn_cast<ConstantSDNode>(Inner.getOperand(1))) {
      unsigned Extra = (VT.getSizeInBits() - N0.getValueSizeInBits());
      unsigned NewShlAmt = ShlAmt->getZExtValue() + Extra;
      unsigned NewSraAmt = SraAmt->getZExtValue() + Extra;
      EVT ShiftVT = N0.getOperand(1).getValueType();
      SDValue Ext = DAG.getNode(ISD::ANY_EXTEND, SDLoc(Inner), VT,
                                Inner.getOperand(0));
      SDValue Shl = DAG.getNode(ISD::SHL, SDLoc(Inner), VT, Ext,
                                DAG.getConstant(NewShlAmt, SDLoc(Inner),
                                                ShiftVT));
      return DAG.getNode(ISD::SRA, SDLoc(N0), VT, Shl,
                         DAG.getConstant(NewSraAmt, SDLoc(N0), ShiftVT));
    }
  }
}
return SDValue();
5333}

5335SDValue SystemZTargetLowering::combineMERGE(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
unsigned Opcode = N->getOpcode();
SDValue Op0 = N->getOperand(0);
SDValue Op1 = N->getOperand(1);
if (Op0.getOpcode() == ISD::BITCAST)
  Op0 = Op0.getOperand(0);
if (Op0.getOpcode() == SystemZISD::BYTE_MASK &&
    cast<ConstantSDNode>(Op0.getOperand(0))->getZExtValue() == 0) {
  // (z_merge_* 0, 0) -> 0.  This is mostly useful for using VLLEZF
  // for v4f32.
  if (Op1 == N->getOperand(0))
    return Op1;
  // (z_merge_? 0, X) -> (z_unpackl_? 0, X).
  EVT VT = Op1.getValueType();
  unsigned ElemBytes = VT.getVectorElementType().getStoreSize();
  if (ElemBytes <= 4) {
    Opcode = (Opcode == SystemZISD::MERGE_HIGH ?
              SystemZISD::UNPACKL_HIGH : SystemZISD::UNPACKL_LOW);
    EVT InVT = VT.changeVectorElementTypeToInteger();
    EVT OutVT = MVT::getVectorVT(MVT::getIntegerVT(ElemBytes * 16),
                                 SystemZ::VectorBytes / ElemBytes / 2);
    if (VT != InVT) {
      Op1 = DAG.getNode(ISD::BITCAST, SDLoc(N), InVT, Op1);
      DCI.AddToWorklist(Op1.getNode());
    }
    SDValue Op = DAG.getNode(Opcode, SDLoc(N), OutVT, Op1);
    DCI.AddToWorklist(Op.getNode());
    return DAG.getNode(ISD::BITCAST, SDLoc(N), VT, Op);
  }
}
return SDValue();
5368}

5370SDValue SystemZTargetLowering::combineLOAD(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
EVT LdVT = N->getValueType(0);
if (LdVT.isVector() || LdVT.isInteger())
  return SDValue();
// Transform a scalar load that is REPLICATEd as well as having other
// use(s) to the form where the other use(s) use the first element of the
// REPLICATE instead of the load. Otherwise instruction selection will not
// produce a VLREP. Avoid extracting to a GPR, so only do this for floating
// point loads.

SDValue Replicate;
SmallVector<SDNode*, 8> OtherUses;
for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
     UI != UE; ++UI) {
  if (UI->getOpcode() == SystemZISD::REPLICATE) {
    if (Replicate)
      return SDValue(); // Should never happen
    Replicate = SDValue(*UI, 0);
  }
  else if (UI.getUse().getResNo() == 0)
    OtherUses.push_back(*UI);
}
if (!Replicate || OtherUses.empty())
  return SDValue();

SDLoc DL(N);
SDValue Extract0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, LdVT,
                            Replicate, DAG.getConstant(0, DL, MVT::i32));
// Update uses of the loaded Value while preserving old chains.
for (SDNode *U : OtherUses) {
  SmallVector<SDValue, 8> Ops;
  for (SDValue Op : U->ops())
    Ops.push_back((Op.getNode() == N && Op.getResNo() == 0) ? Extract0 : Op);
  DAG.UpdateNodeOperands(U, Ops);
}
return SDValue(N, 0);
5408}

5410SDValue SystemZTargetLowering::combineSTORE(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
auto *SN = cast<StoreSDNode>(N);
auto &Op1 = N->getOperand(1);
EVT MemVT = SN->getMemoryVT();
// If we have (truncstoreiN (extract_vector_elt X, Y), Z) then it is better
// for the extraction to be done on a vMiN value, so that we can use VSTE.
// If X has wider elements then convert it to:
// (truncstoreiN (extract_vector_elt (bitcast X), Y2), Z).
if (MemVT.isInteger() && SN->isTruncatingStore()) {
  if (SDValue Value =
          combineTruncateExtract(SDLoc(N), MemVT, SN->getValue(), DCI)) {
    DCI.AddToWorklist(Value.getNode());

    // Rewrite the store with the new form of stored value.
    return DAG.getTruncStore(SN->getChain(), SDLoc(SN), Value,
                             SN->getBasePtr(), SN->getMemoryVT(),
                             SN->getMemOperand());
  }
}
// Combine STORE (BSWAP) into STRVH/STRV/STRVG
if (!SN->isTruncatingStore() &&
    Op1.getOpcode() == ISD::BSWAP &&
    Op1.getNode()->hasOneUse() &&
    (Op1.getValueType() == MVT::i16 ||
     Op1.getValueType() == MVT::i32 ||
     Op1.getValueType() == MVT::i64)) {

    SDValue BSwapOp = Op1.getOperand(0);

    if (BSwapOp.getValueType() == MVT::i16)
      BSwapOp = DAG.getNode(ISD::ANY_EXTEND, SDLoc(N), MVT::i32, BSwapOp);

    SDValue Ops[] = {
      N->getOperand(0), BSwapOp, N->getOperand(2)
    };

    return
      DAG.getMemIntrinsicNode(SystemZISD::STRV, SDLoc(N), DAG.getVTList(MVT::Other),
                              Ops, MemVT, SN->getMemOperand());
  }
return SDValue();
5453}

5455SDValue SystemZTargetLowering::combineEXTRACT_VECTOR_ELT(
  SDNode *N, DAGCombinerInfo &DCI) const {

if (!Subtarget.hasVector())
  return SDValue();

// Try to simplify a vector extraction.
if (auto *IndexN = dyn_cast<ConstantSDNode>(N->getOperand(1))) {
  SDValue Op0 = N->getOperand(0);
  EVT VecVT = Op0.getValueType();
  return combineExtract(SDLoc(N), N->getValueType(0), VecVT, Op0,
                        IndexN->getZExtValue(), DCI, false);
}
return SDValue();
5469}

5471SDValue SystemZTargetLowering::combineJOIN_DWORDS(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
// (join_dwords X, X) == (replicate X)
if (N->getOperand(0) == N->getOperand(1))
  return DAG.getNode(SystemZISD::REPLICATE, SDLoc(N), N->getValueType(0),
                     N->getOperand(0));
return SDValue();
5479}

5481SDValue SystemZTargetLowering::combineFP_ROUND(
  SDNode *N, DAGCombinerInfo &DCI) const {
// (fpround (extract_vector_elt X 0))
// (fpround (extract_vector_elt X 1)) ->
// (extract_vector_elt (VROUND X) 0)
// (extract_vector_elt (VROUND X) 2)
//
// This is a special case since the target doesn't really support v2f32s.
SelectionDAG &DAG = DCI.DAG;
SDValue Op0 = N->getOperand(0);
if (N->getValueType(0) == MVT::f32 &&
    Op0.hasOneUse() &&
    Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
    Op0.getOperand(0).getValueType() == MVT::v2f64 &&
    Op0.getOperand(1).getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue() == 0) {
  SDValue Vec = Op0.getOperand(0);
  for (auto *U : Vec->uses()) {
    if (U != Op0.getNode() &&
        U->hasOneUse() &&
        U->getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
        U->getOperand(0) == Vec &&
        U->getOperand(1).getOpcode() == ISD::Constant &&
        cast<ConstantSDNode>(U->getOperand(1))->getZExtValue() == 1) {
      SDValue OtherRound = SDValue(*U->use_begin(), 0);
      if (OtherRound.getOpcode() == ISD::FP_ROUND &&
          OtherRound.getOperand(0) == SDValue(U, 0) &&
          OtherRound.getValueType() == MVT::f32) {
        SDValue VRound = DAG.getNode(SystemZISD::VROUND, SDLoc(N),
                                     MVT::v4f32, Vec);
        DCI.AddToWorklist(VRound.getNode());
        SDValue Extract1 =
          DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(U), MVT::f32,
                      VRound, DAG.getConstant(2, SDLoc(U), MVT::i32));
        DCI.AddToWorklist(Extract1.getNode());
        DAG.ReplaceAllUsesOfValueWith(OtherRound, Extract1);
        SDValue Extract0 =
          DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op0), MVT::f32,
                      VRound, DAG.getConstant(0, SDLoc(Op0), MVT::i32));
        return Extract0;
      }
    }
  }
}
return SDValue();
5526}

5528SDValue SystemZTargetLowering::combineFP_EXTEND(
  SDNode *N, DAGCombinerInfo &DCI) const {
// (fpextend (extract_vector_elt X 0))
// (fpextend (extract_vector_elt X 2)) ->
// (extract_vector_elt (VEXTEND X) 0)
// (extract_vector_elt (VEXTEND X) 1)
//
// This is a special case since the target doesn't really support v2f32s.
SelectionDAG &DAG = DCI.DAG;
SDValue Op0 = N->getOperand(0);
if (N->getValueType(0) == MVT::f64 &&
    Op0.hasOneUse() &&
    Op0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
    Op0.getOperand(0).getValueType() == MVT::v4f32 &&
    Op0.getOperand(1).getOpcode() == ISD::Constant &&
    cast<ConstantSDNode>(Op0.getOperand(1))->getZExtValue() == 0) {
  SDValue Vec = Op0.getOperand(0);
  for (auto *U : Vec->uses()) {
    if (U != Op0.getNode() &&
        U->hasOneUse() &&
        U->getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
        U->getOperand(0) == Vec &&
        U->getOperand(1).getOpcode() == ISD::Constant &&
        cast<ConstantSDNode>(U->getOperand(1))->getZExtValue() == 2) {
      SDValue OtherExtend = SDValue(*U->use_begin(), 0);
      if (OtherExtend.getOpcode() == ISD::FP_EXTEND &&
          OtherExtend.getOperand(0) == SDValue(U, 0) &&
          OtherExtend.getValueType() == MVT::f64) {
        SDValue VExtend = DAG.getNode(SystemZISD::VEXTEND, SDLoc(N),
                                      MVT::v2f64, Vec);
        DCI.AddToWorklist(VExtend.getNode());
        SDValue Extract1 =
          DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(U), MVT::f64,
                      VExtend, DAG.getConstant(1, SDLoc(U), MVT::i32));
        DCI.AddToWorklist(Extract1.getNode());
        DAG.ReplaceAllUsesOfValueWith(OtherExtend, Extract1);
        SDValue Extract0 =
          DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(Op0), MVT::f64,
                      VExtend, DAG.getConstant(0, SDLoc(Op0), MVT::i32));
        return Extract0;
      }
    }
  }
}
return SDValue();
5573}

5575SDValue SystemZTargetLowering::combineBSWAP(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
// Combine BSWAP (LOAD) into LRVH/LRV/LRVG
if (ISD::isNON_EXTLoad(N->getOperand(0).getNode()) &&
    N->getOperand(0).hasOneUse() &&
    (N->getValueType(0) == MVT::i16 || N->getValueType(0) == MVT::i32 ||
     N->getValueType(0) == MVT::i64)) {
    SDValue Load = N->getOperand(0);
    LoadSDNode *LD = cast<LoadSDNode>(Load);

    // Create the byte-swapping load.
    SDValue Ops[] = {
      LD->getChain(),    // Chain
      LD->getBasePtr()   // Ptr
    };
    EVT LoadVT = N->getValueType(0);
    if (LoadVT == MVT::i16)
      LoadVT = MVT::i32;
    SDValue BSLoad =
      DAG.getMemIntrinsicNode(SystemZISD::LRV, SDLoc(N),
                              DAG.getVTList(LoadVT, MVT::Other),
                              Ops, LD->getMemoryVT(), LD->getMemOperand());

    // If this is an i16 load, insert the truncate.
    SDValue ResVal = BSLoad;
    if (N->getValueType(0) == MVT::i16)
      ResVal = DAG.getNode(ISD::TRUNCATE, SDLoc(N), MVT::i16, BSLoad);

    // First, combine the bswap away.  This makes the value produced by the
    // load dead.
    DCI.CombineTo(N, ResVal);

    // Next, combine the load away, we give it a bogus result value but a real
    // chain result.  The result value is dead because the bswap is dead.
    DCI.CombineTo(Load.getNode(), ResVal, BSLoad.getValue(1));

    // Return N so it doesn't get rechecked!
    return SDValue(N, 0);
  }
return SDValue();
5616}

5618static bool combineCCMask(SDValue &CCReg, int &CCValid, int &CCMask) {
// We have a SELECT_CCMASK or BR_CCMASK comparing the condition code
// set by the CCReg instruction using the CCValid / CCMask masks,
// If the CCReg instruction is itself a (ICMP (SELECT_CCMASK)) testing
// the condition code set by some other instruction, see whether we
// can directly use that condition code.
bool Invert = false;

// Verify that we have an appropriate mask for a EQ or NE comparison.
if (CCValid != SystemZ::CCMASK_ICMP)
  return false;
if (CCMask == SystemZ::CCMASK_CMP_NE)
  Invert = !Invert;
else if (CCMask != SystemZ::CCMASK_CMP_EQ)
  return false;

// Verify that we have an ICMP that is the user of a SELECT_CCMASK.
SDNode *ICmp = CCReg.getNode();
if (ICmp->getOpcode() != SystemZISD::ICMP)
  return false;
SDNode *Select = ICmp->getOperand(0).getNode();
if (Select->getOpcode() != SystemZISD::SELECT_CCMASK)
  return false;

// Verify that the ICMP compares against one of select values.
auto *CompareVal = dyn_cast<ConstantSDNode>(ICmp->getOperand(1));
if (!CompareVal)
  return false;
auto *TrueVal = dyn_cast<ConstantSDNode>(Select->getOperand(0));
if (!TrueVal)
  return false;
auto *FalseVal = dyn_cast<ConstantSDNode>(Select->getOperand(1));
if (!FalseVal)
  return false;
if (CompareVal->getZExtValue() == FalseVal->getZExtValue())
  Invert = !Invert;
else if (CompareVal->getZExtValue() != TrueVal->getZExtValue())
  return false;

// Compute the effective CC mask for the new branch or select.
auto *NewCCValid = dyn_cast<ConstantSDNode>(Select->getOperand(2));
auto *NewCCMask = dyn_cast<ConstantSDNode>(Select->getOperand(3));
if (!NewCCValid || !NewCCMask)
  return false;
CCValid = NewCCValid->getZExtValue();
CCMask = NewCCMask->getZExtValue();
if (Invert)
  CCMask ^= CCValid;

// Return the updated CCReg link.
CCReg = Select->getOperand(4);
return true;
5670}

5672SDValue SystemZTargetLowering::combineBR_CCMASK(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;

// Combine BR_CCMASK (ICMP (SELECT_CCMASK)) into a single BR_CCMASK.
auto *CCValid = dyn_cast<ConstantSDNode>(N->getOperand(1));
auto *CCMask = dyn_cast<ConstantSDNode>(N->getOperand(2));
if (!CCValid || !CCMask)
  return SDValue();

int CCValidVal = CCValid->getZExtValue();
int CCMaskVal = CCMask->getZExtValue();
SDValue Chain = N->getOperand(0);
SDValue CCReg = N->getOperand(4);

if (combineCCMask(CCReg, CCValidVal, CCMaskVal))
  return DAG.getNode(SystemZISD::BR_CCMASK, SDLoc(N), N->getValueType(0),
                     Chain,
                     DAG.getConstant(CCValidVal, SDLoc(N), MVT::i32),
                     DAG.getConstant(CCMaskVal, SDLoc(N), MVT::i32),
                     N->getOperand(3), CCReg);
return SDValue();
5694}

5696SDValue SystemZTargetLowering::combineSELECT_CCMASK(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;

// Combine SELECT_CCMASK (ICMP (SELECT_CCMASK)) into a single SELECT_CCMASK.
auto *CCValid = dyn_cast<ConstantSDNode>(N->getOperand(2));
auto *CCMask = dyn_cast<ConstantSDNode>(N->getOperand(3));
if (!CCValid || !CCMask)
  return SDValue();

int CCValidVal = CCValid->getZExtValue();
int CCMaskVal = CCMask->getZExtValue();
SDValue CCReg = N->getOperand(4);

if (combineCCMask(CCReg, CCValidVal, CCMaskVal))
  return DAG.getNode(SystemZISD::SELECT_CCMASK, SDLoc(N), N->getValueType(0),
                     N->getOperand(0),
                     N->getOperand(1),
                     DAG.getConstant(CCValidVal, SDLoc(N), MVT::i32),
                     DAG.getConstant(CCMaskVal, SDLoc(N), MVT::i32),
                     CCReg);
return SDValue();
5718}


5721SDValue SystemZTargetLowering::combineGET_CCMASK(
  SDNode *N, DAGCombinerInfo &DCI) const {

// Optimize away GET_CCMASK (SELECT_CCMASK) if the CC masks are compatible
auto *CCValid = dyn_cast<ConstantSDNode>(N->getOperand(1));
auto *CCMask = dyn_cast<ConstantSDNode>(N->getOperand(2));
if (!CCValid || !CCMask)
  return SDValue();
int CCValidVal = CCValid->getZExtValue();
int CCMaskVal = CCMask->getZExtValue();

SDValue Select = N->getOperand(0);
if (Select->getOpcode() != SystemZISD::SELECT_CCMASK)
  return SDValue();

auto *SelectCCValid = dyn_cast<ConstantSDNode>(Select->getOperand(2));
auto *SelectCCMask = dyn_cast<ConstantSDNode>(Select->getOperand(3));
if (!SelectCCValid || !SelectCCMask)
  return SDValue();
int SelectCCValidVal = SelectCCValid->getZExtValue();
int SelectCCMaskVal = SelectCCMask->getZExtValue();

auto *TrueVal = dyn_cast<ConstantSDNode>(Select->getOperand(0));
auto *FalseVal = dyn_cast<ConstantSDNode>(Select->getOperand(1));
if (!TrueVal || !FalseVal)
  return SDValue();
if (TrueVal->getZExtValue() != 0 && FalseVal->getZExtValue() == 0)
  ;
else if (TrueVal->getZExtValue() == 0 && FalseVal->getZExtValue() != 0)
  SelectCCMaskVal ^= SelectCCValidVal;
else
  return SDValue();

if (SelectCCValidVal & ~CCValidVal)
  return SDValue();
if (SelectCCMaskVal != (CCMaskVal & SelectCCValidVal))
  return SDValue();

return Select->getOperand(4);
5760}

5762SDValue SystemZTargetLowering::combineIntDIVREM(
  SDNode *N, DAGCombinerInfo &DCI) const {
SelectionDAG &DAG = DCI.DAG;
EVT VT = N->getValueType(0);
// In the case where the divisor is a vector of constants a cheaper
// sequence of instructions can replace the divide. BuildSDIV is called to
// do this during DAG combining, but it only succeeds when it can build a
// multiplication node. The only option for SystemZ is ISD::SMUL_LOHI, and
// since it is not Legal but Custom it can only happen before
// legalization. Therefore we must scalarize this early before Combine
// 1. For widened vectors, this is already the result of type legalization.
if (VT.isVector() && isTypeLegal(VT) &&
    DAG.isConstantIntBuildVectorOrConstantInt(N->getOperand(1)))
  return DAG.UnrollVectorOp(N);
return SDValue();
5777}

5779SDValue SystemZTargetLowering::PerformDAGCombine(SDNode *N,
                                               DAGCombinerInfo &DCI) const {
switch(N->getOpcode()) {
default: break;
case ISD::ZERO_EXTEND:        return combineZERO_EXTEND(N, DCI);
case ISD::SIGN_EXTEND:        return combineSIGN_EXTEND(N, DCI);
case ISD::SIGN_EXTEND_INREG:  return combineSIGN_EXTEND_INREG(N, DCI);
case SystemZISD::MERGE_HIGH:
case SystemZISD::MERGE_LOW:   return combineMERGE(N, DCI);
case ISD::LOAD:               return combineLOAD(N, DCI);
case ISD::STORE:              return combineSTORE(N, DCI);
case ISD::EXTRACT_VECTOR_ELT: return combineEXTRACT_VECTOR_ELT(N, DCI);
case SystemZISD::JOIN_DWORDS: return combineJOIN_DWORDS(N, DCI);
case ISD::FP_ROUND:           return combineFP_ROUND(N, DCI);
case ISD::FP_EXTEND:          return combineFP_EXTEND(N, DCI);
case ISD::BSWAP:              return combineBSWAP(N, DCI);
case SystemZISD::BR_CCMASK:   return combineBR_CCMASK(N, DCI);
case SystemZISD::SELECT_CCMASK: return combineSELECT_CCMASK(N, DCI);
case SystemZISD::GET_CCMASK:  return combineGET_CCMASK(N, DCI);
case ISD::SDIV:
case ISD::UDIV:
case ISD::SREM:
case ISD::UREM:               return combineIntDIVREM(N, DCI);
}

return SDValue();
5805}

5807// Return the demanded elements for the OpNo source operand of Op. DemandedElts
5808// are for Op.
5809static APInt getDemandedSrcElements(SDValue Op, const APInt &DemandedElts,
                                  unsigned OpNo) {
EVT VT = Op.getValueType();
unsigned NumElts = (VT.isVector() ? VT.getVectorNumElements() : 1);
APInt SrcDemE;
unsigned Opcode = Op.getOpcode();
if (Opcode == ISD::INTRINSIC_WO_CHAIN) {
  unsigned Id = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
  switch (Id) {
  case Intrinsic::s390_vpksh:   // PACKS
  case Intrinsic::s390_vpksf:
  case Intrinsic::s390_vpksg:
  case Intrinsic::s390_vpkshs:  // PACKS_CC
  case Intrinsic::s390_vpksfs:
  case Intrinsic::s390_vpksgs:
  case Intrinsic::s390_vpklsh:  // PACKLS
  case Intrinsic::s390_vpklsf:
  case Intrinsic::s390_vpklsg:
  case Intrinsic::s390_vpklshs: // PACKLS_CC
  case Intrinsic::s390_vpklsfs:
  case Intrinsic::s390_vpklsgs:
    // VECTOR PACK truncates the elements of two source vectors into one.
    SrcDemE = DemandedElts;
    if (OpNo == 2)
      SrcDemE.lshrInPlace(NumElts / 2);
    SrcDemE = SrcDemE.trunc(NumElts / 2);
    break;
    // VECTOR UNPACK extends half the elements of the source vector.
  case Intrinsic::s390_vuphb:  // VECTOR UNPACK HIGH
  case Intrinsic::s390_vuphh:
  case Intrinsic::s390_vuphf:
  case Intrinsic::s390_vuplhb: // VECTOR UNPACK LOGICAL HIGH
  case Intrinsic::s390_vuplhh:
  case Intrinsic::s390_vuplhf:
    SrcDemE = APInt(NumElts * 2, 0);
    SrcDemE.insertBits(DemandedElts, 0);
    break;
  case Intrinsic::s390_vuplb:  // VECTOR UNPACK LOW
  case Intrinsic::s390_vuplhw:
  case Intrinsic::s390_vuplf:
  case Intrinsic::s390_vupllb: // VECTOR UNPACK LOGICAL LOW
  case Intrinsic::s390_vupllh:
  case Intrinsic::s390_vupllf:
    SrcDemE = APInt(NumElts * 2, 0);
    SrcDemE.insertBits(DemandedElts, NumElts);
    break;
  case Intrinsic::s390_vpdi: {
    // VECTOR PERMUTE DWORD IMMEDIATE selects one element from each source.
    SrcDemE = APInt(NumElts, 0);
    if (!DemandedElts[OpNo - 1])
      break;
    unsigned Mask = cast<ConstantSDNode>(Op.getOperand(3))->getZExtValue();
    unsigned MaskBit = ((OpNo - 1) ? 1 : 4);
    // Demand input element 0 or 1, given by the mask bit value.
    SrcDemE.setBit((Mask & MaskBit)? 1 : 0);
    break;
  }
  case Intrinsic::s390_vsldb: {
    // VECTOR SHIFT LEFT DOUBLE BY BYTE
    assert(VT == MVT::v16i8 && "Unexpected type.")((VT == MVT::v16i8 && "Unexpected type.") ? static_cast
<void> (0) : __assert_fail ("VT == MVT::v16i8 && \"Unexpected type.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5868, __PRETTY_FUNCTION__));
    unsigned FirstIdx = cast<ConstantSDNode>(Op.getOperand(3))->getZExtValue();
    assert (FirstIdx > 0 && FirstIdx < 16 && "Unused operand.")((FirstIdx > 0 && FirstIdx < 16 && "Unused operand."
) ? static_cast<void> (0) : __assert_fail ("FirstIdx > 0 && FirstIdx < 16 && \"Unused operand.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5870, __PRETTY_FUNCTION__));
    unsigned NumSrc0Els = 16 - FirstIdx;
    SrcDemE = APInt(NumElts, 0);
    if (OpNo == 1) {
      APInt DemEls = DemandedElts.trunc(NumSrc0Els);
      SrcDemE.insertBits(DemEls, FirstIdx);
    } else {
      APInt DemEls = DemandedElts.lshr(NumSrc0Els);
      SrcDemE.insertBits(DemEls, 0);
    }
    break;
  }
  case Intrinsic::s390_vperm:
    SrcDemE = APInt(NumElts, 1);
    break;
  default:
    llvm_unreachable("Unhandled intrinsic.")::llvm::llvm_unreachable_internal("Unhandled intrinsic.", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5886);
    break;
  }
} else {
  switch (Opcode) {
  case SystemZISD::JOIN_DWORDS:
    // Scalar operand.
    SrcDemE = APInt(1, 1);
    break;
  case SystemZISD::SELECT_CCMASK:
    SrcDemE = DemandedElts;
    break;
  default:
    llvm_unreachable("Unhandled opcode.")::llvm::llvm_unreachable_internal("Unhandled opcode.", "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5899);
    break;
  }
}
return SrcDemE;
5904}

5906static void computeKnownBitsBinOp(const SDValue Op, KnownBits &Known,
                                const APInt &DemandedElts,
                                const SelectionDAG &DAG, unsigned Depth,
                                unsigned OpNo) {
APInt Src0DemE = getDemandedSrcElements(Op, DemandedElts, OpNo);
APInt Src1DemE = getDemandedSrcElements(Op, DemandedElts, OpNo + 1);
KnownBits LHSKnown =
    DAG.computeKnownBits(Op.getOperand(OpNo), Src0DemE, Depth + 1);
KnownBits RHSKnown =
    DAG.computeKnownBits(Op.getOperand(OpNo + 1), Src1DemE, Depth + 1);
Known.Zero = LHSKnown.Zero & RHSKnown.Zero;
Known.One = LHSKnown.One & RHSKnown.One;
5918}

5920void
5921SystemZTargetLowering::computeKnownBitsForTargetNode(const SDValue Op,
                                                   KnownBits &Known,
                                                   const APInt &DemandedElts,
                                                   const SelectionDAG &DAG,
                                                   unsigned Depth) const {
Known.resetAll();

// Intrinsic CC result is returned in the two low bits.
unsigned tmp0, tmp1; // not used
if (Op.getResNo() == 1 && isIntrinsicWithCC(Op, tmp0, tmp1)) {
  Known.Zero.setBitsFrom(2);
  return;
}
EVT VT = Op.getValueType();
if (Op.getResNo() != 0 || VT == MVT::Untyped)
  return;
assert (Known.getBitWidth() == VT.getScalarSizeInBits() &&((Known.getBitWidth() == VT.getScalarSizeInBits() && "KnownBits does not match VT in bitwidth"
) ? static_cast<void> (0) : __assert_fail ("Known.getBitWidth() == VT.getScalarSizeInBits() && \"KnownBits does not match VT in bitwidth\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5938, __PRETTY_FUNCTION__))
        "KnownBits does not match VT in bitwidth")((Known.getBitWidth() == VT.getScalarSizeInBits() && "KnownBits does not match VT in bitwidth"
) ? static_cast<void> (0) : __assert_fail ("Known.getBitWidth() == VT.getScalarSizeInBits() && \"KnownBits does not match VT in bitwidth\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5938, __PRETTY_FUNCTION__));
assert ((!VT.isVector() ||(((!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements
())) && "DemandedElts does not match VT number of elements"
) ? static_cast<void> (0) : __assert_fail ("(!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements())) && \"DemandedElts does not match VT number of elements\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5941, __PRETTY_FUNCTION__))
         (DemandedElts.getBitWidth() == VT.getVectorNumElements())) &&(((!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements
())) && "DemandedElts does not match VT number of elements"
) ? static_cast<void> (0) : __assert_fail ("(!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements())) && \"DemandedElts does not match VT number of elements\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5941, __PRETTY_FUNCTION__))
        "DemandedElts does not match VT number of elements")(((!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements
())) && "DemandedElts does not match VT number of elements"
) ? static_cast<void> (0) : __assert_fail ("(!VT.isVector() || (DemandedElts.getBitWidth() == VT.getVectorNumElements())) && \"DemandedElts does not match VT number of elements\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 5941, __PRETTY_FUNCTION__));
unsigned BitWidth = Known.getBitWidth();
unsigned Opcode = Op.getOpcode();
if (Opcode == ISD::INTRINSIC_WO_CHAIN) {
  bool IsLogical = false;
  unsigned Id = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
  switch (Id) {
  case Intrinsic::s390_vpksh:   // PACKS
  case Intrinsic::s390_vpksf:
  case Intrinsic::s390_vpksg:
  case Intrinsic::s390_vpkshs:  // PACKS_CC
  case Intrinsic::s390_vpksfs:
  case Intrinsic::s390_vpksgs:
  case Intrinsic::s390_vpklsh:  // PACKLS
  case Intrinsic::s390_vpklsf:
  case Intrinsic::s390_vpklsg:
  case Intrinsic::s390_vpklshs: // PACKLS_CC
  case Intrinsic::s390_vpklsfs:
  case Intrinsic::s390_vpklsgs:
  case Intrinsic::s390_vpdi:
  case Intrinsic::s390_vsldb:
  case Intrinsic::s390_vperm:
    computeKnownBitsBinOp(Op, Known, DemandedElts, DAG, Depth, 1);
    break;
  case Intrinsic::s390_vuplhb: // VECTOR UNPACK LOGICAL HIGH
  case Intrinsic::s390_vuplhh:
  case Intrinsic::s390_vuplhf:
  case Intrinsic::s390_vupllb: // VECTOR UNPACK LOGICAL LOW
  case Intrinsic::s390_vupllh:
  case Intrinsic::s390_vupllf:
    IsLogical = true;
    LLVM_FALLTHROUGH[[clang::fallthrough]];
  case Intrinsic::s390_vuphb:  // VECTOR UNPACK HIGH
  case Intrinsic::s390_vuphh:
  case Intrinsic::s390_vuphf:
  case Intrinsic::s390_vuplb:  // VECTOR UNPACK LOW
  case Intrinsic::s390_vuplhw:
  case Intrinsic::s390_vuplf: {
    SDValue SrcOp = Op.getOperand(1);
    unsigned SrcBitWidth = SrcOp.getScalarValueSizeInBits();
    APInt SrcDemE = getDemandedSrcElements(Op, DemandedElts, 0);
    Known = DAG.computeKnownBits(SrcOp, SrcDemE, Depth + 1);
    if (IsLogical) {
      Known = Known.zext(BitWidth);
      Known.Zero.setBitsFrom(SrcBitWidth);
    } else
      Known = Known.sext(BitWidth);
    break;
  }
  default:
    break;
  }
} else {
  switch (Opcode) {
  case SystemZISD::JOIN_DWORDS:
  case SystemZISD::SELECT_CCMASK:
    computeKnownBitsBinOp(Op, Known, DemandedElts, DAG, Depth, 0);
    break;
  case SystemZISD::REPLICATE: {
    SDValue SrcOp = Op.getOperand(0);
    Known = DAG.computeKnownBits(SrcOp, Depth + 1);
    if (Known.getBitWidth() < BitWidth && isa<ConstantSDNode>(SrcOp))
      Known = Known.sext(BitWidth); // VREPI sign extends the immedate.
    break;
  }
  default:
    break;
  }
}

// Known has the width of the source operand(s). Adjust if needed to match
// the passed bitwidth.
if (Known.getBitWidth() != BitWidth)
  Known = Known.zextOrTrunc(BitWidth);
6015}

6017static unsigned computeNumSignBitsBinOp(SDValue Op, const APInt &DemandedElts,
                                      const SelectionDAG &DAG, unsigned Depth,
                                      unsigned OpNo) {
APInt Src0DemE = getDemandedSrcElements(Op, DemandedElts, OpNo);
unsigned LHS = DAG.ComputeNumSignBits(Op.getOperand(OpNo), Src0DemE, Depth + 1);
if (LHS == 1) return 1; // Early out.
APInt Src1DemE = getDemandedSrcElements(Op, DemandedElts, OpNo + 1);
unsigned RHS = DAG.ComputeNumSignBits(Op.getOperand(OpNo + 1), Src1DemE, Depth + 1);
if (RHS == 1) return 1; // Early out.
unsigned Common = std::min(LHS, RHS);
unsigned SrcBitWidth = Op.getOperand(OpNo).getScalarValueSizeInBits();
EVT VT = Op.getValueType();
unsigned VTBits = VT.getScalarSizeInBits();
if (SrcBitWidth > VTBits) { // PACK
  unsigned SrcExtraBits = SrcBitWidth - VTBits;
  if (Common > SrcExtraBits)
    return (Common - SrcExtraBits);
  return 1;
}
assert (SrcBitWidth == VTBits && "Expected operands of same bitwidth.")((SrcBitWidth == VTBits && "Expected operands of same bitwidth."
) ? static_cast<void> (0) : __assert_fail ("SrcBitWidth == VTBits && \"Expected operands of same bitwidth.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 6036, __PRETTY_FUNCTION__));
return Common;
6038}

6040unsigned
6041SystemZTargetLowering::ComputeNumSignBitsForTargetNode(
  SDValue Op, const APInt &DemandedElts, const SelectionDAG &DAG,
  unsigned Depth) const {
if (Op.getResNo() != 0)
  return 1;
unsigned Opcode = Op.getOpcode();
if (Opcode == ISD::INTRINSIC_WO_CHAIN) {
  unsigned Id = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
  switch (Id) {
  case Intrinsic::s390_vpksh:   // PACKS
  case Intrinsic::s390_vpksf:
  case Intrinsic::s390_vpksg:
  case Intrinsic::s390_vpkshs:  // PACKS_CC
  case Intrinsic::s390_vpksfs:
  case Intrinsic::s390_vpksgs:
  case Intrinsic::s390_vpklsh:  // PACKLS
  case Intrinsic::s390_vpklsf:
  case Intrinsic::s390_vpklsg:
  case Intrinsic::s390_vpklshs: // PACKLS_CC
  case Intrinsic::s390_vpklsfs:
  case Intrinsic::s390_vpklsgs:
  case Intrinsic::s390_vpdi:
  case Intrinsic::s390_vsldb:
  case Intrinsic::s390_vperm:
    return computeNumSignBitsBinOp(Op, DemandedElts, DAG, Depth, 1);
  case Intrinsic::s390_vuphb:  // VECTOR UNPACK HIGH
  case Intrinsic::s390_vuphh:
  case Intrinsic::s390_vuphf:
  case Intrinsic::s390_vuplb:  // VECTOR UNPACK LOW
  case Intrinsic::s390_vuplhw:
  case Intrinsic::s390_vuplf: {
    SDValue PackedOp = Op.getOperand(1);
    APInt SrcDemE = getDemandedSrcElements(Op, DemandedElts, 1);
    unsigned Tmp = DAG.ComputeNumSignBits(PackedOp, SrcDemE, Depth + 1);
    EVT VT = Op.getValueType();
    unsigned VTBits = VT.getScalarSizeInBits();
    Tmp += VTBits - PackedOp.getScalarValueSizeInBits();
    return Tmp;
  }
  default:
    break;
  }
} else {
  switch (Opcode) {
  case SystemZISD::SELECT_CCMASK:
    return computeNumSignBitsBinOp(Op, DemandedElts, DAG, Depth, 0);
  default:
    break;
  }
}

return 1;
6093}

6095//===----------------------------------------------------------------------===//
6096// Custom insertion
6097//===----------------------------------------------------------------------===//

6099// Create a new basic block after MBB.
6100static MachineBasicBlock *emitBlockAfter(MachineBasicBlock *MBB) {
MachineFunction &MF = *MBB->getParent();
MachineBasicBlock *NewMBB = MF.CreateMachineBasicBlock(MBB->getBasicBlock());
MF.insert(std::next(MachineFunction::iterator(MBB)), NewMBB);
return NewMBB;
6105}

6107// Split MBB after MI and return the new block (the one that contains
6108// instructions after MI).
6109static MachineBasicBlock *splitBlockAfter(MachineBasicBlock::iterator MI,
                                        MachineBasicBlock *MBB) {
MachineBasicBlock *NewMBB = emitBlockAfter(MBB);
NewMBB->splice(NewMBB->begin(), MBB,
               std::next(MachineBasicBlock::iterator(MI)), MBB->end());
NewMBB->transferSuccessorsAndUpdatePHIs(MBB);
return NewMBB;
6116}

6118// Split MBB before MI and return the new block (the one that contains MI).
6119static MachineBasicBlock *splitBlockBefore(MachineBasicBlock::iterator MI,
                                         MachineBasicBlock *MBB) {
MachineBasicBlock *NewMBB = emitBlockAfter(MBB);
NewMBB->splice(NewMBB->begin(), MBB, MI, MBB->end());
NewMBB->transferSuccessorsAndUpdatePHIs(MBB);
return NewMBB;
6125}

6127// Force base value Base into a register before MI.  Return the register.
6128static unsigned forceReg(MachineInstr &MI, MachineOperand &Base,
                       const SystemZInstrInfo *TII) {
if (Base.isReg())
  return Base.getReg();

MachineBasicBlock *MBB = MI.getParent();
MachineFunction &MF = *MBB->getParent();
MachineRegisterInfo &MRI = MF.getRegInfo();

unsigned Reg = MRI.createVirtualRegister(&SystemZ::ADDR64BitRegClass);
BuildMI(*MBB, MI, MI.getDebugLoc(), TII->get(SystemZ::LA), Reg)
    .add(Base)
    .addImm(0)
    .addReg(0);
return Reg;
6143}

6145// The CC operand of MI might be missing a kill marker because there
6146// were multiple uses of CC, and ISel didn't know which to mark.
6147// Figure out whether MI should have had a kill marker.
6148static bool checkCCKill(MachineInstr &MI, MachineBasicBlock *MBB) {
// Scan forward through BB for a use/def of CC.
MachineBasicBlock::iterator miI(std::next(MachineBasicBlock::iterator(MI)));
for (MachineBasicBlock::iterator miE = MBB->end(); miI != miE; ++miI) {
  const MachineInstr& mi = *miI;
  if (mi.readsRegister(SystemZ::CC))
    return false;
  if (mi.definesRegister(SystemZ::CC))
    break; // Should have kill-flag - update below.
}

// If we hit the end of the block, check whether CC is live into a
// successor.
if (miI == MBB->end()) {
  for (auto SI = MBB->succ_begin(), SE = MBB->succ_end(); SI != SE; ++SI)
    if ((*SI)->isLiveIn(SystemZ::CC))
      return false;
}

return true;
6168}

6170// Return true if it is OK for this Select pseudo-opcode to be cascaded
6171// together with other Select pseudo-opcodes into a single basic-block with
6172// a conditional jump around it.
6173static bool isSelectPseudo(MachineInstr &MI) {
switch (MI.getOpcode()) {
case SystemZ::Select32:
case SystemZ::Select64:
case SystemZ::SelectF32:
case SystemZ::SelectF64:
case SystemZ::SelectF128:
case SystemZ::SelectVR32:
case SystemZ::SelectVR64:
case SystemZ::SelectVR128:
  return true;

default:
  return false;
}
6188}

6190// Helper function, which inserts PHI functions into SinkMBB:
6191//   %Result(i) = phi [ %FalseValue(i), FalseMBB ], [ %TrueValue(i), TrueMBB ],
6192// where %FalseValue(i) and %TrueValue(i) are taken from the consequent Selects
6193// in [MIItBegin, MIItEnd) range.
6194static void createPHIsForSelects(MachineBasicBlock::iterator MIItBegin,
                               MachineBasicBlock::iterator MIItEnd,
                               MachineBasicBlock *TrueMBB,
                               MachineBasicBlock *FalseMBB,
                               MachineBasicBlock *SinkMBB) {
MachineFunction *MF = TrueMBB->getParent();
const TargetInstrInfo *TII = MF->getSubtarget().getInstrInfo();

unsigned CCValid = MIItBegin->getOperand(3).getImm();
unsigned CCMask = MIItBegin->getOperand(4).getImm();
DebugLoc DL = MIItBegin->getDebugLoc();

MachineBasicBlock::iterator SinkInsertionPoint = SinkMBB->begin();

// As we are creating the PHIs, we have to be careful if there is more than
// one.  Later Selects may reference the results of earlier Selects, but later
// PHIs have to reference the individual true/false inputs from earlier PHIs.
// That also means that PHI construction must work forward from earlier to
// later, and that the code must maintain a mapping from earlier PHI's
// destination registers, and the registers that went into the PHI.
DenseMap<unsigned, std::pair<unsigned, unsigned>> RegRewriteTable;

for (MachineBasicBlock::iterator MIIt = MIItBegin; MIIt != MIItEnd; ++MIIt) {
  unsigned DestReg = MIIt->getOperand(0).getReg();
  unsigned TrueReg = MIIt->getOperand(1).getReg();
  unsigned FalseReg = MIIt->getOperand(2).getReg();

  // If this Select we are generating is the opposite condition from
  // the jump we generated, then we have to swap the operands for the
  // PHI that is going to be generated.
  if (MIIt->getOperand(4).getImm() == (CCValid ^ CCMask))
    std::swap(TrueReg, FalseReg);

  if (RegRewriteTable.find(TrueReg) != RegRewriteTable.end())
    TrueReg = RegRewriteTable[TrueReg].first;

  if (RegRewriteTable.find(FalseReg) != RegRewriteTable.end())
    FalseReg = RegRewriteTable[FalseReg].second;

  BuildMI(*SinkMBB, SinkInsertionPoint, DL, TII->get(SystemZ::PHI), DestReg)
    .addReg(TrueReg).addMBB(TrueMBB)
    .addReg(FalseReg).addMBB(FalseMBB);

  // Add this PHI to the rewrite table.
  RegRewriteTable[DestReg] = std::make_pair(TrueReg, FalseReg);
}
6240}

6242// Implement EmitInstrWithCustomInserter for pseudo Select* instruction MI.
6243MachineBasicBlock *
6244SystemZTargetLowering::emitSelect(MachineInstr &MI,
                                MachineBasicBlock *MBB) const {
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());

unsigned CCValid = MI.getOperand(3).getImm();
unsigned CCMask = MI.getOperand(4).getImm();
DebugLoc DL = MI.getDebugLoc();

// If we have a sequence of Select* pseudo instructions using the
// same condition code value, we want to expand all of them into
// a single pair of basic blocks using the same condition.
MachineInstr *LastMI = &MI;
MachineBasicBlock::iterator NextMIIt =
    std::next(MachineBasicBlock::iterator(MI));

if (isSelectPseudo(MI))
  while (NextMIIt != MBB->end() && isSelectPseudo(*NextMIIt) &&
         NextMIIt->getOperand(3).getImm() == CCValid &&
         (NextMIIt->getOperand(4).getImm() == CCMask ||
          NextMIIt->getOperand(4).getImm() == (CCValid ^ CCMask))) {
    LastMI = &*NextMIIt;
    ++NextMIIt;
  }

MachineBasicBlock *StartMBB = MBB;
MachineBasicBlock *JoinMBB  = splitBlockBefore(MI, MBB);
MachineBasicBlock *FalseMBB = emitBlockAfter(StartMBB);

// Unless CC was killed in the last Select instruction, mark it as
// live-in to both FalseMBB and JoinMBB.
if (!LastMI->killsRegister(SystemZ::CC) && !checkCCKill(*LastMI, JoinMBB)) {
  FalseMBB->addLiveIn(SystemZ::CC);
  JoinMBB->addLiveIn(SystemZ::CC);
}

//  StartMBB:
//   BRC CCMask, JoinMBB
//   # fallthrough to FalseMBB
MBB = StartMBB;
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(CCValid).addImm(CCMask).addMBB(JoinMBB);
MBB->addSuccessor(JoinMBB);
MBB->addSuccessor(FalseMBB);

//  FalseMBB:
//   # fallthrough to JoinMBB
MBB = FalseMBB;
MBB->addSuccessor(JoinMBB);

//  JoinMBB:
//   %Result = phi [ %FalseReg, FalseMBB ], [ %TrueReg, StartMBB ]
//  ...
MBB = JoinMBB;
MachineBasicBlock::iterator MIItBegin = MachineBasicBlock::iterator(MI);
MachineBasicBlock::iterator MIItEnd =
    std::next(MachineBasicBlock::iterator(LastMI));
createPHIsForSelects(MIItBegin, MIItEnd, StartMBB, FalseMBB, MBB);

StartMBB->erase(MIItBegin, MIItEnd);
return JoinMBB;
6305}

6307// Implement EmitInstrWithCustomInserter for pseudo CondStore* instruction MI.
6308// StoreOpcode is the store to use and Invert says whether the store should
6309// happen when the condition is false rather than true.  If a STORE ON
6310// CONDITION is available, STOCOpcode is its opcode, otherwise it is 0.
6311MachineBasicBlock *SystemZTargetLowering::emitCondStore(MachineInstr &MI,
                                                      MachineBasicBlock *MBB,
                                                      unsigned StoreOpcode,
                                                      unsigned STOCOpcode,
                                                      bool Invert) const {
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());

unsigned SrcReg = MI.getOperand(0).getReg();
MachineOperand Base = MI.getOperand(1);
int64_t Disp = MI.getOperand(2).getImm();
unsigned IndexReg = MI.getOperand(3).getReg();
unsigned CCValid = MI.getOperand(4).getImm();
unsigned CCMask = MI.getOperand(5).getImm();
DebugLoc DL = MI.getDebugLoc();

StoreOpcode = TII->getOpcodeForOffset(StoreOpcode, Disp);

// Use STOCOpcode if possible.  We could use different store patterns in
// order to avoid matching the index register, but the performance trade-offs
// might be more complicated in that case.
if (STOCOpcode && !IndexReg && Subtarget.hasLoadStoreOnCond()) {
  if (Invert)
    CCMask ^= CCValid;

  // ISel pattern matching also adds a load memory operand of the same
  // address, so take special care to find the storing memory operand.
  MachineMemOperand *MMO = nullptr;
  for (auto *I : MI.memoperands())
    if (I->isStore()) {
        MMO = I;
        break;
      }

  BuildMI(*MBB, MI, DL, TII->get(STOCOpcode))
    .addReg(SrcReg)
    .add(Base)
    .addImm(Disp)
    .addImm(CCValid)
    .addImm(CCMask)
    .addMemOperand(MMO);

  MI.eraseFromParent();
  return MBB;
}

// Get the condition needed to branch around the store.
if (!Invert)
  CCMask ^= CCValid;

MachineBasicBlock *StartMBB = MBB;
MachineBasicBlock *JoinMBB  = splitBlockBefore(MI, MBB);
MachineBasicBlock *FalseMBB = emitBlockAfter(StartMBB);

// Unless CC was killed in the CondStore instruction, mark it as
// live-in to both FalseMBB and JoinMBB.
if (!MI.killsRegister(SystemZ::CC) && !checkCCKill(MI, JoinMBB)) {
  FalseMBB->addLiveIn(SystemZ::CC);
  JoinMBB->addLiveIn(SystemZ::CC);
}

//  StartMBB:
//   BRC CCMask, JoinMBB
//   # fallthrough to FalseMBB
MBB = StartMBB;
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(CCValid).addImm(CCMask).addMBB(JoinMBB);
MBB->addSuccessor(JoinMBB);
MBB->addSuccessor(FalseMBB);

//  FalseMBB:
//   store %SrcReg, %Disp(%Index,%Base)
//   # fallthrough to JoinMBB
MBB = FalseMBB;
BuildMI(MBB, DL, TII->get(StoreOpcode))
    .addReg(SrcReg)
    .add(Base)
    .addImm(Disp)
    .addReg(IndexReg);
MBB->addSuccessor(JoinMBB);

MI.eraseFromParent();
return JoinMBB;
6394}

6396// Implement EmitInstrWithCustomInserter for pseudo ATOMIC_LOAD{,W}_*
6397// or ATOMIC_SWAP{,W} instruction MI.  BinOpcode is the instruction that
6398// performs the binary operation elided by "*", or 0 for ATOMIC_SWAP{,W}.
6399// BitSize is the width of the field in bits, or 0 if this is a partword
6400// ATOMIC_LOADW_* or ATOMIC_SWAPW instruction, in which case the bitsize
6401// is one of the operands.  Invert says whether the field should be
6402// inverted after performing BinOpcode (e.g. for NAND).
6403MachineBasicBlock *SystemZTargetLowering::emitAtomicLoadBinary(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned BinOpcode,
  unsigned BitSize, bool Invert) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
bool IsSubWord = (BitSize < 32);

// Extract the operands.  Base can be a register or a frame index.
// Src2 can be a register or immediate.
unsigned Dest = MI.getOperand(0).getReg();
MachineOperand Base = earlyUseOperand(MI.getOperand(1));
int64_t Disp = MI.getOperand(2).getImm();
MachineOperand Src2 = earlyUseOperand(MI.getOperand(3));
unsigned BitShift = (IsSubWord ? MI.getOperand(4).getReg() : 0);
unsigned NegBitShift = (IsSubWord ? MI.getOperand(5).getReg() : 0);
DebugLoc DL = MI.getDebugLoc();
if (IsSubWord)
  BitSize = MI.getOperand(6).getImm();

// Subword operations use 32-bit registers.
const TargetRegisterClass *RC = (BitSize <= 32 ?
                                 &SystemZ::GR32BitRegClass :
                                 &SystemZ::GR64BitRegClass);
unsigned LOpcode  = BitSize <= 32 ? SystemZ::L  : SystemZ::LG;
unsigned CSOpcode = BitSize <= 32 ? SystemZ::CS : SystemZ::CSG;

// Get the right opcodes for the displacement.
LOpcode  = TII->getOpcodeForOffset(LOpcode,  Disp);
CSOpcode = TII->getOpcodeForOffset(CSOpcode, Disp);
assert(LOpcode && CSOpcode && "Displacement out of range")((LOpcode && CSOpcode && "Displacement out of range"
) ? static_cast<void> (0) : __assert_fail ("LOpcode && CSOpcode && \"Displacement out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 6434, __PRETTY_FUNCTION__));

// Create virtual registers for temporary results.
unsigned OrigVal       = MRI.createVirtualRegister(RC);
unsigned OldVal        = MRI.createVirtualRegister(RC);
unsigned NewVal        = (BinOpcode || IsSubWord ?
                          MRI.createVirtualRegister(RC) : Src2.getReg());
unsigned RotatedOldVal = (IsSubWord ? MRI.createVirtualRegister(RC) : OldVal);
unsigned RotatedNewVal = (IsSubWord ? MRI.createVirtualRegister(RC) : NewVal);

// Insert a basic block for the main loop.
MachineBasicBlock *StartMBB = MBB;
MachineBasicBlock *DoneMBB  = splitBlockBefore(MI, MBB);
MachineBasicBlock *LoopMBB  = emitBlockAfter(StartMBB);

//  StartMBB:
//   ...
//   %OrigVal = L Disp(%Base)
//   # fall through to LoopMMB
MBB = StartMBB;
BuildMI(MBB, DL, TII->get(LOpcode), OrigVal).add(Base).addImm(Disp).addReg(0);
MBB->addSuccessor(LoopMBB);

//  LoopMBB:
//   %OldVal        = phi [ %OrigVal, StartMBB ], [ %Dest, LoopMBB ]
//   %RotatedOldVal = RLL %OldVal, 0(%BitShift)
//   %RotatedNewVal = OP %RotatedOldVal, %Src2
//   %NewVal        = RLL %RotatedNewVal, 0(%NegBitShift)
//   %Dest          = CS %OldVal, %NewVal, Disp(%Base)
//   JNE LoopMBB
//   # fall through to DoneMMB
MBB = LoopMBB;
BuildMI(MBB, DL, TII->get(SystemZ::PHI), OldVal)
  .addReg(OrigVal).addMBB(StartMBB)
  .addReg(Dest).addMBB(LoopMBB);
if (IsSubWord)
  BuildMI(MBB, DL, TII->get(SystemZ::RLL), RotatedOldVal)
    .addReg(OldVal).addReg(BitShift).addImm(0);
if (Invert) {
  // Perform the operation normally and then invert every bit of the field.
  unsigned Tmp = MRI.createVirtualRegister(RC);
  BuildMI(MBB, DL, TII->get(BinOpcode), Tmp).addReg(RotatedOldVal).add(Src2);
  if (BitSize <= 32)
    // XILF with the upper BitSize bits set.
    BuildMI(MBB, DL, TII->get(SystemZ::XILF), RotatedNewVal)
      .addReg(Tmp).addImm(-1U << (32 - BitSize));
  else {
    // Use LCGR and add -1 to the result, which is more compact than
    // an XILF, XILH pair.
    unsigned Tmp2 = MRI.createVirtualRegister(RC);
    BuildMI(MBB, DL, TII->get(SystemZ::LCGR), Tmp2).addReg(Tmp);
    BuildMI(MBB, DL, TII->get(SystemZ::AGHI), RotatedNewVal)
      .addReg(Tmp2).addImm(-1);
  }
} else if (BinOpcode)
  // A simply binary operation.
  BuildMI(MBB, DL, TII->get(BinOpcode), RotatedNewVal)
      .addReg(RotatedOldVal)
      .add(Src2);
else if (IsSubWord)
  // Use RISBG to rotate Src2 into position and use it to replace the
  // field in RotatedOldVal.
  BuildMI(MBB, DL, TII->get(SystemZ::RISBG32), RotatedNewVal)
    .addReg(RotatedOldVal).addReg(Src2.getReg())
    .addImm(32).addImm(31 + BitSize).addImm(32 - BitSize);
if (IsSubWord)
  BuildMI(MBB, DL, TII->get(SystemZ::RLL), NewVal)
    .addReg(RotatedNewVal).addReg(NegBitShift).addImm(0);
BuildMI(MBB, DL, TII->get(CSOpcode), Dest)
    .addReg(OldVal)
    .addReg(NewVal)
    .add(Base)
    .addImm(Disp);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_CS).addImm(SystemZ::CCMASK_CS_NE).addMBB(LoopMBB);
MBB->addSuccessor(LoopMBB);
MBB->addSuccessor(DoneMBB);

MI.eraseFromParent();
return DoneMBB;
6514}

6516// Implement EmitInstrWithCustomInserter for pseudo
6517// ATOMIC_LOAD{,W}_{,U}{MIN,MAX} instruction MI.  CompareOpcode is the
6518// instruction that should be used to compare the current field with the
6519// minimum or maximum value.  KeepOldMask is the BRC condition-code mask
6520// for when the current field should be kept.  BitSize is the width of
6521// the field in bits, or 0 if this is a partword ATOMIC_LOADW_* instruction.
6522MachineBasicBlock *SystemZTargetLowering::emitAtomicLoadMinMax(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned CompareOpcode,
  unsigned KeepOldMask, unsigned BitSize) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
bool IsSubWord = (BitSize < 32);

// Extract the operands.  Base can be a register or a frame index.
unsigned Dest = MI.getOperand(0).getReg();
MachineOperand Base = earlyUseOperand(MI.getOperand(1));
int64_t Disp = MI.getOperand(2).getImm();
unsigned Src2 = MI.getOperand(3).getReg();
unsigned BitShift = (IsSubWord ? MI.getOperand(4).getReg() : 0);
unsigned NegBitShift = (IsSubWord ? MI.getOperand(5).getReg() : 0);
DebugLoc DL = MI.getDebugLoc();
if (IsSubWord)
  BitSize = MI.getOperand(6).getImm();

// Subword operations use 32-bit registers.
const TargetRegisterClass *RC = (BitSize <= 32 ?
                                 &SystemZ::GR32BitRegClass :
                                 &SystemZ::GR64BitRegClass);
unsigned LOpcode  = BitSize <= 32 ? SystemZ::L  : SystemZ::LG;
unsigned CSOpcode = BitSize <= 32 ? SystemZ::CS : SystemZ::CSG;

// Get the right opcodes for the displacement.
LOpcode  = TII->getOpcodeForOffset(LOpcode,  Disp);
CSOpcode = TII->getOpcodeForOffset(CSOpcode, Disp);
assert(LOpcode && CSOpcode && "Displacement out of range")((LOpcode && CSOpcode && "Displacement out of range"
) ? static_cast<void> (0) : __assert_fail ("LOpcode && CSOpcode && \"Displacement out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 6552, __PRETTY_FUNCTION__));

// Create virtual registers for temporary results.
unsigned OrigVal       = MRI.createVirtualRegister(RC);
unsigned OldVal        = MRI.createVirtualRegister(RC);
unsigned NewVal        = MRI.createVirtualRegister(RC);
unsigned RotatedOldVal = (IsSubWord ? MRI.createVirtualRegister(RC) : OldVal);
unsigned RotatedAltVal = (IsSubWord ? MRI.createVirtualRegister(RC) : Src2);
unsigned RotatedNewVal = (IsSubWord ? MRI.createVirtualRegister(RC) : NewVal);

// Insert 3 basic blocks for the loop.
MachineBasicBlock *StartMBB  = MBB;
MachineBasicBlock *DoneMBB   = splitBlockBefore(MI, MBB);
MachineBasicBlock *LoopMBB   = emitBlockAfter(StartMBB);
MachineBasicBlock *UseAltMBB = emitBlockAfter(LoopMBB);
MachineBasicBlock *UpdateMBB = emitBlockAfter(UseAltMBB);

//  StartMBB:
//   ...
//   %OrigVal     = L Disp(%Base)
//   # fall through to LoopMMB
MBB = StartMBB;
BuildMI(MBB, DL, TII->get(LOpcode), OrigVal).add(Base).addImm(Disp).addReg(0);
MBB->addSuccessor(LoopMBB);

//  LoopMBB:
//   %OldVal        = phi [ %OrigVal, StartMBB ], [ %Dest, UpdateMBB ]
//   %RotatedOldVal = RLL %OldVal, 0(%BitShift)
//   CompareOpcode %RotatedOldVal, %Src2
//   BRC KeepOldMask, UpdateMBB
MBB = LoopMBB;
BuildMI(MBB, DL, TII->get(SystemZ::PHI), OldVal)
  .addReg(OrigVal).addMBB(StartMBB)
  .addReg(Dest).addMBB(UpdateMBB);
if (IsSubWord)
  BuildMI(MBB, DL, TII->get(SystemZ::RLL), RotatedOldVal)
    .addReg(OldVal).addReg(BitShift).addImm(0);
BuildMI(MBB, DL, TII->get(CompareOpcode))
  .addReg(RotatedOldVal).addReg(Src2);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_ICMP).addImm(KeepOldMask).addMBB(UpdateMBB);
MBB->addSuccessor(UpdateMBB);
MBB->addSuccessor(UseAltMBB);

//  UseAltMBB:
//   %RotatedAltVal = RISBG %RotatedOldVal, %Src2, 32, 31 + BitSize, 0
//   # fall through to UpdateMMB
MBB = UseAltMBB;
if (IsSubWord)
  BuildMI(MBB, DL, TII->get(SystemZ::RISBG32), RotatedAltVal)
    .addReg(RotatedOldVal).addReg(Src2)
    .addImm(32).addImm(31 + BitSize).addImm(0);
MBB->addSuccessor(UpdateMBB);

//  UpdateMBB:
//   %RotatedNewVal = PHI [ %RotatedOldVal, LoopMBB ],
//                        [ %RotatedAltVal, UseAltMBB ]
//   %NewVal        = RLL %RotatedNewVal, 0(%NegBitShift)
//   %Dest          = CS %OldVal, %NewVal, Disp(%Base)
//   JNE LoopMBB
//   # fall through to DoneMMB
MBB = UpdateMBB;
BuildMI(MBB, DL, TII->get(SystemZ::PHI), RotatedNewVal)
  .addReg(RotatedOldVal).addMBB(LoopMBB)
  .addReg(RotatedAltVal).addMBB(UseAltMBB);
if (IsSubWord)
  BuildMI(MBB, DL, TII->get(SystemZ::RLL), NewVal)
    .addReg(RotatedNewVal).addReg(NegBitShift).addImm(0);
BuildMI(MBB, DL, TII->get(CSOpcode), Dest)
    .addReg(OldVal)
    .addReg(NewVal)
    .add(Base)
    .addImm(Disp);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_CS).addImm(SystemZ::CCMASK_CS_NE).addMBB(LoopMBB);
MBB->addSuccessor(LoopMBB);
MBB->addSuccessor(DoneMBB);

MI.eraseFromParent();
return DoneMBB;
6632}

6634// Implement EmitInstrWithCustomInserter for pseudo ATOMIC_CMP_SWAPW
6635// instruction MI.
6636MachineBasicBlock *
6637SystemZTargetLowering::emitAtomicCmpSwapW(MachineInstr &MI,
                                        MachineBasicBlock *MBB) const {

MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();

// Extract the operands.  Base can be a register or a frame index.
unsigned Dest = MI.getOperand(0).getReg();
MachineOperand Base = earlyUseOperand(MI.getOperand(1));
int64_t Disp = MI.getOperand(2).getImm();
unsigned OrigCmpVal = MI.getOperand(3).getReg();
unsigned OrigSwapVal = MI.getOperand(4).getReg();
unsigned BitShift = MI.getOperand(5).getReg();
unsigned NegBitShift = MI.getOperand(6).getReg();
int64_t BitSize = MI.getOperand(7).getImm();
DebugLoc DL = MI.getDebugLoc();

const TargetRegisterClass *RC = &SystemZ::GR32BitRegClass;

// Get the right opcodes for the displacement.
unsigned LOpcode  = TII->getOpcodeForOffset(SystemZ::L,  Disp);
unsigned CSOpcode = TII->getOpcodeForOffset(SystemZ::CS, Disp);
assert(LOpcode && CSOpcode && "Displacement out of range")((LOpcode && CSOpcode && "Displacement out of range"
) ? static_cast<void> (0) : __assert_fail ("LOpcode && CSOpcode && \"Displacement out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 6661, __PRETTY_FUNCTION__));

// Create virtual registers for temporary results.
unsigned OrigOldVal   = MRI.createVirtualRegister(RC);
unsigned OldVal       = MRI.createVirtualRegister(RC);
unsigned CmpVal       = MRI.createVirtualRegister(RC);
unsigned SwapVal      = MRI.createVirtualRegister(RC);
unsigned StoreVal     = MRI.createVirtualRegister(RC);
unsigned RetryOldVal  = MRI.createVirtualRegister(RC);
unsigned RetryCmpVal  = MRI.createVirtualRegister(RC);
unsigned RetrySwapVal = MRI.createVirtualRegister(RC);

// Insert 2 basic blocks for the loop.
MachineBasicBlock *StartMBB = MBB;
MachineBasicBlock *DoneMBB  = splitBlockBefore(MI, MBB);
MachineBasicBlock *LoopMBB  = emitBlockAfter(StartMBB);
MachineBasicBlock *SetMBB   = emitBlockAfter(LoopMBB);

//  StartMBB:
//   ...
//   %OrigOldVal     = L Disp(%Base)
//   # fall through to LoopMMB
MBB = StartMBB;
BuildMI(MBB, DL, TII->get(LOpcode), OrigOldVal)
    .add(Base)
    .addImm(Disp)
    .addReg(0);
MBB->addSuccessor(LoopMBB);

//  LoopMBB:
//   %OldVal        = phi [ %OrigOldVal, EntryBB ], [ %RetryOldVal, SetMBB ]
//   %CmpVal        = phi [ %OrigCmpVal, EntryBB ], [ %RetryCmpVal, SetMBB ]
//   %SwapVal       = phi [ %OrigSwapVal, EntryBB ], [ %RetrySwapVal, SetMBB ]
//   %Dest          = RLL %OldVal, BitSize(%BitShift)
//                      ^^ The low BitSize bits contain the field
//                         of interest.
//   %RetryCmpVal   = RISBG32 %CmpVal, %Dest, 32, 63-BitSize, 0
//                      ^^ Replace the upper 32-BitSize bits of the
//                         comparison value with those that we loaded,
//                         so that we can use a full word comparison.
//   CR %Dest, %RetryCmpVal
//   JNE DoneMBB
//   # Fall through to SetMBB
MBB = LoopMBB;
BuildMI(MBB, DL, TII->get(SystemZ::PHI), OldVal)
  .addReg(OrigOldVal).addMBB(StartMBB)
  .addReg(RetryOldVal).addMBB(SetMBB);
BuildMI(MBB, DL, TII->get(SystemZ::PHI), CmpVal)
  .addReg(OrigCmpVal).addMBB(StartMBB)
  .addReg(RetryCmpVal).addMBB(SetMBB);
BuildMI(MBB, DL, TII->get(SystemZ::PHI), SwapVal)
  .addReg(OrigSwapVal).addMBB(StartMBB)
  .addReg(RetrySwapVal).addMBB(SetMBB);
BuildMI(MBB, DL, TII->get(SystemZ::RLL), Dest)
  .addReg(OldVal).addReg(BitShift).addImm(BitSize);
BuildMI(MBB, DL, TII->get(SystemZ::RISBG32), RetryCmpVal)
  .addReg(CmpVal).addReg(Dest).addImm(32).addImm(63 - BitSize).addImm(0);
BuildMI(MBB, DL, TII->get(SystemZ::CR))
  .addReg(Dest).addReg(RetryCmpVal);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_ICMP)
  .addImm(SystemZ::CCMASK_CMP_NE).addMBB(DoneMBB);
MBB->addSuccessor(DoneMBB);
MBB->addSuccessor(SetMBB);

//  SetMBB:
//   %RetrySwapVal = RISBG32 %SwapVal, %Dest, 32, 63-BitSize, 0
//                      ^^ Replace the upper 32-BitSize bits of the new
//                         value with those that we loaded.
//   %StoreVal    = RLL %RetrySwapVal, -BitSize(%NegBitShift)
//                      ^^ Rotate the new field to its proper position.
//   %RetryOldVal = CS %Dest, %StoreVal, Disp(%Base)
//   JNE LoopMBB
//   # fall through to ExitMMB
MBB = SetMBB;
BuildMI(MBB, DL, TII->get(SystemZ::RISBG32), RetrySwapVal)
  .addReg(SwapVal).addReg(Dest).addImm(32).addImm(63 - BitSize).addImm(0);
BuildMI(MBB, DL, TII->get(SystemZ::RLL), StoreVal)
  .addReg(RetrySwapVal).addReg(NegBitShift).addImm(-BitSize);
BuildMI(MBB, DL, TII->get(CSOpcode), RetryOldVal)
    .addReg(OldVal)
    .addReg(StoreVal)
    .add(Base)
    .addImm(Disp);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_CS).addImm(SystemZ::CCMASK_CS_NE).addMBB(LoopMBB);
MBB->addSuccessor(LoopMBB);
MBB->addSuccessor(DoneMBB);

// If the CC def wasn't dead in the ATOMIC_CMP_SWAPW, mark CC as live-in
// to the block after the loop.  At this point, CC may have been defined
// either by the CR in LoopMBB or by the CS in SetMBB.
if (!MI.registerDefIsDead(SystemZ::CC))
  DoneMBB->addLiveIn(SystemZ::CC);

MI.eraseFromParent();
return DoneMBB;
6758}

6760// Emit a move from two GR64s to a GR128.
6761MachineBasicBlock *
6762SystemZTargetLowering::emitPair128(MachineInstr &MI,
                                 MachineBasicBlock *MBB) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
DebugLoc DL = MI.getDebugLoc();

unsigned Dest = MI.getOperand(0).getReg();
unsigned Hi = MI.getOperand(1).getReg();
unsigned Lo = MI.getOperand(2).getReg();
unsigned Tmp1 = MRI.createVirtualRegister(&SystemZ::GR128BitRegClass);
unsigned Tmp2 = MRI.createVirtualRegister(&SystemZ::GR128BitRegClass);

BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::IMPLICIT_DEF), Tmp1);
BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::INSERT_SUBREG), Tmp2)
  .addReg(Tmp1).addReg(Hi).addImm(SystemZ::subreg_h64);
BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::INSERT_SUBREG), Dest)
  .addReg(Tmp2).addReg(Lo).addImm(SystemZ::subreg_l64);

MI.eraseFromParent();
return MBB;
6784}

6786// Emit an extension from a GR64 to a GR128.  ClearEven is true
6787// if the high register of the GR128 value must be cleared or false if
6788// it's "don't care".
6789MachineBasicBlock *SystemZTargetLowering::emitExt128(MachineInstr &MI,
                                                   MachineBasicBlock *MBB,
                                                   bool ClearEven) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
DebugLoc DL = MI.getDebugLoc();

unsigned Dest = MI.getOperand(0).getReg();
unsigned Src = MI.getOperand(1).getReg();
unsigned In128 = MRI.createVirtualRegister(&SystemZ::GR128BitRegClass);

BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::IMPLICIT_DEF), In128);
if (ClearEven) {
  unsigned NewIn128 = MRI.createVirtualRegister(&SystemZ::GR128BitRegClass);
  unsigned Zero64   = MRI.createVirtualRegister(&SystemZ::GR64BitRegClass);

  BuildMI(*MBB, MI, DL, TII->get(SystemZ::LLILL), Zero64)
    .addImm(0);
  BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::INSERT_SUBREG), NewIn128)
    .addReg(In128).addReg(Zero64).addImm(SystemZ::subreg_h64);
  In128 = NewIn128;
}
BuildMI(*MBB, MI, DL, TII->get(TargetOpcode::INSERT_SUBREG), Dest)
  .addReg(In128).addReg(Src).addImm(SystemZ::subreg_l64);

MI.eraseFromParent();
return MBB;
6818}

6820MachineBasicBlock *SystemZTargetLowering::emitMemMemWrapper(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned Opcode) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
DebugLoc DL = MI.getDebugLoc();

MachineOperand DestBase = earlyUseOperand(MI.getOperand(0));
uint64_t DestDisp = MI.getOperand(1).getImm();
MachineOperand SrcBase = earlyUseOperand(MI.getOperand(2));
uint64_t SrcDisp = MI.getOperand(3).getImm();
uint64_t Length = MI.getOperand(4).getImm();

// When generating more than one CLC, all but the last will need to
// branch to the end when a difference is found.
MachineBasicBlock *EndMBB = (Length > 256 && Opcode == SystemZ::CLC ?
                             splitBlockAfter(MI, MBB) : nullptr);

// Check for the loop form, in which operand 5 is the trip count.
if (MI.getNumExplicitOperands() > 5) {
  bool HaveSingleBase = DestBase.isIdenticalTo(SrcBase);

  uint64_t StartCountReg = MI.getOperand(5).getReg();
  uint64_t StartSrcReg   = forceReg(MI, SrcBase, TII);
  uint64_t StartDestReg  = (HaveSingleBase ? StartSrcReg :
                            forceReg(MI, DestBase, TII));

  const TargetRegisterClass *RC = &SystemZ::ADDR64BitRegClass;
  uint64_t ThisSrcReg  = MRI.createVirtualRegister(RC);
  uint64_t ThisDestReg = (HaveSingleBase ? ThisSrcReg :
                          MRI.createVirtualRegister(RC));
  uint64_t NextSrcReg  = MRI.createVirtualRegister(RC);
  uint64_t NextDestReg = (HaveSingleBase ? NextSrcReg :
                          MRI.createVirtualRegister(RC));

  RC = &SystemZ::GR64BitRegClass;
  uint64_t ThisCountReg = MRI.createVirtualRegister(RC);
  uint64_t NextCountReg = MRI.createVirtualRegister(RC);

  MachineBasicBlock *StartMBB = MBB;
  MachineBasicBlock *DoneMBB = splitBlockBefore(MI, MBB);
  MachineBasicBlock *LoopMBB = emitBlockAfter(StartMBB);
  MachineBasicBlock *NextMBB = (EndMBB ? emitBlockAfter(LoopMBB) : LoopMBB);

  //  StartMBB:
  //   # fall through to LoopMMB
  MBB->addSuccessor(LoopMBB);

  //  LoopMBB:
  //   %ThisDestReg = phi [ %StartDestReg, StartMBB ],
  //                      [ %NextDestReg, NextMBB ]
  //   %ThisSrcReg = phi [ %StartSrcReg, StartMBB ],
  //                     [ %NextSrcReg, NextMBB ]
  //   %ThisCountReg = phi [ %StartCountReg, StartMBB ],
  //                       [ %NextCountReg, NextMBB ]
  //   ( PFD 2, 768+DestDisp(%ThisDestReg) )
  //   Opcode DestDisp(256,%ThisDestReg), SrcDisp(%ThisSrcReg)
  //   ( JLH EndMBB )
  //
  // The prefetch is used only for MVC.  The JLH is used only for CLC.
  MBB = LoopMBB;

  BuildMI(MBB, DL, TII->get(SystemZ::PHI), ThisDestReg)
    .addReg(StartDestReg).addMBB(StartMBB)
    .addReg(NextDestReg).addMBB(NextMBB);
  if (!HaveSingleBase)
    BuildMI(MBB, DL, TII->get(SystemZ::PHI), ThisSrcReg)
      .addReg(StartSrcReg).addMBB(StartMBB)
      .addReg(NextSrcReg).addMBB(NextMBB);
  BuildMI(MBB, DL, TII->get(SystemZ::PHI), ThisCountReg)
    .addReg(StartCountReg).addMBB(StartMBB)
    .addReg(NextCountReg).addMBB(NextMBB);
  if (Opcode == SystemZ::MVC)
    BuildMI(MBB, DL, TII->get(SystemZ::PFD))
      .addImm(SystemZ::PFD_WRITE)
      .addReg(ThisDestReg).addImm(DestDisp + 768).addReg(0);
  BuildMI(MBB, DL, TII->get(Opcode))
    .addReg(ThisDestReg).addImm(DestDisp).addImm(256)
    .addReg(ThisSrcReg).addImm(SrcDisp);
  if (EndMBB) {
    BuildMI(MBB, DL, TII->get(SystemZ::BRC))
      .addImm(SystemZ::CCMASK_ICMP).addImm(SystemZ::CCMASK_CMP_NE)
      .addMBB(EndMBB);
    MBB->addSuccessor(EndMBB);
    MBB->addSuccessor(NextMBB);
  }

  // NextMBB:
  //   %NextDestReg = LA 256(%ThisDestReg)
  //   %NextSrcReg = LA 256(%ThisSrcReg)
  //   %NextCountReg = AGHI %ThisCountReg, -1
  //   CGHI %NextCountReg, 0
  //   JLH LoopMBB
  //   # fall through to DoneMMB
  //
  // The AGHI, CGHI and JLH should be converted to BRCTG by later passes.
  MBB = NextMBB;

  BuildMI(MBB, DL, TII->get(SystemZ::LA), NextDestReg)
    .addReg(ThisDestReg).addImm(256).addReg(0);
  if (!HaveSingleBase)
    BuildMI(MBB, DL, TII->get(SystemZ::LA), NextSrcReg)
      .addReg(ThisSrcReg).addImm(256).addReg(0);
  BuildMI(MBB, DL, TII->get(SystemZ::AGHI), NextCountReg)
    .addReg(ThisCountReg).addImm(-1);
  BuildMI(MBB, DL, TII->get(SystemZ::CGHI))
    .addReg(NextCountReg).addImm(0);
  BuildMI(MBB, DL, TII->get(SystemZ::BRC))
    .addImm(SystemZ::CCMASK_ICMP).addImm(SystemZ::CCMASK_CMP_NE)
    .addMBB(LoopMBB);
  MBB->addSuccessor(LoopMBB);
  MBB->addSuccessor(DoneMBB);

  DestBase = MachineOperand::CreateReg(NextDestReg, false);
  SrcBase = MachineOperand::CreateReg(NextSrcReg, false);
  Length &= 255;
  if (EndMBB && !Length)
    // If the loop handled the whole CLC range, DoneMBB will be empty with
    // CC live-through into EndMBB, so add it as live-in.
    DoneMBB->addLiveIn(SystemZ::CC);
  MBB = DoneMBB;
}
// Handle any remaining bytes with straight-line code.
while (Length > 0) {
  uint64_t ThisLength = std::min(Length, uint64_t(256));
  // The previous iteration might have created out-of-range displacements.
  // Apply them using LAY if so.
  if (!isUInt<12>(DestDisp)) {
    unsigned Reg = MRI.createVirtualRegister(&SystemZ::ADDR64BitRegClass);
    BuildMI(*MBB, MI, MI.getDebugLoc(), TII->get(SystemZ::LAY), Reg)
        .add(DestBase)
        .addImm(DestDisp)
        .addReg(0);
    DestBase = MachineOperand::CreateReg(Reg, false);
    DestDisp = 0;
  }
  if (!isUInt<12>(SrcDisp)) {
    unsigned Reg = MRI.createVirtualRegister(&SystemZ::ADDR64BitRegClass);
    BuildMI(*MBB, MI, MI.getDebugLoc(), TII->get(SystemZ::LAY), Reg)
        .add(SrcBase)
        .addImm(SrcDisp)
        .addReg(0);
    SrcBase = MachineOperand::CreateReg(Reg, false);
    SrcDisp = 0;
  }
  BuildMI(*MBB, MI, DL, TII->get(Opcode))
      .add(DestBase)
      .addImm(DestDisp)
      .addImm(ThisLength)
      .add(SrcBase)
      .addImm(SrcDisp)
      .setMemRefs(MI.memoperands());
  DestDisp += ThisLength;
  SrcDisp += ThisLength;
  Length -= ThisLength;
  // If there's another CLC to go, branch to the end if a difference
  // was found.
  if (EndMBB && Length > 0) {
    MachineBasicBlock *NextMBB = splitBlockBefore(MI, MBB);
    BuildMI(MBB, DL, TII->get(SystemZ::BRC))
      .addImm(SystemZ::CCMASK_ICMP).addImm(SystemZ::CCMASK_CMP_NE)
      .addMBB(EndMBB);
    MBB->addSuccessor(EndMBB);
    MBB->addSuccessor(NextMBB);
    MBB = NextMBB;
  }
}
if (EndMBB) {
  MBB->addSuccessor(EndMBB);
  MBB = EndMBB;
  MBB->addLiveIn(SystemZ::CC);
}

MI.eraseFromParent();
return MBB;
6996}

6998// Decompose string pseudo-instruction MI into a loop that continually performs
6999// Opcode until CC != 3.
7000MachineBasicBlock *SystemZTargetLowering::emitStringWrapper(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned Opcode) const {
MachineFunction &MF = *MBB->getParent();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
MachineRegisterInfo &MRI = MF.getRegInfo();
DebugLoc DL = MI.getDebugLoc();

uint64_t End1Reg = MI.getOperand(0).getReg();
uint64_t Start1Reg = MI.getOperand(1).getReg();
uint64_t Start2Reg = MI.getOperand(2).getReg();
uint64_t CharReg = MI.getOperand(3).getReg();

const TargetRegisterClass *RC = &SystemZ::GR64BitRegClass;
uint64_t This1Reg = MRI.createVirtualRegister(RC);
uint64_t This2Reg = MRI.createVirtualRegister(RC);
uint64_t End2Reg  = MRI.createVirtualRegister(RC);

MachineBasicBlock *StartMBB = MBB;
MachineBasicBlock *DoneMBB = splitBlockBefore(MI, MBB);
MachineBasicBlock *LoopMBB = emitBlockAfter(StartMBB);

//  StartMBB:
//   # fall through to LoopMMB
MBB->addSuccessor(LoopMBB);

//  LoopMBB:
//   %This1Reg = phi [ %Start1Reg, StartMBB ], [ %End1Reg, LoopMBB ]
//   %This2Reg = phi [ %Start2Reg, StartMBB ], [ %End2Reg, LoopMBB ]
//   R0L = %CharReg
//   %End1Reg, %End2Reg = CLST %This1Reg, %This2Reg -- uses R0L
//   JO LoopMBB
//   # fall through to DoneMMB
//
// The load of R0L can be hoisted by post-RA LICM.
MBB = LoopMBB;

BuildMI(MBB, DL, TII->get(SystemZ::PHI), This1Reg)
  .addReg(Start1Reg).addMBB(StartMBB)
  .addReg(End1Reg).addMBB(LoopMBB);
BuildMI(MBB, DL, TII->get(SystemZ::PHI), This2Reg)
  .addReg(Start2Reg).addMBB(StartMBB)
  .addReg(End2Reg).addMBB(LoopMBB);
BuildMI(MBB, DL, TII->get(TargetOpcode::COPY), SystemZ::R0L).addReg(CharReg);
BuildMI(MBB, DL, TII->get(Opcode))
  .addReg(End1Reg, RegState::Define).addReg(End2Reg, RegState::Define)
  .addReg(This1Reg).addReg(This2Reg);
BuildMI(MBB, DL, TII->get(SystemZ::BRC))
  .addImm(SystemZ::CCMASK_ANY).addImm(SystemZ::CCMASK_3).addMBB(LoopMBB);
MBB->addSuccessor(LoopMBB);
MBB->addSuccessor(DoneMBB);

DoneMBB->addLiveIn(SystemZ::CC);

MI.eraseFromParent();
return DoneMBB;
7056}

7058// Update TBEGIN instruction with final opcode and register clobbers.
7059MachineBasicBlock *SystemZTargetLowering::emitTransactionBegin(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned Opcode,
  bool NoFloat) const {
MachineFunction &MF = *MBB->getParent();
const TargetFrameLowering *TFI = Subtarget.getFrameLowering();
const SystemZInstrInfo *TII = Subtarget.getInstrInfo();

// Update opcode.
MI.setDesc(TII->get(Opcode));

// We cannot handle a TBEGIN that clobbers the stack or frame pointer.
// Make sure to add the corresponding GRSM bits if they are missing.
uint64_t Control = MI.getOperand(2).getImm();
static const unsigned GPRControlBit[16] = {
  0x8000, 0x8000, 0x4000, 0x4000, 0x2000, 0x2000, 0x1000, 0x1000,
  0x0800, 0x0800, 0x0400, 0x0400, 0x0200, 0x0200, 0x0100, 0x0100
};
Control |= GPRControlBit[15];
if (TFI->hasFP(MF))
  Control |= GPRControlBit[11];
MI.getOperand(2).setImm(Control);

// Add GPR clobbers.
for (int I = 0; I < 16; I++) {
  if ((Control & GPRControlBit[I]) == 0) {
    unsigned Reg = SystemZMC::GR64Regs[I];
    MI.addOperand(MachineOperand::CreateReg(Reg, true, true));
  }
}

// Add FPR/VR clobbers.
if (!NoFloat && (Control & 4) != 0) {
  if (Subtarget.hasVector()) {
    for (int I = 0; I < 32; I++) {
      unsigned Reg = SystemZMC::VR128Regs[I];
      MI.addOperand(MachineOperand::CreateReg(Reg, true, true));
    }
  } else {
    for (int I = 0; I < 16; I++) {
      unsigned Reg = SystemZMC::FP64Regs[I];
      MI.addOperand(MachineOperand::CreateReg(Reg, true, true));
    }
  }
}

return MBB;
7105}

7107MachineBasicBlock *SystemZTargetLowering::emitLoadAndTestCmp0(
  MachineInstr &MI, MachineBasicBlock *MBB, unsigned Opcode) const {
MachineFunction &MF = *MBB->getParent();
MachineRegisterInfo *MRI = &MF.getRegInfo();
const SystemZInstrInfo *TII =
    static_cast<const SystemZInstrInfo *>(Subtarget.getInstrInfo());
DebugLoc DL = MI.getDebugLoc();

unsigned SrcReg = MI.getOperand(0).getReg();

// Create new virtual register of the same class as source.
const TargetRegisterClass *RC = MRI->getRegClass(SrcReg);
unsigned DstReg = MRI->createVirtualRegister(RC);

// Replace pseudo with a normal load-and-test that models the def as
// well.
BuildMI(*MBB, MI, DL, TII->get(Opcode), DstReg)
  .addReg(SrcReg);
MI.eraseFromParent();

return MBB;
7128}

7130MachineBasicBlock *SystemZTargetLowering::EmitInstrWithCustomInserter(
  MachineInstr &MI, MachineBasicBlock *MBB) const {
switch (MI.getOpcode()) {
case SystemZ::Select32:
case SystemZ::Select64:
case SystemZ::SelectF32:
case SystemZ::SelectF64:
case SystemZ::SelectF128:
case SystemZ::SelectVR32:
case SystemZ::SelectVR64:
case SystemZ::SelectVR128:
  return emitSelect(MI, MBB);

case SystemZ::CondStore8Mux:
  return emitCondStore(MI, MBB, SystemZ::STCMux, 0, false);
case SystemZ::CondStore8MuxInv:
  return emitCondStore(MI, MBB, SystemZ::STCMux, 0, true);
case SystemZ::CondStore16Mux:
  return emitCondStore(MI, MBB, SystemZ::STHMux, 0, false);
case SystemZ::CondStore16MuxInv:
  return emitCondStore(MI, MBB, SystemZ::STHMux, 0, true);
case SystemZ::CondStore32Mux:
  return emitCondStore(MI, MBB, SystemZ::STMux, SystemZ::STOCMux, false);
case SystemZ::CondStore32MuxInv:
  return emitCondStore(MI, MBB, SystemZ::STMux, SystemZ::STOCMux, true);
case SystemZ::CondStore8:
  return emitCondStore(MI, MBB, SystemZ::STC, 0, false);
case SystemZ::CondStore8Inv:
  return emitCondStore(MI, MBB, SystemZ::STC, 0, true);
case SystemZ::CondStore16:
  return emitCondStore(MI, MBB, SystemZ::STH, 0, false);
case SystemZ::CondStore16Inv:
  return emitCondStore(MI, MBB, SystemZ::STH, 0, true);
case SystemZ::CondStore32:
  return emitCondStore(MI, MBB, SystemZ::ST, SystemZ::STOC, false);
case SystemZ::CondStore32Inv:
  return emitCondStore(MI, MBB, SystemZ::ST, SystemZ::STOC, true);
case SystemZ::CondStore64:
  return emitCondStore(MI, MBB, SystemZ::STG, SystemZ::STOCG, false);
case SystemZ::CondStore64Inv:
  return emitCondStore(MI, MBB, SystemZ::STG, SystemZ::STOCG, true);
case SystemZ::CondStoreF32:
  return emitCondStore(MI, MBB, SystemZ::STE, 0, false);
case SystemZ::CondStoreF32Inv:
  return emitCondStore(MI, MBB, SystemZ::STE, 0, true);
case SystemZ::CondStoreF64:
  return emitCondStore(MI, MBB, SystemZ::STD, 0, false);
case SystemZ::CondStoreF64Inv:
  return emitCondStore(MI, MBB, SystemZ::STD, 0, true);

case SystemZ::PAIR128:
  return emitPair128(MI, MBB);
case SystemZ::AEXT128:
  return emitExt128(MI, MBB, false);
case SystemZ::ZEXT128:
  return emitExt128(MI, MBB, true);

case SystemZ::ATOMIC_SWAPW:
  return emitAtomicLoadBinary(MI, MBB, 0, 0);
case SystemZ::ATOMIC_SWAP_32:
  return emitAtomicLoadBinary(MI, MBB, 0, 32);
case SystemZ::ATOMIC_SWAP_64:
  return emitAtomicLoadBinary(MI, MBB, 0, 64);

case SystemZ::ATOMIC_LOADW_AR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AR, 0);
case SystemZ::ATOMIC_LOADW_AFI:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AFI, 0);
case SystemZ::ATOMIC_LOAD_AR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AR, 32);
case SystemZ::ATOMIC_LOAD_AHI:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AHI, 32);
case SystemZ::ATOMIC_LOAD_AFI:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AFI, 32);
case SystemZ::ATOMIC_LOAD_AGR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AGR, 64);
case SystemZ::ATOMIC_LOAD_AGHI:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AGHI, 64);
case SystemZ::ATOMIC_LOAD_AGFI:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::AGFI, 64);

case SystemZ::ATOMIC_LOADW_SR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::SR, 0);
case SystemZ::ATOMIC_LOAD_SR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::SR, 32);
case SystemZ::ATOMIC_LOAD_SGR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::SGR, 64);

case SystemZ::ATOMIC_LOADW_NR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NR, 0);
case SystemZ::ATOMIC_LOADW_NILH:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH, 0);
case SystemZ::ATOMIC_LOAD_NR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NR, 32);
case SystemZ::ATOMIC_LOAD_NILL:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILL, 32);
case SystemZ::ATOMIC_LOAD_NILH:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH, 32);
case SystemZ::ATOMIC_LOAD_NILF:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILF, 32);
case SystemZ::ATOMIC_LOAD_NGR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NGR, 64);
case SystemZ::ATOMIC_LOAD_NILL64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILL64, 64);
case SystemZ::ATOMIC_LOAD_NILH64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH64, 64);
case SystemZ::ATOMIC_LOAD_NIHL64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHL64, 64);
case SystemZ::ATOMIC_LOAD_NIHH64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHH64, 64);
case SystemZ::ATOMIC_LOAD_NILF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILF64, 64);
case SystemZ::ATOMIC_LOAD_NIHF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHF64, 64);

case SystemZ::ATOMIC_LOADW_OR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OR, 0);
case SystemZ::ATOMIC_LOADW_OILH:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILH, 0);
case SystemZ::ATOMIC_LOAD_OR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OR, 32);
case SystemZ::ATOMIC_LOAD_OILL:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILL, 32);
case SystemZ::ATOMIC_LOAD_OILH:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILH, 32);
case SystemZ::ATOMIC_LOAD_OILF:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILF, 32);
case SystemZ::ATOMIC_LOAD_OGR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OGR, 64);
case SystemZ::ATOMIC_LOAD_OILL64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILL64, 64);
case SystemZ::ATOMIC_LOAD_OILH64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILH64, 64);
case SystemZ::ATOMIC_LOAD_OIHL64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OIHL64, 64);
case SystemZ::ATOMIC_LOAD_OIHH64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OIHH64, 64);
case SystemZ::ATOMIC_LOAD_OILF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OILF64, 64);
case SystemZ::ATOMIC_LOAD_OIHF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::OIHF64, 64);

case SystemZ::ATOMIC_LOADW_XR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XR, 0);
case SystemZ::ATOMIC_LOADW_XILF:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XILF, 0);
case SystemZ::ATOMIC_LOAD_XR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XR, 32);
case SystemZ::ATOMIC_LOAD_XILF:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XILF, 32);
case SystemZ::ATOMIC_LOAD_XGR:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XGR, 64);
case SystemZ::ATOMIC_LOAD_XILF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XILF64, 64);
case SystemZ::ATOMIC_LOAD_XIHF64:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::XIHF64, 64);

case SystemZ::ATOMIC_LOADW_NRi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NR, 0, true);
case SystemZ::ATOMIC_LOADW_NILHi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH, 0, true);
case SystemZ::ATOMIC_LOAD_NRi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NR, 32, true);
case SystemZ::ATOMIC_LOAD_NILLi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILL, 32, true);
case SystemZ::ATOMIC_LOAD_NILHi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH, 32, true);
case SystemZ::ATOMIC_LOAD_NILFi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILF, 32, true);
case SystemZ::ATOMIC_LOAD_NGRi:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NGR, 64, true);
case SystemZ::ATOMIC_LOAD_NILL64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILL64, 64, true);
case SystemZ::ATOMIC_LOAD_NILH64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILH64, 64, true);
case SystemZ::ATOMIC_LOAD_NIHL64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHL64, 64, true);
case SystemZ::ATOMIC_LOAD_NIHH64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHH64, 64, true);
case SystemZ::ATOMIC_LOAD_NILF64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NILF64, 64, true);
case SystemZ::ATOMIC_LOAD_NIHF64i:
  return emitAtomicLoadBinary(MI, MBB, SystemZ::NIHF64, 64, true);

case SystemZ::ATOMIC_LOADW_MIN:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CR,
                              SystemZ::CCMASK_CMP_LE, 0);
case SystemZ::ATOMIC_LOAD_MIN_32:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CR,
                              SystemZ::CCMASK_CMP_LE, 32);
case SystemZ::ATOMIC_LOAD_MIN_64:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CGR,
                              SystemZ::CCMASK_CMP_LE, 64);

case SystemZ::ATOMIC_LOADW_MAX:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CR,
                              SystemZ::CCMASK_CMP_GE, 0);
case SystemZ::ATOMIC_LOAD_MAX_32:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CR,
                              SystemZ::CCMASK_CMP_GE, 32);
case SystemZ::ATOMIC_LOAD_MAX_64:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CGR,
                              SystemZ::CCMASK_CMP_GE, 64);

case SystemZ::ATOMIC_LOADW_UMIN:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLR,
                              SystemZ::CCMASK_CMP_LE, 0);
case SystemZ::ATOMIC_LOAD_UMIN_32:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLR,
                              SystemZ::CCMASK_CMP_LE, 32);
case SystemZ::ATOMIC_LOAD_UMIN_64:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLGR,
                              SystemZ::CCMASK_CMP_LE, 64);

case SystemZ::ATOMIC_LOADW_UMAX:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLR,
                              SystemZ::CCMASK_CMP_GE, 0);
case SystemZ::ATOMIC_LOAD_UMAX_32:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLR,
                              SystemZ::CCMASK_CMP_GE, 32);
case SystemZ::ATOMIC_LOAD_UMAX_64:
  return emitAtomicLoadMinMax(MI, MBB, SystemZ::CLGR,
                              SystemZ::CCMASK_CMP_GE, 64);

case SystemZ::ATOMIC_CMP_SWAPW:
  return emitAtomicCmpSwapW(MI, MBB);
case SystemZ::MVCSequence:
case SystemZ::MVCLoop:
  return emitMemMemWrapper(MI, MBB, SystemZ::MVC);
case SystemZ::NCSequence:
case SystemZ::NCLoop:
  return emitMemMemWrapper(MI, MBB, SystemZ::NC);
case SystemZ::OCSequence:
case SystemZ::OCLoop:
  return emitMemMemWrapper(MI, MBB, SystemZ::OC);
case SystemZ::XCSequence:
case SystemZ::XCLoop:
  return emitMemMemWrapper(MI, MBB, SystemZ::XC);
case SystemZ::CLCSequence:
case SystemZ::CLCLoop:
  return emitMemMemWrapper(MI, MBB, SystemZ::CLC);
case SystemZ::CLSTLoop:
  return emitStringWrapper(MI, MBB, SystemZ::CLST);
case SystemZ::MVSTLoop:
  return emitStringWrapper(MI, MBB, SystemZ::MVST);
case SystemZ::SRSTLoop:
  return emitStringWrapper(MI, MBB, SystemZ::SRST);
case SystemZ::TBEGIN:
  return emitTransactionBegin(MI, MBB, SystemZ::TBEGIN, false);
case SystemZ::TBEGIN_nofloat:
  return emitTransactionBegin(MI, MBB, SystemZ::TBEGIN, true);
case SystemZ::TBEGINC:
  return emitTransactionBegin(MI, MBB, SystemZ::TBEGINC, true);
case SystemZ::LTEBRCompare_VecPseudo:
  return emitLoadAndTestCmp0(MI, MBB, SystemZ::LTEBR);
case SystemZ::LTDBRCompare_VecPseudo:
  return emitLoadAndTestCmp0(MI, MBB, SystemZ::LTDBR);
case SystemZ::LTXBRCompare_VecPseudo:
  return emitLoadAndTestCmp0(MI, MBB, SystemZ::LTXBR);

case TargetOpcode::STACKMAP:
case TargetOpcode::PATCHPOINT:
  return emitPatchPoint(MI, MBB);

default:
  llvm_unreachable("Unexpected instr type to insert")::llvm::llvm_unreachable_internal("Unexpected instr type to insert"
, "/build/llvm-toolchain-snapshot-8~svn350071/lib/Target/SystemZ/SystemZISelLowering.cpp"
, 7395);
}
7397}

7399// This is only used by the isel schedulers, and is needed only to prevent
7400// compiler from crashing when list-ilp is used.
7401const TargetRegisterClass *
7402SystemZTargetLowering::getRepRegClassFor(MVT VT) const {
if (VT == MVT::Untyped)
  return &SystemZ::ADDR128BitRegClass;
return TargetLowering::getRepRegClassFor(VT);
7406}

←

/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h

→

1//===-- llvm/Support/MathExtras.h - Useful math functions -------*- 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 contains some functions that are useful for math stuff.
11//
12//===----------------------------------------------------------------------===//
13 
14#ifndef LLVM_SUPPORT_MATHEXTRAS_H
15#define LLVM_SUPPORT_MATHEXTRAS_H
16 
17#include "llvm/Support/Compiler.h"
18#include "llvm/Support/SwapByteOrder.h"
19#include <algorithm>
20#include <cassert>
21#include <climits>
22#include <cstring>
23#include <limits>
24#include <type_traits>
25 
26#ifdef __ANDROID_NDK__
27#include <android/api-level.h>
28#endif
29 
30#ifdef _MSC_VER
31// Declare these intrinsics manually rather including intrin.h. It's very
32// expensive, and MathExtras.h is popular.
33// #include <intrin.h>
34extern "C" {
35unsigned char _BitScanForward(unsigned long *_Index, unsigned long _Mask);
36unsigned char _BitScanForward64(unsigned long *_Index, unsigned __int64 _Mask);
37unsigned char _BitScanReverse(unsigned long *_Index, unsigned long _Mask);
38unsigned char _BitScanReverse64(unsigned long *_Index, unsigned __int64 _Mask);
39}
40#endif
41 
42namespace llvm {
43/// The behavior an operation has on an input of 0.
44enum ZeroBehavior {
45  /// The returned value is undefined.
46  ZB_Undefined,
47  /// The returned value is numeric_limits<T>::max()
48  ZB_Max,
49  /// The returned value is numeric_limits<T>::digits
50  ZB_Width
51};
52 
53namespace detail {
54template <typename T, std::size_t SizeOfT> struct TrailingZerosCounter {
55  static std::size_t count(T Val, ZeroBehavior) {
56    if (!Val)
57      return std::numeric_limits<T>::digits;
58    if (Val & 0x1)
59      return 0;
60 
61    // Bisection method.
62    std::size_t ZeroBits = 0;
63    T Shift = std::numeric_limits<T>::digits >> 1;
64    T Mask = std::numeric_limits<T>::max() >> Shift;
65    while (Shift) {
66      if ((Val & Mask) == 0) {
67        Val >>= Shift;
68        ZeroBits |= Shift;
69      }
70      Shift >>= 1;
71      Mask >>= Shift;
72    }
73    return ZeroBits;
74  }
75};
76 
77#if __GNUC__4 >= 4 || defined(_MSC_VER)
78template <typename T> struct TrailingZerosCounter<T, 4> {
79  static std::size_t count(T Val, ZeroBehavior ZB) {
80    if (ZB != ZB_Undefined && Val == 0)
81      return 32;
82 
83#if __has_builtin(__builtin_ctz)1 || LLVM_GNUC_PREREQ(4, 0, 0)((4 << 20) + (2 << 10) + 1 >= ((4) << 20
) + ((0) << 10) + (0))
84    return __builtin_ctz(Val);
85#elif defined(_MSC_VER)
86    unsigned long Index;
87    _BitScanForward(&Index, Val);
88    return Index;
89#endif
90  }
91};
92 
93#if !defined(_MSC_VER) || defined(_M_X64)
94template <typename T> struct TrailingZerosCounter<T, 8> {
95  static std::size_t count(T Val, ZeroBehavior ZB) {
96    if (ZB != ZB_Undefined && Val == 0)
97      return 64;
98 
99#if __has_builtin(__builtin_ctzll)1 || LLVM_GNUC_PREREQ(4, 0, 0)((4 << 20) + (2 << 10) + 1 >= ((4) << 20
) + ((0) << 10) + (0))
100    return __builtin_ctzll(Val);
101#elif defined(_MSC_VER)
102    unsigned long Index;
103    _BitScanForward64(&Index, Val);
104    return Index;
105#endif
106  }
107};
108#endif
109#endif
110} // namespace detail
111 
112/// Count number of 0's from the least significant bit to the most
113///   stopping at the first 1.
114///
115/// Only unsigned integral types are allowed.
116///
117/// \param ZB the behavior on an input of 0. Only ZB_Width and ZB_Undefined are
118///   valid arguments.
119template <typename T>
120std::size_t countTrailingZeros(T Val, ZeroBehavior ZB = ZB_Width) {
121  static_assert(std::numeric_limits<T>::is_integer &&
122                    !std::numeric_limits<T>::is_signed,
123                "Only unsigned integral types are allowed.");
124  return llvm::detail::TrailingZerosCounter<T, sizeof(T)>::count(Val, ZB);
125}
126 
127namespace detail {
128template <typename T, std::size_t SizeOfT> struct LeadingZerosCounter {
129  static std::size_t count(T Val, ZeroBehavior) {
130    if (!Val)
131      return std::numeric_limits<T>::digits;
132 
133    // Bisection method.
134    std::size_t ZeroBits = 0;
135    for (T Shift = std::numeric_limits<T>::digits >> 1; Shift; Shift >>= 1) {
136      T Tmp = Val >> Shift;
137      if (Tmp)
138        Val = Tmp;
139      else
140        ZeroBits |= Shift;
141    }
142    return ZeroBits;
143  }
144};
145 
146#if __GNUC__4 >= 4 || defined(_MSC_VER)
147template <typename T> struct LeadingZerosCounter<T, 4> {
148  static std::size_t count(T Val, ZeroBehavior ZB) {
149    if (ZB != ZB_Undefined && Val == 0)
150      return 32;
151 
152#if __has_builtin(__builtin_clz)1 || LLVM_GNUC_PREREQ(4, 0, 0)((4 << 20) + (2 << 10) + 1 >= ((4) << 20
) + ((0) << 10) + (0))
153    return __builtin_clz(Val);
154#elif defined(_MSC_VER)
155    unsigned long Index;
156    _BitScanReverse(&Index, Val);
157    return Index ^ 31;
158#endif
159  }
160};
161 
162#if !defined(_MSC_VER) || defined(_M_X64)
163template <typename T> struct LeadingZerosCounter<T, 8> {
164  static std::size_t count(T Val, ZeroBehavior ZB) {
165    if (ZB != ZB_Undefined && Val == 0)
166      return 64;
167 
168#if __has_builtin(__builtin_clzll)1 || LLVM_GNUC_PREREQ(4, 0, 0)((4 << 20) + (2 << 10) + 1 >= ((4) << 20
) + ((0) << 10) + (0))
169    return __builtin_clzll(Val);
170#elif defined(_MSC_VER)
171    unsigned long Index;
172    _BitScanReverse64(&Index, Val);
173    return Index ^ 63;
174#endif
175  }
176};
177#endif
178#endif
179} // namespace detail
180 
181/// Count number of 0's from the most significant bit to the least
182///   stopping at the first 1.
183///
184/// Only unsigned integral types are allowed.
185///
186/// \param ZB the behavior on an input of 0. Only ZB_Width and ZB_Undefined are
187///   valid arguments.
188template <typename T>
189std::size_t countLeadingZeros(T Val, ZeroBehavior ZB = ZB_Width) {
190  static_assert(std::numeric_limits<T>::is_integer &&
191                    !std::numeric_limits<T>::is_signed,
192                "Only unsigned integral types are allowed.");
193  return llvm::detail::LeadingZerosCounter<T, sizeof(T)>::count(Val, ZB);
194}
195 
196/// Get the index of the first set bit starting from the least
197///   significant bit.
198///
199/// Only unsigned integral types are allowed.
200///
201/// \param ZB the behavior on an input of 0. Only ZB_Max and ZB_Undefined are
202///   valid arguments.
203template <typename T> T findFirstSet(T Val, ZeroBehavior ZB = ZB_Max) {
204  if (ZB == ZB_Max && Val == 0)
10
←
Assuming 'Val' is equal to 0→
11
←
Taking true branch→
205    return std::numeric_limits<T>::max();
12
←
Calling 'numeric_limits::max'→
14
←
Returning from 'numeric_limits::max'→
15
←
Returning the value 18446744073709551615→
206 
207  return countTrailingZeros(Val, ZB_Undefined);
208}
209 
210/// Create a bitmask with the N right-most bits set to 1, and all other
211/// bits set to 0.  Only unsigned types are allowed.
212template <typename T> T maskTrailingOnes(unsigned N) {
213  static_assert(std::is_unsigned<T>::value, "Invalid type!");
214  const unsigned Bits = CHAR_BIT8 * sizeof(T);
215  assert(N <= Bits && "Invalid bit index")((N <= Bits && "Invalid bit index") ? static_cast<
void> (0) : __assert_fail ("N <= Bits && \"Invalid bit index\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 215, __PRETTY_FUNCTION__));
216  return N == 0 ? 0 : (T(-1) >> (Bits - N));
217}
218 
219/// Create a bitmask with the N left-most bits set to 1, and all other
220/// bits set to 0.  Only unsigned types are allowed.
221template <typename T> T maskLeadingOnes(unsigned N) {
222  return ~maskTrailingOnes<T>(CHAR_BIT8 * sizeof(T) - N);
223}
224 
225/// Create a bitmask with the N right-most bits set to 0, and all other
226/// bits set to 1.  Only unsigned types are allowed.
227template <typename T> T maskTrailingZeros(unsigned N) {
228  return maskLeadingOnes<T>(CHAR_BIT8 * sizeof(T) - N);
229}
230 
231/// Create a bitmask with the N left-most bits set to 0, and all other
232/// bits set to 1.  Only unsigned types are allowed.
233template <typename T> T maskLeadingZeros(unsigned N) {
234  return maskTrailingOnes<T>(CHAR_BIT8 * sizeof(T) - N);
235}
236 
237/// Get the index of the last set bit starting from the least
238///   significant bit.
239///
240/// Only unsigned integral types are allowed.
241///
242/// \param ZB the behavior on an input of 0. Only ZB_Max and ZB_Undefined are
243///   valid arguments.
244template <typename T> T findLastSet(T Val, ZeroBehavior ZB = ZB_Max) {
245  if (ZB == ZB_Max && Val == 0)
246    return std::numeric_limits<T>::max();
247 
248  // Use ^ instead of - because both gcc and llvm can remove the associated ^
249  // in the __builtin_clz intrinsic on x86.
250  return countLeadingZeros(Val, ZB_Undefined) ^
251         (std::numeric_limits<T>::digits - 1);
252}
253 
254/// Macro compressed bit reversal table for 256 bits.
255///
256/// http://graphics.stanford.edu/~seander/bithacks.html#BitReverseTable
257static const unsigned char BitReverseTable256[256] = {
258#define R2(n) n, n + 2 * 64, n + 1 * 64, n + 3 * 64
259#define R4(n) R2(n), R2(n + 2 * 16), R2(n + 1 * 16), R2(n + 3 * 16)
260#define R6(n) R4(n), R4(n + 2 * 4), R4(n + 1 * 4), R4(n + 3 * 4)
261  R6(0), R6(2), R6(1), R6(3)
262#undef R2
263#undef R4
264#undef R6
265};
266 
267/// Reverse the bits in \p Val.
268template <typename T>
269T reverseBits(T Val) {
270  unsigned char in[sizeof(Val)];
271  unsigned char out[sizeof(Val)];
272  std::memcpy(in, &Val, sizeof(Val));
273  for (unsigned i = 0; i < sizeof(Val); ++i)
274    out[(sizeof(Val) - i) - 1] = BitReverseTable256[in[i]];
275  std::memcpy(&Val, out, sizeof(Val));
276  return Val;
277}
278 
279// NOTE: The following support functions use the _32/_64 extensions instead of
280// type overloading so that signed and unsigned integers can be used without
281// ambiguity.
282 
283/// Return the high 32 bits of a 64 bit value.
284constexpr inline uint32_t Hi_32(uint64_t Value) {
285  return static_cast<uint32_t>(Value >> 32);
286}
287 
288/// Return the low 32 bits of a 64 bit value.
289constexpr inline uint32_t Lo_32(uint64_t Value) {
290  return static_cast<uint32_t>(Value);
291}
292 
293/// Make a 64-bit integer from a high / low pair of 32-bit integers.
294constexpr inline uint64_t Make_64(uint32_t High, uint32_t Low) {
295  return ((uint64_t)High << 32) | (uint64_t)Low;
296}
297 
298/// Checks if an integer fits into the given bit width.
299template <unsigned N> constexpr inline bool isInt(int64_t x) {
300  return N >= 64 || (-(INT64_C(1)1L<<(N-1)) <= x && x < (INT64_C(1)1L<<(N-1)));
301}
302// Template specializations to get better code for common cases.
303template <> constexpr inline bool isInt<8>(int64_t x) {
304  return static_cast<int8_t>(x) == x;
305}
306template <> constexpr inline bool isInt<16>(int64_t x) {
307  return static_cast<int16_t>(x) == x;
308}
309template <> constexpr inline bool isInt<32>(int64_t x) {
310  return static_cast<int32_t>(x) == x;
311}
312 
313/// Checks if a signed integer is an N bit number shifted left by S.
314template <unsigned N, unsigned S>
315constexpr inline bool isShiftedInt(int64_t x) {
316  static_assert(
317      N > 0, "isShiftedInt<0> doesn't make sense (refers to a 0-bit number.");
318  static_assert(N + S <= 64, "isShiftedInt<N, S> with N + S > 64 is too wide.");
319  return isInt<N + S>(x) && (x % (UINT64_C(1)1UL << S) == 0);
320}
321 
322/// Checks if an unsigned integer fits into the given bit width.
323///
324/// This is written as two functions rather than as simply
325///
326///   return N >= 64 || X < (UINT64_C(1) << N);
327///
328/// to keep MSVC from (incorrectly) warning on isUInt<64> that we're shifting
329/// left too many places.
330template <unsigned N>
331constexpr inline typename std::enable_if<(N < 64), bool>::type
332isUInt(uint64_t X) {
333  static_assert(N > 0, "isUInt<0> doesn't make sense");
334  return X < (UINT64_C(1)1UL << (N));
335}
336template <unsigned N>
337constexpr inline typename std::enable_if<N >= 64, bool>::type
338isUInt(uint64_t X) {
339  return true;
340}
341 
342// Template specializations to get better code for common cases.
343template <> constexpr inline bool isUInt<8>(uint64_t x) {
344  return static_cast<uint8_t>(x) == x;
345}
346template <> constexpr inline bool isUInt<16>(uint64_t x) {
347  return static_cast<uint16_t>(x) == x;
348}
349template <> constexpr inline bool isUInt<32>(uint64_t x) {
350  return static_cast<uint32_t>(x) == x;
351}
352 
353/// Checks if a unsigned integer is an N bit number shifted left by S.
354template <unsigned N, unsigned S>
355constexpr inline bool isShiftedUInt(uint64_t x) {
356  static_assert(
357      N > 0, "isShiftedUInt<0> doesn't make sense (refers to a 0-bit number)");
358  static_assert(N + S <= 64,
359                "isShiftedUInt<N, S> with N + S > 64 is too wide.");
360  // Per the two static_asserts above, S must be strictly less than 64.  So
361  // 1 << S is not undefined behavior.
362  return isUInt<N + S>(x) && (x % (UINT64_C(1)1UL << S) == 0);
363}
364 
365/// Gets the maximum value for a N-bit unsigned integer.
366inline uint64_t maxUIntN(uint64_t N) {
367  assert(N > 0 && N <= 64 && "integer width out of range")((N > 0 && N <= 64 && "integer width out of range"
) ? static_cast<void> (0) : __assert_fail ("N > 0 && N <= 64 && \"integer width out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 367, __PRETTY_FUNCTION__));
368 
369  // uint64_t(1) << 64 is undefined behavior, so we can't do
370  //   (uint64_t(1) << N) - 1
371  // without checking first that N != 64.  But this works and doesn't have a
372  // branch.
373  return UINT64_MAX(18446744073709551615UL) >> (64 - N);
374}
375 
376/// Gets the minimum value for a N-bit signed integer.
377inline int64_t minIntN(int64_t N) {
378  assert(N > 0 && N <= 64 && "integer width out of range")((N > 0 && N <= 64 && "integer width out of range"
) ? static_cast<void> (0) : __assert_fail ("N > 0 && N <= 64 && \"integer width out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 378, __PRETTY_FUNCTION__));
379 
380  return -(UINT64_C(1)1UL<<(N-1));
381}
382 
383/// Gets the maximum value for a N-bit signed integer.
384inline int64_t maxIntN(int64_t N) {
385  assert(N > 0 && N <= 64 && "integer width out of range")((N > 0 && N <= 64 && "integer width out of range"
) ? static_cast<void> (0) : __assert_fail ("N > 0 && N <= 64 && \"integer width out of range\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 385, __PRETTY_FUNCTION__));
386 
387  // This relies on two's complement wraparound when N == 64, so we convert to
388  // int64_t only at the very end to avoid UB.
389  return (UINT64_C(1)1UL << (N - 1)) - 1;
390}
391 
392/// Checks if an unsigned integer fits into the given (dynamic) bit width.
393inline bool isUIntN(unsigned N, uint64_t x) {
394  return N >= 64 || x <= maxUIntN(N);
395}
396 
397/// Checks if an signed integer fits into the given (dynamic) bit width.
398inline bool isIntN(unsigned N, int64_t x) {
399  return N >= 64 || (minIntN(N) <= x && x <= maxIntN(N));
400}
401 
402/// Return true if the argument is a non-empty sequence of ones starting at the
403/// least significant bit with the remainder zero (32 bit version).
404/// Ex. isMask_32(0x0000FFFFU) == true.
405constexpr inline bool isMask_32(uint32_t Value) {
406  return Value && ((Value + 1) & Value) == 0;
407}
408 
409/// Return true if the argument is a non-empty sequence of ones starting at the
410/// least significant bit with the remainder zero (64 bit version).
411constexpr inline bool isMask_64(uint64_t Value) {
412  return Value && ((Value + 1) & Value) == 0;
413}
414 
415/// Return true if the argument contains a non-empty sequence of ones with the
416/// remainder zero (32 bit version.) Ex. isShiftedMask_32(0x0000FF00U) == true.
417constexpr inline bool isShiftedMask_32(uint32_t Value) {
418  return Value && isMask_32((Value - 1) | Value);
419}
420 
421/// Return true if the argument contains a non-empty sequence of ones with the
422/// remainder zero (64 bit version.)
423constexpr inline bool isShiftedMask_64(uint64_t Value) {
424  return Value && isMask_64((Value - 1) | Value);
425}
426 
427/// Return true if the argument is a power of two > 0.
428/// Ex. isPowerOf2_32(0x00100000U) == true (32 bit edition.)
429constexpr inline bool isPowerOf2_32(uint32_t Value) {
430  return Value && !(Value & (Value - 1));
431}
432 
433/// Return true if the argument is a power of two > 0 (64 bit edition.)
434constexpr inline bool isPowerOf2_64(uint64_t Value) {
435  return Value && !(Value & (Value - 1));
436}
437 
438/// Return a byte-swapped representation of the 16-bit argument.
439inline uint16_t ByteSwap_16(uint16_t Value) {
440  return sys::SwapByteOrder_16(Value);
441}
442 
443/// Return a byte-swapped representation of the 32-bit argument.
444inline uint32_t ByteSwap_32(uint32_t Value) {
445  return sys::SwapByteOrder_32(Value);
446}
447 
448/// Return a byte-swapped representation of the 64-bit argument.
449inline uint64_t ByteSwap_64(uint64_t Value) {
450  return sys::SwapByteOrder_64(Value);
451}
452 
453/// Count the number of ones from the most significant bit to the first
454/// zero bit.
455///
456/// Ex. countLeadingOnes(0xFF0FFF00) == 8.
457/// Only unsigned integral types are allowed.
458///
459/// \param ZB the behavior on an input of all ones. Only ZB_Width and
460/// ZB_Undefined are valid arguments.
461template <typename T>
462std::size_t countLeadingOnes(T Value, ZeroBehavior ZB = ZB_Width) {
463  static_assert(std::numeric_limits<T>::is_integer &&
464                    !std::numeric_limits<T>::is_signed,
465                "Only unsigned integral types are allowed.");
466  return countLeadingZeros<T>(~Value, ZB);
467}
468 
469/// Count the number of ones from the least significant bit to the first
470/// zero bit.
471///
472/// Ex. countTrailingOnes(0x00FF00FF) == 8.
473/// Only unsigned integral types are allowed.
474///
475/// \param ZB the behavior on an input of all ones. Only ZB_Width and
476/// ZB_Undefined are valid arguments.
477template <typename T>
478std::size_t countTrailingOnes(T Value, ZeroBehavior ZB = ZB_Width) {
479  static_assert(std::numeric_limits<T>::is_integer &&
480                    !std::numeric_limits<T>::is_signed,
481                "Only unsigned integral types are allowed.");
482  return countTrailingZeros<T>(~Value, ZB);
483}
484 
485namespace detail {
486template <typename T, std::size_t SizeOfT> struct PopulationCounter {
487  static unsigned count(T Value) {
488    // Generic version, forward to 32 bits.
489    static_assert(SizeOfT <= 4, "Not implemented!");
490#if __GNUC__4 >= 4
491    return __builtin_popcount(Value);
492#else
493    uint32_t v = Value;
494    v = v - ((v >> 1) & 0x55555555);
495    v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
496    return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
497#endif
498  }
499};
500 
501template <typename T> struct PopulationCounter<T, 8> {
502  static unsigned count(T Value) {
503#if __GNUC__4 >= 4
504    return __builtin_popcountll(Value);
505#else
506    uint64_t v = Value;
507    v = v - ((v >> 1) & 0x5555555555555555ULL);
508    v = (v & 0x3333333333333333ULL) + ((v >> 2) & 0x3333333333333333ULL);
509    v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL;
510    return unsigned((uint64_t)(v * 0x0101010101010101ULL) >> 56);
511#endif
512  }
513};
514} // namespace detail
515 
516/// Count the number of set bits in a value.
517/// Ex. countPopulation(0xF000F000) = 8
518/// Returns 0 if the word is zero.
519template <typename T>
520inline unsigned countPopulation(T Value) {
521  static_assert(std::numeric_limits<T>::is_integer &&
522                    !std::numeric_limits<T>::is_signed,
523                "Only unsigned integral types are allowed.");
524  return detail::PopulationCounter<T, sizeof(T)>::count(Value);
525}
526 
527/// Return the log base 2 of the specified value.
528inline double Log2(double Value) {
529#if defined(__ANDROID_API__) && __ANDROID_API__ < 18
530  return __builtin_log(Value) / __builtin_log(2.0);
531#else
532  return log2(Value);
533#endif
534}
535 
536/// Return the floor log base 2 of the specified value, -1 if the value is zero.
537/// (32 bit edition.)
538/// Ex. Log2_32(32) == 5, Log2_32(1) == 0, Log2_32(0) == -1, Log2_32(6) == 2
539inline unsigned Log2_32(uint32_t Value) {
540  return 31 - countLeadingZeros(Value);
541}
542 
543/// Return the floor log base 2 of the specified value, -1 if the value is zero.
544/// (64 bit edition.)
545inline unsigned Log2_64(uint64_t Value) {
546  return 63 - countLeadingZeros(Value);
547}
548 
549/// Return the ceil log base 2 of the specified value, 32 if the value is zero.
550/// (32 bit edition).
551/// Ex. Log2_32_Ceil(32) == 5, Log2_32_Ceil(1) == 0, Log2_32_Ceil(6) == 3
552inline unsigned Log2_32_Ceil(uint32_t Value) {
553  return 32 - countLeadingZeros(Value - 1);
554}
555 
556/// Return the ceil log base 2 of the specified value, 64 if the value is zero.
557/// (64 bit edition.)
558inline unsigned Log2_64_Ceil(uint64_t Value) {
559  return 64 - countLeadingZeros(Value - 1);
560}
561 
562/// Return the greatest common divisor of the values using Euclid's algorithm.
563inline uint64_t GreatestCommonDivisor64(uint64_t A, uint64_t B) {
564  while (B) {
565    uint64_t T = B;
566    B = A % B;
567    A = T;
568  }
569  return A;
570}
571 
572/// This function takes a 64-bit integer and returns the bit equivalent double.
573inline double BitsToDouble(uint64_t Bits) {
574  double D;
575  static_assert(sizeof(uint64_t) == sizeof(double), "Unexpected type sizes");
576  memcpy(&D, &Bits, sizeof(Bits));
577  return D;
578}
579 
580/// This function takes a 32-bit integer and returns the bit equivalent float.
581inline float BitsToFloat(uint32_t Bits) {
582  float F;
583  static_assert(sizeof(uint32_t) == sizeof(float), "Unexpected type sizes");
584  memcpy(&F, &Bits, sizeof(Bits));
585  return F;
586}
587 
588/// This function takes a double and returns the bit equivalent 64-bit integer.
589/// Note that copying doubles around changes the bits of NaNs on some hosts,
590/// notably x86, so this routine cannot be used if these bits are needed.
591inline uint64_t DoubleToBits(double Double) {
592  uint64_t Bits;
593  static_assert(sizeof(uint64_t) == sizeof(double), "Unexpected type sizes");
594  memcpy(&Bits, &Double, sizeof(Double));
595  return Bits;
596}
597 
598/// This function takes a float and returns the bit equivalent 32-bit integer.
599/// Note that copying floats around changes the bits of NaNs on some hosts,
600/// notably x86, so this routine cannot be used if these bits are needed.
601inline uint32_t FloatToBits(float Float) {
602  uint32_t Bits;
603  static_assert(sizeof(uint32_t) == sizeof(float), "Unexpected type sizes");
604  memcpy(&Bits, &Float, sizeof(Float));
605  return Bits;
606}
607 
608/// A and B are either alignments or offsets. Return the minimum alignment that
609/// may be assumed after adding the two together.
610constexpr inline uint64_t MinAlign(uint64_t A, uint64_t B) {
611  // The largest power of 2 that divides both A and B.
612  //
613  // Replace "-Value" by "1+~Value" in the following commented code to avoid
614  // MSVC warning C4146
615  //    return (A | B) & -(A | B);
616  return (A | B) & (1 + ~(A | B));
617}
618 
619/// Aligns \c Addr to \c Alignment bytes, rounding up.
620///
621/// Alignment should be a power of two.  This method rounds up, so
622/// alignAddr(7, 4) == 8 and alignAddr(8, 4) == 8.
623inline uintptr_t alignAddr(const void *Addr, size_t Alignment) {
624  assert(Alignment && isPowerOf2_64((uint64_t)Alignment) &&((Alignment && isPowerOf2_64((uint64_t)Alignment) &&
 "Alignment is not a power of two!") ? static_cast<void>
 (0) : __assert_fail ("Alignment && isPowerOf2_64((uint64_t)Alignment) && \"Alignment is not a power of two!\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 625, __PRETTY_FUNCTION__))
625         "Alignment is not a power of two!")((Alignment && isPowerOf2_64((uint64_t)Alignment) &&
 "Alignment is not a power of two!") ? static_cast<void>
 (0) : __assert_fail ("Alignment && isPowerOf2_64((uint64_t)Alignment) && \"Alignment is not a power of two!\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 625, __PRETTY_FUNCTION__));
626 
627  assert((uintptr_t)Addr + Alignment - 1 >= (uintptr_t)Addr)(((uintptr_t)Addr + Alignment - 1 >= (uintptr_t)Addr) ? static_cast
<void> (0) : __assert_fail ("(uintptr_t)Addr + Alignment - 1 >= (uintptr_t)Addr"
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 627, __PRETTY_FUNCTION__));
628 
629  return (((uintptr_t)Addr + Alignment - 1) & ~(uintptr_t)(Alignment - 1));
630}
631 
632/// Returns the necessary adjustment for aligning \c Ptr to \c Alignment
633/// bytes, rounding up.
634inline size_t alignmentAdjustment(const void *Ptr, size_t Alignment) {
635  return alignAddr(Ptr, Alignment) - (uintptr_t)Ptr;
636}
637 
638/// Returns the next power of two (in 64-bits) that is strictly greater than A.
639/// Returns zero on overflow.
640inline uint64_t NextPowerOf2(uint64_t A) {
641  A |= (A >> 1);
642  A |= (A >> 2);
643  A |= (A >> 4);
644  A |= (A >> 8);
645  A |= (A >> 16);
646  A |= (A >> 32);
647  return A + 1;
648}
649 
650/// Returns the power of two which is less than or equal to the given value.
651/// Essentially, it is a floor operation across the domain of powers of two.
652inline uint64_t PowerOf2Floor(uint64_t A) {
653  if (!A) return 0;
654  return 1ull << (63 - countLeadingZeros(A, ZB_Undefined));
655}
656 
657/// Returns the power of two which is greater than or equal to the given value.
658/// Essentially, it is a ceil operation across the domain of powers of two.
659inline uint64_t PowerOf2Ceil(uint64_t A) {
660  if (!A)
661    return 0;
662  return NextPowerOf2(A - 1);
663}
664 
665/// Returns the next integer (mod 2**64) that is greater than or equal to
666/// \p Value and is a multiple of \p Align. \p Align must be non-zero.
667///
668/// If non-zero \p Skew is specified, the return value will be a minimal
669/// integer that is greater than or equal to \p Value and equal to
670/// \p Align * N + \p Skew for some integer N. If \p Skew is larger than
671/// \p Align, its value is adjusted to '\p Skew mod \p Align'.
672///
673/// Examples:
674/// \code
675///   alignTo(5, 8) = 8
676///   alignTo(17, 8) = 24
677///   alignTo(~0LL, 8) = 0
678///   alignTo(321, 255) = 510
679///
680///   alignTo(5, 8, 7) = 7
681///   alignTo(17, 8, 1) = 17
682///   alignTo(~0LL, 8, 3) = 3
683///   alignTo(321, 255, 42) = 552
684/// \endcode
685inline uint64_t alignTo(uint64_t Value, uint64_t Align, uint64_t Skew = 0) {
686  assert(Align != 0u && "Align can't be 0.")((Align != 0u && "Align can't be 0.") ? static_cast<
void> (0) : __assert_fail ("Align != 0u && \"Align can't be 0.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 686, __PRETTY_FUNCTION__));
687  Skew %= Align;
688  return (Value + Align - 1 - Skew) / Align * Align + Skew;
689}
690 
691/// Returns the next integer (mod 2**64) that is greater than or equal to
692/// \p Value and is a multiple of \c Align. \c Align must be non-zero.
693template <uint64_t Align> constexpr inline uint64_t alignTo(uint64_t Value) {
694  static_assert(Align != 0u, "Align must be non-zero");
695  return (Value + Align - 1) / Align * Align;
696}
697 
698/// Returns the integer ceil(Numerator / Denominator).
699inline uint64_t divideCeil(uint64_t Numerator, uint64_t Denominator) {
700  return alignTo(Numerator, Denominator) / Denominator;
701}
702 
703/// \c alignTo for contexts where a constant expression is required.
704/// \sa alignTo
705///
706/// \todo FIXME: remove when \c constexpr becomes really \c constexpr
707template <uint64_t Align>
708struct AlignTo {
709  static_assert(Align != 0u, "Align must be non-zero");
710  template <uint64_t Value>
711  struct from_value {
712    static const uint64_t value = (Value + Align - 1) / Align * Align;
713  };
714};
715 
716/// Returns the largest uint64_t less than or equal to \p Value and is
717/// \p Skew mod \p Align. \p Align must be non-zero
718inline uint64_t alignDown(uint64_t Value, uint64_t Align, uint64_t Skew = 0) {
719  assert(Align != 0u && "Align can't be 0.")((Align != 0u && "Align can't be 0.") ? static_cast<
void> (0) : __assert_fail ("Align != 0u && \"Align can't be 0.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 719, __PRETTY_FUNCTION__));
720  Skew %= Align;
721  return (Value - Skew) / Align * Align + Skew;
722}
723 
724/// Returns the offset to the next integer (mod 2**64) that is greater than
725/// or equal to \p Value and is a multiple of \p Align. \p Align must be
726/// non-zero.
727inline uint64_t OffsetToAlignment(uint64_t Value, uint64_t Align) {
728  return alignTo(Value, Align) - Value;
729}
730 
731/// Sign-extend the number in the bottom B bits of X to a 32-bit integer.
732/// Requires 0 < B <= 32.
733template <unsigned B> constexpr inline int32_t SignExtend32(uint32_t X) {
734  static_assert(B > 0, "Bit width can't be 0.");
735  static_assert(B <= 32, "Bit width out of range.");
736  return int32_t(X << (32 - B)) >> (32 - B);
737}
738 
739/// Sign-extend the number in the bottom B bits of X to a 32-bit integer.
740/// Requires 0 < B < 32.
741inline int32_t SignExtend32(uint32_t X, unsigned B) {
742  assert(B > 0 && "Bit width can't be 0.")((B > 0 && "Bit width can't be 0.") ? static_cast<
void> (0) : __assert_fail ("B > 0 && \"Bit width can't be 0.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 742, __PRETTY_FUNCTION__));
743  assert(B <= 32 && "Bit width out of range.")((B <= 32 && "Bit width out of range.") ? static_cast
<void> (0) : __assert_fail ("B <= 32 && \"Bit width out of range.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 743, __PRETTY_FUNCTION__));
744  return int32_t(X << (32 - B)) >> (32 - B);
745}
746 
747/// Sign-extend the number in the bottom B bits of X to a 64-bit integer.
748/// Requires 0 < B < 64.
749template <unsigned B> constexpr inline int64_t SignExtend64(uint64_t x) {
750  static_assert(B > 0, "Bit width can't be 0.");
751  static_assert(B <= 64, "Bit width out of range.");
752  return int64_t(x << (64 - B)) >> (64 - B);
753}
754 
755/// Sign-extend the number in the bottom B bits of X to a 64-bit integer.
756/// Requires 0 < B < 64.
757inline int64_t SignExtend64(uint64_t X, unsigned B) {
758  assert(B > 0 && "Bit width can't be 0.")((B > 0 && "Bit width can't be 0.") ? static_cast<
void> (0) : __assert_fail ("B > 0 && \"Bit width can't be 0.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 758, __PRETTY_FUNCTION__));
759  assert(B <= 64 && "Bit width out of range.")((B <= 64 && "Bit width out of range.") ? static_cast
<void> (0) : __assert_fail ("B <= 64 && \"Bit width out of range.\""
, "/build/llvm-toolchain-snapshot-8~svn350071/include/llvm/Support/MathExtras.h"
, 759, __PRETTY_FUNCTION__));
760  return int64_t(X << (64 - B)) >> (64 - B);
761}
762 
763/// Subtract two unsigned integers, X and Y, of type T and return the absolute
764/// value of the result.
765template <typename T>
766typename std::enable_if<std::is_unsigned<T>::value, T>::type
767AbsoluteDifference(T X, T Y) {
768  return std::max(X, Y) - std::min(X, Y);
769}
770 
771/// Add two unsigned integers, X and Y, of type T.  Clamp the result to the
772/// maximum representable value of T on overflow.  ResultOverflowed indicates if
773/// the result is larger than the maximum representable value of type T.
774template <typename T>
775typename std::enable_if<std::is_unsigned<T>::value, T>::type
776SaturatingAdd(T X, T Y, bool *ResultOverflowed = nullptr) {
777  bool Dummy;
778  bool &Overflowed = ResultOverflowed ? *ResultOverflowed : Dummy;
779  // Hacker's Delight, p. 29
780  T Z = X + Y;
781  Overflowed = (Z < X || Z < Y);
782  if (Overflowed)
783    return std::numeric_limits<T>::max();
784  else
785    return Z;
786}
787 
788/// Multiply two unsigned integers, X and Y, of type T.  Clamp the result to the
789/// maximum representable value of T on overflow.  ResultOverflowed indicates if
790/// the result is larger than the maximum representable value of type T.
791template <typename T>
792typename std::enable_if<std::is_unsigned<T>::value, T>::type
793SaturatingMultiply(T X, T Y, bool *ResultOverflowed = nullptr) {
794  bool Dummy;
795  bool &Overflowed = ResultOverflowed ? *ResultOverflowed : Dummy;
796 
797  // Hacker's Delight, p. 30 has a different algorithm, but we don't use that
798  // because it fails for uint16_t (where multiplication can have undefined
799  // behavior due to promotion to int), and requires a division in addition
800  // to the multiplication.
801 
802  Overflowed = false;
803 
804  // Log2(Z) would be either Log2Z or Log2Z + 1.
805  // Special case: if X or Y is 0, Log2_64 gives -1, and Log2Z
806  // will necessarily be less than Log2Max as desired.
807  int Log2Z = Log2_64(X) + Log2_64(Y);
808  const T Max = std::numeric_limits<T>::max();
809  int Log2Max = Log2_64(Max);
810  if (Log2Z < Log2Max) {
811    return X * Y;
812  }
813  if (Log2Z > Log2Max) {
814    Overflowed = true;
815    return Max;
816  }
817 
818  // We're going to use the top bit, and maybe overflow one
819  // bit past it. Multiply all but the bottom bit then add
820  // that on at the end.
821  T Z = (X >> 1) * Y;
822  if (Z & ~(Max >> 1)) {
823    Overflowed = true;
824    return Max;
825  }
826  Z <<= 1;
827  if (X & 1)
828    return SaturatingAdd(Z, Y, ResultOverflowed);
829 
830  return Z;
831}
832 
833/// Multiply two unsigned integers, X and Y, and add the unsigned integer, A to
834/// the product. Clamp the result to the maximum representable value of T on
835/// overflow. ResultOverflowed indicates if the result is larger than the
836/// maximum representable value of type T.
837template <typename T>
838typename std::enable_if<std::is_unsigned<T>::value, T>::type
839SaturatingMultiplyAdd(T X, T Y, T A, bool *ResultOverflowed = nullptr) {
840  bool Dummy;
841  bool &Overflowed = ResultOverflowed ? *ResultOverflowed : Dummy;
842 
843  T Product = SaturatingMultiply(X, Y, &Overflowed);
844  if (Overflowed)
845    return Product;
846 
847  return SaturatingAdd(A, Product, &Overflowed);
848}
849 
850/// Use this rather than HUGE_VALF; the latter causes warnings on MSVC.
851extern const float huge_valf;
852} // End llvm namespace
853 
854#endif

←

/usr/lib/gcc/x86_64-linux-gnu/6.3.0/../../../../include/c++/6.3.0/limits

1// The template and inlines for the numeric_limits classes. -*- C++ -*-

3// Copyright (C) 1999-2016 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library.  This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.

11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14// GNU General Public License for more details.

16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.

20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
23// <http://www.gnu.org/licenses/>.

25/** @file include/limits
*  This is a Standard C++ Library header.
*/

29// Note: this is not a conforming implementation.
30// Written by Gabriel Dos Reis <gdr@codesourcery.com>

32//
33// ISO 14882:1998
34// 18.2.1
35//

37#ifndef _GLIBCXX_NUMERIC_LIMITS1
38#define _GLIBCXX_NUMERIC_LIMITS1 1

40#pragma GCC system_header

42#include <bits/c++config.h>

44//
45// The numeric_limits<> traits document implementation-defined aspects
46// of fundamental arithmetic data types (integers and floating points).
47// From Standard C++ point of view, there are 14 such types:
48//   * integers
49//         bool							(1)
50//         char, signed char, unsigned char, wchar_t            (4)
51//         short, unsigned short				(2)
52//         int, unsigned					(2)
53//         long, unsigned long					(2)
54//
55//   * floating points
56//         float						(1)
57//         double						(1)
58//         long double						(1)
59//
60// GNU C++ understands (where supported by the host C-library)
61//   * integer
62//         long long, unsigned long long			(2)
63//
64// which brings us to 16 fundamental arithmetic data types in GNU C++.
65//
66//
67// Since a numeric_limits<> is a bit tricky to get right, we rely on
68// an interface composed of macros which should be defined in config/os
69// or config/cpu when they differ from the generic (read arbitrary)
70// definitions given here.
71//

73// These values can be overridden in the target configuration file.
74// The default values are appropriate for many 32-bit targets.

76// GCC only intrinsically supports modulo integral types.  The only remaining
77// integral exceptional values is division by zero.  Only targets that do not
78// signal division by zero in some "hard to ignore" way should use false.
79#ifndef __glibcxx_integral_trapstrue
80# define __glibcxx_integral_trapstrue true
81#endif

83// float
84//

86// Default values.  Should be overridden in configuration files if necessary.

88#ifndef __glibcxx_float_has_denorm_loss
89#  define __glibcxx_float_has_denorm_loss false
90#endif
91#ifndef __glibcxx_float_traps
92#  define __glibcxx_float_traps false
93#endif
94#ifndef __glibcxx_float_tinyness_before
95#  define __glibcxx_float_tinyness_before false
96#endif

98// double

100// Default values.  Should be overridden in configuration files if necessary.

102#ifndef __glibcxx_double_has_denorm_loss
103#  define __glibcxx_double_has_denorm_loss false
104#endif
105#ifndef __glibcxx_double_traps
106#  define __glibcxx_double_traps false
107#endif
108#ifndef __glibcxx_double_tinyness_before
109#  define __glibcxx_double_tinyness_before false
110#endif

112// long double

114// Default values.  Should be overridden in configuration files if necessary.

116#ifndef __glibcxx_long_double_has_denorm_loss
117#  define __glibcxx_long_double_has_denorm_loss false
118#endif
119#ifndef __glibcxx_long_double_traps
120#  define __glibcxx_long_double_traps false
121#endif
122#ifndef __glibcxx_long_double_tinyness_before
123#  define __glibcxx_long_double_tinyness_before false
124#endif

126// You should not need to define any macros below this point.

128#define __glibcxx_signed_b(T,B)((T)(-1) < 0)	((T)(-1) < 0)

130#define __glibcxx_min_b(T,B)(((T)(-1) < 0) ? -(((T)(-1) < 0) ? (((((T)1 << ((
B - ((T)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(T)0) - 1
 : (T)0)					\
(__glibcxx_signed_b (T,B)((T)(-1) < 0) ? -__glibcxx_max_b (T,B)(((T)(-1) < 0) ? (((((T)1 << ((B - ((T)(-1) < 0))
 - 1)) - 1) << 1) + 1) : ~(T)0) - 1 : (T)0)

133#define __glibcxx_max_b(T,B)(((T)(-1) < 0) ? (((((T)1 << ((B - ((T)(-1) < 0))
 - 1)) - 1) << 1) + 1) : ~(T)0)						\
(__glibcxx_signed_b (T,B)((T)(-1) < 0) ?						\
 (((((T)1 << (__glibcxx_digits_b (T,B)(B - ((T)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(T)0)

137#define __glibcxx_digits_b(T,B)(B - ((T)(-1) < 0))				\
(B - __glibcxx_signed_b (T,B)((T)(-1) < 0))

140// The fraction 643/2136 approximates log10(2) to 7 significant digits.
141#define __glibcxx_digits10_b(T,B)((B - ((T)(-1) < 0)) * 643L / 2136)		\
(__glibcxx_digits_b (T,B)(B - ((T)(-1) < 0)) * 643L / 2136)

144#define __glibcxx_signed(T) \
__glibcxx_signed_b (T, sizeof(T) * __CHAR_BIT__)((T)(-1) < 0)
146#define __glibcxx_min(T) \
__glibcxx_min_b (T, sizeof(T) * __CHAR_BIT__)(((T)(-1) < 0) ? -(((T)(-1) < 0) ? (((((T)1 << ((
sizeof(T) * 8 - ((T)(-1) < 0)) - 1)) - 1) << 1) + 1)
 : ~(T)0) - 1 : (T)0)
148#define __glibcxx_max(T) \
__glibcxx_max_b (T, sizeof(T) * __CHAR_BIT__)(((T)(-1) < 0) ? (((((T)1 << ((sizeof(T) * 8 - ((T)(
-1) < 0)) - 1)) - 1) << 1) + 1) : ~(T)0)
150#define __glibcxx_digits(T) \
__glibcxx_digits_b (T, sizeof(T) * __CHAR_BIT__)(sizeof(T) * 8 - ((T)(-1) < 0))
152#define __glibcxx_digits10(T) \
__glibcxx_digits10_b (T, sizeof(T) * __CHAR_BIT__)((sizeof(T) * 8 - ((T)(-1) < 0)) * 643L / 2136)

155#define __glibcxx_max_digits10(T) \
(2 + (T) * 643L / 2136)

158namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default")))
159{
160_GLIBCXX_BEGIN_NAMESPACE_VERSION

/**
 *  @brief Describes the rounding style for floating-point types.
 *
 *  This is used in the std::numeric_limits class.
*/
enum float_round_style
{
  round_indeterminate       = -1,    /// Intermediate.
  round_toward_zero         = 0,     /// To zero.
  round_to_nearest          = 1,     /// To the nearest representable value.
  round_toward_infinity     = 2,     /// To infinity.
  round_toward_neg_infinity = 3      /// To negative infinity.
};

/**
 *  @brief Describes the denormalization for floating-point types.
 *
 *  These values represent the presence or absence of a variable number
 *  of exponent bits.  This type is used in the std::numeric_limits class.
*/
enum float_denorm_style
{
  /// Indeterminate at compile time whether denormalized values are allowed.
  denorm_indeterminate = -1,
  /// The type does not allow denormalized values.
  denorm_absent        = 0,
  /// The type allows denormalized values.
  denorm_present       = 1
};

/**
 *  @brief Part of std::numeric_limits.
 *
 *  The @c static @c const members are usable as integral constant
 *  expressions.
 *
 *  @note This is a separate class for purposes of efficiency; you
 *        should only access these members as part of an instantiation
 *        of the std::numeric_limits class.
*/
struct __numeric_limits_base
{
  /** This will be true for all fundamental types (which have
specializations), and false for everything else.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = false;

  /** The number of @c radix digits that be represented without change:  for
integer types, the number of non-sign bits in the mantissa; for
floating types, the number of @c radix digits in the mantissa.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = 0;

  /** The number of base 10 digits that can be represented without change. */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = 0;

216#if __cplusplus201103L >= 201103L
  /** The number of base 10 digits required to ensure that values which
differ are always differentiated.  */
  static constexpr int max_digits10 = 0;
220#endif

  /** True if the type is signed.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;

  /** True if the type is integer.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = false;

  /** True if the type uses an exact representation. All integer types are
exact, but not all exact types are integer.  For example, rational and
fixed-exponent representations are exact but not integer. */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = false;

  /** For integer types, specifies the base of the representation.  For
floating types, specifies the base of the exponent representation.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 0;

  /** The minimum negative integer such that @c radix raised to the power of
(one less than that integer) is a normalized floating point number.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;

  /** The minimum negative integer such that 10 raised to that power is in
the range of normalized floating point numbers.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;

  /** The maximum positive integer such that @c radix raised to the power of
(one less than that integer) is a representable finite floating point
number.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;

  /** The maximum positive integer such that 10 raised to that power is in
the range of representable finite floating point numbers.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

  /** True if the type has a representation for positive infinity.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;

  /** True if the type has a representation for a quiet (non-signaling)
Not a Number.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;

  /** True if the type has a representation for a signaling
Not a Number.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;

  /** See std::float_denorm_style for more information.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm = denorm_absent;

  /** True if loss of accuracy is detected as a denormalization loss,
rather than as an inexact result. */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

  /** True if-and-only-if the type adheres to the IEC 559 standard, also
known as IEEE 754.  (Only makes sense for floating point types.)  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;

  /** True if the set of values representable by the type is
finite.  All built-in types are bounded, this member would be
false for arbitrary precision types. */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = false;

  /** True if the type is @e modulo. A type is modulo if, for any
operation involving +, -, or * on values of that type whose
result would fall outside the range [min(),max()], the value
returned differs from the true value by an integer multiple of
max() - min() + 1. On most machines, this is false for floating
types, true for unsigned integers, and true for signed integers.
See PR22200 about signed integers.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

  /** True if trapping is implemented for this type.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = false;

  /** True if tininess is detected before rounding.  (see IEC 559)  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;

  /** See std::float_round_style for more information.  This is only
meaningful for floating types; integer types will all be
round_toward_zero.  */
  static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style = 
				    round_toward_zero;
};

/**
 *  @brief Properties of fundamental types.
 *
 *  This class allows a program to obtain information about the
 *  representation of a fundamental type on a given platform.  For
 *  non-fundamental types, the functions will return 0 and the data
 *  members will all be @c false.
 *
 *  _GLIBCXX_RESOLVE_LIB_DEFECTS:  DRs 201 and 184 (hi Gaby!) are
 *  noted, but not incorporated in this documented (yet).
*/
template<typename _Tp>
  struct numeric_limits : public __numeric_limits_base
  {
    /** The minimum finite value, or for floating types with
 denormalization, the minimum positive normalized value.  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The maximum finite value.  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

326#if __cplusplus201103L >= 201103L
    /** A finite value x such that there is no other finite value y
     *  where y < x.  */
    static constexpr _Tp
    lowest() noexcept { return _Tp(); }
331#endif

    /** The @e machine @e epsilon:  the difference between 1 and the least
 value greater than 1 that is representable.  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The maximum rounding error measurement (see LIA-1).  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The representation of positive infinity, if @c has_infinity.  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The representation of a quiet Not a Number,
 if @c has_quiet_NaN. */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The representation of a signaling Not a Number, if
 @c has_signaling_NaN. */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }

    /** The minimum positive denormalized value.  For types where
 @c has_denorm is false, this is the minimum positive normalized
 value.  */
    static _GLIBCXX_CONSTEXPRconstexpr _Tp
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return _Tp(); }
  };

363#if __cplusplus201103L >= 201103L
template<typename _Tp>
  struct numeric_limits<const _Tp>
  : public numeric_limits<_Tp> { };

template<typename _Tp>
  struct numeric_limits<volatile _Tp>
  : public numeric_limits<_Tp> { };

template<typename _Tp>
  struct numeric_limits<const volatile _Tp>
  : public numeric_limits<_Tp> { };
375#endif

// Now there follow 16 explicit specializations.  Yes, 16.  Make sure
// you get the count right. (18 in c++0x mode)

/// numeric_limits<bool> specialization.
template<>
  struct numeric_limits<bool>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return true; }

392#if __cplusplus201103L >= 201103L
    static constexpr bool
    lowest() noexcept { return min(); }
395#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = 1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = 0;
398#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
400#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_CONSTEXPRconstexpr bool 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return false; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    // It is not clear what it means for a boolean type to trap.
    // This is a DR on the LWG issue list.  Here, I use integer
    // promotion semantics.
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<char> specialization.
template<>
  struct numeric_limits<char>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr char 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_min(char); }

    static _GLIBCXX_CONSTEXPRconstexpr char 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_max(char); }

461#if __cplusplus201103L >= 201103L
    static constexpr char 
    lowest() noexcept { return min(); }
464#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (char);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __glibcxx_digits10 (char);
468#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
470#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = __glibcxx_signed (char);
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr char 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr char 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr 
    char infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return char(); }

    static _GLIBCXX_CONSTEXPRconstexpr char 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return char(); }

    static _GLIBCXX_CONSTEXPRconstexpr char 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return char(); }

    static _GLIBCXX_CONSTEXPRconstexpr char 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<char>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = !is_signed;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<signed char> specialization.
template<>
  struct numeric_limits<signed char>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return -__SCHAR_MAX__127 - 1; }

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __SCHAR_MAX__127; }

528#if __cplusplus201103L >= 201103L
    static constexpr signed char 
    lowest() noexcept { return min(); }
531#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (signed char);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (signed char);
536#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
538#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<signed char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<signed char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<signed char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr signed char 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<signed char>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<unsigned char> specialization.
template<>
  struct numeric_limits<unsigned char>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __SCHAR_MAX__127 * 2U + 1; }

598#if __cplusplus201103L >= 201103L
    static constexpr unsigned char 
    lowest() noexcept { return min(); }
601#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (unsigned char);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (unsigned char);
607#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
609#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned char>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned char 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned char>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<wchar_t> specialization.
template<>
  struct numeric_limits<wchar_t>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_min (wchar_t); }

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_max (wchar_t); }

671#if __cplusplus201103L >= 201103L
    static constexpr wchar_t
    lowest() noexcept { return min(); }
674#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (wchar_t);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (wchar_t);
679#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
681#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = __glibcxx_signed (wchar_t);
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return wchar_t(); }

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return wchar_t(); }

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return wchar_t(); }

    static _GLIBCXX_CONSTEXPRconstexpr wchar_t 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return wchar_t(); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = !is_signed;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

727#if __cplusplus201103L >= 201103L
/// numeric_limits<char16_t> specialization.
template<>
  struct numeric_limits<char16_t>
  {
    static constexpr bool is_specialized = true;

    static constexpr char16_t 
    min() noexcept { return __glibcxx_min (char16_t); }

    static constexpr char16_t 
    max() noexcept { return __glibcxx_max (char16_t); }

    static constexpr char16_t 
    lowest() noexcept { return min(); }

    static constexpr int digits = __glibcxx_digits (char16_t);
    static constexpr int digits10 = __glibcxx_digits10 (char16_t);
    static constexpr int max_digits10 = 0;
    static constexpr bool is_signed = __glibcxx_signed (char16_t);
    static constexpr bool is_integer = true;
    static constexpr bool is_exact = true;
    static constexpr int radix = 2;

    static constexpr char16_t 
    epsilon() noexcept { return 0; }

    static constexpr char16_t 
    round_error() noexcept { return 0; }

    static constexpr int min_exponent = 0;
    static constexpr int min_exponent10 = 0;
    static constexpr int max_exponent = 0;
    static constexpr int max_exponent10 = 0;

    static constexpr bool has_infinity = false;
    static constexpr bool has_quiet_NaN = false;
    static constexpr bool has_signaling_NaN = false;
    static constexpr float_denorm_style has_denorm = denorm_absent;
    static constexpr bool has_denorm_loss = false;

    static constexpr char16_t 
    infinity() noexcept { return char16_t(); }

    static constexpr char16_t 
    quiet_NaN() noexcept { return char16_t(); }

    static constexpr char16_t 
    signaling_NaN() noexcept { return char16_t(); }

    static constexpr char16_t 
    denorm_min() noexcept { return char16_t(); }

    static constexpr bool is_iec559 = false;
    static constexpr bool is_bounded = true;
    static constexpr bool is_modulo = !is_signed;

    static constexpr bool traps = __glibcxx_integral_trapstrue;
    static constexpr bool tinyness_before = false;
    static constexpr float_round_style round_style = round_toward_zero;
  };

/// numeric_limits<char32_t> specialization.
template<>
  struct numeric_limits<char32_t>
  {
    static constexpr bool is_specialized = true;

    static constexpr char32_t 
    min() noexcept { return __glibcxx_min (char32_t); }

    static constexpr char32_t 
    max() noexcept { return __glibcxx_max (char32_t); }

    static constexpr char32_t 
    lowest() noexcept { return min(); }

    static constexpr int digits = __glibcxx_digits (char32_t);
    static constexpr int digits10 = __glibcxx_digits10 (char32_t);
    static constexpr int max_digits10 = 0;
    static constexpr bool is_signed = __glibcxx_signed (char32_t);
    static constexpr bool is_integer = true;
    static constexpr bool is_exact = true;
    static constexpr int radix = 2;

    static constexpr char32_t 
    epsilon() noexcept { return 0; }

    static constexpr char32_t 
    round_error() noexcept { return 0; }

    static constexpr int min_exponent = 0;
    static constexpr int min_exponent10 = 0;
    static constexpr int max_exponent = 0;
    static constexpr int max_exponent10 = 0;

    static constexpr bool has_infinity = false;
    static constexpr bool has_quiet_NaN = false;
    static constexpr bool has_signaling_NaN = false;
    static constexpr float_denorm_style has_denorm = denorm_absent;
    static constexpr bool has_denorm_loss = false;

    static constexpr char32_t 
    infinity() noexcept { return char32_t(); }

    static constexpr char32_t 
    quiet_NaN() noexcept { return char32_t(); }

    static constexpr char32_t 
    signaling_NaN() noexcept { return char32_t(); }

    static constexpr char32_t 
    denorm_min() noexcept { return char32_t(); }

    static constexpr bool is_iec559 = false;
    static constexpr bool is_bounded = true;
    static constexpr bool is_modulo = !is_signed;

    static constexpr bool traps = __glibcxx_integral_trapstrue;
    static constexpr bool tinyness_before = false;
    static constexpr float_round_style round_style = round_toward_zero;
  };
849#endif

/// numeric_limits<short> specialization.
template<>
  struct numeric_limits<short>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr short 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return -__SHRT_MAX__32767 - 1; }

    static _GLIBCXX_CONSTEXPRconstexpr short 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __SHRT_MAX__32767; }

863#if __cplusplus201103L >= 201103L
    static constexpr short 
    lowest() noexcept { return min(); }
866#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (short);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __glibcxx_digits10 (short);
870#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
872#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr short 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr short 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr short 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return short(); }

    static _GLIBCXX_CONSTEXPRconstexpr short 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return short(); }

    static _GLIBCXX_CONSTEXPRconstexpr short 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return short(); }

    static _GLIBCXX_CONSTEXPRconstexpr short 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return short(); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<unsigned short> specialization.
template<>
  struct numeric_limits<unsigned short>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __SHRT_MAX__32767 * 2U + 1; }

930#if __cplusplus201103L >= 201103L
    static constexpr unsigned short 
    lowest() noexcept { return min(); }
933#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (unsigned short);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (unsigned short);
939#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
941#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned short>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned short>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned short>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned short 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned short>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<int> specialization.
template<>
  struct numeric_limits<int>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr int 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return -__INT_MAX__2147483647 - 1; }

    static _GLIBCXX_CONSTEXPRconstexpr int 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __INT_MAX__2147483647; }

1003#if __cplusplus201103L >= 201103L
    static constexpr int 
    lowest() noexcept { return min(); }
1006#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (int);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __glibcxx_digits10 (int);
1010#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1012#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr int 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr int 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr int 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr int 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr int 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr int 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<int>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<unsigned int> specialization.
template<>
  struct numeric_limits<unsigned int>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __INT_MAX__2147483647 * 2U + 1; }

1070#if __cplusplus201103L >= 201103L
    static constexpr unsigned int 
    lowest() noexcept { return min(); }
1073#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (unsigned int);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (unsigned int);
1079#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1081#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<unsigned int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned int>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned int 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned int>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<long> specialization.
template<>
  struct numeric_limits<long>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr long
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return -__LONG_MAX__9223372036854775807L - 1; }

    static _GLIBCXX_CONSTEXPRconstexpr long 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LONG_MAX__9223372036854775807L; }

1142#if __cplusplus201103L >= 201103L
    static constexpr long 
    lowest() noexcept { return min(); }
1145#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __glibcxx_digits (long);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __glibcxx_digits10 (long);
1149#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1151#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr long 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr long 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr long 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<unsigned long> specialization.
template<>
  struct numeric_limits<unsigned long>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LONG_MAX__9223372036854775807L * 2UL + 1; }
13
←
Returning the value 18446744073709551615→

1209#if __cplusplus201103L >= 201103L
    static constexpr unsigned long 
    lowest() noexcept { return min(); }
1212#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (unsigned long);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (unsigned long);
1218#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1220#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<long long> specialization.
template<>
  struct numeric_limits<long long>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return -__LONG_LONG_MAX__9223372036854775807LL - 1; }

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LONG_LONG_MAX__9223372036854775807LL; }

1282#if __cplusplus201103L >= 201103L
    static constexpr long long 
    lowest() noexcept { return min(); }
1285#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (long long);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (long long);
1291#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1293#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr long long 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return static_cast<long long>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

/// numeric_limits<unsigned long long> specialization.
template<>
  struct numeric_limits<unsigned long long>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LONG_LONG_MAX__9223372036854775807LL * 2ULL + 1; }

1352#if __cplusplus201103L >= 201103L
    static constexpr unsigned long long 
    lowest() noexcept { return min(); }
1355#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 
     = __glibcxx_digits (unsigned long long);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 
     = __glibcxx_digits10 (unsigned long long);
1361#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10 = 0;
1363#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 
     = denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false;

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long long>(0); }

    static _GLIBCXX_CONSTEXPRconstexpr unsigned long long 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept
    { return static_cast<unsigned long long>(0); }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_toward_zero;
  };

1413#if !defined(__STRICT_ANSI__1)

1415#define __INT_N(TYPE, BITSIZE, EXT, UEXT)			\
template<> 									\
  struct numeric_limits<TYPE> 						\
  { 										\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true; 		\
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_min_b (TYPE, BITSIZE)(((TYPE)(-1) < 0) ? -(((TYPE)(-1) < 0) ? (((((TYPE)1 <<
 ((BITSIZE - ((TYPE)(-1) < 0)) - 1)) - 1) << 1) + 1)
 : ~(TYPE)0) - 1 : (TYPE)0); } \
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __glibcxx_max_b (TYPE, BITSIZE)(((TYPE)(-1) < 0) ? (((((TYPE)1 << ((BITSIZE - ((TYPE
)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(TYPE)0); } 	\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 					\
     = BITSIZE - 1; 								\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 				\
     = (BITSIZE - 1) * 643L / 2136; 						\
    										\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2; 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; } 			\
									\
    EXT									\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0; 			\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 		\
     = denorm_absent; 							\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false; 		\
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept 						\
    { return static_cast<TYPE>(0); } 						\
									\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<TYPE>(0); } 						\
     										\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<TYPE>(0); } 						\
     										\
    static _GLIBCXX_CONSTEXPRconstexpr TYPE 						\
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<TYPE>(0); } 						\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false; 			\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps 					\
     = __glibcxx_integral_trapstrue; 						\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 		\
     = round_toward_zero; 							\
  }; 										\
									\
template<> 									\
  struct numeric_limits<unsigned TYPE> 					\
  { 										\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true; 		\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    max() _GLIBCXX_USE_NOEXCEPTnoexcept						\
    { return  __glibcxx_max_b (unsigned TYPE, BITSIZE)(((unsigned TYPE)(-1) < 0) ? (((((unsigned TYPE)1 <<
 ((BITSIZE - ((unsigned TYPE)(-1) < 0)) - 1)) - 1) <<
 1) + 1) : ~(unsigned TYPE)0); }			\
									\
    UEXT									\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits 					\
     = BITSIZE; 								\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 				\
     = BITSIZE * 643L / 2136; 						\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = false; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = 2; 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0; } 			\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = 0; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = 0; 			\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = false; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm 		\
     = denorm_absent; 							\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss = false; 		\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept 						\
    { return static_cast<unsigned TYPE>(0); } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<unsigned TYPE>(0); } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<unsigned TYPE>(0); } 				\
									\
    static _GLIBCXX_CONSTEXPRconstexpr unsigned TYPE 					\
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept 					\
    { return static_cast<unsigned TYPE>(0); } 				\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559 = false; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true; 			\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = true; 			\
									\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_integral_trapstrue; 	\
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = false; 		\
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 		\
     = round_toward_zero; 							\
  };

1551#if __cplusplus201103L >= 201103L

1553#define __INT_N_201103(TYPE)							\
    static constexpr TYPE 							\
    lowest() noexcept { return min(); }					\
    static constexpr int max_digits10 = 0;

1558#define __INT_N_U201103(TYPE)							\
    static constexpr unsigned TYPE 						\
    lowest() noexcept { return min(); }					\
    static constexpr int max_digits10 = 0;

1563#else
1564#define __INT_N_201103(TYPE)
1565#define __INT_N_U201103(TYPE)
1566#endif

1568#ifdef __GLIBCXX_TYPE_INT_N_0
__INT_N(__GLIBCXX_TYPE_INT_N_0, __GLIBCXX_BITSIZE_INT_N_0,
 __INT_N_201103 (__GLIBCXX_TYPE_INT_N_0), __INT_N_U201103 (__GLIBCXX_TYPE_INT_N_0))
1571#endif
1572#ifdef __GLIBCXX_TYPE_INT_N_1
__INT_N (__GLIBCXX_TYPE_INT_N_1, __GLIBCXX_BITSIZE_INT_N_1,
 __INT_N_201103 (__GLIBCXX_TYPE_INT_N_1), __INT_N_U201103 (__GLIBCXX_TYPE_INT_N_1))
1575#endif
1576#ifdef __GLIBCXX_TYPE_INT_N_2
__INT_N (__GLIBCXX_TYPE_INT_N_2, __GLIBCXX_BITSIZE_INT_N_2,
 __INT_N_201103 (__GLIBCXX_TYPE_INT_N_2), __INT_N_U201103 (__GLIBCXX_TYPE_INT_N_2))
1579#endif
1580#ifdef __GLIBCXX_TYPE_INT_N_3
__INT_N (__GLIBCXX_TYPE_INT_N_3, __GLIBCXX_BITSIZE_INT_N_3,
 __INT_N_201103 (__GLIBCXX_TYPE_INT_N_3), __INT_N_U201103 (__GLIBCXX_TYPE_INT_N_3))
1583#endif

1585#undef __INT_N
1586#undef __INT_N_201103
1587#undef __INT_N_U201103

1589#endif

/// numeric_limits<float> specialization.
template<>
  struct numeric_limits<float>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr float 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __FLT_MIN__1.17549435e-38F; }

    static _GLIBCXX_CONSTEXPRconstexpr float 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __FLT_MAX__3.40282347e+38F; }

1603#if __cplusplus201103L >= 201103L
    static constexpr float 
    lowest() noexcept { return -__FLT_MAX__3.40282347e+38F; }
1606#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __FLT_MANT_DIG__24;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __FLT_DIG__6;
1610#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10
= __glibcxx_max_digits10 (__FLT_MANT_DIG__24);
1613#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = __FLT_RADIX__2;

    static _GLIBCXX_CONSTEXPRconstexpr float 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return __FLT_EPSILON__1.19209290e-7F; }

    static _GLIBCXX_CONSTEXPRconstexpr float 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0.5F; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = __FLT_MIN_EXP__(-125);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = __FLT_MIN_10_EXP__(-37);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = __FLT_MAX_EXP__128;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = __FLT_MAX_10_EXP__38;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = __FLT_HAS_INFINITY__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = __FLT_HAS_QUIET_NAN__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = has_quiet_NaN;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm
= bool(__FLT_HAS_DENORM__1) ? denorm_present : denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss 
     = __glibcxx_float_has_denorm_loss;

    static _GLIBCXX_CONSTEXPRconstexpr float 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_huge_valf(); }

    static _GLIBCXX_CONSTEXPRconstexpr float 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nanf(""); }

    static _GLIBCXX_CONSTEXPRconstexpr float 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nansf(""); }

    static _GLIBCXX_CONSTEXPRconstexpr float 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __FLT_DENORM_MIN__1.40129846e-45F; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559
= has_infinity && has_quiet_NaN && has_denorm == denorm_present;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_float_traps;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before 
     = __glibcxx_float_tinyness_before;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_to_nearest;
  };

1662#undef __glibcxx_float_has_denorm_loss
1663#undef __glibcxx_float_traps
1664#undef __glibcxx_float_tinyness_before

/// numeric_limits<double> specialization.
template<>
  struct numeric_limits<double>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr double 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __DBL_MIN__2.2250738585072014e-308; }

    static _GLIBCXX_CONSTEXPRconstexpr double 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __DBL_MAX__1.7976931348623157e+308; }

1678#if __cplusplus201103L >= 201103L
    static constexpr double 
    lowest() noexcept { return -__DBL_MAX__1.7976931348623157e+308; }
1681#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __DBL_MANT_DIG__53;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __DBL_DIG__15;
1685#if __cplusplus201103L >= 201103L
    static constexpr int max_digits10
= __glibcxx_max_digits10 (__DBL_MANT_DIG__53);
1688#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = __FLT_RADIX__2;

    static _GLIBCXX_CONSTEXPRconstexpr double 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return __DBL_EPSILON__2.2204460492503131e-16; }

    static _GLIBCXX_CONSTEXPRconstexpr double 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0.5; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = __DBL_MIN_EXP__(-1021);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = __DBL_MIN_10_EXP__(-307);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = __DBL_MAX_EXP__1024;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = __DBL_MAX_10_EXP__308;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = __DBL_HAS_INFINITY__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = __DBL_HAS_QUIET_NAN__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = has_quiet_NaN;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm
= bool(__DBL_HAS_DENORM__1) ? denorm_present : denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss 
      = __glibcxx_double_has_denorm_loss;

    static _GLIBCXX_CONSTEXPRconstexpr double 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_huge_val(); }

    static _GLIBCXX_CONSTEXPRconstexpr double 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nan(""); }

    static _GLIBCXX_CONSTEXPRconstexpr double 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nans(""); }

    static _GLIBCXX_CONSTEXPRconstexpr double 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __DBL_DENORM_MIN__4.9406564584124654e-324; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559
= has_infinity && has_quiet_NaN && has_denorm == denorm_present;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_double_traps;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before 
     = __glibcxx_double_tinyness_before;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style 
     = round_to_nearest;
  };

1737#undef __glibcxx_double_has_denorm_loss
1738#undef __glibcxx_double_traps
1739#undef __glibcxx_double_tinyness_before

/// numeric_limits<long double> specialization.
template<>
  struct numeric_limits<long double>
  {
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_specialized = true;

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LDBL_MIN__3.36210314311209350626e-4932L; }

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    max() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LDBL_MAX__1.18973149535723176502e+4932L; }

1753#if __cplusplus201103L >= 201103L
    static constexpr long double 
    lowest() noexcept { return -__LDBL_MAX__1.18973149535723176502e+4932L; }
1756#endif

    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits = __LDBL_MANT_DIG__64;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int digits10 = __LDBL_DIG__18;
1760#if __cplusplus201103L >= 201103L
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_digits10
= __glibcxx_max_digits10 (__LDBL_MANT_DIG__64);
1763#endif
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_signed = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_integer = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_exact = false;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int radix = __FLT_RADIX__2;

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    epsilon() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LDBL_EPSILON__1.08420217248550443401e-19L; }

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    round_error() _GLIBCXX_USE_NOEXCEPTnoexcept { return 0.5L; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent = __LDBL_MIN_EXP__(-16381);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int min_exponent10 = __LDBL_MIN_10_EXP__(-4931);
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent = __LDBL_MAX_EXP__16384;
    static _GLIBCXX_USE_CONSTEXPRconstexpr int max_exponent10 = __LDBL_MAX_10_EXP__4932;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_infinity = __LDBL_HAS_INFINITY__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_quiet_NaN = __LDBL_HAS_QUIET_NAN__1;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_signaling_NaN = has_quiet_NaN;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_denorm_style has_denorm
= bool(__LDBL_HAS_DENORM__1) ? denorm_present : denorm_absent;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool has_denorm_loss
= __glibcxx_long_double_has_denorm_loss;

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    infinity() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_huge_vall(); }

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    quiet_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nanl(""); }

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    signaling_NaN() _GLIBCXX_USE_NOEXCEPTnoexcept { return __builtin_nansl(""); }

    static _GLIBCXX_CONSTEXPRconstexpr long double 
    denorm_min() _GLIBCXX_USE_NOEXCEPTnoexcept { return __LDBL_DENORM_MIN__3.64519953188247460253e-4951L; }

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_iec559
= has_infinity && has_quiet_NaN && has_denorm == denorm_present;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_bounded = true;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool is_modulo = false;

    static _GLIBCXX_USE_CONSTEXPRconstexpr bool traps = __glibcxx_long_double_traps;
    static _GLIBCXX_USE_CONSTEXPRconstexpr bool tinyness_before = 
			 __glibcxx_long_double_tinyness_before;
    static _GLIBCXX_USE_CONSTEXPRconstexpr float_round_style round_style = 
				      round_to_nearest;
  };

1812#undef __glibcxx_long_double_has_denorm_loss
1813#undef __glibcxx_long_double_traps
1814#undef __glibcxx_long_double_tinyness_before

1816_GLIBCXX_END_NAMESPACE_VERSION
1817} // namespace

1819#undef __glibcxx_signed
1820#undef __glibcxx_min
1821#undef __glibcxx_max
1822#undef __glibcxx_digits
1823#undef __glibcxx_digits10
1824#undef __glibcxx_max_digits10

1826#endif // _GLIBCXX_NUMERIC_LIMITS