2007-01-19 07:51:42 +00:00
|
|
|
//===-- ARMISelLowering.cpp - ARM DAG Lowering Implementation -------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2007-01-19 07:51:42 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file defines the interfaces that ARM uses to lower LLVM code into a
|
|
|
|
// selection DAG.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
#define DEBUG_TYPE "arm-isel"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "ARM.h"
|
|
|
|
#include "ARMAddressingModes.h"
|
2010-09-10 22:42:06 +00:00
|
|
|
#include "ARMCallingConv.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "ARMConstantPoolValue.h"
|
|
|
|
#include "ARMISelLowering.h"
|
|
|
|
#include "ARMMachineFunctionInfo.h"
|
2009-08-21 12:41:24 +00:00
|
|
|
#include "ARMPerfectShuffle.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "ARMRegisterInfo.h"
|
|
|
|
#include "ARMSubtarget.h"
|
|
|
|
#include "ARMTargetMachine.h"
|
2009-08-02 00:34:36 +00:00
|
|
|
#include "ARMTargetObjectFile.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "llvm/CallingConv.h"
|
|
|
|
#include "llvm/Constants.h"
|
2009-04-17 19:07:39 +00:00
|
|
|
#include "llvm/Function.h"
|
2009-10-20 11:44:38 +00:00
|
|
|
#include "llvm/GlobalValue.h"
|
2007-03-16 08:43:56 +00:00
|
|
|
#include "llvm/Instruction.h"
|
2010-09-21 17:56:22 +00:00
|
|
|
#include "llvm/Instructions.h"
|
2007-11-08 17:20:05 +00:00
|
|
|
#include "llvm/Intrinsics.h"
|
2009-10-20 11:44:38 +00:00
|
|
|
#include "llvm/Type.h"
|
2009-04-17 19:07:39 +00:00
|
|
|
#include "llvm/CodeGen/CallingConvLower.h"
|
2011-01-08 01:24:27 +00:00
|
|
|
#include "llvm/CodeGen/IntrinsicLowering.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "llvm/CodeGen/MachineBasicBlock.h"
|
|
|
|
#include "llvm/CodeGen/MachineFrameInfo.h"
|
|
|
|
#include "llvm/CodeGen/MachineFunction.h"
|
|
|
|
#include "llvm/CodeGen/MachineInstrBuilder.h"
|
2007-12-31 04:13:23 +00:00
|
|
|
#include "llvm/CodeGen/MachineRegisterInfo.h"
|
2009-04-17 19:07:39 +00:00
|
|
|
#include "llvm/CodeGen/PseudoSourceValue.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
2010-03-09 02:46:12 +00:00
|
|
|
#include "llvm/MC/MCSectionMachO.h"
|
2007-01-31 08:40:13 +00:00
|
|
|
#include "llvm/Target/TargetOptions.h"
|
2007-01-19 07:51:42 +00:00
|
|
|
#include "llvm/ADT/VectorExtras.h"
|
2011-01-08 01:24:27 +00:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2010-06-03 21:09:53 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2010-04-14 22:28:31 +00:00
|
|
|
#include "llvm/Support/CommandLine.h"
|
2009-07-08 18:01:40 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2007-03-12 23:30:29 +00:00
|
|
|
#include "llvm/Support/MathExtras.h"
|
2009-12-12 01:40:06 +00:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2009-09-01 01:57:56 +00:00
|
|
|
#include <sstream>
|
2007-01-19 07:51:42 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
STATISTIC(NumTailCalls, "Number of tail calls");
|
2011-01-19 02:16:49 +00:00
|
|
|
STATISTIC(NumMovwMovt, "Number of GAs materialized with movw + movt");
|
2010-06-03 21:09:53 +00:00
|
|
|
|
2010-08-13 22:43:33 +00:00
|
|
|
// This option should go away when tail calls fully work.
|
|
|
|
static cl::opt<bool>
|
|
|
|
EnableARMTailCalls("arm-tail-calls", cl::Hidden,
|
|
|
|
cl::desc("Generate tail calls (TEMPORARY OPTION)."),
|
|
|
|
cl::init(false));
|
|
|
|
|
2010-12-15 23:47:29 +00:00
|
|
|
cl::opt<bool>
|
2010-04-14 22:28:31 +00:00
|
|
|
EnableARMLongCalls("arm-long-calls", cl::Hidden,
|
2010-07-08 02:08:50 +00:00
|
|
|
cl::desc("Generate calls via indirect call instructions"),
|
2010-04-14 22:28:31 +00:00
|
|
|
cl::init(false));
|
|
|
|
|
2010-06-16 07:35:02 +00:00
|
|
|
static cl::opt<bool>
|
|
|
|
ARMInterworking("arm-interworking", cl::Hidden,
|
|
|
|
cl::desc("Enable / disable ARM interworking (for debugging only)"),
|
|
|
|
cl::init(true));
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
void ARMTargetLowering::addTypeForNEON(EVT VT, EVT PromotedLdStVT,
|
|
|
|
EVT PromotedBitwiseVT) {
|
2009-06-22 23:27:02 +00:00
|
|
|
if (VT != PromotedLdStVT) {
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::LOAD, VT.getSimpleVT(), Promote);
|
2009-08-10 20:46:15 +00:00
|
|
|
AddPromotedToType (ISD::LOAD, VT.getSimpleVT(),
|
|
|
|
PromotedLdStVT.getSimpleVT());
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::STORE, VT.getSimpleVT(), Promote);
|
2009-08-11 15:33:49 +00:00
|
|
|
AddPromotedToType (ISD::STORE, VT.getSimpleVT(),
|
2009-08-10 20:46:15 +00:00
|
|
|
PromotedLdStVT.getSimpleVT());
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT ElemTy = VT.getVectorElementType();
|
2009-08-11 20:47:22 +00:00
|
|
|
if (ElemTy != MVT::i64 && ElemTy != MVT::f64)
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::VSETCC, VT.getSimpleVT(), Custom);
|
2010-11-03 16:24:50 +00:00
|
|
|
setOperationAction(ISD::EXTRACT_VECTOR_ELT, VT.getSimpleVT(), Custom);
|
2009-09-16 20:20:44 +00:00
|
|
|
if (ElemTy != MVT::i32) {
|
|
|
|
setOperationAction(ISD::SINT_TO_FP, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::UINT_TO_FP, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::FP_TO_SINT, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::FP_TO_UINT, VT.getSimpleVT(), Expand);
|
|
|
|
}
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::BUILD_VECTOR, VT.getSimpleVT(), Custom);
|
|
|
|
setOperationAction(ISD::VECTOR_SHUFFLE, VT.getSimpleVT(), Custom);
|
2010-06-16 21:34:01 +00:00
|
|
|
setOperationAction(ISD::CONCAT_VECTORS, VT.getSimpleVT(), Legal);
|
2011-01-07 04:59:04 +00:00
|
|
|
setOperationAction(ISD::EXTRACT_SUBVECTOR, VT.getSimpleVT(), Legal);
|
2010-04-06 22:02:24 +00:00
|
|
|
setOperationAction(ISD::SELECT, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::SELECT_CC, VT.getSimpleVT(), Expand);
|
2009-06-22 23:27:02 +00:00
|
|
|
if (VT.isInteger()) {
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::SHL, VT.getSimpleVT(), Custom);
|
|
|
|
setOperationAction(ISD::SRA, VT.getSimpleVT(), Custom);
|
|
|
|
setOperationAction(ISD::SRL, VT.getSimpleVT(), Custom);
|
2010-08-20 04:54:02 +00:00
|
|
|
setLoadExtAction(ISD::SEXTLOAD, VT.getSimpleVT(), Expand);
|
|
|
|
setLoadExtAction(ISD::ZEXTLOAD, VT.getSimpleVT(), Expand);
|
2010-11-01 18:31:39 +00:00
|
|
|
for (unsigned InnerVT = (unsigned)MVT::FIRST_VECTOR_VALUETYPE;
|
|
|
|
InnerVT <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++InnerVT)
|
|
|
|
setTruncStoreAction(VT.getSimpleVT(),
|
|
|
|
(MVT::SimpleValueType)InnerVT, Expand);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
2010-08-20 04:54:02 +00:00
|
|
|
setLoadExtAction(ISD::EXTLOAD, VT.getSimpleVT(), Expand);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
// Promote all bit-wise operations.
|
|
|
|
if (VT.isInteger() && VT != PromotedBitwiseVT) {
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::AND, VT.getSimpleVT(), Promote);
|
2009-08-10 20:46:15 +00:00
|
|
|
AddPromotedToType (ISD::AND, VT.getSimpleVT(),
|
|
|
|
PromotedBitwiseVT.getSimpleVT());
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::OR, VT.getSimpleVT(), Promote);
|
2009-08-11 15:33:49 +00:00
|
|
|
AddPromotedToType (ISD::OR, VT.getSimpleVT(),
|
2009-08-10 20:46:15 +00:00
|
|
|
PromotedBitwiseVT.getSimpleVT());
|
2009-08-10 20:18:46 +00:00
|
|
|
setOperationAction(ISD::XOR, VT.getSimpleVT(), Promote);
|
2009-08-11 15:33:49 +00:00
|
|
|
AddPromotedToType (ISD::XOR, VT.getSimpleVT(),
|
2009-08-10 20:46:15 +00:00
|
|
|
PromotedBitwiseVT.getSimpleVT());
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
2009-09-16 00:17:28 +00:00
|
|
|
|
|
|
|
// Neon does not support vector divide/remainder operations.
|
|
|
|
setOperationAction(ISD::SDIV, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::UDIV, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::FDIV, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::SREM, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::UREM, VT.getSimpleVT(), Expand);
|
|
|
|
setOperationAction(ISD::FREM, VT.getSimpleVT(), Expand);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
void ARMTargetLowering::addDRTypeForNEON(EVT VT) {
|
2009-06-22 23:27:02 +00:00
|
|
|
addRegisterClass(VT, ARM::DPRRegisterClass);
|
2009-08-11 20:47:22 +00:00
|
|
|
addTypeForNEON(VT, MVT::f64, MVT::v2i32);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
void ARMTargetLowering::addQRTypeForNEON(EVT VT) {
|
2009-06-22 23:27:02 +00:00
|
|
|
addRegisterClass(VT, ARM::QPRRegisterClass);
|
2009-08-11 20:47:22 +00:00
|
|
|
addTypeForNEON(VT, MVT::v2f64, MVT::v4i32);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-07-28 03:13:23 +00:00
|
|
|
static TargetLoweringObjectFile *createTLOF(TargetMachine &TM) {
|
|
|
|
if (TM.getSubtarget<ARMSubtarget>().isTargetDarwin())
|
2010-03-15 21:09:38 +00:00
|
|
|
return new TargetLoweringObjectFileMachO();
|
2010-03-09 02:46:12 +00:00
|
|
|
|
2009-08-02 00:34:36 +00:00
|
|
|
return new ARMElfTargetObjectFile();
|
2009-07-28 03:13:23 +00:00
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
ARMTargetLowering::ARMTargetLowering(TargetMachine &TM)
|
2009-11-06 22:24:13 +00:00
|
|
|
: TargetLowering(TM, createTLOF(TM)) {
|
2007-01-19 07:51:42 +00:00
|
|
|
Subtarget = &TM.getSubtarget<ARMSubtarget>();
|
2010-07-23 22:39:59 +00:00
|
|
|
RegInfo = TM.getRegisterInfo();
|
2010-09-10 01:29:16 +00:00
|
|
|
Itins = TM.getInstrItineraryData();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
if (Subtarget->isTargetDarwin()) {
|
|
|
|
// Uses VFP for Thumb libfuncs if available.
|
|
|
|
if (Subtarget->isThumb() && Subtarget->hasVFP2()) {
|
|
|
|
// Single-precision floating-point arithmetic.
|
|
|
|
setLibcallName(RTLIB::ADD_F32, "__addsf3vfp");
|
|
|
|
setLibcallName(RTLIB::SUB_F32, "__subsf3vfp");
|
|
|
|
setLibcallName(RTLIB::MUL_F32, "__mulsf3vfp");
|
|
|
|
setLibcallName(RTLIB::DIV_F32, "__divsf3vfp");
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
// Double-precision floating-point arithmetic.
|
|
|
|
setLibcallName(RTLIB::ADD_F64, "__adddf3vfp");
|
|
|
|
setLibcallName(RTLIB::SUB_F64, "__subdf3vfp");
|
|
|
|
setLibcallName(RTLIB::MUL_F64, "__muldf3vfp");
|
|
|
|
setLibcallName(RTLIB::DIV_F64, "__divdf3vfp");
|
2007-01-31 09:30:58 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
// Single-precision comparisons.
|
|
|
|
setLibcallName(RTLIB::OEQ_F32, "__eqsf2vfp");
|
|
|
|
setLibcallName(RTLIB::UNE_F32, "__nesf2vfp");
|
|
|
|
setLibcallName(RTLIB::OLT_F32, "__ltsf2vfp");
|
|
|
|
setLibcallName(RTLIB::OLE_F32, "__lesf2vfp");
|
|
|
|
setLibcallName(RTLIB::OGE_F32, "__gesf2vfp");
|
|
|
|
setLibcallName(RTLIB::OGT_F32, "__gtsf2vfp");
|
|
|
|
setLibcallName(RTLIB::UO_F32, "__unordsf2vfp");
|
|
|
|
setLibcallName(RTLIB::O_F32, "__unordsf2vfp");
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
setCmpLibcallCC(RTLIB::OEQ_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::UNE_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OLT_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OLE_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OGE_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OGT_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::UO_F32, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::O_F32, ISD::SETEQ);
|
2007-01-31 09:30:58 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
// Double-precision comparisons.
|
|
|
|
setLibcallName(RTLIB::OEQ_F64, "__eqdf2vfp");
|
|
|
|
setLibcallName(RTLIB::UNE_F64, "__nedf2vfp");
|
|
|
|
setLibcallName(RTLIB::OLT_F64, "__ltdf2vfp");
|
|
|
|
setLibcallName(RTLIB::OLE_F64, "__ledf2vfp");
|
|
|
|
setLibcallName(RTLIB::OGE_F64, "__gedf2vfp");
|
|
|
|
setLibcallName(RTLIB::OGT_F64, "__gtdf2vfp");
|
|
|
|
setLibcallName(RTLIB::UO_F64, "__unorddf2vfp");
|
|
|
|
setLibcallName(RTLIB::O_F64, "__unorddf2vfp");
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
setCmpLibcallCC(RTLIB::OEQ_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::UNE_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OLT_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OLE_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OGE_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::OGT_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::UO_F64, ISD::SETNE);
|
|
|
|
setCmpLibcallCC(RTLIB::O_F64, ISD::SETEQ);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
// Floating-point to integer conversions.
|
|
|
|
// i64 conversions are done via library routines even when generating VFP
|
|
|
|
// instructions, so use the same ones.
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F64_I32, "__fixdfsivfp");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F64_I32, "__fixunsdfsivfp");
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F32_I32, "__fixsfsivfp");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F32_I32, "__fixunssfsivfp");
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-04-27 08:15:43 +00:00
|
|
|
// Conversions between floating types.
|
|
|
|
setLibcallName(RTLIB::FPROUND_F64_F32, "__truncdfsf2vfp");
|
|
|
|
setLibcallName(RTLIB::FPEXT_F32_F64, "__extendsfdf2vfp");
|
|
|
|
|
|
|
|
// Integer to floating-point conversions.
|
|
|
|
// i64 conversions are done via library routines even when generating VFP
|
|
|
|
// instructions, so use the same ones.
|
2009-03-20 23:16:43 +00:00
|
|
|
// FIXME: There appears to be some naming inconsistency in ARM libgcc:
|
|
|
|
// e.g., __floatunsidf vs. __floatunssidfvfp.
|
2007-04-27 08:15:43 +00:00
|
|
|
setLibcallName(RTLIB::SINTTOFP_I32_F64, "__floatsidfvfp");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I32_F64, "__floatunssidfvfp");
|
|
|
|
setLibcallName(RTLIB::SINTTOFP_I32_F32, "__floatsisfvfp");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I32_F32, "__floatunssisfvfp");
|
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2009-05-22 17:38:41 +00:00
|
|
|
// These libcalls are not available in 32-bit.
|
|
|
|
setLibcallName(RTLIB::SHL_I128, 0);
|
|
|
|
setLibcallName(RTLIB::SRL_I128, 0);
|
|
|
|
setLibcallName(RTLIB::SRA_I128, 0);
|
|
|
|
|
2009-08-14 20:10:52 +00:00
|
|
|
if (Subtarget->isAAPCS_ABI()) {
|
2010-11-23 03:31:01 +00:00
|
|
|
// Double-precision floating-point arithmetic helper functions
|
2010-09-28 21:39:26 +00:00
|
|
|
// RTABI chapter 4.1.2, Table 2
|
|
|
|
setLibcallName(RTLIB::ADD_F64, "__aeabi_dadd");
|
|
|
|
setLibcallName(RTLIB::DIV_F64, "__aeabi_ddiv");
|
|
|
|
setLibcallName(RTLIB::MUL_F64, "__aeabi_dmul");
|
|
|
|
setLibcallName(RTLIB::SUB_F64, "__aeabi_dsub");
|
|
|
|
setLibcallCallingConv(RTLIB::ADD_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::DIV_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::MUL_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SUB_F64, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Double-precision floating-point comparison helper functions
|
|
|
|
// RTABI chapter 4.1.2, Table 3
|
|
|
|
setLibcallName(RTLIB::OEQ_F64, "__aeabi_dcmpeq");
|
|
|
|
setCmpLibcallCC(RTLIB::OEQ_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::UNE_F64, "__aeabi_dcmpeq");
|
|
|
|
setCmpLibcallCC(RTLIB::UNE_F64, ISD::SETEQ);
|
|
|
|
setLibcallName(RTLIB::OLT_F64, "__aeabi_dcmplt");
|
|
|
|
setCmpLibcallCC(RTLIB::OLT_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OLE_F64, "__aeabi_dcmple");
|
|
|
|
setCmpLibcallCC(RTLIB::OLE_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OGE_F64, "__aeabi_dcmpge");
|
|
|
|
setCmpLibcallCC(RTLIB::OGE_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OGT_F64, "__aeabi_dcmpgt");
|
|
|
|
setCmpLibcallCC(RTLIB::OGT_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::UO_F64, "__aeabi_dcmpun");
|
|
|
|
setCmpLibcallCC(RTLIB::UO_F64, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::O_F64, "__aeabi_dcmpun");
|
|
|
|
setCmpLibcallCC(RTLIB::O_F64, ISD::SETEQ);
|
|
|
|
setLibcallCallingConv(RTLIB::OEQ_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UNE_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OLT_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OLE_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OGE_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OGT_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UO_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::O_F64, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Single-precision floating-point arithmetic helper functions
|
|
|
|
// RTABI chapter 4.1.2, Table 4
|
|
|
|
setLibcallName(RTLIB::ADD_F32, "__aeabi_fadd");
|
|
|
|
setLibcallName(RTLIB::DIV_F32, "__aeabi_fdiv");
|
|
|
|
setLibcallName(RTLIB::MUL_F32, "__aeabi_fmul");
|
|
|
|
setLibcallName(RTLIB::SUB_F32, "__aeabi_fsub");
|
|
|
|
setLibcallCallingConv(RTLIB::ADD_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::DIV_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::MUL_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SUB_F32, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Single-precision floating-point comparison helper functions
|
|
|
|
// RTABI chapter 4.1.2, Table 5
|
|
|
|
setLibcallName(RTLIB::OEQ_F32, "__aeabi_fcmpeq");
|
|
|
|
setCmpLibcallCC(RTLIB::OEQ_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::UNE_F32, "__aeabi_fcmpeq");
|
|
|
|
setCmpLibcallCC(RTLIB::UNE_F32, ISD::SETEQ);
|
|
|
|
setLibcallName(RTLIB::OLT_F32, "__aeabi_fcmplt");
|
|
|
|
setCmpLibcallCC(RTLIB::OLT_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OLE_F32, "__aeabi_fcmple");
|
|
|
|
setCmpLibcallCC(RTLIB::OLE_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OGE_F32, "__aeabi_fcmpge");
|
|
|
|
setCmpLibcallCC(RTLIB::OGE_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::OGT_F32, "__aeabi_fcmpgt");
|
|
|
|
setCmpLibcallCC(RTLIB::OGT_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::UO_F32, "__aeabi_fcmpun");
|
|
|
|
setCmpLibcallCC(RTLIB::UO_F32, ISD::SETNE);
|
|
|
|
setLibcallName(RTLIB::O_F32, "__aeabi_fcmpun");
|
|
|
|
setCmpLibcallCC(RTLIB::O_F32, ISD::SETEQ);
|
|
|
|
setLibcallCallingConv(RTLIB::OEQ_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UNE_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OLT_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OLE_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OGE_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::OGT_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UO_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::O_F32, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Floating-point to integer conversions.
|
|
|
|
// RTABI chapter 4.1.2, Table 6
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F64_I32, "__aeabi_d2iz");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F64_I32, "__aeabi_d2uiz");
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F64_I64, "__aeabi_d2lz");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F64_I64, "__aeabi_d2ulz");
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F32_I32, "__aeabi_f2iz");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F32_I32, "__aeabi_f2uiz");
|
|
|
|
setLibcallName(RTLIB::FPTOSINT_F32_I64, "__aeabi_f2lz");
|
|
|
|
setLibcallName(RTLIB::FPTOUINT_F32_I64, "__aeabi_f2ulz");
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOSINT_F64_I32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOUINT_F64_I32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOSINT_F64_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOUINT_F64_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOSINT_F32_I32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOUINT_F32_I32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOSINT_F32_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::FPTOUINT_F32_I64, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Conversions between floating types.
|
|
|
|
// RTABI chapter 4.1.2, Table 7
|
|
|
|
setLibcallName(RTLIB::FPROUND_F64_F32, "__aeabi_d2f");
|
|
|
|
setLibcallName(RTLIB::FPEXT_F32_F64, "__aeabi_f2d");
|
|
|
|
setLibcallCallingConv(RTLIB::FPROUND_F64_F32, CallingConv::ARM_AAPCS);
|
2010-11-23 03:31:01 +00:00
|
|
|
setLibcallCallingConv(RTLIB::FPEXT_F32_F64, CallingConv::ARM_AAPCS);
|
2010-09-28 21:39:26 +00:00
|
|
|
|
|
|
|
// Integer to floating-point conversions.
|
|
|
|
// RTABI chapter 4.1.2, Table 8
|
|
|
|
setLibcallName(RTLIB::SINTTOFP_I32_F64, "__aeabi_i2d");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I32_F64, "__aeabi_ui2d");
|
|
|
|
setLibcallName(RTLIB::SINTTOFP_I64_F64, "__aeabi_l2d");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I64_F64, "__aeabi_ul2d");
|
|
|
|
setLibcallName(RTLIB::SINTTOFP_I32_F32, "__aeabi_i2f");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I32_F32, "__aeabi_ui2f");
|
|
|
|
setLibcallName(RTLIB::SINTTOFP_I64_F32, "__aeabi_l2f");
|
|
|
|
setLibcallName(RTLIB::UINTTOFP_I64_F32, "__aeabi_ul2f");
|
|
|
|
setLibcallCallingConv(RTLIB::SINTTOFP_I32_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UINTTOFP_I32_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SINTTOFP_I64_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UINTTOFP_I64_F64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SINTTOFP_I32_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UINTTOFP_I32_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SINTTOFP_I64_F32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UINTTOFP_I64_F32, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Long long helper functions
|
|
|
|
// RTABI chapter 4.2, Table 9
|
|
|
|
setLibcallName(RTLIB::MUL_I64, "__aeabi_lmul");
|
|
|
|
setLibcallName(RTLIB::SDIV_I64, "__aeabi_ldivmod");
|
|
|
|
setLibcallName(RTLIB::UDIV_I64, "__aeabi_uldivmod");
|
|
|
|
setLibcallName(RTLIB::SHL_I64, "__aeabi_llsl");
|
|
|
|
setLibcallName(RTLIB::SRL_I64, "__aeabi_llsr");
|
|
|
|
setLibcallName(RTLIB::SRA_I64, "__aeabi_lasr");
|
|
|
|
setLibcallCallingConv(RTLIB::MUL_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SDIV_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UDIV_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SHL_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SRL_I64, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SRA_I64, CallingConv::ARM_AAPCS);
|
|
|
|
|
|
|
|
// Integer division functions
|
|
|
|
// RTABI chapter 4.3.1
|
|
|
|
setLibcallName(RTLIB::SDIV_I8, "__aeabi_idiv");
|
|
|
|
setLibcallName(RTLIB::SDIV_I16, "__aeabi_idiv");
|
|
|
|
setLibcallName(RTLIB::SDIV_I32, "__aeabi_idiv");
|
|
|
|
setLibcallName(RTLIB::UDIV_I8, "__aeabi_uidiv");
|
|
|
|
setLibcallName(RTLIB::UDIV_I16, "__aeabi_uidiv");
|
|
|
|
setLibcallName(RTLIB::UDIV_I32, "__aeabi_uidiv");
|
|
|
|
setLibcallCallingConv(RTLIB::SDIV_I8, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SDIV_I16, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::SDIV_I32, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UDIV_I8, CallingConv::ARM_AAPCS);
|
|
|
|
setLibcallCallingConv(RTLIB::UDIV_I16, CallingConv::ARM_AAPCS);
|
2010-11-23 03:31:01 +00:00
|
|
|
setLibcallCallingConv(RTLIB::UDIV_I32, CallingConv::ARM_AAPCS);
|
2009-08-14 20:10:52 +00:00
|
|
|
}
|
|
|
|
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
2009-08-11 20:47:22 +00:00
|
|
|
addRegisterClass(MVT::i32, ARM::tGPRRegisterClass);
|
2009-04-07 20:34:09 +00:00
|
|
|
else
|
2009-08-11 20:47:22 +00:00
|
|
|
addRegisterClass(MVT::i32, ARM::GPRRegisterClass);
|
2009-07-08 23:10:31 +00:00
|
|
|
if (!UseSoftFloat && Subtarget->hasVFP2() && !Subtarget->isThumb1Only()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
addRegisterClass(MVT::f32, ARM::SPRRegisterClass);
|
2010-08-11 15:44:15 +00:00
|
|
|
if (!Subtarget->isFPOnlySP())
|
|
|
|
addRegisterClass(MVT::f64, ARM::DPRRegisterClass);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
setTruncStoreAction(MVT::f64, MVT::f32, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
if (Subtarget->hasNEON()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
addDRTypeForNEON(MVT::v2f32);
|
|
|
|
addDRTypeForNEON(MVT::v8i8);
|
|
|
|
addDRTypeForNEON(MVT::v4i16);
|
|
|
|
addDRTypeForNEON(MVT::v2i32);
|
|
|
|
addDRTypeForNEON(MVT::v1i64);
|
|
|
|
|
|
|
|
addQRTypeForNEON(MVT::v4f32);
|
|
|
|
addQRTypeForNEON(MVT::v2f64);
|
|
|
|
addQRTypeForNEON(MVT::v16i8);
|
|
|
|
addQRTypeForNEON(MVT::v8i16);
|
|
|
|
addQRTypeForNEON(MVT::v4i32);
|
|
|
|
addQRTypeForNEON(MVT::v2i64);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-09-15 23:55:57 +00:00
|
|
|
// v2f64 is legal so that QR subregs can be extracted as f64 elements, but
|
|
|
|
// neither Neon nor VFP support any arithmetic operations on it.
|
|
|
|
setOperationAction(ISD::FADD, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FSUB, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FMUL, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FDIV, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FREM, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FCOPYSIGN, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::VSETCC, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FNEG, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FABS, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FSQRT, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FSIN, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FCOS, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FPOWI, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FPOW, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FLOG, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FLOG2, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FLOG10, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FEXP, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FEXP2, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FCEIL, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FTRUNC, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FRINT, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FNEARBYINT, MVT::v2f64, Expand);
|
|
|
|
setOperationAction(ISD::FFLOOR, MVT::v2f64, Expand);
|
|
|
|
|
2010-08-20 04:54:02 +00:00
|
|
|
setTruncStoreAction(MVT::v2f64, MVT::v2f32, Expand);
|
|
|
|
|
2009-09-16 00:32:15 +00:00
|
|
|
// Neon does not support some operations on v1i64 and v2i64 types.
|
|
|
|
setOperationAction(ISD::MUL, MVT::v1i64, Expand);
|
2010-09-01 23:50:19 +00:00
|
|
|
// Custom handling for some quad-vector types to detect VMULL.
|
|
|
|
setOperationAction(ISD::MUL, MVT::v8i16, Custom);
|
|
|
|
setOperationAction(ISD::MUL, MVT::v4i32, Custom);
|
|
|
|
setOperationAction(ISD::MUL, MVT::v2i64, Custom);
|
2009-09-16 00:32:15 +00:00
|
|
|
setOperationAction(ISD::VSETCC, MVT::v1i64, Expand);
|
|
|
|
setOperationAction(ISD::VSETCC, MVT::v2i64, Expand);
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
setTargetDAGCombine(ISD::INTRINSIC_WO_CHAIN);
|
|
|
|
setTargetDAGCombine(ISD::SHL);
|
|
|
|
setTargetDAGCombine(ISD::SRL);
|
|
|
|
setTargetDAGCombine(ISD::SRA);
|
|
|
|
setTargetDAGCombine(ISD::SIGN_EXTEND);
|
|
|
|
setTargetDAGCombine(ISD::ZERO_EXTEND);
|
|
|
|
setTargetDAGCombine(ISD::ANY_EXTEND);
|
2010-02-18 06:05:53 +00:00
|
|
|
setTargetDAGCombine(ISD::SELECT_CC);
|
2010-09-17 22:59:05 +00:00
|
|
|
setTargetDAGCombine(ISD::BUILD_VECTOR);
|
SelectionDAG shuffle nodes do not allow operands with different numbers of
elements than the result vector type. So, when an instruction like:
%8 = shufflevector <2 x float> %4, <2 x float> %7, <4 x i32> <i32 1, i32 0, i32 3, i32 2>
is translated to a DAG, each operand is changed to a concat_vectors node that appends 2 undef elements. That is:
shuffle [a,b], [c,d] is changed to:
shuffle [a,b,u,u], [c,d,u,u]
That's probably the right thing for x86 but for NEON, we'd much rather have:
shuffle [a,b,c,d], undef
Teach the DAG combiner how to do that transformation for ARM. Radar 8597007.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117482 91177308-0d34-0410-b5e6-96231b3b80d8
2010-10-27 20:38:28 +00:00
|
|
|
setTargetDAGCombine(ISD::VECTOR_SHUFFLE);
|
2010-12-21 06:43:19 +00:00
|
|
|
setTargetDAGCombine(ISD::INSERT_VECTOR_ELT);
|
|
|
|
setTargetDAGCombine(ISD::STORE);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2007-05-18 00:19:34 +00:00
|
|
|
computeRegisterProperties();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
|
|
|
// ARM does not have f32 extending load.
|
2009-08-11 20:47:22 +00:00
|
|
|
setLoadExtAction(ISD::EXTLOAD, MVT::f32, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2008-01-23 20:39:46 +00:00
|
|
|
// ARM does not have i1 sign extending load.
|
2009-08-11 20:47:22 +00:00
|
|
|
setLoadExtAction(ISD::SEXTLOAD, MVT::i1, Promote);
|
2008-01-23 20:39:46 +00:00
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// ARM supports all 4 flavors of integer indexed load / store.
|
2009-07-02 07:28:31 +00:00
|
|
|
if (!Subtarget->isThumb1Only()) {
|
|
|
|
for (unsigned im = (unsigned)ISD::PRE_INC;
|
|
|
|
im != (unsigned)ISD::LAST_INDEXED_MODE; ++im) {
|
2009-08-11 20:47:22 +00:00
|
|
|
setIndexedLoadAction(im, MVT::i1, Legal);
|
|
|
|
setIndexedLoadAction(im, MVT::i8, Legal);
|
|
|
|
setIndexedLoadAction(im, MVT::i16, Legal);
|
|
|
|
setIndexedLoadAction(im, MVT::i32, Legal);
|
|
|
|
setIndexedStoreAction(im, MVT::i1, Legal);
|
|
|
|
setIndexedStoreAction(im, MVT::i8, Legal);
|
|
|
|
setIndexedStoreAction(im, MVT::i16, Legal);
|
|
|
|
setIndexedStoreAction(im, MVT::i32, Legal);
|
2009-07-02 07:28:31 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// i64 operation support.
|
2009-07-07 01:17:28 +00:00
|
|
|
if (Subtarget->isThumb1Only()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::MUL, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::MULHU, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::MULHS, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::UMUL_LOHI, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::SMUL_LOHI, MVT::i32, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
} else {
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::MUL, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::MULHU, MVT::i32, Expand);
|
2009-08-01 00:16:10 +00:00
|
|
|
if (!Subtarget->hasV6Ops())
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::MULHS, MVT::i32, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-10-31 19:38:01 +00:00
|
|
|
setOperationAction(ISD::SHL_PARTS, MVT::i32, Custom);
|
2009-10-31 21:00:56 +00:00
|
|
|
setOperationAction(ISD::SRA_PARTS, MVT::i32, Custom);
|
2009-10-31 21:42:19 +00:00
|
|
|
setOperationAction(ISD::SRL_PARTS, MVT::i32, Custom);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SRL, MVT::i64, Custom);
|
|
|
|
setOperationAction(ISD::SRA, MVT::i64, Custom);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
|
|
|
// ARM does not have ROTL.
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::ROTL, MVT::i32, Expand);
|
2010-01-18 19:58:49 +00:00
|
|
|
setOperationAction(ISD::CTTZ, MVT::i32, Custom);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::CTPOP, MVT::i32, Expand);
|
2009-06-26 20:47:43 +00:00
|
|
|
if (!Subtarget->hasV5TOps() || Subtarget->isThumb1Only())
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::CTLZ, MVT::i32, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-03-16 22:54:16 +00:00
|
|
|
// Only ARMv6 has BSWAP.
|
|
|
|
if (!Subtarget->hasV6Ops())
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::BSWAP, MVT::i32, Expand);
|
2007-03-16 22:54:16 +00:00
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// These are expanded into libcalls.
|
2010-11-19 06:28:11 +00:00
|
|
|
if (!Subtarget->hasDivide() || !Subtarget->isThumb2()) {
|
2010-05-05 20:44:35 +00:00
|
|
|
// v7M has a hardware divider
|
|
|
|
setOperationAction(ISD::SDIV, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::UDIV, MVT::i32, Expand);
|
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SREM, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::UREM, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::SDIVREM, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::UDIVREM, MVT::i32, Expand);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::GlobalAddress, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::ConstantPool, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::GLOBAL_OFFSET_TABLE, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::GlobalTLSAddress, MVT::i32, Custom);
|
2009-10-30 05:45:42 +00:00
|
|
|
setOperationAction(ISD::BlockAddress, MVT::i32, Custom);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-05-11 07:26:32 +00:00
|
|
|
setOperationAction(ISD::TRAP, MVT::Other, Legal);
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// Use the default implementation.
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::VASTART, MVT::Other, Custom);
|
|
|
|
setOperationAction(ISD::VAARG, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::VACOPY, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::VAEND, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::STACKSAVE, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::STACKRESTORE, MVT::Other, Expand);
|
2009-08-12 17:38:44 +00:00
|
|
|
setOperationAction(ISD::EHSELECTION, MVT::i32, Expand);
|
2011-01-24 22:38:45 +00:00
|
|
|
setOperationAction(ISD::EXCEPTIONADDR, MVT::i32, Expand);
|
|
|
|
setExceptionPointerRegister(ARM::R0);
|
|
|
|
setExceptionSelectorRegister(ARM::R1);
|
|
|
|
|
2010-04-15 22:20:34 +00:00
|
|
|
setOperationAction(ISD::DYNAMIC_STACKALLOC, MVT::i32, Expand);
|
2010-08-11 06:22:01 +00:00
|
|
|
// ARMv6 Thumb1 (except for CPUs that support dmb / dsb) and earlier use
|
|
|
|
// the default expansion.
|
|
|
|
if (Subtarget->hasDataBarrier() ||
|
2010-11-09 22:50:44 +00:00
|
|
|
(Subtarget->hasV6Ops() && !Subtarget->isThumb())) {
|
2010-06-18 22:35:32 +00:00
|
|
|
// membarrier needs custom lowering; the rest are legal and handled
|
|
|
|
// normally.
|
|
|
|
setOperationAction(ISD::MEMBARRIER, MVT::Other, Custom);
|
|
|
|
} else {
|
|
|
|
// Set them all for expansion, which will force libcalls.
|
|
|
|
setOperationAction(ISD::MEMBARRIER, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_CMP_SWAP, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_CMP_SWAP, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_CMP_SWAP, MVT::i32, Expand);
|
2010-06-18 23:03:10 +00:00
|
|
|
setOperationAction(ISD::ATOMIC_SWAP, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_SWAP, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_SWAP, MVT::i32, Expand);
|
2010-06-18 22:35:32 +00:00
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_ADD, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_ADD, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_ADD, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_SUB, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_SUB, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_SUB, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_AND, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_AND, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_AND, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_OR, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_OR, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_OR, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_XOR, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_XOR, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_XOR, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_NAND, MVT::i8, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_NAND, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_NAND, MVT::i32, Expand);
|
2010-06-23 16:08:49 +00:00
|
|
|
// Since the libcalls include locking, fold in the fences
|
|
|
|
setShouldFoldAtomicFences(true);
|
2010-06-18 22:35:32 +00:00
|
|
|
}
|
|
|
|
// 64-bit versions are always libcalls (for now)
|
|
|
|
setOperationAction(ISD::ATOMIC_CMP_SWAP, MVT::i64, Expand);
|
2010-06-18 23:03:10 +00:00
|
|
|
setOperationAction(ISD::ATOMIC_SWAP, MVT::i64, Expand);
|
2010-06-18 22:35:32 +00:00
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_ADD, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_SUB, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_AND, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_OR, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_XOR, MVT::i64, Expand);
|
|
|
|
setOperationAction(ISD::ATOMIC_LOAD_NAND, MVT::i64, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-11-04 05:19:35 +00:00
|
|
|
setOperationAction(ISD::PREFETCH, MVT::Other, Custom);
|
2010-11-03 05:14:24 +00:00
|
|
|
|
2010-06-26 04:36:50 +00:00
|
|
|
// Requires SXTB/SXTH, available on v6 and up in both ARM and Thumb modes.
|
|
|
|
if (!Subtarget->hasV6Ops()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i16, Expand);
|
|
|
|
setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i8, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SIGN_EXTEND_INREG, MVT::i1, Expand);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-08-03 21:31:55 +00:00
|
|
|
if (!UseSoftFloat && Subtarget->hasVFP2() && !Subtarget->isThumb1Only()) {
|
2010-01-19 22:56:26 +00:00
|
|
|
// Turn f64->i64 into VMOVRRD, i64 -> f64 to VMOVDRR
|
|
|
|
// iff target supports vfp2.
|
2010-11-23 03:31:01 +00:00
|
|
|
setOperationAction(ISD::BITCAST, MVT::i64, Custom);
|
2010-08-03 21:31:55 +00:00
|
|
|
setOperationAction(ISD::FLT_ROUNDS_, MVT::i32, Custom);
|
|
|
|
}
|
2007-11-08 17:20:05 +00:00
|
|
|
|
|
|
|
// We want to custom lower some of our intrinsics.
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::INTRINSIC_WO_CHAIN, MVT::Other, Custom);
|
2010-07-07 00:07:57 +00:00
|
|
|
if (Subtarget->isTargetDarwin()) {
|
|
|
|
setOperationAction(ISD::EH_SJLJ_SETJMP, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::EH_SJLJ_LONGJMP, MVT::Other, Custom);
|
2010-10-19 23:27:08 +00:00
|
|
|
setOperationAction(ISD::EH_SJLJ_DISPATCHSETUP, MVT::Other, Custom);
|
2010-07-07 00:07:57 +00:00
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
|
|
|
|
setOperationAction(ISD::SETCC, MVT::i32, Expand);
|
|
|
|
setOperationAction(ISD::SETCC, MVT::f32, Expand);
|
|
|
|
setOperationAction(ISD::SETCC, MVT::f64, Expand);
|
Consider this code snippet:
float t1(int argc) {
return (argc == 1123) ? 1.234f : 2.38213f;
}
We would generate truly awful code on ARM (those with a weak stomach should look
away):
_t1:
movw r1, #1123
movs r2, #1
movs r3, #0
cmp r0, r1
mov.w r0, #0
it eq
moveq r0, r2
movs r1, #4
cmp r0, #0
it ne
movne r3, r1
adr r0, #LCPI1_0
ldr r0, [r0, r3]
bx lr
The problem was that legalization was creating a cascade of SELECT_CC nodes, for
for the comparison of "argc == 1123" which was fed into a SELECT node for the ?:
statement which was itself converted to a SELECT_CC node. This is because the
ARM back-end doesn't have custom lowering for SELECT nodes, so it used the
default "Expand".
I added a fairly simple "LowerSELECT" to the ARM back-end. It takes care of this
testcase, but can obviously be expanded to include more cases.
Now we generate this, which looks optimal to me:
_t1:
movw r1, #1123
movs r2, #0
cmp r0, r1
adr r0, #LCPI0_0
it eq
moveq r2, #4
ldr r0, [r0, r2]
bx lr
.align 2
LCPI0_0:
.long 1075344593 @ float 2.382130e+00
.long 1067316150 @ float 1.234000e+00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@110799 91177308-0d34-0410-b5e6-96231b3b80d8
2010-08-11 08:43:16 +00:00
|
|
|
setOperationAction(ISD::SELECT, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::SELECT, MVT::f32, Custom);
|
|
|
|
setOperationAction(ISD::SELECT, MVT::f64, Custom);
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::SELECT_CC, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::SELECT_CC, MVT::f32, Custom);
|
|
|
|
setOperationAction(ISD::SELECT_CC, MVT::f64, Custom);
|
|
|
|
|
|
|
|
setOperationAction(ISD::BRCOND, MVT::Other, Expand);
|
|
|
|
setOperationAction(ISD::BR_CC, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::BR_CC, MVT::f32, Custom);
|
|
|
|
setOperationAction(ISD::BR_CC, MVT::f64, Custom);
|
|
|
|
setOperationAction(ISD::BR_JT, MVT::Other, Custom);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-10-11 23:21:31 +00:00
|
|
|
// We don't support sin/cos/fmod/copysign/pow
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::FSIN, MVT::f64, Expand);
|
|
|
|
setOperationAction(ISD::FSIN, MVT::f32, Expand);
|
|
|
|
setOperationAction(ISD::FCOS, MVT::f32, Expand);
|
|
|
|
setOperationAction(ISD::FCOS, MVT::f64, Expand);
|
|
|
|
setOperationAction(ISD::FREM, MVT::f64, Expand);
|
|
|
|
setOperationAction(ISD::FREM, MVT::f32, Expand);
|
2009-07-08 23:10:31 +00:00
|
|
|
if (!UseSoftFloat && Subtarget->hasVFP2() && !Subtarget->isThumb1Only()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::FCOPYSIGN, MVT::f64, Custom);
|
|
|
|
setOperationAction(ISD::FCOPYSIGN, MVT::f32, Custom);
|
2008-04-01 01:50:16 +00:00
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
setOperationAction(ISD::FPOW, MVT::f64, Expand);
|
|
|
|
setOperationAction(ISD::FPOW, MVT::f32, Expand);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-03-14 18:42:31 +00:00
|
|
|
// Various VFP goodness
|
|
|
|
if (!UseSoftFloat && !Subtarget->isThumb1Only()) {
|
2010-03-19 22:51:32 +00:00
|
|
|
// int <-> fp are custom expanded into bit_convert + ARMISD ops.
|
|
|
|
if (Subtarget->hasVFP2()) {
|
|
|
|
setOperationAction(ISD::SINT_TO_FP, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::UINT_TO_FP, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::FP_TO_UINT, MVT::i32, Custom);
|
|
|
|
setOperationAction(ISD::FP_TO_SINT, MVT::i32, Custom);
|
|
|
|
}
|
2010-03-14 18:42:31 +00:00
|
|
|
// Special handling for half-precision FP.
|
2010-03-18 22:35:37 +00:00
|
|
|
if (!Subtarget->hasFP16()) {
|
|
|
|
setOperationAction(ISD::FP16_TO_FP32, MVT::f32, Expand);
|
|
|
|
setOperationAction(ISD::FP32_TO_FP16, MVT::i32, Expand);
|
2010-03-14 18:42:31 +00:00
|
|
|
}
|
2008-04-01 01:50:16 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2007-11-27 22:36:16 +00:00
|
|
|
// We have target-specific dag combine patterns for the following nodes:
|
2009-11-09 00:11:35 +00:00
|
|
|
// ARMISD::VMOVRRD - No need to call setTargetDAGCombine
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
setTargetDAGCombine(ISD::ADD);
|
|
|
|
setTargetDAGCombine(ISD::SUB);
|
2010-05-15 18:16:59 +00:00
|
|
|
setTargetDAGCombine(ISD::MUL);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-11-05 19:27:46 +00:00
|
|
|
if (Subtarget->hasV6T2Ops() || Subtarget->hasNEON())
|
2010-07-16 23:05:05 +00:00
|
|
|
setTargetDAGCombine(ISD::OR);
|
2010-11-05 19:27:46 +00:00
|
|
|
if (Subtarget->hasNEON())
|
|
|
|
setTargetDAGCombine(ISD::AND);
|
2010-07-16 23:05:05 +00:00
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
setStackPointerRegisterToSaveRestore(ARM::SP);
|
2010-05-20 23:26:43 +00:00
|
|
|
|
2010-05-21 00:43:17 +00:00
|
|
|
if (UseSoftFloat || Subtarget->isThumb1Only() || !Subtarget->hasVFP2())
|
|
|
|
setSchedulingPreference(Sched::RegPressure);
|
|
|
|
else
|
|
|
|
setSchedulingPreference(Sched::Hybrid);
|
2009-08-15 07:59:10 +00:00
|
|
|
|
2011-01-06 06:52:41 +00:00
|
|
|
//// temporary - rewrite interface to use type
|
|
|
|
maxStoresPerMemcpy = maxStoresPerMemcpyOptSize = 1;
|
2010-06-26 01:52:05 +00:00
|
|
|
|
2010-07-11 04:01:49 +00:00
|
|
|
// On ARM arguments smaller than 4 bytes are extended, so all arguments
|
|
|
|
// are at least 4 bytes aligned.
|
|
|
|
setMinStackArgumentAlignment(4);
|
|
|
|
|
2010-09-24 19:07:23 +00:00
|
|
|
benefitFromCodePlacementOpt = true;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2011-01-19 02:35:27 +00:00
|
|
|
// FIXME: It might make sense to define the representative register class as the
|
|
|
|
// nearest super-register that has a non-null superset. For example, DPR_VFP2 is
|
|
|
|
// a super-register of SPR, and DPR is a superset if DPR_VFP2. Consequently,
|
|
|
|
// SPR's representative would be DPR_VFP2. This should work well if register
|
|
|
|
// pressure tracking were modified such that a register use would increment the
|
|
|
|
// pressure of the register class's representative and all of it's super
|
|
|
|
// classes' representatives transitively. We have not implemented this because
|
|
|
|
// of the difficulty prior to coalescing of modeling operand register classes
|
|
|
|
// due to the common occurence of cross class copies and subregister insertions
|
|
|
|
// and extractions.
|
2010-07-21 06:09:07 +00:00
|
|
|
std::pair<const TargetRegisterClass*, uint8_t>
|
|
|
|
ARMTargetLowering::findRepresentativeClass(EVT VT) const{
|
|
|
|
const TargetRegisterClass *RRC = 0;
|
|
|
|
uint8_t Cost = 1;
|
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
2010-07-19 22:15:08 +00:00
|
|
|
default:
|
2010-07-21 06:09:07 +00:00
|
|
|
return TargetLowering::findRepresentativeClass(VT);
|
2010-07-21 23:53:58 +00:00
|
|
|
// Use DPR as representative register class for all floating point
|
|
|
|
// and vector types. Since there are 32 SPR registers and 32 DPR registers so
|
|
|
|
// the cost is 1 for both f32 and f64.
|
|
|
|
case MVT::f32: case MVT::f64: case MVT::v8i8: case MVT::v4i16:
|
2010-07-21 06:09:07 +00:00
|
|
|
case MVT::v2i32: case MVT::v1i64: case MVT::v2f32:
|
2010-07-21 23:53:58 +00:00
|
|
|
RRC = ARM::DPRRegisterClass;
|
2011-01-19 02:35:27 +00:00
|
|
|
// When NEON is used for SP, only half of the register file is available
|
|
|
|
// because operations that define both SP and DP results will be constrained
|
|
|
|
// to the VFP2 class (D0-D15). We currently model this constraint prior to
|
|
|
|
// coalescing by double-counting the SP regs. See the FIXME above.
|
|
|
|
if (Subtarget->useNEONForSinglePrecisionFP())
|
|
|
|
Cost = 2;
|
2010-07-21 06:09:07 +00:00
|
|
|
break;
|
|
|
|
case MVT::v16i8: case MVT::v8i16: case MVT::v4i32: case MVT::v2i64:
|
|
|
|
case MVT::v4f32: case MVT::v2f64:
|
2010-07-21 23:53:58 +00:00
|
|
|
RRC = ARM::DPRRegisterClass;
|
|
|
|
Cost = 2;
|
2010-07-21 06:09:07 +00:00
|
|
|
break;
|
|
|
|
case MVT::v4i64:
|
2010-07-21 23:53:58 +00:00
|
|
|
RRC = ARM::DPRRegisterClass;
|
|
|
|
Cost = 4;
|
2010-07-21 06:09:07 +00:00
|
|
|
break;
|
|
|
|
case MVT::v8i64:
|
2010-07-21 23:53:58 +00:00
|
|
|
RRC = ARM::DPRRegisterClass;
|
|
|
|
Cost = 8;
|
2010-07-21 06:09:07 +00:00
|
|
|
break;
|
2010-07-19 22:15:08 +00:00
|
|
|
}
|
2010-07-21 06:09:07 +00:00
|
|
|
return std::make_pair(RRC, Cost);
|
2010-07-19 22:15:08 +00:00
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
const char *ARMTargetLowering::getTargetNodeName(unsigned Opcode) const {
|
|
|
|
switch (Opcode) {
|
|
|
|
default: return 0;
|
|
|
|
case ARMISD::Wrapper: return "ARMISD::Wrapper";
|
2011-01-21 18:55:51 +00:00
|
|
|
case ARMISD::WrapperDYN: return "ARMISD::WrapperDYN";
|
2011-01-17 08:03:18 +00:00
|
|
|
case ARMISD::WrapperPIC: return "ARMISD::WrapperPIC";
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::WrapperJT: return "ARMISD::WrapperJT";
|
|
|
|
case ARMISD::CALL: return "ARMISD::CALL";
|
2007-06-19 21:05:09 +00:00
|
|
|
case ARMISD::CALL_PRED: return "ARMISD::CALL_PRED";
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::CALL_NOLINK: return "ARMISD::CALL_NOLINK";
|
|
|
|
case ARMISD::tCALL: return "ARMISD::tCALL";
|
|
|
|
case ARMISD::BRCOND: return "ARMISD::BRCOND";
|
|
|
|
case ARMISD::BR_JT: return "ARMISD::BR_JT";
|
2009-07-29 02:18:14 +00:00
|
|
|
case ARMISD::BR2_JT: return "ARMISD::BR2_JT";
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::RET_FLAG: return "ARMISD::RET_FLAG";
|
|
|
|
case ARMISD::PIC_ADD: return "ARMISD::PIC_ADD";
|
|
|
|
case ARMISD::CMP: return "ARMISD::CMP";
|
2009-06-29 15:33:01 +00:00
|
|
|
case ARMISD::CMPZ: return "ARMISD::CMPZ";
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::CMPFP: return "ARMISD::CMPFP";
|
|
|
|
case ARMISD::CMPFPw0: return "ARMISD::CMPFPw0";
|
2010-07-13 19:27:42 +00:00
|
|
|
case ARMISD::BCC_i64: return "ARMISD::BCC_i64";
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::FMSTAT: return "ARMISD::FMSTAT";
|
|
|
|
case ARMISD::CMOV: return "ARMISD::CMOV";
|
|
|
|
case ARMISD::CNEG: return "ARMISD::CNEG";
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-01-18 19:58:49 +00:00
|
|
|
case ARMISD::RBIT: return "ARMISD::RBIT";
|
|
|
|
|
2010-03-19 22:51:32 +00:00
|
|
|
case ARMISD::FTOSI: return "ARMISD::FTOSI";
|
|
|
|
case ARMISD::FTOUI: return "ARMISD::FTOUI";
|
|
|
|
case ARMISD::SITOF: return "ARMISD::SITOF";
|
|
|
|
case ARMISD::UITOF: return "ARMISD::UITOF";
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
case ARMISD::SRL_FLAG: return "ARMISD::SRL_FLAG";
|
|
|
|
case ARMISD::SRA_FLAG: return "ARMISD::SRA_FLAG";
|
|
|
|
case ARMISD::RRX: return "ARMISD::RRX";
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-09-22 22:09:21 +00:00
|
|
|
case ARMISD::VMOVRRD: return "ARMISD::VMOVRRD";
|
|
|
|
case ARMISD::VMOVDRR: return "ARMISD::VMOVDRR";
|
2007-04-27 13:54:47 +00:00
|
|
|
|
2009-10-28 06:55:03 +00:00
|
|
|
case ARMISD::EH_SJLJ_SETJMP: return "ARMISD::EH_SJLJ_SETJMP";
|
|
|
|
case ARMISD::EH_SJLJ_LONGJMP:return "ARMISD::EH_SJLJ_LONGJMP";
|
2010-10-19 23:27:08 +00:00
|
|
|
case ARMISD::EH_SJLJ_DISPATCHSETUP:return "ARMISD::EH_SJLJ_DISPATCHSETUP";
|
2009-10-28 06:55:03 +00:00
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
case ARMISD::TC_RETURN: return "ARMISD::TC_RETURN";
|
2010-09-08 03:54:02 +00:00
|
|
|
|
2007-04-27 13:54:47 +00:00
|
|
|
case ARMISD::THREAD_POINTER:return "ARMISD::THREAD_POINTER";
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-08-07 00:34:42 +00:00
|
|
|
case ARMISD::DYN_ALLOC: return "ARMISD::DYN_ALLOC";
|
|
|
|
|
2009-12-10 00:11:09 +00:00
|
|
|
case ARMISD::MEMBARRIER: return "ARMISD::MEMBARRIER";
|
2010-10-30 00:54:37 +00:00
|
|
|
case ARMISD::MEMBARRIER_MCR: return "ARMISD::MEMBARRIER_MCR";
|
2009-12-10 00:11:09 +00:00
|
|
|
|
2010-11-03 06:34:55 +00:00
|
|
|
case ARMISD::PRELOAD: return "ARMISD::PRELOAD";
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
case ARMISD::VCEQ: return "ARMISD::VCEQ";
|
2010-12-18 00:04:26 +00:00
|
|
|
case ARMISD::VCEQZ: return "ARMISD::VCEQZ";
|
2009-06-22 23:27:02 +00:00
|
|
|
case ARMISD::VCGE: return "ARMISD::VCGE";
|
2010-12-18 00:04:26 +00:00
|
|
|
case ARMISD::VCGEZ: return "ARMISD::VCGEZ";
|
|
|
|
case ARMISD::VCLEZ: return "ARMISD::VCLEZ";
|
2009-06-22 23:27:02 +00:00
|
|
|
case ARMISD::VCGEU: return "ARMISD::VCGEU";
|
|
|
|
case ARMISD::VCGT: return "ARMISD::VCGT";
|
2010-12-18 00:04:26 +00:00
|
|
|
case ARMISD::VCGTZ: return "ARMISD::VCGTZ";
|
|
|
|
case ARMISD::VCLTZ: return "ARMISD::VCLTZ";
|
2009-06-22 23:27:02 +00:00
|
|
|
case ARMISD::VCGTU: return "ARMISD::VCGTU";
|
|
|
|
case ARMISD::VTST: return "ARMISD::VTST";
|
|
|
|
|
|
|
|
case ARMISD::VSHL: return "ARMISD::VSHL";
|
|
|
|
case ARMISD::VSHRs: return "ARMISD::VSHRs";
|
|
|
|
case ARMISD::VSHRu: return "ARMISD::VSHRu";
|
|
|
|
case ARMISD::VSHLLs: return "ARMISD::VSHLLs";
|
|
|
|
case ARMISD::VSHLLu: return "ARMISD::VSHLLu";
|
|
|
|
case ARMISD::VSHLLi: return "ARMISD::VSHLLi";
|
|
|
|
case ARMISD::VSHRN: return "ARMISD::VSHRN";
|
|
|
|
case ARMISD::VRSHRs: return "ARMISD::VRSHRs";
|
|
|
|
case ARMISD::VRSHRu: return "ARMISD::VRSHRu";
|
|
|
|
case ARMISD::VRSHRN: return "ARMISD::VRSHRN";
|
|
|
|
case ARMISD::VQSHLs: return "ARMISD::VQSHLs";
|
|
|
|
case ARMISD::VQSHLu: return "ARMISD::VQSHLu";
|
|
|
|
case ARMISD::VQSHLsu: return "ARMISD::VQSHLsu";
|
|
|
|
case ARMISD::VQSHRNs: return "ARMISD::VQSHRNs";
|
|
|
|
case ARMISD::VQSHRNu: return "ARMISD::VQSHRNu";
|
|
|
|
case ARMISD::VQSHRNsu: return "ARMISD::VQSHRNsu";
|
|
|
|
case ARMISD::VQRSHRNs: return "ARMISD::VQRSHRNs";
|
|
|
|
case ARMISD::VQRSHRNu: return "ARMISD::VQRSHRNu";
|
|
|
|
case ARMISD::VQRSHRNsu: return "ARMISD::VQRSHRNsu";
|
|
|
|
case ARMISD::VGETLANEu: return "ARMISD::VGETLANEu";
|
|
|
|
case ARMISD::VGETLANEs: return "ARMISD::VGETLANEs";
|
2010-07-13 21:16:48 +00:00
|
|
|
case ARMISD::VMOVIMM: return "ARMISD::VMOVIMM";
|
2010-07-14 06:31:50 +00:00
|
|
|
case ARMISD::VMVNIMM: return "ARMISD::VMVNIMM";
|
2009-08-14 05:13:08 +00:00
|
|
|
case ARMISD::VDUP: return "ARMISD::VDUP";
|
2009-08-14 05:08:32 +00:00
|
|
|
case ARMISD::VDUPLANE: return "ARMISD::VDUPLANE";
|
2009-08-19 17:03:43 +00:00
|
|
|
case ARMISD::VEXT: return "ARMISD::VEXT";
|
2009-08-12 22:31:50 +00:00
|
|
|
case ARMISD::VREV64: return "ARMISD::VREV64";
|
|
|
|
case ARMISD::VREV32: return "ARMISD::VREV32";
|
|
|
|
case ARMISD::VREV16: return "ARMISD::VREV16";
|
2009-08-21 12:41:42 +00:00
|
|
|
case ARMISD::VZIP: return "ARMISD::VZIP";
|
|
|
|
case ARMISD::VUZP: return "ARMISD::VUZP";
|
|
|
|
case ARMISD::VTRN: return "ARMISD::VTRN";
|
2010-09-01 23:50:19 +00:00
|
|
|
case ARMISD::VMULLs: return "ARMISD::VMULLs";
|
|
|
|
case ARMISD::VMULLu: return "ARMISD::VMULLu";
|
2010-06-04 00:04:02 +00:00
|
|
|
case ARMISD::BUILD_VECTOR: return "ARMISD::BUILD_VECTOR";
|
2010-02-18 06:05:53 +00:00
|
|
|
case ARMISD::FMAX: return "ARMISD::FMAX";
|
|
|
|
case ARMISD::FMIN: return "ARMISD::FMIN";
|
2010-07-17 01:50:57 +00:00
|
|
|
case ARMISD::BFI: return "ARMISD::BFI";
|
2010-11-28 06:51:11 +00:00
|
|
|
case ARMISD::VORRIMM: return "ARMISD::VORRIMM";
|
|
|
|
case ARMISD::VBICIMM: return "ARMISD::VBICIMM";
|
2010-11-28 06:51:26 +00:00
|
|
|
case ARMISD::VLD2DUP: return "ARMISD::VLD2DUP";
|
|
|
|
case ARMISD::VLD3DUP: return "ARMISD::VLD3DUP";
|
|
|
|
case ARMISD::VLD4DUP: return "ARMISD::VLD4DUP";
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-05-15 02:18:07 +00:00
|
|
|
/// getRegClassFor - Return the register class that should be used for the
|
|
|
|
/// specified value type.
|
|
|
|
TargetRegisterClass *ARMTargetLowering::getRegClassFor(EVT VT) const {
|
|
|
|
// Map v4i64 to QQ registers but do not make the type legal. Similarly map
|
|
|
|
// v8i64 to QQQQ registers. v4i64 and v8i64 are only used for REG_SEQUENCE to
|
|
|
|
// load / store 4 to 8 consecutive D registers.
|
2010-05-15 02:20:21 +00:00
|
|
|
if (Subtarget->hasNEON()) {
|
|
|
|
if (VT == MVT::v4i64)
|
|
|
|
return ARM::QQPRRegisterClass;
|
|
|
|
else if (VT == MVT::v8i64)
|
|
|
|
return ARM::QQQQPRRegisterClass;
|
|
|
|
}
|
2010-05-15 02:18:07 +00:00
|
|
|
return TargetLowering::getRegClassFor(VT);
|
|
|
|
}
|
|
|
|
|
2010-07-21 22:26:11 +00:00
|
|
|
// Create a fast isel object.
|
|
|
|
FastISel *
|
|
|
|
ARMTargetLowering::createFastISel(FunctionLoweringInfo &funcInfo) const {
|
|
|
|
return ARM::createFastISel(funcInfo);
|
|
|
|
}
|
|
|
|
|
2009-07-01 18:50:55 +00:00
|
|
|
/// getFunctionAlignment - Return the Log2 alignment of this function.
|
2009-06-30 22:38:32 +00:00
|
|
|
unsigned ARMTargetLowering::getFunctionAlignment(const Function *F) const {
|
2010-07-01 22:26:26 +00:00
|
|
|
return getTargetMachine().getSubtarget<ARMSubtarget>().isThumb() ? 1 : 2;
|
2009-06-30 22:38:32 +00:00
|
|
|
}
|
|
|
|
|
2010-07-24 21:52:08 +00:00
|
|
|
/// getMaximalGlobalOffset - Returns the maximal possible offset which can
|
|
|
|
/// be used for loads / stores from the global.
|
|
|
|
unsigned ARMTargetLowering::getMaximalGlobalOffset() const {
|
|
|
|
return (Subtarget->isThumb1Only() ? 127 : 4095);
|
|
|
|
}
|
|
|
|
|
2010-05-20 23:26:43 +00:00
|
|
|
Sched::Preference ARMTargetLowering::getSchedulingPreference(SDNode *N) const {
|
2010-05-28 23:25:23 +00:00
|
|
|
unsigned NumVals = N->getNumValues();
|
|
|
|
if (!NumVals)
|
|
|
|
return Sched::RegPressure;
|
|
|
|
|
|
|
|
for (unsigned i = 0; i != NumVals; ++i) {
|
2010-05-20 23:26:43 +00:00
|
|
|
EVT VT = N->getValueType(i);
|
2010-12-21 02:38:05 +00:00
|
|
|
if (VT == MVT::Glue || VT == MVT::Other)
|
2010-10-29 18:07:31 +00:00
|
|
|
continue;
|
2010-05-20 23:26:43 +00:00
|
|
|
if (VT.isFloatingPoint() || VT.isVector())
|
|
|
|
return Sched::Latency;
|
|
|
|
}
|
2010-05-28 23:25:23 +00:00
|
|
|
|
|
|
|
if (!N->isMachineOpcode())
|
|
|
|
return Sched::RegPressure;
|
|
|
|
|
|
|
|
// Load are scheduled for latency even if there instruction itinerary
|
|
|
|
// is not available.
|
|
|
|
const TargetInstrInfo *TII = getTargetMachine().getInstrInfo();
|
|
|
|
const TargetInstrDesc &TID = TII->get(N->getMachineOpcode());
|
|
|
|
|
2010-10-29 18:07:31 +00:00
|
|
|
if (TID.getNumDefs() == 0)
|
|
|
|
return Sched::RegPressure;
|
|
|
|
if (!Itins->isEmpty() &&
|
|
|
|
Itins->getOperandCycle(TID.getSchedClass(), 0) > 2)
|
2010-05-28 23:25:23 +00:00
|
|
|
return Sched::Latency;
|
2010-10-29 18:07:31 +00:00
|
|
|
|
2010-05-20 23:26:43 +00:00
|
|
|
return Sched::RegPressure;
|
|
|
|
}
|
|
|
|
|
2011-01-10 12:39:04 +00:00
|
|
|
// FIXME: Move to RegInfo
|
2010-07-23 22:39:59 +00:00
|
|
|
unsigned
|
|
|
|
ARMTargetLowering::getRegPressureLimit(const TargetRegisterClass *RC,
|
|
|
|
MachineFunction &MF) const {
|
2011-01-10 12:39:04 +00:00
|
|
|
const TargetFrameLowering *TFI = MF.getTarget().getFrameLowering();
|
2010-11-18 21:19:35 +00:00
|
|
|
|
2010-07-23 22:39:59 +00:00
|
|
|
switch (RC->getID()) {
|
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
case ARM::tGPRRegClassID:
|
2010-11-18 21:19:35 +00:00
|
|
|
return TFI->hasFP(MF) ? 4 : 5;
|
2010-08-10 19:30:19 +00:00
|
|
|
case ARM::GPRRegClassID: {
|
2010-11-18 21:19:35 +00:00
|
|
|
unsigned FP = TFI->hasFP(MF) ? 1 : 0;
|
2010-08-10 19:30:19 +00:00
|
|
|
return 10 - FP - (Subtarget->isR9Reserved() ? 1 : 0);
|
|
|
|
}
|
2010-07-23 22:39:59 +00:00
|
|
|
case ARM::SPRRegClassID: // Currently not used as 'rep' register class.
|
|
|
|
case ARM::DPRRegClassID:
|
|
|
|
return 32 - 10;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Lowering Code
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// IntCCToARMCC - Convert a DAG integer condition code to an ARM CC
|
|
|
|
static ARMCC::CondCodes IntCCToARMCC(ISD::CondCode CC) {
|
|
|
|
switch (CC) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown condition code!");
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::SETNE: return ARMCC::NE;
|
|
|
|
case ISD::SETEQ: return ARMCC::EQ;
|
|
|
|
case ISD::SETGT: return ARMCC::GT;
|
|
|
|
case ISD::SETGE: return ARMCC::GE;
|
|
|
|
case ISD::SETLT: return ARMCC::LT;
|
|
|
|
case ISD::SETLE: return ARMCC::LE;
|
|
|
|
case ISD::SETUGT: return ARMCC::HI;
|
|
|
|
case ISD::SETUGE: return ARMCC::HS;
|
|
|
|
case ISD::SETULT: return ARMCC::LO;
|
|
|
|
case ISD::SETULE: return ARMCC::LS;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-09-09 23:14:54 +00:00
|
|
|
/// FPCCToARMCC - Convert a DAG fp condition code to an ARM CC.
|
|
|
|
static void FPCCToARMCC(ISD::CondCode CC, ARMCC::CondCodes &CondCode,
|
2007-01-19 07:51:42 +00:00
|
|
|
ARMCC::CondCodes &CondCode2) {
|
|
|
|
CondCode2 = ARMCC::AL;
|
|
|
|
switch (CC) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown FP condition!");
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::SETEQ:
|
|
|
|
case ISD::SETOEQ: CondCode = ARMCC::EQ; break;
|
|
|
|
case ISD::SETGT:
|
|
|
|
case ISD::SETOGT: CondCode = ARMCC::GT; break;
|
|
|
|
case ISD::SETGE:
|
|
|
|
case ISD::SETOGE: CondCode = ARMCC::GE; break;
|
|
|
|
case ISD::SETOLT: CondCode = ARMCC::MI; break;
|
2009-09-09 23:14:54 +00:00
|
|
|
case ISD::SETOLE: CondCode = ARMCC::LS; break;
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::SETONE: CondCode = ARMCC::MI; CondCode2 = ARMCC::GT; break;
|
|
|
|
case ISD::SETO: CondCode = ARMCC::VC; break;
|
|
|
|
case ISD::SETUO: CondCode = ARMCC::VS; break;
|
|
|
|
case ISD::SETUEQ: CondCode = ARMCC::EQ; CondCode2 = ARMCC::VS; break;
|
|
|
|
case ISD::SETUGT: CondCode = ARMCC::HI; break;
|
|
|
|
case ISD::SETUGE: CondCode = ARMCC::PL; break;
|
|
|
|
case ISD::SETLT:
|
|
|
|
case ISD::SETULT: CondCode = ARMCC::LT; break;
|
|
|
|
case ISD::SETLE:
|
|
|
|
case ISD::SETULE: CondCode = ARMCC::LE; break;
|
|
|
|
case ISD::SETNE:
|
|
|
|
case ISD::SETUNE: CondCode = ARMCC::NE; break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Calling Convention Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "ARMGenCallingConv.inc"
|
|
|
|
|
2009-06-16 18:50:49 +00:00
|
|
|
/// CCAssignFnForNode - Selects the correct CCAssignFn for a the
|
|
|
|
/// given CallingConvention value.
|
2009-09-02 08:44:58 +00:00
|
|
|
CCAssignFn *ARMTargetLowering::CCAssignFnForNode(CallingConv::ID CC,
|
2009-08-05 19:04:42 +00:00
|
|
|
bool Return,
|
|
|
|
bool isVarArg) const {
|
2009-06-16 18:50:49 +00:00
|
|
|
switch (CC) {
|
|
|
|
default:
|
2009-08-05 19:04:42 +00:00
|
|
|
llvm_unreachable("Unsupported calling convention");
|
2009-06-16 18:50:49 +00:00
|
|
|
case CallingConv::Fast:
|
2010-10-23 02:19:37 +00:00
|
|
|
if (Subtarget->hasVFP2() && !isVarArg) {
|
2010-10-22 18:23:05 +00:00
|
|
|
if (!Subtarget->isAAPCS_ABI())
|
|
|
|
return (Return ? RetFastCC_ARM_APCS : FastCC_ARM_APCS);
|
|
|
|
// For AAPCS ABI targets, just use VFP variant of the calling convention.
|
|
|
|
return (Return ? RetCC_ARM_AAPCS_VFP : CC_ARM_AAPCS_VFP);
|
|
|
|
}
|
|
|
|
// Fallthrough
|
|
|
|
case CallingConv::C: {
|
2009-08-05 19:04:42 +00:00
|
|
|
// Use target triple & subtarget features to do actual dispatch.
|
2010-10-22 18:23:05 +00:00
|
|
|
if (!Subtarget->isAAPCS_ABI())
|
|
|
|
return (Return ? RetCC_ARM_APCS : CC_ARM_APCS);
|
|
|
|
else if (Subtarget->hasVFP2() &&
|
|
|
|
FloatABIType == FloatABI::Hard && !isVarArg)
|
|
|
|
return (Return ? RetCC_ARM_AAPCS_VFP : CC_ARM_AAPCS_VFP);
|
|
|
|
return (Return ? RetCC_ARM_AAPCS : CC_ARM_AAPCS);
|
|
|
|
}
|
2009-06-16 18:50:49 +00:00
|
|
|
case CallingConv::ARM_AAPCS_VFP:
|
2010-10-22 18:23:05 +00:00
|
|
|
return (Return ? RetCC_ARM_AAPCS_VFP : CC_ARM_AAPCS_VFP);
|
2009-06-16 18:50:49 +00:00
|
|
|
case CallingConv::ARM_AAPCS:
|
2010-10-22 18:23:05 +00:00
|
|
|
return (Return ? RetCC_ARM_AAPCS : CC_ARM_AAPCS);
|
2009-06-16 18:50:49 +00:00
|
|
|
case CallingConv::ARM_APCS:
|
2010-10-22 18:23:05 +00:00
|
|
|
return (Return ? RetCC_ARM_APCS : CC_ARM_APCS);
|
2009-06-16 18:50:49 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
/// LowerCallResult - Lower the result values of a call into the
|
|
|
|
/// appropriate copies out of appropriate physical registers.
|
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::LowerCallResult(SDValue Chain, SDValue InFlag,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals) const {
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// Assign locations to each value returned by this call.
|
|
|
|
SmallVector<CCValAssign, 16> RVLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(),
|
2009-07-22 00:24:57 +00:00
|
|
|
RVLocs, *DAG.getContext());
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCInfo.AnalyzeCallResult(Ins,
|
2009-08-05 19:04:42 +00:00
|
|
|
CCAssignFnForNode(CallConv, /* Return*/ true,
|
|
|
|
isVarArg));
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// Copy all of the result registers out of their specified physreg.
|
|
|
|
for (unsigned i = 0; i != RVLocs.size(); ++i) {
|
|
|
|
CCValAssign VA = RVLocs[i];
|
|
|
|
|
2009-04-25 00:33:20 +00:00
|
|
|
SDValue Val;
|
2009-04-17 19:07:39 +00:00
|
|
|
if (VA.needsCustom()) {
|
2009-06-22 23:27:02 +00:00
|
|
|
// Handle f64 or half of a v2f64.
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Lo = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(), MVT::i32,
|
2009-04-17 19:07:39 +00:00
|
|
|
InFlag);
|
2009-04-24 17:00:36 +00:00
|
|
|
Chain = Lo.getValue(1);
|
|
|
|
InFlag = Lo.getValue(2);
|
2009-04-17 19:07:39 +00:00
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Hi = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(), MVT::i32,
|
2009-04-24 17:00:36 +00:00
|
|
|
InFlag);
|
|
|
|
Chain = Hi.getValue(1);
|
|
|
|
InFlag = Hi.getValue(2);
|
2009-11-09 00:11:35 +00:00
|
|
|
Val = DAG.getNode(ARMISD::VMOVDRR, dl, MVT::f64, Lo, Hi);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VA.getLocVT() == MVT::v2f64) {
|
|
|
|
SDValue Vec = DAG.getNode(ISD::UNDEF, dl, MVT::v2f64);
|
|
|
|
Vec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64, Vec, Val,
|
|
|
|
DAG.getConstant(0, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
2009-08-11 20:47:22 +00:00
|
|
|
Lo = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(), MVT::i32, InFlag);
|
2009-06-22 23:27:02 +00:00
|
|
|
Chain = Lo.getValue(1);
|
|
|
|
InFlag = Lo.getValue(2);
|
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
2009-08-11 20:47:22 +00:00
|
|
|
Hi = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(), MVT::i32, InFlag);
|
2009-06-22 23:27:02 +00:00
|
|
|
Chain = Hi.getValue(1);
|
|
|
|
InFlag = Hi.getValue(2);
|
2009-11-09 00:11:35 +00:00
|
|
|
Val = DAG.getNode(ARMISD::VMOVDRR, dl, MVT::f64, Lo, Hi);
|
2009-08-11 20:47:22 +00:00
|
|
|
Val = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64, Vec, Val,
|
|
|
|
DAG.getConstant(1, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
} else {
|
2009-04-25 00:33:20 +00:00
|
|
|
Val = DAG.getCopyFromReg(Chain, dl, VA.getLocReg(), VA.getLocVT(),
|
|
|
|
InFlag);
|
2009-04-24 17:00:36 +00:00
|
|
|
Chain = Val.getValue(1);
|
|
|
|
InFlag = Val.getValue(2);
|
2009-04-25 00:33:20 +00:00
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
|
2009-04-25 00:33:20 +00:00
|
|
|
switch (VA.getLocInfo()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown loc info!");
|
2009-04-25 00:33:20 +00:00
|
|
|
case CCValAssign::Full: break;
|
|
|
|
case CCValAssign::BCvt:
|
2010-11-23 03:31:01 +00:00
|
|
|
Val = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), Val);
|
2009-04-25 00:33:20 +00:00
|
|
|
break;
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
2009-04-25 00:33:20 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
InVals.push_back(Val);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return Chain;
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// CreateCopyOfByValArgument - Make a copy of an aggregate at address specified
|
|
|
|
/// by "Src" to address "Dst" of size "Size". Alignment information is
|
2009-04-17 20:35:10 +00:00
|
|
|
/// specified by the specific parameter attribute. The copy will be passed as
|
2009-04-17 19:07:39 +00:00
|
|
|
/// a byval function parameter.
|
|
|
|
/// Sometimes what we are copying is the end of a larger object, the part that
|
|
|
|
/// does not fit in registers.
|
|
|
|
static SDValue
|
|
|
|
CreateCopyOfByValArgument(SDValue Src, SDValue Dst, SDValue Chain,
|
|
|
|
ISD::ArgFlagsTy Flags, SelectionDAG &DAG,
|
|
|
|
DebugLoc dl) {
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue SizeNode = DAG.getConstant(Flags.getByValSize(), MVT::i32);
|
2009-04-17 19:07:39 +00:00
|
|
|
return DAG.getMemcpy(Chain, dl, Dst, Src, SizeNode, Flags.getByValAlign(),
|
Reapply address space patch after fixing an issue in MemCopyOptimizer.
Added support for address spaces and added a isVolatile field to memcpy, memmove, and memset,
e.g., llvm.memcpy.i32(i8*, i8*, i32, i32) -> llvm.memcpy.p0i8.p0i8.i32(i8*, i8*, i32, i32, i1)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@100304 91177308-0d34-0410-b5e6-96231b3b80d8
2010-04-04 03:10:48 +00:00
|
|
|
/*isVolatile=*/false, /*AlwaysInline=*/false,
|
2010-09-21 05:40:29 +00:00
|
|
|
MachinePointerInfo(0), MachinePointerInfo(0));
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
/// LowerMemOpCallTo - Store the argument to the stack.
|
2009-04-17 19:07:39 +00:00
|
|
|
SDValue
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
ARMTargetLowering::LowerMemOpCallTo(SDValue Chain,
|
|
|
|
SDValue StackPtr, SDValue Arg,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
|
|
|
const CCValAssign &VA,
|
2010-04-17 15:26:15 +00:00
|
|
|
ISD::ArgFlagsTy Flags) const {
|
2009-04-17 19:07:39 +00:00
|
|
|
unsigned LocMemOffset = VA.getLocMemOffset();
|
|
|
|
SDValue PtrOff = DAG.getIntPtrConstant(LocMemOffset);
|
|
|
|
PtrOff = DAG.getNode(ISD::ADD, dl, getPointerTy(), StackPtr, PtrOff);
|
2010-09-21 18:51:21 +00:00
|
|
|
if (Flags.isByVal())
|
2009-04-17 19:07:39 +00:00
|
|
|
return CreateCopyOfByValArgument(Arg, PtrOff, Chain, Flags, DAG, dl);
|
2010-09-21 18:51:21 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
return DAG.getStore(Chain, dl, Arg, PtrOff,
|
2010-09-21 18:51:21 +00:00
|
|
|
MachinePointerInfo::getStack(LocMemOffset),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
void ARMTargetLowering::PassF64ArgInRegs(DebugLoc dl, SelectionDAG &DAG,
|
2009-06-22 23:27:02 +00:00
|
|
|
SDValue Chain, SDValue &Arg,
|
|
|
|
RegsToPassVector &RegsToPass,
|
|
|
|
CCValAssign &VA, CCValAssign &NextVA,
|
|
|
|
SDValue &StackPtr,
|
|
|
|
SmallVector<SDValue, 8> &MemOpChains,
|
2010-04-17 15:26:15 +00:00
|
|
|
ISD::ArgFlagsTy Flags) const {
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-11-09 00:11:35 +00:00
|
|
|
SDValue fmrrd = DAG.getNode(ARMISD::VMOVRRD, dl,
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getVTList(MVT::i32, MVT::i32), Arg);
|
2009-06-22 23:27:02 +00:00
|
|
|
RegsToPass.push_back(std::make_pair(VA.getLocReg(), fmrrd));
|
|
|
|
|
|
|
|
if (NextVA.isRegLoc())
|
|
|
|
RegsToPass.push_back(std::make_pair(NextVA.getLocReg(), fmrrd.getValue(1)));
|
|
|
|
else {
|
|
|
|
assert(NextVA.isMemLoc());
|
|
|
|
if (StackPtr.getNode() == 0)
|
|
|
|
StackPtr = DAG.getCopyFromReg(Chain, dl, ARM::SP, getPointerTy());
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, fmrrd.getValue(1),
|
|
|
|
dl, DAG, NextVA,
|
|
|
|
Flags));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
/// LowerCall - Lowering a call into a callseq_start <-
|
2007-02-03 08:53:01 +00:00
|
|
|
/// ARMISD:CALL <- callseq_end chain. Also add input and output parameter
|
|
|
|
/// nodes.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
2010-02-02 23:55:14 +00:00
|
|
|
ARMTargetLowering::LowerCall(SDValue Chain, SDValue Callee,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
2010-01-27 00:07:07 +00:00
|
|
|
bool &isTailCall,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2010-07-07 15:54:55 +00:00
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals) const {
|
2010-06-03 21:09:53 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
bool IsStructRet = (Outs.empty()) ? false : Outs[0].Flags.isSRet();
|
|
|
|
bool IsSibCall = false;
|
2010-08-13 22:43:33 +00:00
|
|
|
// Temporarily disable tail calls so things don't break.
|
|
|
|
if (!EnableARMTailCalls)
|
|
|
|
isTailCall = false;
|
2010-06-03 21:09:53 +00:00
|
|
|
if (isTailCall) {
|
|
|
|
// Check if it's really possible to do a tail call.
|
|
|
|
isTailCall = IsEligibleForTailCallOptimization(Callee, CallConv,
|
|
|
|
isVarArg, IsStructRet, MF.getFunction()->hasStructRetAttr(),
|
2010-07-07 15:54:55 +00:00
|
|
|
Outs, OutVals, Ins, DAG);
|
2010-06-03 21:09:53 +00:00
|
|
|
// We don't support GuaranteedTailCallOpt for ARM, only automatically
|
|
|
|
// detected sibcalls.
|
|
|
|
if (isTailCall) {
|
|
|
|
++NumTailCalls;
|
|
|
|
IsSibCall = true;
|
|
|
|
}
|
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// Analyze operands of the call, assigning locations to each operand.
|
|
|
|
SmallVector<CCValAssign, 16> ArgLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(), ArgLocs,
|
|
|
|
*DAG.getContext());
|
|
|
|
CCInfo.AnalyzeCallOperands(Outs,
|
2009-08-05 19:04:42 +00:00
|
|
|
CCAssignFnForNode(CallConv, /* Return*/ false,
|
|
|
|
isVarArg));
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// Get a count of how many bytes are to be pushed on the stack.
|
|
|
|
unsigned NumBytes = CCInfo.getNextStackOffset();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
// For tail calls, memory operands are available in our caller's stack.
|
|
|
|
if (IsSibCall)
|
|
|
|
NumBytes = 0;
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// Adjust the stack pointer for the new arguments...
|
|
|
|
// These operations are automatically eliminated by the prolog/epilog pass
|
2010-06-03 21:09:53 +00:00
|
|
|
if (!IsSibCall)
|
|
|
|
Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(NumBytes, true));
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-02-24 01:43:03 +00:00
|
|
|
SDValue StackPtr = DAG.getCopyFromReg(Chain, dl, ARM::SP, getPointerTy());
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
RegsToPassVector RegsToPass;
|
2009-04-17 19:07:39 +00:00
|
|
|
SmallVector<SDValue, 8> MemOpChains;
|
|
|
|
|
|
|
|
// Walk the register/memloc assignments, inserting copies/loads. In the case
|
2009-04-17 20:35:10 +00:00
|
|
|
// of tail call optimization, arguments are handled later.
|
2009-04-17 19:07:39 +00:00
|
|
|
for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size();
|
|
|
|
i != e;
|
|
|
|
++i, ++realArgIdx) {
|
|
|
|
CCValAssign &VA = ArgLocs[i];
|
2010-07-07 15:54:55 +00:00
|
|
|
SDValue Arg = OutVals[realArgIdx];
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
ISD::ArgFlagsTy Flags = Outs[realArgIdx].Flags;
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// Promote the value if needed.
|
|
|
|
switch (VA.getLocInfo()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown loc info!");
|
2009-04-17 19:07:39 +00:00
|
|
|
case CCValAssign::Full: break;
|
|
|
|
case CCValAssign::SExt:
|
|
|
|
Arg = DAG.getNode(ISD::SIGN_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
case CCValAssign::ZExt:
|
|
|
|
Arg = DAG.getNode(ISD::ZERO_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
case CCValAssign::AExt:
|
|
|
|
Arg = DAG.getNode(ISD::ANY_EXTEND, dl, VA.getLocVT(), Arg);
|
|
|
|
break;
|
|
|
|
case CCValAssign::BCvt:
|
2010-11-23 03:31:01 +00:00
|
|
|
Arg = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), Arg);
|
2009-04-17 19:07:39 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-08-05 19:04:42 +00:00
|
|
|
// f64 and v2f64 might be passed in i32 pairs and must be split into pieces
|
2009-04-17 19:07:39 +00:00
|
|
|
if (VA.needsCustom()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VA.getLocVT() == MVT::v2f64) {
|
|
|
|
SDValue Op0 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Arg,
|
|
|
|
DAG.getConstant(0, MVT::i32));
|
|
|
|
SDValue Op1 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Arg,
|
|
|
|
DAG.getConstant(1, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
PassF64ArgInRegs(dl, DAG, Chain, Op0, RegsToPass,
|
2009-06-22 23:27:02 +00:00
|
|
|
VA, ArgLocs[++i], StackPtr, MemOpChains, Flags);
|
|
|
|
|
|
|
|
VA = ArgLocs[++i]; // skip ahead to next loc
|
|
|
|
if (VA.isRegLoc()) {
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
PassF64ArgInRegs(dl, DAG, Chain, Op1, RegsToPass,
|
2009-06-22 23:27:02 +00:00
|
|
|
VA, ArgLocs[++i], StackPtr, MemOpChains, Flags);
|
|
|
|
} else {
|
|
|
|
assert(VA.isMemLoc());
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Op1,
|
|
|
|
dl, DAG, VA, Flags));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
} else {
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
PassF64ArgInRegs(dl, DAG, Chain, Arg, RegsToPass, VA, ArgLocs[++i],
|
2009-06-22 23:27:02 +00:00
|
|
|
StackPtr, MemOpChains, Flags);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
} else if (VA.isRegLoc()) {
|
|
|
|
RegsToPass.push_back(std::make_pair(VA.getLocReg(), Arg));
|
2010-06-18 18:13:11 +00:00
|
|
|
} else if (!IsSibCall) {
|
2009-04-17 19:07:39 +00:00
|
|
|
assert(VA.isMemLoc());
|
2007-01-19 07:51:42 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
MemOpChains.push_back(LowerMemOpCallTo(Chain, StackPtr, Arg,
|
|
|
|
dl, DAG, VA, Flags));
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!MemOpChains.empty())
|
2009-08-11 20:47:22 +00:00
|
|
|
Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
|
2007-01-19 07:51:42 +00:00
|
|
|
&MemOpChains[0], MemOpChains.size());
|
|
|
|
|
|
|
|
// Build a sequence of copy-to-reg nodes chained together with token chain
|
|
|
|
// and flag operands which copy the outgoing args into the appropriate regs.
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue InFlag;
|
2010-06-15 22:08:33 +00:00
|
|
|
// Tail call byval lowering might overwrite argument registers so in case of
|
|
|
|
// tail call optimization the copies to registers are lowered later.
|
|
|
|
if (!isTailCall)
|
|
|
|
for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
|
|
|
|
RegsToPass[i].second, InFlag);
|
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
// For tail calls lower the arguments to the 'real' stack slot.
|
|
|
|
if (isTailCall) {
|
|
|
|
// Force all the incoming stack arguments to be loaded from the stack
|
|
|
|
// before any new outgoing arguments are stored to the stack, because the
|
|
|
|
// outgoing stack slots may alias the incoming argument stack slots, and
|
|
|
|
// the alias isn't otherwise explicit. This is slightly more conservative
|
|
|
|
// than necessary, because it means that each store effectively depends
|
|
|
|
// on every argument instead of just those arguments it would clobber.
|
|
|
|
|
|
|
|
// Do not flag preceeding copytoreg stuff together with the following stuff.
|
|
|
|
InFlag = SDValue();
|
|
|
|
for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, RegsToPass[i].first,
|
|
|
|
RegsToPass[i].second, InFlag);
|
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
}
|
|
|
|
InFlag =SDValue();
|
|
|
|
}
|
|
|
|
|
2008-09-16 21:48:12 +00:00
|
|
|
// If the callee is a GlobalAddress/ExternalSymbol node (quite common, every
|
|
|
|
// direct call is) turn it into a TargetGlobalAddress/TargetExternalSymbol
|
|
|
|
// node so that legalize doesn't hack it.
|
2007-01-19 07:51:42 +00:00
|
|
|
bool isDirect = false;
|
|
|
|
bool isARMFunc = false;
|
2007-06-19 21:05:09 +00:00
|
|
|
bool isLocalARMFunc = false;
|
2009-11-06 22:24:13 +00:00
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2010-04-14 22:28:31 +00:00
|
|
|
|
|
|
|
if (EnableARMLongCalls) {
|
|
|
|
assert (getTargetMachine().getRelocationModel() == Reloc::Static
|
|
|
|
&& "long-calls with non-static relocation model!");
|
|
|
|
// Handle a global address or an external symbol. If it's not one of
|
|
|
|
// those, the target's already in a register, so we don't need to do
|
|
|
|
// anything extra.
|
|
|
|
if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
|
2010-04-15 03:11:28 +00:00
|
|
|
const GlobalValue *GV = G->getGlobal();
|
2010-04-14 22:28:31 +00:00
|
|
|
// Create a constant pool entry for the callee address
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2010-04-14 22:28:31 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(GV,
|
|
|
|
ARMPCLabelIndex,
|
|
|
|
ARMCP::CPValue, 0);
|
|
|
|
// Get the address of the callee into a register
|
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, getPointerTy(), 4);
|
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
|
|
|
Callee = DAG.getLoad(getPointerTy(), dl,
|
|
|
|
DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-04-14 22:28:31 +00:00
|
|
|
false, false, 0);
|
|
|
|
} else if (ExternalSymbolSDNode *S=dyn_cast<ExternalSymbolSDNode>(Callee)) {
|
|
|
|
const char *Sym = S->getSymbol();
|
|
|
|
|
|
|
|
// Create a constant pool entry for the callee address
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2010-04-14 22:28:31 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(*DAG.getContext(),
|
|
|
|
Sym, ARMPCLabelIndex, 0);
|
|
|
|
// Get the address of the callee into a register
|
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, getPointerTy(), 4);
|
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
|
|
|
Callee = DAG.getLoad(getPointerTy(), dl,
|
|
|
|
DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-04-14 22:28:31 +00:00
|
|
|
false, false, 0);
|
|
|
|
}
|
|
|
|
} else if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Callee)) {
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalValue *GV = G->getGlobal();
|
2007-01-19 07:51:42 +00:00
|
|
|
isDirect = true;
|
2009-07-15 04:12:33 +00:00
|
|
|
bool isExt = GV->isDeclaration() || GV->isWeakForLinker();
|
2007-01-19 19:28:01 +00:00
|
|
|
bool isStub = (isExt && Subtarget->isTargetDarwin()) &&
|
2007-01-19 07:51:42 +00:00
|
|
|
getTargetMachine().getRelocationModel() != Reloc::Static;
|
|
|
|
isARMFunc = !Subtarget->isThumb() || isStub;
|
2007-06-19 21:05:09 +00:00
|
|
|
// ARM call to a local ARM function is predicable.
|
2010-06-16 07:35:02 +00:00
|
|
|
isLocalARMFunc = !Subtarget->isThumb() && (!isExt || !ARMInterworking);
|
2007-01-30 20:37:08 +00:00
|
|
|
// tBX takes a register source operand.
|
2009-07-08 23:10:31 +00:00
|
|
|
if (isARMFunc && Subtarget->isThumb1Only() && !Subtarget->hasV5TOps()) {
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-08-28 23:18:09 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(GV,
|
2009-09-01 01:57:56 +00:00
|
|
|
ARMPCLabelIndex,
|
|
|
|
ARMCP::CPValue, 4);
|
2009-03-13 07:51:59 +00:00
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, getPointerTy(), 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2009-03-20 22:42:55 +00:00
|
|
|
Callee = DAG.getLoad(getPointerTy(), dl,
|
2009-10-31 03:39:36 +00:00
|
|
|
DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-03-20 22:42:55 +00:00
|
|
|
Callee = DAG.getNode(ARMISD::PIC_ADD, dl,
|
2009-02-04 20:06:27 +00:00
|
|
|
getPointerTy(), Callee, PICLabel);
|
2010-09-22 23:27:36 +00:00
|
|
|
} else {
|
|
|
|
// On ELF targets for PIC code, direct calls should go through the PLT
|
|
|
|
unsigned OpFlags = 0;
|
|
|
|
if (Subtarget->isTargetELF() &&
|
|
|
|
getTargetMachine().getRelocationModel() == Reloc::PIC_)
|
|
|
|
OpFlags = ARMII::MO_PLT;
|
|
|
|
Callee = DAG.getTargetGlobalAddress(GV, dl, getPointerTy(), 0, OpFlags);
|
|
|
|
}
|
2008-09-16 21:48:12 +00:00
|
|
|
} else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(Callee)) {
|
2007-01-19 07:51:42 +00:00
|
|
|
isDirect = true;
|
2007-01-19 19:28:01 +00:00
|
|
|
bool isStub = Subtarget->isTargetDarwin() &&
|
2007-01-19 07:51:42 +00:00
|
|
|
getTargetMachine().getRelocationModel() != Reloc::Static;
|
|
|
|
isARMFunc = !Subtarget->isThumb() || isStub;
|
2007-01-30 20:37:08 +00:00
|
|
|
// tBX takes a register source operand.
|
|
|
|
const char *Sym = S->getSymbol();
|
2009-07-08 23:10:31 +00:00
|
|
|
if (isARMFunc && Subtarget->isThumb1Only() && !Subtarget->hasV5TOps()) {
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-08-13 21:58:54 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(*DAG.getContext(),
|
2009-08-28 23:18:09 +00:00
|
|
|
Sym, ARMPCLabelIndex, 4);
|
2009-03-13 07:51:59 +00:00
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, getPointerTy(), 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2009-02-04 20:06:27 +00:00
|
|
|
Callee = DAG.getLoad(getPointerTy(), dl,
|
2009-10-31 03:39:36 +00:00
|
|
|
DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-03-20 22:42:55 +00:00
|
|
|
Callee = DAG.getNode(ARMISD::PIC_ADD, dl,
|
2009-02-04 20:06:27 +00:00
|
|
|
getPointerTy(), Callee, PICLabel);
|
2010-09-22 23:27:36 +00:00
|
|
|
} else {
|
|
|
|
unsigned OpFlags = 0;
|
|
|
|
// On ELF targets for PIC code, direct calls should go through the PLT
|
|
|
|
if (Subtarget->isTargetELF() &&
|
|
|
|
getTargetMachine().getRelocationModel() == Reloc::PIC_)
|
|
|
|
OpFlags = ARMII::MO_PLT;
|
|
|
|
Callee = DAG.getTargetExternalSymbol(Sym, getPointerTy(), OpFlags);
|
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2007-03-20 17:57:23 +00:00
|
|
|
// FIXME: handle tail calls differently.
|
|
|
|
unsigned CallOpc;
|
2009-08-01 00:16:10 +00:00
|
|
|
if (Subtarget->isThumb()) {
|
|
|
|
if ((!isDirect || isARMFunc) && !Subtarget->hasV5TOps())
|
2007-03-20 17:57:23 +00:00
|
|
|
CallOpc = ARMISD::CALL_NOLINK;
|
|
|
|
else
|
|
|
|
CallOpc = isARMFunc ? ARMISD::CALL : ARMISD::tCALL;
|
|
|
|
} else {
|
|
|
|
CallOpc = (isDirect || Subtarget->hasV5TOps())
|
2007-06-19 21:05:09 +00:00
|
|
|
? (isLocalARMFunc ? ARMISD::CALL_PRED : ARMISD::CALL)
|
|
|
|
: ARMISD::CALL_NOLINK;
|
2007-03-20 17:57:23 +00:00
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
std::vector<SDValue> Ops;
|
2007-01-19 07:51:42 +00:00
|
|
|
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()));
|
|
|
|
|
2008-08-28 21:40:38 +00:00
|
|
|
if (InFlag.getNode())
|
2007-01-19 07:51:42 +00:00
|
|
|
Ops.push_back(InFlag);
|
2010-06-03 21:09:53 +00:00
|
|
|
|
2010-12-21 02:38:05 +00:00
|
|
|
SDVTList NodeTys = DAG.getVTList(MVT::Other, MVT::Glue);
|
2010-06-05 00:51:39 +00:00
|
|
|
if (isTailCall)
|
2010-06-03 21:09:53 +00:00
|
|
|
return DAG.getNode(ARMISD::TC_RETURN, dl, NodeTys, &Ops[0], Ops.size());
|
|
|
|
|
2008-07-02 17:40:58 +00:00
|
|
|
// Returns a chain and a flag for retval copy to use.
|
2010-06-03 21:09:53 +00:00
|
|
|
Chain = DAG.getNode(CallOpc, dl, NodeTys, &Ops[0], Ops.size());
|
2007-01-19 07:51:42 +00:00
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
|
2008-10-11 22:08:30 +00:00
|
|
|
Chain = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(NumBytes, true),
|
|
|
|
DAG.getIntPtrConstant(0, true), InFlag);
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
if (!Ins.empty())
|
2007-01-19 07:51:42 +00:00
|
|
|
InFlag = Chain.getValue(1);
|
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
// Handle result values, copying them out of physregs into vregs that we
|
|
|
|
// return.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return LowerCallResult(Chain, InFlag, CallConv, isVarArg, Ins,
|
|
|
|
dl, DAG, InVals);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
/// MatchingStackOffset - Return true if the given stack call argument is
|
|
|
|
/// already available in the same position (relatively) of the caller's
|
|
|
|
/// incoming argument stack.
|
|
|
|
static
|
|
|
|
bool MatchingStackOffset(SDValue Arg, unsigned Offset, ISD::ArgFlagsTy Flags,
|
|
|
|
MachineFrameInfo *MFI, const MachineRegisterInfo *MRI,
|
|
|
|
const ARMInstrInfo *TII) {
|
|
|
|
unsigned Bytes = Arg.getValueType().getSizeInBits() / 8;
|
|
|
|
int FI = INT_MAX;
|
|
|
|
if (Arg.getOpcode() == ISD::CopyFromReg) {
|
|
|
|
unsigned VR = cast<RegisterSDNode>(Arg.getOperand(1))->getReg();
|
2011-01-10 02:58:51 +00:00
|
|
|
if (!TargetRegisterInfo::isVirtualRegister(VR))
|
2010-06-03 21:09:53 +00:00
|
|
|
return false;
|
|
|
|
MachineInstr *Def = MRI->getVRegDef(VR);
|
|
|
|
if (!Def)
|
|
|
|
return false;
|
|
|
|
if (!Flags.isByVal()) {
|
|
|
|
if (!TII->isLoadFromStackSlot(Def, FI))
|
|
|
|
return false;
|
|
|
|
} else {
|
2010-07-08 01:18:23 +00:00
|
|
|
return false;
|
2010-06-03 21:09:53 +00:00
|
|
|
}
|
|
|
|
} else if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Arg)) {
|
|
|
|
if (Flags.isByVal())
|
|
|
|
// ByVal argument is passed in as a pointer but it's now being
|
|
|
|
// dereferenced. e.g.
|
|
|
|
// define @foo(%struct.X* %A) {
|
|
|
|
// tail call @bar(%struct.X* byval %A)
|
|
|
|
// }
|
|
|
|
return false;
|
|
|
|
SDValue Ptr = Ld->getBasePtr();
|
|
|
|
FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(Ptr);
|
|
|
|
if (!FINode)
|
|
|
|
return false;
|
|
|
|
FI = FINode->getIndex();
|
|
|
|
} else
|
|
|
|
return false;
|
|
|
|
|
|
|
|
assert(FI != INT_MAX);
|
|
|
|
if (!MFI->isFixedObjectIndex(FI))
|
|
|
|
return false;
|
|
|
|
return Offset == MFI->getObjectOffset(FI) && Bytes == MFI->getObjectSize(FI);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// IsEligibleForTailCallOptimization - Check whether the call is eligible
|
|
|
|
/// for tail call optimization. Targets which want to do tail call
|
|
|
|
/// optimization should implement this function.
|
|
|
|
bool
|
|
|
|
ARMTargetLowering::IsEligibleForTailCallOptimization(SDValue Callee,
|
|
|
|
CallingConv::ID CalleeCC,
|
|
|
|
bool isVarArg,
|
|
|
|
bool isCalleeStructRet,
|
|
|
|
bool isCallerStructRet,
|
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2010-07-07 15:54:55 +00:00
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
2010-06-03 21:09:53 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg> &Ins,
|
|
|
|
SelectionDAG& DAG) const {
|
|
|
|
const Function *CallerF = DAG.getMachineFunction().getFunction();
|
|
|
|
CallingConv::ID CallerCC = CallerF->getCallingConv();
|
|
|
|
bool CCMatch = CallerCC == CalleeCC;
|
|
|
|
|
|
|
|
// Look for obvious safe cases to perform tail call optimization that do not
|
|
|
|
// require ABI changes. This is what gcc calls sibcall.
|
|
|
|
|
2010-06-16 23:45:49 +00:00
|
|
|
// Do not sibcall optimize vararg calls unless the call site is not passing
|
|
|
|
// any arguments.
|
2010-06-03 21:09:53 +00:00
|
|
|
if (isVarArg && !Outs.empty())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Also avoid sibcall optimization if either caller or callee uses struct
|
|
|
|
// return semantics.
|
|
|
|
if (isCalleeStructRet || isCallerStructRet)
|
|
|
|
return false;
|
|
|
|
|
2010-06-23 18:52:34 +00:00
|
|
|
// FIXME: Completely disable sibcall for Thumb1 since Thumb1RegisterInfo::
|
2010-06-19 01:01:32 +00:00
|
|
|
// emitEpilogue is not ready for them.
|
2010-07-08 01:18:23 +00:00
|
|
|
// Doing this is tricky, since the LDM/POP instruction on Thumb doesn't take
|
|
|
|
// LR. This means if we need to reload LR, it takes an extra instructions,
|
|
|
|
// which outweighs the value of the tail call; but here we don't know yet
|
|
|
|
// whether LR is going to be used. Probably the right approach is to
|
2010-09-08 03:54:02 +00:00
|
|
|
// generate the tail call here and turn it back into CALL/RET in
|
2010-07-08 01:18:23 +00:00
|
|
|
// emitEpilogue if LR is used.
|
|
|
|
|
|
|
|
// Thumb1 PIC calls to external symbols use BX, so they can be tail calls,
|
|
|
|
// but we need to make sure there are enough registers; the only valid
|
|
|
|
// registers are the 4 used for parameters. We don't currently do this
|
|
|
|
// case.
|
2010-11-30 23:55:39 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
|
|
|
return false;
|
2010-06-18 18:13:11 +00:00
|
|
|
|
2010-06-03 21:09:53 +00:00
|
|
|
// If the calling conventions do not match, then we'd better make sure the
|
|
|
|
// results are returned in the same way as what the caller expects.
|
|
|
|
if (!CCMatch) {
|
|
|
|
SmallVector<CCValAssign, 16> RVLocs1;
|
|
|
|
CCState CCInfo1(CalleeCC, false, getTargetMachine(),
|
|
|
|
RVLocs1, *DAG.getContext());
|
|
|
|
CCInfo1.AnalyzeCallResult(Ins, CCAssignFnForNode(CalleeCC, true, isVarArg));
|
|
|
|
|
|
|
|
SmallVector<CCValAssign, 16> RVLocs2;
|
|
|
|
CCState CCInfo2(CallerCC, false, getTargetMachine(),
|
|
|
|
RVLocs2, *DAG.getContext());
|
|
|
|
CCInfo2.AnalyzeCallResult(Ins, CCAssignFnForNode(CallerCC, true, isVarArg));
|
|
|
|
|
|
|
|
if (RVLocs1.size() != RVLocs2.size())
|
|
|
|
return false;
|
|
|
|
for (unsigned i = 0, e = RVLocs1.size(); i != e; ++i) {
|
|
|
|
if (RVLocs1[i].isRegLoc() != RVLocs2[i].isRegLoc())
|
|
|
|
return false;
|
|
|
|
if (RVLocs1[i].getLocInfo() != RVLocs2[i].getLocInfo())
|
|
|
|
return false;
|
|
|
|
if (RVLocs1[i].isRegLoc()) {
|
|
|
|
if (RVLocs1[i].getLocReg() != RVLocs2[i].getLocReg())
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if (RVLocs1[i].getLocMemOffset() != RVLocs2[i].getLocMemOffset())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the callee takes no arguments then go on to check the results of the
|
|
|
|
// call.
|
|
|
|
if (!Outs.empty()) {
|
|
|
|
// Check if stack adjustment is needed. For now, do not do this if any
|
|
|
|
// argument is passed on the stack.
|
|
|
|
SmallVector<CCValAssign, 16> ArgLocs;
|
|
|
|
CCState CCInfo(CalleeCC, isVarArg, getTargetMachine(),
|
|
|
|
ArgLocs, *DAG.getContext());
|
|
|
|
CCInfo.AnalyzeCallOperands(Outs,
|
|
|
|
CCAssignFnForNode(CalleeCC, false, isVarArg));
|
|
|
|
if (CCInfo.getNextStackOffset()) {
|
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
|
|
|
|
// Check if the arguments are already laid out in the right way as
|
|
|
|
// the caller's fixed stack objects.
|
|
|
|
MachineFrameInfo *MFI = MF.getFrameInfo();
|
|
|
|
const MachineRegisterInfo *MRI = &MF.getRegInfo();
|
|
|
|
const ARMInstrInfo *TII =
|
|
|
|
((ARMTargetMachine&)getTargetMachine()).getInstrInfo();
|
2010-06-05 00:51:39 +00:00
|
|
|
for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size();
|
|
|
|
i != e;
|
|
|
|
++i, ++realArgIdx) {
|
2010-06-03 21:09:53 +00:00
|
|
|
CCValAssign &VA = ArgLocs[i];
|
|
|
|
EVT RegVT = VA.getLocVT();
|
2010-07-07 15:54:55 +00:00
|
|
|
SDValue Arg = OutVals[realArgIdx];
|
2010-06-05 00:51:39 +00:00
|
|
|
ISD::ArgFlagsTy Flags = Outs[realArgIdx].Flags;
|
2010-06-03 21:09:53 +00:00
|
|
|
if (VA.getLocInfo() == CCValAssign::Indirect)
|
|
|
|
return false;
|
2010-06-05 00:51:39 +00:00
|
|
|
if (VA.needsCustom()) {
|
|
|
|
// f64 and vector types are split into multiple registers or
|
|
|
|
// register/stack-slot combinations. The types will not match
|
|
|
|
// the registers; give up on memory f64 refs until we figure
|
|
|
|
// out what to do about this.
|
|
|
|
if (!VA.isRegLoc())
|
|
|
|
return false;
|
|
|
|
if (!ArgLocs[++i].isRegLoc())
|
2010-09-08 03:54:02 +00:00
|
|
|
return false;
|
2010-06-05 00:51:39 +00:00
|
|
|
if (RegVT == MVT::v2f64) {
|
|
|
|
if (!ArgLocs[++i].isRegLoc())
|
|
|
|
return false;
|
|
|
|
if (!ArgLocs[++i].isRegLoc())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else if (!VA.isRegLoc()) {
|
2010-06-03 21:09:53 +00:00
|
|
|
if (!MatchingStackOffset(Arg, VA.getLocMemOffset(), Flags,
|
|
|
|
MFI, MRI, TII))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::LowerReturn(SDValue Chain,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::OutputArg> &Outs,
|
2010-07-07 15:54:55 +00:00
|
|
|
const SmallVectorImpl<SDValue> &OutVals,
|
2010-04-17 15:26:15 +00:00
|
|
|
DebugLoc dl, SelectionDAG &DAG) const {
|
2009-04-17 19:07:39 +00:00
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
// CCValAssign - represent the assignment of the return value to a location.
|
2009-04-17 19:07:39 +00:00
|
|
|
SmallVector<CCValAssign, 16> RVLocs;
|
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
// CCState - Info about the registers and stack slots.
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(), RVLocs,
|
|
|
|
*DAG.getContext());
|
2009-04-17 19:07:39 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
// Analyze outgoing return values.
|
2009-08-05 19:04:42 +00:00
|
|
|
CCInfo.AnalyzeReturn(Outs, CCAssignFnForNode(CallConv, /* Return */ true,
|
|
|
|
isVarArg));
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
// If this is the first return lowered for this function, add
|
|
|
|
// the regs to the liveout set for the function.
|
|
|
|
if (DAG.getMachineFunction().getRegInfo().liveout_empty()) {
|
|
|
|
for (unsigned i = 0; i != RVLocs.size(); ++i)
|
|
|
|
if (RVLocs[i].isRegLoc())
|
|
|
|
DAG.getMachineFunction().getRegInfo().addLiveOut(RVLocs[i].getLocReg());
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
SDValue Flag;
|
|
|
|
|
|
|
|
// Copy the result values into the output registers.
|
|
|
|
for (unsigned i = 0, realRVLocIdx = 0;
|
|
|
|
i != RVLocs.size();
|
|
|
|
++i, ++realRVLocIdx) {
|
|
|
|
CCValAssign &VA = RVLocs[i];
|
|
|
|
assert(VA.isRegLoc() && "Can only return in registers!");
|
|
|
|
|
2010-07-07 15:54:55 +00:00
|
|
|
SDValue Arg = OutVals[realRVLocIdx];
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
switch (VA.getLocInfo()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown loc info!");
|
2009-04-17 19:07:39 +00:00
|
|
|
case CCValAssign::Full: break;
|
|
|
|
case CCValAssign::BCvt:
|
2010-11-23 03:31:01 +00:00
|
|
|
Arg = DAG.getNode(ISD::BITCAST, dl, VA.getLocVT(), Arg);
|
2009-04-17 19:07:39 +00:00
|
|
|
break;
|
2008-07-11 20:53:00 +00:00
|
|
|
}
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
if (VA.needsCustom()) {
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VA.getLocVT() == MVT::v2f64) {
|
2009-06-22 23:27:02 +00:00
|
|
|
// Extract the first half and return it in two registers.
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Half = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Arg,
|
|
|
|
DAG.getConstant(0, MVT::i32));
|
2009-11-09 00:11:35 +00:00
|
|
|
SDValue HalfGPRs = DAG.getNode(ARMISD::VMOVRRD, dl,
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getVTList(MVT::i32, MVT::i32), Half);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), HalfGPRs, Flag);
|
|
|
|
Flag = Chain.getValue(1);
|
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(),
|
|
|
|
HalfGPRs.getValue(1), Flag);
|
|
|
|
Flag = Chain.getValue(1);
|
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
|
|
|
|
|
|
|
// Extract the 2nd half and fall through to handle it as an f64 value.
|
2009-08-11 20:47:22 +00:00
|
|
|
Arg = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64, Arg,
|
|
|
|
DAG.getConstant(1, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
// Legalize ret f64 -> ret 2 x i32. We always have fmrrd if f64 is
|
|
|
|
// available.
|
2009-11-09 00:11:35 +00:00
|
|
|
SDValue fmrrd = DAG.getNode(ARMISD::VMOVRRD, dl,
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getVTList(MVT::i32, MVT::i32), &Arg, 1);
|
2009-04-17 19:07:39 +00:00
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), fmrrd, Flag);
|
2009-04-24 17:00:36 +00:00
|
|
|
Flag = Chain.getValue(1);
|
2009-04-17 19:07:39 +00:00
|
|
|
VA = RVLocs[++i]; // skip ahead to next loc
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), fmrrd.getValue(1),
|
|
|
|
Flag);
|
|
|
|
} else
|
|
|
|
Chain = DAG.getCopyToReg(Chain, dl, VA.getLocReg(), Arg, Flag);
|
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
// Guarantee that all emitted copies are
|
|
|
|
// stuck together, avoiding something bad.
|
2009-04-17 19:07:39 +00:00
|
|
|
Flag = Chain.getValue(1);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
SDValue result;
|
|
|
|
if (Flag.getNode())
|
2009-08-11 20:47:22 +00:00
|
|
|
result = DAG.getNode(ARMISD::RET_FLAG, dl, MVT::Other, Chain, Flag);
|
2009-04-17 19:07:39 +00:00
|
|
|
else // Return Void
|
2009-08-11 20:47:22 +00:00
|
|
|
result = DAG.getNode(ARMISD::RET_FLAG, dl, MVT::Other, Chain);
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
return result;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-11-30 23:55:39 +00:00
|
|
|
bool ARMTargetLowering::isUsedByReturnOnly(SDNode *N) const {
|
|
|
|
if (N->getNumValues() != 1)
|
|
|
|
return false;
|
|
|
|
if (!N->hasNUsesOfValue(1, 0))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned NumCopies = 0;
|
|
|
|
SDNode* Copies[2];
|
|
|
|
SDNode *Use = *N->use_begin();
|
|
|
|
if (Use->getOpcode() == ISD::CopyToReg) {
|
|
|
|
Copies[NumCopies++] = Use;
|
|
|
|
} else if (Use->getOpcode() == ARMISD::VMOVRRD) {
|
|
|
|
// f64 returned in a pair of GPRs.
|
|
|
|
for (SDNode::use_iterator UI = Use->use_begin(), UE = Use->use_end();
|
|
|
|
UI != UE; ++UI) {
|
|
|
|
if (UI->getOpcode() != ISD::CopyToReg)
|
|
|
|
return false;
|
|
|
|
Copies[UI.getUse().getResNo()] = *UI;
|
|
|
|
++NumCopies;
|
|
|
|
}
|
|
|
|
} else if (Use->getOpcode() == ISD::BITCAST) {
|
|
|
|
// f32 returned in a single GPR.
|
|
|
|
if (!Use->hasNUsesOfValue(1, 0))
|
|
|
|
return false;
|
|
|
|
Use = *Use->use_begin();
|
|
|
|
if (Use->getOpcode() != ISD::CopyToReg || !Use->hasNUsesOfValue(1, 0))
|
|
|
|
return false;
|
|
|
|
Copies[NumCopies++] = Use;
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (NumCopies != 1 && NumCopies != 2)
|
|
|
|
return false;
|
2010-12-01 22:59:46 +00:00
|
|
|
|
|
|
|
bool HasRet = false;
|
2010-11-30 23:55:39 +00:00
|
|
|
for (unsigned i = 0; i < NumCopies; ++i) {
|
|
|
|
SDNode *Copy = Copies[i];
|
|
|
|
for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
|
|
|
|
UI != UE; ++UI) {
|
|
|
|
if (UI->getOpcode() == ISD::CopyToReg) {
|
|
|
|
SDNode *Use = *UI;
|
|
|
|
if (Use == Copies[0] || Use == Copies[1])
|
|
|
|
continue;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (UI->getOpcode() != ARMISD::RET_FLAG)
|
|
|
|
return false;
|
2010-12-01 22:59:46 +00:00
|
|
|
HasRet = true;
|
2010-11-30 23:55:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-01 22:59:46 +00:00
|
|
|
return HasRet;
|
2010-11-30 23:55:39 +00:00
|
|
|
}
|
|
|
|
|
2009-11-03 00:02:05 +00:00
|
|
|
// ConstantPool, JumpTable, GlobalAddress, and ExternalSymbol are lowered as
|
|
|
|
// their target counterpart wrapped in the ARMISD::Wrapper node. Suppose N is
|
|
|
|
// one of the above mentioned nodes. It has to be wrapped because otherwise
|
|
|
|
// Select(N) returns N. So the raw TargetGlobalAddress nodes, etc. can only
|
|
|
|
// be used to form addressing mode. These wrapped nodes will be selected
|
|
|
|
// into MOVi.
|
2008-07-27 21:46:04 +00:00
|
|
|
static SDValue LowerConstantPool(SDValue Op, SelectionDAG &DAG) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = Op.getValueType();
|
2009-02-07 00:55:49 +00:00
|
|
|
// FIXME there is no actual debug info here
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-01-19 07:51:42 +00:00
|
|
|
ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(Op);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Res;
|
2007-01-19 07:51:42 +00:00
|
|
|
if (CP->isMachineConstantPoolEntry())
|
|
|
|
Res = DAG.getTargetConstantPool(CP->getMachineCPVal(), PtrVT,
|
|
|
|
CP->getAlignment());
|
|
|
|
else
|
|
|
|
Res = DAG.getTargetConstantPool(CP->getConstVal(), PtrVT,
|
|
|
|
CP->getAlignment());
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, Res);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-07-19 17:20:38 +00:00
|
|
|
unsigned ARMTargetLowering::getJumpTableEncoding() const {
|
|
|
|
return MachineJumpTableInfo::EK_Inline;
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerBlockAddress(SDValue Op,
|
|
|
|
SelectionDAG &DAG) const {
|
2009-11-06 22:24:13 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
|
|
|
unsigned ARMPCLabelIndex = 0;
|
2009-10-30 05:45:42 +00:00
|
|
|
DebugLoc DL = Op.getDebugLoc();
|
2009-11-02 20:59:23 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2010-04-15 01:51:59 +00:00
|
|
|
const BlockAddress *BA = cast<BlockAddressSDNode>(Op)->getBlockAddress();
|
2009-11-02 20:59:23 +00:00
|
|
|
Reloc::Model RelocM = getTargetMachine().getRelocationModel();
|
|
|
|
SDValue CPAddr;
|
|
|
|
if (RelocM == Reloc::Static) {
|
|
|
|
CPAddr = DAG.getTargetConstantPool(BA, PtrVT, 4);
|
|
|
|
} else {
|
|
|
|
unsigned PCAdj = Subtarget->isThumb() ? 4 : 8;
|
2011-01-17 08:03:18 +00:00
|
|
|
ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-11-02 20:59:23 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(BA, ARMPCLabelIndex,
|
|
|
|
ARMCP::CPBlockAddress,
|
|
|
|
PCAdj);
|
|
|
|
CPAddr = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
|
|
|
}
|
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, DL, PtrVT, CPAddr);
|
|
|
|
SDValue Result = DAG.getLoad(PtrVT, DL, DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-11-02 20:59:23 +00:00
|
|
|
if (RelocM == Reloc::Static)
|
|
|
|
return Result;
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-11-02 20:59:23 +00:00
|
|
|
return DAG.getNode(ARMISD::PIC_ADD, DL, PtrVT, Result, PICLabel);
|
2009-10-30 05:45:42 +00:00
|
|
|
}
|
|
|
|
|
2007-04-27 13:54:47 +00:00
|
|
|
// Lower ISD::GlobalTLSAddress using the "general dynamic" model
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue
|
2007-04-27 13:54:47 +00:00
|
|
|
ARMTargetLowering::LowerToTLSGeneralDynamicModel(GlobalAddressSDNode *GA,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = GA->getDebugLoc();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2007-04-27 13:54:47 +00:00
|
|
|
unsigned char PCAdj = Subtarget->isThumb() ? 4 : 8;
|
2009-11-06 22:24:13 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2007-04-27 13:54:47 +00:00
|
|
|
ARMConstantPoolValue *CPV =
|
2009-08-28 23:18:09 +00:00
|
|
|
new ARMConstantPoolValue(GA->getGlobal(), ARMPCLabelIndex,
|
2010-11-09 21:36:17 +00:00
|
|
|
ARMCP::CPValue, PCAdj, ARMCP::TLSGD, true);
|
2009-03-13 07:51:59 +00:00
|
|
|
SDValue Argument = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
Argument = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, Argument);
|
2009-10-31 03:39:36 +00:00
|
|
|
Argument = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Argument,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Chain = Argument.getValue(1);
|
2007-04-27 13:54:47 +00:00
|
|
|
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-02-04 20:06:27 +00:00
|
|
|
Argument = DAG.getNode(ARMISD::PIC_ADD, dl, PtrVT, Argument, PICLabel);
|
2007-04-27 13:54:47 +00:00
|
|
|
|
|
|
|
// call __tls_get_addr.
|
|
|
|
ArgListTy Args;
|
|
|
|
ArgListEntry Entry;
|
|
|
|
Entry.Node = Argument;
|
2009-08-13 21:58:54 +00:00
|
|
|
Entry.Ty = (const Type *) Type::getInt32Ty(*DAG.getContext());
|
2007-04-27 13:54:47 +00:00
|
|
|
Args.push_back(Entry);
|
2009-01-30 23:10:59 +00:00
|
|
|
// FIXME: is there useful debug info available here?
|
2008-07-27 21:46:04 +00:00
|
|
|
std::pair<SDValue, SDValue> CallResult =
|
2009-08-14 19:11:20 +00:00
|
|
|
LowerCallTo(Chain, (const Type *) Type::getInt32Ty(*DAG.getContext()),
|
|
|
|
false, false, false, false,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
0, CallingConv::C, false, /*isReturnValueUsed=*/true,
|
2010-03-02 01:55:18 +00:00
|
|
|
DAG.getExternalSymbol("__tls_get_addr", PtrVT), Args, DAG, dl);
|
2007-04-27 13:54:47 +00:00
|
|
|
return CallResult.first;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Lower ISD::GlobalTLSAddress using the "initial exec" or
|
|
|
|
// "local exec" model.
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue
|
2007-04-27 13:54:47 +00:00
|
|
|
ARMTargetLowering::LowerToTLSExecModels(GlobalAddressSDNode *GA,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalValue *GV = GA->getGlobal();
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = GA->getDebugLoc();
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Offset;
|
|
|
|
SDValue Chain = DAG.getEntryNode();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2007-04-27 13:54:47 +00:00
|
|
|
// Get the Thread Pointer
|
2009-02-04 20:06:27 +00:00
|
|
|
SDValue ThreadPointer = DAG.getNode(ARMISD::THREAD_POINTER, dl, PtrVT);
|
2007-04-27 13:54:47 +00:00
|
|
|
|
2009-07-15 04:12:33 +00:00
|
|
|
if (GV->isDeclaration()) {
|
2009-11-06 22:24:13 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-11-06 22:24:13 +00:00
|
|
|
// Initial exec model.
|
2007-04-27 13:54:47 +00:00
|
|
|
unsigned char PCAdj = Subtarget->isThumb() ? 4 : 8;
|
|
|
|
ARMConstantPoolValue *CPV =
|
2009-08-28 23:18:09 +00:00
|
|
|
new ARMConstantPoolValue(GA->getGlobal(), ARMPCLabelIndex,
|
2010-11-09 21:36:17 +00:00
|
|
|
ARMCP::CPValue, PCAdj, ARMCP::GOTTPOFF, true);
|
2009-03-13 07:51:59 +00:00
|
|
|
Offset = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
Offset = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, Offset);
|
2009-10-31 03:39:36 +00:00
|
|
|
Offset = DAG.getLoad(PtrVT, dl, Chain, Offset,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2007-04-27 13:54:47 +00:00
|
|
|
Chain = Offset.getValue(1);
|
|
|
|
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-02-04 20:06:27 +00:00
|
|
|
Offset = DAG.getNode(ARMISD::PIC_ADD, dl, PtrVT, Offset, PICLabel);
|
2007-04-27 13:54:47 +00:00
|
|
|
|
2009-10-31 03:39:36 +00:00
|
|
|
Offset = DAG.getLoad(PtrVT, dl, Chain, Offset,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2007-04-27 13:54:47 +00:00
|
|
|
} else {
|
|
|
|
// local exec model
|
2010-11-09 21:36:17 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(GV, ARMCP::TPOFF);
|
2009-03-13 07:51:59 +00:00
|
|
|
Offset = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
Offset = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, Offset);
|
2009-10-31 03:39:36 +00:00
|
|
|
Offset = DAG.getLoad(PtrVT, dl, Chain, Offset,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2007-04-27 13:54:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// The address of the thread local variable is the add of the thread
|
|
|
|
// pointer with the offset of the variable.
|
2009-02-04 20:06:27 +00:00
|
|
|
return DAG.getNode(ISD::ADD, dl, PtrVT, ThreadPointer, Offset);
|
2007-04-27 13:54:47 +00:00
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue
|
2010-04-17 15:26:15 +00:00
|
|
|
ARMTargetLowering::LowerGlobalTLSAddress(SDValue Op, SelectionDAG &DAG) const {
|
2007-04-27 13:54:47 +00:00
|
|
|
// TODO: implement the "local dynamic" model
|
|
|
|
assert(Subtarget->isTargetELF() &&
|
|
|
|
"TLS not implemented for non-ELF targets");
|
|
|
|
GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(Op);
|
|
|
|
// If the relocation model is PIC, use the "General Dynamic" TLS Model,
|
|
|
|
// otherwise use the "Local Exec" TLS Model
|
|
|
|
if (getTargetMachine().getRelocationModel() == Reloc::PIC_)
|
|
|
|
return LowerToTLSGeneralDynamicModel(GA, DAG);
|
|
|
|
else
|
|
|
|
return LowerToTLSExecModels(GA, DAG);
|
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue ARMTargetLowering::LowerGlobalAddressELF(SDValue Op,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
|
2007-04-22 00:04:12 +00:00
|
|
|
Reloc::Model RelocM = getTargetMachine().getRelocationModel();
|
|
|
|
if (RelocM == Reloc::PIC_) {
|
2009-01-15 20:18:42 +00:00
|
|
|
bool UseGOTOFF = GV->hasLocalLinkage() || GV->hasHiddenVisibility();
|
2007-04-22 00:04:12 +00:00
|
|
|
ARMConstantPoolValue *CPV =
|
2010-11-09 21:36:17 +00:00
|
|
|
new ARMConstantPoolValue(GV, UseGOTOFF ? ARMCP::GOTOFF : ARMCP::GOT);
|
2009-03-13 07:51:59 +00:00
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2009-03-20 22:42:55 +00:00
|
|
|
SDValue Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(),
|
2009-10-07 00:06:35 +00:00
|
|
|
CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Chain = Result.getValue(1);
|
2009-02-07 00:55:49 +00:00
|
|
|
SDValue GOT = DAG.getGLOBAL_OFFSET_TABLE(PtrVT);
|
2009-02-04 20:06:27 +00:00
|
|
|
Result = DAG.getNode(ISD::ADD, dl, PtrVT, Result, GOT);
|
2007-04-22 00:04:12 +00:00
|
|
|
if (!UseGOTOFF)
|
2009-10-07 00:06:35 +00:00
|
|
|
Result = DAG.getLoad(PtrVT, dl, Chain, Result,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getGOT(), false, false, 0);
|
2007-04-22 00:04:12 +00:00
|
|
|
return Result;
|
2011-01-17 08:03:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// If we have T2 ops, we can materialize the address directly via movt/movw
|
|
|
|
// pair. This is always cheaper.
|
|
|
|
if (Subtarget->useMovt()) {
|
2011-01-19 02:16:49 +00:00
|
|
|
++NumMovwMovt;
|
2011-01-17 08:03:18 +00:00
|
|
|
// FIXME: Once remat is capable of dealing with instructions with register
|
|
|
|
// operands, expand this into two nodes.
|
|
|
|
return DAG.getNode(ARMISD::Wrapper, dl, PtrVT,
|
|
|
|
DAG.getTargetGlobalAddress(GV, dl, PtrVT));
|
2007-04-22 00:04:12 +00:00
|
|
|
} else {
|
2011-01-17 08:03:18 +00:00
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(GV, PtrVT, 4);
|
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
|
|
|
return DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), CPAddr,
|
|
|
|
MachinePointerInfo::getConstantPool(),
|
|
|
|
false, false, 0);
|
2007-04-22 00:04:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue ARMTargetLowering::LowerGlobalAddressDarwin(SDValue Op,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2010-04-15 01:51:59 +00:00
|
|
|
const GlobalValue *GV = cast<GlobalAddressSDNode>(Op)->getGlobal();
|
2007-01-19 07:51:42 +00:00
|
|
|
Reloc::Model RelocM = getTargetMachine().getRelocationModel();
|
2011-01-17 08:03:18 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
|
|
|
|
|
|
|
if (Subtarget->useMovt()) {
|
2011-01-19 02:16:49 +00:00
|
|
|
++NumMovwMovt;
|
2011-01-17 08:03:18 +00:00
|
|
|
// FIXME: Once remat is capable of dealing with instructions with register
|
|
|
|
// operands, expand this into two nodes.
|
2011-01-21 18:55:51 +00:00
|
|
|
if (RelocM == Reloc::Static)
|
2011-01-17 08:03:18 +00:00
|
|
|
return DAG.getNode(ARMISD::Wrapper, dl, PtrVT,
|
|
|
|
DAG.getTargetGlobalAddress(GV, dl, PtrVT));
|
|
|
|
|
2011-01-21 18:55:51 +00:00
|
|
|
unsigned Wrapper = (RelocM == Reloc::PIC_)
|
|
|
|
? ARMISD::WrapperPIC : ARMISD::WrapperDYN;
|
|
|
|
SDValue Result = DAG.getNode(Wrapper, dl, PtrVT,
|
2011-01-20 08:34:58 +00:00
|
|
|
DAG.getTargetGlobalAddress(GV, dl, PtrVT));
|
2011-01-19 02:16:49 +00:00
|
|
|
if (Subtarget->GVIsIndirectSymbol(GV, RelocM))
|
|
|
|
Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), Result,
|
|
|
|
MachinePointerInfo::getGOT(), false, false, 0);
|
|
|
|
return Result;
|
2011-01-17 08:03:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned ARMPCLabelIndex = 0;
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue CPAddr;
|
2011-01-17 08:03:18 +00:00
|
|
|
if (RelocM == Reloc::Static) {
|
2009-03-13 07:51:59 +00:00
|
|
|
CPAddr = DAG.getTargetConstantPool(GV, PtrVT, 4);
|
2011-01-17 08:03:18 +00:00
|
|
|
} else {
|
|
|
|
ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-08-28 23:18:09 +00:00
|
|
|
unsigned PCAdj = (RelocM != Reloc::PIC_) ? 0 : (Subtarget->isThumb()?4:8);
|
|
|
|
ARMConstantPoolValue *CPV =
|
2009-09-01 01:57:56 +00:00
|
|
|
new ARMConstantPoolValue(GV, ARMPCLabelIndex, ARMCP::CPValue, PCAdj);
|
2009-03-13 07:51:59 +00:00
|
|
|
CPAddr = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-10-31 03:39:36 +00:00
|
|
|
SDValue Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Chain = Result.getValue(1);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
|
|
|
if (RelocM == Reloc::PIC_) {
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-02-04 20:06:27 +00:00
|
|
|
Result = DAG.getNode(ARMISD::PIC_ADD, dl, PtrVT, Result, PICLabel);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2009-08-28 23:18:09 +00:00
|
|
|
|
2009-09-03 07:04:02 +00:00
|
|
|
if (Subtarget->GVIsIndirectSymbol(GV, RelocM))
|
2010-09-21 06:44:06 +00:00
|
|
|
Result = DAG.getLoad(PtrVT, dl, Chain, Result, MachinePointerInfo::getGOT(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue ARMTargetLowering::LowerGLOBAL_OFFSET_TABLE(SDValue Op,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2007-04-22 00:04:12 +00:00
|
|
|
assert(Subtarget->isTargetELF() &&
|
|
|
|
"GLOBAL OFFSET TABLE not implemented for non-ELF targets");
|
2009-11-06 22:24:13 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-04-22 00:04:12 +00:00
|
|
|
unsigned PCAdj = Subtarget->isThumb() ? 4 : 8;
|
2009-08-13 21:58:54 +00:00
|
|
|
ARMConstantPoolValue *CPV = new ARMConstantPoolValue(*DAG.getContext(),
|
|
|
|
"_GLOBAL_OFFSET_TABLE_",
|
2009-08-28 23:18:09 +00:00
|
|
|
ARMPCLabelIndex, PCAdj);
|
2009-03-13 07:51:59 +00:00
|
|
|
SDValue CPAddr = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2009-10-07 00:06:35 +00:00
|
|
|
SDValue Result = DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-02-04 20:06:27 +00:00
|
|
|
return DAG.getNode(ARMISD::PIC_ADD, dl, PtrVT, Result, PICLabel);
|
2007-04-22 00:04:12 +00:00
|
|
|
}
|
|
|
|
|
2010-10-19 23:27:08 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::LowerEH_SJLJ_DISPATCHSETUP(SDValue Op, SelectionDAG &DAG)
|
|
|
|
const {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
return DAG.getNode(ARMISD::EH_SJLJ_DISPATCHSETUP, dl, MVT::Other,
|
|
|
|
Op.getOperand(0), Op.getOperand(1));
|
|
|
|
}
|
|
|
|
|
2010-05-26 20:22:18 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::LowerEH_SJLJ_SETJMP(SDValue Op, SelectionDAG &DAG) const {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2010-05-27 23:49:24 +00:00
|
|
|
SDValue Val = DAG.getConstant(0, MVT::i32);
|
2010-05-26 20:22:18 +00:00
|
|
|
return DAG.getNode(ARMISD::EH_SJLJ_SETJMP, dl, MVT::i32, Op.getOperand(0),
|
|
|
|
Op.getOperand(1), Val);
|
|
|
|
}
|
|
|
|
|
2010-05-22 01:06:18 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::LowerEH_SJLJ_LONGJMP(SDValue Op, SelectionDAG &DAG) const {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
return DAG.getNode(ARMISD::EH_SJLJ_LONGJMP, dl, MVT::Other, Op.getOperand(0),
|
|
|
|
Op.getOperand(1), DAG.getConstant(0, MVT::i32));
|
|
|
|
}
|
|
|
|
|
2009-05-12 23:59:14 +00:00
|
|
|
SDValue
|
2010-02-08 23:22:00 +00:00
|
|
|
ARMTargetLowering::LowerINTRINSIC_WO_CHAIN(SDValue Op, SelectionDAG &DAG,
|
2010-06-16 23:45:49 +00:00
|
|
|
const ARMSubtarget *Subtarget) const {
|
2008-09-12 16:56:44 +00:00
|
|
|
unsigned IntNo = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
2009-05-12 23:59:14 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-11-08 17:20:05 +00:00
|
|
|
switch (IntNo) {
|
2008-07-27 21:46:04 +00:00
|
|
|
default: return SDValue(); // Don't custom lower most intrinsics.
|
2009-08-04 00:25:01 +00:00
|
|
|
case Intrinsic::arm_thread_pointer: {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = DAG.getTargetLoweringInfo().getPointerTy();
|
2009-08-04 00:25:01 +00:00
|
|
|
return DAG.getNode(ARMISD::THREAD_POINTER, dl, PtrVT);
|
|
|
|
}
|
2009-08-11 00:09:57 +00:00
|
|
|
case Intrinsic::eh_sjlj_lsda: {
|
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
2009-11-06 22:24:13 +00:00
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2011-01-17 08:03:18 +00:00
|
|
|
unsigned ARMPCLabelIndex = AFI->createPICLabelUId();
|
2009-08-11 00:09:57 +00:00
|
|
|
EVT PtrVT = getPointerTy();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
Reloc::Model RelocM = getTargetMachine().getRelocationModel();
|
|
|
|
SDValue CPAddr;
|
|
|
|
unsigned PCAdj = (RelocM != Reloc::PIC_)
|
|
|
|
? 0 : (Subtarget->isThumb() ? 4 : 8);
|
|
|
|
ARMConstantPoolValue *CPV =
|
2009-09-01 01:57:56 +00:00
|
|
|
new ARMConstantPoolValue(MF.getFunction(), ARMPCLabelIndex,
|
|
|
|
ARMCP::CPLSDA, PCAdj);
|
2009-08-11 00:09:57 +00:00
|
|
|
CPAddr = DAG.getTargetConstantPool(CPV, PtrVT, 4);
|
2009-08-11 20:47:22 +00:00
|
|
|
CPAddr = DAG.getNode(ARMISD::Wrapper, dl, MVT::i32, CPAddr);
|
2009-08-11 00:09:57 +00:00
|
|
|
SDValue Result =
|
2009-10-31 03:39:36 +00:00
|
|
|
DAG.getLoad(PtrVT, dl, DAG.getEntryNode(), CPAddr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getConstantPool(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-08-11 00:09:57 +00:00
|
|
|
|
|
|
|
if (RelocM == Reloc::PIC_) {
|
2009-11-06 22:24:13 +00:00
|
|
|
SDValue PICLabel = DAG.getConstant(ARMPCLabelIndex, MVT::i32);
|
2009-08-11 00:09:57 +00:00
|
|
|
Result = DAG.getNode(ARMISD::PIC_ADD, dl, PtrVT, Result, PICLabel);
|
|
|
|
}
|
|
|
|
return Result;
|
|
|
|
}
|
2007-11-08 17:20:05 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-14 21:24:16 +00:00
|
|
|
static SDValue LowerMEMBARRIER(SDValue Op, SelectionDAG &DAG,
|
2010-06-16 23:45:49 +00:00
|
|
|
const ARMSubtarget *Subtarget) {
|
2009-12-10 00:11:09 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2010-10-30 00:54:37 +00:00
|
|
|
if (!Subtarget->hasDataBarrier()) {
|
|
|
|
// Some ARMv6 cpus can support data barriers with an mcr instruction.
|
|
|
|
// Thumb1 and pre-v6 ARM mode use a libcall instead and should never get
|
|
|
|
// here.
|
2010-11-09 22:50:44 +00:00
|
|
|
assert(Subtarget->hasV6Ops() && !Subtarget->isThumb() &&
|
2010-08-11 06:22:01 +00:00
|
|
|
"Unexpected ISD::MEMBARRIER encountered. Should be libcall!");
|
2010-10-30 00:54:37 +00:00
|
|
|
return DAG.getNode(ARMISD::MEMBARRIER_MCR, dl, MVT::Other, Op.getOperand(0),
|
2010-06-17 01:37:00 +00:00
|
|
|
DAG.getConstant(0, MVT::i32));
|
2010-08-11 06:22:01 +00:00
|
|
|
}
|
2010-10-30 00:54:37 +00:00
|
|
|
|
|
|
|
SDValue Op5 = Op.getOperand(5);
|
|
|
|
bool isDeviceBarrier = cast<ConstantSDNode>(Op5)->getZExtValue() != 0;
|
|
|
|
unsigned isLL = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
|
|
|
|
unsigned isLS = cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue();
|
|
|
|
bool isOnlyStoreBarrier = (isLL == 0 && isLS == 0);
|
|
|
|
|
|
|
|
ARM_MB::MemBOpt DMBOpt;
|
|
|
|
if (isDeviceBarrier)
|
|
|
|
DMBOpt = isOnlyStoreBarrier ? ARM_MB::ST : ARM_MB::SY;
|
|
|
|
else
|
|
|
|
DMBOpt = isOnlyStoreBarrier ? ARM_MB::ISHST : ARM_MB::ISH;
|
|
|
|
return DAG.getNode(ARMISD::MEMBARRIER, dl, MVT::Other, Op.getOperand(0),
|
|
|
|
DAG.getConstant(DMBOpt, MVT::i32));
|
2009-12-10 00:11:09 +00:00
|
|
|
}
|
|
|
|
|
2010-11-03 06:34:55 +00:00
|
|
|
static SDValue LowerPREFETCH(SDValue Op, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *Subtarget) {
|
|
|
|
// ARM pre v5TE and Thumb1 does not have preload instructions.
|
|
|
|
if (!(Subtarget->isThumb2() ||
|
|
|
|
(!Subtarget->isThumb1Only() && Subtarget->hasV5TEOps())))
|
|
|
|
// Just preserve the chain.
|
|
|
|
return Op.getOperand(0);
|
|
|
|
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2010-11-04 05:19:35 +00:00
|
|
|
unsigned isRead = ~cast<ConstantSDNode>(Op.getOperand(2))->getZExtValue() & 1;
|
|
|
|
if (!isRead &&
|
|
|
|
(!Subtarget->hasV7Ops() || !Subtarget->hasMPExtension()))
|
|
|
|
// ARMv7 with MP extension has PLDW.
|
|
|
|
return Op.getOperand(0);
|
2010-11-03 06:34:55 +00:00
|
|
|
|
|
|
|
if (Subtarget->isThumb())
|
|
|
|
// Invert the bits.
|
2010-11-04 05:19:35 +00:00
|
|
|
isRead = ~isRead & 1;
|
|
|
|
unsigned isData = Subtarget->isThumb() ? 0 : 1;
|
2010-11-03 06:34:55 +00:00
|
|
|
|
2010-11-04 05:19:35 +00:00
|
|
|
// Currently there is no intrinsic that matches pli.
|
2010-11-03 06:34:55 +00:00
|
|
|
return DAG.getNode(ARMISD::PRELOAD, dl, MVT::Other, Op.getOperand(0),
|
2010-11-04 05:19:35 +00:00
|
|
|
Op.getOperand(1), DAG.getConstant(isRead, MVT::i32),
|
|
|
|
DAG.getConstant(isData, MVT::i32));
|
2010-11-03 06:34:55 +00:00
|
|
|
}
|
|
|
|
|
2010-04-17 14:41:14 +00:00
|
|
|
static SDValue LowerVASTART(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *FuncInfo = MF.getInfo<ARMFunctionInfo>();
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// vastart just stores the address of the VarArgsFrameIndex slot into the
|
|
|
|
// memory location argument.
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PtrVT = DAG.getTargetLoweringInfo().getPointerTy();
|
2010-04-17 14:41:14 +00:00
|
|
|
SDValue FR = DAG.getFrameIndex(FuncInfo->getVarArgsFrameIndex(), PtrVT);
|
2008-02-06 22:27:42 +00:00
|
|
|
const Value *SV = cast<SrcValueSDNode>(Op.getOperand(2))->getValue();
|
2010-09-21 18:51:21 +00:00
|
|
|
return DAG.getStore(Op.getOperand(0), dl, FR, Op.getOperand(1),
|
|
|
|
MachinePointerInfo(SV), false, false, 0);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::GetF64FormalArgument(CCValAssign &VA, CCValAssign &NextVA,
|
|
|
|
SDValue &Root, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
DebugLoc dl) const {
|
2009-06-22 23:27:02 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
|
|
|
|
|
|
|
TargetRegisterClass *RC;
|
2009-07-08 23:10:31 +00:00
|
|
|
if (AFI->isThumb1OnlyFunction())
|
2009-06-22 23:27:02 +00:00
|
|
|
RC = ARM::tGPRRegisterClass;
|
|
|
|
else
|
|
|
|
RC = ARM::GPRRegisterClass;
|
|
|
|
|
|
|
|
// Transform the arguments stored in physical registers into virtual ones.
|
2011-01-31 21:38:14 +00:00
|
|
|
unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue ArgValue = DAG.getCopyFromReg(Root, dl, Reg, MVT::i32);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
SDValue ArgValue2;
|
|
|
|
if (NextVA.isMemLoc()) {
|
|
|
|
MachineFrameInfo *MFI = MF.getFrameInfo();
|
2010-07-03 00:40:23 +00:00
|
|
|
int FI = MFI->CreateFixedObject(4, NextVA.getLocMemOffset(), true);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
// Create load node to retrieve arguments from the stack.
|
|
|
|
SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
|
2009-10-31 03:39:36 +00:00
|
|
|
ArgValue2 = DAG.getLoad(MVT::i32, dl, Root, FIN,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getFixedStack(FI),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-06-22 23:27:02 +00:00
|
|
|
} else {
|
2011-01-31 21:38:14 +00:00
|
|
|
Reg = MF.addLiveIn(NextVA.getLocReg(), RC, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
ArgValue2 = DAG.getCopyFromReg(Root, dl, Reg, MVT::i32);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-11-09 00:11:35 +00:00
|
|
|
return DAG.getNode(ARMISD::VMOVDRR, dl, MVT::f64, ArgValue, ArgValue2);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
SDValue
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
ARMTargetLowering::LowerFormalArguments(SDValue Chain,
|
2009-09-02 08:44:58 +00:00
|
|
|
CallingConv::ID CallConv, bool isVarArg,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
const SmallVectorImpl<ISD::InputArg>
|
|
|
|
&Ins,
|
|
|
|
DebugLoc dl, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
SmallVectorImpl<SDValue> &InVals)
|
|
|
|
const {
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
2009-04-17 19:07:39 +00:00
|
|
|
MachineFrameInfo *MFI = MF.getFrameInfo();
|
|
|
|
|
2009-04-07 20:34:09 +00:00
|
|
|
ARMFunctionInfo *AFI = MF.getInfo<ARMFunctionInfo>();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
// Assign locations to all of the incoming arguments.
|
|
|
|
SmallVector<CCValAssign, 16> ArgLocs;
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
CCState CCInfo(CallConv, isVarArg, getTargetMachine(), ArgLocs,
|
|
|
|
*DAG.getContext());
|
|
|
|
CCInfo.AnalyzeFormalArguments(Ins,
|
2009-08-05 19:04:42 +00:00
|
|
|
CCAssignFnForNode(CallConv, /* Return*/ false,
|
|
|
|
isVarArg));
|
2009-04-17 19:07:39 +00:00
|
|
|
|
|
|
|
SmallVector<SDValue, 16> ArgValues;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
|
|
|
|
CCValAssign &VA = ArgLocs[i];
|
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
// Arguments stored in registers.
|
2009-04-17 19:07:39 +00:00
|
|
|
if (VA.isRegLoc()) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT RegVT = VA.getLocVT();
|
2009-04-17 19:07:39 +00:00
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
SDValue ArgValue;
|
|
|
|
if (VA.needsCustom()) {
|
|
|
|
// f64 and vector types are split up into multiple registers or
|
|
|
|
// combinations of registers and stack slots.
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VA.getLocVT() == MVT::v2f64) {
|
2009-06-22 23:27:02 +00:00
|
|
|
SDValue ArgValue1 = GetF64FormalArgument(VA, ArgLocs[++i],
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
Chain, DAG, dl);
|
2009-06-22 23:27:02 +00:00
|
|
|
VA = ArgLocs[++i]; // skip ahead to next loc
|
2010-04-13 22:03:22 +00:00
|
|
|
SDValue ArgValue2;
|
|
|
|
if (VA.isMemLoc()) {
|
2010-07-03 00:40:23 +00:00
|
|
|
int FI = MFI->CreateFixedObject(8, VA.getLocMemOffset(), true);
|
2010-04-13 22:03:22 +00:00
|
|
|
SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
|
|
|
|
ArgValue2 = DAG.getLoad(MVT::f64, dl, Chain, FIN,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getFixedStack(FI),
|
2010-04-13 22:03:22 +00:00
|
|
|
false, false, 0);
|
|
|
|
} else {
|
|
|
|
ArgValue2 = GetF64FormalArgument(VA, ArgLocs[++i],
|
|
|
|
Chain, DAG, dl);
|
|
|
|
}
|
2009-08-11 20:47:22 +00:00
|
|
|
ArgValue = DAG.getNode(ISD::UNDEF, dl, MVT::v2f64);
|
|
|
|
ArgValue = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64,
|
2009-06-22 23:27:02 +00:00
|
|
|
ArgValue, ArgValue1, DAG.getIntPtrConstant(0));
|
2009-08-11 20:47:22 +00:00
|
|
|
ArgValue = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64,
|
2009-06-22 23:27:02 +00:00
|
|
|
ArgValue, ArgValue2, DAG.getIntPtrConstant(1));
|
|
|
|
} else
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
ArgValue = GetF64FormalArgument(VA, ArgLocs[++i], Chain, DAG, dl);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
} else {
|
|
|
|
TargetRegisterClass *RC;
|
2009-08-05 19:04:42 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (RegVT == MVT::f32)
|
2009-06-22 23:27:02 +00:00
|
|
|
RC = ARM::SPRRegisterClass;
|
2009-08-11 20:47:22 +00:00
|
|
|
else if (RegVT == MVT::f64)
|
2009-06-22 23:27:02 +00:00
|
|
|
RC = ARM::DPRRegisterClass;
|
2009-08-11 20:47:22 +00:00
|
|
|
else if (RegVT == MVT::v2f64)
|
2009-08-05 19:04:42 +00:00
|
|
|
RC = ARM::QPRRegisterClass;
|
2009-08-11 20:47:22 +00:00
|
|
|
else if (RegVT == MVT::i32)
|
2009-08-05 20:15:19 +00:00
|
|
|
RC = (AFI->isThumb1OnlyFunction() ?
|
|
|
|
ARM::tGPRRegisterClass : ARM::GPRRegisterClass);
|
2009-06-22 23:27:02 +00:00
|
|
|
else
|
2009-08-05 20:15:19 +00:00
|
|
|
llvm_unreachable("RegVT not supported by FORMAL_ARGUMENTS Lowering");
|
2009-04-17 19:07:39 +00:00
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
// Transform the arguments in physical registers into virtual ones.
|
2011-01-31 21:38:14 +00:00
|
|
|
unsigned Reg = MF.addLiveIn(VA.getLocReg(), RC, dl);
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
ArgValue = DAG.getCopyFromReg(Chain, dl, Reg, RegVT);
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
// If this is an 8 or 16-bit value, it is really passed promoted
|
|
|
|
// to 32 bits. Insert an assert[sz]ext to capture this, then
|
|
|
|
// truncate to the right size.
|
|
|
|
switch (VA.getLocInfo()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Unknown loc info!");
|
2009-04-17 19:07:39 +00:00
|
|
|
case CCValAssign::Full: break;
|
|
|
|
case CCValAssign::BCvt:
|
2010-11-23 03:31:01 +00:00
|
|
|
ArgValue = DAG.getNode(ISD::BITCAST, dl, VA.getValVT(), ArgValue);
|
2009-04-17 19:07:39 +00:00
|
|
|
break;
|
|
|
|
case CCValAssign::SExt:
|
|
|
|
ArgValue = DAG.getNode(ISD::AssertSext, dl, RegVT, ArgValue,
|
|
|
|
DAG.getValueType(VA.getValVT()));
|
|
|
|
ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
|
|
|
|
break;
|
|
|
|
case CCValAssign::ZExt:
|
|
|
|
ArgValue = DAG.getNode(ISD::AssertZext, dl, RegVT, ArgValue,
|
|
|
|
DAG.getValueType(VA.getValVT()));
|
|
|
|
ArgValue = DAG.getNode(ISD::TRUNCATE, dl, VA.getValVT(), ArgValue);
|
|
|
|
break;
|
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
InVals.push_back(ArgValue);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
} else { // VA.isRegLoc()
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
// sanity check
|
|
|
|
assert(VA.isMemLoc());
|
2009-08-11 20:47:22 +00:00
|
|
|
assert(VA.getValVT() != MVT::i64 && "i64 should already be lowered");
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 19:07:39 +00:00
|
|
|
unsigned ArgSize = VA.getLocVT().getSizeInBits()/8;
|
2010-07-03 00:40:23 +00:00
|
|
|
int FI = MFI->CreateFixedObject(ArgSize, VA.getLocMemOffset(), true);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
// Create load nodes to retrieve arguments from the stack.
|
2009-04-17 19:07:39 +00:00
|
|
|
SDValue FIN = DAG.getFrameIndex(FI, getPointerTy());
|
2009-10-31 03:39:36 +00:00
|
|
|
InVals.push_back(DAG.getLoad(VA.getValVT(), dl, Chain, FIN,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getFixedStack(FI),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0));
|
2009-04-17 19:07:39 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// varargs
|
2007-01-19 07:51:42 +00:00
|
|
|
if (isVarArg) {
|
|
|
|
static const unsigned GPRArgRegs[] = {
|
|
|
|
ARM::R0, ARM::R1, ARM::R2, ARM::R3
|
|
|
|
};
|
|
|
|
|
2009-04-17 20:35:10 +00:00
|
|
|
unsigned NumGPRs = CCInfo.getFirstUnallocated
|
|
|
|
(GPRArgRegs, sizeof(GPRArgRegs) / sizeof(GPRArgRegs[0]));
|
2009-04-17 19:07:39 +00:00
|
|
|
|
2011-01-10 12:39:04 +00:00
|
|
|
unsigned Align = MF.getTarget().getFrameLowering()->getStackAlignment();
|
2007-02-23 20:32:57 +00:00
|
|
|
unsigned VARegSize = (4 - NumGPRs) * 4;
|
|
|
|
unsigned VARegSaveSize = (VARegSize + Align - 1) & ~(Align - 1);
|
2009-10-30 14:33:14 +00:00
|
|
|
unsigned ArgOffset = CCInfo.getNextStackOffset();
|
2007-01-19 07:51:42 +00:00
|
|
|
if (VARegSaveSize) {
|
|
|
|
// If this function is vararg, store any remaining integer argument regs
|
|
|
|
// to their spots on the stack so that they may be loaded by deferencing
|
|
|
|
// the result of va_next.
|
|
|
|
AFI->setVarArgsRegSaveSize(VARegSaveSize);
|
2010-04-17 14:41:14 +00:00
|
|
|
AFI->setVarArgsFrameIndex(
|
|
|
|
MFI->CreateFixedObject(VARegSaveSize,
|
|
|
|
ArgOffset + VARegSaveSize - VARegSize,
|
2010-10-15 18:34:47 +00:00
|
|
|
false));
|
2010-04-17 14:41:14 +00:00
|
|
|
SDValue FIN = DAG.getFrameIndex(AFI->getVarArgsFrameIndex(),
|
|
|
|
getPointerTy());
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SmallVector<SDValue, 4> MemOps;
|
2007-01-19 07:51:42 +00:00
|
|
|
for (; NumGPRs < 4; ++NumGPRs) {
|
2009-04-17 19:07:39 +00:00
|
|
|
TargetRegisterClass *RC;
|
2009-07-08 23:10:31 +00:00
|
|
|
if (AFI->isThumb1OnlyFunction())
|
2009-04-17 19:07:39 +00:00
|
|
|
RC = ARM::tGPRRegisterClass;
|
2009-04-07 20:34:09 +00:00
|
|
|
else
|
2009-04-17 19:07:39 +00:00
|
|
|
RC = ARM::GPRRegisterClass;
|
|
|
|
|
2011-01-31 21:38:14 +00:00
|
|
|
unsigned VReg = MF.addLiveIn(GPRArgRegs[NumGPRs], RC, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Val = DAG.getCopyFromReg(Chain, dl, VReg, MVT::i32);
|
2010-04-17 14:41:14 +00:00
|
|
|
SDValue Store =
|
|
|
|
DAG.getStore(Val.getValue(1), dl, Val, FIN,
|
2010-09-21 18:51:21 +00:00
|
|
|
MachinePointerInfo::getFixedStack(AFI->getVarArgsFrameIndex()),
|
|
|
|
false, false, 0);
|
2007-01-19 07:51:42 +00:00
|
|
|
MemOps.push_back(Store);
|
2009-02-04 20:06:27 +00:00
|
|
|
FIN = DAG.getNode(ISD::ADD, dl, getPointerTy(), FIN,
|
2007-01-19 07:51:42 +00:00
|
|
|
DAG.getConstant(4, getPointerTy()));
|
|
|
|
}
|
|
|
|
if (!MemOps.empty())
|
2009-08-11 20:47:22 +00:00
|
|
|
Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
&MemOps[0], MemOps.size());
|
2007-01-19 07:51:42 +00:00
|
|
|
} else
|
|
|
|
// This will point to the next argument passed via stack.
|
2010-07-03 00:40:23 +00:00
|
|
|
AFI->setVarArgsFrameIndex(MFI->CreateFixedObject(4, ArgOffset, true));
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78142 91177308-0d34-0410-b5e6-96231b3b80d8
2009-08-05 01:29:28 +00:00
|
|
|
return Chain;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// isFloatingPointZero - Return true if this is +0.0.
|
2008-07-27 21:46:04 +00:00
|
|
|
static bool isFloatingPointZero(SDValue Op) {
|
2007-01-19 07:51:42 +00:00
|
|
|
if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Op))
|
2007-08-31 04:03:46 +00:00
|
|
|
return CFP->getValueAPF().isPosZero();
|
2008-08-28 21:40:38 +00:00
|
|
|
else if (ISD::isEXTLoad(Op.getNode()) || ISD::isNON_EXTLoad(Op.getNode())) {
|
2007-01-19 07:51:42 +00:00
|
|
|
// Maybe this has already been legalized into the constant pool?
|
|
|
|
if (Op.getOperand(1).getOpcode() == ARMISD::Wrapper) {
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue WrapperOp = Op.getOperand(1).getOperand(0);
|
2007-01-19 07:51:42 +00:00
|
|
|
if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(WrapperOp))
|
2010-04-15 01:51:59 +00:00
|
|
|
if (const ConstantFP *CFP = dyn_cast<ConstantFP>(CP->getConstVal()))
|
2007-08-31 04:03:46 +00:00
|
|
|
return CFP->getValueAPF().isPosZero();
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Returns appropriate ARM CMP (cmp) and corresponding condition code for
|
|
|
|
/// the given operands.
|
2009-11-12 07:13:11 +00:00
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::getARMCmp(SDValue LHS, SDValue RHS, ISD::CondCode CC,
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue &ARMcc, SelectionDAG &DAG,
|
2010-04-17 15:26:15 +00:00
|
|
|
DebugLoc dl) const {
|
2008-08-28 21:40:38 +00:00
|
|
|
if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS.getNode())) {
|
2008-09-12 16:56:44 +00:00
|
|
|
unsigned C = RHSC->getZExtValue();
|
2009-11-12 07:13:11 +00:00
|
|
|
if (!isLegalICmpImmediate(C)) {
|
2007-01-19 07:51:42 +00:00
|
|
|
// Constant does not fit, try adjusting it by one?
|
|
|
|
switch (CC) {
|
|
|
|
default: break;
|
|
|
|
case ISD::SETLT:
|
|
|
|
case ISD::SETGE:
|
2010-08-25 16:58:05 +00:00
|
|
|
if (C != 0x80000000 && isLegalICmpImmediate(C-1)) {
|
2007-02-02 01:53:26 +00:00
|
|
|
CC = (CC == ISD::SETLT) ? ISD::SETLE : ISD::SETGT;
|
2009-08-11 20:47:22 +00:00
|
|
|
RHS = DAG.getConstant(C-1, MVT::i32);
|
2007-02-02 01:53:26 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ISD::SETULT:
|
|
|
|
case ISD::SETUGE:
|
2010-08-25 16:58:05 +00:00
|
|
|
if (C != 0 && isLegalICmpImmediate(C-1)) {
|
2007-02-02 01:53:26 +00:00
|
|
|
CC = (CC == ISD::SETULT) ? ISD::SETULE : ISD::SETUGT;
|
2009-08-11 20:47:22 +00:00
|
|
|
RHS = DAG.getConstant(C-1, MVT::i32);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ISD::SETLE:
|
|
|
|
case ISD::SETGT:
|
2010-08-25 16:58:05 +00:00
|
|
|
if (C != 0x7fffffff && isLegalICmpImmediate(C+1)) {
|
2007-02-02 01:53:26 +00:00
|
|
|
CC = (CC == ISD::SETLE) ? ISD::SETLT : ISD::SETGE;
|
2009-08-11 20:47:22 +00:00
|
|
|
RHS = DAG.getConstant(C+1, MVT::i32);
|
2007-02-02 01:53:26 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ISD::SETULE:
|
|
|
|
case ISD::SETUGT:
|
2010-08-25 16:58:05 +00:00
|
|
|
if (C != 0xffffffff && isLegalICmpImmediate(C+1)) {
|
2007-02-02 01:53:26 +00:00
|
|
|
CC = (CC == ISD::SETULE) ? ISD::SETULT : ISD::SETUGE;
|
2009-08-11 20:47:22 +00:00
|
|
|
RHS = DAG.getConstant(C+1, MVT::i32);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ARMCC::CondCodes CondCode = IntCCToARMCC(CC);
|
2007-04-02 01:30:03 +00:00
|
|
|
ARMISD::NodeType CompareType;
|
|
|
|
switch (CondCode) {
|
|
|
|
default:
|
|
|
|
CompareType = ARMISD::CMP;
|
|
|
|
break;
|
|
|
|
case ARMCC::EQ:
|
|
|
|
case ARMCC::NE:
|
2009-06-29 15:33:01 +00:00
|
|
|
// Uses only Z Flag
|
|
|
|
CompareType = ARMISD::CMPZ;
|
2007-04-02 01:30:03 +00:00
|
|
|
break;
|
|
|
|
}
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMcc = DAG.getConstant(CondCode, MVT::i32);
|
2010-12-21 02:38:05 +00:00
|
|
|
return DAG.getNode(CompareType, dl, MVT::Glue, LHS, RHS);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Returns a appropriate VFP CMP (fcmp{s|d}+fmstat) for the given operands.
|
2010-07-08 02:08:50 +00:00
|
|
|
SDValue
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMTargetLowering::getVFPCmp(SDValue LHS, SDValue RHS, SelectionDAG &DAG,
|
2010-07-08 02:08:50 +00:00
|
|
|
DebugLoc dl) const {
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Cmp;
|
2007-01-19 07:51:42 +00:00
|
|
|
if (!isFloatingPointZero(RHS))
|
2010-12-21 02:38:05 +00:00
|
|
|
Cmp = DAG.getNode(ARMISD::CMPFP, dl, MVT::Glue, LHS, RHS);
|
2007-01-19 07:51:42 +00:00
|
|
|
else
|
2010-12-21 02:38:05 +00:00
|
|
|
Cmp = DAG.getNode(ARMISD::CMPFPw0, dl, MVT::Glue, LHS);
|
|
|
|
return DAG.getNode(ARMISD::FMSTAT, dl, MVT::Glue, Cmp);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
Consider this code snippet:
float t1(int argc) {
return (argc == 1123) ? 1.234f : 2.38213f;
}
We would generate truly awful code on ARM (those with a weak stomach should look
away):
_t1:
movw r1, #1123
movs r2, #1
movs r3, #0
cmp r0, r1
mov.w r0, #0
it eq
moveq r0, r2
movs r1, #4
cmp r0, #0
it ne
movne r3, r1
adr r0, #LCPI1_0
ldr r0, [r0, r3]
bx lr
The problem was that legalization was creating a cascade of SELECT_CC nodes, for
for the comparison of "argc == 1123" which was fed into a SELECT node for the ?:
statement which was itself converted to a SELECT_CC node. This is because the
ARM back-end doesn't have custom lowering for SELECT nodes, so it used the
default "Expand".
I added a fairly simple "LowerSELECT" to the ARM back-end. It takes care of this
testcase, but can obviously be expanded to include more cases.
Now we generate this, which looks optimal to me:
_t1:
movw r1, #1123
movs r2, #0
cmp r0, r1
adr r0, #LCPI0_0
it eq
moveq r2, #4
ldr r0, [r0, r2]
bx lr
.align 2
LCPI0_0:
.long 1075344593 @ float 2.382130e+00
.long 1067316150 @ float 1.234000e+00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@110799 91177308-0d34-0410-b5e6-96231b3b80d8
2010-08-11 08:43:16 +00:00
|
|
|
SDValue ARMTargetLowering::LowerSELECT(SDValue Op, SelectionDAG &DAG) const {
|
|
|
|
SDValue Cond = Op.getOperand(0);
|
|
|
|
SDValue SelectTrue = Op.getOperand(1);
|
|
|
|
SDValue SelectFalse = Op.getOperand(2);
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
|
|
|
// Convert:
|
|
|
|
//
|
|
|
|
// (select (cmov 1, 0, cond), t, f) -> (cmov t, f, cond)
|
|
|
|
// (select (cmov 0, 1, cond), t, f) -> (cmov f, t, cond)
|
|
|
|
//
|
|
|
|
if (Cond.getOpcode() == ARMISD::CMOV && Cond.hasOneUse()) {
|
|
|
|
const ConstantSDNode *CMOVTrue =
|
|
|
|
dyn_cast<ConstantSDNode>(Cond.getOperand(0));
|
|
|
|
const ConstantSDNode *CMOVFalse =
|
|
|
|
dyn_cast<ConstantSDNode>(Cond.getOperand(1));
|
|
|
|
|
|
|
|
if (CMOVTrue && CMOVFalse) {
|
|
|
|
unsigned CMOVTrueVal = CMOVTrue->getZExtValue();
|
|
|
|
unsigned CMOVFalseVal = CMOVFalse->getZExtValue();
|
|
|
|
|
|
|
|
SDValue True;
|
|
|
|
SDValue False;
|
|
|
|
if (CMOVTrueVal == 1 && CMOVFalseVal == 0) {
|
|
|
|
True = SelectTrue;
|
|
|
|
False = SelectFalse;
|
|
|
|
} else if (CMOVTrueVal == 0 && CMOVFalseVal == 1) {
|
|
|
|
True = SelectFalse;
|
|
|
|
False = SelectTrue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (True.getNode() && False.getNode()) {
|
|
|
|
EVT VT = Cond.getValueType();
|
|
|
|
SDValue ARMcc = Cond.getOperand(2);
|
|
|
|
SDValue CCR = Cond.getOperand(3);
|
|
|
|
SDValue Cmp = Cond.getOperand(4);
|
|
|
|
return DAG.getNode(ARMISD::CMOV, dl, VT, True, False, ARMcc, CCR, Cmp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return DAG.getSelectCC(dl, Cond,
|
|
|
|
DAG.getConstant(0, Cond.getValueType()),
|
|
|
|
SelectTrue, SelectFalse, ISD::SETNE);
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerSELECT_CC(SDValue Op, SelectionDAG &DAG) const {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue LHS = Op.getOperand(0);
|
|
|
|
SDValue RHS = Op.getOperand(1);
|
2007-01-19 07:51:42 +00:00
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(4))->get();
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue TrueVal = Op.getOperand(2);
|
|
|
|
SDValue FalseVal = Op.getOperand(3);
|
2009-02-06 21:50:26 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (LHS.getValueType() == MVT::i32) {
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc;
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Cmp = getARMCmp(LHS, RHS, CC, ARMcc, DAG, dl);
|
|
|
|
return DAG.getNode(ARMISD::CMOV, dl, VT, FalseVal, TrueVal, ARMcc, CCR,Cmp);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ARMCC::CondCodes CondCode, CondCode2;
|
2009-09-09 23:14:54 +00:00
|
|
|
FPCCToARMCC(CC, CondCode, CondCode2);
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc = DAG.getConstant(CondCode, MVT::i32);
|
|
|
|
SDValue Cmp = getVFPCmp(LHS, RHS, DAG, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
2009-02-06 21:50:26 +00:00
|
|
|
SDValue Result = DAG.getNode(ARMISD::CMOV, dl, VT, FalseVal, TrueVal,
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMcc, CCR, Cmp);
|
2007-01-19 07:51:42 +00:00
|
|
|
if (CondCode2 != ARMCC::AL) {
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc2 = DAG.getConstant(CondCode2, MVT::i32);
|
2007-01-19 07:51:42 +00:00
|
|
|
// FIXME: Needs another CMP because flag can have but one use.
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Cmp2 = getVFPCmp(LHS, RHS, DAG, dl);
|
2009-03-20 22:42:55 +00:00
|
|
|
Result = DAG.getNode(ARMISD::CMOV, dl, VT,
|
2010-07-13 19:27:42 +00:00
|
|
|
Result, TrueVal, ARMcc2, CCR, Cmp2);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
/// canChangeToInt - Given the fp compare operand, return true if it is suitable
|
|
|
|
/// to morph to an integer compare sequence.
|
|
|
|
static bool canChangeToInt(SDValue Op, bool &SeenZero,
|
|
|
|
const ARMSubtarget *Subtarget) {
|
|
|
|
SDNode *N = Op.getNode();
|
|
|
|
if (!N->hasOneUse())
|
|
|
|
// Otherwise it requires moving the value from fp to integer registers.
|
|
|
|
return false;
|
|
|
|
if (!N->getNumValues())
|
|
|
|
return false;
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
if (VT != MVT::f32 && !Subtarget->isFPBrccSlow())
|
|
|
|
// f32 case is generally profitable. f64 case only makes sense when vcmpe +
|
|
|
|
// vmrs are very slow, e.g. cortex-a8.
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (isFloatingPointZero(Op)) {
|
|
|
|
SeenZero = true;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return ISD::isNormalLoad(N);
|
|
|
|
}
|
|
|
|
|
|
|
|
static SDValue bitcastf32Toi32(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
if (isFloatingPointZero(Op))
|
|
|
|
return DAG.getConstant(0, MVT::i32);
|
|
|
|
|
|
|
|
if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Op))
|
|
|
|
return DAG.getLoad(MVT::i32, Op.getDebugLoc(),
|
2010-09-21 06:44:06 +00:00
|
|
|
Ld->getChain(), Ld->getBasePtr(), Ld->getPointerInfo(),
|
2010-07-13 19:27:42 +00:00
|
|
|
Ld->isVolatile(), Ld->isNonTemporal(),
|
|
|
|
Ld->getAlignment());
|
|
|
|
|
|
|
|
llvm_unreachable("Unknown VFP cmp argument!");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void expandf64Toi32(SDValue Op, SelectionDAG &DAG,
|
|
|
|
SDValue &RetVal1, SDValue &RetVal2) {
|
|
|
|
if (isFloatingPointZero(Op)) {
|
|
|
|
RetVal1 = DAG.getConstant(0, MVT::i32);
|
|
|
|
RetVal2 = DAG.getConstant(0, MVT::i32);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Op)) {
|
|
|
|
SDValue Ptr = Ld->getBasePtr();
|
|
|
|
RetVal1 = DAG.getLoad(MVT::i32, Op.getDebugLoc(),
|
|
|
|
Ld->getChain(), Ptr,
|
2010-09-21 06:44:06 +00:00
|
|
|
Ld->getPointerInfo(),
|
2010-07-13 19:27:42 +00:00
|
|
|
Ld->isVolatile(), Ld->isNonTemporal(),
|
|
|
|
Ld->getAlignment());
|
|
|
|
|
|
|
|
EVT PtrType = Ptr.getValueType();
|
|
|
|
unsigned NewAlign = MinAlign(Ld->getAlignment(), 4);
|
|
|
|
SDValue NewPtr = DAG.getNode(ISD::ADD, Op.getDebugLoc(),
|
|
|
|
PtrType, Ptr, DAG.getConstant(4, PtrType));
|
|
|
|
RetVal2 = DAG.getLoad(MVT::i32, Op.getDebugLoc(),
|
|
|
|
Ld->getChain(), NewPtr,
|
2010-09-21 06:44:06 +00:00
|
|
|
Ld->getPointerInfo().getWithOffset(4),
|
2010-07-13 19:27:42 +00:00
|
|
|
Ld->isVolatile(), Ld->isNonTemporal(),
|
|
|
|
NewAlign);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
llvm_unreachable("Unknown VFP cmp argument!");
|
|
|
|
}
|
|
|
|
|
|
|
|
/// OptimizeVFPBrcond - With -enable-unsafe-fp-math, it's legal to optimize some
|
|
|
|
/// f32 and even f64 comparisons to integer ones.
|
|
|
|
SDValue
|
|
|
|
ARMTargetLowering::OptimizeVFPBrcond(SDValue Op, SelectionDAG &DAG) const {
|
|
|
|
SDValue Chain = Op.getOperand(0);
|
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(1))->get();
|
|
|
|
SDValue LHS = Op.getOperand(2);
|
|
|
|
SDValue RHS = Op.getOperand(3);
|
|
|
|
SDValue Dest = Op.getOperand(4);
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
|
|
|
bool SeenZero = false;
|
|
|
|
if (canChangeToInt(LHS, SeenZero, Subtarget) &&
|
|
|
|
canChangeToInt(RHS, SeenZero, Subtarget) &&
|
2010-07-15 22:07:12 +00:00
|
|
|
// If one of the operand is zero, it's safe to ignore the NaN case since
|
|
|
|
// we only care about equality comparisons.
|
|
|
|
(SeenZero || (DAG.isKnownNeverNaN(LHS) && DAG.isKnownNeverNaN(RHS)))) {
|
2010-07-13 19:27:42 +00:00
|
|
|
// If unsafe fp math optimization is enabled and there are no othter uses of
|
|
|
|
// the CMP operands, and the condition code is EQ oe NE, we can optimize it
|
|
|
|
// to an integer comparison.
|
|
|
|
if (CC == ISD::SETOEQ)
|
|
|
|
CC = ISD::SETEQ;
|
|
|
|
else if (CC == ISD::SETUNE)
|
|
|
|
CC = ISD::SETNE;
|
|
|
|
|
|
|
|
SDValue ARMcc;
|
|
|
|
if (LHS.getValueType() == MVT::f32) {
|
|
|
|
LHS = bitcastf32Toi32(LHS, DAG);
|
|
|
|
RHS = bitcastf32Toi32(RHS, DAG);
|
|
|
|
SDValue Cmp = getARMCmp(LHS, RHS, CC, ARMcc, DAG, dl);
|
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
|
|
|
return DAG.getNode(ARMISD::BRCOND, dl, MVT::Other,
|
|
|
|
Chain, Dest, ARMcc, CCR, Cmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue LHS1, LHS2;
|
|
|
|
SDValue RHS1, RHS2;
|
|
|
|
expandf64Toi32(LHS, DAG, LHS1, LHS2);
|
|
|
|
expandf64Toi32(RHS, DAG, RHS1, RHS2);
|
|
|
|
ARMCC::CondCodes CondCode = IntCCToARMCC(CC);
|
|
|
|
ARMcc = DAG.getConstant(CondCode, MVT::i32);
|
2010-12-21 02:38:05 +00:00
|
|
|
SDVTList VTList = DAG.getVTList(MVT::Other, MVT::Glue);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Ops[] = { Chain, ARMcc, LHS1, LHS2, RHS1, RHS2, Dest };
|
|
|
|
return DAG.getNode(ARMISD::BCC_i64, dl, VTList, Ops, 7);
|
|
|
|
}
|
|
|
|
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerBR_CC(SDValue Op, SelectionDAG &DAG) const {
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Chain = Op.getOperand(0);
|
2007-01-19 07:51:42 +00:00
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(Op.getOperand(1))->get();
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue LHS = Op.getOperand(2);
|
|
|
|
SDValue RHS = Op.getOperand(3);
|
|
|
|
SDValue Dest = Op.getOperand(4);
|
2009-02-06 21:50:26 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (LHS.getValueType() == MVT::i32) {
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc;
|
|
|
|
SDValue Cmp = getARMCmp(LHS, RHS, CC, ARMcc, DAG, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
|
|
|
return DAG.getNode(ARMISD::BRCOND, dl, MVT::Other,
|
2010-07-13 19:27:42 +00:00
|
|
|
Chain, Dest, ARMcc, CCR, Cmp);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
assert(LHS.getValueType() == MVT::f32 || LHS.getValueType() == MVT::f64);
|
2010-07-13 19:27:42 +00:00
|
|
|
|
|
|
|
if (UnsafeFPMath &&
|
|
|
|
(CC == ISD::SETEQ || CC == ISD::SETOEQ ||
|
|
|
|
CC == ISD::SETNE || CC == ISD::SETUNE)) {
|
|
|
|
SDValue Result = OptimizeVFPBrcond(Op, DAG);
|
|
|
|
if (Result.getNode())
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
ARMCC::CondCodes CondCode, CondCode2;
|
2009-09-09 23:14:54 +00:00
|
|
|
FPCCToARMCC(CC, CondCode, CondCode2);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc = DAG.getConstant(CondCode, MVT::i32);
|
|
|
|
SDValue Cmp = getVFPCmp(LHS, RHS, DAG, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
2010-12-21 02:38:05 +00:00
|
|
|
SDVTList VTList = DAG.getVTList(MVT::Other, MVT::Glue);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Ops[] = { Chain, Dest, ARMcc, CCR, Cmp };
|
2009-02-06 21:50:26 +00:00
|
|
|
SDValue Res = DAG.getNode(ARMISD::BRCOND, dl, VTList, Ops, 5);
|
2007-01-19 07:51:42 +00:00
|
|
|
if (CondCode2 != ARMCC::AL) {
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMcc = DAG.getConstant(CondCode2, MVT::i32);
|
|
|
|
SDValue Ops[] = { Res, Dest, ARMcc, CCR, Res.getValue(1) };
|
2009-02-06 21:50:26 +00:00
|
|
|
Res = DAG.getNode(ARMISD::BRCOND, dl, VTList, Ops, 5);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
return Res;
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerBR_JT(SDValue Op, SelectionDAG &DAG) const {
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Chain = Op.getOperand(0);
|
|
|
|
SDValue Table = Op.getOperand(1);
|
|
|
|
SDValue Index = Op.getOperand(2);
|
2009-02-04 20:06:27 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2007-01-19 07:51:42 +00:00
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT PTy = getPointerTy();
|
2007-01-19 07:51:42 +00:00
|
|
|
JumpTableSDNode *JT = cast<JumpTableSDNode>(Table);
|
|
|
|
ARMFunctionInfo *AFI = DAG.getMachineFunction().getInfo<ARMFunctionInfo>();
|
2009-07-14 18:44:34 +00:00
|
|
|
SDValue UId = DAG.getConstant(AFI->createJumpTableUId(), PTy);
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue JTI = DAG.getTargetJumpTable(JT->getIndex(), PTy);
|
2009-08-11 20:47:22 +00:00
|
|
|
Table = DAG.getNode(ARMISD::WrapperJT, dl, MVT::i32, JTI, UId);
|
2009-07-28 20:53:24 +00:00
|
|
|
Index = DAG.getNode(ISD::MUL, dl, PTy, Index, DAG.getConstant(4, PTy));
|
|
|
|
SDValue Addr = DAG.getNode(ISD::ADD, dl, PTy, Index, Table);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
if (Subtarget->isThumb2()) {
|
|
|
|
// Thumb2 uses a two-level jump. That is, it jumps into the jump table
|
|
|
|
// which does another jump to the destination. This also makes it easier
|
|
|
|
// to translate it to TBB / TBH later.
|
|
|
|
// FIXME: This might not work if the function is extremely large.
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(ARMISD::BR2_JT, dl, MVT::Other, Chain,
|
2009-07-29 02:18:14 +00:00
|
|
|
Addr, Op.getOperand(2), JTI, UId);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
}
|
|
|
|
if (getTargetMachine().getRelocationModel() == Reloc::PIC_) {
|
2009-10-31 03:39:36 +00:00
|
|
|
Addr = DAG.getLoad((EVT)MVT::i32, dl, Chain, Addr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getJumpTable(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
Chain = Addr.getValue(1);
|
2009-02-04 20:06:27 +00:00
|
|
|
Addr = DAG.getNode(ISD::ADD, dl, PTy, Addr, Table);
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(ARMISD::BR_JT, dl, MVT::Other, Chain, Addr, JTI, UId);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
} else {
|
2009-10-31 03:39:36 +00:00
|
|
|
Addr = DAG.getLoad(PTy, dl, Chain, Addr,
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo::getJumpTable(), false, false, 0);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
Chain = Addr.getValue(1);
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(ARMISD::BR_JT, dl, MVT::Other, Chain, Addr, JTI, UId);
|
Change Thumb2 jumptable codegen to one that uses two level jumps:
Before:
adr r12, #LJTI3_0_0
ldr pc, [r12, +r0, lsl #2]
LJTI3_0_0:
.long LBB3_24
.long LBB3_30
.long LBB3_31
.long LBB3_32
After:
adr r12, #LJTI3_0_0
add pc, r12, +r0, lsl #2
LJTI3_0_0:
b.w LBB3_24
b.w LBB3_30
b.w LBB3_31
b.w LBB3_32
This has several advantages.
1. This will make it easier to optimize this to a TBB / TBH instruction +
(smaller) table.
2. This eliminate the need for ugly asm printer hack to force the address
into thumb addresses (bit 0 is one).
3. Same codegen for pic and non-pic.
4. This eliminate the need to align the table so constantpool island pass
won't have to over-estimate the size.
Based on my calculation, the later is probably slightly faster as well since
ldr pc with shifter address is very slow. That is, it should be a win as long
as the HW implementation can do a reasonable job of branch predict the second
branch.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77024 91177308-0d34-0410-b5e6-96231b3b80d8
2009-07-25 00:33:29 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-03-19 22:51:32 +00:00
|
|
|
static SDValue LowerFP_TO_INT(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
unsigned Opc;
|
|
|
|
|
|
|
|
switch (Op.getOpcode()) {
|
|
|
|
default:
|
|
|
|
assert(0 && "Invalid opcode!");
|
|
|
|
case ISD::FP_TO_SINT:
|
|
|
|
Opc = ARMISD::FTOSI;
|
|
|
|
break;
|
|
|
|
case ISD::FP_TO_UINT:
|
|
|
|
Opc = ARMISD::FTOUI;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
Op = DAG.getNode(Opc, dl, MVT::f32, Op.getOperand(0));
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, MVT::i32, Op);
|
2010-03-19 22:51:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SDValue LowerINT_TO_FP(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
unsigned Opc;
|
|
|
|
|
|
|
|
switch (Op.getOpcode()) {
|
|
|
|
default:
|
|
|
|
assert(0 && "Invalid opcode!");
|
|
|
|
case ISD::SINT_TO_FP:
|
|
|
|
Opc = ARMISD::SITOF;
|
|
|
|
break;
|
|
|
|
case ISD::UINT_TO_FP:
|
|
|
|
Opc = ARMISD::UITOF;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2010-11-23 03:31:01 +00:00
|
|
|
Op = DAG.getNode(ISD::BITCAST, dl, MVT::f32, Op.getOperand(0));
|
2010-03-19 22:51:32 +00:00
|
|
|
return DAG.getNode(Opc, dl, VT, Op);
|
|
|
|
}
|
|
|
|
|
2010-07-08 02:08:50 +00:00
|
|
|
SDValue ARMTargetLowering::LowerFCOPYSIGN(SDValue Op, SelectionDAG &DAG) const {
|
2007-01-19 07:51:42 +00:00
|
|
|
// Implement fcopysign with a fabs and a conditional fneg.
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Tmp0 = Op.getOperand(0);
|
|
|
|
SDValue Tmp1 = Op.getOperand(1);
|
2009-02-06 21:50:26 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
EVT SrcVT = Tmp1.getValueType();
|
2009-02-06 21:50:26 +00:00
|
|
|
SDValue AbsVal = DAG.getNode(ISD::FABS, dl, VT, Tmp0);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc = DAG.getConstant(ARMCC::LT, MVT::i32);
|
2010-07-08 02:08:50 +00:00
|
|
|
SDValue FP0 = DAG.getConstantFP(0.0, SrcVT);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Cmp = getVFPCmp(Tmp1, FP0, DAG, dl);
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
2010-07-13 19:27:42 +00:00
|
|
|
return DAG.getNode(ARMISD::CNEG, dl, VT, AbsVal, AbsVal, ARMcc, CCR, Cmp);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-05-22 01:47:14 +00:00
|
|
|
SDValue ARMTargetLowering::LowerRETURNADDR(SDValue Op, SelectionDAG &DAG) const{
|
|
|
|
MachineFunction &MF = DAG.getMachineFunction();
|
|
|
|
MachineFrameInfo *MFI = MF.getFrameInfo();
|
|
|
|
MFI->setReturnAddressIsTaken(true);
|
|
|
|
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
|
|
|
if (Depth) {
|
|
|
|
SDValue FrameAddr = LowerFRAMEADDR(Op, DAG);
|
|
|
|
SDValue Offset = DAG.getConstant(4, MVT::i32);
|
|
|
|
return DAG.getLoad(VT, dl, DAG.getEntryNode(),
|
|
|
|
DAG.getNode(ISD::ADD, dl, VT, FrameAddr, Offset),
|
2010-09-21 06:44:06 +00:00
|
|
|
MachinePointerInfo(), false, false, 0);
|
2010-05-22 01:47:14 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Return LR, which contains the return address. Mark it an implicit live-in.
|
2011-01-31 21:38:14 +00:00
|
|
|
unsigned Reg = MF.addLiveIn(ARM::LR, getRegClassFor(MVT::i32), dl);
|
2010-05-22 01:47:14 +00:00
|
|
|
return DAG.getCopyFromReg(DAG.getEntryNode(), dl, Reg, VT);
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerFRAMEADDR(SDValue Op, SelectionDAG &DAG) const {
|
2009-05-12 23:59:14 +00:00
|
|
|
MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
|
|
|
|
MFI->setFrameAddressIsTaken(true);
|
2010-05-22 01:47:14 +00:00
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2009-05-12 23:59:14 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc(); // FIXME probably not meaningful
|
|
|
|
unsigned Depth = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
2009-06-18 23:14:30 +00:00
|
|
|
unsigned FrameReg = (Subtarget->isThumb() || Subtarget->isTargetDarwin())
|
2009-05-12 23:59:14 +00:00
|
|
|
? ARM::R7 : ARM::R11;
|
|
|
|
SDValue FrameAddr = DAG.getCopyFromReg(DAG.getEntryNode(), dl, FrameReg, VT);
|
|
|
|
while (Depth--)
|
2010-09-21 06:44:06 +00:00
|
|
|
FrameAddr = DAG.getLoad(VT, dl, DAG.getEntryNode(), FrameAddr,
|
|
|
|
MachinePointerInfo(),
|
2010-02-15 16:55:24 +00:00
|
|
|
false, false, 0);
|
2009-05-12 23:59:14 +00:00
|
|
|
return FrameAddr;
|
|
|
|
}
|
|
|
|
|
2010-11-23 03:31:01 +00:00
|
|
|
/// ExpandBITCAST - If the target supports VFP, this function is called to
|
2010-04-17 05:30:19 +00:00
|
|
|
/// expand a bit convert where either the source or destination type is i64 to
|
|
|
|
/// use a VMOVDRR or VMOVRRD node. This should not be done when the non-i64
|
|
|
|
/// operand type is illegal (e.g., v2f32 for a target that doesn't support
|
|
|
|
/// vectors), since the legalizer won't know what to do with that.
|
2010-11-23 03:31:01 +00:00
|
|
|
static SDValue ExpandBITCAST(SDNode *N, SelectionDAG &DAG) {
|
2010-04-17 05:30:19 +00:00
|
|
|
const TargetLowering &TLI = DAG.getTargetLoweringInfo();
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Op = N->getOperand(0);
|
2010-04-14 20:45:23 +00:00
|
|
|
|
2010-04-17 05:30:19 +00:00
|
|
|
// This function is only supposed to be called for i64 types, either as the
|
|
|
|
// source or destination of the bit convert.
|
|
|
|
EVT SrcVT = Op.getValueType();
|
|
|
|
EVT DstVT = N->getValueType(0);
|
|
|
|
assert((SrcVT == MVT::i64 || DstVT == MVT::i64) &&
|
2010-11-23 03:31:01 +00:00
|
|
|
"ExpandBITCAST called for non-i64 type");
|
2010-04-14 20:45:23 +00:00
|
|
|
|
2010-04-17 05:30:19 +00:00
|
|
|
// Turn i64->f64 into VMOVDRR.
|
|
|
|
if (SrcVT == MVT::i64 && TLI.isTypeLegal(DstVT)) {
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Op,
|
|
|
|
DAG.getConstant(0, MVT::i32));
|
|
|
|
SDValue Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, Op,
|
|
|
|
DAG.getConstant(1, MVT::i32));
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, DstVT,
|
2010-06-11 22:45:25 +00:00
|
|
|
DAG.getNode(ARMISD::VMOVDRR, dl, MVT::f64, Lo, Hi));
|
2008-11-04 19:57:48 +00:00
|
|
|
}
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-11-09 00:11:35 +00:00
|
|
|
// Turn f64->i64 into VMOVRRD.
|
2010-04-17 05:30:19 +00:00
|
|
|
if (DstVT == MVT::i64 && TLI.isTypeLegal(SrcVT)) {
|
|
|
|
SDValue Cvt = DAG.getNode(ARMISD::VMOVRRD, dl,
|
|
|
|
DAG.getVTList(MVT::i32, MVT::i32), &Op, 1);
|
|
|
|
// Merge the pieces into a single i64 value.
|
|
|
|
return DAG.getNode(ISD::BUILD_PAIR, dl, MVT::i64, Cvt, Cvt.getValue(1));
|
|
|
|
}
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2010-04-17 05:30:19 +00:00
|
|
|
return SDValue();
|
2007-11-24 07:07:01 +00:00
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
/// getZeroVector - Returns a vector of specified type with all zero elements.
|
2010-07-13 21:16:48 +00:00
|
|
|
/// Zero vectors are used to represent vector negation and in those cases
|
|
|
|
/// will be implemented with the NEON VNEG instruction. However, VNEG does
|
|
|
|
/// not support i64 elements, so sometimes the zero vectors will need to be
|
|
|
|
/// explicitly constructed. Regardless, use a canonical VMOV to create the
|
|
|
|
/// zero vector.
|
2009-08-10 22:56:29 +00:00
|
|
|
static SDValue getZeroVector(EVT VT, SelectionDAG &DAG, DebugLoc dl) {
|
2009-06-22 23:27:02 +00:00
|
|
|
assert(VT.isVector() && "Expected a vector type");
|
2010-07-13 21:16:48 +00:00
|
|
|
// The canonical modified immediate encoding of a zero vector is....0!
|
|
|
|
SDValue EncodedVal = DAG.getTargetConstant(0, MVT::i32);
|
|
|
|
EVT VmovVT = VT.is128BitVector() ? MVT::v4i32 : MVT::v2i32;
|
|
|
|
SDValue Vmov = DAG.getNode(ARMISD::VMOVIMM, dl, VmovVT, EncodedVal);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Vmov);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-10-31 21:00:56 +00:00
|
|
|
/// LowerShiftRightParts - Lower SRA_PARTS, which returns two
|
|
|
|
/// i32 values and take a 2 x i32 value to shift plus a shift amount.
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerShiftRightParts(SDValue Op,
|
|
|
|
SelectionDAG &DAG) const {
|
2009-10-31 21:00:56 +00:00
|
|
|
assert(Op.getNumOperands() == 3 && "Not a double-shift!");
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
unsigned VTBits = VT.getSizeInBits();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
SDValue ShOpLo = Op.getOperand(0);
|
|
|
|
SDValue ShOpHi = Op.getOperand(1);
|
|
|
|
SDValue ShAmt = Op.getOperand(2);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc;
|
2009-10-31 21:42:19 +00:00
|
|
|
unsigned Opc = (Op.getOpcode() == ISD::SRA_PARTS) ? ISD::SRA : ISD::SRL;
|
|
|
|
|
|
|
|
assert(Op.getOpcode() == ISD::SRA_PARTS || Op.getOpcode() == ISD::SRL_PARTS);
|
2009-10-31 21:00:56 +00:00
|
|
|
|
|
|
|
SDValue RevShAmt = DAG.getNode(ISD::SUB, dl, MVT::i32,
|
|
|
|
DAG.getConstant(VTBits, MVT::i32), ShAmt);
|
|
|
|
SDValue Tmp1 = DAG.getNode(ISD::SRL, dl, VT, ShOpLo, ShAmt);
|
|
|
|
SDValue ExtraShAmt = DAG.getNode(ISD::SUB, dl, MVT::i32, ShAmt,
|
|
|
|
DAG.getConstant(VTBits, MVT::i32));
|
|
|
|
SDValue Tmp2 = DAG.getNode(ISD::SHL, dl, VT, ShOpHi, RevShAmt);
|
|
|
|
SDValue FalseVal = DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
|
2009-10-31 21:42:19 +00:00
|
|
|
SDValue TrueVal = DAG.getNode(Opc, dl, VT, ShOpHi, ExtraShAmt);
|
2009-10-31 21:00:56 +00:00
|
|
|
|
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
|
|
|
SDValue Cmp = getARMCmp(ExtraShAmt, DAG.getConstant(0, MVT::i32), ISD::SETGE,
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMcc, DAG, dl);
|
2009-10-31 21:42:19 +00:00
|
|
|
SDValue Hi = DAG.getNode(Opc, dl, VT, ShOpHi, ShAmt);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Lo = DAG.getNode(ARMISD::CMOV, dl, VT, FalseVal, TrueVal, ARMcc,
|
2009-10-31 21:00:56 +00:00
|
|
|
CCR, Cmp);
|
|
|
|
|
|
|
|
SDValue Ops[2] = { Lo, Hi };
|
|
|
|
return DAG.getMergeValues(Ops, 2, dl);
|
|
|
|
}
|
|
|
|
|
2009-10-31 19:38:01 +00:00
|
|
|
/// LowerShiftLeftParts - Lower SHL_PARTS, which returns two
|
|
|
|
/// i32 values and take a 2 x i32 value to shift plus a shift amount.
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerShiftLeftParts(SDValue Op,
|
|
|
|
SelectionDAG &DAG) const {
|
2009-10-31 19:38:01 +00:00
|
|
|
assert(Op.getNumOperands() == 3 && "Not a double-shift!");
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
unsigned VTBits = VT.getSizeInBits();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
SDValue ShOpLo = Op.getOperand(0);
|
|
|
|
SDValue ShOpHi = Op.getOperand(1);
|
|
|
|
SDValue ShAmt = Op.getOperand(2);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue ARMcc;
|
2009-10-31 19:38:01 +00:00
|
|
|
|
|
|
|
assert(Op.getOpcode() == ISD::SHL_PARTS);
|
|
|
|
SDValue RevShAmt = DAG.getNode(ISD::SUB, dl, MVT::i32,
|
|
|
|
DAG.getConstant(VTBits, MVT::i32), ShAmt);
|
|
|
|
SDValue Tmp1 = DAG.getNode(ISD::SRL, dl, VT, ShOpLo, RevShAmt);
|
|
|
|
SDValue ExtraShAmt = DAG.getNode(ISD::SUB, dl, MVT::i32, ShAmt,
|
|
|
|
DAG.getConstant(VTBits, MVT::i32));
|
|
|
|
SDValue Tmp2 = DAG.getNode(ISD::SHL, dl, VT, ShOpHi, ShAmt);
|
|
|
|
SDValue Tmp3 = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, ExtraShAmt);
|
|
|
|
|
|
|
|
SDValue FalseVal = DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
|
|
|
|
SDValue CCR = DAG.getRegister(ARM::CPSR, MVT::i32);
|
|
|
|
SDValue Cmp = getARMCmp(ExtraShAmt, DAG.getConstant(0, MVT::i32), ISD::SETGE,
|
2010-07-13 19:27:42 +00:00
|
|
|
ARMcc, DAG, dl);
|
2009-10-31 19:38:01 +00:00
|
|
|
SDValue Lo = DAG.getNode(ISD::SHL, dl, VT, ShOpLo, ShAmt);
|
2010-07-13 19:27:42 +00:00
|
|
|
SDValue Hi = DAG.getNode(ARMISD::CMOV, dl, VT, FalseVal, Tmp3, ARMcc,
|
2009-10-31 19:38:01 +00:00
|
|
|
CCR, Cmp);
|
|
|
|
|
|
|
|
SDValue Ops[2] = { Lo, Hi };
|
|
|
|
return DAG.getMergeValues(Ops, 2, dl);
|
|
|
|
}
|
|
|
|
|
2010-09-08 03:54:02 +00:00
|
|
|
SDValue ARMTargetLowering::LowerFLT_ROUNDS_(SDValue Op,
|
2010-08-03 21:31:55 +00:00
|
|
|
SelectionDAG &DAG) const {
|
|
|
|
// The rounding mode is in bits 23:22 of the FPSCR.
|
|
|
|
// The ARM rounding mode value to FLT_ROUNDS mapping is 0->1, 1->2, 2->3, 3->0
|
|
|
|
// The formula we use to implement this is (((FPSCR + 1 << 22) >> 22) & 3)
|
|
|
|
// so that the shift + and get folded into a bitfield extract.
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
SDValue FPSCR = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, MVT::i32,
|
|
|
|
DAG.getConstant(Intrinsic::arm_get_fpscr,
|
|
|
|
MVT::i32));
|
2010-09-08 03:54:02 +00:00
|
|
|
SDValue FltRounds = DAG.getNode(ISD::ADD, dl, MVT::i32, FPSCR,
|
2010-08-03 21:31:55 +00:00
|
|
|
DAG.getConstant(1U << 22, MVT::i32));
|
|
|
|
SDValue RMODE = DAG.getNode(ISD::SRL, dl, MVT::i32, FltRounds,
|
|
|
|
DAG.getConstant(22, MVT::i32));
|
2010-09-08 03:54:02 +00:00
|
|
|
return DAG.getNode(ISD::AND, dl, MVT::i32, RMODE,
|
2010-08-03 21:31:55 +00:00
|
|
|
DAG.getConstant(3, MVT::i32));
|
|
|
|
}
|
|
|
|
|
2010-01-18 19:58:49 +00:00
|
|
|
static SDValue LowerCTTZ(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
|
|
|
|
if (!ST->hasV6T2Ops())
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue rbit = DAG.getNode(ARMISD::RBIT, dl, VT, N->getOperand(0));
|
|
|
|
return DAG.getNode(ISD::CTLZ, dl, VT, rbit);
|
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
static SDValue LowerShift(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
2009-06-22 23:27:02 +00:00
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
|
2010-11-18 21:16:28 +00:00
|
|
|
if (!VT.isVector())
|
|
|
|
return SDValue();
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
// Lower vector shifts on NEON to use VSHL.
|
2010-11-18 21:16:28 +00:00
|
|
|
assert(ST->hasNEON() && "unexpected vector shift");
|
|
|
|
|
|
|
|
// Left shifts translate directly to the vshiftu intrinsic.
|
|
|
|
if (N->getOpcode() == ISD::SHL)
|
2009-06-22 23:27:02 +00:00
|
|
|
return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, VT,
|
2010-11-18 21:16:28 +00:00
|
|
|
DAG.getConstant(Intrinsic::arm_neon_vshiftu, MVT::i32),
|
|
|
|
N->getOperand(0), N->getOperand(1));
|
|
|
|
|
|
|
|
assert((N->getOpcode() == ISD::SRA ||
|
|
|
|
N->getOpcode() == ISD::SRL) && "unexpected vector shift opcode");
|
|
|
|
|
|
|
|
// NEON uses the same intrinsics for both left and right shifts. For
|
|
|
|
// right shifts, the shift amounts are negative, so negate the vector of
|
|
|
|
// shift amounts.
|
|
|
|
EVT ShiftVT = N->getOperand(1).getValueType();
|
|
|
|
SDValue NegatedCount = DAG.getNode(ISD::SUB, dl, ShiftVT,
|
|
|
|
getZeroVector(ShiftVT, DAG, dl),
|
|
|
|
N->getOperand(1));
|
|
|
|
Intrinsic::ID vshiftInt = (N->getOpcode() == ISD::SRA ?
|
|
|
|
Intrinsic::arm_neon_vshifts :
|
|
|
|
Intrinsic::arm_neon_vshiftu);
|
|
|
|
return DAG.getNode(ISD::INTRINSIC_WO_CHAIN, dl, VT,
|
|
|
|
DAG.getConstant(vshiftInt, MVT::i32),
|
|
|
|
N->getOperand(0), NegatedCount);
|
|
|
|
}
|
|
|
|
|
|
|
|
static SDValue Expand64BitShift(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2009-08-22 03:13:10 +00:00
|
|
|
// We can get here for a node like i32 = ISD::SHL i32, i64
|
|
|
|
if (VT != MVT::i64)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
assert((N->getOpcode() == ISD::SRL || N->getOpcode() == ISD::SRA) &&
|
2007-11-24 07:07:01 +00:00
|
|
|
"Unknown shift to lower!");
|
2008-12-01 11:39:25 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// We only lower SRA, SRL of 1 here, all others use generic lowering.
|
|
|
|
if (!isa<ConstantSDNode>(N->getOperand(1)) ||
|
2008-09-12 16:56:44 +00:00
|
|
|
cast<ConstantSDNode>(N->getOperand(1))->getZExtValue() != 1)
|
2008-12-01 11:39:25 +00:00
|
|
|
return SDValue();
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// If we are in thumb mode, we don't have RRX.
|
2009-07-08 23:10:31 +00:00
|
|
|
if (ST->isThumb1Only()) return SDValue();
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// Okay, we have a 64-bit SRA or SRL of 1. Lower this to an RRX expr.
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Lo = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, N->getOperand(0),
|
2010-05-25 03:36:52 +00:00
|
|
|
DAG.getConstant(0, MVT::i32));
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Hi = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, N->getOperand(0),
|
2010-05-25 03:36:52 +00:00
|
|
|
DAG.getConstant(1, MVT::i32));
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// First, build a SRA_FLAG/SRL_FLAG op, which shifts the top part by one and
|
|
|
|
// captures the result into a carry flag.
|
|
|
|
unsigned Opc = N->getOpcode() == ISD::SRL ? ARMISD::SRL_FLAG:ARMISD::SRA_FLAG;
|
2010-12-21 02:38:05 +00:00
|
|
|
Hi = DAG.getNode(Opc, dl, DAG.getVTList(MVT::i32, MVT::Glue), &Hi, 1);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// The low part is an ARMISD::RRX operand, which shifts the carry in.
|
2009-08-11 20:47:22 +00:00
|
|
|
Lo = DAG.getNode(ARMISD::RRX, dl, MVT::i32, Lo, Hi.getValue(1));
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-11-24 07:07:01 +00:00
|
|
|
// Merge the pieces into a single i64 value.
|
2009-08-11 20:47:22 +00:00
|
|
|
return DAG.getNode(ISD::BUILD_PAIR, dl, MVT::i64, Lo, Hi);
|
2007-11-24 07:07:01 +00:00
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
static SDValue LowerVSETCC(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
SDValue TmpOp0, TmpOp1;
|
|
|
|
bool Invert = false;
|
|
|
|
bool Swap = false;
|
|
|
|
unsigned Opc = 0;
|
|
|
|
|
|
|
|
SDValue Op0 = Op.getOperand(0);
|
|
|
|
SDValue Op1 = Op.getOperand(1);
|
|
|
|
SDValue CC = Op.getOperand(2);
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2009-06-22 23:27:02 +00:00
|
|
|
ISD::CondCode SetCCOpcode = cast<CondCodeSDNode>(CC)->get();
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
|
|
|
|
if (Op.getOperand(1).getValueType().isFloatingPoint()) {
|
|
|
|
switch (SetCCOpcode) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Illegal FP comparison"); break;
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SETUNE:
|
|
|
|
case ISD::SETNE: Invert = true; // Fallthrough
|
|
|
|
case ISD::SETOEQ:
|
|
|
|
case ISD::SETEQ: Opc = ARMISD::VCEQ; break;
|
|
|
|
case ISD::SETOLT:
|
|
|
|
case ISD::SETLT: Swap = true; // Fallthrough
|
|
|
|
case ISD::SETOGT:
|
|
|
|
case ISD::SETGT: Opc = ARMISD::VCGT; break;
|
|
|
|
case ISD::SETOLE:
|
|
|
|
case ISD::SETLE: Swap = true; // Fallthrough
|
|
|
|
case ISD::SETOGE:
|
|
|
|
case ISD::SETGE: Opc = ARMISD::VCGE; break;
|
|
|
|
case ISD::SETUGE: Swap = true; // Fallthrough
|
|
|
|
case ISD::SETULE: Invert = true; Opc = ARMISD::VCGT; break;
|
|
|
|
case ISD::SETUGT: Swap = true; // Fallthrough
|
|
|
|
case ISD::SETULT: Invert = true; Opc = ARMISD::VCGE; break;
|
|
|
|
case ISD::SETUEQ: Invert = true; // Fallthrough
|
|
|
|
case ISD::SETONE:
|
|
|
|
// Expand this to (OLT | OGT).
|
|
|
|
TmpOp0 = Op0;
|
|
|
|
TmpOp1 = Op1;
|
|
|
|
Opc = ISD::OR;
|
|
|
|
Op0 = DAG.getNode(ARMISD::VCGT, dl, VT, TmpOp1, TmpOp0);
|
|
|
|
Op1 = DAG.getNode(ARMISD::VCGT, dl, VT, TmpOp0, TmpOp1);
|
|
|
|
break;
|
|
|
|
case ISD::SETUO: Invert = true; // Fallthrough
|
|
|
|
case ISD::SETO:
|
|
|
|
// Expand this to (OLT | OGE).
|
|
|
|
TmpOp0 = Op0;
|
|
|
|
TmpOp1 = Op1;
|
|
|
|
Opc = ISD::OR;
|
|
|
|
Op0 = DAG.getNode(ARMISD::VCGT, dl, VT, TmpOp1, TmpOp0);
|
|
|
|
Op1 = DAG.getNode(ARMISD::VCGE, dl, VT, TmpOp0, TmpOp1);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Integer comparisons.
|
|
|
|
switch (SetCCOpcode) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Illegal integer comparison"); break;
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SETNE: Invert = true;
|
|
|
|
case ISD::SETEQ: Opc = ARMISD::VCEQ; break;
|
|
|
|
case ISD::SETLT: Swap = true;
|
|
|
|
case ISD::SETGT: Opc = ARMISD::VCGT; break;
|
|
|
|
case ISD::SETLE: Swap = true;
|
|
|
|
case ISD::SETGE: Opc = ARMISD::VCGE; break;
|
|
|
|
case ISD::SETULT: Swap = true;
|
|
|
|
case ISD::SETUGT: Opc = ARMISD::VCGTU; break;
|
|
|
|
case ISD::SETULE: Swap = true;
|
|
|
|
case ISD::SETUGE: Opc = ARMISD::VCGEU; break;
|
|
|
|
}
|
|
|
|
|
2009-07-08 03:04:38 +00:00
|
|
|
// Detect VTST (Vector Test Bits) = icmp ne (and (op0, op1), zero).
|
2009-06-22 23:27:02 +00:00
|
|
|
if (Opc == ARMISD::VCEQ) {
|
|
|
|
|
|
|
|
SDValue AndOp;
|
|
|
|
if (ISD::isBuildVectorAllZeros(Op1.getNode()))
|
|
|
|
AndOp = Op0;
|
|
|
|
else if (ISD::isBuildVectorAllZeros(Op0.getNode()))
|
|
|
|
AndOp = Op1;
|
|
|
|
|
|
|
|
// Ignore bitconvert.
|
2010-11-23 03:31:01 +00:00
|
|
|
if (AndOp.getNode() && AndOp.getOpcode() == ISD::BITCAST)
|
2009-06-22 23:27:02 +00:00
|
|
|
AndOp = AndOp.getOperand(0);
|
|
|
|
|
|
|
|
if (AndOp.getNode() && AndOp.getOpcode() == ISD::AND) {
|
|
|
|
Opc = ARMISD::VTST;
|
2010-11-23 03:31:01 +00:00
|
|
|
Op0 = DAG.getNode(ISD::BITCAST, dl, VT, AndOp.getOperand(0));
|
|
|
|
Op1 = DAG.getNode(ISD::BITCAST, dl, VT, AndOp.getOperand(1));
|
2009-06-22 23:27:02 +00:00
|
|
|
Invert = !Invert;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Swap)
|
|
|
|
std::swap(Op0, Op1);
|
|
|
|
|
2010-11-08 23:21:22 +00:00
|
|
|
// If one of the operands is a constant vector zero, attempt to fold the
|
|
|
|
// comparison to a specialized compare-against-zero form.
|
|
|
|
SDValue SingleOp;
|
|
|
|
if (ISD::isBuildVectorAllZeros(Op1.getNode()))
|
|
|
|
SingleOp = Op0;
|
|
|
|
else if (ISD::isBuildVectorAllZeros(Op0.getNode())) {
|
|
|
|
if (Opc == ARMISD::VCGE)
|
|
|
|
Opc = ARMISD::VCLEZ;
|
|
|
|
else if (Opc == ARMISD::VCGT)
|
|
|
|
Opc = ARMISD::VCLTZ;
|
|
|
|
SingleOp = Op1;
|
|
|
|
}
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2010-11-08 23:21:22 +00:00
|
|
|
SDValue Result;
|
|
|
|
if (SingleOp.getNode()) {
|
|
|
|
switch (Opc) {
|
|
|
|
case ARMISD::VCEQ:
|
|
|
|
Result = DAG.getNode(ARMISD::VCEQZ, dl, VT, SingleOp); break;
|
|
|
|
case ARMISD::VCGE:
|
|
|
|
Result = DAG.getNode(ARMISD::VCGEZ, dl, VT, SingleOp); break;
|
|
|
|
case ARMISD::VCLEZ:
|
|
|
|
Result = DAG.getNode(ARMISD::VCLEZ, dl, VT, SingleOp); break;
|
|
|
|
case ARMISD::VCGT:
|
|
|
|
Result = DAG.getNode(ARMISD::VCGTZ, dl, VT, SingleOp); break;
|
|
|
|
case ARMISD::VCLTZ:
|
|
|
|
Result = DAG.getNode(ARMISD::VCLTZ, dl, VT, SingleOp); break;
|
|
|
|
default:
|
|
|
|
Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
Result = DAG.getNode(Opc, dl, VT, Op0, Op1);
|
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
if (Invert)
|
|
|
|
Result = DAG.getNOT(dl, Result, VT);
|
|
|
|
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2010-06-14 22:19:57 +00:00
|
|
|
/// isNEONModifiedImm - Check if the specified splat value corresponds to a
|
|
|
|
/// valid vector constant for a NEON instruction with a "modified immediate"
|
2010-07-13 21:16:48 +00:00
|
|
|
/// operand (e.g., VMOV). If so, return the encoded value.
|
2010-06-14 22:19:57 +00:00
|
|
|
static SDValue isNEONModifiedImm(uint64_t SplatBits, uint64_t SplatUndef,
|
|
|
|
unsigned SplatBitSize, SelectionDAG &DAG,
|
2010-11-05 21:57:54 +00:00
|
|
|
EVT &VT, bool is128Bits, NEONModImmType type) {
|
2010-07-13 04:44:34 +00:00
|
|
|
unsigned OpCmode, Imm;
|
2010-06-11 21:34:50 +00:00
|
|
|
|
2010-06-15 19:05:35 +00:00
|
|
|
// SplatBitSize is set to the smallest size that splats the vector, so a
|
|
|
|
// zero vector will always have SplatBitSize == 8. However, NEON modified
|
|
|
|
// immediate instructions others than VMOV do not support the 8-bit encoding
|
|
|
|
// of a zero vector, and the default encoding of zero is supposed to be the
|
|
|
|
// 32-bit version.
|
|
|
|
if (SplatBits == 0)
|
|
|
|
SplatBitSize = 32;
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
switch (SplatBitSize) {
|
|
|
|
case 8:
|
2010-11-05 21:57:54 +00:00
|
|
|
if (type != VMOVModImm)
|
2010-07-14 06:31:50 +00:00
|
|
|
return SDValue();
|
2010-06-11 21:34:50 +00:00
|
|
|
// Any 1-byte value is OK. Op=0, Cmode=1110.
|
2009-06-22 23:27:02 +00:00
|
|
|
assert((SplatBits & ~0xff) == 0 && "one byte splat value is too big");
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0xe;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits;
|
2010-07-13 21:16:48 +00:00
|
|
|
VT = is128Bits ? MVT::v16i8 : MVT::v8i8;
|
2010-06-11 21:34:50 +00:00
|
|
|
break;
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case 16:
|
|
|
|
// NEON's 16-bit VMOV supports splat values where only one byte is nonzero.
|
2010-07-13 21:16:48 +00:00
|
|
|
VT = is128Bits ? MVT::v8i16 : MVT::v4i16;
|
2010-06-11 21:34:50 +00:00
|
|
|
if ((SplatBits & ~0xff) == 0) {
|
|
|
|
// Value = 0x00nn: Op=x, Cmode=100x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0x8;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((SplatBits & ~0xff00) == 0) {
|
|
|
|
// Value = 0xnn00: Op=x, Cmode=101x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0xa;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 8;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return SDValue();
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case 32:
|
|
|
|
// NEON's 32-bit VMOV supports splat values where:
|
|
|
|
// * only one byte is nonzero, or
|
|
|
|
// * the least significant byte is 0xff and the second byte is nonzero, or
|
|
|
|
// * the least significant 2 bytes are 0xff and the third is nonzero.
|
2010-07-13 21:16:48 +00:00
|
|
|
VT = is128Bits ? MVT::v4i32 : MVT::v2i32;
|
2010-06-11 21:34:50 +00:00
|
|
|
if ((SplatBits & ~0xff) == 0) {
|
|
|
|
// Value = 0x000000nn: Op=x, Cmode=000x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((SplatBits & ~0xff00) == 0) {
|
|
|
|
// Value = 0x0000nn00: Op=x, Cmode=001x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0x2;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 8;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((SplatBits & ~0xff0000) == 0) {
|
|
|
|
// Value = 0x00nn0000: Op=x, Cmode=010x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0x4;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 16;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if ((SplatBits & ~0xff000000) == 0) {
|
|
|
|
// Value = 0xnn000000: Op=x, Cmode=011x.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0x6;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 24;
|
|
|
|
break;
|
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
|
2010-11-05 21:57:54 +00:00
|
|
|
// cmode == 0b1100 and cmode == 0b1101 are not supported for VORR or VBIC
|
|
|
|
if (type == OtherModImm) return SDValue();
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
if ((SplatBits & ~0xffff) == 0 &&
|
2010-06-11 21:34:50 +00:00
|
|
|
((SplatBits | SplatUndef) & 0xff) == 0xff) {
|
|
|
|
// Value = 0x0000nnff: Op=x, Cmode=1100.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0xc;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 8;
|
|
|
|
SplatBits |= 0xff;
|
|
|
|
break;
|
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
if ((SplatBits & ~0xffffff) == 0 &&
|
2010-06-11 21:34:50 +00:00
|
|
|
((SplatBits | SplatUndef) & 0xffff) == 0xffff) {
|
|
|
|
// Value = 0x00nnffff: Op=x, Cmode=1101.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0xd;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm = SplatBits >> 16;
|
|
|
|
SplatBits |= 0xffff;
|
|
|
|
break;
|
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
// Note: there are a few 32-bit splat values (specifically: 00ffff00,
|
|
|
|
// ff000000, ff0000ff, and ffff00ff) that are valid for VMOV.I64 but not
|
|
|
|
// VMOV.I32. A (very) minor optimization would be to replicate the value
|
|
|
|
// and fall through here to test for a valid 64-bit splat. But, then the
|
|
|
|
// caller would also need to check and handle the change in size.
|
2010-06-11 21:34:50 +00:00
|
|
|
return SDValue();
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case 64: {
|
2010-11-05 21:57:54 +00:00
|
|
|
if (type != VMOVModImm)
|
2010-06-15 19:05:35 +00:00
|
|
|
return SDValue();
|
2010-07-14 06:31:50 +00:00
|
|
|
// NEON has a 64-bit VMOV splat where each byte is either 0 or 0xff.
|
2009-06-22 23:27:02 +00:00
|
|
|
uint64_t BitMask = 0xff;
|
|
|
|
uint64_t Val = 0;
|
2010-06-11 21:34:50 +00:00
|
|
|
unsigned ImmMask = 1;
|
|
|
|
Imm = 0;
|
2009-06-22 23:27:02 +00:00
|
|
|
for (int ByteNum = 0; ByteNum < 8; ++ByteNum) {
|
2010-06-11 21:34:50 +00:00
|
|
|
if (((SplatBits | SplatUndef) & BitMask) == BitMask) {
|
2009-06-22 23:27:02 +00:00
|
|
|
Val |= BitMask;
|
2010-06-11 21:34:50 +00:00
|
|
|
Imm |= ImmMask;
|
|
|
|
} else if ((SplatBits & BitMask) != 0) {
|
2009-06-22 23:27:02 +00:00
|
|
|
return SDValue();
|
2010-06-11 21:34:50 +00:00
|
|
|
}
|
2009-06-22 23:27:02 +00:00
|
|
|
BitMask <<= 8;
|
2010-06-11 21:34:50 +00:00
|
|
|
ImmMask <<= 1;
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
2010-06-11 21:34:50 +00:00
|
|
|
// Op=1, Cmode=1110.
|
2010-07-13 04:44:34 +00:00
|
|
|
OpCmode = 0x1e;
|
2010-06-11 21:34:50 +00:00
|
|
|
SplatBits = Val;
|
2010-07-13 21:16:48 +00:00
|
|
|
VT = is128Bits ? MVT::v2i64 : MVT::v1i64;
|
2010-06-11 21:34:50 +00:00
|
|
|
break;
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
2010-06-19 05:32:09 +00:00
|
|
|
llvm_unreachable("unexpected size for isNEONModifiedImm");
|
2010-06-11 21:34:50 +00:00
|
|
|
return SDValue();
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2010-07-13 21:16:48 +00:00
|
|
|
unsigned EncodedVal = ARM_AM::createNEONModImm(OpCmode, Imm);
|
|
|
|
return DAG.getTargetConstant(EncodedVal, MVT::i32);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-08-21 12:40:07 +00:00
|
|
|
static bool isVEXTMask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
bool &ReverseVEXT, unsigned &Imm) {
|
2009-08-19 17:03:43 +00:00
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
ReverseVEXT = false;
|
2010-08-17 05:54:34 +00:00
|
|
|
|
|
|
|
// Assume that the first shuffle index is not UNDEF. Fail if it is.
|
|
|
|
if (M[0] < 0)
|
|
|
|
return false;
|
|
|
|
|
2009-08-21 12:40:07 +00:00
|
|
|
Imm = M[0];
|
2009-08-19 17:03:43 +00:00
|
|
|
|
|
|
|
// If this is a VEXT shuffle, the immediate value is the index of the first
|
|
|
|
// element. The other shuffle indices must be the successive elements after
|
|
|
|
// the first one.
|
|
|
|
unsigned ExpectedElt = Imm;
|
|
|
|
for (unsigned i = 1; i < NumElts; ++i) {
|
|
|
|
// Increment the expected index. If it wraps around, it may still be
|
|
|
|
// a VEXT but the source vectors must be swapped.
|
|
|
|
ExpectedElt += 1;
|
|
|
|
if (ExpectedElt == NumElts * 2) {
|
|
|
|
ExpectedElt = 0;
|
|
|
|
ReverseVEXT = true;
|
|
|
|
}
|
|
|
|
|
2010-08-17 05:54:34 +00:00
|
|
|
if (M[i] < 0) continue; // ignore UNDEF indices
|
2009-08-21 12:40:07 +00:00
|
|
|
if (ExpectedElt != static_cast<unsigned>(M[i]))
|
2009-08-19 17:03:43 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Adjust the index value if the source operands will be swapped.
|
|
|
|
if (ReverseVEXT)
|
|
|
|
Imm -= NumElts;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-07-26 00:39:34 +00:00
|
|
|
/// isVREVMask - Check if a vector shuffle corresponds to a VREV
|
|
|
|
/// instruction with the specified blocksize. (The order of the elements
|
|
|
|
/// within each block of the vector is reversed.)
|
2009-08-21 12:40:07 +00:00
|
|
|
static bool isVREVMask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned BlockSize) {
|
2009-07-26 00:39:34 +00:00
|
|
|
assert((BlockSize==16 || BlockSize==32 || BlockSize==64) &&
|
|
|
|
"Only possible block sizes for VREV are: 16, 32, 64");
|
|
|
|
|
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
2009-10-21 21:36:27 +00:00
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
2009-08-21 12:40:07 +00:00
|
|
|
unsigned BlockElts = M[0] + 1;
|
2010-08-17 05:54:34 +00:00
|
|
|
// If the first shuffle index is UNDEF, be optimistic.
|
|
|
|
if (M[0] < 0)
|
|
|
|
BlockElts = BlockSize / EltSz;
|
2009-07-26 00:39:34 +00:00
|
|
|
|
|
|
|
if (BlockSize <= EltSz || BlockSize != BlockElts * EltSz)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if (M[i] < 0) continue; // ignore UNDEF indices
|
|
|
|
if ((unsigned) M[i] != (i - i%BlockElts) + (BlockElts - 1 - i%BlockElts))
|
2009-07-26 00:39:34 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
static bool isVTRNMask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
2009-10-21 21:36:27 +00:00
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
for (unsigned i = 0; i < NumElts; i += 2) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if ((M[i] >= 0 && (unsigned) M[i] != i + WhichResult) ||
|
|
|
|
(M[i+1] >= 0 && (unsigned) M[i+1] != i + NumElts + WhichResult))
|
2009-08-21 20:54:19 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-12-03 06:40:55 +00:00
|
|
|
/// isVTRN_v_undef_Mask - Special case of isVTRNMask for canonical form of
|
|
|
|
/// "vector_shuffle v, v", i.e., "vector_shuffle v, undef".
|
|
|
|
/// Mask is e.g., <0, 0, 2, 2> instead of <0, 4, 2, 6>.
|
|
|
|
static bool isVTRN_v_undef_Mask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
for (unsigned i = 0; i < NumElts; i += 2) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if ((M[i] >= 0 && (unsigned) M[i] != i + WhichResult) ||
|
|
|
|
(M[i+1] >= 0 && (unsigned) M[i+1] != i + WhichResult))
|
2009-12-03 06:40:55 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
static bool isVUZPMask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
2009-10-21 21:36:27 +00:00
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
for (unsigned i = 0; i != NumElts; ++i) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if (M[i] < 0) continue; // ignore UNDEF indices
|
2009-08-21 20:54:19 +00:00
|
|
|
if ((unsigned) M[i] != 2 * i + WhichResult)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// VUZP.32 for 64-bit vectors is a pseudo-instruction alias for VTRN.32.
|
2009-10-21 21:36:27 +00:00
|
|
|
if (VT.is64BitVector() && EltSz == 32)
|
2009-08-21 20:54:19 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-12-03 06:40:55 +00:00
|
|
|
/// isVUZP_v_undef_Mask - Special case of isVUZPMask for canonical form of
|
|
|
|
/// "vector_shuffle v, v", i.e., "vector_shuffle v, undef".
|
|
|
|
/// Mask is e.g., <0, 2, 0, 2> instead of <0, 2, 4, 6>,
|
|
|
|
static bool isVUZP_v_undef_Mask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned Half = VT.getVectorNumElements() / 2;
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
for (unsigned j = 0; j != 2; ++j) {
|
|
|
|
unsigned Idx = WhichResult;
|
|
|
|
for (unsigned i = 0; i != Half; ++i) {
|
2010-08-17 05:54:34 +00:00
|
|
|
int MIdx = M[i + j * Half];
|
|
|
|
if (MIdx >= 0 && (unsigned) MIdx != Idx)
|
2009-12-03 06:40:55 +00:00
|
|
|
return false;
|
|
|
|
Idx += 2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// VUZP.32 for 64-bit vectors is a pseudo-instruction alias for VTRN.32.
|
|
|
|
if (VT.is64BitVector() && EltSz == 32)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
static bool isVZIPMask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
2009-10-21 21:36:27 +00:00
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
unsigned Idx = WhichResult * NumElts / 2;
|
|
|
|
for (unsigned i = 0; i != NumElts; i += 2) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if ((M[i] >= 0 && (unsigned) M[i] != Idx) ||
|
|
|
|
(M[i+1] >= 0 && (unsigned) M[i+1] != Idx + NumElts))
|
2009-08-21 20:54:19 +00:00
|
|
|
return false;
|
|
|
|
Idx += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// VZIP.32 for 64-bit vectors is a pseudo-instruction alias for VTRN.32.
|
2009-10-21 21:36:27 +00:00
|
|
|
if (VT.is64BitVector() && EltSz == 32)
|
2009-08-21 20:54:19 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-12-03 06:40:55 +00:00
|
|
|
/// isVZIP_v_undef_Mask - Special case of isVZIPMask for canonical form of
|
|
|
|
/// "vector_shuffle v, v", i.e., "vector_shuffle v, undef".
|
|
|
|
/// Mask is e.g., <0, 0, 1, 1> instead of <0, 4, 1, 5>.
|
|
|
|
static bool isVZIP_v_undef_Mask(const SmallVectorImpl<int> &M, EVT VT,
|
|
|
|
unsigned &WhichResult) {
|
|
|
|
unsigned EltSz = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSz == 64)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
WhichResult = (M[0] == 0 ? 0 : 1);
|
|
|
|
unsigned Idx = WhichResult * NumElts / 2;
|
|
|
|
for (unsigned i = 0; i != NumElts; i += 2) {
|
2010-08-17 05:54:34 +00:00
|
|
|
if ((M[i] >= 0 && (unsigned) M[i] != Idx) ||
|
|
|
|
(M[i+1] >= 0 && (unsigned) M[i+1] != Idx))
|
2009-12-03 06:40:55 +00:00
|
|
|
return false;
|
|
|
|
Idx += 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
// VZIP.32 for 64-bit vectors is a pseudo-instruction alias for VTRN.32.
|
|
|
|
if (VT.is64BitVector() && EltSz == 32)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-07-29 20:10:08 +00:00
|
|
|
// If N is an integer constant that can be moved into a register in one
|
|
|
|
// instruction, return an SDValue of such a constant (will become a MOV
|
|
|
|
// instruction). Otherwise return null.
|
|
|
|
static SDValue IsSingleInstrConstant(SDValue N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST, DebugLoc dl) {
|
|
|
|
uint64_t Val;
|
|
|
|
if (!isa<ConstantSDNode>(N))
|
|
|
|
return SDValue();
|
|
|
|
Val = cast<ConstantSDNode>(N)->getZExtValue();
|
|
|
|
|
|
|
|
if (ST->isThumb1Only()) {
|
|
|
|
if (Val <= 255 || ~Val <= 255)
|
|
|
|
return DAG.getConstant(Val, MVT::i32);
|
|
|
|
} else {
|
|
|
|
if (ARM_AM::getSOImmVal(Val) != -1 || ARM_AM::getSOImmVal(~Val) != -1)
|
|
|
|
return DAG.getConstant(Val, MVT::i32);
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
// If this is a case we can't handle, return null and let the default
|
|
|
|
// expansion code take care of it.
|
2011-01-07 21:37:30 +00:00
|
|
|
SDValue ARMTargetLowering::LowerBUILD_VECTOR(SDValue Op, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) const {
|
2009-08-13 01:57:47 +00:00
|
|
|
BuildVectorSDNode *BVN = cast<BuildVectorSDNode>(Op.getNode());
|
2009-06-22 23:27:02 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = Op.getValueType();
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
APInt SplatBits, SplatUndef;
|
|
|
|
unsigned SplatBitSize;
|
|
|
|
bool HasAnyUndefs;
|
|
|
|
if (BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize, HasAnyUndefs)) {
|
2009-08-29 00:08:18 +00:00
|
|
|
if (SplatBitSize <= 64) {
|
2010-06-14 22:19:57 +00:00
|
|
|
// Check if an immediate VMOV works.
|
2010-07-13 21:16:48 +00:00
|
|
|
EVT VmovVT;
|
2010-06-14 22:19:57 +00:00
|
|
|
SDValue Val = isNEONModifiedImm(SplatBits.getZExtValue(),
|
2010-07-13 21:16:48 +00:00
|
|
|
SplatUndef.getZExtValue(), SplatBitSize,
|
2010-11-05 21:57:54 +00:00
|
|
|
DAG, VmovVT, VT.is128BitVector(),
|
|
|
|
VMOVModImm);
|
2010-07-13 21:16:48 +00:00
|
|
|
if (Val.getNode()) {
|
|
|
|
SDValue Vmov = DAG.getNode(ARMISD::VMOVIMM, dl, VmovVT, Val);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Vmov);
|
2010-07-13 21:16:48 +00:00
|
|
|
}
|
2010-07-14 06:31:50 +00:00
|
|
|
|
|
|
|
// Try an immediate VMVN.
|
|
|
|
uint64_t NegatedImm = (SplatBits.getZExtValue() ^
|
|
|
|
((1LL << SplatBitSize) - 1));
|
|
|
|
Val = isNEONModifiedImm(NegatedImm,
|
|
|
|
SplatUndef.getZExtValue(), SplatBitSize,
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG, VmovVT, VT.is128BitVector(),
|
2010-11-05 21:57:54 +00:00
|
|
|
VMVNModImm);
|
2010-07-14 06:31:50 +00:00
|
|
|
if (Val.getNode()) {
|
|
|
|
SDValue Vmov = DAG.getNode(ARMISD::VMVNIMM, dl, VmovVT, Val);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Vmov);
|
2010-07-14 06:31:50 +00:00
|
|
|
}
|
2009-08-29 00:08:18 +00:00
|
|
|
}
|
2009-07-30 00:31:25 +00:00
|
|
|
}
|
|
|
|
|
2010-05-22 00:23:12 +00:00
|
|
|
// Scan through the operands to see if only one value is used.
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
bool isOnlyLowElement = true;
|
|
|
|
bool usesOnlyOneValue = true;
|
|
|
|
bool isConstant = true;
|
|
|
|
SDValue Value;
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
|
|
|
SDValue V = Op.getOperand(i);
|
|
|
|
if (V.getOpcode() == ISD::UNDEF)
|
|
|
|
continue;
|
|
|
|
if (i > 0)
|
|
|
|
isOnlyLowElement = false;
|
|
|
|
if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V))
|
|
|
|
isConstant = false;
|
|
|
|
|
|
|
|
if (!Value.getNode())
|
|
|
|
Value = V;
|
|
|
|
else if (V != Value)
|
|
|
|
usesOnlyOneValue = false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!Value.getNode())
|
|
|
|
return DAG.getUNDEF(VT);
|
|
|
|
|
|
|
|
if (isOnlyLowElement)
|
|
|
|
return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value);
|
|
|
|
|
2010-07-29 20:10:08 +00:00
|
|
|
unsigned EltSize = VT.getVectorElementType().getSizeInBits();
|
|
|
|
|
2010-10-19 20:00:17 +00:00
|
|
|
// Use VDUP for non-constant splats. For f32 constant splats, reduce to
|
|
|
|
// i32 and try again.
|
|
|
|
if (usesOnlyOneValue && EltSize <= 32) {
|
|
|
|
if (!isConstant)
|
|
|
|
return DAG.getNode(ARMISD::VDUP, dl, VT, Value);
|
|
|
|
if (VT.getVectorElementType().isFloatingPoint()) {
|
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i)
|
2010-11-23 03:31:01 +00:00
|
|
|
Ops.push_back(DAG.getNode(ISD::BITCAST, dl, MVT::i32,
|
2010-10-19 20:00:17 +00:00
|
|
|
Op.getOperand(i)));
|
2010-11-10 21:35:41 +00:00
|
|
|
EVT VecVT = EVT::getVectorVT(*DAG.getContext(), MVT::i32, NumElts);
|
|
|
|
SDValue Val = DAG.getNode(ISD::BUILD_VECTOR, dl, VecVT, &Ops[0], NumElts);
|
2010-10-20 22:03:37 +00:00
|
|
|
Val = LowerBUILD_VECTOR(Val, DAG, ST);
|
|
|
|
if (Val.getNode())
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Val);
|
2010-07-29 20:10:08 +00:00
|
|
|
}
|
2010-10-19 20:00:17 +00:00
|
|
|
SDValue Val = IsSingleInstrConstant(Value, DAG, ST, dl);
|
|
|
|
if (Val.getNode())
|
|
|
|
return DAG.getNode(ARMISD::VDUP, dl, VT, Val);
|
2010-07-29 20:10:08 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// If all elements are constants and the case above didn't get hit, fall back
|
|
|
|
// to the default expansion, which will generate a load from the constant
|
|
|
|
// pool.
|
2010-05-22 00:23:12 +00:00
|
|
|
if (isConstant)
|
|
|
|
return SDValue();
|
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Empirical tests suggest this is rarely worth it for vectors of length <= 2.
|
|
|
|
if (NumElts >= 4) {
|
|
|
|
SDValue shuffle = ReconstructShuffle(Op, DAG);
|
|
|
|
if (shuffle != SDValue())
|
|
|
|
return shuffle;
|
|
|
|
}
|
|
|
|
|
2010-05-22 00:23:12 +00:00
|
|
|
// Vectors with 32- or 64-bit elements can be built by directly assigning
|
2010-06-04 00:04:02 +00:00
|
|
|
// the subregisters. Lower it to an ARMISD::BUILD_VECTOR so the operands
|
|
|
|
// will be legalized.
|
2010-05-22 00:23:12 +00:00
|
|
|
if (EltSize >= 32) {
|
|
|
|
// Do the expansion with floating-point types, since that is what the VFP
|
|
|
|
// registers are defined to use, and since i64 is not legal.
|
|
|
|
EVT EltVT = EVT::getFloatingPointVT(EltSize);
|
|
|
|
EVT VecVT = EVT::getVectorVT(*DAG.getContext(), EltVT, NumElts);
|
2010-06-04 00:04:02 +00:00
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i)
|
2010-11-23 03:31:01 +00:00
|
|
|
Ops.push_back(DAG.getNode(ISD::BITCAST, dl, EltVT, Op.getOperand(i)));
|
2010-06-04 00:04:02 +00:00
|
|
|
SDValue Val = DAG.getNode(ARMISD::BUILD_VECTOR, dl, VecVT, &Ops[0],NumElts);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Val);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Gather data to see if the operation can be modelled as a
|
2011-01-19 02:26:13 +00:00
|
|
|
// shuffle in combination with VEXTs.
|
2011-01-14 23:50:53 +00:00
|
|
|
SDValue ARMTargetLowering::ReconstructShuffle(SDValue Op,
|
|
|
|
SelectionDAG &DAG) const {
|
2011-01-07 21:37:30 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
|
|
|
|
SmallVector<SDValue, 2> SourceVecs;
|
|
|
|
SmallVector<unsigned, 2> MinElts;
|
|
|
|
SmallVector<unsigned, 2> MaxElts;
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
|
|
|
SDValue V = Op.getOperand(i);
|
|
|
|
if (V.getOpcode() == ISD::UNDEF)
|
|
|
|
continue;
|
|
|
|
else if (V.getOpcode() != ISD::EXTRACT_VECTOR_ELT) {
|
|
|
|
// A shuffle can only come from building a vector from various
|
|
|
|
// elements of other vectors.
|
|
|
|
return SDValue();
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Record this extraction against the appropriate vector if possible...
|
|
|
|
SDValue SourceVec = V.getOperand(0);
|
|
|
|
unsigned EltNo = cast<ConstantSDNode>(V.getOperand(1))->getZExtValue();
|
|
|
|
bool FoundSource = false;
|
|
|
|
for (unsigned j = 0; j < SourceVecs.size(); ++j) {
|
|
|
|
if (SourceVecs[j] == SourceVec) {
|
|
|
|
if (MinElts[j] > EltNo)
|
|
|
|
MinElts[j] = EltNo;
|
|
|
|
if (MaxElts[j] < EltNo)
|
|
|
|
MaxElts[j] = EltNo;
|
|
|
|
FoundSource = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Or record a new source if not...
|
|
|
|
if (!FoundSource) {
|
|
|
|
SourceVecs.push_back(SourceVec);
|
|
|
|
MinElts.push_back(EltNo);
|
|
|
|
MaxElts.push_back(EltNo);
|
|
|
|
}
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Currently only do something sane when at most two source vectors
|
|
|
|
// involved.
|
|
|
|
if (SourceVecs.size() > 2)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue ShuffleSrcs[2] = {DAG.getUNDEF(VT), DAG.getUNDEF(VT) };
|
|
|
|
int VEXTOffsets[2] = {0, 0};
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// This loop extracts the usage patterns of the source vectors
|
|
|
|
// and prepares appropriate SDValues for a shuffle if possible.
|
|
|
|
for (unsigned i = 0; i < SourceVecs.size(); ++i) {
|
|
|
|
if (SourceVecs[i].getValueType() == VT) {
|
|
|
|
// No VEXT necessary
|
|
|
|
ShuffleSrcs[i] = SourceVecs[i];
|
|
|
|
VEXTOffsets[i] = 0;
|
|
|
|
continue;
|
|
|
|
} else if (SourceVecs[i].getValueType().getVectorNumElements() < NumElts) {
|
|
|
|
// It probably isn't worth padding out a smaller vector just to
|
|
|
|
// break it down again in a shuffle.
|
|
|
|
return SDValue();
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Since only 64-bit and 128-bit vectors are legal on ARM and
|
|
|
|
// we've eliminated the other cases...
|
2011-01-07 23:40:46 +00:00
|
|
|
assert(SourceVecs[i].getValueType().getVectorNumElements() == 2*NumElts &&
|
|
|
|
"unexpected vector sizes in ReconstructShuffle");
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
if (MaxElts[i] - MinElts[i] >= NumElts) {
|
|
|
|
// Span too large for a VEXT to cope
|
|
|
|
return SDValue();
|
2011-01-19 02:26:13 +00:00
|
|
|
}
|
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
if (MinElts[i] >= NumElts) {
|
|
|
|
// The extraction can just take the second half
|
|
|
|
VEXTOffsets[i] = NumElts;
|
2011-01-14 23:50:53 +00:00
|
|
|
ShuffleSrcs[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
|
|
|
|
SourceVecs[i],
|
2011-01-07 21:37:30 +00:00
|
|
|
DAG.getIntPtrConstant(NumElts));
|
|
|
|
} else if (MaxElts[i] < NumElts) {
|
|
|
|
// The extraction can just take the first half
|
|
|
|
VEXTOffsets[i] = 0;
|
2011-01-14 23:50:53 +00:00
|
|
|
ShuffleSrcs[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
|
|
|
|
SourceVecs[i],
|
2011-01-07 21:37:30 +00:00
|
|
|
DAG.getIntPtrConstant(0));
|
|
|
|
} else {
|
|
|
|
// An actual VEXT is needed
|
|
|
|
VEXTOffsets[i] = MinElts[i];
|
2011-01-14 23:50:53 +00:00
|
|
|
SDValue VEXTSrc1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
|
|
|
|
SourceVecs[i],
|
2011-01-07 21:37:30 +00:00
|
|
|
DAG.getIntPtrConstant(0));
|
2011-01-14 23:50:53 +00:00
|
|
|
SDValue VEXTSrc2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, VT,
|
|
|
|
SourceVecs[i],
|
2011-01-07 21:37:30 +00:00
|
|
|
DAG.getIntPtrConstant(NumElts));
|
|
|
|
ShuffleSrcs[i] = DAG.getNode(ARMISD::VEXT, dl, VT, VEXTSrc1, VEXTSrc2,
|
|
|
|
DAG.getConstant(VEXTOffsets[i], MVT::i32));
|
|
|
|
}
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
SmallVector<int, 8> Mask;
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
|
|
|
SDValue Entry = Op.getOperand(i);
|
|
|
|
if (Entry.getOpcode() == ISD::UNDEF) {
|
|
|
|
Mask.push_back(-1);
|
|
|
|
continue;
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
SDValue ExtractVec = Entry.getOperand(0);
|
2011-01-14 23:50:53 +00:00
|
|
|
int ExtractElt = cast<ConstantSDNode>(Op.getOperand(i)
|
|
|
|
.getOperand(1))->getSExtValue();
|
2011-01-07 21:37:30 +00:00
|
|
|
if (ExtractVec == SourceVecs[0]) {
|
|
|
|
Mask.push_back(ExtractElt - VEXTOffsets[0]);
|
|
|
|
} else {
|
|
|
|
Mask.push_back(ExtractElt + NumElts - VEXTOffsets[1]);
|
|
|
|
}
|
|
|
|
}
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
// Final check before we try to produce nonsense...
|
|
|
|
if (isShuffleMaskLegal(Mask, VT))
|
2011-01-14 23:50:53 +00:00
|
|
|
return DAG.getVectorShuffle(VT, dl, ShuffleSrcs[0], ShuffleSrcs[1],
|
|
|
|
&Mask[0]);
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2011-01-07 21:37:30 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2009-08-21 12:40:07 +00:00
|
|
|
/// isShuffleMaskLegal - Targets can use this to indicate that they only
|
|
|
|
/// support *some* VECTOR_SHUFFLE operations, those with specific masks.
|
|
|
|
/// By default, if a target supports the VECTOR_SHUFFLE node, all mask values
|
|
|
|
/// are assumed to be legal.
|
|
|
|
bool
|
|
|
|
ARMTargetLowering::isShuffleMaskLegal(const SmallVectorImpl<int> &M,
|
|
|
|
EVT VT) const {
|
2009-08-21 12:41:24 +00:00
|
|
|
if (VT.getVectorNumElements() == 4 &&
|
|
|
|
(VT.is128BitVector() || VT.is64BitVector())) {
|
|
|
|
unsigned PFIndexes[4];
|
|
|
|
for (unsigned i = 0; i != 4; ++i) {
|
|
|
|
if (M[i] < 0)
|
|
|
|
PFIndexes[i] = 8;
|
|
|
|
else
|
|
|
|
PFIndexes[i] = M[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Compute the index in the perfect shuffle table.
|
|
|
|
unsigned PFTableIndex =
|
|
|
|
PFIndexes[0]*9*9*9+PFIndexes[1]*9*9+PFIndexes[2]*9+PFIndexes[3];
|
|
|
|
unsigned PFEntry = PerfectShuffleTable[PFTableIndex];
|
|
|
|
unsigned Cost = (PFEntry >> 30);
|
|
|
|
|
|
|
|
if (Cost <= 4)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-08-21 12:40:07 +00:00
|
|
|
bool ReverseVEXT;
|
2009-08-21 20:54:19 +00:00
|
|
|
unsigned Imm, WhichResult;
|
2009-08-21 12:40:07 +00:00
|
|
|
|
2010-06-07 23:53:38 +00:00
|
|
|
unsigned EltSize = VT.getVectorElementType().getSizeInBits();
|
|
|
|
return (EltSize >= 32 ||
|
|
|
|
ShuffleVectorSDNode::isSplatMask(&M[0], VT) ||
|
2009-08-21 12:40:07 +00:00
|
|
|
isVREVMask(M, VT, 64) ||
|
|
|
|
isVREVMask(M, VT, 32) ||
|
|
|
|
isVREVMask(M, VT, 16) ||
|
2009-08-21 20:54:19 +00:00
|
|
|
isVEXTMask(M, VT, ReverseVEXT, Imm) ||
|
|
|
|
isVTRNMask(M, VT, WhichResult) ||
|
|
|
|
isVUZPMask(M, VT, WhichResult) ||
|
2009-12-03 06:40:55 +00:00
|
|
|
isVZIPMask(M, VT, WhichResult) ||
|
|
|
|
isVTRN_v_undef_Mask(M, VT, WhichResult) ||
|
|
|
|
isVUZP_v_undef_Mask(M, VT, WhichResult) ||
|
|
|
|
isVZIP_v_undef_Mask(M, VT, WhichResult));
|
2009-08-21 12:40:07 +00:00
|
|
|
}
|
|
|
|
|
2009-08-21 12:41:24 +00:00
|
|
|
/// GeneratePerfectShuffle - Given an entry in the perfect-shuffle table, emit
|
|
|
|
/// the specified operations to build the shuffle.
|
|
|
|
static SDValue GeneratePerfectShuffle(unsigned PFEntry, SDValue LHS,
|
|
|
|
SDValue RHS, SelectionDAG &DAG,
|
|
|
|
DebugLoc dl) {
|
|
|
|
unsigned OpNum = (PFEntry >> 26) & 0x0F;
|
|
|
|
unsigned LHSID = (PFEntry >> 13) & ((1 << 13)-1);
|
|
|
|
unsigned RHSID = (PFEntry >> 0) & ((1 << 13)-1);
|
|
|
|
|
|
|
|
enum {
|
|
|
|
OP_COPY = 0, // Copy, used for things like <u,u,u,3> to say it is <0,1,2,3>
|
|
|
|
OP_VREV,
|
|
|
|
OP_VDUP0,
|
|
|
|
OP_VDUP1,
|
|
|
|
OP_VDUP2,
|
|
|
|
OP_VDUP3,
|
|
|
|
OP_VEXT1,
|
|
|
|
OP_VEXT2,
|
|
|
|
OP_VEXT3,
|
|
|
|
OP_VUZPL, // VUZP, left result
|
|
|
|
OP_VUZPR, // VUZP, right result
|
|
|
|
OP_VZIPL, // VZIP, left result
|
|
|
|
OP_VZIPR, // VZIP, right result
|
|
|
|
OP_VTRNL, // VTRN, left result
|
|
|
|
OP_VTRNR // VTRN, right result
|
|
|
|
};
|
|
|
|
|
|
|
|
if (OpNum == OP_COPY) {
|
|
|
|
if (LHSID == (1*9+2)*9+3) return LHS;
|
|
|
|
assert(LHSID == ((4*9+5)*9+6)*9+7 && "Illegal OP_COPY!");
|
|
|
|
return RHS;
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue OpLHS, OpRHS;
|
|
|
|
OpLHS = GeneratePerfectShuffle(PerfectShuffleTable[LHSID], LHS, RHS, DAG, dl);
|
|
|
|
OpRHS = GeneratePerfectShuffle(PerfectShuffleTable[RHSID], LHS, RHS, DAG, dl);
|
|
|
|
EVT VT = OpLHS.getValueType();
|
|
|
|
|
|
|
|
switch (OpNum) {
|
|
|
|
default: llvm_unreachable("Unknown shuffle opcode!");
|
|
|
|
case OP_VREV:
|
|
|
|
return DAG.getNode(ARMISD::VREV64, dl, VT, OpLHS);
|
|
|
|
case OP_VDUP0:
|
|
|
|
case OP_VDUP1:
|
|
|
|
case OP_VDUP2:
|
|
|
|
case OP_VDUP3:
|
|
|
|
return DAG.getNode(ARMISD::VDUPLANE, dl, VT,
|
2009-08-21 12:41:42 +00:00
|
|
|
OpLHS, DAG.getConstant(OpNum-OP_VDUP0, MVT::i32));
|
2009-08-21 12:41:24 +00:00
|
|
|
case OP_VEXT1:
|
|
|
|
case OP_VEXT2:
|
|
|
|
case OP_VEXT3:
|
|
|
|
return DAG.getNode(ARMISD::VEXT, dl, VT,
|
|
|
|
OpLHS, OpRHS,
|
|
|
|
DAG.getConstant(OpNum-OP_VEXT1+1, MVT::i32));
|
|
|
|
case OP_VUZPL:
|
|
|
|
case OP_VUZPR:
|
2009-08-21 12:41:42 +00:00
|
|
|
return DAG.getNode(ARMISD::VUZP, dl, DAG.getVTList(VT, VT),
|
2009-08-21 12:41:24 +00:00
|
|
|
OpLHS, OpRHS).getValue(OpNum-OP_VUZPL);
|
|
|
|
case OP_VZIPL:
|
|
|
|
case OP_VZIPR:
|
2009-08-21 12:41:42 +00:00
|
|
|
return DAG.getNode(ARMISD::VZIP, dl, DAG.getVTList(VT, VT),
|
2009-08-21 12:41:24 +00:00
|
|
|
OpLHS, OpRHS).getValue(OpNum-OP_VZIPL);
|
|
|
|
case OP_VTRNL:
|
|
|
|
case OP_VTRNR:
|
2009-08-21 12:41:42 +00:00
|
|
|
return DAG.getNode(ARMISD::VTRN, dl, DAG.getVTList(VT, VT),
|
|
|
|
OpLHS, OpRHS).getValue(OpNum-OP_VTRNL);
|
2009-08-21 12:41:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
static SDValue LowerVECTOR_SHUFFLE(SDValue Op, SelectionDAG &DAG) {
|
2009-08-21 12:41:24 +00:00
|
|
|
SDValue V1 = Op.getOperand(0);
|
|
|
|
SDValue V2 = Op.getOperand(1);
|
2009-08-12 22:31:50 +00:00
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
EVT VT = Op.getValueType();
|
2009-08-21 12:41:24 +00:00
|
|
|
ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(Op.getNode());
|
2009-08-21 12:40:07 +00:00
|
|
|
SmallVector<int, 8> ShuffleMask;
|
2009-08-12 22:31:50 +00:00
|
|
|
|
2009-08-13 02:13:04 +00:00
|
|
|
// Convert shuffles that are directly supported on NEON to target-specific
|
|
|
|
// DAG nodes, instead of keeping them as shuffles and matching them again
|
|
|
|
// during code selection. This is more efficient and avoids the possibility
|
|
|
|
// of inconsistencies between legalization and selection.
|
2009-08-13 06:01:30 +00:00
|
|
|
// FIXME: floating-point vectors should be canonicalized to integer vectors
|
|
|
|
// of the same time so that they get CSEd properly.
|
2009-08-21 12:40:07 +00:00
|
|
|
SVN->getMask(ShuffleMask);
|
|
|
|
|
2010-06-07 23:53:38 +00:00
|
|
|
unsigned EltSize = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (EltSize <= 32) {
|
|
|
|
if (ShuffleVectorSDNode::isSplatMask(&ShuffleMask[0], VT)) {
|
|
|
|
int Lane = SVN->getSplatIndex();
|
|
|
|
// If this is undef splat, generate it via "just" vdup, if possible.
|
|
|
|
if (Lane == -1) Lane = 0;
|
|
|
|
|
|
|
|
if (Lane == 0 && V1.getOpcode() == ISD::SCALAR_TO_VECTOR) {
|
|
|
|
return DAG.getNode(ARMISD::VDUP, dl, VT, V1.getOperand(0));
|
|
|
|
}
|
|
|
|
return DAG.getNode(ARMISD::VDUPLANE, dl, VT, V1,
|
|
|
|
DAG.getConstant(Lane, MVT::i32));
|
2009-08-14 05:13:08 +00:00
|
|
|
}
|
2009-08-19 17:03:43 +00:00
|
|
|
|
2010-06-07 23:53:38 +00:00
|
|
|
bool ReverseVEXT;
|
|
|
|
unsigned Imm;
|
|
|
|
if (isVEXTMask(ShuffleMask, VT, ReverseVEXT, Imm)) {
|
|
|
|
if (ReverseVEXT)
|
|
|
|
std::swap(V1, V2);
|
|
|
|
return DAG.getNode(ARMISD::VEXT, dl, VT, V1, V2,
|
|
|
|
DAG.getConstant(Imm, MVT::i32));
|
|
|
|
}
|
2009-08-21 20:54:19 +00:00
|
|
|
|
2010-06-07 23:53:38 +00:00
|
|
|
if (isVREVMask(ShuffleMask, VT, 64))
|
|
|
|
return DAG.getNode(ARMISD::VREV64, dl, VT, V1);
|
|
|
|
if (isVREVMask(ShuffleMask, VT, 32))
|
|
|
|
return DAG.getNode(ARMISD::VREV32, dl, VT, V1);
|
|
|
|
if (isVREVMask(ShuffleMask, VT, 16))
|
|
|
|
return DAG.getNode(ARMISD::VREV16, dl, VT, V1);
|
|
|
|
|
|
|
|
// Check for Neon shuffles that modify both input vectors in place.
|
|
|
|
// If both results are used, i.e., if there are two shuffles with the same
|
|
|
|
// source operands and with masks corresponding to both results of one of
|
|
|
|
// these operations, DAG memoization will ensure that a single node is
|
|
|
|
// used for both shuffles.
|
|
|
|
unsigned WhichResult;
|
|
|
|
if (isVTRNMask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VTRN, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V2).getValue(WhichResult);
|
|
|
|
if (isVUZPMask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VUZP, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V2).getValue(WhichResult);
|
|
|
|
if (isVZIPMask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VZIP, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V2).getValue(WhichResult);
|
|
|
|
|
|
|
|
if (isVTRN_v_undef_Mask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VTRN, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V1).getValue(WhichResult);
|
|
|
|
if (isVUZP_v_undef_Mask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VUZP, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V1).getValue(WhichResult);
|
|
|
|
if (isVZIP_v_undef_Mask(ShuffleMask, VT, WhichResult))
|
|
|
|
return DAG.getNode(ARMISD::VZIP, dl, DAG.getVTList(VT, VT),
|
|
|
|
V1, V1).getValue(WhichResult);
|
|
|
|
}
|
2009-12-03 06:40:55 +00:00
|
|
|
|
2009-08-21 20:54:19 +00:00
|
|
|
// If the shuffle is not directly supported and it has 4 elements, use
|
|
|
|
// the PerfectShuffle-generated table to synthesize it from other shuffles.
|
2010-05-22 00:23:12 +00:00
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
if (NumElts == 4) {
|
2009-08-21 12:41:24 +00:00
|
|
|
unsigned PFIndexes[4];
|
|
|
|
for (unsigned i = 0; i != 4; ++i) {
|
|
|
|
if (ShuffleMask[i] < 0)
|
|
|
|
PFIndexes[i] = 8;
|
|
|
|
else
|
|
|
|
PFIndexes[i] = ShuffleMask[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Compute the index in the perfect shuffle table.
|
|
|
|
unsigned PFTableIndex =
|
|
|
|
PFIndexes[0]*9*9*9+PFIndexes[1]*9*9+PFIndexes[2]*9+PFIndexes[3];
|
|
|
|
unsigned PFEntry = PerfectShuffleTable[PFTableIndex];
|
|
|
|
unsigned Cost = (PFEntry >> 30);
|
|
|
|
|
|
|
|
if (Cost <= 4)
|
|
|
|
return GeneratePerfectShuffle(PFEntry, V1, V2, DAG, dl);
|
|
|
|
}
|
2009-08-12 22:31:50 +00:00
|
|
|
|
2010-06-04 00:04:02 +00:00
|
|
|
// Implement shuffles with 32- or 64-bit elements as ARMISD::BUILD_VECTORs.
|
2010-05-22 00:23:12 +00:00
|
|
|
if (EltSize >= 32) {
|
|
|
|
// Do the expansion with floating-point types, since that is what the VFP
|
|
|
|
// registers are defined to use, and since i64 is not legal.
|
|
|
|
EVT EltVT = EVT::getFloatingPointVT(EltSize);
|
|
|
|
EVT VecVT = EVT::getVectorVT(*DAG.getContext(), EltVT, NumElts);
|
2010-11-23 03:31:01 +00:00
|
|
|
V1 = DAG.getNode(ISD::BITCAST, dl, VecVT, V1);
|
|
|
|
V2 = DAG.getNode(ISD::BITCAST, dl, VecVT, V2);
|
2010-06-04 00:04:02 +00:00
|
|
|
SmallVector<SDValue, 8> Ops;
|
2010-05-22 00:23:12 +00:00
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
2010-05-20 18:39:53 +00:00
|
|
|
if (ShuffleMask[i] < 0)
|
2010-06-04 00:04:02 +00:00
|
|
|
Ops.push_back(DAG.getUNDEF(EltVT));
|
|
|
|
else
|
|
|
|
Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
|
|
|
|
ShuffleMask[i] < (int)NumElts ? V1 : V2,
|
|
|
|
DAG.getConstant(ShuffleMask[i] & (NumElts-1),
|
|
|
|
MVT::i32)));
|
2010-05-20 18:39:53 +00:00
|
|
|
}
|
2010-06-04 00:04:02 +00:00
|
|
|
SDValue Val = DAG.getNode(ARMISD::BUILD_VECTOR, dl, VecVT, &Ops[0],NumElts);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Val);
|
2010-05-20 18:39:53 +00:00
|
|
|
}
|
|
|
|
|
2009-08-14 05:16:33 +00:00
|
|
|
return SDValue();
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SDValue LowerEXTRACT_VECTOR_ELT(SDValue Op, SelectionDAG &DAG) {
|
2010-11-03 16:24:50 +00:00
|
|
|
// EXTRACT_VECTOR_ELT is legal only for immediate indexes.
|
2009-06-22 23:27:02 +00:00
|
|
|
SDValue Lane = Op.getOperand(1);
|
2010-11-03 16:24:50 +00:00
|
|
|
if (!isa<ConstantSDNode>(Lane))
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue Vec = Op.getOperand(0);
|
|
|
|
if (Op.getValueType() == MVT::i32 &&
|
|
|
|
Vec.getValueType().getVectorElementType().getSizeInBits() < 32) {
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
|
|
|
return DAG.getNode(ARMISD::VGETLANEu, dl, MVT::i32, Vec, Lane);
|
|
|
|
}
|
|
|
|
|
|
|
|
return Op;
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2009-08-03 20:36:38 +00:00
|
|
|
static SDValue LowerCONCAT_VECTORS(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
// The only time a CONCAT_VECTORS operation can have legal types is when
|
|
|
|
// two 64-bit vectors are concatenated to a 128-bit vector.
|
|
|
|
assert(Op.getValueType().is128BitVector() && Op.getNumOperands() == 2 &&
|
|
|
|
"unexpected CONCAT_VECTORS");
|
|
|
|
DebugLoc dl = Op.getDebugLoc();
|
2009-08-11 20:47:22 +00:00
|
|
|
SDValue Val = DAG.getUNDEF(MVT::v2f64);
|
2009-08-03 20:36:38 +00:00
|
|
|
SDValue Op0 = Op.getOperand(0);
|
|
|
|
SDValue Op1 = Op.getOperand(1);
|
|
|
|
if (Op0.getOpcode() != ISD::UNDEF)
|
2009-08-11 20:47:22 +00:00
|
|
|
Val = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64, Val,
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG.getNode(ISD::BITCAST, dl, MVT::f64, Op0),
|
2009-08-03 20:36:38 +00:00
|
|
|
DAG.getIntPtrConstant(0));
|
|
|
|
if (Op1.getOpcode() != ISD::UNDEF)
|
2009-08-11 20:47:22 +00:00
|
|
|
Val = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, MVT::v2f64, Val,
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG.getNode(ISD::BITCAST, dl, MVT::f64, Op1),
|
2009-08-03 20:36:38 +00:00
|
|
|
DAG.getIntPtrConstant(1));
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, Op.getValueType(), Val);
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
2010-11-23 19:38:38 +00:00
|
|
|
/// isExtendedBUILD_VECTOR - Check if N is a constant BUILD_VECTOR where each
|
|
|
|
/// element has been zero/sign-extended, depending on the isSigned parameter,
|
|
|
|
/// from an integer type half its size.
|
|
|
|
static bool isExtendedBUILD_VECTOR(SDNode *N, SelectionDAG &DAG,
|
|
|
|
bool isSigned) {
|
|
|
|
// A v2i64 BUILD_VECTOR will have been legalized to a BITCAST from v4i32.
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
if (VT == MVT::v2i64 && N->getOpcode() == ISD::BITCAST) {
|
|
|
|
SDNode *BVN = N->getOperand(0).getNode();
|
|
|
|
if (BVN->getValueType(0) != MVT::v4i32 ||
|
|
|
|
BVN->getOpcode() != ISD::BUILD_VECTOR)
|
|
|
|
return false;
|
|
|
|
unsigned LoElt = DAG.getTargetLoweringInfo().isBigEndian() ? 1 : 0;
|
|
|
|
unsigned HiElt = 1 - LoElt;
|
|
|
|
ConstantSDNode *Lo0 = dyn_cast<ConstantSDNode>(BVN->getOperand(LoElt));
|
|
|
|
ConstantSDNode *Hi0 = dyn_cast<ConstantSDNode>(BVN->getOperand(HiElt));
|
|
|
|
ConstantSDNode *Lo1 = dyn_cast<ConstantSDNode>(BVN->getOperand(LoElt+2));
|
|
|
|
ConstantSDNode *Hi1 = dyn_cast<ConstantSDNode>(BVN->getOperand(HiElt+2));
|
|
|
|
if (!Lo0 || !Hi0 || !Lo1 || !Hi1)
|
|
|
|
return false;
|
|
|
|
if (isSigned) {
|
|
|
|
if (Hi0->getSExtValue() == Lo0->getSExtValue() >> 32 &&
|
|
|
|
Hi1->getSExtValue() == Lo1->getSExtValue() >> 32)
|
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
if (Hi0->isNullValue() && Hi1->isNullValue())
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (N->getOpcode() != ISD::BUILD_VECTOR)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
|
|
|
|
SDNode *Elt = N->getOperand(i).getNode();
|
|
|
|
if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Elt)) {
|
|
|
|
unsigned EltSize = VT.getVectorElementType().getSizeInBits();
|
|
|
|
unsigned HalfSize = EltSize / 2;
|
|
|
|
if (isSigned) {
|
|
|
|
int64_t SExtVal = C->getSExtValue();
|
|
|
|
if ((SExtVal >> HalfSize) != (SExtVal >> EltSize))
|
|
|
|
return false;
|
|
|
|
} else {
|
|
|
|
if ((C->getZExtValue() >> HalfSize) != 0)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isSignExtended - Check if a node is a vector value that is sign-extended
|
|
|
|
/// or a constant BUILD_VECTOR with sign-extended elements.
|
|
|
|
static bool isSignExtended(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
if (N->getOpcode() == ISD::SIGN_EXTEND || ISD::isSEXTLoad(N))
|
|
|
|
return true;
|
|
|
|
if (isExtendedBUILD_VECTOR(N, DAG, true))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isZeroExtended - Check if a node is a vector value that is zero-extended
|
|
|
|
/// or a constant BUILD_VECTOR with zero-extended elements.
|
|
|
|
static bool isZeroExtended(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
if (N->getOpcode() == ISD::ZERO_EXTEND || ISD::isZEXTLoad(N))
|
|
|
|
return true;
|
|
|
|
if (isExtendedBUILD_VECTOR(N, DAG, false))
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// SkipExtension - For a node that is a SIGN_EXTEND, ZERO_EXTEND, extending
|
|
|
|
/// load, or BUILD_VECTOR with extended elements, return the unextended value.
|
2010-09-01 23:50:19 +00:00
|
|
|
static SDValue SkipExtension(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
if (N->getOpcode() == ISD::SIGN_EXTEND || N->getOpcode() == ISD::ZERO_EXTEND)
|
|
|
|
return N->getOperand(0);
|
2010-11-23 19:38:38 +00:00
|
|
|
if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N))
|
|
|
|
return DAG.getLoad(LD->getMemoryVT(), N->getDebugLoc(), LD->getChain(),
|
|
|
|
LD->getBasePtr(), LD->getPointerInfo(), LD->isVolatile(),
|
|
|
|
LD->isNonTemporal(), LD->getAlignment());
|
|
|
|
// Otherwise, the value must be a BUILD_VECTOR. For v2i64, it will
|
|
|
|
// have been legalized as a BITCAST from v4i32.
|
|
|
|
if (N->getOpcode() == ISD::BITCAST) {
|
|
|
|
SDNode *BVN = N->getOperand(0).getNode();
|
|
|
|
assert(BVN->getOpcode() == ISD::BUILD_VECTOR &&
|
|
|
|
BVN->getValueType(0) == MVT::v4i32 && "expected v4i32 BUILD_VECTOR");
|
|
|
|
unsigned LowElt = DAG.getTargetLoweringInfo().isBigEndian() ? 1 : 0;
|
|
|
|
return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), MVT::v2i32,
|
|
|
|
BVN->getOperand(LowElt), BVN->getOperand(LowElt+2));
|
|
|
|
}
|
|
|
|
// Construct a new BUILD_VECTOR with elements truncated to half the size.
|
|
|
|
assert(N->getOpcode() == ISD::BUILD_VECTOR && "expected BUILD_VECTOR");
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
unsigned EltSize = VT.getVectorElementType().getSizeInBits() / 2;
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
MVT TruncVT = MVT::getIntegerVT(EltSize);
|
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
for (unsigned i = 0; i != NumElts; ++i) {
|
|
|
|
ConstantSDNode *C = cast<ConstantSDNode>(N->getOperand(i));
|
|
|
|
const APInt &CInt = C->getAPIntValue();
|
2010-12-07 08:25:19 +00:00
|
|
|
Ops.push_back(DAG.getConstant(CInt.trunc(EltSize), TruncVT));
|
2010-11-23 19:38:38 +00:00
|
|
|
}
|
|
|
|
return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(),
|
|
|
|
MVT::getVectorVT(TruncVT, NumElts), Ops.data(), NumElts);
|
2010-09-01 23:50:19 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SDValue LowerMUL(SDValue Op, SelectionDAG &DAG) {
|
|
|
|
// Multiplications are only custom-lowered for 128-bit vectors so that
|
|
|
|
// VMULL can be detected. Otherwise v2i64 multiplications are not legal.
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
assert(VT.is128BitVector() && "unexpected type for custom-lowering ISD::MUL");
|
|
|
|
SDNode *N0 = Op.getOperand(0).getNode();
|
|
|
|
SDNode *N1 = Op.getOperand(1).getNode();
|
|
|
|
unsigned NewOpc = 0;
|
2010-11-23 19:38:38 +00:00
|
|
|
if (isSignExtended(N0, DAG) && isSignExtended(N1, DAG))
|
2010-09-01 23:50:19 +00:00
|
|
|
NewOpc = ARMISD::VMULLs;
|
2010-11-23 19:38:38 +00:00
|
|
|
else if (isZeroExtended(N0, DAG) && isZeroExtended(N1, DAG))
|
2010-09-01 23:50:19 +00:00
|
|
|
NewOpc = ARMISD::VMULLu;
|
2010-11-23 19:38:38 +00:00
|
|
|
else if (VT == MVT::v2i64)
|
2010-09-01 23:50:19 +00:00
|
|
|
// Fall through to expand this. It is not legal.
|
|
|
|
return SDValue();
|
2010-11-23 19:38:38 +00:00
|
|
|
else
|
2010-09-01 23:50:19 +00:00
|
|
|
// Other vector multiplications are legal.
|
|
|
|
return Op;
|
|
|
|
|
|
|
|
// Legalize to a VMULL instruction.
|
|
|
|
DebugLoc DL = Op.getDebugLoc();
|
|
|
|
SDValue Op0 = SkipExtension(N0, DAG);
|
|
|
|
SDValue Op1 = SkipExtension(N1, DAG);
|
|
|
|
|
|
|
|
assert(Op0.getValueType().is64BitVector() &&
|
|
|
|
Op1.getValueType().is64BitVector() &&
|
|
|
|
"unexpected types for extended operands to VMULL");
|
|
|
|
return DAG.getNode(NewOpc, DL, VT, Op0, Op1);
|
|
|
|
}
|
|
|
|
|
2010-04-17 15:26:15 +00:00
|
|
|
SDValue ARMTargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const {
|
2007-01-19 07:51:42 +00:00
|
|
|
switch (Op.getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("Don't know how to custom lower this!");
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::ConstantPool: return LowerConstantPool(Op, DAG);
|
2009-10-30 05:45:42 +00:00
|
|
|
case ISD::BlockAddress: return LowerBlockAddress(Op, DAG);
|
2007-04-22 00:04:12 +00:00
|
|
|
case ISD::GlobalAddress:
|
|
|
|
return Subtarget->isTargetDarwin() ? LowerGlobalAddressDarwin(Op, DAG) :
|
|
|
|
LowerGlobalAddressELF(Op, DAG);
|
2007-04-27 13:54:47 +00:00
|
|
|
case ISD::GlobalTLSAddress: return LowerGlobalTLSAddress(Op, DAG);
|
Consider this code snippet:
float t1(int argc) {
return (argc == 1123) ? 1.234f : 2.38213f;
}
We would generate truly awful code on ARM (those with a weak stomach should look
away):
_t1:
movw r1, #1123
movs r2, #1
movs r3, #0
cmp r0, r1
mov.w r0, #0
it eq
moveq r0, r2
movs r1, #4
cmp r0, #0
it ne
movne r3, r1
adr r0, #LCPI1_0
ldr r0, [r0, r3]
bx lr
The problem was that legalization was creating a cascade of SELECT_CC nodes, for
for the comparison of "argc == 1123" which was fed into a SELECT node for the ?:
statement which was itself converted to a SELECT_CC node. This is because the
ARM back-end doesn't have custom lowering for SELECT nodes, so it used the
default "Expand".
I added a fairly simple "LowerSELECT" to the ARM back-end. It takes care of this
testcase, but can obviously be expanded to include more cases.
Now we generate this, which looks optimal to me:
_t1:
movw r1, #1123
movs r2, #0
cmp r0, r1
adr r0, #LCPI0_0
it eq
moveq r2, #4
ldr r0, [r0, r2]
bx lr
.align 2
LCPI0_0:
.long 1075344593 @ float 2.382130e+00
.long 1067316150 @ float 1.234000e+00
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@110799 91177308-0d34-0410-b5e6-96231b3b80d8
2010-08-11 08:43:16 +00:00
|
|
|
case ISD::SELECT: return LowerSELECT(Op, DAG);
|
2009-11-12 07:13:11 +00:00
|
|
|
case ISD::SELECT_CC: return LowerSELECT_CC(Op, DAG);
|
|
|
|
case ISD::BR_CC: return LowerBR_CC(Op, DAG);
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::BR_JT: return LowerBR_JT(Op, DAG);
|
2010-04-17 14:41:14 +00:00
|
|
|
case ISD::VASTART: return LowerVASTART(Op, DAG);
|
2009-12-14 21:24:16 +00:00
|
|
|
case ISD::MEMBARRIER: return LowerMEMBARRIER(Op, DAG, Subtarget);
|
2010-11-03 06:34:55 +00:00
|
|
|
case ISD::PREFETCH: return LowerPREFETCH(Op, DAG, Subtarget);
|
2010-03-19 22:51:32 +00:00
|
|
|
case ISD::SINT_TO_FP:
|
|
|
|
case ISD::UINT_TO_FP: return LowerINT_TO_FP(Op, DAG);
|
|
|
|
case ISD::FP_TO_SINT:
|
|
|
|
case ISD::FP_TO_UINT: return LowerFP_TO_INT(Op, DAG);
|
2007-01-19 07:51:42 +00:00
|
|
|
case ISD::FCOPYSIGN: return LowerFCOPYSIGN(Op, DAG);
|
2010-05-22 01:47:14 +00:00
|
|
|
case ISD::RETURNADDR: return LowerRETURNADDR(Op, DAG);
|
2009-05-12 23:59:14 +00:00
|
|
|
case ISD::FRAMEADDR: return LowerFRAMEADDR(Op, DAG);
|
2007-04-22 00:04:12 +00:00
|
|
|
case ISD::GLOBAL_OFFSET_TABLE: return LowerGLOBAL_OFFSET_TABLE(Op, DAG);
|
2010-05-26 20:22:18 +00:00
|
|
|
case ISD::EH_SJLJ_SETJMP: return LowerEH_SJLJ_SETJMP(Op, DAG);
|
2010-05-22 01:06:18 +00:00
|
|
|
case ISD::EH_SJLJ_LONGJMP: return LowerEH_SJLJ_LONGJMP(Op, DAG);
|
2010-10-19 23:27:08 +00:00
|
|
|
case ISD::EH_SJLJ_DISPATCHSETUP: return LowerEH_SJLJ_DISPATCHSETUP(Op, DAG);
|
2010-02-08 23:22:00 +00:00
|
|
|
case ISD::INTRINSIC_WO_CHAIN: return LowerINTRINSIC_WO_CHAIN(Op, DAG,
|
|
|
|
Subtarget);
|
2010-11-23 03:31:01 +00:00
|
|
|
case ISD::BITCAST: return ExpandBITCAST(Op.getNode(), DAG);
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SHL:
|
2007-11-24 07:07:01 +00:00
|
|
|
case ISD::SRL:
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SRA: return LowerShift(Op.getNode(), DAG, Subtarget);
|
2009-11-12 07:13:11 +00:00
|
|
|
case ISD::SHL_PARTS: return LowerShiftLeftParts(Op, DAG);
|
2009-10-31 21:42:19 +00:00
|
|
|
case ISD::SRL_PARTS:
|
2009-11-12 07:13:11 +00:00
|
|
|
case ISD::SRA_PARTS: return LowerShiftRightParts(Op, DAG);
|
2010-01-18 19:58:49 +00:00
|
|
|
case ISD::CTTZ: return LowerCTTZ(Op.getNode(), DAG, Subtarget);
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::VSETCC: return LowerVSETCC(Op, DAG);
|
2010-07-29 20:10:08 +00:00
|
|
|
case ISD::BUILD_VECTOR: return LowerBUILD_VECTOR(Op, DAG, Subtarget);
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::VECTOR_SHUFFLE: return LowerVECTOR_SHUFFLE(Op, DAG);
|
|
|
|
case ISD::EXTRACT_VECTOR_ELT: return LowerEXTRACT_VECTOR_ELT(Op, DAG);
|
2009-08-03 20:36:38 +00:00
|
|
|
case ISD::CONCAT_VECTORS: return LowerCONCAT_VECTORS(Op, DAG);
|
2010-08-20 04:54:02 +00:00
|
|
|
case ISD::FLT_ROUNDS_: return LowerFLT_ROUNDS_(Op, DAG);
|
2010-09-01 23:50:19 +00:00
|
|
|
case ISD::MUL: return LowerMUL(Op, DAG);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2008-07-27 21:46:04 +00:00
|
|
|
return SDValue();
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2008-12-01 11:39:25 +00:00
|
|
|
/// ReplaceNodeResults - Replace the results of node with an illegal result
|
|
|
|
/// type with new values built out of custom code.
|
|
|
|
void ARMTargetLowering::ReplaceNodeResults(SDNode *N,
|
|
|
|
SmallVectorImpl<SDValue>&Results,
|
2010-04-17 15:26:15 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2010-04-14 20:45:23 +00:00
|
|
|
SDValue Res;
|
2007-11-24 07:07:01 +00:00
|
|
|
switch (N->getOpcode()) {
|
2008-12-01 11:39:25 +00:00
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("Don't know how to custom expand this!");
|
2010-04-14 20:45:23 +00:00
|
|
|
break;
|
2010-11-23 03:31:01 +00:00
|
|
|
case ISD::BITCAST:
|
|
|
|
Res = ExpandBITCAST(N, DAG);
|
2010-04-14 20:45:23 +00:00
|
|
|
break;
|
2007-11-24 07:07:01 +00:00
|
|
|
case ISD::SRL:
|
2010-04-14 20:45:23 +00:00
|
|
|
case ISD::SRA:
|
2010-11-18 21:16:28 +00:00
|
|
|
Res = Expand64BitShift(N, DAG, Subtarget);
|
2010-04-14 20:45:23 +00:00
|
|
|
break;
|
2007-11-24 07:07:01 +00:00
|
|
|
}
|
2010-04-14 20:45:23 +00:00
|
|
|
if (Res.getNode())
|
|
|
|
Results.push_back(Res);
|
2007-11-24 07:07:01 +00:00
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ARM Scheduler Hooks
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-12-11 01:42:04 +00:00
|
|
|
MachineBasicBlock *
|
2009-12-12 01:40:06 +00:00
|
|
|
ARMTargetLowering::EmitAtomicCmpSwap(MachineInstr *MI,
|
|
|
|
MachineBasicBlock *BB,
|
|
|
|
unsigned Size) const {
|
2009-12-11 01:42:04 +00:00
|
|
|
unsigned dest = MI->getOperand(0).getReg();
|
|
|
|
unsigned ptr = MI->getOperand(1).getReg();
|
|
|
|
unsigned oldval = MI->getOperand(2).getReg();
|
|
|
|
unsigned newval = MI->getOperand(3).getReg();
|
|
|
|
unsigned scratch = BB->getParent()->getRegInfo()
|
|
|
|
.createVirtualRegister(ARM::GPRRegisterClass);
|
|
|
|
const TargetInstrInfo *TII = getTargetMachine().getInstrInfo();
|
|
|
|
DebugLoc dl = MI->getDebugLoc();
|
2009-12-14 20:14:59 +00:00
|
|
|
bool isThumb2 = Subtarget->isThumb2();
|
2009-12-11 01:42:04 +00:00
|
|
|
|
|
|
|
unsigned ldrOpc, strOpc;
|
|
|
|
switch (Size) {
|
|
|
|
default: llvm_unreachable("unsupported size for AtomicCmpSwap!");
|
2009-12-14 20:14:59 +00:00
|
|
|
case 1:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREXB : ARM::LDREXB;
|
|
|
|
strOpc = isThumb2 ? ARM::t2LDREXB : ARM::STREXB;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREXH : ARM::LDREXH;
|
|
|
|
strOpc = isThumb2 ? ARM::t2STREXH : ARM::STREXH;
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREX : ARM::LDREX;
|
|
|
|
strOpc = isThumb2 ? ARM::t2STREX : ARM::STREX;
|
|
|
|
break;
|
2009-12-11 01:42:04 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
MachineFunction *MF = BB->getParent();
|
|
|
|
const BasicBlock *LLVM_BB = BB->getBasicBlock();
|
|
|
|
MachineFunction::iterator It = BB;
|
|
|
|
++It; // insert the new blocks after the current block
|
|
|
|
|
|
|
|
MachineBasicBlock *loop1MBB = MF->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *loop2MBB = MF->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *exitMBB = MF->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MF->insert(It, loop1MBB);
|
|
|
|
MF->insert(It, loop2MBB);
|
|
|
|
MF->insert(It, exitMBB);
|
2010-07-06 20:24:04 +00:00
|
|
|
|
|
|
|
// Transfer the remainder of BB and its successor edges to exitMBB.
|
|
|
|
exitMBB->splice(exitMBB->begin(), BB,
|
|
|
|
llvm::next(MachineBasicBlock::iterator(MI)),
|
|
|
|
BB->end());
|
|
|
|
exitMBB->transferSuccessorsAndUpdatePHIs(BB);
|
2009-12-11 01:42:04 +00:00
|
|
|
|
|
|
|
// thisMBB:
|
|
|
|
// ...
|
|
|
|
// fallthrough --> loop1MBB
|
|
|
|
BB->addSuccessor(loop1MBB);
|
|
|
|
|
|
|
|
// loop1MBB:
|
|
|
|
// ldrex dest, [ptr]
|
|
|
|
// cmp dest, oldval
|
|
|
|
// bne exitMBB
|
|
|
|
BB = loop1MBB;
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(ldrOpc), dest).addReg(ptr));
|
2009-12-14 20:14:59 +00:00
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2CMPrr : ARM::CMPrr))
|
2009-12-11 01:42:04 +00:00
|
|
|
.addReg(dest).addReg(oldval));
|
2009-12-14 20:14:59 +00:00
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2Bcc : ARM::Bcc))
|
|
|
|
.addMBB(exitMBB).addImm(ARMCC::NE).addReg(ARM::CPSR);
|
2009-12-11 01:42:04 +00:00
|
|
|
BB->addSuccessor(loop2MBB);
|
|
|
|
BB->addSuccessor(exitMBB);
|
|
|
|
|
|
|
|
// loop2MBB:
|
|
|
|
// strex scratch, newval, [ptr]
|
|
|
|
// cmp scratch, #0
|
|
|
|
// bne loop1MBB
|
|
|
|
BB = loop2MBB;
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(strOpc), scratch).addReg(newval)
|
|
|
|
.addReg(ptr));
|
2009-12-14 20:14:59 +00:00
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2CMPri : ARM::CMPri))
|
2009-12-11 01:42:04 +00:00
|
|
|
.addReg(scratch).addImm(0));
|
2009-12-14 20:14:59 +00:00
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2Bcc : ARM::Bcc))
|
|
|
|
.addMBB(loop1MBB).addImm(ARMCC::NE).addReg(ARM::CPSR);
|
2009-12-11 01:42:04 +00:00
|
|
|
BB->addSuccessor(loop1MBB);
|
|
|
|
BB->addSuccessor(exitMBB);
|
|
|
|
|
|
|
|
// exitMBB:
|
|
|
|
// ...
|
|
|
|
BB = exitMBB;
|
2010-01-15 00:18:34 +00:00
|
|
|
|
2010-07-06 20:24:04 +00:00
|
|
|
MI->eraseFromParent(); // The instruction is gone now.
|
2010-01-15 00:18:34 +00:00
|
|
|
|
2009-12-11 01:42:04 +00:00
|
|
|
return BB;
|
|
|
|
}
|
|
|
|
|
2009-12-12 01:40:06 +00:00
|
|
|
MachineBasicBlock *
|
|
|
|
ARMTargetLowering::EmitAtomicBinary(MachineInstr *MI, MachineBasicBlock *BB,
|
|
|
|
unsigned Size, unsigned BinOpcode) const {
|
2009-12-14 04:22:04 +00:00
|
|
|
// This also handles ATOMIC_SWAP, indicated by BinOpcode==0.
|
|
|
|
const TargetInstrInfo *TII = getTargetMachine().getInstrInfo();
|
|
|
|
|
|
|
|
const BasicBlock *LLVM_BB = BB->getBasicBlock();
|
2010-01-15 00:22:18 +00:00
|
|
|
MachineFunction *MF = BB->getParent();
|
2009-12-14 04:22:04 +00:00
|
|
|
MachineFunction::iterator It = BB;
|
|
|
|
++It;
|
|
|
|
|
|
|
|
unsigned dest = MI->getOperand(0).getReg();
|
|
|
|
unsigned ptr = MI->getOperand(1).getReg();
|
|
|
|
unsigned incr = MI->getOperand(2).getReg();
|
|
|
|
DebugLoc dl = MI->getDebugLoc();
|
2009-12-18 16:59:39 +00:00
|
|
|
|
2009-12-14 20:14:59 +00:00
|
|
|
bool isThumb2 = Subtarget->isThumb2();
|
2009-12-14 04:22:04 +00:00
|
|
|
unsigned ldrOpc, strOpc;
|
|
|
|
switch (Size) {
|
|
|
|
default: llvm_unreachable("unsupported size for AtomicCmpSwap!");
|
2009-12-14 20:14:59 +00:00
|
|
|
case 1:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREXB : ARM::LDREXB;
|
2010-01-13 19:54:39 +00:00
|
|
|
strOpc = isThumb2 ? ARM::t2STREXB : ARM::STREXB;
|
2009-12-14 20:14:59 +00:00
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREXH : ARM::LDREXH;
|
|
|
|
strOpc = isThumb2 ? ARM::t2STREXH : ARM::STREXH;
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
ldrOpc = isThumb2 ? ARM::t2LDREX : ARM::LDREX;
|
|
|
|
strOpc = isThumb2 ? ARM::t2STREX : ARM::STREX;
|
|
|
|
break;
|
2009-12-14 04:22:04 +00:00
|
|
|
}
|
|
|
|
|
2010-01-15 00:22:18 +00:00
|
|
|
MachineBasicBlock *loopMBB = MF->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *exitMBB = MF->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MF->insert(It, loopMBB);
|
|
|
|
MF->insert(It, exitMBB);
|
2010-07-06 20:24:04 +00:00
|
|
|
|
|
|
|
// Transfer the remainder of BB and its successor edges to exitMBB.
|
|
|
|
exitMBB->splice(exitMBB->begin(), BB,
|
|
|
|
llvm::next(MachineBasicBlock::iterator(MI)),
|
|
|
|
BB->end());
|
|
|
|
exitMBB->transferSuccessorsAndUpdatePHIs(BB);
|
2009-12-14 04:22:04 +00:00
|
|
|
|
2010-01-15 00:22:18 +00:00
|
|
|
MachineRegisterInfo &RegInfo = MF->getRegInfo();
|
2009-12-14 04:22:04 +00:00
|
|
|
unsigned scratch = RegInfo.createVirtualRegister(ARM::GPRRegisterClass);
|
|
|
|
unsigned scratch2 = (!BinOpcode) ? incr :
|
|
|
|
RegInfo.createVirtualRegister(ARM::GPRRegisterClass);
|
|
|
|
|
|
|
|
// thisMBB:
|
|
|
|
// ...
|
|
|
|
// fallthrough --> loopMBB
|
|
|
|
BB->addSuccessor(loopMBB);
|
|
|
|
|
|
|
|
// loopMBB:
|
|
|
|
// ldrex dest, ptr
|
2009-12-14 20:14:59 +00:00
|
|
|
// <binop> scratch2, dest, incr
|
|
|
|
// strex scratch, scratch2, ptr
|
2009-12-14 04:22:04 +00:00
|
|
|
// cmp scratch, #0
|
|
|
|
// bne- loopMBB
|
|
|
|
// fallthrough --> exitMBB
|
|
|
|
BB = loopMBB;
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(ldrOpc), dest).addReg(ptr));
|
2009-12-15 00:12:35 +00:00
|
|
|
if (BinOpcode) {
|
|
|
|
// operand order needs to go the other way for NAND
|
|
|
|
if (BinOpcode == ARM::BICrr || BinOpcode == ARM::t2BICrr)
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(BinOpcode), scratch2).
|
|
|
|
addReg(incr).addReg(dest)).addReg(0);
|
|
|
|
else
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(BinOpcode), scratch2).
|
|
|
|
addReg(dest).addReg(incr)).addReg(0);
|
|
|
|
}
|
2009-12-14 04:22:04 +00:00
|
|
|
|
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(strOpc), scratch).addReg(scratch2)
|
|
|
|
.addReg(ptr));
|
2009-12-14 20:14:59 +00:00
|
|
|
AddDefaultPred(BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2CMPri : ARM::CMPri))
|
2009-12-14 04:22:04 +00:00
|
|
|
.addReg(scratch).addImm(0));
|
2009-12-14 20:14:59 +00:00
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2Bcc : ARM::Bcc))
|
|
|
|
.addMBB(loopMBB).addImm(ARMCC::NE).addReg(ARM::CPSR);
|
2009-12-14 04:22:04 +00:00
|
|
|
|
|
|
|
BB->addSuccessor(loopMBB);
|
|
|
|
BB->addSuccessor(exitMBB);
|
|
|
|
|
|
|
|
// exitMBB:
|
|
|
|
// ...
|
|
|
|
BB = exitMBB;
|
2009-12-21 19:53:39 +00:00
|
|
|
|
2010-07-06 20:24:04 +00:00
|
|
|
MI->eraseFromParent(); // The instruction is gone now.
|
2009-12-21 19:53:39 +00:00
|
|
|
|
2009-12-14 04:22:04 +00:00
|
|
|
return BB;
|
2009-12-12 01:40:06 +00:00
|
|
|
}
|
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
static
|
|
|
|
MachineBasicBlock *OtherSucc(MachineBasicBlock *MBB, MachineBasicBlock *Succ) {
|
|
|
|
for (MachineBasicBlock::succ_iterator I = MBB->succ_begin(),
|
|
|
|
E = MBB->succ_end(); I != E; ++I)
|
|
|
|
if (*I != Succ)
|
|
|
|
return *I;
|
|
|
|
llvm_unreachable("Expecting a BB with two successors!");
|
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
MachineBasicBlock *
|
2008-01-30 18:18:23 +00:00
|
|
|
ARMTargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
|
2010-05-01 00:01:06 +00:00
|
|
|
MachineBasicBlock *BB) const {
|
2007-01-19 07:51:42 +00:00
|
|
|
const TargetInstrInfo *TII = getTargetMachine().getInstrInfo();
|
2009-02-13 02:25:56 +00:00
|
|
|
DebugLoc dl = MI->getDebugLoc();
|
2009-12-14 20:14:59 +00:00
|
|
|
bool isThumb2 = Subtarget->isThumb2();
|
2007-01-19 07:51:42 +00:00
|
|
|
switch (MI->getOpcode()) {
|
2009-08-07 00:34:42 +00:00
|
|
|
default:
|
2009-12-11 01:42:04 +00:00
|
|
|
MI->dump();
|
2009-08-07 00:34:42 +00:00
|
|
|
llvm_unreachable("Unexpected instr type to insert");
|
2009-12-11 01:42:04 +00:00
|
|
|
|
2009-12-14 20:14:59 +00:00
|
|
|
case ARM::ATOMIC_LOAD_ADD_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2ADDrr : ARM::ADDrr);
|
|
|
|
case ARM::ATOMIC_LOAD_ADD_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2ADDrr : ARM::ADDrr);
|
|
|
|
case ARM::ATOMIC_LOAD_ADD_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2ADDrr : ARM::ADDrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_LOAD_AND_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2ANDrr : ARM::ANDrr);
|
|
|
|
case ARM::ATOMIC_LOAD_AND_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2ANDrr : ARM::ANDrr);
|
|
|
|
case ARM::ATOMIC_LOAD_AND_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2ANDrr : ARM::ANDrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_LOAD_OR_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2ORRrr : ARM::ORRrr);
|
|
|
|
case ARM::ATOMIC_LOAD_OR_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2ORRrr : ARM::ORRrr);
|
|
|
|
case ARM::ATOMIC_LOAD_OR_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2ORRrr : ARM::ORRrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_LOAD_XOR_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2EORrr : ARM::EORrr);
|
|
|
|
case ARM::ATOMIC_LOAD_XOR_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2EORrr : ARM::EORrr);
|
|
|
|
case ARM::ATOMIC_LOAD_XOR_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2EORrr : ARM::EORrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_LOAD_NAND_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2BICrr : ARM::BICrr);
|
|
|
|
case ARM::ATOMIC_LOAD_NAND_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2BICrr : ARM::BICrr);
|
|
|
|
case ARM::ATOMIC_LOAD_NAND_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2BICrr : ARM::BICrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_LOAD_SUB_I8:
|
|
|
|
return EmitAtomicBinary(MI, BB, 1, isThumb2 ? ARM::t2SUBrr : ARM::SUBrr);
|
|
|
|
case ARM::ATOMIC_LOAD_SUB_I16:
|
|
|
|
return EmitAtomicBinary(MI, BB, 2, isThumb2 ? ARM::t2SUBrr : ARM::SUBrr);
|
|
|
|
case ARM::ATOMIC_LOAD_SUB_I32:
|
|
|
|
return EmitAtomicBinary(MI, BB, 4, isThumb2 ? ARM::t2SUBrr : ARM::SUBrr);
|
|
|
|
|
|
|
|
case ARM::ATOMIC_SWAP_I8: return EmitAtomicBinary(MI, BB, 1, 0);
|
|
|
|
case ARM::ATOMIC_SWAP_I16: return EmitAtomicBinary(MI, BB, 2, 0);
|
|
|
|
case ARM::ATOMIC_SWAP_I32: return EmitAtomicBinary(MI, BB, 4, 0);
|
2009-12-11 01:42:04 +00:00
|
|
|
|
2009-12-12 01:40:06 +00:00
|
|
|
case ARM::ATOMIC_CMP_SWAP_I8: return EmitAtomicCmpSwap(MI, BB, 1);
|
|
|
|
case ARM::ATOMIC_CMP_SWAP_I16: return EmitAtomicCmpSwap(MI, BB, 2);
|
|
|
|
case ARM::ATOMIC_CMP_SWAP_I32: return EmitAtomicCmpSwap(MI, BB, 4);
|
2009-12-11 01:42:04 +00:00
|
|
|
|
2009-08-12 05:17:19 +00:00
|
|
|
case ARM::tMOVCCr_pseudo: {
|
2007-01-19 07:51:42 +00:00
|
|
|
// To "insert" a SELECT_CC instruction, we actually have to insert the
|
|
|
|
// diamond control-flow pattern. The incoming instruction knows the
|
|
|
|
// destination vreg to set, the condition code register to branch on, the
|
|
|
|
// true/false values to select between, and a branch opcode to use.
|
|
|
|
const BasicBlock *LLVM_BB = BB->getBasicBlock();
|
2008-07-07 23:14:23 +00:00
|
|
|
MachineFunction::iterator It = BB;
|
2007-01-19 07:51:42 +00:00
|
|
|
++It;
|
|
|
|
|
|
|
|
// thisMBB:
|
|
|
|
// ...
|
|
|
|
// TrueVal = ...
|
|
|
|
// cmpTY ccX, r1, r2
|
|
|
|
// bCC copy1MBB
|
|
|
|
// fallthrough --> copy0MBB
|
|
|
|
MachineBasicBlock *thisMBB = BB;
|
2008-07-07 23:14:23 +00:00
|
|
|
MachineFunction *F = BB->getParent();
|
|
|
|
MachineBasicBlock *copy0MBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
MachineBasicBlock *sinkMBB = F->CreateMachineBasicBlock(LLVM_BB);
|
|
|
|
F->insert(It, copy0MBB);
|
|
|
|
F->insert(It, sinkMBB);
|
2010-07-06 20:24:04 +00:00
|
|
|
|
|
|
|
// Transfer the remainder of BB and its successor edges to sinkMBB.
|
|
|
|
sinkMBB->splice(sinkMBB->begin(), BB,
|
|
|
|
llvm::next(MachineBasicBlock::iterator(MI)),
|
|
|
|
BB->end());
|
|
|
|
sinkMBB->transferSuccessorsAndUpdatePHIs(BB);
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
BB->addSuccessor(copy0MBB);
|
|
|
|
BB->addSuccessor(sinkMBB);
|
|
|
|
|
2010-07-06 20:24:04 +00:00
|
|
|
BuildMI(BB, dl, TII->get(ARM::tBcc)).addMBB(sinkMBB)
|
|
|
|
.addImm(MI->getOperand(3).getImm()).addReg(MI->getOperand(4).getReg());
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
// copy0MBB:
|
|
|
|
// %FalseValue = ...
|
|
|
|
// # fallthrough to sinkMBB
|
|
|
|
BB = copy0MBB;
|
|
|
|
|
|
|
|
// Update machine-CFG edges
|
|
|
|
BB->addSuccessor(sinkMBB);
|
|
|
|
|
|
|
|
// sinkMBB:
|
|
|
|
// %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
|
|
|
|
// ...
|
|
|
|
BB = sinkMBB;
|
2010-07-06 20:24:04 +00:00
|
|
|
BuildMI(*BB, BB->begin(), dl,
|
|
|
|
TII->get(ARM::PHI), MI->getOperand(0).getReg())
|
2007-01-19 07:51:42 +00:00
|
|
|
.addReg(MI->getOperand(1).getReg()).addMBB(copy0MBB)
|
|
|
|
.addReg(MI->getOperand(2).getReg()).addMBB(thisMBB);
|
|
|
|
|
2010-07-06 20:24:04 +00:00
|
|
|
MI->eraseFromParent(); // The pseudo instruction is gone now.
|
2007-01-19 07:51:42 +00:00
|
|
|
return BB;
|
|
|
|
}
|
2009-08-07 00:34:42 +00:00
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
case ARM::BCCi64:
|
|
|
|
case ARM::BCCZi64: {
|
2010-12-23 22:45:49 +00:00
|
|
|
// If there is an unconditional branch to the other successor, remove it.
|
|
|
|
BB->erase(llvm::next(MachineBasicBlock::iterator(MI)), BB->end());
|
2011-01-19 02:26:13 +00:00
|
|
|
|
2010-07-13 19:27:42 +00:00
|
|
|
// Compare both parts that make up the double comparison separately for
|
|
|
|
// equality.
|
|
|
|
bool RHSisZero = MI->getOpcode() == ARM::BCCZi64;
|
|
|
|
|
|
|
|
unsigned LHS1 = MI->getOperand(1).getReg();
|
|
|
|
unsigned LHS2 = MI->getOperand(2).getReg();
|
|
|
|
if (RHSisZero) {
|
|
|
|
AddDefaultPred(BuildMI(BB, dl,
|
|
|
|
TII->get(isThumb2 ? ARM::t2CMPri : ARM::CMPri))
|
|
|
|
.addReg(LHS1).addImm(0));
|
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2CMPri : ARM::CMPri))
|
|
|
|
.addReg(LHS2).addImm(0)
|
|
|
|
.addImm(ARMCC::EQ).addReg(ARM::CPSR);
|
|
|
|
} else {
|
|
|
|
unsigned RHS1 = MI->getOperand(3).getReg();
|
|
|
|
unsigned RHS2 = MI->getOperand(4).getReg();
|
|
|
|
AddDefaultPred(BuildMI(BB, dl,
|
|
|
|
TII->get(isThumb2 ? ARM::t2CMPrr : ARM::CMPrr))
|
|
|
|
.addReg(LHS1).addReg(RHS1));
|
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2CMPrr : ARM::CMPrr))
|
|
|
|
.addReg(LHS2).addReg(RHS2)
|
|
|
|
.addImm(ARMCC::EQ).addReg(ARM::CPSR);
|
|
|
|
}
|
|
|
|
|
|
|
|
MachineBasicBlock *destMBB = MI->getOperand(RHSisZero ? 3 : 5).getMBB();
|
|
|
|
MachineBasicBlock *exitMBB = OtherSucc(BB, destMBB);
|
|
|
|
if (MI->getOperand(0).getImm() == ARMCC::NE)
|
|
|
|
std::swap(destMBB, exitMBB);
|
|
|
|
|
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2Bcc : ARM::Bcc))
|
|
|
|
.addMBB(destMBB).addImm(ARMCC::EQ).addReg(ARM::CPSR);
|
|
|
|
BuildMI(BB, dl, TII->get(isThumb2 ? ARM::t2B : ARM::B))
|
|
|
|
.addMBB(exitMBB);
|
|
|
|
|
|
|
|
MI->eraseFromParent(); // The pseudo instruction is gone now.
|
|
|
|
return BB;
|
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ARM Optimization Hooks
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
static
|
|
|
|
SDValue combineSelectAndUse(SDNode *N, SDValue Slct, SDValue OtherOp,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
const TargetLowering &TLI = DAG.getTargetLoweringInfo();
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
unsigned Opc = N->getOpcode();
|
|
|
|
bool isSlctCC = Slct.getOpcode() == ISD::SELECT_CC;
|
|
|
|
SDValue LHS = isSlctCC ? Slct.getOperand(2) : Slct.getOperand(1);
|
|
|
|
SDValue RHS = isSlctCC ? Slct.getOperand(3) : Slct.getOperand(2);
|
|
|
|
ISD::CondCode CC = ISD::SETCC_INVALID;
|
|
|
|
|
|
|
|
if (isSlctCC) {
|
|
|
|
CC = cast<CondCodeSDNode>(Slct.getOperand(4))->get();
|
|
|
|
} else {
|
|
|
|
SDValue CCOp = Slct.getOperand(0);
|
|
|
|
if (CCOp.getOpcode() == ISD::SETCC)
|
|
|
|
CC = cast<CondCodeSDNode>(CCOp.getOperand(2))->get();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool DoXform = false;
|
|
|
|
bool InvCC = false;
|
|
|
|
assert ((Opc == ISD::ADD || (Opc == ISD::SUB && Slct == N->getOperand(1))) &&
|
|
|
|
"Bad input!");
|
|
|
|
|
|
|
|
if (LHS.getOpcode() == ISD::Constant &&
|
|
|
|
cast<ConstantSDNode>(LHS)->isNullValue()) {
|
|
|
|
DoXform = true;
|
|
|
|
} else if (CC != ISD::SETCC_INVALID &&
|
|
|
|
RHS.getOpcode() == ISD::Constant &&
|
|
|
|
cast<ConstantSDNode>(RHS)->isNullValue()) {
|
|
|
|
std::swap(LHS, RHS);
|
|
|
|
SDValue Op0 = Slct.getOperand(0);
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT OpVT = isSlctCC ? Op0.getValueType() :
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
Op0.getOperand(0).getValueType();
|
|
|
|
bool isInt = OpVT.isInteger();
|
|
|
|
CC = ISD::getSetCCInverse(CC, isInt);
|
|
|
|
|
|
|
|
if (!TLI.isCondCodeLegal(CC, OpVT))
|
|
|
|
return SDValue(); // Inverse operator isn't legal.
|
|
|
|
|
|
|
|
DoXform = true;
|
|
|
|
InvCC = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (DoXform) {
|
|
|
|
SDValue Result = DAG.getNode(Opc, RHS.getDebugLoc(), VT, OtherOp, RHS);
|
|
|
|
if (isSlctCC)
|
|
|
|
return DAG.getSelectCC(N->getDebugLoc(), OtherOp, Result,
|
|
|
|
Slct.getOperand(0), Slct.getOperand(1), CC);
|
|
|
|
SDValue CCOp = Slct.getOperand(0);
|
|
|
|
if (InvCC)
|
|
|
|
CCOp = DAG.getSetCC(Slct.getDebugLoc(), CCOp.getValueType(),
|
|
|
|
CCOp.getOperand(0), CCOp.getOperand(1), CC);
|
|
|
|
return DAG.getNode(ISD::SELECT, N->getDebugLoc(), VT,
|
|
|
|
CCOp, OtherOp, Result);
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-07-29 20:34:14 +00:00
|
|
|
/// PerformADDCombineWithOperands - Try DAG combinations for an ADD with
|
|
|
|
/// operands N0 and N1. This is a helper for PerformADDCombine that is
|
|
|
|
/// called with the default operands, and if that fails, with commuted
|
|
|
|
/// operands.
|
|
|
|
static SDValue PerformADDCombineWithOperands(SDNode *N, SDValue N0, SDValue N1,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
// fold (add (select cc, 0, c), x) -> (select cc, x, (add, x, c))
|
|
|
|
if (N0.getOpcode() == ISD::SELECT && N0.getNode()->hasOneUse()) {
|
|
|
|
SDValue Result = combineSelectAndUse(N, N0, N1, DCI);
|
|
|
|
if (Result.getNode()) return Result;
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-07-29 20:34:14 +00:00
|
|
|
/// PerformADDCombine - Target-specific dag combine xforms for ISD::ADD.
|
|
|
|
///
|
|
|
|
static SDValue PerformADDCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
SDValue N0 = N->getOperand(0);
|
|
|
|
SDValue N1 = N->getOperand(1);
|
|
|
|
|
|
|
|
// First try with the default operand order.
|
|
|
|
SDValue Result = PerformADDCombineWithOperands(N, N0, N1, DCI);
|
|
|
|
if (Result.getNode())
|
|
|
|
return Result;
|
|
|
|
|
|
|
|
// If that didn't work, try again with the operands commuted.
|
|
|
|
return PerformADDCombineWithOperands(N, N1, N0, DCI);
|
|
|
|
}
|
|
|
|
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
/// PerformSUBCombine - Target-specific dag combine xforms for ISD::SUB.
|
2010-07-29 20:34:14 +00:00
|
|
|
///
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
static SDValue PerformSUBCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
2010-07-29 20:34:14 +00:00
|
|
|
SDValue N0 = N->getOperand(0);
|
|
|
|
SDValue N1 = N->getOperand(1);
|
2009-03-20 22:42:55 +00:00
|
|
|
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
// fold (sub x, (select cc, 0, c)) -> (select cc, x, (sub, x, c))
|
|
|
|
if (N1.getOpcode() == ISD::SELECT && N1.getNode()->hasOneUse()) {
|
|
|
|
SDValue Result = combineSelectAndUse(N, N1, N0, DCI);
|
|
|
|
if (Result.getNode()) return Result;
|
|
|
|
}
|
2009-03-20 22:42:55 +00:00
|
|
|
|
Move 3 "(add (select cc, 0, c), x) -> (select cc, x, (add, x, c))"
related transformations out of target-specific dag combine into the
ARM backend. These were added by Evan in r37685 with no testcases
and only seems to help ARM (e.g. test/CodeGen/ARM/select_xform.ll).
Add some simple X86-specific (for now) DAG combines that turn things
like cond ? 8 : 0 -> (zext(cond) << 3). This happens frequently
with the recently added cp constant select optimization, but is a
very general xform. For example, we now compile the second example
in const-select.ll to:
_test:
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
seta %al
movzbl %al, %eax
movl 4(%esp), %ecx
movsbl (%ecx,%eax,4), %eax
ret
instead of:
_test:
movl 4(%esp), %eax
leal 4(%eax), %ecx
movsd LCPI2_0, %xmm0
ucomisd 8(%esp), %xmm0
cmovbe %eax, %ecx
movsbl (%ecx), %eax
ret
This passes multisource and dejagnu.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@66779 91177308-0d34-0410-b5e6-96231b3b80d8
2009-03-12 06:52:53 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-05-15 18:16:59 +00:00
|
|
|
static SDValue PerformMULCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI,
|
|
|
|
const ARMSubtarget *Subtarget) {
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
|
|
|
|
if (Subtarget->isThumb1Only())
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
if (DCI.isBeforeLegalize() || DCI.isCalledByLegalizer())
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
if (VT != MVT::i32)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
|
|
|
|
if (!C)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
uint64_t MulAmt = C->getZExtValue();
|
|
|
|
unsigned ShiftAmt = CountTrailingZeros_64(MulAmt);
|
|
|
|
ShiftAmt = ShiftAmt & (32 - 1);
|
|
|
|
SDValue V = N->getOperand(0);
|
|
|
|
DebugLoc DL = N->getDebugLoc();
|
|
|
|
|
2010-05-16 08:54:20 +00:00
|
|
|
SDValue Res;
|
|
|
|
MulAmt >>= ShiftAmt;
|
|
|
|
if (isPowerOf2_32(MulAmt - 1)) {
|
|
|
|
// (mul x, 2^N + 1) => (add (shl x, N), x)
|
|
|
|
Res = DAG.getNode(ISD::ADD, DL, VT,
|
|
|
|
V, DAG.getNode(ISD::SHL, DL, VT,
|
|
|
|
V, DAG.getConstant(Log2_32(MulAmt-1),
|
|
|
|
MVT::i32)));
|
|
|
|
} else if (isPowerOf2_32(MulAmt + 1)) {
|
|
|
|
// (mul x, 2^N - 1) => (sub (shl x, N), x)
|
|
|
|
Res = DAG.getNode(ISD::SUB, DL, VT,
|
|
|
|
DAG.getNode(ISD::SHL, DL, VT,
|
|
|
|
V, DAG.getConstant(Log2_32(MulAmt+1),
|
|
|
|
MVT::i32)),
|
|
|
|
V);
|
|
|
|
} else
|
2010-05-15 18:16:59 +00:00
|
|
|
return SDValue();
|
2010-05-16 08:54:20 +00:00
|
|
|
|
|
|
|
if (ShiftAmt != 0)
|
|
|
|
Res = DAG.getNode(ISD::SHL, DL, VT, Res,
|
|
|
|
DAG.getConstant(ShiftAmt, MVT::i32));
|
2010-05-15 18:16:59 +00:00
|
|
|
|
|
|
|
// Do not add new nodes to DAG combiner worklist.
|
2010-05-16 08:54:20 +00:00
|
|
|
DCI.CombineTo(N, Res, false);
|
2010-05-15 18:16:59 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-11-05 19:27:46 +00:00
|
|
|
static SDValue PerformANDCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
// Attempt to use immediate-form VBIC
|
|
|
|
BuildVectorSDNode *BVN = dyn_cast<BuildVectorSDNode>(N->getOperand(1));
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2010-11-05 19:27:46 +00:00
|
|
|
APInt SplatBits, SplatUndef;
|
|
|
|
unsigned SplatBitSize;
|
|
|
|
bool HasAnyUndefs;
|
|
|
|
if (BVN &&
|
|
|
|
BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize, HasAnyUndefs)) {
|
|
|
|
if (SplatBitSize <= 64) {
|
|
|
|
EVT VbicVT;
|
|
|
|
SDValue Val = isNEONModifiedImm((~SplatBits).getZExtValue(),
|
|
|
|
SplatUndef.getZExtValue(), SplatBitSize,
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG, VbicVT, VT.is128BitVector(),
|
2010-11-05 21:57:54 +00:00
|
|
|
OtherModImm);
|
2010-11-05 19:27:46 +00:00
|
|
|
if (Val.getNode()) {
|
|
|
|
SDValue Input =
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG.getNode(ISD::BITCAST, dl, VbicVT, N->getOperand(0));
|
2010-11-05 19:27:46 +00:00
|
|
|
SDValue Vbic = DAG.getNode(ARMISD::VBICIMM, dl, VbicVT, Input, Val);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Vbic);
|
2010-11-05 19:27:46 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2010-11-05 19:27:46 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-07-16 23:05:05 +00:00
|
|
|
/// PerformORCombine - Target-specific dag combine xforms for ISD::OR
|
|
|
|
static SDValue PerformORCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI,
|
|
|
|
const ARMSubtarget *Subtarget) {
|
2010-11-03 23:15:26 +00:00
|
|
|
// Attempt to use immediate-form VORR
|
|
|
|
BuildVectorSDNode *BVN = dyn_cast<BuildVectorSDNode>(N->getOperand(1));
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2010-11-03 23:15:26 +00:00
|
|
|
APInt SplatBits, SplatUndef;
|
|
|
|
unsigned SplatBitSize;
|
|
|
|
bool HasAnyUndefs;
|
|
|
|
if (BVN && Subtarget->hasNEON() &&
|
|
|
|
BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize, HasAnyUndefs)) {
|
|
|
|
if (SplatBitSize <= 64) {
|
|
|
|
EVT VorrVT;
|
|
|
|
SDValue Val = isNEONModifiedImm(SplatBits.getZExtValue(),
|
|
|
|
SplatUndef.getZExtValue(), SplatBitSize,
|
2010-11-05 21:57:54 +00:00
|
|
|
DAG, VorrVT, VT.is128BitVector(),
|
|
|
|
OtherModImm);
|
2010-11-03 23:15:26 +00:00
|
|
|
if (Val.getNode()) {
|
|
|
|
SDValue Input =
|
2010-11-23 03:31:01 +00:00
|
|
|
DAG.getNode(ISD::BITCAST, dl, VorrVT, N->getOperand(0));
|
2010-11-03 23:15:26 +00:00
|
|
|
SDValue Vorr = DAG.getNode(ARMISD::VORRIMM, dl, VorrVT, Input, Val);
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Vorr);
|
2010-11-03 23:15:26 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-07-17 03:30:54 +00:00
|
|
|
// Try to use the ARM/Thumb2 BFI (bitfield insert) instruction when
|
|
|
|
// reasonable.
|
|
|
|
|
2010-07-16 23:05:05 +00:00
|
|
|
// BFI is only available on V6T2+
|
|
|
|
if (Subtarget->isThumb1Only() || !Subtarget->hasV6T2Ops())
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue N0 = N->getOperand(0), N1 = N->getOperand(1);
|
2010-07-17 03:30:54 +00:00
|
|
|
DebugLoc DL = N->getDebugLoc();
|
|
|
|
// 1) or (and A, mask), val => ARMbfi A, val, mask
|
|
|
|
// iff (val & mask) == val
|
|
|
|
//
|
|
|
|
// 2) or (and A, mask), (and B, mask2) => ARMbfi A, (lsr B, amt), mask
|
|
|
|
// 2a) iff isBitFieldInvertedMask(mask) && isBitFieldInvertedMask(~mask2)
|
|
|
|
// && CountPopulation_32(mask) == CountPopulation_32(~mask2)
|
|
|
|
// 2b) iff isBitFieldInvertedMask(~mask) && isBitFieldInvertedMask(mask2)
|
|
|
|
// && CountPopulation_32(mask) == CountPopulation_32(~mask2)
|
|
|
|
// (i.e., copy a bitfield value into another bitfield of the same width)
|
|
|
|
if (N0.getOpcode() != ISD::AND)
|
2010-07-16 23:05:05 +00:00
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
if (VT != MVT::i32)
|
|
|
|
return SDValue();
|
|
|
|
|
2010-12-13 20:32:54 +00:00
|
|
|
SDValue N00 = N0.getOperand(0);
|
2010-07-17 03:30:54 +00:00
|
|
|
|
2010-07-16 23:05:05 +00:00
|
|
|
// The value and the mask need to be constants so we can verify this is
|
|
|
|
// actually a bitfield set. If the mask is 0xffff, we can do better
|
|
|
|
// via a movt instruction, so don't use BFI in that case.
|
2010-12-13 20:32:54 +00:00
|
|
|
SDValue MaskOp = N0.getOperand(1);
|
|
|
|
ConstantSDNode *MaskC = dyn_cast<ConstantSDNode>(MaskOp);
|
|
|
|
if (!MaskC)
|
2010-07-16 23:05:05 +00:00
|
|
|
return SDValue();
|
2010-12-13 20:32:54 +00:00
|
|
|
unsigned Mask = MaskC->getZExtValue();
|
2010-07-16 23:05:05 +00:00
|
|
|
if (Mask == 0xffff)
|
|
|
|
return SDValue();
|
2010-07-17 03:30:54 +00:00
|
|
|
SDValue Res;
|
|
|
|
// Case (1): or (and A, mask), val => ARMbfi A, val, mask
|
2010-12-13 20:32:54 +00:00
|
|
|
ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
|
|
|
|
if (N1C) {
|
|
|
|
unsigned Val = N1C->getZExtValue();
|
2010-12-11 04:11:38 +00:00
|
|
|
if ((Val & ~Mask) != Val)
|
2010-07-17 03:30:54 +00:00
|
|
|
return SDValue();
|
|
|
|
|
2010-12-11 04:11:38 +00:00
|
|
|
if (ARM::isBitFieldInvertedMask(Mask)) {
|
|
|
|
Val >>= CountTrailingZeros_32(~Mask);
|
|
|
|
|
2010-12-13 20:32:54 +00:00
|
|
|
Res = DAG.getNode(ARMISD::BFI, DL, VT, N00,
|
2010-12-11 04:11:38 +00:00
|
|
|
DAG.getConstant(Val, MVT::i32),
|
|
|
|
DAG.getConstant(Mask, MVT::i32));
|
|
|
|
|
|
|
|
// Do not add new nodes to DAG combiner worklist.
|
|
|
|
DCI.CombineTo(N, Res, false);
|
2010-12-13 20:32:54 +00:00
|
|
|
return SDValue();
|
2010-12-11 04:11:38 +00:00
|
|
|
}
|
2010-07-17 03:30:54 +00:00
|
|
|
} else if (N1.getOpcode() == ISD::AND) {
|
|
|
|
// case (2) or (and A, mask), (and B, mask2) => ARMbfi A, (lsr B, amt), mask
|
2010-12-13 20:32:54 +00:00
|
|
|
ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
|
|
|
|
if (!N11C)
|
2010-07-17 03:30:54 +00:00
|
|
|
return SDValue();
|
2010-12-13 20:32:54 +00:00
|
|
|
unsigned Mask2 = N11C->getZExtValue();
|
2010-07-17 03:30:54 +00:00
|
|
|
|
|
|
|
if (ARM::isBitFieldInvertedMask(Mask) &&
|
|
|
|
ARM::isBitFieldInvertedMask(~Mask2) &&
|
|
|
|
(CountPopulation_32(Mask) == CountPopulation_32(~Mask2))) {
|
|
|
|
// The pack halfword instruction works better for masks that fit it,
|
|
|
|
// so use that when it's available.
|
|
|
|
if (Subtarget->hasT2ExtractPack() &&
|
|
|
|
(Mask == 0xffff || Mask == 0xffff0000))
|
|
|
|
return SDValue();
|
|
|
|
// 2a
|
|
|
|
unsigned lsb = CountTrailingZeros_32(Mask2);
|
|
|
|
Res = DAG.getNode(ISD::SRL, DL, VT, N1.getOperand(0),
|
|
|
|
DAG.getConstant(lsb, MVT::i32));
|
2010-12-13 20:32:54 +00:00
|
|
|
Res = DAG.getNode(ARMISD::BFI, DL, VT, N00, Res,
|
2010-07-17 03:30:54 +00:00
|
|
|
DAG.getConstant(Mask, MVT::i32));
|
|
|
|
// Do not add new nodes to DAG combiner worklist.
|
|
|
|
DCI.CombineTo(N, Res, false);
|
2010-12-13 20:32:54 +00:00
|
|
|
return SDValue();
|
2010-07-17 03:30:54 +00:00
|
|
|
} else if (ARM::isBitFieldInvertedMask(~Mask) &&
|
|
|
|
ARM::isBitFieldInvertedMask(Mask2) &&
|
|
|
|
(CountPopulation_32(~Mask) == CountPopulation_32(Mask2))) {
|
|
|
|
// The pack halfword instruction works better for masks that fit it,
|
|
|
|
// so use that when it's available.
|
|
|
|
if (Subtarget->hasT2ExtractPack() &&
|
|
|
|
(Mask2 == 0xffff || Mask2 == 0xffff0000))
|
|
|
|
return SDValue();
|
|
|
|
// 2b
|
|
|
|
unsigned lsb = CountTrailingZeros_32(Mask);
|
2010-12-13 20:32:54 +00:00
|
|
|
Res = DAG.getNode(ISD::SRL, DL, VT, N00,
|
2010-07-17 03:30:54 +00:00
|
|
|
DAG.getConstant(lsb, MVT::i32));
|
|
|
|
Res = DAG.getNode(ARMISD::BFI, DL, VT, N1.getOperand(0), Res,
|
|
|
|
DAG.getConstant(Mask2, MVT::i32));
|
|
|
|
// Do not add new nodes to DAG combiner worklist.
|
|
|
|
DCI.CombineTo(N, Res, false);
|
2010-12-13 20:32:54 +00:00
|
|
|
return SDValue();
|
2010-07-17 03:30:54 +00:00
|
|
|
}
|
|
|
|
}
|
2010-11-23 03:31:01 +00:00
|
|
|
|
2010-12-13 20:32:54 +00:00
|
|
|
if (DAG.MaskedValueIsZero(N1, MaskC->getAPIntValue()) &&
|
|
|
|
N00.getOpcode() == ISD::SHL && isa<ConstantSDNode>(N00.getOperand(1)) &&
|
|
|
|
ARM::isBitFieldInvertedMask(~Mask)) {
|
|
|
|
// Case (3): or (and (shl A, #shamt), mask), B => ARMbfi B, A, ~mask
|
|
|
|
// where lsb(mask) == #shamt and masked bits of B are known zero.
|
|
|
|
SDValue ShAmt = N00.getOperand(1);
|
|
|
|
unsigned ShAmtC = cast<ConstantSDNode>(ShAmt)->getZExtValue();
|
|
|
|
unsigned LSB = CountTrailingZeros_32(Mask);
|
|
|
|
if (ShAmtC != LSB)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
Res = DAG.getNode(ARMISD::BFI, DL, VT, N1, N00.getOperand(0),
|
|
|
|
DAG.getConstant(~Mask, MVT::i32));
|
|
|
|
|
|
|
|
// Do not add new nodes to DAG combiner worklist.
|
|
|
|
DCI.CombineTo(N, Res, false);
|
|
|
|
}
|
|
|
|
|
2010-07-16 23:05:05 +00:00
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-12-14 03:22:07 +00:00
|
|
|
/// PerformBFICombine - (bfi A, (and B, C1), C2) -> (bfi A, B, C2) iff
|
|
|
|
/// C1 & C2 == C1.
|
|
|
|
static SDValue PerformBFICombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
SDValue N1 = N->getOperand(1);
|
|
|
|
if (N1.getOpcode() == ISD::AND) {
|
|
|
|
ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
|
|
|
|
if (!N11C)
|
|
|
|
return SDValue();
|
|
|
|
unsigned Mask = cast<ConstantSDNode>(N->getOperand(2))->getZExtValue();
|
|
|
|
unsigned Mask2 = N11C->getZExtValue();
|
|
|
|
if ((Mask & Mask2) == Mask2)
|
|
|
|
return DCI.DAG.getNode(ARMISD::BFI, N->getDebugLoc(), N->getValueType(0),
|
|
|
|
N->getOperand(0), N1.getOperand(0),
|
|
|
|
N->getOperand(2));
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-09-22 22:09:21 +00:00
|
|
|
/// PerformVMOVRRDCombine - Target-specific dag combine xforms for
|
|
|
|
/// ARMISD::VMOVRRD.
|
|
|
|
static SDValue PerformVMOVRRDCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
// vmovrrd(vmovdrr x, y) -> x,y
|
|
|
|
SDValue InDouble = N->getOperand(0);
|
|
|
|
if (InDouble.getOpcode() == ARMISD::VMOVDRR)
|
|
|
|
return DCI.CombineTo(N, InDouble.getOperand(0), InDouble.getOperand(1));
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// PerformVMOVDRRCombine - Target-specific dag combine xforms for
|
|
|
|
/// ARMISD::VMOVDRR. This is also used for BUILD_VECTORs with 2 operands.
|
|
|
|
static SDValue PerformVMOVDRRCombine(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
// N=vmovrrd(X); vmovdrr(N:0, N:1) -> bit_convert(X)
|
|
|
|
SDValue Op0 = N->getOperand(0);
|
|
|
|
SDValue Op1 = N->getOperand(1);
|
2010-11-23 03:31:01 +00:00
|
|
|
if (Op0.getOpcode() == ISD::BITCAST)
|
2010-09-22 22:09:21 +00:00
|
|
|
Op0 = Op0.getOperand(0);
|
2010-11-23 03:31:01 +00:00
|
|
|
if (Op1.getOpcode() == ISD::BITCAST)
|
2010-09-22 22:09:21 +00:00
|
|
|
Op1 = Op1.getOperand(0);
|
|
|
|
if (Op0.getOpcode() == ARMISD::VMOVRRD &&
|
|
|
|
Op0.getNode() == Op1.getNode() &&
|
|
|
|
Op0.getResNo() == 0 && Op1.getResNo() == 1)
|
2010-11-23 03:31:01 +00:00
|
|
|
return DAG.getNode(ISD::BITCAST, N->getDebugLoc(),
|
2010-09-22 22:09:21 +00:00
|
|
|
N->getValueType(0), Op0.getOperand(0));
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-12-21 06:43:19 +00:00
|
|
|
/// PerformSTORECombine - Target-specific dag combine xforms for
|
|
|
|
/// ISD::STORE.
|
|
|
|
static SDValue PerformSTORECombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
// Bitcast an i64 store extracted from a vector to f64.
|
|
|
|
// Otherwise, the i64 value will be legalized to a pair of i32 values.
|
|
|
|
StoreSDNode *St = cast<StoreSDNode>(N);
|
|
|
|
SDValue StVal = St->getValue();
|
|
|
|
if (!ISD::isNormalStore(St) || St->isVolatile() ||
|
|
|
|
StVal.getValueType() != MVT::i64 ||
|
|
|
|
StVal.getNode()->getOpcode() != ISD::EXTRACT_VECTOR_ELT)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
DebugLoc dl = StVal.getDebugLoc();
|
|
|
|
SDValue IntVec = StVal.getOperand(0);
|
|
|
|
EVT FloatVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64,
|
|
|
|
IntVec.getValueType().getVectorNumElements());
|
|
|
|
SDValue Vec = DAG.getNode(ISD::BITCAST, dl, FloatVT, IntVec);
|
|
|
|
SDValue ExtElt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, MVT::f64,
|
|
|
|
Vec, StVal.getOperand(1));
|
|
|
|
dl = N->getDebugLoc();
|
|
|
|
SDValue V = DAG.getNode(ISD::BITCAST, dl, MVT::i64, ExtElt);
|
|
|
|
// Make the DAGCombiner fold the bitcasts.
|
|
|
|
DCI.AddToWorklist(Vec.getNode());
|
|
|
|
DCI.AddToWorklist(ExtElt.getNode());
|
|
|
|
DCI.AddToWorklist(V.getNode());
|
|
|
|
return DAG.getStore(St->getChain(), dl, V, St->getBasePtr(),
|
|
|
|
St->getPointerInfo(), St->isVolatile(),
|
|
|
|
St->isNonTemporal(), St->getAlignment(),
|
|
|
|
St->getTBAAInfo());
|
|
|
|
}
|
|
|
|
|
|
|
|
/// hasNormalLoadOperand - Check if any of the operands of a BUILD_VECTOR node
|
|
|
|
/// are normal, non-volatile loads. If so, it is profitable to bitcast an
|
|
|
|
/// i64 vector to have f64 elements, since the value can then be loaded
|
|
|
|
/// directly into a VFP register.
|
|
|
|
static bool hasNormalLoadOperand(SDNode *N) {
|
|
|
|
unsigned NumElts = N->getValueType(0).getVectorNumElements();
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
|
|
|
SDNode *Elt = N->getOperand(i).getNode();
|
|
|
|
if (ISD::isNormalLoad(Elt) && !cast<LoadSDNode>(Elt)->isVolatile())
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-09-17 22:59:05 +00:00
|
|
|
/// PerformBUILD_VECTORCombine - Target-specific dag combine xforms for
|
|
|
|
/// ISD::BUILD_VECTOR.
|
2010-12-21 06:43:19 +00:00
|
|
|
static SDValue PerformBUILD_VECTORCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI){
|
2010-09-17 22:59:05 +00:00
|
|
|
// build_vector(N=ARMISD::VMOVRRD(X), N:1) -> bit_convert(X):
|
|
|
|
// VMOVRRD is introduced when legalizing i64 types. It forces the i64 value
|
|
|
|
// into a pair of GPRs, which is fine when the value is used as a scalar,
|
|
|
|
// but if the i64 value is converted to a vector, we need to undo the VMOVRRD.
|
2010-12-21 06:43:19 +00:00
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
if (N->getNumOperands() == 2) {
|
|
|
|
SDValue RV = PerformVMOVDRRCombine(N, DAG);
|
|
|
|
if (RV.getNode())
|
|
|
|
return RV;
|
|
|
|
}
|
2010-09-17 22:59:05 +00:00
|
|
|
|
2010-12-21 06:43:19 +00:00
|
|
|
// Load i64 elements as f64 values so that type legalization does not split
|
|
|
|
// them up into i32 values.
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
if (VT.getVectorElementType() != MVT::i64 || !hasNormalLoadOperand(N))
|
|
|
|
return SDValue();
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
for (unsigned i = 0; i < NumElts; ++i) {
|
|
|
|
SDValue V = DAG.getNode(ISD::BITCAST, dl, MVT::f64, N->getOperand(i));
|
|
|
|
Ops.push_back(V);
|
|
|
|
// Make the DAGCombiner fold the bitcast.
|
|
|
|
DCI.AddToWorklist(V.getNode());
|
|
|
|
}
|
|
|
|
EVT FloatVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64, NumElts);
|
|
|
|
SDValue BV = DAG.getNode(ISD::BUILD_VECTOR, dl, FloatVT, Ops.data(), NumElts);
|
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, BV);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// PerformInsertEltCombine - Target-specific dag combine xforms for
|
|
|
|
/// ISD::INSERT_VECTOR_ELT.
|
|
|
|
static SDValue PerformInsertEltCombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
// Bitcast an i64 load inserted into a vector to f64.
|
|
|
|
// Otherwise, the i64 value will be legalized to a pair of i32 values.
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
SDNode *Elt = N->getOperand(1).getNode();
|
|
|
|
if (VT.getVectorElementType() != MVT::i64 ||
|
|
|
|
!ISD::isNormalLoad(Elt) || cast<LoadSDNode>(Elt)->isVolatile())
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
DebugLoc dl = N->getDebugLoc();
|
|
|
|
EVT FloatVT = EVT::getVectorVT(*DAG.getContext(), MVT::f64,
|
|
|
|
VT.getVectorNumElements());
|
|
|
|
SDValue Vec = DAG.getNode(ISD::BITCAST, dl, FloatVT, N->getOperand(0));
|
|
|
|
SDValue V = DAG.getNode(ISD::BITCAST, dl, MVT::f64, N->getOperand(1));
|
|
|
|
// Make the DAGCombiner fold the bitcasts.
|
|
|
|
DCI.AddToWorklist(Vec.getNode());
|
|
|
|
DCI.AddToWorklist(V.getNode());
|
|
|
|
SDValue InsElt = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, FloatVT,
|
|
|
|
Vec, V, N->getOperand(2));
|
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, InsElt);
|
2007-11-27 22:36:16 +00:00
|
|
|
}
|
|
|
|
|
SelectionDAG shuffle nodes do not allow operands with different numbers of
elements than the result vector type. So, when an instruction like:
%8 = shufflevector <2 x float> %4, <2 x float> %7, <4 x i32> <i32 1, i32 0, i32 3, i32 2>
is translated to a DAG, each operand is changed to a concat_vectors node that appends 2 undef elements. That is:
shuffle [a,b], [c,d] is changed to:
shuffle [a,b,u,u], [c,d,u,u]
That's probably the right thing for x86 but for NEON, we'd much rather have:
shuffle [a,b,c,d], undef
Teach the DAG combiner how to do that transformation for ARM. Radar 8597007.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117482 91177308-0d34-0410-b5e6-96231b3b80d8
2010-10-27 20:38:28 +00:00
|
|
|
/// PerformVECTOR_SHUFFLECombine - Target-specific dag combine xforms for
|
|
|
|
/// ISD::VECTOR_SHUFFLE.
|
|
|
|
static SDValue PerformVECTOR_SHUFFLECombine(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
// The LLVM shufflevector instruction does not require the shuffle mask
|
|
|
|
// length to match the operand vector length, but ISD::VECTOR_SHUFFLE does
|
|
|
|
// have that requirement. When translating to ISD::VECTOR_SHUFFLE, if the
|
|
|
|
// operands do not match the mask length, they are extended by concatenating
|
|
|
|
// them with undef vectors. That is probably the right thing for other
|
|
|
|
// targets, but for NEON it is better to concatenate two double-register
|
|
|
|
// size vector operands into a single quad-register size vector. Do that
|
|
|
|
// transformation here:
|
|
|
|
// shuffle(concat(v1, undef), concat(v2, undef)) ->
|
|
|
|
// shuffle(concat(v1, v2), undef)
|
|
|
|
SDValue Op0 = N->getOperand(0);
|
|
|
|
SDValue Op1 = N->getOperand(1);
|
|
|
|
if (Op0.getOpcode() != ISD::CONCAT_VECTORS ||
|
|
|
|
Op1.getOpcode() != ISD::CONCAT_VECTORS ||
|
|
|
|
Op0.getNumOperands() != 2 ||
|
|
|
|
Op1.getNumOperands() != 2)
|
|
|
|
return SDValue();
|
|
|
|
SDValue Concat0Op1 = Op0.getOperand(1);
|
|
|
|
SDValue Concat1Op1 = Op1.getOperand(1);
|
|
|
|
if (Concat0Op1.getOpcode() != ISD::UNDEF ||
|
|
|
|
Concat1Op1.getOpcode() != ISD::UNDEF)
|
|
|
|
return SDValue();
|
|
|
|
// Skip the transformation if any of the types are illegal.
|
|
|
|
const TargetLowering &TLI = DAG.getTargetLoweringInfo();
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
if (!TLI.isTypeLegal(VT) ||
|
|
|
|
!TLI.isTypeLegal(Concat0Op1.getValueType()) ||
|
|
|
|
!TLI.isTypeLegal(Concat1Op1.getValueType()))
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue NewConcat = DAG.getNode(ISD::CONCAT_VECTORS, N->getDebugLoc(), VT,
|
|
|
|
Op0.getOperand(0), Op1.getOperand(0));
|
|
|
|
// Translate the shuffle mask.
|
|
|
|
SmallVector<int, 16> NewMask;
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
unsigned HalfElts = NumElts/2;
|
|
|
|
ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
|
|
|
|
for (unsigned n = 0; n < NumElts; ++n) {
|
|
|
|
int MaskElt = SVN->getMaskElt(n);
|
|
|
|
int NewElt = -1;
|
2010-10-27 23:49:00 +00:00
|
|
|
if (MaskElt < (int)HalfElts)
|
SelectionDAG shuffle nodes do not allow operands with different numbers of
elements than the result vector type. So, when an instruction like:
%8 = shufflevector <2 x float> %4, <2 x float> %7, <4 x i32> <i32 1, i32 0, i32 3, i32 2>
is translated to a DAG, each operand is changed to a concat_vectors node that appends 2 undef elements. That is:
shuffle [a,b], [c,d] is changed to:
shuffle [a,b,u,u], [c,d,u,u]
That's probably the right thing for x86 but for NEON, we'd much rather have:
shuffle [a,b,c,d], undef
Teach the DAG combiner how to do that transformation for ARM. Radar 8597007.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117482 91177308-0d34-0410-b5e6-96231b3b80d8
2010-10-27 20:38:28 +00:00
|
|
|
NewElt = MaskElt;
|
2010-10-27 23:49:00 +00:00
|
|
|
else if (MaskElt >= (int)NumElts && MaskElt < (int)(NumElts + HalfElts))
|
SelectionDAG shuffle nodes do not allow operands with different numbers of
elements than the result vector type. So, when an instruction like:
%8 = shufflevector <2 x float> %4, <2 x float> %7, <4 x i32> <i32 1, i32 0, i32 3, i32 2>
is translated to a DAG, each operand is changed to a concat_vectors node that appends 2 undef elements. That is:
shuffle [a,b], [c,d] is changed to:
shuffle [a,b,u,u], [c,d,u,u]
That's probably the right thing for x86 but for NEON, we'd much rather have:
shuffle [a,b,c,d], undef
Teach the DAG combiner how to do that transformation for ARM. Radar 8597007.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117482 91177308-0d34-0410-b5e6-96231b3b80d8
2010-10-27 20:38:28 +00:00
|
|
|
NewElt = HalfElts + MaskElt - NumElts;
|
|
|
|
NewMask.push_back(NewElt);
|
|
|
|
}
|
|
|
|
return DAG.getVectorShuffle(VT, N->getDebugLoc(), NewConcat,
|
|
|
|
DAG.getUNDEF(VT), NewMask.data());
|
|
|
|
}
|
|
|
|
|
2010-11-28 06:51:26 +00:00
|
|
|
/// CombineVLDDUP - For a VDUPLANE node N, check if its source operand is a
|
|
|
|
/// vldN-lane (N > 1) intrinsic, and if all the other uses of that intrinsic
|
|
|
|
/// are also VDUPLANEs. If so, combine them to a vldN-dup operation and
|
|
|
|
/// return true.
|
|
|
|
static bool CombineVLDDUP(SDNode *N, TargetLowering::DAGCombinerInfo &DCI) {
|
|
|
|
SelectionDAG &DAG = DCI.DAG;
|
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
// vldN-dup instructions only support 64-bit vectors for N > 1.
|
|
|
|
if (!VT.is64BitVector())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Check if the VDUPLANE operand is a vldN-dup intrinsic.
|
|
|
|
SDNode *VLD = N->getOperand(0).getNode();
|
|
|
|
if (VLD->getOpcode() != ISD::INTRINSIC_W_CHAIN)
|
|
|
|
return false;
|
|
|
|
unsigned NumVecs = 0;
|
|
|
|
unsigned NewOpc = 0;
|
|
|
|
unsigned IntNo = cast<ConstantSDNode>(VLD->getOperand(1))->getZExtValue();
|
|
|
|
if (IntNo == Intrinsic::arm_neon_vld2lane) {
|
|
|
|
NumVecs = 2;
|
|
|
|
NewOpc = ARMISD::VLD2DUP;
|
|
|
|
} else if (IntNo == Intrinsic::arm_neon_vld3lane) {
|
|
|
|
NumVecs = 3;
|
|
|
|
NewOpc = ARMISD::VLD3DUP;
|
|
|
|
} else if (IntNo == Intrinsic::arm_neon_vld4lane) {
|
|
|
|
NumVecs = 4;
|
|
|
|
NewOpc = ARMISD::VLD4DUP;
|
|
|
|
} else {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// First check that all the vldN-lane uses are VDUPLANEs and that the lane
|
|
|
|
// numbers match the load.
|
|
|
|
unsigned VLDLaneNo =
|
|
|
|
cast<ConstantSDNode>(VLD->getOperand(NumVecs+3))->getZExtValue();
|
|
|
|
for (SDNode::use_iterator UI = VLD->use_begin(), UE = VLD->use_end();
|
|
|
|
UI != UE; ++UI) {
|
|
|
|
// Ignore uses of the chain result.
|
|
|
|
if (UI.getUse().getResNo() == NumVecs)
|
|
|
|
continue;
|
|
|
|
SDNode *User = *UI;
|
|
|
|
if (User->getOpcode() != ARMISD::VDUPLANE ||
|
|
|
|
VLDLaneNo != cast<ConstantSDNode>(User->getOperand(1))->getZExtValue())
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create the vldN-dup node.
|
|
|
|
EVT Tys[5];
|
|
|
|
unsigned n;
|
|
|
|
for (n = 0; n < NumVecs; ++n)
|
|
|
|
Tys[n] = VT;
|
|
|
|
Tys[n] = MVT::Other;
|
|
|
|
SDVTList SDTys = DAG.getVTList(Tys, NumVecs+1);
|
|
|
|
SDValue Ops[] = { VLD->getOperand(0), VLD->getOperand(2) };
|
|
|
|
MemIntrinsicSDNode *VLDMemInt = cast<MemIntrinsicSDNode>(VLD);
|
|
|
|
SDValue VLDDup = DAG.getMemIntrinsicNode(NewOpc, VLD->getDebugLoc(), SDTys,
|
|
|
|
Ops, 2, VLDMemInt->getMemoryVT(),
|
|
|
|
VLDMemInt->getMemOperand());
|
|
|
|
|
|
|
|
// Update the uses.
|
|
|
|
for (SDNode::use_iterator UI = VLD->use_begin(), UE = VLD->use_end();
|
|
|
|
UI != UE; ++UI) {
|
|
|
|
unsigned ResNo = UI.getUse().getResNo();
|
|
|
|
// Ignore uses of the chain result.
|
|
|
|
if (ResNo == NumVecs)
|
|
|
|
continue;
|
|
|
|
SDNode *User = *UI;
|
|
|
|
DCI.CombineTo(User, SDValue(VLDDup.getNode(), ResNo));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now the vldN-lane intrinsic is dead except for its chain result.
|
|
|
|
// Update uses of the chain.
|
|
|
|
std::vector<SDValue> VLDDupResults;
|
|
|
|
for (unsigned n = 0; n < NumVecs; ++n)
|
|
|
|
VLDDupResults.push_back(SDValue(VLDDup.getNode(), n));
|
|
|
|
VLDDupResults.push_back(SDValue(VLDDup.getNode(), NumVecs));
|
|
|
|
DCI.CombineTo(VLD, VLDDupResults);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2010-07-14 01:22:12 +00:00
|
|
|
/// PerformVDUPLANECombine - Target-specific dag combine xforms for
|
|
|
|
/// ARMISD::VDUPLANE.
|
2010-11-28 06:51:26 +00:00
|
|
|
static SDValue PerformVDUPLANECombine(SDNode *N,
|
|
|
|
TargetLowering::DAGCombinerInfo &DCI) {
|
2010-07-14 01:22:12 +00:00
|
|
|
SDValue Op = N->getOperand(0);
|
|
|
|
|
2010-11-28 06:51:26 +00:00
|
|
|
// If the source is a vldN-lane (N > 1) intrinsic, and all the other uses
|
|
|
|
// of that intrinsic are also VDUPLANEs, combine them to a vldN-dup operation.
|
|
|
|
if (CombineVLDDUP(N, DCI))
|
|
|
|
return SDValue(N, 0);
|
|
|
|
|
|
|
|
// If the source is already a VMOVIMM or VMVNIMM splat, the VDUPLANE is
|
|
|
|
// redundant. Ignore bit_converts for now; element sizes are checked below.
|
2010-11-23 03:31:01 +00:00
|
|
|
while (Op.getOpcode() == ISD::BITCAST)
|
2010-07-14 01:22:12 +00:00
|
|
|
Op = Op.getOperand(0);
|
2010-07-14 06:31:50 +00:00
|
|
|
if (Op.getOpcode() != ARMISD::VMOVIMM && Op.getOpcode() != ARMISD::VMVNIMM)
|
2010-07-14 01:22:12 +00:00
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
// Make sure the VMOV element size is not bigger than the VDUPLANE elements.
|
|
|
|
unsigned EltSize = Op.getValueType().getVectorElementType().getSizeInBits();
|
|
|
|
// The canonical VMOV for a zero vector uses a 32-bit element size.
|
|
|
|
unsigned Imm = cast<ConstantSDNode>(Op.getOperand(0))->getZExtValue();
|
|
|
|
unsigned EltBits;
|
|
|
|
if (ARM_AM::decodeNEONModImm(Imm, EltBits) == 0)
|
|
|
|
EltSize = 8;
|
2010-11-28 06:51:26 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
2010-07-14 01:22:12 +00:00
|
|
|
if (EltSize > VT.getVectorElementType().getSizeInBits())
|
|
|
|
return SDValue();
|
|
|
|
|
2010-11-28 06:51:26 +00:00
|
|
|
return DCI.DAG.getNode(ISD::BITCAST, N->getDebugLoc(), VT, Op);
|
2010-07-14 01:22:12 +00:00
|
|
|
}
|
|
|
|
|
2009-06-22 23:27:02 +00:00
|
|
|
/// getVShiftImm - Check if this is a valid build_vector for the immediate
|
|
|
|
/// operand of a vector shift operation, where all the elements of the
|
|
|
|
/// build_vector must have the same constant integer value.
|
|
|
|
static bool getVShiftImm(SDValue Op, unsigned ElementBits, int64_t &Cnt) {
|
|
|
|
// Ignore bit_converts.
|
2010-11-23 03:31:01 +00:00
|
|
|
while (Op.getOpcode() == ISD::BITCAST)
|
2009-06-22 23:27:02 +00:00
|
|
|
Op = Op.getOperand(0);
|
|
|
|
BuildVectorSDNode *BVN = dyn_cast<BuildVectorSDNode>(Op.getNode());
|
|
|
|
APInt SplatBits, SplatUndef;
|
|
|
|
unsigned SplatBitSize;
|
|
|
|
bool HasAnyUndefs;
|
|
|
|
if (! BVN || ! BVN->isConstantSplat(SplatBits, SplatUndef, SplatBitSize,
|
|
|
|
HasAnyUndefs, ElementBits) ||
|
|
|
|
SplatBitSize > ElementBits)
|
|
|
|
return false;
|
|
|
|
Cnt = SplatBits.getSExtValue();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isVShiftLImm - Check if this is a valid build_vector for the immediate
|
|
|
|
/// operand of a vector shift left operation. That value must be in the range:
|
|
|
|
/// 0 <= Value < ElementBits for a left shift; or
|
|
|
|
/// 0 <= Value <= ElementBits for a long left shift.
|
2009-08-10 22:56:29 +00:00
|
|
|
static bool isVShiftLImm(SDValue Op, EVT VT, bool isLong, int64_t &Cnt) {
|
2009-06-22 23:27:02 +00:00
|
|
|
assert(VT.isVector() && "vector shift count is not a vector type");
|
|
|
|
unsigned ElementBits = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (! getVShiftImm(Op, ElementBits, Cnt))
|
|
|
|
return false;
|
|
|
|
return (Cnt >= 0 && (isLong ? Cnt-1 : Cnt) < ElementBits);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// isVShiftRImm - Check if this is a valid build_vector for the immediate
|
|
|
|
/// operand of a vector shift right operation. For a shift opcode, the value
|
|
|
|
/// is positive, but for an intrinsic the value count must be negative. The
|
|
|
|
/// absolute value must be in the range:
|
|
|
|
/// 1 <= |Value| <= ElementBits for a right shift; or
|
|
|
|
/// 1 <= |Value| <= ElementBits/2 for a narrow right shift.
|
2009-08-10 22:56:29 +00:00
|
|
|
static bool isVShiftRImm(SDValue Op, EVT VT, bool isNarrow, bool isIntrinsic,
|
2009-06-22 23:27:02 +00:00
|
|
|
int64_t &Cnt) {
|
|
|
|
assert(VT.isVector() && "vector shift count is not a vector type");
|
|
|
|
unsigned ElementBits = VT.getVectorElementType().getSizeInBits();
|
|
|
|
if (! getVShiftImm(Op, ElementBits, Cnt))
|
|
|
|
return false;
|
|
|
|
if (isIntrinsic)
|
|
|
|
Cnt = -Cnt;
|
|
|
|
return (Cnt >= 1 && Cnt <= (isNarrow ? ElementBits/2 : ElementBits));
|
|
|
|
}
|
|
|
|
|
|
|
|
/// PerformIntrinsicCombine - ARM-specific DAG combining for intrinsics.
|
|
|
|
static SDValue PerformIntrinsicCombine(SDNode *N, SelectionDAG &DAG) {
|
|
|
|
unsigned IntNo = cast<ConstantSDNode>(N->getOperand(0))->getZExtValue();
|
|
|
|
switch (IntNo) {
|
|
|
|
default:
|
|
|
|
// Don't do anything for most intrinsics.
|
|
|
|
break;
|
|
|
|
|
|
|
|
// Vector shifts: check for immediate versions and lower them.
|
|
|
|
// Note: This is done during DAG combining instead of DAG legalizing because
|
|
|
|
// the build_vectors for 64-bit vector element shift counts are generally
|
|
|
|
// not legal, and it is hard to see their values after they get legalized to
|
|
|
|
// loads from a constant pool.
|
|
|
|
case Intrinsic::arm_neon_vshifts:
|
|
|
|
case Intrinsic::arm_neon_vshiftu:
|
|
|
|
case Intrinsic::arm_neon_vshiftls:
|
|
|
|
case Intrinsic::arm_neon_vshiftlu:
|
|
|
|
case Intrinsic::arm_neon_vshiftn:
|
|
|
|
case Intrinsic::arm_neon_vrshifts:
|
|
|
|
case Intrinsic::arm_neon_vrshiftu:
|
|
|
|
case Intrinsic::arm_neon_vrshiftn:
|
|
|
|
case Intrinsic::arm_neon_vqshifts:
|
|
|
|
case Intrinsic::arm_neon_vqshiftu:
|
|
|
|
case Intrinsic::arm_neon_vqshiftsu:
|
|
|
|
case Intrinsic::arm_neon_vqshiftns:
|
|
|
|
case Intrinsic::arm_neon_vqshiftnu:
|
|
|
|
case Intrinsic::arm_neon_vqshiftnsu:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftns:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnu:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnsu: {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getOperand(1).getValueType();
|
2009-06-22 23:27:02 +00:00
|
|
|
int64_t Cnt;
|
|
|
|
unsigned VShiftOpc = 0;
|
|
|
|
|
|
|
|
switch (IntNo) {
|
|
|
|
case Intrinsic::arm_neon_vshifts:
|
|
|
|
case Intrinsic::arm_neon_vshiftu:
|
|
|
|
if (isVShiftLImm(N->getOperand(2), VT, false, Cnt)) {
|
|
|
|
VShiftOpc = ARMISD::VSHL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (isVShiftRImm(N->getOperand(2), VT, false, true, Cnt)) {
|
|
|
|
VShiftOpc = (IntNo == Intrinsic::arm_neon_vshifts ?
|
|
|
|
ARMISD::VSHRs : ARMISD::VSHRu);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vshiftls:
|
|
|
|
case Intrinsic::arm_neon_vshiftlu:
|
|
|
|
if (isVShiftLImm(N->getOperand(2), VT, true, Cnt))
|
|
|
|
break;
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("invalid shift count for vshll intrinsic");
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vrshifts:
|
|
|
|
case Intrinsic::arm_neon_vrshiftu:
|
|
|
|
if (isVShiftRImm(N->getOperand(2), VT, false, true, Cnt))
|
|
|
|
break;
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vqshifts:
|
|
|
|
case Intrinsic::arm_neon_vqshiftu:
|
|
|
|
if (isVShiftLImm(N->getOperand(2), VT, false, Cnt))
|
|
|
|
break;
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vqshiftsu:
|
|
|
|
if (isVShiftLImm(N->getOperand(2), VT, false, Cnt))
|
|
|
|
break;
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("invalid shift count for vqshlu intrinsic");
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vshiftn:
|
|
|
|
case Intrinsic::arm_neon_vrshiftn:
|
|
|
|
case Intrinsic::arm_neon_vqshiftns:
|
|
|
|
case Intrinsic::arm_neon_vqshiftnu:
|
|
|
|
case Intrinsic::arm_neon_vqshiftnsu:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftns:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnu:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnsu:
|
|
|
|
// Narrowing shifts require an immediate right shift.
|
|
|
|
if (isVShiftRImm(N->getOperand(2), VT, true, true, Cnt))
|
|
|
|
break;
|
2010-06-02 21:53:11 +00:00
|
|
|
llvm_unreachable("invalid shift count for narrowing vector shift "
|
|
|
|
"intrinsic");
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
default:
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("unhandled vector shift");
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
switch (IntNo) {
|
|
|
|
case Intrinsic::arm_neon_vshifts:
|
|
|
|
case Intrinsic::arm_neon_vshiftu:
|
|
|
|
// Opcode already set above.
|
|
|
|
break;
|
|
|
|
case Intrinsic::arm_neon_vshiftls:
|
|
|
|
case Intrinsic::arm_neon_vshiftlu:
|
|
|
|
if (Cnt == VT.getVectorElementType().getSizeInBits())
|
|
|
|
VShiftOpc = ARMISD::VSHLLi;
|
|
|
|
else
|
|
|
|
VShiftOpc = (IntNo == Intrinsic::arm_neon_vshiftls ?
|
|
|
|
ARMISD::VSHLLs : ARMISD::VSHLLu);
|
|
|
|
break;
|
|
|
|
case Intrinsic::arm_neon_vshiftn:
|
|
|
|
VShiftOpc = ARMISD::VSHRN; break;
|
|
|
|
case Intrinsic::arm_neon_vrshifts:
|
|
|
|
VShiftOpc = ARMISD::VRSHRs; break;
|
|
|
|
case Intrinsic::arm_neon_vrshiftu:
|
|
|
|
VShiftOpc = ARMISD::VRSHRu; break;
|
|
|
|
case Intrinsic::arm_neon_vrshiftn:
|
|
|
|
VShiftOpc = ARMISD::VRSHRN; break;
|
|
|
|
case Intrinsic::arm_neon_vqshifts:
|
|
|
|
VShiftOpc = ARMISD::VQSHLs; break;
|
|
|
|
case Intrinsic::arm_neon_vqshiftu:
|
|
|
|
VShiftOpc = ARMISD::VQSHLu; break;
|
|
|
|
case Intrinsic::arm_neon_vqshiftsu:
|
|
|
|
VShiftOpc = ARMISD::VQSHLsu; break;
|
|
|
|
case Intrinsic::arm_neon_vqshiftns:
|
|
|
|
VShiftOpc = ARMISD::VQSHRNs; break;
|
|
|
|
case Intrinsic::arm_neon_vqshiftnu:
|
|
|
|
VShiftOpc = ARMISD::VQSHRNu; break;
|
|
|
|
case Intrinsic::arm_neon_vqshiftnsu:
|
|
|
|
VShiftOpc = ARMISD::VQSHRNsu; break;
|
|
|
|
case Intrinsic::arm_neon_vqrshiftns:
|
|
|
|
VShiftOpc = ARMISD::VQRSHRNs; break;
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnu:
|
|
|
|
VShiftOpc = ARMISD::VQRSHRNu; break;
|
|
|
|
case Intrinsic::arm_neon_vqrshiftnsu:
|
|
|
|
VShiftOpc = ARMISD::VQRSHRNsu; break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return DAG.getNode(VShiftOpc, N->getDebugLoc(), N->getValueType(0),
|
2009-08-11 20:47:22 +00:00
|
|
|
N->getOperand(1), DAG.getConstant(Cnt, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vshiftins: {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getOperand(1).getValueType();
|
2009-06-22 23:27:02 +00:00
|
|
|
int64_t Cnt;
|
|
|
|
unsigned VShiftOpc = 0;
|
|
|
|
|
|
|
|
if (isVShiftLImm(N->getOperand(3), VT, false, Cnt))
|
|
|
|
VShiftOpc = ARMISD::VSLI;
|
|
|
|
else if (isVShiftRImm(N->getOperand(3), VT, false, true, Cnt))
|
|
|
|
VShiftOpc = ARMISD::VSRI;
|
|
|
|
else {
|
2009-07-14 16:55:14 +00:00
|
|
|
llvm_unreachable("invalid shift count for vsli/vsri intrinsic");
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return DAG.getNode(VShiftOpc, N->getDebugLoc(), N->getValueType(0),
|
|
|
|
N->getOperand(1), N->getOperand(2),
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getConstant(Cnt, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
case Intrinsic::arm_neon_vqrshifts:
|
|
|
|
case Intrinsic::arm_neon_vqrshiftu:
|
|
|
|
// No immediate versions of these to check for.
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// PerformShiftCombine - Checks for immediate versions of vector shifts and
|
|
|
|
/// lowers them. As with the vector shift intrinsics, this is done during DAG
|
|
|
|
/// combining instead of DAG legalizing because the build_vectors for 64-bit
|
|
|
|
/// vector element shift counts are generally not legal, and it is hard to see
|
|
|
|
/// their values after they get legalized to loads from a constant pool.
|
|
|
|
static SDValue PerformShiftCombine(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
// Nothing to be done for scalar shifts.
|
2010-11-18 22:06:46 +00:00
|
|
|
const TargetLowering &TLI = DAG.getTargetLoweringInfo();
|
|
|
|
if (!VT.isVector() || !TLI.isTypeLegal(VT))
|
2009-06-22 23:27:02 +00:00
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
assert(ST->hasNEON() && "unexpected vector shift");
|
|
|
|
int64_t Cnt;
|
|
|
|
|
|
|
|
switch (N->getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("unexpected shift opcode");
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
case ISD::SHL:
|
|
|
|
if (isVShiftLImm(N->getOperand(1), VT, false, Cnt))
|
|
|
|
return DAG.getNode(ARMISD::VSHL, N->getDebugLoc(), VT, N->getOperand(0),
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getConstant(Cnt, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case ISD::SRA:
|
|
|
|
case ISD::SRL:
|
|
|
|
if (isVShiftRImm(N->getOperand(1), VT, false, false, Cnt)) {
|
|
|
|
unsigned VShiftOpc = (N->getOpcode() == ISD::SRA ?
|
|
|
|
ARMISD::VSHRs : ARMISD::VSHRu);
|
|
|
|
return DAG.getNode(VShiftOpc, N->getDebugLoc(), VT, N->getOperand(0),
|
2009-08-11 20:47:22 +00:00
|
|
|
DAG.getConstant(Cnt, MVT::i32));
|
2009-06-22 23:27:02 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
|
|
|
/// PerformExtendCombine - Target-specific DAG combining for ISD::SIGN_EXTEND,
|
|
|
|
/// ISD::ZERO_EXTEND, and ISD::ANY_EXTEND.
|
|
|
|
static SDValue PerformExtendCombine(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
|
|
|
SDValue N0 = N->getOperand(0);
|
|
|
|
|
|
|
|
// Check for sign- and zero-extensions of vector extract operations of 8-
|
|
|
|
// and 16-bit vector elements. NEON supports these directly. They are
|
|
|
|
// handled during DAG combining because type legalization will promote them
|
|
|
|
// to 32-bit types and it is messy to recognize the operations after that.
|
|
|
|
if (ST->hasNEON() && N0.getOpcode() == ISD::EXTRACT_VECTOR_ELT) {
|
|
|
|
SDValue Vec = N0.getOperand(0);
|
|
|
|
SDValue Lane = N0.getOperand(1);
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = N->getValueType(0);
|
|
|
|
EVT EltVT = N0.getValueType();
|
2009-06-22 23:27:02 +00:00
|
|
|
const TargetLowering &TLI = DAG.getTargetLoweringInfo();
|
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VT == MVT::i32 &&
|
|
|
|
(EltVT == MVT::i8 || EltVT == MVT::i16) &&
|
2010-11-03 16:24:50 +00:00
|
|
|
TLI.isTypeLegal(Vec.getValueType()) &&
|
|
|
|
isa<ConstantSDNode>(Lane)) {
|
2009-06-22 23:27:02 +00:00
|
|
|
|
|
|
|
unsigned Opc = 0;
|
|
|
|
switch (N->getOpcode()) {
|
2009-07-14 16:55:14 +00:00
|
|
|
default: llvm_unreachable("unexpected opcode");
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SIGN_EXTEND:
|
|
|
|
Opc = ARMISD::VGETLANEs;
|
|
|
|
break;
|
|
|
|
case ISD::ZERO_EXTEND:
|
|
|
|
case ISD::ANY_EXTEND:
|
|
|
|
Opc = ARMISD::VGETLANEu;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return DAG.getNode(Opc, N->getDebugLoc(), VT, Vec, Lane);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-02-18 06:05:53 +00:00
|
|
|
/// PerformSELECT_CCCombine - Target-specific DAG combining for ISD::SELECT_CC
|
|
|
|
/// to match f32 max/min patterns to use NEON vmax/vmin instructions.
|
|
|
|
static SDValue PerformSELECT_CCCombine(SDNode *N, SelectionDAG &DAG,
|
|
|
|
const ARMSubtarget *ST) {
|
|
|
|
// If the target supports NEON, try to use vmax/vmin instructions for f32
|
2010-07-15 22:07:12 +00:00
|
|
|
// selects like "x < y ? x : y". Unless the NoNaNsFPMath option is set,
|
2010-02-18 06:05:53 +00:00
|
|
|
// be careful about NaNs: NEON's vmax/vmin return NaN if either operand is
|
|
|
|
// a NaN; only do the transformation when it matches that behavior.
|
|
|
|
|
|
|
|
// For now only do this when using NEON for FP operations; if using VFP, it
|
|
|
|
// is not obvious that the benefit outweighs the cost of switching to the
|
|
|
|
// NEON pipeline.
|
|
|
|
if (!ST->hasNEON() || !ST->useNEONForSinglePrecisionFP() ||
|
|
|
|
N->getValueType(0) != MVT::f32)
|
|
|
|
return SDValue();
|
|
|
|
|
|
|
|
SDValue CondLHS = N->getOperand(0);
|
|
|
|
SDValue CondRHS = N->getOperand(1);
|
|
|
|
SDValue LHS = N->getOperand(2);
|
|
|
|
SDValue RHS = N->getOperand(3);
|
|
|
|
ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get();
|
|
|
|
|
|
|
|
unsigned Opcode = 0;
|
|
|
|
bool IsReversed;
|
2010-02-24 22:15:53 +00:00
|
|
|
if (DAG.isEqualTo(LHS, CondLHS) && DAG.isEqualTo(RHS, CondRHS)) {
|
2010-02-18 06:05:53 +00:00
|
|
|
IsReversed = false; // x CC y ? x : y
|
2010-02-24 22:15:53 +00:00
|
|
|
} else if (DAG.isEqualTo(LHS, CondRHS) && DAG.isEqualTo(RHS, CondLHS)) {
|
2010-02-18 06:05:53 +00:00
|
|
|
IsReversed = true ; // x CC y ? y : x
|
|
|
|
} else {
|
|
|
|
return SDValue();
|
|
|
|
}
|
|
|
|
|
2010-02-24 22:15:53 +00:00
|
|
|
bool IsUnordered;
|
2010-02-18 06:05:53 +00:00
|
|
|
switch (CC) {
|
|
|
|
default: break;
|
|
|
|
case ISD::SETOLT:
|
|
|
|
case ISD::SETOLE:
|
|
|
|
case ISD::SETLT:
|
|
|
|
case ISD::SETLE:
|
|
|
|
case ISD::SETULT:
|
|
|
|
case ISD::SETULE:
|
2010-02-24 22:15:53 +00:00
|
|
|
// If LHS is NaN, an ordered comparison will be false and the result will
|
|
|
|
// be the RHS, but vmin(NaN, RHS) = NaN. Avoid this by checking that LHS
|
|
|
|
// != NaN. Likewise, for unordered comparisons, check for RHS != NaN.
|
|
|
|
IsUnordered = (CC == ISD::SETULT || CC == ISD::SETULE);
|
|
|
|
if (!DAG.isKnownNeverNaN(IsUnordered ? RHS : LHS))
|
|
|
|
break;
|
|
|
|
// For less-than-or-equal comparisons, "+0 <= -0" will be true but vmin
|
|
|
|
// will return -0, so vmin can only be used for unsafe math or if one of
|
|
|
|
// the operands is known to be nonzero.
|
|
|
|
if ((CC == ISD::SETLE || CC == ISD::SETOLE || CC == ISD::SETULE) &&
|
|
|
|
!UnsafeFPMath &&
|
|
|
|
!(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
|
|
|
|
break;
|
|
|
|
Opcode = IsReversed ? ARMISD::FMAX : ARMISD::FMIN;
|
2010-02-18 06:05:53 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case ISD::SETOGT:
|
|
|
|
case ISD::SETOGE:
|
|
|
|
case ISD::SETGT:
|
|
|
|
case ISD::SETGE:
|
|
|
|
case ISD::SETUGT:
|
|
|
|
case ISD::SETUGE:
|
2010-02-24 22:15:53 +00:00
|
|
|
// If LHS is NaN, an ordered comparison will be false and the result will
|
|
|
|
// be the RHS, but vmax(NaN, RHS) = NaN. Avoid this by checking that LHS
|
|
|
|
// != NaN. Likewise, for unordered comparisons, check for RHS != NaN.
|
|
|
|
IsUnordered = (CC == ISD::SETUGT || CC == ISD::SETUGE);
|
|
|
|
if (!DAG.isKnownNeverNaN(IsUnordered ? RHS : LHS))
|
|
|
|
break;
|
|
|
|
// For greater-than-or-equal comparisons, "-0 >= +0" will be true but vmax
|
|
|
|
// will return +0, so vmax can only be used for unsafe math or if one of
|
|
|
|
// the operands is known to be nonzero.
|
|
|
|
if ((CC == ISD::SETGE || CC == ISD::SETOGE || CC == ISD::SETUGE) &&
|
|
|
|
!UnsafeFPMath &&
|
|
|
|
!(DAG.isKnownNeverZero(LHS) || DAG.isKnownNeverZero(RHS)))
|
|
|
|
break;
|
|
|
|
Opcode = IsReversed ? ARMISD::FMIN : ARMISD::FMAX;
|
2010-02-18 06:05:53 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!Opcode)
|
|
|
|
return SDValue();
|
|
|
|
return DAG.getNode(Opcode, N->getDebugLoc(), N->getValueType(0), LHS, RHS);
|
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue ARMTargetLowering::PerformDAGCombine(SDNode *N,
|
2009-03-20 22:42:55 +00:00
|
|
|
DAGCombinerInfo &DCI) const {
|
2007-11-27 22:36:16 +00:00
|
|
|
switch (N->getOpcode()) {
|
|
|
|
default: break;
|
2010-02-18 06:05:53 +00:00
|
|
|
case ISD::ADD: return PerformADDCombine(N, DCI);
|
|
|
|
case ISD::SUB: return PerformSUBCombine(N, DCI);
|
2010-05-15 18:16:59 +00:00
|
|
|
case ISD::MUL: return PerformMULCombine(N, DCI, Subtarget);
|
2010-07-16 23:05:05 +00:00
|
|
|
case ISD::OR: return PerformORCombine(N, DCI, Subtarget);
|
2010-11-05 19:27:46 +00:00
|
|
|
case ISD::AND: return PerformANDCombine(N, DCI);
|
2010-12-14 03:22:07 +00:00
|
|
|
case ARMISD::BFI: return PerformBFICombine(N, DCI);
|
2009-11-09 00:11:35 +00:00
|
|
|
case ARMISD::VMOVRRD: return PerformVMOVRRDCombine(N, DCI);
|
2010-09-22 22:09:21 +00:00
|
|
|
case ARMISD::VMOVDRR: return PerformVMOVDRRCombine(N, DCI.DAG);
|
2010-12-21 06:43:19 +00:00
|
|
|
case ISD::STORE: return PerformSTORECombine(N, DCI);
|
|
|
|
case ISD::BUILD_VECTOR: return PerformBUILD_VECTORCombine(N, DCI);
|
|
|
|
case ISD::INSERT_VECTOR_ELT: return PerformInsertEltCombine(N, DCI);
|
SelectionDAG shuffle nodes do not allow operands with different numbers of
elements than the result vector type. So, when an instruction like:
%8 = shufflevector <2 x float> %4, <2 x float> %7, <4 x i32> <i32 1, i32 0, i32 3, i32 2>
is translated to a DAG, each operand is changed to a concat_vectors node that appends 2 undef elements. That is:
shuffle [a,b], [c,d] is changed to:
shuffle [a,b,u,u], [c,d,u,u]
That's probably the right thing for x86 but for NEON, we'd much rather have:
shuffle [a,b,c,d], undef
Teach the DAG combiner how to do that transformation for ARM. Radar 8597007.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@117482 91177308-0d34-0410-b5e6-96231b3b80d8
2010-10-27 20:38:28 +00:00
|
|
|
case ISD::VECTOR_SHUFFLE: return PerformVECTOR_SHUFFLECombine(N, DCI.DAG);
|
2010-11-28 06:51:26 +00:00
|
|
|
case ARMISD::VDUPLANE: return PerformVDUPLANECombine(N, DCI);
|
2010-02-18 06:05:53 +00:00
|
|
|
case ISD::INTRINSIC_WO_CHAIN: return PerformIntrinsicCombine(N, DCI.DAG);
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SHL:
|
|
|
|
case ISD::SRA:
|
2010-02-18 06:05:53 +00:00
|
|
|
case ISD::SRL: return PerformShiftCombine(N, DCI.DAG, Subtarget);
|
2009-06-22 23:27:02 +00:00
|
|
|
case ISD::SIGN_EXTEND:
|
|
|
|
case ISD::ZERO_EXTEND:
|
2010-02-18 06:05:53 +00:00
|
|
|
case ISD::ANY_EXTEND: return PerformExtendCombine(N, DCI.DAG, Subtarget);
|
|
|
|
case ISD::SELECT_CC: return PerformSELECT_CCCombine(N, DCI.DAG, Subtarget);
|
2007-11-27 22:36:16 +00:00
|
|
|
}
|
2008-07-27 21:46:04 +00:00
|
|
|
return SDValue();
|
2007-11-27 22:36:16 +00:00
|
|
|
}
|
|
|
|
|
2011-02-02 01:06:55 +00:00
|
|
|
bool ARMTargetLowering::isDesirableToTransformToIntegerOp(unsigned Opc,
|
|
|
|
EVT VT) const {
|
|
|
|
return (VT == MVT::f32) && (Opc == ISD::LOAD || Opc == ISD::STORE);
|
|
|
|
}
|
|
|
|
|
2009-08-15 21:21:19 +00:00
|
|
|
bool ARMTargetLowering::allowsUnalignedMemoryAccesses(EVT VT) const {
|
2010-09-28 04:09:35 +00:00
|
|
|
if (!Subtarget->allowsUnalignedMem())
|
2010-06-25 04:12:31 +00:00
|
|
|
return false;
|
2009-08-15 21:21:19 +00:00
|
|
|
|
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
case MVT::i8:
|
|
|
|
case MVT::i16:
|
|
|
|
case MVT::i32:
|
|
|
|
return true;
|
|
|
|
// FIXME: VLD1 etc with standard alignment is legal.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-14 20:09:37 +00:00
|
|
|
static bool isLegalT1AddressImmediate(int64_t V, EVT VT) {
|
|
|
|
if (V < 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
unsigned Scale = 1;
|
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
|
|
|
default: return false;
|
|
|
|
case MVT::i1:
|
|
|
|
case MVT::i8:
|
|
|
|
// Scale == 1;
|
|
|
|
break;
|
|
|
|
case MVT::i16:
|
|
|
|
// Scale == 2;
|
|
|
|
Scale = 2;
|
|
|
|
break;
|
|
|
|
case MVT::i32:
|
|
|
|
// Scale == 4;
|
|
|
|
Scale = 4;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((V & (Scale - 1)) != 0)
|
|
|
|
return false;
|
|
|
|
V /= Scale;
|
|
|
|
return V == (V & ((1LL << 5) - 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool isLegalT2AddressImmediate(int64_t V, EVT VT,
|
|
|
|
const ARMSubtarget *Subtarget) {
|
|
|
|
bool isNeg = false;
|
|
|
|
if (V < 0) {
|
|
|
|
isNeg = true;
|
|
|
|
V = - V;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
|
|
|
default: return false;
|
|
|
|
case MVT::i1:
|
|
|
|
case MVT::i8:
|
|
|
|
case MVT::i16:
|
|
|
|
case MVT::i32:
|
|
|
|
// + imm12 or - imm8
|
|
|
|
if (isNeg)
|
|
|
|
return V == (V & ((1LL << 8) - 1));
|
|
|
|
return V == (V & ((1LL << 12) - 1));
|
|
|
|
case MVT::f32:
|
|
|
|
case MVT::f64:
|
|
|
|
// Same as ARM mode. FIXME: NEON?
|
|
|
|
if (!Subtarget->hasVFP2())
|
|
|
|
return false;
|
|
|
|
if ((V & 3) != 0)
|
|
|
|
return false;
|
|
|
|
V >>= 2;
|
|
|
|
return V == (V & ((1LL << 8) - 1));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-03-12 23:30:29 +00:00
|
|
|
/// isLegalAddressImmediate - Return true if the integer value can be used
|
|
|
|
/// as the offset of the target addressing mode for load / store of the
|
|
|
|
/// given type.
|
2009-08-10 22:56:29 +00:00
|
|
|
static bool isLegalAddressImmediate(int64_t V, EVT VT,
|
2007-04-09 23:33:39 +00:00
|
|
|
const ARMSubtarget *Subtarget) {
|
2007-03-13 20:37:59 +00:00
|
|
|
if (V == 0)
|
|
|
|
return true;
|
|
|
|
|
2009-03-09 19:15:00 +00:00
|
|
|
if (!VT.isSimple())
|
|
|
|
return false;
|
|
|
|
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
|
|
|
return isLegalT1AddressImmediate(V, VT);
|
|
|
|
else if (Subtarget->isThumb2())
|
|
|
|
return isLegalT2AddressImmediate(V, VT, Subtarget);
|
2007-03-12 23:30:29 +00:00
|
|
|
|
2009-08-14 20:09:37 +00:00
|
|
|
// ARM mode.
|
2007-03-12 23:30:29 +00:00
|
|
|
if (V < 0)
|
|
|
|
V = - V;
|
2009-08-11 20:47:22 +00:00
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
2007-03-12 23:30:29 +00:00
|
|
|
default: return false;
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::i1:
|
|
|
|
case MVT::i8:
|
|
|
|
case MVT::i32:
|
2007-03-12 23:30:29 +00:00
|
|
|
// +- imm12
|
2008-02-20 11:22:39 +00:00
|
|
|
return V == (V & ((1LL << 12) - 1));
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::i16:
|
2007-03-12 23:30:29 +00:00
|
|
|
// +- imm8
|
2008-02-20 11:22:39 +00:00
|
|
|
return V == (V & ((1LL << 8) - 1));
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::f32:
|
|
|
|
case MVT::f64:
|
2009-08-14 20:09:37 +00:00
|
|
|
if (!Subtarget->hasVFP2()) // FIXME: NEON?
|
2007-03-12 23:30:29 +00:00
|
|
|
return false;
|
2007-05-03 02:00:18 +00:00
|
|
|
if ((V & 3) != 0)
|
2007-03-12 23:30:29 +00:00
|
|
|
return false;
|
|
|
|
V >>= 2;
|
2008-02-20 11:22:39 +00:00
|
|
|
return V == (V & ((1LL << 8) - 1));
|
2007-03-12 23:30:29 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2009-08-14 20:09:37 +00:00
|
|
|
bool ARMTargetLowering::isLegalT2ScaledAddressingMode(const AddrMode &AM,
|
|
|
|
EVT VT) const {
|
|
|
|
int Scale = AM.Scale;
|
|
|
|
if (Scale < 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
|
|
|
default: return false;
|
|
|
|
case MVT::i1:
|
|
|
|
case MVT::i8:
|
|
|
|
case MVT::i16:
|
|
|
|
case MVT::i32:
|
|
|
|
if (Scale == 1)
|
|
|
|
return true;
|
|
|
|
// r + r << imm
|
|
|
|
Scale = Scale & ~1;
|
|
|
|
return Scale == 2 || Scale == 4 || Scale == 8;
|
|
|
|
case MVT::i64:
|
|
|
|
// r + r
|
|
|
|
if (((unsigned)AM.HasBaseReg + Scale) <= 2)
|
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
case MVT::isVoid:
|
|
|
|
// Note, we allow "void" uses (basically, uses that aren't loads or
|
|
|
|
// stores), because arm allows folding a scale into many arithmetic
|
|
|
|
// operations. This should be made more precise and revisited later.
|
|
|
|
|
|
|
|
// Allow r << imm, but the imm has to be a multiple of two.
|
|
|
|
if (Scale & 1) return false;
|
|
|
|
return isPowerOf2_32(Scale);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-04-09 23:33:39 +00:00
|
|
|
/// isLegalAddressingMode - Return true if the addressing mode represented
|
|
|
|
/// by AM is legal for this target, for a load/store of the specified type.
|
2009-03-20 22:42:55 +00:00
|
|
|
bool ARMTargetLowering::isLegalAddressingMode(const AddrMode &AM,
|
2007-04-09 23:33:39 +00:00
|
|
|
const Type *Ty) const {
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT = getValueType(Ty, true);
|
2009-04-08 17:55:28 +00:00
|
|
|
if (!isLegalAddressImmediate(AM.BaseOffs, VT, Subtarget))
|
2007-03-12 23:30:29 +00:00
|
|
|
return false;
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-04-09 23:33:39 +00:00
|
|
|
// Can never fold addr of global into load/store.
|
2009-03-20 22:42:55 +00:00
|
|
|
if (AM.BaseGV)
|
2007-04-09 23:33:39 +00:00
|
|
|
return false;
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-04-09 23:33:39 +00:00
|
|
|
switch (AM.Scale) {
|
|
|
|
case 0: // no scale reg, must be "r+i" or "r", or "i".
|
|
|
|
break;
|
|
|
|
case 1:
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
2007-04-09 23:33:39 +00:00
|
|
|
return false;
|
2007-04-13 06:50:55 +00:00
|
|
|
// FALL THROUGH.
|
2007-04-09 23:33:39 +00:00
|
|
|
default:
|
2007-04-13 06:50:55 +00:00
|
|
|
// ARM doesn't support any R+R*scale+imm addr modes.
|
|
|
|
if (AM.BaseOffs)
|
|
|
|
return false;
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-04-08 17:55:28 +00:00
|
|
|
if (!VT.isSimple())
|
|
|
|
return false;
|
|
|
|
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Subtarget->isThumb2())
|
|
|
|
return isLegalT2ScaledAddressingMode(AM, VT);
|
|
|
|
|
2007-04-10 03:48:29 +00:00
|
|
|
int Scale = AM.Scale;
|
2009-08-11 20:47:22 +00:00
|
|
|
switch (VT.getSimpleVT().SimpleTy) {
|
2007-04-09 23:33:39 +00:00
|
|
|
default: return false;
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::i1:
|
|
|
|
case MVT::i8:
|
|
|
|
case MVT::i32:
|
2007-04-10 03:48:29 +00:00
|
|
|
if (Scale < 0) Scale = -Scale;
|
|
|
|
if (Scale == 1)
|
2007-04-09 23:33:39 +00:00
|
|
|
return true;
|
|
|
|
// r + r << imm
|
2007-04-11 16:17:12 +00:00
|
|
|
return isPowerOf2_32(Scale & ~1);
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::i16:
|
2009-08-14 20:09:37 +00:00
|
|
|
case MVT::i64:
|
2007-04-09 23:33:39 +00:00
|
|
|
// r + r
|
2007-04-10 03:48:29 +00:00
|
|
|
if (((unsigned)AM.HasBaseReg + Scale) <= 2)
|
2007-04-09 23:33:39 +00:00
|
|
|
return true;
|
2007-04-11 16:17:12 +00:00
|
|
|
return false;
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
case MVT::isVoid:
|
2007-04-09 23:33:39 +00:00
|
|
|
// Note, we allow "void" uses (basically, uses that aren't loads or
|
|
|
|
// stores), because arm allows folding a scale into many arithmetic
|
|
|
|
// operations. This should be made more precise and revisited later.
|
2009-03-20 22:42:55 +00:00
|
|
|
|
2007-04-09 23:33:39 +00:00
|
|
|
// Allow r << imm, but the imm has to be a multiple of two.
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Scale & 1) return false;
|
|
|
|
return isPowerOf2_32(Scale);
|
2007-04-09 23:33:39 +00:00
|
|
|
}
|
|
|
|
break;
|
2007-03-12 23:30:29 +00:00
|
|
|
}
|
2007-04-09 23:33:39 +00:00
|
|
|
return true;
|
2007-03-12 23:30:29 +00:00
|
|
|
}
|
|
|
|
|
2009-11-11 19:05:52 +00:00
|
|
|
/// isLegalICmpImmediate - Return true if the specified immediate is legal
|
|
|
|
/// icmp immediate, that is the target has icmp instructions which can compare
|
|
|
|
/// a register against the immediate without having to materialize the
|
|
|
|
/// immediate into a register.
|
2009-11-12 07:13:11 +00:00
|
|
|
bool ARMTargetLowering::isLegalICmpImmediate(int64_t Imm) const {
|
2009-11-11 19:05:52 +00:00
|
|
|
if (!Subtarget->isThumb())
|
|
|
|
return ARM_AM::getSOImmVal(Imm) != -1;
|
|
|
|
if (Subtarget->isThumb2())
|
2010-09-08 03:54:02 +00:00
|
|
|
return ARM_AM::getT2SOImmVal(Imm) != -1;
|
2009-11-12 07:13:11 +00:00
|
|
|
return Imm >= 0 && Imm <= 255;
|
2009-11-11 19:05:52 +00:00
|
|
|
}
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
static bool getARMIndexedAddressParts(SDNode *Ptr, EVT VT,
|
2009-07-02 07:28:31 +00:00
|
|
|
bool isSEXTLoad, SDValue &Base,
|
|
|
|
SDValue &Offset, bool &isInc,
|
|
|
|
SelectionDAG &DAG) {
|
2007-01-19 07:51:42 +00:00
|
|
|
if (Ptr->getOpcode() != ISD::ADD && Ptr->getOpcode() != ISD::SUB)
|
|
|
|
return false;
|
|
|
|
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VT == MVT::i16 || ((VT == MVT::i8 || VT == MVT::i1) && isSEXTLoad)) {
|
2007-01-19 07:51:42 +00:00
|
|
|
// AddressingMode 3
|
|
|
|
Base = Ptr->getOperand(0);
|
|
|
|
if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(Ptr->getOperand(1))) {
|
2008-09-12 16:56:44 +00:00
|
|
|
int RHSC = (int)RHS->getZExtValue();
|
2007-01-19 07:51:42 +00:00
|
|
|
if (RHSC < 0 && RHSC > -256) {
|
2009-07-02 07:28:31 +00:00
|
|
|
assert(Ptr->getOpcode() == ISD::ADD);
|
2007-01-19 07:51:42 +00:00
|
|
|
isInc = false;
|
|
|
|
Offset = DAG.getConstant(-RHSC, RHS->getValueType(0));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
isInc = (Ptr->getOpcode() == ISD::ADD);
|
|
|
|
Offset = Ptr->getOperand(1);
|
|
|
|
return true;
|
2009-08-11 20:47:22 +00:00
|
|
|
} else if (VT == MVT::i32 || VT == MVT::i8 || VT == MVT::i1) {
|
2007-01-19 07:51:42 +00:00
|
|
|
// AddressingMode 2
|
|
|
|
if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(Ptr->getOperand(1))) {
|
2008-09-12 16:56:44 +00:00
|
|
|
int RHSC = (int)RHS->getZExtValue();
|
2007-01-19 07:51:42 +00:00
|
|
|
if (RHSC < 0 && RHSC > -0x1000) {
|
2009-07-02 07:28:31 +00:00
|
|
|
assert(Ptr->getOpcode() == ISD::ADD);
|
2007-01-19 07:51:42 +00:00
|
|
|
isInc = false;
|
|
|
|
Offset = DAG.getConstant(-RHSC, RHS->getValueType(0));
|
|
|
|
Base = Ptr->getOperand(0);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Ptr->getOpcode() == ISD::ADD) {
|
|
|
|
isInc = true;
|
|
|
|
ARM_AM::ShiftOpc ShOpcVal= ARM_AM::getShiftOpcForNode(Ptr->getOperand(0));
|
|
|
|
if (ShOpcVal != ARM_AM::no_shift) {
|
|
|
|
Base = Ptr->getOperand(1);
|
|
|
|
Offset = Ptr->getOperand(0);
|
|
|
|
} else {
|
|
|
|
Base = Ptr->getOperand(0);
|
|
|
|
Offset = Ptr->getOperand(1);
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
isInc = (Ptr->getOpcode() == ISD::ADD);
|
|
|
|
Base = Ptr->getOperand(0);
|
|
|
|
Offset = Ptr->getOperand(1);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2009-11-09 00:11:35 +00:00
|
|
|
// FIXME: Use VLDM / VSTM to emulate indexed FP load / store.
|
2007-01-19 07:51:42 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
static bool getT2IndexedAddressParts(SDNode *Ptr, EVT VT,
|
2009-07-02 07:28:31 +00:00
|
|
|
bool isSEXTLoad, SDValue &Base,
|
|
|
|
SDValue &Offset, bool &isInc,
|
|
|
|
SelectionDAG &DAG) {
|
|
|
|
if (Ptr->getOpcode() != ISD::ADD && Ptr->getOpcode() != ISD::SUB)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
Base = Ptr->getOperand(0);
|
|
|
|
if (ConstantSDNode *RHS = dyn_cast<ConstantSDNode>(Ptr->getOperand(1))) {
|
|
|
|
int RHSC = (int)RHS->getZExtValue();
|
|
|
|
if (RHSC < 0 && RHSC > -0x100) { // 8 bits.
|
|
|
|
assert(Ptr->getOpcode() == ISD::ADD);
|
|
|
|
isInc = false;
|
|
|
|
Offset = DAG.getConstant(-RHSC, RHS->getValueType(0));
|
|
|
|
return true;
|
|
|
|
} else if (RHSC > 0 && RHSC < 0x100) { // 8 bit, no zero.
|
|
|
|
isInc = Ptr->getOpcode() == ISD::ADD;
|
|
|
|
Offset = DAG.getConstant(RHSC, RHS->getValueType(0));
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
/// getPreIndexedAddressParts - returns true by value, base pointer and
|
|
|
|
/// offset pointer and addressing mode by reference if the node's address
|
|
|
|
/// can be legally represented as pre-indexed load / store address.
|
|
|
|
bool
|
2008-07-27 21:46:04 +00:00
|
|
|
ARMTargetLowering::getPreIndexedAddressParts(SDNode *N, SDValue &Base,
|
|
|
|
SDValue &Offset,
|
2007-01-19 07:51:42 +00:00
|
|
|
ISD::MemIndexedMode &AM,
|
2009-01-15 16:29:45 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2009-07-02 07:28:31 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
2007-01-19 07:51:42 +00:00
|
|
|
return false;
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT;
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Ptr;
|
2007-01-19 07:51:42 +00:00
|
|
|
bool isSEXTLoad = false;
|
|
|
|
if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
|
|
|
|
Ptr = LD->getBasePtr();
|
2008-01-30 00:15:11 +00:00
|
|
|
VT = LD->getMemoryVT();
|
2007-01-19 07:51:42 +00:00
|
|
|
isSEXTLoad = LD->getExtensionType() == ISD::SEXTLOAD;
|
|
|
|
} else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
|
|
|
|
Ptr = ST->getBasePtr();
|
2008-01-30 00:15:11 +00:00
|
|
|
VT = ST->getMemoryVT();
|
2007-01-19 07:51:42 +00:00
|
|
|
} else
|
|
|
|
return false;
|
|
|
|
|
|
|
|
bool isInc;
|
2009-07-02 07:28:31 +00:00
|
|
|
bool isLegal = false;
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Subtarget->isThumb2())
|
2009-07-02 07:28:31 +00:00
|
|
|
isLegal = getT2IndexedAddressParts(Ptr.getNode(), VT, isSEXTLoad, Base,
|
|
|
|
Offset, isInc, DAG);
|
2009-08-11 15:33:49 +00:00
|
|
|
else
|
2009-07-02 07:28:31 +00:00
|
|
|
isLegal = getARMIndexedAddressParts(Ptr.getNode(), VT, isSEXTLoad, Base,
|
2009-07-02 06:44:30 +00:00
|
|
|
Offset, isInc, DAG);
|
2009-07-02 07:28:31 +00:00
|
|
|
if (!isLegal)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
AM = isInc ? ISD::PRE_INC : ISD::PRE_DEC;
|
|
|
|
return true;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// getPostIndexedAddressParts - returns true by value, base pointer and
|
|
|
|
/// offset pointer and addressing mode by reference if this node can be
|
|
|
|
/// combined with a load / store to form a post-indexed load / store.
|
|
|
|
bool ARMTargetLowering::getPostIndexedAddressParts(SDNode *N, SDNode *Op,
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue &Base,
|
|
|
|
SDValue &Offset,
|
2007-01-19 07:51:42 +00:00
|
|
|
ISD::MemIndexedMode &AM,
|
2009-01-15 16:29:45 +00:00
|
|
|
SelectionDAG &DAG) const {
|
2009-07-02 07:28:31 +00:00
|
|
|
if (Subtarget->isThumb1Only())
|
2007-01-19 07:51:42 +00:00
|
|
|
return false;
|
|
|
|
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT;
|
2008-07-27 21:46:04 +00:00
|
|
|
SDValue Ptr;
|
2007-01-19 07:51:42 +00:00
|
|
|
bool isSEXTLoad = false;
|
|
|
|
if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
|
2008-01-30 00:15:11 +00:00
|
|
|
VT = LD->getMemoryVT();
|
2010-05-18 21:31:17 +00:00
|
|
|
Ptr = LD->getBasePtr();
|
2007-01-19 07:51:42 +00:00
|
|
|
isSEXTLoad = LD->getExtensionType() == ISD::SEXTLOAD;
|
|
|
|
} else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
|
2008-01-30 00:15:11 +00:00
|
|
|
VT = ST->getMemoryVT();
|
2010-05-18 21:31:17 +00:00
|
|
|
Ptr = ST->getBasePtr();
|
2007-01-19 07:51:42 +00:00
|
|
|
} else
|
|
|
|
return false;
|
|
|
|
|
|
|
|
bool isInc;
|
2009-07-02 07:28:31 +00:00
|
|
|
bool isLegal = false;
|
2009-08-14 20:09:37 +00:00
|
|
|
if (Subtarget->isThumb2())
|
2009-07-02 07:28:31 +00:00
|
|
|
isLegal = getT2IndexedAddressParts(Op, VT, isSEXTLoad, Base, Offset,
|
2010-05-18 21:31:17 +00:00
|
|
|
isInc, DAG);
|
2009-08-11 15:33:49 +00:00
|
|
|
else
|
2009-07-02 07:28:31 +00:00
|
|
|
isLegal = getARMIndexedAddressParts(Op, VT, isSEXTLoad, Base, Offset,
|
|
|
|
isInc, DAG);
|
|
|
|
if (!isLegal)
|
|
|
|
return false;
|
|
|
|
|
2010-05-18 21:31:17 +00:00
|
|
|
if (Ptr != Base) {
|
|
|
|
// Swap base ptr and offset to catch more post-index load / store when
|
|
|
|
// it's legal. In Thumb2 mode, offset must be an immediate.
|
|
|
|
if (Ptr == Offset && Op->getOpcode() == ISD::ADD &&
|
|
|
|
!Subtarget->isThumb2())
|
|
|
|
std::swap(Base, Offset);
|
|
|
|
|
|
|
|
// Post-indexed load / store update the base pointer.
|
|
|
|
if (Ptr != Base)
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-07-02 07:28:31 +00:00
|
|
|
AM = isInc ? ISD::POST_INC : ISD::POST_DEC;
|
|
|
|
return true;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2008-07-27 21:46:04 +00:00
|
|
|
void ARMTargetLowering::computeMaskedBitsForTargetNode(const SDValue Op,
|
2008-02-13 22:28:48 +00:00
|
|
|
const APInt &Mask,
|
2009-03-20 22:42:55 +00:00
|
|
|
APInt &KnownZero,
|
2008-02-13 00:35:47 +00:00
|
|
|
APInt &KnownOne,
|
2007-06-22 14:59:07 +00:00
|
|
|
const SelectionDAG &DAG,
|
2007-01-19 07:51:42 +00:00
|
|
|
unsigned Depth) const {
|
2008-02-13 00:35:47 +00:00
|
|
|
KnownZero = KnownOne = APInt(Mask.getBitWidth(), 0);
|
2007-01-19 07:51:42 +00:00
|
|
|
switch (Op.getOpcode()) {
|
|
|
|
default: break;
|
|
|
|
case ARMISD::CMOV: {
|
|
|
|
// Bits are known zero/one if known on the LHS and RHS.
|
2007-06-22 14:59:07 +00:00
|
|
|
DAG.ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
|
2007-01-19 07:51:42 +00:00
|
|
|
if (KnownZero == 0 && KnownOne == 0) return;
|
|
|
|
|
2008-02-13 00:35:47 +00:00
|
|
|
APInt KnownZeroRHS, KnownOneRHS;
|
2007-06-22 14:59:07 +00:00
|
|
|
DAG.ComputeMaskedBits(Op.getOperand(1), Mask,
|
|
|
|
KnownZeroRHS, KnownOneRHS, Depth+1);
|
2007-01-19 07:51:42 +00:00
|
|
|
KnownZero &= KnownZeroRHS;
|
|
|
|
KnownOne &= KnownOneRHS;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// ARM Inline Assembly Support
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2011-01-08 01:24:27 +00:00
|
|
|
bool ARMTargetLowering::ExpandInlineAsm(CallInst *CI) const {
|
|
|
|
// Looking for "rev" which is V6+.
|
|
|
|
if (!Subtarget->hasV6Ops())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
InlineAsm *IA = cast<InlineAsm>(CI->getCalledValue());
|
|
|
|
std::string AsmStr = IA->getAsmString();
|
|
|
|
SmallVector<StringRef, 4> AsmPieces;
|
|
|
|
SplitString(AsmStr, AsmPieces, ";\n");
|
|
|
|
|
|
|
|
switch (AsmPieces.size()) {
|
|
|
|
default: return false;
|
|
|
|
case 1:
|
|
|
|
AsmStr = AsmPieces[0];
|
|
|
|
AsmPieces.clear();
|
|
|
|
SplitString(AsmStr, AsmPieces, " \t,");
|
|
|
|
|
|
|
|
// rev $0, $1
|
|
|
|
if (AsmPieces.size() == 3 &&
|
|
|
|
AsmPieces[0] == "rev" && AsmPieces[1] == "$0" && AsmPieces[2] == "$1" &&
|
|
|
|
IA->getConstraintString().compare(0, 4, "=l,l") == 0) {
|
|
|
|
const IntegerType *Ty = dyn_cast<IntegerType>(CI->getType());
|
|
|
|
if (Ty && Ty->getBitWidth() == 32)
|
|
|
|
return IntrinsicLowering::LowerToByteSwap(CI);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
/// getConstraintType - Given a constraint letter, return the type of
|
|
|
|
/// constraint it is for this target.
|
|
|
|
ARMTargetLowering::ConstraintType
|
2007-03-25 02:14:49 +00:00
|
|
|
ARMTargetLowering::getConstraintType(const std::string &Constraint) const {
|
|
|
|
if (Constraint.size() == 1) {
|
|
|
|
switch (Constraint[0]) {
|
|
|
|
default: break;
|
|
|
|
case 'l': return C_RegisterClass;
|
2007-04-02 17:24:08 +00:00
|
|
|
case 'w': return C_RegisterClass;
|
2007-03-25 02:14:49 +00:00
|
|
|
}
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
2007-03-25 02:14:49 +00:00
|
|
|
return TargetLowering::getConstraintType(Constraint);
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
2010-10-29 17:29:13 +00:00
|
|
|
/// Examine constraint type and operand type and determine a weight value.
|
|
|
|
/// This object must already have been set up with the operand type
|
|
|
|
/// and the current alternative constraint selected.
|
|
|
|
TargetLowering::ConstraintWeight
|
|
|
|
ARMTargetLowering::getSingleConstraintMatchWeight(
|
|
|
|
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 == NULL)
|
|
|
|
return CW_Default;
|
|
|
|
const Type *type = CallOperandVal->getType();
|
|
|
|
// Look at the constraint type.
|
|
|
|
switch (*constraint) {
|
|
|
|
default:
|
|
|
|
weight = TargetLowering::getSingleConstraintMatchWeight(info, constraint);
|
|
|
|
break;
|
|
|
|
case 'l':
|
|
|
|
if (type->isIntegerTy()) {
|
|
|
|
if (Subtarget->isThumb())
|
|
|
|
weight = CW_SpecificReg;
|
|
|
|
else
|
|
|
|
weight = CW_Register;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 'w':
|
|
|
|
if (type->isFloatingPointTy())
|
|
|
|
weight = CW_Register;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return weight;
|
|
|
|
}
|
|
|
|
|
2009-03-20 22:42:55 +00:00
|
|
|
std::pair<unsigned, const TargetRegisterClass*>
|
2007-01-19 07:51:42 +00:00
|
|
|
ARMTargetLowering::getRegForInlineAsmConstraint(const std::string &Constraint,
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT) const {
|
2007-01-19 07:51:42 +00:00
|
|
|
if (Constraint.size() == 1) {
|
2010-01-14 18:19:56 +00:00
|
|
|
// GCC ARM Constraint Letters
|
2007-01-19 07:51:42 +00:00
|
|
|
switch (Constraint[0]) {
|
2007-04-02 17:24:08 +00:00
|
|
|
case 'l':
|
2010-01-14 18:19:56 +00:00
|
|
|
if (Subtarget->isThumb())
|
2009-04-07 20:34:09 +00:00
|
|
|
return std::make_pair(0U, ARM::tGPRRegisterClass);
|
|
|
|
else
|
|
|
|
return std::make_pair(0U, ARM::GPRRegisterClass);
|
2007-04-02 17:24:08 +00:00
|
|
|
case 'r':
|
|
|
|
return std::make_pair(0U, ARM::GPRRegisterClass);
|
|
|
|
case 'w':
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VT == MVT::f32)
|
2007-04-02 17:24:08 +00:00
|
|
|
return std::make_pair(0U, ARM::SPRRegisterClass);
|
2009-12-18 01:03:29 +00:00
|
|
|
if (VT.getSizeInBits() == 64)
|
2007-04-02 17:24:08 +00:00
|
|
|
return std::make_pair(0U, ARM::DPRRegisterClass);
|
2009-12-08 23:06:22 +00:00
|
|
|
if (VT.getSizeInBits() == 128)
|
|
|
|
return std::make_pair(0U, ARM::QPRRegisterClass);
|
2007-04-02 17:24:08 +00:00
|
|
|
break;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
}
|
2010-03-15 23:09:18 +00:00
|
|
|
if (StringRef("{cc}").equals_lower(Constraint))
|
2010-06-18 16:49:33 +00:00
|
|
|
return std::make_pair(unsigned(ARM::CPSR), ARM::CCRRegisterClass);
|
2010-03-15 23:09:18 +00:00
|
|
|
|
2007-01-19 07:51:42 +00:00
|
|
|
return TargetLowering::getRegForInlineAsmConstraint(Constraint, VT);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::vector<unsigned> ARMTargetLowering::
|
|
|
|
getRegClassForInlineAsmConstraint(const std::string &Constraint,
|
2009-08-10 22:56:29 +00:00
|
|
|
EVT VT) const {
|
2007-01-19 07:51:42 +00:00
|
|
|
if (Constraint.size() != 1)
|
|
|
|
return std::vector<unsigned>();
|
|
|
|
|
|
|
|
switch (Constraint[0]) { // GCC ARM Constraint Letters
|
|
|
|
default: break;
|
|
|
|
case 'l':
|
2009-04-07 20:34:09 +00:00
|
|
|
return make_vector<unsigned>(ARM::R0, ARM::R1, ARM::R2, ARM::R3,
|
|
|
|
ARM::R4, ARM::R5, ARM::R6, ARM::R7,
|
|
|
|
0);
|
2007-01-19 07:51:42 +00:00
|
|
|
case 'r':
|
|
|
|
return make_vector<unsigned>(ARM::R0, ARM::R1, ARM::R2, ARM::R3,
|
|
|
|
ARM::R4, ARM::R5, ARM::R6, ARM::R7,
|
|
|
|
ARM::R8, ARM::R9, ARM::R10, ARM::R11,
|
|
|
|
ARM::R12, ARM::LR, 0);
|
2007-04-02 17:24:08 +00:00
|
|
|
case 'w':
|
2009-08-11 20:47:22 +00:00
|
|
|
if (VT == MVT::f32)
|
2007-04-02 17:24:08 +00:00
|
|
|
return make_vector<unsigned>(ARM::S0, ARM::S1, ARM::S2, ARM::S3,
|
|
|
|
ARM::S4, ARM::S5, ARM::S6, ARM::S7,
|
|
|
|
ARM::S8, ARM::S9, ARM::S10, ARM::S11,
|
|
|
|
ARM::S12,ARM::S13,ARM::S14,ARM::S15,
|
|
|
|
ARM::S16,ARM::S17,ARM::S18,ARM::S19,
|
|
|
|
ARM::S20,ARM::S21,ARM::S22,ARM::S23,
|
|
|
|
ARM::S24,ARM::S25,ARM::S26,ARM::S27,
|
|
|
|
ARM::S28,ARM::S29,ARM::S30,ARM::S31, 0);
|
2009-12-18 01:03:29 +00:00
|
|
|
if (VT.getSizeInBits() == 64)
|
2007-04-02 17:24:08 +00:00
|
|
|
return make_vector<unsigned>(ARM::D0, ARM::D1, ARM::D2, ARM::D3,
|
|
|
|
ARM::D4, ARM::D5, ARM::D6, ARM::D7,
|
|
|
|
ARM::D8, ARM::D9, ARM::D10,ARM::D11,
|
|
|
|
ARM::D12,ARM::D13,ARM::D14,ARM::D15, 0);
|
2009-12-08 23:06:22 +00:00
|
|
|
if (VT.getSizeInBits() == 128)
|
|
|
|
return make_vector<unsigned>(ARM::Q0, ARM::Q1, ARM::Q2, ARM::Q3,
|
|
|
|
ARM::Q4, ARM::Q5, ARM::Q6, ARM::Q7, 0);
|
2007-04-02 17:24:08 +00:00
|
|
|
break;
|
2007-01-19 07:51:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return std::vector<unsigned>();
|
|
|
|
}
|
2009-04-01 17:58:54 +00:00
|
|
|
|
|
|
|
/// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
|
|
|
|
/// vector. If it is invalid, don't add anything to Ops.
|
|
|
|
void ARMTargetLowering::LowerAsmOperandForConstraint(SDValue Op,
|
|
|
|
char Constraint,
|
|
|
|
std::vector<SDValue>&Ops,
|
|
|
|
SelectionDAG &DAG) const {
|
|
|
|
SDValue Result(0, 0);
|
|
|
|
|
|
|
|
switch (Constraint) {
|
|
|
|
default: break;
|
|
|
|
case 'I': case 'J': case 'K': case 'L':
|
|
|
|
case 'M': case 'N': case 'O':
|
|
|
|
ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
|
|
|
|
if (!C)
|
|
|
|
return;
|
|
|
|
|
|
|
|
int64_t CVal64 = C->getSExtValue();
|
|
|
|
int CVal = (int) CVal64;
|
|
|
|
// None of these constraints allow values larger than 32 bits. Check
|
|
|
|
// that the value fits in an int.
|
|
|
|
if (CVal != CVal64)
|
|
|
|
return;
|
|
|
|
|
|
|
|
switch (Constraint) {
|
|
|
|
case 'I':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb1Only()) {
|
|
|
|
// This must be a constant between 0 and 255, for ADD
|
|
|
|
// immediates.
|
2009-04-01 17:58:54 +00:00
|
|
|
if (CVal >= 0 && CVal <= 255)
|
|
|
|
break;
|
2009-07-08 23:10:31 +00:00
|
|
|
} else if (Subtarget->isThumb2()) {
|
|
|
|
// A constant that can be used as an immediate value in a
|
|
|
|
// data-processing instruction.
|
|
|
|
if (ARM_AM::getT2SOImmVal(CVal) != -1)
|
|
|
|
break;
|
2009-04-01 17:58:54 +00:00
|
|
|
} else {
|
|
|
|
// A constant that can be used as an immediate value in a
|
|
|
|
// data-processing instruction.
|
|
|
|
if (ARM_AM::getSOImmVal(CVal) != -1)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'J':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb()) { // FIXME thumb2
|
2009-04-01 17:58:54 +00:00
|
|
|
// This must be a constant between -255 and -1, for negated ADD
|
|
|
|
// immediates. This can be used in GCC with an "n" modifier that
|
|
|
|
// prints the negated value, for use with SUB instructions. It is
|
|
|
|
// not useful otherwise but is implemented for compatibility.
|
|
|
|
if (CVal >= -255 && CVal <= -1)
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
// This must be a constant between -4095 and 4095. It is not clear
|
|
|
|
// what this constraint is intended for. Implemented for
|
|
|
|
// compatibility with GCC.
|
|
|
|
if (CVal >= -4095 && CVal <= 4095)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'K':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb1Only()) {
|
2009-04-01 17:58:54 +00:00
|
|
|
// A 32-bit value where only one byte has a nonzero value. Exclude
|
|
|
|
// zero to match GCC. This constraint is used by GCC internally for
|
|
|
|
// constants that can be loaded with a move/shift combination.
|
|
|
|
// It is not useful otherwise but is implemented for compatibility.
|
|
|
|
if (CVal != 0 && ARM_AM::isThumbImmShiftedVal(CVal))
|
|
|
|
break;
|
2009-07-08 23:10:31 +00:00
|
|
|
} else if (Subtarget->isThumb2()) {
|
|
|
|
// A constant whose bitwise inverse can be used as an immediate
|
|
|
|
// value in a data-processing instruction. This can be used in GCC
|
|
|
|
// with a "B" modifier that prints the inverted value, for use with
|
|
|
|
// BIC and MVN instructions. It is not useful otherwise but is
|
|
|
|
// implemented for compatibility.
|
|
|
|
if (ARM_AM::getT2SOImmVal(~CVal) != -1)
|
|
|
|
break;
|
2009-04-01 17:58:54 +00:00
|
|
|
} else {
|
|
|
|
// A constant whose bitwise inverse can be used as an immediate
|
|
|
|
// value in a data-processing instruction. This can be used in GCC
|
|
|
|
// with a "B" modifier that prints the inverted value, for use with
|
|
|
|
// BIC and MVN instructions. It is not useful otherwise but is
|
|
|
|
// implemented for compatibility.
|
|
|
|
if (ARM_AM::getSOImmVal(~CVal) != -1)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'L':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb1Only()) {
|
2009-04-01 17:58:54 +00:00
|
|
|
// This must be a constant between -7 and 7,
|
|
|
|
// for 3-operand ADD/SUB immediate instructions.
|
|
|
|
if (CVal >= -7 && CVal < 7)
|
|
|
|
break;
|
2009-07-08 23:10:31 +00:00
|
|
|
} else if (Subtarget->isThumb2()) {
|
|
|
|
// A constant whose negation can be used as an immediate value in a
|
|
|
|
// data-processing instruction. This can be used in GCC with an "n"
|
|
|
|
// modifier that prints the negated value, for use with SUB
|
|
|
|
// instructions. It is not useful otherwise but is implemented for
|
|
|
|
// compatibility.
|
|
|
|
if (ARM_AM::getT2SOImmVal(-CVal) != -1)
|
|
|
|
break;
|
2009-04-01 17:58:54 +00:00
|
|
|
} else {
|
|
|
|
// A constant whose negation can be used as an immediate value in a
|
|
|
|
// data-processing instruction. This can be used in GCC with an "n"
|
|
|
|
// modifier that prints the negated value, for use with SUB
|
|
|
|
// instructions. It is not useful otherwise but is implemented for
|
|
|
|
// compatibility.
|
|
|
|
if (ARM_AM::getSOImmVal(-CVal) != -1)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'M':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb()) { // FIXME thumb2
|
2009-04-01 17:58:54 +00:00
|
|
|
// This must be a multiple of 4 between 0 and 1020, for
|
|
|
|
// ADD sp + immediate.
|
|
|
|
if ((CVal >= 0 && CVal <= 1020) && ((CVal & 3) == 0))
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
// A power of two or a constant between 0 and 32. This is used in
|
|
|
|
// GCC for the shift amount on shifted register operands, but it is
|
|
|
|
// useful in general for any shift amounts.
|
|
|
|
if ((CVal >= 0 && CVal <= 32) || ((CVal & (CVal - 1)) == 0))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'N':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb()) { // FIXME thumb2
|
2009-04-01 17:58:54 +00:00
|
|
|
// This must be a constant between 0 and 31, for shift amounts.
|
|
|
|
if (CVal >= 0 && CVal <= 31)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
|
|
|
|
case 'O':
|
2009-07-08 23:10:31 +00:00
|
|
|
if (Subtarget->isThumb()) { // FIXME thumb2
|
2009-04-01 17:58:54 +00:00
|
|
|
// This must be a multiple of 4 between -508 and 508, for
|
|
|
|
// ADD/SUB sp = sp + immediate.
|
|
|
|
if ((CVal >= -508 && CVal <= 508) && ((CVal & 3) == 0))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Result = DAG.getTargetConstant(CVal, Op.getValueType());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Result.getNode()) {
|
|
|
|
Ops.push_back(Result);
|
|
|
|
return;
|
|
|
|
}
|
2010-06-25 21:55:36 +00:00
|
|
|
return TargetLowering::LowerAsmOperandForConstraint(Op, Constraint, Ops, DAG);
|
2009-04-01 17:58:54 +00:00
|
|
|
}
|
2009-09-23 19:04:09 +00:00
|
|
|
|
|
|
|
bool
|
|
|
|
ARMTargetLowering::isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const {
|
|
|
|
// The ARM target isn't yet aware of offsets.
|
|
|
|
return false;
|
|
|
|
}
|
2009-10-28 01:44:26 +00:00
|
|
|
|
|
|
|
int ARM::getVFPf32Imm(const APFloat &FPImm) {
|
|
|
|
APInt Imm = FPImm.bitcastToAPInt();
|
|
|
|
uint32_t Sign = Imm.lshr(31).getZExtValue() & 1;
|
|
|
|
int32_t Exp = (Imm.lshr(23).getSExtValue() & 0xff) - 127; // -126 to 127
|
|
|
|
int64_t Mantissa = Imm.getZExtValue() & 0x7fffff; // 23 bits
|
|
|
|
|
|
|
|
// We can handle 4 bits of mantissa.
|
|
|
|
// mantissa = (16+UInt(e:f:g:h))/16.
|
|
|
|
if (Mantissa & 0x7ffff)
|
|
|
|
return -1;
|
|
|
|
Mantissa >>= 19;
|
|
|
|
if ((Mantissa & 0xf) != Mantissa)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
// We can handle 3 bits of exponent: exp == UInt(NOT(b):c:d)-3
|
|
|
|
if (Exp < -3 || Exp > 4)
|
|
|
|
return -1;
|
|
|
|
Exp = ((Exp+3) & 0x7) ^ 4;
|
|
|
|
|
|
|
|
return ((int)Sign << 7) | (Exp << 4) | Mantissa;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ARM::getVFPf64Imm(const APFloat &FPImm) {
|
|
|
|
APInt Imm = FPImm.bitcastToAPInt();
|
|
|
|
uint64_t Sign = Imm.lshr(63).getZExtValue() & 1;
|
|
|
|
int64_t Exp = (Imm.lshr(52).getSExtValue() & 0x7ff) - 1023; // -1022 to 1023
|
|
|
|
uint64_t Mantissa = Imm.getZExtValue() & 0xfffffffffffffLL;
|
|
|
|
|
|
|
|
// We can handle 4 bits of mantissa.
|
|
|
|
// mantissa = (16+UInt(e:f:g:h))/16.
|
|
|
|
if (Mantissa & 0xffffffffffffLL)
|
|
|
|
return -1;
|
|
|
|
Mantissa >>= 48;
|
|
|
|
if ((Mantissa & 0xf) != Mantissa)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
// We can handle 3 bits of exponent: exp == UInt(NOT(b):c:d)-3
|
|
|
|
if (Exp < -3 || Exp > 4)
|
|
|
|
return -1;
|
|
|
|
Exp = ((Exp+3) & 0x7) ^ 4;
|
|
|
|
|
|
|
|
return ((int)Sign << 7) | (Exp << 4) | Mantissa;
|
|
|
|
}
|
|
|
|
|
2010-07-16 23:05:05 +00:00
|
|
|
bool ARM::isBitFieldInvertedMask(unsigned v) {
|
|
|
|
if (v == 0xffffffff)
|
|
|
|
return 0;
|
|
|
|
// there can be 1's on either or both "outsides", all the "inside"
|
|
|
|
// bits must be 0's
|
|
|
|
unsigned int lsb = 0, msb = 31;
|
|
|
|
while (v & (1 << msb)) --msb;
|
|
|
|
while (v & (1 << lsb)) ++lsb;
|
|
|
|
for (unsigned int i = lsb; i <= msb; ++i) {
|
|
|
|
if (v & (1 << i))
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2009-10-28 01:44:26 +00:00
|
|
|
/// isFPImmLegal - Returns true if the target can instruction select the
|
|
|
|
/// specified FP immediate natively. If false, the legalizer will
|
|
|
|
/// materialize the FP immediate as a load from a constant pool.
|
|
|
|
bool ARMTargetLowering::isFPImmLegal(const APFloat &Imm, EVT VT) const {
|
|
|
|
if (!Subtarget->hasVFP3())
|
|
|
|
return false;
|
|
|
|
if (VT == MVT::f32)
|
|
|
|
return ARM::getVFPf32Imm(Imm) != -1;
|
|
|
|
if (VT == MVT::f64)
|
|
|
|
return ARM::getVFPf64Imm(Imm) != -1;
|
|
|
|
return false;
|
|
|
|
}
|
2010-09-21 17:56:22 +00:00
|
|
|
|
2010-11-23 03:31:01 +00:00
|
|
|
/// getTgtMemIntrinsic - Represent NEON load and store intrinsics as
|
2010-09-21 17:56:22 +00:00
|
|
|
/// MemIntrinsicNodes. The associated MachineMemOperands record the alignment
|
|
|
|
/// specified in the intrinsic calls.
|
|
|
|
bool ARMTargetLowering::getTgtMemIntrinsic(IntrinsicInfo &Info,
|
|
|
|
const CallInst &I,
|
|
|
|
unsigned Intrinsic) const {
|
|
|
|
switch (Intrinsic) {
|
|
|
|
case Intrinsic::arm_neon_vld1:
|
|
|
|
case Intrinsic::arm_neon_vld2:
|
|
|
|
case Intrinsic::arm_neon_vld3:
|
|
|
|
case Intrinsic::arm_neon_vld4:
|
|
|
|
case Intrinsic::arm_neon_vld2lane:
|
|
|
|
case Intrinsic::arm_neon_vld3lane:
|
|
|
|
case Intrinsic::arm_neon_vld4lane: {
|
|
|
|
Info.opc = ISD::INTRINSIC_W_CHAIN;
|
|
|
|
// Conservatively set memVT to the entire set of vectors loaded.
|
|
|
|
uint64_t NumElts = getTargetData()->getTypeAllocSize(I.getType()) / 8;
|
|
|
|
Info.memVT = EVT::getVectorVT(I.getType()->getContext(), MVT::i64, NumElts);
|
|
|
|
Info.ptrVal = I.getArgOperand(0);
|
|
|
|
Info.offset = 0;
|
|
|
|
Value *AlignArg = I.getArgOperand(I.getNumArgOperands() - 1);
|
|
|
|
Info.align = cast<ConstantInt>(AlignArg)->getZExtValue();
|
|
|
|
Info.vol = false; // volatile loads with NEON intrinsics not supported
|
|
|
|
Info.readMem = true;
|
|
|
|
Info.writeMem = false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
case Intrinsic::arm_neon_vst1:
|
|
|
|
case Intrinsic::arm_neon_vst2:
|
|
|
|
case Intrinsic::arm_neon_vst3:
|
|
|
|
case Intrinsic::arm_neon_vst4:
|
|
|
|
case Intrinsic::arm_neon_vst2lane:
|
|
|
|
case Intrinsic::arm_neon_vst3lane:
|
|
|
|
case Intrinsic::arm_neon_vst4lane: {
|
|
|
|
Info.opc = ISD::INTRINSIC_VOID;
|
|
|
|
// Conservatively set memVT to the entire set of vectors stored.
|
|
|
|
unsigned NumElts = 0;
|
|
|
|
for (unsigned ArgI = 1, ArgE = I.getNumArgOperands(); ArgI < ArgE; ++ArgI) {
|
|
|
|
const Type *ArgTy = I.getArgOperand(ArgI)->getType();
|
|
|
|
if (!ArgTy->isVectorTy())
|
|
|
|
break;
|
|
|
|
NumElts += getTargetData()->getTypeAllocSize(ArgTy) / 8;
|
|
|
|
}
|
|
|
|
Info.memVT = EVT::getVectorVT(I.getType()->getContext(), MVT::i64, NumElts);
|
|
|
|
Info.ptrVal = I.getArgOperand(0);
|
|
|
|
Info.offset = 0;
|
|
|
|
Value *AlignArg = I.getArgOperand(I.getNumArgOperands() - 1);
|
|
|
|
Info.align = cast<ConstantInt>(AlignArg)->getZExtValue();
|
|
|
|
Info.vol = false; // volatile stores with NEON intrinsics not supported
|
|
|
|
Info.readMem = false;
|
|
|
|
Info.writeMem = true;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|