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

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