Gitiles
Code Review Sign In
gerrit-public.fairphone.software / fp2-dev / platform / external / llvm / 90f011e0baa68ea02b80e8b913f7120537ce05aa / . / lib / CodeGen / SelectionDAG / TargetLowering.cpp
blob: 77732e04a2235dfead294a9e29ad9abdceffa0da [file] [log] [blame]
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]1//===-- TargetLowering.cpp - Implement the TargetLowering class -----------===//
Misha Brukmanf976c852005-04-21 22:55:34 +0000[diff] [blame]2//
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]3// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +0000[diff] [blame]5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanf976c852005-04-21 22:55:34 +0000[diff] [blame]7//
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]8//===----------------------------------------------------------------------===//
9//
10// This implements the TargetLowering class.
11//
12//===----------------------------------------------------------------------===//
13
14#include "llvm/Target/TargetLowering.h"
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]15#include "llvm/ADT/BitVector.h"
Owen Anderson718cb662007-09-07 04:06:50 +0000[diff] [blame]16#include "llvm/ADT/STLExtras.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +0000[diff] [blame]17#include "llvm/CodeGen/Analysis.h"
18#include "llvm/CodeGen/MachineFrameInfo.h"
19#include "llvm/CodeGen/MachineFunction.h"
20#include "llvm/CodeGen/MachineJumpTableInfo.h"
21#include "llvm/CodeGen/SelectionDAG.h"
Chandler Carruth0b8c9a82013-01-02 11:36:10 +0000[diff] [blame]22#include "llvm/IR/DataLayout.h"
23#include "llvm/IR/DerivedTypes.h"
24#include "llvm/IR/GlobalVariable.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +0000[diff] [blame]25#include "llvm/MC/MCAsmInfo.h"
26#include "llvm/MC/MCExpr.h"
Nadav Rotemb6fbec32011-06-01 12:51:46 +0000[diff] [blame]27#include "llvm/Support/CommandLine.h"
Torok Edwinc25e7582009-07-11 20:10:48 +0000[diff] [blame]28#include "llvm/Support/ErrorHandling.h"
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]29#include "llvm/Support/MathExtras.h"
Chandler Carruthd04a8d42012-12-03 16:50:05 +0000[diff] [blame]30#include "llvm/Target/TargetLoweringObjectFile.h"
31#include "llvm/Target/TargetMachine.h"
32#include "llvm/Target/TargetRegisterInfo.h"
Nick Lewycky476b2422010-12-19 20:43:38 +0000[diff] [blame]33#include <cctype>
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]34using namespace llvm;
35
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]36/// InitLibcallNames - Set default libcall names.
37///
Evan Cheng79cca502007-01-12 22:51:10 +0000[diff] [blame]38static void InitLibcallNames(const char **Names) {
Anton Korobeynikovc31642f2009-05-03 13:14:08 +0000[diff] [blame]39 Names[RTLIB::SHL_I16] = "__ashlhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]40 Names[RTLIB::SHL_I32] = "__ashlsi3";
41 Names[RTLIB::SHL_I64] = "__ashldi3";
Duncan Sandsdddc6292008-07-11 16:52:29 +0000[diff] [blame]42 Names[RTLIB::SHL_I128] = "__ashlti3";
Anton Korobeynikovc31642f2009-05-03 13:14:08 +0000[diff] [blame]43 Names[RTLIB::SRL_I16] = "__lshrhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]44 Names[RTLIB::SRL_I32] = "__lshrsi3";
45 Names[RTLIB::SRL_I64] = "__lshrdi3";
Duncan Sandsdddc6292008-07-11 16:52:29 +0000[diff] [blame]46 Names[RTLIB::SRL_I128] = "__lshrti3";
Anton Korobeynikovc31642f2009-05-03 13:14:08 +0000[diff] [blame]47 Names[RTLIB::SRA_I16] = "__ashrhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]48 Names[RTLIB::SRA_I32] = "__ashrsi3";
49 Names[RTLIB::SRA_I64] = "__ashrdi3";
Duncan Sandsdddc6292008-07-11 16:52:29 +0000[diff] [blame]50 Names[RTLIB::SRA_I128] = "__ashrti3";
Anton Korobeynikov8983da72009-11-07 17:14:39 +0000[diff] [blame]51 Names[RTLIB::MUL_I8] = "__mulqi3";
Anton Korobeynikovc31642f2009-05-03 13:14:08 +0000[diff] [blame]52 Names[RTLIB::MUL_I16] = "__mulhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]53 Names[RTLIB::MUL_I32] = "__mulsi3";
54 Names[RTLIB::MUL_I64] = "__muldi3";
Duncan Sands5ac319a2008-07-10 15:35:05 +0000[diff] [blame]55 Names[RTLIB::MUL_I128] = "__multi3";
Eric Christopher362fee92011-06-17 20:41:29 +0000[diff] [blame]56 Names[RTLIB::MULO_I32] = "__mulosi4";
57 Names[RTLIB::MULO_I64] = "__mulodi4";
58 Names[RTLIB::MULO_I128] = "__muloti4";
Anton Korobeynikov8983da72009-11-07 17:14:39 +0000[diff] [blame]59 Names[RTLIB::SDIV_I8] = "__divqi3";
Anton Korobeynikov813090c2009-05-03 13:18:16 +0000[diff] [blame]60 Names[RTLIB::SDIV_I16] = "__divhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]61 Names[RTLIB::SDIV_I32] = "__divsi3";
62 Names[RTLIB::SDIV_I64] = "__divdi3";
Duncan Sands5ac319a2008-07-10 15:35:05 +0000[diff] [blame]63 Names[RTLIB::SDIV_I128] = "__divti3";
Anton Korobeynikov8983da72009-11-07 17:14:39 +0000[diff] [blame]64 Names[RTLIB::UDIV_I8] = "__udivqi3";
Anton Korobeynikovfb3f84f2009-05-08 18:50:54 +0000[diff] [blame]65 Names[RTLIB::UDIV_I16] = "__udivhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]66 Names[RTLIB::UDIV_I32] = "__udivsi3";
67 Names[RTLIB::UDIV_I64] = "__udivdi3";
Duncan Sands5ac319a2008-07-10 15:35:05 +0000[diff] [blame]68 Names[RTLIB::UDIV_I128] = "__udivti3";
Anton Korobeynikov8983da72009-11-07 17:14:39 +0000[diff] [blame]69 Names[RTLIB::SREM_I8] = "__modqi3";
Anton Korobeynikov813090c2009-05-03 13:18:16 +0000[diff] [blame]70 Names[RTLIB::SREM_I16] = "__modhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]71 Names[RTLIB::SREM_I32] = "__modsi3";
72 Names[RTLIB::SREM_I64] = "__moddi3";
Duncan Sands5ac319a2008-07-10 15:35:05 +0000[diff] [blame]73 Names[RTLIB::SREM_I128] = "__modti3";
Anton Korobeynikov8983da72009-11-07 17:14:39 +0000[diff] [blame]74 Names[RTLIB::UREM_I8] = "__umodqi3";
Anton Korobeynikov9fe9c8e2009-05-03 13:19:57 +0000[diff] [blame]75 Names[RTLIB::UREM_I16] = "__umodhi3";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]76 Names[RTLIB::UREM_I32] = "__umodsi3";
77 Names[RTLIB::UREM_I64] = "__umoddi3";
Duncan Sands5ac319a2008-07-10 15:35:05 +0000[diff] [blame]78 Names[RTLIB::UREM_I128] = "__umodti3";
Evan Cheng8e23e812011-04-01 00:42:02 +0000[diff] [blame]79
80 // These are generally not available.
81 Names[RTLIB::SDIVREM_I8] = 0;
82 Names[RTLIB::SDIVREM_I16] = 0;
83 Names[RTLIB::SDIVREM_I32] = 0;
84 Names[RTLIB::SDIVREM_I64] = 0;
85 Names[RTLIB::SDIVREM_I128] = 0;
86 Names[RTLIB::UDIVREM_I8] = 0;
87 Names[RTLIB::UDIVREM_I16] = 0;
88 Names[RTLIB::UDIVREM_I32] = 0;
89 Names[RTLIB::UDIVREM_I64] = 0;
90 Names[RTLIB::UDIVREM_I128] = 0;
91
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]92 Names[RTLIB::NEG_I32] = "__negsi2";
93 Names[RTLIB::NEG_I64] = "__negdi2";
94 Names[RTLIB::ADD_F32] = "__addsf3";
95 Names[RTLIB::ADD_F64] = "__adddf3";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]96 Names[RTLIB::ADD_F80] = "__addxf3";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]97 Names[RTLIB::ADD_PPCF128] = "__gcc_qadd";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]98 Names[RTLIB::SUB_F32] = "__subsf3";
99 Names[RTLIB::SUB_F64] = "__subdf3";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]100 Names[RTLIB::SUB_F80] = "__subxf3";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]101 Names[RTLIB::SUB_PPCF128] = "__gcc_qsub";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]102 Names[RTLIB::MUL_F32] = "__mulsf3";
103 Names[RTLIB::MUL_F64] = "__muldf3";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]104 Names[RTLIB::MUL_F80] = "__mulxf3";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]105 Names[RTLIB::MUL_PPCF128] = "__gcc_qmul";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]106 Names[RTLIB::DIV_F32] = "__divsf3";
107 Names[RTLIB::DIV_F64] = "__divdf3";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]108 Names[RTLIB::DIV_F80] = "__divxf3";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]109 Names[RTLIB::DIV_PPCF128] = "__gcc_qdiv";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]110 Names[RTLIB::REM_F32] = "fmodf";
111 Names[RTLIB::REM_F64] = "fmod";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]112 Names[RTLIB::REM_F80] = "fmodl";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]113 Names[RTLIB::REM_PPCF128] = "fmodl";
Cameron Zwarich33390842011-07-08 21:39:21 +0000[diff] [blame]114 Names[RTLIB::FMA_F32] = "fmaf";
115 Names[RTLIB::FMA_F64] = "fma";
116 Names[RTLIB::FMA_F80] = "fmal";
117 Names[RTLIB::FMA_PPCF128] = "fmal";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]118 Names[RTLIB::POWI_F32] = "__powisf2";
119 Names[RTLIB::POWI_F64] = "__powidf2";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]120 Names[RTLIB::POWI_F80] = "__powixf2";
121 Names[RTLIB::POWI_PPCF128] = "__powitf2";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]122 Names[RTLIB::SQRT_F32] = "sqrtf";
123 Names[RTLIB::SQRT_F64] = "sqrt";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]124 Names[RTLIB::SQRT_F80] = "sqrtl";
125 Names[RTLIB::SQRT_PPCF128] = "sqrtl";
Dale Johannesen7794f2a2008-09-04 00:47:13 +0000[diff] [blame]126 Names[RTLIB::LOG_F32] = "logf";
127 Names[RTLIB::LOG_F64] = "log";
128 Names[RTLIB::LOG_F80] = "logl";
129 Names[RTLIB::LOG_PPCF128] = "logl";
130 Names[RTLIB::LOG2_F32] = "log2f";
131 Names[RTLIB::LOG2_F64] = "log2";
132 Names[RTLIB::LOG2_F80] = "log2l";
133 Names[RTLIB::LOG2_PPCF128] = "log2l";
134 Names[RTLIB::LOG10_F32] = "log10f";
135 Names[RTLIB::LOG10_F64] = "log10";
136 Names[RTLIB::LOG10_F80] = "log10l";
137 Names[RTLIB::LOG10_PPCF128] = "log10l";
138 Names[RTLIB::EXP_F32] = "expf";
139 Names[RTLIB::EXP_F64] = "exp";
140 Names[RTLIB::EXP_F80] = "expl";
141 Names[RTLIB::EXP_PPCF128] = "expl";
142 Names[RTLIB::EXP2_F32] = "exp2f";
143 Names[RTLIB::EXP2_F64] = "exp2";
144 Names[RTLIB::EXP2_F80] = "exp2l";
145 Names[RTLIB::EXP2_PPCF128] = "exp2l";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]146 Names[RTLIB::SIN_F32] = "sinf";
147 Names[RTLIB::SIN_F64] = "sin";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]148 Names[RTLIB::SIN_F80] = "sinl";
149 Names[RTLIB::SIN_PPCF128] = "sinl";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]150 Names[RTLIB::COS_F32] = "cosf";
151 Names[RTLIB::COS_F64] = "cos";
Duncan Sands007f9842008-01-10 10:28:30 +0000[diff] [blame]152 Names[RTLIB::COS_F80] = "cosl";
153 Names[RTLIB::COS_PPCF128] = "cosl";
Dan Gohmane54be102007-10-11 23:09:10 +0000[diff] [blame]154 Names[RTLIB::POW_F32] = "powf";
155 Names[RTLIB::POW_F64] = "pow";
156 Names[RTLIB::POW_F80] = "powl";
157 Names[RTLIB::POW_PPCF128] = "powl";
Dan Gohman2bb1e3e2008-08-21 18:38:14 +0000[diff] [blame]158 Names[RTLIB::CEIL_F32] = "ceilf";
159 Names[RTLIB::CEIL_F64] = "ceil";
160 Names[RTLIB::CEIL_F80] = "ceill";
161 Names[RTLIB::CEIL_PPCF128] = "ceill";
162 Names[RTLIB::TRUNC_F32] = "truncf";
163 Names[RTLIB::TRUNC_F64] = "trunc";
164 Names[RTLIB::TRUNC_F80] = "truncl";
165 Names[RTLIB::TRUNC_PPCF128] = "truncl";
166 Names[RTLIB::RINT_F32] = "rintf";
167 Names[RTLIB::RINT_F64] = "rint";
168 Names[RTLIB::RINT_F80] = "rintl";
169 Names[RTLIB::RINT_PPCF128] = "rintl";
170 Names[RTLIB::NEARBYINT_F32] = "nearbyintf";
171 Names[RTLIB::NEARBYINT_F64] = "nearbyint";
172 Names[RTLIB::NEARBYINT_F80] = "nearbyintl";
173 Names[RTLIB::NEARBYINT_PPCF128] = "nearbyintl";
174 Names[RTLIB::FLOOR_F32] = "floorf";
175 Names[RTLIB::FLOOR_F64] = "floor";
176 Names[RTLIB::FLOOR_F80] = "floorl";
177 Names[RTLIB::FLOOR_PPCF128] = "floorl";
Duncan Sandsd2c817e2010-03-14 21:08:40 +0000[diff] [blame]178 Names[RTLIB::COPYSIGN_F32] = "copysignf";
179 Names[RTLIB::COPYSIGN_F64] = "copysign";
180 Names[RTLIB::COPYSIGN_F80] = "copysignl";
181 Names[RTLIB::COPYSIGN_PPCF128] = "copysignl";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]182 Names[RTLIB::FPEXT_F32_F64] = "__extendsfdf2";
Anton Korobeynikov927411b2010-03-14 18:42:24 +0000[diff] [blame]183 Names[RTLIB::FPEXT_F16_F32] = "__gnu_h2f_ieee";
184 Names[RTLIB::FPROUND_F32_F16] = "__gnu_f2h_ieee";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]185 Names[RTLIB::FPROUND_F64_F32] = "__truncdfsf2";
Bruno Cardoso Lopese36bfe62008-08-07 19:01:24 +0000[diff] [blame]186 Names[RTLIB::FPROUND_F80_F32] = "__truncxfsf2";
187 Names[RTLIB::FPROUND_PPCF128_F32] = "__trunctfsf2";
188 Names[RTLIB::FPROUND_F80_F64] = "__truncxfdf2";
189 Names[RTLIB::FPROUND_PPCF128_F64] = "__trunctfdf2";
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]190 Names[RTLIB::FPTOSINT_F32_I8] = "__fixsfqi";
191 Names[RTLIB::FPTOSINT_F32_I16] = "__fixsfhi";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]192 Names[RTLIB::FPTOSINT_F32_I32] = "__fixsfsi";
193 Names[RTLIB::FPTOSINT_F32_I64] = "__fixsfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]194 Names[RTLIB::FPTOSINT_F32_I128] = "__fixsfti";
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]195 Names[RTLIB::FPTOSINT_F64_I8] = "__fixdfqi";
196 Names[RTLIB::FPTOSINT_F64_I16] = "__fixdfhi";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]197 Names[RTLIB::FPTOSINT_F64_I32] = "__fixdfsi";
198 Names[RTLIB::FPTOSINT_F64_I64] = "__fixdfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]199 Names[RTLIB::FPTOSINT_F64_I128] = "__fixdfti";
Duncan Sandsbe1ad4d2008-07-10 15:33:02 +0000[diff] [blame]200 Names[RTLIB::FPTOSINT_F80_I32] = "__fixxfsi";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]201 Names[RTLIB::FPTOSINT_F80_I64] = "__fixxfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]202 Names[RTLIB::FPTOSINT_F80_I128] = "__fixxfti";
Duncan Sands041cde22008-06-25 20:24:48 +0000[diff] [blame]203 Names[RTLIB::FPTOSINT_PPCF128_I32] = "__fixtfsi";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]204 Names[RTLIB::FPTOSINT_PPCF128_I64] = "__fixtfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]205 Names[RTLIB::FPTOSINT_PPCF128_I128] = "__fixtfti";
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]206 Names[RTLIB::FPTOUINT_F32_I8] = "__fixunssfqi";
207 Names[RTLIB::FPTOUINT_F32_I16] = "__fixunssfhi";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]208 Names[RTLIB::FPTOUINT_F32_I32] = "__fixunssfsi";
209 Names[RTLIB::FPTOUINT_F32_I64] = "__fixunssfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]210 Names[RTLIB::FPTOUINT_F32_I128] = "__fixunssfti";
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]211 Names[RTLIB::FPTOUINT_F64_I8] = "__fixunsdfqi";
212 Names[RTLIB::FPTOUINT_F64_I16] = "__fixunsdfhi";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]213 Names[RTLIB::FPTOUINT_F64_I32] = "__fixunsdfsi";
214 Names[RTLIB::FPTOUINT_F64_I64] = "__fixunsdfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]215 Names[RTLIB::FPTOUINT_F64_I128] = "__fixunsdfti";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]216 Names[RTLIB::FPTOUINT_F80_I32] = "__fixunsxfsi";
217 Names[RTLIB::FPTOUINT_F80_I64] = "__fixunsxfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]218 Names[RTLIB::FPTOUINT_F80_I128] = "__fixunsxfti";
Duncan Sands041cde22008-06-25 20:24:48 +0000[diff] [blame]219 Names[RTLIB::FPTOUINT_PPCF128_I32] = "__fixunstfsi";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]220 Names[RTLIB::FPTOUINT_PPCF128_I64] = "__fixunstfdi";
Dan Gohmana2e94852008-03-10 23:03:31 +0000[diff] [blame]221 Names[RTLIB::FPTOUINT_PPCF128_I128] = "__fixunstfti";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]222 Names[RTLIB::SINTTOFP_I32_F32] = "__floatsisf";
223 Names[RTLIB::SINTTOFP_I32_F64] = "__floatsidf";
Duncan Sands9bed0f52008-07-11 16:57:02 +0000[diff] [blame]224 Names[RTLIB::SINTTOFP_I32_F80] = "__floatsixf";
225 Names[RTLIB::SINTTOFP_I32_PPCF128] = "__floatsitf";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]226 Names[RTLIB::SINTTOFP_I64_F32] = "__floatdisf";
227 Names[RTLIB::SINTTOFP_I64_F64] = "__floatdidf";
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]228 Names[RTLIB::SINTTOFP_I64_F80] = "__floatdixf";
229 Names[RTLIB::SINTTOFP_I64_PPCF128] = "__floatditf";
Dan Gohmand91446d2008-03-05 01:08:17 +0000[diff] [blame]230 Names[RTLIB::SINTTOFP_I128_F32] = "__floattisf";
231 Names[RTLIB::SINTTOFP_I128_F64] = "__floattidf";
232 Names[RTLIB::SINTTOFP_I128_F80] = "__floattixf";
233 Names[RTLIB::SINTTOFP_I128_PPCF128] = "__floattitf";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]234 Names[RTLIB::UINTTOFP_I32_F32] = "__floatunsisf";
235 Names[RTLIB::UINTTOFP_I32_F64] = "__floatunsidf";
Duncan Sandsac6cece2008-07-11 17:00:14 +0000[diff] [blame]236 Names[RTLIB::UINTTOFP_I32_F80] = "__floatunsixf";
237 Names[RTLIB::UINTTOFP_I32_PPCF128] = "__floatunsitf";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]238 Names[RTLIB::UINTTOFP_I64_F32] = "__floatundisf";
239 Names[RTLIB::UINTTOFP_I64_F64] = "__floatundidf";
Duncan Sandsac6cece2008-07-11 17:00:14 +0000[diff] [blame]240 Names[RTLIB::UINTTOFP_I64_F80] = "__floatundixf";
241 Names[RTLIB::UINTTOFP_I64_PPCF128] = "__floatunditf";
242 Names[RTLIB::UINTTOFP_I128_F32] = "__floatuntisf";
243 Names[RTLIB::UINTTOFP_I128_F64] = "__floatuntidf";
244 Names[RTLIB::UINTTOFP_I128_F80] = "__floatuntixf";
245 Names[RTLIB::UINTTOFP_I128_PPCF128] = "__floatuntitf";
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]246 Names[RTLIB::OEQ_F32] = "__eqsf2";
247 Names[RTLIB::OEQ_F64] = "__eqdf2";
248 Names[RTLIB::UNE_F32] = "__nesf2";
249 Names[RTLIB::UNE_F64] = "__nedf2";
250 Names[RTLIB::OGE_F32] = "__gesf2";
251 Names[RTLIB::OGE_F64] = "__gedf2";
252 Names[RTLIB::OLT_F32] = "__ltsf2";
253 Names[RTLIB::OLT_F64] = "__ltdf2";
254 Names[RTLIB::OLE_F32] = "__lesf2";
255 Names[RTLIB::OLE_F64] = "__ledf2";
256 Names[RTLIB::OGT_F32] = "__gtsf2";
257 Names[RTLIB::OGT_F64] = "__gtdf2";
258 Names[RTLIB::UO_F32] = "__unordsf2";
259 Names[RTLIB::UO_F64] = "__unorddf2";
Evan Chengd385fd62007-01-31 09:29:11 +0000[diff] [blame]260 Names[RTLIB::O_F32] = "__unordsf2";
261 Names[RTLIB::O_F64] = "__unorddf2";
Sanjiv Guptaa114baa2009-07-30 09:12:56 +0000[diff] [blame]262 Names[RTLIB::MEMCPY] = "memcpy";
263 Names[RTLIB::MEMMOVE] = "memmove";
264 Names[RTLIB::MEMSET] = "memset";
Duncan Sandsb0f1e172009-05-22 20:36:31 +0000[diff] [blame]265 Names[RTLIB::UNWIND_RESUME] = "_Unwind_Resume";
Jim Grosbache03262f2010-06-18 21:43:38 +0000[diff] [blame]266 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1] = "__sync_val_compare_and_swap_1";
267 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2] = "__sync_val_compare_and_swap_2";
268 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4] = "__sync_val_compare_and_swap_4";
269 Names[RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8] = "__sync_val_compare_and_swap_8";
Jim Grosbachef6eb9c2010-06-18 23:03:10 +0000[diff] [blame]270 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_1] = "__sync_lock_test_and_set_1";
271 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_2] = "__sync_lock_test_and_set_2";
272 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_4] = "__sync_lock_test_and_set_4";
273 Names[RTLIB::SYNC_LOCK_TEST_AND_SET_8] = "__sync_lock_test_and_set_8";
Jim Grosbache03262f2010-06-18 21:43:38 +0000[diff] [blame]274 Names[RTLIB::SYNC_FETCH_AND_ADD_1] = "__sync_fetch_and_add_1";
275 Names[RTLIB::SYNC_FETCH_AND_ADD_2] = "__sync_fetch_and_add_2";
276 Names[RTLIB::SYNC_FETCH_AND_ADD_4] = "__sync_fetch_and_add_4";
277 Names[RTLIB::SYNC_FETCH_AND_ADD_8] = "__sync_fetch_and_add_8";
278 Names[RTLIB::SYNC_FETCH_AND_SUB_1] = "__sync_fetch_and_sub_1";
279 Names[RTLIB::SYNC_FETCH_AND_SUB_2] = "__sync_fetch_and_sub_2";
280 Names[RTLIB::SYNC_FETCH_AND_SUB_4] = "__sync_fetch_and_sub_4";
281 Names[RTLIB::SYNC_FETCH_AND_SUB_8] = "__sync_fetch_and_sub_8";
282 Names[RTLIB::SYNC_FETCH_AND_AND_1] = "__sync_fetch_and_and_1";
283 Names[RTLIB::SYNC_FETCH_AND_AND_2] = "__sync_fetch_and_and_2";
284 Names[RTLIB::SYNC_FETCH_AND_AND_4] = "__sync_fetch_and_and_4";
285 Names[RTLIB::SYNC_FETCH_AND_AND_8] = "__sync_fetch_and_and_8";
286 Names[RTLIB::SYNC_FETCH_AND_OR_1] = "__sync_fetch_and_or_1";
287 Names[RTLIB::SYNC_FETCH_AND_OR_2] = "__sync_fetch_and_or_2";
288 Names[RTLIB::SYNC_FETCH_AND_OR_4] = "__sync_fetch_and_or_4";
289 Names[RTLIB::SYNC_FETCH_AND_OR_8] = "__sync_fetch_and_or_8";
290 Names[RTLIB::SYNC_FETCH_AND_XOR_1] = "__sync_fetch_and_xor_1";
291 Names[RTLIB::SYNC_FETCH_AND_XOR_2] = "__sync_fetch_and_xor_2";
Jim Grosbach312b7c92011-10-14 15:53:48 +0000[diff] [blame]292 Names[RTLIB::SYNC_FETCH_AND_XOR_4] = "__sync_fetch_and_xor_4";
Jim Grosbache03262f2010-06-18 21:43:38 +0000[diff] [blame]293 Names[RTLIB::SYNC_FETCH_AND_XOR_8] = "__sync_fetch_and_xor_8";
294 Names[RTLIB::SYNC_FETCH_AND_NAND_1] = "__sync_fetch_and_nand_1";
295 Names[RTLIB::SYNC_FETCH_AND_NAND_2] = "__sync_fetch_and_nand_2";
296 Names[RTLIB::SYNC_FETCH_AND_NAND_4] = "__sync_fetch_and_nand_4";
297 Names[RTLIB::SYNC_FETCH_AND_NAND_8] = "__sync_fetch_and_nand_8";
Evan Chengd385fd62007-01-31 09:29:11 +0000[diff] [blame]298}
299
Anton Korobeynikov72977a42009-08-14 20:10:52 +0000[diff] [blame]300/// InitLibcallCallingConvs - Set default libcall CallingConvs.
301///
302static void InitLibcallCallingConvs(CallingConv::ID *CCs) {
303 for (int i = 0; i < RTLIB::UNKNOWN_LIBCALL; ++i) {
304 CCs[i] = CallingConv::C;
305 }
306}
307
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]308/// getFPEXT - Return the FPEXT_*_* value for the given types, or
309/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]310RTLIB::Libcall RTLIB::getFPEXT(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]311 if (OpVT == MVT::f32) {
312 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]313 return FPEXT_F32_F64;
314 }
Anton Korobeynikov927411b2010-03-14 18:42:24 +0000[diff] [blame]315
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]316 return UNKNOWN_LIBCALL;
317}
318
319/// getFPROUND - Return the FPROUND_*_* value for the given types, or
320/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]321RTLIB::Libcall RTLIB::getFPROUND(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]322 if (RetVT == MVT::f32) {
323 if (OpVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]324 return FPROUND_F64_F32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]325 if (OpVT == MVT::f80)
Bruno Cardoso Lopese36bfe62008-08-07 19:01:24 +0000[diff] [blame]326 return FPROUND_F80_F32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]327 if (OpVT == MVT::ppcf128)
Bruno Cardoso Lopese36bfe62008-08-07 19:01:24 +0000[diff] [blame]328 return FPROUND_PPCF128_F32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]329 } else if (RetVT == MVT::f64) {
330 if (OpVT == MVT::f80)
Bruno Cardoso Lopese36bfe62008-08-07 19:01:24 +0000[diff] [blame]331 return FPROUND_F80_F64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]332 if (OpVT == MVT::ppcf128)
Bruno Cardoso Lopese36bfe62008-08-07 19:01:24 +0000[diff] [blame]333 return FPROUND_PPCF128_F64;
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]334 }
Anton Korobeynikov927411b2010-03-14 18:42:24 +0000[diff] [blame]335
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]336 return UNKNOWN_LIBCALL;
337}
338
339/// getFPTOSINT - Return the FPTOSINT_*_* value for the given types, or
340/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]341RTLIB::Libcall RTLIB::getFPTOSINT(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]342 if (OpVT == MVT::f32) {
343 if (RetVT == MVT::i8)
Sanjiv Gupta8aa207e2009-06-16 09:03:58 +0000[diff] [blame]344 return FPTOSINT_F32_I8;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]345 if (RetVT == MVT::i16)
Sanjiv Gupta8aa207e2009-06-16 09:03:58 +0000[diff] [blame]346 return FPTOSINT_F32_I16;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]347 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]348 return FPTOSINT_F32_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]349 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]350 return FPTOSINT_F32_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]351 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]352 return FPTOSINT_F32_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]353 } else if (OpVT == MVT::f64) {
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]354 if (RetVT == MVT::i8)
355 return FPTOSINT_F64_I8;
356 if (RetVT == MVT::i16)
357 return FPTOSINT_F64_I16;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]358 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]359 return FPTOSINT_F64_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]360 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]361 return FPTOSINT_F64_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]362 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]363 return FPTOSINT_F64_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]364 } else if (OpVT == MVT::f80) {
365 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]366 return FPTOSINT_F80_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]367 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]368 return FPTOSINT_F80_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]369 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]370 return FPTOSINT_F80_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]371 } else if (OpVT == MVT::ppcf128) {
372 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]373 return FPTOSINT_PPCF128_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]374 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]375 return FPTOSINT_PPCF128_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]376 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]377 return FPTOSINT_PPCF128_I128;
378 }
379 return UNKNOWN_LIBCALL;
380}
381
382/// getFPTOUINT - Return the FPTOUINT_*_* value for the given types, or
383/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]384RTLIB::Libcall RTLIB::getFPTOUINT(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]385 if (OpVT == MVT::f32) {
386 if (RetVT == MVT::i8)
Sanjiv Gupta8aa207e2009-06-16 09:03:58 +0000[diff] [blame]387 return FPTOUINT_F32_I8;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]388 if (RetVT == MVT::i16)
Sanjiv Gupta8aa207e2009-06-16 09:03:58 +0000[diff] [blame]389 return FPTOUINT_F32_I16;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]390 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]391 return FPTOUINT_F32_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]392 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]393 return FPTOUINT_F32_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]394 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]395 return FPTOUINT_F32_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]396 } else if (OpVT == MVT::f64) {
Anton Korobeynikovde0118c2010-03-26 21:32:14 +0000[diff] [blame]397 if (RetVT == MVT::i8)
398 return FPTOUINT_F64_I8;
399 if (RetVT == MVT::i16)
400 return FPTOUINT_F64_I16;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]401 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]402 return FPTOUINT_F64_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]403 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]404 return FPTOUINT_F64_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]405 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]406 return FPTOUINT_F64_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]407 } else if (OpVT == MVT::f80) {
408 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]409 return FPTOUINT_F80_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]410 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]411 return FPTOUINT_F80_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]412 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]413 return FPTOUINT_F80_I128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]414 } else if (OpVT == MVT::ppcf128) {
415 if (RetVT == MVT::i32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]416 return FPTOUINT_PPCF128_I32;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]417 if (RetVT == MVT::i64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]418 return FPTOUINT_PPCF128_I64;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]419 if (RetVT == MVT::i128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]420 return FPTOUINT_PPCF128_I128;
421 }
422 return UNKNOWN_LIBCALL;
423}
424
425/// getSINTTOFP - Return the SINTTOFP_*_* value for the given types, or
426/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]427RTLIB::Libcall RTLIB::getSINTTOFP(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]428 if (OpVT == MVT::i32) {
429 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]430 return SINTTOFP_I32_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]431 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]432 return SINTTOFP_I32_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]433 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]434 return SINTTOFP_I32_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]435 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]436 return SINTTOFP_I32_PPCF128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]437 } else if (OpVT == MVT::i64) {
438 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]439 return SINTTOFP_I64_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]440 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]441 return SINTTOFP_I64_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]442 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]443 return SINTTOFP_I64_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]444 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]445 return SINTTOFP_I64_PPCF128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]446 } else if (OpVT == MVT::i128) {
447 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]448 return SINTTOFP_I128_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]449 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]450 return SINTTOFP_I128_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]451 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]452 return SINTTOFP_I128_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]453 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]454 return SINTTOFP_I128_PPCF128;
455 }
456 return UNKNOWN_LIBCALL;
457}
458
459/// getUINTTOFP - Return the UINTTOFP_*_* value for the given types, or
460/// UNKNOWN_LIBCALL if there is none.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]461RTLIB::Libcall RTLIB::getUINTTOFP(EVT OpVT, EVT RetVT) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]462 if (OpVT == MVT::i32) {
463 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]464 return UINTTOFP_I32_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]465 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]466 return UINTTOFP_I32_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]467 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]468 return UINTTOFP_I32_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]469 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]470 return UINTTOFP_I32_PPCF128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]471 } else if (OpVT == MVT::i64) {
472 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]473 return UINTTOFP_I64_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]474 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]475 return UINTTOFP_I64_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]476 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]477 return UINTTOFP_I64_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]478 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]479 return UINTTOFP_I64_PPCF128;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]480 } else if (OpVT == MVT::i128) {
481 if (RetVT == MVT::f32)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]482 return UINTTOFP_I128_F32;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]483 if (RetVT == MVT::f64)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]484 return UINTTOFP_I128_F64;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]485 if (RetVT == MVT::f80)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]486 return UINTTOFP_I128_F80;
Craig Toppera1b3c032012-12-19 06:39:17 +0000[diff] [blame]487 if (RetVT == MVT::ppcf128)
Duncan Sandsb2ff8852008-07-17 02:36:29 +0000[diff] [blame]488 return UINTTOFP_I128_PPCF128;
489 }
490 return UNKNOWN_LIBCALL;
491}
492
Evan Chengd385fd62007-01-31 09:29:11 +0000[diff] [blame]493/// InitCmpLibcallCCs - Set default comparison libcall CC.
494///
495static void InitCmpLibcallCCs(ISD::CondCode *CCs) {
496 memset(CCs, ISD::SETCC_INVALID, sizeof(ISD::CondCode)*RTLIB::UNKNOWN_LIBCALL);
497 CCs[RTLIB::OEQ_F32] = ISD::SETEQ;
498 CCs[RTLIB::OEQ_F64] = ISD::SETEQ;
499 CCs[RTLIB::UNE_F32] = ISD::SETNE;
500 CCs[RTLIB::UNE_F64] = ISD::SETNE;
501 CCs[RTLIB::OGE_F32] = ISD::SETGE;
502 CCs[RTLIB::OGE_F64] = ISD::SETGE;
503 CCs[RTLIB::OLT_F32] = ISD::SETLT;
504 CCs[RTLIB::OLT_F64] = ISD::SETLT;
505 CCs[RTLIB::OLE_F32] = ISD::SETLE;
506 CCs[RTLIB::OLE_F64] = ISD::SETLE;
507 CCs[RTLIB::OGT_F32] = ISD::SETGT;
508 CCs[RTLIB::OGT_F64] = ISD::SETGT;
509 CCs[RTLIB::UO_F32] = ISD::SETNE;
510 CCs[RTLIB::UO_F64] = ISD::SETNE;
511 CCs[RTLIB::O_F32] = ISD::SETEQ;
512 CCs[RTLIB::O_F64] = ISD::SETEQ;
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]513}
514
Chris Lattnerf0144122009-07-28 03:13:23 +0000[diff] [blame]515/// NOTE: The constructor takes ownership of TLOF.
Dan Gohmanf0757b02010-04-21 01:34:56 +0000[diff] [blame]516TargetLowering::TargetLowering(const TargetMachine &tm,
517 const TargetLoweringObjectFile *tlof)
Micah Villmow3574eca2012-10-08 16:38:25 +0000[diff] [blame]518 : TM(tm), TD(TM.getDataLayout()), TLOF(*tlof) {
Chris Lattnercba82f92005-01-16 07:28:11 +0000[diff] [blame]519 // All operations default to being supported.
520 memset(OpActions, 0, sizeof(OpActions));
Evan Cheng03294662008-10-14 21:26:46 +0000[diff] [blame]521 memset(LoadExtActions, 0, sizeof(LoadExtActions));
Chris Lattnerddf89562008-01-17 19:59:44 +0000[diff] [blame]522 memset(TruncStoreActions, 0, sizeof(TruncStoreActions));
Chris Lattnerc9133f92008-01-18 19:36:20 +0000[diff] [blame]523 memset(IndexedModeActions, 0, sizeof(IndexedModeActions));
Evan Cheng7f042682008-10-15 02:05:31 +0000[diff] [blame]524 memset(CondCodeActions, 0, sizeof(CondCodeActions));
Dan Gohman93f81e22007-07-09 20:49:44 +0000[diff] [blame]525
Chris Lattner1a3048b2007-12-22 20:47:56 +0000[diff] [blame]526 // Set default actions for various operations.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]527 for (unsigned VT = 0; VT != (unsigned)MVT::LAST_VALUETYPE; ++VT) {
Chris Lattner1a3048b2007-12-22 20:47:56 +0000[diff] [blame]528 // Default all indexed load / store to expand.
Evan Cheng5ff839f2006-11-09 18:56:43 +0000[diff] [blame]529 for (unsigned IM = (unsigned)ISD::PRE_INC;
530 IM != (unsigned)ISD::LAST_INDEXED_MODE; ++IM) {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]531 setIndexedLoadAction(IM, (MVT::SimpleValueType)VT, Expand);
532 setIndexedStoreAction(IM, (MVT::SimpleValueType)VT, Expand);
Evan Cheng5ff839f2006-11-09 18:56:43 +0000[diff] [blame]533 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]534
Chris Lattner1a3048b2007-12-22 20:47:56 +0000[diff] [blame]535 // These operations default to expand.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]536 setOperationAction(ISD::FGETSIGN, (MVT::SimpleValueType)VT, Expand);
537 setOperationAction(ISD::CONCAT_VECTORS, (MVT::SimpleValueType)VT, Expand);
Evan Cheng5ff839f2006-11-09 18:56:43 +0000[diff] [blame]538 }
Evan Chengd2cde682008-03-10 19:38:10 +0000[diff] [blame]539
540 // Most targets ignore the @llvm.prefetch intrinsic.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]541 setOperationAction(ISD::PREFETCH, MVT::Other, Expand);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]542
543 // ConstantFP nodes default to expand. Targets can either change this to
Evan Chengeb2f9692009-10-27 19:56:55 +0000[diff] [blame]544 // Legal, in which case all fp constants are legal, or use isFPImmLegal()
Nate Begemane1795842008-02-14 08:57:00 +0000[diff] [blame]545 // to optimize expansions for certain constants.
Dan Gohmane3376ec2011-12-20 00:02:33 +0000[diff] [blame]546 setOperationAction(ISD::ConstantFP, MVT::f16, Expand);
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]547 setOperationAction(ISD::ConstantFP, MVT::f32, Expand);
548 setOperationAction(ISD::ConstantFP, MVT::f64, Expand);
549 setOperationAction(ISD::ConstantFP, MVT::f80, Expand);
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]550
Dale Johannesen0bb41602008-09-22 21:57:32 +0000[diff] [blame]551 // These library functions default to expand.
Dan Gohmane3376ec2011-12-20 00:02:33 +0000[diff] [blame]552 setOperationAction(ISD::FLOG , MVT::f16, Expand);
553 setOperationAction(ISD::FLOG2, MVT::f16, Expand);
554 setOperationAction(ISD::FLOG10, MVT::f16, Expand);
555 setOperationAction(ISD::FEXP , MVT::f16, Expand);
556 setOperationAction(ISD::FEXP2, MVT::f16, Expand);
557 setOperationAction(ISD::FFLOOR, MVT::f16, Expand);
558 setOperationAction(ISD::FNEARBYINT, MVT::f16, Expand);
559 setOperationAction(ISD::FCEIL, MVT::f16, Expand);
560 setOperationAction(ISD::FRINT, MVT::f16, Expand);
561 setOperationAction(ISD::FTRUNC, MVT::f16, Expand);
Owen Anderson4a4fdf32011-12-08 19:32:14 +0000[diff] [blame]562 setOperationAction(ISD::FLOG , MVT::f32, Expand);
563 setOperationAction(ISD::FLOG2, MVT::f32, Expand);
564 setOperationAction(ISD::FLOG10, MVT::f32, Expand);
565 setOperationAction(ISD::FEXP , MVT::f32, Expand);
566 setOperationAction(ISD::FEXP2, MVT::f32, Expand);
567 setOperationAction(ISD::FFLOOR, MVT::f32, Expand);
568 setOperationAction(ISD::FNEARBYINT, MVT::f32, Expand);
569 setOperationAction(ISD::FCEIL, MVT::f32, Expand);
570 setOperationAction(ISD::FRINT, MVT::f32, Expand);
571 setOperationAction(ISD::FTRUNC, MVT::f32, Expand);
Dan Gohmane3376ec2011-12-20 00:02:33 +0000[diff] [blame]572 setOperationAction(ISD::FLOG , MVT::f64, Expand);
573 setOperationAction(ISD::FLOG2, MVT::f64, Expand);
574 setOperationAction(ISD::FLOG10, MVT::f64, Expand);
575 setOperationAction(ISD::FEXP , MVT::f64, Expand);
576 setOperationAction(ISD::FEXP2, MVT::f64, Expand);
577 setOperationAction(ISD::FFLOOR, MVT::f64, Expand);
578 setOperationAction(ISD::FNEARBYINT, MVT::f64, Expand);
579 setOperationAction(ISD::FCEIL, MVT::f64, Expand);
580 setOperationAction(ISD::FRINT, MVT::f64, Expand);
581 setOperationAction(ISD::FTRUNC, MVT::f64, Expand);
Dale Johannesen0bb41602008-09-22 21:57:32 +0000[diff] [blame]582
Chris Lattner41bab0b2008-01-15 21:58:08 +0000[diff] [blame]583 // Default ISD::TRAP to expand (which turns it into abort).
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]584 setOperationAction(ISD::TRAP, MVT::Other, Expand);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]585
Shuxin Yang970755e2012-10-19 20:11:16 +0000[diff] [blame]586 // On most systems, DEBUGTRAP and TRAP have no difference. The "Expand"
587 // here is to inform DAG Legalizer to replace DEBUGTRAP with TRAP.
588 //
589 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Expand);
590
Owen Andersona69571c2006-05-03 01:29:57 +0000[diff] [blame]591 IsLittleEndian = TD->isLittleEndian();
Micah Villmow7d661462012-10-09 16:06:12 +0000[diff] [blame]592 PointerTy = MVT::getIntegerVT(8*TD->getPointerSize(0));
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]593 memset(RegClassForVT, 0,MVT::LAST_VALUETYPE*sizeof(TargetRegisterClass*));
Owen Anderson718cb662007-09-07 04:06:50 +0000[diff] [blame]594 memset(TargetDAGCombineArray, 0, array_lengthof(TargetDAGCombineArray));
Evan Chenga03a5dc2006-02-14 08:38:30 +0000[diff] [blame]595 maxStoresPerMemset = maxStoresPerMemcpy = maxStoresPerMemmove = 8;
Evan Cheng05219282011-01-06 06:52:41 +0000[diff] [blame]596 maxStoresPerMemsetOptSize = maxStoresPerMemcpyOptSize
597 = maxStoresPerMemmoveOptSize = 4;
Evan Cheng6ebf7bc2009-05-13 21:42:09 +0000[diff] [blame]598 benefitFromCodePlacementOpt = false;
Anton Korobeynikovd27a2582006-12-10 23:12:42 +0000[diff] [blame]599 UseUnderscoreSetJmp = false;
600 UseUnderscoreLongJmp = false;
Chris Lattner66180392007-02-25 01:28:05 +0000[diff] [blame]601 SelectIsExpensive = false;
Nate Begeman405e3ec2005-10-21 00:02:42 +0000[diff] [blame]602 IntDivIsCheap = false;
603 Pow2DivIsCheap = false;
Chris Lattnerde189be2010-11-30 18:12:52 +0000[diff] [blame]604 JumpIsExpensive = false;
Benjamin Krameraaf723d2012-05-05 12:49:14 +0000[diff] [blame]605 predictableSelectIsExpensive = false;
Chris Lattneree4a7652006-01-25 18:57:15 +0000[diff] [blame]606 StackPointerRegisterToSaveRestore = 0;
Jim Laskey9bb3c932007-02-22 18:04:49 +0000[diff] [blame]607 ExceptionPointerRegister = 0;
608 ExceptionSelectorRegister = 0;
Duncan Sands03228082008-11-23 15:47:28 +0000[diff] [blame]609 BooleanContents = UndefinedBooleanContent;
Duncan Sands28b77e92011-09-06 19:07:46 +0000[diff] [blame]610 BooleanVectorContents = UndefinedBooleanContent;
Dan Gohman8c2d2702011-10-24 17:45:02 +0000[diff] [blame]611 SchedPreferenceInfo = Sched::ILP;
Chris Lattner7acf5f32006-09-05 17:39:15 +0000[diff] [blame]612 JumpBufSize = 0;
Duraid Madina0c9e0ff2006-09-04 07:44:11 +0000[diff] [blame]613 JumpBufAlignment = 0;
Eli Friedmanfc5d3052011-05-06 20:34:06 +0000[diff] [blame]614 MinFunctionAlignment = 0;
615 PrefFunctionAlignment = 0;
Evan Chengfb8075d2008-02-28 00:43:03 +0000[diff] [blame]616 PrefLoopAlignment = 0;
Rafael Espindolacbeeae22010-07-11 04:01:49 +0000[diff] [blame]617 MinStackArgumentAlignment = 1;
Jim Grosbach9a526492010-06-23 16:07:42 +0000[diff] [blame]618 ShouldFoldAtomicFences = false;
Eli Friedman26689ac2011-08-03 21:06:02 +0000[diff] [blame]619 InsertFencesForAtomic = false;
Evan Cheng769951f2012-07-02 22:39:56 +0000[diff] [blame]620 SupportJumpTables = true;
Sebastian Pop1a37d7e2012-09-25 20:35:36 +0000[diff] [blame]621 MinimumJumpTableEntries = 4;
Evan Cheng56966222007-01-12 02:11:51 +0000[diff] [blame]622
623 InitLibcallNames(LibcallRoutineNames);
Evan Chengd385fd62007-01-31 09:29:11 +0000[diff] [blame]624 InitCmpLibcallCCs(CmpLibcallCCs);
Anton Korobeynikov72977a42009-08-14 20:10:52 +0000[diff] [blame]625 InitLibcallCallingConvs(LibcallCallingConvs);
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]626}
627
Chris Lattnerf0144122009-07-28 03:13:23 +0000[diff] [blame]628TargetLowering::~TargetLowering() {
629 delete &TLOF;
630}
Chris Lattnercba82f92005-01-16 07:28:11 +0000[diff] [blame]631
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]632MVT TargetLowering::getShiftAmountTy(EVT LHSTy) const {
Micah Villmow7d661462012-10-09 16:06:12 +0000[diff] [blame]633 return MVT::getIntegerVT(8*TD->getPointerSize(0));
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]634}
635
Mon P Wangf7ea6c32010-02-10 23:37:45 +0000[diff] [blame]636/// canOpTrap - Returns true if the operation can trap for the value type.
637/// VT must be a legal type.
638bool TargetLowering::canOpTrap(unsigned Op, EVT VT) const {
639 assert(isTypeLegal(VT));
640 switch (Op) {
641 default:
642 return false;
643 case ISD::FDIV:
644 case ISD::FREM:
645 case ISD::SDIV:
646 case ISD::UDIV:
647 case ISD::SREM:
648 case ISD::UREM:
649 return true;
650 }
651}
652
653
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]654static unsigned getVectorTypeBreakdownMVT(MVT VT, MVT &IntermediateVT,
Chris Lattner598751e2010-07-05 05:36:21 +0000[diff] [blame]655 unsigned &NumIntermediates,
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]656 MVT &RegisterVT,
Chris Lattner598751e2010-07-05 05:36:21 +0000[diff] [blame]657 TargetLowering *TLI) {
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]658 // Figure out the right, legal destination reg to copy into.
659 unsigned NumElts = VT.getVectorNumElements();
660 MVT EltTy = VT.getVectorElementType();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]661
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]662 unsigned NumVectorRegs = 1;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]663
664 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]665 // could break down into LHS/RHS like LegalizeDAG does.
666 if (!isPowerOf2_32(NumElts)) {
667 NumVectorRegs = NumElts;
668 NumElts = 1;
669 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]670
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]671 // Divide the input until we get to a supported size. This will always
672 // end with a scalar if the target doesn't support vectors.
673 while (NumElts > 1 && !TLI->isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) {
674 NumElts >>= 1;
675 NumVectorRegs <<= 1;
676 }
677
678 NumIntermediates = NumVectorRegs;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]679
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]680 MVT NewVT = MVT::getVectorVT(EltTy, NumElts);
681 if (!TLI->isTypeLegal(NewVT))
682 NewVT = EltTy;
683 IntermediateVT = NewVT;
684
Nadav Rotem0c3e6782011-06-12 14:56:55 +0000[diff] [blame]685 unsigned NewVTSize = NewVT.getSizeInBits();
686
687 // Convert sizes such as i33 to i64.
688 if (!isPowerOf2_32(NewVTSize))
689 NewVTSize = NextPowerOf2(NewVTSize);
690
Patrik Hagglunddfcf33a2012-12-19 11:48:16 +0000[diff] [blame]691 MVT DestVT = TLI->getRegisterType(NewVT);
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]692 RegisterVT = DestVT;
Chris Lattner32b4b5a2010-07-05 05:53:14 +0000[diff] [blame]693 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16.
Nadav Rotem0c3e6782011-06-12 14:56:55 +0000[diff] [blame]694 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]695
Chris Lattner32b4b5a2010-07-05 05:53:14 +0000[diff] [blame]696 // Otherwise, promotion or legal types use the same number of registers as
697 // the vector decimated to the appropriate level.
698 return NumVectorRegs;
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]699}
700
Evan Cheng46dcb572010-07-19 18:47:01 +0000[diff] [blame]701/// isLegalRC - Return true if the value types that can be represented by the
702/// specified register class are all legal.
703bool TargetLowering::isLegalRC(const TargetRegisterClass *RC) const {
704 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
705 I != E; ++I) {
706 if (isTypeLegal(*I))
707 return true;
708 }
709 return false;
710}
711
Evan Cheng46dcb572010-07-19 18:47:01 +0000[diff] [blame]712/// findRepresentativeClass - Return the largest legal super-reg register class
Evan Cheng4f6b4672010-07-21 06:09:07 +0000[diff] [blame]713/// of the register class for the specified type and its associated "cost".
714std::pair<const TargetRegisterClass*, uint8_t>
Patrik Hagglund03405572012-12-19 11:30:36 +0000[diff] [blame]715TargetLowering::findRepresentativeClass(MVT VT) const {
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]716 const TargetRegisterInfo *TRI = getTargetMachine().getRegisterInfo();
Patrik Hagglund03405572012-12-19 11:30:36 +0000[diff] [blame]717 const TargetRegisterClass *RC = RegClassForVT[VT.SimpleTy];
Evan Cheng4f6b4672010-07-21 06:09:07 +0000[diff] [blame]718 if (!RC)
719 return std::make_pair(RC, 0);
Evan Cheng46dcb572010-07-19 18:47:01 +0000[diff] [blame]720
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]721 // Compute the set of all super-register classes.
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]722 BitVector SuperRegRC(TRI->getNumRegClasses());
Jakob Stoklund Olesen7fc4d9c2012-05-04 22:53:28 +0000[diff] [blame]723 for (SuperRegClassIterator RCI(RC, TRI); RCI.isValid(); ++RCI)
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]724 SuperRegRC.setBitsInMask(RCI.getMask());
725
Jakob Stoklund Olesen7fc4d9c2012-05-04 22:53:28 +0000[diff] [blame]726 // Find the first legal register class with the largest spill size.
727 const TargetRegisterClass *BestRC = RC;
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]728 for (int i = SuperRegRC.find_first(); i >= 0; i = SuperRegRC.find_next(i)) {
729 const TargetRegisterClass *SuperRC = TRI->getRegClass(i);
Jakob Stoklund Olesen7fc4d9c2012-05-04 22:53:28 +0000[diff] [blame]730 // We want the largest possible spill size.
731 if (SuperRC->getSize() <= BestRC->getSize())
732 continue;
733 if (!isLegalRC(SuperRC))
734 continue;
735 BestRC = SuperRC;
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]736 }
Jakob Stoklund Olesen7fc4d9c2012-05-04 22:53:28 +0000[diff] [blame]737 return std::make_pair(BestRC, 1);
Jakob Stoklund Olesene3ee49f2012-05-04 02:19:22 +0000[diff] [blame]738}
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]739
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]740/// computeRegisterProperties - Once all of the register classes are added,
741/// this allows us to compute derived properties we expose.
742void TargetLowering::computeRegisterProperties() {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]743 assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE &&
Chris Lattnerbb97d812005-01-16 01:10:58 +0000[diff] [blame]744 "Too many value types for ValueTypeActions to hold!");
745
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]746 // Everything defaults to needing one register.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]747 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
Dan Gohmanb9f10192007-06-21 14:42:22 +0000[diff] [blame]748 NumRegistersForVT[i] = 1;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]749 RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i;
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]750 }
751 // ...except isVoid, which doesn't need any registers.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]752 NumRegistersForVT[MVT::isVoid] = 0;
Misha Brukmanf976c852005-04-21 22:55:34 +0000[diff] [blame]753
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]754 // Find the largest integer register class.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]755 unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE;
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]756 for (; RegClassForVT[LargestIntReg] == 0; --LargestIntReg)
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]757 assert(LargestIntReg != MVT::i1 && "No integer registers defined!");
Chris Lattner310968c2005-01-07 07:44:53 +0000[diff] [blame]758
759 // Every integer value type larger than this largest register takes twice as
760 // many registers to represent as the previous ValueType.
Patrik Hägglundd5f03182012-11-23 08:35:04 +0000[diff] [blame]761 for (unsigned ExpandedReg = LargestIntReg + 1;
762 ExpandedReg <= MVT::LAST_INTEGER_VALUETYPE; ++ExpandedReg) {
Dan Gohmanb9f10192007-06-21 14:42:22 +0000[diff] [blame]763 NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1];
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]764 RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg;
765 TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1);
Patrik Hägglundd5f03182012-11-23 08:35:04 +0000[diff] [blame]766 ValueTypeActions.setTypeAction((MVT::SimpleValueType)ExpandedReg,
767 TypeExpandInteger);
Evan Cheng1a8f1fe2006-12-09 02:42:38 +0000[diff] [blame]768 }
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]769
770 // Inspect all of the ValueType's smaller than the largest integer
771 // register to see which ones need promotion.
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]772 unsigned LegalIntReg = LargestIntReg;
773 for (unsigned IntReg = LargestIntReg - 1;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]774 IntReg >= (unsigned)MVT::i1; --IntReg) {
Patrik Hagglund009e1e22012-12-13 20:42:43 +0000[diff] [blame]775 MVT IVT = (MVT::SimpleValueType)IntReg;
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]776 if (isTypeLegal(IVT)) {
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]777 LegalIntReg = IntReg;
778 } else {
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]779 RegisterTypeForVT[IntReg] = TransformToType[IntReg] =
Roman Divacky59324292012-09-05 22:26:57 +0000[diff] [blame]780 (const MVT::SimpleValueType)LegalIntReg;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]781 ValueTypeActions.setTypeAction(IVT, TypePromoteInteger);
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]782 }
783 }
784
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]785 // ppcf128 type is really two f64's.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]786 if (!isTypeLegal(MVT::ppcf128)) {
787 NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64];
788 RegisterTypeForVT[MVT::ppcf128] = MVT::f64;
789 TransformToType[MVT::ppcf128] = MVT::f64;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]790 ValueTypeActions.setTypeAction(MVT::ppcf128, TypeExpandFloat);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]791 }
Dale Johannesen161e8972007-10-05 20:04:43 +0000[diff] [blame]792
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]793 // Decide how to handle f64. If the target does not have native f64 support,
794 // expand it to i64 and we will be generating soft float library calls.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]795 if (!isTypeLegal(MVT::f64)) {
796 NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64];
797 RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64];
798 TransformToType[MVT::f64] = MVT::i64;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]799 ValueTypeActions.setTypeAction(MVT::f64, TypeSoftenFloat);
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]800 }
801
802 // Decide how to handle f32. If the target does not have native support for
803 // f32, promote it to f64 if it is legal. Otherwise, expand it to i32.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]804 if (!isTypeLegal(MVT::f32)) {
805 if (isTypeLegal(MVT::f64)) {
806 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::f64];
807 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::f64];
808 TransformToType[MVT::f32] = MVT::f64;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]809 ValueTypeActions.setTypeAction(MVT::f32, TypePromoteInteger);
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]810 } else {
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]811 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32];
812 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32];
813 TransformToType[MVT::f32] = MVT::i32;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]814 ValueTypeActions.setTypeAction(MVT::f32, TypeSoftenFloat);
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]815 }
Evan Cheng1a8f1fe2006-12-09 02:42:38 +0000[diff] [blame]816 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]817
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]818 // Loop over all of the vector value types to see which need transformations.
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]819 for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE;
820 i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) {
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]821 MVT VT = (MVT::SimpleValueType)i;
Chris Lattner598751e2010-07-05 05:36:21 +0000[diff] [blame]822 if (isTypeLegal(VT)) continue;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]823
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]824 // Determine if there is a legal wider type. If so, we should promote to
825 // that wider vector type.
Patrik Hagglundff012772012-12-19 11:42:00 +0000[diff] [blame]826 MVT EltVT = VT.getVectorElementType();
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]827 unsigned NElts = VT.getVectorNumElements();
Justin Holewinski3d200252012-11-29 14:26:24 +0000[diff] [blame]828 if (NElts != 1 && !shouldSplitVectorElementType(EltVT)) {
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]829 bool IsLegalWiderType = false;
Nadav Rotemf1c025d2011-06-04 20:32:01 +0000[diff] [blame]830 // First try to promote the elements of integer vectors. If no legal
831 // promotion was found, fallback to the widen-vector method.
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]832 for (unsigned nVT = i+1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) {
Patrik Hagglundff012772012-12-19 11:42:00 +0000[diff] [blame]833 MVT SVT = (MVT::SimpleValueType)nVT;
Nadav Rotemf1c025d2011-06-04 20:32:01 +0000[diff] [blame]834 // Promote vectors of integers to vectors with the same number
835 // of elements, with a wider element type.
836 if (SVT.getVectorElementType().getSizeInBits() > EltVT.getSizeInBits()
837 && SVT.getVectorNumElements() == NElts &&
838 isTypeLegal(SVT) && SVT.getScalarType().isInteger()) {
839 TransformToType[i] = SVT;
840 RegisterTypeForVT[i] = SVT;
841 NumRegistersForVT[i] = 1;
842 ValueTypeActions.setTypeAction(VT, TypePromoteInteger);
843 IsLegalWiderType = true;
844 break;
Nadav Rotemb6fbec32011-06-01 12:51:46 +0000[diff] [blame]845 }
Nadav Rotemf1c025d2011-06-04 20:32:01 +0000[diff] [blame]846 }
Nadav Rotemb6fbec32011-06-01 12:51:46 +0000[diff] [blame]847
Nadav Rotemf1c025d2011-06-04 20:32:01 +0000[diff] [blame]848 if (IsLegalWiderType) continue;
849
850 // Try to widen the vector.
851 for (unsigned nVT = i+1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) {
Patrik Hagglundff012772012-12-19 11:42:00 +0000[diff] [blame]852 MVT SVT = (MVT::SimpleValueType)nVT;
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]853 if (SVT.getVectorElementType() == EltVT &&
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]854 SVT.getVectorNumElements() > NElts &&
Dale Johannesene93d99c2010-10-20 21:32:10 +0000[diff] [blame]855 isTypeLegal(SVT)) {
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]856 TransformToType[i] = SVT;
857 RegisterTypeForVT[i] = SVT;
858 NumRegistersForVT[i] = 1;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]859 ValueTypeActions.setTypeAction(VT, TypeWidenVector);
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]860 IsLegalWiderType = true;
861 break;
862 }
863 }
864 if (IsLegalWiderType) continue;
865 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]866
Chris Lattner598751e2010-07-05 05:36:21 +0000[diff] [blame]867 MVT IntermediateVT;
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]868 MVT RegisterVT;
Chris Lattner598751e2010-07-05 05:36:21 +0000[diff] [blame]869 unsigned NumIntermediates;
870 NumRegistersForVT[i] =
871 getVectorTypeBreakdownMVT(VT, IntermediateVT, NumIntermediates,
872 RegisterVT, this);
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]873 RegisterTypeForVT[i] = RegisterVT;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]874
Patrik Hagglundff012772012-12-19 11:42:00 +0000[diff] [blame]875 MVT NVT = VT.getPow2VectorType();
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]876 if (NVT == VT) {
877 // Type is already a power of 2. The default action is to split.
878 TransformToType[i] = MVT::Other;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]879 unsigned NumElts = VT.getVectorNumElements();
880 ValueTypeActions.setTypeAction(VT,
881 NumElts > 1 ? TypeSplitVector : TypeScalarizeVector);
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]882 } else {
883 TransformToType[i] = NVT;
Nadav Rotemb6aacae2011-05-28 17:57:14 +0000[diff] [blame]884 ValueTypeActions.setTypeAction(VT, TypeWidenVector);
Dan Gohman7f321562007-06-25 16:23:39 +0000[diff] [blame]885 }
Chris Lattner3a5935842006-03-16 19:50:01 +0000[diff] [blame]886 }
Evan Cheng46dcb572010-07-19 18:47:01 +0000[diff] [blame]887
888 // Determine the 'representative' register class for each value type.
889 // An representative register class is the largest (meaning one which is
890 // not a sub-register class / subreg register class) legal register class for
891 // a group of value types. For example, on i386, i8, i16, and i32
892 // representative would be GR32; while on x86_64 it's GR64.
Evan Chengd70f57b2010-07-19 22:15:08 +0000[diff] [blame]893 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
Evan Cheng4f6b4672010-07-21 06:09:07 +0000[diff] [blame]894 const TargetRegisterClass* RRC;
895 uint8_t Cost;
896 tie(RRC, Cost) = findRepresentativeClass((MVT::SimpleValueType)i);
897 RepRegClassForVT[i] = RRC;
898 RepRegClassCostForVT[i] = Cost;
Evan Chengd70f57b2010-07-19 22:15:08 +0000[diff] [blame]899 }
Chris Lattnerbb97d812005-01-16 01:10:58 +0000[diff] [blame]900}
Chris Lattnercba82f92005-01-16 07:28:11 +0000[diff] [blame]901
Evan Cheng72261582005-12-20 06:22:03 +0000[diff] [blame]902const char *TargetLowering::getTargetNodeName(unsigned Opcode) const {
903 return NULL;
904}
Evan Cheng3a03ebb2005-12-21 23:05:39 +0000[diff] [blame]905
Duncan Sands28b77e92011-09-06 19:07:46 +0000[diff] [blame]906EVT TargetLowering::getSetCCResultType(EVT VT) const {
907 assert(!VT.isVector() && "No default SetCC type for vectors!");
Micah Villmow7d661462012-10-09 16:06:12 +0000[diff] [blame]908 return getPointerTy(0).SimpleTy;
Scott Michel5b8f82e2008-03-10 15:42:14 +0000[diff] [blame]909}
910
Sanjiv Gupta8f17a362009-12-28 02:40:33 +0000[diff] [blame]911MVT::SimpleValueType TargetLowering::getCmpLibcallReturnType() const {
912 return MVT::i32; // return the default value
913}
914
Dan Gohman7f321562007-06-25 16:23:39 +0000[diff] [blame]915/// getVectorTypeBreakdown - Vector types are broken down into some number of
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]916/// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32
917/// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
918/// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86.
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]919///
Dan Gohman7f321562007-06-25 16:23:39 +0000[diff] [blame]920/// This method returns the number of registers needed, and the VT for each
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]921/// register. It also returns the VT and quantity of the intermediate values
922/// before they are promoted/expanded.
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]923///
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]924unsigned TargetLowering::getVectorTypeBreakdown(LLVMContext &Context, EVT VT,
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]925 EVT &IntermediateVT,
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]926 unsigned &NumIntermediates,
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]927 MVT &RegisterVT) const {
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]928 unsigned NumElts = VT.getVectorNumElements();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]929
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]930 // If there is a wider vector type with the same element type as this one,
Nadav Rotemdb346162012-04-21 20:08:32 +0000[diff] [blame]931 // or a promoted vector type that has the same number of elements which
932 // are wider, then we should convert to that legal vector type.
933 // This handles things like <2 x float> -> <4 x float> and
934 // <4 x i1> -> <4 x i32>.
935 LegalizeTypeAction TA = getTypeAction(Context, VT);
936 if (NumElts != 1 && (TA == TypeWidenVector || TA == TypePromoteInteger)) {
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]937 EVT RegisterEVT = getTypeToTransformTo(Context, VT);
938 if (isTypeLegal(RegisterEVT)) {
939 IntermediateVT = RegisterEVT;
940 RegisterVT = RegisterEVT.getSimpleVT();
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]941 NumIntermediates = 1;
942 return 1;
943 }
944 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]945
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]946 // Figure out the right, legal destination reg to copy into.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]947 EVT EltTy = VT.getVectorElementType();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]948
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]949 unsigned NumVectorRegs = 1;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]950
951 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
Nate Begemand73ab882007-11-27 19:28:48 +0000[diff] [blame]952 // could break down into LHS/RHS like LegalizeDAG does.
953 if (!isPowerOf2_32(NumElts)) {
954 NumVectorRegs = NumElts;
955 NumElts = 1;
956 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]957
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]958 // Divide the input until we get to a supported size. This will always
959 // end with a scalar if the target doesn't support vectors.
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]960 while (NumElts > 1 && !isTypeLegal(
961 EVT::getVectorVT(Context, EltTy, NumElts))) {
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]962 NumElts >>= 1;
963 NumVectorRegs <<= 1;
964 }
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]965
966 NumIntermediates = NumVectorRegs;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]967
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]968 EVT NewVT = EVT::getVectorVT(Context, EltTy, NumElts);
Dan Gohman7f321562007-06-25 16:23:39 +0000[diff] [blame]969 if (!isTypeLegal(NewVT))
970 NewVT = EltTy;
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]971 IntermediateVT = NewVT;
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]972
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]973 MVT DestVT = getRegisterType(Context, NewVT);
Dan Gohmanb6f5b002007-06-28 23:29:44 +0000[diff] [blame]974 RegisterVT = DestVT;
Nadav Rotem0c3e6782011-06-12 14:56:55 +0000[diff] [blame]975 unsigned NewVTSize = NewVT.getSizeInBits();
976
977 // Convert sizes such as i33 to i64.
978 if (!isPowerOf2_32(NewVTSize))
979 NewVTSize = NextPowerOf2(NewVTSize);
980
Patrik Hagglundee211d22012-12-19 11:53:21 +0000[diff] [blame]981 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16.
Nadav Rotem0c3e6782011-06-12 14:56:55 +0000[diff] [blame]982 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]983
Chris Lattnere6f7c262010-08-25 22:49:25 +0000[diff] [blame]984 // Otherwise, promotion or legal types use the same number of registers as
985 // the vector decimated to the appropriate level.
986 return NumVectorRegs;
Chris Lattnerdc879292006-03-31 00:28:56 +0000[diff] [blame]987}
988
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]989/// Get the EVTs and ArgFlags collections that represent the legalized return
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]990/// type of the given function. This does not require a DAG or a return value,
991/// and is suitable for use before any DAGs for the function are constructed.
992/// TODO: Move this out of TargetLowering.cpp.
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]993void llvm::GetReturnInfo(Type* ReturnType, AttributeSet attr,
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]994 SmallVectorImpl<ISD::OutputArg> &Outs,
Eli Friedman2db0e9e2012-05-25 00:09:29 +0000[diff] [blame]995 const TargetLowering &TLI) {
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]996 SmallVector<EVT, 4> ValueVTs;
997 ComputeValueVTs(TLI, ReturnType, ValueVTs);
998 unsigned NumValues = ValueVTs.size();
999 if (NumValues == 0) return;
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1000
1001 for (unsigned j = 0, f = NumValues; j != f; ++j) {
1002 EVT VT = ValueVTs[j];
1003 ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
1004
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]1005 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt))
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1006 ExtendKind = ISD::SIGN_EXTEND;
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]1007 else if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt))
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1008 ExtendKind = ISD::ZERO_EXTEND;
1009
1010 // FIXME: C calling convention requires the return type to be promoted to
1011 // at least 32-bit. But this is not necessary for non-C calling
1012 // conventions. The frontend should mark functions whose return values
1013 // require promoting with signext or zeroext attributes.
1014 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) {
Patrik Hagglunddfcf33a2012-12-19 11:48:16 +0000[diff] [blame]1015 MVT MinVT = TLI.getRegisterType(ReturnType->getContext(), MVT::i32);
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1016 if (VT.bitsLT(MinVT))
1017 VT = MinVT;
1018 }
1019
1020 unsigned NumParts = TLI.getNumRegisters(ReturnType->getContext(), VT);
Patrik Hagglunddfcf33a2012-12-19 11:48:16 +0000[diff] [blame]1021 MVT PartVT = TLI.getRegisterType(ReturnType->getContext(), VT);
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1022
1023 // 'inreg' on function refers to return value
1024 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]1025 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::InReg))
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1026 Flags.setInReg();
1027
1028 // Propagate extension type if any
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]1029 if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::SExt))
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1030 Flags.setSExt();
Bill Wendling8b62abd2012-12-30 13:01:51 +0000[diff] [blame]1031 else if (attr.hasAttribute(AttributeSet::ReturnIndex, Attribute::ZExt))
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1032 Flags.setZExt();
1033
Bill Wendlinge853d2e2012-09-19 23:35:21 +0000[diff] [blame]1034 for (unsigned i = 0; i < NumParts; ++i)
Manman Ren0a1544d2012-11-01 23:49:58 +0000[diff] [blame]1035 Outs.push_back(ISD::OutputArg(Flags, PartVT, /*isFixed=*/true, 0, 0));
Dan Gohman84023e02010-07-10 09:00:22 +0000[diff] [blame]1036 }
1037}
1038
Evan Cheng3ae05432008-01-24 00:22:01 +0000[diff] [blame]1039/// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
Dale Johannesen28d08fd2008-02-28 22:31:51 +0000[diff] [blame]1040/// function arguments in the caller parameter area. This is the actual
1041/// alignment, not its logarithm.
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]1042unsigned TargetLowering::getByValTypeAlignment(Type *Ty) const {
Dale Johannesen28d08fd2008-02-28 22:31:51 +0000[diff] [blame]1043 return TD->getCallFrameTypeAlignment(Ty);
Evan Cheng3ae05432008-01-24 00:22:01 +0000[diff] [blame]1044}
1045
Chris Lattner071c62f2010-01-25 23:26:13 +0000[diff] [blame]1046/// getJumpTableEncoding - Return the entry encoding for a jump table in the
1047/// current function. The returned value is a member of the
1048/// MachineJumpTableInfo::JTEntryKind enum.
1049unsigned TargetLowering::getJumpTableEncoding() const {
1050 // In non-pic modes, just use the address of a block.
1051 if (getTargetMachine().getRelocationModel() != Reloc::PIC_)
1052 return MachineJumpTableInfo::EK_BlockAddress;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1053
Chris Lattner071c62f2010-01-25 23:26:13 +0000[diff] [blame]1054 // In PIC mode, if the target supports a GPRel32 directive, use it.
1055 if (getTargetMachine().getMCAsmInfo()->getGPRel32Directive() != 0)
1056 return MachineJumpTableInfo::EK_GPRel32BlockAddress;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1057
Chris Lattner071c62f2010-01-25 23:26:13 +0000[diff] [blame]1058 // Otherwise, use a label difference.
1059 return MachineJumpTableInfo::EK_LabelDifference32;
1060}
1061
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1062SDValue TargetLowering::getPICJumpTableRelocBase(SDValue Table,
1063 SelectionDAG &DAG) const {
Chris Lattnerf1214cb2010-01-26 06:53:37 +0000[diff] [blame]1064 // If our PIC model is GP relative, use the global offset table as the base.
Akira Hatanaka787c3fd2012-04-09 20:32:12 +0000[diff] [blame]1065 unsigned JTEncoding = getJumpTableEncoding();
1066
1067 if ((JTEncoding == MachineJumpTableInfo::EK_GPRel64BlockAddress) ||
1068 (JTEncoding == MachineJumpTableInfo::EK_GPRel32BlockAddress))
Micah Villmow7d661462012-10-09 16:06:12 +0000[diff] [blame]1069 return DAG.getGLOBAL_OFFSET_TABLE(getPointerTy(0));
Akira Hatanaka787c3fd2012-04-09 20:32:12 +0000[diff] [blame]1070
Evan Chengcc415862007-11-09 01:32:10 +0000[diff] [blame]1071 return Table;
1072}
1073
Chris Lattner13e97a22010-01-26 05:30:30 +0000[diff] [blame]1074/// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
1075/// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
1076/// MCExpr.
1077const MCExpr *
Chris Lattner589c6f62010-01-26 06:28:43 +0000[diff] [blame]1078TargetLowering::getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
1079 unsigned JTI,MCContext &Ctx) const{
Chris Lattnerbeeb93e2010-01-26 05:58:28 +0000[diff] [blame]1080 // The normal PIC reloc base is the label at the start of the jump table.
Chris Lattner589c6f62010-01-26 06:28:43 +0000[diff] [blame]1081 return MCSymbolRefExpr::Create(MF->getJTISymbol(JTI, Ctx), Ctx);
Chris Lattner13e97a22010-01-26 05:30:30 +0000[diff] [blame]1082}
1083
Dan Gohman6520e202008-10-18 02:06:02 +0000[diff] [blame]1084bool
1085TargetLowering::isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const {
1086 // Assume that everything is safe in static mode.
1087 if (getTargetMachine().getRelocationModel() == Reloc::Static)
1088 return true;
1089
1090 // In dynamic-no-pic mode, assume that known defined values are safe.
1091 if (getTargetMachine().getRelocationModel() == Reloc::DynamicNoPIC &&
1092 GA &&
1093 !GA->getGlobal()->isDeclaration() &&
Duncan Sands667d4b82009-03-07 15:45:40 +0000[diff] [blame]1094 !GA->getGlobal()->isWeakForLinker())
Dan Gohman6520e202008-10-18 02:06:02 +0000[diff] [blame]1095 return true;
1096
1097 // Otherwise assume nothing is safe.
1098 return false;
1099}
1100
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]1101//===----------------------------------------------------------------------===//
Chandler Carruthaeef83c2013-01-07 01:37:14 +0000[diff] [blame]1102// TargetTransformInfo Helpers
1103//===----------------------------------------------------------------------===//
1104
1105int TargetLowering::InstructionOpcodeToISD(unsigned Opcode) const {
1106 enum InstructionOpcodes {
1107#define HANDLE_INST(NUM, OPCODE, CLASS) OPCODE = NUM,
1108#define LAST_OTHER_INST(NUM) InstructionOpcodesCount = NUM
1109#include "llvm/IR/Instruction.def"
1110 };
1111 switch (static_cast<InstructionOpcodes>(Opcode)) {
1112 case Ret: return 0;
1113 case Br: return 0;
1114 case Switch: return 0;
1115 case IndirectBr: return 0;
1116 case Invoke: return 0;
1117 case Resume: return 0;
1118 case Unreachable: return 0;
1119 case Add: return ISD::ADD;
1120 case FAdd: return ISD::FADD;
1121 case Sub: return ISD::SUB;
1122 case FSub: return ISD::FSUB;
1123 case Mul: return ISD::MUL;
1124 case FMul: return ISD::FMUL;
1125 case UDiv: return ISD::UDIV;
1126 case SDiv: return ISD::UDIV;
1127 case FDiv: return ISD::FDIV;
1128 case URem: return ISD::UREM;
1129 case SRem: return ISD::SREM;
1130 case FRem: return ISD::FREM;
1131 case Shl: return ISD::SHL;
1132 case LShr: return ISD::SRL;
1133 case AShr: return ISD::SRA;
1134 case And: return ISD::AND;
1135 case Or: return ISD::OR;
1136 case Xor: return ISD::XOR;
1137 case Alloca: return 0;
1138 case Load: return ISD::LOAD;
1139 case Store: return ISD::STORE;
1140 case GetElementPtr: return 0;
1141 case Fence: return 0;
1142 case AtomicCmpXchg: return 0;
1143 case AtomicRMW: return 0;
1144 case Trunc: return ISD::TRUNCATE;
1145 case ZExt: return ISD::ZERO_EXTEND;
1146 case SExt: return ISD::SIGN_EXTEND;
1147 case FPToUI: return ISD::FP_TO_UINT;
1148 case FPToSI: return ISD::FP_TO_SINT;
1149 case UIToFP: return ISD::UINT_TO_FP;
1150 case SIToFP: return ISD::SINT_TO_FP;
1151 case FPTrunc: return ISD::FP_ROUND;
1152 case FPExt: return ISD::FP_EXTEND;
1153 case PtrToInt: return ISD::BITCAST;
1154 case IntToPtr: return ISD::BITCAST;
1155 case BitCast: return ISD::BITCAST;
1156 case ICmp: return ISD::SETCC;
1157 case FCmp: return ISD::SETCC;
1158 case PHI: return 0;
1159 case Call: return 0;
1160 case Select: return ISD::SELECT;
1161 case UserOp1: return 0;
1162 case UserOp2: return 0;
1163 case VAArg: return 0;
1164 case ExtractElement: return ISD::EXTRACT_VECTOR_ELT;
1165 case InsertElement: return ISD::INSERT_VECTOR_ELT;
1166 case ShuffleVector: return ISD::VECTOR_SHUFFLE;
1167 case ExtractValue: return ISD::MERGE_VALUES;
1168 case InsertValue: return ISD::MERGE_VALUES;
1169 case LandingPad: return 0;
1170 }
1171
1172 llvm_unreachable("Unknown instruction type encountered!");
1173}
1174
1175std::pair<unsigned, MVT>
1176TargetLowering::getTypeLegalizationCost(Type *Ty) const {
1177 LLVMContext &C = Ty->getContext();
1178 EVT MTy = getValueType(Ty);
1179
1180 unsigned Cost = 1;
1181 // We keep legalizing the type until we find a legal kind. We assume that
1182 // the only operation that costs anything is the split. After splitting
1183 // we need to handle two types.
1184 while (true) {
1185 LegalizeKind LK = getTypeConversion(C, MTy);
1186
1187 if (LK.first == TypeLegal)
1188 return std::make_pair(Cost, MTy.getSimpleVT());
1189
1190 if (LK.first == TypeSplitVector || LK.first == TypeExpandInteger)
1191 Cost *= 2;
1192
1193 // Keep legalizing the type.
1194 MTy = LK.second;
1195 }
1196}
1197
1198//===----------------------------------------------------------------------===//
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]1199// Optimization Methods
1200//===----------------------------------------------------------------------===//
1201
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1202/// ShrinkDemandedConstant - Check to see if the specified operand of the
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1203/// specified instruction is a constant integer. If so, check to see if there
1204/// are any bits set in the constant that are not demanded. If so, shrink the
1205/// constant and return true.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1206bool TargetLowering::TargetLoweringOpt::ShrinkDemandedConstant(SDValue Op,
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1207 const APInt &Demanded) {
Dale Johannesende064702009-02-06 21:50:26 +0000[diff] [blame]1208 DebugLoc dl = Op.getDebugLoc();
Bill Wendling36ae6c12009-03-04 00:18:06 +0000[diff] [blame]1209
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1210 // FIXME: ISD::SELECT, ISD::SELECT_CC
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]1211 switch (Op.getOpcode()) {
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1212 default: break;
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1213 case ISD::XOR:
Bill Wendling36ae6c12009-03-04 00:18:06 +0000[diff] [blame]1214 case ISD::AND:
1215 case ISD::OR: {
1216 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
1217 if (!C) return false;
1218
1219 if (Op.getOpcode() == ISD::XOR &&
1220 (C->getAPIntValue() | (~Demanded)).isAllOnesValue())
1221 return false;
1222
1223 // if we can expand it to have all bits set, do it
1224 if (C->getAPIntValue().intersects(~Demanded)) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1225 EVT VT = Op.getValueType();
Bill Wendling36ae6c12009-03-04 00:18:06 +0000[diff] [blame]1226 SDValue New = DAG.getNode(Op.getOpcode(), dl, VT, Op.getOperand(0),
1227 DAG.getConstant(Demanded &
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1228 C->getAPIntValue(),
Bill Wendling36ae6c12009-03-04 00:18:06 +0000[diff] [blame]1229 VT));
1230 return CombineTo(Op, New);
1231 }
1232
Nate Begemande996292006-02-03 22:24:05 +0000[diff] [blame]1233 break;
1234 }
Bill Wendling36ae6c12009-03-04 00:18:06 +0000[diff] [blame]1235 }
1236
Nate Begemande996292006-02-03 22:24:05 +0000[diff] [blame]1237 return false;
1238}
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1239
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1240/// ShrinkDemandedOp - Convert x+y to (VT)((SmallVT)x+(SmallVT)y) if the
1241/// casts are free. This uses isZExtFree and ZERO_EXTEND for the widening
1242/// cast, but it could be generalized for targets with other types of
1243/// implicit widening casts.
1244bool
1245TargetLowering::TargetLoweringOpt::ShrinkDemandedOp(SDValue Op,
1246 unsigned BitWidth,
1247 const APInt &Demanded,
1248 DebugLoc dl) {
1249 assert(Op.getNumOperands() == 2 &&
1250 "ShrinkDemandedOp only supports binary operators!");
1251 assert(Op.getNode()->getNumValues() == 1 &&
1252 "ShrinkDemandedOp only supports nodes with one result!");
1253
1254 // Don't do this if the node has another user, which may require the
1255 // full value.
1256 if (!Op.getNode()->hasOneUse())
1257 return false;
1258
1259 // Search for the smallest integer type with free casts to and from
1260 // Op's type. For expedience, just check power-of-2 integer types.
1261 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
Nadav Rotembf5a2c62012-12-19 07:39:08 +0000[diff] [blame]1262 unsigned DemandedSize = BitWidth - Demanded.countLeadingZeros();
1263 unsigned SmallVTBits = DemandedSize;
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1264 if (!isPowerOf2_32(SmallVTBits))
1265 SmallVTBits = NextPowerOf2(SmallVTBits);
1266 for (; SmallVTBits < BitWidth; SmallVTBits = NextPowerOf2(SmallVTBits)) {
Owen Anderson23b9b192009-08-12 00:36:31 +0000[diff] [blame]1267 EVT SmallVT = EVT::getIntegerVT(*DAG.getContext(), SmallVTBits);
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1268 if (TLI.isTruncateFree(Op.getValueType(), SmallVT) &&
1269 TLI.isZExtFree(SmallVT, Op.getValueType())) {
1270 // We found a type with free casts.
1271 SDValue X = DAG.getNode(Op.getOpcode(), dl, SmallVT,
1272 DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
1273 Op.getNode()->getOperand(0)),
1274 DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
1275 Op.getNode()->getOperand(1)));
Nadav Rotembf5a2c62012-12-19 07:39:08 +0000[diff] [blame]1276 bool NeedZext = DemandedSize > SmallVTBits;
1277 SDValue Z = DAG.getNode(NeedZext ? ISD::ZERO_EXTEND : ISD::ANY_EXTEND,
1278 dl, Op.getValueType(), X);
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1279 return CombineTo(Op, Z);
1280 }
1281 }
1282 return false;
1283}
1284
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1285/// SimplifyDemandedBits - Look at Op. At this point, we know that only the
Chad Rosier8c1ec5a2011-06-11 02:27:46 +0000[diff] [blame]1286/// DemandedMask bits of the result of Op are ever used downstream. If we can
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1287/// use this information to simplify Op, create a new simplified DAG node and
1288/// return true, returning the original and new nodes in Old and New. Otherwise,
1289/// analyze the expression and return a mask of KnownOne and KnownZero bits for
1290/// the expression (used to simplify the caller). The KnownZero/One bits may
1291/// only be accurate for those bits in the DemandedMask.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1292bool TargetLowering::SimplifyDemandedBits(SDValue Op,
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1293 const APInt &DemandedMask,
1294 APInt &KnownZero,
1295 APInt &KnownOne,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1296 TargetLoweringOpt &TLO,
1297 unsigned Depth) const {
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1298 unsigned BitWidth = DemandedMask.getBitWidth();
Dan Gohman87862e72009-12-11 21:31:27 +0000[diff] [blame]1299 assert(Op.getValueType().getScalarType().getSizeInBits() == BitWidth &&
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1300 "Mask size mismatches value type size!");
1301 APInt NewMask = DemandedMask;
Dale Johannesen6f38cb62009-02-07 19:59:05 +0000[diff] [blame]1302 DebugLoc dl = Op.getDebugLoc();
Chris Lattner3fc5b012007-05-17 18:19:23 +0000[diff] [blame]1303
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1304 // Don't know anything.
1305 KnownZero = KnownOne = APInt(BitWidth, 0);
1306
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1307 // Other users may use these bits.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1308 if (!Op.getNode()->hasOneUse()) {
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1309 if (Depth != 0) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1310 // If not at the root, Just compute the KnownZero/KnownOne bits to
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1311 // simplify things downstream.
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1312 TLO.DAG.ComputeMaskedBits(Op, KnownZero, KnownOne, Depth);
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1313 return false;
1314 }
1315 // If this is the root being simplified, allow it to have multiple uses,
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1316 // just set the NewMask to all bits.
1317 NewMask = APInt::getAllOnesValue(BitWidth);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1318 } else if (DemandedMask == 0) {
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1319 // Not demanding any bits from Op.
1320 if (Op.getOpcode() != ISD::UNDEF)
Dale Johannesene8d72302009-02-06 23:05:02 +0000[diff] [blame]1321 return TLO.CombineTo(Op, TLO.DAG.getUNDEF(Op.getValueType()));
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1322 return false;
1323 } else if (Depth == 6) { // Limit search depth.
1324 return false;
1325 }
1326
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1327 APInt KnownZero2, KnownOne2, KnownZeroOut, KnownOneOut;
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1328 switch (Op.getOpcode()) {
1329 case ISD::Constant:
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1330 // We know all of the bits for a constant!
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1331 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue();
1332 KnownZero = ~KnownOne;
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1333 return false; // Don't fall through, will infinitely loop.
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1334 case ISD::AND:
Chris Lattner81cd3552006-02-27 00:36:27 +0000[diff] [blame]1335 // If the RHS is a constant, check to see if the LHS would be zero without
1336 // using the bits from the RHS. Below, we use knowledge about the RHS to
1337 // simplify the LHS, here we're using information from the LHS to simplify
1338 // the RHS.
1339 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1340 APInt LHSZero, LHSOne;
Dale Johannesen97fd9a52011-01-10 21:53:07 +0000[diff] [blame]1341 // Do not increment Depth here; that can cause an infinite loop.
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1342 TLO.DAG.ComputeMaskedBits(Op.getOperand(0), LHSZero, LHSOne, Depth);
Chris Lattner81cd3552006-02-27 00:36:27 +0000[diff] [blame]1343 // If the LHS already has zeros where RHSC does, this and is dead.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1344 if ((LHSZero & NewMask) == (~RHSC->getAPIntValue() & NewMask))
Chris Lattner81cd3552006-02-27 00:36:27 +0000[diff] [blame]1345 return TLO.CombineTo(Op, Op.getOperand(0));
1346 // If any of the set bits in the RHS are known zero on the LHS, shrink
1347 // the constant.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1348 if (TLO.ShrinkDemandedConstant(Op, ~LHSZero & NewMask))
Chris Lattner81cd3552006-02-27 00:36:27 +0000[diff] [blame]1349 return true;
1350 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1351
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1352 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1353 KnownOne, TLO, Depth+1))
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1354 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1355 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1356 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownZero & NewMask,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1357 KnownZero2, KnownOne2, TLO, Depth+1))
1358 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1359 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1360
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1361 // If all of the demanded bits are known one on one side, return the other.
1362 // These bits cannot contribute to the result of the 'and'.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1363 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1364 return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1365 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1366 return TLO.CombineTo(Op, Op.getOperand(1));
1367 // If all of the demanded bits in the inputs are known zeros, return zero.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1368 if ((NewMask & (KnownZero|KnownZero2)) == NewMask)
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1369 return TLO.CombineTo(Op, TLO.DAG.getConstant(0, Op.getValueType()));
1370 // If the RHS is a constant, see if we can simplify it.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1371 if (TLO.ShrinkDemandedConstant(Op, ~KnownZero2 & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1372 return true;
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1373 // If the operation can be done in a smaller type, do so.
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000[diff] [blame]1374 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1375 return true;
1376
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1377 // Output known-1 bits are only known if set in both the LHS & RHS.
1378 KnownOne &= KnownOne2;
1379 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1380 KnownZero |= KnownZero2;
1381 break;
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1382 case ISD::OR:
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1383 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1384 KnownOne, TLO, Depth+1))
1385 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1386 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1387 if (SimplifyDemandedBits(Op.getOperand(0), ~KnownOne & NewMask,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1388 KnownZero2, KnownOne2, TLO, Depth+1))
1389 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1390 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1391
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1392 // If all of the demanded bits are known zero on one side, return the other.
1393 // These bits cannot contribute to the result of the 'or'.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1394 if ((NewMask & ~KnownOne2 & KnownZero) == (~KnownOne2 & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1395 return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1396 if ((NewMask & ~KnownOne & KnownZero2) == (~KnownOne & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1397 return TLO.CombineTo(Op, Op.getOperand(1));
1398 // If all of the potentially set bits on one side are known to be set on
1399 // the other side, just use the 'other' side.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1400 if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1401 return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1402 if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1403 return TLO.CombineTo(Op, Op.getOperand(1));
1404 // If the RHS is a constant, see if we can simplify it.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1405 if (TLO.ShrinkDemandedConstant(Op, NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1406 return true;
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1407 // If the operation can be done in a smaller type, do so.
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000[diff] [blame]1408 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1409 return true;
1410
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1411 // Output known-0 bits are only known if clear in both the LHS & RHS.
1412 KnownZero &= KnownZero2;
1413 // Output known-1 are known to be set if set in either the LHS | RHS.
1414 KnownOne |= KnownOne2;
1415 break;
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1416 case ISD::XOR:
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1417 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1418 KnownOne, TLO, Depth+1))
1419 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1420 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1421 if (SimplifyDemandedBits(Op.getOperand(0), NewMask, KnownZero2,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1422 KnownOne2, TLO, Depth+1))
1423 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1424 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1425
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1426 // If all of the demanded bits are known zero on one side, return the other.
1427 // These bits cannot contribute to the result of the 'xor'.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1428 if ((KnownZero & NewMask) == NewMask)
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1429 return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1430 if ((KnownZero2 & NewMask) == NewMask)
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1431 return TLO.CombineTo(Op, Op.getOperand(1));
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1432 // If the operation can be done in a smaller type, do so.
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000[diff] [blame]1433 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1434 return true;
1435
Chris Lattner3687c1a2006-11-27 21:50:02 +0000[diff] [blame]1436 // If all of the unknown bits are known to be zero on one side or the other
1437 // (but not both) turn this into an *inclusive* or.
Sylvestre Ledru94c22712012-09-27 10:14:43 +0000[diff] [blame]1438 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1439 if ((NewMask & ~KnownZero & ~KnownZero2) == 0)
Dale Johannesende064702009-02-06 21:50:26 +0000[diff] [blame]1440 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::OR, dl, Op.getValueType(),
Chris Lattner3687c1a2006-11-27 21:50:02 +0000[diff] [blame]1441 Op.getOperand(0),
1442 Op.getOperand(1)));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1443
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1444 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1445 KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1446 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1447 KnownOneOut = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1448
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1449 // If all of the demanded bits on one side are known, and all of the set
1450 // bits on that side are also known to be set on the other side, turn this
1451 // into an AND, as we know the bits will be cleared.
Sylvestre Ledru94c22712012-09-27 10:14:43 +0000[diff] [blame]1452 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
Joel Jonesd16ce172012-04-17 22:23:10 +0000[diff] [blame]1453 // NB: it is okay if more bits are known than are requested
1454 if ((NewMask & (KnownZero|KnownOne)) == NewMask) { // all known on one side
1455 if (KnownOne == KnownOne2) { // set bits are the same on both sides
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1456 EVT VT = Op.getValueType();
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1457 SDValue ANDC = TLO.DAG.getConstant(~KnownOne & NewMask, VT);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1458 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::AND, dl, VT,
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1459 Op.getOperand(0), ANDC));
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1460 }
1461 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1462
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1463 // If the RHS is a constant, see if we can simplify it.
Torok Edwin4fea2e92008-04-06 21:23:02 +0000[diff] [blame]1464 // for XOR, we prefer to force bits to 1 if they will make a -1.
1465 // if we can't force bits, try to shrink constant
1466 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1467 APInt Expanded = C->getAPIntValue() | (~NewMask);
1468 // if we can expand it to have all bits set, do it
1469 if (Expanded.isAllOnesValue()) {
1470 if (Expanded != C->getAPIntValue()) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1471 EVT VT = Op.getValueType();
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1472 SDValue New = TLO.DAG.getNode(Op.getOpcode(), dl,VT, Op.getOperand(0),
Torok Edwin4fea2e92008-04-06 21:23:02 +0000[diff] [blame]1473 TLO.DAG.getConstant(Expanded, VT));
1474 return TLO.CombineTo(Op, New);
1475 }
1476 // if it already has all the bits set, nothing to change
1477 // but don't shrink either!
1478 } else if (TLO.ShrinkDemandedConstant(Op, NewMask)) {
1479 return true;
1480 }
1481 }
1482
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1483 KnownZero = KnownZeroOut;
1484 KnownOne = KnownOneOut;
1485 break;
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1486 case ISD::SELECT:
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1487 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1488 KnownOne, TLO, Depth+1))
1489 return true;
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1490 if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero2,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1491 KnownOne2, TLO, Depth+1))
1492 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1493 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1494 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1495
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1496 // If the operands are constants, see if we can simplify them.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1497 if (TLO.ShrinkDemandedConstant(Op, NewMask))
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1498 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1499
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1500 // Only known if known in both the LHS and RHS.
1501 KnownOne &= KnownOne2;
1502 KnownZero &= KnownZero2;
1503 break;
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1504 case ISD::SELECT_CC:
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1505 if (SimplifyDemandedBits(Op.getOperand(3), NewMask, KnownZero,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1506 KnownOne, TLO, Depth+1))
1507 return true;
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1508 if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero2,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1509 KnownOne2, TLO, Depth+1))
1510 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1511 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1512 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1513
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1514 // If the operands are constants, see if we can simplify them.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1515 if (TLO.ShrinkDemandedConstant(Op, NewMask))
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1516 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1517
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1518 // Only known if known in both the LHS and RHS.
1519 KnownOne &= KnownOne2;
1520 KnownZero &= KnownZero2;
1521 break;
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1522 case ISD::SHL:
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1523 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1524 unsigned ShAmt = SA->getZExtValue();
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1525 SDValue InOp = Op.getOperand(0);
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1526
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1527 // If the shift count is an invalid immediate, don't do anything.
1528 if (ShAmt >= BitWidth)
1529 break;
1530
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1531 // If this is ((X >>u C1) << ShAmt), see if we can simplify this into a
1532 // single shift. We can do this if the bottom bits (which are shifted
1533 // out) are never demanded.
1534 if (InOp.getOpcode() == ISD::SRL &&
1535 isa<ConstantSDNode>(InOp.getOperand(1))) {
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1536 if (ShAmt && (NewMask & APInt::getLowBitsSet(BitWidth, ShAmt)) == 0) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1537 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1538 unsigned Opc = ISD::SHL;
1539 int Diff = ShAmt-C1;
1540 if (Diff < 0) {
1541 Diff = -Diff;
1542 Opc = ISD::SRL;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1543 }
1544
1545 SDValue NewSA =
Chris Lattner4e7e6cd2007-05-30 16:30:06 +0000[diff] [blame]1546 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1547 EVT VT = Op.getValueType();
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1548 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1549 InOp.getOperand(0), NewSA));
1550 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1551 }
1552
Dan Gohmana4f4d692010-07-23 18:03:30 +0000[diff] [blame]1553 if (SimplifyDemandedBits(InOp, NewMask.lshr(ShAmt),
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1554 KnownZero, KnownOne, TLO, Depth+1))
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1555 return true;
Dan Gohmana4f4d692010-07-23 18:03:30 +0000[diff] [blame]1556
1557 // Convert (shl (anyext x, c)) to (anyext (shl x, c)) if the high bits
1558 // are not demanded. This will likely allow the anyext to be folded away.
1559 if (InOp.getNode()->getOpcode() == ISD::ANY_EXTEND) {
1560 SDValue InnerOp = InOp.getNode()->getOperand(0);
1561 EVT InnerVT = InnerOp.getValueType();
Eli Friedman2dd03532011-12-09 01:16:26 +0000[diff] [blame]1562 unsigned InnerBits = InnerVT.getSizeInBits();
1563 if (ShAmt < InnerBits && NewMask.lshr(InnerBits) == 0 &&
Dan Gohmana4f4d692010-07-23 18:03:30 +0000[diff] [blame]1564 isTypeDesirableForOp(ISD::SHL, InnerVT)) {
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]1565 EVT ShTy = getShiftAmountTy(InnerVT);
Dan Gohmancd20c6f2010-07-23 21:08:12 +0000[diff] [blame]1566 if (!APInt(BitWidth, ShAmt).isIntN(ShTy.getSizeInBits()))
1567 ShTy = InnerVT;
Dan Gohmana4f4d692010-07-23 18:03:30 +0000[diff] [blame]1568 SDValue NarrowShl =
1569 TLO.DAG.getNode(ISD::SHL, dl, InnerVT, InnerOp,
Dan Gohmancd20c6f2010-07-23 21:08:12 +0000[diff] [blame]1570 TLO.DAG.getConstant(ShAmt, ShTy));
Dan Gohmana4f4d692010-07-23 18:03:30 +0000[diff] [blame]1571 return
1572 TLO.CombineTo(Op,
1573 TLO.DAG.getNode(ISD::ANY_EXTEND, dl, Op.getValueType(),
1574 NarrowShl));
1575 }
1576 }
1577
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1578 KnownZero <<= SA->getZExtValue();
1579 KnownOne <<= SA->getZExtValue();
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1580 // low bits known zero.
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1581 KnownZero |= APInt::getLowBitsSet(BitWidth, SA->getZExtValue());
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1582 }
1583 break;
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1584 case ISD::SRL:
1585 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1586 EVT VT = Op.getValueType();
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1587 unsigned ShAmt = SA->getZExtValue();
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]1588 unsigned VTSize = VT.getSizeInBits();
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1589 SDValue InOp = Op.getOperand(0);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1590
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1591 // If the shift count is an invalid immediate, don't do anything.
1592 if (ShAmt >= BitWidth)
1593 break;
1594
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1595 // If this is ((X << C1) >>u ShAmt), see if we can simplify this into a
1596 // single shift. We can do this if the top bits (which are shifted out)
1597 // are never demanded.
1598 if (InOp.getOpcode() == ISD::SHL &&
1599 isa<ConstantSDNode>(InOp.getOperand(1))) {
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1600 if (ShAmt && (NewMask & APInt::getHighBitsSet(VTSize, ShAmt)) == 0) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1601 unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1602 unsigned Opc = ISD::SRL;
1603 int Diff = ShAmt-C1;
1604 if (Diff < 0) {
1605 Diff = -Diff;
1606 Opc = ISD::SHL;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1607 }
1608
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1609 SDValue NewSA =
Chris Lattner8c7d2d52007-04-17 22:53:02 +0000[diff] [blame]1610 TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1611 return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
Chris Lattner895c4ab2007-04-17 21:14:16 +0000[diff] [blame]1612 InOp.getOperand(0), NewSA));
1613 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1614 }
1615
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1616 // Compute the new bits that are at the top now.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1617 if (SimplifyDemandedBits(InOp, (NewMask << ShAmt),
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1618 KnownZero, KnownOne, TLO, Depth+1))
1619 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1620 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1621 KnownZero = KnownZero.lshr(ShAmt);
1622 KnownOne = KnownOne.lshr(ShAmt);
Chris Lattnerc4fa6032006-06-13 16:52:37 +0000[diff] [blame]1623
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1624 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
Chris Lattnerc4fa6032006-06-13 16:52:37 +0000[diff] [blame]1625 KnownZero |= HighBits; // High bits known zero.
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1626 }
1627 break;
1628 case ISD::SRA:
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]1629 // If this is an arithmetic shift right and only the low-bit is set, we can
1630 // always convert this into a logical shr, even if the shift amount is
1631 // variable. The low bit of the shift cannot be an input sign bit unless
1632 // the shift amount is >= the size of the datatype, which is undefined.
Eli Friedman2dd03532011-12-09 01:16:26 +0000[diff] [blame]1633 if (NewMask == 1)
Evan Chenge5b51ac2010-04-17 06:13:15 +0000[diff] [blame]1634 return TLO.CombineTo(Op,
1635 TLO.DAG.getNode(ISD::SRL, dl, Op.getValueType(),
1636 Op.getOperand(0), Op.getOperand(1)));
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]1637
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1638 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1639 EVT VT = Op.getValueType();
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]1640 unsigned ShAmt = SA->getZExtValue();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1641
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1642 // If the shift count is an invalid immediate, don't do anything.
1643 if (ShAmt >= BitWidth)
1644 break;
1645
1646 APInt InDemandedMask = (NewMask << ShAmt);
Chris Lattner1b737132006-05-08 17:22:53 +0000[diff] [blame]1647
1648 // If any of the demanded bits are produced by the sign extension, we also
1649 // demand the input sign bit.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1650 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
1651 if (HighBits.intersects(NewMask))
Dan Gohman87862e72009-12-11 21:31:27 +0000[diff] [blame]1652 InDemandedMask |= APInt::getSignBit(VT.getScalarType().getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1653
Chris Lattner1b737132006-05-08 17:22:53 +0000[diff] [blame]1654 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedMask,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1655 KnownZero, KnownOne, TLO, Depth+1))
1656 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1657 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1658 KnownZero = KnownZero.lshr(ShAmt);
1659 KnownOne = KnownOne.lshr(ShAmt);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1660
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1661 // Handle the sign bit, adjusted to where it is now in the mask.
1662 APInt SignBit = APInt::getSignBit(BitWidth).lshr(ShAmt);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1663
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1664 // If the input sign bit is known to be zero, or if none of the top bits
1665 // are demanded, turn this into an unsigned shift right.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1666 if (KnownZero.intersects(SignBit) || (HighBits & ~NewMask) == HighBits) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1667 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl, VT,
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1668 Op.getOperand(0),
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1669 Op.getOperand(1)));
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1670 } else if (KnownOne.intersects(SignBit)) { // New bits are known one.
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1671 KnownOne |= HighBits;
1672 }
1673 }
1674 break;
1675 case ISD::SIGN_EXTEND_INREG: {
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1676 EVT ExVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1677
1678 APInt MsbMask = APInt::getHighBitsSet(BitWidth, 1);
1679 // If we only care about the highest bit, don't bother shifting right.
Eli Friedmand49db362012-01-31 01:08:03 +0000[diff] [blame]1680 if (MsbMask == DemandedMask) {
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1681 unsigned ShAmt = ExVT.getScalarType().getSizeInBits();
1682 SDValue InOp = Op.getOperand(0);
Eli Friedmand49db362012-01-31 01:08:03 +0000[diff] [blame]1683
1684 // Compute the correct shift amount type, which must be getShiftAmountTy
1685 // for scalar types after legalization.
1686 EVT ShiftAmtTy = Op.getValueType();
1687 if (TLO.LegalTypes() && !ShiftAmtTy.isVector())
1688 ShiftAmtTy = getShiftAmountTy(ShiftAmtTy);
1689
1690 SDValue ShiftAmt = TLO.DAG.getConstant(BitWidth - ShAmt, ShiftAmtTy);
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1691 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SHL, dl,
1692 Op.getValueType(), InOp, ShiftAmt));
1693 }
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1694
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1695 // Sign extension. Compute the demanded bits in the result that are not
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1696 // present in the input.
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1697 APInt NewBits =
1698 APInt::getHighBitsSet(BitWidth,
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1699 BitWidth - ExVT.getScalarType().getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1700
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1701 // If none of the extended bits are demanded, eliminate the sextinreg.
Eli Friedman1d17d192010-08-02 04:42:25 +0000[diff] [blame]1702 if ((NewBits & NewMask) == 0)
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1703 return TLO.CombineTo(Op, Op.getOperand(0));
1704
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1705 APInt InSignBit =
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1706 APInt::getSignBit(ExVT.getScalarType().getSizeInBits()).zext(BitWidth);
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1707 APInt InputDemandedBits =
1708 APInt::getLowBitsSet(BitWidth,
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1709 ExVT.getScalarType().getSizeInBits()) &
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1710 NewMask;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1711
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1712 // Since the sign extended bits are demanded, we know that the sign
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1713 // bit is demanded.
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1714 InputDemandedBits |= InSignBit;
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1715
1716 if (SimplifyDemandedBits(Op.getOperand(0), InputDemandedBits,
1717 KnownZero, KnownOne, TLO, Depth+1))
1718 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1719 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1720
1721 // If the sign bit of the input is known set or clear, then we know the
1722 // top bits of the result.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1723
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1724 // If the input sign bit is known zero, convert this into a zero extension.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1725 if (KnownZero.intersects(InSignBit))
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1726 return TLO.CombineTo(Op,
Nadav Rotemcc616562012-01-15 19:27:55 +0000[diff] [blame]1727 TLO.DAG.getZeroExtendInReg(Op.getOperand(0),dl,ExVT));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1728
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1729 if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1730 KnownOne |= NewBits;
1731 KnownZero &= ~NewBits;
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1732 } else { // Input sign bit unknown
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1733 KnownZero &= ~NewBits;
1734 KnownOne &= ~NewBits;
1735 }
1736 break;
1737 }
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1738 case ISD::ZERO_EXTEND: {
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1739 unsigned OperandBitWidth =
1740 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1741 APInt InMask = NewMask.trunc(OperandBitWidth);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1742
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1743 // If none of the top bits are demanded, convert this into an any_extend.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1744 APInt NewBits =
1745 APInt::getHighBitsSet(BitWidth, BitWidth - OperandBitWidth) & NewMask;
1746 if (!NewBits.intersects(NewMask))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1747 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1748 Op.getValueType(),
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1749 Op.getOperand(0)));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1750
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1751 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1752 KnownZero, KnownOne, TLO, Depth+1))
1753 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1754 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1755 KnownZero = KnownZero.zext(BitWidth);
1756 KnownOne = KnownOne.zext(BitWidth);
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1757 KnownZero |= NewBits;
1758 break;
1759 }
1760 case ISD::SIGN_EXTEND: {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1761 EVT InVT = Op.getOperand(0).getValueType();
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1762 unsigned InBits = InVT.getScalarType().getSizeInBits();
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1763 APInt InMask = APInt::getLowBitsSet(BitWidth, InBits);
Dan Gohman97360282008-03-11 21:29:43 +0000[diff] [blame]1764 APInt InSignBit = APInt::getBitsSet(BitWidth, InBits - 1, InBits);
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1765 APInt NewBits = ~InMask & NewMask;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1766
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1767 // If none of the top bits are demanded, convert this into an any_extend.
1768 if (NewBits == 0)
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1769 return TLO.CombineTo(Op,TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
1770 Op.getValueType(),
1771 Op.getOperand(0)));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1772
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1773 // Since some of the sign extended bits are demanded, we know that the sign
1774 // bit is demanded.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1775 APInt InDemandedBits = InMask & NewMask;
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1776 InDemandedBits |= InSignBit;
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1777 InDemandedBits = InDemandedBits.trunc(InBits);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1778
1779 if (SimplifyDemandedBits(Op.getOperand(0), InDemandedBits, KnownZero,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1780 KnownOne, TLO, Depth+1))
1781 return true;
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1782 KnownZero = KnownZero.zext(BitWidth);
1783 KnownOne = KnownOne.zext(BitWidth);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1784
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1785 // If the sign bit is known zero, convert this to a zero extend.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1786 if (KnownZero.intersects(InSignBit))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]1787 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ZERO_EXTEND, dl,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1788 Op.getValueType(),
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1789 Op.getOperand(0)));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1790
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1791 // If the sign bit is known one, the top bits match.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1792 if (KnownOne.intersects(InSignBit)) {
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1793 KnownOne |= NewBits;
1794 assert((KnownZero & NewBits) == 0);
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1795 } else { // Otherwise, top bits aren't known.
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1796 assert((KnownOne & NewBits) == 0);
1797 assert((KnownZero & NewBits) == 0);
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1798 }
1799 break;
1800 }
1801 case ISD::ANY_EXTEND: {
Dan Gohmand1996362010-01-09 02:13:55 +0000[diff] [blame]1802 unsigned OperandBitWidth =
1803 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1804 APInt InMask = NewMask.trunc(OperandBitWidth);
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1805 if (SimplifyDemandedBits(Op.getOperand(0), InMask,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1806 KnownZero, KnownOne, TLO, Depth+1))
1807 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1808 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1809 KnownZero = KnownZero.zext(BitWidth);
1810 KnownOne = KnownOne.zext(BitWidth);
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1811 break;
1812 }
Chris Lattnerfe8babf2006-05-05 22:32:12 +0000[diff] [blame]1813 case ISD::TRUNCATE: {
Chris Lattnerc93dfda2006-05-06 00:11:52 +0000[diff] [blame]1814 // Simplify the input, using demanded bit information, and compute the known
1815 // zero/one bits live out.
Dan Gohman042919c2010-03-01 17:59:21 +0000[diff] [blame]1816 unsigned OperandBitWidth =
1817 Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1818 APInt TruncMask = NewMask.zext(OperandBitWidth);
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1819 if (SimplifyDemandedBits(Op.getOperand(0), TruncMask,
Chris Lattnerfe8babf2006-05-05 22:32:12 +0000[diff] [blame]1820 KnownZero, KnownOne, TLO, Depth+1))
1821 return true;
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1822 KnownZero = KnownZero.trunc(BitWidth);
1823 KnownOne = KnownOne.trunc(BitWidth);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1824
Chris Lattnerc93dfda2006-05-06 00:11:52 +0000[diff] [blame]1825 // If the input is only used by this truncate, see if we can shrink it based
1826 // on the known demanded bits.
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]1827 if (Op.getOperand(0).getNode()->hasOneUse()) {
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1828 SDValue In = Op.getOperand(0);
Chris Lattnerc93dfda2006-05-06 00:11:52 +0000[diff] [blame]1829 switch (In.getOpcode()) {
1830 default: break;
1831 case ISD::SRL:
1832 // Shrink SRL by a constant if none of the high bits shifted in are
1833 // demanded.
Evan Chenge5b51ac2010-04-17 06:13:15 +0000[diff] [blame]1834 if (TLO.LegalTypes() &&
1835 !isTypeDesirableForOp(ISD::SRL, Op.getValueType()))
1836 // Do not turn (vt1 truncate (vt2 srl)) into (vt1 srl) if vt1 is
1837 // undesirable.
1838 break;
1839 ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(In.getOperand(1));
1840 if (!ShAmt)
1841 break;
Owen Anderson7adf8622011-04-13 23:22:23 +0000[diff] [blame]1842 SDValue Shift = In.getOperand(1);
1843 if (TLO.LegalTypes()) {
1844 uint64_t ShVal = ShAmt->getZExtValue();
1845 Shift =
1846 TLO.DAG.getConstant(ShVal, getShiftAmountTy(Op.getValueType()));
1847 }
1848
Evan Chenge5b51ac2010-04-17 06:13:15 +0000[diff] [blame]1849 APInt HighBits = APInt::getHighBitsSet(OperandBitWidth,
1850 OperandBitWidth - BitWidth);
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]1851 HighBits = HighBits.lshr(ShAmt->getZExtValue()).trunc(BitWidth);
Evan Chenge5b51ac2010-04-17 06:13:15 +0000[diff] [blame]1852
1853 if (ShAmt->getZExtValue() < BitWidth && !(HighBits & NewMask)) {
1854 // None of the shifted in bits are needed. Add a truncate of the
1855 // shift input, then shift it.
1856 SDValue NewTrunc = TLO.DAG.getNode(ISD::TRUNCATE, dl,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1857 Op.getValueType(),
Evan Chenge5b51ac2010-04-17 06:13:15 +0000[diff] [blame]1858 In.getOperand(0));
1859 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl,
1860 Op.getValueType(),
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1861 NewTrunc,
Owen Anderson7adf8622011-04-13 23:22:23 +0000[diff] [blame]1862 Shift));
Chris Lattnerc93dfda2006-05-06 00:11:52 +0000[diff] [blame]1863 }
1864 break;
1865 }
1866 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1867
1868 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Chris Lattnerfe8babf2006-05-05 22:32:12 +0000[diff] [blame]1869 break;
1870 }
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1871 case ISD::AssertZext: {
Owen Anderson7ab15f62011-09-03 00:26:49 +0000[diff] [blame]1872 // AssertZext demands all of the high bits, plus any of the low bits
1873 // demanded by its users.
1874 EVT VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1875 APInt InMask = APInt::getLowBitsSet(BitWidth,
1876 VT.getSizeInBits());
1877 if (SimplifyDemandedBits(Op.getOperand(0), ~InMask | NewMask,
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1878 KnownZero, KnownOne, TLO, Depth+1))
1879 return true;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1880 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman400f75c2010-06-03 20:21:33 +0000[diff] [blame]1881
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1882 KnownZero |= ~InMask & NewMask;
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1883 break;
1884 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1885 case ISD::BITCAST:
Stuart Hastings57f1fde2011-06-06 16:44:31 +0000[diff] [blame]1886 // If this is an FP->Int bitcast and if the sign bit is the only
1887 // thing demanded, turn this into a FGETSIGN.
Eli Friedmanca072a32011-12-15 02:07:20 +0000[diff] [blame]1888 if (!TLO.LegalOperations() &&
1889 !Op.getValueType().isVector() &&
Eli Friedman0948f0a2011-11-09 22:25:12 +0000[diff] [blame]1890 !Op.getOperand(0).getValueType().isVector() &&
Nadav Rotem0c3e6782011-06-12 14:56:55 +0000[diff] [blame]1891 NewMask == APInt::getSignBit(Op.getValueType().getSizeInBits()) &&
1892 Op.getOperand(0).getValueType().isFloatingPoint()) {
Stuart Hastings57f1fde2011-06-06 16:44:31 +0000[diff] [blame]1893 bool OpVTLegal = isOperationLegalOrCustom(ISD::FGETSIGN, Op.getValueType());
1894 bool i32Legal = isOperationLegalOrCustom(ISD::FGETSIGN, MVT::i32);
1895 if ((OpVTLegal || i32Legal) && Op.getValueType().isSimple()) {
1896 EVT Ty = OpVTLegal ? Op.getValueType() : MVT::i32;
Chris Lattner2ceb2cf2007-12-22 21:35:38 +0000[diff] [blame]1897 // Make a FGETSIGN + SHL to move the sign bit into the appropriate
1898 // place. We expect the SHL to be eliminated by other optimizations.
Stuart Hastings090bf192011-06-01 18:32:25 +0000[diff] [blame]1899 SDValue Sign = TLO.DAG.getNode(ISD::FGETSIGN, dl, Ty, Op.getOperand(0));
Stuart Hastings57f1fde2011-06-06 16:44:31 +0000[diff] [blame]1900 unsigned OpVTSizeInBits = Op.getValueType().getSizeInBits();
1901 if (!OpVTLegal && OpVTSizeInBits > 32)
Stuart Hastings090bf192011-06-01 18:32:25 +0000[diff] [blame]1902 Sign = TLO.DAG.getNode(ISD::ZERO_EXTEND, dl, Op.getValueType(), Sign);
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]1903 unsigned ShVal = Op.getValueType().getSizeInBits()-1;
Stuart Hastingsbdce3722011-06-01 14:04:17 +0000[diff] [blame]1904 SDValue ShAmt = TLO.DAG.getConstant(ShVal, Op.getValueType());
Stuart Hastings3dfc4b122011-05-19 18:48:20 +0000[diff] [blame]1905 return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SHL, dl,
1906 Op.getValueType(),
Chris Lattner2ceb2cf2007-12-22 21:35:38 +0000[diff] [blame]1907 Sign, ShAmt));
1908 }
1909 }
Chris Lattner2ceb2cf2007-12-22 21:35:38 +0000[diff] [blame]1910 break;
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1911 case ISD::ADD:
1912 case ISD::MUL:
1913 case ISD::SUB: {
1914 // Add, Sub, and Mul don't demand any bits in positions beyond that
1915 // of the highest bit demanded of them.
1916 APInt LoMask = APInt::getLowBitsSet(BitWidth,
1917 BitWidth - NewMask.countLeadingZeros());
1918 if (SimplifyDemandedBits(Op.getOperand(0), LoMask, KnownZero2,
1919 KnownOne2, TLO, Depth+1))
1920 return true;
1921 if (SimplifyDemandedBits(Op.getOperand(1), LoMask, KnownZero2,
1922 KnownOne2, TLO, Depth+1))
1923 return true;
1924 // See if the operation should be performed at a smaller bit width.
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000[diff] [blame]1925 if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman97121ba2009-04-08 00:15:30 +0000[diff] [blame]1926 return true;
1927 }
1928 // FALL THROUGH
Dan Gohman54eed372008-05-06 00:53:29 +0000[diff] [blame]1929 default:
Chris Lattner1482b5f2006-04-02 06:15:09 +0000[diff] [blame]1930 // Just use ComputeMaskedBits to compute output bits.
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1931 TLO.DAG.ComputeMaskedBits(Op, KnownZero, KnownOne, Depth);
Chris Lattnera6bc5a42006-02-27 01:00:42 +0000[diff] [blame]1932 break;
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1933 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1934
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1935 // If we know the value of all of the demanded bits, return this as a
1936 // constant.
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000[diff] [blame]1937 if ((NewMask & (KnownZero|KnownOne)) == NewMask)
Chris Lattnerec665152006-02-26 23:36:02 +0000[diff] [blame]1938 return TLO.CombineTo(Op, TLO.DAG.getConstant(KnownOne, Op.getValueType()));
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1939
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1940 return false;
1941}
1942
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1943/// computeMaskedBitsForTargetNode - Determine which of the bits specified
1944/// in Mask are known to be either zero or one and return them in the
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1945/// KnownZero/KnownOne bitsets.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1946void TargetLowering::computeMaskedBitsForTargetNode(const SDValue Op,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]1947 APInt &KnownZero,
Dan Gohmanfd29e0e2008-02-13 00:35:47 +0000[diff] [blame]1948 APInt &KnownOne,
Dan Gohmanea859be2007-06-22 14:59:07 +0000[diff] [blame]1949 const SelectionDAG &DAG,
Nate Begeman368e18d2006-02-16 21:11:51 +0000[diff] [blame]1950 unsigned Depth) const {
Chris Lattner1b5232a2006-04-02 06:19:46 +0000[diff] [blame]1951 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1952 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1953 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1954 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
Chris Lattnerc6fd6cd2006-01-30 04:09:27 +0000[diff] [blame]1955 "Should use MaskedValueIsZero if you don't know whether Op"
1956 " is a target node!");
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]1957 KnownZero = KnownOne = APInt(KnownOne.getBitWidth(), 0);
Evan Cheng3a03ebb2005-12-21 23:05:39 +0000[diff] [blame]1958}
Chris Lattner4ccb0702006-01-26 20:37:03 +0000[diff] [blame]1959
Chris Lattner5c3e21d2006-05-06 09:27:13 +0000[diff] [blame]1960/// ComputeNumSignBitsForTargetNode - This method can be implemented by
1961/// targets that want to expose additional information about sign bits to the
1962/// DAG Combiner.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]1963unsigned TargetLowering::ComputeNumSignBitsForTargetNode(SDValue Op,
Chris Lattner5c3e21d2006-05-06 09:27:13 +0000[diff] [blame]1964 unsigned Depth) const {
1965 assert((Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1966 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1967 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1968 Op.getOpcode() == ISD::INTRINSIC_VOID) &&
1969 "Should use ComputeNumSignBits if you don't know whether Op"
1970 " is a target node!");
1971 return 1;
1972}
1973
Dan Gohman97d11632009-02-15 23:59:32 +0000[diff] [blame]1974/// ValueHasExactlyOneBitSet - Test if the given value is known to have exactly
1975/// one bit set. This differs from ComputeMaskedBits in that it doesn't need to
1976/// determine which bit is set.
1977///
Dale Johannesen85b0ede2009-02-11 19:19:41 +0000[diff] [blame]1978static bool ValueHasExactlyOneBitSet(SDValue Val, const SelectionDAG &DAG) {
Dan Gohman97d11632009-02-15 23:59:32 +0000[diff] [blame]1979 // A left-shift of a constant one will have exactly one bit set, because
1980 // shifting the bit off the end is undefined.
1981 if (Val.getOpcode() == ISD::SHL)
1982 if (ConstantSDNode *C =
1983 dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
1984 if (C->getAPIntValue() == 1)
1985 return true;
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]1986
Dan Gohman97d11632009-02-15 23:59:32 +0000[diff] [blame]1987 // Similarly, a right-shift of a constant sign-bit will have exactly
1988 // one bit set.
1989 if (Val.getOpcode() == ISD::SRL)
1990 if (ConstantSDNode *C =
1991 dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
1992 if (C->getAPIntValue().isSignBit())
1993 return true;
1994
1995 // More could be done here, though the above checks are enough
1996 // to handle some common cases.
1997
1998 // Fall back to ComputeMaskedBits to catch other known cases.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]1999 EVT OpVT = Val.getValueType();
Dan Gohman5b870af2010-03-02 02:14:38 +0000[diff] [blame]2000 unsigned BitWidth = OpVT.getScalarType().getSizeInBits();
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2001 APInt KnownZero, KnownOne;
Rafael Espindola26c8dcc2012-04-04 12:51:34 +0000[diff] [blame]2002 DAG.ComputeMaskedBits(Val, KnownZero, KnownOne);
Dale Johannesen85b0ede2009-02-11 19:19:41 +0000[diff] [blame]2003 return (KnownZero.countPopulation() == BitWidth - 1) &&
2004 (KnownOne.countPopulation() == 1);
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2005}
Chris Lattner5c3e21d2006-05-06 09:27:13 +0000[diff] [blame]2006
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2007/// SimplifySetCC - Try to simplify a setcc built with the specified operands
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2008/// and cc. If it is unable to simplify it, return a null SDValue.
2009SDValue
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2010TargetLowering::SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2011 ISD::CondCode Cond, bool foldBooleans,
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2012 DAGCombinerInfo &DCI, DebugLoc dl) const {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2013 SelectionDAG &DAG = DCI.DAG;
2014
2015 // These setcc operations always fold.
2016 switch (Cond) {
2017 default: break;
2018 case ISD::SETFALSE:
2019 case ISD::SETFALSE2: return DAG.getConstant(0, VT);
2020 case ISD::SETTRUE:
2021 case ISD::SETTRUE2: return DAG.getConstant(1, VT);
2022 }
2023
Chris Lattner7a2bdde2011-04-15 05:18:47 +0000[diff] [blame]2024 // Ensure that the constant occurs on the RHS, and fold constant
2025 // comparisons.
2026 if (isa<ConstantSDNode>(N0.getNode()))
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2027 return DAG.getSetCC(dl, VT, N1, N0, ISD::getSetCCSwappedOperands(Cond));
Eric Christopher362fee92011-06-17 20:41:29 +0000[diff] [blame]2028
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2029 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode())) {
Dan Gohman6c6cd1c2008-03-03 22:22:56 +0000[diff] [blame]2030 const APInt &C1 = N1C->getAPIntValue();
Dale Johannesen89217a62008-11-07 01:28:02 +0000[diff] [blame]2031
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2032 // If the LHS is '(srl (ctlz x), 5)', the RHS is 0/1, and this is an
2033 // equality comparison, then we're just comparing whether X itself is
2034 // zero.
2035 if (N0.getOpcode() == ISD::SRL && (C1 == 0 || C1 == 1) &&
2036 N0.getOperand(0).getOpcode() == ISD::CTLZ &&
2037 N0.getOperand(1).getOpcode() == ISD::Constant) {
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2038 const APInt &ShAmt
2039 = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2040 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
2041 ShAmt == Log2_32(N0.getValueType().getSizeInBits())) {
2042 if ((C1 == 0) == (Cond == ISD::SETEQ)) {
2043 // (srl (ctlz x), 5) == 0 -> X != 0
2044 // (srl (ctlz x), 5) != 1 -> X != 0
2045 Cond = ISD::SETNE;
2046 } else {
2047 // (srl (ctlz x), 5) != 0 -> X == 0
2048 // (srl (ctlz x), 5) == 1 -> X == 0
2049 Cond = ISD::SETEQ;
2050 }
2051 SDValue Zero = DAG.getConstant(0, N0.getValueType());
2052 return DAG.getSetCC(dl, VT, N0.getOperand(0).getOperand(0),
2053 Zero, Cond);
2054 }
2055 }
2056
Benjamin Kramerd8228922011-01-17 12:04:57 +0000[diff] [blame]2057 SDValue CTPOP = N0;
2058 // Look through truncs that don't change the value of a ctpop.
2059 if (N0.hasOneUse() && N0.getOpcode() == ISD::TRUNCATE)
2060 CTPOP = N0.getOperand(0);
2061
2062 if (CTPOP.hasOneUse() && CTPOP.getOpcode() == ISD::CTPOP &&
Benjamin Kramerc9b6a3e2011-01-17 18:00:28 +0000[diff] [blame]2063 (N0 == CTPOP || N0.getValueType().getSizeInBits() >
Benjamin Kramerd8228922011-01-17 12:04:57 +0000[diff] [blame]2064 Log2_32_Ceil(CTPOP.getValueType().getSizeInBits()))) {
2065 EVT CTVT = CTPOP.getValueType();
2066 SDValue CTOp = CTPOP.getOperand(0);
2067
2068 // (ctpop x) u< 2 -> (x & x-1) == 0
2069 // (ctpop x) u> 1 -> (x & x-1) != 0
2070 if ((Cond == ISD::SETULT && C1 == 2) || (Cond == ISD::SETUGT && C1 == 1)){
2071 SDValue Sub = DAG.getNode(ISD::SUB, dl, CTVT, CTOp,
2072 DAG.getConstant(1, CTVT));
2073 SDValue And = DAG.getNode(ISD::AND, dl, CTVT, CTOp, Sub);
2074 ISD::CondCode CC = Cond == ISD::SETULT ? ISD::SETEQ : ISD::SETNE;
2075 return DAG.getSetCC(dl, VT, And, DAG.getConstant(0, CTVT), CC);
2076 }
2077
Sylvestre Ledru94c22712012-09-27 10:14:43 +0000[diff] [blame]2078 // TODO: (ctpop x) == 1 -> x && (x & x-1) == 0 iff ctpop is illegal.
Benjamin Kramerd8228922011-01-17 12:04:57 +0000[diff] [blame]2079 }
2080
Benjamin Kramere7cf0622011-04-22 18:47:44 +0000[diff] [blame]2081 // (zext x) == C --> x == (trunc C)
2082 if (DCI.isBeforeLegalize() && N0->hasOneUse() &&
2083 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
2084 unsigned MinBits = N0.getValueSizeInBits();
2085 SDValue PreZExt;
2086 if (N0->getOpcode() == ISD::ZERO_EXTEND) {
2087 // ZExt
2088 MinBits = N0->getOperand(0).getValueSizeInBits();
2089 PreZExt = N0->getOperand(0);
2090 } else if (N0->getOpcode() == ISD::AND) {
2091 // DAGCombine turns costly ZExts into ANDs
2092 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0->getOperand(1)))
2093 if ((C->getAPIntValue()+1).isPowerOf2()) {
2094 MinBits = C->getAPIntValue().countTrailingOnes();
2095 PreZExt = N0->getOperand(0);
2096 }
2097 } else if (LoadSDNode *LN0 = dyn_cast<LoadSDNode>(N0)) {
2098 // ZEXTLOAD
2099 if (LN0->getExtensionType() == ISD::ZEXTLOAD) {
2100 MinBits = LN0->getMemoryVT().getSizeInBits();
2101 PreZExt = N0;
2102 }
2103 }
2104
Benjamin Kramerd9b0b022012-06-02 10:20:22 +0000[diff] [blame]2105 // Make sure we're not losing bits from the constant.
Benjamin Kramere7cf0622011-04-22 18:47:44 +0000[diff] [blame]2106 if (MinBits < C1.getBitWidth() && MinBits > C1.getActiveBits()) {
2107 EVT MinVT = EVT::getIntegerVT(*DAG.getContext(), MinBits);
2108 if (isTypeDesirableForOp(ISD::SETCC, MinVT)) {
2109 // Will get folded away.
2110 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, dl, MinVT, PreZExt);
2111 SDValue C = DAG.getConstant(C1.trunc(MinBits), MinVT);
2112 return DAG.getSetCC(dl, VT, Trunc, C, Cond);
2113 }
2114 }
2115 }
2116
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2117 // If the LHS is '(and load, const)', the RHS is 0,
2118 // the test is for equality or unsigned, and all 1 bits of the const are
2119 // in the same partial word, see if we can shorten the load.
2120 if (DCI.isBeforeLegalize() &&
2121 N0.getOpcode() == ISD::AND && C1 == 0 &&
2122 N0.getNode()->hasOneUse() &&
2123 isa<LoadSDNode>(N0.getOperand(0)) &&
2124 N0.getOperand(0).getNode()->hasOneUse() &&
2125 isa<ConstantSDNode>(N0.getOperand(1))) {
2126 LoadSDNode *Lod = cast<LoadSDNode>(N0.getOperand(0));
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2127 APInt bestMask;
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2128 unsigned bestWidth = 0, bestOffset = 0;
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2129 if (!Lod->isVolatile() && Lod->isUnindexed()) {
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2130 unsigned origWidth = N0.getValueType().getSizeInBits();
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2131 unsigned maskWidth = origWidth;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2132 // We can narrow (e.g.) 16-bit extending loads on 32-bit target to
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2133 // 8 bits, but have to be careful...
2134 if (Lod->getExtensionType() != ISD::NON_EXTLOAD)
2135 origWidth = Lod->getMemoryVT().getSizeInBits();
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2136 const APInt &Mask =
2137 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2138 for (unsigned width = origWidth / 2; width>=8; width /= 2) {
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2139 APInt newMask = APInt::getLowBitsSet(maskWidth, width);
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2140 for (unsigned offset=0; offset<origWidth/width; offset++) {
2141 if ((newMask & Mask) == Mask) {
2142 if (!TD->isLittleEndian())
2143 bestOffset = (origWidth/width - offset - 1) * (width/8);
2144 else
2145 bestOffset = (uint64_t)offset * (width/8);
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2146 bestMask = Mask.lshr(offset * (width/8) * 8);
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2147 bestWidth = width;
2148 break;
Dale Johannesen89217a62008-11-07 01:28:02 +0000[diff] [blame]2149 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2150 newMask = newMask << width;
Dale Johannesen89217a62008-11-07 01:28:02 +0000[diff] [blame]2151 }
2152 }
2153 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2154 if (bestWidth) {
Chris Lattnerc0c7fca2011-04-14 04:12:47 +0000[diff] [blame]2155 EVT newVT = EVT::getIntegerVT(*DAG.getContext(), bestWidth);
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2156 if (newVT.isRound()) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2157 EVT PtrType = Lod->getOperand(1).getValueType();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2158 SDValue Ptr = Lod->getBasePtr();
2159 if (bestOffset != 0)
2160 Ptr = DAG.getNode(ISD::ADD, dl, PtrType, Lod->getBasePtr(),
2161 DAG.getConstant(bestOffset, PtrType));
2162 unsigned NewAlign = MinAlign(Lod->getAlignment(), bestOffset);
2163 SDValue NewLoad = DAG.getLoad(newVT, dl, Lod->getChain(), Ptr,
Chris Lattnerecf42c42010-09-21 16:36:31 +0000[diff] [blame]2164 Lod->getPointerInfo().getWithOffset(bestOffset),
Pete Cooperd752e0f2011-11-08 18:42:53 +0000[diff] [blame]2165 false, false, false, NewAlign);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2166 return DAG.getSetCC(dl, VT,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2167 DAG.getNode(ISD::AND, dl, newVT, NewLoad,
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2168 DAG.getConstant(bestMask.trunc(bestWidth),
2169 newVT)),
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2170 DAG.getConstant(0LL, newVT), Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2171 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2172 }
2173 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2174
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2175 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
2176 if (N0.getOpcode() == ISD::ZERO_EXTEND) {
2177 unsigned InSize = N0.getOperand(0).getValueType().getSizeInBits();
2178
2179 // If the comparison constant has bits in the upper part, the
2180 // zero-extended value could never match.
2181 if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(),
2182 C1.getBitWidth() - InSize))) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2183 switch (Cond) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2184 case ISD::SETUGT:
2185 case ISD::SETUGE:
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2186 case ISD::SETEQ: return DAG.getConstant(0, VT);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2187 case ISD::SETULT:
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2188 case ISD::SETULE:
2189 case ISD::SETNE: return DAG.getConstant(1, VT);
2190 case ISD::SETGT:
2191 case ISD::SETGE:
2192 // True if the sign bit of C1 is set.
2193 return DAG.getConstant(C1.isNegative(), VT);
2194 case ISD::SETLT:
2195 case ISD::SETLE:
2196 // True if the sign bit of C1 isn't set.
2197 return DAG.getConstant(C1.isNonNegative(), VT);
2198 default:
Jakob Stoklund Olesen78d12642009-07-24 18:22:59 +0000[diff] [blame]2199 break;
2200 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2201 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2202
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2203 // Otherwise, we can perform the comparison with the low bits.
2204 switch (Cond) {
2205 case ISD::SETEQ:
2206 case ISD::SETNE:
2207 case ISD::SETUGT:
2208 case ISD::SETUGE:
2209 case ISD::SETULT:
2210 case ISD::SETULE: {
Patrik Hagglund34525f92012-12-11 11:14:33 +0000[diff] [blame]2211 EVT newVT = N0.getOperand(0).getValueType();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2212 if (DCI.isBeforeLegalizeOps() ||
2213 (isOperationLegal(ISD::SETCC, newVT) &&
Patrik Hagglund9c5ab932012-12-19 10:09:26 +0000[diff] [blame]2214 getCondCodeAction(Cond, newVT.getSimpleVT())==Legal))
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2215 return DAG.getSetCC(dl, VT, N0.getOperand(0),
Jay Foad40f8f622010-12-07 08:25:19 +0000[diff] [blame]2216 DAG.getConstant(C1.trunc(InSize), newVT),
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2217 Cond);
2218 break;
2219 }
2220 default:
2221 break; // todo, be more careful with signed comparisons
2222 }
2223 } else if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2224 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2225 EVT ExtSrcTy = cast<VTSDNode>(N0.getOperand(1))->getVT();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2226 unsigned ExtSrcTyBits = ExtSrcTy.getSizeInBits();
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2227 EVT ExtDstTy = N0.getValueType();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2228 unsigned ExtDstTyBits = ExtDstTy.getSizeInBits();
2229
Eli Friedmanad78a882010-07-30 06:44:31 +0000[diff] [blame]2230 // If the constant doesn't fit into the number of bits for the source of
2231 // the sign extension, it is impossible for both sides to be equal.
2232 if (C1.getMinSignedBits() > ExtSrcTyBits)
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2233 return DAG.getConstant(Cond == ISD::SETNE, VT);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2234
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2235 SDValue ZextOp;
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2236 EVT Op0Ty = N0.getOperand(0).getValueType();
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2237 if (Op0Ty == ExtSrcTy) {
2238 ZextOp = N0.getOperand(0);
2239 } else {
2240 APInt Imm = APInt::getLowBitsSet(ExtDstTyBits, ExtSrcTyBits);
2241 ZextOp = DAG.getNode(ISD::AND, dl, Op0Ty, N0.getOperand(0),
2242 DAG.getConstant(Imm, Op0Ty));
2243 }
2244 if (!DCI.isCalledByLegalizer())
2245 DCI.AddToWorklist(ZextOp.getNode());
2246 // Otherwise, make this a use of a zext.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2247 return DAG.getSetCC(dl, VT, ZextOp,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2248 DAG.getConstant(C1 & APInt::getLowBitsSet(
2249 ExtDstTyBits,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2250 ExtSrcTyBits),
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2251 ExtDstTy),
2252 Cond);
2253 } else if ((N1C->isNullValue() || N1C->getAPIntValue() == 1) &&
2254 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2255 // SETCC (SETCC), [0|1], [EQ|NE] -> SETCC
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2256 if (N0.getOpcode() == ISD::SETCC &&
2257 isTypeLegal(VT) && VT.bitsLE(N0.getValueType())) {
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2258 bool TrueWhenTrue = (Cond == ISD::SETEQ) ^ (N1C->getAPIntValue() != 1);
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2259 if (TrueWhenTrue)
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2260 return DAG.getNode(ISD::TRUNCATE, dl, VT, N0);
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2261 // Invert the condition.
2262 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2263 CC = ISD::getSetCCInverse(CC,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2264 N0.getOperand(0).getValueType().isInteger());
2265 return DAG.getSetCC(dl, VT, N0.getOperand(0), N0.getOperand(1), CC);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2266 }
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2267
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2268 if ((N0.getOpcode() == ISD::XOR ||
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2269 (N0.getOpcode() == ISD::AND &&
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2270 N0.getOperand(0).getOpcode() == ISD::XOR &&
2271 N0.getOperand(1) == N0.getOperand(0).getOperand(1))) &&
2272 isa<ConstantSDNode>(N0.getOperand(1)) &&
2273 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue() == 1) {
2274 // If this is (X^1) == 0/1, swap the RHS and eliminate the xor. We
2275 // can only do this if the top bits are known zero.
2276 unsigned BitWidth = N0.getValueSizeInBits();
2277 if (DAG.MaskedValueIsZero(N0,
2278 APInt::getHighBitsSet(BitWidth,
2279 BitWidth-1))) {
2280 // Okay, get the un-inverted input value.
2281 SDValue Val;
2282 if (N0.getOpcode() == ISD::XOR)
2283 Val = N0.getOperand(0);
2284 else {
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2285 assert(N0.getOpcode() == ISD::AND &&
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2286 N0.getOperand(0).getOpcode() == ISD::XOR);
2287 // ((X^1)&1)^1 -> X & 1
2288 Val = DAG.getNode(ISD::AND, dl, N0.getValueType(),
2289 N0.getOperand(0).getOperand(0),
2290 N0.getOperand(1));
2291 }
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2292
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2293 return DAG.getSetCC(dl, VT, Val, N1,
2294 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
2295 }
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2296 } else if (N1C->getAPIntValue() == 1 &&
2297 (VT == MVT::i1 ||
Duncan Sands28b77e92011-09-06 19:07:46 +0000[diff] [blame]2298 getBooleanContents(false) == ZeroOrOneBooleanContent)) {
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2299 SDValue Op0 = N0;
2300 if (Op0.getOpcode() == ISD::TRUNCATE)
2301 Op0 = Op0.getOperand(0);
2302
2303 if ((Op0.getOpcode() == ISD::XOR) &&
2304 Op0.getOperand(0).getOpcode() == ISD::SETCC &&
2305 Op0.getOperand(1).getOpcode() == ISD::SETCC) {
2306 // (xor (setcc), (setcc)) == / != 1 -> (setcc) != / == (setcc)
2307 Cond = (Cond == ISD::SETEQ) ? ISD::SETNE : ISD::SETEQ;
2308 return DAG.getSetCC(dl, VT, Op0.getOperand(0), Op0.getOperand(1),
2309 Cond);
Craig Topper40b4a812012-12-19 06:12:28 +0000[diff] [blame]2310 }
2311 if (Op0.getOpcode() == ISD::AND &&
2312 isa<ConstantSDNode>(Op0.getOperand(1)) &&
2313 cast<ConstantSDNode>(Op0.getOperand(1))->getAPIntValue() == 1) {
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2314 // If this is (X&1) == / != 1, normalize it to (X&1) != / == 0.
Anton Korobeynikov17458a72010-05-01 12:52:34 +0000[diff] [blame]2315 if (Op0.getValueType().bitsGT(VT))
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2316 Op0 = DAG.getNode(ISD::AND, dl, VT,
2317 DAG.getNode(ISD::TRUNCATE, dl, VT, Op0.getOperand(0)),
2318 DAG.getConstant(1, VT));
Anton Korobeynikov17458a72010-05-01 12:52:34 +0000[diff] [blame]2319 else if (Op0.getValueType().bitsLT(VT))
2320 Op0 = DAG.getNode(ISD::AND, dl, VT,
2321 DAG.getNode(ISD::ANY_EXTEND, dl, VT, Op0.getOperand(0)),
2322 DAG.getConstant(1, VT));
2323
Evan Cheng2c755ba2010-02-27 07:36:59 +0000[diff] [blame]2324 return DAG.getSetCC(dl, VT, Op0,
2325 DAG.getConstant(0, Op0.getValueType()),
2326 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
2327 }
Craig Topper40b4a812012-12-19 06:12:28 +0000[diff] [blame]2328 if (Op0.getOpcode() == ISD::AssertZext &&
2329 cast<VTSDNode>(Op0.getOperand(1))->getVT() == MVT::i1)
2330 return DAG.getSetCC(dl, VT, Op0,
2331 DAG.getConstant(0, Op0.getValueType()),
2332 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2333 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2334 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2335
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2336 APInt MinVal, MaxVal;
2337 unsigned OperandBitSize = N1C->getValueType(0).getSizeInBits();
2338 if (ISD::isSignedIntSetCC(Cond)) {
2339 MinVal = APInt::getSignedMinValue(OperandBitSize);
2340 MaxVal = APInt::getSignedMaxValue(OperandBitSize);
2341 } else {
2342 MinVal = APInt::getMinValue(OperandBitSize);
2343 MaxVal = APInt::getMaxValue(OperandBitSize);
2344 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2345
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2346 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
2347 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
2348 if (C1 == MinVal) return DAG.getConstant(1, VT); // X >= MIN --> true
2349 // X >= C0 --> X > (C0-1)
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2350 return DAG.getSetCC(dl, VT, N0,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2351 DAG.getConstant(C1-1, N1.getValueType()),
2352 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
2353 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2354
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2355 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
2356 if (C1 == MaxVal) return DAG.getConstant(1, VT); // X <= MAX --> true
2357 // X <= C0 --> X < (C0+1)
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2358 return DAG.getSetCC(dl, VT, N0,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2359 DAG.getConstant(C1+1, N1.getValueType()),
2360 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
2361 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2362
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2363 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal)
2364 return DAG.getConstant(0, VT); // X < MIN --> false
2365 if ((Cond == ISD::SETGE || Cond == ISD::SETUGE) && C1 == MinVal)
2366 return DAG.getConstant(1, VT); // X >= MIN --> true
2367 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal)
2368 return DAG.getConstant(0, VT); // X > MAX --> false
2369 if ((Cond == ISD::SETLE || Cond == ISD::SETULE) && C1 == MaxVal)
2370 return DAG.getConstant(1, VT); // X <= MAX --> true
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2371
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2372 // Canonicalize setgt X, Min --> setne X, Min
2373 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MinVal)
2374 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
2375 // Canonicalize setlt X, Max --> setne X, Max
2376 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MaxVal)
2377 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2378
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2379 // If we have setult X, 1, turn it into seteq X, 0
2380 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal+1)
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2381 return DAG.getSetCC(dl, VT, N0,
2382 DAG.getConstant(MinVal, N0.getValueType()),
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2383 ISD::SETEQ);
2384 // If we have setugt X, Max-1, turn it into seteq X, Max
Craig Topper85022562012-12-19 06:43:58 +0000[diff] [blame]2385 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal-1)
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2386 return DAG.getSetCC(dl, VT, N0,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2387 DAG.getConstant(MaxVal, N0.getValueType()),
2388 ISD::SETEQ);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2389
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2390 // If we have "setcc X, C0", check to see if we can shrink the immediate
2391 // by changing cc.
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2392
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2393 // SETUGT X, SINTMAX -> SETLT X, 0
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2394 if (Cond == ISD::SETUGT &&
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2395 C1 == APInt::getSignedMaxValue(OperandBitSize))
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2396 return DAG.getSetCC(dl, VT, N0,
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2397 DAG.getConstant(0, N1.getValueType()),
2398 ISD::SETLT);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2399
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2400 // SETULT X, SINTMIN -> SETGT X, -1
2401 if (Cond == ISD::SETULT &&
2402 C1 == APInt::getSignedMinValue(OperandBitSize)) {
2403 SDValue ConstMinusOne =
2404 DAG.getConstant(APInt::getAllOnesValue(OperandBitSize),
2405 N1.getValueType());
2406 return DAG.getSetCC(dl, VT, N0, ConstMinusOne, ISD::SETGT);
2407 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2408
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2409 // Fold bit comparisons when we can.
2410 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
Evan Chengd40d03e2010-01-06 19:38:29 +0000[diff] [blame]2411 (VT == N0.getValueType() ||
2412 (isTypeLegal(VT) && VT.bitsLE(N0.getValueType()))) &&
2413 N0.getOpcode() == ISD::AND)
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2414 if (ConstantSDNode *AndRHS =
2415 dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
Benjamin Kramerb97cebd2012-08-17 15:54:21 +0000[diff] [blame]2416 EVT ShiftTy = DCI.isBeforeLegalizeOps() ?
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]2417 getPointerTy() : getShiftAmountTy(N0.getValueType());
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2418 if (Cond == ISD::SETNE && C1 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
2419 // Perform the xform if the AND RHS is a single bit.
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2420 if (AndRHS->getAPIntValue().isPowerOf2()) {
Evan Chengd40d03e2010-01-06 19:38:29 +0000[diff] [blame]2421 return DAG.getNode(ISD::TRUNCATE, dl, VT,
2422 DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2423 DAG.getConstant(AndRHS->getAPIntValue().logBase2(), ShiftTy)));
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2424 }
Evan Cheng347a9cb2010-01-07 20:58:44 +0000[diff] [blame]2425 } else if (Cond == ISD::SETEQ && C1 == AndRHS->getAPIntValue()) {
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2426 // (X & 8) == 8 --> (X & 8) >> 3
2427 // Perform the xform if C1 is a single bit.
2428 if (C1.isPowerOf2()) {
Evan Chengd40d03e2010-01-06 19:38:29 +0000[diff] [blame]2429 return DAG.getNode(ISD::TRUNCATE, dl, VT,
2430 DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
2431 DAG.getConstant(C1.logBase2(), ShiftTy)));
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2432 }
2433 }
Eli Friedmanb101b0b2009-07-26 23:47:17 +0000[diff] [blame]2434 }
Evan Cheng70e10d32012-07-17 06:53:39 +0000[diff] [blame]2435
Evan Chengb4d49592012-07-17 07:47:50 +0000[diff] [blame]2436 if (C1.getMinSignedBits() <= 64 &&
2437 !isLegalICmpImmediate(C1.getSExtValue())) {
Evan Cheng70e10d32012-07-17 06:53:39 +0000[diff] [blame]2438 // (X & -256) == 256 -> (X >> 8) == 1
2439 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
2440 N0.getOpcode() == ISD::AND && N0.hasOneUse()) {
2441 if (ConstantSDNode *AndRHS =
2442 dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
2443 const APInt &AndRHSC = AndRHS->getAPIntValue();
2444 if ((-AndRHSC).isPowerOf2() && (AndRHSC & C1) == C1) {
2445 unsigned ShiftBits = AndRHSC.countTrailingZeros();
Benjamin Kramerb97cebd2012-08-17 15:54:21 +0000[diff] [blame]2446 EVT ShiftTy = DCI.isBeforeLegalizeOps() ?
Evan Cheng70e10d32012-07-17 06:53:39 +0000[diff] [blame]2447 getPointerTy() : getShiftAmountTy(N0.getValueType());
2448 EVT CmpTy = N0.getValueType();
2449 SDValue Shift = DAG.getNode(ISD::SRL, dl, CmpTy, N0.getOperand(0),
2450 DAG.getConstant(ShiftBits, ShiftTy));
2451 SDValue CmpRHS = DAG.getConstant(C1.lshr(ShiftBits), CmpTy);
2452 return DAG.getSetCC(dl, VT, Shift, CmpRHS, Cond);
2453 }
2454 }
Evan Chengf5c05392012-07-17 08:31:11 +0000[diff] [blame]2455 } else if (Cond == ISD::SETULT || Cond == ISD::SETUGE ||
2456 Cond == ISD::SETULE || Cond == ISD::SETUGT) {
2457 bool AdjOne = (Cond == ISD::SETULE || Cond == ISD::SETUGT);
2458 // X < 0x100000000 -> (X >> 32) < 1
2459 // X >= 0x100000000 -> (X >> 32) >= 1
2460 // X <= 0x0ffffffff -> (X >> 32) < 1
2461 // X > 0x0ffffffff -> (X >> 32) >= 1
2462 unsigned ShiftBits;
2463 APInt NewC = C1;
2464 ISD::CondCode NewCond = Cond;
2465 if (AdjOne) {
2466 ShiftBits = C1.countTrailingOnes();
2467 NewC = NewC + 1;
2468 NewCond = (Cond == ISD::SETULE) ? ISD::SETULT : ISD::SETUGE;
2469 } else {
2470 ShiftBits = C1.countTrailingZeros();
2471 }
2472 NewC = NewC.lshr(ShiftBits);
2473 if (ShiftBits && isLegalICmpImmediate(NewC.getSExtValue())) {
Benjamin Kramerb97cebd2012-08-17 15:54:21 +0000[diff] [blame]2474 EVT ShiftTy = DCI.isBeforeLegalizeOps() ?
Evan Chengf5c05392012-07-17 08:31:11 +0000[diff] [blame]2475 getPointerTy() : getShiftAmountTy(N0.getValueType());
2476 EVT CmpTy = N0.getValueType();
2477 SDValue Shift = DAG.getNode(ISD::SRL, dl, CmpTy, N0,
2478 DAG.getConstant(ShiftBits, ShiftTy));
2479 SDValue CmpRHS = DAG.getConstant(NewC, CmpTy);
2480 return DAG.getSetCC(dl, VT, Shift, CmpRHS, NewCond);
2481 }
Evan Cheng70e10d32012-07-17 06:53:39 +0000[diff] [blame]2482 }
2483 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2484 }
2485
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2486 if (isa<ConstantFPSDNode>(N0.getNode())) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2487 // Constant fold or commute setcc.
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2488 SDValue O = DAG.FoldSetCC(VT, N0, N1, Cond, dl);
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2489 if (O.getNode()) return O;
2490 } else if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1.getNode())) {
Chris Lattner63079f02007-12-29 08:37:08 +0000[diff] [blame]2491 // If the RHS of an FP comparison is a constant, simplify it away in
2492 // some cases.
2493 if (CFP->getValueAPF().isNaN()) {
2494 // If an operand is known to be a nan, we can fold it.
2495 switch (ISD::getUnorderedFlavor(Cond)) {
Torok Edwinc23197a2009-07-14 16:55:14 +0000[diff] [blame]2496 default: llvm_unreachable("Unknown flavor!");
Chris Lattner63079f02007-12-29 08:37:08 +0000[diff] [blame]2497 case 0: // Known false.
2498 return DAG.getConstant(0, VT);
2499 case 1: // Known true.
2500 return DAG.getConstant(1, VT);
Chris Lattner1c3e1e22007-12-30 21:21:10 +0000[diff] [blame]2501 case 2: // Undefined.
Dale Johannesene8d72302009-02-06 23:05:02 +0000[diff] [blame]2502 return DAG.getUNDEF(VT);
Chris Lattner63079f02007-12-29 08:37:08 +0000[diff] [blame]2503 }
2504 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2505
Chris Lattner63079f02007-12-29 08:37:08 +0000[diff] [blame]2506 // Otherwise, we know the RHS is not a NaN. Simplify the node to drop the
2507 // constant if knowing that the operand is non-nan is enough. We prefer to
2508 // have SETO(x,x) instead of SETO(x, 0.0) because this avoids having to
2509 // materialize 0.0.
2510 if (Cond == ISD::SETO || Cond == ISD::SETUO)
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2511 return DAG.getSetCC(dl, VT, N0, N0, Cond);
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2512
2513 // If the condition is not legal, see if we can find an equivalent one
2514 // which is legal.
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2515 if (!isCondCodeLegal(Cond, N0.getSimpleValueType())) {
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2516 // If the comparison was an awkward floating-point == or != and one of
2517 // the comparison operands is infinity or negative infinity, convert the
2518 // condition to a less-awkward <= or >=.
2519 if (CFP->getValueAPF().isInfinity()) {
2520 if (CFP->getValueAPF().isNegative()) {
2521 if (Cond == ISD::SETOEQ &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2522 isCondCodeLegal(ISD::SETOLE, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2523 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLE);
2524 if (Cond == ISD::SETUEQ &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2525 isCondCodeLegal(ISD::SETOLE, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2526 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULE);
2527 if (Cond == ISD::SETUNE &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2528 isCondCodeLegal(ISD::SETUGT, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2529 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGT);
2530 if (Cond == ISD::SETONE &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2531 isCondCodeLegal(ISD::SETUGT, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2532 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGT);
2533 } else {
2534 if (Cond == ISD::SETOEQ &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2535 isCondCodeLegal(ISD::SETOGE, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2536 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGE);
2537 if (Cond == ISD::SETUEQ &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2538 isCondCodeLegal(ISD::SETOGE, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2539 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGE);
2540 if (Cond == ISD::SETUNE &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2541 isCondCodeLegal(ISD::SETULT, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2542 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULT);
2543 if (Cond == ISD::SETONE &&
Patrik Hagglundfdbeb052012-12-19 10:19:55 +0000[diff] [blame]2544 isCondCodeLegal(ISD::SETULT, N0.getSimpleValueType()))
Dan Gohman11eab022009-09-26 15:24:17 +0000[diff] [blame]2545 return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLT);
2546 }
2547 }
2548 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2549 }
2550
2551 if (N0 == N1) {
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2552 // The sext(setcc()) => setcc() optimization relies on the appropriate
2553 // constant being emitted.
Nadav Roteme7576402012-09-06 11:13:55 +0000[diff] [blame]2554 uint64_t EqVal = 0;
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2555 switch (getBooleanContents(N0.getValueType().isVector())) {
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2556 case UndefinedBooleanContent:
2557 case ZeroOrOneBooleanContent:
2558 EqVal = ISD::isTrueWhenEqual(Cond);
2559 break;
2560 case ZeroOrNegativeOneBooleanContent:
2561 EqVal = ISD::isTrueWhenEqual(Cond) ? -1 : 0;
2562 break;
2563 }
2564
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2565 // We can always fold X == X for integer setcc's.
Chad Rosier9dbb0182012-04-03 20:11:24 +0000[diff] [blame]2566 if (N0.getValueType().isInteger()) {
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2567 return DAG.getConstant(EqVal, VT);
Chad Rosier9dbb0182012-04-03 20:11:24 +0000[diff] [blame]2568 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2569 unsigned UOF = ISD::getUnorderedFlavor(Cond);
2570 if (UOF == 2) // FP operators that are undefined on NaNs.
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2571 return DAG.getConstant(EqVal, VT);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2572 if (UOF == unsigned(ISD::isTrueWhenEqual(Cond)))
Duncan Sandse7de3b22012-07-05 09:32:46 +0000[diff] [blame]2573 return DAG.getConstant(EqVal, VT);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2574 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO
2575 // if it is not already.
2576 ISD::CondCode NewCond = UOF == 0 ? ISD::SETO : ISD::SETUO;
Micah Villmow8c574be2012-07-31 18:07:43 +0000[diff] [blame]2577 if (NewCond != Cond && (DCI.isBeforeLegalizeOps() ||
Patrik Hagglund9c5ab932012-12-19 10:09:26 +0000[diff] [blame]2578 getCondCodeAction(NewCond, N0.getSimpleValueType()) == Legal))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2579 return DAG.getSetCC(dl, VT, N0, N1, NewCond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2580 }
2581
2582 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]2583 N0.getValueType().isInteger()) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2584 if (N0.getOpcode() == ISD::ADD || N0.getOpcode() == ISD::SUB ||
2585 N0.getOpcode() == ISD::XOR) {
2586 // Simplify (X+Y) == (X+Z) --> Y == Z
2587 if (N0.getOpcode() == N1.getOpcode()) {
2588 if (N0.getOperand(0) == N1.getOperand(0))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2589 return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(1), Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2590 if (N0.getOperand(1) == N1.getOperand(1))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2591 return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(0), Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2592 if (DAG.isCommutativeBinOp(N0.getOpcode())) {
2593 // If X op Y == Y op X, try other combinations.
2594 if (N0.getOperand(0) == N1.getOperand(1))
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2595 return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(0),
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2596 Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2597 if (N0.getOperand(1) == N1.getOperand(0))
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2598 return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(1),
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2599 Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2600 }
2601 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2602
Jakob Stoklund Olesen740cd652012-04-05 20:30:20 +0000[diff] [blame]2603 // If RHS is a legal immediate value for a compare instruction, we need
2604 // to be careful about increasing register pressure needlessly.
2605 bool LegalRHSImm = false;
2606
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2607 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(N1)) {
2608 if (ConstantSDNode *LHSR = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
2609 // Turn (X+C1) == C2 --> X == C2-C1
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2610 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) {
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2611 return DAG.getSetCC(dl, VT, N0.getOperand(0),
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]2612 DAG.getConstant(RHSC->getAPIntValue()-
2613 LHSR->getAPIntValue(),
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2614 N0.getValueType()), Cond);
2615 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2616
Sylvestre Ledru94c22712012-09-27 10:14:43 +0000[diff] [blame]2617 // Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0.
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2618 if (N0.getOpcode() == ISD::XOR)
2619 // If we know that all of the inverted bits are zero, don't bother
2620 // performing the inversion.
Dan Gohman2e68b6f2008-02-25 21:11:39 +0000[diff] [blame]2621 if (DAG.MaskedValueIsZero(N0.getOperand(0), ~LHSR->getAPIntValue()))
2622 return
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2623 DAG.getSetCC(dl, VT, N0.getOperand(0),
Dan Gohman2e68b6f2008-02-25 21:11:39 +0000[diff] [blame]2624 DAG.getConstant(LHSR->getAPIntValue() ^
2625 RHSC->getAPIntValue(),
2626 N0.getValueType()),
2627 Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2628 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2629
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2630 // Turn (C1-X) == C2 --> X == C1-C2
2631 if (ConstantSDNode *SUBC = dyn_cast<ConstantSDNode>(N0.getOperand(0))) {
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2632 if (N0.getOpcode() == ISD::SUB && N0.getNode()->hasOneUse()) {
Dan Gohman2e68b6f2008-02-25 21:11:39 +0000[diff] [blame]2633 return
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2634 DAG.getSetCC(dl, VT, N0.getOperand(1),
Dan Gohman2e68b6f2008-02-25 21:11:39 +0000[diff] [blame]2635 DAG.getConstant(SUBC->getAPIntValue() -
2636 RHSC->getAPIntValue(),
2637 N0.getValueType()),
2638 Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2639 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2640 }
Jakob Stoklund Olesen740cd652012-04-05 20:30:20 +0000[diff] [blame]2641
2642 // Could RHSC fold directly into a compare?
2643 if (RHSC->getValueType(0).getSizeInBits() <= 64)
2644 LegalRHSImm = isLegalICmpImmediate(RHSC->getSExtValue());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2645 }
2646
2647 // Simplify (X+Z) == X --> Z == 0
Jakob Stoklund Olesen740cd652012-04-05 20:30:20 +0000[diff] [blame]2648 // Don't do this if X is an immediate that can fold into a cmp
2649 // instruction and X+Z has other uses. It could be an induction variable
2650 // chain, and the transform would increase register pressure.
2651 if (!LegalRHSImm || N0.getNode()->hasOneUse()) {
2652 if (N0.getOperand(0) == N1)
2653 return DAG.getSetCC(dl, VT, N0.getOperand(1),
2654 DAG.getConstant(0, N0.getValueType()), Cond);
2655 if (N0.getOperand(1) == N1) {
2656 if (DAG.isCommutativeBinOp(N0.getOpcode()))
2657 return DAG.getSetCC(dl, VT, N0.getOperand(0),
2658 DAG.getConstant(0, N0.getValueType()), Cond);
Craig Topper85022562012-12-19 06:43:58 +0000[diff] [blame]2659 if (N0.getNode()->hasOneUse()) {
Jakob Stoklund Olesen740cd652012-04-05 20:30:20 +0000[diff] [blame]2660 assert(N0.getOpcode() == ISD::SUB && "Unexpected operation!");
2661 // (Z-X) == X --> Z == X<<1
2662 SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(), N1,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]2663 DAG.getConstant(1, getShiftAmountTy(N1.getValueType())));
Jakob Stoklund Olesen740cd652012-04-05 20:30:20 +0000[diff] [blame]2664 if (!DCI.isCalledByLegalizer())
2665 DCI.AddToWorklist(SH.getNode());
2666 return DAG.getSetCC(dl, VT, N0.getOperand(0), SH, Cond);
2667 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2668 }
2669 }
2670 }
2671
2672 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB ||
2673 N1.getOpcode() == ISD::XOR) {
2674 // Simplify X == (X+Z) --> Z == 0
Craig Topper85022562012-12-19 06:43:58 +0000[diff] [blame]2675 if (N1.getOperand(0) == N0)
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2676 return DAG.getSetCC(dl, VT, N1.getOperand(1),
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2677 DAG.getConstant(0, N1.getValueType()), Cond);
Craig Topper85022562012-12-19 06:43:58 +0000[diff] [blame]2678 if (N1.getOperand(1) == N0) {
2679 if (DAG.isCommutativeBinOp(N1.getOpcode()))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2680 return DAG.getSetCC(dl, VT, N1.getOperand(0),
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2681 DAG.getConstant(0, N1.getValueType()), Cond);
Craig Topper85022562012-12-19 06:43:58 +0000[diff] [blame]2682 if (N1.getNode()->hasOneUse()) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2683 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!");
2684 // X == (Z-X) --> X<<1 == Z
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2685 SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(), N0,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]2686 DAG.getConstant(1, getShiftAmountTy(N0.getValueType())));
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2687 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2688 DCI.AddToWorklist(SH.getNode());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2689 return DAG.getSetCC(dl, VT, SH, N1.getOperand(0), Cond);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2690 }
2691 }
2692 }
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2693
Dan Gohman2c65c3d2009-01-29 16:18:12 +0000[diff] [blame]2694 // Simplify x&y == y to x&y != 0 if y has exactly one bit set.
Dale Johannesen85b0ede2009-02-11 19:19:41 +0000[diff] [blame]2695 // Note that where y is variable and is known to have at most
2696 // one bit set (for example, if it is z&1) we cannot do this;
2697 // the expressions are not equivalent when y==0.
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2698 if (N0.getOpcode() == ISD::AND)
2699 if (N0.getOperand(0) == N1 || N0.getOperand(1) == N1) {
Dale Johannesen85b0ede2009-02-11 19:19:41 +0000[diff] [blame]2700 if (ValueHasExactlyOneBitSet(N1, DAG)) {
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2701 Cond = ISD::getSetCCInverse(Cond, /*isInteger=*/true);
2702 SDValue Zero = DAG.getConstant(0, N1.getValueType());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2703 return DAG.getSetCC(dl, VT, N0, Zero, Cond);
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2704 }
2705 }
2706 if (N1.getOpcode() == ISD::AND)
2707 if (N1.getOperand(0) == N0 || N1.getOperand(1) == N0) {
Dale Johannesen85b0ede2009-02-11 19:19:41 +0000[diff] [blame]2708 if (ValueHasExactlyOneBitSet(N0, DAG)) {
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2709 Cond = ISD::getSetCCInverse(Cond, /*isInteger=*/true);
2710 SDValue Zero = DAG.getConstant(0, N0.getValueType());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2711 return DAG.getSetCC(dl, VT, N1, Zero, Cond);
Dan Gohmane5af2d32009-01-29 01:59:02 +0000[diff] [blame]2712 }
2713 }
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2714 }
2715
2716 // Fold away ALL boolean setcc's.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2717 SDValue Temp;
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2718 if (N0.getValueType() == MVT::i1 && foldBooleans) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2719 switch (Cond) {
Torok Edwinc23197a2009-07-14 16:55:14 +0000[diff] [blame]2720 default: llvm_unreachable("Unknown integer setcc!");
Bob Wilson4c245462009-01-22 17:39:32 +0000[diff] [blame]2721 case ISD::SETEQ: // X == Y -> ~(X^Y)
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2722 Temp = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
2723 N0 = DAG.getNOT(dl, Temp, MVT::i1);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2724 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2725 DCI.AddToWorklist(Temp.getNode());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2726 break;
2727 case ISD::SETNE: // X != Y --> (X^Y)
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2728 N0 = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2729 break;
Bob Wilson4c245462009-01-22 17:39:32 +0000[diff] [blame]2730 case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> ~X & Y
2731 case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> ~X & Y
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2732 Temp = DAG.getNOT(dl, N0, MVT::i1);
2733 N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N1, Temp);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2734 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2735 DCI.AddToWorklist(Temp.getNode());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2736 break;
Bob Wilson4c245462009-01-22 17:39:32 +0000[diff] [blame]2737 case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> ~Y & X
2738 case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> ~Y & X
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2739 Temp = DAG.getNOT(dl, N1, MVT::i1);
2740 N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N0, Temp);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2741 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2742 DCI.AddToWorklist(Temp.getNode());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2743 break;
Bob Wilson4c245462009-01-22 17:39:32 +0000[diff] [blame]2744 case ISD::SETULE: // X <=u Y --> X == 0 | Y == 1 --> ~X | Y
2745 case ISD::SETGE: // X >=s Y --> X == 0 | Y == 1 --> ~X | Y
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2746 Temp = DAG.getNOT(dl, N0, MVT::i1);
2747 N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N1, Temp);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2748 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2749 DCI.AddToWorklist(Temp.getNode());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2750 break;
Bob Wilson4c245462009-01-22 17:39:32 +0000[diff] [blame]2751 case ISD::SETUGE: // X >=u Y --> X == 1 | Y == 0 --> ~Y | X
2752 case ISD::SETLE: // X <=s Y --> X == 1 | Y == 0 --> ~Y | X
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2753 Temp = DAG.getNOT(dl, N1, MVT::i1);
2754 N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N0, Temp);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2755 break;
2756 }
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2757 if (VT != MVT::i1) {
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2758 if (!DCI.isCalledByLegalizer())
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2759 DCI.AddToWorklist(N0.getNode());
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2760 // FIXME: If running after legalize, we probably can't do this.
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]2761 N0 = DAG.getNode(ISD::ZERO_EXTEND, dl, VT, N0);
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2762 }
2763 return N0;
2764 }
2765
2766 // Could not fold it.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2767 return SDValue();
Evan Chengfa1eb272007-02-08 22:13:59 +0000[diff] [blame]2768}
2769
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2770/// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
2771/// node is a GlobalAddress + offset.
Chris Lattner0a9481f2011-02-13 22:25:43 +0000[diff] [blame]2772bool TargetLowering::isGAPlusOffset(SDNode *N, const GlobalValue *&GA,
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2773 int64_t &Offset) const {
2774 if (isa<GlobalAddressSDNode>(N)) {
Dan Gohman9ea3f562008-06-09 22:05:52 +0000[diff] [blame]2775 GlobalAddressSDNode *GASD = cast<GlobalAddressSDNode>(N);
2776 GA = GASD->getGlobal();
2777 Offset += GASD->getOffset();
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2778 return true;
2779 }
2780
2781 if (N->getOpcode() == ISD::ADD) {
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2782 SDValue N1 = N->getOperand(0);
2783 SDValue N2 = N->getOperand(1);
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2784 if (isGAPlusOffset(N1.getNode(), GA, Offset)) {
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2785 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N2);
2786 if (V) {
Dan Gohman7810bfe2008-09-26 21:54:37 +0000[diff] [blame]2787 Offset += V->getSExtValue();
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2788 return true;
2789 }
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]2790 } else if (isGAPlusOffset(N2.getNode(), GA, Offset)) {
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2791 ConstantSDNode *V = dyn_cast<ConstantSDNode>(N1);
2792 if (V) {
Dan Gohman7810bfe2008-09-26 21:54:37 +0000[diff] [blame]2793 Offset += V->getSExtValue();
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2794 return true;
2795 }
2796 }
2797 }
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]2798
Evan Chengad4196b2008-05-12 19:56:52 +0000[diff] [blame]2799 return false;
2800}
2801
2802
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2803SDValue TargetLowering::
Chris Lattner00ffed02006-03-01 04:52:55 +0000[diff] [blame]2804PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const {
2805 // Default implementation: no optimization.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2806 return SDValue();
Chris Lattner00ffed02006-03-01 04:52:55 +0000[diff] [blame]2807}
2808
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2809//===----------------------------------------------------------------------===//
2810// Inline Assembler Implementation Methods
2811//===----------------------------------------------------------------------===//
2812
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]2813
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2814TargetLowering::ConstraintType
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2815TargetLowering::getConstraintType(const std::string &Constraint) const {
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2816 if (Constraint.size() == 1) {
2817 switch (Constraint[0]) {
2818 default: break;
2819 case 'r': return C_RegisterClass;
2820 case 'm': // memory
2821 case 'o': // offsetable
2822 case 'V': // not offsetable
2823 return C_Memory;
2824 case 'i': // Simple Integer or Relocatable Constant
2825 case 'n': // Simple Integer
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]2826 case 'E': // Floating Point Constant
2827 case 'F': // Floating Point Constant
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2828 case 's': // Relocatable Constant
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]2829 case 'p': // Address.
Chris Lattnerc13dd1c2007-03-25 04:35:41 +0000[diff] [blame]2830 case 'X': // Allow ANY value.
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2831 case 'I': // Target registers.
2832 case 'J':
2833 case 'K':
2834 case 'L':
2835 case 'M':
2836 case 'N':
2837 case 'O':
2838 case 'P':
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]2839 case '<':
2840 case '>':
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2841 return C_Other;
2842 }
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2843 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2844
2845 if (Constraint.size() > 1 && Constraint[0] == '{' &&
Chris Lattner065421f2007-03-25 02:18:14 +0000[diff] [blame]2846 Constraint[Constraint.size()-1] == '}')
2847 return C_Register;
Chris Lattner4234f572007-03-25 02:14:49 +0000[diff] [blame]2848 return C_Unknown;
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2849}
2850
Dale Johannesenba2a0b92008-01-29 02:21:21 +0000[diff] [blame]2851/// LowerXConstraint - try to replace an X constraint, which matches anything,
2852/// with another that has more specific requirements based on the type of the
2853/// corresponding operand.
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2854const char *TargetLowering::LowerXConstraint(EVT ConstraintVT) const{
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]2855 if (ConstraintVT.isInteger())
Chris Lattner5e764232008-04-26 23:02:14 +0000[diff] [blame]2856 return "r";
Duncan Sands83ec4b62008-06-06 12:08:01 +0000[diff] [blame]2857 if (ConstraintVT.isFloatingPoint())
Chris Lattner5e764232008-04-26 23:02:14 +0000[diff] [blame]2858 return "f"; // works for many targets
2859 return 0;
Dale Johannesenba2a0b92008-01-29 02:21:21 +0000[diff] [blame]2860}
2861
Chris Lattner48884cd2007-08-25 00:47:38 +0000[diff] [blame]2862/// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
2863/// vector. If it is invalid, don't add anything to Ops.
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2864void TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
Eric Christopher100c8332011-06-02 23:16:42 +0000[diff] [blame]2865 std::string &Constraint,
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]2866 std::vector<SDValue> &Ops,
Chris Lattner5e764232008-04-26 23:02:14 +0000[diff] [blame]2867 SelectionDAG &DAG) const {
Eric Christopher362fee92011-06-17 20:41:29 +0000[diff] [blame]2868
Eric Christopher100c8332011-06-02 23:16:42 +0000[diff] [blame]2869 if (Constraint.length() > 1) return;
Eric Christopher362fee92011-06-17 20:41:29 +0000[diff] [blame]2870
Eric Christopher100c8332011-06-02 23:16:42 +0000[diff] [blame]2871 char ConstraintLetter = Constraint[0];
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2872 switch (ConstraintLetter) {
Chris Lattner9ff6ee82007-02-17 06:00:35 +0000[diff] [blame]2873 default: break;
Dale Johanneseneb57ea72007-11-05 21:20:28 +0000[diff] [blame]2874 case 'X': // Allows any operand; labels (basic block) use this.
2875 if (Op.getOpcode() == ISD::BasicBlock) {
2876 Ops.push_back(Op);
2877 return;
2878 }
2879 // fall through
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2880 case 'i': // Simple Integer or Relocatable Constant
2881 case 'n': // Simple Integer
Dale Johanneseneb57ea72007-11-05 21:20:28 +0000[diff] [blame]2882 case 's': { // Relocatable Constant
Chris Lattner75c7d2b2007-05-03 16:54:34 +0000[diff] [blame]2883 // These operands are interested in values of the form (GV+C), where C may
2884 // be folded in as an offset of GV, or it may be explicitly added. Also, it
2885 // is possible and fine if either GV or C are missing.
2886 ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
2887 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2888
Chris Lattner75c7d2b2007-05-03 16:54:34 +0000[diff] [blame]2889 // If we have "(add GV, C)", pull out GV/C
2890 if (Op.getOpcode() == ISD::ADD) {
2891 C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
2892 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(0));
2893 if (C == 0 || GA == 0) {
2894 C = dyn_cast<ConstantSDNode>(Op.getOperand(0));
2895 GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(1));
2896 }
2897 if (C == 0 || GA == 0)
2898 C = 0, GA = 0;
2899 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2900
Chris Lattner75c7d2b2007-05-03 16:54:34 +0000[diff] [blame]2901 // If we find a valid operand, map to the TargetXXX version so that the
2902 // value itself doesn't get selected.
2903 if (GA) { // Either &GV or &GV+C
2904 if (ConstraintLetter != 'n') {
2905 int64_t Offs = GA->getOffset();
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +0000[diff] [blame]2906 if (C) Offs += C->getZExtValue();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2907 Ops.push_back(DAG.getTargetGlobalAddress(GA->getGlobal(),
Devang Patel07538ad2010-07-15 18:45:27 +0000[diff] [blame]2908 C ? C->getDebugLoc() : DebugLoc(),
Chris Lattner48884cd2007-08-25 00:47:38 +0000[diff] [blame]2909 Op.getValueType(), Offs));
2910 return;
Chris Lattner75c7d2b2007-05-03 16:54:34 +0000[diff] [blame]2911 }
2912 }
2913 if (C) { // just C, no GV.
Chris Lattner9ff6ee82007-02-17 06:00:35 +0000[diff] [blame]2914 // Simple constants are not allowed for 's'.
Chris Lattner48884cd2007-08-25 00:47:38 +0000[diff] [blame]2915 if (ConstraintLetter != 's') {
Dale Johannesen78e3e522009-02-12 20:58:09 +0000[diff] [blame]2916 // gcc prints these as sign extended. Sign extend value to 64 bits
2917 // now; without this it would get ZExt'd later in
2918 // ScheduleDAGSDNodes::EmitNode, which is very generic.
2919 Ops.push_back(DAG.getTargetConstant(C->getAPIntValue().getSExtValue(),
Owen Anderson825b72b2009-08-11 20:47:22 +0000[diff] [blame]2920 MVT::i64));
Chris Lattner48884cd2007-08-25 00:47:38 +0000[diff] [blame]2921 return;
2922 }
Chris Lattner9ff6ee82007-02-17 06:00:35 +0000[diff] [blame]2923 }
Chris Lattner9ff6ee82007-02-17 06:00:35 +0000[diff] [blame]2924 break;
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2925 }
Chris Lattner75c7d2b2007-05-03 16:54:34 +0000[diff] [blame]2926 }
Chris Lattnereb8146b2006-02-04 02:13:02 +0000[diff] [blame]2927}
2928
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2929std::pair<unsigned, const TargetRegisterClass*> TargetLowering::
Chris Lattner4217ca8dc2006-02-21 23:11:00 +0000[diff] [blame]2930getRegForInlineAsmConstraint(const std::string &Constraint,
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]2931 EVT VT) const {
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2932 if (Constraint[0] != '{')
Douglas Gregor7d9663c2010-05-11 06:17:44 +0000[diff] [blame]2933 return std::make_pair(0u, static_cast<TargetRegisterClass*>(0));
Chris Lattnera55079a2006-02-01 01:29:47 +0000[diff] [blame]2934 assert(*(Constraint.end()-1) == '}' && "Not a brace enclosed constraint?");
2935
2936 // Remove the braces from around the name.
Benjamin Kramer05872ea2009-11-12 20:36:59 +0000[diff] [blame]2937 StringRef RegName(Constraint.data()+1, Constraint.size()-2);
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2938
Hal Finkelca2dd362012-12-18 17:50:58 +0000[diff] [blame]2939 std::pair<unsigned, const TargetRegisterClass*> R =
2940 std::make_pair(0u, static_cast<const TargetRegisterClass*>(0));
2941
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2942 // Figure out which register class contains this reg.
Dan Gohman6f0d0242008-02-10 18:45:23 +0000[diff] [blame]2943 const TargetRegisterInfo *RI = TM.getRegisterInfo();
2944 for (TargetRegisterInfo::regclass_iterator RCI = RI->regclass_begin(),
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2945 E = RI->regclass_end(); RCI != E; ++RCI) {
2946 const TargetRegisterClass *RC = *RCI;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2947
2948 // If none of the value types for this register class are valid, we
Chris Lattnerb3befd42006-02-22 23:00:51 +0000[diff] [blame]2949 // can't use it. For example, 64-bit reg classes on 32-bit targets.
Jakob Stoklund Olesen22e8a362011-10-12 01:24:51 +0000[diff] [blame]2950 if (!isLegalRC(RC))
2951 continue;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2952
2953 for (TargetRegisterClass::iterator I = RC->begin(), E = RC->end();
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2954 I != E; ++I) {
Hal Finkelca2dd362012-12-18 17:50:58 +0000[diff] [blame]2955 if (RegName.equals_lower(RI->getName(*I))) {
2956 std::pair<unsigned, const TargetRegisterClass*> S =
2957 std::make_pair(*I, RC);
2958
2959 // If this register class has the requested value type, return it,
2960 // otherwise keep searching and return the first class found
2961 // if no other is found which explicitly has the requested type.
2962 if (RC->hasType(VT))
2963 return S;
2964 else if (!R.second)
2965 R = S;
2966 }
Chris Lattner1efa40f2006-02-22 00:56:39 +0000[diff] [blame]2967 }
Chris Lattner4ccb0702006-01-26 20:37:03 +0000[diff] [blame]2968 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2969
Hal Finkelca2dd362012-12-18 17:50:58 +0000[diff] [blame]2970 return R;
Chris Lattner4ccb0702006-01-26 20:37:03 +0000[diff] [blame]2971}
Evan Cheng30b37b52006-03-13 23:18:16 +0000[diff] [blame]2972
2973//===----------------------------------------------------------------------===//
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]2974// Constraint Selection.
2975
Chris Lattner6bdcda32008-10-17 16:47:46 +0000[diff] [blame]2976/// isMatchingInputConstraint - Return true of this is an input operand that is
2977/// a matching constraint like "4".
2978bool TargetLowering::AsmOperandInfo::isMatchingInputConstraint() const {
Chris Lattner58f15c42008-10-17 16:21:11 +0000[diff] [blame]2979 assert(!ConstraintCode.empty() && "No known constraint!");
2980 return isdigit(ConstraintCode[0]);
2981}
2982
2983/// getMatchedOperand - If this is an input matching constraint, this method
2984/// returns the output operand it matches.
2985unsigned TargetLowering::AsmOperandInfo::getMatchedOperand() const {
2986 assert(!ConstraintCode.empty() && "No known constraint!");
2987 return atoi(ConstraintCode.c_str());
2988}
2989
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]2990
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]2991/// ParseConstraints - Split up the constraint string from the inline
2992/// assembly value into the specific constraints and their prefixes,
2993/// and also tie in the associated operand values.
2994/// If this returns an empty vector, and if the constraint string itself
2995/// isn't empty, there was an error parsing.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]2996TargetLowering::AsmOperandInfoVector TargetLowering::ParseConstraints(
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]2997 ImmutableCallSite CS) const {
2998 /// ConstraintOperands - Information about all of the constraints.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]2999 AsmOperandInfoVector ConstraintOperands;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3000 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]3001 unsigned maCount = 0; // Largest number of multiple alternative constraints.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3002
3003 // Do a prepass over the constraints, canonicalizing them, and building up the
3004 // ConstraintOperands list.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3005 InlineAsm::ConstraintInfoVector
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3006 ConstraintInfos = IA->ParseConstraints();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3007
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3008 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
3009 unsigned ResNo = 0; // ResNo - The result number of the next output.
3010
3011 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
3012 ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i]));
3013 AsmOperandInfo &OpInfo = ConstraintOperands.back();
3014
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]3015 // Update multiple alternative constraint count.
3016 if (OpInfo.multipleAlternatives.size() > maCount)
3017 maCount = OpInfo.multipleAlternatives.size();
3018
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3019 OpInfo.ConstraintVT = MVT::Other;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3020
3021 // Compute the value type for each operand.
3022 switch (OpInfo.Type) {
3023 case InlineAsm::isOutput:
3024 // Indirect outputs just consume an argument.
3025 if (OpInfo.isIndirect) {
3026 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
3027 break;
3028 }
3029
3030 // The return value of the call is this value. As such, there is no
3031 // corresponding argument.
3032 assert(!CS.getType()->isVoidTy() &&
3033 "Bad inline asm!");
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]3034 if (StructType *STy = dyn_cast<StructType>(CS.getType())) {
Patrik Hagglundc698d3a2012-12-19 15:19:11 +0000[diff] [blame]3035 OpInfo.ConstraintVT = getSimpleValueType(STy->getElementType(ResNo));
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3036 } else {
3037 assert(ResNo == 0 && "Asm only has one result!");
Patrik Hagglundc698d3a2012-12-19 15:19:11 +0000[diff] [blame]3038 OpInfo.ConstraintVT = getSimpleValueType(CS.getType());
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3039 }
3040 ++ResNo;
3041 break;
3042 case InlineAsm::isInput:
3043 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
3044 break;
3045 case InlineAsm::isClobber:
3046 // Nothing to do.
3047 break;
3048 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3049
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3050 if (OpInfo.CallOperandVal) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]3051 llvm::Type *OpTy = OpInfo.CallOperandVal->getType();
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3052 if (OpInfo.isIndirect) {
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]3053 llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3054 if (!PtrTy)
3055 report_fatal_error("Indirect operand for inline asm not a pointer!");
3056 OpTy = PtrTy->getElementType();
3057 }
Eric Christopher362fee92011-06-17 20:41:29 +0000[diff] [blame]3058
Eric Christophercef81b72011-05-09 20:04:43 +0000[diff] [blame]3059 // Look for vector wrapped in a struct. e.g. { <16 x i8> }.
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]3060 if (StructType *STy = dyn_cast<StructType>(OpTy))
Eric Christophercef81b72011-05-09 20:04:43 +0000[diff] [blame]3061 if (STy->getNumElements() == 1)
3062 OpTy = STy->getElementType(0);
3063
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3064 // If OpTy is not a single value, it may be a struct/union that we
3065 // can tile with integers.
3066 if (!OpTy->isSingleValueType() && OpTy->isSized()) {
3067 unsigned BitSize = TD->getTypeSizeInBits(OpTy);
3068 switch (BitSize) {
3069 default: break;
3070 case 1:
3071 case 8:
3072 case 16:
3073 case 32:
3074 case 64:
3075 case 128:
Dale Johannesen71365d32010-11-09 01:15:07 +0000[diff] [blame]3076 OpInfo.ConstraintVT =
Patrik Hagglundc698d3a2012-12-19 15:19:11 +0000[diff] [blame]3077 MVT::getVT(IntegerType::get(OpTy->getContext(), BitSize), true);
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3078 break;
3079 }
Micah Villmow7d661462012-10-09 16:06:12 +0000[diff] [blame]3080 } else if (PointerType *PT = dyn_cast<PointerType>(OpTy)) {
3081 OpInfo.ConstraintVT = MVT::getIntegerVT(
3082 8*TD->getPointerSize(PT->getAddressSpace()));
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3083 } else {
Patrik Hagglundc698d3a2012-12-19 15:19:11 +0000[diff] [blame]3084 OpInfo.ConstraintVT = MVT::getVT(OpTy, true);
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3085 }
3086 }
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3087 }
3088
3089 // If we have multiple alternative constraints, select the best alternative.
3090 if (ConstraintInfos.size()) {
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3091 if (maCount) {
3092 unsigned bestMAIndex = 0;
3093 int bestWeight = -1;
3094 // weight: -1 = invalid match, and 0 = so-so match to 5 = good match.
3095 int weight = -1;
3096 unsigned maIndex;
3097 // Compute the sums of the weights for each alternative, keeping track
3098 // of the best (highest weight) one so far.
3099 for (maIndex = 0; maIndex < maCount; ++maIndex) {
3100 int weightSum = 0;
3101 for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
3102 cIndex != eIndex; ++cIndex) {
3103 AsmOperandInfo& OpInfo = ConstraintOperands[cIndex];
3104 if (OpInfo.Type == InlineAsm::isClobber)
3105 continue;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3106
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3107 // If this is an output operand with a matching input operand,
3108 // look up the matching input. If their types mismatch, e.g. one
3109 // is an integer, the other is floating point, or their sizes are
3110 // different, flag it as an maCantMatch.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3111 if (OpInfo.hasMatchingInput()) {
3112 AsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3113 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
3114 if ((OpInfo.ConstraintVT.isInteger() !=
3115 Input.ConstraintVT.isInteger()) ||
3116 (OpInfo.ConstraintVT.getSizeInBits() !=
3117 Input.ConstraintVT.getSizeInBits())) {
3118 weightSum = -1; // Can't match.
3119 break;
3120 }
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3121 }
3122 }
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3123 weight = getMultipleConstraintMatchWeight(OpInfo, maIndex);
3124 if (weight == -1) {
3125 weightSum = -1;
3126 break;
3127 }
3128 weightSum += weight;
3129 }
3130 // Update best.
3131 if (weightSum > bestWeight) {
3132 bestWeight = weightSum;
3133 bestMAIndex = maIndex;
3134 }
3135 }
3136
3137 // Now select chosen alternative in each constraint.
3138 for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
3139 cIndex != eIndex; ++cIndex) {
3140 AsmOperandInfo& cInfo = ConstraintOperands[cIndex];
3141 if (cInfo.Type == InlineAsm::isClobber)
3142 continue;
3143 cInfo.selectAlternative(bestMAIndex);
3144 }
3145 }
3146 }
3147
3148 // Check and hook up tied operands, choose constraint code to use.
3149 for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
3150 cIndex != eIndex; ++cIndex) {
3151 AsmOperandInfo& OpInfo = ConstraintOperands[cIndex];
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3152
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3153 // If this is an output operand with a matching input operand, look up the
3154 // matching input. If their types mismatch, e.g. one is an integer, the
3155 // other is floating point, or their sizes are different, flag it as an
3156 // error.
3157 if (OpInfo.hasMatchingInput()) {
3158 AsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3159
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3160 if (OpInfo.ConstraintVT != Input.ConstraintVT) {
Bill Wendling96cb1122012-07-19 00:04:14 +0000[diff] [blame]3161 std::pair<unsigned, const TargetRegisterClass*> MatchRC =
3162 getRegForInlineAsmConstraint(OpInfo.ConstraintCode,
3163 OpInfo.ConstraintVT);
3164 std::pair<unsigned, const TargetRegisterClass*> InputRC =
3165 getRegForInlineAsmConstraint(Input.ConstraintCode,
3166 Input.ConstraintVT);
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3167 if ((OpInfo.ConstraintVT.isInteger() !=
3168 Input.ConstraintVT.isInteger()) ||
Eric Christopher5427ede2011-07-14 20:13:52 +0000[diff] [blame]3169 (MatchRC.second != InputRC.second)) {
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3170 report_fatal_error("Unsupported asm: input constraint"
3171 " with a matching output constraint of"
3172 " incompatible type!");
3173 }
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3174 }
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3175
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3176 }
3177 }
3178
3179 return ConstraintOperands;
3180}
3181
Chris Lattner58f15c42008-10-17 16:21:11 +0000[diff] [blame]3182
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3183/// getConstraintGenerality - Return an integer indicating how general CT
3184/// is.
3185static unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
3186 switch (CT) {
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3187 case TargetLowering::C_Other:
3188 case TargetLowering::C_Unknown:
3189 return 0;
3190 case TargetLowering::C_Register:
3191 return 1;
3192 case TargetLowering::C_RegisterClass:
3193 return 2;
3194 case TargetLowering::C_Memory:
3195 return 3;
3196 }
Chandler Carruth732f05c2012-01-10 18:08:01 +0000[diff] [blame]3197 llvm_unreachable("Invalid constraint type");
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3198}
3199
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3200/// Examine constraint type and operand type and determine a weight value.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3201/// This object must already have been set up with the operand type
3202/// and the current alternative constraint selected.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3203TargetLowering::ConstraintWeight
3204 TargetLowering::getMultipleConstraintMatchWeight(
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3205 AsmOperandInfo &info, int maIndex) const {
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3206 InlineAsm::ConstraintCodeVector *rCodes;
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]3207 if (maIndex >= (int)info.multipleAlternatives.size())
3208 rCodes = &info.Codes;
3209 else
3210 rCodes = &info.multipleAlternatives[maIndex].Codes;
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3211 ConstraintWeight BestWeight = CW_Invalid;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3212
3213 // Loop over the options, keeping track of the most general one.
John Thompson67aff162010-09-21 22:04:54 +0000[diff] [blame]3214 for (unsigned i = 0, e = rCodes->size(); i != e; ++i) {
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3215 ConstraintWeight weight =
3216 getSingleConstraintMatchWeight(info, (*rCodes)[i].c_str());
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3217 if (weight > BestWeight)
3218 BestWeight = weight;
3219 }
3220
3221 return BestWeight;
3222}
3223
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3224/// Examine constraint type and operand type and determine a weight value.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3225/// This object must already have been set up with the operand type
3226/// and the current alternative constraint selected.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3227TargetLowering::ConstraintWeight
3228 TargetLowering::getSingleConstraintMatchWeight(
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3229 AsmOperandInfo &info, const char *constraint) const {
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3230 ConstraintWeight weight = CW_Invalid;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3231 Value *CallOperandVal = info.CallOperandVal;
3232 // If we don't have a value, we can't do a match,
3233 // but allow it at the lowest weight.
3234 if (CallOperandVal == NULL)
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3235 return CW_Default;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3236 // Look at the constraint type.
3237 switch (*constraint) {
3238 case 'i': // immediate integer.
3239 case 'n': // immediate integer with a known value.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3240 if (isa<ConstantInt>(CallOperandVal))
3241 weight = CW_Constant;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3242 break;
3243 case 's': // non-explicit intregal immediate.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3244 if (isa<GlobalValue>(CallOperandVal))
3245 weight = CW_Constant;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3246 break;
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3247 case 'E': // immediate float if host format.
3248 case 'F': // immediate float.
3249 if (isa<ConstantFP>(CallOperandVal))
3250 weight = CW_Constant;
3251 break;
3252 case '<': // memory operand with autodecrement.
3253 case '>': // memory operand with autoincrement.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3254 case 'm': // memory operand.
3255 case 'o': // offsettable memory operand
3256 case 'V': // non-offsettable memory operand
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3257 weight = CW_Memory;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3258 break;
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3259 case 'r': // general register.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3260 case 'g': // general register, memory operand or immediate integer.
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3261 // note: Clang converts "g" to "imr".
3262 if (CallOperandVal->getType()->isIntegerTy())
3263 weight = CW_Register;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3264 break;
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3265 case 'X': // any operand.
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3266 default:
John Thompson44ab89e2010-10-29 17:29:13 +0000[diff] [blame]3267 weight = CW_Default;
John Thompsoneac6e1d2010-09-13 18:15:37 +0000[diff] [blame]3268 break;
3269 }
3270 return weight;
3271}
3272
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3273/// ChooseConstraint - If there are multiple different constraints that we
3274/// could pick for this operand (e.g. "imr") try to pick the 'best' one.
Chris Lattner24e1a9d2008-04-27 01:49:46 +0000[diff] [blame]3275/// This is somewhat tricky: constraints fall into four classes:
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3276/// Other -> immediates and magic values
3277/// Register -> one specific register
3278/// RegisterClass -> a group of regs
3279/// Memory -> memory
3280/// Ideally, we would pick the most specific constraint possible: if we have
3281/// something that fits into a register, we would pick it. The problem here
3282/// is that if we have something that could either be in a register or in
3283/// memory that use of the register could cause selection of *other*
3284/// operands to fail: they might only succeed if we pick memory. Because of
3285/// this the heuristic we use is:
3286///
3287/// 1) If there is an 'other' constraint, and if the operand is valid for
3288/// that constraint, use it. This makes us take advantage of 'i'
3289/// constraints when available.
3290/// 2) Otherwise, pick the most general constraint present. This prefers
3291/// 'm' over 'r', for example.
3292///
3293static void ChooseConstraint(TargetLowering::AsmOperandInfo &OpInfo,
Dale Johannesen1784d162010-06-25 21:55:36 +0000[diff] [blame]3294 const TargetLowering &TLI,
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3295 SDValue Op, SelectionDAG *DAG) {
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3296 assert(OpInfo.Codes.size() > 1 && "Doesn't have multiple constraint options");
3297 unsigned BestIdx = 0;
3298 TargetLowering::ConstraintType BestType = TargetLowering::C_Unknown;
3299 int BestGenerality = -1;
Dale Johannesena5989f82010-06-28 22:09:45 +0000[diff] [blame]3300
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3301 // Loop over the options, keeping track of the most general one.
3302 for (unsigned i = 0, e = OpInfo.Codes.size(); i != e; ++i) {
3303 TargetLowering::ConstraintType CType =
3304 TLI.getConstraintType(OpInfo.Codes[i]);
Dale Johannesena5989f82010-06-28 22:09:45 +0000[diff] [blame]3305
Chris Lattner5a096902008-04-27 00:37:18 +0000[diff] [blame]3306 // If this is an 'other' constraint, see if the operand is valid for it.
3307 // For example, on X86 we might have an 'rI' constraint. If the operand
3308 // is an integer in the range [0..31] we want to use I (saving a load
3309 // of a register), otherwise we must use 'r'.
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3310 if (CType == TargetLowering::C_Other && Op.getNode()) {
Chris Lattner5a096902008-04-27 00:37:18 +0000[diff] [blame]3311 assert(OpInfo.Codes[i].size() == 1 &&
3312 "Unhandled multi-letter 'other' constraint");
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3313 std::vector<SDValue> ResultOps;
Eric Christopher100c8332011-06-02 23:16:42 +0000[diff] [blame]3314 TLI.LowerAsmOperandForConstraint(Op, OpInfo.Codes[i],
Chris Lattner5a096902008-04-27 00:37:18 +0000[diff] [blame]3315 ResultOps, *DAG);
3316 if (!ResultOps.empty()) {
3317 BestType = CType;
3318 BestIdx = i;
3319 break;
3320 }
3321 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3322
Dale Johannesena5989f82010-06-28 22:09:45 +0000[diff] [blame]3323 // Things with matching constraints can only be registers, per gcc
3324 // documentation. This mainly affects "g" constraints.
3325 if (CType == TargetLowering::C_Memory && OpInfo.hasMatchingInput())
3326 continue;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3327
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3328 // This constraint letter is more general than the previous one, use it.
3329 int Generality = getConstraintGenerality(CType);
3330 if (Generality > BestGenerality) {
3331 BestType = CType;
3332 BestIdx = i;
3333 BestGenerality = Generality;
3334 }
3335 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3336
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3337 OpInfo.ConstraintCode = OpInfo.Codes[BestIdx];
3338 OpInfo.ConstraintType = BestType;
3339}
3340
3341/// ComputeConstraintToUse - Determines the constraint code and constraint
3342/// type to use for the specific AsmOperandInfo, setting
3343/// OpInfo.ConstraintCode and OpInfo.ConstraintType.
Chris Lattner5a096902008-04-27 00:37:18 +0000[diff] [blame]3344void TargetLowering::ComputeConstraintToUse(AsmOperandInfo &OpInfo,
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3345 SDValue Op,
Chris Lattner5a096902008-04-27 00:37:18 +0000[diff] [blame]3346 SelectionDAG *DAG) const {
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3347 assert(!OpInfo.Codes.empty() && "Must have at least one constraint");
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3348
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3349 // Single-letter constraints ('r') are very common.
3350 if (OpInfo.Codes.size() == 1) {
3351 OpInfo.ConstraintCode = OpInfo.Codes[0];
3352 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
3353 } else {
Dale Johannesen1784d162010-06-25 21:55:36 +0000[diff] [blame]3354 ChooseConstraint(OpInfo, *this, Op, DAG);
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3355 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3356
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3357 // 'X' matches anything.
3358 if (OpInfo.ConstraintCode == "X" && OpInfo.CallOperandVal) {
3359 // Labels and constants are handled elsewhere ('X' is the only thing
Dale Johannesen8ea5ec62009-07-07 23:26:33 +0000[diff] [blame]3360 // that matches labels). For Functions, the type here is the type of
Dale Johannesen5339c552009-07-20 23:27:39 +0000[diff] [blame]3361 // the result, which is not what we want to look at; leave them alone.
3362 Value *v = OpInfo.CallOperandVal;
Dale Johannesen8ea5ec62009-07-07 23:26:33 +0000[diff] [blame]3363 if (isa<BasicBlock>(v) || isa<ConstantInt>(v) || isa<Function>(v)) {
3364 OpInfo.CallOperandVal = v;
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3365 return;
Dale Johannesen8ea5ec62009-07-07 23:26:33 +0000[diff] [blame]3366 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3367
Chris Lattner4376fea2008-04-27 00:09:47 +0000[diff] [blame]3368 // Otherwise, try to resolve it to something we know about by looking at
3369 // the actual operand type.
3370 if (const char *Repl = LowerXConstraint(OpInfo.ConstraintVT)) {
3371 OpInfo.ConstraintCode = Repl;
3372 OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
3373 }
3374 }
3375}
3376
3377//===----------------------------------------------------------------------===//
Evan Cheng30b37b52006-03-13 23:18:16 +0000[diff] [blame]3378// Loop Strength Reduction hooks
3379//===----------------------------------------------------------------------===//
3380
Chris Lattner1436bb62007-03-30 23:14:50 +0000[diff] [blame]3381/// isLegalAddressingMode - Return true if the addressing mode represented
3382/// by AM is legal for this target, for a load/store of the specified type.
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3383bool TargetLowering::isLegalAddressingMode(const AddrMode &AM,
Chris Lattnerdb125cf2011-07-18 04:54:35 +0000[diff] [blame]3384 Type *Ty) const {
Chris Lattner1436bb62007-03-30 23:14:50 +0000[diff] [blame]3385 // The default implementation of this implements a conservative RISCy, r+r and
3386 // r+i addr mode.
3387
3388 // Allows a sign-extended 16-bit immediate field.
3389 if (AM.BaseOffs <= -(1LL << 16) || AM.BaseOffs >= (1LL << 16)-1)
3390 return false;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3391
Chris Lattner1436bb62007-03-30 23:14:50 +0000[diff] [blame]3392 // No global is ever allowed as a base.
3393 if (AM.BaseGV)
3394 return false;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3395
3396 // Only support r+r,
Chris Lattner1436bb62007-03-30 23:14:50 +0000[diff] [blame]3397 switch (AM.Scale) {
3398 case 0: // "r+i" or just "i", depending on HasBaseReg.
3399 break;
3400 case 1:
3401 if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed.
3402 return false;
3403 // Otherwise we have r+r or r+i.
3404 break;
3405 case 2:
3406 if (AM.HasBaseReg || AM.BaseOffs) // 2*r+r or 2*r+i is not allowed.
3407 return false;
3408 // Allow 2*r as r+r.
3409 break;
3410 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3411
Chris Lattner1436bb62007-03-30 23:14:50 +0000[diff] [blame]3412 return true;
3413}
3414
Benjamin Kramer9c640302011-07-08 10:31:30 +0000[diff] [blame]3415/// BuildExactDiv - Given an exact SDIV by a constant, create a multiplication
3416/// with the multiplicative inverse of the constant.
3417SDValue TargetLowering::BuildExactSDIV(SDValue Op1, SDValue Op2, DebugLoc dl,
3418 SelectionDAG &DAG) const {
3419 ConstantSDNode *C = cast<ConstantSDNode>(Op2);
3420 APInt d = C->getAPIntValue();
3421 assert(d != 0 && "Division by zero!");
3422
3423 // Shift the value upfront if it is even, so the LSB is one.
3424 unsigned ShAmt = d.countTrailingZeros();
3425 if (ShAmt) {
3426 // TODO: For UDIV use SRL instead of SRA.
3427 SDValue Amt = DAG.getConstant(ShAmt, getShiftAmountTy(Op1.getValueType()));
3428 Op1 = DAG.getNode(ISD::SRA, dl, Op1.getValueType(), Op1, Amt);
3429 d = d.ashr(ShAmt);
3430 }
3431
3432 // Calculate the multiplicative inverse, using Newton's method.
3433 APInt t, xn = d;
3434 while ((t = d*xn) != 1)
3435 xn *= APInt(d.getBitWidth(), 2) - t;
3436
3437 Op2 = DAG.getConstant(xn, Op1.getValueType());
3438 return DAG.getNode(ISD::MUL, dl, Op1.getValueType(), Op1, Op2);
3439}
3440
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3441/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
3442/// return a DAG expression to select that will generate the same value by
3443/// multiplying by a magic number. See:
3444/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3445SDValue TargetLowering::
3446BuildSDIV(SDNode *N, SelectionDAG &DAG, bool IsAfterLegalization,
Eric Christopher9171fb92012-12-10 22:00:20 +0000[diff] [blame]3447 std::vector<SDNode*> *Created) const {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]3448 EVT VT = N->getValueType(0);
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3449 DebugLoc dl= N->getDebugLoc();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3450
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3451 // Check to see if we can do this.
Eli Friedmanfc69cb42008-11-30 06:35:39 +0000[diff] [blame]3452 // FIXME: We should be more aggressive here.
3453 if (!isTypeLegal(VT))
3454 return SDValue();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3455
Eli Friedmanfc69cb42008-11-30 06:35:39 +0000[diff] [blame]3456 APInt d = cast<ConstantSDNode>(N->getOperand(1))->getAPIntValue();
Jay Foad4e5ea552009-04-30 10:15:35 +0000[diff] [blame]3457 APInt::ms magics = d.magic();
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3458
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3459 // Multiply the numerator (operand 0) by the magic value
Eli Friedmanfc69cb42008-11-30 06:35:39 +0000[diff] [blame]3460 // FIXME: We should support doing a MUL in a wider type
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3461 SDValue Q;
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3462 if (IsAfterLegalization ? isOperationLegal(ISD::MULHS, VT) :
3463 isOperationLegalOrCustom(ISD::MULHS, VT))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3464 Q = DAG.getNode(ISD::MULHS, dl, VT, N->getOperand(0),
Dan Gohman525178c2007-10-08 18:33:35 +0000[diff] [blame]3465 DAG.getConstant(magics.m, VT));
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3466 else if (IsAfterLegalization ? isOperationLegal(ISD::SMUL_LOHI, VT) :
3467 isOperationLegalOrCustom(ISD::SMUL_LOHI, VT))
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3468 Q = SDValue(DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(VT, VT),
Dan Gohman525178c2007-10-08 18:33:35 +0000[diff] [blame]3469 N->getOperand(0),
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3470 DAG.getConstant(magics.m, VT)).getNode(), 1);
Dan Gohman525178c2007-10-08 18:33:35 +0000[diff] [blame]3471 else
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3472 return SDValue(); // No mulhs or equvialent
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3473 // If d > 0 and m < 0, add the numerator
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3474 if (d.isStrictlyPositive() && magics.m.isNegative()) {
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3475 Q = DAG.getNode(ISD::ADD, dl, VT, Q, N->getOperand(0));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3476 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3477 Created->push_back(Q.getNode());
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3478 }
3479 // If d < 0 and m > 0, subtract the numerator.
Eli Friedmanfc69cb42008-11-30 06:35:39 +0000[diff] [blame]3480 if (d.isNegative() && magics.m.isStrictlyPositive()) {
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3481 Q = DAG.getNode(ISD::SUB, dl, VT, Q, N->getOperand(0));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3482 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3483 Created->push_back(Q.getNode());
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3484 }
3485 // Shift right algebraic if shift value is nonzero
3486 if (magics.s > 0) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3487 Q = DAG.getNode(ISD::SRA, dl, VT, Q,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]3488 DAG.getConstant(magics.s, getShiftAmountTy(Q.getValueType())));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3489 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3490 Created->push_back(Q.getNode());
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3491 }
3492 // Extract the sign bit and add it to the quotient
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3493 SDValue T =
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3494 DAG.getNode(ISD::SRL, dl, VT, Q, DAG.getConstant(VT.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]3495 getShiftAmountTy(Q.getValueType())));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3496 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3497 Created->push_back(T.getNode());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3498 return DAG.getNode(ISD::ADD, dl, VT, Q, T);
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3499}
3500
3501/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
3502/// return a DAG expression to select that will generate the same value by
3503/// multiplying by a magic number. See:
3504/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3505SDValue TargetLowering::
3506BuildUDIV(SDNode *N, SelectionDAG &DAG, bool IsAfterLegalization,
Eric Christopher9171fb92012-12-10 22:00:20 +0000[diff] [blame]3507 std::vector<SDNode*> *Created) const {
Owen Andersone50ed302009-08-10 22:56:29 +0000[diff] [blame]3508 EVT VT = N->getValueType(0);
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3509 DebugLoc dl = N->getDebugLoc();
Eli Friedman201c9772008-11-30 06:02:26 +0000[diff] [blame]3510
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3511 // Check to see if we can do this.
Eli Friedman201c9772008-11-30 06:02:26 +0000[diff] [blame]3512 // FIXME: We should be more aggressive here.
3513 if (!isTypeLegal(VT))
3514 return SDValue();
3515
3516 // FIXME: We should use a narrower constant when the upper
3517 // bits are known to be zero.
Benjamin Kramer1c10b8d2011-03-17 20:39:14 +0000[diff] [blame]3518 const APInt &N1C = cast<ConstantSDNode>(N->getOperand(1))->getAPIntValue();
3519 APInt::mu magics = N1C.magicu();
3520
3521 SDValue Q = N->getOperand(0);
3522
3523 // If the divisor is even, we can avoid using the expensive fixup by shifting
3524 // the divided value upfront.
3525 if (magics.a != 0 && !N1C[0]) {
3526 unsigned Shift = N1C.countTrailingZeros();
3527 Q = DAG.getNode(ISD::SRL, dl, VT, Q,
3528 DAG.getConstant(Shift, getShiftAmountTy(Q.getValueType())));
3529 if (Created)
3530 Created->push_back(Q.getNode());
3531
3532 // Get magic number for the shifted divisor.
3533 magics = N1C.lshr(Shift).magicu(Shift);
3534 assert(magics.a == 0 && "Should use cheap fixup now");
3535 }
Eli Friedman201c9772008-11-30 06:02:26 +0000[diff] [blame]3536
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3537 // Multiply the numerator (operand 0) by the magic value
Eli Friedman201c9772008-11-30 06:02:26 +0000[diff] [blame]3538 // FIXME: We should support doing a MUL in a wider type
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3539 if (IsAfterLegalization ? isOperationLegal(ISD::MULHU, VT) :
3540 isOperationLegalOrCustom(ISD::MULHU, VT))
Benjamin Kramer1c10b8d2011-03-17 20:39:14 +0000[diff] [blame]3541 Q = DAG.getNode(ISD::MULHU, dl, VT, Q, DAG.getConstant(magics.m, VT));
Richard Osborne19a4daf2011-11-07 17:09:05 +0000[diff] [blame]3542 else if (IsAfterLegalization ? isOperationLegal(ISD::UMUL_LOHI, VT) :
3543 isOperationLegalOrCustom(ISD::UMUL_LOHI, VT))
Benjamin Kramer1c10b8d2011-03-17 20:39:14 +0000[diff] [blame]3544 Q = SDValue(DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(VT, VT), Q,
3545 DAG.getConstant(magics.m, VT)).getNode(), 1);
Dan Gohman525178c2007-10-08 18:33:35 +0000[diff] [blame]3546 else
Dan Gohman475871a2008-07-27 21:46:04 +0000[diff] [blame]3547 return SDValue(); // No mulhu or equvialent
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3548 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3549 Created->push_back(Q.getNode());
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3550
3551 if (magics.a == 0) {
Benjamin Kramer1c10b8d2011-03-17 20:39:14 +0000[diff] [blame]3552 assert(magics.s < N1C.getBitWidth() &&
Eli Friedman201c9772008-11-30 06:02:26 +0000[diff] [blame]3553 "We shouldn't generate an undefined shift!");
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3554 return DAG.getNode(ISD::SRL, dl, VT, Q,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]3555 DAG.getConstant(magics.s, getShiftAmountTy(Q.getValueType())));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3556 } else {
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3557 SDValue NPQ = DAG.getNode(ISD::SUB, dl, VT, N->getOperand(0), Q);
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3558 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3559 Created->push_back(NPQ.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3560 NPQ = DAG.getNode(ISD::SRL, dl, VT, NPQ,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]3561 DAG.getConstant(1, getShiftAmountTy(NPQ.getValueType())));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3562 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3563 Created->push_back(NPQ.getNode());
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000[diff] [blame]3564 NPQ = DAG.getNode(ISD::ADD, dl, VT, NPQ, Q);
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3565 if (Created)
Gabor Greifba36cb52008-08-28 21:40:38 +0000[diff] [blame]3566 Created->push_back(NPQ.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000[diff] [blame]3567 return DAG.getNode(ISD::SRL, dl, VT, NPQ,
Owen Anderson95771af2011-02-25 21:41:48 +0000[diff] [blame]3568 DAG.getConstant(magics.s-1, getShiftAmountTy(NPQ.getValueType())));
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +0000[diff] [blame]3569 }
3570}