2013-05-06 16:15:19 +00:00
|
|
|
//===-- SystemZISelDAGToDAG.cpp - A dag to dag inst selector for SystemZ --===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines an instruction selector for the SystemZ target.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "SystemZTargetMachine.h"
|
2013-07-09 09:46:39 +00:00
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
2013-05-06 16:15:19 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAGISel.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Support/raw_ostream.h"
|
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
2014-04-21 22:55:11 +00:00
|
|
|
#define DEBUG_TYPE "systemz-isel"
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
namespace {
|
|
|
|
// Used to build addressing modes.
|
|
|
|
struct SystemZAddressingMode {
|
|
|
|
// The shape of the address.
|
|
|
|
enum AddrForm {
|
|
|
|
// base+displacement
|
|
|
|
FormBD,
|
|
|
|
|
|
|
|
// base+displacement+index for load and store operands
|
|
|
|
FormBDXNormal,
|
|
|
|
|
|
|
|
// base+displacement+index for load address operands
|
|
|
|
FormBDXLA,
|
|
|
|
|
|
|
|
// base+displacement+index+ADJDYNALLOC
|
|
|
|
FormBDXDynAlloc
|
|
|
|
};
|
|
|
|
AddrForm Form;
|
|
|
|
|
|
|
|
// The type of displacement. The enum names here correspond directly
|
|
|
|
// to the definitions in SystemZOperand.td. We could split them into
|
|
|
|
// flags -- single/pair, 128-bit, etc. -- but it hardly seems worth it.
|
|
|
|
enum DispRange {
|
|
|
|
Disp12Only,
|
|
|
|
Disp12Pair,
|
|
|
|
Disp20Only,
|
|
|
|
Disp20Only128,
|
|
|
|
Disp20Pair
|
|
|
|
};
|
|
|
|
DispRange DR;
|
|
|
|
|
|
|
|
// The parts of the address. The address is equivalent to:
|
|
|
|
//
|
|
|
|
// Base + Disp + Index + (IncludesDynAlloc ? ADJDYNALLOC : 0)
|
|
|
|
SDValue Base;
|
|
|
|
int64_t Disp;
|
|
|
|
SDValue Index;
|
|
|
|
bool IncludesDynAlloc;
|
|
|
|
|
|
|
|
SystemZAddressingMode(AddrForm form, DispRange dr)
|
|
|
|
: Form(form), DR(dr), Base(), Disp(0), Index(),
|
|
|
|
IncludesDynAlloc(false) {}
|
|
|
|
|
|
|
|
// True if the address can have an index register.
|
|
|
|
bool hasIndexField() { return Form != FormBD; }
|
|
|
|
|
|
|
|
// True if the address can (and must) include ADJDYNALLOC.
|
|
|
|
bool isDynAlloc() { return Form == FormBDXDynAlloc; }
|
|
|
|
|
|
|
|
void dump() {
|
|
|
|
errs() << "SystemZAddressingMode " << this << '\n';
|
|
|
|
|
|
|
|
errs() << " Base ";
|
2014-04-25 05:30:21 +00:00
|
|
|
if (Base.getNode())
|
2013-05-06 16:15:19 +00:00
|
|
|
Base.getNode()->dump();
|
|
|
|
else
|
|
|
|
errs() << "null\n";
|
|
|
|
|
|
|
|
if (hasIndexField()) {
|
|
|
|
errs() << " Index ";
|
2014-04-25 05:30:21 +00:00
|
|
|
if (Index.getNode())
|
2013-05-06 16:15:19 +00:00
|
|
|
Index.getNode()->dump();
|
|
|
|
else
|
|
|
|
errs() << "null\n";
|
|
|
|
}
|
|
|
|
|
|
|
|
errs() << " Disp " << Disp;
|
|
|
|
if (IncludesDynAlloc)
|
|
|
|
errs() << " + ADJDYNALLOC";
|
|
|
|
errs() << '\n';
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-07-16 11:02:24 +00:00
|
|
|
// Return a mask with Count low bits set.
|
|
|
|
static uint64_t allOnes(unsigned int Count) {
|
|
|
|
return Count == 0 ? 0 : (uint64_t(1) << (Count - 1) << 1) - 1;
|
|
|
|
}
|
|
|
|
|
2013-07-18 10:40:35 +00:00
|
|
|
// Represents operands 2 to 5 of the ROTATE AND ... SELECTED BITS operation
|
|
|
|
// given by Opcode. The operands are: Input (R2), Start (I3), End (I4) and
|
|
|
|
// Rotate (I5). The combined operand value is effectively:
|
|
|
|
//
|
|
|
|
// (or (rotl Input, Rotate), ~Mask)
|
|
|
|
//
|
|
|
|
// for RNSBG and:
|
|
|
|
//
|
|
|
|
// (and (rotl Input, Rotate), Mask)
|
|
|
|
//
|
2013-10-16 13:35:13 +00:00
|
|
|
// otherwise. The output value has BitSize bits, although Input may be
|
|
|
|
// narrower (in which case the upper bits are don't care).
|
2013-07-18 09:45:08 +00:00
|
|
|
struct RxSBGOperands {
|
2013-07-18 10:40:35 +00:00
|
|
|
RxSBGOperands(unsigned Op, SDValue N)
|
|
|
|
: Opcode(Op), BitSize(N.getValueType().getSizeInBits()),
|
|
|
|
Mask(allOnes(BitSize)), Input(N), Start(64 - BitSize), End(63),
|
|
|
|
Rotate(0) {}
|
2013-07-16 11:02:24 +00:00
|
|
|
|
2013-07-18 10:40:35 +00:00
|
|
|
unsigned Opcode;
|
2013-07-16 11:02:24 +00:00
|
|
|
unsigned BitSize;
|
|
|
|
uint64_t Mask;
|
|
|
|
SDValue Input;
|
|
|
|
unsigned Start;
|
|
|
|
unsigned End;
|
|
|
|
unsigned Rotate;
|
|
|
|
};
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
class SystemZDAGToDAGISel : public SelectionDAGISel {
|
2015-01-31 00:06:45 +00:00
|
|
|
const SystemZSubtarget *Subtarget;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Used by SystemZOperands.td to create integer constants.
|
2013-09-27 15:14:04 +00:00
|
|
|
inline SDValue getImm(const SDNode *Node, uint64_t Imm) const {
|
2015-04-28 14:05:47 +00:00
|
|
|
return CurDAG->getTargetConstant(Imm, SDLoc(Node), Node->getValueType(0));
|
2013-05-06 16:15:19 +00:00
|
|
|
}
|
|
|
|
|
2013-07-31 11:36:35 +00:00
|
|
|
const SystemZTargetMachine &getTargetMachine() const {
|
|
|
|
return static_cast<const SystemZTargetMachine &>(TM);
|
|
|
|
}
|
|
|
|
|
|
|
|
const SystemZInstrInfo *getInstrInfo() const {
|
2015-01-31 00:06:45 +00:00
|
|
|
return Subtarget->getInstrInfo();
|
2013-07-31 11:36:35 +00:00
|
|
|
}
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
// Try to fold more of the base or index of AM into AM, where IsBase
|
|
|
|
// selects between the base and index.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool expandAddress(SystemZAddressingMode &AM, bool IsBase) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Try to describe N in AM, returning true on success.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectAddress(SDValue N, SystemZAddressingMode &AM) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Extract individual target operands from matched address AM.
|
|
|
|
void getAddressOperands(const SystemZAddressingMode &AM, EVT VT,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Base, SDValue &Disp) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
void getAddressOperands(const SystemZAddressingMode &AM, EVT VT,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Base, SDValue &Disp, SDValue &Index) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Try to match Addr as a FormBD address with displacement type DR.
|
|
|
|
// Return true on success, storing the base and displacement in
|
|
|
|
// Base and Disp respectively.
|
|
|
|
bool selectBDAddr(SystemZAddressingMode::DispRange DR, SDValue Addr,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Base, SDValue &Disp) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
2013-08-23 11:18:53 +00:00
|
|
|
// Try to match Addr as a FormBDX address with displacement type DR.
|
|
|
|
// Return true on success and if the result had no index. Store the
|
|
|
|
// base and displacement in Base and Disp respectively.
|
|
|
|
bool selectMVIAddr(SystemZAddressingMode::DispRange DR, SDValue Addr,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Base, SDValue &Disp) const;
|
2013-08-23 11:18:53 +00:00
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
// Try to match Addr as a FormBDX* address of form Form with
|
|
|
|
// displacement type DR. Return true on success, storing the base,
|
|
|
|
// displacement and index in Base, Disp and Index respectively.
|
|
|
|
bool selectBDXAddr(SystemZAddressingMode::AddrForm Form,
|
|
|
|
SystemZAddressingMode::DispRange DR, SDValue Addr,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Base, SDValue &Disp, SDValue &Index) const;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// PC-relative address matching routines used by SystemZOperands.td.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectPCRelAddress(SDValue Addr, SDValue &Target) const {
|
|
|
|
if (SystemZISD::isPCREL(Addr.getOpcode())) {
|
2013-05-06 16:15:19 +00:00
|
|
|
Target = Addr.getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// BD matching routines used by SystemZOperands.td.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectBDAddr12Only(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDAddr(SystemZAddressingMode::Disp12Only, Addr, Base, Disp);
|
|
|
|
}
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectBDAddr12Pair(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDAddr(SystemZAddressingMode::Disp12Pair, Addr, Base, Disp);
|
|
|
|
}
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectBDAddr20Only(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDAddr(SystemZAddressingMode::Disp20Only, Addr, Base, Disp);
|
|
|
|
}
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectBDAddr20Pair(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDAddr(SystemZAddressingMode::Disp20Pair, Addr, Base, Disp);
|
|
|
|
}
|
|
|
|
|
2013-08-23 11:18:53 +00:00
|
|
|
// MVI matching routines used by SystemZOperands.td.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectMVIAddr12Pair(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-08-23 11:18:53 +00:00
|
|
|
return selectMVIAddr(SystemZAddressingMode::Disp12Pair, Addr, Base, Disp);
|
|
|
|
}
|
2013-09-27 15:14:04 +00:00
|
|
|
bool selectMVIAddr20Pair(SDValue Addr, SDValue &Base, SDValue &Disp) const {
|
2013-08-23 11:18:53 +00:00
|
|
|
return selectMVIAddr(SystemZAddressingMode::Disp20Pair, Addr, Base, Disp);
|
|
|
|
}
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
// BDX matching routines used by SystemZOperands.td.
|
|
|
|
bool selectBDXAddr12Only(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXNormal,
|
|
|
|
SystemZAddressingMode::Disp12Only,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectBDXAddr12Pair(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXNormal,
|
|
|
|
SystemZAddressingMode::Disp12Pair,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectDynAlloc12Only(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXDynAlloc,
|
|
|
|
SystemZAddressingMode::Disp12Only,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectBDXAddr20Only(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXNormal,
|
|
|
|
SystemZAddressingMode::Disp20Only,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectBDXAddr20Only128(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXNormal,
|
|
|
|
SystemZAddressingMode::Disp20Only128,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectBDXAddr20Pair(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXNormal,
|
|
|
|
SystemZAddressingMode::Disp20Pair,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectLAAddr12Pair(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXLA,
|
|
|
|
SystemZAddressingMode::Disp12Pair,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
bool selectLAAddr20Pair(SDValue Addr, SDValue &Base, SDValue &Disp,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
return selectBDXAddr(SystemZAddressingMode::FormBDXLA,
|
|
|
|
SystemZAddressingMode::Disp20Pair,
|
|
|
|
Addr, Base, Disp, Index);
|
|
|
|
}
|
|
|
|
|
[SystemZ] Add CodeGen support for integer vector types
This the first of a series of patches to add CodeGen support exploiting
the instructions of the z13 vector facility. This patch adds support
for the native integer vector types (v16i8, v8i16, v4i32, v2i64).
When the vector facility is present, we default to the new vector ABI.
This is characterized by two major differences:
- Vector types are passed/returned in vector registers
(except for unnamed arguments of a variable-argument list function).
- Vector types are at most 8-byte aligned.
The reason for the choice of 8-byte vector alignment is that the hardware
is able to efficiently load vectors at 8-byte alignment, and the ABI only
guarantees 8-byte alignment of the stack pointer, so requiring any higher
alignment for vectors would require dynamic stack re-alignment code.
However, for compatibility with old code that may use vector types, when
*not* using the vector facility, the old alignment rules (vector types
are naturally aligned) remain in use.
These alignment rules are not only implemented at the C language level
(implemented in clang), but also at the LLVM IR level. This is done
by selecting a different DataLayout string depending on whether the
vector ABI is in effect or not.
Based on a patch by Richard Sandiford.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236521 91177308-0d34-0410-b5e6-96231b3b80d8
2015-05-05 19:25:42 +00:00
|
|
|
// Try to match Addr as an address with a base, 12-bit displacement
|
|
|
|
// and index, where the index is element Elem of a vector.
|
|
|
|
// Return true on success, storing the base, displacement and vector
|
|
|
|
// in Base, Disp and Index respectively.
|
|
|
|
bool selectBDVAddr12Only(SDValue Addr, SDValue Elem, SDValue &Base,
|
|
|
|
SDValue &Disp, SDValue &Index) const;
|
|
|
|
|
2013-07-16 11:55:57 +00:00
|
|
|
// Check whether (or Op (and X InsertMask)) is effectively an insertion
|
|
|
|
// of X into bits InsertMask of some Y != Op. Return true if so and
|
|
|
|
// set Op to that Y.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool detectOrAndInsertion(SDValue &Op, uint64_t InsertMask) const;
|
2013-07-16 11:55:57 +00:00
|
|
|
|
2013-07-31 11:36:35 +00:00
|
|
|
// Try to update RxSBG so that only the bits of RxSBG.Input in Mask are used.
|
|
|
|
// Return true on success.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool refineRxSBGMask(RxSBGOperands &RxSBG, uint64_t Mask) const;
|
2013-07-31 11:36:35 +00:00
|
|
|
|
2013-07-18 09:45:08 +00:00
|
|
|
// Try to fold some of RxSBG.Input into other fields of RxSBG.
|
|
|
|
// Return true on success.
|
2013-09-27 15:14:04 +00:00
|
|
|
bool expandRxSBG(RxSBGOperands &RxSBG) const;
|
2013-07-16 11:02:24 +00:00
|
|
|
|
2013-10-01 14:36:20 +00:00
|
|
|
// Return an undefined value of type VT.
|
|
|
|
SDValue getUNDEF(SDLoc DL, EVT VT) const;
|
2013-07-11 08:59:12 +00:00
|
|
|
|
|
|
|
// Convert N to VT, if it isn't already.
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue convertTo(SDLoc DL, EVT VT, SDValue N) const;
|
2013-07-11 08:59:12 +00:00
|
|
|
|
2013-07-16 11:02:24 +00:00
|
|
|
// Try to implement AND or shift node N using RISBG with the zero flag set.
|
|
|
|
// Return the selected node on success, otherwise return null.
|
|
|
|
SDNode *tryRISBGZero(SDNode *N);
|
2013-07-11 08:59:12 +00:00
|
|
|
|
2013-07-18 10:06:15 +00:00
|
|
|
// Try to use RISBG or Opcode to implement OR or XOR node N.
|
|
|
|
// Return the selected node on success, otherwise return null.
|
|
|
|
SDNode *tryRxSBG(SDNode *N, unsigned Opcode);
|
2013-07-16 11:55:57 +00:00
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
// If Op0 is null, then Node is a constant that can be loaded using:
|
|
|
|
//
|
|
|
|
// (Opcode UpperVal LowerVal)
|
|
|
|
//
|
|
|
|
// If Op0 is nonnull, then Node can be implemented using:
|
|
|
|
//
|
|
|
|
// (Opcode (Opcode Op0 UpperVal) LowerVal)
|
|
|
|
SDNode *splitLargeImmediate(unsigned Opcode, SDNode *Node, SDValue Op0,
|
|
|
|
uint64_t UpperVal, uint64_t LowerVal);
|
|
|
|
|
[SystemZ] Add CodeGen support for integer vector types
This the first of a series of patches to add CodeGen support exploiting
the instructions of the z13 vector facility. This patch adds support
for the native integer vector types (v16i8, v8i16, v4i32, v2i64).
When the vector facility is present, we default to the new vector ABI.
This is characterized by two major differences:
- Vector types are passed/returned in vector registers
(except for unnamed arguments of a variable-argument list function).
- Vector types are at most 8-byte aligned.
The reason for the choice of 8-byte vector alignment is that the hardware
is able to efficiently load vectors at 8-byte alignment, and the ABI only
guarantees 8-byte alignment of the stack pointer, so requiring any higher
alignment for vectors would require dynamic stack re-alignment code.
However, for compatibility with old code that may use vector types, when
*not* using the vector facility, the old alignment rules (vector types
are naturally aligned) remain in use.
These alignment rules are not only implemented at the C language level
(implemented in clang), but also at the LLVM IR level. This is done
by selecting a different DataLayout string depending on whether the
vector ABI is in effect or not.
Based on a patch by Richard Sandiford.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236521 91177308-0d34-0410-b5e6-96231b3b80d8
2015-05-05 19:25:42 +00:00
|
|
|
// Try to use gather instruction Opcode to implement vector insertion N.
|
|
|
|
SDNode *tryGather(SDNode *N, unsigned Opcode);
|
|
|
|
|
|
|
|
// Try to use scatter instruction Opcode to implement store Store.
|
|
|
|
SDNode *tryScatter(StoreSDNode *Store, unsigned Opcode);
|
|
|
|
|
2013-09-27 15:29:20 +00:00
|
|
|
// Return true if Load and Store are loads and stores of the same size
|
|
|
|
// and are guaranteed not to overlap. Such operations can be implemented
|
|
|
|
// using block (SS-format) instructions.
|
|
|
|
//
|
|
|
|
// Partial overlap would lead to incorrect code, since the block operations
|
|
|
|
// are logically bytewise, even though they have a fast path for the
|
|
|
|
// non-overlapping case. We also need to avoid full overlap (i.e. two
|
|
|
|
// addresses that might be equal at run time) because although that case
|
|
|
|
// would be handled correctly, it might be implemented by millicode.
|
|
|
|
bool canUseBlockOperation(StoreSDNode *Store, LoadSDNode *Load) const;
|
|
|
|
|
2013-09-05 10:36:45 +00:00
|
|
|
// N is a (store (load Y), X) pattern. Return true if it can use an MVC
|
|
|
|
// from Y to X.
|
2013-07-09 09:46:39 +00:00
|
|
|
bool storeLoadCanUseMVC(SDNode *N) const;
|
|
|
|
|
2013-09-05 10:36:45 +00:00
|
|
|
// N is a (store (op (load A[0]), (load A[1])), X) pattern. Return true
|
|
|
|
// if A[1 - I] == X and if N can use a block operation like NC from A[I]
|
|
|
|
// to X.
|
|
|
|
bool storeLoadCanUseBlockBinary(SDNode *N, unsigned I) const;
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
public:
|
|
|
|
SystemZDAGToDAGISel(SystemZTargetMachine &TM, CodeGenOpt::Level OptLevel)
|
2015-01-31 00:06:45 +00:00
|
|
|
: SelectionDAGISel(TM, OptLevel) {}
|
|
|
|
|
|
|
|
bool runOnMachineFunction(MachineFunction &MF) override {
|
|
|
|
Subtarget = &MF.getSubtarget<SystemZSubtarget>();
|
|
|
|
return SelectionDAGISel::runOnMachineFunction(MF);
|
|
|
|
}
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Override MachineFunctionPass.
|
2014-03-06 12:03:36 +00:00
|
|
|
const char *getPassName() const override {
|
2013-05-06 16:15:19 +00:00
|
|
|
return "SystemZ DAG->DAG Pattern Instruction Selection";
|
|
|
|
}
|
|
|
|
|
|
|
|
// Override SelectionDAGISel.
|
2014-03-06 12:03:36 +00:00
|
|
|
SDNode *Select(SDNode *Node) override;
|
2015-03-13 12:45:09 +00:00
|
|
|
bool SelectInlineAsmMemoryOperand(const SDValue &Op, unsigned ConstraintID,
|
2014-03-06 12:03:36 +00:00
|
|
|
std::vector<SDValue> &OutOps) override;
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
// Include the pieces autogenerated from the target description.
|
|
|
|
#include "SystemZGenDAGISel.inc"
|
|
|
|
};
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
FunctionPass *llvm::createSystemZISelDag(SystemZTargetMachine &TM,
|
|
|
|
CodeGenOpt::Level OptLevel) {
|
|
|
|
return new SystemZDAGToDAGISel(TM, OptLevel);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if Val should be selected as a displacement for an address
|
|
|
|
// with range DR. Here we're interested in the range of both the instruction
|
|
|
|
// described by DR and of any pairing instruction.
|
|
|
|
static bool selectDisp(SystemZAddressingMode::DispRange DR, int64_t Val) {
|
|
|
|
switch (DR) {
|
|
|
|
case SystemZAddressingMode::Disp12Only:
|
|
|
|
return isUInt<12>(Val);
|
|
|
|
|
|
|
|
case SystemZAddressingMode::Disp12Pair:
|
|
|
|
case SystemZAddressingMode::Disp20Only:
|
|
|
|
case SystemZAddressingMode::Disp20Pair:
|
|
|
|
return isInt<20>(Val);
|
|
|
|
|
|
|
|
case SystemZAddressingMode::Disp20Only128:
|
|
|
|
return isInt<20>(Val) && isInt<20>(Val + 8);
|
|
|
|
}
|
|
|
|
llvm_unreachable("Unhandled displacement range");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Change the base or index in AM to Value, where IsBase selects
|
|
|
|
// between the base and index.
|
|
|
|
static void changeComponent(SystemZAddressingMode &AM, bool IsBase,
|
|
|
|
SDValue Value) {
|
|
|
|
if (IsBase)
|
|
|
|
AM.Base = Value;
|
|
|
|
else
|
|
|
|
AM.Index = Value;
|
|
|
|
}
|
|
|
|
|
|
|
|
// The base or index of AM is equivalent to Value + ADJDYNALLOC,
|
|
|
|
// where IsBase selects between the base and index. Try to fold the
|
|
|
|
// ADJDYNALLOC into AM.
|
|
|
|
static bool expandAdjDynAlloc(SystemZAddressingMode &AM, bool IsBase,
|
|
|
|
SDValue Value) {
|
|
|
|
if (AM.isDynAlloc() && !AM.IncludesDynAlloc) {
|
|
|
|
changeComponent(AM, IsBase, Value);
|
|
|
|
AM.IncludesDynAlloc = true;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// The base of AM is equivalent to Base + Index. Try to use Index as
|
|
|
|
// the index register.
|
|
|
|
static bool expandIndex(SystemZAddressingMode &AM, SDValue Base,
|
|
|
|
SDValue Index) {
|
|
|
|
if (AM.hasIndexField() && !AM.Index.getNode()) {
|
|
|
|
AM.Base = Base;
|
|
|
|
AM.Index = Index;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// The base or index of AM is equivalent to Op0 + Op1, where IsBase selects
|
|
|
|
// between the base and index. Try to fold Op1 into AM's displacement.
|
|
|
|
static bool expandDisp(SystemZAddressingMode &AM, bool IsBase,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue Op0, uint64_t Op1) {
|
2013-05-06 16:15:19 +00:00
|
|
|
// First try adjusting the displacement.
|
2013-09-27 15:14:04 +00:00
|
|
|
int64_t TestDisp = AM.Disp + Op1;
|
2013-05-06 16:15:19 +00:00
|
|
|
if (selectDisp(AM.DR, TestDisp)) {
|
|
|
|
changeComponent(AM, IsBase, Op0);
|
|
|
|
AM.Disp = TestDisp;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We could consider forcing the displacement into a register and
|
|
|
|
// using it as an index, but it would need to be carefully tuned.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SystemZDAGToDAGISel::expandAddress(SystemZAddressingMode &AM,
|
2013-09-27 15:14:04 +00:00
|
|
|
bool IsBase) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
SDValue N = IsBase ? AM.Base : AM.Index;
|
|
|
|
unsigned Opcode = N.getOpcode();
|
|
|
|
if (Opcode == ISD::TRUNCATE) {
|
|
|
|
N = N.getOperand(0);
|
|
|
|
Opcode = N.getOpcode();
|
|
|
|
}
|
|
|
|
if (Opcode == ISD::ADD || CurDAG->isBaseWithConstantOffset(N)) {
|
|
|
|
SDValue Op0 = N.getOperand(0);
|
|
|
|
SDValue Op1 = N.getOperand(1);
|
|
|
|
|
|
|
|
unsigned Op0Code = Op0->getOpcode();
|
|
|
|
unsigned Op1Code = Op1->getOpcode();
|
|
|
|
|
|
|
|
if (Op0Code == SystemZISD::ADJDYNALLOC)
|
|
|
|
return expandAdjDynAlloc(AM, IsBase, Op1);
|
|
|
|
if (Op1Code == SystemZISD::ADJDYNALLOC)
|
|
|
|
return expandAdjDynAlloc(AM, IsBase, Op0);
|
|
|
|
|
|
|
|
if (Op0Code == ISD::Constant)
|
2013-09-27 15:14:04 +00:00
|
|
|
return expandDisp(AM, IsBase, Op1,
|
|
|
|
cast<ConstantSDNode>(Op0)->getSExtValue());
|
2013-05-06 16:15:19 +00:00
|
|
|
if (Op1Code == ISD::Constant)
|
2013-09-27 15:14:04 +00:00
|
|
|
return expandDisp(AM, IsBase, Op0,
|
|
|
|
cast<ConstantSDNode>(Op1)->getSExtValue());
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
if (IsBase && expandIndex(AM, Op0, Op1))
|
|
|
|
return true;
|
|
|
|
}
|
2013-09-27 15:14:04 +00:00
|
|
|
if (Opcode == SystemZISD::PCREL_OFFSET) {
|
|
|
|
SDValue Full = N.getOperand(0);
|
|
|
|
SDValue Base = N.getOperand(1);
|
|
|
|
SDValue Anchor = Base.getOperand(0);
|
|
|
|
uint64_t Offset = (cast<GlobalAddressSDNode>(Full)->getOffset() -
|
|
|
|
cast<GlobalAddressSDNode>(Anchor)->getOffset());
|
|
|
|
return expandDisp(AM, IsBase, Base, Offset);
|
|
|
|
}
|
2013-05-06 16:15:19 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if an instruction with displacement range DR should be
|
|
|
|
// used for displacement value Val. selectDisp(DR, Val) must already hold.
|
|
|
|
static bool isValidDisp(SystemZAddressingMode::DispRange DR, int64_t Val) {
|
|
|
|
assert(selectDisp(DR, Val) && "Invalid displacement");
|
|
|
|
switch (DR) {
|
|
|
|
case SystemZAddressingMode::Disp12Only:
|
|
|
|
case SystemZAddressingMode::Disp20Only:
|
|
|
|
case SystemZAddressingMode::Disp20Only128:
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case SystemZAddressingMode::Disp12Pair:
|
|
|
|
// Use the other instruction if the displacement is too large.
|
|
|
|
return isUInt<12>(Val);
|
|
|
|
|
|
|
|
case SystemZAddressingMode::Disp20Pair:
|
|
|
|
// Use the other instruction if the displacement is small enough.
|
|
|
|
return !isUInt<12>(Val);
|
|
|
|
}
|
|
|
|
llvm_unreachable("Unhandled displacement range");
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if Base + Disp + Index should be performed by LA(Y).
|
|
|
|
static bool shouldUseLA(SDNode *Base, int64_t Disp, SDNode *Index) {
|
|
|
|
// Don't use LA(Y) for constants.
|
|
|
|
if (!Base)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Always use LA(Y) for frame addresses, since we know that the destination
|
|
|
|
// register is almost always (perhaps always) going to be different from
|
|
|
|
// the frame register.
|
|
|
|
if (Base->getOpcode() == ISD::FrameIndex)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (Disp) {
|
|
|
|
// Always use LA(Y) if there is a base, displacement and index.
|
|
|
|
if (Index)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Always use LA if the displacement is small enough. It should always
|
|
|
|
// be no worse than AGHI (and better if it avoids a move).
|
|
|
|
if (isUInt<12>(Disp))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// For similar reasons, always use LAY if the constant is too big for AGHI.
|
|
|
|
// LAY should be no worse than AGFI.
|
|
|
|
if (!isInt<16>(Disp))
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
// Don't use LA for plain registers.
|
|
|
|
if (!Index)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Don't use LA for plain addition if the index operand is only used
|
|
|
|
// once. It should be a natural two-operand addition in that case.
|
|
|
|
if (Index->hasOneUse())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Prefer addition if the second operation is sign-extended, in the
|
|
|
|
// hope of using AGF.
|
|
|
|
unsigned IndexOpcode = Index->getOpcode();
|
|
|
|
if (IndexOpcode == ISD::SIGN_EXTEND ||
|
|
|
|
IndexOpcode == ISD::SIGN_EXTEND_INREG)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Don't use LA for two-operand addition if either operand is only
|
|
|
|
// used once. The addition instructions are better in that case.
|
|
|
|
if (Base->hasOneUse())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return true if Addr is suitable for AM, updating AM if so.
|
|
|
|
bool SystemZDAGToDAGISel::selectAddress(SDValue Addr,
|
2013-09-27 15:14:04 +00:00
|
|
|
SystemZAddressingMode &AM) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
// Start out assuming that the address will need to be loaded separately,
|
|
|
|
// then try to extend it as much as we can.
|
|
|
|
AM.Base = Addr;
|
|
|
|
|
|
|
|
// First try treating the address as a constant.
|
|
|
|
if (Addr.getOpcode() == ISD::Constant &&
|
2013-09-27 15:14:04 +00:00
|
|
|
expandDisp(AM, true, SDValue(),
|
|
|
|
cast<ConstantSDNode>(Addr)->getSExtValue()))
|
2013-05-06 16:15:19 +00:00
|
|
|
;
|
|
|
|
else
|
|
|
|
// Otherwise try expanding each component.
|
|
|
|
while (expandAddress(AM, true) ||
|
|
|
|
(AM.Index.getNode() && expandAddress(AM, false)))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Reject cases where it isn't profitable to use LA(Y).
|
|
|
|
if (AM.Form == SystemZAddressingMode::FormBDXLA &&
|
|
|
|
!shouldUseLA(AM.Base.getNode(), AM.Disp, AM.Index.getNode()))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Reject cases where the other instruction in a pair should be used.
|
|
|
|
if (!isValidDisp(AM.DR, AM.Disp))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Make sure that ADJDYNALLOC is included where necessary.
|
|
|
|
if (AM.isDynAlloc() && !AM.IncludesDynAlloc)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
DEBUG(AM.dump());
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Insert a node into the DAG at least before Pos. This will reposition
|
|
|
|
// the node as needed, and will assign it a node ID that is <= Pos's ID.
|
|
|
|
// Note that this does *not* preserve the uniqueness of node IDs!
|
|
|
|
// The selection DAG must no longer depend on their uniqueness when this
|
|
|
|
// function is used.
|
|
|
|
static void insertDAGNode(SelectionDAG *DAG, SDNode *Pos, SDValue N) {
|
|
|
|
if (N.getNode()->getNodeId() == -1 ||
|
|
|
|
N.getNode()->getNodeId() > Pos->getNodeId()) {
|
|
|
|
DAG->RepositionNode(Pos, N.getNode());
|
|
|
|
N.getNode()->setNodeId(Pos->getNodeId());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void SystemZDAGToDAGISel::getAddressOperands(const SystemZAddressingMode &AM,
|
|
|
|
EVT VT, SDValue &Base,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
Base = AM.Base;
|
|
|
|
if (!Base.getNode())
|
|
|
|
// Register 0 means "no base". This is mostly useful for shifts.
|
|
|
|
Base = CurDAG->getRegister(0, VT);
|
|
|
|
else if (Base.getOpcode() == ISD::FrameIndex) {
|
|
|
|
// Lower a FrameIndex to a TargetFrameIndex.
|
|
|
|
int64_t FrameIndex = cast<FrameIndexSDNode>(Base)->getIndex();
|
|
|
|
Base = CurDAG->getTargetFrameIndex(FrameIndex, VT);
|
|
|
|
} else if (Base.getValueType() != VT) {
|
|
|
|
// Truncate values from i64 to i32, for shifts.
|
|
|
|
assert(VT == MVT::i32 && Base.getValueType() == MVT::i64 &&
|
|
|
|
"Unexpected truncation");
|
2013-05-25 02:42:55 +00:00
|
|
|
SDLoc DL(Base);
|
2013-05-06 16:15:19 +00:00
|
|
|
SDValue Trunc = CurDAG->getNode(ISD::TRUNCATE, DL, VT, Base);
|
|
|
|
insertDAGNode(CurDAG, Base.getNode(), Trunc);
|
|
|
|
Base = Trunc;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Lower the displacement to a TargetConstant.
|
2015-04-28 14:05:47 +00:00
|
|
|
Disp = CurDAG->getTargetConstant(AM.Disp, SDLoc(Base), VT);
|
2013-05-06 16:15:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void SystemZDAGToDAGISel::getAddressOperands(const SystemZAddressingMode &AM,
|
|
|
|
EVT VT, SDValue &Base,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Disp,
|
|
|
|
SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
getAddressOperands(AM, VT, Base, Disp);
|
|
|
|
|
|
|
|
Index = AM.Index;
|
|
|
|
if (!Index.getNode())
|
|
|
|
// Register 0 means "no index".
|
|
|
|
Index = CurDAG->getRegister(0, VT);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SystemZDAGToDAGISel::selectBDAddr(SystemZAddressingMode::DispRange DR,
|
|
|
|
SDValue Addr, SDValue &Base,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Disp) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
SystemZAddressingMode AM(SystemZAddressingMode::FormBD, DR);
|
|
|
|
if (!selectAddress(Addr, AM))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
getAddressOperands(AM, Addr.getValueType(), Base, Disp);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-08-23 11:18:53 +00:00
|
|
|
bool SystemZDAGToDAGISel::selectMVIAddr(SystemZAddressingMode::DispRange DR,
|
|
|
|
SDValue Addr, SDValue &Base,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Disp) const {
|
2013-08-23 11:18:53 +00:00
|
|
|
SystemZAddressingMode AM(SystemZAddressingMode::FormBDXNormal, DR);
|
|
|
|
if (!selectAddress(Addr, AM) || AM.Index.getNode())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
getAddressOperands(AM, Addr.getValueType(), Base, Disp);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
bool SystemZDAGToDAGISel::selectBDXAddr(SystemZAddressingMode::AddrForm Form,
|
|
|
|
SystemZAddressingMode::DispRange DR,
|
|
|
|
SDValue Addr, SDValue &Base,
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue &Disp, SDValue &Index) const {
|
2013-05-06 16:15:19 +00:00
|
|
|
SystemZAddressingMode AM(Form, DR);
|
|
|
|
if (!selectAddress(Addr, AM))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
getAddressOperands(AM, Addr.getValueType(), Base, Disp, Index);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
[SystemZ] Add CodeGen support for integer vector types
This the first of a series of patches to add CodeGen support exploiting
the instructions of the z13 vector facility. This patch adds support
for the native integer vector types (v16i8, v8i16, v4i32, v2i64).
When the vector facility is present, we default to the new vector ABI.
This is characterized by two major differences:
- Vector types are passed/returned in vector registers
(except for unnamed arguments of a variable-argument list function).
- Vector types are at most 8-byte aligned.
The reason for the choice of 8-byte vector alignment is that the hardware
is able to efficiently load vectors at 8-byte alignment, and the ABI only
guarantees 8-byte alignment of the stack pointer, so requiring any higher
alignment for vectors would require dynamic stack re-alignment code.
However, for compatibility with old code that may use vector types, when
*not* using the vector facility, the old alignment rules (vector types
are naturally aligned) remain in use.
These alignment rules are not only implemented at the C language level
(implemented in clang), but also at the LLVM IR level. This is done
by selecting a different DataLayout string depending on whether the
vector ABI is in effect or not.
Based on a patch by Richard Sandiford.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236521 91177308-0d34-0410-b5e6-96231b3b80d8
2015-05-05 19:25:42 +00:00
|
|
|
bool SystemZDAGToDAGISel::selectBDVAddr12Only(SDValue Addr, SDValue Elem,
|
|
|
|
SDValue &Base,
|
|
|
|
SDValue &Disp,
|
|
|
|
SDValue &Index) const {
|
|
|
|
SDValue Regs[2];
|
|
|
|
if (selectBDXAddr12Only(Addr, Regs[0], Disp, Regs[1]) &&
|
|
|
|
Regs[0].getNode() && Regs[1].getNode()) {
|
|
|
|
for (unsigned int I = 0; I < 2; ++I) {
|
|
|
|
Base = Regs[I];
|
|
|
|
Index = Regs[1 - I];
|
|
|
|
// We can't tell here whether the index vector has the right type
|
|
|
|
// for the access; the caller needs to do that instead.
|
|
|
|
if (Index.getOpcode() == ISD::ZERO_EXTEND)
|
|
|
|
Index = Index.getOperand(0);
|
|
|
|
if (Index.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
|
|
|
|
Index.getOperand(1) == Elem) {
|
|
|
|
Index = Index.getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-07-16 11:55:57 +00:00
|
|
|
bool SystemZDAGToDAGISel::detectOrAndInsertion(SDValue &Op,
|
2013-09-27 15:14:04 +00:00
|
|
|
uint64_t InsertMask) const {
|
2013-07-16 11:55:57 +00:00
|
|
|
// We're only interested in cases where the insertion is into some operand
|
|
|
|
// of Op, rather than into Op itself. The only useful case is an AND.
|
|
|
|
if (Op.getOpcode() != ISD::AND)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// We need a constant mask.
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *MaskNode = dyn_cast<ConstantSDNode>(Op.getOperand(1).getNode());
|
2013-07-16 11:55:57 +00:00
|
|
|
if (!MaskNode)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// It's not an insertion of Op.getOperand(0) if the two masks overlap.
|
|
|
|
uint64_t AndMask = MaskNode->getZExtValue();
|
|
|
|
if (InsertMask & AndMask)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// It's only an insertion if all bits are covered or are known to be zero.
|
|
|
|
// The inner check covers all cases but is more expensive.
|
|
|
|
uint64_t Used = allOnes(Op.getValueType().getSizeInBits());
|
|
|
|
if (Used != (AndMask | InsertMask)) {
|
|
|
|
APInt KnownZero, KnownOne;
|
2014-05-14 21:14:37 +00:00
|
|
|
CurDAG->computeKnownBits(Op.getOperand(0), KnownZero, KnownOne);
|
2013-07-16 11:55:57 +00:00
|
|
|
if (Used != (AndMask | InsertMask | KnownZero.getZExtValue()))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
Op = Op.getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-09-27 15:14:04 +00:00
|
|
|
bool SystemZDAGToDAGISel::refineRxSBGMask(RxSBGOperands &RxSBG,
|
|
|
|
uint64_t Mask) const {
|
2013-07-31 11:36:35 +00:00
|
|
|
const SystemZInstrInfo *TII = getInstrInfo();
|
2013-07-18 09:45:08 +00:00
|
|
|
if (RxSBG.Rotate != 0)
|
|
|
|
Mask = (Mask << RxSBG.Rotate) | (Mask >> (64 - RxSBG.Rotate));
|
|
|
|
Mask &= RxSBG.Mask;
|
2013-07-31 11:36:35 +00:00
|
|
|
if (TII->isRxSBGMask(Mask, RxSBG.BitSize, RxSBG.Start, RxSBG.End)) {
|
2013-07-18 09:45:08 +00:00
|
|
|
RxSBG.Mask = Mask;
|
|
|
|
return true;
|
|
|
|
}
|
2013-07-11 08:59:12 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-11-26 10:53:16 +00:00
|
|
|
// Return true if any bits of (RxSBG.Input & Mask) are significant.
|
|
|
|
static bool maskMatters(RxSBGOperands &RxSBG, uint64_t Mask) {
|
|
|
|
// Rotate the mask in the same way as RxSBG.Input is rotated.
|
2013-07-18 10:14:55 +00:00
|
|
|
if (RxSBG.Rotate != 0)
|
2013-11-26 10:53:16 +00:00
|
|
|
Mask = ((Mask << RxSBG.Rotate) | (Mask >> (64 - RxSBG.Rotate)));
|
|
|
|
return (Mask & RxSBG.Mask) != 0;
|
2013-07-18 10:14:55 +00:00
|
|
|
}
|
|
|
|
|
2013-09-27 15:14:04 +00:00
|
|
|
bool SystemZDAGToDAGISel::expandRxSBG(RxSBGOperands &RxSBG) const {
|
2013-07-18 09:45:08 +00:00
|
|
|
SDValue N = RxSBG.Input;
|
2013-07-18 10:14:55 +00:00
|
|
|
unsigned Opcode = N.getOpcode();
|
|
|
|
switch (Opcode) {
|
2013-07-16 11:02:24 +00:00
|
|
|
case ISD::AND: {
|
2013-07-18 10:40:35 +00:00
|
|
|
if (RxSBG.Opcode == SystemZ::RNSBG)
|
|
|
|
return false;
|
|
|
|
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *MaskNode = dyn_cast<ConstantSDNode>(N.getOperand(1).getNode());
|
2013-07-16 11:02:24 +00:00
|
|
|
if (!MaskNode)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
SDValue Input = N.getOperand(0);
|
|
|
|
uint64_t Mask = MaskNode->getZExtValue();
|
2013-07-18 09:45:08 +00:00
|
|
|
if (!refineRxSBGMask(RxSBG, Mask)) {
|
2013-07-16 11:02:24 +00:00
|
|
|
// If some bits of Input are already known zeros, those bits will have
|
|
|
|
// been removed from the mask. See if adding them back in makes the
|
|
|
|
// mask suitable.
|
|
|
|
APInt KnownZero, KnownOne;
|
2014-05-14 21:14:37 +00:00
|
|
|
CurDAG->computeKnownBits(Input, KnownZero, KnownOne);
|
2013-07-16 11:02:24 +00:00
|
|
|
Mask |= KnownZero.getZExtValue();
|
2013-07-18 09:45:08 +00:00
|
|
|
if (!refineRxSBGMask(RxSBG, Mask))
|
2013-07-16 11:02:24 +00:00
|
|
|
return false;
|
|
|
|
}
|
2013-07-18 09:45:08 +00:00
|
|
|
RxSBG.Input = Input;
|
2013-07-16 11:02:24 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-07-18 10:40:35 +00:00
|
|
|
case ISD::OR: {
|
|
|
|
if (RxSBG.Opcode != SystemZ::RNSBG)
|
|
|
|
return false;
|
|
|
|
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *MaskNode = dyn_cast<ConstantSDNode>(N.getOperand(1).getNode());
|
2013-07-18 10:40:35 +00:00
|
|
|
if (!MaskNode)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
SDValue Input = N.getOperand(0);
|
|
|
|
uint64_t Mask = ~MaskNode->getZExtValue();
|
|
|
|
if (!refineRxSBGMask(RxSBG, Mask)) {
|
|
|
|
// If some bits of Input are already known ones, those bits will have
|
|
|
|
// been removed from the mask. See if adding them back in makes the
|
|
|
|
// mask suitable.
|
|
|
|
APInt KnownZero, KnownOne;
|
2014-05-14 21:14:37 +00:00
|
|
|
CurDAG->computeKnownBits(Input, KnownZero, KnownOne);
|
2013-07-18 10:40:35 +00:00
|
|
|
Mask &= ~KnownOne.getZExtValue();
|
|
|
|
if (!refineRxSBGMask(RxSBG, Mask))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
RxSBG.Input = Input;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-07-16 11:02:24 +00:00
|
|
|
case ISD::ROTL: {
|
2013-07-18 09:45:08 +00:00
|
|
|
// Any 64-bit rotate left can be merged into the RxSBG.
|
2013-10-16 13:35:13 +00:00
|
|
|
if (RxSBG.BitSize != 64 || N.getValueType() != MVT::i64)
|
2013-07-16 11:02:24 +00:00
|
|
|
return false;
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *CountNode = dyn_cast<ConstantSDNode>(N.getOperand(1).getNode());
|
2013-07-16 11:02:24 +00:00
|
|
|
if (!CountNode)
|
|
|
|
return false;
|
|
|
|
|
2013-07-18 09:45:08 +00:00
|
|
|
RxSBG.Rotate = (RxSBG.Rotate + CountNode->getZExtValue()) & 63;
|
|
|
|
RxSBG.Input = N.getOperand(0);
|
2013-07-16 11:02:24 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-12-20 11:49:48 +00:00
|
|
|
case ISD::ANY_EXTEND:
|
|
|
|
// Bits above the extended operand are don't-care.
|
|
|
|
RxSBG.Input = N.getOperand(0);
|
|
|
|
return true;
|
|
|
|
|
2014-01-09 11:28:53 +00:00
|
|
|
case ISD::ZERO_EXTEND:
|
|
|
|
if (RxSBG.Opcode != SystemZ::RNSBG) {
|
|
|
|
// Restrict the mask to the extended operand.
|
|
|
|
unsigned InnerBitSize = N.getOperand(0).getValueType().getSizeInBits();
|
|
|
|
if (!refineRxSBGMask(RxSBG, allOnes(InnerBitSize)))
|
|
|
|
return false;
|
2013-12-20 11:49:48 +00:00
|
|
|
|
2014-01-09 11:28:53 +00:00
|
|
|
RxSBG.Input = N.getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
// Fall through.
|
2013-12-20 11:49:48 +00:00
|
|
|
|
|
|
|
case ISD::SIGN_EXTEND: {
|
2013-10-16 13:35:13 +00:00
|
|
|
// Check that the extension bits are don't-care (i.e. are masked out
|
|
|
|
// by the final mask).
|
|
|
|
unsigned InnerBitSize = N.getOperand(0).getValueType().getSizeInBits();
|
2013-11-26 10:53:16 +00:00
|
|
|
if (maskMatters(RxSBG, allOnes(RxSBG.BitSize) - allOnes(InnerBitSize)))
|
2013-10-16 13:35:13 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
RxSBG.Input = N.getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-07-16 11:02:24 +00:00
|
|
|
case ISD::SHL: {
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *CountNode = dyn_cast<ConstantSDNode>(N.getOperand(1).getNode());
|
2013-07-16 11:02:24 +00:00
|
|
|
if (!CountNode)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
uint64_t Count = CountNode->getZExtValue();
|
2013-10-16 13:35:13 +00:00
|
|
|
unsigned BitSize = N.getValueType().getSizeInBits();
|
|
|
|
if (Count < 1 || Count >= BitSize)
|
2013-07-16 11:02:24 +00:00
|
|
|
return false;
|
|
|
|
|
2013-07-18 10:40:35 +00:00
|
|
|
if (RxSBG.Opcode == SystemZ::RNSBG) {
|
|
|
|
// Treat (shl X, count) as (rotl X, size-count) as long as the bottom
|
|
|
|
// count bits from RxSBG.Input are ignored.
|
2013-11-26 10:53:16 +00:00
|
|
|
if (maskMatters(RxSBG, allOnes(Count)))
|
2013-07-18 10:40:35 +00:00
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
// Treat (shl X, count) as (and (rotl X, count), ~0<<count).
|
2013-10-16 13:35:13 +00:00
|
|
|
if (!refineRxSBGMask(RxSBG, allOnes(BitSize - Count) << Count))
|
2013-07-18 10:40:35 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-07-18 09:45:08 +00:00
|
|
|
RxSBG.Rotate = (RxSBG.Rotate + Count) & 63;
|
|
|
|
RxSBG.Input = N.getOperand(0);
|
2013-07-16 11:02:24 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-07-18 10:14:55 +00:00
|
|
|
case ISD::SRL:
|
2013-07-16 11:02:24 +00:00
|
|
|
case ISD::SRA: {
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *CountNode = dyn_cast<ConstantSDNode>(N.getOperand(1).getNode());
|
2013-07-16 11:02:24 +00:00
|
|
|
if (!CountNode)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
uint64_t Count = CountNode->getZExtValue();
|
2013-10-16 13:35:13 +00:00
|
|
|
unsigned BitSize = N.getValueType().getSizeInBits();
|
|
|
|
if (Count < 1 || Count >= BitSize)
|
2013-07-16 11:02:24 +00:00
|
|
|
return false;
|
|
|
|
|
2013-07-18 10:40:35 +00:00
|
|
|
if (RxSBG.Opcode == SystemZ::RNSBG || Opcode == ISD::SRA) {
|
|
|
|
// Treat (srl|sra X, count) as (rotl X, size-count) as long as the top
|
|
|
|
// count bits from RxSBG.Input are ignored.
|
2013-11-26 10:53:16 +00:00
|
|
|
if (maskMatters(RxSBG, allOnes(Count) << (BitSize - Count)))
|
2013-07-18 10:14:55 +00:00
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
// Treat (srl X, count), mask) as (and (rotl X, size-count), ~0>>count),
|
|
|
|
// which is similar to SLL above.
|
2013-10-16 13:35:13 +00:00
|
|
|
if (!refineRxSBGMask(RxSBG, allOnes(BitSize - Count)))
|
2013-07-18 10:14:55 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
RxSBG.Rotate = (RxSBG.Rotate - Count) & 63;
|
2013-07-18 09:45:08 +00:00
|
|
|
RxSBG.Input = N.getOperand(0);
|
2013-07-16 11:02:24 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-10-01 14:36:20 +00:00
|
|
|
SDValue SystemZDAGToDAGISel::getUNDEF(SDLoc DL, EVT VT) const {
|
|
|
|
SDNode *N = CurDAG->getMachineNode(TargetOpcode::IMPLICIT_DEF, DL, VT);
|
2013-07-11 08:59:12 +00:00
|
|
|
return SDValue(N, 0);
|
|
|
|
}
|
|
|
|
|
2013-09-27 15:14:04 +00:00
|
|
|
SDValue SystemZDAGToDAGISel::convertTo(SDLoc DL, EVT VT, SDValue N) const {
|
2013-09-13 09:12:44 +00:00
|
|
|
if (N.getValueType() == MVT::i32 && VT == MVT::i64)
|
2013-09-30 10:28:35 +00:00
|
|
|
return CurDAG->getTargetInsertSubreg(SystemZ::subreg_l32,
|
2013-10-01 14:36:20 +00:00
|
|
|
DL, VT, getUNDEF(DL, MVT::i64), N);
|
2013-09-13 09:12:44 +00:00
|
|
|
if (N.getValueType() == MVT::i64 && VT == MVT::i32)
|
2013-09-30 10:28:35 +00:00
|
|
|
return CurDAG->getTargetExtractSubreg(SystemZ::subreg_l32, DL, VT, N);
|
2013-07-11 08:59:12 +00:00
|
|
|
assert(N.getValueType() == VT && "Unexpected value types");
|
|
|
|
return N;
|
|
|
|
}
|
|
|
|
|
2013-07-16 11:02:24 +00:00
|
|
|
SDNode *SystemZDAGToDAGISel::tryRISBGZero(SDNode *N) {
|
2015-04-28 14:05:47 +00:00
|
|
|
SDLoc DL(N);
|
2013-07-31 11:36:35 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
2013-07-18 10:40:35 +00:00
|
|
|
RxSBGOperands RISBG(SystemZ::RISBG, SDValue(N, 0));
|
2013-07-16 11:02:24 +00:00
|
|
|
unsigned Count = 0;
|
2013-07-18 09:45:08 +00:00
|
|
|
while (expandRxSBG(RISBG))
|
2013-10-16 13:35:13 +00:00
|
|
|
if (RISBG.Input.getOpcode() != ISD::ANY_EXTEND)
|
|
|
|
Count += 1;
|
2013-07-31 11:36:35 +00:00
|
|
|
if (Count == 0)
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-07-31 11:36:35 +00:00
|
|
|
if (Count == 1) {
|
|
|
|
// Prefer to use normal shift instructions over RISBG, since they can handle
|
|
|
|
// all cases and are sometimes shorter.
|
|
|
|
if (N->getOpcode() != ISD::AND)
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-07-31 11:36:35 +00:00
|
|
|
|
|
|
|
// Prefer register extensions like LLC over RISBG. Also prefer to start
|
|
|
|
// out with normal ANDs if one instruction would be enough. We can convert
|
|
|
|
// these ANDs into an RISBG later if a three-address instruction is useful.
|
|
|
|
if (VT == MVT::i32 ||
|
|
|
|
RISBG.Mask == 0xff ||
|
|
|
|
RISBG.Mask == 0xffff ||
|
|
|
|
SystemZ::isImmLF(~RISBG.Mask) ||
|
|
|
|
SystemZ::isImmHF(~RISBG.Mask)) {
|
|
|
|
// Force the new mask into the DAG, since it may include known-one bits.
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *MaskN = cast<ConstantSDNode>(N->getOperand(1).getNode());
|
2013-07-31 11:36:35 +00:00
|
|
|
if (MaskN->getZExtValue() != RISBG.Mask) {
|
2015-04-28 14:05:47 +00:00
|
|
|
SDValue NewMask = CurDAG->getConstant(RISBG.Mask, DL, VT);
|
2013-07-31 11:36:35 +00:00
|
|
|
N = CurDAG->UpdateNodeOperands(N, N->getOperand(0), NewMask);
|
|
|
|
return SelectCode(N);
|
|
|
|
}
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-07-31 11:36:35 +00:00
|
|
|
}
|
|
|
|
}
|
2013-07-11 08:59:12 +00:00
|
|
|
|
2013-10-01 14:36:20 +00:00
|
|
|
unsigned Opcode = SystemZ::RISBG;
|
2015-03-31 12:58:17 +00:00
|
|
|
// Prefer RISBGN if available, since it does not clobber CC.
|
|
|
|
if (Subtarget->hasMiscellaneousExtensions())
|
|
|
|
Opcode = SystemZ::RISBGN;
|
2013-10-01 14:36:20 +00:00
|
|
|
EVT OpcodeVT = MVT::i64;
|
2015-01-31 00:06:45 +00:00
|
|
|
if (VT == MVT::i32 && Subtarget->hasHighWord()) {
|
2013-10-01 14:36:20 +00:00
|
|
|
Opcode = SystemZ::RISBMux;
|
|
|
|
OpcodeVT = MVT::i32;
|
|
|
|
RISBG.Start &= 31;
|
|
|
|
RISBG.End &= 31;
|
|
|
|
}
|
2013-07-11 08:59:12 +00:00
|
|
|
SDValue Ops[5] = {
|
2015-04-28 14:05:47 +00:00
|
|
|
getUNDEF(DL, OpcodeVT),
|
|
|
|
convertTo(DL, OpcodeVT, RISBG.Input),
|
|
|
|
CurDAG->getTargetConstant(RISBG.Start, DL, MVT::i32),
|
|
|
|
CurDAG->getTargetConstant(RISBG.End | 128, DL, MVT::i32),
|
|
|
|
CurDAG->getTargetConstant(RISBG.Rotate, DL, MVT::i32)
|
2013-07-11 08:59:12 +00:00
|
|
|
};
|
2015-04-28 14:05:47 +00:00
|
|
|
N = CurDAG->getMachineNode(Opcode, DL, OpcodeVT, Ops);
|
|
|
|
return convertTo(DL, VT, SDValue(N, 0)).getNode();
|
2013-07-11 08:59:12 +00:00
|
|
|
}
|
|
|
|
|
2013-07-18 10:06:15 +00:00
|
|
|
SDNode *SystemZDAGToDAGISel::tryRxSBG(SDNode *N, unsigned Opcode) {
|
|
|
|
// Try treating each operand of N as the second operand of the RxSBG
|
2013-07-16 11:55:57 +00:00
|
|
|
// and see which goes deepest.
|
2013-07-18 10:40:35 +00:00
|
|
|
RxSBGOperands RxSBG[] = {
|
|
|
|
RxSBGOperands(Opcode, N->getOperand(0)),
|
|
|
|
RxSBGOperands(Opcode, N->getOperand(1))
|
|
|
|
};
|
2013-07-16 11:55:57 +00:00
|
|
|
unsigned Count[] = { 0, 0 };
|
|
|
|
for (unsigned I = 0; I < 2; ++I)
|
2013-07-18 09:45:08 +00:00
|
|
|
while (expandRxSBG(RxSBG[I]))
|
2013-10-16 13:35:13 +00:00
|
|
|
if (RxSBG[I].Input.getOpcode() != ISD::ANY_EXTEND)
|
|
|
|
Count[I] += 1;
|
2013-07-16 11:55:57 +00:00
|
|
|
|
|
|
|
// Do nothing if neither operand is suitable.
|
|
|
|
if (Count[0] == 0 && Count[1] == 0)
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-07-16 11:55:57 +00:00
|
|
|
|
|
|
|
// Pick the deepest second operand.
|
|
|
|
unsigned I = Count[0] > Count[1] ? 0 : 1;
|
|
|
|
SDValue Op0 = N->getOperand(I ^ 1);
|
|
|
|
|
|
|
|
// Prefer IC for character insertions from memory.
|
2013-07-18 10:06:15 +00:00
|
|
|
if (Opcode == SystemZ::ROSBG && (RxSBG[I].Mask & 0xff) == 0)
|
2014-03-06 11:22:58 +00:00
|
|
|
if (auto *Load = dyn_cast<LoadSDNode>(Op0.getNode()))
|
2013-07-16 11:55:57 +00:00
|
|
|
if (Load->getMemoryVT() == MVT::i8)
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-07-16 11:55:57 +00:00
|
|
|
|
|
|
|
// See whether we can avoid an AND in the first operand by converting
|
|
|
|
// ROSBG to RISBG.
|
2015-03-31 12:58:17 +00:00
|
|
|
if (Opcode == SystemZ::ROSBG && detectOrAndInsertion(Op0, RxSBG[I].Mask)) {
|
2013-07-16 11:55:57 +00:00
|
|
|
Opcode = SystemZ::RISBG;
|
2015-03-31 12:58:17 +00:00
|
|
|
// Prefer RISBGN if available, since it does not clobber CC.
|
|
|
|
if (Subtarget->hasMiscellaneousExtensions())
|
|
|
|
Opcode = SystemZ::RISBGN;
|
|
|
|
}
|
|
|
|
|
2015-04-28 14:05:47 +00:00
|
|
|
SDLoc DL(N);
|
2013-07-16 11:55:57 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
SDValue Ops[5] = {
|
2015-04-28 14:05:47 +00:00
|
|
|
convertTo(DL, MVT::i64, Op0),
|
|
|
|
convertTo(DL, MVT::i64, RxSBG[I].Input),
|
|
|
|
CurDAG->getTargetConstant(RxSBG[I].Start, DL, MVT::i32),
|
|
|
|
CurDAG->getTargetConstant(RxSBG[I].End, DL, MVT::i32),
|
|
|
|
CurDAG->getTargetConstant(RxSBG[I].Rotate, DL, MVT::i32)
|
2013-07-16 11:55:57 +00:00
|
|
|
};
|
2015-04-28 14:05:47 +00:00
|
|
|
N = CurDAG->getMachineNode(Opcode, DL, MVT::i64, Ops);
|
|
|
|
return convertTo(DL, VT, SDValue(N, 0)).getNode();
|
2013-07-16 11:55:57 +00:00
|
|
|
}
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
SDNode *SystemZDAGToDAGISel::splitLargeImmediate(unsigned Opcode, SDNode *Node,
|
|
|
|
SDValue Op0, uint64_t UpperVal,
|
|
|
|
uint64_t LowerVal) {
|
|
|
|
EVT VT = Node->getValueType(0);
|
2013-05-25 02:42:55 +00:00
|
|
|
SDLoc DL(Node);
|
2015-04-28 14:05:47 +00:00
|
|
|
SDValue Upper = CurDAG->getConstant(UpperVal, DL, VT);
|
2013-05-06 16:15:19 +00:00
|
|
|
if (Op0.getNode())
|
|
|
|
Upper = CurDAG->getNode(Opcode, DL, VT, Op0, Upper);
|
|
|
|
Upper = SDValue(Select(Upper.getNode()), 0);
|
|
|
|
|
2015-04-28 14:05:47 +00:00
|
|
|
SDValue Lower = CurDAG->getConstant(LowerVal, DL, VT);
|
2013-05-06 16:15:19 +00:00
|
|
|
SDValue Or = CurDAG->getNode(Opcode, DL, VT, Upper, Lower);
|
|
|
|
return Or.getNode();
|
|
|
|
}
|
|
|
|
|
[SystemZ] Add CodeGen support for integer vector types
This the first of a series of patches to add CodeGen support exploiting
the instructions of the z13 vector facility. This patch adds support
for the native integer vector types (v16i8, v8i16, v4i32, v2i64).
When the vector facility is present, we default to the new vector ABI.
This is characterized by two major differences:
- Vector types are passed/returned in vector registers
(except for unnamed arguments of a variable-argument list function).
- Vector types are at most 8-byte aligned.
The reason for the choice of 8-byte vector alignment is that the hardware
is able to efficiently load vectors at 8-byte alignment, and the ABI only
guarantees 8-byte alignment of the stack pointer, so requiring any higher
alignment for vectors would require dynamic stack re-alignment code.
However, for compatibility with old code that may use vector types, when
*not* using the vector facility, the old alignment rules (vector types
are naturally aligned) remain in use.
These alignment rules are not only implemented at the C language level
(implemented in clang), but also at the LLVM IR level. This is done
by selecting a different DataLayout string depending on whether the
vector ABI is in effect or not.
Based on a patch by Richard Sandiford.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236521 91177308-0d34-0410-b5e6-96231b3b80d8
2015-05-05 19:25:42 +00:00
|
|
|
SDNode *SystemZDAGToDAGISel::tryGather(SDNode *N, unsigned Opcode) {
|
|
|
|
SDValue ElemV = N->getOperand(2);
|
|
|
|
auto *ElemN = dyn_cast<ConstantSDNode>(ElemV);
|
|
|
|
if (!ElemN)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
unsigned Elem = ElemN->getZExtValue();
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
if (Elem >= VT.getVectorNumElements())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
auto *Load = dyn_cast<LoadSDNode>(N->getOperand(1));
|
|
|
|
if (!Load || !Load->hasOneUse())
|
|
|
|
return 0;
|
|
|
|
if (Load->getMemoryVT().getSizeInBits() !=
|
|
|
|
Load->getValueType(0).getSizeInBits())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDValue Base, Disp, Index;
|
|
|
|
if (!selectBDVAddr12Only(Load->getBasePtr(), ElemV, Base, Disp, Index) ||
|
|
|
|
Index.getValueType() != VT.changeVectorElementTypeToInteger())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDLoc DL(Load);
|
|
|
|
SDValue Ops[] = {
|
|
|
|
N->getOperand(0), Base, Disp, Index,
|
|
|
|
CurDAG->getTargetConstant(Elem, DL, MVT::i32), Load->getChain()
|
|
|
|
};
|
|
|
|
SDNode *Res = CurDAG->getMachineNode(Opcode, DL, VT, MVT::Other, Ops);
|
|
|
|
ReplaceUses(SDValue(Load, 1), SDValue(Res, 1));
|
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
|
|
|
SDNode *SystemZDAGToDAGISel::tryScatter(StoreSDNode *Store, unsigned Opcode) {
|
|
|
|
SDValue Value = Store->getValue();
|
|
|
|
if (Value.getOpcode() != ISD::EXTRACT_VECTOR_ELT)
|
|
|
|
return 0;
|
|
|
|
if (Store->getMemoryVT().getSizeInBits() !=
|
|
|
|
Value.getValueType().getSizeInBits())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDValue ElemV = Value.getOperand(1);
|
|
|
|
auto *ElemN = dyn_cast<ConstantSDNode>(ElemV);
|
|
|
|
if (!ElemN)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDValue Vec = Value.getOperand(0);
|
|
|
|
EVT VT = Vec.getValueType();
|
|
|
|
unsigned Elem = ElemN->getZExtValue();
|
|
|
|
if (Elem >= VT.getVectorNumElements())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDValue Base, Disp, Index;
|
|
|
|
if (!selectBDVAddr12Only(Store->getBasePtr(), ElemV, Base, Disp, Index) ||
|
|
|
|
Index.getValueType() != VT.changeVectorElementTypeToInteger())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
SDLoc DL(Store);
|
|
|
|
SDValue Ops[] = {
|
|
|
|
Vec, Base, Disp, Index, CurDAG->getTargetConstant(Elem, DL, MVT::i32),
|
|
|
|
Store->getChain()
|
|
|
|
};
|
|
|
|
return CurDAG->getMachineNode(Opcode, DL, MVT::Other, Ops);
|
|
|
|
}
|
|
|
|
|
2013-09-27 15:29:20 +00:00
|
|
|
bool SystemZDAGToDAGISel::canUseBlockOperation(StoreSDNode *Store,
|
|
|
|
LoadSDNode *Load) const {
|
2013-09-05 10:36:45 +00:00
|
|
|
// Check that the two memory operands have the same size.
|
|
|
|
if (Load->getMemoryVT() != Store->getMemoryVT())
|
|
|
|
return false;
|
2013-07-09 09:46:39 +00:00
|
|
|
|
2013-09-05 10:36:45 +00:00
|
|
|
// Volatility stops an access from being decomposed.
|
2013-07-09 09:46:39 +00:00
|
|
|
if (Load->isVolatile() || Store->isVolatile())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// There's no chance of overlap if the load is invariant.
|
|
|
|
if (Load->isInvariant())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Otherwise we need to check whether there's an alias.
|
2014-04-15 07:22:52 +00:00
|
|
|
const Value *V1 = Load->getMemOperand()->getValue();
|
|
|
|
const Value *V2 = Store->getMemOperand()->getValue();
|
2013-07-09 09:46:39 +00:00
|
|
|
if (!V1 || !V2)
|
|
|
|
return false;
|
|
|
|
|
2013-09-27 15:29:20 +00:00
|
|
|
// Reject equality.
|
|
|
|
uint64_t Size = Load->getMemoryVT().getStoreSize();
|
2013-07-09 09:46:39 +00:00
|
|
|
int64_t End1 = Load->getSrcValueOffset() + Size;
|
|
|
|
int64_t End2 = Store->getSrcValueOffset() + Size;
|
2013-09-27 15:29:20 +00:00
|
|
|
if (V1 == V2 && End1 == End2)
|
|
|
|
return false;
|
|
|
|
|
2015-06-17 07:18:54 +00:00
|
|
|
return !AA->alias(MemoryLocation(V1, End1, Load->getAAInfo()),
|
|
|
|
MemoryLocation(V2, End2, Store->getAAInfo()));
|
2013-07-09 09:46:39 +00:00
|
|
|
}
|
|
|
|
|
2013-09-05 10:36:45 +00:00
|
|
|
bool SystemZDAGToDAGISel::storeLoadCanUseMVC(SDNode *N) const {
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *Store = cast<StoreSDNode>(N);
|
|
|
|
auto *Load = cast<LoadSDNode>(Store->getValue());
|
2013-09-05 10:36:45 +00:00
|
|
|
|
|
|
|
// Prefer not to use MVC if either address can use ... RELATIVE LONG
|
|
|
|
// instructions.
|
|
|
|
uint64_t Size = Load->getMemoryVT().getStoreSize();
|
|
|
|
if (Size > 1 && Size <= 8) {
|
|
|
|
// Prefer LHRL, LRL and LGRL.
|
2013-09-27 15:14:04 +00:00
|
|
|
if (SystemZISD::isPCREL(Load->getBasePtr().getOpcode()))
|
2013-09-05 10:36:45 +00:00
|
|
|
return false;
|
|
|
|
// Prefer STHRL, STRL and STGRL.
|
2013-09-27 15:14:04 +00:00
|
|
|
if (SystemZISD::isPCREL(Store->getBasePtr().getOpcode()))
|
2013-09-05 10:36:45 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-09-27 15:29:20 +00:00
|
|
|
return canUseBlockOperation(Store, Load);
|
2013-09-05 10:36:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
bool SystemZDAGToDAGISel::storeLoadCanUseBlockBinary(SDNode *N,
|
|
|
|
unsigned I) const {
|
2014-03-06 11:22:58 +00:00
|
|
|
auto *StoreA = cast<StoreSDNode>(N);
|
|
|
|
auto *LoadA = cast<LoadSDNode>(StoreA->getValue().getOperand(1 - I));
|
|
|
|
auto *LoadB = cast<LoadSDNode>(StoreA->getValue().getOperand(I));
|
2013-09-27 15:29:20 +00:00
|
|
|
return !LoadA->isVolatile() && canUseBlockOperation(StoreA, LoadB);
|
2013-09-05 10:36:45 +00:00
|
|
|
}
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
SDNode *SystemZDAGToDAGISel::Select(SDNode *Node) {
|
|
|
|
// Dump information about the Node being selected
|
|
|
|
DEBUG(errs() << "Selecting: "; Node->dump(CurDAG); errs() << "\n");
|
|
|
|
|
|
|
|
// If we have a custom node, we already have selected!
|
|
|
|
if (Node->isMachineOpcode()) {
|
|
|
|
DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
|
2013-09-22 08:21:56 +00:00
|
|
|
Node->setNodeId(-1);
|
2014-04-25 05:30:21 +00:00
|
|
|
return nullptr;
|
2013-05-06 16:15:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned Opcode = Node->getOpcode();
|
2014-04-25 05:30:21 +00:00
|
|
|
SDNode *ResNode = nullptr;
|
2013-05-06 16:15:19 +00:00
|
|
|
switch (Opcode) {
|
|
|
|
case ISD::OR:
|
2013-07-16 11:55:57 +00:00
|
|
|
if (Node->getOperand(1).getOpcode() != ISD::Constant)
|
2013-07-18 10:06:15 +00:00
|
|
|
ResNode = tryRxSBG(Node, SystemZ::ROSBG);
|
|
|
|
goto or_xor;
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
case ISD::XOR:
|
2013-07-18 10:06:15 +00:00
|
|
|
if (Node->getOperand(1).getOpcode() != ISD::Constant)
|
|
|
|
ResNode = tryRxSBG(Node, SystemZ::RXSBG);
|
|
|
|
// Fall through.
|
|
|
|
or_xor:
|
2013-05-06 16:15:19 +00:00
|
|
|
// If this is a 64-bit operation in which both 32-bit halves are nonzero,
|
|
|
|
// split the operation into two.
|
2013-07-16 11:55:57 +00:00
|
|
|
if (!ResNode && Node->getValueType(0) == MVT::i64)
|
2014-03-06 11:22:58 +00:00
|
|
|
if (auto *Op1 = dyn_cast<ConstantSDNode>(Node->getOperand(1))) {
|
2013-05-06 16:15:19 +00:00
|
|
|
uint64_t Val = Op1->getZExtValue();
|
|
|
|
if (!SystemZ::isImmLF(Val) && !SystemZ::isImmHF(Val))
|
|
|
|
Node = splitLargeImmediate(Opcode, Node, Node->getOperand(0),
|
|
|
|
Val - uint32_t(Val), uint32_t(Val));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2013-07-11 08:59:12 +00:00
|
|
|
case ISD::AND:
|
2013-07-18 10:40:35 +00:00
|
|
|
if (Node->getOperand(1).getOpcode() != ISD::Constant)
|
|
|
|
ResNode = tryRxSBG(Node, SystemZ::RNSBG);
|
|
|
|
// Fall through.
|
2013-07-16 11:02:24 +00:00
|
|
|
case ISD::ROTL:
|
|
|
|
case ISD::SHL:
|
|
|
|
case ISD::SRL:
|
2013-12-20 11:49:48 +00:00
|
|
|
case ISD::ZERO_EXTEND:
|
2013-07-18 10:06:15 +00:00
|
|
|
if (!ResNode)
|
|
|
|
ResNode = tryRISBGZero(Node);
|
2013-07-11 08:59:12 +00:00
|
|
|
break;
|
|
|
|
|
2013-05-06 16:15:19 +00:00
|
|
|
case ISD::Constant:
|
|
|
|
// If this is a 64-bit constant that is out of the range of LLILF,
|
|
|
|
// LLIHF and LGFI, split it into two 32-bit pieces.
|
|
|
|
if (Node->getValueType(0) == MVT::i64) {
|
|
|
|
uint64_t Val = cast<ConstantSDNode>(Node)->getZExtValue();
|
|
|
|
if (!SystemZ::isImmLF(Val) && !SystemZ::isImmHF(Val) && !isInt<32>(Val))
|
|
|
|
Node = splitLargeImmediate(ISD::OR, Node, SDValue(),
|
|
|
|
Val - uint32_t(Val), uint32_t(Val));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2013-07-31 12:38:08 +00:00
|
|
|
case SystemZISD::SELECT_CCMASK: {
|
|
|
|
SDValue Op0 = Node->getOperand(0);
|
|
|
|
SDValue Op1 = Node->getOperand(1);
|
|
|
|
// Prefer to put any load first, so that it can be matched as a
|
|
|
|
// conditional load.
|
|
|
|
if (Op1.getOpcode() == ISD::LOAD && Op0.getOpcode() != ISD::LOAD) {
|
|
|
|
SDValue CCValid = Node->getOperand(2);
|
|
|
|
SDValue CCMask = Node->getOperand(3);
|
|
|
|
uint64_t ConstCCValid =
|
|
|
|
cast<ConstantSDNode>(CCValid.getNode())->getZExtValue();
|
|
|
|
uint64_t ConstCCMask =
|
|
|
|
cast<ConstantSDNode>(CCMask.getNode())->getZExtValue();
|
|
|
|
// Invert the condition.
|
2015-04-28 14:05:47 +00:00
|
|
|
CCMask = CurDAG->getConstant(ConstCCValid ^ ConstCCMask, SDLoc(Node),
|
2013-07-31 12:38:08 +00:00
|
|
|
CCMask.getValueType());
|
|
|
|
SDValue Op4 = Node->getOperand(4);
|
|
|
|
Node = CurDAG->UpdateNodeOperands(Node, Op1, Op0, CCValid, CCMask, Op4);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
[SystemZ] Add CodeGen support for integer vector types
This the first of a series of patches to add CodeGen support exploiting
the instructions of the z13 vector facility. This patch adds support
for the native integer vector types (v16i8, v8i16, v4i32, v2i64).
When the vector facility is present, we default to the new vector ABI.
This is characterized by two major differences:
- Vector types are passed/returned in vector registers
(except for unnamed arguments of a variable-argument list function).
- Vector types are at most 8-byte aligned.
The reason for the choice of 8-byte vector alignment is that the hardware
is able to efficiently load vectors at 8-byte alignment, and the ABI only
guarantees 8-byte alignment of the stack pointer, so requiring any higher
alignment for vectors would require dynamic stack re-alignment code.
However, for compatibility with old code that may use vector types, when
*not* using the vector facility, the old alignment rules (vector types
are naturally aligned) remain in use.
These alignment rules are not only implemented at the C language level
(implemented in clang), but also at the LLVM IR level. This is done
by selecting a different DataLayout string depending on whether the
vector ABI is in effect or not.
Based on a patch by Richard Sandiford.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@236521 91177308-0d34-0410-b5e6-96231b3b80d8
2015-05-05 19:25:42 +00:00
|
|
|
|
|
|
|
case ISD::INSERT_VECTOR_ELT: {
|
|
|
|
EVT VT = Node->getValueType(0);
|
|
|
|
unsigned ElemBitSize = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (ElemBitSize == 32)
|
|
|
|
ResNode = tryGather(Node, SystemZ::VGEF);
|
|
|
|
else if (ElemBitSize == 64)
|
|
|
|
ResNode = tryGather(Node, SystemZ::VGEG);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case ISD::STORE: {
|
|
|
|
auto *Store = cast<StoreSDNode>(Node);
|
|
|
|
unsigned ElemBitSize = Store->getValue().getValueType().getSizeInBits();
|
|
|
|
if (ElemBitSize == 32)
|
|
|
|
ResNode = tryScatter(Store, SystemZ::VSCEF);
|
|
|
|
else if (ElemBitSize == 64)
|
|
|
|
ResNode = tryScatter(Store, SystemZ::VSCEG);
|
|
|
|
break;
|
|
|
|
}
|
2013-05-06 16:15:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Select the default instruction
|
2013-07-11 08:59:12 +00:00
|
|
|
if (!ResNode)
|
|
|
|
ResNode = SelectCode(Node);
|
2013-05-06 16:15:19 +00:00
|
|
|
|
|
|
|
DEBUG(errs() << "=> ";
|
2014-04-25 05:30:21 +00:00
|
|
|
if (ResNode == nullptr || ResNode == Node)
|
2013-05-06 16:15:19 +00:00
|
|
|
Node->dump(CurDAG);
|
|
|
|
else
|
|
|
|
ResNode->dump(CurDAG);
|
|
|
|
errs() << "\n";
|
|
|
|
);
|
|
|
|
return ResNode;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SystemZDAGToDAGISel::
|
|
|
|
SelectInlineAsmMemoryOperand(const SDValue &Op,
|
2015-03-13 12:45:09 +00:00
|
|
|
unsigned ConstraintID,
|
2013-05-06 16:15:19 +00:00
|
|
|
std::vector<SDValue> &OutOps) {
|
2015-03-17 16:16:14 +00:00
|
|
|
switch(ConstraintID) {
|
|
|
|
default:
|
|
|
|
llvm_unreachable("Unexpected asm memory constraint");
|
|
|
|
case InlineAsm::Constraint_i:
|
|
|
|
case InlineAsm::Constraint_m:
|
|
|
|
case InlineAsm::Constraint_Q:
|
|
|
|
case InlineAsm::Constraint_R:
|
|
|
|
case InlineAsm::Constraint_S:
|
|
|
|
case InlineAsm::Constraint_T:
|
|
|
|
// Accept addresses with short displacements, which are compatible
|
|
|
|
// with Q, R, S and T. But keep the index operand for future expansion.
|
|
|
|
SDValue Base, Disp, Index;
|
|
|
|
if (selectBDXAddr(SystemZAddressingMode::FormBD,
|
|
|
|
SystemZAddressingMode::Disp12Only,
|
|
|
|
Op, Base, Disp, Index)) {
|
|
|
|
OutOps.push_back(Base);
|
|
|
|
OutOps.push_back(Disp);
|
|
|
|
OutOps.push_back(Index);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return true;
|
2013-05-06 16:15:19 +00:00
|
|
|
}
|