2013-03-15 02:28:19 +08:00
|
|
|
//===---- MipsISelDAGToDAG.h - A Dag to Dag Inst Selector for Mips --------===//
|
|
|
|
//
|
|
|
|
// 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 MIPS target.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2014-08-14 00:26:38 +08:00
|
|
|
#ifndef LLVM_LIB_TARGET_MIPS_MIPSISELDAGTODAG_H
|
|
|
|
#define LLVM_LIB_TARGET_MIPS_MIPSISELDAGTODAG_H
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
#include "Mips.h"
|
|
|
|
#include "MipsSubtarget.h"
|
|
|
|
#include "MipsTargetMachine.h"
|
|
|
|
#include "llvm/CodeGen/SelectionDAGISel.h"
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Instruction Selector Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// MipsDAGToDAGISel - MIPS specific code to select MIPS machine
|
|
|
|
// instructions for SelectionDAG operations.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
class MipsDAGToDAGISel : public SelectionDAGISel {
|
|
|
|
public:
|
|
|
|
explicit MipsDAGToDAGISel(MipsTargetMachine &TM)
|
2014-07-19 07:41:32 +08:00
|
|
|
: SelectionDAGISel(TM), Subtarget(nullptr) {}
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
// Pass Name
|
2014-04-29 15:58:02 +08:00
|
|
|
const char *getPassName() const override {
|
2013-03-15 02:28:19 +08:00
|
|
|
return "MIPS DAG->DAG Pattern Instruction Selection";
|
|
|
|
}
|
|
|
|
|
2014-04-29 15:58:02 +08:00
|
|
|
bool runOnMachineFunction(MachineFunction &MF) override;
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
protected:
|
|
|
|
SDNode *getGlobalBaseReg();
|
|
|
|
|
|
|
|
/// Keep a pointer to the MipsSubtarget around so that we can make the right
|
|
|
|
/// decision when generating code for different targets.
|
2014-07-11 01:26:51 +08:00
|
|
|
const MipsSubtarget *Subtarget;
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
private:
|
|
|
|
// Include the pieces autogenerated from the target description.
|
|
|
|
#include "MipsGenDAGISel.inc"
|
|
|
|
|
|
|
|
// Complex Pattern.
|
|
|
|
/// (reg + imm).
|
|
|
|
virtual bool selectAddrRegImm(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2013-08-28 20:04:29 +08:00
|
|
|
// Complex Pattern.
|
|
|
|
/// (reg + reg).
|
|
|
|
virtual bool selectAddrRegReg(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2013-03-15 02:28:19 +08:00
|
|
|
/// Fall back on this function if all else fails.
|
|
|
|
virtual bool selectAddrDefault(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
|
|
|
/// Match integer address pattern.
|
|
|
|
virtual bool selectIntAddr(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2013-08-14 04:19:16 +08:00
|
|
|
virtual bool selectIntAddrMM(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2015-02-04 23:43:17 +08:00
|
|
|
virtual bool selectIntAddrLSL2MM(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2014-03-03 22:31:21 +08:00
|
|
|
/// Match addr+simm10 and addr
|
|
|
|
virtual bool selectIntAddrMSA(SDValue Addr, SDValue &Base,
|
|
|
|
SDValue &Offset) const;
|
|
|
|
|
2013-03-15 02:33:23 +08:00
|
|
|
virtual bool selectAddr16(SDNode *Parent, SDValue N, SDValue &Base,
|
2013-03-15 02:28:19 +08:00
|
|
|
SDValue &Offset, SDValue &Alias);
|
|
|
|
|
2013-09-24 21:33:07 +08:00
|
|
|
/// \brief Select constant vector splats.
|
[mips] Correct and improve special-case shuffle instructions.
Summary:
The documentation writes vectors highest-index first whereas LLVM-IR writes
them lowest-index first. As a result, instructions defined in terms of
left_half() and right_half() had the halves reversed.
In addition to correcting them, they have been improved to allow shuffles
that use the same operand twice or in reverse order. For example, ilvev
used to accept masks of the form:
<0, n, 2, n+2, 4, n+4, ...>
but now accepts:
<0, 0, 2, 2, 4, 4, ...>
<n, n, n+2, n+2, n+4, n+4, ...>
<0, n, 2, n+2, 4, n+4, ...>
<n, 0, n+2, 2, n+4, 4, ...>
One further improvement is that splati.[bhwd] is now the preferred instruction
for splat-like operations. The other special shuffles are no longer used
for splats. This lead to the discovery that <0, 0, ...> would not cause
splati.[hwd] to be selected and this has also been fixed.
This fixes the enc-3des test from the test-suite on Mips64r6 with MSA.
Reviewers: vkalintiris
Reviewed By: vkalintiris
Subscribers: llvm-commits
Differential Revision: http://reviews.llvm.org/D9660
llvm-svn: 237689
2015-05-19 20:24:52 +08:00
|
|
|
virtual bool selectVSplat(SDNode *N, APInt &Imm,
|
|
|
|
unsigned MinSizeInBits) const;
|
2013-09-27 19:48:57 +08:00
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm1.
|
|
|
|
virtual bool selectVSplatUimm1(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm2.
|
|
|
|
virtual bool selectVSplatUimm2(SDValue N, SDValue &Imm) const;
|
2013-09-24 21:33:07 +08:00
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm3.
|
|
|
|
virtual bool selectVSplatUimm3(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm4.
|
|
|
|
virtual bool selectVSplatUimm4(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm5.
|
|
|
|
virtual bool selectVSplatUimm5(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm6.
|
|
|
|
virtual bool selectVSplatUimm6(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a uimm8.
|
|
|
|
virtual bool selectVSplatUimm8(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value fits in a simm5.
|
|
|
|
virtual bool selectVSplatSimm5(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value is a power of 2.
|
|
|
|
virtual bool selectVSplatUimmPow2(SDValue N, SDValue &Imm) const;
|
2013-11-12 18:45:18 +08:00
|
|
|
/// \brief Select constant vector splats whose value is the inverse of a
|
|
|
|
/// power of 2.
|
|
|
|
virtual bool selectVSplatUimmInvPow2(SDValue N, SDValue &Imm) const;
|
2013-10-30 22:45:14 +08:00
|
|
|
/// \brief Select constant vector splats whose value is a run of set bits
|
|
|
|
/// ending at the most significant bit
|
|
|
|
virtual bool selectVSplatMaskL(SDValue N, SDValue &Imm) const;
|
|
|
|
/// \brief Select constant vector splats whose value is a run of set bits
|
|
|
|
/// starting at bit zero.
|
|
|
|
virtual bool selectVSplatMaskR(SDValue N, SDValue &Imm) const;
|
2013-09-24 21:33:07 +08:00
|
|
|
|
2016-05-14 07:55:59 +08:00
|
|
|
void Select(SDNode *N) override;
|
2013-03-15 02:28:19 +08:00
|
|
|
|
2016-05-14 07:55:59 +08:00
|
|
|
virtual bool trySelect(SDNode *Node) = 0;
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
// getImm - Return a target constant with the specified value.
|
|
|
|
inline SDValue getImm(const SDNode *Node, uint64_t Imm) {
|
2015-04-28 22:05:47 +08:00
|
|
|
return CurDAG->getTargetConstant(Imm, SDLoc(Node), Node->getValueType(0));
|
2013-03-15 02:28:19 +08:00
|
|
|
}
|
|
|
|
|
2013-03-15 02:33:23 +08:00
|
|
|
virtual void processFunctionAfterISel(MachineFunction &MF) = 0;
|
2013-03-15 02:28:19 +08:00
|
|
|
|
2014-04-29 15:58:02 +08:00
|
|
|
bool SelectInlineAsmMemoryOperand(const SDValue &Op,
|
2015-03-13 20:45:09 +08:00
|
|
|
unsigned ConstraintID,
|
2014-04-29 15:58:02 +08:00
|
|
|
std::vector<SDValue> &OutOps) override;
|
2013-03-15 02:28:19 +08:00
|
|
|
};
|
2015-06-23 17:49:53 +08:00
|
|
|
}
|
2013-03-15 02:28:19 +08:00
|
|
|
|
|
|
|
#endif
|