Blame - lib/CodeGen/SelectionDAG/TargetLowering.cpp - fp2-dev/platform/external/llvm

blob: 35b847ccabfbd3bb832cb2c6f3b7472e2e94a830 [file] [log] [blame]

Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	1	//===-- TargetLowering.cpp - Implement the TargetLowering class -----------===//
Misha Brukman	f976c85	2005-04-21 22:55:34 +0000	[diff] [blame]	2	//
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	3	// The LLVM Compiler Infrastructure
				4	//
Chris Lattner	4ee451d	2007-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 Brukman	f976c85	2005-04-21 22:55:34 +0000	[diff] [blame]	7	//
Chris Lattner	310968c	2005-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"
Chris Lattner	af76e59	2009-08-22 20:48:53 +0000	[diff] [blame]	15	#include "llvm/MC/MCAsmInfo.h"
Chris Lattner	beeb93e	2010-01-26 05:58:28 +0000	[diff] [blame]	16	#include "llvm/MC/MCExpr.h"
Owen Anderson	07000c6	2006-05-12 06:33:49 +0000	[diff] [blame]	17	#include "llvm/Target/TargetData.h"
Chris Lattner	f014412	2009-07-28 03:13:23 +0000	[diff] [blame]	18	#include "llvm/Target/TargetLoweringObjectFile.h"
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	19	#include "llvm/Target/TargetMachine.h"
Dan Gohman	6f0d024	2008-02-10 18:45:23 +0000	[diff] [blame]	20	#include "llvm/Target/TargetRegisterInfo.h"
Dan Gohman	707e018	2008-04-12 04:36:06 +0000	[diff] [blame]	21	#include "llvm/GlobalVariable.h"
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	22	#include "llvm/DerivedTypes.h"
Dan Gohman	84023e0	2010-07-10 09:00:22 +0000	[diff] [blame]	23	#include "llvm/CodeGen/Analysis.h"
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	24	#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner	071c62f	2010-01-25 23:26:13 +0000	[diff] [blame]	25	#include "llvm/CodeGen/MachineJumpTableInfo.h"
Chris Lattner	589c6f6	2010-01-26 06:28:43 +0000	[diff] [blame]	26	#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	27	#include "llvm/CodeGen/SelectionDAG.h"
Owen Anderson	718cb66	2007-09-07 04:06:50 +0000	[diff] [blame]	28	#include "llvm/ADT/STLExtras.h"
Torok Edwin	c25e758	2009-07-11 20:10:48 +0000	[diff] [blame]	29	#include "llvm/Support/ErrorHandling.h"
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	30	#include "llvm/Support/MathExtras.h"
Nick Lewycky	476b242	2010-12-19 20:43:38 +0000	[diff] [blame]	31	#include <cctype>
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	32	using namespace llvm;
				33
Rafael Espindola	9a58023	2009-02-27 13:37:18 +0000	[diff] [blame]	34	namespace llvm {
				35	TLSModel::Model getTLSModel(const GlobalValue *GV, Reloc::Model reloc) {
				36	bool isLocal = GV->hasLocalLinkage();
				37	bool isDeclaration = GV->isDeclaration();
				38	// FIXME: what should we do for protected and internal visibility?
				39	// For variables, is internal different from hidden?
				40	bool isHidden = GV->hasHiddenVisibility();
				41
				42	if (reloc == Reloc::PIC_) {
				43	if (isLocal \|\| isHidden)
				44	return TLSModel::LocalDynamic;
				45	else
				46	return TLSModel::GeneralDynamic;
				47	} else {
				48	if (!isDeclaration \|\| isHidden)
				49	return TLSModel::LocalExec;
				50	else
				51	return TLSModel::InitialExec;
				52	}
				53	}
				54	}
				55
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	56	/// InitLibcallNames - Set default libcall names.
				57	///
Evan Cheng	79cca50	2007-01-12 22:51:10 +0000	[diff] [blame]	58	static void InitLibcallNames(const char **Names) {
Anton Korobeynikov	c31642f	2009-05-03 13:14:08 +0000	[diff] [blame]	59	Names[RTLIB::SHL_I16] = "__ashlhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	60	Names[RTLIB::SHL_I32] = "__ashlsi3";
				61	Names[RTLIB::SHL_I64] = "__ashldi3";
Duncan Sands	dddc629	2008-07-11 16:52:29 +0000	[diff] [blame]	62	Names[RTLIB::SHL_I128] = "__ashlti3";
Anton Korobeynikov	c31642f	2009-05-03 13:14:08 +0000	[diff] [blame]	63	Names[RTLIB::SRL_I16] = "__lshrhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	64	Names[RTLIB::SRL_I32] = "__lshrsi3";
				65	Names[RTLIB::SRL_I64] = "__lshrdi3";
Duncan Sands	dddc629	2008-07-11 16:52:29 +0000	[diff] [blame]	66	Names[RTLIB::SRL_I128] = "__lshrti3";
Anton Korobeynikov	c31642f	2009-05-03 13:14:08 +0000	[diff] [blame]	67	Names[RTLIB::SRA_I16] = "__ashrhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	68	Names[RTLIB::SRA_I32] = "__ashrsi3";
				69	Names[RTLIB::SRA_I64] = "__ashrdi3";
Duncan Sands	dddc629	2008-07-11 16:52:29 +0000	[diff] [blame]	70	Names[RTLIB::SRA_I128] = "__ashrti3";
Anton Korobeynikov	8983da7	2009-11-07 17:14:39 +0000	[diff] [blame]	71	Names[RTLIB::MUL_I8] = "__mulqi3";
Anton Korobeynikov	c31642f	2009-05-03 13:14:08 +0000	[diff] [blame]	72	Names[RTLIB::MUL_I16] = "__mulhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	73	Names[RTLIB::MUL_I32] = "__mulsi3";
				74	Names[RTLIB::MUL_I64] = "__muldi3";
Duncan Sands	5ac319a	2008-07-10 15:35:05 +0000	[diff] [blame]	75	Names[RTLIB::MUL_I128] = "__multi3";
Anton Korobeynikov	8983da7	2009-11-07 17:14:39 +0000	[diff] [blame]	76	Names[RTLIB::SDIV_I8] = "__divqi3";
Anton Korobeynikov	813090c	2009-05-03 13:18:16 +0000	[diff] [blame]	77	Names[RTLIB::SDIV_I16] = "__divhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	78	Names[RTLIB::SDIV_I32] = "__divsi3";
				79	Names[RTLIB::SDIV_I64] = "__divdi3";
Duncan Sands	5ac319a	2008-07-10 15:35:05 +0000	[diff] [blame]	80	Names[RTLIB::SDIV_I128] = "__divti3";
Anton Korobeynikov	8983da7	2009-11-07 17:14:39 +0000	[diff] [blame]	81	Names[RTLIB::UDIV_I8] = "__udivqi3";
Anton Korobeynikov	fb3f84f	2009-05-08 18:50:54 +0000	[diff] [blame]	82	Names[RTLIB::UDIV_I16] = "__udivhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	83	Names[RTLIB::UDIV_I32] = "__udivsi3";
				84	Names[RTLIB::UDIV_I64] = "__udivdi3";
Duncan Sands	5ac319a	2008-07-10 15:35:05 +0000	[diff] [blame]	85	Names[RTLIB::UDIV_I128] = "__udivti3";
Anton Korobeynikov	8983da7	2009-11-07 17:14:39 +0000	[diff] [blame]	86	Names[RTLIB::SREM_I8] = "__modqi3";
Anton Korobeynikov	813090c	2009-05-03 13:18:16 +0000	[diff] [blame]	87	Names[RTLIB::SREM_I16] = "__modhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	88	Names[RTLIB::SREM_I32] = "__modsi3";
				89	Names[RTLIB::SREM_I64] = "__moddi3";
Duncan Sands	5ac319a	2008-07-10 15:35:05 +0000	[diff] [blame]	90	Names[RTLIB::SREM_I128] = "__modti3";
Anton Korobeynikov	8983da7	2009-11-07 17:14:39 +0000	[diff] [blame]	91	Names[RTLIB::UREM_I8] = "__umodqi3";
Anton Korobeynikov	9fe9c8e	2009-05-03 13:19:57 +0000	[diff] [blame]	92	Names[RTLIB::UREM_I16] = "__umodhi3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	93	Names[RTLIB::UREM_I32] = "__umodsi3";
				94	Names[RTLIB::UREM_I64] = "__umoddi3";
Duncan Sands	5ac319a	2008-07-10 15:35:05 +0000	[diff] [blame]	95	Names[RTLIB::UREM_I128] = "__umodti3";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	96	Names[RTLIB::NEG_I32] = "__negsi2";
				97	Names[RTLIB::NEG_I64] = "__negdi2";
				98	Names[RTLIB::ADD_F32] = "__addsf3";
				99	Names[RTLIB::ADD_F64] = "__adddf3";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	100	Names[RTLIB::ADD_F80] = "__addxf3";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	101	Names[RTLIB::ADD_PPCF128] = "__gcc_qadd";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	102	Names[RTLIB::SUB_F32] = "__subsf3";
				103	Names[RTLIB::SUB_F64] = "__subdf3";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	104	Names[RTLIB::SUB_F80] = "__subxf3";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	105	Names[RTLIB::SUB_PPCF128] = "__gcc_qsub";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	106	Names[RTLIB::MUL_F32] = "__mulsf3";
				107	Names[RTLIB::MUL_F64] = "__muldf3";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	108	Names[RTLIB::MUL_F80] = "__mulxf3";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	109	Names[RTLIB::MUL_PPCF128] = "__gcc_qmul";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	110	Names[RTLIB::DIV_F32] = "__divsf3";
				111	Names[RTLIB::DIV_F64] = "__divdf3";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	112	Names[RTLIB::DIV_F80] = "__divxf3";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	113	Names[RTLIB::DIV_PPCF128] = "__gcc_qdiv";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	114	Names[RTLIB::REM_F32] = "fmodf";
				115	Names[RTLIB::REM_F64] = "fmod";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	116	Names[RTLIB::REM_F80] = "fmodl";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	117	Names[RTLIB::REM_PPCF128] = "fmodl";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	118	Names[RTLIB::POWI_F32] = "__powisf2";
				119	Names[RTLIB::POWI_F64] = "__powidf2";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	120	Names[RTLIB::POWI_F80] = "__powixf2";
				121	Names[RTLIB::POWI_PPCF128] = "__powitf2";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	122	Names[RTLIB::SQRT_F32] = "sqrtf";
				123	Names[RTLIB::SQRT_F64] = "sqrt";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	124	Names[RTLIB::SQRT_F80] = "sqrtl";
				125	Names[RTLIB::SQRT_PPCF128] = "sqrtl";
Dale Johannesen	7794f2a	2008-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 Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	146	Names[RTLIB::SIN_F32] = "sinf";
				147	Names[RTLIB::SIN_F64] = "sin";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	148	Names[RTLIB::SIN_F80] = "sinl";
				149	Names[RTLIB::SIN_PPCF128] = "sinl";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	150	Names[RTLIB::COS_F32] = "cosf";
				151	Names[RTLIB::COS_F64] = "cos";
Duncan Sands	007f984	2008-01-10 10:28:30 +0000	[diff] [blame]	152	Names[RTLIB::COS_F80] = "cosl";
				153	Names[RTLIB::COS_PPCF128] = "cosl";
Dan Gohman	e54be10	2007-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 Gohman	2bb1e3e	2008-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 Sands	d2c817e	2010-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 Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	182	Names[RTLIB::FPEXT_F32_F64] = "__extendsfdf2";
Anton Korobeynikov	927411b	2010-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 Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	185	Names[RTLIB::FPROUND_F64_F32] = "__truncdfsf2";
Bruno Cardoso Lopes	e36bfe6	2008-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 Korobeynikov	de0118c	2010-03-26 21:32:14 +0000	[diff] [blame]	190	Names[RTLIB::FPTOSINT_F32_I8] = "__fixsfqi";
				191	Names[RTLIB::FPTOSINT_F32_I16] = "__fixsfhi";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	192	Names[RTLIB::FPTOSINT_F32_I32] = "__fixsfsi";
				193	Names[RTLIB::FPTOSINT_F32_I64] = "__fixsfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	194	Names[RTLIB::FPTOSINT_F32_I128] = "__fixsfti";
Anton Korobeynikov	de0118c	2010-03-26 21:32:14 +0000	[diff] [blame]	195	Names[RTLIB::FPTOSINT_F64_I8] = "__fixdfqi";
				196	Names[RTLIB::FPTOSINT_F64_I16] = "__fixdfhi";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	197	Names[RTLIB::FPTOSINT_F64_I32] = "__fixdfsi";
				198	Names[RTLIB::FPTOSINT_F64_I64] = "__fixdfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	199	Names[RTLIB::FPTOSINT_F64_I128] = "__fixdfti";
Duncan Sands	be1ad4d	2008-07-10 15:33:02 +0000	[diff] [blame]	200	Names[RTLIB::FPTOSINT_F80_I32] = "__fixxfsi";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	201	Names[RTLIB::FPTOSINT_F80_I64] = "__fixxfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	202	Names[RTLIB::FPTOSINT_F80_I128] = "__fixxfti";
Duncan Sands	041cde2	2008-06-25 20:24:48 +0000	[diff] [blame]	203	Names[RTLIB::FPTOSINT_PPCF128_I32] = "__fixtfsi";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	204	Names[RTLIB::FPTOSINT_PPCF128_I64] = "__fixtfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	205	Names[RTLIB::FPTOSINT_PPCF128_I128] = "__fixtfti";
Anton Korobeynikov	de0118c	2010-03-26 21:32:14 +0000	[diff] [blame]	206	Names[RTLIB::FPTOUINT_F32_I8] = "__fixunssfqi";
				207	Names[RTLIB::FPTOUINT_F32_I16] = "__fixunssfhi";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	208	Names[RTLIB::FPTOUINT_F32_I32] = "__fixunssfsi";
				209	Names[RTLIB::FPTOUINT_F32_I64] = "__fixunssfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	210	Names[RTLIB::FPTOUINT_F32_I128] = "__fixunssfti";
Anton Korobeynikov	de0118c	2010-03-26 21:32:14 +0000	[diff] [blame]	211	Names[RTLIB::FPTOUINT_F64_I8] = "__fixunsdfqi";
				212	Names[RTLIB::FPTOUINT_F64_I16] = "__fixunsdfhi";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	213	Names[RTLIB::FPTOUINT_F64_I32] = "__fixunsdfsi";
				214	Names[RTLIB::FPTOUINT_F64_I64] = "__fixunsdfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	215	Names[RTLIB::FPTOUINT_F64_I128] = "__fixunsdfti";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	216	Names[RTLIB::FPTOUINT_F80_I32] = "__fixunsxfsi";
				217	Names[RTLIB::FPTOUINT_F80_I64] = "__fixunsxfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	218	Names[RTLIB::FPTOUINT_F80_I128] = "__fixunsxfti";
Duncan Sands	041cde2	2008-06-25 20:24:48 +0000	[diff] [blame]	219	Names[RTLIB::FPTOUINT_PPCF128_I32] = "__fixunstfsi";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	220	Names[RTLIB::FPTOUINT_PPCF128_I64] = "__fixunstfdi";
Dan Gohman	a2e9485	2008-03-10 23:03:31 +0000	[diff] [blame]	221	Names[RTLIB::FPTOUINT_PPCF128_I128] = "__fixunstfti";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	222	Names[RTLIB::SINTTOFP_I32_F32] = "__floatsisf";
				223	Names[RTLIB::SINTTOFP_I32_F64] = "__floatsidf";
Duncan Sands	9bed0f5	2008-07-11 16:57:02 +0000	[diff] [blame]	224	Names[RTLIB::SINTTOFP_I32_F80] = "__floatsixf";
				225	Names[RTLIB::SINTTOFP_I32_PPCF128] = "__floatsitf";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	226	Names[RTLIB::SINTTOFP_I64_F32] = "__floatdisf";
				227	Names[RTLIB::SINTTOFP_I64_F64] = "__floatdidf";
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	228	Names[RTLIB::SINTTOFP_I64_F80] = "__floatdixf";
				229	Names[RTLIB::SINTTOFP_I64_PPCF128] = "__floatditf";
Dan Gohman	d91446d	2008-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 Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	234	Names[RTLIB::UINTTOFP_I32_F32] = "__floatunsisf";
				235	Names[RTLIB::UINTTOFP_I32_F64] = "__floatunsidf";
Duncan Sands	ac6cece	2008-07-11 17:00:14 +0000	[diff] [blame]	236	Names[RTLIB::UINTTOFP_I32_F80] = "__floatunsixf";
				237	Names[RTLIB::UINTTOFP_I32_PPCF128] = "__floatunsitf";
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	238	Names[RTLIB::UINTTOFP_I64_F32] = "__floatundisf";
				239	Names[RTLIB::UINTTOFP_I64_F64] = "__floatundidf";
Duncan Sands	ac6cece	2008-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 Cheng	5696622	2007-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 Cheng	d385fd6	2007-01-31 09:29:11 +0000	[diff] [blame]	260	Names[RTLIB::O_F32] = "__unordsf2";
				261	Names[RTLIB::O_F64] = "__unorddf2";
Sanjiv Gupta	a114baa	2009-07-30 09:12:56 +0000	[diff] [blame]	262	Names[RTLIB::MEMCPY] = "memcpy";
				263	Names[RTLIB::MEMMOVE] = "memmove";
				264	Names[RTLIB::MEMSET] = "memset";
Duncan Sands	b0f1e17	2009-05-22 20:36:31 +0000	[diff] [blame]	265	Names[RTLIB::UNWIND_RESUME] = "_Unwind_Resume";
Jim Grosbach	e03262f	2010-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 Grosbach	ef6eb9c	2010-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 Grosbach	e03262f	2010-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";
				292	Names[RTLIB::SYNC_FETCH_AND_XOR_4] = "__sync_fetch_and-xor_4";
				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 Cheng	d385fd6	2007-01-31 09:29:11 +0000	[diff] [blame]	298	}
				299
Anton Korobeynikov	72977a4	2009-08-14 20:10:52 +0000	[diff] [blame]	300	/// InitLibcallCallingConvs - Set default libcall CallingConvs.
				301	///
				302	static void InitLibcallCallingConvs(CallingConv::ID *CCs) {
				303	for (int i = 0; i < RTLIB::UNKNOWN_LIBCALL; ++i) {
				304	CCs[i] = CallingConv::C;
				305	}
				306	}
				307
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	310	RTLIB::Libcall RTLIB::getFPEXT(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	311	if (OpVT == MVT::f32) {
				312	if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	313	return FPEXT_F32_F64;
				314	}
Anton Korobeynikov	927411b	2010-03-14 18:42:24 +0000	[diff] [blame]	315
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	321	RTLIB::Libcall RTLIB::getFPROUND(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	322	if (RetVT == MVT::f32) {
				323	if (OpVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	324	return FPROUND_F64_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	325	if (OpVT == MVT::f80)
Bruno Cardoso Lopes	e36bfe6	2008-08-07 19:01:24 +0000	[diff] [blame]	326	return FPROUND_F80_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	327	if (OpVT == MVT::ppcf128)
Bruno Cardoso Lopes	e36bfe6	2008-08-07 19:01:24 +0000	[diff] [blame]	328	return FPROUND_PPCF128_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	329	} else if (RetVT == MVT::f64) {
				330	if (OpVT == MVT::f80)
Bruno Cardoso Lopes	e36bfe6	2008-08-07 19:01:24 +0000	[diff] [blame]	331	return FPROUND_F80_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	332	if (OpVT == MVT::ppcf128)
Bruno Cardoso Lopes	e36bfe6	2008-08-07 19:01:24 +0000	[diff] [blame]	333	return FPROUND_PPCF128_F64;
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	334	}
Anton Korobeynikov	927411b	2010-03-14 18:42:24 +0000	[diff] [blame]	335
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	341	RTLIB::Libcall RTLIB::getFPTOSINT(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	342	if (OpVT == MVT::f32) {
				343	if (RetVT == MVT::i8)
Sanjiv Gupta	8aa207e	2009-06-16 09:03:58 +0000	[diff] [blame]	344	return FPTOSINT_F32_I8;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	345	if (RetVT == MVT::i16)
Sanjiv Gupta	8aa207e	2009-06-16 09:03:58 +0000	[diff] [blame]	346	return FPTOSINT_F32_I16;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	347	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	348	return FPTOSINT_F32_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	349	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	350	return FPTOSINT_F32_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	351	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	352	return FPTOSINT_F32_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	353	} else if (OpVT == MVT::f64) {
Anton Korobeynikov	de0118c	2010-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 Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	358	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	359	return FPTOSINT_F64_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	360	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	361	return FPTOSINT_F64_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	362	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	363	return FPTOSINT_F64_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	364	} else if (OpVT == MVT::f80) {
				365	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	366	return FPTOSINT_F80_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	367	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	368	return FPTOSINT_F80_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	369	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	370	return FPTOSINT_F80_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	371	} else if (OpVT == MVT::ppcf128) {
				372	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	373	return FPTOSINT_PPCF128_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	374	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	375	return FPTOSINT_PPCF128_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	376	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	384	RTLIB::Libcall RTLIB::getFPTOUINT(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	385	if (OpVT == MVT::f32) {
				386	if (RetVT == MVT::i8)
Sanjiv Gupta	8aa207e	2009-06-16 09:03:58 +0000	[diff] [blame]	387	return FPTOUINT_F32_I8;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	388	if (RetVT == MVT::i16)
Sanjiv Gupta	8aa207e	2009-06-16 09:03:58 +0000	[diff] [blame]	389	return FPTOUINT_F32_I16;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	390	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	391	return FPTOUINT_F32_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	392	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	393	return FPTOUINT_F32_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	394	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	395	return FPTOUINT_F32_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	396	} else if (OpVT == MVT::f64) {
Anton Korobeynikov	de0118c	2010-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 Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	401	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	402	return FPTOUINT_F64_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	403	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	404	return FPTOUINT_F64_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	405	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	406	return FPTOUINT_F64_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	407	} else if (OpVT == MVT::f80) {
				408	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	409	return FPTOUINT_F80_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	410	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	411	return FPTOUINT_F80_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	412	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	413	return FPTOUINT_F80_I128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	414	} else if (OpVT == MVT::ppcf128) {
				415	if (RetVT == MVT::i32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	416	return FPTOUINT_PPCF128_I32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	417	if (RetVT == MVT::i64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	418	return FPTOUINT_PPCF128_I64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	419	if (RetVT == MVT::i128)
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	427	RTLIB::Libcall RTLIB::getSINTTOFP(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	428	if (OpVT == MVT::i32) {
				429	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	430	return SINTTOFP_I32_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	431	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	432	return SINTTOFP_I32_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	433	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	434	return SINTTOFP_I32_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	435	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	436	return SINTTOFP_I32_PPCF128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	437	} else if (OpVT == MVT::i64) {
				438	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	439	return SINTTOFP_I64_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	440	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	441	return SINTTOFP_I64_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	442	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	443	return SINTTOFP_I64_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	444	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	445	return SINTTOFP_I64_PPCF128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	446	} else if (OpVT == MVT::i128) {
				447	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	448	return SINTTOFP_I128_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	449	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	450	return SINTTOFP_I128_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	451	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	452	return SINTTOFP_I128_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	453	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-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 Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	461	RTLIB::Libcall RTLIB::getUINTTOFP(EVT OpVT, EVT RetVT) {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	462	if (OpVT == MVT::i32) {
				463	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	464	return UINTTOFP_I32_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	465	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	466	return UINTTOFP_I32_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	467	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	468	return UINTTOFP_I32_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	469	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	470	return UINTTOFP_I32_PPCF128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	471	} else if (OpVT == MVT::i64) {
				472	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	473	return UINTTOFP_I64_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	474	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	475	return UINTTOFP_I64_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	476	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	477	return UINTTOFP_I64_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	478	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	479	return UINTTOFP_I64_PPCF128;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	480	} else if (OpVT == MVT::i128) {
				481	if (RetVT == MVT::f32)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	482	return UINTTOFP_I128_F32;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	483	else if (RetVT == MVT::f64)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	484	return UINTTOFP_I128_F64;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	485	else if (RetVT == MVT::f80)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	486	return UINTTOFP_I128_F80;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	487	else if (RetVT == MVT::ppcf128)
Duncan Sands	b2ff885	2008-07-17 02:36:29 +0000	[diff] [blame]	488	return UINTTOFP_I128_PPCF128;
				489	}
				490	return UNKNOWN_LIBCALL;
				491	}
				492
Evan Cheng	d385fd6	2007-01-31 09:29:11 +0000	[diff] [blame]	493	/// InitCmpLibcallCCs - Set default comparison libcall CC.
				494	///
				495	static 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 Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	513	}
				514
Chris Lattner	f014412	2009-07-28 03:13:23 +0000	[diff] [blame]	515	/// NOTE: The constructor takes ownership of TLOF.
Dan Gohman	f0757b0	2010-04-21 01:34:56 +0000	[diff] [blame]	516	TargetLowering::TargetLowering(const TargetMachine &tm,
				517	const TargetLoweringObjectFile *tlof)
Chris Lattner	f014412	2009-07-28 03:13:23 +0000	[diff] [blame]	518	: TM(tm), TD(TM.getTargetData()), TLOF(*tlof) {
Chris Lattner	cba82f9	2005-01-16 07:28:11 +0000	[diff] [blame]	519	// All operations default to being supported.
				520	memset(OpActions, 0, sizeof(OpActions));
Evan Cheng	0329466	2008-10-14 21:26:46 +0000	[diff] [blame]	521	memset(LoadExtActions, 0, sizeof(LoadExtActions));
Chris Lattner	ddf8956	2008-01-17 19:59:44 +0000	[diff] [blame]	522	memset(TruncStoreActions, 0, sizeof(TruncStoreActions));
Chris Lattner	c9133f9	2008-01-18 19:36:20 +0000	[diff] [blame]	523	memset(IndexedModeActions, 0, sizeof(IndexedModeActions));
Evan Cheng	7f04268	2008-10-15 02:05:31 +0000	[diff] [blame]	524	memset(CondCodeActions, 0, sizeof(CondCodeActions));
Dan Gohman	93f81e2	2007-07-09 20:49:44 +0000	[diff] [blame]	525
Chris Lattner	1a3048b	2007-12-22 20:47:56 +0000	[diff] [blame]	526	// Set default actions for various operations.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	527	for (unsigned VT = 0; VT != (unsigned)MVT::LAST_VALUETYPE; ++VT) {
Chris Lattner	1a3048b	2007-12-22 20:47:56 +0000	[diff] [blame]	528	// Default all indexed load / store to expand.
Evan Cheng	5ff839f	2006-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 Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	531	setIndexedLoadAction(IM, (MVT::SimpleValueType)VT, Expand);
				532	setIndexedStoreAction(IM, (MVT::SimpleValueType)VT, Expand);
Evan Cheng	5ff839f	2006-11-09 18:56:43 +0000	[diff] [blame]	533	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	534
Chris Lattner	1a3048b	2007-12-22 20:47:56 +0000	[diff] [blame]	535	// These operations default to expand.
Owen Anderson	825b72b	2009-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 Cheng	5ff839f	2006-11-09 18:56:43 +0000	[diff] [blame]	538	}
Evan Cheng	d2cde68	2008-03-10 19:38:10 +0000	[diff] [blame]	539
				540	// Most targets ignore the @llvm.prefetch intrinsic.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	541	setOperationAction(ISD::PREFETCH, MVT::Other, Expand);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	542
				543	// ConstantFP nodes default to expand. Targets can either change this to
Evan Cheng	eb2f969	2009-10-27 19:56:55 +0000	[diff] [blame]	544	// Legal, in which case all fp constants are legal, or use isFPImmLegal()
Nate Begeman	e179584	2008-02-14 08:57:00 +0000	[diff] [blame]	545	// to optimize expansions for certain constants.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	546	setOperationAction(ISD::ConstantFP, MVT::f32, Expand);
				547	setOperationAction(ISD::ConstantFP, MVT::f64, Expand);
				548	setOperationAction(ISD::ConstantFP, MVT::f80, Expand);
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	549
Dale Johannesen	0bb4160	2008-09-22 21:57:32 +0000	[diff] [blame]	550	// These library functions default to expand.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	551	setOperationAction(ISD::FLOG , MVT::f64, Expand);
				552	setOperationAction(ISD::FLOG2, MVT::f64, Expand);
				553	setOperationAction(ISD::FLOG10,MVT::f64, Expand);
				554	setOperationAction(ISD::FEXP , MVT::f64, Expand);
				555	setOperationAction(ISD::FEXP2, MVT::f64, Expand);
				556	setOperationAction(ISD::FLOG , MVT::f32, Expand);
				557	setOperationAction(ISD::FLOG2, MVT::f32, Expand);
				558	setOperationAction(ISD::FLOG10,MVT::f32, Expand);
				559	setOperationAction(ISD::FEXP , MVT::f32, Expand);
				560	setOperationAction(ISD::FEXP2, MVT::f32, Expand);
Dale Johannesen	0bb4160	2008-09-22 21:57:32 +0000	[diff] [blame]	561
Chris Lattner	41bab0b	2008-01-15 21:58:08 +0000	[diff] [blame]	562	// Default ISD::TRAP to expand (which turns it into abort).
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	563	setOperationAction(ISD::TRAP, MVT::Other, Expand);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	564
Owen Anderson	a69571c	2006-05-03 01:29:57 +0000	[diff] [blame]	565	IsLittleEndian = TD->isLittleEndian();
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	566	PointerTy = MVT::getIntegerVT(8*TD->getPointerSize());
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	567	memset(RegClassForVT, 0,MVT::LAST_VALUETYPEsizeof(TargetRegisterClass));
Owen Anderson	718cb66	2007-09-07 04:06:50 +0000	[diff] [blame]	568	memset(TargetDAGCombineArray, 0, array_lengthof(TargetDAGCombineArray));
Evan Cheng	a03a5dc	2006-02-14 08:38:30 +0000	[diff] [blame]	569	maxStoresPerMemset = maxStoresPerMemcpy = maxStoresPerMemmove = 8;
Evan Cheng	0521928	2011-01-06 06:52:41 +0000	[diff] [blame]	570	maxStoresPerMemsetOptSize = maxStoresPerMemcpyOptSize
				571	= maxStoresPerMemmoveOptSize = 4;
Evan Cheng	6ebf7bc	2009-05-13 21:42:09 +0000	[diff] [blame]	572	benefitFromCodePlacementOpt = false;
Anton Korobeynikov	d27a258	2006-12-10 23:12:42 +0000	[diff] [blame]	573	UseUnderscoreSetJmp = false;
				574	UseUnderscoreLongJmp = false;
Chris Lattner	6618039	2007-02-25 01:28:05 +0000	[diff] [blame]	575	SelectIsExpensive = false;
Nate Begeman	405e3ec	2005-10-21 00:02:42 +0000	[diff] [blame]	576	IntDivIsCheap = false;
				577	Pow2DivIsCheap = false;
Chris Lattner	de189be	2010-11-30 18:12:52 +0000	[diff] [blame]	578	JumpIsExpensive = false;
Chris Lattner	ee4a765	2006-01-25 18:57:15 +0000	[diff] [blame]	579	StackPointerRegisterToSaveRestore = 0;
Jim Laskey	9bb3c93	2007-02-22 18:04:49 +0000	[diff] [blame]	580	ExceptionPointerRegister = 0;
				581	ExceptionSelectorRegister = 0;
Duncan Sands	0322808	2008-11-23 15:47:28 +0000	[diff] [blame]	582	BooleanContents = UndefinedBooleanContent;
Evan Cheng	211ffa1	2010-05-19 20:19:50 +0000	[diff] [blame]	583	SchedPreferenceInfo = Sched::Latency;
Chris Lattner	7acf5f3	2006-09-05 17:39:15 +0000	[diff] [blame]	584	JumpBufSize = 0;
Duraid Madina	0c9e0ff	2006-09-04 07:44:11 +0000	[diff] [blame]	585	JumpBufAlignment = 0;
Evan Cheng	fb8075d	2008-02-28 00:43:03 +0000	[diff] [blame]	586	PrefLoopAlignment = 0;
Rafael Espindola	cbeeae2	2010-07-11 04:01:49 +0000	[diff] [blame]	587	MinStackArgumentAlignment = 1;
Jim Grosbach	9a52649	2010-06-23 16:07:42 +0000	[diff] [blame]	588	ShouldFoldAtomicFences = false;
Evan Cheng	5696622	2007-01-12 02:11:51 +0000	[diff] [blame]	589
				590	InitLibcallNames(LibcallRoutineNames);
Evan Cheng	d385fd6	2007-01-31 09:29:11 +0000	[diff] [blame]	591	InitCmpLibcallCCs(CmpLibcallCCs);
Anton Korobeynikov	72977a4	2009-08-14 20:10:52 +0000	[diff] [blame]	592	InitLibcallCallingConvs(LibcallCallingConvs);
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	593	}
				594
Chris Lattner	f014412	2009-07-28 03:13:23 +0000	[diff] [blame]	595	TargetLowering::~TargetLowering() {
				596	delete &TLOF;
				597	}
Chris Lattner	cba82f9	2005-01-16 07:28:11 +0000	[diff] [blame]	598
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	599	MVT TargetLowering::getShiftAmountTy(EVT LHSTy) const {
				600	return MVT::getIntegerVT(8*TD->getPointerSize());
				601	}
				602
Mon P Wang	f7ea6c3	2010-02-10 23:37:45 +0000	[diff] [blame]	603	/// canOpTrap - Returns true if the operation can trap for the value type.
				604	/// VT must be a legal type.
				605	bool TargetLowering::canOpTrap(unsigned Op, EVT VT) const {
				606	assert(isTypeLegal(VT));
				607	switch (Op) {
				608	default:
				609	return false;
				610	case ISD::FDIV:
				611	case ISD::FREM:
				612	case ISD::SDIV:
				613	case ISD::UDIV:
				614	case ISD::SREM:
				615	case ISD::UREM:
				616	return true;
				617	}
				618	}
				619
				620
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	621	static unsigned getVectorTypeBreakdownMVT(MVT VT, MVT &IntermediateVT,
Chris Lattner	598751e	2010-07-05 05:36:21 +0000	[diff] [blame]	622	unsigned &NumIntermediates,
				623	EVT &RegisterVT,
				624	TargetLowering *TLI) {
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	625	// Figure out the right, legal destination reg to copy into.
				626	unsigned NumElts = VT.getVectorNumElements();
				627	MVT EltTy = VT.getVectorElementType();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	628
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	629	unsigned NumVectorRegs = 1;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	630
				631	// FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	632	// could break down into LHS/RHS like LegalizeDAG does.
				633	if (!isPowerOf2_32(NumElts)) {
				634	NumVectorRegs = NumElts;
				635	NumElts = 1;
				636	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	637
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	638	// Divide the input until we get to a supported size. This will always
				639	// end with a scalar if the target doesn't support vectors.
				640	while (NumElts > 1 && !TLI->isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) {
				641	NumElts >>= 1;
				642	NumVectorRegs <<= 1;
				643	}
				644
				645	NumIntermediates = NumVectorRegs;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	646
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	647	MVT NewVT = MVT::getVectorVT(EltTy, NumElts);
				648	if (!TLI->isTypeLegal(NewVT))
				649	NewVT = EltTy;
				650	IntermediateVT = NewVT;
				651
				652	EVT DestVT = TLI->getRegisterType(NewVT);
				653	RegisterVT = DestVT;
Chris Lattner	32b4b5a	2010-07-05 05:53:14 +0000	[diff] [blame]	654	if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16.
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	655	return NumVectorRegs*(NewVT.getSizeInBits()/DestVT.getSizeInBits());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	656
Chris Lattner	32b4b5a	2010-07-05 05:53:14 +0000	[diff] [blame]	657	// Otherwise, promotion or legal types use the same number of registers as
				658	// the vector decimated to the appropriate level.
				659	return NumVectorRegs;
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	660	}
				661
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	662	/// isLegalRC - Return true if the value types that can be represented by the
				663	/// specified register class are all legal.
				664	bool TargetLowering::isLegalRC(const TargetRegisterClass *RC) const {
				665	for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
				666	I != E; ++I) {
				667	if (isTypeLegal(*I))
				668	return true;
				669	}
				670	return false;
				671	}
				672
				673	/// hasLegalSuperRegRegClasses - Return true if the specified register class
				674	/// has one or more super-reg register classes that are legal.
Evan Cheng	d70f57b	2010-07-19 22:15:08 +0000	[diff] [blame]	675	bool
				676	TargetLowering::hasLegalSuperRegRegClasses(const TargetRegisterClass *RC) const{
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	677	if (*RC->superregclasses_begin() == 0)
				678	return false;
				679	for (TargetRegisterInfo::regclass_iterator I = RC->superregclasses_begin(),
				680	E = RC->superregclasses_end(); I != E; ++I) {
				681	const TargetRegisterClass RRC = I;
				682	if (isLegalRC(RRC))
				683	return true;
				684	}
				685	return false;
				686	}
				687
				688	/// findRepresentativeClass - Return the largest legal super-reg register class
Evan Cheng	4f6b467	2010-07-21 06:09:07 +0000	[diff] [blame]	689	/// of the register class for the specified type and its associated "cost".
				690	std::pair<const TargetRegisterClass*, uint8_t>
				691	TargetLowering::findRepresentativeClass(EVT VT) const {
				692	const TargetRegisterClass *RC = RegClassForVT[VT.getSimpleVT().SimpleTy];
				693	if (!RC)
				694	return std::make_pair(RC, 0);
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	695	const TargetRegisterClass *BestRC = RC;
				696	for (TargetRegisterInfo::regclass_iterator I = RC->superregclasses_begin(),
				697	E = RC->superregclasses_end(); I != E; ++I) {
				698	const TargetRegisterClass RRC = I;
				699	if (RRC->isASubClass() \|\| !isLegalRC(RRC))
				700	continue;
				701	if (!hasLegalSuperRegRegClasses(RRC))
Evan Cheng	4f6b467	2010-07-21 06:09:07 +0000	[diff] [blame]	702	return std::make_pair(RRC, 1);
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	703	BestRC = RRC;
				704	}
Evan Cheng	4f6b467	2010-07-21 06:09:07 +0000	[diff] [blame]	705	return std::make_pair(BestRC, 1);
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	706	}
				707
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	708
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	709	/// computeRegisterProperties - Once all of the register classes are added,
				710	/// this allows us to compute derived properties we expose.
				711	void TargetLowering::computeRegisterProperties() {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	712	assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE &&
Chris Lattner	bb97d81	2005-01-16 01:10:58 +0000	[diff] [blame]	713	"Too many value types for ValueTypeActions to hold!");
				714
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	715	// Everything defaults to needing one register.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	716	for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
Dan Gohman	b9f1019	2007-06-21 14:42:22 +0000	[diff] [blame]	717	NumRegistersForVT[i] = 1;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	718	RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i;
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	719	}
				720	// ...except isVoid, which doesn't need any registers.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	721	NumRegistersForVT[MVT::isVoid] = 0;
Misha Brukman	f976c85	2005-04-21 22:55:34 +0000	[diff] [blame]	722
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	723	// Find the largest integer register class.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	724	unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE;
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	725	for (; RegClassForVT[LargestIntReg] == 0; --LargestIntReg)
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	726	assert(LargestIntReg != MVT::i1 && "No integer registers defined!");
Chris Lattner	310968c	2005-01-07 07:44:53 +0000	[diff] [blame]	727
				728	// Every integer value type larger than this largest register takes twice as
				729	// many registers to represent as the previous ValueType.
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	730	for (unsigned ExpandedReg = LargestIntReg + 1; ; ++ExpandedReg) {
Dan Gohman	8a55ce4	2009-09-23 21:02:20 +0000	[diff] [blame]	731	EVT ExpandedVT = (MVT::SimpleValueType)ExpandedReg;
				732	if (!ExpandedVT.isInteger())
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	733	break;
Dan Gohman	b9f1019	2007-06-21 14:42:22 +0000	[diff] [blame]	734	NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1];
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	735	RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg;
				736	TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1);
Dan Gohman	8a55ce4	2009-09-23 21:02:20 +0000	[diff] [blame]	737	ValueTypeActions.setTypeAction(ExpandedVT, Expand);
Evan Cheng	1a8f1fe	2006-12-09 02:42:38 +0000	[diff] [blame]	738	}
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	739
				740	// Inspect all of the ValueType's smaller than the largest integer
				741	// register to see which ones need promotion.
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	742	unsigned LegalIntReg = LargestIntReg;
				743	for (unsigned IntReg = LargestIntReg - 1;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	744	IntReg >= (unsigned)MVT::i1; --IntReg) {
				745	EVT IVT = (MVT::SimpleValueType)IntReg;
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	746	if (isTypeLegal(IVT)) {
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	747	LegalIntReg = IntReg;
				748	} else {
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	749	RegisterTypeForVT[IntReg] = TransformToType[IntReg] =
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	750	(MVT::SimpleValueType)LegalIntReg;
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	751	ValueTypeActions.setTypeAction(IVT, Promote);
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	752	}
				753	}
				754
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	755	// ppcf128 type is really two f64's.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	756	if (!isTypeLegal(MVT::ppcf128)) {
				757	NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64];
				758	RegisterTypeForVT[MVT::ppcf128] = MVT::f64;
				759	TransformToType[MVT::ppcf128] = MVT::f64;
				760	ValueTypeActions.setTypeAction(MVT::ppcf128, Expand);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	761	}
Dale Johannesen	161e897	2007-10-05 20:04:43 +0000	[diff] [blame]	762
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	763	// Decide how to handle f64. If the target does not have native f64 support,
				764	// expand it to i64 and we will be generating soft float library calls.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	765	if (!isTypeLegal(MVT::f64)) {
				766	NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64];
				767	RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64];
				768	TransformToType[MVT::f64] = MVT::i64;
				769	ValueTypeActions.setTypeAction(MVT::f64, Expand);
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	770	}
				771
				772	// Decide how to handle f32. If the target does not have native support for
				773	// f32, promote it to f64 if it is legal. Otherwise, expand it to i32.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	774	if (!isTypeLegal(MVT::f32)) {
				775	if (isTypeLegal(MVT::f64)) {
				776	NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::f64];
				777	RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::f64];
				778	TransformToType[MVT::f32] = MVT::f64;
				779	ValueTypeActions.setTypeAction(MVT::f32, Promote);
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	780	} else {
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	781	NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32];
				782	RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32];
				783	TransformToType[MVT::f32] = MVT::i32;
				784	ValueTypeActions.setTypeAction(MVT::f32, Expand);
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	785	}
Evan Cheng	1a8f1fe	2006-12-09 02:42:38 +0000	[diff] [blame]	786	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	787
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	788	// Loop over all of the vector value types to see which need transformations.
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	789	for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE;
				790	i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) {
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	791	MVT VT = (MVT::SimpleValueType)i;
Chris Lattner	598751e	2010-07-05 05:36:21 +0000	[diff] [blame]	792	if (isTypeLegal(VT)) continue;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	793
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	794	// Determine if there is a legal wider type. If so, we should promote to
				795	// that wider vector type.
				796	EVT EltVT = VT.getVectorElementType();
				797	unsigned NElts = VT.getVectorNumElements();
				798	if (NElts != 1) {
				799	bool IsLegalWiderType = false;
				800	for (unsigned nVT = i+1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) {
				801	EVT SVT = (MVT::SimpleValueType)nVT;
				802	if (SVT.getVectorElementType() == EltVT &&
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	803	SVT.getVectorNumElements() > NElts &&
Dale Johannesen	e93d99c	2010-10-20 21:32:10 +0000	[diff] [blame]	804	isTypeLegal(SVT)) {
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	805	TransformToType[i] = SVT;
				806	RegisterTypeForVT[i] = SVT;
				807	NumRegistersForVT[i] = 1;
				808	ValueTypeActions.setTypeAction(VT, Promote);
				809	IsLegalWiderType = true;
				810	break;
				811	}
				812	}
				813	if (IsLegalWiderType) continue;
				814	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	815
Chris Lattner	598751e	2010-07-05 05:36:21 +0000	[diff] [blame]	816	MVT IntermediateVT;
				817	EVT RegisterVT;
				818	unsigned NumIntermediates;
				819	NumRegistersForVT[i] =
				820	getVectorTypeBreakdownMVT(VT, IntermediateVT, NumIntermediates,
				821	RegisterVT, this);
				822	RegisterTypeForVT[i] = RegisterVT;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	823
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	824	EVT NVT = VT.getPow2VectorType();
				825	if (NVT == VT) {
				826	// Type is already a power of 2. The default action is to split.
				827	TransformToType[i] = MVT::Other;
				828	ValueTypeActions.setTypeAction(VT, Expand);
				829	} else {
				830	TransformToType[i] = NVT;
				831	ValueTypeActions.setTypeAction(VT, Promote);
Dan Gohman	7f32156	2007-06-25 16:23:39 +0000	[diff] [blame]	832	}
Chris Lattner	3a593584	2006-03-16 19:50:01 +0000	[diff] [blame]	833	}
Evan Cheng	46dcb57	2010-07-19 18:47:01 +0000	[diff] [blame]	834
				835	// Determine the 'representative' register class for each value type.
				836	// An representative register class is the largest (meaning one which is
				837	// not a sub-register class / subreg register class) legal register class for
				838	// a group of value types. For example, on i386, i8, i16, and i32
				839	// representative would be GR32; while on x86_64 it's GR64.
Evan Cheng	d70f57b	2010-07-19 22:15:08 +0000	[diff] [blame]	840	for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) {
Evan Cheng	4f6b467	2010-07-21 06:09:07 +0000	[diff] [blame]	841	const TargetRegisterClass* RRC;
				842	uint8_t Cost;
				843	tie(RRC, Cost) = findRepresentativeClass((MVT::SimpleValueType)i);
				844	RepRegClassForVT[i] = RRC;
				845	RepRegClassCostForVT[i] = Cost;
Evan Cheng	d70f57b	2010-07-19 22:15:08 +0000	[diff] [blame]	846	}
Chris Lattner	bb97d81	2005-01-16 01:10:58 +0000	[diff] [blame]	847	}
Chris Lattner	cba82f9	2005-01-16 07:28:11 +0000	[diff] [blame]	848
Evan Cheng	7226158	2005-12-20 06:22:03 +0000	[diff] [blame]	849	const char *TargetLowering::getTargetNodeName(unsigned Opcode) const {
				850	return NULL;
				851	}
Evan Cheng	3a03ebb	2005-12-21 23:05:39 +0000	[diff] [blame]	852
Scott Michel	5b8f82e	2008-03-10 15:42:14 +0000	[diff] [blame]	853
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	854	MVT::SimpleValueType TargetLowering::getSetCCResultType(EVT VT) const {
Owen Anderson	1d0be15	2009-08-13 21:58:54 +0000	[diff] [blame]	855	return PointerTy.SimpleTy;
Scott Michel	5b8f82e	2008-03-10 15:42:14 +0000	[diff] [blame]	856	}
				857
Sanjiv Gupta	8f17a36	2009-12-28 02:40:33 +0000	[diff] [blame]	858	MVT::SimpleValueType TargetLowering::getCmpLibcallReturnType() const {
				859	return MVT::i32; // return the default value
				860	}
				861
Dan Gohman	7f32156	2007-06-25 16:23:39 +0000	[diff] [blame]	862	/// getVectorTypeBreakdown - Vector types are broken down into some number of
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	863	/// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32
				864	/// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack.
				865	/// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86.
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	866	///
Dan Gohman	7f32156	2007-06-25 16:23:39 +0000	[diff] [blame]	867	/// This method returns the number of registers needed, and the VT for each
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	868	/// register. It also returns the VT and quantity of the intermediate values
				869	/// before they are promoted/expanded.
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	870	///
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	871	unsigned TargetLowering::getVectorTypeBreakdown(LLVMContext &Context, EVT VT,
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	872	EVT &IntermediateVT,
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	873	unsigned &NumIntermediates,
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	874	EVT &RegisterVT) const {
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	875	unsigned NumElts = VT.getVectorNumElements();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	876
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	877	// If there is a wider vector type with the same element type as this one,
				878	// we should widen to that legal vector type. This handles things like
				879	// <2 x float> -> <4 x float>.
Chris Lattner	aafe626	2010-08-25 23:00:45 +0000	[diff] [blame]	880	if (NumElts != 1 && getTypeAction(VT) == Promote) {
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	881	RegisterVT = getTypeToTransformTo(Context, VT);
				882	if (isTypeLegal(RegisterVT)) {
				883	IntermediateVT = RegisterVT;
				884	NumIntermediates = 1;
				885	return 1;
				886	}
				887	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	888
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	889	// Figure out the right, legal destination reg to copy into.
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	890	EVT EltTy = VT.getVectorElementType();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	891
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	892	unsigned NumVectorRegs = 1;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	893
				894	// FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we
Nate Begeman	d73ab88	2007-11-27 19:28:48 +0000	[diff] [blame]	895	// could break down into LHS/RHS like LegalizeDAG does.
				896	if (!isPowerOf2_32(NumElts)) {
				897	NumVectorRegs = NumElts;
				898	NumElts = 1;
				899	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	900
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	901	// Divide the input until we get to a supported size. This will always
				902	// end with a scalar if the target doesn't support vectors.
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	903	while (NumElts > 1 && !isTypeLegal(
				904	EVT::getVectorVT(Context, EltTy, NumElts))) {
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	905	NumElts >>= 1;
				906	NumVectorRegs <<= 1;
				907	}
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	908
				909	NumIntermediates = NumVectorRegs;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	910
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	911	EVT NewVT = EVT::getVectorVT(Context, EltTy, NumElts);
Dan Gohman	7f32156	2007-06-25 16:23:39 +0000	[diff] [blame]	912	if (!isTypeLegal(NewVT))
				913	NewVT = EltTy;
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	914	IntermediateVT = NewVT;
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	915
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	916	EVT DestVT = getRegisterType(Context, NewVT);
Dan Gohman	b6f5b00	2007-06-28 23:29:44 +0000	[diff] [blame]	917	RegisterVT = DestVT;
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	918	if (DestVT.bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16.
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	919	return NumVectorRegs*(NewVT.getSizeInBits()/DestVT.getSizeInBits());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	920
Chris Lattner	e6f7c26	2010-08-25 22:49:25 +0000	[diff] [blame]	921	// Otherwise, promotion or legal types use the same number of registers as
				922	// the vector decimated to the appropriate level.
				923	return NumVectorRegs;
Chris Lattner	dc87929	2006-03-31 00:28:56 +0000	[diff] [blame]	924	}
				925
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	926	/// Get the EVTs and ArgFlags collections that represent the legalized return
Dan Gohman	84023e0	2010-07-10 09:00:22 +0000	[diff] [blame]	927	/// type of the given function. This does not require a DAG or a return value,
				928	/// and is suitable for use before any DAGs for the function are constructed.
				929	/// TODO: Move this out of TargetLowering.cpp.
				930	void llvm::GetReturnInfo(const Type* ReturnType, Attributes attr,
				931	SmallVectorImpl<ISD::OutputArg> &Outs,
				932	const TargetLowering &TLI,
				933	SmallVectorImpl<uint64_t> *Offsets) {
				934	SmallVector<EVT, 4> ValueVTs;
				935	ComputeValueVTs(TLI, ReturnType, ValueVTs);
				936	unsigned NumValues = ValueVTs.size();
				937	if (NumValues == 0) return;
				938	unsigned Offset = 0;
				939
				940	for (unsigned j = 0, f = NumValues; j != f; ++j) {
				941	EVT VT = ValueVTs[j];
				942	ISD::NodeType ExtendKind = ISD::ANY_EXTEND;
				943
				944	if (attr & Attribute::SExt)
				945	ExtendKind = ISD::SIGN_EXTEND;
				946	else if (attr & Attribute::ZExt)
				947	ExtendKind = ISD::ZERO_EXTEND;
				948
				949	// FIXME: C calling convention requires the return type to be promoted to
				950	// at least 32-bit. But this is not necessary for non-C calling
				951	// conventions. The frontend should mark functions whose return values
				952	// require promoting with signext or zeroext attributes.
				953	if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) {
				954	EVT MinVT = TLI.getRegisterType(ReturnType->getContext(), MVT::i32);
				955	if (VT.bitsLT(MinVT))
				956	VT = MinVT;
				957	}
				958
				959	unsigned NumParts = TLI.getNumRegisters(ReturnType->getContext(), VT);
				960	EVT PartVT = TLI.getRegisterType(ReturnType->getContext(), VT);
				961	unsigned PartSize = TLI.getTargetData()->getTypeAllocSize(
				962	PartVT.getTypeForEVT(ReturnType->getContext()));
				963
				964	// 'inreg' on function refers to return value
				965	ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy();
				966	if (attr & Attribute::InReg)
				967	Flags.setInReg();
				968
				969	// Propagate extension type if any
				970	if (attr & Attribute::SExt)
				971	Flags.setSExt();
				972	else if (attr & Attribute::ZExt)
				973	Flags.setZExt();
				974
				975	for (unsigned i = 0; i < NumParts; ++i) {
				976	Outs.push_back(ISD::OutputArg(Flags, PartVT, /isFixed=/true));
				977	if (Offsets) {
				978	Offsets->push_back(Offset);
				979	Offset += PartSize;
				980	}
				981	}
				982	}
				983	}
				984
Evan Cheng	3ae0543	2008-01-24 00:22:01 +0000	[diff] [blame]	985	/// getByValTypeAlignment - Return the desired alignment for ByVal aggregate
Dale Johannesen	28d08fd	2008-02-28 22:31:51 +0000	[diff] [blame]	986	/// function arguments in the caller parameter area. This is the actual
				987	/// alignment, not its logarithm.
Evan Cheng	3ae0543	2008-01-24 00:22:01 +0000	[diff] [blame]	988	unsigned TargetLowering::getByValTypeAlignment(const Type *Ty) const {
Dale Johannesen	28d08fd	2008-02-28 22:31:51 +0000	[diff] [blame]	989	return TD->getCallFrameTypeAlignment(Ty);
Evan Cheng	3ae0543	2008-01-24 00:22:01 +0000	[diff] [blame]	990	}
				991
Chris Lattner	071c62f	2010-01-25 23:26:13 +0000	[diff] [blame]	992	/// getJumpTableEncoding - Return the entry encoding for a jump table in the
				993	/// current function. The returned value is a member of the
				994	/// MachineJumpTableInfo::JTEntryKind enum.
				995	unsigned TargetLowering::getJumpTableEncoding() const {
				996	// In non-pic modes, just use the address of a block.
				997	if (getTargetMachine().getRelocationModel() != Reloc::PIC_)
				998	return MachineJumpTableInfo::EK_BlockAddress;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	999
Chris Lattner	071c62f	2010-01-25 23:26:13 +0000	[diff] [blame]	1000	// In PIC mode, if the target supports a GPRel32 directive, use it.
				1001	if (getTargetMachine().getMCAsmInfo()->getGPRel32Directive() != 0)
				1002	return MachineJumpTableInfo::EK_GPRel32BlockAddress;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1003
Chris Lattner	071c62f	2010-01-25 23:26:13 +0000	[diff] [blame]	1004	// Otherwise, use a label difference.
				1005	return MachineJumpTableInfo::EK_LabelDifference32;
				1006	}
				1007
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1008	SDValue TargetLowering::getPICJumpTableRelocBase(SDValue Table,
				1009	SelectionDAG &DAG) const {
Chris Lattner	f1214cb	2010-01-26 06:53:37 +0000	[diff] [blame]	1010	// If our PIC model is GP relative, use the global offset table as the base.
				1011	if (getJumpTableEncoding() == MachineJumpTableInfo::EK_GPRel32BlockAddress)
Dale Johannesen	b300d2a	2009-02-07 00:55:49 +0000	[diff] [blame]	1012	return DAG.getGLOBAL_OFFSET_TABLE(getPointerTy());
Evan Cheng	cc41586	2007-11-09 01:32:10 +0000	[diff] [blame]	1013	return Table;
				1014	}
				1015
Chris Lattner	13e97a2	2010-01-26 05:30:30 +0000	[diff] [blame]	1016	/// getPICJumpTableRelocBaseExpr - This returns the relocation base for the
				1017	/// given PIC jumptable, the same as getPICJumpTableRelocBase, but as an
				1018	/// MCExpr.
				1019	const MCExpr *
Chris Lattner	589c6f6	2010-01-26 06:28:43 +0000	[diff] [blame]	1020	TargetLowering::getPICJumpTableRelocBaseExpr(const MachineFunction *MF,
				1021	unsigned JTI,MCContext &Ctx) const{
Chris Lattner	beeb93e	2010-01-26 05:58:28 +0000	[diff] [blame]	1022	// The normal PIC reloc base is the label at the start of the jump table.
Chris Lattner	589c6f6	2010-01-26 06:28:43 +0000	[diff] [blame]	1023	return MCSymbolRefExpr::Create(MF->getJTISymbol(JTI, Ctx), Ctx);
Chris Lattner	13e97a2	2010-01-26 05:30:30 +0000	[diff] [blame]	1024	}
				1025
Dan Gohman	6520e20	2008-10-18 02:06:02 +0000	[diff] [blame]	1026	bool
				1027	TargetLowering::isOffsetFoldingLegal(const GlobalAddressSDNode *GA) const {
				1028	// Assume that everything is safe in static mode.
				1029	if (getTargetMachine().getRelocationModel() == Reloc::Static)
				1030	return true;
				1031
				1032	// In dynamic-no-pic mode, assume that known defined values are safe.
				1033	if (getTargetMachine().getRelocationModel() == Reloc::DynamicNoPIC &&
				1034	GA &&
				1035	!GA->getGlobal()->isDeclaration() &&
Duncan Sands	667d4b8	2009-03-07 15:45:40 +0000	[diff] [blame]	1036	!GA->getGlobal()->isWeakForLinker())
Dan Gohman	6520e20	2008-10-18 02:06:02 +0000	[diff] [blame]	1037	return true;
				1038
				1039	// Otherwise assume nothing is safe.
				1040	return false;
				1041	}
				1042
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	1043	//===----------------------------------------------------------------------===//
				1044	// Optimization Methods
				1045	//===----------------------------------------------------------------------===//
				1046
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1047	/// ShrinkDemandedConstant - Check to see if the specified operand of the
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1048	/// specified instruction is a constant integer. If so, check to see if there
				1049	/// are any bits set in the constant that are not demanded. If so, shrink the
				1050	/// constant and return true.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1051	bool TargetLowering::TargetLoweringOpt::ShrinkDemandedConstant(SDValue Op,
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1052	const APInt &Demanded) {
Dale Johannesen	de06470	2009-02-06 21:50:26 +0000	[diff] [blame]	1053	DebugLoc dl = Op.getDebugLoc();
Bill Wendling	36ae6c1	2009-03-04 00:18:06 +0000	[diff] [blame]	1054
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1055	// FIXME: ISD::SELECT, ISD::SELECT_CC
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1056	switch (Op.getOpcode()) {
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1057	default: break;
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1058	case ISD::XOR:
Bill Wendling	36ae6c1	2009-03-04 00:18:06 +0000	[diff] [blame]	1059	case ISD::AND:
				1060	case ISD::OR: {
				1061	ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
				1062	if (!C) return false;
				1063
				1064	if (Op.getOpcode() == ISD::XOR &&
				1065	(C->getAPIntValue() \| (~Demanded)).isAllOnesValue())
				1066	return false;
				1067
				1068	// if we can expand it to have all bits set, do it
				1069	if (C->getAPIntValue().intersects(~Demanded)) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1070	EVT VT = Op.getValueType();
Bill Wendling	36ae6c1	2009-03-04 00:18:06 +0000	[diff] [blame]	1071	SDValue New = DAG.getNode(Op.getOpcode(), dl, VT, Op.getOperand(0),
				1072	DAG.getConstant(Demanded &
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1073	C->getAPIntValue(),
Bill Wendling	36ae6c1	2009-03-04 00:18:06 +0000	[diff] [blame]	1074	VT));
				1075	return CombineTo(Op, New);
				1076	}
				1077
Nate Begeman	de99629	2006-02-03 22:24:05 +0000	[diff] [blame]	1078	break;
				1079	}
Bill Wendling	36ae6c1	2009-03-04 00:18:06 +0000	[diff] [blame]	1080	}
				1081
Nate Begeman	de99629	2006-02-03 22:24:05 +0000	[diff] [blame]	1082	return false;
				1083	}
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1084
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1085	/// ShrinkDemandedOp - Convert x+y to (VT)((SmallVT)x+(SmallVT)y) if the
				1086	/// casts are free. This uses isZExtFree and ZERO_EXTEND for the widening
				1087	/// cast, but it could be generalized for targets with other types of
				1088	/// implicit widening casts.
				1089	bool
				1090	TargetLowering::TargetLoweringOpt::ShrinkDemandedOp(SDValue Op,
				1091	unsigned BitWidth,
				1092	const APInt &Demanded,
				1093	DebugLoc dl) {
				1094	assert(Op.getNumOperands() == 2 &&
				1095	"ShrinkDemandedOp only supports binary operators!");
				1096	assert(Op.getNode()->getNumValues() == 1 &&
				1097	"ShrinkDemandedOp only supports nodes with one result!");
				1098
				1099	// Don't do this if the node has another user, which may require the
				1100	// full value.
				1101	if (!Op.getNode()->hasOneUse())
				1102	return false;
				1103
				1104	// Search for the smallest integer type with free casts to and from
				1105	// Op's type. For expedience, just check power-of-2 integer types.
				1106	const TargetLowering &TLI = DAG.getTargetLoweringInfo();
				1107	unsigned SmallVTBits = BitWidth - Demanded.countLeadingZeros();
				1108	if (!isPowerOf2_32(SmallVTBits))
				1109	SmallVTBits = NextPowerOf2(SmallVTBits);
				1110	for (; SmallVTBits < BitWidth; SmallVTBits = NextPowerOf2(SmallVTBits)) {
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	1111	EVT SmallVT = EVT::getIntegerVT(*DAG.getContext(), SmallVTBits);
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1112	if (TLI.isTruncateFree(Op.getValueType(), SmallVT) &&
				1113	TLI.isZExtFree(SmallVT, Op.getValueType())) {
				1114	// We found a type with free casts.
				1115	SDValue X = DAG.getNode(Op.getOpcode(), dl, SmallVT,
				1116	DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
				1117	Op.getNode()->getOperand(0)),
				1118	DAG.getNode(ISD::TRUNCATE, dl, SmallVT,
				1119	Op.getNode()->getOperand(1)));
				1120	SDValue Z = DAG.getNode(ISD::ZERO_EXTEND, dl, Op.getValueType(), X);
				1121	return CombineTo(Op, Z);
				1122	}
				1123	}
				1124	return false;
				1125	}
				1126
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1127	/// SimplifyDemandedBits - Look at Op. At this point, we know that only the
				1128	/// DemandedMask bits of the result of Op are ever used downstream. If we can
				1129	/// use this information to simplify Op, create a new simplified DAG node and
				1130	/// return true, returning the original and new nodes in Old and New. Otherwise,
				1131	/// analyze the expression and return a mask of KnownOne and KnownZero bits for
				1132	/// the expression (used to simplify the caller). The KnownZero/One bits may
				1133	/// only be accurate for those bits in the DemandedMask.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1134	bool TargetLowering::SimplifyDemandedBits(SDValue Op,
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1135	const APInt &DemandedMask,
				1136	APInt &KnownZero,
				1137	APInt &KnownOne,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1138	TargetLoweringOpt &TLO,
				1139	unsigned Depth) const {
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1140	unsigned BitWidth = DemandedMask.getBitWidth();
Dan Gohman	87862e7	2009-12-11 21:31:27 +0000	[diff] [blame]	1141	assert(Op.getValueType().getScalarType().getSizeInBits() == BitWidth &&
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1142	"Mask size mismatches value type size!");
				1143	APInt NewMask = DemandedMask;
Dale Johannesen	6f38cb6	2009-02-07 19:59:05 +0000	[diff] [blame]	1144	DebugLoc dl = Op.getDebugLoc();
Chris Lattner	3fc5b01	2007-05-17 18:19:23 +0000	[diff] [blame]	1145
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1146	// Don't know anything.
				1147	KnownZero = KnownOne = APInt(BitWidth, 0);
				1148
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1149	// Other users may use these bits.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1150	if (!Op.getNode()->hasOneUse()) {
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1151	if (Depth != 0) {
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1152	// If not at the root, Just compute the KnownZero/KnownOne bits to
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1153	// simplify things downstream.
Dan Gohman	ea859be	2007-06-22 14:59:07 +0000	[diff] [blame]	1154	TLO.DAG.ComputeMaskedBits(Op, DemandedMask, KnownZero, KnownOne, Depth);
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1155	return false;
				1156	}
				1157	// If this is the root being simplified, allow it to have multiple uses,
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1158	// just set the NewMask to all bits.
				1159	NewMask = APInt::getAllOnesValue(BitWidth);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1160	} else if (DemandedMask == 0) {
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1161	// Not demanding any bits from Op.
				1162	if (Op.getOpcode() != ISD::UNDEF)
Dale Johannesen	e8d7230	2009-02-06 23:05:02 +0000	[diff] [blame]	1163	return TLO.CombineTo(Op, TLO.DAG.getUNDEF(Op.getValueType()));
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1164	return false;
				1165	} else if (Depth == 6) { // Limit search depth.
				1166	return false;
				1167	}
				1168
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1169	APInt KnownZero2, KnownOne2, KnownZeroOut, KnownOneOut;
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1170	switch (Op.getOpcode()) {
				1171	case ISD::Constant:
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1172	// We know all of the bits for a constant!
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1173	KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & NewMask;
				1174	KnownZero = ~KnownOne & NewMask;
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1175	return false; // Don't fall through, will infinitely loop.
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1176	case ISD::AND:
Chris Lattner	81cd355	2006-02-27 00:36:27 +0000	[diff] [blame]	1177	// If the RHS is a constant, check to see if the LHS would be zero without
				1178	// using the bits from the RHS. Below, we use knowledge about the RHS to
				1179	// simplify the LHS, here we're using information from the LHS to simplify
				1180	// the RHS.
				1181	if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1182	APInt LHSZero, LHSOne;
Dale Johannesen	97fd9a5	2011-01-10 21:53:07 +0000	[diff] [blame]	1183	// Do not increment Depth here; that can cause an infinite loop.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1184	TLO.DAG.ComputeMaskedBits(Op.getOperand(0), NewMask,
Dale Johannesen	97fd9a5	2011-01-10 21:53:07 +0000	[diff] [blame]	1185	LHSZero, LHSOne, Depth);
Chris Lattner	81cd355	2006-02-27 00:36:27 +0000	[diff] [blame]	1186	// If the LHS already has zeros where RHSC does, this and is dead.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1187	if ((LHSZero & NewMask) == (~RHSC->getAPIntValue() & NewMask))
Chris Lattner	81cd355	2006-02-27 00:36:27 +0000	[diff] [blame]	1188	return TLO.CombineTo(Op, Op.getOperand(0));
				1189	// If any of the set bits in the RHS are known zero on the LHS, shrink
				1190	// the constant.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1191	if (TLO.ShrinkDemandedConstant(Op, ~LHSZero & NewMask))
Chris Lattner	81cd355	2006-02-27 00:36:27 +0000	[diff] [blame]	1192	return true;
				1193	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1194
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1195	if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1196	KnownOne, TLO, Depth+1))
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1197	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1198	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1199	if (SimplifyDemandedBits(Op.getOperand(0), ~KnownZero & NewMask,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1200	KnownZero2, KnownOne2, TLO, Depth+1))
				1201	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1202	assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
				1203
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1204	// If all of the demanded bits are known one on one side, return the other.
				1205	// These bits cannot contribute to the result of the 'and'.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1206	if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1207	return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1208	if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1209	return TLO.CombineTo(Op, Op.getOperand(1));
				1210	// If all of the demanded bits in the inputs are known zeros, return zero.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1211	if ((NewMask & (KnownZero\|KnownZero2)) == NewMask)
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1212	return TLO.CombineTo(Op, TLO.DAG.getConstant(0, Op.getValueType()));
				1213	// If the RHS is a constant, see if we can simplify it.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1214	if (TLO.ShrinkDemandedConstant(Op, ~KnownZero2 & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1215	return true;
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1216	// If the operation can be done in a smaller type, do so.
Dan Gohman	4e39e9d	2010-06-24 14:30:44 +0000	[diff] [blame]	1217	if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1218	return true;
				1219
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1220	// Output known-1 bits are only known if set in both the LHS & RHS.
				1221	KnownOne &= KnownOne2;
				1222	// Output known-0 are known to be clear if zero in either the LHS \| RHS.
				1223	KnownZero \|= KnownZero2;
				1224	break;
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1225	case ISD::OR:
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1226	if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1227	KnownOne, TLO, Depth+1))
				1228	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1229	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1230	if (SimplifyDemandedBits(Op.getOperand(0), ~KnownOne & NewMask,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1231	KnownZero2, KnownOne2, TLO, Depth+1))
				1232	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1233	assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
				1234
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1235	// If all of the demanded bits are known zero on one side, return the other.
				1236	// These bits cannot contribute to the result of the 'or'.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1237	if ((NewMask & ~KnownOne2 & KnownZero) == (~KnownOne2 & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1238	return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1239	if ((NewMask & ~KnownOne & KnownZero2) == (~KnownOne & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1240	return TLO.CombineTo(Op, Op.getOperand(1));
				1241	// If all of the potentially set bits on one side are known to be set on
				1242	// the other side, just use the 'other' side.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1243	if ((NewMask & ~KnownZero & KnownOne2) == (~KnownZero & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1244	return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1245	if ((NewMask & ~KnownZero2 & KnownOne) == (~KnownZero2 & NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1246	return TLO.CombineTo(Op, Op.getOperand(1));
				1247	// If the RHS is a constant, see if we can simplify it.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1248	if (TLO.ShrinkDemandedConstant(Op, NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1249	return true;
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1250	// If the operation can be done in a smaller type, do so.
Dan Gohman	4e39e9d	2010-06-24 14:30:44 +0000	[diff] [blame]	1251	if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1252	return true;
				1253
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1254	// Output known-0 bits are only known if clear in both the LHS & RHS.
				1255	KnownZero &= KnownZero2;
				1256	// Output known-1 are known to be set if set in either the LHS \| RHS.
				1257	KnownOne \|= KnownOne2;
				1258	break;
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1259	case ISD::XOR:
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1260	if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1261	KnownOne, TLO, Depth+1))
				1262	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1263	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1264	if (SimplifyDemandedBits(Op.getOperand(0), NewMask, KnownZero2,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1265	KnownOne2, TLO, Depth+1))
				1266	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1267	assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
				1268
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1269	// If all of the demanded bits are known zero on one side, return the other.
				1270	// These bits cannot contribute to the result of the 'xor'.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1271	if ((KnownZero & NewMask) == NewMask)
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1272	return TLO.CombineTo(Op, Op.getOperand(0));
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1273	if ((KnownZero2 & NewMask) == NewMask)
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1274	return TLO.CombineTo(Op, Op.getOperand(1));
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1275	// If the operation can be done in a smaller type, do so.
Dan Gohman	4e39e9d	2010-06-24 14:30:44 +0000	[diff] [blame]	1276	if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1277	return true;
				1278
Chris Lattner	3687c1a	2006-11-27 21:50:02 +0000	[diff] [blame]	1279	// If all of the unknown bits are known to be zero on one side or the other
				1280	// (but not both) turn this into an inclusive or.
				1281	// e.g. (A & C1)^(B & C2) -> (A & C1)\|(B & C2) iff C1&C2 == 0
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1282	if ((NewMask & ~KnownZero & ~KnownZero2) == 0)
Dale Johannesen	de06470	2009-02-06 21:50:26 +0000	[diff] [blame]	1283	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::OR, dl, Op.getValueType(),
Chris Lattner	3687c1a	2006-11-27 21:50:02 +0000	[diff] [blame]	1284	Op.getOperand(0),
				1285	Op.getOperand(1)));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1286
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1287	// Output known-0 bits are known if clear or set in both the LHS & RHS.
				1288	KnownZeroOut = (KnownZero & KnownZero2) \| (KnownOne & KnownOne2);
				1289	// Output known-1 are known to be set if set in only one of the LHS, RHS.
				1290	KnownOneOut = (KnownZero & KnownOne2) \| (KnownOne & KnownZero2);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1291
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1292	// If all of the demanded bits on one side are known, and all of the set
				1293	// bits on that side are also known to be set on the other side, turn this
				1294	// into an AND, as we know the bits will be cleared.
				1295	// e.g. (X \| C1) ^ C2 --> (X \| C1) & ~C2 iff (C1&C2) == C2
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1296	if ((NewMask & (KnownZero\|KnownOne)) == NewMask) { // all known
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1297	if ((KnownOne & KnownOne2) == KnownOne) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1298	EVT VT = Op.getValueType();
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1299	SDValue ANDC = TLO.DAG.getConstant(~KnownOne & NewMask, VT);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1300	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::AND, dl, VT,
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1301	Op.getOperand(0), ANDC));
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1302	}
				1303	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1304
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1305	// If the RHS is a constant, see if we can simplify it.
Torok Edwin	4fea2e9	2008-04-06 21:23:02 +0000	[diff] [blame]	1306	// for XOR, we prefer to force bits to 1 if they will make a -1.
				1307	// if we can't force bits, try to shrink constant
				1308	if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
				1309	APInt Expanded = C->getAPIntValue() \| (~NewMask);
				1310	// if we can expand it to have all bits set, do it
				1311	if (Expanded.isAllOnesValue()) {
				1312	if (Expanded != C->getAPIntValue()) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1313	EVT VT = Op.getValueType();
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1314	SDValue New = TLO.DAG.getNode(Op.getOpcode(), dl,VT, Op.getOperand(0),
Torok Edwin	4fea2e9	2008-04-06 21:23:02 +0000	[diff] [blame]	1315	TLO.DAG.getConstant(Expanded, VT));
				1316	return TLO.CombineTo(Op, New);
				1317	}
				1318	// if it already has all the bits set, nothing to change
				1319	// but don't shrink either!
				1320	} else if (TLO.ShrinkDemandedConstant(Op, NewMask)) {
				1321	return true;
				1322	}
				1323	}
				1324
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1325	KnownZero = KnownZeroOut;
				1326	KnownOne = KnownOneOut;
				1327	break;
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1328	case ISD::SELECT:
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1329	if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1330	KnownOne, TLO, Depth+1))
				1331	return true;
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1332	if (SimplifyDemandedBits(Op.getOperand(1), NewMask, KnownZero2,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1333	KnownOne2, TLO, Depth+1))
				1334	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1335	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
				1336	assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
				1337
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1338	// If the operands are constants, see if we can simplify them.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1339	if (TLO.ShrinkDemandedConstant(Op, NewMask))
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1340	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1341
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1342	// Only known if known in both the LHS and RHS.
				1343	KnownOne &= KnownOne2;
				1344	KnownZero &= KnownZero2;
				1345	break;
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1346	case ISD::SELECT_CC:
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1347	if (SimplifyDemandedBits(Op.getOperand(3), NewMask, KnownZero,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1348	KnownOne, TLO, Depth+1))
				1349	return true;
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1350	if (SimplifyDemandedBits(Op.getOperand(2), NewMask, KnownZero2,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1351	KnownOne2, TLO, Depth+1))
				1352	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1353	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
				1354	assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
				1355
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1356	// If the operands are constants, see if we can simplify them.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1357	if (TLO.ShrinkDemandedConstant(Op, NewMask))
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1358	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1359
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1360	// Only known if known in both the LHS and RHS.
				1361	KnownOne &= KnownOne2;
				1362	KnownZero &= KnownZero2;
				1363	break;
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1364	case ISD::SHL:
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1365	if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1366	unsigned ShAmt = SA->getZExtValue();
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1367	SDValue InOp = Op.getOperand(0);
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1368
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1369	// If the shift count is an invalid immediate, don't do anything.
				1370	if (ShAmt >= BitWidth)
				1371	break;
				1372
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1373	// If this is ((X >>u C1) << ShAmt), see if we can simplify this into a
				1374	// single shift. We can do this if the bottom bits (which are shifted
				1375	// out) are never demanded.
				1376	if (InOp.getOpcode() == ISD::SRL &&
				1377	isa<ConstantSDNode>(InOp.getOperand(1))) {
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1378	if (ShAmt && (NewMask & APInt::getLowBitsSet(BitWidth, ShAmt)) == 0) {
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1379	unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1380	unsigned Opc = ISD::SHL;
				1381	int Diff = ShAmt-C1;
				1382	if (Diff < 0) {
				1383	Diff = -Diff;
				1384	Opc = ISD::SRL;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1385	}
				1386
				1387	SDValue NewSA =
Chris Lattner	4e7e6cd	2007-05-30 16:30:06 +0000	[diff] [blame]	1388	TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1389	EVT VT = Op.getValueType();
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1390	return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1391	InOp.getOperand(0), NewSA));
				1392	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1393	}
				1394
Dan Gohman	a4f4d69	2010-07-23 18:03:30 +0000	[diff] [blame]	1395	if (SimplifyDemandedBits(InOp, NewMask.lshr(ShAmt),
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1396	KnownZero, KnownOne, TLO, Depth+1))
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1397	return true;
Dan Gohman	a4f4d69	2010-07-23 18:03:30 +0000	[diff] [blame]	1398
				1399	// Convert (shl (anyext x, c)) to (anyext (shl x, c)) if the high bits
				1400	// are not demanded. This will likely allow the anyext to be folded away.
				1401	if (InOp.getNode()->getOpcode() == ISD::ANY_EXTEND) {
				1402	SDValue InnerOp = InOp.getNode()->getOperand(0);
				1403	EVT InnerVT = InnerOp.getValueType();
				1404	if ((APInt::getHighBitsSet(BitWidth,
				1405	BitWidth - InnerVT.getSizeInBits()) &
				1406	DemandedMask) == 0 &&
				1407	isTypeDesirableForOp(ISD::SHL, InnerVT)) {
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	1408	EVT ShTy = getShiftAmountTy(InnerVT);
Dan Gohman	cd20c6f	2010-07-23 21:08:12 +0000	[diff] [blame]	1409	if (!APInt(BitWidth, ShAmt).isIntN(ShTy.getSizeInBits()))
				1410	ShTy = InnerVT;
Dan Gohman	a4f4d69	2010-07-23 18:03:30 +0000	[diff] [blame]	1411	SDValue NarrowShl =
				1412	TLO.DAG.getNode(ISD::SHL, dl, InnerVT, InnerOp,
Dan Gohman	cd20c6f	2010-07-23 21:08:12 +0000	[diff] [blame]	1413	TLO.DAG.getConstant(ShAmt, ShTy));
Dan Gohman	a4f4d69	2010-07-23 18:03:30 +0000	[diff] [blame]	1414	return
				1415	TLO.CombineTo(Op,
				1416	TLO.DAG.getNode(ISD::ANY_EXTEND, dl, Op.getValueType(),
				1417	NarrowShl));
				1418	}
				1419	}
				1420
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1421	KnownZero <<= SA->getZExtValue();
				1422	KnownOne <<= SA->getZExtValue();
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1423	// low bits known zero.
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1424	KnownZero \|= APInt::getLowBitsSet(BitWidth, SA->getZExtValue());
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1425	}
				1426	break;
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1427	case ISD::SRL:
				1428	if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1429	EVT VT = Op.getValueType();
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1430	unsigned ShAmt = SA->getZExtValue();
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	1431	unsigned VTSize = VT.getSizeInBits();
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1432	SDValue InOp = Op.getOperand(0);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1433
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1434	// If the shift count is an invalid immediate, don't do anything.
				1435	if (ShAmt >= BitWidth)
				1436	break;
				1437
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1438	// If this is ((X << C1) >>u ShAmt), see if we can simplify this into a
				1439	// single shift. We can do this if the top bits (which are shifted out)
				1440	// are never demanded.
				1441	if (InOp.getOpcode() == ISD::SHL &&
				1442	isa<ConstantSDNode>(InOp.getOperand(1))) {
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1443	if (ShAmt && (NewMask & APInt::getHighBitsSet(VTSize, ShAmt)) == 0) {
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1444	unsigned C1= cast<ConstantSDNode>(InOp.getOperand(1))->getZExtValue();
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1445	unsigned Opc = ISD::SRL;
				1446	int Diff = ShAmt-C1;
				1447	if (Diff < 0) {
				1448	Diff = -Diff;
				1449	Opc = ISD::SHL;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1450	}
				1451
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1452	SDValue NewSA =
Chris Lattner	8c7d2d5	2007-04-17 22:53:02 +0000	[diff] [blame]	1453	TLO.DAG.getConstant(Diff, Op.getOperand(1).getValueType());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1454	return TLO.CombineTo(Op, TLO.DAG.getNode(Opc, dl, VT,
Chris Lattner	895c4ab	2007-04-17 21:14:16 +0000	[diff] [blame]	1455	InOp.getOperand(0), NewSA));
				1456	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1457	}
				1458
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1459	// Compute the new bits that are at the top now.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1460	if (SimplifyDemandedBits(InOp, (NewMask << ShAmt),
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1461	KnownZero, KnownOne, TLO, Depth+1))
				1462	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1463	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1464	KnownZero = KnownZero.lshr(ShAmt);
				1465	KnownOne = KnownOne.lshr(ShAmt);
Chris Lattner	c4fa603	2006-06-13 16:52:37 +0000	[diff] [blame]	1466
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1467	APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
Chris Lattner	c4fa603	2006-06-13 16:52:37 +0000	[diff] [blame]	1468	KnownZero \|= HighBits; // High bits known zero.
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1469	}
				1470	break;
				1471	case ISD::SRA:
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1472	// If this is an arithmetic shift right and only the low-bit is set, we can
				1473	// always convert this into a logical shr, even if the shift amount is
				1474	// variable. The low bit of the shift cannot be an input sign bit unless
				1475	// the shift amount is >= the size of the datatype, which is undefined.
				1476	if (DemandedMask == 1)
Evan Cheng	e5b51ac	2010-04-17 06:13:15 +0000	[diff] [blame]	1477	return TLO.CombineTo(Op,
				1478	TLO.DAG.getNode(ISD::SRL, dl, Op.getValueType(),
				1479	Op.getOperand(0), Op.getOperand(1)));
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1480
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1481	if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1482	EVT VT = Op.getValueType();
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	1483	unsigned ShAmt = SA->getZExtValue();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1484
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1485	// If the shift count is an invalid immediate, don't do anything.
				1486	if (ShAmt >= BitWidth)
				1487	break;
				1488
				1489	APInt InDemandedMask = (NewMask << ShAmt);
Chris Lattner	1b73713	2006-05-08 17:22:53 +0000	[diff] [blame]	1490
				1491	// If any of the demanded bits are produced by the sign extension, we also
				1492	// demand the input sign bit.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1493	APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt);
				1494	if (HighBits.intersects(NewMask))
Dan Gohman	87862e7	2009-12-11 21:31:27 +0000	[diff] [blame]	1495	InDemandedMask \|= APInt::getSignBit(VT.getScalarType().getSizeInBits());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1496
Chris Lattner	1b73713	2006-05-08 17:22:53 +0000	[diff] [blame]	1497	if (SimplifyDemandedBits(Op.getOperand(0), InDemandedMask,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1498	KnownZero, KnownOne, TLO, Depth+1))
				1499	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1500	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1501	KnownZero = KnownZero.lshr(ShAmt);
				1502	KnownOne = KnownOne.lshr(ShAmt);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1503
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1504	// Handle the sign bit, adjusted to where it is now in the mask.
				1505	APInt SignBit = APInt::getSignBit(BitWidth).lshr(ShAmt);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1506
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1507	// If the input sign bit is known to be zero, or if none of the top bits
				1508	// are demanded, turn this into an unsigned shift right.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1509	if (KnownZero.intersects(SignBit) \|\| (HighBits & ~NewMask) == HighBits) {
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1510	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl, VT,
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1511	Op.getOperand(0),
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1512	Op.getOperand(1)));
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1513	} else if (KnownOne.intersects(SignBit)) { // New bits are known one.
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1514	KnownOne \|= HighBits;
				1515	}
				1516	}
				1517	break;
				1518	case ISD::SIGN_EXTEND_INREG: {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1519	EVT EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1520
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1521	// Sign extension. Compute the demanded bits in the result that are not
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1522	// present in the input.
Dan Gohman	d199636	2010-01-09 02:13:55 +0000	[diff] [blame]	1523	APInt NewBits =
				1524	APInt::getHighBitsSet(BitWidth,
Eli Friedman	1d17d19	2010-08-02 04:42:25 +0000	[diff] [blame]	1525	BitWidth - EVT.getScalarType().getSizeInBits());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1526
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1527	// If none of the extended bits are demanded, eliminate the sextinreg.
Eli Friedman	1d17d19	2010-08-02 04:42:25 +0000	[diff] [blame]	1528	if ((NewBits & NewMask) == 0)
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1529	return TLO.CombineTo(Op, Op.getOperand(0));
				1530
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1531	APInt InSignBit =
				1532	APInt::getSignBit(EVT.getScalarType().getSizeInBits()).zext(BitWidth);
Dan Gohman	d199636	2010-01-09 02:13:55 +0000	[diff] [blame]	1533	APInt InputDemandedBits =
				1534	APInt::getLowBitsSet(BitWidth,
				1535	EVT.getScalarType().getSizeInBits()) &
				1536	NewMask;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1537
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1538	// Since the sign extended bits are demanded, we know that the sign
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1539	// bit is demanded.
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1540	InputDemandedBits \|= InSignBit;
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1541
				1542	if (SimplifyDemandedBits(Op.getOperand(0), InputDemandedBits,
				1543	KnownZero, KnownOne, TLO, Depth+1))
				1544	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1545	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1546
				1547	// If the sign bit of the input is known set or clear, then we know the
				1548	// top bits of the result.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1549
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1550	// If the input sign bit is known zero, convert this into a zero extension.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1551	if (KnownZero.intersects(InSignBit))
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1552	return TLO.CombineTo(Op,
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1553	TLO.DAG.getZeroExtendInReg(Op.getOperand(0),dl,EVT));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1554
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1555	if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1556	KnownOne \|= NewBits;
				1557	KnownZero &= ~NewBits;
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1558	} else { // Input sign bit unknown
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1559	KnownZero &= ~NewBits;
				1560	KnownOne &= ~NewBits;
				1561	}
				1562	break;
				1563	}
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1564	case ISD::ZERO_EXTEND: {
Dan Gohman	d199636	2010-01-09 02:13:55 +0000	[diff] [blame]	1565	unsigned OperandBitWidth =
				1566	Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1567	APInt InMask = NewMask.trunc(OperandBitWidth);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1568
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1569	// If none of the top bits are demanded, convert this into an any_extend.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1570	APInt NewBits =
				1571	APInt::getHighBitsSet(BitWidth, BitWidth - OperandBitWidth) & NewMask;
				1572	if (!NewBits.intersects(NewMask))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1573	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1574	Op.getValueType(),
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1575	Op.getOperand(0)));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1576
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1577	if (SimplifyDemandedBits(Op.getOperand(0), InMask,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1578	KnownZero, KnownOne, TLO, Depth+1))
				1579	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1580	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1581	KnownZero = KnownZero.zext(BitWidth);
				1582	KnownOne = KnownOne.zext(BitWidth);
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1583	KnownZero \|= NewBits;
				1584	break;
				1585	}
				1586	case ISD::SIGN_EXTEND: {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1587	EVT InVT = Op.getOperand(0).getValueType();
Dan Gohman	d199636	2010-01-09 02:13:55 +0000	[diff] [blame]	1588	unsigned InBits = InVT.getScalarType().getSizeInBits();
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1589	APInt InMask = APInt::getLowBitsSet(BitWidth, InBits);
Dan Gohman	9736028	2008-03-11 21:29:43 +0000	[diff] [blame]	1590	APInt InSignBit = APInt::getBitsSet(BitWidth, InBits - 1, InBits);
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1591	APInt NewBits = ~InMask & NewMask;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1592
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1593	// If none of the top bits are demanded, convert this into an any_extend.
				1594	if (NewBits == 0)
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1595	return TLO.CombineTo(Op,TLO.DAG.getNode(ISD::ANY_EXTEND, dl,
				1596	Op.getValueType(),
				1597	Op.getOperand(0)));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1598
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1599	// Since some of the sign extended bits are demanded, we know that the sign
				1600	// bit is demanded.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1601	APInt InDemandedBits = InMask & NewMask;
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1602	InDemandedBits \|= InSignBit;
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1603	InDemandedBits = InDemandedBits.trunc(InBits);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1604
				1605	if (SimplifyDemandedBits(Op.getOperand(0), InDemandedBits, KnownZero,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1606	KnownOne, TLO, Depth+1))
				1607	return true;
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1608	KnownZero = KnownZero.zext(BitWidth);
				1609	KnownOne = KnownOne.zext(BitWidth);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1610
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1611	// If the sign bit is known zero, convert this to a zero extend.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1612	if (KnownZero.intersects(InSignBit))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1613	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::ZERO_EXTEND, dl,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1614	Op.getValueType(),
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1615	Op.getOperand(0)));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1616
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1617	// If the sign bit is known one, the top bits match.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1618	if (KnownOne.intersects(InSignBit)) {
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1619	KnownOne \|= NewBits;
				1620	KnownZero &= ~NewBits;
				1621	} else { // Otherwise, top bits aren't known.
				1622	KnownOne &= ~NewBits;
				1623	KnownZero &= ~NewBits;
				1624	}
				1625	break;
				1626	}
				1627	case ISD::ANY_EXTEND: {
Dan Gohman	d199636	2010-01-09 02:13:55 +0000	[diff] [blame]	1628	unsigned OperandBitWidth =
				1629	Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1630	APInt InMask = NewMask.trunc(OperandBitWidth);
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1631	if (SimplifyDemandedBits(Op.getOperand(0), InMask,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1632	KnownZero, KnownOne, TLO, Depth+1))
				1633	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1634	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1635	KnownZero = KnownZero.zext(BitWidth);
				1636	KnownOne = KnownOne.zext(BitWidth);
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1637	break;
				1638	}
Chris Lattner	fe8babf	2006-05-05 22:32:12 +0000	[diff] [blame]	1639	case ISD::TRUNCATE: {
Chris Lattner	c93dfda	2006-05-06 00:11:52 +0000	[diff] [blame]	1640	// Simplify the input, using demanded bit information, and compute the known
				1641	// zero/one bits live out.
Dan Gohman	042919c	2010-03-01 17:59:21 +0000	[diff] [blame]	1642	unsigned OperandBitWidth =
				1643	Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1644	APInt TruncMask = NewMask.zext(OperandBitWidth);
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1645	if (SimplifyDemandedBits(Op.getOperand(0), TruncMask,
Chris Lattner	fe8babf	2006-05-05 22:32:12 +0000	[diff] [blame]	1646	KnownZero, KnownOne, TLO, Depth+1))
				1647	return true;
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1648	KnownZero = KnownZero.trunc(BitWidth);
				1649	KnownOne = KnownOne.trunc(BitWidth);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1650
Chris Lattner	c93dfda	2006-05-06 00:11:52 +0000	[diff] [blame]	1651	// If the input is only used by this truncate, see if we can shrink it based
				1652	// on the known demanded bits.
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	1653	if (Op.getOperand(0).getNode()->hasOneUse()) {
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1654	SDValue In = Op.getOperand(0);
Chris Lattner	c93dfda	2006-05-06 00:11:52 +0000	[diff] [blame]	1655	switch (In.getOpcode()) {
				1656	default: break;
				1657	case ISD::SRL:
				1658	// Shrink SRL by a constant if none of the high bits shifted in are
				1659	// demanded.
Evan Cheng	e5b51ac	2010-04-17 06:13:15 +0000	[diff] [blame]	1660	if (TLO.LegalTypes() &&
				1661	!isTypeDesirableForOp(ISD::SRL, Op.getValueType()))
				1662	// Do not turn (vt1 truncate (vt2 srl)) into (vt1 srl) if vt1 is
				1663	// undesirable.
				1664	break;
				1665	ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(In.getOperand(1));
				1666	if (!ShAmt)
				1667	break;
				1668	APInt HighBits = APInt::getHighBitsSet(OperandBitWidth,
				1669	OperandBitWidth - BitWidth);
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	1670	HighBits = HighBits.lshr(ShAmt->getZExtValue()).trunc(BitWidth);
Evan Cheng	e5b51ac	2010-04-17 06:13:15 +0000	[diff] [blame]	1671
				1672	if (ShAmt->getZExtValue() < BitWidth && !(HighBits & NewMask)) {
				1673	// None of the shifted in bits are needed. Add a truncate of the
				1674	// shift input, then shift it.
				1675	SDValue NewTrunc = TLO.DAG.getNode(ISD::TRUNCATE, dl,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1676	Op.getValueType(),
Evan Cheng	e5b51ac	2010-04-17 06:13:15 +0000	[diff] [blame]	1677	In.getOperand(0));
				1678	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SRL, dl,
				1679	Op.getValueType(),
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1680	NewTrunc,
Evan Cheng	e5b51ac	2010-04-17 06:13:15 +0000	[diff] [blame]	1681	In.getOperand(1)));
Chris Lattner	c93dfda	2006-05-06 00:11:52 +0000	[diff] [blame]	1682	}
				1683	break;
				1684	}
				1685	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1686
				1687	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Chris Lattner	fe8babf	2006-05-05 22:32:12 +0000	[diff] [blame]	1688	break;
				1689	}
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1690	case ISD::AssertZext: {
Dan Gohman	400f75c	2010-06-03 20:21:33 +0000	[diff] [blame]	1691	// Demand all the bits of the input that are demanded in the output.
				1692	// The low bits are obvious; the high bits are demanded because we're
				1693	// asserting that they're zero here.
				1694	if (SimplifyDemandedBits(Op.getOperand(0), NewMask,
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1695	KnownZero, KnownOne, TLO, Depth+1))
				1696	return true;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1697	assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
Dan Gohman	400f75c	2010-06-03 20:21:33 +0000	[diff] [blame]	1698
				1699	EVT VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
				1700	APInt InMask = APInt::getLowBitsSet(BitWidth,
				1701	VT.getSizeInBits());
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1702	KnownZero \|= ~InMask & NewMask;
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1703	break;
				1704	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1705	case ISD::BITCAST:
Chris Lattner	2ceb2cf	2007-12-22 21:35:38 +0000	[diff] [blame]	1706	#if 0
				1707	// If this is an FP->Int bitcast and if the sign bit is the only thing that
				1708	// is demanded, turn this into a FGETSIGN.
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1709	if (NewMask == EVT::getIntegerVTSignBit(Op.getValueType()) &&
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	1710	MVT::isFloatingPoint(Op.getOperand(0).getValueType()) &&
				1711	!MVT::isVector(Op.getOperand(0).getValueType())) {
Chris Lattner	2ceb2cf	2007-12-22 21:35:38 +0000	[diff] [blame]	1712	// Only do this xform if FGETSIGN is valid or if before legalize.
				1713	if (!TLO.AfterLegalize \|\|
				1714	isOperationLegal(ISD::FGETSIGN, Op.getValueType())) {
				1715	// Make a FGETSIGN + SHL to move the sign bit into the appropriate
				1716	// place. We expect the SHL to be eliminated by other optimizations.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1717	SDValue Sign = TLO.DAG.getNode(ISD::FGETSIGN, Op.getValueType(),
Chris Lattner	2ceb2cf	2007-12-22 21:35:38 +0000	[diff] [blame]	1718	Op.getOperand(0));
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	1719	unsigned ShVal = Op.getValueType().getSizeInBits()-1;
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1720	SDValue ShAmt = TLO.DAG.getConstant(ShVal, getShiftAmountTy());
Chris Lattner	2ceb2cf	2007-12-22 21:35:38 +0000	[diff] [blame]	1721	return TLO.CombineTo(Op, TLO.DAG.getNode(ISD::SHL, Op.getValueType(),
				1722	Sign, ShAmt));
				1723	}
				1724	}
				1725	#endif
				1726	break;
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1727	case ISD::ADD:
				1728	case ISD::MUL:
				1729	case ISD::SUB: {
				1730	// Add, Sub, and Mul don't demand any bits in positions beyond that
				1731	// of the highest bit demanded of them.
				1732	APInt LoMask = APInt::getLowBitsSet(BitWidth,
				1733	BitWidth - NewMask.countLeadingZeros());
				1734	if (SimplifyDemandedBits(Op.getOperand(0), LoMask, KnownZero2,
				1735	KnownOne2, TLO, Depth+1))
				1736	return true;
				1737	if (SimplifyDemandedBits(Op.getOperand(1), LoMask, KnownZero2,
				1738	KnownOne2, TLO, Depth+1))
				1739	return true;
				1740	// See if the operation should be performed at a smaller bit width.
Dan Gohman	4e39e9d	2010-06-24 14:30:44 +0000	[diff] [blame]	1741	if (TLO.ShrinkDemandedOp(Op, BitWidth, NewMask, dl))
Dan Gohman	97121ba	2009-04-08 00:15:30 +0000	[diff] [blame]	1742	return true;
				1743	}
				1744	// FALL THROUGH
Dan Gohman	54eed37	2008-05-06 00:53:29 +0000	[diff] [blame]	1745	default:
Chris Lattner	1482b5f	2006-04-02 06:15:09 +0000	[diff] [blame]	1746	// Just use ComputeMaskedBits to compute output bits.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1747	TLO.DAG.ComputeMaskedBits(Op, NewMask, KnownZero, KnownOne, Depth);
Chris Lattner	a6bc5a4	2006-02-27 01:00:42 +0000	[diff] [blame]	1748	break;
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1749	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1750
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1751	// If we know the value of all of the demanded bits, return this as a
				1752	// constant.
Dan Gohman	7b8d4a9	2008-02-27 00:25:32 +0000	[diff] [blame]	1753	if ((NewMask & (KnownZero\|KnownOne)) == NewMask)
Chris Lattner	ec66515	2006-02-26 23:36:02 +0000	[diff] [blame]	1754	return TLO.CombineTo(Op, TLO.DAG.getConstant(KnownOne, Op.getValueType()));
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1755
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1756	return false;
				1757	}
				1758
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1759	/// computeMaskedBitsForTargetNode - Determine which of the bits specified
				1760	/// in Mask are known to be either zero or one and return them in the
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1761	/// KnownZero/KnownOne bitsets.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1762	void TargetLowering::computeMaskedBitsForTargetNode(const SDValue Op,
Dan Gohman	977a76f	2008-02-13 22:28:48 +0000	[diff] [blame]	1763	const APInt &Mask,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1764	APInt &KnownZero,
Dan Gohman	fd29e0e	2008-02-13 00:35:47 +0000	[diff] [blame]	1765	APInt &KnownOne,
Dan Gohman	ea859be	2007-06-22 14:59:07 +0000	[diff] [blame]	1766	const SelectionDAG &DAG,
Nate Begeman	368e18d	2006-02-16 21:11:51 +0000	[diff] [blame]	1767	unsigned Depth) const {
Chris Lattner	1b5232a	2006-04-02 06:19:46 +0000	[diff] [blame]	1768	assert((Op.getOpcode() >= ISD::BUILTIN_OP_END \|\|
				1769	Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN \|\|
				1770	Op.getOpcode() == ISD::INTRINSIC_W_CHAIN \|\|
				1771	Op.getOpcode() == ISD::INTRINSIC_VOID) &&
Chris Lattner	c6fd6cd	2006-01-30 04:09:27 +0000	[diff] [blame]	1772	"Should use MaskedValueIsZero if you don't know whether Op"
				1773	" is a target node!");
Dan Gohman	977a76f	2008-02-13 22:28:48 +0000	[diff] [blame]	1774	KnownZero = KnownOne = APInt(Mask.getBitWidth(), 0);
Evan Cheng	3a03ebb	2005-12-21 23:05:39 +0000	[diff] [blame]	1775	}
Chris Lattner	4ccb070	2006-01-26 20:37:03 +0000	[diff] [blame]	1776
Chris Lattner	5c3e21d	2006-05-06 09:27:13 +0000	[diff] [blame]	1777	/// ComputeNumSignBitsForTargetNode - This method can be implemented by
				1778	/// targets that want to expose additional information about sign bits to the
				1779	/// DAG Combiner.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1780	unsigned TargetLowering::ComputeNumSignBitsForTargetNode(SDValue Op,
Chris Lattner	5c3e21d	2006-05-06 09:27:13 +0000	[diff] [blame]	1781	unsigned Depth) const {
				1782	assert((Op.getOpcode() >= ISD::BUILTIN_OP_END \|\|
				1783	Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN \|\|
				1784	Op.getOpcode() == ISD::INTRINSIC_W_CHAIN \|\|
				1785	Op.getOpcode() == ISD::INTRINSIC_VOID) &&
				1786	"Should use ComputeNumSignBits if you don't know whether Op"
				1787	" is a target node!");
				1788	return 1;
				1789	}
				1790
Dan Gohman	97d1163	2009-02-15 23:59:32 +0000	[diff] [blame]	1791	/// ValueHasExactlyOneBitSet - Test if the given value is known to have exactly
				1792	/// one bit set. This differs from ComputeMaskedBits in that it doesn't need to
				1793	/// determine which bit is set.
				1794	///
Dale Johannesen	85b0ede	2009-02-11 19:19:41 +0000	[diff] [blame]	1795	static bool ValueHasExactlyOneBitSet(SDValue Val, const SelectionDAG &DAG) {
Dan Gohman	97d1163	2009-02-15 23:59:32 +0000	[diff] [blame]	1796	// A left-shift of a constant one will have exactly one bit set, because
				1797	// shifting the bit off the end is undefined.
				1798	if (Val.getOpcode() == ISD::SHL)
				1799	if (ConstantSDNode *C =
				1800	dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
				1801	if (C->getAPIntValue() == 1)
				1802	return true;
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1803
Dan Gohman	97d1163	2009-02-15 23:59:32 +0000	[diff] [blame]	1804	// Similarly, a right-shift of a constant sign-bit will have exactly
				1805	// one bit set.
				1806	if (Val.getOpcode() == ISD::SRL)
				1807	if (ConstantSDNode *C =
				1808	dyn_cast<ConstantSDNode>(Val.getNode()->getOperand(0)))
				1809	if (C->getAPIntValue().isSignBit())
				1810	return true;
				1811
				1812	// More could be done here, though the above checks are enough
				1813	// to handle some common cases.
				1814
				1815	// Fall back to ComputeMaskedBits to catch other known cases.
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1816	EVT OpVT = Val.getValueType();
Dan Gohman	5b870af	2010-03-02 02:14:38 +0000	[diff] [blame]	1817	unsigned BitWidth = OpVT.getScalarType().getSizeInBits();
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1818	APInt Mask = APInt::getAllOnesValue(BitWidth);
				1819	APInt KnownZero, KnownOne;
				1820	DAG.ComputeMaskedBits(Val, Mask, KnownZero, KnownOne);
Dale Johannesen	85b0ede	2009-02-11 19:19:41 +0000	[diff] [blame]	1821	return (KnownZero.countPopulation() == BitWidth - 1) &&
				1822	(KnownOne.countPopulation() == 1);
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	1823	}
Chris Lattner	5c3e21d	2006-05-06 09:27:13 +0000	[diff] [blame]	1824
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1825	/// SimplifySetCC - Try to simplify a setcc built with the specified operands
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	1826	/// and cc. If it is unable to simplify it, return a null SDValue.
				1827	SDValue
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1828	TargetLowering::SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1829	ISD::CondCode Cond, bool foldBooleans,
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	1830	DAGCombinerInfo &DCI, DebugLoc dl) const {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1831	SelectionDAG &DAG = DCI.DAG;
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	1832	LLVMContext &Context = *DAG.getContext();
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1833
				1834	// These setcc operations always fold.
				1835	switch (Cond) {
				1836	default: break;
				1837	case ISD::SETFALSE:
				1838	case ISD::SETFALSE2: return DAG.getConstant(0, VT);
				1839	case ISD::SETTRUE:
				1840	case ISD::SETTRUE2: return DAG.getConstant(1, VT);
				1841	}
				1842
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1843	if (isa<ConstantSDNode>(N0.getNode())) {
				1844	// Ensure that the constant occurs on the RHS, and fold constant
				1845	// comparisons.
				1846	return DAG.getSetCC(dl, VT, N1, N0, ISD::getSetCCSwappedOperands(Cond));
				1847	}
				1848
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	1849	if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode())) {
Dan Gohman	6c6cd1c	2008-03-03 22:22:56 +0000	[diff] [blame]	1850	const APInt &C1 = N1C->getAPIntValue();
Dale Johannesen	89217a6	2008-11-07 01:28:02 +0000	[diff] [blame]	1851
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1852	// If the LHS is '(srl (ctlz x), 5)', the RHS is 0/1, and this is an
				1853	// equality comparison, then we're just comparing whether X itself is
				1854	// zero.
				1855	if (N0.getOpcode() == ISD::SRL && (C1 == 0 \|\| C1 == 1) &&
				1856	N0.getOperand(0).getOpcode() == ISD::CTLZ &&
				1857	N0.getOperand(1).getOpcode() == ISD::Constant) {
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1858	const APInt &ShAmt
				1859	= cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1860	if ((Cond == ISD::SETEQ \|\| Cond == ISD::SETNE) &&
				1861	ShAmt == Log2_32(N0.getValueType().getSizeInBits())) {
				1862	if ((C1 == 0) == (Cond == ISD::SETEQ)) {
				1863	// (srl (ctlz x), 5) == 0 -> X != 0
				1864	// (srl (ctlz x), 5) != 1 -> X != 0
				1865	Cond = ISD::SETNE;
				1866	} else {
				1867	// (srl (ctlz x), 5) != 0 -> X == 0
				1868	// (srl (ctlz x), 5) == 1 -> X == 0
				1869	Cond = ISD::SETEQ;
				1870	}
				1871	SDValue Zero = DAG.getConstant(0, N0.getValueType());
				1872	return DAG.getSetCC(dl, VT, N0.getOperand(0).getOperand(0),
				1873	Zero, Cond);
				1874	}
				1875	}
				1876
Benjamin Kramer	d822892	2011-01-17 12:04:57 +0000	[diff] [blame]	1877	SDValue CTPOP = N0;
				1878	// Look through truncs that don't change the value of a ctpop.
				1879	if (N0.hasOneUse() && N0.getOpcode() == ISD::TRUNCATE)
				1880	CTPOP = N0.getOperand(0);
				1881
				1882	if (CTPOP.hasOneUse() && CTPOP.getOpcode() == ISD::CTPOP &&
Benjamin Kramer	c9b6a3e	2011-01-17 18:00:28 +0000	[diff] [blame]	1883	(N0 == CTPOP \|\| N0.getValueType().getSizeInBits() >
Benjamin Kramer	d822892	2011-01-17 12:04:57 +0000	[diff] [blame]	1884	Log2_32_Ceil(CTPOP.getValueType().getSizeInBits()))) {
				1885	EVT CTVT = CTPOP.getValueType();
				1886	SDValue CTOp = CTPOP.getOperand(0);
				1887
				1888	// (ctpop x) u< 2 -> (x & x-1) == 0
				1889	// (ctpop x) u> 1 -> (x & x-1) != 0
				1890	if ((Cond == ISD::SETULT && C1 == 2) \|\| (Cond == ISD::SETUGT && C1 == 1)){
				1891	SDValue Sub = DAG.getNode(ISD::SUB, dl, CTVT, CTOp,
				1892	DAG.getConstant(1, CTVT));
				1893	SDValue And = DAG.getNode(ISD::AND, dl, CTVT, CTOp, Sub);
				1894	ISD::CondCode CC = Cond == ISD::SETULT ? ISD::SETEQ : ISD::SETNE;
				1895	return DAG.getSetCC(dl, VT, And, DAG.getConstant(0, CTVT), CC);
				1896	}
				1897
				1898	// TODO: (ctpop x) == 1 -> x && (x & x-1) == 0 iff ctpop is illegal.
				1899	}
				1900
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1901	// If the LHS is '(and load, const)', the RHS is 0,
				1902	// the test is for equality or unsigned, and all 1 bits of the const are
				1903	// in the same partial word, see if we can shorten the load.
				1904	if (DCI.isBeforeLegalize() &&
				1905	N0.getOpcode() == ISD::AND && C1 == 0 &&
				1906	N0.getNode()->hasOneUse() &&
				1907	isa<LoadSDNode>(N0.getOperand(0)) &&
				1908	N0.getOperand(0).getNode()->hasOneUse() &&
				1909	isa<ConstantSDNode>(N0.getOperand(1))) {
				1910	LoadSDNode *Lod = cast<LoadSDNode>(N0.getOperand(0));
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1911	APInt bestMask;
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1912	unsigned bestWidth = 0, bestOffset = 0;
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1913	if (!Lod->isVolatile() && Lod->isUnindexed()) {
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1914	unsigned origWidth = N0.getValueType().getSizeInBits();
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1915	unsigned maskWidth = origWidth;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1916	// We can narrow (e.g.) 16-bit extending loads on 32-bit target to
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1917	// 8 bits, but have to be careful...
				1918	if (Lod->getExtensionType() != ISD::NON_EXTLOAD)
				1919	origWidth = Lod->getMemoryVT().getSizeInBits();
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1920	const APInt &Mask =
				1921	cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1922	for (unsigned width = origWidth / 2; width>=8; width /= 2) {
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1923	APInt newMask = APInt::getLowBitsSet(maskWidth, width);
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1924	for (unsigned offset=0; offset<origWidth/width; offset++) {
				1925	if ((newMask & Mask) == Mask) {
				1926	if (!TD->isLittleEndian())
				1927	bestOffset = (origWidth/width - offset - 1) * (width/8);
				1928	else
				1929	bestOffset = (uint64_t)offset * (width/8);
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1930	bestMask = Mask.lshr(offset * (width/8) * 8);
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1931	bestWidth = width;
				1932	break;
Dale Johannesen	89217a6	2008-11-07 01:28:02 +0000	[diff] [blame]	1933	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1934	newMask = newMask << width;
Dale Johannesen	89217a6	2008-11-07 01:28:02 +0000	[diff] [blame]	1935	}
				1936	}
				1937	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1938	if (bestWidth) {
Owen Anderson	23b9b19	2009-08-12 00:36:31 +0000	[diff] [blame]	1939	EVT newVT = EVT::getIntegerVT(Context, bestWidth);
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1940	if (newVT.isRound()) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1941	EVT PtrType = Lod->getOperand(1).getValueType();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1942	SDValue Ptr = Lod->getBasePtr();
				1943	if (bestOffset != 0)
				1944	Ptr = DAG.getNode(ISD::ADD, dl, PtrType, Lod->getBasePtr(),
				1945	DAG.getConstant(bestOffset, PtrType));
				1946	unsigned NewAlign = MinAlign(Lod->getAlignment(), bestOffset);
				1947	SDValue NewLoad = DAG.getLoad(newVT, dl, Lod->getChain(), Ptr,
Chris Lattner	ecf42c4	2010-09-21 16:36:31 +0000	[diff] [blame]	1948	Lod->getPointerInfo().getWithOffset(bestOffset),
David Greene	1e55944	2010-02-15 17:00:31 +0000	[diff] [blame]	1949	false, false, NewAlign);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	1950	return DAG.getSetCC(dl, VT,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1951	DAG.getNode(ISD::AND, dl, newVT, NewLoad,
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	1952	DAG.getConstant(bestMask.trunc(bestWidth),
				1953	newVT)),
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1954	DAG.getConstant(0LL, newVT), Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1955	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1956	}
				1957	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1958
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1959	// If the LHS is a ZERO_EXTEND, perform the comparison on the input.
				1960	if (N0.getOpcode() == ISD::ZERO_EXTEND) {
				1961	unsigned InSize = N0.getOperand(0).getValueType().getSizeInBits();
				1962
				1963	// If the comparison constant has bits in the upper part, the
				1964	// zero-extended value could never match.
				1965	if (C1.intersects(APInt::getHighBitsSet(C1.getBitWidth(),
				1966	C1.getBitWidth() - InSize))) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1967	switch (Cond) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1968	case ISD::SETUGT:
				1969	case ISD::SETUGE:
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1970	case ISD::SETEQ: return DAG.getConstant(0, VT);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1971	case ISD::SETULT:
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1972	case ISD::SETULE:
				1973	case ISD::SETNE: return DAG.getConstant(1, VT);
				1974	case ISD::SETGT:
				1975	case ISD::SETGE:
				1976	// True if the sign bit of C1 is set.
				1977	return DAG.getConstant(C1.isNegative(), VT);
				1978	case ISD::SETLT:
				1979	case ISD::SETLE:
				1980	// True if the sign bit of C1 isn't set.
				1981	return DAG.getConstant(C1.isNonNegative(), VT);
				1982	default:
Jakob Stoklund Olesen	78d1264	2009-07-24 18:22:59 +0000	[diff] [blame]	1983	break;
				1984	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1985	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	1986
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1987	// Otherwise, we can perform the comparison with the low bits.
				1988	switch (Cond) {
				1989	case ISD::SETEQ:
				1990	case ISD::SETNE:
				1991	case ISD::SETUGT:
				1992	case ISD::SETUGE:
				1993	case ISD::SETULT:
				1994	case ISD::SETULE: {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	1995	EVT newVT = N0.getOperand(0).getValueType();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	1996	if (DCI.isBeforeLegalizeOps() \|\|
				1997	(isOperationLegal(ISD::SETCC, newVT) &&
				1998	getCondCodeAction(Cond, newVT)==Legal))
				1999	return DAG.getSetCC(dl, VT, N0.getOperand(0),
Jay Foad	40f8f62	2010-12-07 08:25:19 +0000	[diff] [blame]	2000	DAG.getConstant(C1.trunc(InSize), newVT),
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2001	Cond);
				2002	break;
				2003	}
				2004	default:
				2005	break; // todo, be more careful with signed comparisons
				2006	}
				2007	} else if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2008	(Cond == ISD::SETEQ \|\| Cond == ISD::SETNE)) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2009	EVT ExtSrcTy = cast<VTSDNode>(N0.getOperand(1))->getVT();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2010	unsigned ExtSrcTyBits = ExtSrcTy.getSizeInBits();
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2011	EVT ExtDstTy = N0.getValueType();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2012	unsigned ExtDstTyBits = ExtDstTy.getSizeInBits();
				2013
Eli Friedman	ad78a88	2010-07-30 06:44:31 +0000	[diff] [blame]	2014	// If the constant doesn't fit into the number of bits for the source of
				2015	// the sign extension, it is impossible for both sides to be equal.
				2016	if (C1.getMinSignedBits() > ExtSrcTyBits)
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2017	return DAG.getConstant(Cond == ISD::SETNE, VT);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2018
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2019	SDValue ZextOp;
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2020	EVT Op0Ty = N0.getOperand(0).getValueType();
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2021	if (Op0Ty == ExtSrcTy) {
				2022	ZextOp = N0.getOperand(0);
				2023	} else {
				2024	APInt Imm = APInt::getLowBitsSet(ExtDstTyBits, ExtSrcTyBits);
				2025	ZextOp = DAG.getNode(ISD::AND, dl, Op0Ty, N0.getOperand(0),
				2026	DAG.getConstant(Imm, Op0Ty));
				2027	}
				2028	if (!DCI.isCalledByLegalizer())
				2029	DCI.AddToWorklist(ZextOp.getNode());
				2030	// Otherwise, make this a use of a zext.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2031	return DAG.getSetCC(dl, VT, ZextOp,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2032	DAG.getConstant(C1 & APInt::getLowBitsSet(
				2033	ExtDstTyBits,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2034	ExtSrcTyBits),
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2035	ExtDstTy),
				2036	Cond);
				2037	} else if ((N1C->isNullValue() \|\| N1C->getAPIntValue() == 1) &&
				2038	(Cond == ISD::SETEQ \|\| Cond == ISD::SETNE)) {
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2039	// SETCC (SETCC), [0\|1], [EQ\|NE] -> SETCC
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2040	if (N0.getOpcode() == ISD::SETCC &&
				2041	isTypeLegal(VT) && VT.bitsLE(N0.getValueType())) {
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	2042	bool TrueWhenTrue = (Cond == ISD::SETEQ) ^ (N1C->getAPIntValue() != 1);
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2043	if (TrueWhenTrue)
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2044	return DAG.getNode(ISD::TRUNCATE, dl, VT, N0);
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2045	// Invert the condition.
				2046	ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2047	CC = ISD::getSetCCInverse(CC,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2048	N0.getOperand(0).getValueType().isInteger());
				2049	return DAG.getSetCC(dl, VT, N0.getOperand(0), N0.getOperand(1), CC);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2050	}
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2051
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2052	if ((N0.getOpcode() == ISD::XOR \|\|
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2053	(N0.getOpcode() == ISD::AND &&
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2054	N0.getOperand(0).getOpcode() == ISD::XOR &&
				2055	N0.getOperand(1) == N0.getOperand(0).getOperand(1))) &&
				2056	isa<ConstantSDNode>(N0.getOperand(1)) &&
				2057	cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue() == 1) {
				2058	// If this is (X^1) == 0/1, swap the RHS and eliminate the xor. We
				2059	// can only do this if the top bits are known zero.
				2060	unsigned BitWidth = N0.getValueSizeInBits();
				2061	if (DAG.MaskedValueIsZero(N0,
				2062	APInt::getHighBitsSet(BitWidth,
				2063	BitWidth-1))) {
				2064	// Okay, get the un-inverted input value.
				2065	SDValue Val;
				2066	if (N0.getOpcode() == ISD::XOR)
				2067	Val = N0.getOperand(0);
				2068	else {
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2069	assert(N0.getOpcode() == ISD::AND &&
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2070	N0.getOperand(0).getOpcode() == ISD::XOR);
				2071	// ((X^1)&1)^1 -> X & 1
				2072	Val = DAG.getNode(ISD::AND, dl, N0.getValueType(),
				2073	N0.getOperand(0).getOperand(0),
				2074	N0.getOperand(1));
				2075	}
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2076
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2077	return DAG.getSetCC(dl, VT, Val, N1,
				2078	Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
				2079	}
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2080	} else if (N1C->getAPIntValue() == 1 &&
				2081	(VT == MVT::i1 \|\|
				2082	getBooleanContents() == ZeroOrOneBooleanContent)) {
				2083	SDValue Op0 = N0;
				2084	if (Op0.getOpcode() == ISD::TRUNCATE)
				2085	Op0 = Op0.getOperand(0);
				2086
				2087	if ((Op0.getOpcode() == ISD::XOR) &&
				2088	Op0.getOperand(0).getOpcode() == ISD::SETCC &&
				2089	Op0.getOperand(1).getOpcode() == ISD::SETCC) {
				2090	// (xor (setcc), (setcc)) == / != 1 -> (setcc) != / == (setcc)
				2091	Cond = (Cond == ISD::SETEQ) ? ISD::SETNE : ISD::SETEQ;
				2092	return DAG.getSetCC(dl, VT, Op0.getOperand(0), Op0.getOperand(1),
				2093	Cond);
				2094	} else if (Op0.getOpcode() == ISD::AND &&
				2095	isa<ConstantSDNode>(Op0.getOperand(1)) &&
				2096	cast<ConstantSDNode>(Op0.getOperand(1))->getAPIntValue() == 1) {
				2097	// If this is (X&1) == / != 1, normalize it to (X&1) != / == 0.
Anton Korobeynikov	17458a7	2010-05-01 12:52:34 +0000	[diff] [blame]	2098	if (Op0.getValueType().bitsGT(VT))
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2099	Op0 = DAG.getNode(ISD::AND, dl, VT,
				2100	DAG.getNode(ISD::TRUNCATE, dl, VT, Op0.getOperand(0)),
				2101	DAG.getConstant(1, VT));
Anton Korobeynikov	17458a7	2010-05-01 12:52:34 +0000	[diff] [blame]	2102	else if (Op0.getValueType().bitsLT(VT))
				2103	Op0 = DAG.getNode(ISD::AND, dl, VT,
				2104	DAG.getNode(ISD::ANY_EXTEND, dl, VT, Op0.getOperand(0)),
				2105	DAG.getConstant(1, VT));
				2106
Evan Cheng	2c755ba	2010-02-27 07:36:59 +0000	[diff] [blame]	2107	return DAG.getSetCC(dl, VT, Op0,
				2108	DAG.getConstant(0, Op0.getValueType()),
				2109	Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ);
				2110	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2111	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2112	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2113
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2114	APInt MinVal, MaxVal;
				2115	unsigned OperandBitSize = N1C->getValueType(0).getSizeInBits();
				2116	if (ISD::isSignedIntSetCC(Cond)) {
				2117	MinVal = APInt::getSignedMinValue(OperandBitSize);
				2118	MaxVal = APInt::getSignedMaxValue(OperandBitSize);
				2119	} else {
				2120	MinVal = APInt::getMinValue(OperandBitSize);
				2121	MaxVal = APInt::getMaxValue(OperandBitSize);
				2122	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2123
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2124	// Canonicalize GE/LE comparisons to use GT/LT comparisons.
				2125	if (Cond == ISD::SETGE \|\| Cond == ISD::SETUGE) {
				2126	if (C1 == MinVal) return DAG.getConstant(1, VT); // X >= MIN --> true
				2127	// X >= C0 --> X > (C0-1)
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2128	return DAG.getSetCC(dl, VT, N0,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2129	DAG.getConstant(C1-1, N1.getValueType()),
				2130	(Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
				2131	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2132
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2133	if (Cond == ISD::SETLE \|\| Cond == ISD::SETULE) {
				2134	if (C1 == MaxVal) return DAG.getConstant(1, VT); // X <= MAX --> true
				2135	// X <= C0 --> X < (C0+1)
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2136	return DAG.getSetCC(dl, VT, N0,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2137	DAG.getConstant(C1+1, N1.getValueType()),
				2138	(Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
				2139	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2140
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2141	if ((Cond == ISD::SETLT \|\| Cond == ISD::SETULT) && C1 == MinVal)
				2142	return DAG.getConstant(0, VT); // X < MIN --> false
				2143	if ((Cond == ISD::SETGE \|\| Cond == ISD::SETUGE) && C1 == MinVal)
				2144	return DAG.getConstant(1, VT); // X >= MIN --> true
				2145	if ((Cond == ISD::SETGT \|\| Cond == ISD::SETUGT) && C1 == MaxVal)
				2146	return DAG.getConstant(0, VT); // X > MAX --> false
				2147	if ((Cond == ISD::SETLE \|\| Cond == ISD::SETULE) && C1 == MaxVal)
				2148	return DAG.getConstant(1, VT); // X <= MAX --> true
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2149
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2150	// Canonicalize setgt X, Min --> setne X, Min
				2151	if ((Cond == ISD::SETGT \|\| Cond == ISD::SETUGT) && C1 == MinVal)
				2152	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
				2153	// Canonicalize setlt X, Max --> setne X, Max
				2154	if ((Cond == ISD::SETLT \|\| Cond == ISD::SETULT) && C1 == MaxVal)
				2155	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETNE);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2156
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2157	// If we have setult X, 1, turn it into seteq X, 0
				2158	if ((Cond == ISD::SETLT \|\| Cond == ISD::SETULT) && C1 == MinVal+1)
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2159	return DAG.getSetCC(dl, VT, N0,
				2160	DAG.getConstant(MinVal, N0.getValueType()),
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2161	ISD::SETEQ);
				2162	// If we have setugt X, Max-1, turn it into seteq X, Max
				2163	else if ((Cond == ISD::SETGT \|\| Cond == ISD::SETUGT) && C1 == MaxVal-1)
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2164	return DAG.getSetCC(dl, VT, N0,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2165	DAG.getConstant(MaxVal, N0.getValueType()),
				2166	ISD::SETEQ);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2167
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2168	// If we have "setcc X, C0", check to see if we can shrink the immediate
				2169	// by changing cc.
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2170
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2171	// SETUGT X, SINTMAX -> SETLT X, 0
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2172	if (Cond == ISD::SETUGT &&
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2173	C1 == APInt::getSignedMaxValue(OperandBitSize))
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2174	return DAG.getSetCC(dl, VT, N0,
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2175	DAG.getConstant(0, N1.getValueType()),
				2176	ISD::SETLT);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2177
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2178	// SETULT X, SINTMIN -> SETGT X, -1
				2179	if (Cond == ISD::SETULT &&
				2180	C1 == APInt::getSignedMinValue(OperandBitSize)) {
				2181	SDValue ConstMinusOne =
				2182	DAG.getConstant(APInt::getAllOnesValue(OperandBitSize),
				2183	N1.getValueType());
				2184	return DAG.getSetCC(dl, VT, N0, ConstMinusOne, ISD::SETGT);
				2185	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2186
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2187	// Fold bit comparisons when we can.
				2188	if ((Cond == ISD::SETEQ \|\| Cond == ISD::SETNE) &&
Evan Cheng	d40d03e	2010-01-06 19:38:29 +0000	[diff] [blame]	2189	(VT == N0.getValueType() \|\|
				2190	(isTypeLegal(VT) && VT.bitsLE(N0.getValueType()))) &&
				2191	N0.getOpcode() == ISD::AND)
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2192	if (ConstantSDNode *AndRHS =
				2193	dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2194	EVT ShiftTy = DCI.isBeforeLegalize() ?
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	2195	getPointerTy() : getShiftAmountTy(N0.getValueType());
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2196	if (Cond == ISD::SETNE && C1 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
				2197	// Perform the xform if the AND RHS is a single bit.
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	2198	if (AndRHS->getAPIntValue().isPowerOf2()) {
Evan Cheng	d40d03e	2010-01-06 19:38:29 +0000	[diff] [blame]	2199	return DAG.getNode(ISD::TRUNCATE, dl, VT,
				2200	DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	2201	DAG.getConstant(AndRHS->getAPIntValue().logBase2(), ShiftTy)));
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2202	}
Evan Cheng	347a9cb	2010-01-07 20:58:44 +0000	[diff] [blame]	2203	} else if (Cond == ISD::SETEQ && C1 == AndRHS->getAPIntValue()) {
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2204	// (X & 8) == 8 --> (X & 8) >> 3
				2205	// Perform the xform if C1 is a single bit.
				2206	if (C1.isPowerOf2()) {
Evan Cheng	d40d03e	2010-01-06 19:38:29 +0000	[diff] [blame]	2207	return DAG.getNode(ISD::TRUNCATE, dl, VT,
				2208	DAG.getNode(ISD::SRL, dl, N0.getValueType(), N0,
				2209	DAG.getConstant(C1.logBase2(), ShiftTy)));
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2210	}
				2211	}
Eli Friedman	b101b0b	2009-07-26 23:47:17 +0000	[diff] [blame]	2212	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2213	}
				2214
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2215	if (isa<ConstantFPSDNode>(N0.getNode())) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2216	// Constant fold or commute setcc.
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2217	SDValue O = DAG.FoldSetCC(VT, N0, N1, Cond, dl);
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2218	if (O.getNode()) return O;
				2219	} else if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1.getNode())) {
Chris Lattner	63079f0	2007-12-29 08:37:08 +0000	[diff] [blame]	2220	// If the RHS of an FP comparison is a constant, simplify it away in
				2221	// some cases.
				2222	if (CFP->getValueAPF().isNaN()) {
				2223	// If an operand is known to be a nan, we can fold it.
				2224	switch (ISD::getUnorderedFlavor(Cond)) {
Torok Edwin	c23197a	2009-07-14 16:55:14 +0000	[diff] [blame]	2225	default: llvm_unreachable("Unknown flavor!");
Chris Lattner	63079f0	2007-12-29 08:37:08 +0000	[diff] [blame]	2226	case 0: // Known false.
				2227	return DAG.getConstant(0, VT);
				2228	case 1: // Known true.
				2229	return DAG.getConstant(1, VT);
Chris Lattner	1c3e1e2	2007-12-30 21:21:10 +0000	[diff] [blame]	2230	case 2: // Undefined.
Dale Johannesen	e8d7230	2009-02-06 23:05:02 +0000	[diff] [blame]	2231	return DAG.getUNDEF(VT);
Chris Lattner	63079f0	2007-12-29 08:37:08 +0000	[diff] [blame]	2232	}
				2233	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2234
Chris Lattner	63079f0	2007-12-29 08:37:08 +0000	[diff] [blame]	2235	// Otherwise, we know the RHS is not a NaN. Simplify the node to drop the
				2236	// constant if knowing that the operand is non-nan is enough. We prefer to
				2237	// have SETO(x,x) instead of SETO(x, 0.0) because this avoids having to
				2238	// materialize 0.0.
				2239	if (Cond == ISD::SETO \|\| Cond == ISD::SETUO)
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2240	return DAG.getSetCC(dl, VT, N0, N0, Cond);
Dan Gohman	11eab02	2009-09-26 15:24:17 +0000	[diff] [blame]	2241
				2242	// If the condition is not legal, see if we can find an equivalent one
				2243	// which is legal.
				2244	if (!isCondCodeLegal(Cond, N0.getValueType())) {
				2245	// If the comparison was an awkward floating-point == or != and one of
				2246	// the comparison operands is infinity or negative infinity, convert the
				2247	// condition to a less-awkward <= or >=.
				2248	if (CFP->getValueAPF().isInfinity()) {
				2249	if (CFP->getValueAPF().isNegative()) {
				2250	if (Cond == ISD::SETOEQ &&
				2251	isCondCodeLegal(ISD::SETOLE, N0.getValueType()))
				2252	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLE);
				2253	if (Cond == ISD::SETUEQ &&
				2254	isCondCodeLegal(ISD::SETOLE, N0.getValueType()))
				2255	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULE);
				2256	if (Cond == ISD::SETUNE &&
				2257	isCondCodeLegal(ISD::SETUGT, N0.getValueType()))
				2258	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGT);
				2259	if (Cond == ISD::SETONE &&
				2260	isCondCodeLegal(ISD::SETUGT, N0.getValueType()))
				2261	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGT);
				2262	} else {
				2263	if (Cond == ISD::SETOEQ &&
				2264	isCondCodeLegal(ISD::SETOGE, N0.getValueType()))
				2265	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOGE);
				2266	if (Cond == ISD::SETUEQ &&
				2267	isCondCodeLegal(ISD::SETOGE, N0.getValueType()))
				2268	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETUGE);
				2269	if (Cond == ISD::SETUNE &&
				2270	isCondCodeLegal(ISD::SETULT, N0.getValueType()))
				2271	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETULT);
				2272	if (Cond == ISD::SETONE &&
				2273	isCondCodeLegal(ISD::SETULT, N0.getValueType()))
				2274	return DAG.getSetCC(dl, VT, N0, N1, ISD::SETOLT);
				2275	}
				2276	}
				2277	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2278	}
				2279
				2280	if (N0 == N1) {
				2281	// We can always fold X == X for integer setcc's.
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	2282	if (N0.getValueType().isInteger())
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2283	return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
				2284	unsigned UOF = ISD::getUnorderedFlavor(Cond);
				2285	if (UOF == 2) // FP operators that are undefined on NaNs.
				2286	return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT);
				2287	if (UOF == unsigned(ISD::isTrueWhenEqual(Cond)))
				2288	return DAG.getConstant(UOF, VT);
				2289	// Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO
				2290	// if it is not already.
				2291	ISD::CondCode NewCond = UOF == 0 ? ISD::SETO : ISD::SETUO;
				2292	if (NewCond != Cond)
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2293	return DAG.getSetCC(dl, VT, N0, N1, NewCond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2294	}
				2295
				2296	if ((Cond == ISD::SETEQ \|\| Cond == ISD::SETNE) &&
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	2297	N0.getValueType().isInteger()) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2298	if (N0.getOpcode() == ISD::ADD \|\| N0.getOpcode() == ISD::SUB \|\|
				2299	N0.getOpcode() == ISD::XOR) {
				2300	// Simplify (X+Y) == (X+Z) --> Y == Z
				2301	if (N0.getOpcode() == N1.getOpcode()) {
				2302	if (N0.getOperand(0) == N1.getOperand(0))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2303	return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(1), Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2304	if (N0.getOperand(1) == N1.getOperand(1))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2305	return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(0), Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2306	if (DAG.isCommutativeBinOp(N0.getOpcode())) {
				2307	// If X op Y == Y op X, try other combinations.
				2308	if (N0.getOperand(0) == N1.getOperand(1))
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2309	return DAG.getSetCC(dl, VT, N0.getOperand(1), N1.getOperand(0),
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2310	Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2311	if (N0.getOperand(1) == N1.getOperand(0))
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2312	return DAG.getSetCC(dl, VT, N0.getOperand(0), N1.getOperand(1),
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2313	Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2314	}
				2315	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2316
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2317	if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(N1)) {
				2318	if (ConstantSDNode *LHSR = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
				2319	// Turn (X+C1) == C2 --> X == C2-C1
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2320	if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse()) {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2321	return DAG.getSetCC(dl, VT, N0.getOperand(0),
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	2322	DAG.getConstant(RHSC->getAPIntValue()-
				2323	LHSR->getAPIntValue(),
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2324	N0.getValueType()), Cond);
				2325	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2326
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2327	// Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0.
				2328	if (N0.getOpcode() == ISD::XOR)
				2329	// If we know that all of the inverted bits are zero, don't bother
				2330	// performing the inversion.
Dan Gohman	2e68b6f	2008-02-25 21:11:39 +0000	[diff] [blame]	2331	if (DAG.MaskedValueIsZero(N0.getOperand(0), ~LHSR->getAPIntValue()))
				2332	return
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2333	DAG.getSetCC(dl, VT, N0.getOperand(0),
Dan Gohman	2e68b6f	2008-02-25 21:11:39 +0000	[diff] [blame]	2334	DAG.getConstant(LHSR->getAPIntValue() ^
				2335	RHSC->getAPIntValue(),
				2336	N0.getValueType()),
				2337	Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2338	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2339
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2340	// Turn (C1-X) == C2 --> X == C1-C2
				2341	if (ConstantSDNode *SUBC = dyn_cast<ConstantSDNode>(N0.getOperand(0))) {
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2342	if (N0.getOpcode() == ISD::SUB && N0.getNode()->hasOneUse()) {
Dan Gohman	2e68b6f	2008-02-25 21:11:39 +0000	[diff] [blame]	2343	return
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2344	DAG.getSetCC(dl, VT, N0.getOperand(1),
Dan Gohman	2e68b6f	2008-02-25 21:11:39 +0000	[diff] [blame]	2345	DAG.getConstant(SUBC->getAPIntValue() -
				2346	RHSC->getAPIntValue(),
				2347	N0.getValueType()),
				2348	Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2349	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2350	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2351	}
				2352
				2353	// Simplify (X+Z) == X --> Z == 0
				2354	if (N0.getOperand(0) == N1)
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2355	return DAG.getSetCC(dl, VT, N0.getOperand(1),
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2356	DAG.getConstant(0, N0.getValueType()), Cond);
				2357	if (N0.getOperand(1) == N1) {
				2358	if (DAG.isCommutativeBinOp(N0.getOpcode()))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2359	return DAG.getSetCC(dl, VT, N0.getOperand(0),
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2360	DAG.getConstant(0, N0.getValueType()), Cond);
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2361	else if (N0.getNode()->hasOneUse()) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2362	assert(N0.getOpcode() == ISD::SUB && "Unexpected operation!");
				2363	// (Z-X) == X --> Z == X<<1
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2364	SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(),
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2365	N1,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	2366	DAG.getConstant(1, getShiftAmountTy(N1.getValueType())));
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2367	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2368	DCI.AddToWorklist(SH.getNode());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2369	return DAG.getSetCC(dl, VT, N0.getOperand(0), SH, Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2370	}
				2371	}
				2372	}
				2373
				2374	if (N1.getOpcode() == ISD::ADD \|\| N1.getOpcode() == ISD::SUB \|\|
				2375	N1.getOpcode() == ISD::XOR) {
				2376	// Simplify X == (X+Z) --> Z == 0
				2377	if (N1.getOperand(0) == N0) {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2378	return DAG.getSetCC(dl, VT, N1.getOperand(1),
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2379	DAG.getConstant(0, N1.getValueType()), Cond);
				2380	} else if (N1.getOperand(1) == N0) {
				2381	if (DAG.isCommutativeBinOp(N1.getOpcode())) {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2382	return DAG.getSetCC(dl, VT, N1.getOperand(0),
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2383	DAG.getConstant(0, N1.getValueType()), Cond);
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2384	} else if (N1.getNode()->hasOneUse()) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2385	assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!");
				2386	// X == (Z-X) --> X<<1 == Z
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2387	SDValue SH = DAG.getNode(ISD::SHL, dl, N1.getValueType(), N0,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	2388	DAG.getConstant(1, getShiftAmountTy(N0.getValueType())));
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2389	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2390	DCI.AddToWorklist(SH.getNode());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2391	return DAG.getSetCC(dl, VT, SH, N1.getOperand(0), Cond);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2392	}
				2393	}
				2394	}
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2395
Dan Gohman	2c65c3d	2009-01-29 16:18:12 +0000	[diff] [blame]	2396	// Simplify x&y == y to x&y != 0 if y has exactly one bit set.
Dale Johannesen	85b0ede	2009-02-11 19:19:41 +0000	[diff] [blame]	2397	// Note that where y is variable and is known to have at most
				2398	// one bit set (for example, if it is z&1) we cannot do this;
				2399	// the expressions are not equivalent when y==0.
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2400	if (N0.getOpcode() == ISD::AND)
				2401	if (N0.getOperand(0) == N1 \|\| N0.getOperand(1) == N1) {
Dale Johannesen	85b0ede	2009-02-11 19:19:41 +0000	[diff] [blame]	2402	if (ValueHasExactlyOneBitSet(N1, DAG)) {
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2403	Cond = ISD::getSetCCInverse(Cond, /isInteger=/true);
				2404	SDValue Zero = DAG.getConstant(0, N1.getValueType());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2405	return DAG.getSetCC(dl, VT, N0, Zero, Cond);
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2406	}
				2407	}
				2408	if (N1.getOpcode() == ISD::AND)
				2409	if (N1.getOperand(0) == N0 \|\| N1.getOperand(1) == N0) {
Dale Johannesen	85b0ede	2009-02-11 19:19:41 +0000	[diff] [blame]	2410	if (ValueHasExactlyOneBitSet(N0, DAG)) {
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2411	Cond = ISD::getSetCCInverse(Cond, /isInteger=/true);
				2412	SDValue Zero = DAG.getConstant(0, N0.getValueType());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2413	return DAG.getSetCC(dl, VT, N1, Zero, Cond);
Dan Gohman	e5af2d3	2009-01-29 01:59:02 +0000	[diff] [blame]	2414	}
				2415	}
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2416	}
				2417
				2418	// Fold away ALL boolean setcc's.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2419	SDValue Temp;
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2420	if (N0.getValueType() == MVT::i1 && foldBooleans) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2421	switch (Cond) {
Torok Edwin	c23197a	2009-07-14 16:55:14 +0000	[diff] [blame]	2422	default: llvm_unreachable("Unknown integer setcc!");
Bob Wilson	4c24546	2009-01-22 17:39:32 +0000	[diff] [blame]	2423	case ISD::SETEQ: // X == Y -> ~(X^Y)
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2424	Temp = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
				2425	N0 = DAG.getNOT(dl, Temp, MVT::i1);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2426	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2427	DCI.AddToWorklist(Temp.getNode());
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2428	break;
				2429	case ISD::SETNE: // X != Y --> (X^Y)
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2430	N0 = DAG.getNode(ISD::XOR, dl, MVT::i1, N0, N1);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2431	break;
Bob Wilson	4c24546	2009-01-22 17:39:32 +0000	[diff] [blame]	2432	case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> ~X & Y
				2433	case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> ~X & Y
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2434	Temp = DAG.getNOT(dl, N0, MVT::i1);
				2435	N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N1, Temp);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2436	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2437	DCI.AddToWorklist(Temp.getNode());
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2438	break;
Bob Wilson	4c24546	2009-01-22 17:39:32 +0000	[diff] [blame]	2439	case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> ~Y & X
				2440	case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> ~Y & X
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2441	Temp = DAG.getNOT(dl, N1, MVT::i1);
				2442	N0 = DAG.getNode(ISD::AND, dl, MVT::i1, N0, Temp);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2443	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2444	DCI.AddToWorklist(Temp.getNode());
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2445	break;
Bob Wilson	4c24546	2009-01-22 17:39:32 +0000	[diff] [blame]	2446	case ISD::SETULE: // X <=u Y --> X == 0 \| Y == 1 --> ~X \| Y
				2447	case ISD::SETGE: // X >=s Y --> X == 0 \| Y == 1 --> ~X \| Y
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2448	Temp = DAG.getNOT(dl, N0, MVT::i1);
				2449	N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N1, Temp);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2450	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2451	DCI.AddToWorklist(Temp.getNode());
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2452	break;
Bob Wilson	4c24546	2009-01-22 17:39:32 +0000	[diff] [blame]	2453	case ISD::SETUGE: // X >=u Y --> X == 1 \| Y == 0 --> ~Y \| X
				2454	case ISD::SETLE: // X <=s Y --> X == 1 \| Y == 0 --> ~Y \| X
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2455	Temp = DAG.getNOT(dl, N1, MVT::i1);
				2456	N0 = DAG.getNode(ISD::OR, dl, MVT::i1, N0, Temp);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2457	break;
				2458	}
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2459	if (VT != MVT::i1) {
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2460	if (!DCI.isCalledByLegalizer())
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2461	DCI.AddToWorklist(N0.getNode());
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2462	// FIXME: If running after legalize, we probably can't do this.
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	2463	N0 = DAG.getNode(ISD::ZERO_EXTEND, dl, VT, N0);
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2464	}
				2465	return N0;
				2466	}
				2467
				2468	// Could not fold it.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2469	return SDValue();
Evan Cheng	fa1eb27	2007-02-08 22:13:59 +0000	[diff] [blame]	2470	}
				2471
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2472	/// isGAPlusOffset - Returns true (and the GlobalValue and the offset) if the
				2473	/// node is a GlobalAddress + offset.
Chris Lattner	0a9481f	2011-02-13 22:25:43 +0000	[diff] [blame]	2474	bool TargetLowering::isGAPlusOffset(SDNode N, const GlobalValue &GA,
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2475	int64_t &Offset) const {
				2476	if (isa<GlobalAddressSDNode>(N)) {
Dan Gohman	9ea3f56	2008-06-09 22:05:52 +0000	[diff] [blame]	2477	GlobalAddressSDNode *GASD = cast<GlobalAddressSDNode>(N);
				2478	GA = GASD->getGlobal();
				2479	Offset += GASD->getOffset();
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2480	return true;
				2481	}
				2482
				2483	if (N->getOpcode() == ISD::ADD) {
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2484	SDValue N1 = N->getOperand(0);
				2485	SDValue N2 = N->getOperand(1);
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2486	if (isGAPlusOffset(N1.getNode(), GA, Offset)) {
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2487	ConstantSDNode *V = dyn_cast<ConstantSDNode>(N2);
				2488	if (V) {
Dan Gohman	7810bfe	2008-09-26 21:54:37 +0000	[diff] [blame]	2489	Offset += V->getSExtValue();
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2490	return true;
				2491	}
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2492	} else if (isGAPlusOffset(N2.getNode(), GA, Offset)) {
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2493	ConstantSDNode *V = dyn_cast<ConstantSDNode>(N1);
				2494	if (V) {
Dan Gohman	7810bfe	2008-09-26 21:54:37 +0000	[diff] [blame]	2495	Offset += V->getSExtValue();
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2496	return true;
				2497	}
				2498	}
				2499	}
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	2500
Evan Cheng	ad4196b	2008-05-12 19:56:52 +0000	[diff] [blame]	2501	return false;
				2502	}
				2503
				2504
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2505	SDValue TargetLowering::
Chris Lattner	00ffed0	2006-03-01 04:52:55 +0000	[diff] [blame]	2506	PerformDAGCombine(SDNode *N, DAGCombinerInfo &DCI) const {
				2507	// Default implementation: no optimization.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2508	return SDValue();
Chris Lattner	00ffed0	2006-03-01 04:52:55 +0000	[diff] [blame]	2509	}
				2510
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2511	//===----------------------------------------------------------------------===//
				2512	// Inline Assembler Implementation Methods
				2513	//===----------------------------------------------------------------------===//
				2514
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2515
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2516	TargetLowering::ConstraintType
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2517	TargetLowering::getConstraintType(const std::string &Constraint) const {
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2518	// FIXME: lots more standard ones to handle.
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2519	if (Constraint.size() == 1) {
				2520	switch (Constraint[0]) {
				2521	default: break;
				2522	case 'r': return C_RegisterClass;
				2523	case 'm': // memory
				2524	case 'o': // offsetable
				2525	case 'V': // not offsetable
				2526	return C_Memory;
				2527	case 'i': // Simple Integer or Relocatable Constant
				2528	case 'n': // Simple Integer
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2529	case 'E': // Floating Point Constant
				2530	case 'F': // Floating Point Constant
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2531	case 's': // Relocatable Constant
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2532	case 'p': // Address.
Chris Lattner	c13dd1c	2007-03-25 04:35:41 +0000	[diff] [blame]	2533	case 'X': // Allow ANY value.
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2534	case 'I': // Target registers.
				2535	case 'J':
				2536	case 'K':
				2537	case 'L':
				2538	case 'M':
				2539	case 'N':
				2540	case 'O':
				2541	case 'P':
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2542	case '<':
				2543	case '>':
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2544	return C_Other;
				2545	}
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2546	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2547
				2548	if (Constraint.size() > 1 && Constraint[0] == '{' &&
Chris Lattner	065421f	2007-03-25 02:18:14 +0000	[diff] [blame]	2549	Constraint[Constraint.size()-1] == '}')
				2550	return C_Register;
Chris Lattner	4234f57	2007-03-25 02:14:49 +0000	[diff] [blame]	2551	return C_Unknown;
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2552	}
				2553
Dale Johannesen	ba2a0b9	2008-01-29 02:21:21 +0000	[diff] [blame]	2554	/// LowerXConstraint - try to replace an X constraint, which matches anything,
				2555	/// with another that has more specific requirements based on the type of the
				2556	/// corresponding operand.
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2557	const char *TargetLowering::LowerXConstraint(EVT ConstraintVT) const{
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	2558	if (ConstraintVT.isInteger())
Chris Lattner	5e76423	2008-04-26 23:02:14 +0000	[diff] [blame]	2559	return "r";
Duncan Sands	83ec4b6	2008-06-06 12:08:01 +0000	[diff] [blame]	2560	if (ConstraintVT.isFloatingPoint())
Chris Lattner	5e76423	2008-04-26 23:02:14 +0000	[diff] [blame]	2561	return "f"; // works for many targets
				2562	return 0;
Dale Johannesen	ba2a0b9	2008-01-29 02:21:21 +0000	[diff] [blame]	2563	}
				2564
Chris Lattner	48884cd	2007-08-25 00:47:38 +0000	[diff] [blame]	2565	/// LowerAsmOperandForConstraint - Lower the specified operand into the Ops
				2566	/// vector. If it is invalid, don't add anything to Ops.
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2567	void TargetLowering::LowerAsmOperandForConstraint(SDValue Op,
Chris Lattner	48884cd	2007-08-25 00:47:38 +0000	[diff] [blame]	2568	char ConstraintLetter,
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2569	std::vector<SDValue> &Ops,
Chris Lattner	5e76423	2008-04-26 23:02:14 +0000	[diff] [blame]	2570	SelectionDAG &DAG) const {
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2571	switch (ConstraintLetter) {
Chris Lattner	9ff6ee8	2007-02-17 06:00:35 +0000	[diff] [blame]	2572	default: break;
Dale Johannesen	eb57ea7	2007-11-05 21:20:28 +0000	[diff] [blame]	2573	case 'X': // Allows any operand; labels (basic block) use this.
				2574	if (Op.getOpcode() == ISD::BasicBlock) {
				2575	Ops.push_back(Op);
				2576	return;
				2577	}
				2578	// fall through
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2579	case 'i': // Simple Integer or Relocatable Constant
				2580	case 'n': // Simple Integer
Dale Johannesen	eb57ea7	2007-11-05 21:20:28 +0000	[diff] [blame]	2581	case 's': { // Relocatable Constant
Chris Lattner	75c7d2b	2007-05-03 16:54:34 +0000	[diff] [blame]	2582	// These operands are interested in values of the form (GV+C), where C may
				2583	// be folded in as an offset of GV, or it may be explicitly added. Also, it
				2584	// is possible and fine if either GV or C are missing.
				2585	ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op);
				2586	GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2587
Chris Lattner	75c7d2b	2007-05-03 16:54:34 +0000	[diff] [blame]	2588	// If we have "(add GV, C)", pull out GV/C
				2589	if (Op.getOpcode() == ISD::ADD) {
				2590	C = dyn_cast<ConstantSDNode>(Op.getOperand(1));
				2591	GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(0));
				2592	if (C == 0 \|\| GA == 0) {
				2593	C = dyn_cast<ConstantSDNode>(Op.getOperand(0));
				2594	GA = dyn_cast<GlobalAddressSDNode>(Op.getOperand(1));
				2595	}
				2596	if (C == 0 \|\| GA == 0)
				2597	C = 0, GA = 0;
				2598	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2599
Chris Lattner	75c7d2b	2007-05-03 16:54:34 +0000	[diff] [blame]	2600	// If we find a valid operand, map to the TargetXXX version so that the
				2601	// value itself doesn't get selected.
				2602	if (GA) { // Either &GV or &GV+C
				2603	if (ConstraintLetter != 'n') {
				2604	int64_t Offs = GA->getOffset();
Dan Gohman	f5aeb1a	2008-09-12 16:56:44 +0000	[diff] [blame]	2605	if (C) Offs += C->getZExtValue();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2606	Ops.push_back(DAG.getTargetGlobalAddress(GA->getGlobal(),
Devang Patel	07538ad	2010-07-15 18:45:27 +0000	[diff] [blame]	2607	C ? C->getDebugLoc() : DebugLoc(),
Chris Lattner	48884cd	2007-08-25 00:47:38 +0000	[diff] [blame]	2608	Op.getValueType(), Offs));
				2609	return;
Chris Lattner	75c7d2b	2007-05-03 16:54:34 +0000	[diff] [blame]	2610	}
				2611	}
				2612	if (C) { // just C, no GV.
Chris Lattner	9ff6ee8	2007-02-17 06:00:35 +0000	[diff] [blame]	2613	// Simple constants are not allowed for 's'.
Chris Lattner	48884cd	2007-08-25 00:47:38 +0000	[diff] [blame]	2614	if (ConstraintLetter != 's') {
Dale Johannesen	78e3e52	2009-02-12 20:58:09 +0000	[diff] [blame]	2615	// gcc prints these as sign extended. Sign extend value to 64 bits
				2616	// now; without this it would get ZExt'd later in
				2617	// ScheduleDAGSDNodes::EmitNode, which is very generic.
				2618	Ops.push_back(DAG.getTargetConstant(C->getAPIntValue().getSExtValue(),
Owen Anderson	825b72b	2009-08-11 20:47:22 +0000	[diff] [blame]	2619	MVT::i64));
Chris Lattner	48884cd	2007-08-25 00:47:38 +0000	[diff] [blame]	2620	return;
				2621	}
Chris Lattner	9ff6ee8	2007-02-17 06:00:35 +0000	[diff] [blame]	2622	}
Chris Lattner	9ff6ee8	2007-02-17 06:00:35 +0000	[diff] [blame]	2623	break;
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2624	}
Chris Lattner	75c7d2b	2007-05-03 16:54:34 +0000	[diff] [blame]	2625	}
Chris Lattner	eb8146b	2006-02-04 02:13:02 +0000	[diff] [blame]	2626	}
				2627
Chris Lattner	4ccb070	2006-01-26 20:37:03 +0000	[diff] [blame]	2628	std::vector<unsigned> TargetLowering::
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2629	getRegClassForInlineAsmConstraint(const std::string &Constraint,
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2630	EVT VT) const {
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2631	return std::vector<unsigned>();
				2632	}
				2633
				2634
				2635	std::pair<unsigned, const TargetRegisterClass*> TargetLowering::
Chris Lattner	4217ca8dc	2006-02-21 23:11:00 +0000	[diff] [blame]	2636	getRegForInlineAsmConstraint(const std::string &Constraint,
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	2637	EVT VT) const {
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2638	if (Constraint[0] != '{')
Douglas Gregor	7d9663c	2010-05-11 06:17:44 +0000	[diff] [blame]	2639	return std::make_pair(0u, static_cast<TargetRegisterClass*>(0));
Chris Lattner	a55079a	2006-02-01 01:29:47 +0000	[diff] [blame]	2640	assert(*(Constraint.end()-1) == '}' && "Not a brace enclosed constraint?");
				2641
				2642	// Remove the braces from around the name.
Benjamin Kramer	05872ea	2009-11-12 20:36:59 +0000	[diff] [blame]	2643	StringRef RegName(Constraint.data()+1, Constraint.size()-2);
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2644
				2645	// Figure out which register class contains this reg.
Dan Gohman	6f0d024	2008-02-10 18:45:23 +0000	[diff] [blame]	2646	const TargetRegisterInfo *RI = TM.getRegisterInfo();
				2647	for (TargetRegisterInfo::regclass_iterator RCI = RI->regclass_begin(),
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2648	E = RI->regclass_end(); RCI != E; ++RCI) {
				2649	const TargetRegisterClass RC = RCI;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2650
				2651	// If none of the value types for this register class are valid, we
Chris Lattner	b3befd4	2006-02-22 23:00:51 +0000	[diff] [blame]	2652	// can't use it. For example, 64-bit reg classes on 32-bit targets.
				2653	bool isLegal = false;
				2654	for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end();
				2655	I != E; ++I) {
				2656	if (isTypeLegal(*I)) {
				2657	isLegal = true;
				2658	break;
				2659	}
				2660	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2661
Chris Lattner	b3befd4	2006-02-22 23:00:51 +0000	[diff] [blame]	2662	if (!isLegal) continue;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2663
				2664	for (TargetRegisterClass::iterator I = RC->begin(), E = RC->end();
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2665	I != E; ++I) {
Benjamin Kramer	05872ea	2009-11-12 20:36:59 +0000	[diff] [blame]	2666	if (RegName.equals_lower(RI->getName(*I)))
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2667	return std::make_pair(*I, RC);
Chris Lattner	1efa40f	2006-02-22 00:56:39 +0000	[diff] [blame]	2668	}
Chris Lattner	4ccb070	2006-01-26 20:37:03 +0000	[diff] [blame]	2669	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2670
Douglas Gregor	7d9663c	2010-05-11 06:17:44 +0000	[diff] [blame]	2671	return std::make_pair(0u, static_cast<const TargetRegisterClass*>(0));
Chris Lattner	4ccb070	2006-01-26 20:37:03 +0000	[diff] [blame]	2672	}
Evan Cheng	30b37b5	2006-03-13 23:18:16 +0000	[diff] [blame]	2673
				2674	//===----------------------------------------------------------------------===//
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2675	// Constraint Selection.
				2676
Chris Lattner	6bdcda3	2008-10-17 16:47:46 +0000	[diff] [blame]	2677	/// isMatchingInputConstraint - Return true of this is an input operand that is
				2678	/// a matching constraint like "4".
				2679	bool TargetLowering::AsmOperandInfo::isMatchingInputConstraint() const {
Chris Lattner	58f15c4	2008-10-17 16:21:11 +0000	[diff] [blame]	2680	assert(!ConstraintCode.empty() && "No known constraint!");
				2681	return isdigit(ConstraintCode[0]);
				2682	}
				2683
				2684	/// getMatchedOperand - If this is an input matching constraint, this method
				2685	/// returns the output operand it matches.
				2686	unsigned TargetLowering::AsmOperandInfo::getMatchedOperand() const {
				2687	assert(!ConstraintCode.empty() && "No known constraint!");
				2688	return atoi(ConstraintCode.c_str());
				2689	}
				2690
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2691
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2692	/// ParseConstraints - Split up the constraint string from the inline
				2693	/// assembly value into the specific constraints and their prefixes,
				2694	/// and also tie in the associated operand values.
				2695	/// If this returns an empty vector, and if the constraint string itself
				2696	/// isn't empty, there was an error parsing.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2697	TargetLowering::AsmOperandInfoVector TargetLowering::ParseConstraints(
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2698	ImmutableCallSite CS) const {
				2699	/// ConstraintOperands - Information about all of the constraints.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2700	AsmOperandInfoVector ConstraintOperands;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2701	const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue());
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2702	unsigned maCount = 0; // Largest number of multiple alternative constraints.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2703
				2704	// Do a prepass over the constraints, canonicalizing them, and building up the
				2705	// ConstraintOperands list.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2706	InlineAsm::ConstraintInfoVector
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2707	ConstraintInfos = IA->ParseConstraints();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2708
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2709	unsigned ArgNo = 0; // ArgNo - The argument of the CallInst.
				2710	unsigned ResNo = 0; // ResNo - The result number of the next output.
				2711
				2712	for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) {
				2713	ConstraintOperands.push_back(AsmOperandInfo(ConstraintInfos[i]));
				2714	AsmOperandInfo &OpInfo = ConstraintOperands.back();
				2715
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2716	// Update multiple alternative constraint count.
				2717	if (OpInfo.multipleAlternatives.size() > maCount)
				2718	maCount = OpInfo.multipleAlternatives.size();
				2719
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2720	OpInfo.ConstraintVT = MVT::Other;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2721
				2722	// Compute the value type for each operand.
				2723	switch (OpInfo.Type) {
				2724	case InlineAsm::isOutput:
				2725	// Indirect outputs just consume an argument.
				2726	if (OpInfo.isIndirect) {
				2727	OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
				2728	break;
				2729	}
				2730
				2731	// The return value of the call is this value. As such, there is no
				2732	// corresponding argument.
				2733	assert(!CS.getType()->isVoidTy() &&
				2734	"Bad inline asm!");
				2735	if (const StructType *STy = dyn_cast<StructType>(CS.getType())) {
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2736	OpInfo.ConstraintVT = getValueType(STy->getElementType(ResNo));
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2737	} else {
				2738	assert(ResNo == 0 && "Asm only has one result!");
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2739	OpInfo.ConstraintVT = getValueType(CS.getType());
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2740	}
				2741	++ResNo;
				2742	break;
				2743	case InlineAsm::isInput:
				2744	OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++));
				2745	break;
				2746	case InlineAsm::isClobber:
				2747	// Nothing to do.
				2748	break;
				2749	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2750
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2751	if (OpInfo.CallOperandVal) {
				2752	const llvm::Type *OpTy = OpInfo.CallOperandVal->getType();
				2753	if (OpInfo.isIndirect) {
				2754	const llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy);
				2755	if (!PtrTy)
				2756	report_fatal_error("Indirect operand for inline asm not a pointer!");
				2757	OpTy = PtrTy->getElementType();
				2758	}
				2759	// If OpTy is not a single value, it may be a struct/union that we
				2760	// can tile with integers.
				2761	if (!OpTy->isSingleValueType() && OpTy->isSized()) {
				2762	unsigned BitSize = TD->getTypeSizeInBits(OpTy);
				2763	switch (BitSize) {
				2764	default: break;
				2765	case 1:
				2766	case 8:
				2767	case 16:
				2768	case 32:
				2769	case 64:
				2770	case 128:
Dale Johannesen	71365d3	2010-11-09 01:15:07 +0000	[diff] [blame]	2771	OpInfo.ConstraintVT =
				2772	EVT::getEVT(IntegerType::get(OpTy->getContext(), BitSize), true);
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2773	break;
				2774	}
				2775	} else if (dyn_cast<PointerType>(OpTy)) {
				2776	OpInfo.ConstraintVT = MVT::getIntegerVT(8*TD->getPointerSize());
				2777	} else {
				2778	OpInfo.ConstraintVT = EVT::getEVT(OpTy, true);
				2779	}
				2780	}
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2781	}
				2782
				2783	// If we have multiple alternative constraints, select the best alternative.
				2784	if (ConstraintInfos.size()) {
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2785	if (maCount) {
				2786	unsigned bestMAIndex = 0;
				2787	int bestWeight = -1;
				2788	// weight: -1 = invalid match, and 0 = so-so match to 5 = good match.
				2789	int weight = -1;
				2790	unsigned maIndex;
				2791	// Compute the sums of the weights for each alternative, keeping track
				2792	// of the best (highest weight) one so far.
				2793	for (maIndex = 0; maIndex < maCount; ++maIndex) {
				2794	int weightSum = 0;
				2795	for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
				2796	cIndex != eIndex; ++cIndex) {
				2797	AsmOperandInfo& OpInfo = ConstraintOperands[cIndex];
				2798	if (OpInfo.Type == InlineAsm::isClobber)
				2799	continue;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2800
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2801	// If this is an output operand with a matching input operand,
				2802	// look up the matching input. If their types mismatch, e.g. one
				2803	// is an integer, the other is floating point, or their sizes are
				2804	// different, flag it as an maCantMatch.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2805	if (OpInfo.hasMatchingInput()) {
				2806	AsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2807	if (OpInfo.ConstraintVT != Input.ConstraintVT) {
				2808	if ((OpInfo.ConstraintVT.isInteger() !=
				2809	Input.ConstraintVT.isInteger()) \|\|
				2810	(OpInfo.ConstraintVT.getSizeInBits() !=
				2811	Input.ConstraintVT.getSizeInBits())) {
				2812	weightSum = -1; // Can't match.
				2813	break;
				2814	}
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2815	}
				2816	}
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2817	weight = getMultipleConstraintMatchWeight(OpInfo, maIndex);
				2818	if (weight == -1) {
				2819	weightSum = -1;
				2820	break;
				2821	}
				2822	weightSum += weight;
				2823	}
				2824	// Update best.
				2825	if (weightSum > bestWeight) {
				2826	bestWeight = weightSum;
				2827	bestMAIndex = maIndex;
				2828	}
				2829	}
				2830
				2831	// Now select chosen alternative in each constraint.
				2832	for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
				2833	cIndex != eIndex; ++cIndex) {
				2834	AsmOperandInfo& cInfo = ConstraintOperands[cIndex];
				2835	if (cInfo.Type == InlineAsm::isClobber)
				2836	continue;
				2837	cInfo.selectAlternative(bestMAIndex);
				2838	}
				2839	}
				2840	}
				2841
				2842	// Check and hook up tied operands, choose constraint code to use.
				2843	for (unsigned cIndex = 0, eIndex = ConstraintOperands.size();
				2844	cIndex != eIndex; ++cIndex) {
				2845	AsmOperandInfo& OpInfo = ConstraintOperands[cIndex];
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	2846
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2847	// If this is an output operand with a matching input operand, look up the
				2848	// matching input. If their types mismatch, e.g. one is an integer, the
				2849	// other is floating point, or their sizes are different, flag it as an
				2850	// error.
				2851	if (OpInfo.hasMatchingInput()) {
				2852	AsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput];
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2853
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2854	if (OpInfo.ConstraintVT != Input.ConstraintVT) {
				2855	if ((OpInfo.ConstraintVT.isInteger() !=
				2856	Input.ConstraintVT.isInteger()) \|\|
				2857	(OpInfo.ConstraintVT.getSizeInBits() !=
				2858	Input.ConstraintVT.getSizeInBits())) {
				2859	report_fatal_error("Unsupported asm: input constraint"
				2860	" with a matching output constraint of"
				2861	" incompatible type!");
				2862	}
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2863	}
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2864
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2865	}
				2866	}
				2867
				2868	return ConstraintOperands;
				2869	}
				2870
Chris Lattner	58f15c4	2008-10-17 16:21:11 +0000	[diff] [blame]	2871
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2872	/// getConstraintGenerality - Return an integer indicating how general CT
				2873	/// is.
				2874	static unsigned getConstraintGenerality(TargetLowering::ConstraintType CT) {
				2875	switch (CT) {
Torok Edwin	c23197a	2009-07-14 16:55:14 +0000	[diff] [blame]	2876	default: llvm_unreachable("Unknown constraint type!");
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2877	case TargetLowering::C_Other:
				2878	case TargetLowering::C_Unknown:
				2879	return 0;
				2880	case TargetLowering::C_Register:
				2881	return 1;
				2882	case TargetLowering::C_RegisterClass:
				2883	return 2;
				2884	case TargetLowering::C_Memory:
				2885	return 3;
				2886	}
				2887	}
				2888
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2889	/// Examine constraint type and operand type and determine a weight value.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2890	/// This object must already have been set up with the operand type
				2891	/// and the current alternative constraint selected.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2892	TargetLowering::ConstraintWeight
				2893	TargetLowering::getMultipleConstraintMatchWeight(
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2894	AsmOperandInfo &info, int maIndex) const {
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2895	InlineAsm::ConstraintCodeVector *rCodes;
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2896	if (maIndex >= (int)info.multipleAlternatives.size())
				2897	rCodes = &info.Codes;
				2898	else
				2899	rCodes = &info.multipleAlternatives[maIndex].Codes;
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2900	ConstraintWeight BestWeight = CW_Invalid;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2901
				2902	// Loop over the options, keeping track of the most general one.
John Thompson	67aff16	2010-09-21 22:04:54 +0000	[diff] [blame]	2903	for (unsigned i = 0, e = rCodes->size(); i != e; ++i) {
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2904	ConstraintWeight weight =
				2905	getSingleConstraintMatchWeight(info, (*rCodes)[i].c_str());
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2906	if (weight > BestWeight)
				2907	BestWeight = weight;
				2908	}
				2909
				2910	return BestWeight;
				2911	}
				2912
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2913	/// Examine constraint type and operand type and determine a weight value.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2914	/// This object must already have been set up with the operand type
				2915	/// and the current alternative constraint selected.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2916	TargetLowering::ConstraintWeight
				2917	TargetLowering::getSingleConstraintMatchWeight(
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2918	AsmOperandInfo &info, const char *constraint) const {
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2919	ConstraintWeight weight = CW_Invalid;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2920	Value *CallOperandVal = info.CallOperandVal;
				2921	// If we don't have a value, we can't do a match,
				2922	// but allow it at the lowest weight.
				2923	if (CallOperandVal == NULL)
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2924	return CW_Default;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2925	// Look at the constraint type.
				2926	switch (*constraint) {
				2927	case 'i': // immediate integer.
				2928	case 'n': // immediate integer with a known value.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2929	if (isa<ConstantInt>(CallOperandVal))
				2930	weight = CW_Constant;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2931	break;
				2932	case 's': // non-explicit intregal immediate.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2933	if (isa<GlobalValue>(CallOperandVal))
				2934	weight = CW_Constant;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2935	break;
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2936	case 'E': // immediate float if host format.
				2937	case 'F': // immediate float.
				2938	if (isa<ConstantFP>(CallOperandVal))
				2939	weight = CW_Constant;
				2940	break;
				2941	case '<': // memory operand with autodecrement.
				2942	case '>': // memory operand with autoincrement.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2943	case 'm': // memory operand.
				2944	case 'o': // offsettable memory operand
				2945	case 'V': // non-offsettable memory operand
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2946	weight = CW_Memory;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2947	break;
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2948	case 'r': // general register.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2949	case 'g': // general register, memory operand or immediate integer.
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2950	// note: Clang converts "g" to "imr".
				2951	if (CallOperandVal->getType()->isIntegerTy())
				2952	weight = CW_Register;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2953	break;
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2954	case 'X': // any operand.
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2955	default:
John Thompson	44ab89e	2010-10-29 17:29:13 +0000	[diff] [blame]	2956	weight = CW_Default;
John Thompson	eac6e1d	2010-09-13 18:15:37 +0000	[diff] [blame]	2957	break;
				2958	}
				2959	return weight;
				2960	}
				2961
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2962	/// ChooseConstraint - If there are multiple different constraints that we
				2963	/// could pick for this operand (e.g. "imr") try to pick the 'best' one.
Chris Lattner	24e1a9d	2008-04-27 01:49:46 +0000	[diff] [blame]	2964	/// This is somewhat tricky: constraints fall into four classes:
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2965	/// Other -> immediates and magic values
				2966	/// Register -> one specific register
				2967	/// RegisterClass -> a group of regs
				2968	/// Memory -> memory
				2969	/// Ideally, we would pick the most specific constraint possible: if we have
				2970	/// something that fits into a register, we would pick it. The problem here
				2971	/// is that if we have something that could either be in a register or in
				2972	/// memory that use of the register could cause selection of other
				2973	/// operands to fail: they might only succeed if we pick memory. Because of
				2974	/// this the heuristic we use is:
				2975	///
				2976	/// 1) If there is an 'other' constraint, and if the operand is valid for
				2977	/// that constraint, use it. This makes us take advantage of 'i'
				2978	/// constraints when available.
				2979	/// 2) Otherwise, pick the most general constraint present. This prefers
				2980	/// 'm' over 'r', for example.
				2981	///
				2982	static void ChooseConstraint(TargetLowering::AsmOperandInfo &OpInfo,
Dale Johannesen	1784d16	2010-06-25 21:55:36 +0000	[diff] [blame]	2983	const TargetLowering &TLI,
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	2984	SDValue Op, SelectionDAG *DAG) {
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2985	assert(OpInfo.Codes.size() > 1 && "Doesn't have multiple constraint options");
				2986	unsigned BestIdx = 0;
				2987	TargetLowering::ConstraintType BestType = TargetLowering::C_Unknown;
				2988	int BestGenerality = -1;
Dale Johannesen	a5989f8	2010-06-28 22:09:45 +0000	[diff] [blame]	2989
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	2990	// Loop over the options, keeping track of the most general one.
				2991	for (unsigned i = 0, e = OpInfo.Codes.size(); i != e; ++i) {
				2992	TargetLowering::ConstraintType CType =
				2993	TLI.getConstraintType(OpInfo.Codes[i]);
Dale Johannesen	a5989f8	2010-06-28 22:09:45 +0000	[diff] [blame]	2994
Chris Lattner	5a09690	2008-04-27 00:37:18 +0000	[diff] [blame]	2995	// If this is an 'other' constraint, see if the operand is valid for it.
				2996	// For example, on X86 we might have an 'rI' constraint. If the operand
				2997	// is an integer in the range [0..31] we want to use I (saving a load
				2998	// of a register), otherwise we must use 'r'.
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	2999	if (CType == TargetLowering::C_Other && Op.getNode()) {
Chris Lattner	5a09690	2008-04-27 00:37:18 +0000	[diff] [blame]	3000	assert(OpInfo.Codes[i].size() == 1 &&
				3001	"Unhandled multi-letter 'other' constraint");
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3002	std::vector<SDValue> ResultOps;
Dale Johannesen	1784d16	2010-06-25 21:55:36 +0000	[diff] [blame]	3003	TLI.LowerAsmOperandForConstraint(Op, OpInfo.Codes[i][0],
Chris Lattner	5a09690	2008-04-27 00:37:18 +0000	[diff] [blame]	3004	ResultOps, *DAG);
				3005	if (!ResultOps.empty()) {
				3006	BestType = CType;
				3007	BestIdx = i;
				3008	break;
				3009	}
				3010	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3011
Dale Johannesen	a5989f8	2010-06-28 22:09:45 +0000	[diff] [blame]	3012	// Things with matching constraints can only be registers, per gcc
				3013	// documentation. This mainly affects "g" constraints.
				3014	if (CType == TargetLowering::C_Memory && OpInfo.hasMatchingInput())
				3015	continue;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3016
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3017	// This constraint letter is more general than the previous one, use it.
				3018	int Generality = getConstraintGenerality(CType);
				3019	if (Generality > BestGenerality) {
				3020	BestType = CType;
				3021	BestIdx = i;
				3022	BestGenerality = Generality;
				3023	}
				3024	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3025
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3026	OpInfo.ConstraintCode = OpInfo.Codes[BestIdx];
				3027	OpInfo.ConstraintType = BestType;
				3028	}
				3029
				3030	/// ComputeConstraintToUse - Determines the constraint code and constraint
				3031	/// type to use for the specific AsmOperandInfo, setting
				3032	/// OpInfo.ConstraintCode and OpInfo.ConstraintType.
Chris Lattner	5a09690	2008-04-27 00:37:18 +0000	[diff] [blame]	3033	void TargetLowering::ComputeConstraintToUse(AsmOperandInfo &OpInfo,
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3034	SDValue Op,
Chris Lattner	5a09690	2008-04-27 00:37:18 +0000	[diff] [blame]	3035	SelectionDAG *DAG) const {
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3036	assert(!OpInfo.Codes.empty() && "Must have at least one constraint");
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3037
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3038	// Single-letter constraints ('r') are very common.
				3039	if (OpInfo.Codes.size() == 1) {
				3040	OpInfo.ConstraintCode = OpInfo.Codes[0];
				3041	OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
				3042	} else {
Dale Johannesen	1784d16	2010-06-25 21:55:36 +0000	[diff] [blame]	3043	ChooseConstraint(OpInfo, *this, Op, DAG);
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3044	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3045
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3046	// 'X' matches anything.
				3047	if (OpInfo.ConstraintCode == "X" && OpInfo.CallOperandVal) {
				3048	// Labels and constants are handled elsewhere ('X' is the only thing
Dale Johannesen	8ea5ec6	2009-07-07 23:26:33 +0000	[diff] [blame]	3049	// that matches labels). For Functions, the type here is the type of
Dale Johannesen	5339c55	2009-07-20 23:27:39 +0000	[diff] [blame]	3050	// the result, which is not what we want to look at; leave them alone.
				3051	Value *v = OpInfo.CallOperandVal;
Dale Johannesen	8ea5ec6	2009-07-07 23:26:33 +0000	[diff] [blame]	3052	if (isa<BasicBlock>(v) \|\| isa<ConstantInt>(v) \|\| isa<Function>(v)) {
				3053	OpInfo.CallOperandVal = v;
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3054	return;
Dale Johannesen	8ea5ec6	2009-07-07 23:26:33 +0000	[diff] [blame]	3055	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3056
Chris Lattner	4376fea	2008-04-27 00:09:47 +0000	[diff] [blame]	3057	// Otherwise, try to resolve it to something we know about by looking at
				3058	// the actual operand type.
				3059	if (const char *Repl = LowerXConstraint(OpInfo.ConstraintVT)) {
				3060	OpInfo.ConstraintCode = Repl;
				3061	OpInfo.ConstraintType = getConstraintType(OpInfo.ConstraintCode);
				3062	}
				3063	}
				3064	}
				3065
				3066	//===----------------------------------------------------------------------===//
Evan Cheng	30b37b5	2006-03-13 23:18:16 +0000	[diff] [blame]	3067	// Loop Strength Reduction hooks
				3068	//===----------------------------------------------------------------------===//
				3069
Chris Lattner	1436bb6	2007-03-30 23:14:50 +0000	[diff] [blame]	3070	/// isLegalAddressingMode - Return true if the addressing mode represented
				3071	/// by AM is legal for this target, for a load/store of the specified type.
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3072	bool TargetLowering::isLegalAddressingMode(const AddrMode &AM,
Chris Lattner	1436bb6	2007-03-30 23:14:50 +0000	[diff] [blame]	3073	const Type *Ty) const {
				3074	// The default implementation of this implements a conservative RISCy, r+r and
				3075	// r+i addr mode.
				3076
				3077	// Allows a sign-extended 16-bit immediate field.
				3078	if (AM.BaseOffs <= -(1LL << 16) \|\| AM.BaseOffs >= (1LL << 16)-1)
				3079	return false;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3080
Chris Lattner	1436bb6	2007-03-30 23:14:50 +0000	[diff] [blame]	3081	// No global is ever allowed as a base.
				3082	if (AM.BaseGV)
				3083	return false;
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3084
				3085	// Only support r+r,
Chris Lattner	1436bb6	2007-03-30 23:14:50 +0000	[diff] [blame]	3086	switch (AM.Scale) {
				3087	case 0: // "r+i" or just "i", depending on HasBaseReg.
				3088	break;
				3089	case 1:
				3090	if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed.
				3091	return false;
				3092	// Otherwise we have r+r or r+i.
				3093	break;
				3094	case 2:
				3095	if (AM.HasBaseReg \|\| AM.BaseOffs) // 2r+r or 2r+i is not allowed.
				3096	return false;
				3097	// Allow 2*r as r+r.
				3098	break;
				3099	}
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3100
Chris Lattner	1436bb6	2007-03-30 23:14:50 +0000	[diff] [blame]	3101	return true;
				3102	}
				3103
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3104	/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
				3105	/// return a DAG expression to select that will generate the same value by
				3106	/// multiplying by a magic number. See:
				3107	/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3108	SDValue TargetLowering::BuildSDIV(SDNode *N, SelectionDAG &DAG,
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3109	std::vector<SDNode> Created) const {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	3110	EVT VT = N->getValueType(0);
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3111	DebugLoc dl= N->getDebugLoc();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3112
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3113	// Check to see if we can do this.
Eli Friedman	fc69cb4	2008-11-30 06:35:39 +0000	[diff] [blame]	3114	// FIXME: We should be more aggressive here.
				3115	if (!isTypeLegal(VT))
				3116	return SDValue();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3117
Eli Friedman	fc69cb4	2008-11-30 06:35:39 +0000	[diff] [blame]	3118	APInt d = cast<ConstantSDNode>(N->getOperand(1))->getAPIntValue();
Jay Foad	4e5ea55	2009-04-30 10:15:35 +0000	[diff] [blame]	3119	APInt::ms magics = d.magic();
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3120
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3121	// Multiply the numerator (operand 0) by the magic value
Eli Friedman	fc69cb4	2008-11-30 06:35:39 +0000	[diff] [blame]	3122	// FIXME: We should support doing a MUL in a wider type
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3123	SDValue Q;
Dan Gohman	f560ffa	2009-01-28 17:46:25 +0000	[diff] [blame]	3124	if (isOperationLegalOrCustom(ISD::MULHS, VT))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3125	Q = DAG.getNode(ISD::MULHS, dl, VT, N->getOperand(0),
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3126	DAG.getConstant(magics.m, VT));
Dan Gohman	f560ffa	2009-01-28 17:46:25 +0000	[diff] [blame]	3127	else if (isOperationLegalOrCustom(ISD::SMUL_LOHI, VT))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3128	Q = SDValue(DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(VT, VT),
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3129	N->getOperand(0),
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3130	DAG.getConstant(magics.m, VT)).getNode(), 1);
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3131	else
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3132	return SDValue(); // No mulhs or equvialent
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3133	// If d > 0 and m < 0, add the numerator
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3134	if (d.isStrictlyPositive() && magics.m.isNegative()) {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3135	Q = DAG.getNode(ISD::ADD, dl, VT, Q, N->getOperand(0));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3136	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3137	Created->push_back(Q.getNode());
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3138	}
				3139	// If d < 0 and m > 0, subtract the numerator.
Eli Friedman	fc69cb4	2008-11-30 06:35:39 +0000	[diff] [blame]	3140	if (d.isNegative() && magics.m.isStrictlyPositive()) {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3141	Q = DAG.getNode(ISD::SUB, dl, VT, Q, N->getOperand(0));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3142	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3143	Created->push_back(Q.getNode());
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3144	}
				3145	// Shift right algebraic if shift value is nonzero
				3146	if (magics.s > 0) {
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3147	Q = DAG.getNode(ISD::SRA, dl, VT, Q,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	3148	DAG.getConstant(magics.s, getShiftAmountTy(Q.getValueType())));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3149	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3150	Created->push_back(Q.getNode());
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3151	}
				3152	// Extract the sign bit and add it to the quotient
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3153	SDValue T =
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3154	DAG.getNode(ISD::SRL, dl, VT, Q, DAG.getConstant(VT.getSizeInBits()-1,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	3155	getShiftAmountTy(Q.getValueType())));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3156	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3157	Created->push_back(T.getNode());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3158	return DAG.getNode(ISD::ADD, dl, VT, Q, T);
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3159	}
				3160
				3161	/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
				3162	/// return a DAG expression to select that will generate the same value by
				3163	/// multiplying by a magic number. See:
				3164	/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3165	SDValue TargetLowering::BuildUDIV(SDNode *N, SelectionDAG &DAG,
				3166	std::vector<SDNode> Created) const {
Owen Anderson	e50ed30	2009-08-10 22:56:29 +0000	[diff] [blame]	3167	EVT VT = N->getValueType(0);
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3168	DebugLoc dl = N->getDebugLoc();
Eli Friedman	201c977	2008-11-30 06:02:26 +0000	[diff] [blame]	3169
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3170	// Check to see if we can do this.
Eli Friedman	201c977	2008-11-30 06:02:26 +0000	[diff] [blame]	3171	// FIXME: We should be more aggressive here.
				3172	if (!isTypeLegal(VT))
				3173	return SDValue();
				3174
				3175	// FIXME: We should use a narrower constant when the upper
				3176	// bits are known to be zero.
				3177	ConstantSDNode *N1C = cast<ConstantSDNode>(N->getOperand(1));
Jay Foad	4e5ea55	2009-04-30 10:15:35 +0000	[diff] [blame]	3178	APInt::mu magics = N1C->getAPIntValue().magicu();
Eli Friedman	201c977	2008-11-30 06:02:26 +0000	[diff] [blame]	3179
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3180	// Multiply the numerator (operand 0) by the magic value
Eli Friedman	201c977	2008-11-30 06:02:26 +0000	[diff] [blame]	3181	// FIXME: We should support doing a MUL in a wider type
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3182	SDValue Q;
Dan Gohman	f560ffa	2009-01-28 17:46:25 +0000	[diff] [blame]	3183	if (isOperationLegalOrCustom(ISD::MULHU, VT))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3184	Q = DAG.getNode(ISD::MULHU, dl, VT, N->getOperand(0),
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3185	DAG.getConstant(magics.m, VT));
Dan Gohman	f560ffa	2009-01-28 17:46:25 +0000	[diff] [blame]	3186	else if (isOperationLegalOrCustom(ISD::UMUL_LOHI, VT))
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3187	Q = SDValue(DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(VT, VT),
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3188	N->getOperand(0),
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3189	DAG.getConstant(magics.m, VT)).getNode(), 1);
Dan Gohman	525178c	2007-10-08 18:33:35 +0000	[diff] [blame]	3190	else
Dan Gohman	475871a	2008-07-27 21:46:04 +0000	[diff] [blame]	3191	return SDValue(); // No mulhu or equvialent
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3192	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3193	Created->push_back(Q.getNode());
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3194
				3195	if (magics.a == 0) {
Eli Friedman	201c977	2008-11-30 06:02:26 +0000	[diff] [blame]	3196	assert(magics.s < N1C->getAPIntValue().getBitWidth() &&
				3197	"We shouldn't generate an undefined shift!");
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3198	return DAG.getNode(ISD::SRL, dl, VT, Q,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	3199	DAG.getConstant(magics.s, getShiftAmountTy(Q.getValueType())));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3200	} else {
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3201	SDValue NPQ = DAG.getNode(ISD::SUB, dl, VT, N->getOperand(0), Q);
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3202	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3203	Created->push_back(NPQ.getNode());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3204	NPQ = DAG.getNode(ISD::SRL, dl, VT, NPQ,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	3205	DAG.getConstant(1, getShiftAmountTy(NPQ.getValueType())));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3206	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3207	Created->push_back(NPQ.getNode());
Dale Johannesen	ff97d4f	2009-02-03 00:47:48 +0000	[diff] [blame]	3208	NPQ = DAG.getNode(ISD::ADD, dl, VT, NPQ, Q);
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3209	if (Created)
Gabor Greif	ba36cb5	2008-08-28 21:40:38 +0000	[diff] [blame]	3210	Created->push_back(NPQ.getNode());
Wesley Peck	bf17cfa	2010-11-23 03:31:01 +0000	[diff] [blame]	3211	return DAG.getNode(ISD::SRL, dl, VT, NPQ,
Owen Anderson	95771af	2011-02-25 21:41:48 +0000	[diff] [blame]	3212	DAG.getConstant(magics.s-1, getShiftAmountTy(NPQ.getValueType())));
Andrew Lenharth	dae9cbe	2006-05-16 17:42:15 +0000	[diff] [blame]	3213	}
				3214	}