2018-02-23 19:06:40 +08:00
|
|
|
//===- MipsLegalizerInfo.cpp ------------------------------------*- C++ -*-===//
|
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2018-02-23 19:06:40 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// \file
|
|
|
|
/// This file implements the targeting of the Machinelegalizer class for Mips.
|
|
|
|
/// \todo This should be generated by TableGen.
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "MipsLegalizerInfo.h"
|
2018-06-01 00:16:49 +08:00
|
|
|
#include "MipsTargetMachine.h"
|
2018-10-09 07:59:37 +08:00
|
|
|
#include "llvm/CodeGen/GlobalISel/LegalizerHelper.h"
|
2018-02-23 19:06:40 +08:00
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
MipsLegalizerInfo::MipsLegalizerInfo(const MipsSubtarget &ST) {
|
2018-04-11 23:12:32 +08:00
|
|
|
using namespace TargetOpcode;
|
|
|
|
|
2018-12-17 20:31:07 +08:00
|
|
|
const LLT s1 = LLT::scalar(1);
|
2018-04-11 23:12:32 +08:00
|
|
|
const LLT s32 = LLT::scalar(32);
|
2018-12-18 23:59:51 +08:00
|
|
|
const LLT s64 = LLT::scalar(64);
|
2018-07-16 21:29:32 +08:00
|
|
|
const LLT p0 = LLT::pointer(0, 32);
|
2018-04-11 23:12:32 +08:00
|
|
|
|
2019-03-11 18:00:17 +08:00
|
|
|
getActionDefinitionsBuilder({G_ADD, G_SUB, G_MUL})
|
2018-08-26 15:25:33 +08:00
|
|
|
.legalFor({s32})
|
2018-12-17 20:31:07 +08:00
|
|
|
.clampScalar(0, s32, s32);
|
|
|
|
|
2019-03-01 15:25:44 +08:00
|
|
|
getActionDefinitionsBuilder({G_UADDO, G_UADDE, G_USUBO, G_USUBE, G_UMULO})
|
2018-12-17 20:31:07 +08:00
|
|
|
.lowerFor({{s32, s1}});
|
2018-04-11 23:12:32 +08:00
|
|
|
|
2019-03-01 15:25:44 +08:00
|
|
|
getActionDefinitionsBuilder(G_UMULH)
|
2019-03-11 18:08:44 +08:00
|
|
|
.legalFor({s32})
|
|
|
|
.maxScalar(0, s32);
|
2019-03-01 15:25:44 +08:00
|
|
|
|
2018-07-16 21:29:32 +08:00
|
|
|
getActionDefinitionsBuilder({G_LOAD, G_STORE})
|
2019-02-15 06:41:09 +08:00
|
|
|
.legalForTypesWithMemDesc({{s32, p0, 8, 8},
|
|
|
|
{s32, p0, 16, 8},
|
|
|
|
{s32, p0, 32, 8},
|
2019-07-08 22:36:36 +08:00
|
|
|
{s64, p0, 64, 8},
|
2019-02-15 06:41:09 +08:00
|
|
|
{p0, p0, 32, 8}})
|
2019-02-08 22:27:23 +08:00
|
|
|
.minScalar(0, s32);
|
2018-07-16 21:29:32 +08:00
|
|
|
|
2019-07-08 22:45:52 +08:00
|
|
|
getActionDefinitionsBuilder(G_UNMERGE_VALUES)
|
|
|
|
.legalFor({{s32, s64}});
|
|
|
|
|
2019-07-08 22:36:36 +08:00
|
|
|
getActionDefinitionsBuilder(G_MERGE_VALUES)
|
|
|
|
.legalFor({{s64, s32}});
|
|
|
|
|
2019-01-24 18:27:21 +08:00
|
|
|
getActionDefinitionsBuilder({G_ZEXTLOAD, G_SEXTLOAD})
|
2019-08-21 17:43:20 +08:00
|
|
|
.legalForTypesWithMemDesc({{s32, p0, 8, 8},
|
|
|
|
{s32, p0, 16, 8}})
|
|
|
|
.clampScalar(0, s32, s32);
|
2019-01-24 18:27:21 +08:00
|
|
|
|
2019-08-21 17:35:02 +08:00
|
|
|
getActionDefinitionsBuilder({G_ZEXT, G_SEXT})
|
|
|
|
.legalIf([](const LegalityQuery &Query) { return false; })
|
|
|
|
.maxScalar(0, s32);
|
|
|
|
|
2019-08-21 17:26:39 +08:00
|
|
|
getActionDefinitionsBuilder(G_TRUNC)
|
|
|
|
.legalIf([](const LegalityQuery &Query) { return false; })
|
|
|
|
.maxScalar(1, s32);
|
|
|
|
|
2018-12-25 22:42:30 +08:00
|
|
|
getActionDefinitionsBuilder(G_SELECT)
|
2019-07-09 22:30:29 +08:00
|
|
|
.legalForCartesianProduct({p0, s32, s64}, {s32})
|
2018-12-25 22:42:30 +08:00
|
|
|
.minScalar(0, s32)
|
|
|
|
.minScalar(1, s32);
|
|
|
|
|
2019-02-14 19:39:53 +08:00
|
|
|
getActionDefinitionsBuilder(G_BRCOND)
|
|
|
|
.legalFor({s32})
|
|
|
|
.minScalar(0, s32);
|
|
|
|
|
2019-08-08 18:21:12 +08:00
|
|
|
getActionDefinitionsBuilder(G_BRJT)
|
|
|
|
.legalFor({{p0, s32}});
|
|
|
|
|
2019-02-14 20:36:19 +08:00
|
|
|
getActionDefinitionsBuilder(G_PHI)
|
2019-07-09 22:36:17 +08:00
|
|
|
.legalFor({p0, s32, s64})
|
2019-02-14 20:36:19 +08:00
|
|
|
.minScalar(0, s32);
|
|
|
|
|
2018-12-18 19:36:14 +08:00
|
|
|
getActionDefinitionsBuilder({G_AND, G_OR, G_XOR})
|
|
|
|
.legalFor({s32})
|
|
|
|
.clampScalar(0, s32, s32);
|
|
|
|
|
2018-12-18 23:59:51 +08:00
|
|
|
getActionDefinitionsBuilder({G_SDIV, G_SREM, G_UREM, G_UDIV})
|
|
|
|
.legalFor({s32})
|
|
|
|
.minScalar(0, s32)
|
|
|
|
.libcallFor({s64});
|
|
|
|
|
2019-01-23 05:42:11 +08:00
|
|
|
getActionDefinitionsBuilder({G_SHL, G_ASHR, G_LSHR})
|
2019-08-21 17:31:29 +08:00
|
|
|
.legalFor({{s32, s32}})
|
2019-08-27 22:41:44 +08:00
|
|
|
.clampScalar(1, s32, s32)
|
|
|
|
.clampScalar(0, s32, s32);
|
2019-01-23 05:42:11 +08:00
|
|
|
|
2018-09-10 23:56:52 +08:00
|
|
|
getActionDefinitionsBuilder(G_ICMP)
|
2019-07-17 20:08:01 +08:00
|
|
|
.legalForCartesianProduct({s32}, {s32, p0})
|
|
|
|
.clampScalar(1, s32, s32)
|
2018-09-10 23:56:52 +08:00
|
|
|
.minScalar(0, s32);
|
|
|
|
|
2018-07-16 21:29:32 +08:00
|
|
|
getActionDefinitionsBuilder(G_CONSTANT)
|
2018-10-17 18:30:03 +08:00
|
|
|
.legalFor({s32})
|
2018-11-09 22:21:16 +08:00
|
|
|
.clampScalar(0, s32, s32);
|
2018-07-16 21:29:32 +08:00
|
|
|
|
2019-07-26 21:08:06 +08:00
|
|
|
getActionDefinitionsBuilder({G_GEP, G_INTTOPTR})
|
2018-07-16 21:29:32 +08:00
|
|
|
.legalFor({{p0, s32}});
|
|
|
|
|
2019-07-26 21:08:06 +08:00
|
|
|
getActionDefinitionsBuilder(G_PTRTOINT)
|
|
|
|
.legalFor({{s32, p0}});
|
|
|
|
|
2018-07-16 21:29:32 +08:00
|
|
|
getActionDefinitionsBuilder(G_FRAME_INDEX)
|
|
|
|
.legalFor({p0});
|
|
|
|
|
2019-08-08 18:21:12 +08:00
|
|
|
getActionDefinitionsBuilder({G_GLOBAL_VALUE, G_JUMP_TABLE})
|
2018-08-01 17:03:23 +08:00
|
|
|
.legalFor({p0});
|
|
|
|
|
2019-04-03 22:12:59 +08:00
|
|
|
// FP instructions
|
|
|
|
getActionDefinitionsBuilder(G_FCONSTANT)
|
|
|
|
.legalFor({s32, s64});
|
|
|
|
|
2019-06-06 18:00:41 +08:00
|
|
|
getActionDefinitionsBuilder({G_FADD, G_FSUB, G_FMUL, G_FDIV, G_FABS, G_FSQRT})
|
2019-04-03 22:12:59 +08:00
|
|
|
.legalFor({s32, s64});
|
|
|
|
|
2019-06-05 22:03:13 +08:00
|
|
|
getActionDefinitionsBuilder(G_FCMP)
|
|
|
|
.legalFor({{s32, s32}, {s32, s64}})
|
|
|
|
.minScalar(0, s32);
|
|
|
|
|
2019-06-06 17:02:24 +08:00
|
|
|
getActionDefinitionsBuilder({G_FCEIL, G_FFLOOR})
|
|
|
|
.libcallFor({s32, s64});
|
|
|
|
|
2019-06-06 17:16:58 +08:00
|
|
|
getActionDefinitionsBuilder(G_FPEXT)
|
|
|
|
.legalFor({{s64, s32}});
|
|
|
|
|
|
|
|
getActionDefinitionsBuilder(G_FPTRUNC)
|
|
|
|
.legalFor({{s32, s64}});
|
|
|
|
|
2019-06-20 16:52:53 +08:00
|
|
|
// FP to int conversion instructions
|
|
|
|
getActionDefinitionsBuilder(G_FPTOSI)
|
|
|
|
.legalForCartesianProduct({s32}, {s64, s32})
|
|
|
|
.libcallForCartesianProduct({s64}, {s64, s32})
|
|
|
|
.minScalar(0, s32);
|
|
|
|
|
|
|
|
getActionDefinitionsBuilder(G_FPTOUI)
|
|
|
|
.libcallForCartesianProduct({s64}, {s64, s32})
|
2019-08-30 13:44:02 +08:00
|
|
|
.lowerForCartesianProduct({s32}, {s64, s32})
|
2019-06-20 16:52:53 +08:00
|
|
|
.minScalar(0, s32);
|
|
|
|
|
2019-06-20 17:05:02 +08:00
|
|
|
// Int to FP conversion instructions
|
|
|
|
getActionDefinitionsBuilder(G_SITOFP)
|
|
|
|
.legalForCartesianProduct({s64, s32}, {s32})
|
|
|
|
.libcallForCartesianProduct({s64, s32}, {s64})
|
|
|
|
.minScalar(1, s32);
|
|
|
|
|
|
|
|
getActionDefinitionsBuilder(G_UITOFP)
|
|
|
|
.libcallForCartesianProduct({s64, s32}, {s64})
|
2019-08-30 13:51:12 +08:00
|
|
|
.customForCartesianProduct({s64, s32}, {s32})
|
2019-06-20 17:05:02 +08:00
|
|
|
.minScalar(1, s32);
|
|
|
|
|
[globalisel] Add G_SEXT_INREG
Summary:
Targets often have instructions that can sign-extend certain cases faster
than the equivalent shift-left/arithmetic-shift-right. Such cases can be
identified by matching a shift-left/shift-right pair but there are some
issues with this in the context of combines. For example, suppose you can
sign-extend 8-bit up to 32-bit with a target extend instruction.
%1:_(s32) = G_SHL %0:_(s32), i32 24 # (I've inlined the G_CONSTANT for brevity)
%2:_(s32) = G_ASHR %1:_(s32), i32 24
%3:_(s32) = G_ASHR %2:_(s32), i32 1
would reasonably combine to:
%1:_(s32) = G_SHL %0:_(s32), i32 24
%2:_(s32) = G_ASHR %1:_(s32), i32 25
which no longer matches the special case. If your shifts and extend are
equal cost, this would break even as a pair of shifts but if your shift is
more expensive than the extend then it's cheaper as:
%2:_(s32) = G_SEXT_INREG %0:_(s32), i32 8
%3:_(s32) = G_ASHR %2:_(s32), i32 1
It's possible to match the shift-pair in ISel and emit an extend and ashr.
However, this is far from the only way to break this shift pair and make
it hard to match the extends. Another example is that with the right
known-zeros, this:
%1:_(s32) = G_SHL %0:_(s32), i32 24
%2:_(s32) = G_ASHR %1:_(s32), i32 24
%3:_(s32) = G_MUL %2:_(s32), i32 2
can become:
%1:_(s32) = G_SHL %0:_(s32), i32 24
%2:_(s32) = G_ASHR %1:_(s32), i32 23
All upstream targets have been configured to lower it to the current
G_SHL,G_ASHR pair but will likely want to make it legal in some cases to
handle their faster cases.
To follow-up: Provide a way to legalize based on the constant. At the
moment, I'm thinking that the best way to achieve this is to provide the
MI in LegalityQuery but that opens the door to breaking core principles
of the legalizer (legality is not context sensitive). That said, it's
worth noting that looking at other instructions and acting on that
information doesn't violate this principle in itself. It's only a
violation if, at the end of legalization, a pass that checks legality
without being able to see the context would say an instruction might not be
legal. That's a fairly subtle distinction so to give a concrete example,
saying %2 in:
%1 = G_CONSTANT 16
%2 = G_SEXT_INREG %0, %1
is legal is in violation of that principle if the legality of %2 depends
on %1 being constant and/or being 16. However, legalizing to either:
%2 = G_SEXT_INREG %0, 16
or:
%1 = G_CONSTANT 16
%2:_(s32) = G_SHL %0, %1
%3:_(s32) = G_ASHR %2, %1
depending on whether %1 is constant and 16 does not violate that principle
since both outputs are genuinely legal.
Reviewers: bogner, aditya_nandakumar, volkan, aemerson, paquette, arsenm
Subscribers: sdardis, jvesely, wdng, nhaehnle, rovka, kristof.beyls, javed.absar, hiraditya, jrtc27, atanasyan, Petar.Avramovic, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D61289
llvm-svn: 368487
2019-08-10 05:11:20 +08:00
|
|
|
getActionDefinitionsBuilder(G_SEXT_INREG).lower();
|
|
|
|
|
2018-02-23 19:06:40 +08:00
|
|
|
computeTables();
|
2018-06-01 00:16:49 +08:00
|
|
|
verify(*ST.getInstrInfo());
|
2018-02-23 19:06:40 +08:00
|
|
|
}
|
2018-10-09 07:59:37 +08:00
|
|
|
|
|
|
|
bool MipsLegalizerInfo::legalizeCustom(MachineInstr &MI,
|
|
|
|
MachineRegisterInfo &MRI,
|
2018-12-06 04:14:52 +08:00
|
|
|
MachineIRBuilder &MIRBuilder,
|
|
|
|
GISelChangeObserver &Observer) const {
|
2018-10-09 07:59:37 +08:00
|
|
|
|
|
|
|
using namespace TargetOpcode;
|
|
|
|
|
|
|
|
MIRBuilder.setInstr(MI);
|
2019-08-30 13:51:12 +08:00
|
|
|
const MipsSubtarget &STI =
|
|
|
|
static_cast<const MipsSubtarget &>(MIRBuilder.getMF().getSubtarget());
|
|
|
|
const LLT s32 = LLT::scalar(32);
|
|
|
|
const LLT s64 = LLT::scalar(64);
|
|
|
|
|
|
|
|
switch (MI.getOpcode()) {
|
|
|
|
case G_UITOFP: {
|
|
|
|
Register Dst = MI.getOperand(0).getReg();
|
|
|
|
Register Src = MI.getOperand(1).getReg();
|
|
|
|
LLT DstTy = MRI.getType(Dst);
|
|
|
|
LLT SrcTy = MRI.getType(Src);
|
|
|
|
|
|
|
|
if (SrcTy != s32)
|
|
|
|
return false;
|
|
|
|
if (DstTy != s32 && DstTy != s64)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Let 0xABCDEFGH be given unsigned in MI.getOperand(1). First let's convert
|
|
|
|
// unsigned to double. Mantissa has 52 bits so we use following trick:
|
|
|
|
// First make floating point bit mask 0x43300000ABCDEFGH.
|
|
|
|
// Mask represents 2^52 * 0x1.00000ABCDEFGH i.e. 0x100000ABCDEFGH.0 .
|
|
|
|
// Next, subtract 2^52 * 0x1.0000000000000 i.e. 0x10000000000000.0 from it.
|
|
|
|
// Done. Trunc double to float if needed.
|
|
|
|
|
|
|
|
MachineInstrBuilder Bitcast = MIRBuilder.buildInstr(
|
|
|
|
STI.isFP64bit() ? Mips::BuildPairF64_64 : Mips::BuildPairF64, {s64},
|
|
|
|
{Src, MIRBuilder.buildConstant(s32, UINT32_C(0x43300000))});
|
|
|
|
Bitcast.constrainAllUses(MIRBuilder.getTII(), *STI.getRegisterInfo(),
|
|
|
|
*STI.getRegBankInfo());
|
|
|
|
|
|
|
|
MachineInstrBuilder TwoP52FP = MIRBuilder.buildFConstant(
|
|
|
|
s64, BitsToDouble(UINT64_C(0x4330000000000000)));
|
|
|
|
|
|
|
|
if (DstTy == s64)
|
|
|
|
MIRBuilder.buildFSub(Dst, Bitcast, TwoP52FP);
|
|
|
|
else {
|
|
|
|
MachineInstrBuilder ResF64 = MIRBuilder.buildFSub(s64, Bitcast, TwoP52FP);
|
|
|
|
MIRBuilder.buildFPTrunc(Dst, ResF64);
|
|
|
|
}
|
2018-10-09 07:59:37 +08:00
|
|
|
|
2019-08-30 13:51:12 +08:00
|
|
|
MI.eraseFromParent();
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
2018-10-09 07:59:37 +08:00
|
|
|
}
|
2019-07-19 08:24:45 +08:00
|
|
|
|
2019-09-05 19:16:37 +08:00
|
|
|
bool MipsLegalizerInfo::legalizeIntrinsic(MachineInstr &MI,
|
|
|
|
MachineRegisterInfo &MRI,
|
2019-07-19 08:24:45 +08:00
|
|
|
MachineIRBuilder &MIRBuilder) const {
|
2019-09-05 19:16:37 +08:00
|
|
|
const MipsSubtarget &ST =
|
|
|
|
static_cast<const MipsSubtarget &>(MI.getMF()->getSubtarget());
|
|
|
|
const MipsInstrInfo &TII = *ST.getInstrInfo();
|
|
|
|
const MipsRegisterInfo &TRI = *ST.getRegisterInfo();
|
|
|
|
const RegisterBankInfo &RBI = *ST.getRegBankInfo();
|
|
|
|
MIRBuilder.setInstr(MI);
|
|
|
|
|
2019-07-19 08:24:45 +08:00
|
|
|
switch (MI.getIntrinsicID()) {
|
|
|
|
case Intrinsic::memcpy:
|
|
|
|
case Intrinsic::memset:
|
|
|
|
case Intrinsic::memmove:
|
|
|
|
if (createMemLibcall(MIRBuilder, MRI, MI) ==
|
|
|
|
LegalizerHelper::UnableToLegalize)
|
|
|
|
return false;
|
|
|
|
MI.eraseFromParent();
|
|
|
|
return true;
|
2019-09-05 19:16:37 +08:00
|
|
|
case Intrinsic::trap: {
|
|
|
|
MachineInstr *Trap = MIRBuilder.buildInstr(Mips::TRAP);
|
|
|
|
MI.eraseFromParent();
|
|
|
|
return constrainSelectedInstRegOperands(*Trap, TII, TRI, RBI);
|
|
|
|
}
|
2019-07-19 08:24:45 +08:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|