blob: 5a7319f9d64205403ff0c10091483648a44a32e2 [file] [log] [blame]
Nate Begeman4ebd8052005-09-01 23:24:04 +00001//===-- DAGCombiner.cpp - Implement a DAG node combiner -------------------===//
Nate Begeman1d4d4142005-09-01 00:19:25 +00002//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Nate Begeman1d4d4142005-09-01 00:19:25 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This pass combines dag nodes to form fewer, simpler DAG nodes. It can be run
11// both before and after the DAG is legalized.
Scott Michelfdc40a02009-02-17 22:15:04 +000012//
Dan Gohman41287002009-04-25 17:09:45 +000013// This pass is not a substitute for the LLVM IR instcombine pass. This pass is
14// primarily intended to handle simplification opportunities that are implicit
15// in the LLVM IR and exposed by the various codegen lowering phases.
16//
Nate Begeman1d4d4142005-09-01 00:19:25 +000017//===----------------------------------------------------------------------===//
18
19#define DEBUG_TYPE "dagcombine"
Nate Begeman1d4d4142005-09-01 00:19:25 +000020#include "llvm/CodeGen/SelectionDAG.h"
Chris Lattner600fec32009-03-11 05:08:08 +000021#include "llvm/DerivedTypes.h"
Owen Andersona90b3dc2009-07-15 21:51:10 +000022#include "llvm/LLVMContext.h"
Chris Lattner00161a62008-01-25 07:20:16 +000023#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner600fec32009-03-11 05:08:08 +000025#include "llvm/CodeGen/PseudoSourceValue.h"
Chris Lattnerc76d4412007-05-16 06:37:59 +000026#include "llvm/Analysis/AliasAnalysis.h"
Evan Cheng59d5b682007-05-07 21:27:48 +000027#include "llvm/Target/TargetData.h"
Nate Begeman1d4d4142005-09-01 00:19:25 +000028#include "llvm/Target/TargetLowering.h"
Evan Cheng59d5b682007-05-07 21:27:48 +000029#include "llvm/Target/TargetMachine.h"
Chris Lattnerddae4bd2007-01-08 23:04:05 +000030#include "llvm/Target/TargetOptions.h"
Chris Lattnerc76d4412007-05-16 06:37:59 +000031#include "llvm/ADT/SmallPtrSet.h"
32#include "llvm/ADT/Statistic.h"
Jim Laskeyd1aed7a2006-09-21 16:28:59 +000033#include "llvm/Support/CommandLine.h"
Chris Lattnerc76d4412007-05-16 06:37:59 +000034#include "llvm/Support/Debug.h"
Torok Edwin7d696d82009-07-11 13:10:19 +000035#include "llvm/Support/ErrorHandling.h"
Chris Lattnerc76d4412007-05-16 06:37:59 +000036#include "llvm/Support/MathExtras.h"
Chris Lattnerbbbfa992009-08-23 06:35:02 +000037#include "llvm/Support/raw_ostream.h"
Chris Lattnera500fc62005-09-09 23:53:39 +000038#include <algorithm>
Nate Begeman1d4d4142005-09-01 00:19:25 +000039using namespace llvm;
40
Chris Lattnercd3245a2006-12-19 22:41:21 +000041STATISTIC(NodesCombined , "Number of dag nodes combined");
42STATISTIC(PreIndexedNodes , "Number of pre-indexed nodes created");
43STATISTIC(PostIndexedNodes, "Number of post-indexed nodes created");
Evan Cheng8b944d32009-05-28 00:35:15 +000044STATISTIC(OpsNarrowed , "Number of load/op/store narrowed");
Evan Cheng31959b12011-02-02 01:06:55 +000045STATISTIC(LdStFP2Int , "Number of fp load/store pairs transformed to int");
Chris Lattnercd3245a2006-12-19 22:41:21 +000046
Nate Begeman1d4d4142005-09-01 00:19:25 +000047namespace {
Jim Laskey71382342006-10-07 23:37:56 +000048 static cl::opt<bool>
Owen Anderson0dcc8142010-09-19 21:01:26 +000049 CombinerAA("combiner-alias-analysis", cl::Hidden,
Jim Laskey26f7fa72006-10-17 19:33:52 +000050 cl::desc("Turn on alias analysis during testing"));
Jim Laskey3ad175b2006-10-12 15:22:24 +000051
Jim Laskey07a27092006-10-18 19:08:31 +000052 static cl::opt<bool>
53 CombinerGlobalAA("combiner-global-alias-analysis", cl::Hidden,
54 cl::desc("Include global information in alias analysis"));
55
Jim Laskeybc588b82006-10-05 15:07:25 +000056//------------------------------ DAGCombiner ---------------------------------//
57
Nick Lewycky6726b6d2009-10-25 06:33:48 +000058 class DAGCombiner {
Nate Begeman1d4d4142005-09-01 00:19:25 +000059 SelectionDAG &DAG;
Dan Gohman79ce2762009-01-15 19:20:50 +000060 const TargetLowering &TLI;
Duncan Sands25cf2272008-11-24 14:53:14 +000061 CombineLevel Level;
Bill Wendling98a366d2009-04-29 23:29:43 +000062 CodeGenOpt::Level OptLevel;
Duncan Sands25cf2272008-11-24 14:53:14 +000063 bool LegalOperations;
64 bool LegalTypes;
Nate Begeman1d4d4142005-09-01 00:19:25 +000065
66 // Worklist of all of the nodes that need to be simplified.
Evan Cheng17a568b2008-08-29 22:21:44 +000067 std::vector<SDNode*> WorkList;
Nate Begeman1d4d4142005-09-01 00:19:25 +000068
Jim Laskeyc7c3f112006-10-16 20:52:31 +000069 // AA - Used for DAG load/store alias analysis.
70 AliasAnalysis &AA;
71
Nate Begeman1d4d4142005-09-01 00:19:25 +000072 /// AddUsersToWorkList - When an instruction is simplified, add all users of
73 /// the instruction to the work lists because they might get more simplified
74 /// now.
75 ///
76 void AddUsersToWorkList(SDNode *N) {
77 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
Nate Begeman4ebd8052005-09-01 23:24:04 +000078 UI != UE; ++UI)
Dan Gohman89684502008-07-27 20:43:25 +000079 AddToWorkList(*UI);
Nate Begeman1d4d4142005-09-01 00:19:25 +000080 }
81
Dan Gohman389079b2007-10-08 17:57:15 +000082 /// visit - call the node-specific routine that knows how to fold each
83 /// particular type of node.
Dan Gohman475871a2008-07-27 21:46:04 +000084 SDValue visit(SDNode *N);
Dan Gohman389079b2007-10-08 17:57:15 +000085
Chris Lattner24664722006-03-01 04:53:38 +000086 public:
Jim Laskey6ff23e52006-10-04 16:53:27 +000087 /// AddToWorkList - Add to the work list making sure it's instance is at the
88 /// the back (next to be processed.)
Chris Lattner5750df92006-03-01 04:03:14 +000089 void AddToWorkList(SDNode *N) {
Jim Laskey6ff23e52006-10-04 16:53:27 +000090 removeFromWorkList(N);
Chris Lattner5750df92006-03-01 04:03:14 +000091 WorkList.push_back(N);
92 }
Jim Laskey6ff23e52006-10-04 16:53:27 +000093
Chris Lattnerf8dc0612008-02-03 06:49:24 +000094 /// removeFromWorkList - remove all instances of N from the worklist.
95 ///
96 void removeFromWorkList(SDNode *N) {
97 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N),
98 WorkList.end());
Chris Lattner01a22022005-10-10 22:04:48 +000099 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000100
Dan Gohman475871a2008-07-27 21:46:04 +0000101 SDValue CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
Evan Cheng0b0cd912009-03-28 05:57:29 +0000102 bool AddTo = true);
Scott Michelfdc40a02009-02-17 22:15:04 +0000103
Dan Gohman475871a2008-07-27 21:46:04 +0000104 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true) {
Jim Laskey274062c2006-10-13 23:32:28 +0000105 return CombineTo(N, &Res, 1, AddTo);
Chris Lattner24664722006-03-01 04:53:38 +0000106 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000107
Dan Gohman475871a2008-07-27 21:46:04 +0000108 SDValue CombineTo(SDNode *N, SDValue Res0, SDValue Res1,
Evan Cheng0b0cd912009-03-28 05:57:29 +0000109 bool AddTo = true) {
Dan Gohman475871a2008-07-27 21:46:04 +0000110 SDValue To[] = { Res0, Res1 };
Jim Laskey274062c2006-10-13 23:32:28 +0000111 return CombineTo(N, To, 2, AddTo);
Chris Lattner24664722006-03-01 04:53:38 +0000112 }
Dan Gohmane5af2d32009-01-29 01:59:02 +0000113
114 void CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO);
Scott Michelfdc40a02009-02-17 22:15:04 +0000115
116 private:
117
Chris Lattner012f2412006-02-17 21:58:01 +0000118 /// SimplifyDemandedBits - Check the specified integer node value to see if
Chris Lattnerb2742f42006-03-01 19:55:35 +0000119 /// it can be simplified or if things it uses can be simplified by bit
Chris Lattner012f2412006-02-17 21:58:01 +0000120 /// propagation. If so, return true.
Dan Gohman475871a2008-07-27 21:46:04 +0000121 bool SimplifyDemandedBits(SDValue Op) {
Dan Gohman87862e72009-12-11 21:31:27 +0000122 unsigned BitWidth = Op.getValueType().getScalarType().getSizeInBits();
123 APInt Demanded = APInt::getAllOnesValue(BitWidth);
Dan Gohman7b8d4a92008-02-27 00:25:32 +0000124 return SimplifyDemandedBits(Op, Demanded);
125 }
126
Dan Gohman475871a2008-07-27 21:46:04 +0000127 bool SimplifyDemandedBits(SDValue Op, const APInt &Demanded);
Chris Lattner87514ca2005-10-10 22:31:19 +0000128
Chris Lattner448f2192006-11-11 00:39:41 +0000129 bool CombineToPreIndexedLoadStore(SDNode *N);
130 bool CombineToPostIndexedLoadStore(SDNode *N);
Scott Michelfdc40a02009-02-17 22:15:04 +0000131
Evan Cheng95c57ea2010-04-24 04:43:44 +0000132 void ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad);
133 SDValue PromoteOperand(SDValue Op, EVT PVT, bool &Replace);
134 SDValue SExtPromoteOperand(SDValue Op, EVT PVT);
135 SDValue ZExtPromoteOperand(SDValue Op, EVT PVT);
Evan Cheng64b7bf72010-04-16 06:14:10 +0000136 SDValue PromoteIntBinOp(SDValue Op);
Evan Cheng07c4e102010-04-22 20:19:46 +0000137 SDValue PromoteIntShiftOp(SDValue Op);
Evan Cheng4c26e932010-04-19 19:29:22 +0000138 SDValue PromoteExtend(SDValue Op);
139 bool PromoteLoad(SDValue Op);
Scott Michelfdc40a02009-02-17 22:15:04 +0000140
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +0000141 void ExtendSetCCUses(SmallVector<SDNode*, 4> SetCCs,
142 SDValue Trunc, SDValue ExtLoad, DebugLoc DL,
143 ISD::NodeType ExtType);
144
Dan Gohman389079b2007-10-08 17:57:15 +0000145 /// combine - call the node-specific routine that knows how to fold each
146 /// particular type of node. If that doesn't do anything, try the
147 /// target-specific DAG combines.
Dan Gohman475871a2008-07-27 21:46:04 +0000148 SDValue combine(SDNode *N);
Nate Begeman1d4d4142005-09-01 00:19:25 +0000149
150 // Visitation implementation - Implement dag node combining for different
151 // node types. The semantics are as follows:
152 // Return Value:
Evan Cheng17a568b2008-08-29 22:21:44 +0000153 // SDValue.getNode() == 0 - No change was made
154 // SDValue.getNode() == N - N was replaced, is dead and has been handled.
155 // otherwise - N should be replaced by the returned Operand.
Nate Begeman1d4d4142005-09-01 00:19:25 +0000156 //
Dan Gohman475871a2008-07-27 21:46:04 +0000157 SDValue visitTokenFactor(SDNode *N);
158 SDValue visitMERGE_VALUES(SDNode *N);
159 SDValue visitADD(SDNode *N);
160 SDValue visitSUB(SDNode *N);
161 SDValue visitADDC(SDNode *N);
162 SDValue visitADDE(SDNode *N);
163 SDValue visitMUL(SDNode *N);
164 SDValue visitSDIV(SDNode *N);
165 SDValue visitUDIV(SDNode *N);
166 SDValue visitSREM(SDNode *N);
167 SDValue visitUREM(SDNode *N);
168 SDValue visitMULHU(SDNode *N);
169 SDValue visitMULHS(SDNode *N);
170 SDValue visitSMUL_LOHI(SDNode *N);
171 SDValue visitUMUL_LOHI(SDNode *N);
Benjamin Kramerf55d26e2011-05-21 18:31:55 +0000172 SDValue visitSMULO(SDNode *N);
173 SDValue visitUMULO(SDNode *N);
Dan Gohman475871a2008-07-27 21:46:04 +0000174 SDValue visitSDIVREM(SDNode *N);
175 SDValue visitUDIVREM(SDNode *N);
176 SDValue visitAND(SDNode *N);
177 SDValue visitOR(SDNode *N);
178 SDValue visitXOR(SDNode *N);
179 SDValue SimplifyVBinOp(SDNode *N);
180 SDValue visitSHL(SDNode *N);
181 SDValue visitSRA(SDNode *N);
182 SDValue visitSRL(SDNode *N);
183 SDValue visitCTLZ(SDNode *N);
184 SDValue visitCTTZ(SDNode *N);
185 SDValue visitCTPOP(SDNode *N);
186 SDValue visitSELECT(SDNode *N);
187 SDValue visitSELECT_CC(SDNode *N);
188 SDValue visitSETCC(SDNode *N);
189 SDValue visitSIGN_EXTEND(SDNode *N);
190 SDValue visitZERO_EXTEND(SDNode *N);
191 SDValue visitANY_EXTEND(SDNode *N);
192 SDValue visitSIGN_EXTEND_INREG(SDNode *N);
193 SDValue visitTRUNCATE(SDNode *N);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000194 SDValue visitBITCAST(SDNode *N);
Dan Gohman475871a2008-07-27 21:46:04 +0000195 SDValue visitBUILD_PAIR(SDNode *N);
196 SDValue visitFADD(SDNode *N);
197 SDValue visitFSUB(SDNode *N);
198 SDValue visitFMUL(SDNode *N);
199 SDValue visitFDIV(SDNode *N);
200 SDValue visitFREM(SDNode *N);
201 SDValue visitFCOPYSIGN(SDNode *N);
202 SDValue visitSINT_TO_FP(SDNode *N);
203 SDValue visitUINT_TO_FP(SDNode *N);
204 SDValue visitFP_TO_SINT(SDNode *N);
205 SDValue visitFP_TO_UINT(SDNode *N);
206 SDValue visitFP_ROUND(SDNode *N);
207 SDValue visitFP_ROUND_INREG(SDNode *N);
208 SDValue visitFP_EXTEND(SDNode *N);
209 SDValue visitFNEG(SDNode *N);
210 SDValue visitFABS(SDNode *N);
211 SDValue visitBRCOND(SDNode *N);
212 SDValue visitBR_CC(SDNode *N);
213 SDValue visitLOAD(SDNode *N);
214 SDValue visitSTORE(SDNode *N);
215 SDValue visitINSERT_VECTOR_ELT(SDNode *N);
216 SDValue visitEXTRACT_VECTOR_ELT(SDNode *N);
217 SDValue visitBUILD_VECTOR(SDNode *N);
218 SDValue visitCONCAT_VECTORS(SDNode *N);
219 SDValue visitVECTOR_SHUFFLE(SDNode *N);
Jim Grosbach9a526492010-06-23 16:07:42 +0000220 SDValue visitMEMBARRIER(SDNode *N);
Chris Lattner01a22022005-10-10 22:04:48 +0000221
Dan Gohman475871a2008-07-27 21:46:04 +0000222 SDValue XformToShuffleWithZero(SDNode *N);
Bill Wendling35247c32009-01-30 00:45:56 +0000223 SDValue ReassociateOps(unsigned Opc, DebugLoc DL, SDValue LHS, SDValue RHS);
Scott Michelfdc40a02009-02-17 22:15:04 +0000224
Dan Gohman475871a2008-07-27 21:46:04 +0000225 SDValue visitShiftByConstant(SDNode *N, unsigned Amt);
Chris Lattnere70da202007-12-06 07:33:36 +0000226
Dan Gohman475871a2008-07-27 21:46:04 +0000227 bool SimplifySelectOps(SDNode *SELECT, SDValue LHS, SDValue RHS);
228 SDValue SimplifyBinOpWithSameOpcodeHands(SDNode *N);
Bill Wendling836ca7d2009-01-30 23:59:18 +0000229 SDValue SimplifySelect(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2);
Scott Michelfdc40a02009-02-17 22:15:04 +0000230 SDValue SimplifySelectCC(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2,
231 SDValue N3, ISD::CondCode CC,
Bill Wendling836ca7d2009-01-30 23:59:18 +0000232 bool NotExtCompare = false);
Owen Andersone50ed302009-08-10 22:56:29 +0000233 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
Dale Johannesenff97d4f2009-02-03 00:47:48 +0000234 DebugLoc DL, bool foldBooleans = true);
Scott Michelfdc40a02009-02-17 22:15:04 +0000235 SDValue SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp,
Chris Lattner5eee4272008-01-26 01:09:19 +0000236 unsigned HiOp);
Owen Andersone50ed302009-08-10 22:56:29 +0000237 SDValue CombineConsecutiveLoads(SDNode *N, EVT VT);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000238 SDValue ConstantFoldBITCASTofBUILD_VECTOR(SDNode *, EVT);
Dan Gohman475871a2008-07-27 21:46:04 +0000239 SDValue BuildSDIV(SDNode *N);
240 SDValue BuildUDIV(SDNode *N);
Evan Cheng9568e5c2011-06-21 06:01:08 +0000241 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
242 bool DemandHighBits = true);
243 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
Bill Wendling317bd702009-01-30 21:14:50 +0000244 SDNode *MatchRotate(SDValue LHS, SDValue RHS, DebugLoc DL);
Dan Gohman475871a2008-07-27 21:46:04 +0000245 SDValue ReduceLoadWidth(SDNode *N);
Evan Cheng8b944d32009-05-28 00:35:15 +0000246 SDValue ReduceLoadOpStoreWidth(SDNode *N);
Evan Cheng31959b12011-02-02 01:06:55 +0000247 SDValue TransformFPLoadStorePair(SDNode *N);
Scott Michelfdc40a02009-02-17 22:15:04 +0000248
Dan Gohman475871a2008-07-27 21:46:04 +0000249 SDValue GetDemandedBits(SDValue V, const APInt &Mask);
Scott Michelfdc40a02009-02-17 22:15:04 +0000250
Jim Laskey6ff23e52006-10-04 16:53:27 +0000251 /// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes,
252 /// looking for aliasing nodes and adding them to the Aliases vector.
Dan Gohman475871a2008-07-27 21:46:04 +0000253 void GatherAllAliases(SDNode *N, SDValue OriginalChain,
254 SmallVector<SDValue, 8> &Aliases);
Jim Laskey6ff23e52006-10-04 16:53:27 +0000255
Jim Laskey096c22e2006-10-18 12:29:57 +0000256 /// isAlias - Return true if there is any possibility that the two addresses
257 /// overlap.
Dan Gohman475871a2008-07-27 21:46:04 +0000258 bool isAlias(SDValue Ptr1, int64_t Size1,
Jim Laskey096c22e2006-10-18 12:29:57 +0000259 const Value *SrcValue1, int SrcValueOffset1,
Nate Begemanb6aef5c2009-09-15 00:18:30 +0000260 unsigned SrcValueAlign1,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +0000261 const MDNode *TBAAInfo1,
Dan Gohman475871a2008-07-27 21:46:04 +0000262 SDValue Ptr2, int64_t Size2,
Nate Begemanb6aef5c2009-09-15 00:18:30 +0000263 const Value *SrcValue2, int SrcValueOffset2,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +0000264 unsigned SrcValueAlign2,
265 const MDNode *TBAAInfo2) const;
Scott Michelfdc40a02009-02-17 22:15:04 +0000266
Jim Laskey7ca56af2006-10-11 13:47:09 +0000267 /// FindAliasInfo - Extracts the relevant alias information from the memory
268 /// node. Returns true if the operand was a load.
269 bool FindAliasInfo(SDNode *N,
Dan Gohman475871a2008-07-27 21:46:04 +0000270 SDValue &Ptr, int64_t &Size,
Nate Begemanb6aef5c2009-09-15 00:18:30 +0000271 const Value *&SrcValue, int &SrcValueOffset,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +0000272 unsigned &SrcValueAlignment,
273 const MDNode *&TBAAInfo) const;
Scott Michelfdc40a02009-02-17 22:15:04 +0000274
Jim Laskey279f0532006-09-25 16:29:54 +0000275 /// FindBetterChain - Walk up chain skipping non-aliasing memory nodes,
Jim Laskey6ff23e52006-10-04 16:53:27 +0000276 /// looking for a better chain (aliasing node.)
Dan Gohman475871a2008-07-27 21:46:04 +0000277 SDValue FindBetterChain(SDNode *N, SDValue Chain);
Duncan Sands92abc622009-01-31 15:50:11 +0000278
Chris Lattner2392ae72010-04-15 04:48:01 +0000279 public:
Bill Wendling98a366d2009-04-29 23:29:43 +0000280 DAGCombiner(SelectionDAG &D, AliasAnalysis &A, CodeGenOpt::Level OL)
Chris Lattner2392ae72010-04-15 04:48:01 +0000281 : DAG(D), TLI(D.getTargetLoweringInfo()), Level(Unrestricted),
282 OptLevel(OL), LegalOperations(false), LegalTypes(false), AA(A) {}
Scott Michelfdc40a02009-02-17 22:15:04 +0000283
Nate Begeman1d4d4142005-09-01 00:19:25 +0000284 /// Run - runs the dag combiner on all nodes in the work list
Duncan Sands25cf2272008-11-24 14:53:14 +0000285 void Run(CombineLevel AtLevel);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000286
Chris Lattner2392ae72010-04-15 04:48:01 +0000287 SelectionDAG &getDAG() const { return DAG; }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000288
Chris Lattner2392ae72010-04-15 04:48:01 +0000289 /// getShiftAmountTy - Returns a type large enough to hold any valid
290 /// shift amount - before type legalization these can be huge.
Owen Anderson95771af2011-02-25 21:41:48 +0000291 EVT getShiftAmountTy(EVT LHSTy) {
292 return LegalTypes ? TLI.getShiftAmountTy(LHSTy) : TLI.getPointerTy();
Chris Lattner2392ae72010-04-15 04:48:01 +0000293 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000294
Chris Lattner2392ae72010-04-15 04:48:01 +0000295 /// isTypeLegal - This method returns true if we are running before type
296 /// legalization or if the specified VT is legal.
297 bool isTypeLegal(const EVT &VT) {
298 if (!LegalTypes) return true;
299 return TLI.isTypeLegal(VT);
300 }
Nate Begeman1d4d4142005-09-01 00:19:25 +0000301 };
302}
303
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000304
305namespace {
306/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted
307/// nodes from the worklist.
Nick Lewycky6726b6d2009-10-25 06:33:48 +0000308class WorkListRemover : public SelectionDAG::DAGUpdateListener {
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000309 DAGCombiner &DC;
310public:
Dan Gohmanb5660dc2008-02-20 16:44:09 +0000311 explicit WorkListRemover(DAGCombiner &dc) : DC(dc) {}
Scott Michelfdc40a02009-02-17 22:15:04 +0000312
Duncan Sandsedfcf592008-06-11 11:42:12 +0000313 virtual void NodeDeleted(SDNode *N, SDNode *E) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000314 DC.removeFromWorkList(N);
315 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000316
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000317 virtual void NodeUpdated(SDNode *N) {
318 // Ignore updates.
319 }
320};
321}
322
Chris Lattner24664722006-03-01 04:53:38 +0000323//===----------------------------------------------------------------------===//
324// TargetLowering::DAGCombinerInfo implementation
325//===----------------------------------------------------------------------===//
326
327void TargetLowering::DAGCombinerInfo::AddToWorklist(SDNode *N) {
328 ((DAGCombiner*)DC)->AddToWorkList(N);
329}
330
Cameron Zwariched3caf92011-04-02 02:40:26 +0000331void TargetLowering::DAGCombinerInfo::RemoveFromWorklist(SDNode *N) {
332 ((DAGCombiner*)DC)->removeFromWorkList(N);
333}
334
Dan Gohman475871a2008-07-27 21:46:04 +0000335SDValue TargetLowering::DAGCombinerInfo::
Evan Cheng0b0cd912009-03-28 05:57:29 +0000336CombineTo(SDNode *N, const std::vector<SDValue> &To, bool AddTo) {
337 return ((DAGCombiner*)DC)->CombineTo(N, &To[0], To.size(), AddTo);
Chris Lattner24664722006-03-01 04:53:38 +0000338}
339
Dan Gohman475871a2008-07-27 21:46:04 +0000340SDValue TargetLowering::DAGCombinerInfo::
Evan Cheng0b0cd912009-03-28 05:57:29 +0000341CombineTo(SDNode *N, SDValue Res, bool AddTo) {
342 return ((DAGCombiner*)DC)->CombineTo(N, Res, AddTo);
Chris Lattner24664722006-03-01 04:53:38 +0000343}
344
345
Dan Gohman475871a2008-07-27 21:46:04 +0000346SDValue TargetLowering::DAGCombinerInfo::
Evan Cheng0b0cd912009-03-28 05:57:29 +0000347CombineTo(SDNode *N, SDValue Res0, SDValue Res1, bool AddTo) {
348 return ((DAGCombiner*)DC)->CombineTo(N, Res0, Res1, AddTo);
Chris Lattner24664722006-03-01 04:53:38 +0000349}
350
Dan Gohmane5af2d32009-01-29 01:59:02 +0000351void TargetLowering::DAGCombinerInfo::
352CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) {
353 return ((DAGCombiner*)DC)->CommitTargetLoweringOpt(TLO);
354}
Chris Lattner24664722006-03-01 04:53:38 +0000355
Chris Lattner24664722006-03-01 04:53:38 +0000356//===----------------------------------------------------------------------===//
Chris Lattner29446522007-05-14 22:04:50 +0000357// Helper Functions
358//===----------------------------------------------------------------------===//
359
360/// isNegatibleForFree - Return 1 if we can compute the negated form of the
361/// specified expression for the same cost as the expression itself, or 2 if we
362/// can compute the negated form more cheaply than the expression itself.
Duncan Sands25cf2272008-11-24 14:53:14 +0000363static char isNegatibleForFree(SDValue Op, bool LegalOperations,
Chris Lattner0254e702008-02-26 07:04:54 +0000364 unsigned Depth = 0) {
Dale Johannesendb44bf82007-10-16 23:38:29 +0000365 // No compile time optimizations on this type.
Owen Anderson825b72b2009-08-11 20:47:22 +0000366 if (Op.getValueType() == MVT::ppcf128)
Dale Johannesendb44bf82007-10-16 23:38:29 +0000367 return 0;
368
Chris Lattner29446522007-05-14 22:04:50 +0000369 // fneg is removable even if it has multiple uses.
370 if (Op.getOpcode() == ISD::FNEG) return 2;
Scott Michelfdc40a02009-02-17 22:15:04 +0000371
Chris Lattner29446522007-05-14 22:04:50 +0000372 // Don't allow anything with multiple uses.
373 if (!Op.hasOneUse()) return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +0000374
Chris Lattner3adf9512007-05-25 02:19:06 +0000375 // Don't recurse exponentially.
376 if (Depth > 6) return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +0000377
Chris Lattner29446522007-05-14 22:04:50 +0000378 switch (Op.getOpcode()) {
379 default: return false;
380 case ISD::ConstantFP:
Chris Lattner0254e702008-02-26 07:04:54 +0000381 // Don't invert constant FP values after legalize. The negated constant
382 // isn't necessarily legal.
Duncan Sands25cf2272008-11-24 14:53:14 +0000383 return LegalOperations ? 0 : 1;
Chris Lattner29446522007-05-14 22:04:50 +0000384 case ISD::FADD:
385 // FIXME: determine better conditions for this xform.
386 if (!UnsafeFPMath) return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +0000387
Bill Wendlingd34470c2009-01-30 23:10:18 +0000388 // fold (fsub (fadd A, B)) -> (fsub (fneg A), B)
Duncan Sands25cf2272008-11-24 14:53:14 +0000389 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1))
Chris Lattner29446522007-05-14 22:04:50 +0000390 return V;
Bill Wendlingd34470c2009-01-30 23:10:18 +0000391 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A)
Duncan Sands25cf2272008-11-24 14:53:14 +0000392 return isNegatibleForFree(Op.getOperand(1), LegalOperations, Depth+1);
Chris Lattner29446522007-05-14 22:04:50 +0000393 case ISD::FSUB:
Scott Michelfdc40a02009-02-17 22:15:04 +0000394 // We can't turn -(A-B) into B-A when we honor signed zeros.
Chris Lattner29446522007-05-14 22:04:50 +0000395 if (!UnsafeFPMath) return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +0000396
Bill Wendlingd34470c2009-01-30 23:10:18 +0000397 // fold (fneg (fsub A, B)) -> (fsub B, A)
Chris Lattner29446522007-05-14 22:04:50 +0000398 return 1;
Scott Michelfdc40a02009-02-17 22:15:04 +0000399
Chris Lattner29446522007-05-14 22:04:50 +0000400 case ISD::FMUL:
401 case ISD::FDIV:
402 if (HonorSignDependentRoundingFPMath()) return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +0000403
Bill Wendlingd34470c2009-01-30 23:10:18 +0000404 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y) or (fmul X, (fneg Y))
Duncan Sands25cf2272008-11-24 14:53:14 +0000405 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1))
Chris Lattner29446522007-05-14 22:04:50 +0000406 return V;
Scott Michelfdc40a02009-02-17 22:15:04 +0000407
Duncan Sands25cf2272008-11-24 14:53:14 +0000408 return isNegatibleForFree(Op.getOperand(1), LegalOperations, Depth+1);
Scott Michelfdc40a02009-02-17 22:15:04 +0000409
Chris Lattner29446522007-05-14 22:04:50 +0000410 case ISD::FP_EXTEND:
411 case ISD::FP_ROUND:
412 case ISD::FSIN:
Duncan Sands25cf2272008-11-24 14:53:14 +0000413 return isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1);
Chris Lattner29446522007-05-14 22:04:50 +0000414 }
415}
416
417/// GetNegatedExpression - If isNegatibleForFree returns true, this function
418/// returns the newly negated expression.
Dan Gohman475871a2008-07-27 21:46:04 +0000419static SDValue GetNegatedExpression(SDValue Op, SelectionDAG &DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000420 bool LegalOperations, unsigned Depth = 0) {
Chris Lattner29446522007-05-14 22:04:50 +0000421 // fneg is removable even if it has multiple uses.
422 if (Op.getOpcode() == ISD::FNEG) return Op.getOperand(0);
Scott Michelfdc40a02009-02-17 22:15:04 +0000423
Chris Lattner29446522007-05-14 22:04:50 +0000424 // Don't allow anything with multiple uses.
425 assert(Op.hasOneUse() && "Unknown reuse!");
Scott Michelfdc40a02009-02-17 22:15:04 +0000426
Chris Lattner3adf9512007-05-25 02:19:06 +0000427 assert(Depth <= 6 && "GetNegatedExpression doesn't match isNegatibleForFree");
Chris Lattner29446522007-05-14 22:04:50 +0000428 switch (Op.getOpcode()) {
Torok Edwinc23197a2009-07-14 16:55:14 +0000429 default: llvm_unreachable("Unknown code");
Dale Johannesenc4dd3c32007-08-31 23:34:27 +0000430 case ISD::ConstantFP: {
431 APFloat V = cast<ConstantFPSDNode>(Op)->getValueAPF();
432 V.changeSign();
433 return DAG.getConstantFP(V, Op.getValueType());
434 }
Chris Lattner29446522007-05-14 22:04:50 +0000435 case ISD::FADD:
436 // FIXME: determine better conditions for this xform.
437 assert(UnsafeFPMath);
Scott Michelfdc40a02009-02-17 22:15:04 +0000438
Bill Wendlingd34470c2009-01-30 23:10:18 +0000439 // fold (fneg (fadd A, B)) -> (fsub (fneg A), B)
Duncan Sands25cf2272008-11-24 14:53:14 +0000440 if (isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1))
Bill Wendling35247c32009-01-30 00:45:56 +0000441 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +0000442 GetNegatedExpression(Op.getOperand(0), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000443 LegalOperations, Depth+1),
Chris Lattner29446522007-05-14 22:04:50 +0000444 Op.getOperand(1));
Bill Wendlingd34470c2009-01-30 23:10:18 +0000445 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A)
Bill Wendling35247c32009-01-30 00:45:56 +0000446 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +0000447 GetNegatedExpression(Op.getOperand(1), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000448 LegalOperations, Depth+1),
Chris Lattner29446522007-05-14 22:04:50 +0000449 Op.getOperand(0));
450 case ISD::FSUB:
Scott Michelfdc40a02009-02-17 22:15:04 +0000451 // We can't turn -(A-B) into B-A when we honor signed zeros.
Chris Lattner29446522007-05-14 22:04:50 +0000452 assert(UnsafeFPMath);
Dan Gohman23ff1822007-07-02 15:48:56 +0000453
Bill Wendlingd34470c2009-01-30 23:10:18 +0000454 // fold (fneg (fsub 0, B)) -> B
Dan Gohman23ff1822007-07-02 15:48:56 +0000455 if (ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(Op.getOperand(0)))
Dale Johannesenc4dd3c32007-08-31 23:34:27 +0000456 if (N0CFP->getValueAPF().isZero())
Dan Gohman23ff1822007-07-02 15:48:56 +0000457 return Op.getOperand(1);
Scott Michelfdc40a02009-02-17 22:15:04 +0000458
Bill Wendlingd34470c2009-01-30 23:10:18 +0000459 // fold (fneg (fsub A, B)) -> (fsub B, A)
Bill Wendling35247c32009-01-30 00:45:56 +0000460 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(),
461 Op.getOperand(1), Op.getOperand(0));
Scott Michelfdc40a02009-02-17 22:15:04 +0000462
Chris Lattner29446522007-05-14 22:04:50 +0000463 case ISD::FMUL:
464 case ISD::FDIV:
465 assert(!HonorSignDependentRoundingFPMath());
Scott Michelfdc40a02009-02-17 22:15:04 +0000466
Bill Wendlingd34470c2009-01-30 23:10:18 +0000467 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y)
Duncan Sands25cf2272008-11-24 14:53:14 +0000468 if (isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1))
Bill Wendling35247c32009-01-30 00:45:56 +0000469 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +0000470 GetNegatedExpression(Op.getOperand(0), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000471 LegalOperations, Depth+1),
Chris Lattner29446522007-05-14 22:04:50 +0000472 Op.getOperand(1));
Scott Michelfdc40a02009-02-17 22:15:04 +0000473
Bill Wendlingd34470c2009-01-30 23:10:18 +0000474 // fold (fneg (fmul X, Y)) -> (fmul X, (fneg Y))
Bill Wendling35247c32009-01-30 00:45:56 +0000475 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(),
Chris Lattner29446522007-05-14 22:04:50 +0000476 Op.getOperand(0),
Chris Lattner0254e702008-02-26 07:04:54 +0000477 GetNegatedExpression(Op.getOperand(1), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000478 LegalOperations, Depth+1));
Scott Michelfdc40a02009-02-17 22:15:04 +0000479
Chris Lattner29446522007-05-14 22:04:50 +0000480 case ISD::FP_EXTEND:
Chris Lattner29446522007-05-14 22:04:50 +0000481 case ISD::FSIN:
Bill Wendling35247c32009-01-30 00:45:56 +0000482 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +0000483 GetNegatedExpression(Op.getOperand(0), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000484 LegalOperations, Depth+1));
Chris Lattner0bd48932008-01-17 07:00:52 +0000485 case ISD::FP_ROUND:
Bill Wendling35247c32009-01-30 00:45:56 +0000486 return DAG.getNode(ISD::FP_ROUND, Op.getDebugLoc(), Op.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +0000487 GetNegatedExpression(Op.getOperand(0), DAG,
Duncan Sands25cf2272008-11-24 14:53:14 +0000488 LegalOperations, Depth+1),
Chris Lattner0bd48932008-01-17 07:00:52 +0000489 Op.getOperand(1));
Chris Lattner29446522007-05-14 22:04:50 +0000490 }
491}
Chris Lattner24664722006-03-01 04:53:38 +0000492
493
Nate Begeman4ebd8052005-09-01 23:24:04 +0000494// isSetCCEquivalent - Return true if this node is a setcc, or is a select_cc
495// that selects between the values 1 and 0, making it equivalent to a setcc.
Scott Michelfdc40a02009-02-17 22:15:04 +0000496// Also, set the incoming LHS, RHS, and CC references to the appropriate
Nate Begeman646d7e22005-09-02 21:18:40 +0000497// nodes based on the type of node we are checking. This simplifies life a
498// bit for the callers.
Dan Gohman475871a2008-07-27 21:46:04 +0000499static bool isSetCCEquivalent(SDValue N, SDValue &LHS, SDValue &RHS,
500 SDValue &CC) {
Nate Begeman646d7e22005-09-02 21:18:40 +0000501 if (N.getOpcode() == ISD::SETCC) {
502 LHS = N.getOperand(0);
503 RHS = N.getOperand(1);
504 CC = N.getOperand(2);
Nate Begeman4ebd8052005-09-01 23:24:04 +0000505 return true;
Nate Begeman646d7e22005-09-02 21:18:40 +0000506 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000507 if (N.getOpcode() == ISD::SELECT_CC &&
Nate Begeman1d4d4142005-09-01 00:19:25 +0000508 N.getOperand(2).getOpcode() == ISD::Constant &&
509 N.getOperand(3).getOpcode() == ISD::Constant &&
Dan Gohman002e5d02008-03-13 22:13:53 +0000510 cast<ConstantSDNode>(N.getOperand(2))->getAPIntValue() == 1 &&
Nate Begeman646d7e22005-09-02 21:18:40 +0000511 cast<ConstantSDNode>(N.getOperand(3))->isNullValue()) {
512 LHS = N.getOperand(0);
513 RHS = N.getOperand(1);
514 CC = N.getOperand(4);
Nate Begeman1d4d4142005-09-01 00:19:25 +0000515 return true;
Nate Begeman646d7e22005-09-02 21:18:40 +0000516 }
Nate Begeman1d4d4142005-09-01 00:19:25 +0000517 return false;
518}
519
Nate Begeman99801192005-09-07 23:25:52 +0000520// isOneUseSetCC - Return true if this is a SetCC-equivalent operation with only
521// one use. If this is true, it allows the users to invert the operation for
522// free when it is profitable to do so.
Dan Gohman475871a2008-07-27 21:46:04 +0000523static bool isOneUseSetCC(SDValue N) {
524 SDValue N0, N1, N2;
Gabor Greifba36cb52008-08-28 21:40:38 +0000525 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
Nate Begeman4ebd8052005-09-01 23:24:04 +0000526 return true;
527 return false;
528}
529
Bill Wendling35247c32009-01-30 00:45:56 +0000530SDValue DAGCombiner::ReassociateOps(unsigned Opc, DebugLoc DL,
531 SDValue N0, SDValue N1) {
Owen Andersone50ed302009-08-10 22:56:29 +0000532 EVT VT = N0.getValueType();
Nate Begemancd4d58c2006-02-03 06:46:56 +0000533 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1))) {
534 if (isa<ConstantSDNode>(N1)) {
Bill Wendling35247c32009-01-30 00:45:56 +0000535 // reassoc. (op (op x, c1), c2) -> (op x, (op c1, c2))
Bill Wendling6af76182009-01-30 20:50:00 +0000536 SDValue OpNode =
537 DAG.FoldConstantArithmetic(Opc, VT,
538 cast<ConstantSDNode>(N0.getOperand(1)),
539 cast<ConstantSDNode>(N1));
Bill Wendlingd69c3142009-01-30 02:23:43 +0000540 return DAG.getNode(Opc, DL, VT, N0.getOperand(0), OpNode);
Dan Gohman71dc7c92011-05-17 22:20:36 +0000541 }
542 if (N0.hasOneUse()) {
Bill Wendling35247c32009-01-30 00:45:56 +0000543 // reassoc. (op (op x, c1), y) -> (op (op x, y), c1) iff x+c1 has one use
544 SDValue OpNode = DAG.getNode(Opc, N0.getDebugLoc(), VT,
545 N0.getOperand(0), N1);
Gabor Greifba36cb52008-08-28 21:40:38 +0000546 AddToWorkList(OpNode.getNode());
Bill Wendling35247c32009-01-30 00:45:56 +0000547 return DAG.getNode(Opc, DL, VT, OpNode, N0.getOperand(1));
Nate Begemancd4d58c2006-02-03 06:46:56 +0000548 }
549 }
Bill Wendling35247c32009-01-30 00:45:56 +0000550
Nate Begemancd4d58c2006-02-03 06:46:56 +0000551 if (N1.getOpcode() == Opc && isa<ConstantSDNode>(N1.getOperand(1))) {
552 if (isa<ConstantSDNode>(N0)) {
Bill Wendling35247c32009-01-30 00:45:56 +0000553 // reassoc. (op c2, (op x, c1)) -> (op x, (op c1, c2))
Bill Wendling6af76182009-01-30 20:50:00 +0000554 SDValue OpNode =
555 DAG.FoldConstantArithmetic(Opc, VT,
556 cast<ConstantSDNode>(N1.getOperand(1)),
557 cast<ConstantSDNode>(N0));
Bill Wendlingd69c3142009-01-30 02:23:43 +0000558 return DAG.getNode(Opc, DL, VT, N1.getOperand(0), OpNode);
Dan Gohman71dc7c92011-05-17 22:20:36 +0000559 }
560 if (N1.hasOneUse()) {
Bill Wendling35247c32009-01-30 00:45:56 +0000561 // reassoc. (op y, (op x, c1)) -> (op (op x, y), c1) iff x+c1 has one use
Bill Wendlingd69c3142009-01-30 02:23:43 +0000562 SDValue OpNode = DAG.getNode(Opc, N0.getDebugLoc(), VT,
Bill Wendling35247c32009-01-30 00:45:56 +0000563 N1.getOperand(0), N0);
Gabor Greifba36cb52008-08-28 21:40:38 +0000564 AddToWorkList(OpNode.getNode());
Bill Wendling35247c32009-01-30 00:45:56 +0000565 return DAG.getNode(Opc, DL, VT, OpNode, N1.getOperand(1));
Nate Begemancd4d58c2006-02-03 06:46:56 +0000566 }
567 }
Bill Wendling35247c32009-01-30 00:45:56 +0000568
Dan Gohman475871a2008-07-27 21:46:04 +0000569 return SDValue();
Nate Begemancd4d58c2006-02-03 06:46:56 +0000570}
571
Dan Gohman475871a2008-07-27 21:46:04 +0000572SDValue DAGCombiner::CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
573 bool AddTo) {
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000574 assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
575 ++NodesCombined;
David Greenef1090292010-01-05 01:25:00 +0000576 DEBUG(dbgs() << "\nReplacing.1 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +0000577 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +0000578 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +0000579 To[0].getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +0000580 dbgs() << " and " << NumTo-1 << " other values\n";
Chris Lattnerbbbfa992009-08-23 06:35:02 +0000581 for (unsigned i = 0, e = NumTo; i != e; ++i)
Jakob Stoklund Olesen9f0d4e62009-12-03 05:15:35 +0000582 assert((!To[i].getNode() ||
583 N->getValueType(i) == To[i].getValueType()) &&
Dan Gohman764fd0c2009-01-21 15:17:51 +0000584 "Cannot combine value to value of different type!"));
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000585 WorkListRemover DeadNodes(*this);
586 DAG.ReplaceAllUsesWith(N, To, &DeadNodes);
Scott Michelfdc40a02009-02-17 22:15:04 +0000587
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000588 if (AddTo) {
589 // Push the new nodes and any users onto the worklist
590 for (unsigned i = 0, e = NumTo; i != e; ++i) {
Chris Lattnerd1980a52009-03-12 06:52:53 +0000591 if (To[i].getNode()) {
592 AddToWorkList(To[i].getNode());
593 AddUsersToWorkList(To[i].getNode());
594 }
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000595 }
596 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000597
Dan Gohmandbe664a2009-01-19 21:44:21 +0000598 // Finally, if the node is now dead, remove it from the graph. The node
599 // may not be dead if the replacement process recursively simplified to
600 // something else needing this node.
601 if (N->use_empty()) {
602 // Nodes can be reintroduced into the worklist. Make sure we do not
603 // process a node that has been replaced.
604 removeFromWorkList(N);
Scott Michelfdc40a02009-02-17 22:15:04 +0000605
Dan Gohmandbe664a2009-01-19 21:44:21 +0000606 // Finally, since the node is now dead, remove it from the graph.
607 DAG.DeleteNode(N);
608 }
Dan Gohman475871a2008-07-27 21:46:04 +0000609 return SDValue(N, 0);
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000610}
611
Evan Chenge5b51ac2010-04-17 06:13:15 +0000612void DAGCombiner::
613CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) {
Scott Michelfdc40a02009-02-17 22:15:04 +0000614 // Replace all uses. If any nodes become isomorphic to other nodes and
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000615 // are deleted, make sure to remove them from our worklist.
616 WorkListRemover DeadNodes(*this);
617 DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes);
Dan Gohmane5af2d32009-01-29 01:59:02 +0000618
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000619 // Push the new node and any (possibly new) users onto the worklist.
Gabor Greifba36cb52008-08-28 21:40:38 +0000620 AddToWorkList(TLO.New.getNode());
621 AddUsersToWorkList(TLO.New.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +0000622
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000623 // Finally, if the node is now dead, remove it from the graph. The node
624 // may not be dead if the replacement process recursively simplified to
625 // something else needing this node.
Gabor Greifba36cb52008-08-28 21:40:38 +0000626 if (TLO.Old.getNode()->use_empty()) {
627 removeFromWorkList(TLO.Old.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +0000628
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000629 // If the operands of this node are only used by the node, they will now
630 // be dead. Make sure to visit them first to delete dead nodes early.
Gabor Greifba36cb52008-08-28 21:40:38 +0000631 for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); i != e; ++i)
632 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse())
633 AddToWorkList(TLO.Old.getNode()->getOperand(i).getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +0000634
Gabor Greifba36cb52008-08-28 21:40:38 +0000635 DAG.DeleteNode(TLO.Old.getNode());
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000636 }
Dan Gohmane5af2d32009-01-29 01:59:02 +0000637}
638
639/// SimplifyDemandedBits - Check the specified integer node value to see if
640/// it can be simplified or if things it uses can be simplified by bit
641/// propagation. If so, return true.
642bool DAGCombiner::SimplifyDemandedBits(SDValue Op, const APInt &Demanded) {
Evan Chenge5b51ac2010-04-17 06:13:15 +0000643 TargetLowering::TargetLoweringOpt TLO(DAG, LegalTypes, LegalOperations);
Dan Gohmane5af2d32009-01-29 01:59:02 +0000644 APInt KnownZero, KnownOne;
645 if (!TLI.SimplifyDemandedBits(Op, Demanded, KnownZero, KnownOne, TLO))
646 return false;
Scott Michelfdc40a02009-02-17 22:15:04 +0000647
Dan Gohmane5af2d32009-01-29 01:59:02 +0000648 // Revisit the node.
649 AddToWorkList(Op.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +0000650
Dan Gohmane5af2d32009-01-29 01:59:02 +0000651 // Replace the old value with the new one.
652 ++NodesCombined;
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000653 DEBUG(dbgs() << "\nReplacing.2 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +0000654 TLO.Old.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +0000655 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +0000656 TLO.New.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +0000657 dbgs() << '\n');
Scott Michelfdc40a02009-02-17 22:15:04 +0000658
Dan Gohmane5af2d32009-01-29 01:59:02 +0000659 CommitTargetLoweringOpt(TLO);
Chris Lattnerf8dc0612008-02-03 06:49:24 +0000660 return true;
661}
662
Evan Cheng95c57ea2010-04-24 04:43:44 +0000663void DAGCombiner::ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad) {
664 DebugLoc dl = Load->getDebugLoc();
665 EVT VT = Load->getValueType(0);
666 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, dl, VT, SDValue(ExtLoad, 0));
Evan Cheng4c26e932010-04-19 19:29:22 +0000667
Evan Cheng95c57ea2010-04-24 04:43:44 +0000668 DEBUG(dbgs() << "\nReplacing.9 ";
669 Load->dump(&DAG);
670 dbgs() << "\nWith: ";
671 Trunc.getNode()->dump(&DAG);
672 dbgs() << '\n');
673 WorkListRemover DeadNodes(*this);
674 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 0), Trunc, &DeadNodes);
675 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 1), SDValue(ExtLoad, 1),
676 &DeadNodes);
677 removeFromWorkList(Load);
678 DAG.DeleteNode(Load);
Evan Chengac7eae52010-04-27 19:48:13 +0000679 AddToWorkList(Trunc.getNode());
Evan Cheng95c57ea2010-04-24 04:43:44 +0000680}
681
682SDValue DAGCombiner::PromoteOperand(SDValue Op, EVT PVT, bool &Replace) {
683 Replace = false;
Evan Cheng4c26e932010-04-19 19:29:22 +0000684 DebugLoc dl = Op.getDebugLoc();
Evan Chenge5b51ac2010-04-17 06:13:15 +0000685 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(Op)) {
Evan Chengac7eae52010-04-27 19:48:13 +0000686 EVT MemVT = LD->getMemoryVT();
687 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD)
Owen Anderson95771af2011-02-25 21:41:48 +0000688 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT) ? ISD::ZEXTLOAD
Eric Christopher503a64d2010-12-09 04:48:06 +0000689 : ISD::EXTLOAD)
Evan Chengac7eae52010-04-27 19:48:13 +0000690 : LD->getExtensionType();
Evan Cheng95c57ea2010-04-24 04:43:44 +0000691 Replace = true;
Stuart Hastingsa9011292011-02-16 16:23:55 +0000692 return DAG.getExtLoad(ExtType, dl, PVT,
Evan Chenge5b51ac2010-04-17 06:13:15 +0000693 LD->getChain(), LD->getBasePtr(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +0000694 LD->getPointerInfo(),
Evan Chengac7eae52010-04-27 19:48:13 +0000695 MemVT, LD->isVolatile(),
Evan Chenge5b51ac2010-04-17 06:13:15 +0000696 LD->isNonTemporal(), LD->getAlignment());
697 }
698
Evan Cheng4c26e932010-04-19 19:29:22 +0000699 unsigned Opc = Op.getOpcode();
Evan Chengcaf77402010-04-23 19:10:30 +0000700 switch (Opc) {
701 default: break;
702 case ISD::AssertSext:
Evan Cheng4c26e932010-04-19 19:29:22 +0000703 return DAG.getNode(ISD::AssertSext, dl, PVT,
Evan Cheng95c57ea2010-04-24 04:43:44 +0000704 SExtPromoteOperand(Op.getOperand(0), PVT),
Evan Cheng4c26e932010-04-19 19:29:22 +0000705 Op.getOperand(1));
Evan Chengcaf77402010-04-23 19:10:30 +0000706 case ISD::AssertZext:
Evan Cheng4c26e932010-04-19 19:29:22 +0000707 return DAG.getNode(ISD::AssertZext, dl, PVT,
Evan Cheng95c57ea2010-04-24 04:43:44 +0000708 ZExtPromoteOperand(Op.getOperand(0), PVT),
Evan Cheng4c26e932010-04-19 19:29:22 +0000709 Op.getOperand(1));
Evan Chengcaf77402010-04-23 19:10:30 +0000710 case ISD::Constant: {
711 unsigned ExtOpc =
Evan Cheng4c26e932010-04-19 19:29:22 +0000712 Op.getValueType().isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
Evan Chengcaf77402010-04-23 19:10:30 +0000713 return DAG.getNode(ExtOpc, dl, PVT, Op);
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000714 }
Evan Chengcaf77402010-04-23 19:10:30 +0000715 }
716
717 if (!TLI.isOperationLegal(ISD::ANY_EXTEND, PVT))
Evan Chenge5b51ac2010-04-17 06:13:15 +0000718 return SDValue();
Evan Chengcaf77402010-04-23 19:10:30 +0000719 return DAG.getNode(ISD::ANY_EXTEND, dl, PVT, Op);
Evan Cheng64b7bf72010-04-16 06:14:10 +0000720}
721
Evan Cheng95c57ea2010-04-24 04:43:44 +0000722SDValue DAGCombiner::SExtPromoteOperand(SDValue Op, EVT PVT) {
Evan Chenge5b51ac2010-04-17 06:13:15 +0000723 if (!TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, PVT))
724 return SDValue();
725 EVT OldVT = Op.getValueType();
726 DebugLoc dl = Op.getDebugLoc();
Evan Cheng95c57ea2010-04-24 04:43:44 +0000727 bool Replace = false;
728 SDValue NewOp = PromoteOperand(Op, PVT, Replace);
729 if (NewOp.getNode() == 0)
Evan Chenge5b51ac2010-04-17 06:13:15 +0000730 return SDValue();
Evan Chengac7eae52010-04-27 19:48:13 +0000731 AddToWorkList(NewOp.getNode());
Evan Cheng95c57ea2010-04-24 04:43:44 +0000732
733 if (Replace)
734 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode());
735 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NewOp.getValueType(), NewOp,
Evan Chenge5b51ac2010-04-17 06:13:15 +0000736 DAG.getValueType(OldVT));
737}
738
Evan Cheng95c57ea2010-04-24 04:43:44 +0000739SDValue DAGCombiner::ZExtPromoteOperand(SDValue Op, EVT PVT) {
Evan Chenge5b51ac2010-04-17 06:13:15 +0000740 EVT OldVT = Op.getValueType();
741 DebugLoc dl = Op.getDebugLoc();
Evan Cheng95c57ea2010-04-24 04:43:44 +0000742 bool Replace = false;
743 SDValue NewOp = PromoteOperand(Op, PVT, Replace);
744 if (NewOp.getNode() == 0)
Evan Chenge5b51ac2010-04-17 06:13:15 +0000745 return SDValue();
Evan Chengac7eae52010-04-27 19:48:13 +0000746 AddToWorkList(NewOp.getNode());
Evan Cheng95c57ea2010-04-24 04:43:44 +0000747
748 if (Replace)
749 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode());
750 return DAG.getZeroExtendInReg(NewOp, dl, OldVT);
Evan Chenge5b51ac2010-04-17 06:13:15 +0000751}
752
Evan Cheng64b7bf72010-04-16 06:14:10 +0000753/// PromoteIntBinOp - Promote the specified integer binary operation if the
754/// target indicates it is beneficial. e.g. On x86, it's usually better to
755/// promote i16 operations to i32 since i16 instructions are longer.
756SDValue DAGCombiner::PromoteIntBinOp(SDValue Op) {
757 if (!LegalOperations)
758 return SDValue();
759
760 EVT VT = Op.getValueType();
761 if (VT.isVector() || !VT.isInteger())
762 return SDValue();
763
Evan Chenge5b51ac2010-04-17 06:13:15 +0000764 // If operation type is 'undesirable', e.g. i16 on x86, consider
765 // promoting it.
766 unsigned Opc = Op.getOpcode();
767 if (TLI.isTypeDesirableForOp(Opc, VT))
768 return SDValue();
769
Evan Cheng64b7bf72010-04-16 06:14:10 +0000770 EVT PVT = VT;
Evan Chenge5b51ac2010-04-17 06:13:15 +0000771 // Consult target whether it is a good idea to promote this operation and
772 // what's the right type to promote it to.
773 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
Evan Cheng64b7bf72010-04-16 06:14:10 +0000774 assert(PVT != VT && "Don't know what type to promote to!");
775
Evan Cheng95c57ea2010-04-24 04:43:44 +0000776 bool Replace0 = false;
777 SDValue N0 = Op.getOperand(0);
778 SDValue NN0 = PromoteOperand(N0, PVT, Replace0);
779 if (NN0.getNode() == 0)
Evan Cheng07c4e102010-04-22 20:19:46 +0000780 return SDValue();
781
Evan Cheng95c57ea2010-04-24 04:43:44 +0000782 bool Replace1 = false;
783 SDValue N1 = Op.getOperand(1);
Evan Chengaad753b2010-05-10 19:03:57 +0000784 SDValue NN1;
785 if (N0 == N1)
786 NN1 = NN0;
787 else {
788 NN1 = PromoteOperand(N1, PVT, Replace1);
789 if (NN1.getNode() == 0)
790 return SDValue();
791 }
Evan Cheng07c4e102010-04-22 20:19:46 +0000792
Evan Cheng95c57ea2010-04-24 04:43:44 +0000793 AddToWorkList(NN0.getNode());
Evan Chengaad753b2010-05-10 19:03:57 +0000794 if (NN1.getNode())
795 AddToWorkList(NN1.getNode());
Evan Cheng95c57ea2010-04-24 04:43:44 +0000796
797 if (Replace0)
798 ReplaceLoadWithPromotedLoad(N0.getNode(), NN0.getNode());
799 if (Replace1)
800 ReplaceLoadWithPromotedLoad(N1.getNode(), NN1.getNode());
Evan Cheng07c4e102010-04-22 20:19:46 +0000801
Evan Chengac7eae52010-04-27 19:48:13 +0000802 DEBUG(dbgs() << "\nPromoting ";
803 Op.getNode()->dump(&DAG));
Evan Cheng07c4e102010-04-22 20:19:46 +0000804 DebugLoc dl = Op.getDebugLoc();
805 return DAG.getNode(ISD::TRUNCATE, dl, VT,
Evan Cheng95c57ea2010-04-24 04:43:44 +0000806 DAG.getNode(Opc, dl, PVT, NN0, NN1));
Evan Cheng07c4e102010-04-22 20:19:46 +0000807 }
808 return SDValue();
809}
810
811/// PromoteIntShiftOp - Promote the specified integer shift operation if the
812/// target indicates it is beneficial. e.g. On x86, it's usually better to
813/// promote i16 operations to i32 since i16 instructions are longer.
814SDValue DAGCombiner::PromoteIntShiftOp(SDValue Op) {
815 if (!LegalOperations)
816 return SDValue();
817
818 EVT VT = Op.getValueType();
819 if (VT.isVector() || !VT.isInteger())
820 return SDValue();
821
822 // If operation type is 'undesirable', e.g. i16 on x86, consider
823 // promoting it.
824 unsigned Opc = Op.getOpcode();
825 if (TLI.isTypeDesirableForOp(Opc, VT))
826 return SDValue();
827
828 EVT PVT = VT;
829 // Consult target whether it is a good idea to promote this operation and
830 // what's the right type to promote it to.
831 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
832 assert(PVT != VT && "Don't know what type to promote to!");
833
Evan Cheng95c57ea2010-04-24 04:43:44 +0000834 bool Replace = false;
Evan Chenge5b51ac2010-04-17 06:13:15 +0000835 SDValue N0 = Op.getOperand(0);
836 if (Opc == ISD::SRA)
Evan Cheng95c57ea2010-04-24 04:43:44 +0000837 N0 = SExtPromoteOperand(Op.getOperand(0), PVT);
Evan Chenge5b51ac2010-04-17 06:13:15 +0000838 else if (Opc == ISD::SRL)
Evan Cheng95c57ea2010-04-24 04:43:44 +0000839 N0 = ZExtPromoteOperand(Op.getOperand(0), PVT);
Evan Chenge5b51ac2010-04-17 06:13:15 +0000840 else
Evan Cheng95c57ea2010-04-24 04:43:44 +0000841 N0 = PromoteOperand(N0, PVT, Replace);
Evan Chenge5b51ac2010-04-17 06:13:15 +0000842 if (N0.getNode() == 0)
843 return SDValue();
Evan Cheng95c57ea2010-04-24 04:43:44 +0000844
Evan Chenge5b51ac2010-04-17 06:13:15 +0000845 AddToWorkList(N0.getNode());
Evan Cheng95c57ea2010-04-24 04:43:44 +0000846 if (Replace)
847 ReplaceLoadWithPromotedLoad(Op.getOperand(0).getNode(), N0.getNode());
Evan Cheng64b7bf72010-04-16 06:14:10 +0000848
Evan Chengac7eae52010-04-27 19:48:13 +0000849 DEBUG(dbgs() << "\nPromoting ";
850 Op.getNode()->dump(&DAG));
Evan Cheng64b7bf72010-04-16 06:14:10 +0000851 DebugLoc dl = Op.getDebugLoc();
852 return DAG.getNode(ISD::TRUNCATE, dl, VT,
Evan Cheng07c4e102010-04-22 20:19:46 +0000853 DAG.getNode(Opc, dl, PVT, N0, Op.getOperand(1)));
Evan Cheng64b7bf72010-04-16 06:14:10 +0000854 }
855 return SDValue();
856}
857
Evan Cheng4c26e932010-04-19 19:29:22 +0000858SDValue DAGCombiner::PromoteExtend(SDValue Op) {
859 if (!LegalOperations)
860 return SDValue();
861
862 EVT VT = Op.getValueType();
863 if (VT.isVector() || !VT.isInteger())
864 return SDValue();
865
866 // If operation type is 'undesirable', e.g. i16 on x86, consider
867 // promoting it.
868 unsigned Opc = Op.getOpcode();
869 if (TLI.isTypeDesirableForOp(Opc, VT))
870 return SDValue();
871
872 EVT PVT = VT;
873 // Consult target whether it is a good idea to promote this operation and
874 // what's the right type to promote it to.
875 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
876 assert(PVT != VT && "Don't know what type to promote to!");
877 // fold (aext (aext x)) -> (aext x)
878 // fold (aext (zext x)) -> (zext x)
879 // fold (aext (sext x)) -> (sext x)
Evan Chengac7eae52010-04-27 19:48:13 +0000880 DEBUG(dbgs() << "\nPromoting ";
881 Op.getNode()->dump(&DAG));
Evan Cheng4c26e932010-04-19 19:29:22 +0000882 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), VT, Op.getOperand(0));
883 }
884 return SDValue();
885}
886
887bool DAGCombiner::PromoteLoad(SDValue Op) {
888 if (!LegalOperations)
889 return false;
890
891 EVT VT = Op.getValueType();
892 if (VT.isVector() || !VT.isInteger())
893 return false;
894
895 // If operation type is 'undesirable', e.g. i16 on x86, consider
896 // promoting it.
897 unsigned Opc = Op.getOpcode();
898 if (TLI.isTypeDesirableForOp(Opc, VT))
899 return false;
900
901 EVT PVT = VT;
902 // Consult target whether it is a good idea to promote this operation and
903 // what's the right type to promote it to.
904 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
905 assert(PVT != VT && "Don't know what type to promote to!");
906
907 DebugLoc dl = Op.getDebugLoc();
908 SDNode *N = Op.getNode();
909 LoadSDNode *LD = cast<LoadSDNode>(N);
Evan Chengac7eae52010-04-27 19:48:13 +0000910 EVT MemVT = LD->getMemoryVT();
911 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD)
Owen Anderson95771af2011-02-25 21:41:48 +0000912 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT) ? ISD::ZEXTLOAD
Eric Christopher503a64d2010-12-09 04:48:06 +0000913 : ISD::EXTLOAD)
Evan Chengac7eae52010-04-27 19:48:13 +0000914 : LD->getExtensionType();
Stuart Hastingsa9011292011-02-16 16:23:55 +0000915 SDValue NewLD = DAG.getExtLoad(ExtType, dl, PVT,
Evan Cheng4c26e932010-04-19 19:29:22 +0000916 LD->getChain(), LD->getBasePtr(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +0000917 LD->getPointerInfo(),
Evan Chengac7eae52010-04-27 19:48:13 +0000918 MemVT, LD->isVolatile(),
Evan Cheng4c26e932010-04-19 19:29:22 +0000919 LD->isNonTemporal(), LD->getAlignment());
920 SDValue Result = DAG.getNode(ISD::TRUNCATE, dl, VT, NewLD);
921
Evan Cheng95c57ea2010-04-24 04:43:44 +0000922 DEBUG(dbgs() << "\nPromoting ";
Evan Cheng4c26e932010-04-19 19:29:22 +0000923 N->dump(&DAG);
Evan Cheng95c57ea2010-04-24 04:43:44 +0000924 dbgs() << "\nTo: ";
Evan Cheng4c26e932010-04-19 19:29:22 +0000925 Result.getNode()->dump(&DAG);
926 dbgs() << '\n');
927 WorkListRemover DeadNodes(*this);
928 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result, &DeadNodes);
929 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), NewLD.getValue(1), &DeadNodes);
930 removeFromWorkList(N);
931 DAG.DeleteNode(N);
Evan Chengac7eae52010-04-27 19:48:13 +0000932 AddToWorkList(Result.getNode());
Evan Cheng4c26e932010-04-19 19:29:22 +0000933 return true;
934 }
935 return false;
936}
937
Evan Chenge5b51ac2010-04-17 06:13:15 +0000938
Chris Lattner29446522007-05-14 22:04:50 +0000939//===----------------------------------------------------------------------===//
940// Main DAG Combiner implementation
941//===----------------------------------------------------------------------===//
942
Duncan Sands25cf2272008-11-24 14:53:14 +0000943void DAGCombiner::Run(CombineLevel AtLevel) {
944 // set the instance variables, so that the various visit routines may use it.
945 Level = AtLevel;
946 LegalOperations = Level >= NoIllegalOperations;
947 LegalTypes = Level >= NoIllegalTypes;
Nate Begeman4ebd8052005-09-01 23:24:04 +0000948
Evan Cheng17a568b2008-08-29 22:21:44 +0000949 // Add all the dag nodes to the worklist.
950 WorkList.reserve(DAG.allnodes_size());
951 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
952 E = DAG.allnodes_end(); I != E; ++I)
953 WorkList.push_back(I);
Duncan Sands25cf2272008-11-24 14:53:14 +0000954
Evan Cheng17a568b2008-08-29 22:21:44 +0000955 // Create a dummy node (which is not added to allnodes), that adds a reference
956 // to the root node, preventing it from being deleted, and tracking any
957 // changes of the root.
958 HandleSDNode Dummy(DAG.getRoot());
Scott Michelfdc40a02009-02-17 22:15:04 +0000959
Jim Laskey26f7fa72006-10-17 19:33:52 +0000960 // The root of the dag may dangle to deleted nodes until the dag combiner is
961 // done. Set it to null to avoid confusion.
Dan Gohman475871a2008-07-27 21:46:04 +0000962 DAG.setRoot(SDValue());
Scott Michelfdc40a02009-02-17 22:15:04 +0000963
Evan Cheng17a568b2008-08-29 22:21:44 +0000964 // while the worklist isn't empty, inspect the node on the end of it and
965 // try and combine it.
966 while (!WorkList.empty()) {
967 SDNode *N = WorkList.back();
968 WorkList.pop_back();
Scott Michelfdc40a02009-02-17 22:15:04 +0000969
Evan Cheng17a568b2008-08-29 22:21:44 +0000970 // If N has no uses, it is dead. Make sure to revisit all N's operands once
971 // N is deleted from the DAG, since they too may now be dead or may have a
972 // reduced number of uses, allowing other xforms.
973 if (N->use_empty() && N != &Dummy) {
974 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
975 AddToWorkList(N->getOperand(i).getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +0000976
Evan Cheng17a568b2008-08-29 22:21:44 +0000977 DAG.DeleteNode(N);
978 continue;
Nate Begeman1d4d4142005-09-01 00:19:25 +0000979 }
Scott Michelfdc40a02009-02-17 22:15:04 +0000980
Evan Cheng17a568b2008-08-29 22:21:44 +0000981 SDValue RV = combine(N);
Scott Michelfdc40a02009-02-17 22:15:04 +0000982
Evan Cheng17a568b2008-08-29 22:21:44 +0000983 if (RV.getNode() == 0)
984 continue;
Scott Michelfdc40a02009-02-17 22:15:04 +0000985
Evan Cheng17a568b2008-08-29 22:21:44 +0000986 ++NodesCombined;
Scott Michelfdc40a02009-02-17 22:15:04 +0000987
Evan Cheng17a568b2008-08-29 22:21:44 +0000988 // If we get back the same node we passed in, rather than a new node or
989 // zero, we know that the node must have defined multiple values and
Scott Michelfdc40a02009-02-17 22:15:04 +0000990 // CombineTo was used. Since CombineTo takes care of the worklist
Evan Cheng17a568b2008-08-29 22:21:44 +0000991 // mechanics for us, we have no work to do in this case.
992 if (RV.getNode() == N)
993 continue;
Scott Michelfdc40a02009-02-17 22:15:04 +0000994
Evan Cheng17a568b2008-08-29 22:21:44 +0000995 assert(N->getOpcode() != ISD::DELETED_NODE &&
996 RV.getNode()->getOpcode() != ISD::DELETED_NODE &&
997 "Node was deleted but visit returned new node!");
Chris Lattner729c6d12006-05-27 00:43:02 +0000998
Wesley Peckbf17cfa2010-11-23 03:31:01 +0000999 DEBUG(dbgs() << "\nReplacing.3 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00001000 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00001001 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00001002 RV.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00001003 dbgs() << '\n');
Eric Christopher7332e6e2011-07-14 01:12:15 +00001004
Devang Patel9728ea22011-05-23 22:04:42 +00001005 // Transfer debug value.
1006 DAG.TransferDbgValues(SDValue(N, 0), RV);
Evan Cheng17a568b2008-08-29 22:21:44 +00001007 WorkListRemover DeadNodes(*this);
1008 if (N->getNumValues() == RV.getNode()->getNumValues())
1009 DAG.ReplaceAllUsesWith(N, RV.getNode(), &DeadNodes);
1010 else {
1011 assert(N->getValueType(0) == RV.getValueType() &&
1012 N->getNumValues() == 1 && "Type mismatch");
1013 SDValue OpV = RV;
1014 DAG.ReplaceAllUsesWith(N, &OpV, &DeadNodes);
1015 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001016
Evan Cheng17a568b2008-08-29 22:21:44 +00001017 // Push the new node and any users onto the worklist
1018 AddToWorkList(RV.getNode());
1019 AddUsersToWorkList(RV.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +00001020
Evan Cheng17a568b2008-08-29 22:21:44 +00001021 // Add any uses of the old node to the worklist in case this node is the
1022 // last one that uses them. They may become dead after this node is
1023 // deleted.
1024 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
1025 AddToWorkList(N->getOperand(i).getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +00001026
Dan Gohmandbe664a2009-01-19 21:44:21 +00001027 // Finally, if the node is now dead, remove it from the graph. The node
1028 // may not be dead if the replacement process recursively simplified to
1029 // something else needing this node.
1030 if (N->use_empty()) {
1031 // Nodes can be reintroduced into the worklist. Make sure we do not
1032 // process a node that has been replaced.
1033 removeFromWorkList(N);
Scott Michelfdc40a02009-02-17 22:15:04 +00001034
Dan Gohmandbe664a2009-01-19 21:44:21 +00001035 // Finally, since the node is now dead, remove it from the graph.
1036 DAG.DeleteNode(N);
1037 }
Evan Cheng17a568b2008-08-29 22:21:44 +00001038 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001039
Chris Lattner95038592005-10-05 06:35:28 +00001040 // If the root changed (e.g. it was a dead load, update the root).
1041 DAG.setRoot(Dummy.getValue());
Nate Begeman1d4d4142005-09-01 00:19:25 +00001042}
1043
Dan Gohman475871a2008-07-27 21:46:04 +00001044SDValue DAGCombiner::visit(SDNode *N) {
Evan Chengb3a3d5e2010-04-28 07:10:39 +00001045 switch (N->getOpcode()) {
Nate Begeman1d4d4142005-09-01 00:19:25 +00001046 default: break;
Nate Begeman4942a962005-09-01 00:33:32 +00001047 case ISD::TokenFactor: return visitTokenFactor(N);
Chris Lattnerfec42eb2008-02-13 07:25:05 +00001048 case ISD::MERGE_VALUES: return visitMERGE_VALUES(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001049 case ISD::ADD: return visitADD(N);
1050 case ISD::SUB: return visitSUB(N);
Chris Lattner91153682007-03-04 20:03:15 +00001051 case ISD::ADDC: return visitADDC(N);
1052 case ISD::ADDE: return visitADDE(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001053 case ISD::MUL: return visitMUL(N);
1054 case ISD::SDIV: return visitSDIV(N);
1055 case ISD::UDIV: return visitUDIV(N);
1056 case ISD::SREM: return visitSREM(N);
1057 case ISD::UREM: return visitUREM(N);
1058 case ISD::MULHU: return visitMULHU(N);
1059 case ISD::MULHS: return visitMULHS(N);
Dan Gohman389079b2007-10-08 17:57:15 +00001060 case ISD::SMUL_LOHI: return visitSMUL_LOHI(N);
1061 case ISD::UMUL_LOHI: return visitUMUL_LOHI(N);
Benjamin Kramerf55d26e2011-05-21 18:31:55 +00001062 case ISD::SMULO: return visitSMULO(N);
1063 case ISD::UMULO: return visitUMULO(N);
Dan Gohman389079b2007-10-08 17:57:15 +00001064 case ISD::SDIVREM: return visitSDIVREM(N);
1065 case ISD::UDIVREM: return visitUDIVREM(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001066 case ISD::AND: return visitAND(N);
1067 case ISD::OR: return visitOR(N);
1068 case ISD::XOR: return visitXOR(N);
1069 case ISD::SHL: return visitSHL(N);
1070 case ISD::SRA: return visitSRA(N);
1071 case ISD::SRL: return visitSRL(N);
1072 case ISD::CTLZ: return visitCTLZ(N);
1073 case ISD::CTTZ: return visitCTTZ(N);
1074 case ISD::CTPOP: return visitCTPOP(N);
Nate Begeman452d7beb2005-09-16 00:54:12 +00001075 case ISD::SELECT: return visitSELECT(N);
1076 case ISD::SELECT_CC: return visitSELECT_CC(N);
1077 case ISD::SETCC: return visitSETCC(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001078 case ISD::SIGN_EXTEND: return visitSIGN_EXTEND(N);
1079 case ISD::ZERO_EXTEND: return visitZERO_EXTEND(N);
Chris Lattner5ffc0662006-05-05 05:58:59 +00001080 case ISD::ANY_EXTEND: return visitANY_EXTEND(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001081 case ISD::SIGN_EXTEND_INREG: return visitSIGN_EXTEND_INREG(N);
1082 case ISD::TRUNCATE: return visitTRUNCATE(N);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00001083 case ISD::BITCAST: return visitBITCAST(N);
Evan Cheng9bfa03c2008-05-12 23:04:07 +00001084 case ISD::BUILD_PAIR: return visitBUILD_PAIR(N);
Chris Lattner01b3d732005-09-28 22:28:18 +00001085 case ISD::FADD: return visitFADD(N);
1086 case ISD::FSUB: return visitFSUB(N);
1087 case ISD::FMUL: return visitFMUL(N);
1088 case ISD::FDIV: return visitFDIV(N);
1089 case ISD::FREM: return visitFREM(N);
Chris Lattner12d83032006-03-05 05:30:57 +00001090 case ISD::FCOPYSIGN: return visitFCOPYSIGN(N);
Nate Begeman646d7e22005-09-02 21:18:40 +00001091 case ISD::SINT_TO_FP: return visitSINT_TO_FP(N);
1092 case ISD::UINT_TO_FP: return visitUINT_TO_FP(N);
1093 case ISD::FP_TO_SINT: return visitFP_TO_SINT(N);
1094 case ISD::FP_TO_UINT: return visitFP_TO_UINT(N);
1095 case ISD::FP_ROUND: return visitFP_ROUND(N);
1096 case ISD::FP_ROUND_INREG: return visitFP_ROUND_INREG(N);
1097 case ISD::FP_EXTEND: return visitFP_EXTEND(N);
1098 case ISD::FNEG: return visitFNEG(N);
1099 case ISD::FABS: return visitFABS(N);
Nate Begeman44728a72005-09-19 22:34:01 +00001100 case ISD::BRCOND: return visitBRCOND(N);
Nate Begeman44728a72005-09-19 22:34:01 +00001101 case ISD::BR_CC: return visitBR_CC(N);
Chris Lattner01a22022005-10-10 22:04:48 +00001102 case ISD::LOAD: return visitLOAD(N);
Chris Lattner87514ca2005-10-10 22:31:19 +00001103 case ISD::STORE: return visitSTORE(N);
Chris Lattnerca242442006-03-19 01:27:56 +00001104 case ISD::INSERT_VECTOR_ELT: return visitINSERT_VECTOR_ELT(N);
Evan Cheng513da432007-10-06 08:19:55 +00001105 case ISD::EXTRACT_VECTOR_ELT: return visitEXTRACT_VECTOR_ELT(N);
Dan Gohman7f321562007-06-25 16:23:39 +00001106 case ISD::BUILD_VECTOR: return visitBUILD_VECTOR(N);
1107 case ISD::CONCAT_VECTORS: return visitCONCAT_VECTORS(N);
Chris Lattner66445d32006-03-28 22:11:53 +00001108 case ISD::VECTOR_SHUFFLE: return visitVECTOR_SHUFFLE(N);
Jim Grosbach9a526492010-06-23 16:07:42 +00001109 case ISD::MEMBARRIER: return visitMEMBARRIER(N);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001110 }
Dan Gohman475871a2008-07-27 21:46:04 +00001111 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001112}
1113
Dan Gohman475871a2008-07-27 21:46:04 +00001114SDValue DAGCombiner::combine(SDNode *N) {
Dan Gohman475871a2008-07-27 21:46:04 +00001115 SDValue RV = visit(N);
Dan Gohman389079b2007-10-08 17:57:15 +00001116
1117 // If nothing happened, try a target-specific DAG combine.
Gabor Greifba36cb52008-08-28 21:40:38 +00001118 if (RV.getNode() == 0) {
Dan Gohman389079b2007-10-08 17:57:15 +00001119 assert(N->getOpcode() != ISD::DELETED_NODE &&
1120 "Node was deleted but visit returned NULL!");
1121
1122 if (N->getOpcode() >= ISD::BUILTIN_OP_END ||
1123 TLI.hasTargetDAGCombine((ISD::NodeType)N->getOpcode())) {
1124
1125 // Expose the DAG combiner to the target combiner impls.
Scott Michelfdc40a02009-02-17 22:15:04 +00001126 TargetLowering::DAGCombinerInfo
Jakob Stoklund Olesen78d12642009-07-24 18:22:59 +00001127 DagCombineInfo(DAG, !LegalTypes, !LegalOperations, false, this);
Dan Gohman389079b2007-10-08 17:57:15 +00001128
1129 RV = TLI.PerformDAGCombine(N, DagCombineInfo);
1130 }
1131 }
1132
Evan Chengb3a3d5e2010-04-28 07:10:39 +00001133 // If nothing happened still, try promoting the operation.
1134 if (RV.getNode() == 0) {
1135 switch (N->getOpcode()) {
1136 default: break;
1137 case ISD::ADD:
1138 case ISD::SUB:
1139 case ISD::MUL:
1140 case ISD::AND:
1141 case ISD::OR:
1142 case ISD::XOR:
1143 RV = PromoteIntBinOp(SDValue(N, 0));
1144 break;
1145 case ISD::SHL:
1146 case ISD::SRA:
1147 case ISD::SRL:
1148 RV = PromoteIntShiftOp(SDValue(N, 0));
1149 break;
1150 case ISD::SIGN_EXTEND:
1151 case ISD::ZERO_EXTEND:
1152 case ISD::ANY_EXTEND:
1153 RV = PromoteExtend(SDValue(N, 0));
1154 break;
1155 case ISD::LOAD:
1156 if (PromoteLoad(SDValue(N, 0)))
1157 RV = SDValue(N, 0);
1158 break;
1159 }
1160 }
1161
Scott Michelfdc40a02009-02-17 22:15:04 +00001162 // If N is a commutative binary node, try commuting it to enable more
Evan Cheng08b11732008-03-22 01:55:50 +00001163 // sdisel CSE.
Scott Michelfdc40a02009-02-17 22:15:04 +00001164 if (RV.getNode() == 0 &&
Evan Cheng08b11732008-03-22 01:55:50 +00001165 SelectionDAG::isCommutativeBinOp(N->getOpcode()) &&
1166 N->getNumValues() == 1) {
Dan Gohman475871a2008-07-27 21:46:04 +00001167 SDValue N0 = N->getOperand(0);
1168 SDValue N1 = N->getOperand(1);
Bill Wendling5c71acf2009-01-30 01:13:16 +00001169
Evan Cheng08b11732008-03-22 01:55:50 +00001170 // Constant operands are canonicalized to RHS.
1171 if (isa<ConstantSDNode>(N0) || !isa<ConstantSDNode>(N1)) {
Dan Gohman475871a2008-07-27 21:46:04 +00001172 SDValue Ops[] = { N1, N0 };
Evan Cheng08b11732008-03-22 01:55:50 +00001173 SDNode *CSENode = DAG.getNodeIfExists(N->getOpcode(), N->getVTList(),
1174 Ops, 2);
Evan Chengea100462008-03-24 23:55:16 +00001175 if (CSENode)
Dan Gohman475871a2008-07-27 21:46:04 +00001176 return SDValue(CSENode, 0);
Evan Cheng08b11732008-03-22 01:55:50 +00001177 }
1178 }
1179
Dan Gohman389079b2007-10-08 17:57:15 +00001180 return RV;
Scott Michelfdc40a02009-02-17 22:15:04 +00001181}
Dan Gohman389079b2007-10-08 17:57:15 +00001182
Chris Lattner6270f682006-10-08 22:57:01 +00001183/// getInputChainForNode - Given a node, return its input chain if it has one,
1184/// otherwise return a null sd operand.
Dan Gohman475871a2008-07-27 21:46:04 +00001185static SDValue getInputChainForNode(SDNode *N) {
Chris Lattner6270f682006-10-08 22:57:01 +00001186 if (unsigned NumOps = N->getNumOperands()) {
Owen Anderson825b72b2009-08-11 20:47:22 +00001187 if (N->getOperand(0).getValueType() == MVT::Other)
Chris Lattner6270f682006-10-08 22:57:01 +00001188 return N->getOperand(0);
Owen Anderson825b72b2009-08-11 20:47:22 +00001189 else if (N->getOperand(NumOps-1).getValueType() == MVT::Other)
Chris Lattner6270f682006-10-08 22:57:01 +00001190 return N->getOperand(NumOps-1);
1191 for (unsigned i = 1; i < NumOps-1; ++i)
Owen Anderson825b72b2009-08-11 20:47:22 +00001192 if (N->getOperand(i).getValueType() == MVT::Other)
Chris Lattner6270f682006-10-08 22:57:01 +00001193 return N->getOperand(i);
1194 }
Bill Wendling5c71acf2009-01-30 01:13:16 +00001195 return SDValue();
Chris Lattner6270f682006-10-08 22:57:01 +00001196}
1197
Dan Gohman475871a2008-07-27 21:46:04 +00001198SDValue DAGCombiner::visitTokenFactor(SDNode *N) {
Chris Lattner6270f682006-10-08 22:57:01 +00001199 // If N has two operands, where one has an input chain equal to the other,
1200 // the 'other' chain is redundant.
1201 if (N->getNumOperands() == 2) {
Gabor Greifba36cb52008-08-28 21:40:38 +00001202 if (getInputChainForNode(N->getOperand(0).getNode()) == N->getOperand(1))
Chris Lattner6270f682006-10-08 22:57:01 +00001203 return N->getOperand(0);
Gabor Greifba36cb52008-08-28 21:40:38 +00001204 if (getInputChainForNode(N->getOperand(1).getNode()) == N->getOperand(0))
Chris Lattner6270f682006-10-08 22:57:01 +00001205 return N->getOperand(1);
1206 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001207
Chris Lattnerc76d4412007-05-16 06:37:59 +00001208 SmallVector<SDNode *, 8> TFs; // List of token factors to visit.
Dan Gohman475871a2008-07-27 21:46:04 +00001209 SmallVector<SDValue, 8> Ops; // Ops for replacing token factor.
Scott Michelfdc40a02009-02-17 22:15:04 +00001210 SmallPtrSet<SDNode*, 16> SeenOps;
Chris Lattnerc76d4412007-05-16 06:37:59 +00001211 bool Changed = false; // If we should replace this token factor.
Scott Michelfdc40a02009-02-17 22:15:04 +00001212
Jim Laskey6ff23e52006-10-04 16:53:27 +00001213 // Start out with this token factor.
Jim Laskey279f0532006-09-25 16:29:54 +00001214 TFs.push_back(N);
Scott Michelfdc40a02009-02-17 22:15:04 +00001215
Jim Laskey71382342006-10-07 23:37:56 +00001216 // Iterate through token factors. The TFs grows when new token factors are
Jim Laskeybc588b82006-10-05 15:07:25 +00001217 // encountered.
1218 for (unsigned i = 0; i < TFs.size(); ++i) {
1219 SDNode *TF = TFs[i];
Scott Michelfdc40a02009-02-17 22:15:04 +00001220
Jim Laskey6ff23e52006-10-04 16:53:27 +00001221 // Check each of the operands.
1222 for (unsigned i = 0, ie = TF->getNumOperands(); i != ie; ++i) {
Dan Gohman475871a2008-07-27 21:46:04 +00001223 SDValue Op = TF->getOperand(i);
Scott Michelfdc40a02009-02-17 22:15:04 +00001224
Jim Laskey6ff23e52006-10-04 16:53:27 +00001225 switch (Op.getOpcode()) {
1226 case ISD::EntryToken:
Jim Laskeybc588b82006-10-05 15:07:25 +00001227 // Entry tokens don't need to be added to the list. They are
1228 // rededundant.
1229 Changed = true;
Jim Laskey6ff23e52006-10-04 16:53:27 +00001230 break;
Scott Michelfdc40a02009-02-17 22:15:04 +00001231
Jim Laskey6ff23e52006-10-04 16:53:27 +00001232 case ISD::TokenFactor:
Nate Begemanb6aef5c2009-09-15 00:18:30 +00001233 if (Op.hasOneUse() &&
Gabor Greifba36cb52008-08-28 21:40:38 +00001234 std::find(TFs.begin(), TFs.end(), Op.getNode()) == TFs.end()) {
Jim Laskey6ff23e52006-10-04 16:53:27 +00001235 // Queue up for processing.
Gabor Greifba36cb52008-08-28 21:40:38 +00001236 TFs.push_back(Op.getNode());
Jim Laskey6ff23e52006-10-04 16:53:27 +00001237 // Clean up in case the token factor is removed.
Gabor Greifba36cb52008-08-28 21:40:38 +00001238 AddToWorkList(Op.getNode());
Jim Laskey6ff23e52006-10-04 16:53:27 +00001239 Changed = true;
1240 break;
Jim Laskey279f0532006-09-25 16:29:54 +00001241 }
Jim Laskey6ff23e52006-10-04 16:53:27 +00001242 // Fall thru
Scott Michelfdc40a02009-02-17 22:15:04 +00001243
Jim Laskey6ff23e52006-10-04 16:53:27 +00001244 default:
Chris Lattnerc76d4412007-05-16 06:37:59 +00001245 // Only add if it isn't already in the list.
Gabor Greifba36cb52008-08-28 21:40:38 +00001246 if (SeenOps.insert(Op.getNode()))
Jim Laskeybc588b82006-10-05 15:07:25 +00001247 Ops.push_back(Op);
Chris Lattnerc76d4412007-05-16 06:37:59 +00001248 else
1249 Changed = true;
Jim Laskey6ff23e52006-10-04 16:53:27 +00001250 break;
Jim Laskey279f0532006-09-25 16:29:54 +00001251 }
1252 }
Jim Laskey6ff23e52006-10-04 16:53:27 +00001253 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00001254
Dan Gohman475871a2008-07-27 21:46:04 +00001255 SDValue Result;
Jim Laskey6ff23e52006-10-04 16:53:27 +00001256
1257 // If we've change things around then replace token factor.
1258 if (Changed) {
Dan Gohman30359592008-01-29 13:02:09 +00001259 if (Ops.empty()) {
Jim Laskey6ff23e52006-10-04 16:53:27 +00001260 // The entry token is the only possible outcome.
1261 Result = DAG.getEntryNode();
1262 } else {
1263 // New and improved token factor.
Bill Wendling5c71acf2009-01-30 01:13:16 +00001264 Result = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(),
Owen Anderson825b72b2009-08-11 20:47:22 +00001265 MVT::Other, &Ops[0], Ops.size());
Nate Begemanded49632005-10-13 03:11:28 +00001266 }
Bill Wendling5c71acf2009-01-30 01:13:16 +00001267
Jim Laskey274062c2006-10-13 23:32:28 +00001268 // Don't add users to work list.
1269 return CombineTo(N, Result, false);
Nate Begemanded49632005-10-13 03:11:28 +00001270 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001271
Jim Laskey6ff23e52006-10-04 16:53:27 +00001272 return Result;
Nate Begeman1d4d4142005-09-01 00:19:25 +00001273}
1274
Chris Lattnerfec42eb2008-02-13 07:25:05 +00001275/// MERGE_VALUES can always be eliminated.
Dan Gohman475871a2008-07-27 21:46:04 +00001276SDValue DAGCombiner::visitMERGE_VALUES(SDNode *N) {
Chris Lattnerfec42eb2008-02-13 07:25:05 +00001277 WorkListRemover DeadNodes(*this);
Dan Gohman00edf392009-08-10 23:43:19 +00001278 // Replacing results may cause a different MERGE_VALUES to suddenly
1279 // be CSE'd with N, and carry its uses with it. Iterate until no
1280 // uses remain, to ensure that the node can be safely deleted.
1281 do {
1282 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
1283 DAG.ReplaceAllUsesOfValueWith(SDValue(N, i), N->getOperand(i),
1284 &DeadNodes);
1285 } while (!N->use_empty());
Chris Lattnerfec42eb2008-02-13 07:25:05 +00001286 removeFromWorkList(N);
1287 DAG.DeleteNode(N);
Dan Gohman475871a2008-07-27 21:46:04 +00001288 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Chris Lattnerfec42eb2008-02-13 07:25:05 +00001289}
1290
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001291static
Bill Wendlingd69c3142009-01-30 02:23:43 +00001292SDValue combineShlAddConstant(DebugLoc DL, SDValue N0, SDValue N1,
1293 SelectionDAG &DAG) {
Owen Andersone50ed302009-08-10 22:56:29 +00001294 EVT VT = N0.getValueType();
Dan Gohman475871a2008-07-27 21:46:04 +00001295 SDValue N00 = N0.getOperand(0);
1296 SDValue N01 = N0.getOperand(1);
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001297 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N01);
Bill Wendlingd69c3142009-01-30 02:23:43 +00001298
Gabor Greifba36cb52008-08-28 21:40:38 +00001299 if (N01C && N00.getOpcode() == ISD::ADD && N00.getNode()->hasOneUse() &&
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001300 isa<ConstantSDNode>(N00.getOperand(1))) {
Bill Wendlingd69c3142009-01-30 02:23:43 +00001301 // fold (add (shl (add x, c1), c2), ) -> (add (add (shl x, c2), c1<<c2), )
1302 N0 = DAG.getNode(ISD::ADD, N0.getDebugLoc(), VT,
1303 DAG.getNode(ISD::SHL, N00.getDebugLoc(), VT,
1304 N00.getOperand(0), N01),
1305 DAG.getNode(ISD::SHL, N01.getDebugLoc(), VT,
1306 N00.getOperand(1), N01));
1307 return DAG.getNode(ISD::ADD, DL, VT, N0, N1);
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001308 }
Bill Wendlingd69c3142009-01-30 02:23:43 +00001309
Dan Gohman475871a2008-07-27 21:46:04 +00001310 return SDValue();
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001311}
1312
Dan Gohman475871a2008-07-27 21:46:04 +00001313SDValue DAGCombiner::visitADD(SDNode *N) {
1314 SDValue N0 = N->getOperand(0);
1315 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00001316 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1317 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001318 EVT VT = N0.getValueType();
Dan Gohman7f321562007-06-25 16:23:39 +00001319
1320 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00001321 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001322 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001323 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00001324 }
Bill Wendling2476e5d2008-12-10 22:36:00 +00001325
Dan Gohman613e0d82007-07-03 14:03:57 +00001326 // fold (add x, undef) -> undef
Dan Gohman70fb1ae2007-07-10 15:19:29 +00001327 if (N0.getOpcode() == ISD::UNDEF)
1328 return N0;
1329 if (N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00001330 return N1;
Nate Begeman1d4d4142005-09-01 00:19:25 +00001331 // fold (add c1, c2) -> c1+c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001332 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001333 return DAG.FoldConstantArithmetic(ISD::ADD, VT, N0C, N1C);
Nate Begeman99801192005-09-07 23:25:52 +00001334 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00001335 if (N0C && !N1C)
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001336 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001337 // fold (add x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00001338 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00001339 return N0;
Dan Gohman6520e202008-10-18 02:06:02 +00001340 // fold (add Sym, c) -> Sym+c
1341 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(N0))
Duncan Sands25cf2272008-11-24 14:53:14 +00001342 if (!LegalOperations && TLI.isOffsetFoldingLegal(GA) && N1C &&
Dan Gohman6520e202008-10-18 02:06:02 +00001343 GA->getOpcode() == ISD::GlobalAddress)
Devang Patel0d881da2010-07-06 22:08:15 +00001344 return DAG.getGlobalAddress(GA->getGlobal(), N1C->getDebugLoc(), VT,
Dan Gohman6520e202008-10-18 02:06:02 +00001345 GA->getOffset() +
1346 (uint64_t)N1C->getSExtValue());
Chris Lattner4aafb4f2006-01-12 20:22:43 +00001347 // fold ((c1-A)+c2) -> (c1+c2)-A
1348 if (N1C && N0.getOpcode() == ISD::SUB)
1349 if (ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getOperand(0)))
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001350 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
Dan Gohman002e5d02008-03-13 22:13:53 +00001351 DAG.getConstant(N1C->getAPIntValue()+
1352 N0C->getAPIntValue(), VT),
Chris Lattner4aafb4f2006-01-12 20:22:43 +00001353 N0.getOperand(1));
Nate Begemancd4d58c2006-02-03 06:46:56 +00001354 // reassociate add
Bill Wendling35247c32009-01-30 00:45:56 +00001355 SDValue RADD = ReassociateOps(ISD::ADD, N->getDebugLoc(), N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001356 if (RADD.getNode() != 0)
Nate Begemancd4d58c2006-02-03 06:46:56 +00001357 return RADD;
Nate Begeman1d4d4142005-09-01 00:19:25 +00001358 // fold ((0-A) + B) -> B-A
1359 if (N0.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N0.getOperand(0)) &&
1360 cast<ConstantSDNode>(N0.getOperand(0))->isNullValue())
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001361 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1, N0.getOperand(1));
Nate Begeman1d4d4142005-09-01 00:19:25 +00001362 // fold (A + (0-B)) -> A-B
1363 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) &&
1364 cast<ConstantSDNode>(N1.getOperand(0))->isNullValue())
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001365 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, N1.getOperand(1));
Chris Lattner01b3d732005-09-28 22:28:18 +00001366 // fold (A+(B-A)) -> B
1367 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(1))
Nate Begeman83e75ec2005-09-06 04:43:02 +00001368 return N1.getOperand(0);
Dale Johannesen56eca912008-11-27 00:43:21 +00001369 // fold ((B-A)+A) -> B
1370 if (N0.getOpcode() == ISD::SUB && N1 == N0.getOperand(1))
1371 return N0.getOperand(0);
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001372 // fold (A+(B-(A+C))) to (B-C)
1373 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD &&
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001374 N0 == N1.getOperand(1).getOperand(0))
1375 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1.getOperand(0),
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001376 N1.getOperand(1).getOperand(1));
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001377 // fold (A+(B-(C+A))) to (B-C)
1378 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD &&
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001379 N0 == N1.getOperand(1).getOperand(1))
1380 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1.getOperand(0),
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001381 N1.getOperand(1).getOperand(0));
Dale Johannesen7c7bc722008-12-23 23:47:22 +00001382 // fold (A+((B-A)+or-C)) to (B+or-C)
Dale Johannesen34d79852008-12-02 18:40:40 +00001383 if ((N1.getOpcode() == ISD::SUB || N1.getOpcode() == ISD::ADD) &&
1384 N1.getOperand(0).getOpcode() == ISD::SUB &&
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001385 N0 == N1.getOperand(0).getOperand(1))
1386 return DAG.getNode(N1.getOpcode(), N->getDebugLoc(), VT,
1387 N1.getOperand(0).getOperand(0), N1.getOperand(1));
Dale Johannesen34d79852008-12-02 18:40:40 +00001388
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001389 // fold (A-B)+(C-D) to (A+C)-(B+D) when A or C is constant
1390 if (N0.getOpcode() == ISD::SUB && N1.getOpcode() == ISD::SUB) {
1391 SDValue N00 = N0.getOperand(0);
1392 SDValue N01 = N0.getOperand(1);
1393 SDValue N10 = N1.getOperand(0);
1394 SDValue N11 = N1.getOperand(1);
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001395
1396 if (isa<ConstantSDNode>(N00) || isa<ConstantSDNode>(N10))
1397 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1398 DAG.getNode(ISD::ADD, N0.getDebugLoc(), VT, N00, N10),
1399 DAG.getNode(ISD::ADD, N1.getDebugLoc(), VT, N01, N11));
Dale Johannesen221cd2f2008-12-02 01:30:54 +00001400 }
Chris Lattner947c2892006-03-13 06:51:27 +00001401
Dan Gohman475871a2008-07-27 21:46:04 +00001402 if (!VT.isVector() && SimplifyDemandedBits(SDValue(N, 0)))
1403 return SDValue(N, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001404
Chris Lattner947c2892006-03-13 06:51:27 +00001405 // fold (a+b) -> (a|b) iff a and b share no bits.
Duncan Sands83ec4b62008-06-06 12:08:01 +00001406 if (VT.isInteger() && !VT.isVector()) {
Dan Gohman948d8ea2008-02-20 16:33:30 +00001407 APInt LHSZero, LHSOne;
1408 APInt RHSZero, RHSOne;
Dan Gohman5b870af2010-03-02 02:14:38 +00001409 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits());
Dan Gohmanea859be2007-06-22 14:59:07 +00001410 DAG.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne);
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001411
Dan Gohman948d8ea2008-02-20 16:33:30 +00001412 if (LHSZero.getBoolValue()) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001413 DAG.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne);
Scott Michelfdc40a02009-02-17 22:15:04 +00001414
Chris Lattner947c2892006-03-13 06:51:27 +00001415 // If all possibly-set bits on the LHS are clear on the RHS, return an OR.
1416 // If all possibly-set bits on the RHS are clear on the LHS, return an OR.
1417 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) ||
1418 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask))
Bill Wendlingf4eb2262009-01-30 02:31:17 +00001419 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N1);
Chris Lattner947c2892006-03-13 06:51:27 +00001420 }
1421 }
Evan Cheng3ef554d2006-11-06 08:14:30 +00001422
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001423 // fold (add (shl (add x, c1), c2), ) -> (add (add (shl x, c2), c1<<c2), )
Gabor Greifba36cb52008-08-28 21:40:38 +00001424 if (N0.getOpcode() == ISD::SHL && N0.getNode()->hasOneUse()) {
Bill Wendlingd69c3142009-01-30 02:23:43 +00001425 SDValue Result = combineShlAddConstant(N->getDebugLoc(), N0, N1, DAG);
Gabor Greifba36cb52008-08-28 21:40:38 +00001426 if (Result.getNode()) return Result;
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001427 }
Gabor Greifba36cb52008-08-28 21:40:38 +00001428 if (N1.getOpcode() == ISD::SHL && N1.getNode()->hasOneUse()) {
Bill Wendlingd69c3142009-01-30 02:23:43 +00001429 SDValue Result = combineShlAddConstant(N->getDebugLoc(), N1, N0, DAG);
Gabor Greifba36cb52008-08-28 21:40:38 +00001430 if (Result.getNode()) return Result;
Evan Cheng42d7ccf2007-01-19 17:51:44 +00001431 }
1432
Dan Gohmancd9e1552010-01-19 23:30:49 +00001433 // fold (add x, shl(0 - y, n)) -> sub(x, shl(y, n))
1434 if (N1.getOpcode() == ISD::SHL &&
1435 N1.getOperand(0).getOpcode() == ISD::SUB)
1436 if (ConstantSDNode *C =
1437 dyn_cast<ConstantSDNode>(N1.getOperand(0).getOperand(0)))
1438 if (C->getAPIntValue() == 0)
1439 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0,
1440 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT,
1441 N1.getOperand(0).getOperand(1),
1442 N1.getOperand(1)));
1443 if (N0.getOpcode() == ISD::SHL &&
1444 N0.getOperand(0).getOpcode() == ISD::SUB)
1445 if (ConstantSDNode *C =
1446 dyn_cast<ConstantSDNode>(N0.getOperand(0).getOperand(0)))
1447 if (C->getAPIntValue() == 0)
1448 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1,
1449 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT,
1450 N0.getOperand(0).getOperand(1),
1451 N0.getOperand(1)));
1452
Owen Andersonbc146b02010-09-21 20:42:50 +00001453 if (N1.getOpcode() == ISD::AND) {
1454 SDValue AndOp0 = N1.getOperand(0);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00001455 ConstantSDNode *AndOp1 = dyn_cast<ConstantSDNode>(N1->getOperand(1));
Owen Andersonbc146b02010-09-21 20:42:50 +00001456 unsigned NumSignBits = DAG.ComputeNumSignBits(AndOp0);
1457 unsigned DestBits = VT.getScalarType().getSizeInBits();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00001458
Owen Andersonbc146b02010-09-21 20:42:50 +00001459 // (add z, (and (sbbl x, x), 1)) -> (sub z, (sbbl x, x))
1460 // and similar xforms where the inner op is either ~0 or 0.
1461 if (NumSignBits == DestBits && AndOp1 && AndOp1->isOne()) {
1462 DebugLoc DL = N->getDebugLoc();
1463 return DAG.getNode(ISD::SUB, DL, VT, N->getOperand(0), AndOp0);
1464 }
1465 }
1466
Benjamin Kramerf50125e2010-12-22 23:17:45 +00001467 // add (sext i1), X -> sub X, (zext i1)
1468 if (N0.getOpcode() == ISD::SIGN_EXTEND &&
1469 N0.getOperand(0).getValueType() == MVT::i1 &&
1470 !TLI.isOperationLegal(ISD::SIGN_EXTEND, MVT::i1)) {
1471 DebugLoc DL = N->getDebugLoc();
1472 SDValue ZExt = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, N0.getOperand(0));
1473 return DAG.getNode(ISD::SUB, DL, VT, N1, ZExt);
1474 }
1475
Evan Chengb3a3d5e2010-04-28 07:10:39 +00001476 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001477}
1478
Dan Gohman475871a2008-07-27 21:46:04 +00001479SDValue DAGCombiner::visitADDC(SDNode *N) {
1480 SDValue N0 = N->getOperand(0);
1481 SDValue N1 = N->getOperand(1);
Chris Lattner91153682007-03-04 20:03:15 +00001482 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1483 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001484 EVT VT = N0.getValueType();
Scott Michelfdc40a02009-02-17 22:15:04 +00001485
Chris Lattner91153682007-03-04 20:03:15 +00001486 // If the flag result is dead, turn this into an ADD.
1487 if (N->hasNUsesOfValue(0, 1))
Bill Wendling14036c02009-01-30 02:38:00 +00001488 return CombineTo(N, DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1, N0),
Dale Johannesen874ae252009-06-02 03:12:52 +00001489 DAG.getNode(ISD::CARRY_FALSE,
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001490 N->getDebugLoc(), MVT::Glue));
Scott Michelfdc40a02009-02-17 22:15:04 +00001491
Chris Lattner91153682007-03-04 20:03:15 +00001492 // canonicalize constant to RHS.
Dan Gohman0a4627d2008-06-23 15:29:14 +00001493 if (N0C && !N1C)
Bill Wendling14036c02009-01-30 02:38:00 +00001494 return DAG.getNode(ISD::ADDC, N->getDebugLoc(), N->getVTList(), N1, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001495
Chris Lattnerb6541762007-03-04 20:40:38 +00001496 // fold (addc x, 0) -> x + no carry out
1497 if (N1C && N1C->isNullValue())
Dale Johannesen874ae252009-06-02 03:12:52 +00001498 return CombineTo(N, N0, DAG.getNode(ISD::CARRY_FALSE,
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001499 N->getDebugLoc(), MVT::Glue));
Scott Michelfdc40a02009-02-17 22:15:04 +00001500
Dale Johannesen874ae252009-06-02 03:12:52 +00001501 // fold (addc a, b) -> (or a, b), CARRY_FALSE iff a and b share no bits.
Dan Gohman948d8ea2008-02-20 16:33:30 +00001502 APInt LHSZero, LHSOne;
1503 APInt RHSZero, RHSOne;
Dan Gohman5b870af2010-03-02 02:14:38 +00001504 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits());
Dan Gohmanea859be2007-06-22 14:59:07 +00001505 DAG.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne);
Bill Wendling14036c02009-01-30 02:38:00 +00001506
Dan Gohman948d8ea2008-02-20 16:33:30 +00001507 if (LHSZero.getBoolValue()) {
Dan Gohmanea859be2007-06-22 14:59:07 +00001508 DAG.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne);
Scott Michelfdc40a02009-02-17 22:15:04 +00001509
Chris Lattnerb6541762007-03-04 20:40:38 +00001510 // If all possibly-set bits on the LHS are clear on the RHS, return an OR.
1511 // If all possibly-set bits on the RHS are clear on the LHS, return an OR.
1512 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) ||
1513 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask))
Bill Wendling14036c02009-01-30 02:38:00 +00001514 return CombineTo(N, DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N1),
Dale Johannesen874ae252009-06-02 03:12:52 +00001515 DAG.getNode(ISD::CARRY_FALSE,
Chris Lattnerf1b4eaf2010-12-21 02:38:05 +00001516 N->getDebugLoc(), MVT::Glue));
Chris Lattnerb6541762007-03-04 20:40:38 +00001517 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001518
Dan Gohman475871a2008-07-27 21:46:04 +00001519 return SDValue();
Chris Lattner91153682007-03-04 20:03:15 +00001520}
1521
Dan Gohman475871a2008-07-27 21:46:04 +00001522SDValue DAGCombiner::visitADDE(SDNode *N) {
1523 SDValue N0 = N->getOperand(0);
1524 SDValue N1 = N->getOperand(1);
1525 SDValue CarryIn = N->getOperand(2);
Chris Lattner91153682007-03-04 20:03:15 +00001526 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1527 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00001528
Benjamin Kramer74666782011-02-26 22:48:07 +00001529 // If both operands are null we know that carry out will always be false.
1530 if (N0C && N0C->isNullValue() && N0 == N1)
1531 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), DAG.getNode(ISD::CARRY_FALSE,
1532 N->getDebugLoc(),
1533 MVT::Glue));
1534
Chris Lattner91153682007-03-04 20:03:15 +00001535 // canonicalize constant to RHS
Dan Gohman0a4627d2008-06-23 15:29:14 +00001536 if (N0C && !N1C)
Bill Wendling14036c02009-01-30 02:38:00 +00001537 return DAG.getNode(ISD::ADDE, N->getDebugLoc(), N->getVTList(),
1538 N1, N0, CarryIn);
Scott Michelfdc40a02009-02-17 22:15:04 +00001539
Chris Lattnerb6541762007-03-04 20:40:38 +00001540 // fold (adde x, y, false) -> (addc x, y)
Dale Johannesen874ae252009-06-02 03:12:52 +00001541 if (CarryIn.getOpcode() == ISD::CARRY_FALSE)
1542 return DAG.getNode(ISD::ADDC, N->getDebugLoc(), N->getVTList(), N1, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001543
Dan Gohman475871a2008-07-27 21:46:04 +00001544 return SDValue();
Chris Lattner91153682007-03-04 20:03:15 +00001545}
1546
Eric Christopher7bccf6a2011-02-16 04:50:12 +00001547// Since it may not be valid to emit a fold to zero for vector initializers
1548// check if we can before folding.
1549static SDValue tryFoldToZero(DebugLoc DL, const TargetLowering &TLI, EVT VT,
Owen Anderson95771af2011-02-25 21:41:48 +00001550 SelectionDAG &DAG, bool LegalOperations) {
Eric Christopher7bccf6a2011-02-16 04:50:12 +00001551 if (!VT.isVector()) {
1552 return DAG.getConstant(0, VT);
Dan Gohman71dc7c92011-05-17 22:20:36 +00001553 }
1554 if (!LegalOperations || TLI.isOperationLegal(ISD::BUILD_VECTOR, VT)) {
Eric Christopher7bccf6a2011-02-16 04:50:12 +00001555 // Produce a vector of zeros.
1556 SDValue El = DAG.getConstant(0, VT.getVectorElementType());
1557 std::vector<SDValue> Ops(VT.getVectorNumElements(), El);
1558 return DAG.getNode(ISD::BUILD_VECTOR, DL, VT,
1559 &Ops[0], Ops.size());
1560 }
1561 return SDValue();
1562}
1563
Dan Gohman475871a2008-07-27 21:46:04 +00001564SDValue DAGCombiner::visitSUB(SDNode *N) {
1565 SDValue N0 = N->getOperand(0);
1566 SDValue N1 = N->getOperand(1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001567 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode());
1568 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
Eric Christopher7332e6e2011-07-14 01:12:15 +00001569 ConstantSDNode *N1C1 = N1.getOpcode() != ISD::ADD ? 0 :
1570 dyn_cast<ConstantSDNode>(N1.getOperand(1).getNode());
Owen Andersone50ed302009-08-10 22:56:29 +00001571 EVT VT = N0.getValueType();
Scott Michelfdc40a02009-02-17 22:15:04 +00001572
Dan Gohman7f321562007-06-25 16:23:39 +00001573 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00001574 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001575 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001576 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00001577 }
Bill Wendling2476e5d2008-12-10 22:36:00 +00001578
Chris Lattner854077d2005-10-17 01:07:11 +00001579 // fold (sub x, x) -> 0
Eric Christopher169e1552011-02-16 01:10:03 +00001580 // FIXME: Refactor this and xor and other similar operations together.
Eric Christopher7bccf6a2011-02-16 04:50:12 +00001581 if (N0 == N1)
1582 return tryFoldToZero(N->getDebugLoc(), TLI, VT, DAG, LegalOperations);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001583 // fold (sub c1, c2) -> c1-c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001584 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001585 return DAG.FoldConstantArithmetic(ISD::SUB, VT, N0C, N1C);
Chris Lattner05b57432005-10-11 06:07:15 +00001586 // fold (sub x, c) -> (add x, -c)
1587 if (N1C)
Bill Wendlingb0702e02009-01-30 02:42:10 +00001588 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N0,
Dan Gohman002e5d02008-03-13 22:13:53 +00001589 DAG.getConstant(-N1C->getAPIntValue(), VT));
Evan Cheng1ad0e8b2010-01-18 21:38:44 +00001590 // Canonicalize (sub -1, x) -> ~x, i.e. (xor x, -1)
1591 if (N0C && N0C->isAllOnesValue())
1592 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N1, N0);
Benjamin Kramer2c94b422011-01-29 12:34:05 +00001593 // fold A-(A-B) -> B
1594 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(0))
1595 return N1.getOperand(1);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001596 // fold (A+B)-A -> B
Chris Lattner01b3d732005-09-28 22:28:18 +00001597 if (N0.getOpcode() == ISD::ADD && N0.getOperand(0) == N1)
Nate Begeman83e75ec2005-09-06 04:43:02 +00001598 return N0.getOperand(1);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001599 // fold (A+B)-B -> A
Chris Lattner01b3d732005-09-28 22:28:18 +00001600 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1) == N1)
Scott Michelfdc40a02009-02-17 22:15:04 +00001601 return N0.getOperand(0);
Eric Christopher7332e6e2011-07-14 01:12:15 +00001602 // fold C2-(A+C1) -> (C2-C1)-A
1603 if (N1.getOpcode() == ISD::ADD && N0C && N1C1) {
1604 SDValue NewC = DAG.getConstant((N0C->getAPIntValue() - N1C1->getAPIntValue()), VT);
1605 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, NewC,
1606 N1.getOperand(0));
1607 }
Dale Johannesen7c7bc722008-12-23 23:47:22 +00001608 // fold ((A+(B+or-C))-B) -> A+or-C
Dale Johannesenfd3b7b72008-12-16 22:13:49 +00001609 if (N0.getOpcode() == ISD::ADD &&
Dale Johannesenf9cbc1f2008-12-23 23:01:27 +00001610 (N0.getOperand(1).getOpcode() == ISD::SUB ||
1611 N0.getOperand(1).getOpcode() == ISD::ADD) &&
Dale Johannesenfd3b7b72008-12-16 22:13:49 +00001612 N0.getOperand(1).getOperand(0) == N1)
Bill Wendlingb0702e02009-01-30 02:42:10 +00001613 return DAG.getNode(N0.getOperand(1).getOpcode(), N->getDebugLoc(), VT,
1614 N0.getOperand(0), N0.getOperand(1).getOperand(1));
Dale Johannesenf9cbc1f2008-12-23 23:01:27 +00001615 // fold ((A+(C+B))-B) -> A+C
1616 if (N0.getOpcode() == ISD::ADD &&
1617 N0.getOperand(1).getOpcode() == ISD::ADD &&
1618 N0.getOperand(1).getOperand(1) == N1)
Bill Wendlingb0702e02009-01-30 02:42:10 +00001619 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT,
1620 N0.getOperand(0), N0.getOperand(1).getOperand(0));
Dale Johannesen58e39b02008-12-23 01:59:54 +00001621 // fold ((A-(B-C))-C) -> A-B
1622 if (N0.getOpcode() == ISD::SUB &&
1623 N0.getOperand(1).getOpcode() == ISD::SUB &&
1624 N0.getOperand(1).getOperand(1) == N1)
Bill Wendlingb0702e02009-01-30 02:42:10 +00001625 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1626 N0.getOperand(0), N0.getOperand(1).getOperand(0));
Bill Wendlingb0702e02009-01-30 02:42:10 +00001627
Dan Gohman613e0d82007-07-03 14:03:57 +00001628 // If either operand of a sub is undef, the result is undef
Dan Gohman70fb1ae2007-07-10 15:19:29 +00001629 if (N0.getOpcode() == ISD::UNDEF)
1630 return N0;
1631 if (N1.getOpcode() == ISD::UNDEF)
1632 return N1;
Dan Gohman7f321562007-06-25 16:23:39 +00001633
Dan Gohman6520e202008-10-18 02:06:02 +00001634 // If the relocation model supports it, consider symbol offsets.
1635 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(N0))
Duncan Sands25cf2272008-11-24 14:53:14 +00001636 if (!LegalOperations && TLI.isOffsetFoldingLegal(GA)) {
Dan Gohman6520e202008-10-18 02:06:02 +00001637 // fold (sub Sym, c) -> Sym-c
1638 if (N1C && GA->getOpcode() == ISD::GlobalAddress)
Devang Patel0d881da2010-07-06 22:08:15 +00001639 return DAG.getGlobalAddress(GA->getGlobal(), N1C->getDebugLoc(), VT,
Dan Gohman6520e202008-10-18 02:06:02 +00001640 GA->getOffset() -
1641 (uint64_t)N1C->getSExtValue());
1642 // fold (sub Sym+c1, Sym+c2) -> c1-c2
1643 if (GlobalAddressSDNode *GB = dyn_cast<GlobalAddressSDNode>(N1))
1644 if (GA->getGlobal() == GB->getGlobal())
1645 return DAG.getConstant((uint64_t)GA->getOffset() - GB->getOffset(),
1646 VT);
1647 }
1648
Evan Chengb3a3d5e2010-04-28 07:10:39 +00001649 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001650}
1651
Dan Gohman475871a2008-07-27 21:46:04 +00001652SDValue DAGCombiner::visitMUL(SDNode *N) {
1653 SDValue N0 = N->getOperand(0);
1654 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00001655 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1656 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001657 EVT VT = N0.getValueType();
Scott Michelfdc40a02009-02-17 22:15:04 +00001658
Dan Gohman7f321562007-06-25 16:23:39 +00001659 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00001660 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001661 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001662 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00001663 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001664
Dan Gohman613e0d82007-07-03 14:03:57 +00001665 // fold (mul x, undef) -> 0
Dan Gohmand595b5f2007-07-10 14:20:37 +00001666 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00001667 return DAG.getConstant(0, VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001668 // fold (mul c1, c2) -> c1*c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001669 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001670 return DAG.FoldConstantArithmetic(ISD::MUL, VT, N0C, N1C);
Nate Begeman99801192005-09-07 23:25:52 +00001671 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00001672 if (N0C && !N1C)
Bill Wendling9c8148a2009-01-30 02:45:56 +00001673 return DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, N1, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001674 // fold (mul x, 0) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00001675 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00001676 return N1;
Nate Begeman1d4d4142005-09-01 00:19:25 +00001677 // fold (mul x, -1) -> 0-x
Nate Begeman646d7e22005-09-02 21:18:40 +00001678 if (N1C && N1C->isAllOnesValue())
Bill Wendling9c8148a2009-01-30 02:45:56 +00001679 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1680 DAG.getConstant(0, VT), N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001681 // fold (mul x, (1 << c)) -> x << c
Dan Gohman002e5d02008-03-13 22:13:53 +00001682 if (N1C && N1C->getAPIntValue().isPowerOf2())
Bill Wendling9c8148a2009-01-30 02:45:56 +00001683 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0,
Dan Gohman002e5d02008-03-13 22:13:53 +00001684 DAG.getConstant(N1C->getAPIntValue().logBase2(),
Owen Anderson95771af2011-02-25 21:41:48 +00001685 getShiftAmountTy(N0.getValueType())));
Chris Lattner3e6099b2005-10-30 06:41:49 +00001686 // fold (mul x, -(1 << c)) -> -(x << c) or (-x) << c
Chris Lattner66b8bc32009-03-09 20:22:18 +00001687 if (N1C && (-N1C->getAPIntValue()).isPowerOf2()) {
1688 unsigned Log2Val = (-N1C->getAPIntValue()).logBase2();
Scott Michelfdc40a02009-02-17 22:15:04 +00001689 // FIXME: If the input is something that is easily negated (e.g. a
Chris Lattner3e6099b2005-10-30 06:41:49 +00001690 // single-use add), we should put the negate there.
Bill Wendling9c8148a2009-01-30 02:45:56 +00001691 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1692 DAG.getConstant(0, VT),
Bill Wendling73e16b22009-01-30 02:49:26 +00001693 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0,
Owen Anderson95771af2011-02-25 21:41:48 +00001694 DAG.getConstant(Log2Val,
1695 getShiftAmountTy(N0.getValueType()))));
Chris Lattner66b8bc32009-03-09 20:22:18 +00001696 }
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001697 // (mul (shl X, c1), c2) -> (mul X, c2 << c1)
Bill Wendling73e16b22009-01-30 02:49:26 +00001698 if (N1C && N0.getOpcode() == ISD::SHL &&
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001699 isa<ConstantSDNode>(N0.getOperand(1))) {
Bill Wendling9c8148a2009-01-30 02:45:56 +00001700 SDValue C3 = DAG.getNode(ISD::SHL, N->getDebugLoc(), VT,
1701 N1, N0.getOperand(1));
Gabor Greifba36cb52008-08-28 21:40:38 +00001702 AddToWorkList(C3.getNode());
Bill Wendling9c8148a2009-01-30 02:45:56 +00001703 return DAG.getNode(ISD::MUL, N->getDebugLoc(), VT,
1704 N0.getOperand(0), C3);
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001705 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001706
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001707 // Change (mul (shl X, C), Y) -> (shl (mul X, Y), C) when the shift has one
1708 // use.
1709 {
Dan Gohman475871a2008-07-27 21:46:04 +00001710 SDValue Sh(0,0), Y(0,0);
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001711 // Check for both (mul (shl X, C), Y) and (mul Y, (shl X, C)).
1712 if (N0.getOpcode() == ISD::SHL && isa<ConstantSDNode>(N0.getOperand(1)) &&
Gabor Greifba36cb52008-08-28 21:40:38 +00001713 N0.getNode()->hasOneUse()) {
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001714 Sh = N0; Y = N1;
Scott Michelfdc40a02009-02-17 22:15:04 +00001715 } else if (N1.getOpcode() == ISD::SHL &&
Gabor Greif12632d22008-08-30 19:29:20 +00001716 isa<ConstantSDNode>(N1.getOperand(1)) &&
1717 N1.getNode()->hasOneUse()) {
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001718 Sh = N1; Y = N0;
1719 }
Bill Wendling73e16b22009-01-30 02:49:26 +00001720
Gabor Greifba36cb52008-08-28 21:40:38 +00001721 if (Sh.getNode()) {
Bill Wendling9c8148a2009-01-30 02:45:56 +00001722 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT,
1723 Sh.getOperand(0), Y);
1724 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT,
1725 Mul, Sh.getOperand(1));
Chris Lattner0b1a85f2006-03-01 03:44:24 +00001726 }
1727 }
Bill Wendling73e16b22009-01-30 02:49:26 +00001728
Chris Lattnera1deca32006-03-04 23:33:26 +00001729 // fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2)
Scott Michelfdc40a02009-02-17 22:15:04 +00001730 if (N1C && N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse() &&
Bill Wendling9c8148a2009-01-30 02:45:56 +00001731 isa<ConstantSDNode>(N0.getOperand(1)))
1732 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT,
1733 DAG.getNode(ISD::MUL, N0.getDebugLoc(), VT,
1734 N0.getOperand(0), N1),
1735 DAG.getNode(ISD::MUL, N1.getDebugLoc(), VT,
1736 N0.getOperand(1), N1));
Scott Michelfdc40a02009-02-17 22:15:04 +00001737
Nate Begemancd4d58c2006-02-03 06:46:56 +00001738 // reassociate mul
Bill Wendling35247c32009-01-30 00:45:56 +00001739 SDValue RMUL = ReassociateOps(ISD::MUL, N->getDebugLoc(), N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001740 if (RMUL.getNode() != 0)
Nate Begemancd4d58c2006-02-03 06:46:56 +00001741 return RMUL;
Dan Gohman7f321562007-06-25 16:23:39 +00001742
Evan Chengb3a3d5e2010-04-28 07:10:39 +00001743 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001744}
1745
Dan Gohman475871a2008-07-27 21:46:04 +00001746SDValue DAGCombiner::visitSDIV(SDNode *N) {
1747 SDValue N0 = N->getOperand(0);
1748 SDValue N1 = N->getOperand(1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001749 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode());
1750 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
Owen Andersone50ed302009-08-10 22:56:29 +00001751 EVT VT = N->getValueType(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001752
Dan Gohman7f321562007-06-25 16:23:39 +00001753 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00001754 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001755 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001756 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00001757 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001758
Nate Begeman1d4d4142005-09-01 00:19:25 +00001759 // fold (sdiv c1, c2) -> c1/c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001760 if (N0C && N1C && !N1C->isNullValue())
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001761 return DAG.FoldConstantArithmetic(ISD::SDIV, VT, N0C, N1C);
Nate Begeman405e3ec2005-10-21 00:02:42 +00001762 // fold (sdiv X, 1) -> X
Dan Gohman7810bfe2008-09-26 21:54:37 +00001763 if (N1C && N1C->getSExtValue() == 1LL)
Nate Begeman405e3ec2005-10-21 00:02:42 +00001764 return N0;
1765 // fold (sdiv X, -1) -> 0-X
1766 if (N1C && N1C->isAllOnesValue())
Bill Wendling944d34b2009-01-30 02:52:17 +00001767 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1768 DAG.getConstant(0, VT), N0);
Chris Lattner094c8fc2005-10-07 06:10:46 +00001769 // If we know the sign bits of both operands are zero, strength reduce to a
1770 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2
Duncan Sands83ec4b62008-06-06 12:08:01 +00001771 if (!VT.isVector()) {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001772 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0))
Bill Wendling944d34b2009-01-30 02:52:17 +00001773 return DAG.getNode(ISD::UDIV, N->getDebugLoc(), N1.getValueType(),
1774 N0, N1);
Chris Lattnerf32aac32008-01-27 23:32:17 +00001775 }
Nate Begemancd6a6ed2006-02-17 07:26:20 +00001776 // fold (sdiv X, pow2) -> simple ops after legalize
Dan Gohman002e5d02008-03-13 22:13:53 +00001777 if (N1C && !N1C->isNullValue() && !TLI.isIntDivCheap() &&
Scott Michelfdc40a02009-02-17 22:15:04 +00001778 (isPowerOf2_64(N1C->getSExtValue()) ||
Dan Gohman7810bfe2008-09-26 21:54:37 +00001779 isPowerOf2_64(-N1C->getSExtValue()))) {
Nate Begeman405e3ec2005-10-21 00:02:42 +00001780 // If dividing by powers of two is cheap, then don't perform the following
1781 // fold.
1782 if (TLI.isPow2DivCheap())
Dan Gohman475871a2008-07-27 21:46:04 +00001783 return SDValue();
Bill Wendling944d34b2009-01-30 02:52:17 +00001784
Dan Gohman7810bfe2008-09-26 21:54:37 +00001785 int64_t pow2 = N1C->getSExtValue();
Nate Begeman405e3ec2005-10-21 00:02:42 +00001786 int64_t abs2 = pow2 > 0 ? pow2 : -pow2;
Chris Lattner8f4880b2006-02-16 08:02:36 +00001787 unsigned lg2 = Log2_64(abs2);
Bill Wendling944d34b2009-01-30 02:52:17 +00001788
Chris Lattner8f4880b2006-02-16 08:02:36 +00001789 // Splat the sign bit into the register
Bill Wendling944d34b2009-01-30 02:52:17 +00001790 SDValue SGN = DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0,
1791 DAG.getConstant(VT.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +00001792 getShiftAmountTy(N0.getValueType())));
Gabor Greifba36cb52008-08-28 21:40:38 +00001793 AddToWorkList(SGN.getNode());
Bill Wendling944d34b2009-01-30 02:52:17 +00001794
Chris Lattner8f4880b2006-02-16 08:02:36 +00001795 // Add (N0 < 0) ? abs2 - 1 : 0;
Bill Wendling944d34b2009-01-30 02:52:17 +00001796 SDValue SRL = DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, SGN,
1797 DAG.getConstant(VT.getSizeInBits() - lg2,
Owen Anderson95771af2011-02-25 21:41:48 +00001798 getShiftAmountTy(SGN.getValueType())));
Bill Wendling944d34b2009-01-30 02:52:17 +00001799 SDValue ADD = DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N0, SRL);
Gabor Greifba36cb52008-08-28 21:40:38 +00001800 AddToWorkList(SRL.getNode());
1801 AddToWorkList(ADD.getNode()); // Divide by pow2
Bill Wendling944d34b2009-01-30 02:52:17 +00001802 SDValue SRA = DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, ADD,
Owen Anderson95771af2011-02-25 21:41:48 +00001803 DAG.getConstant(lg2, getShiftAmountTy(ADD.getValueType())));
Bill Wendling944d34b2009-01-30 02:52:17 +00001804
Nate Begeman405e3ec2005-10-21 00:02:42 +00001805 // If we're dividing by a positive value, we're done. Otherwise, we must
1806 // negate the result.
1807 if (pow2 > 0)
1808 return SRA;
Bill Wendling944d34b2009-01-30 02:52:17 +00001809
Gabor Greifba36cb52008-08-28 21:40:38 +00001810 AddToWorkList(SRA.getNode());
Bill Wendling944d34b2009-01-30 02:52:17 +00001811 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT,
1812 DAG.getConstant(0, VT), SRA);
Nate Begeman405e3ec2005-10-21 00:02:42 +00001813 }
Bill Wendling944d34b2009-01-30 02:52:17 +00001814
Nate Begeman69575232005-10-20 02:15:44 +00001815 // if integer divide is expensive and we satisfy the requirements, emit an
1816 // alternate sequence.
Scott Michelfdc40a02009-02-17 22:15:04 +00001817 if (N1C && (N1C->getSExtValue() < -1 || N1C->getSExtValue() > 1) &&
Chris Lattnere9936d12005-10-22 18:50:15 +00001818 !TLI.isIntDivCheap()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001819 SDValue Op = BuildSDIV(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001820 if (Op.getNode()) return Op;
Nate Begeman69575232005-10-20 02:15:44 +00001821 }
Dan Gohman7f321562007-06-25 16:23:39 +00001822
Dan Gohman613e0d82007-07-03 14:03:57 +00001823 // undef / X -> 0
1824 if (N0.getOpcode() == ISD::UNDEF)
1825 return DAG.getConstant(0, VT);
1826 // X / undef -> undef
1827 if (N1.getOpcode() == ISD::UNDEF)
1828 return N1;
Dan Gohman7f321562007-06-25 16:23:39 +00001829
Dan Gohman475871a2008-07-27 21:46:04 +00001830 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001831}
1832
Dan Gohman475871a2008-07-27 21:46:04 +00001833SDValue DAGCombiner::visitUDIV(SDNode *N) {
1834 SDValue N0 = N->getOperand(0);
1835 SDValue N1 = N->getOperand(1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001836 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode());
1837 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
Owen Andersone50ed302009-08-10 22:56:29 +00001838 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001839
Dan Gohman7f321562007-06-25 16:23:39 +00001840 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00001841 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001842 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001843 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00001844 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001845
Nate Begeman1d4d4142005-09-01 00:19:25 +00001846 // fold (udiv c1, c2) -> c1/c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001847 if (N0C && N1C && !N1C->isNullValue())
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001848 return DAG.FoldConstantArithmetic(ISD::UDIV, VT, N0C, N1C);
Nate Begeman1d4d4142005-09-01 00:19:25 +00001849 // fold (udiv x, (1 << c)) -> x >>u c
Dan Gohman002e5d02008-03-13 22:13:53 +00001850 if (N1C && N1C->getAPIntValue().isPowerOf2())
Scott Michelfdc40a02009-02-17 22:15:04 +00001851 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0,
Dan Gohman002e5d02008-03-13 22:13:53 +00001852 DAG.getConstant(N1C->getAPIntValue().logBase2(),
Owen Anderson95771af2011-02-25 21:41:48 +00001853 getShiftAmountTy(N0.getValueType())));
Nate Begemanfb5e4bd2006-02-05 07:20:23 +00001854 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2
1855 if (N1.getOpcode() == ISD::SHL) {
1856 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00001857 if (SHC->getAPIntValue().isPowerOf2()) {
Owen Andersone50ed302009-08-10 22:56:29 +00001858 EVT ADDVT = N1.getOperand(1).getValueType();
Bill Wendling07d85142009-01-30 02:55:25 +00001859 SDValue Add = DAG.getNode(ISD::ADD, N->getDebugLoc(), ADDVT,
1860 N1.getOperand(1),
1861 DAG.getConstant(SHC->getAPIntValue()
1862 .logBase2(),
1863 ADDVT));
Gabor Greifba36cb52008-08-28 21:40:38 +00001864 AddToWorkList(Add.getNode());
Bill Wendling07d85142009-01-30 02:55:25 +00001865 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, Add);
Nate Begemanfb5e4bd2006-02-05 07:20:23 +00001866 }
1867 }
1868 }
Nate Begeman69575232005-10-20 02:15:44 +00001869 // fold (udiv x, c) -> alternate
Dan Gohman002e5d02008-03-13 22:13:53 +00001870 if (N1C && !N1C->isNullValue() && !TLI.isIntDivCheap()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001871 SDValue Op = BuildUDIV(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00001872 if (Op.getNode()) return Op;
Chris Lattnere9936d12005-10-22 18:50:15 +00001873 }
Dan Gohman7f321562007-06-25 16:23:39 +00001874
Dan Gohman613e0d82007-07-03 14:03:57 +00001875 // undef / X -> 0
1876 if (N0.getOpcode() == ISD::UNDEF)
1877 return DAG.getConstant(0, VT);
1878 // X / undef -> undef
1879 if (N1.getOpcode() == ISD::UNDEF)
1880 return N1;
Dan Gohman7f321562007-06-25 16:23:39 +00001881
Dan Gohman475871a2008-07-27 21:46:04 +00001882 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001883}
1884
Dan Gohman475871a2008-07-27 21:46:04 +00001885SDValue DAGCombiner::visitSREM(SDNode *N) {
1886 SDValue N0 = N->getOperand(0);
1887 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00001888 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1889 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001890 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001891
Nate Begeman1d4d4142005-09-01 00:19:25 +00001892 // fold (srem c1, c2) -> c1%c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001893 if (N0C && N1C && !N1C->isNullValue())
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001894 return DAG.FoldConstantArithmetic(ISD::SREM, VT, N0C, N1C);
Nate Begeman07ed4172005-10-10 21:26:48 +00001895 // If we know the sign bits of both operands are zero, strength reduce to a
1896 // urem instead. Handles (X & 0x0FFFFFFF) %s 16 -> X&15
Duncan Sands83ec4b62008-06-06 12:08:01 +00001897 if (!VT.isVector()) {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001898 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0))
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001899 return DAG.getNode(ISD::UREM, N->getDebugLoc(), VT, N0, N1);
Chris Lattneree339f42008-01-27 23:21:58 +00001900 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001901
Dan Gohman77003042007-11-26 23:46:11 +00001902 // If X/C can be simplified by the division-by-constant logic, lower
1903 // X%C to the equivalent of X-X/C*C.
Chris Lattner26d29902006-10-12 20:58:32 +00001904 if (N1C && !N1C->isNullValue()) {
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001905 SDValue Div = DAG.getNode(ISD::SDIV, N->getDebugLoc(), VT, N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00001906 AddToWorkList(Div.getNode());
1907 SDValue OptimizedDiv = combine(Div.getNode());
1908 if (OptimizedDiv.getNode() && OptimizedDiv.getNode() != Div.getNode()) {
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001909 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT,
1910 OptimizedDiv, N1);
1911 SDValue Sub = DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, Mul);
Gabor Greifba36cb52008-08-28 21:40:38 +00001912 AddToWorkList(Mul.getNode());
Dan Gohman77003042007-11-26 23:46:11 +00001913 return Sub;
1914 }
Chris Lattner26d29902006-10-12 20:58:32 +00001915 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001916
Dan Gohman613e0d82007-07-03 14:03:57 +00001917 // undef % X -> 0
1918 if (N0.getOpcode() == ISD::UNDEF)
1919 return DAG.getConstant(0, VT);
1920 // X % undef -> undef
1921 if (N1.getOpcode() == ISD::UNDEF)
1922 return N1;
Dan Gohman7f321562007-06-25 16:23:39 +00001923
Dan Gohman475871a2008-07-27 21:46:04 +00001924 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001925}
1926
Dan Gohman475871a2008-07-27 21:46:04 +00001927SDValue DAGCombiner::visitUREM(SDNode *N) {
1928 SDValue N0 = N->getOperand(0);
1929 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00001930 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1931 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001932 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00001933
Nate Begeman1d4d4142005-09-01 00:19:25 +00001934 // fold (urem c1, c2) -> c1%c2
Nate Begeman646d7e22005-09-02 21:18:40 +00001935 if (N0C && N1C && !N1C->isNullValue())
Bill Wendlingf3cbca22008-09-24 10:25:02 +00001936 return DAG.FoldConstantArithmetic(ISD::UREM, VT, N0C, N1C);
Nate Begeman07ed4172005-10-10 21:26:48 +00001937 // fold (urem x, pow2) -> (and x, pow2-1)
Dan Gohman002e5d02008-03-13 22:13:53 +00001938 if (N1C && !N1C->isNullValue() && N1C->getAPIntValue().isPowerOf2())
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001939 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0,
Dan Gohman002e5d02008-03-13 22:13:53 +00001940 DAG.getConstant(N1C->getAPIntValue()-1,VT));
Nate Begemanc031e332006-02-05 07:36:48 +00001941 // fold (urem x, (shl pow2, y)) -> (and x, (add (shl pow2, y), -1))
1942 if (N1.getOpcode() == ISD::SHL) {
1943 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00001944 if (SHC->getAPIntValue().isPowerOf2()) {
Dan Gohman475871a2008-07-27 21:46:04 +00001945 SDValue Add =
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001946 DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1,
Duncan Sands83ec4b62008-06-06 12:08:01 +00001947 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()),
Dan Gohman002e5d02008-03-13 22:13:53 +00001948 VT));
Gabor Greifba36cb52008-08-28 21:40:38 +00001949 AddToWorkList(Add.getNode());
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001950 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, Add);
Nate Begemanc031e332006-02-05 07:36:48 +00001951 }
1952 }
1953 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001954
Dan Gohman77003042007-11-26 23:46:11 +00001955 // If X/C can be simplified by the division-by-constant logic, lower
1956 // X%C to the equivalent of X-X/C*C.
Chris Lattner26d29902006-10-12 20:58:32 +00001957 if (N1C && !N1C->isNullValue()) {
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001958 SDValue Div = DAG.getNode(ISD::UDIV, N->getDebugLoc(), VT, N0, N1);
Dan Gohman942ca7f2008-09-08 16:59:01 +00001959 AddToWorkList(Div.getNode());
Gabor Greifba36cb52008-08-28 21:40:38 +00001960 SDValue OptimizedDiv = combine(Div.getNode());
1961 if (OptimizedDiv.getNode() && OptimizedDiv.getNode() != Div.getNode()) {
Bill Wendling6d3bf8c2009-01-30 02:57:00 +00001962 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT,
1963 OptimizedDiv, N1);
1964 SDValue Sub = DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, Mul);
Gabor Greifba36cb52008-08-28 21:40:38 +00001965 AddToWorkList(Mul.getNode());
Dan Gohman77003042007-11-26 23:46:11 +00001966 return Sub;
1967 }
Chris Lattner26d29902006-10-12 20:58:32 +00001968 }
Scott Michelfdc40a02009-02-17 22:15:04 +00001969
Dan Gohman613e0d82007-07-03 14:03:57 +00001970 // undef % X -> 0
1971 if (N0.getOpcode() == ISD::UNDEF)
1972 return DAG.getConstant(0, VT);
1973 // X % undef -> undef
1974 if (N1.getOpcode() == ISD::UNDEF)
1975 return N1;
Dan Gohman7f321562007-06-25 16:23:39 +00001976
Dan Gohman475871a2008-07-27 21:46:04 +00001977 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00001978}
1979
Dan Gohman475871a2008-07-27 21:46:04 +00001980SDValue DAGCombiner::visitMULHS(SDNode *N) {
1981 SDValue N0 = N->getOperand(0);
1982 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00001983 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00001984 EVT VT = N->getValueType(0);
Chris Lattnerde1c3602010-12-13 08:39:01 +00001985 DebugLoc DL = N->getDebugLoc();
Scott Michelfdc40a02009-02-17 22:15:04 +00001986
Nate Begeman1d4d4142005-09-01 00:19:25 +00001987 // fold (mulhs x, 0) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00001988 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00001989 return N1;
Nate Begeman1d4d4142005-09-01 00:19:25 +00001990 // fold (mulhs x, 1) -> (sra x, size(x)-1)
Dan Gohman002e5d02008-03-13 22:13:53 +00001991 if (N1C && N1C->getAPIntValue() == 1)
Bill Wendling326411d2009-01-30 03:00:18 +00001992 return DAG.getNode(ISD::SRA, N->getDebugLoc(), N0.getValueType(), N0,
1993 DAG.getConstant(N0.getValueType().getSizeInBits() - 1,
Owen Anderson95771af2011-02-25 21:41:48 +00001994 getShiftAmountTy(N0.getValueType())));
Dan Gohman613e0d82007-07-03 14:03:57 +00001995 // fold (mulhs x, undef) -> 0
Dan Gohmand595b5f2007-07-10 14:20:37 +00001996 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00001997 return DAG.getConstant(0, VT);
Dan Gohman7f321562007-06-25 16:23:39 +00001998
Chris Lattnerde1c3602010-12-13 08:39:01 +00001999 // If the type twice as wide is legal, transform the mulhs to a wider multiply
2000 // plus a shift.
2001 if (VT.isSimple() && !VT.isVector()) {
2002 MVT Simple = VT.getSimpleVT();
2003 unsigned SimpleSize = Simple.getSizeInBits();
2004 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2005 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2006 N0 = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N0);
2007 N1 = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N1);
2008 N1 = DAG.getNode(ISD::MUL, DL, NewVT, N0, N1);
Chris Lattner1a0fbe22010-12-15 05:51:39 +00002009 N1 = DAG.getNode(ISD::SRL, DL, NewVT, N1,
Owen Anderson95771af2011-02-25 21:41:48 +00002010 DAG.getConstant(SimpleSize, getShiftAmountTy(N1.getValueType())));
Chris Lattnerde1c3602010-12-13 08:39:01 +00002011 return DAG.getNode(ISD::TRUNCATE, DL, VT, N1);
2012 }
2013 }
Owen Anderson95771af2011-02-25 21:41:48 +00002014
Dan Gohman475871a2008-07-27 21:46:04 +00002015 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00002016}
2017
Dan Gohman475871a2008-07-27 21:46:04 +00002018SDValue DAGCombiner::visitMULHU(SDNode *N) {
2019 SDValue N0 = N->getOperand(0);
2020 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00002021 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00002022 EVT VT = N->getValueType(0);
Chris Lattnerde1c3602010-12-13 08:39:01 +00002023 DebugLoc DL = N->getDebugLoc();
Scott Michelfdc40a02009-02-17 22:15:04 +00002024
Nate Begeman1d4d4142005-09-01 00:19:25 +00002025 // fold (mulhu x, 0) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00002026 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00002027 return N1;
Nate Begeman1d4d4142005-09-01 00:19:25 +00002028 // fold (mulhu x, 1) -> 0
Dan Gohman002e5d02008-03-13 22:13:53 +00002029 if (N1C && N1C->getAPIntValue() == 1)
Nate Begeman83e75ec2005-09-06 04:43:02 +00002030 return DAG.getConstant(0, N0.getValueType());
Dan Gohman613e0d82007-07-03 14:03:57 +00002031 // fold (mulhu x, undef) -> 0
Dan Gohmand595b5f2007-07-10 14:20:37 +00002032 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00002033 return DAG.getConstant(0, VT);
Dan Gohman7f321562007-06-25 16:23:39 +00002034
Chris Lattnerde1c3602010-12-13 08:39:01 +00002035 // If the type twice as wide is legal, transform the mulhu to a wider multiply
2036 // plus a shift.
2037 if (VT.isSimple() && !VT.isVector()) {
2038 MVT Simple = VT.getSimpleVT();
2039 unsigned SimpleSize = Simple.getSizeInBits();
2040 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2041 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2042 N0 = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N0);
2043 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N1);
2044 N1 = DAG.getNode(ISD::MUL, DL, NewVT, N0, N1);
2045 N1 = DAG.getNode(ISD::SRL, DL, NewVT, N1,
Owen Anderson95771af2011-02-25 21:41:48 +00002046 DAG.getConstant(SimpleSize, getShiftAmountTy(N1.getValueType())));
Chris Lattnerde1c3602010-12-13 08:39:01 +00002047 return DAG.getNode(ISD::TRUNCATE, DL, VT, N1);
2048 }
2049 }
Owen Anderson95771af2011-02-25 21:41:48 +00002050
Dan Gohman475871a2008-07-27 21:46:04 +00002051 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00002052}
2053
Dan Gohman389079b2007-10-08 17:57:15 +00002054/// SimplifyNodeWithTwoResults - Perform optimizations common to nodes that
2055/// compute two values. LoOp and HiOp give the opcodes for the two computations
2056/// that are being performed. Return true if a simplification was made.
2057///
Scott Michelfdc40a02009-02-17 22:15:04 +00002058SDValue DAGCombiner::SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp,
Dan Gohman475871a2008-07-27 21:46:04 +00002059 unsigned HiOp) {
Dan Gohman389079b2007-10-08 17:57:15 +00002060 // If the high half is not needed, just compute the low half.
Evan Cheng44711942007-11-08 09:25:29 +00002061 bool HiExists = N->hasAnyUseOfValue(1);
2062 if (!HiExists &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002063 (!LegalOperations ||
Dan Gohman389079b2007-10-08 17:57:15 +00002064 TLI.isOperationLegal(LoOp, N->getValueType(0)))) {
Bill Wendling826d1142009-01-30 03:08:40 +00002065 SDValue Res = DAG.getNode(LoOp, N->getDebugLoc(), N->getValueType(0),
2066 N->op_begin(), N->getNumOperands());
Chris Lattner5eee4272008-01-26 01:09:19 +00002067 return CombineTo(N, Res, Res);
Dan Gohman389079b2007-10-08 17:57:15 +00002068 }
2069
2070 // If the low half is not needed, just compute the high half.
Evan Cheng44711942007-11-08 09:25:29 +00002071 bool LoExists = N->hasAnyUseOfValue(0);
2072 if (!LoExists &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002073 (!LegalOperations ||
Dan Gohman389079b2007-10-08 17:57:15 +00002074 TLI.isOperationLegal(HiOp, N->getValueType(1)))) {
Bill Wendling826d1142009-01-30 03:08:40 +00002075 SDValue Res = DAG.getNode(HiOp, N->getDebugLoc(), N->getValueType(1),
2076 N->op_begin(), N->getNumOperands());
Chris Lattner5eee4272008-01-26 01:09:19 +00002077 return CombineTo(N, Res, Res);
Dan Gohman389079b2007-10-08 17:57:15 +00002078 }
2079
Evan Cheng44711942007-11-08 09:25:29 +00002080 // If both halves are used, return as it is.
2081 if (LoExists && HiExists)
Dan Gohman475871a2008-07-27 21:46:04 +00002082 return SDValue();
Evan Cheng44711942007-11-08 09:25:29 +00002083
2084 // If the two computed results can be simplified separately, separate them.
Evan Cheng44711942007-11-08 09:25:29 +00002085 if (LoExists) {
Bill Wendling826d1142009-01-30 03:08:40 +00002086 SDValue Lo = DAG.getNode(LoOp, N->getDebugLoc(), N->getValueType(0),
2087 N->op_begin(), N->getNumOperands());
Gabor Greifba36cb52008-08-28 21:40:38 +00002088 AddToWorkList(Lo.getNode());
2089 SDValue LoOpt = combine(Lo.getNode());
2090 if (LoOpt.getNode() && LoOpt.getNode() != Lo.getNode() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002091 (!LegalOperations ||
Duncan Sandsd4b9c172008-06-13 19:07:40 +00002092 TLI.isOperationLegal(LoOpt.getOpcode(), LoOpt.getValueType())))
Chris Lattner5eee4272008-01-26 01:09:19 +00002093 return CombineTo(N, LoOpt, LoOpt);
Dan Gohman389079b2007-10-08 17:57:15 +00002094 }
2095
Evan Cheng44711942007-11-08 09:25:29 +00002096 if (HiExists) {
Bill Wendling826d1142009-01-30 03:08:40 +00002097 SDValue Hi = DAG.getNode(HiOp, N->getDebugLoc(), N->getValueType(1),
Duncan Sands25cf2272008-11-24 14:53:14 +00002098 N->op_begin(), N->getNumOperands());
Gabor Greifba36cb52008-08-28 21:40:38 +00002099 AddToWorkList(Hi.getNode());
2100 SDValue HiOpt = combine(Hi.getNode());
2101 if (HiOpt.getNode() && HiOpt != Hi &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002102 (!LegalOperations ||
Duncan Sandsd4b9c172008-06-13 19:07:40 +00002103 TLI.isOperationLegal(HiOpt.getOpcode(), HiOpt.getValueType())))
Chris Lattner5eee4272008-01-26 01:09:19 +00002104 return CombineTo(N, HiOpt, HiOpt);
Evan Cheng44711942007-11-08 09:25:29 +00002105 }
Bill Wendling826d1142009-01-30 03:08:40 +00002106
Dan Gohman475871a2008-07-27 21:46:04 +00002107 return SDValue();
Dan Gohman389079b2007-10-08 17:57:15 +00002108}
2109
Dan Gohman475871a2008-07-27 21:46:04 +00002110SDValue DAGCombiner::visitSMUL_LOHI(SDNode *N) {
2111 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHS);
Gabor Greifba36cb52008-08-28 21:40:38 +00002112 if (Res.getNode()) return Res;
Dan Gohman389079b2007-10-08 17:57:15 +00002113
Chris Lattner33e77d32010-12-15 06:04:19 +00002114 EVT VT = N->getValueType(0);
2115 DebugLoc DL = N->getDebugLoc();
2116
2117 // If the type twice as wide is legal, transform the mulhu to a wider multiply
2118 // plus a shift.
2119 if (VT.isSimple() && !VT.isVector()) {
2120 MVT Simple = VT.getSimpleVT();
2121 unsigned SimpleSize = Simple.getSizeInBits();
2122 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2123 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2124 SDValue Lo = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N->getOperand(0));
2125 SDValue Hi = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N->getOperand(1));
2126 Lo = DAG.getNode(ISD::MUL, DL, NewVT, Lo, Hi);
2127 // Compute the high part as N1.
2128 Hi = DAG.getNode(ISD::SRL, DL, NewVT, Lo,
Owen Anderson95771af2011-02-25 21:41:48 +00002129 DAG.getConstant(SimpleSize, getShiftAmountTy(Lo.getValueType())));
Chris Lattner33e77d32010-12-15 06:04:19 +00002130 Hi = DAG.getNode(ISD::TRUNCATE, DL, VT, Hi);
2131 // Compute the low part as N0.
2132 Lo = DAG.getNode(ISD::TRUNCATE, DL, VT, Lo);
2133 return CombineTo(N, Lo, Hi);
2134 }
2135 }
Owen Anderson95771af2011-02-25 21:41:48 +00002136
Dan Gohman475871a2008-07-27 21:46:04 +00002137 return SDValue();
Dan Gohman389079b2007-10-08 17:57:15 +00002138}
2139
Dan Gohman475871a2008-07-27 21:46:04 +00002140SDValue DAGCombiner::visitUMUL_LOHI(SDNode *N) {
2141 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHU);
Gabor Greifba36cb52008-08-28 21:40:38 +00002142 if (Res.getNode()) return Res;
Dan Gohman389079b2007-10-08 17:57:15 +00002143
Chris Lattner33e77d32010-12-15 06:04:19 +00002144 EVT VT = N->getValueType(0);
2145 DebugLoc DL = N->getDebugLoc();
Owen Anderson95771af2011-02-25 21:41:48 +00002146
Chris Lattner33e77d32010-12-15 06:04:19 +00002147 // If the type twice as wide is legal, transform the mulhu to a wider multiply
2148 // plus a shift.
2149 if (VT.isSimple() && !VT.isVector()) {
2150 MVT Simple = VT.getSimpleVT();
2151 unsigned SimpleSize = Simple.getSizeInBits();
2152 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2153 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2154 SDValue Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N->getOperand(0));
2155 SDValue Hi = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N->getOperand(1));
2156 Lo = DAG.getNode(ISD::MUL, DL, NewVT, Lo, Hi);
2157 // Compute the high part as N1.
2158 Hi = DAG.getNode(ISD::SRL, DL, NewVT, Lo,
Owen Anderson95771af2011-02-25 21:41:48 +00002159 DAG.getConstant(SimpleSize, getShiftAmountTy(Lo.getValueType())));
Chris Lattner33e77d32010-12-15 06:04:19 +00002160 Hi = DAG.getNode(ISD::TRUNCATE, DL, VT, Hi);
2161 // Compute the low part as N0.
2162 Lo = DAG.getNode(ISD::TRUNCATE, DL, VT, Lo);
2163 return CombineTo(N, Lo, Hi);
2164 }
2165 }
Owen Anderson95771af2011-02-25 21:41:48 +00002166
Dan Gohman475871a2008-07-27 21:46:04 +00002167 return SDValue();
Dan Gohman389079b2007-10-08 17:57:15 +00002168}
2169
Benjamin Kramerf55d26e2011-05-21 18:31:55 +00002170SDValue DAGCombiner::visitSMULO(SDNode *N) {
2171 // (smulo x, 2) -> (saddo x, x)
2172 if (ConstantSDNode *C2 = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2173 if (C2->getAPIntValue() == 2)
2174 return DAG.getNode(ISD::SADDO, N->getDebugLoc(), N->getVTList(),
2175 N->getOperand(0), N->getOperand(0));
2176
2177 return SDValue();
2178}
2179
2180SDValue DAGCombiner::visitUMULO(SDNode *N) {
2181 // (umulo x, 2) -> (uaddo x, x)
2182 if (ConstantSDNode *C2 = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2183 if (C2->getAPIntValue() == 2)
2184 return DAG.getNode(ISD::UADDO, N->getDebugLoc(), N->getVTList(),
2185 N->getOperand(0), N->getOperand(0));
2186
2187 return SDValue();
2188}
2189
Dan Gohman475871a2008-07-27 21:46:04 +00002190SDValue DAGCombiner::visitSDIVREM(SDNode *N) {
2191 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::SDIV, ISD::SREM);
Gabor Greifba36cb52008-08-28 21:40:38 +00002192 if (Res.getNode()) return Res;
Scott Michelfdc40a02009-02-17 22:15:04 +00002193
Dan Gohman475871a2008-07-27 21:46:04 +00002194 return SDValue();
Dan Gohman389079b2007-10-08 17:57:15 +00002195}
2196
Dan Gohman475871a2008-07-27 21:46:04 +00002197SDValue DAGCombiner::visitUDIVREM(SDNode *N) {
2198 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::UDIV, ISD::UREM);
Gabor Greifba36cb52008-08-28 21:40:38 +00002199 if (Res.getNode()) return Res;
Scott Michelfdc40a02009-02-17 22:15:04 +00002200
Dan Gohman475871a2008-07-27 21:46:04 +00002201 return SDValue();
Dan Gohman389079b2007-10-08 17:57:15 +00002202}
2203
Chris Lattner35e5c142006-05-05 05:51:50 +00002204/// SimplifyBinOpWithSameOpcodeHands - If this is a binary operator with
2205/// two operands of the same opcode, try to simplify it.
Dan Gohman475871a2008-07-27 21:46:04 +00002206SDValue DAGCombiner::SimplifyBinOpWithSameOpcodeHands(SDNode *N) {
2207 SDValue N0 = N->getOperand(0), N1 = N->getOperand(1);
Owen Andersone50ed302009-08-10 22:56:29 +00002208 EVT VT = N0.getValueType();
Chris Lattner35e5c142006-05-05 05:51:50 +00002209 assert(N0.getOpcode() == N1.getOpcode() && "Bad input!");
Scott Michelfdc40a02009-02-17 22:15:04 +00002210
Dan Gohmanff00a552010-01-14 03:08:49 +00002211 // Bail early if none of these transforms apply.
2212 if (N0.getNode()->getNumOperands() == 0) return SDValue();
2213
Chris Lattner540121f2006-05-05 06:31:05 +00002214 // For each of OP in AND/OR/XOR:
2215 // fold (OP (zext x), (zext y)) -> (zext (OP x, y))
2216 // fold (OP (sext x), (sext y)) -> (sext (OP x, y))
2217 // fold (OP (aext x), (aext y)) -> (aext (OP x, y))
Dan Gohman4e39e9d2010-06-24 14:30:44 +00002218 // fold (OP (trunc x), (trunc y)) -> (trunc (OP x, y)) (if trunc isn't free)
Nate Begeman93e0ed32009-12-03 07:11:29 +00002219 //
2220 // do not sink logical op inside of a vector extend, since it may combine
2221 // into a vsetcc.
Evan Chengd40d03e2010-01-06 19:38:29 +00002222 EVT Op0VT = N0.getOperand(0).getValueType();
2223 if ((N0.getOpcode() == ISD::ZERO_EXTEND ||
Dan Gohman97121ba2009-04-08 00:15:30 +00002224 N0.getOpcode() == ISD::SIGN_EXTEND ||
Evan Chenge5b51ac2010-04-17 06:13:15 +00002225 // Avoid infinite looping with PromoteIntBinOp.
2226 (N0.getOpcode() == ISD::ANY_EXTEND &&
2227 (!LegalTypes || TLI.isTypeDesirableForOp(N->getOpcode(), Op0VT))) ||
Dan Gohman4e39e9d2010-06-24 14:30:44 +00002228 (N0.getOpcode() == ISD::TRUNCATE &&
2229 (!TLI.isZExtFree(VT, Op0VT) ||
2230 !TLI.isTruncateFree(Op0VT, VT)) &&
2231 TLI.isTypeLegal(Op0VT))) &&
Nate Begeman93e0ed32009-12-03 07:11:29 +00002232 !VT.isVector() &&
Evan Chengd40d03e2010-01-06 19:38:29 +00002233 Op0VT == N1.getOperand(0).getValueType() &&
2234 (!LegalOperations || TLI.isOperationLegal(N->getOpcode(), Op0VT))) {
Bill Wendlingb74c8672009-01-30 19:25:47 +00002235 SDValue ORNode = DAG.getNode(N->getOpcode(), N0.getDebugLoc(),
2236 N0.getOperand(0).getValueType(),
2237 N0.getOperand(0), N1.getOperand(0));
Gabor Greifba36cb52008-08-28 21:40:38 +00002238 AddToWorkList(ORNode.getNode());
Bill Wendlingb74c8672009-01-30 19:25:47 +00002239 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, ORNode);
Chris Lattner35e5c142006-05-05 05:51:50 +00002240 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002241
Chris Lattnera3dc3f62006-05-05 06:10:43 +00002242 // For each of OP in SHL/SRL/SRA/AND...
2243 // fold (and (OP x, z), (OP y, z)) -> (OP (and x, y), z)
2244 // fold (or (OP x, z), (OP y, z)) -> (OP (or x, y), z)
2245 // fold (xor (OP x, z), (OP y, z)) -> (OP (xor x, y), z)
Chris Lattner35e5c142006-05-05 05:51:50 +00002246 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL ||
Chris Lattnera3dc3f62006-05-05 06:10:43 +00002247 N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::AND) &&
Chris Lattner35e5c142006-05-05 05:51:50 +00002248 N0.getOperand(1) == N1.getOperand(1)) {
Bill Wendlingb74c8672009-01-30 19:25:47 +00002249 SDValue ORNode = DAG.getNode(N->getOpcode(), N0.getDebugLoc(),
2250 N0.getOperand(0).getValueType(),
2251 N0.getOperand(0), N1.getOperand(0));
Gabor Greifba36cb52008-08-28 21:40:38 +00002252 AddToWorkList(ORNode.getNode());
Bill Wendlingb74c8672009-01-30 19:25:47 +00002253 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT,
2254 ORNode, N0.getOperand(1));
Chris Lattner35e5c142006-05-05 05:51:50 +00002255 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002256
Dan Gohman475871a2008-07-27 21:46:04 +00002257 return SDValue();
Chris Lattner35e5c142006-05-05 05:51:50 +00002258}
2259
Dan Gohman475871a2008-07-27 21:46:04 +00002260SDValue DAGCombiner::visitAND(SDNode *N) {
2261 SDValue N0 = N->getOperand(0);
2262 SDValue N1 = N->getOperand(1);
2263 SDValue LL, LR, RL, RR, CC0, CC1;
Nate Begeman646d7e22005-09-02 21:18:40 +00002264 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
2265 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00002266 EVT VT = N1.getValueType();
Dan Gohman6900a392010-03-04 00:23:16 +00002267 unsigned BitWidth = VT.getScalarType().getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00002268
Dan Gohman7f321562007-06-25 16:23:39 +00002269 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00002270 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00002271 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002272 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00002273 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002274
Dan Gohman613e0d82007-07-03 14:03:57 +00002275 // fold (and x, undef) -> 0
Dan Gohmand595b5f2007-07-10 14:20:37 +00002276 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00002277 return DAG.getConstant(0, VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00002278 // fold (and c1, c2) -> c1&c2
Nate Begeman646d7e22005-09-02 21:18:40 +00002279 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00002280 return DAG.FoldConstantArithmetic(ISD::AND, VT, N0C, N1C);
Nate Begeman99801192005-09-07 23:25:52 +00002281 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00002282 if (N0C && !N1C)
Bill Wendlingfc4b6772009-02-01 11:19:36 +00002283 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N1, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00002284 // fold (and x, -1) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00002285 if (N1C && N1C->isAllOnesValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00002286 return N0;
2287 // if (and x, c) is known to be zero, return 0
Dan Gohman475871a2008-07-27 21:46:04 +00002288 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0),
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002289 APInt::getAllOnesValue(BitWidth)))
Nate Begeman83e75ec2005-09-06 04:43:02 +00002290 return DAG.getConstant(0, VT);
Nate Begemancd4d58c2006-02-03 06:46:56 +00002291 // reassociate and
Bill Wendling35247c32009-01-30 00:45:56 +00002292 SDValue RAND = ReassociateOps(ISD::AND, N->getDebugLoc(), N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00002293 if (RAND.getNode() != 0)
Nate Begemancd4d58c2006-02-03 06:46:56 +00002294 return RAND;
Bill Wendling7d9f2b92010-03-03 00:35:56 +00002295 // fold (and (or x, C), D) -> D if (C & D) == D
Nate Begeman5dc7e862005-11-02 18:42:59 +00002296 if (N1C && N0.getOpcode() == ISD::OR)
Nate Begeman1d4d4142005-09-01 00:19:25 +00002297 if (ConstantSDNode *ORI = dyn_cast<ConstantSDNode>(N0.getOperand(1)))
Dan Gohman002e5d02008-03-13 22:13:53 +00002298 if ((ORI->getAPIntValue() & N1C->getAPIntValue()) == N1C->getAPIntValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00002299 return N1;
Chris Lattner3603cd62006-02-02 07:17:31 +00002300 // fold (and (any_ext V), c) -> (zero_ext V) if 'and' only clears top bits.
2301 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
Dan Gohman475871a2008-07-27 21:46:04 +00002302 SDValue N0Op0 = N0.getOperand(0);
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002303 APInt Mask = ~N1C->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00002304 Mask = Mask.trunc(N0Op0.getValueSizeInBits());
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002305 if (DAG.MaskedValueIsZero(N0Op0, Mask)) {
Bill Wendling2627a882009-01-30 20:43:18 +00002306 SDValue Zext = DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(),
2307 N0.getValueType(), N0Op0);
Scott Michelfdc40a02009-02-17 22:15:04 +00002308
Chris Lattner1ec05d12006-03-01 21:47:21 +00002309 // Replace uses of the AND with uses of the Zero extend node.
2310 CombineTo(N, Zext);
Scott Michelfdc40a02009-02-17 22:15:04 +00002311
Chris Lattner3603cd62006-02-02 07:17:31 +00002312 // We actually want to replace all uses of the any_extend with the
2313 // zero_extend, to avoid duplicating things. This will later cause this
2314 // AND to be folded.
Gabor Greifba36cb52008-08-28 21:40:38 +00002315 CombineTo(N0.getNode(), Zext);
Dan Gohman475871a2008-07-27 21:46:04 +00002316 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Chris Lattner3603cd62006-02-02 07:17:31 +00002317 }
2318 }
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002319 // fold (and (setcc x), (setcc y)) -> (setcc (and x, y))
2320 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
2321 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
2322 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
Scott Michelfdc40a02009-02-17 22:15:04 +00002323
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002324 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00002325 LL.getValueType().isInteger()) {
Bill Wendling2627a882009-01-30 20:43:18 +00002326 // fold (and (seteq X, 0), (seteq Y, 0)) -> (seteq (or X, Y), 0)
Dan Gohman002e5d02008-03-13 22:13:53 +00002327 if (cast<ConstantSDNode>(LR)->isNullValue() && Op1 == ISD::SETEQ) {
Bill Wendling2627a882009-01-30 20:43:18 +00002328 SDValue ORNode = DAG.getNode(ISD::OR, N0.getDebugLoc(),
2329 LR.getValueType(), LL, RL);
Gabor Greifba36cb52008-08-28 21:40:38 +00002330 AddToWorkList(ORNode.getNode());
Bill Wendling2627a882009-01-30 20:43:18 +00002331 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002332 }
Bill Wendling2627a882009-01-30 20:43:18 +00002333 // fold (and (seteq X, -1), (seteq Y, -1)) -> (seteq (and X, Y), -1)
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002334 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETEQ) {
Bill Wendling2627a882009-01-30 20:43:18 +00002335 SDValue ANDNode = DAG.getNode(ISD::AND, N0.getDebugLoc(),
2336 LR.getValueType(), LL, RL);
Gabor Greifba36cb52008-08-28 21:40:38 +00002337 AddToWorkList(ANDNode.getNode());
Bill Wendling2627a882009-01-30 20:43:18 +00002338 return DAG.getSetCC(N->getDebugLoc(), VT, ANDNode, LR, Op1);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002339 }
Bill Wendling2627a882009-01-30 20:43:18 +00002340 // fold (and (setgt X, -1), (setgt Y, -1)) -> (setgt (or X, Y), -1)
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002341 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETGT) {
Bill Wendling2627a882009-01-30 20:43:18 +00002342 SDValue ORNode = DAG.getNode(ISD::OR, N0.getDebugLoc(),
2343 LR.getValueType(), LL, RL);
Gabor Greifba36cb52008-08-28 21:40:38 +00002344 AddToWorkList(ORNode.getNode());
Bill Wendling2627a882009-01-30 20:43:18 +00002345 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002346 }
2347 }
2348 // canonicalize equivalent to ll == rl
2349 if (LL == RR && LR == RL) {
2350 Op1 = ISD::getSetCCSwappedOperands(Op1);
2351 std::swap(RL, RR);
2352 }
2353 if (LL == RL && LR == RR) {
Duncan Sands83ec4b62008-06-06 12:08:01 +00002354 bool isInteger = LL.getValueType().isInteger();
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002355 ISD::CondCode Result = ISD::getSetCCAndOperation(Op0, Op1, isInteger);
Chris Lattner6e1c6232008-10-28 07:11:07 +00002356 if (Result != ISD::SETCC_INVALID &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002357 (!LegalOperations || TLI.isCondCodeLegal(Result, LL.getValueType())))
Bill Wendling2627a882009-01-30 20:43:18 +00002358 return DAG.getSetCC(N->getDebugLoc(), N0.getValueType(),
2359 LL, LR, Result);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002360 }
2361 }
Chris Lattner35e5c142006-05-05 05:51:50 +00002362
Bill Wendling2627a882009-01-30 20:43:18 +00002363 // Simplify: (and (op x...), (op y...)) -> (op (and x, y))
Chris Lattner35e5c142006-05-05 05:51:50 +00002364 if (N0.getOpcode() == N1.getOpcode()) {
Dan Gohman475871a2008-07-27 21:46:04 +00002365 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002366 if (Tmp.getNode()) return Tmp;
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002367 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002368
Nate Begemande996292006-02-03 22:24:05 +00002369 // fold (and (sign_extend_inreg x, i16 to i32), 1) -> (and x, 1)
2370 // fold (and (sra)) -> (and (srl)) when possible.
Duncan Sands83ec4b62008-06-06 12:08:01 +00002371 if (!VT.isVector() &&
Dan Gohman475871a2008-07-27 21:46:04 +00002372 SimplifyDemandedBits(SDValue(N, 0)))
2373 return SDValue(N, 0);
Evan Chengd40d03e2010-01-06 19:38:29 +00002374
Nate Begemanded49632005-10-13 03:11:28 +00002375 // fold (zext_inreg (extload x)) -> (zextload x)
Gabor Greifba36cb52008-08-28 21:40:38 +00002376 if (ISD::isEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode())) {
Evan Cheng466685d2006-10-09 20:57:25 +00002377 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman8a55ce42009-09-23 21:02:20 +00002378 EVT MemVT = LN0->getMemoryVT();
Nate Begemanbfd65a02005-10-13 18:34:58 +00002379 // If we zero all the possible extended bits, then we can turn this into
2380 // a zextload if we are running before legalize or the operation is legal.
Dan Gohman6900a392010-03-04 00:23:16 +00002381 unsigned BitWidth = N1.getValueType().getScalarType().getSizeInBits();
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002382 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth,
Dan Gohman6900a392010-03-04 00:23:16 +00002383 BitWidth - MemVT.getScalarType().getSizeInBits())) &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002384 ((!LegalOperations && !LN0->isVolatile()) ||
Dan Gohman8a55ce42009-09-23 21:02:20 +00002385 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT))) {
Stuart Hastingsa9011292011-02-16 16:23:55 +00002386 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, N0.getDebugLoc(), VT,
Bill Wendling2627a882009-01-30 20:43:18 +00002387 LN0->getChain(), LN0->getBasePtr(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00002388 LN0->getPointerInfo(), MemVT,
David Greene1e559442010-02-15 17:00:31 +00002389 LN0->isVolatile(), LN0->isNonTemporal(),
2390 LN0->getAlignment());
Chris Lattner5750df92006-03-01 04:03:14 +00002391 AddToWorkList(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002392 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00002393 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Nate Begemanded49632005-10-13 03:11:28 +00002394 }
2395 }
2396 // fold (zext_inreg (sextload x)) -> (zextload x) iff load has one use
Gabor Greifba36cb52008-08-28 21:40:38 +00002397 if (ISD::isSEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
Evan Cheng83060c52007-03-07 08:07:03 +00002398 N0.hasOneUse()) {
Evan Cheng466685d2006-10-09 20:57:25 +00002399 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman8a55ce42009-09-23 21:02:20 +00002400 EVT MemVT = LN0->getMemoryVT();
Nate Begemanbfd65a02005-10-13 18:34:58 +00002401 // If we zero all the possible extended bits, then we can turn this into
2402 // a zextload if we are running before legalize or the operation is legal.
Dan Gohman6900a392010-03-04 00:23:16 +00002403 unsigned BitWidth = N1.getValueType().getScalarType().getSizeInBits();
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002404 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth,
Dan Gohman6900a392010-03-04 00:23:16 +00002405 BitWidth - MemVT.getScalarType().getSizeInBits())) &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002406 ((!LegalOperations && !LN0->isVolatile()) ||
Dan Gohman8a55ce42009-09-23 21:02:20 +00002407 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT))) {
Stuart Hastingsa9011292011-02-16 16:23:55 +00002408 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, N0.getDebugLoc(), VT,
Bill Wendling2627a882009-01-30 20:43:18 +00002409 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00002410 LN0->getBasePtr(), LN0->getPointerInfo(),
2411 MemVT,
David Greene1e559442010-02-15 17:00:31 +00002412 LN0->isVolatile(), LN0->isNonTemporal(),
2413 LN0->getAlignment());
Chris Lattner5750df92006-03-01 04:03:14 +00002414 AddToWorkList(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002415 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00002416 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Nate Begemanded49632005-10-13 03:11:28 +00002417 }
2418 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002419
Chris Lattner35a9f5a2006-02-28 06:49:37 +00002420 // fold (and (load x), 255) -> (zextload x, i8)
2421 // fold (and (extload x, i16), 255) -> (zextload x, i8)
Evan Chengd40d03e2010-01-06 19:38:29 +00002422 // fold (and (any_ext (extload x, i16)), 255) -> (zextload x, i8)
2423 if (N1C && (N0.getOpcode() == ISD::LOAD ||
2424 (N0.getOpcode() == ISD::ANY_EXTEND &&
2425 N0.getOperand(0).getOpcode() == ISD::LOAD))) {
2426 bool HasAnyExt = N0.getOpcode() == ISD::ANY_EXTEND;
2427 LoadSDNode *LN0 = HasAnyExt
2428 ? cast<LoadSDNode>(N0.getOperand(0))
2429 : cast<LoadSDNode>(N0);
Evan Cheng466685d2006-10-09 20:57:25 +00002430 if (LN0->getExtensionType() != ISD::SEXTLOAD &&
Chris Lattnerbd1fccf2010-01-07 21:59:23 +00002431 LN0->isUnindexed() && N0.hasOneUse() && LN0->hasOneUse()) {
Duncan Sands8eab8a22008-06-09 11:32:28 +00002432 uint32_t ActiveBits = N1C->getAPIntValue().getActiveBits();
Evan Chengd40d03e2010-01-06 19:38:29 +00002433 if (ActiveBits > 0 && APIntOps::isMask(ActiveBits, N1C->getAPIntValue())){
2434 EVT ExtVT = EVT::getIntegerVT(*DAG.getContext(), ActiveBits);
2435 EVT LoadedVT = LN0->getMemoryVT();
Duncan Sands8eab8a22008-06-09 11:32:28 +00002436
Evan Chengd40d03e2010-01-06 19:38:29 +00002437 if (ExtVT == LoadedVT &&
2438 (!LegalOperations || TLI.isLoadExtLegal(ISD::ZEXTLOAD, ExtVT))) {
Chris Lattneref7634c2010-01-07 21:53:27 +00002439 EVT LoadResultTy = HasAnyExt ? LN0->getValueType(0) : VT;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00002440
2441 SDValue NewLoad =
Stuart Hastingsa9011292011-02-16 16:23:55 +00002442 DAG.getExtLoad(ISD::ZEXTLOAD, LN0->getDebugLoc(), LoadResultTy,
Chris Lattneref7634c2010-01-07 21:53:27 +00002443 LN0->getChain(), LN0->getBasePtr(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00002444 LN0->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00002445 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(),
2446 LN0->getAlignment());
Chris Lattneref7634c2010-01-07 21:53:27 +00002447 AddToWorkList(N);
2448 CombineTo(LN0, NewLoad, NewLoad.getValue(1));
2449 return SDValue(N, 0); // Return N so it doesn't get rechecked!
2450 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00002451
Chris Lattneref7634c2010-01-07 21:53:27 +00002452 // Do not change the width of a volatile load.
2453 // Do not generate loads of non-round integer types since these can
2454 // be expensive (and would be wrong if the type is not byte sized).
2455 if (!LN0->isVolatile() && LoadedVT.bitsGT(ExtVT) && ExtVT.isRound() &&
2456 (!LegalOperations || TLI.isLoadExtLegal(ISD::ZEXTLOAD, ExtVT))) {
2457 EVT PtrType = LN0->getOperand(1).getValueType();
Bill Wendling2627a882009-01-30 20:43:18 +00002458
Chris Lattneref7634c2010-01-07 21:53:27 +00002459 unsigned Alignment = LN0->getAlignment();
2460 SDValue NewPtr = LN0->getBasePtr();
2461
2462 // For big endian targets, we need to add an offset to the pointer
2463 // to load the correct bytes. For little endian systems, we merely
2464 // need to read fewer bytes from the same pointer.
2465 if (TLI.isBigEndian()) {
Evan Chengd40d03e2010-01-06 19:38:29 +00002466 unsigned LVTStoreBytes = LoadedVT.getStoreSize();
2467 unsigned EVTStoreBytes = ExtVT.getStoreSize();
2468 unsigned PtrOff = LVTStoreBytes - EVTStoreBytes;
Chris Lattneref7634c2010-01-07 21:53:27 +00002469 NewPtr = DAG.getNode(ISD::ADD, LN0->getDebugLoc(), PtrType,
2470 NewPtr, DAG.getConstant(PtrOff, PtrType));
2471 Alignment = MinAlign(Alignment, PtrOff);
Evan Chengd40d03e2010-01-06 19:38:29 +00002472 }
Chris Lattneref7634c2010-01-07 21:53:27 +00002473
2474 AddToWorkList(NewPtr.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00002475
Chris Lattneref7634c2010-01-07 21:53:27 +00002476 EVT LoadResultTy = HasAnyExt ? LN0->getValueType(0) : VT;
2477 SDValue Load =
Stuart Hastingsa9011292011-02-16 16:23:55 +00002478 DAG.getExtLoad(ISD::ZEXTLOAD, LN0->getDebugLoc(), LoadResultTy,
Chris Lattneref7634c2010-01-07 21:53:27 +00002479 LN0->getChain(), NewPtr,
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00002480 LN0->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00002481 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(),
2482 Alignment);
Chris Lattneref7634c2010-01-07 21:53:27 +00002483 AddToWorkList(N);
2484 CombineTo(LN0, Load, Load.getValue(1));
2485 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Duncan Sandsdc846502007-10-28 12:59:45 +00002486 }
Evan Cheng466685d2006-10-09 20:57:25 +00002487 }
Chris Lattner15045b62006-02-28 06:35:35 +00002488 }
2489 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002490
Evan Chengb3a3d5e2010-04-28 07:10:39 +00002491 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00002492}
2493
Evan Cheng9568e5c2011-06-21 06:01:08 +00002494/// MatchBSwapHWord - Match (a >> 8) | (a << 8) as (bswap a) >> 16
2495///
2496SDValue DAGCombiner::MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
2497 bool DemandHighBits) {
2498 if (!LegalOperations)
2499 return SDValue();
2500
2501 EVT VT = N->getValueType(0);
2502 if (VT != MVT::i64 && VT != MVT::i32 && VT != MVT::i16)
2503 return SDValue();
2504 if (!TLI.isOperationLegal(ISD::BSWAP, VT))
2505 return SDValue();
2506
2507 // Recognize (and (shl a, 8), 0xff), (and (srl a, 8), 0xff00)
2508 bool LookPassAnd0 = false;
2509 bool LookPassAnd1 = false;
2510 if (N0.getOpcode() == ISD::AND && N0.getOperand(0).getOpcode() == ISD::SRL)
2511 std::swap(N0, N1);
2512 if (N1.getOpcode() == ISD::AND && N1.getOperand(0).getOpcode() == ISD::SHL)
2513 std::swap(N0, N1);
2514 if (N0.getOpcode() == ISD::AND) {
2515 if (!N0.getNode()->hasOneUse())
2516 return SDValue();
2517 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
2518 if (!N01C || N01C->getZExtValue() != 0xFF00)
2519 return SDValue();
2520 N0 = N0.getOperand(0);
2521 LookPassAnd0 = true;
2522 }
2523
2524 if (N1.getOpcode() == ISD::AND) {
2525 if (!N1.getNode()->hasOneUse())
2526 return SDValue();
2527 ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
2528 if (!N11C || N11C->getZExtValue() != 0xFF)
2529 return SDValue();
2530 N1 = N1.getOperand(0);
2531 LookPassAnd1 = true;
2532 }
2533
2534 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
2535 std::swap(N0, N1);
2536 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
2537 return SDValue();
2538 if (!N0.getNode()->hasOneUse() ||
2539 !N1.getNode()->hasOneUse())
2540 return SDValue();
2541
2542 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
2543 ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
2544 if (!N01C || !N11C)
2545 return SDValue();
2546 if (N01C->getZExtValue() != 8 || N11C->getZExtValue() != 8)
2547 return SDValue();
2548
2549 // Look for (shl (and a, 0xff), 8), (srl (and a, 0xff00), 8)
2550 SDValue N00 = N0->getOperand(0);
2551 if (!LookPassAnd0 && N00.getOpcode() == ISD::AND) {
2552 if (!N00.getNode()->hasOneUse())
2553 return SDValue();
2554 ConstantSDNode *N001C = dyn_cast<ConstantSDNode>(N00.getOperand(1));
2555 if (!N001C || N001C->getZExtValue() != 0xFF)
2556 return SDValue();
2557 N00 = N00.getOperand(0);
2558 LookPassAnd0 = true;
2559 }
2560
2561 SDValue N10 = N1->getOperand(0);
2562 if (!LookPassAnd1 && N10.getOpcode() == ISD::AND) {
2563 if (!N10.getNode()->hasOneUse())
2564 return SDValue();
2565 ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N10.getOperand(1));
2566 if (!N101C || N101C->getZExtValue() != 0xFF00)
2567 return SDValue();
2568 N10 = N10.getOperand(0);
2569 LookPassAnd1 = true;
2570 }
2571
2572 if (N00 != N10)
2573 return SDValue();
2574
2575 // Make sure everything beyond the low halfword is zero since the SRL 16
2576 // will clear the top bits.
2577 unsigned OpSizeInBits = VT.getSizeInBits();
2578 if (DemandHighBits && OpSizeInBits > 16 &&
2579 (!LookPassAnd0 || !LookPassAnd1) &&
2580 !DAG.MaskedValueIsZero(N10, APInt::getHighBitsSet(OpSizeInBits, 16)))
2581 return SDValue();
Eric Christopher7332e6e2011-07-14 01:12:15 +00002582
Evan Cheng9568e5c2011-06-21 06:01:08 +00002583 SDValue Res = DAG.getNode(ISD::BSWAP, N->getDebugLoc(), VT, N00);
2584 if (OpSizeInBits > 16)
2585 Res = DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, Res,
2586 DAG.getConstant(OpSizeInBits-16, getShiftAmountTy(VT)));
2587 return Res;
2588}
2589
2590/// isBSwapHWordElement - Return true if the specified node is an element
2591/// that makes up a 32-bit packed halfword byteswap. i.e.
2592/// ((x&0xff)<<8)|((x&0xff00)>>8)|((x&0x00ff0000)<<8)|((x&0xff000000)>>8)
2593static bool isBSwapHWordElement(SDValue N, SmallVector<SDNode*,4> &Parts) {
2594 if (!N.getNode()->hasOneUse())
2595 return false;
2596
2597 unsigned Opc = N.getOpcode();
2598 if (Opc != ISD::AND && Opc != ISD::SHL && Opc != ISD::SRL)
2599 return false;
2600
2601 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N.getOperand(1));
2602 if (!N1C)
2603 return false;
2604
2605 unsigned Num;
2606 switch (N1C->getZExtValue()) {
2607 default:
2608 return false;
2609 case 0xFF: Num = 0; break;
2610 case 0xFF00: Num = 1; break;
2611 case 0xFF0000: Num = 2; break;
2612 case 0xFF000000: Num = 3; break;
2613 }
2614
2615 // Look for (x & 0xff) << 8 as well as ((x << 8) & 0xff00).
2616 SDValue N0 = N.getOperand(0);
2617 if (Opc == ISD::AND) {
2618 if (Num == 0 || Num == 2) {
2619 // (x >> 8) & 0xff
2620 // (x >> 8) & 0xff0000
2621 if (N0.getOpcode() != ISD::SRL)
2622 return false;
2623 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
2624 if (!C || C->getZExtValue() != 8)
2625 return false;
2626 } else {
2627 // (x << 8) & 0xff00
2628 // (x << 8) & 0xff000000
2629 if (N0.getOpcode() != ISD::SHL)
2630 return false;
2631 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
2632 if (!C || C->getZExtValue() != 8)
2633 return false;
2634 }
2635 } else if (Opc == ISD::SHL) {
2636 // (x & 0xff) << 8
2637 // (x & 0xff0000) << 8
2638 if (Num != 0 && Num != 2)
2639 return false;
2640 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N.getOperand(1));
2641 if (!C || C->getZExtValue() != 8)
2642 return false;
2643 } else { // Opc == ISD::SRL
2644 // (x & 0xff00) >> 8
2645 // (x & 0xff000000) >> 8
2646 if (Num != 1 && Num != 3)
2647 return false;
2648 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N.getOperand(1));
2649 if (!C || C->getZExtValue() != 8)
2650 return false;
2651 }
2652
2653 if (Parts[Num])
2654 return false;
2655
2656 Parts[Num] = N0.getOperand(0).getNode();
2657 return true;
2658}
2659
2660/// MatchBSwapHWord - Match a 32-bit packed halfword bswap. That is
2661/// ((x&0xff)<<8)|((x&0xff00)>>8)|((x&0x00ff0000)<<8)|((x&0xff000000)>>8)
2662/// => (rotl (bswap x), 16)
2663SDValue DAGCombiner::MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1) {
2664 if (!LegalOperations)
2665 return SDValue();
2666
2667 EVT VT = N->getValueType(0);
2668 if (VT != MVT::i32)
2669 return SDValue();
2670 if (!TLI.isOperationLegal(ISD::BSWAP, VT))
2671 return SDValue();
2672
2673 SmallVector<SDNode*,4> Parts(4, (SDNode*)0);
2674 // Look for either
2675 // (or (or (and), (and)), (or (and), (and)))
2676 // (or (or (or (and), (and)), (and)), (and))
2677 if (N0.getOpcode() != ISD::OR)
2678 return SDValue();
2679 SDValue N00 = N0.getOperand(0);
2680 SDValue N01 = N0.getOperand(1);
2681
2682 if (N1.getOpcode() == ISD::OR) {
2683 // (or (or (and), (and)), (or (and), (and)))
2684 SDValue N000 = N00.getOperand(0);
2685 if (!isBSwapHWordElement(N000, Parts))
2686 return SDValue();
2687
2688 SDValue N001 = N00.getOperand(1);
2689 if (!isBSwapHWordElement(N001, Parts))
2690 return SDValue();
2691 SDValue N010 = N01.getOperand(0);
2692 if (!isBSwapHWordElement(N010, Parts))
2693 return SDValue();
2694 SDValue N011 = N01.getOperand(1);
2695 if (!isBSwapHWordElement(N011, Parts))
2696 return SDValue();
2697 } else {
2698 // (or (or (or (and), (and)), (and)), (and))
2699 if (!isBSwapHWordElement(N1, Parts))
2700 return SDValue();
2701 if (!isBSwapHWordElement(N01, Parts))
2702 return SDValue();
2703 if (N00.getOpcode() != ISD::OR)
2704 return SDValue();
2705 SDValue N000 = N00.getOperand(0);
2706 if (!isBSwapHWordElement(N000, Parts))
2707 return SDValue();
2708 SDValue N001 = N00.getOperand(1);
2709 if (!isBSwapHWordElement(N001, Parts))
2710 return SDValue();
2711 }
2712
2713 // Make sure the parts are all coming from the same node.
2714 if (Parts[0] != Parts[1] || Parts[0] != Parts[2] || Parts[0] != Parts[3])
2715 return SDValue();
2716
2717 SDValue BSwap = DAG.getNode(ISD::BSWAP, N->getDebugLoc(), VT,
2718 SDValue(Parts[0],0));
2719
2720 // Result of the bswap should be rotated by 16. If it's not legal, than
2721 // do (x << 16) | (x >> 16).
2722 SDValue ShAmt = DAG.getConstant(16, getShiftAmountTy(VT));
2723 if (TLI.isOperationLegalOrCustom(ISD::ROTL, VT))
2724 return DAG.getNode(ISD::ROTL, N->getDebugLoc(), VT, BSwap, ShAmt);
2725 else if (TLI.isOperationLegalOrCustom(ISD::ROTR, VT))
2726 return DAG.getNode(ISD::ROTR, N->getDebugLoc(), VT, BSwap, ShAmt);
2727 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT,
2728 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, BSwap, ShAmt),
2729 DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, BSwap, ShAmt));
2730}
2731
Dan Gohman475871a2008-07-27 21:46:04 +00002732SDValue DAGCombiner::visitOR(SDNode *N) {
2733 SDValue N0 = N->getOperand(0);
2734 SDValue N1 = N->getOperand(1);
2735 SDValue LL, LR, RL, RR, CC0, CC1;
Nate Begeman646d7e22005-09-02 21:18:40 +00002736 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
2737 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00002738 EVT VT = N1.getValueType();
Scott Michelfdc40a02009-02-17 22:15:04 +00002739
Dan Gohman7f321562007-06-25 16:23:39 +00002740 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00002741 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00002742 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002743 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00002744 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002745
Dan Gohman613e0d82007-07-03 14:03:57 +00002746 // fold (or x, undef) -> -1
Bob Wilson86749492010-06-28 23:40:25 +00002747 if (!LegalOperations &&
2748 (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)) {
Nate Begeman93e0ed32009-12-03 07:11:29 +00002749 EVT EltVT = VT.isVector() ? VT.getVectorElementType() : VT;
2750 return DAG.getConstant(APInt::getAllOnesValue(EltVT.getSizeInBits()), VT);
2751 }
Nate Begeman1d4d4142005-09-01 00:19:25 +00002752 // fold (or c1, c2) -> c1|c2
Nate Begeman646d7e22005-09-02 21:18:40 +00002753 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00002754 return DAG.FoldConstantArithmetic(ISD::OR, VT, N0C, N1C);
Nate Begeman99801192005-09-07 23:25:52 +00002755 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00002756 if (N0C && !N1C)
Bill Wendling09025642009-01-30 20:59:34 +00002757 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N1, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00002758 // fold (or x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00002759 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00002760 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00002761 // fold (or x, -1) -> -1
Nate Begeman646d7e22005-09-02 21:18:40 +00002762 if (N1C && N1C->isAllOnesValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00002763 return N1;
2764 // fold (or x, c) -> c iff (x & ~c) == 0
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002765 if (N1C && DAG.MaskedValueIsZero(N0, ~N1C->getAPIntValue()))
Nate Begeman83e75ec2005-09-06 04:43:02 +00002766 return N1;
Evan Cheng9568e5c2011-06-21 06:01:08 +00002767
2768 // Recognize halfword bswaps as (bswap + rotl 16) or (bswap + shl 16)
2769 SDValue BSwap = MatchBSwapHWord(N, N0, N1);
2770 if (BSwap.getNode() != 0)
2771 return BSwap;
2772 BSwap = MatchBSwapHWordLow(N, N0, N1);
2773 if (BSwap.getNode() != 0)
2774 return BSwap;
2775
Nate Begemancd4d58c2006-02-03 06:46:56 +00002776 // reassociate or
Bill Wendling35247c32009-01-30 00:45:56 +00002777 SDValue ROR = ReassociateOps(ISD::OR, N->getDebugLoc(), N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00002778 if (ROR.getNode() != 0)
Nate Begemancd4d58c2006-02-03 06:46:56 +00002779 return ROR;
2780 // Canonicalize (or (and X, c1), c2) -> (and (or X, c2), c1|c2)
Bill Wendling7d9f2b92010-03-03 00:35:56 +00002781 // iff (c1 & c2) == 0.
Gabor Greifba36cb52008-08-28 21:40:38 +00002782 if (N1C && N0.getOpcode() == ISD::AND && N0.getNode()->hasOneUse() &&
Chris Lattner731d3482005-10-27 05:06:38 +00002783 isa<ConstantSDNode>(N0.getOperand(1))) {
Chris Lattner731d3482005-10-27 05:06:38 +00002784 ConstantSDNode *C1 = cast<ConstantSDNode>(N0.getOperand(1));
Bill Wendling32f9eb22010-03-03 01:58:01 +00002785 if ((C1->getAPIntValue() & N1C->getAPIntValue()) != 0)
Bill Wendling7d9f2b92010-03-03 00:35:56 +00002786 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
2787 DAG.getNode(ISD::OR, N0.getDebugLoc(), VT,
2788 N0.getOperand(0), N1),
2789 DAG.FoldConstantArithmetic(ISD::OR, VT, N1C, C1));
Nate Begeman223df222005-09-08 20:18:10 +00002790 }
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002791 // fold (or (setcc x), (setcc y)) -> (setcc (or x, y))
2792 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
2793 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
2794 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
Scott Michelfdc40a02009-02-17 22:15:04 +00002795
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002796 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00002797 LL.getValueType().isInteger()) {
Bill Wendling09025642009-01-30 20:59:34 +00002798 // fold (or (setne X, 0), (setne Y, 0)) -> (setne (or X, Y), 0)
2799 // fold (or (setlt X, 0), (setlt Y, 0)) -> (setne (or X, Y), 0)
Scott Michelfdc40a02009-02-17 22:15:04 +00002800 if (cast<ConstantSDNode>(LR)->isNullValue() &&
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002801 (Op1 == ISD::SETNE || Op1 == ISD::SETLT)) {
Bill Wendling09025642009-01-30 20:59:34 +00002802 SDValue ORNode = DAG.getNode(ISD::OR, LR.getDebugLoc(),
2803 LR.getValueType(), LL, RL);
Gabor Greifba36cb52008-08-28 21:40:38 +00002804 AddToWorkList(ORNode.getNode());
Bill Wendling09025642009-01-30 20:59:34 +00002805 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002806 }
Bill Wendling09025642009-01-30 20:59:34 +00002807 // fold (or (setne X, -1), (setne Y, -1)) -> (setne (and X, Y), -1)
2808 // fold (or (setgt X, -1), (setgt Y -1)) -> (setgt (and X, Y), -1)
Scott Michelfdc40a02009-02-17 22:15:04 +00002809 if (cast<ConstantSDNode>(LR)->isAllOnesValue() &&
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002810 (Op1 == ISD::SETNE || Op1 == ISD::SETGT)) {
Bill Wendling09025642009-01-30 20:59:34 +00002811 SDValue ANDNode = DAG.getNode(ISD::AND, LR.getDebugLoc(),
2812 LR.getValueType(), LL, RL);
Gabor Greifba36cb52008-08-28 21:40:38 +00002813 AddToWorkList(ANDNode.getNode());
Bill Wendling09025642009-01-30 20:59:34 +00002814 return DAG.getSetCC(N->getDebugLoc(), VT, ANDNode, LR, Op1);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002815 }
2816 }
2817 // canonicalize equivalent to ll == rl
2818 if (LL == RR && LR == RL) {
2819 Op1 = ISD::getSetCCSwappedOperands(Op1);
2820 std::swap(RL, RR);
2821 }
2822 if (LL == RL && LR == RR) {
Duncan Sands83ec4b62008-06-06 12:08:01 +00002823 bool isInteger = LL.getValueType().isInteger();
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002824 ISD::CondCode Result = ISD::getSetCCOrOperation(Op0, Op1, isInteger);
Chris Lattner6e1c6232008-10-28 07:11:07 +00002825 if (Result != ISD::SETCC_INVALID &&
Duncan Sands25cf2272008-11-24 14:53:14 +00002826 (!LegalOperations || TLI.isCondCodeLegal(Result, LL.getValueType())))
Bill Wendling09025642009-01-30 20:59:34 +00002827 return DAG.getSetCC(N->getDebugLoc(), N0.getValueType(),
2828 LL, LR, Result);
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002829 }
2830 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002831
Bill Wendling09025642009-01-30 20:59:34 +00002832 // Simplify: (or (op x...), (op y...)) -> (op (or x, y))
Chris Lattner35e5c142006-05-05 05:51:50 +00002833 if (N0.getOpcode() == N1.getOpcode()) {
Dan Gohman475871a2008-07-27 21:46:04 +00002834 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00002835 if (Tmp.getNode()) return Tmp;
Nate Begeman39ee1ac2005-09-09 19:49:52 +00002836 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002837
Bill Wendling09025642009-01-30 20:59:34 +00002838 // (or (and X, C1), (and Y, C2)) -> (and (or X, Y), C3) if possible.
Chris Lattner1ec72732006-09-14 21:11:37 +00002839 if (N0.getOpcode() == ISD::AND &&
2840 N1.getOpcode() == ISD::AND &&
2841 N0.getOperand(1).getOpcode() == ISD::Constant &&
2842 N1.getOperand(1).getOpcode() == ISD::Constant &&
2843 // Don't increase # computations.
Gabor Greifba36cb52008-08-28 21:40:38 +00002844 (N0.getNode()->hasOneUse() || N1.getNode()->hasOneUse())) {
Chris Lattner1ec72732006-09-14 21:11:37 +00002845 // We can only do this xform if we know that bits from X that are set in C2
2846 // but not in C1 are already zero. Likewise for Y.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00002847 const APInt &LHSMask =
2848 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
2849 const APInt &RHSMask =
2850 cast<ConstantSDNode>(N1.getOperand(1))->getAPIntValue();
Scott Michelfdc40a02009-02-17 22:15:04 +00002851
Dan Gohmanea859be2007-06-22 14:59:07 +00002852 if (DAG.MaskedValueIsZero(N0.getOperand(0), RHSMask&~LHSMask) &&
2853 DAG.MaskedValueIsZero(N1.getOperand(0), LHSMask&~RHSMask)) {
Bill Wendling09025642009-01-30 20:59:34 +00002854 SDValue X = DAG.getNode(ISD::OR, N0.getDebugLoc(), VT,
2855 N0.getOperand(0), N1.getOperand(0));
2856 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, X,
2857 DAG.getConstant(LHSMask | RHSMask, VT));
Chris Lattner1ec72732006-09-14 21:11:37 +00002858 }
2859 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002860
Chris Lattner516b9622006-09-14 20:50:57 +00002861 // See if this is some rotate idiom.
Bill Wendling317bd702009-01-30 21:14:50 +00002862 if (SDNode *Rot = MatchRotate(N0, N1, N->getDebugLoc()))
Dan Gohman475871a2008-07-27 21:46:04 +00002863 return SDValue(Rot, 0);
Chris Lattner35e5c142006-05-05 05:51:50 +00002864
Dan Gohman4e39e9d2010-06-24 14:30:44 +00002865 // Simplify the operands using demanded-bits information.
2866 if (!VT.isVector() &&
2867 SimplifyDemandedBits(SDValue(N, 0)))
2868 return SDValue(N, 0);
2869
Evan Chengb3a3d5e2010-04-28 07:10:39 +00002870 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00002871}
2872
Chris Lattner516b9622006-09-14 20:50:57 +00002873/// MatchRotateHalf - Match "(X shl/srl V1) & V2" where V2 may not be present.
Dan Gohman475871a2008-07-27 21:46:04 +00002874static bool MatchRotateHalf(SDValue Op, SDValue &Shift, SDValue &Mask) {
Chris Lattner516b9622006-09-14 20:50:57 +00002875 if (Op.getOpcode() == ISD::AND) {
Reid Spencer3ed469c2006-11-02 20:25:50 +00002876 if (isa<ConstantSDNode>(Op.getOperand(1))) {
Chris Lattner516b9622006-09-14 20:50:57 +00002877 Mask = Op.getOperand(1);
2878 Op = Op.getOperand(0);
2879 } else {
2880 return false;
2881 }
2882 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002883
Chris Lattner516b9622006-09-14 20:50:57 +00002884 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SHL) {
2885 Shift = Op;
2886 return true;
2887 }
Bill Wendling09025642009-01-30 20:59:34 +00002888
Scott Michelfdc40a02009-02-17 22:15:04 +00002889 return false;
Chris Lattner516b9622006-09-14 20:50:57 +00002890}
2891
Chris Lattner516b9622006-09-14 20:50:57 +00002892// MatchRotate - Handle an 'or' of two operands. If this is one of the many
2893// idioms for rotate, and if the target supports rotation instructions, generate
2894// a rot[lr].
Bill Wendling317bd702009-01-30 21:14:50 +00002895SDNode *DAGCombiner::MatchRotate(SDValue LHS, SDValue RHS, DebugLoc DL) {
Duncan Sandsd4b9c172008-06-13 19:07:40 +00002896 // Must be a legal type. Expanded 'n promoted things won't work with rotates.
Owen Andersone50ed302009-08-10 22:56:29 +00002897 EVT VT = LHS.getValueType();
Chris Lattner516b9622006-09-14 20:50:57 +00002898 if (!TLI.isTypeLegal(VT)) return 0;
2899
2900 // The target must have at least one rotate flavor.
Dan Gohmanf560ffa2009-01-28 17:46:25 +00002901 bool HasROTL = TLI.isOperationLegalOrCustom(ISD::ROTL, VT);
2902 bool HasROTR = TLI.isOperationLegalOrCustom(ISD::ROTR, VT);
Chris Lattner516b9622006-09-14 20:50:57 +00002903 if (!HasROTL && !HasROTR) return 0;
Duncan Sandsd4b9c172008-06-13 19:07:40 +00002904
Chris Lattner516b9622006-09-14 20:50:57 +00002905 // Match "(X shl/srl V1) & V2" where V2 may not be present.
Dan Gohman475871a2008-07-27 21:46:04 +00002906 SDValue LHSShift; // The shift.
2907 SDValue LHSMask; // AND value if any.
Chris Lattner516b9622006-09-14 20:50:57 +00002908 if (!MatchRotateHalf(LHS, LHSShift, LHSMask))
2909 return 0; // Not part of a rotate.
2910
Dan Gohman475871a2008-07-27 21:46:04 +00002911 SDValue RHSShift; // The shift.
2912 SDValue RHSMask; // AND value if any.
Chris Lattner516b9622006-09-14 20:50:57 +00002913 if (!MatchRotateHalf(RHS, RHSShift, RHSMask))
2914 return 0; // Not part of a rotate.
Scott Michelfdc40a02009-02-17 22:15:04 +00002915
Chris Lattner516b9622006-09-14 20:50:57 +00002916 if (LHSShift.getOperand(0) != RHSShift.getOperand(0))
2917 return 0; // Not shifting the same value.
2918
2919 if (LHSShift.getOpcode() == RHSShift.getOpcode())
2920 return 0; // Shifts must disagree.
Scott Michelfdc40a02009-02-17 22:15:04 +00002921
Chris Lattner516b9622006-09-14 20:50:57 +00002922 // Canonicalize shl to left side in a shl/srl pair.
2923 if (RHSShift.getOpcode() == ISD::SHL) {
2924 std::swap(LHS, RHS);
2925 std::swap(LHSShift, RHSShift);
2926 std::swap(LHSMask , RHSMask );
2927 }
2928
Duncan Sands83ec4b62008-06-06 12:08:01 +00002929 unsigned OpSizeInBits = VT.getSizeInBits();
Dan Gohman475871a2008-07-27 21:46:04 +00002930 SDValue LHSShiftArg = LHSShift.getOperand(0);
2931 SDValue LHSShiftAmt = LHSShift.getOperand(1);
2932 SDValue RHSShiftAmt = RHSShift.getOperand(1);
Chris Lattner516b9622006-09-14 20:50:57 +00002933
2934 // fold (or (shl x, C1), (srl x, C2)) -> (rotl x, C1)
2935 // fold (or (shl x, C1), (srl x, C2)) -> (rotr x, C2)
Scott Michelc9dc1142007-04-02 21:36:32 +00002936 if (LHSShiftAmt.getOpcode() == ISD::Constant &&
2937 RHSShiftAmt.getOpcode() == ISD::Constant) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00002938 uint64_t LShVal = cast<ConstantSDNode>(LHSShiftAmt)->getZExtValue();
2939 uint64_t RShVal = cast<ConstantSDNode>(RHSShiftAmt)->getZExtValue();
Chris Lattner516b9622006-09-14 20:50:57 +00002940 if ((LShVal + RShVal) != OpSizeInBits)
2941 return 0;
2942
Dan Gohman475871a2008-07-27 21:46:04 +00002943 SDValue Rot;
Chris Lattner516b9622006-09-14 20:50:57 +00002944 if (HasROTL)
Bill Wendling317bd702009-01-30 21:14:50 +00002945 Rot = DAG.getNode(ISD::ROTL, DL, VT, LHSShiftArg, LHSShiftAmt);
Chris Lattner516b9622006-09-14 20:50:57 +00002946 else
Bill Wendling317bd702009-01-30 21:14:50 +00002947 Rot = DAG.getNode(ISD::ROTR, DL, VT, LHSShiftArg, RHSShiftAmt);
Scott Michelfdc40a02009-02-17 22:15:04 +00002948
Chris Lattner516b9622006-09-14 20:50:57 +00002949 // If there is an AND of either shifted operand, apply it to the result.
Gabor Greifba36cb52008-08-28 21:40:38 +00002950 if (LHSMask.getNode() || RHSMask.getNode()) {
Dan Gohman220a8232008-03-03 23:51:38 +00002951 APInt Mask = APInt::getAllOnesValue(OpSizeInBits);
Scott Michelfdc40a02009-02-17 22:15:04 +00002952
Gabor Greifba36cb52008-08-28 21:40:38 +00002953 if (LHSMask.getNode()) {
Dan Gohman220a8232008-03-03 23:51:38 +00002954 APInt RHSBits = APInt::getLowBitsSet(OpSizeInBits, LShVal);
2955 Mask &= cast<ConstantSDNode>(LHSMask)->getAPIntValue() | RHSBits;
Chris Lattner516b9622006-09-14 20:50:57 +00002956 }
Gabor Greifba36cb52008-08-28 21:40:38 +00002957 if (RHSMask.getNode()) {
Dan Gohman220a8232008-03-03 23:51:38 +00002958 APInt LHSBits = APInt::getHighBitsSet(OpSizeInBits, RShVal);
2959 Mask &= cast<ConstantSDNode>(RHSMask)->getAPIntValue() | LHSBits;
Chris Lattner516b9622006-09-14 20:50:57 +00002960 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002961
Bill Wendling317bd702009-01-30 21:14:50 +00002962 Rot = DAG.getNode(ISD::AND, DL, VT, Rot, DAG.getConstant(Mask, VT));
Chris Lattner516b9622006-09-14 20:50:57 +00002963 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002964
Gabor Greifba36cb52008-08-28 21:40:38 +00002965 return Rot.getNode();
Chris Lattner516b9622006-09-14 20:50:57 +00002966 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002967
Chris Lattner516b9622006-09-14 20:50:57 +00002968 // If there is a mask here, and we have a variable shift, we can't be sure
2969 // that we're masking out the right stuff.
Gabor Greifba36cb52008-08-28 21:40:38 +00002970 if (LHSMask.getNode() || RHSMask.getNode())
Chris Lattner516b9622006-09-14 20:50:57 +00002971 return 0;
Scott Michelfdc40a02009-02-17 22:15:04 +00002972
Chris Lattner516b9622006-09-14 20:50:57 +00002973 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotl x, y)
2974 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotr x, (sub 32, y))
Scott Michelc9dc1142007-04-02 21:36:32 +00002975 if (RHSShiftAmt.getOpcode() == ISD::SUB &&
2976 LHSShiftAmt == RHSShiftAmt.getOperand(1)) {
Scott Michelfdc40a02009-02-17 22:15:04 +00002977 if (ConstantSDNode *SUBC =
Scott Michelc9dc1142007-04-02 21:36:32 +00002978 dyn_cast<ConstantSDNode>(RHSShiftAmt.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00002979 if (SUBC->getAPIntValue() == OpSizeInBits) {
Chris Lattner516b9622006-09-14 20:50:57 +00002980 if (HasROTL)
Bill Wendling317bd702009-01-30 21:14:50 +00002981 return DAG.getNode(ISD::ROTL, DL, VT,
2982 LHSShiftArg, LHSShiftAmt).getNode();
Chris Lattner516b9622006-09-14 20:50:57 +00002983 else
Bill Wendling317bd702009-01-30 21:14:50 +00002984 return DAG.getNode(ISD::ROTR, DL, VT,
2985 LHSShiftArg, RHSShiftAmt).getNode();
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00002986 }
Chris Lattner516b9622006-09-14 20:50:57 +00002987 }
2988 }
Scott Michelfdc40a02009-02-17 22:15:04 +00002989
Chris Lattner516b9622006-09-14 20:50:57 +00002990 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotr x, y)
2991 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotl x, (sub 32, y))
Scott Michelc9dc1142007-04-02 21:36:32 +00002992 if (LHSShiftAmt.getOpcode() == ISD::SUB &&
2993 RHSShiftAmt == LHSShiftAmt.getOperand(1)) {
Scott Michelfdc40a02009-02-17 22:15:04 +00002994 if (ConstantSDNode *SUBC =
Scott Michelc9dc1142007-04-02 21:36:32 +00002995 dyn_cast<ConstantSDNode>(LHSShiftAmt.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00002996 if (SUBC->getAPIntValue() == OpSizeInBits) {
Bill Wendling2692d592008-08-31 01:13:31 +00002997 if (HasROTR)
Bill Wendling317bd702009-01-30 21:14:50 +00002998 return DAG.getNode(ISD::ROTR, DL, VT,
2999 LHSShiftArg, RHSShiftAmt).getNode();
Bill Wendling2692d592008-08-31 01:13:31 +00003000 else
Bill Wendling317bd702009-01-30 21:14:50 +00003001 return DAG.getNode(ISD::ROTL, DL, VT,
3002 LHSShiftArg, LHSShiftAmt).getNode();
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00003003 }
Scott Michelc9dc1142007-04-02 21:36:32 +00003004 }
3005 }
3006
Dan Gohman74feef22008-10-17 01:23:35 +00003007 // Look for sign/zext/any-extended or truncate cases:
Scott Michelc9dc1142007-04-02 21:36:32 +00003008 if ((LHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND
3009 || LHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND
Dan Gohman74feef22008-10-17 01:23:35 +00003010 || LHSShiftAmt.getOpcode() == ISD::ANY_EXTEND
3011 || LHSShiftAmt.getOpcode() == ISD::TRUNCATE) &&
Scott Michelc9dc1142007-04-02 21:36:32 +00003012 (RHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND
3013 || RHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND
Dan Gohman74feef22008-10-17 01:23:35 +00003014 || RHSShiftAmt.getOpcode() == ISD::ANY_EXTEND
3015 || RHSShiftAmt.getOpcode() == ISD::TRUNCATE)) {
Dan Gohman475871a2008-07-27 21:46:04 +00003016 SDValue LExtOp0 = LHSShiftAmt.getOperand(0);
3017 SDValue RExtOp0 = RHSShiftAmt.getOperand(0);
Scott Michelc9dc1142007-04-02 21:36:32 +00003018 if (RExtOp0.getOpcode() == ISD::SUB &&
3019 RExtOp0.getOperand(1) == LExtOp0) {
3020 // fold (or (shl x, (*ext y)), (srl x, (*ext (sub 32, y)))) ->
Bill Wendlingc5cbda12008-08-31 00:37:27 +00003021 // (rotl x, y)
Scott Michelc9dc1142007-04-02 21:36:32 +00003022 // fold (or (shl x, (*ext y)), (srl x, (*ext (sub 32, y)))) ->
Bill Wendlingc5cbda12008-08-31 00:37:27 +00003023 // (rotr x, (sub 32, y))
Dan Gohman74feef22008-10-17 01:23:35 +00003024 if (ConstantSDNode *SUBC =
3025 dyn_cast<ConstantSDNode>(RExtOp0.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00003026 if (SUBC->getAPIntValue() == OpSizeInBits) {
Bill Wendling317bd702009-01-30 21:14:50 +00003027 return DAG.getNode(HasROTL ? ISD::ROTL : ISD::ROTR, DL, VT,
3028 LHSShiftArg,
Gabor Greif12632d22008-08-30 19:29:20 +00003029 HasROTL ? LHSShiftAmt : RHSShiftAmt).getNode();
Scott Michelc9dc1142007-04-02 21:36:32 +00003030 }
3031 }
3032 } else if (LExtOp0.getOpcode() == ISD::SUB &&
3033 RExtOp0 == LExtOp0.getOperand(1)) {
Scott Michelfdc40a02009-02-17 22:15:04 +00003034 // fold (or (shl x, (*ext (sub 32, y))), (srl x, (*ext y))) ->
Bill Wendlingc5cbda12008-08-31 00:37:27 +00003035 // (rotr x, y)
Bill Wendling353dea22008-08-31 01:04:56 +00003036 // fold (or (shl x, (*ext (sub 32, y))), (srl x, (*ext y))) ->
Bill Wendlingc5cbda12008-08-31 00:37:27 +00003037 // (rotl x, (sub 32, y))
Dan Gohman74feef22008-10-17 01:23:35 +00003038 if (ConstantSDNode *SUBC =
3039 dyn_cast<ConstantSDNode>(LExtOp0.getOperand(0))) {
Dan Gohman002e5d02008-03-13 22:13:53 +00003040 if (SUBC->getAPIntValue() == OpSizeInBits) {
Bill Wendling317bd702009-01-30 21:14:50 +00003041 return DAG.getNode(HasROTR ? ISD::ROTR : ISD::ROTL, DL, VT,
3042 LHSShiftArg,
Bill Wendling353dea22008-08-31 01:04:56 +00003043 HasROTR ? RHSShiftAmt : LHSShiftAmt).getNode();
Scott Michelc9dc1142007-04-02 21:36:32 +00003044 }
3045 }
Chris Lattner516b9622006-09-14 20:50:57 +00003046 }
3047 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003048
Chris Lattner516b9622006-09-14 20:50:57 +00003049 return 0;
3050}
3051
Dan Gohman475871a2008-07-27 21:46:04 +00003052SDValue DAGCombiner::visitXOR(SDNode *N) {
3053 SDValue N0 = N->getOperand(0);
3054 SDValue N1 = N->getOperand(1);
3055 SDValue LHS, RHS, CC;
Nate Begeman646d7e22005-09-02 21:18:40 +00003056 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
3057 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00003058 EVT VT = N0.getValueType();
Scott Michelfdc40a02009-02-17 22:15:04 +00003059
Dan Gohman7f321562007-06-25 16:23:39 +00003060 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00003061 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00003062 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00003063 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00003064 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003065
Evan Cheng26471c42008-03-25 20:08:07 +00003066 // fold (xor undef, undef) -> 0. This is a common idiom (misuse).
3067 if (N0.getOpcode() == ISD::UNDEF && N1.getOpcode() == ISD::UNDEF)
3068 return DAG.getConstant(0, VT);
Dan Gohman613e0d82007-07-03 14:03:57 +00003069 // fold (xor x, undef) -> undef
Dan Gohman70fb1ae2007-07-10 15:19:29 +00003070 if (N0.getOpcode() == ISD::UNDEF)
3071 return N0;
3072 if (N1.getOpcode() == ISD::UNDEF)
Dan Gohman613e0d82007-07-03 14:03:57 +00003073 return N1;
Nate Begeman1d4d4142005-09-01 00:19:25 +00003074 // fold (xor c1, c2) -> c1^c2
Nate Begeman646d7e22005-09-02 21:18:40 +00003075 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00003076 return DAG.FoldConstantArithmetic(ISD::XOR, VT, N0C, N1C);
Nate Begeman99801192005-09-07 23:25:52 +00003077 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00003078 if (N0C && !N1C)
Bill Wendling317bd702009-01-30 21:14:50 +00003079 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N1, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003080 // fold (xor x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00003081 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003082 return N0;
Nate Begemancd4d58c2006-02-03 06:46:56 +00003083 // reassociate xor
Bill Wendling35247c32009-01-30 00:45:56 +00003084 SDValue RXOR = ReassociateOps(ISD::XOR, N->getDebugLoc(), N0, N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00003085 if (RXOR.getNode() != 0)
Nate Begemancd4d58c2006-02-03 06:46:56 +00003086 return RXOR;
Bill Wendlingae89bb12008-11-11 08:25:46 +00003087
Nate Begeman1d4d4142005-09-01 00:19:25 +00003088 // fold !(x cc y) -> (x !cc y)
Dan Gohman002e5d02008-03-13 22:13:53 +00003089 if (N1C && N1C->getAPIntValue() == 1 && isSetCCEquivalent(N0, LHS, RHS, CC)) {
Duncan Sands83ec4b62008-06-06 12:08:01 +00003090 bool isInt = LHS.getValueType().isInteger();
Nate Begeman646d7e22005-09-02 21:18:40 +00003091 ISD::CondCode NotCC = ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
3092 isInt);
Bill Wendlingae89bb12008-11-11 08:25:46 +00003093
Duncan Sands25cf2272008-11-24 14:53:14 +00003094 if (!LegalOperations || TLI.isCondCodeLegal(NotCC, LHS.getValueType())) {
Bill Wendlingae89bb12008-11-11 08:25:46 +00003095 switch (N0.getOpcode()) {
3096 default:
Torok Edwinc23197a2009-07-14 16:55:14 +00003097 llvm_unreachable("Unhandled SetCC Equivalent!");
Bill Wendlingae89bb12008-11-11 08:25:46 +00003098 case ISD::SETCC:
Bill Wendling317bd702009-01-30 21:14:50 +00003099 return DAG.getSetCC(N->getDebugLoc(), VT, LHS, RHS, NotCC);
Bill Wendlingae89bb12008-11-11 08:25:46 +00003100 case ISD::SELECT_CC:
Bill Wendling317bd702009-01-30 21:14:50 +00003101 return DAG.getSelectCC(N->getDebugLoc(), LHS, RHS, N0.getOperand(2),
Bill Wendlingae89bb12008-11-11 08:25:46 +00003102 N0.getOperand(3), NotCC);
3103 }
3104 }
Nate Begeman1d4d4142005-09-01 00:19:25 +00003105 }
Bill Wendlingae89bb12008-11-11 08:25:46 +00003106
Chris Lattner61c5ff42007-09-10 21:39:07 +00003107 // fold (not (zext (setcc x, y))) -> (zext (not (setcc x, y)))
Dan Gohman002e5d02008-03-13 22:13:53 +00003108 if (N1C && N1C->getAPIntValue() == 1 && N0.getOpcode() == ISD::ZERO_EXTEND &&
Gabor Greif12632d22008-08-30 19:29:20 +00003109 N0.getNode()->hasOneUse() &&
3110 isSetCCEquivalent(N0.getOperand(0), LHS, RHS, CC)){
Dan Gohman475871a2008-07-27 21:46:04 +00003111 SDValue V = N0.getOperand(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003112 V = DAG.getNode(ISD::XOR, N0.getDebugLoc(), V.getValueType(), V,
Duncan Sands272dce02007-10-10 09:54:50 +00003113 DAG.getConstant(1, V.getValueType()));
Gabor Greifba36cb52008-08-28 21:40:38 +00003114 AddToWorkList(V.getNode());
Bill Wendling317bd702009-01-30 21:14:50 +00003115 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, V);
Chris Lattner61c5ff42007-09-10 21:39:07 +00003116 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003117
Bill Wendling317bd702009-01-30 21:14:50 +00003118 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are setcc
Owen Anderson825b72b2009-08-11 20:47:22 +00003119 if (N1C && N1C->getAPIntValue() == 1 && VT == MVT::i1 &&
Nate Begeman99801192005-09-07 23:25:52 +00003120 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
Dan Gohman475871a2008-07-27 21:46:04 +00003121 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1);
Nate Begeman99801192005-09-07 23:25:52 +00003122 if (isOneUseSetCC(RHS) || isOneUseSetCC(LHS)) {
3123 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
Bill Wendling317bd702009-01-30 21:14:50 +00003124 LHS = DAG.getNode(ISD::XOR, LHS.getDebugLoc(), VT, LHS, N1); // LHS = ~LHS
3125 RHS = DAG.getNode(ISD::XOR, RHS.getDebugLoc(), VT, RHS, N1); // RHS = ~RHS
Gabor Greifba36cb52008-08-28 21:40:38 +00003126 AddToWorkList(LHS.getNode()); AddToWorkList(RHS.getNode());
Bill Wendling317bd702009-01-30 21:14:50 +00003127 return DAG.getNode(NewOpcode, N->getDebugLoc(), VT, LHS, RHS);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003128 }
3129 }
Bill Wendling317bd702009-01-30 21:14:50 +00003130 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are constants
Scott Michelfdc40a02009-02-17 22:15:04 +00003131 if (N1C && N1C->isAllOnesValue() &&
Nate Begeman99801192005-09-07 23:25:52 +00003132 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
Dan Gohman475871a2008-07-27 21:46:04 +00003133 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1);
Nate Begeman99801192005-09-07 23:25:52 +00003134 if (isa<ConstantSDNode>(RHS) || isa<ConstantSDNode>(LHS)) {
3135 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
Bill Wendling317bd702009-01-30 21:14:50 +00003136 LHS = DAG.getNode(ISD::XOR, LHS.getDebugLoc(), VT, LHS, N1); // LHS = ~LHS
3137 RHS = DAG.getNode(ISD::XOR, RHS.getDebugLoc(), VT, RHS, N1); // RHS = ~RHS
Gabor Greifba36cb52008-08-28 21:40:38 +00003138 AddToWorkList(LHS.getNode()); AddToWorkList(RHS.getNode());
Bill Wendling317bd702009-01-30 21:14:50 +00003139 return DAG.getNode(NewOpcode, N->getDebugLoc(), VT, LHS, RHS);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003140 }
3141 }
Bill Wendling317bd702009-01-30 21:14:50 +00003142 // fold (xor (xor x, c1), c2) -> (xor x, (xor c1, c2))
Nate Begeman223df222005-09-08 20:18:10 +00003143 if (N1C && N0.getOpcode() == ISD::XOR) {
3144 ConstantSDNode *N00C = dyn_cast<ConstantSDNode>(N0.getOperand(0));
3145 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3146 if (N00C)
Bill Wendling317bd702009-01-30 21:14:50 +00003147 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N0.getOperand(1),
3148 DAG.getConstant(N1C->getAPIntValue() ^
Dan Gohman002e5d02008-03-13 22:13:53 +00003149 N00C->getAPIntValue(), VT));
Nate Begeman223df222005-09-08 20:18:10 +00003150 if (N01C)
Bill Wendling317bd702009-01-30 21:14:50 +00003151 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N0.getOperand(0),
3152 DAG.getConstant(N1C->getAPIntValue() ^
Dan Gohman002e5d02008-03-13 22:13:53 +00003153 N01C->getAPIntValue(), VT));
Nate Begeman223df222005-09-08 20:18:10 +00003154 }
3155 // fold (xor x, x) -> 0
Eric Christopher7bccf6a2011-02-16 04:50:12 +00003156 if (N0 == N1)
3157 return tryFoldToZero(N->getDebugLoc(), TLI, VT, DAG, LegalOperations);
Scott Michelfdc40a02009-02-17 22:15:04 +00003158
Chris Lattner35e5c142006-05-05 05:51:50 +00003159 // Simplify: xor (op x...), (op y...) -> (op (xor x, y))
3160 if (N0.getOpcode() == N1.getOpcode()) {
Dan Gohman475871a2008-07-27 21:46:04 +00003161 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00003162 if (Tmp.getNode()) return Tmp;
Nate Begeman39ee1ac2005-09-09 19:49:52 +00003163 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003164
Chris Lattner3e104b12006-04-08 04:15:24 +00003165 // Simplify the expression using non-local knowledge.
Duncan Sands83ec4b62008-06-06 12:08:01 +00003166 if (!VT.isVector() &&
Dan Gohman475871a2008-07-27 21:46:04 +00003167 SimplifyDemandedBits(SDValue(N, 0)))
3168 return SDValue(N, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003169
Evan Chengb3a3d5e2010-04-28 07:10:39 +00003170 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003171}
3172
Chris Lattnere70da202007-12-06 07:33:36 +00003173/// visitShiftByConstant - Handle transforms common to the three shifts, when
3174/// the shift amount is a constant.
Dan Gohman475871a2008-07-27 21:46:04 +00003175SDValue DAGCombiner::visitShiftByConstant(SDNode *N, unsigned Amt) {
Gabor Greifba36cb52008-08-28 21:40:38 +00003176 SDNode *LHS = N->getOperand(0).getNode();
Dan Gohman475871a2008-07-27 21:46:04 +00003177 if (!LHS->hasOneUse()) return SDValue();
Scott Michelfdc40a02009-02-17 22:15:04 +00003178
Chris Lattnere70da202007-12-06 07:33:36 +00003179 // We want to pull some binops through shifts, so that we have (and (shift))
3180 // instead of (shift (and)), likewise for add, or, xor, etc. This sort of
3181 // thing happens with address calculations, so it's important to canonicalize
3182 // it.
3183 bool HighBitSet = false; // Can we transform this if the high bit is set?
Scott Michelfdc40a02009-02-17 22:15:04 +00003184
Chris Lattnere70da202007-12-06 07:33:36 +00003185 switch (LHS->getOpcode()) {
Dan Gohman475871a2008-07-27 21:46:04 +00003186 default: return SDValue();
Chris Lattnere70da202007-12-06 07:33:36 +00003187 case ISD::OR:
3188 case ISD::XOR:
3189 HighBitSet = false; // We can only transform sra if the high bit is clear.
3190 break;
3191 case ISD::AND:
3192 HighBitSet = true; // We can only transform sra if the high bit is set.
3193 break;
3194 case ISD::ADD:
Scott Michelfdc40a02009-02-17 22:15:04 +00003195 if (N->getOpcode() != ISD::SHL)
Dan Gohman475871a2008-07-27 21:46:04 +00003196 return SDValue(); // only shl(add) not sr[al](add).
Chris Lattnere70da202007-12-06 07:33:36 +00003197 HighBitSet = false; // We can only transform sra if the high bit is clear.
3198 break;
3199 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003200
Chris Lattnere70da202007-12-06 07:33:36 +00003201 // We require the RHS of the binop to be a constant as well.
3202 ConstantSDNode *BinOpCst = dyn_cast<ConstantSDNode>(LHS->getOperand(1));
Dan Gohman475871a2008-07-27 21:46:04 +00003203 if (!BinOpCst) return SDValue();
Bill Wendling88103372009-01-30 21:37:17 +00003204
3205 // FIXME: disable this unless the input to the binop is a shift by a constant.
3206 // If it is not a shift, it pessimizes some common cases like:
Chris Lattnerd3fd6d22007-12-06 07:47:55 +00003207 //
Bill Wendling88103372009-01-30 21:37:17 +00003208 // void foo(int *X, int i) { X[i & 1235] = 1; }
3209 // int bar(int *X, int i) { return X[i & 255]; }
Gabor Greifba36cb52008-08-28 21:40:38 +00003210 SDNode *BinOpLHSVal = LHS->getOperand(0).getNode();
Scott Michelfdc40a02009-02-17 22:15:04 +00003211 if ((BinOpLHSVal->getOpcode() != ISD::SHL &&
Chris Lattnerd3fd6d22007-12-06 07:47:55 +00003212 BinOpLHSVal->getOpcode() != ISD::SRA &&
3213 BinOpLHSVal->getOpcode() != ISD::SRL) ||
3214 !isa<ConstantSDNode>(BinOpLHSVal->getOperand(1)))
Dan Gohman475871a2008-07-27 21:46:04 +00003215 return SDValue();
Scott Michelfdc40a02009-02-17 22:15:04 +00003216
Owen Andersone50ed302009-08-10 22:56:29 +00003217 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003218
Bill Wendling88103372009-01-30 21:37:17 +00003219 // If this is a signed shift right, and the high bit is modified by the
3220 // logical operation, do not perform the transformation. The highBitSet
3221 // boolean indicates the value of the high bit of the constant which would
3222 // cause it to be modified for this operation.
Chris Lattnere70da202007-12-06 07:33:36 +00003223 if (N->getOpcode() == ISD::SRA) {
Dan Gohman220a8232008-03-03 23:51:38 +00003224 bool BinOpRHSSignSet = BinOpCst->getAPIntValue().isNegative();
3225 if (BinOpRHSSignSet != HighBitSet)
Dan Gohman475871a2008-07-27 21:46:04 +00003226 return SDValue();
Chris Lattnere70da202007-12-06 07:33:36 +00003227 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003228
Chris Lattnere70da202007-12-06 07:33:36 +00003229 // Fold the constants, shifting the binop RHS by the shift amount.
Bill Wendling88103372009-01-30 21:37:17 +00003230 SDValue NewRHS = DAG.getNode(N->getOpcode(), LHS->getOperand(1).getDebugLoc(),
3231 N->getValueType(0),
3232 LHS->getOperand(1), N->getOperand(1));
Chris Lattnere70da202007-12-06 07:33:36 +00003233
3234 // Create the new shift.
Eric Christopher503a64d2010-12-09 04:48:06 +00003235 SDValue NewShift = DAG.getNode(N->getOpcode(),
3236 LHS->getOperand(0).getDebugLoc(),
Bill Wendling88103372009-01-30 21:37:17 +00003237 VT, LHS->getOperand(0), N->getOperand(1));
Chris Lattnere70da202007-12-06 07:33:36 +00003238
3239 // Create the new binop.
Bill Wendling88103372009-01-30 21:37:17 +00003240 return DAG.getNode(LHS->getOpcode(), N->getDebugLoc(), VT, NewShift, NewRHS);
Chris Lattnere70da202007-12-06 07:33:36 +00003241}
3242
Dan Gohman475871a2008-07-27 21:46:04 +00003243SDValue DAGCombiner::visitSHL(SDNode *N) {
3244 SDValue N0 = N->getOperand(0);
3245 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00003246 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
3247 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00003248 EVT VT = N0.getValueType();
Dan Gohman87862e72009-12-11 21:31:27 +00003249 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00003250
Nate Begeman1d4d4142005-09-01 00:19:25 +00003251 // fold (shl c1, c2) -> c1<<c2
Nate Begeman646d7e22005-09-02 21:18:40 +00003252 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00003253 return DAG.FoldConstantArithmetic(ISD::SHL, VT, N0C, N1C);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003254 // fold (shl 0, x) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00003255 if (N0C && N0C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003256 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00003257 // fold (shl x, c >= size(x)) -> undef
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003258 if (N1C && N1C->getZExtValue() >= OpSizeInBits)
Dale Johannesene8d72302009-02-06 23:05:02 +00003259 return DAG.getUNDEF(VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003260 // fold (shl x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00003261 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003262 return N0;
Chad Rosier92bcd962011-06-14 22:29:10 +00003263 // fold (shl undef, x) -> 0
3264 if (N0.getOpcode() == ISD::UNDEF)
3265 return DAG.getConstant(0, VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003266 // if (shl x, c) is known to be zero, return 0
Dan Gohman475871a2008-07-27 21:46:04 +00003267 if (DAG.MaskedValueIsZero(SDValue(N, 0),
Dan Gohman87862e72009-12-11 21:31:27 +00003268 APInt::getAllOnesValue(OpSizeInBits)))
Nate Begeman83e75ec2005-09-06 04:43:02 +00003269 return DAG.getConstant(0, VT);
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003270 // fold (shl x, (trunc (and y, c))) -> (shl x, (and (trunc y), (trunc c))).
Evan Chengeb9f8922008-08-30 02:03:58 +00003271 if (N1.getOpcode() == ISD::TRUNCATE &&
Evan Cheng242ebd12008-09-22 18:19:24 +00003272 N1.getOperand(0).getOpcode() == ISD::AND &&
3273 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) {
Evan Chengeb9f8922008-08-30 02:03:58 +00003274 SDValue N101 = N1.getOperand(0).getOperand(1);
Evan Cheng242ebd12008-09-22 18:19:24 +00003275 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) {
Owen Andersone50ed302009-08-10 22:56:29 +00003276 EVT TruncVT = N1.getValueType();
Evan Cheng242ebd12008-09-22 18:19:24 +00003277 SDValue N100 = N1.getOperand(0).getOperand(0);
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003278 APInt TruncC = N101C->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00003279 TruncC = TruncC.trunc(TruncVT.getSizeInBits());
Bill Wendling88103372009-01-30 21:37:17 +00003280 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0,
Bill Wendlingfc4b6772009-02-01 11:19:36 +00003281 DAG.getNode(ISD::AND, N->getDebugLoc(), TruncVT,
3282 DAG.getNode(ISD::TRUNCATE,
3283 N->getDebugLoc(),
3284 TruncVT, N100),
Dan Gohmance9bc122009-01-27 20:39:34 +00003285 DAG.getConstant(TruncC, TruncVT)));
Evan Chengeb9f8922008-08-30 02:03:58 +00003286 }
3287 }
3288
Dan Gohman475871a2008-07-27 21:46:04 +00003289 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
3290 return SDValue(N, 0);
Bill Wendling88103372009-01-30 21:37:17 +00003291
3292 // fold (shl (shl x, c1), c2) -> 0 or (shl x, (add c1, c2))
Scott Michelfdc40a02009-02-17 22:15:04 +00003293 if (N1C && N0.getOpcode() == ISD::SHL &&
Nate Begeman1d4d4142005-09-01 00:19:25 +00003294 N0.getOperand(1).getOpcode() == ISD::Constant) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003295 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue();
3296 uint64_t c2 = N1C->getZExtValue();
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003297 if (c1 + c2 >= OpSizeInBits)
Nate Begeman83e75ec2005-09-06 04:43:02 +00003298 return DAG.getConstant(0, VT);
Bill Wendling88103372009-01-30 21:37:17 +00003299 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0.getOperand(0),
Nate Begeman83e75ec2005-09-06 04:43:02 +00003300 DAG.getConstant(c1 + c2, N1.getValueType()));
Nate Begeman1d4d4142005-09-01 00:19:25 +00003301 }
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003302
3303 // fold (shl (ext (shl x, c1)), c2) -> (ext (shl x, (add c1, c2)))
3304 // For this to be valid, the second form must not preserve any of the bits
3305 // that are shifted out by the inner shift in the first form. This means
3306 // the outer shift size must be >= the number of bits added by the ext.
3307 // As a corollary, we don't care what kind of ext it is.
3308 if (N1C && (N0.getOpcode() == ISD::ZERO_EXTEND ||
3309 N0.getOpcode() == ISD::ANY_EXTEND ||
3310 N0.getOpcode() == ISD::SIGN_EXTEND) &&
3311 N0.getOperand(0).getOpcode() == ISD::SHL &&
3312 isa<ConstantSDNode>(N0.getOperand(0)->getOperand(1))) {
Owen Anderson95771af2011-02-25 21:41:48 +00003313 uint64_t c1 =
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003314 cast<ConstantSDNode>(N0.getOperand(0)->getOperand(1))->getZExtValue();
3315 uint64_t c2 = N1C->getZExtValue();
3316 EVT InnerShiftVT = N0.getOperand(0).getValueType();
3317 uint64_t InnerShiftSize = InnerShiftVT.getScalarType().getSizeInBits();
3318 if (c2 >= OpSizeInBits - InnerShiftSize) {
3319 if (c1 + c2 >= OpSizeInBits)
3320 return DAG.getConstant(0, VT);
3321 return DAG.getNode(ISD::SHL, N0->getDebugLoc(), VT,
3322 DAG.getNode(N0.getOpcode(), N0->getDebugLoc(), VT,
3323 N0.getOperand(0)->getOperand(0)),
3324 DAG.getConstant(c1 + c2, N1.getValueType()));
3325 }
3326 }
3327
Eli Friedman2a6d9eb2011-06-09 22:14:44 +00003328 // fold (shl (srl x, c1), c2) -> (and (shl x, (sub c2, c1), MASK) or
3329 // (and (srl x, (sub c1, c2), MASK)
Scott Michelfdc40a02009-02-17 22:15:04 +00003330 if (N1C && N0.getOpcode() == ISD::SRL &&
Nate Begeman1d4d4142005-09-01 00:19:25 +00003331 N0.getOperand(1).getOpcode() == ISD::Constant) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003332 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue();
Evan Chengd101a722009-07-21 05:40:15 +00003333 if (c1 < VT.getSizeInBits()) {
3334 uint64_t c2 = N1C->getZExtValue();
Eli Friedman2a6d9eb2011-06-09 22:14:44 +00003335 APInt Mask = APInt::getHighBitsSet(VT.getSizeInBits(),
3336 VT.getSizeInBits() - c1);
3337 SDValue Shift;
3338 if (c2 > c1) {
3339 Mask = Mask.shl(c2-c1);
3340 Shift = DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0.getOperand(0),
3341 DAG.getConstant(c2-c1, N1.getValueType()));
3342 } else {
3343 Mask = Mask.lshr(c1-c2);
3344 Shift = DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0.getOperand(0),
3345 DAG.getConstant(c1-c2, N1.getValueType()));
3346 }
3347 return DAG.getNode(ISD::AND, N0.getDebugLoc(), VT, Shift,
3348 DAG.getConstant(Mask, VT));
Evan Chengd101a722009-07-21 05:40:15 +00003349 }
Nate Begeman1d4d4142005-09-01 00:19:25 +00003350 }
Bill Wendling88103372009-01-30 21:37:17 +00003351 // fold (shl (sra x, c1), c1) -> (and x, (shl -1, c1))
Dan Gohman5cbd37e2009-08-06 09:18:59 +00003352 if (N1C && N0.getOpcode() == ISD::SRA && N1 == N0.getOperand(1)) {
3353 SDValue HiBitsMask =
3354 DAG.getConstant(APInt::getHighBitsSet(VT.getSizeInBits(),
3355 VT.getSizeInBits() -
3356 N1C->getZExtValue()),
3357 VT);
Bill Wendling88103372009-01-30 21:37:17 +00003358 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0.getOperand(0),
Dan Gohman5cbd37e2009-08-06 09:18:59 +00003359 HiBitsMask);
3360 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003361
Evan Chenge5b51ac2010-04-17 06:13:15 +00003362 if (N1C) {
3363 SDValue NewSHL = visitShiftByConstant(N, N1C->getZExtValue());
3364 if (NewSHL.getNode())
3365 return NewSHL;
3366 }
3367
Evan Chengb3a3d5e2010-04-28 07:10:39 +00003368 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003369}
3370
Dan Gohman475871a2008-07-27 21:46:04 +00003371SDValue DAGCombiner::visitSRA(SDNode *N) {
3372 SDValue N0 = N->getOperand(0);
3373 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00003374 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
3375 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00003376 EVT VT = N0.getValueType();
Dan Gohman87862e72009-12-11 21:31:27 +00003377 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00003378
Bill Wendling88103372009-01-30 21:37:17 +00003379 // fold (sra c1, c2) -> (sra c1, c2)
Nate Begeman646d7e22005-09-02 21:18:40 +00003380 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00003381 return DAG.FoldConstantArithmetic(ISD::SRA, VT, N0C, N1C);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003382 // fold (sra 0, x) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00003383 if (N0C && N0C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003384 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00003385 // fold (sra -1, x) -> -1
Nate Begeman646d7e22005-09-02 21:18:40 +00003386 if (N0C && N0C->isAllOnesValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003387 return N0;
Bill Wendling88103372009-01-30 21:37:17 +00003388 // fold (sra x, (setge c, size(x))) -> undef
Dan Gohman87862e72009-12-11 21:31:27 +00003389 if (N1C && N1C->getZExtValue() >= OpSizeInBits)
Dale Johannesene8d72302009-02-06 23:05:02 +00003390 return DAG.getUNDEF(VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003391 // fold (sra x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00003392 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003393 return N0;
Nate Begemanfb7217b2006-02-17 19:54:08 +00003394 // fold (sra (shl x, c1), c1) -> sext_inreg for some c1 and target supports
3395 // sext_inreg.
3396 if (N1C && N0.getOpcode() == ISD::SHL && N1 == N0.getOperand(1)) {
Dan Gohman87862e72009-12-11 21:31:27 +00003397 unsigned LowBits = OpSizeInBits - (unsigned)N1C->getZExtValue();
Dan Gohmand1996362010-01-09 02:13:55 +00003398 EVT ExtVT = EVT::getIntegerVT(*DAG.getContext(), LowBits);
3399 if (VT.isVector())
3400 ExtVT = EVT::getVectorVT(*DAG.getContext(),
3401 ExtVT, VT.getVectorNumElements());
3402 if ((!LegalOperations ||
3403 TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, ExtVT)))
Bill Wendling88103372009-01-30 21:37:17 +00003404 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT,
Dan Gohmand1996362010-01-09 02:13:55 +00003405 N0.getOperand(0), DAG.getValueType(ExtVT));
Nate Begemanfb7217b2006-02-17 19:54:08 +00003406 }
Duncan Sandsd4b9c172008-06-13 19:07:40 +00003407
Bill Wendling88103372009-01-30 21:37:17 +00003408 // fold (sra (sra x, c1), c2) -> (sra x, (add c1, c2))
Chris Lattner71d9ebc2006-02-28 06:23:04 +00003409 if (N1C && N0.getOpcode() == ISD::SRA) {
3410 if (ConstantSDNode *C1 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003411 unsigned Sum = N1C->getZExtValue() + C1->getZExtValue();
Dan Gohman87862e72009-12-11 21:31:27 +00003412 if (Sum >= OpSizeInBits) Sum = OpSizeInBits-1;
Bill Wendling88103372009-01-30 21:37:17 +00003413 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0.getOperand(0),
Chris Lattner71d9ebc2006-02-28 06:23:04 +00003414 DAG.getConstant(Sum, N1C->getValueType(0)));
3415 }
3416 }
Christopher Lamb15cbde32008-03-19 08:30:06 +00003417
Bill Wendling88103372009-01-30 21:37:17 +00003418 // fold (sra (shl X, m), (sub result_size, n))
3419 // -> (sign_extend (trunc (shl X, (sub (sub result_size, n), m)))) for
Scott Michelfdc40a02009-02-17 22:15:04 +00003420 // result_size - n != m.
3421 // If truncate is free for the target sext(shl) is likely to result in better
Christopher Lambb9b04282008-03-20 04:31:39 +00003422 // code.
Christopher Lamb15cbde32008-03-19 08:30:06 +00003423 if (N0.getOpcode() == ISD::SHL) {
3424 // Get the two constanst of the shifts, CN0 = m, CN = n.
3425 const ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3426 if (N01C && N1C) {
Christopher Lambb9b04282008-03-20 04:31:39 +00003427 // Determine what the truncate's result bitsize and type would be.
Owen Andersone50ed302009-08-10 22:56:29 +00003428 EVT TruncVT =
Eric Christopher503a64d2010-12-09 04:48:06 +00003429 EVT::getIntegerVT(*DAG.getContext(),
3430 OpSizeInBits - N1C->getZExtValue());
Christopher Lambb9b04282008-03-20 04:31:39 +00003431 // Determine the residual right-shift amount.
Torok Edwin6bb49582009-05-23 17:29:48 +00003432 signed ShiftAmt = N1C->getZExtValue() - N01C->getZExtValue();
Duncan Sandsd4b9c172008-06-13 19:07:40 +00003433
Scott Michelfdc40a02009-02-17 22:15:04 +00003434 // If the shift is not a no-op (in which case this should be just a sign
3435 // extend already), the truncated to type is legal, sign_extend is legal
Dan Gohmanf451cb82010-02-10 16:03:48 +00003436 // on that type, and the truncate to that type is both legal and free,
Christopher Lambb9b04282008-03-20 04:31:39 +00003437 // perform the transform.
Torok Edwin6bb49582009-05-23 17:29:48 +00003438 if ((ShiftAmt > 0) &&
Dan Gohmanf560ffa2009-01-28 17:46:25 +00003439 TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND, TruncVT) &&
3440 TLI.isOperationLegalOrCustom(ISD::TRUNCATE, VT) &&
Evan Cheng260e07e2008-03-20 02:18:41 +00003441 TLI.isTruncateFree(VT, TruncVT)) {
Christopher Lambb9b04282008-03-20 04:31:39 +00003442
Owen Anderson95771af2011-02-25 21:41:48 +00003443 SDValue Amt = DAG.getConstant(ShiftAmt,
3444 getShiftAmountTy(N0.getOperand(0).getValueType()));
Bill Wendling88103372009-01-30 21:37:17 +00003445 SDValue Shift = DAG.getNode(ISD::SRL, N0.getDebugLoc(), VT,
3446 N0.getOperand(0), Amt);
3447 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), TruncVT,
3448 Shift);
3449 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(),
3450 N->getValueType(0), Trunc);
Christopher Lamb15cbde32008-03-19 08:30:06 +00003451 }
3452 }
3453 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003454
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003455 // fold (sra x, (trunc (and y, c))) -> (sra x, (and (trunc y), (trunc c))).
Evan Chengeb9f8922008-08-30 02:03:58 +00003456 if (N1.getOpcode() == ISD::TRUNCATE &&
Evan Cheng242ebd12008-09-22 18:19:24 +00003457 N1.getOperand(0).getOpcode() == ISD::AND &&
3458 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) {
Evan Chengeb9f8922008-08-30 02:03:58 +00003459 SDValue N101 = N1.getOperand(0).getOperand(1);
Evan Cheng242ebd12008-09-22 18:19:24 +00003460 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) {
Owen Andersone50ed302009-08-10 22:56:29 +00003461 EVT TruncVT = N1.getValueType();
Evan Cheng242ebd12008-09-22 18:19:24 +00003462 SDValue N100 = N1.getOperand(0).getOperand(0);
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003463 APInt TruncC = N101C->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00003464 TruncC = TruncC.trunc(TruncVT.getScalarType().getSizeInBits());
Bill Wendling88103372009-01-30 21:37:17 +00003465 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0,
Bill Wendling9729c5a2009-01-31 03:12:48 +00003466 DAG.getNode(ISD::AND, N->getDebugLoc(),
Bill Wendling88103372009-01-30 21:37:17 +00003467 TruncVT,
Bill Wendling9729c5a2009-01-31 03:12:48 +00003468 DAG.getNode(ISD::TRUNCATE,
3469 N->getDebugLoc(),
3470 TruncVT, N100),
Dan Gohmance9bc122009-01-27 20:39:34 +00003471 DAG.getConstant(TruncC, TruncVT)));
Evan Chengeb9f8922008-08-30 02:03:58 +00003472 }
3473 }
3474
Benjamin Kramer9b108a32011-01-30 16:38:43 +00003475 // fold (sra (trunc (sr x, c1)), c2) -> (trunc (sra x, c1+c2))
3476 // if c1 is equal to the number of bits the trunc removes
3477 if (N0.getOpcode() == ISD::TRUNCATE &&
3478 (N0.getOperand(0).getOpcode() == ISD::SRL ||
3479 N0.getOperand(0).getOpcode() == ISD::SRA) &&
3480 N0.getOperand(0).hasOneUse() &&
3481 N0.getOperand(0).getOperand(1).hasOneUse() &&
3482 N1C && isa<ConstantSDNode>(N0.getOperand(0).getOperand(1))) {
3483 EVT LargeVT = N0.getOperand(0).getValueType();
3484 ConstantSDNode *LargeShiftAmt =
3485 cast<ConstantSDNode>(N0.getOperand(0).getOperand(1));
3486
3487 if (LargeVT.getScalarType().getSizeInBits() - OpSizeInBits ==
3488 LargeShiftAmt->getZExtValue()) {
3489 SDValue Amt =
3490 DAG.getConstant(LargeShiftAmt->getZExtValue() + N1C->getZExtValue(),
Owen Anderson95771af2011-02-25 21:41:48 +00003491 getShiftAmountTy(N0.getOperand(0).getOperand(0).getValueType()));
Benjamin Kramer9b108a32011-01-30 16:38:43 +00003492 SDValue SRA = DAG.getNode(ISD::SRA, N->getDebugLoc(), LargeVT,
3493 N0.getOperand(0).getOperand(0), Amt);
3494 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, SRA);
3495 }
3496 }
3497
Scott Michelfdc40a02009-02-17 22:15:04 +00003498 // Simplify, based on bits shifted out of the LHS.
Dan Gohman475871a2008-07-27 21:46:04 +00003499 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
3500 return SDValue(N, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003501
3502
Nate Begeman1d4d4142005-09-01 00:19:25 +00003503 // If the sign bit is known to be zero, switch this to a SRL.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00003504 if (DAG.SignBitIsZero(N0))
Bill Wendling88103372009-01-30 21:37:17 +00003505 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, N1);
Chris Lattnere70da202007-12-06 07:33:36 +00003506
Evan Chenge5b51ac2010-04-17 06:13:15 +00003507 if (N1C) {
3508 SDValue NewSRA = visitShiftByConstant(N, N1C->getZExtValue());
3509 if (NewSRA.getNode())
3510 return NewSRA;
3511 }
3512
Evan Chengb3a3d5e2010-04-28 07:10:39 +00003513 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003514}
3515
Dan Gohman475871a2008-07-27 21:46:04 +00003516SDValue DAGCombiner::visitSRL(SDNode *N) {
3517 SDValue N0 = N->getOperand(0);
3518 SDValue N1 = N->getOperand(1);
Nate Begeman646d7e22005-09-02 21:18:40 +00003519 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
3520 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00003521 EVT VT = N0.getValueType();
Dan Gohman87862e72009-12-11 21:31:27 +00003522 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00003523
Nate Begeman1d4d4142005-09-01 00:19:25 +00003524 // fold (srl c1, c2) -> c1 >>u c2
Nate Begeman646d7e22005-09-02 21:18:40 +00003525 if (N0C && N1C)
Bill Wendlingf3cbca22008-09-24 10:25:02 +00003526 return DAG.FoldConstantArithmetic(ISD::SRL, VT, N0C, N1C);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003527 // fold (srl 0, x) -> 0
Nate Begeman646d7e22005-09-02 21:18:40 +00003528 if (N0C && N0C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003529 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00003530 // fold (srl x, c >= size(x)) -> undef
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003531 if (N1C && N1C->getZExtValue() >= OpSizeInBits)
Dale Johannesene8d72302009-02-06 23:05:02 +00003532 return DAG.getUNDEF(VT);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003533 // fold (srl x, 0) -> x
Nate Begeman646d7e22005-09-02 21:18:40 +00003534 if (N1C && N1C->isNullValue())
Nate Begeman83e75ec2005-09-06 04:43:02 +00003535 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00003536 // if (srl x, c) is known to be zero, return 0
Dan Gohman475871a2008-07-27 21:46:04 +00003537 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0),
Dan Gohman2e68b6f2008-02-25 21:11:39 +00003538 APInt::getAllOnesValue(OpSizeInBits)))
Nate Begeman83e75ec2005-09-06 04:43:02 +00003539 return DAG.getConstant(0, VT);
Scott Michelfdc40a02009-02-17 22:15:04 +00003540
Bill Wendling88103372009-01-30 21:37:17 +00003541 // fold (srl (srl x, c1), c2) -> 0 or (srl x, (add c1, c2))
Scott Michelfdc40a02009-02-17 22:15:04 +00003542 if (N1C && N0.getOpcode() == ISD::SRL &&
Nate Begeman1d4d4142005-09-01 00:19:25 +00003543 N0.getOperand(1).getOpcode() == ISD::Constant) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003544 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue();
3545 uint64_t c2 = N1C->getZExtValue();
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003546 if (c1 + c2 >= OpSizeInBits)
Nate Begeman83e75ec2005-09-06 04:43:02 +00003547 return DAG.getConstant(0, VT);
Bill Wendling88103372009-01-30 21:37:17 +00003548 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0.getOperand(0),
Nate Begeman83e75ec2005-09-06 04:43:02 +00003549 DAG.getConstant(c1 + c2, N1.getValueType()));
Nate Begeman1d4d4142005-09-01 00:19:25 +00003550 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00003551
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003552 // fold (srl (trunc (srl x, c1)), c2) -> 0 or (trunc (srl x, (add c1, c2)))
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003553 if (N1C && N0.getOpcode() == ISD::TRUNCATE &&
3554 N0.getOperand(0).getOpcode() == ISD::SRL &&
Dale Johannesen025cc6e2010-12-20 20:10:50 +00003555 isa<ConstantSDNode>(N0.getOperand(0)->getOperand(1))) {
Owen Anderson95771af2011-02-25 21:41:48 +00003556 uint64_t c1 =
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003557 cast<ConstantSDNode>(N0.getOperand(0)->getOperand(1))->getZExtValue();
3558 uint64_t c2 = N1C->getZExtValue();
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003559 EVT InnerShiftVT = N0.getOperand(0).getValueType();
3560 EVT ShiftCountVT = N0.getOperand(0)->getOperand(1).getValueType();
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003561 uint64_t InnerShiftSize = InnerShiftVT.getScalarType().getSizeInBits();
Dale Johannesen025cc6e2010-12-20 20:10:50 +00003562 // This is only valid if the OpSizeInBits + c1 = size of inner shift.
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003563 if (c1 + OpSizeInBits == InnerShiftSize) {
3564 if (c1 + c2 >= InnerShiftSize)
3565 return DAG.getConstant(0, VT);
3566 return DAG.getNode(ISD::TRUNCATE, N0->getDebugLoc(), VT,
Owen Anderson95771af2011-02-25 21:41:48 +00003567 DAG.getNode(ISD::SRL, N0->getDebugLoc(), InnerShiftVT,
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003568 N0.getOperand(0)->getOperand(0),
Dale Johannesenc72b18c2010-12-21 21:55:50 +00003569 DAG.getConstant(c1 + c2, ShiftCountVT)));
Dale Johannesenf5daf8b2010-12-17 21:45:49 +00003570 }
3571 }
3572
Chris Lattnerefcddc32010-04-15 05:28:43 +00003573 // fold (srl (shl x, c), c) -> (and x, cst2)
3574 if (N1C && N0.getOpcode() == ISD::SHL && N0.getOperand(1) == N1 &&
3575 N0.getValueSizeInBits() <= 64) {
3576 uint64_t ShAmt = N1C->getZExtValue()+64-N0.getValueSizeInBits();
3577 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0.getOperand(0),
3578 DAG.getConstant(~0ULL >> ShAmt, VT));
3579 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00003580
Scott Michelfdc40a02009-02-17 22:15:04 +00003581
Chris Lattner06afe072006-05-05 22:53:17 +00003582 // fold (srl (anyextend x), c) -> (anyextend (srl x, c))
3583 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
3584 // Shifting in all undef bits?
Owen Andersone50ed302009-08-10 22:56:29 +00003585 EVT SmallVT = N0.getOperand(0).getValueType();
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00003586 if (N1C->getZExtValue() >= SmallVT.getSizeInBits())
Dale Johannesene8d72302009-02-06 23:05:02 +00003587 return DAG.getUNDEF(VT);
Chris Lattner06afe072006-05-05 22:53:17 +00003588
Evan Chenge5b51ac2010-04-17 06:13:15 +00003589 if (!LegalTypes || TLI.isTypeDesirableForOp(ISD::SRL, SmallVT)) {
Owen Andersona34d9362011-04-14 17:30:49 +00003590 uint64_t ShiftAmt = N1C->getZExtValue();
Evan Chenge5b51ac2010-04-17 06:13:15 +00003591 SDValue SmallShift = DAG.getNode(ISD::SRL, N0.getDebugLoc(), SmallVT,
Owen Andersona34d9362011-04-14 17:30:49 +00003592 N0.getOperand(0),
3593 DAG.getConstant(ShiftAmt, getShiftAmountTy(SmallVT)));
Evan Chenge5b51ac2010-04-17 06:13:15 +00003594 AddToWorkList(SmallShift.getNode());
3595 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, SmallShift);
3596 }
Chris Lattner06afe072006-05-05 22:53:17 +00003597 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003598
Chris Lattner3657ffe2006-10-12 20:23:19 +00003599 // fold (srl (sra X, Y), 31) -> (srl X, 31). This srl only looks at the sign
3600 // bit, which is unmodified by sra.
Bill Wendling88103372009-01-30 21:37:17 +00003601 if (N1C && N1C->getZExtValue() + 1 == VT.getSizeInBits()) {
Chris Lattner3657ffe2006-10-12 20:23:19 +00003602 if (N0.getOpcode() == ISD::SRA)
Bill Wendling88103372009-01-30 21:37:17 +00003603 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0.getOperand(0), N1);
Chris Lattner3657ffe2006-10-12 20:23:19 +00003604 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003605
Chris Lattner350bec02006-04-02 06:11:11 +00003606 // fold (srl (ctlz x), "5") -> x iff x has one bit set (the low bit).
Scott Michelfdc40a02009-02-17 22:15:04 +00003607 if (N1C && N0.getOpcode() == ISD::CTLZ &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00003608 N1C->getAPIntValue() == Log2_32(VT.getSizeInBits())) {
Dan Gohman948d8ea2008-02-20 16:33:30 +00003609 APInt KnownZero, KnownOne;
Dan Gohman5b870af2010-03-02 02:14:38 +00003610 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits());
Dan Gohmanea859be2007-06-22 14:59:07 +00003611 DAG.ComputeMaskedBits(N0.getOperand(0), Mask, KnownZero, KnownOne);
Scott Michelfdc40a02009-02-17 22:15:04 +00003612
Chris Lattner350bec02006-04-02 06:11:11 +00003613 // If any of the input bits are KnownOne, then the input couldn't be all
3614 // zeros, thus the result of the srl will always be zero.
Dan Gohman948d8ea2008-02-20 16:33:30 +00003615 if (KnownOne.getBoolValue()) return DAG.getConstant(0, VT);
Scott Michelfdc40a02009-02-17 22:15:04 +00003616
Chris Lattner350bec02006-04-02 06:11:11 +00003617 // If all of the bits input the to ctlz node are known to be zero, then
3618 // the result of the ctlz is "32" and the result of the shift is one.
Dan Gohman948d8ea2008-02-20 16:33:30 +00003619 APInt UnknownBits = ~KnownZero & Mask;
Chris Lattner350bec02006-04-02 06:11:11 +00003620 if (UnknownBits == 0) return DAG.getConstant(1, VT);
Scott Michelfdc40a02009-02-17 22:15:04 +00003621
Chris Lattner350bec02006-04-02 06:11:11 +00003622 // Otherwise, check to see if there is exactly one bit input to the ctlz.
Bill Wendling88103372009-01-30 21:37:17 +00003623 if ((UnknownBits & (UnknownBits - 1)) == 0) {
Chris Lattner350bec02006-04-02 06:11:11 +00003624 // Okay, we know that only that the single bit specified by UnknownBits
Bill Wendling88103372009-01-30 21:37:17 +00003625 // could be set on input to the CTLZ node. If this bit is set, the SRL
3626 // will return 0, if it is clear, it returns 1. Change the CTLZ/SRL pair
3627 // to an SRL/XOR pair, which is likely to simplify more.
Dan Gohman948d8ea2008-02-20 16:33:30 +00003628 unsigned ShAmt = UnknownBits.countTrailingZeros();
Dan Gohman475871a2008-07-27 21:46:04 +00003629 SDValue Op = N0.getOperand(0);
Bill Wendling88103372009-01-30 21:37:17 +00003630
Chris Lattner350bec02006-04-02 06:11:11 +00003631 if (ShAmt) {
Bill Wendling88103372009-01-30 21:37:17 +00003632 Op = DAG.getNode(ISD::SRL, N0.getDebugLoc(), VT, Op,
Owen Anderson95771af2011-02-25 21:41:48 +00003633 DAG.getConstant(ShAmt, getShiftAmountTy(Op.getValueType())));
Gabor Greifba36cb52008-08-28 21:40:38 +00003634 AddToWorkList(Op.getNode());
Chris Lattner350bec02006-04-02 06:11:11 +00003635 }
Bill Wendling88103372009-01-30 21:37:17 +00003636
3637 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT,
3638 Op, DAG.getConstant(1, VT));
Chris Lattner350bec02006-04-02 06:11:11 +00003639 }
3640 }
Evan Chengeb9f8922008-08-30 02:03:58 +00003641
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003642 // fold (srl x, (trunc (and y, c))) -> (srl x, (and (trunc y), (trunc c))).
Evan Chengeb9f8922008-08-30 02:03:58 +00003643 if (N1.getOpcode() == ISD::TRUNCATE &&
Evan Cheng242ebd12008-09-22 18:19:24 +00003644 N1.getOperand(0).getOpcode() == ISD::AND &&
3645 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) {
Evan Chengeb9f8922008-08-30 02:03:58 +00003646 SDValue N101 = N1.getOperand(0).getOperand(1);
Evan Cheng242ebd12008-09-22 18:19:24 +00003647 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) {
Owen Andersone50ed302009-08-10 22:56:29 +00003648 EVT TruncVT = N1.getValueType();
Evan Cheng242ebd12008-09-22 18:19:24 +00003649 SDValue N100 = N1.getOperand(0).getOperand(0);
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00003650 APInt TruncC = N101C->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00003651 TruncC = TruncC.trunc(TruncVT.getSizeInBits());
Bill Wendling88103372009-01-30 21:37:17 +00003652 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0,
Bill Wendling9729c5a2009-01-31 03:12:48 +00003653 DAG.getNode(ISD::AND, N->getDebugLoc(),
Bill Wendling88103372009-01-30 21:37:17 +00003654 TruncVT,
Bill Wendling9729c5a2009-01-31 03:12:48 +00003655 DAG.getNode(ISD::TRUNCATE,
3656 N->getDebugLoc(),
3657 TruncVT, N100),
Dan Gohmance9bc122009-01-27 20:39:34 +00003658 DAG.getConstant(TruncC, TruncVT)));
Evan Chengeb9f8922008-08-30 02:03:58 +00003659 }
3660 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003661
Chris Lattner61a4c072007-04-18 03:06:49 +00003662 // fold operands of srl based on knowledge that the low bits are not
3663 // demanded.
Dan Gohman475871a2008-07-27 21:46:04 +00003664 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
3665 return SDValue(N, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003666
Evan Cheng9ab2b982009-12-18 21:31:31 +00003667 if (N1C) {
3668 SDValue NewSRL = visitShiftByConstant(N, N1C->getZExtValue());
3669 if (NewSRL.getNode())
3670 return NewSRL;
3671 }
3672
Dan Gohman4e39e9d2010-06-24 14:30:44 +00003673 // Attempt to convert a srl of a load into a narrower zero-extending load.
3674 SDValue NarrowLoad = ReduceLoadWidth(N);
3675 if (NarrowLoad.getNode())
3676 return NarrowLoad;
3677
Evan Cheng9ab2b982009-12-18 21:31:31 +00003678 // Here is a common situation. We want to optimize:
3679 //
3680 // %a = ...
3681 // %b = and i32 %a, 2
3682 // %c = srl i32 %b, 1
3683 // brcond i32 %c ...
3684 //
3685 // into
Wesley Peckbf17cfa2010-11-23 03:31:01 +00003686 //
Evan Cheng9ab2b982009-12-18 21:31:31 +00003687 // %a = ...
3688 // %b = and %a, 2
3689 // %c = setcc eq %b, 0
3690 // brcond %c ...
3691 //
3692 // However when after the source operand of SRL is optimized into AND, the SRL
3693 // itself may not be optimized further. Look for it and add the BRCOND into
3694 // the worklist.
Evan Chengd40d03e2010-01-06 19:38:29 +00003695 if (N->hasOneUse()) {
3696 SDNode *Use = *N->use_begin();
3697 if (Use->getOpcode() == ISD::BRCOND)
3698 AddToWorkList(Use);
3699 else if (Use->getOpcode() == ISD::TRUNCATE && Use->hasOneUse()) {
3700 // Also look pass the truncate.
3701 Use = *Use->use_begin();
3702 if (Use->getOpcode() == ISD::BRCOND)
3703 AddToWorkList(Use);
3704 }
3705 }
Evan Cheng9ab2b982009-12-18 21:31:31 +00003706
Evan Chengb3a3d5e2010-04-28 07:10:39 +00003707 return SDValue();
Evan Cheng4c26e932010-04-19 19:29:22 +00003708}
3709
Dan Gohman475871a2008-07-27 21:46:04 +00003710SDValue DAGCombiner::visitCTLZ(SDNode *N) {
3711 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00003712 EVT VT = N->getValueType(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003713
3714 // fold (ctlz c1) -> c2
Chris Lattner310b5782006-05-06 23:06:26 +00003715 if (isa<ConstantSDNode>(N0))
Bill Wendling34584e62009-01-30 22:02:18 +00003716 return DAG.getNode(ISD::CTLZ, N->getDebugLoc(), VT, N0);
Dan Gohman475871a2008-07-27 21:46:04 +00003717 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003718}
3719
Dan Gohman475871a2008-07-27 21:46:04 +00003720SDValue DAGCombiner::visitCTTZ(SDNode *N) {
3721 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00003722 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003723
Nate Begeman1d4d4142005-09-01 00:19:25 +00003724 // fold (cttz c1) -> c2
Chris Lattner310b5782006-05-06 23:06:26 +00003725 if (isa<ConstantSDNode>(N0))
Bill Wendling34584e62009-01-30 22:02:18 +00003726 return DAG.getNode(ISD::CTTZ, N->getDebugLoc(), VT, N0);
Dan Gohman475871a2008-07-27 21:46:04 +00003727 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003728}
3729
Dan Gohman475871a2008-07-27 21:46:04 +00003730SDValue DAGCombiner::visitCTPOP(SDNode *N) {
3731 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00003732 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003733
Nate Begeman1d4d4142005-09-01 00:19:25 +00003734 // fold (ctpop c1) -> c2
Chris Lattner310b5782006-05-06 23:06:26 +00003735 if (isa<ConstantSDNode>(N0))
Bill Wendling34584e62009-01-30 22:02:18 +00003736 return DAG.getNode(ISD::CTPOP, N->getDebugLoc(), VT, N0);
Dan Gohman475871a2008-07-27 21:46:04 +00003737 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00003738}
3739
Dan Gohman475871a2008-07-27 21:46:04 +00003740SDValue DAGCombiner::visitSELECT(SDNode *N) {
3741 SDValue N0 = N->getOperand(0);
3742 SDValue N1 = N->getOperand(1);
3743 SDValue N2 = N->getOperand(2);
Nate Begeman452d7beb2005-09-16 00:54:12 +00003744 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
3745 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
3746 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2);
Owen Andersone50ed302009-08-10 22:56:29 +00003747 EVT VT = N->getValueType(0);
3748 EVT VT0 = N0.getValueType();
Nate Begeman44728a72005-09-19 22:34:01 +00003749
Bill Wendling34584e62009-01-30 22:02:18 +00003750 // fold (select C, X, X) -> X
Nate Begeman452d7beb2005-09-16 00:54:12 +00003751 if (N1 == N2)
3752 return N1;
Bill Wendling34584e62009-01-30 22:02:18 +00003753 // fold (select true, X, Y) -> X
Nate Begeman452d7beb2005-09-16 00:54:12 +00003754 if (N0C && !N0C->isNullValue())
3755 return N1;
Bill Wendling34584e62009-01-30 22:02:18 +00003756 // fold (select false, X, Y) -> Y
Nate Begeman452d7beb2005-09-16 00:54:12 +00003757 if (N0C && N0C->isNullValue())
3758 return N2;
Bill Wendling34584e62009-01-30 22:02:18 +00003759 // fold (select C, 1, X) -> (or C, X)
Owen Anderson825b72b2009-08-11 20:47:22 +00003760 if (VT == MVT::i1 && N1C && N1C->getAPIntValue() == 1)
Bill Wendling34584e62009-01-30 22:02:18 +00003761 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N2);
3762 // fold (select C, 0, 1) -> (xor C, 1)
Bob Wilson67ba2232009-01-22 22:05:48 +00003763 if (VT.isInteger() &&
Owen Anderson825b72b2009-08-11 20:47:22 +00003764 (VT0 == MVT::i1 ||
Bob Wilson67ba2232009-01-22 22:05:48 +00003765 (VT0.isInteger() &&
3766 TLI.getBooleanContents() == TargetLowering::ZeroOrOneBooleanContent)) &&
Dan Gohman002e5d02008-03-13 22:13:53 +00003767 N1C && N2C && N1C->isNullValue() && N2C->getAPIntValue() == 1) {
Bill Wendling34584e62009-01-30 22:02:18 +00003768 SDValue XORNode;
Evan Cheng571c4782007-08-18 05:57:05 +00003769 if (VT == VT0)
Bill Wendling34584e62009-01-30 22:02:18 +00003770 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT0,
3771 N0, DAG.getConstant(1, VT0));
3772 XORNode = DAG.getNode(ISD::XOR, N0.getDebugLoc(), VT0,
3773 N0, DAG.getConstant(1, VT0));
Gabor Greifba36cb52008-08-28 21:40:38 +00003774 AddToWorkList(XORNode.getNode());
Duncan Sands8e4eb092008-06-08 20:54:56 +00003775 if (VT.bitsGT(VT0))
Bill Wendling34584e62009-01-30 22:02:18 +00003776 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, XORNode);
3777 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, XORNode);
Evan Cheng571c4782007-08-18 05:57:05 +00003778 }
Bill Wendling34584e62009-01-30 22:02:18 +00003779 // fold (select C, 0, X) -> (and (not C), X)
Owen Anderson825b72b2009-08-11 20:47:22 +00003780 if (VT == VT0 && VT == MVT::i1 && N1C && N1C->isNullValue()) {
Bill Wendling7581bfa2009-01-30 23:03:19 +00003781 SDValue NOTNode = DAG.getNOT(N0.getDebugLoc(), N0, VT);
Bob Wilson4c245462009-01-22 17:39:32 +00003782 AddToWorkList(NOTNode.getNode());
Bill Wendling7581bfa2009-01-30 23:03:19 +00003783 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, NOTNode, N2);
Nate Begeman452d7beb2005-09-16 00:54:12 +00003784 }
Bill Wendling34584e62009-01-30 22:02:18 +00003785 // fold (select C, X, 1) -> (or (not C), X)
Owen Anderson825b72b2009-08-11 20:47:22 +00003786 if (VT == VT0 && VT == MVT::i1 && N2C && N2C->getAPIntValue() == 1) {
Bill Wendling34584e62009-01-30 22:02:18 +00003787 SDValue NOTNode = DAG.getNOT(N0.getDebugLoc(), N0, VT);
Bob Wilson4c245462009-01-22 17:39:32 +00003788 AddToWorkList(NOTNode.getNode());
Bill Wendling7581bfa2009-01-30 23:03:19 +00003789 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, NOTNode, N1);
Nate Begeman452d7beb2005-09-16 00:54:12 +00003790 }
Bill Wendling34584e62009-01-30 22:02:18 +00003791 // fold (select C, X, 0) -> (and C, X)
Owen Anderson825b72b2009-08-11 20:47:22 +00003792 if (VT == MVT::i1 && N2C && N2C->isNullValue())
Bill Wendling34584e62009-01-30 22:02:18 +00003793 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, N1);
3794 // fold (select X, X, Y) -> (or X, Y)
3795 // fold (select X, 1, Y) -> (or X, Y)
Owen Anderson825b72b2009-08-11 20:47:22 +00003796 if (VT == MVT::i1 && (N0 == N1 || (N1C && N1C->getAPIntValue() == 1)))
Bill Wendling34584e62009-01-30 22:02:18 +00003797 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N2);
3798 // fold (select X, Y, X) -> (and X, Y)
3799 // fold (select X, Y, 0) -> (and X, Y)
Owen Anderson825b72b2009-08-11 20:47:22 +00003800 if (VT == MVT::i1 && (N0 == N2 || (N2C && N2C->getAPIntValue() == 0)))
Bill Wendling34584e62009-01-30 22:02:18 +00003801 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00003802
Chris Lattner40c62d52005-10-18 06:04:22 +00003803 // If we can fold this based on the true/false value, do so.
3804 if (SimplifySelectOps(N, N1, N2))
Dan Gohman475871a2008-07-27 21:46:04 +00003805 return SDValue(N, 0); // Don't revisit N.
Duncan Sandsd4b9c172008-06-13 19:07:40 +00003806
Nate Begeman44728a72005-09-19 22:34:01 +00003807 // fold selects based on a setcc into other things, such as min/max/abs
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00003808 if (N0.getOpcode() == ISD::SETCC) {
Nate Begeman750ac1b2006-02-01 07:19:44 +00003809 // FIXME:
Owen Anderson825b72b2009-08-11 20:47:22 +00003810 // Check against MVT::Other for SELECT_CC, which is a workaround for targets
Nate Begeman750ac1b2006-02-01 07:19:44 +00003811 // having to say they don't support SELECT_CC on every type the DAG knows
3812 // about, since there is no way to mark an opcode illegal at all value types
Owen Anderson825b72b2009-08-11 20:47:22 +00003813 if (TLI.isOperationLegalOrCustom(ISD::SELECT_CC, MVT::Other) &&
Dan Gohman4ea48042009-08-02 16:19:38 +00003814 TLI.isOperationLegalOrCustom(ISD::SELECT_CC, VT))
Bill Wendling34584e62009-01-30 22:02:18 +00003815 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(), VT,
3816 N0.getOperand(0), N0.getOperand(1),
Nate Begeman750ac1b2006-02-01 07:19:44 +00003817 N1, N2, N0.getOperand(2));
Chris Lattner600fec32009-03-11 05:08:08 +00003818 return SimplifySelect(N->getDebugLoc(), N0, N1, N2);
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00003819 }
Bill Wendling34584e62009-01-30 22:02:18 +00003820
Dan Gohman475871a2008-07-27 21:46:04 +00003821 return SDValue();
Nate Begeman452d7beb2005-09-16 00:54:12 +00003822}
3823
Dan Gohman475871a2008-07-27 21:46:04 +00003824SDValue DAGCombiner::visitSELECT_CC(SDNode *N) {
3825 SDValue N0 = N->getOperand(0);
3826 SDValue N1 = N->getOperand(1);
3827 SDValue N2 = N->getOperand(2);
3828 SDValue N3 = N->getOperand(3);
3829 SDValue N4 = N->getOperand(4);
Nate Begeman44728a72005-09-19 22:34:01 +00003830 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get();
Scott Michelfdc40a02009-02-17 22:15:04 +00003831
Nate Begeman44728a72005-09-19 22:34:01 +00003832 // fold select_cc lhs, rhs, x, x, cc -> x
3833 if (N2 == N3)
3834 return N2;
Scott Michelfdc40a02009-02-17 22:15:04 +00003835
Chris Lattner5f42a242006-09-20 06:19:26 +00003836 // Determine if the condition we're dealing with is constant
Duncan Sands5480c042009-01-01 15:52:00 +00003837 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()),
Dale Johannesenff97d4f2009-02-03 00:47:48 +00003838 N0, N1, CC, N->getDebugLoc(), false);
Gabor Greifba36cb52008-08-28 21:40:38 +00003839 if (SCC.getNode()) AddToWorkList(SCC.getNode());
Chris Lattner5f42a242006-09-20 06:19:26 +00003840
Gabor Greifba36cb52008-08-28 21:40:38 +00003841 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) {
Dan Gohman002e5d02008-03-13 22:13:53 +00003842 if (!SCCC->isNullValue())
Chris Lattner5f42a242006-09-20 06:19:26 +00003843 return N2; // cond always true -> true val
3844 else
3845 return N3; // cond always false -> false val
3846 }
Scott Michelfdc40a02009-02-17 22:15:04 +00003847
Chris Lattner5f42a242006-09-20 06:19:26 +00003848 // Fold to a simpler select_cc
Gabor Greifba36cb52008-08-28 21:40:38 +00003849 if (SCC.getNode() && SCC.getOpcode() == ISD::SETCC)
Scott Michelfdc40a02009-02-17 22:15:04 +00003850 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(), N2.getValueType(),
3851 SCC.getOperand(0), SCC.getOperand(1), N2, N3,
Chris Lattner5f42a242006-09-20 06:19:26 +00003852 SCC.getOperand(2));
Scott Michelfdc40a02009-02-17 22:15:04 +00003853
Chris Lattner40c62d52005-10-18 06:04:22 +00003854 // If we can fold this based on the true/false value, do so.
3855 if (SimplifySelectOps(N, N2, N3))
Dan Gohman475871a2008-07-27 21:46:04 +00003856 return SDValue(N, 0); // Don't revisit N.
Scott Michelfdc40a02009-02-17 22:15:04 +00003857
Nate Begeman44728a72005-09-19 22:34:01 +00003858 // fold select_cc into other things, such as min/max/abs
Bill Wendling836ca7d2009-01-30 23:59:18 +00003859 return SimplifySelectCC(N->getDebugLoc(), N0, N1, N2, N3, CC);
Nate Begeman452d7beb2005-09-16 00:54:12 +00003860}
3861
Dan Gohman475871a2008-07-27 21:46:04 +00003862SDValue DAGCombiner::visitSETCC(SDNode *N) {
Nate Begeman452d7beb2005-09-16 00:54:12 +00003863 return SimplifySetCC(N->getValueType(0), N->getOperand(0), N->getOperand(1),
Dale Johannesenff97d4f2009-02-03 00:47:48 +00003864 cast<CondCodeSDNode>(N->getOperand(2))->get(),
3865 N->getDebugLoc());
Nate Begeman452d7beb2005-09-16 00:54:12 +00003866}
3867
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003868// ExtendUsesToFormExtLoad - Trying to extend uses of a load to enable this:
Dan Gohman57fc82d2009-04-09 03:51:29 +00003869// "fold ({s|z|a}ext (load x)) -> ({s|z|a}ext (truncate ({s|z|a}extload x)))"
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003870// transformation. Returns true if extension are possible and the above
Scott Michelfdc40a02009-02-17 22:15:04 +00003871// mentioned transformation is profitable.
Dan Gohman475871a2008-07-27 21:46:04 +00003872static bool ExtendUsesToFormExtLoad(SDNode *N, SDValue N0,
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003873 unsigned ExtOpc,
3874 SmallVector<SDNode*, 4> &ExtendNodes,
Dan Gohman79ce2762009-01-15 19:20:50 +00003875 const TargetLowering &TLI) {
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003876 bool HasCopyToRegUses = false;
3877 bool isTruncFree = TLI.isTruncateFree(N->getValueType(0), N0.getValueType());
Gabor Greif12632d22008-08-30 19:29:20 +00003878 for (SDNode::use_iterator UI = N0.getNode()->use_begin(),
3879 UE = N0.getNode()->use_end();
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003880 UI != UE; ++UI) {
Dan Gohman89684502008-07-27 20:43:25 +00003881 SDNode *User = *UI;
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003882 if (User == N)
3883 continue;
Dan Gohman57fc82d2009-04-09 03:51:29 +00003884 if (UI.getUse().getResNo() != N0.getResNo())
3885 continue;
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003886 // FIXME: Only extend SETCC N, N and SETCC N, c for now.
Dan Gohman57fc82d2009-04-09 03:51:29 +00003887 if (ExtOpc != ISD::ANY_EXTEND && User->getOpcode() == ISD::SETCC) {
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003888 ISD::CondCode CC = cast<CondCodeSDNode>(User->getOperand(2))->get();
3889 if (ExtOpc == ISD::ZERO_EXTEND && ISD::isSignedIntSetCC(CC))
3890 // Sign bits will be lost after a zext.
3891 return false;
3892 bool Add = false;
3893 for (unsigned i = 0; i != 2; ++i) {
Dan Gohman475871a2008-07-27 21:46:04 +00003894 SDValue UseOp = User->getOperand(i);
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003895 if (UseOp == N0)
3896 continue;
3897 if (!isa<ConstantSDNode>(UseOp))
3898 return false;
3899 Add = true;
3900 }
3901 if (Add)
3902 ExtendNodes.push_back(User);
Dan Gohman57fc82d2009-04-09 03:51:29 +00003903 continue;
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003904 }
Dan Gohman57fc82d2009-04-09 03:51:29 +00003905 // If truncates aren't free and there are users we can't
3906 // extend, it isn't worthwhile.
3907 if (!isTruncFree)
3908 return false;
3909 // Remember if this value is live-out.
3910 if (User->getOpcode() == ISD::CopyToReg)
3911 HasCopyToRegUses = true;
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003912 }
3913
3914 if (HasCopyToRegUses) {
3915 bool BothLiveOut = false;
3916 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
3917 UI != UE; ++UI) {
Dan Gohman57fc82d2009-04-09 03:51:29 +00003918 SDUse &Use = UI.getUse();
3919 if (Use.getResNo() == 0 && Use.getUser()->getOpcode() == ISD::CopyToReg) {
3920 BothLiveOut = true;
3921 break;
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003922 }
3923 }
3924 if (BothLiveOut)
3925 // Both unextended and extended values are live out. There had better be
Bob Wilsonbebfbc52010-11-28 06:51:19 +00003926 // a good reason for the transformation.
Evan Cheng3c3ddb32007-10-29 19:58:20 +00003927 return ExtendNodes.size();
3928 }
3929 return true;
3930}
3931
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00003932void DAGCombiner::ExtendSetCCUses(SmallVector<SDNode*, 4> SetCCs,
3933 SDValue Trunc, SDValue ExtLoad, DebugLoc DL,
3934 ISD::NodeType ExtType) {
3935 // Extend SetCC uses if necessary.
3936 for (unsigned i = 0, e = SetCCs.size(); i != e; ++i) {
3937 SDNode *SetCC = SetCCs[i];
3938 SmallVector<SDValue, 4> Ops;
3939
3940 for (unsigned j = 0; j != 2; ++j) {
3941 SDValue SOp = SetCC->getOperand(j);
3942 if (SOp == Trunc)
3943 Ops.push_back(ExtLoad);
3944 else
3945 Ops.push_back(DAG.getNode(ExtType, DL, ExtLoad->getValueType(0), SOp));
3946 }
3947
3948 Ops.push_back(SetCC->getOperand(2));
3949 CombineTo(SetCC, DAG.getNode(ISD::SETCC, DL, SetCC->getValueType(0),
3950 &Ops[0], Ops.size()));
3951 }
3952}
3953
Dan Gohman475871a2008-07-27 21:46:04 +00003954SDValue DAGCombiner::visitSIGN_EXTEND(SDNode *N) {
3955 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00003956 EVT VT = N->getValueType(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00003957
Nate Begeman1d4d4142005-09-01 00:19:25 +00003958 // fold (sext c1) -> c1
Reid Spencer3ed469c2006-11-02 20:25:50 +00003959 if (isa<ConstantSDNode>(N0))
Bill Wendling6ce610f2009-01-30 22:23:15 +00003960 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00003961
Nate Begeman1d4d4142005-09-01 00:19:25 +00003962 // fold (sext (sext x)) -> (sext x)
Chris Lattner310b5782006-05-06 23:06:26 +00003963 // fold (sext (aext x)) -> (sext x)
3964 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
Bill Wendling6ce610f2009-01-30 22:23:15 +00003965 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT,
3966 N0.getOperand(0));
Scott Michelfdc40a02009-02-17 22:15:04 +00003967
Chris Lattner22558872007-02-26 03:13:59 +00003968 if (N0.getOpcode() == ISD::TRUNCATE) {
Dan Gohman1fdfa6a2008-05-20 20:56:33 +00003969 // fold (sext (truncate (load x))) -> (sext (smaller load x))
3970 // fold (sext (truncate (srl (load x), c))) -> (sext (smaller load (x+c/n)))
Gabor Greifba36cb52008-08-28 21:40:38 +00003971 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode());
3972 if (NarrowLoad.getNode()) {
Dale Johannesen61734eb2010-05-25 17:50:03 +00003973 SDNode* oye = N0.getNode()->getOperand(0).getNode();
3974 if (NarrowLoad.getNode() != N0.getNode()) {
Gabor Greifba36cb52008-08-28 21:40:38 +00003975 CombineTo(N0.getNode(), NarrowLoad);
Dale Johannesen61734eb2010-05-25 17:50:03 +00003976 // CombineTo deleted the truncate, if needed, but not what's under it.
3977 AddToWorkList(oye);
3978 }
Dan Gohmanc7b34442009-04-27 02:00:55 +00003979 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng0b063de2007-03-23 02:16:52 +00003980 }
Evan Chengc88138f2007-03-22 01:54:19 +00003981
Dan Gohman1fdfa6a2008-05-20 20:56:33 +00003982 // See if the value being truncated is already sign extended. If so, just
3983 // eliminate the trunc/sext pair.
Dan Gohman475871a2008-07-27 21:46:04 +00003984 SDValue Op = N0.getOperand(0);
Dan Gohmand1996362010-01-09 02:13:55 +00003985 unsigned OpBits = Op.getValueType().getScalarType().getSizeInBits();
3986 unsigned MidBits = N0.getValueType().getScalarType().getSizeInBits();
3987 unsigned DestBits = VT.getScalarType().getSizeInBits();
Dan Gohmanea859be2007-06-22 14:59:07 +00003988 unsigned NumSignBits = DAG.ComputeNumSignBits(Op);
Scott Michelfdc40a02009-02-17 22:15:04 +00003989
Chris Lattner22558872007-02-26 03:13:59 +00003990 if (OpBits == DestBits) {
3991 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
3992 // bits, it is already ready.
3993 if (NumSignBits > DestBits-MidBits)
3994 return Op;
3995 } else if (OpBits < DestBits) {
3996 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
3997 // bits, just sext from i32.
3998 if (NumSignBits > OpBits-MidBits)
Bill Wendling6ce610f2009-01-30 22:23:15 +00003999 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, Op);
Chris Lattner22558872007-02-26 03:13:59 +00004000 } else {
4001 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
4002 // bits, just truncate to i32.
4003 if (NumSignBits > OpBits-MidBits)
Bill Wendling6ce610f2009-01-30 22:23:15 +00004004 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Op);
Chris Lattner6007b842006-09-21 06:00:20 +00004005 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004006
Chris Lattner22558872007-02-26 03:13:59 +00004007 // fold (sext (truncate x)) -> (sextinreg x).
Duncan Sands25cf2272008-11-24 14:53:14 +00004008 if (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG,
4009 N0.getValueType())) {
Dan Gohmand1996362010-01-09 02:13:55 +00004010 if (OpBits < DestBits)
Bill Wendling6ce610f2009-01-30 22:23:15 +00004011 Op = DAG.getNode(ISD::ANY_EXTEND, N0.getDebugLoc(), VT, Op);
Dan Gohmand1996362010-01-09 02:13:55 +00004012 else if (OpBits > DestBits)
Bill Wendling6ce610f2009-01-30 22:23:15 +00004013 Op = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), VT, Op);
4014 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, Op,
Dan Gohmand1996362010-01-09 02:13:55 +00004015 DAG.getValueType(N0.getValueType()));
Chris Lattner22558872007-02-26 03:13:59 +00004016 }
Chris Lattner6007b842006-09-21 06:00:20 +00004017 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004018
Evan Cheng110dec22005-12-14 02:19:23 +00004019 // fold (sext (load x)) -> (sext (truncate (sextload x)))
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004020 // None of the supported targets knows how to perform load and sign extend
Nadav Rotemfcd96192011-02-27 07:40:43 +00004021 // on vectors in one instruction. We only perform this transformation on
4022 // scalars.
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004023 if (ISD::isNON_EXTLoad(N0.getNode()) && !VT.isVector() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004024 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00004025 TLI.isLoadExtLegal(ISD::SEXTLOAD, N0.getValueType()))) {
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004026 bool DoXform = true;
4027 SmallVector<SDNode*, 4> SetCCs;
4028 if (!N0.hasOneUse())
4029 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::SIGN_EXTEND, SetCCs, TLI);
4030 if (DoXform) {
4031 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00004032 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, N->getDebugLoc(), VT,
Dan Gohman57fc82d2009-04-09 03:51:29 +00004033 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004034 LN0->getBasePtr(), LN0->getPointerInfo(),
Duncan Sands25cf2272008-11-24 14:53:14 +00004035 N0.getValueType(),
David Greene1e559442010-02-15 17:00:31 +00004036 LN0->isVolatile(), LN0->isNonTemporal(),
4037 LN0->getAlignment());
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004038 CombineTo(N, ExtLoad);
Bill Wendling6ce610f2009-01-30 22:23:15 +00004039 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(),
4040 N0.getValueType(), ExtLoad);
Gabor Greifba36cb52008-08-28 21:40:38 +00004041 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00004042 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, N->getDebugLoc(),
4043 ISD::SIGN_EXTEND);
Dan Gohman475871a2008-07-27 21:46:04 +00004044 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004045 }
Nate Begeman3df4d522005-10-12 20:40:40 +00004046 }
Chris Lattnerad25d4e2005-12-14 19:05:06 +00004047
4048 // fold (sext (sextload x)) -> (sext (truncate (sextload x)))
4049 // fold (sext ( extload x)) -> (sext (truncate (sextload x)))
Gabor Greifba36cb52008-08-28 21:40:38 +00004050 if ((ISD::isSEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) &&
4051 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) {
Evan Cheng466685d2006-10-09 20:57:25 +00004052 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman8a55ce42009-09-23 21:02:20 +00004053 EVT MemVT = LN0->getMemoryVT();
Duncan Sands25cf2272008-11-24 14:53:14 +00004054 if ((!LegalOperations && !LN0->isVolatile()) ||
Dan Gohman8a55ce42009-09-23 21:02:20 +00004055 TLI.isLoadExtLegal(ISD::SEXTLOAD, MemVT)) {
Stuart Hastingsa9011292011-02-16 16:23:55 +00004056 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, N->getDebugLoc(), VT,
Bill Wendling6ce610f2009-01-30 22:23:15 +00004057 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004058 LN0->getBasePtr(), LN0->getPointerInfo(),
4059 MemVT,
David Greene1e559442010-02-15 17:00:31 +00004060 LN0->isVolatile(), LN0->isNonTemporal(),
4061 LN0->getAlignment());
Jim Laskeyf6c4ccf2006-12-15 21:38:30 +00004062 CombineTo(N, ExtLoad);
Gabor Greif12632d22008-08-30 19:29:20 +00004063 CombineTo(N0.getNode(),
Bill Wendling6ce610f2009-01-30 22:23:15 +00004064 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(),
4065 N0.getValueType(), ExtLoad),
Jim Laskeyf6c4ccf2006-12-15 21:38:30 +00004066 ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00004067 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Jim Laskeyf6c4ccf2006-12-15 21:38:30 +00004068 }
Chris Lattnerad25d4e2005-12-14 19:05:06 +00004069 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004070
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00004071 // fold (sext (and/or/xor (load x), cst)) ->
4072 // (and/or/xor (sextload x), (sext cst))
4073 if ((N0.getOpcode() == ISD::AND || N0.getOpcode() == ISD::OR ||
4074 N0.getOpcode() == ISD::XOR) &&
4075 isa<LoadSDNode>(N0.getOperand(0)) &&
4076 N0.getOperand(1).getOpcode() == ISD::Constant &&
4077 TLI.isLoadExtLegal(ISD::SEXTLOAD, N0.getValueType()) &&
4078 (!LegalOperations && TLI.isOperationLegal(N0.getOpcode(), VT))) {
4079 LoadSDNode *LN0 = cast<LoadSDNode>(N0.getOperand(0));
4080 if (LN0->getExtensionType() != ISD::ZEXTLOAD) {
4081 bool DoXform = true;
4082 SmallVector<SDNode*, 4> SetCCs;
4083 if (!N0.hasOneUse())
4084 DoXform = ExtendUsesToFormExtLoad(N, N0.getOperand(0), ISD::SIGN_EXTEND,
4085 SetCCs, TLI);
4086 if (DoXform) {
4087 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, LN0->getDebugLoc(), VT,
4088 LN0->getChain(), LN0->getBasePtr(),
4089 LN0->getPointerInfo(),
4090 LN0->getMemoryVT(),
4091 LN0->isVolatile(),
4092 LN0->isNonTemporal(),
4093 LN0->getAlignment());
4094 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
4095 Mask = Mask.sext(VT.getSizeInBits());
4096 SDValue And = DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT,
4097 ExtLoad, DAG.getConstant(Mask, VT));
4098 SDValue Trunc = DAG.getNode(ISD::TRUNCATE,
4099 N0.getOperand(0).getDebugLoc(),
4100 N0.getOperand(0).getValueType(), ExtLoad);
4101 CombineTo(N, And);
4102 CombineTo(N0.getOperand(0).getNode(), Trunc, ExtLoad.getValue(1));
4103 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, N->getDebugLoc(),
4104 ISD::SIGN_EXTEND);
4105 return SDValue(N, 0); // Return N so it doesn't get rechecked!
4106 }
4107 }
4108 }
4109
Chris Lattner20a35c32007-04-11 05:32:27 +00004110 if (N0.getOpcode() == ISD::SETCC) {
Chris Lattner2b7a2712009-07-08 00:31:33 +00004111 // sext(setcc) -> sext_in_reg(vsetcc) for vectors.
Dan Gohman3ce89f42010-04-30 17:19:19 +00004112 // Only do this before legalize for now.
4113 if (VT.isVector() && !LegalOperations) {
4114 EVT N0VT = N0.getOperand(0).getValueType();
Chris Lattner2b7a2712009-07-08 00:31:33 +00004115 // We know that the # elements of the results is the same as the
4116 // # elements of the compare (and the # elements of the compare result
4117 // for that matter). Check to see that they are the same size. If so,
4118 // we know that the element size of the sext'd result matches the
4119 // element size of the compare operands.
Dan Gohman3ce89f42010-04-30 17:19:19 +00004120 if (VT.getSizeInBits() == N0VT.getSizeInBits())
Duncan Sands34727662010-07-12 08:16:59 +00004121 return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
4122 N0.getOperand(1),
4123 cast<CondCodeSDNode>(N0.getOperand(2))->get());
Dan Gohman3ce89f42010-04-30 17:19:19 +00004124 // If the desired elements are smaller or larger than the source
4125 // elements we can use a matching integer vector type and then
4126 // truncate/sign extend
4127 else {
Duncan Sands34727662010-07-12 08:16:59 +00004128 EVT MatchingElementType =
4129 EVT::getIntegerVT(*DAG.getContext(),
4130 N0VT.getScalarType().getSizeInBits());
4131 EVT MatchingVectorType =
4132 EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
4133 N0VT.getVectorNumElements());
4134 SDValue VsetCC =
4135 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
4136 N0.getOperand(1),
4137 cast<CondCodeSDNode>(N0.getOperand(2))->get());
4138 return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
Dan Gohman3ce89f42010-04-30 17:19:19 +00004139 }
Chris Lattner2b7a2712009-07-08 00:31:33 +00004140 }
Dan Gohman3ce89f42010-04-30 17:19:19 +00004141
Chris Lattner2b7a2712009-07-08 00:31:33 +00004142 // sext(setcc x, y, cc) -> (select_cc x, y, -1, 0, cc)
Dan Gohmana7bcef12010-04-24 01:17:30 +00004143 unsigned ElementWidth = VT.getScalarType().getSizeInBits();
Dan Gohman5cbd37e2009-08-06 09:18:59 +00004144 SDValue NegOne =
Dan Gohmana7bcef12010-04-24 01:17:30 +00004145 DAG.getConstant(APInt::getAllOnesValue(ElementWidth), VT);
Scott Michelfdc40a02009-02-17 22:15:04 +00004146 SDValue SCC =
Bill Wendling836ca7d2009-01-30 23:59:18 +00004147 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1),
Dan Gohman5cbd37e2009-08-06 09:18:59 +00004148 NegOne, DAG.getConstant(0, VT),
Chris Lattner1eba01e2007-04-11 06:50:51 +00004149 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true);
Gabor Greifba36cb52008-08-28 21:40:38 +00004150 if (SCC.getNode()) return SCC;
Evan Cheng8c7ecaf2010-01-26 02:00:44 +00004151 if (!LegalOperations ||
4152 TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultType(VT)))
4153 return DAG.getNode(ISD::SELECT, N->getDebugLoc(), VT,
4154 DAG.getSetCC(N->getDebugLoc(),
4155 TLI.getSetCCResultType(VT),
4156 N0.getOperand(0), N0.getOperand(1),
4157 cast<CondCodeSDNode>(N0.getOperand(2))->get()),
4158 NegOne, DAG.getConstant(0, VT));
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004159 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004160
Dan Gohman8f0ad582008-04-28 16:58:24 +00004161 // fold (sext x) -> (zext x) if the sign bit is known zero.
Duncan Sands25cf2272008-11-24 14:53:14 +00004162 if ((!LegalOperations || TLI.isOperationLegal(ISD::ZERO_EXTEND, VT)) &&
Dan Gohman187db7b2008-04-28 18:47:17 +00004163 DAG.SignBitIsZero(N0))
Bill Wendling6ce610f2009-01-30 22:23:15 +00004164 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00004165
Evan Chengb3a3d5e2010-04-28 07:10:39 +00004166 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00004167}
4168
Dan Gohman475871a2008-07-27 21:46:04 +00004169SDValue DAGCombiner::visitZERO_EXTEND(SDNode *N) {
4170 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00004171 EVT VT = N->getValueType(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00004172
Nate Begeman1d4d4142005-09-01 00:19:25 +00004173 // fold (zext c1) -> c1
Reid Spencer3ed469c2006-11-02 20:25:50 +00004174 if (isa<ConstantSDNode>(N0))
Bill Wendling6ce610f2009-01-30 22:23:15 +00004175 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00004176 // fold (zext (zext x)) -> (zext x)
Chris Lattner310b5782006-05-06 23:06:26 +00004177 // fold (zext (aext x)) -> (zext x)
4178 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
Bill Wendling6ce610f2009-01-30 22:23:15 +00004179 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT,
4180 N0.getOperand(0));
Chris Lattner6007b842006-09-21 06:00:20 +00004181
Evan Chengc88138f2007-03-22 01:54:19 +00004182 // fold (zext (truncate (load x))) -> (zext (smaller load x))
4183 // fold (zext (truncate (srl (load x), c))) -> (zext (small load (x+c/n)))
Dale Johannesen2041a0e2007-03-30 21:38:07 +00004184 if (N0.getOpcode() == ISD::TRUNCATE) {
Gabor Greifba36cb52008-08-28 21:40:38 +00004185 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode());
4186 if (NarrowLoad.getNode()) {
Dale Johannesen61734eb2010-05-25 17:50:03 +00004187 SDNode* oye = N0.getNode()->getOperand(0).getNode();
4188 if (NarrowLoad.getNode() != N0.getNode()) {
Gabor Greifba36cb52008-08-28 21:40:38 +00004189 CombineTo(N0.getNode(), NarrowLoad);
Dale Johannesen61734eb2010-05-25 17:50:03 +00004190 // CombineTo deleted the truncate, if needed, but not what's under it.
4191 AddToWorkList(oye);
4192 }
Eli Friedmane545d382011-04-16 23:25:34 +00004193 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng0b063de2007-03-23 02:16:52 +00004194 }
Evan Chengc88138f2007-03-22 01:54:19 +00004195 }
4196
Chris Lattner6007b842006-09-21 06:00:20 +00004197 // fold (zext (truncate x)) -> (and x, mask)
4198 if (N0.getOpcode() == ISD::TRUNCATE &&
Dan Gohman4e39e9d2010-06-24 14:30:44 +00004199 (!LegalOperations || TLI.isOperationLegal(ISD::AND, VT))) {
Dan Gohman394d6292010-11-03 01:47:46 +00004200
4201 // fold (zext (truncate (load x))) -> (zext (smaller load x))
4202 // fold (zext (truncate (srl (load x), c))) -> (zext (smaller load (x+c/n)))
4203 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode());
4204 if (NarrowLoad.getNode()) {
4205 SDNode* oye = N0.getNode()->getOperand(0).getNode();
4206 if (NarrowLoad.getNode() != N0.getNode()) {
4207 CombineTo(N0.getNode(), NarrowLoad);
4208 // CombineTo deleted the truncate, if needed, but not what's under it.
4209 AddToWorkList(oye);
4210 }
4211 return SDValue(N, 0); // Return N so it doesn't get rechecked!
4212 }
4213
Dan Gohman475871a2008-07-27 21:46:04 +00004214 SDValue Op = N0.getOperand(0);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004215 if (Op.getValueType().bitsLT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004216 Op = DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, Op);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004217 } else if (Op.getValueType().bitsGT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004218 Op = DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Op);
Chris Lattner6007b842006-09-21 06:00:20 +00004219 }
Dan Gohman87862e72009-12-11 21:31:27 +00004220 return DAG.getZeroExtendInReg(Op, N->getDebugLoc(),
4221 N0.getValueType().getScalarType());
Chris Lattner6007b842006-09-21 06:00:20 +00004222 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004223
Dan Gohman97121ba2009-04-08 00:15:30 +00004224 // Fold (zext (and (trunc x), cst)) -> (and x, cst),
4225 // if either of the casts is not free.
Chris Lattner111c2282006-09-21 06:14:31 +00004226 if (N0.getOpcode() == ISD::AND &&
4227 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
Dan Gohman97121ba2009-04-08 00:15:30 +00004228 N0.getOperand(1).getOpcode() == ISD::Constant &&
4229 (!TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(),
4230 N0.getValueType()) ||
4231 !TLI.isZExtFree(N0.getValueType(), VT))) {
Dan Gohman475871a2008-07-27 21:46:04 +00004232 SDValue X = N0.getOperand(0).getOperand(0);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004233 if (X.getValueType().bitsLT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004234 X = DAG.getNode(ISD::ANY_EXTEND, X.getDebugLoc(), VT, X);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004235 } else if (X.getValueType().bitsGT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004236 X = DAG.getNode(ISD::TRUNCATE, X.getDebugLoc(), VT, X);
Chris Lattner111c2282006-09-21 06:14:31 +00004237 }
Dan Gohman220a8232008-03-03 23:51:38 +00004238 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00004239 Mask = Mask.zext(VT.getSizeInBits());
Bill Wendling6ce610f2009-01-30 22:23:15 +00004240 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
4241 X, DAG.getConstant(Mask, VT));
Chris Lattner111c2282006-09-21 06:14:31 +00004242 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004243
Evan Cheng110dec22005-12-14 02:19:23 +00004244 // fold (zext (load x)) -> (zext (truncate (zextload x)))
Nadav Rotemed9b9342011-02-20 12:37:50 +00004245 // None of the supported targets knows how to perform load and vector_zext
Nadav Rotemfcd96192011-02-27 07:40:43 +00004246 // on vectors in one instruction. We only perform this transformation on
4247 // scalars.
Nadav Rotemed9b9342011-02-20 12:37:50 +00004248 if (ISD::isNON_EXTLoad(N0.getNode()) && !VT.isVector() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004249 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00004250 TLI.isLoadExtLegal(ISD::ZEXTLOAD, N0.getValueType()))) {
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004251 bool DoXform = true;
4252 SmallVector<SDNode*, 4> SetCCs;
4253 if (!N0.hasOneUse())
4254 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ZERO_EXTEND, SetCCs, TLI);
4255 if (DoXform) {
4256 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00004257 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, N->getDebugLoc(), VT,
Bill Wendling6ce610f2009-01-30 22:23:15 +00004258 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004259 LN0->getBasePtr(), LN0->getPointerInfo(),
Duncan Sands25cf2272008-11-24 14:53:14 +00004260 N0.getValueType(),
David Greene1e559442010-02-15 17:00:31 +00004261 LN0->isVolatile(), LN0->isNonTemporal(),
4262 LN0->getAlignment());
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004263 CombineTo(N, ExtLoad);
Bill Wendling6ce610f2009-01-30 22:23:15 +00004264 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(),
4265 N0.getValueType(), ExtLoad);
Gabor Greifba36cb52008-08-28 21:40:38 +00004266 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
Bill Wendling6ce610f2009-01-30 22:23:15 +00004267
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00004268 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, N->getDebugLoc(),
4269 ISD::ZERO_EXTEND);
Dan Gohman475871a2008-07-27 21:46:04 +00004270 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng3c3ddb32007-10-29 19:58:20 +00004271 }
Evan Cheng110dec22005-12-14 02:19:23 +00004272 }
Chris Lattnerad25d4e2005-12-14 19:05:06 +00004273
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00004274 // fold (zext (and/or/xor (load x), cst)) ->
4275 // (and/or/xor (zextload x), (zext cst))
4276 if ((N0.getOpcode() == ISD::AND || N0.getOpcode() == ISD::OR ||
4277 N0.getOpcode() == ISD::XOR) &&
4278 isa<LoadSDNode>(N0.getOperand(0)) &&
4279 N0.getOperand(1).getOpcode() == ISD::Constant &&
4280 TLI.isLoadExtLegal(ISD::ZEXTLOAD, N0.getValueType()) &&
4281 (!LegalOperations && TLI.isOperationLegal(N0.getOpcode(), VT))) {
4282 LoadSDNode *LN0 = cast<LoadSDNode>(N0.getOperand(0));
4283 if (LN0->getExtensionType() != ISD::SEXTLOAD) {
4284 bool DoXform = true;
4285 SmallVector<SDNode*, 4> SetCCs;
4286 if (!N0.hasOneUse())
4287 DoXform = ExtendUsesToFormExtLoad(N, N0.getOperand(0), ISD::ZERO_EXTEND,
4288 SetCCs, TLI);
4289 if (DoXform) {
4290 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, LN0->getDebugLoc(), VT,
4291 LN0->getChain(), LN0->getBasePtr(),
4292 LN0->getPointerInfo(),
4293 LN0->getMemoryVT(),
4294 LN0->isVolatile(),
4295 LN0->isNonTemporal(),
4296 LN0->getAlignment());
4297 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
4298 Mask = Mask.zext(VT.getSizeInBits());
4299 SDValue And = DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT,
4300 ExtLoad, DAG.getConstant(Mask, VT));
4301 SDValue Trunc = DAG.getNode(ISD::TRUNCATE,
4302 N0.getOperand(0).getDebugLoc(),
4303 N0.getOperand(0).getValueType(), ExtLoad);
4304 CombineTo(N, And);
4305 CombineTo(N0.getOperand(0).getNode(), Trunc, ExtLoad.getValue(1));
4306 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, N->getDebugLoc(),
4307 ISD::ZERO_EXTEND);
4308 return SDValue(N, 0); // Return N so it doesn't get rechecked!
4309 }
4310 }
4311 }
4312
Chris Lattnerad25d4e2005-12-14 19:05:06 +00004313 // fold (zext (zextload x)) -> (zext (truncate (zextload x)))
4314 // fold (zext ( extload x)) -> (zext (truncate (zextload x)))
Gabor Greifba36cb52008-08-28 21:40:38 +00004315 if ((ISD::isZEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) &&
4316 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) {
Evan Cheng466685d2006-10-09 20:57:25 +00004317 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman8a55ce42009-09-23 21:02:20 +00004318 EVT MemVT = LN0->getMemoryVT();
Duncan Sands25cf2272008-11-24 14:53:14 +00004319 if ((!LegalOperations && !LN0->isVolatile()) ||
Dan Gohman8a55ce42009-09-23 21:02:20 +00004320 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT)) {
Stuart Hastingsa9011292011-02-16 16:23:55 +00004321 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, N->getDebugLoc(), VT,
Bill Wendling6ce610f2009-01-30 22:23:15 +00004322 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004323 LN0->getBasePtr(), LN0->getPointerInfo(),
4324 MemVT,
David Greene1e559442010-02-15 17:00:31 +00004325 LN0->isVolatile(), LN0->isNonTemporal(),
4326 LN0->getAlignment());
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004327 CombineTo(N, ExtLoad);
Gabor Greif12632d22008-08-30 19:29:20 +00004328 CombineTo(N0.getNode(),
Bill Wendling6ce610f2009-01-30 22:23:15 +00004329 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), N0.getValueType(),
4330 ExtLoad),
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004331 ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00004332 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004333 }
Chris Lattnerad25d4e2005-12-14 19:05:06 +00004334 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004335
Chris Lattner20a35c32007-04-11 05:32:27 +00004336 if (N0.getOpcode() == ISD::SETCC) {
Evan Cheng0a942db2010-05-19 01:08:17 +00004337 if (!LegalOperations && VT.isVector()) {
4338 // zext(setcc) -> (and (vsetcc), (1, 1, ...) for vectors.
4339 // Only do this before legalize for now.
4340 EVT N0VT = N0.getOperand(0).getValueType();
4341 EVT EltVT = VT.getVectorElementType();
4342 SmallVector<SDValue,8> OneOps(VT.getVectorNumElements(),
4343 DAG.getConstant(1, EltVT));
Dan Gohman71dc7c92011-05-17 22:20:36 +00004344 if (VT.getSizeInBits() == N0VT.getSizeInBits())
Evan Cheng0a942db2010-05-19 01:08:17 +00004345 // We know that the # elements of the results is the same as the
4346 // # elements of the compare (and the # elements of the compare result
4347 // for that matter). Check to see that they are the same size. If so,
4348 // we know that the element size of the sext'd result matches the
4349 // element size of the compare operands.
4350 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
4351 DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
4352 N0.getOperand(1),
4353 cast<CondCodeSDNode>(N0.getOperand(2))->get()),
4354 DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT,
4355 &OneOps[0], OneOps.size()));
Dan Gohman71dc7c92011-05-17 22:20:36 +00004356
4357 // If the desired elements are smaller or larger than the source
4358 // elements we can use a matching integer vector type and then
4359 // truncate/sign extend
4360 EVT MatchingElementType =
4361 EVT::getIntegerVT(*DAG.getContext(),
4362 N0VT.getScalarType().getSizeInBits());
4363 EVT MatchingVectorType =
4364 EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
4365 N0VT.getVectorNumElements());
4366 SDValue VsetCC =
4367 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
4368 N0.getOperand(1),
4369 cast<CondCodeSDNode>(N0.getOperand(2))->get());
4370 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
4371 DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT),
4372 DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT,
4373 &OneOps[0], OneOps.size()));
Evan Cheng0a942db2010-05-19 01:08:17 +00004374 }
4375
4376 // zext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc
Scott Michelfdc40a02009-02-17 22:15:04 +00004377 SDValue SCC =
Bill Wendling836ca7d2009-01-30 23:59:18 +00004378 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1),
Chris Lattner20a35c32007-04-11 05:32:27 +00004379 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
Chris Lattner1eba01e2007-04-11 06:50:51 +00004380 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true);
Gabor Greifba36cb52008-08-28 21:40:38 +00004381 if (SCC.getNode()) return SCC;
Chris Lattner20a35c32007-04-11 05:32:27 +00004382 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004383
Evan Cheng9818c042009-12-15 03:00:32 +00004384 // (zext (shl (zext x), cst)) -> (shl (zext x), cst)
Evan Cheng99b653c2009-12-15 00:41:36 +00004385 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL) &&
Evan Cheng9818c042009-12-15 03:00:32 +00004386 isa<ConstantSDNode>(N0.getOperand(1)) &&
Evan Cheng99b653c2009-12-15 00:41:36 +00004387 N0.getOperand(0).getOpcode() == ISD::ZERO_EXTEND &&
4388 N0.hasOneUse()) {
Chris Lattnere0751182011-02-13 19:09:16 +00004389 SDValue ShAmt = N0.getOperand(1);
4390 unsigned ShAmtVal = cast<ConstantSDNode>(ShAmt)->getZExtValue();
Evan Cheng9818c042009-12-15 03:00:32 +00004391 if (N0.getOpcode() == ISD::SHL) {
Chris Lattnere0751182011-02-13 19:09:16 +00004392 SDValue InnerZExt = N0.getOperand(0);
Evan Cheng9818c042009-12-15 03:00:32 +00004393 // If the original shl may be shifting out bits, do not perform this
4394 // transformation.
Chris Lattnere0751182011-02-13 19:09:16 +00004395 unsigned KnownZeroBits = InnerZExt.getValueType().getSizeInBits() -
4396 InnerZExt.getOperand(0).getValueType().getSizeInBits();
4397 if (ShAmtVal > KnownZeroBits)
Evan Cheng9818c042009-12-15 03:00:32 +00004398 return SDValue();
4399 }
Chris Lattnere0751182011-02-13 19:09:16 +00004400
4401 DebugLoc DL = N->getDebugLoc();
Owen Anderson95771af2011-02-25 21:41:48 +00004402
4403 // Ensure that the shift amount is wide enough for the shifted value.
Chris Lattnere0751182011-02-13 19:09:16 +00004404 if (VT.getSizeInBits() >= 256)
4405 ShAmt = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, ShAmt);
Owen Anderson95771af2011-02-25 21:41:48 +00004406
Chris Lattnere0751182011-02-13 19:09:16 +00004407 return DAG.getNode(N0.getOpcode(), DL, VT,
4408 DAG.getNode(ISD::ZERO_EXTEND, DL, VT, N0.getOperand(0)),
4409 ShAmt);
Evan Cheng99b653c2009-12-15 00:41:36 +00004410 }
4411
Evan Chengb3a3d5e2010-04-28 07:10:39 +00004412 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00004413}
4414
Dan Gohman475871a2008-07-27 21:46:04 +00004415SDValue DAGCombiner::visitANY_EXTEND(SDNode *N) {
4416 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00004417 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00004418
Chris Lattner5ffc0662006-05-05 05:58:59 +00004419 // fold (aext c1) -> c1
Chris Lattner310b5782006-05-06 23:06:26 +00004420 if (isa<ConstantSDNode>(N0))
Bill Wendlingfc4b6772009-02-01 11:19:36 +00004421 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, N0);
Chris Lattner5ffc0662006-05-05 05:58:59 +00004422 // fold (aext (aext x)) -> (aext x)
4423 // fold (aext (zext x)) -> (zext x)
4424 // fold (aext (sext x)) -> (sext x)
4425 if (N0.getOpcode() == ISD::ANY_EXTEND ||
4426 N0.getOpcode() == ISD::ZERO_EXTEND ||
4427 N0.getOpcode() == ISD::SIGN_EXTEND)
Bill Wendling683c9572009-01-30 22:27:33 +00004428 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, N0.getOperand(0));
Scott Michelfdc40a02009-02-17 22:15:04 +00004429
Evan Chengc88138f2007-03-22 01:54:19 +00004430 // fold (aext (truncate (load x))) -> (aext (smaller load x))
4431 // fold (aext (truncate (srl (load x), c))) -> (aext (small load (x+c/n)))
4432 if (N0.getOpcode() == ISD::TRUNCATE) {
Gabor Greifba36cb52008-08-28 21:40:38 +00004433 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode());
4434 if (NarrowLoad.getNode()) {
Dale Johannesen86234c32010-05-25 18:47:23 +00004435 SDNode* oye = N0.getNode()->getOperand(0).getNode();
4436 if (NarrowLoad.getNode() != N0.getNode()) {
Gabor Greifba36cb52008-08-28 21:40:38 +00004437 CombineTo(N0.getNode(), NarrowLoad);
Dale Johannesen86234c32010-05-25 18:47:23 +00004438 // CombineTo deleted the truncate, if needed, but not what's under it.
4439 AddToWorkList(oye);
4440 }
Eli Friedmane545d382011-04-16 23:25:34 +00004441 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng0b063de2007-03-23 02:16:52 +00004442 }
Evan Chengc88138f2007-03-22 01:54:19 +00004443 }
4444
Chris Lattner84750582006-09-20 06:29:17 +00004445 // fold (aext (truncate x))
4446 if (N0.getOpcode() == ISD::TRUNCATE) {
Dan Gohman475871a2008-07-27 21:46:04 +00004447 SDValue TruncOp = N0.getOperand(0);
Chris Lattner84750582006-09-20 06:29:17 +00004448 if (TruncOp.getValueType() == VT)
4449 return TruncOp; // x iff x size == zext size.
Duncan Sands8e4eb092008-06-08 20:54:56 +00004450 if (TruncOp.getValueType().bitsGT(VT))
Bill Wendling683c9572009-01-30 22:27:33 +00004451 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, TruncOp);
4452 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, TruncOp);
Chris Lattner84750582006-09-20 06:29:17 +00004453 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004454
Dan Gohman97121ba2009-04-08 00:15:30 +00004455 // Fold (aext (and (trunc x), cst)) -> (and x, cst)
4456 // if the trunc is not free.
Chris Lattner0e4b9222006-09-21 06:40:43 +00004457 if (N0.getOpcode() == ISD::AND &&
4458 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
Dan Gohman97121ba2009-04-08 00:15:30 +00004459 N0.getOperand(1).getOpcode() == ISD::Constant &&
4460 !TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(),
4461 N0.getValueType())) {
Dan Gohman475871a2008-07-27 21:46:04 +00004462 SDValue X = N0.getOperand(0).getOperand(0);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004463 if (X.getValueType().bitsLT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004464 X = DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, X);
Duncan Sands8e4eb092008-06-08 20:54:56 +00004465 } else if (X.getValueType().bitsGT(VT)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00004466 X = DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, X);
Chris Lattner0e4b9222006-09-21 06:40:43 +00004467 }
Dan Gohman220a8232008-03-03 23:51:38 +00004468 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
Jay Foad40f8f622010-12-07 08:25:19 +00004469 Mask = Mask.zext(VT.getSizeInBits());
Bill Wendling683c9572009-01-30 22:27:33 +00004470 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
4471 X, DAG.getConstant(Mask, VT));
Chris Lattner0e4b9222006-09-21 06:40:43 +00004472 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004473
Chris Lattner5ffc0662006-05-05 05:58:59 +00004474 // fold (aext (load x)) -> (aext (truncate (extload x)))
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004475 // None of the supported targets knows how to perform load and any_ext
Nadav Rotemfcd96192011-02-27 07:40:43 +00004476 // on vectors in one instruction. We only perform this transformation on
4477 // scalars.
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004478 if (ISD::isNON_EXTLoad(N0.getNode()) && !VT.isVector() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004479 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00004480 TLI.isLoadExtLegal(ISD::EXTLOAD, N0.getValueType()))) {
Dan Gohman57fc82d2009-04-09 03:51:29 +00004481 bool DoXform = true;
4482 SmallVector<SDNode*, 4> SetCCs;
4483 if (!N0.hasOneUse())
4484 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ANY_EXTEND, SetCCs, TLI);
4485 if (DoXform) {
4486 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00004487 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, N->getDebugLoc(), VT,
Dan Gohman57fc82d2009-04-09 03:51:29 +00004488 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004489 LN0->getBasePtr(), LN0->getPointerInfo(),
Dan Gohman57fc82d2009-04-09 03:51:29 +00004490 N0.getValueType(),
David Greene1e559442010-02-15 17:00:31 +00004491 LN0->isVolatile(), LN0->isNonTemporal(),
4492 LN0->getAlignment());
Dan Gohman57fc82d2009-04-09 03:51:29 +00004493 CombineTo(N, ExtLoad);
4494 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(),
4495 N0.getValueType(), ExtLoad);
4496 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
Nick Lewyckyc06b5bf2011-06-16 01:15:49 +00004497 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, N->getDebugLoc(),
4498 ISD::ANY_EXTEND);
Dan Gohman57fc82d2009-04-09 03:51:29 +00004499 return SDValue(N, 0); // Return N so it doesn't get rechecked!
4500 }
Chris Lattner5ffc0662006-05-05 05:58:59 +00004501 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004502
Chris Lattner5ffc0662006-05-05 05:58:59 +00004503 // fold (aext (zextload x)) -> (aext (truncate (zextload x)))
4504 // fold (aext (sextload x)) -> (aext (truncate (sextload x)))
4505 // fold (aext ( extload x)) -> (aext (truncate (extload x)))
Evan Cheng83060c52007-03-07 08:07:03 +00004506 if (N0.getOpcode() == ISD::LOAD &&
Gabor Greifba36cb52008-08-28 21:40:38 +00004507 !ISD::isNON_EXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
Evan Cheng466685d2006-10-09 20:57:25 +00004508 N0.hasOneUse()) {
4509 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman8a55ce42009-09-23 21:02:20 +00004510 EVT MemVT = LN0->getMemoryVT();
Stuart Hastingsa9011292011-02-16 16:23:55 +00004511 SDValue ExtLoad = DAG.getExtLoad(LN0->getExtensionType(), N->getDebugLoc(),
4512 VT, LN0->getChain(), LN0->getBasePtr(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004513 LN0->getPointerInfo(), MemVT,
David Greene1e559442010-02-15 17:00:31 +00004514 LN0->isVolatile(), LN0->isNonTemporal(),
4515 LN0->getAlignment());
Chris Lattner5ffc0662006-05-05 05:58:59 +00004516 CombineTo(N, ExtLoad);
Evan Cheng45299662008-08-29 23:20:46 +00004517 CombineTo(N0.getNode(),
Bill Wendling683c9572009-01-30 22:27:33 +00004518 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(),
4519 N0.getValueType(), ExtLoad),
Chris Lattner5ffc0662006-05-05 05:58:59 +00004520 ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00004521 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Chris Lattner5ffc0662006-05-05 05:58:59 +00004522 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004523
Chris Lattner20a35c32007-04-11 05:32:27 +00004524 if (N0.getOpcode() == ISD::SETCC) {
Evan Cheng0a942db2010-05-19 01:08:17 +00004525 // aext(setcc) -> sext_in_reg(vsetcc) for vectors.
4526 // Only do this before legalize for now.
4527 if (VT.isVector() && !LegalOperations) {
4528 EVT N0VT = N0.getOperand(0).getValueType();
4529 // We know that the # elements of the results is the same as the
4530 // # elements of the compare (and the # elements of the compare result
4531 // for that matter). Check to see that they are the same size. If so,
4532 // we know that the element size of the sext'd result matches the
4533 // element size of the compare operands.
4534 if (VT.getSizeInBits() == N0VT.getSizeInBits())
Duncan Sands34727662010-07-12 08:16:59 +00004535 return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0),
4536 N0.getOperand(1),
4537 cast<CondCodeSDNode>(N0.getOperand(2))->get());
Evan Cheng0a942db2010-05-19 01:08:17 +00004538 // If the desired elements are smaller or larger than the source
4539 // elements we can use a matching integer vector type and then
4540 // truncate/sign extend
4541 else {
Duncan Sands34727662010-07-12 08:16:59 +00004542 EVT MatchingElementType =
4543 EVT::getIntegerVT(*DAG.getContext(),
4544 N0VT.getScalarType().getSizeInBits());
4545 EVT MatchingVectorType =
4546 EVT::getVectorVT(*DAG.getContext(), MatchingElementType,
4547 N0VT.getVectorNumElements());
4548 SDValue VsetCC =
4549 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0),
4550 N0.getOperand(1),
4551 cast<CondCodeSDNode>(N0.getOperand(2))->get());
4552 return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT);
Evan Cheng0a942db2010-05-19 01:08:17 +00004553 }
4554 }
4555
4556 // aext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc
Scott Michelfdc40a02009-02-17 22:15:04 +00004557 SDValue SCC =
Bill Wendling836ca7d2009-01-30 23:59:18 +00004558 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1),
Chris Lattner1eba01e2007-04-11 06:50:51 +00004559 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
Chris Lattnerc24bbad2007-04-11 16:51:53 +00004560 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true);
Gabor Greifba36cb52008-08-28 21:40:38 +00004561 if (SCC.getNode())
Chris Lattnerc56a81d2007-04-11 06:43:25 +00004562 return SCC;
Chris Lattner20a35c32007-04-11 05:32:27 +00004563 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004564
Evan Chengb3a3d5e2010-04-28 07:10:39 +00004565 return SDValue();
Chris Lattner5ffc0662006-05-05 05:58:59 +00004566}
4567
Chris Lattner2b4c2792007-10-13 06:35:54 +00004568/// GetDemandedBits - See if the specified operand can be simplified with the
4569/// knowledge that only the bits specified by Mask are used. If so, return the
Dan Gohman475871a2008-07-27 21:46:04 +00004570/// simpler operand, otherwise return a null SDValue.
4571SDValue DAGCombiner::GetDemandedBits(SDValue V, const APInt &Mask) {
Chris Lattner2b4c2792007-10-13 06:35:54 +00004572 switch (V.getOpcode()) {
4573 default: break;
4574 case ISD::OR:
4575 case ISD::XOR:
4576 // If the LHS or RHS don't contribute bits to the or, drop them.
4577 if (DAG.MaskedValueIsZero(V.getOperand(0), Mask))
4578 return V.getOperand(1);
4579 if (DAG.MaskedValueIsZero(V.getOperand(1), Mask))
4580 return V.getOperand(0);
4581 break;
Chris Lattnere33544c2007-10-13 06:58:48 +00004582 case ISD::SRL:
4583 // Only look at single-use SRLs.
Gabor Greifba36cb52008-08-28 21:40:38 +00004584 if (!V.getNode()->hasOneUse())
Chris Lattnere33544c2007-10-13 06:58:48 +00004585 break;
4586 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(V.getOperand(1))) {
4587 // See if we can recursively simplify the LHS.
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00004588 unsigned Amt = RHSC->getZExtValue();
Bill Wendling8509c902009-01-30 22:33:24 +00004589
Dan Gohmancc91d632009-01-03 19:22:06 +00004590 // Watch out for shift count overflow though.
4591 if (Amt >= Mask.getBitWidth()) break;
Dan Gohman2e68b6f2008-02-25 21:11:39 +00004592 APInt NewMask = Mask << Amt;
Dan Gohman475871a2008-07-27 21:46:04 +00004593 SDValue SimplifyLHS = GetDemandedBits(V.getOperand(0), NewMask);
Bill Wendling8509c902009-01-30 22:33:24 +00004594 if (SimplifyLHS.getNode())
Scott Michelfdc40a02009-02-17 22:15:04 +00004595 return DAG.getNode(ISD::SRL, V.getDebugLoc(), V.getValueType(),
Chris Lattnere33544c2007-10-13 06:58:48 +00004596 SimplifyLHS, V.getOperand(1));
Chris Lattnere33544c2007-10-13 06:58:48 +00004597 }
Chris Lattner2b4c2792007-10-13 06:35:54 +00004598 }
Dan Gohman475871a2008-07-27 21:46:04 +00004599 return SDValue();
Chris Lattner2b4c2792007-10-13 06:35:54 +00004600}
4601
Evan Chengc88138f2007-03-22 01:54:19 +00004602/// ReduceLoadWidth - If the result of a wider load is shifted to right of N
4603/// bits and then truncated to a narrower type and where N is a multiple
4604/// of number of bits of the narrower type, transform it to a narrower load
4605/// from address + N / num of bits of new type. If the result is to be
4606/// extended, also fold the extension to form a extending load.
Dan Gohman475871a2008-07-27 21:46:04 +00004607SDValue DAGCombiner::ReduceLoadWidth(SDNode *N) {
Evan Chengc88138f2007-03-22 01:54:19 +00004608 unsigned Opc = N->getOpcode();
Dan Gohman4e39e9d2010-06-24 14:30:44 +00004609
Evan Chengc88138f2007-03-22 01:54:19 +00004610 ISD::LoadExtType ExtType = ISD::NON_EXTLOAD;
Dan Gohman475871a2008-07-27 21:46:04 +00004611 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00004612 EVT VT = N->getValueType(0);
4613 EVT ExtVT = VT;
Evan Chengc88138f2007-03-22 01:54:19 +00004614
Dan Gohman7f8613e2008-08-14 20:04:46 +00004615 // This transformation isn't valid for vector loads.
4616 if (VT.isVector())
4617 return SDValue();
4618
Dan Gohmand1996362010-01-09 02:13:55 +00004619 // Special case: SIGN_EXTEND_INREG is basically truncating to ExtVT then
Evan Chenge177e302007-03-23 22:13:36 +00004620 // extended to VT.
Evan Chengc88138f2007-03-22 01:54:19 +00004621 if (Opc == ISD::SIGN_EXTEND_INREG) {
4622 ExtType = ISD::SEXTLOAD;
Owen Andersone50ed302009-08-10 22:56:29 +00004623 ExtVT = cast<VTSDNode>(N->getOperand(1))->getVT();
Dan Gohman4e39e9d2010-06-24 14:30:44 +00004624 } else if (Opc == ISD::SRL) {
Chris Lattner90b03642010-12-21 18:05:22 +00004625 // Another special-case: SRL is basically zero-extending a narrower value.
Dan Gohman4e39e9d2010-06-24 14:30:44 +00004626 ExtType = ISD::ZEXTLOAD;
4627 N0 = SDValue(N, 0);
4628 ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1));
4629 if (!N01) return SDValue();
4630 ExtVT = EVT::getIntegerVT(*DAG.getContext(),
4631 VT.getSizeInBits() - N01->getZExtValue());
Evan Chengc88138f2007-03-22 01:54:19 +00004632 }
Richard Osborne4e3740e2011-01-31 17:41:44 +00004633 if (LegalOperations && !TLI.isLoadExtLegal(ExtType, ExtVT))
4634 return SDValue();
Evan Chengc88138f2007-03-22 01:54:19 +00004635
Owen Andersone50ed302009-08-10 22:56:29 +00004636 unsigned EVTBits = ExtVT.getSizeInBits();
Owen Anderson95771af2011-02-25 21:41:48 +00004637
Chris Lattner7a2a7fa2010-12-22 08:01:44 +00004638 // Do not generate loads of non-round integer types since these can
4639 // be expensive (and would be wrong if the type is not byte sized).
4640 if (!ExtVT.isRound())
4641 return SDValue();
Owen Anderson95771af2011-02-25 21:41:48 +00004642
Evan Chengc88138f2007-03-22 01:54:19 +00004643 unsigned ShAmt = 0;
Chris Lattner7a2a7fa2010-12-22 08:01:44 +00004644 if (N0.getOpcode() == ISD::SRL && N0.hasOneUse()) {
Evan Chengc88138f2007-03-22 01:54:19 +00004645 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00004646 ShAmt = N01->getZExtValue();
Evan Chengc88138f2007-03-22 01:54:19 +00004647 // Is the shift amount a multiple of size of VT?
4648 if ((ShAmt & (EVTBits-1)) == 0) {
4649 N0 = N0.getOperand(0);
Eli Friedmand68eea22009-08-19 08:46:10 +00004650 // Is the load width a multiple of size of VT?
4651 if ((N0.getValueType().getSizeInBits() & (EVTBits-1)) != 0)
Dan Gohman475871a2008-07-27 21:46:04 +00004652 return SDValue();
Evan Chengc88138f2007-03-22 01:54:19 +00004653 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004654
Chris Lattnercbf68df2010-12-22 08:02:57 +00004655 // At this point, we must have a load or else we can't do the transform.
4656 if (!isa<LoadSDNode>(N0)) return SDValue();
Owen Anderson95771af2011-02-25 21:41:48 +00004657
Chris Lattner2831a192010-10-01 05:36:09 +00004658 // If the shift amount is larger than the input type then we're not
4659 // accessing any of the loaded bytes. If the load was a zextload/extload
4660 // then the result of the shift+trunc is zero/undef (handled elsewhere).
4661 // If the load was a sextload then the result is a splat of the sign bit
4662 // of the extended byte. This is not worth optimizing for.
Chris Lattnercbf68df2010-12-22 08:02:57 +00004663 if (ShAmt >= cast<LoadSDNode>(N0)->getMemoryVT().getSizeInBits())
Chris Lattner2831a192010-10-01 05:36:09 +00004664 return SDValue();
Evan Chengc88138f2007-03-22 01:54:19 +00004665 }
4666 }
4667
Dan Gohman394d6292010-11-03 01:47:46 +00004668 // If the load is shifted left (and the result isn't shifted back right),
4669 // we can fold the truncate through the shift.
4670 unsigned ShLeftAmt = 0;
4671 if (ShAmt == 0 && N0.getOpcode() == ISD::SHL && N0.hasOneUse() &&
Chris Lattner4c32bc22010-12-22 07:36:50 +00004672 ExtVT == VT && TLI.isNarrowingProfitable(N0.getValueType(), VT)) {
Dan Gohman394d6292010-11-03 01:47:46 +00004673 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
4674 ShLeftAmt = N01->getZExtValue();
4675 N0 = N0.getOperand(0);
4676 }
4677 }
Owen Anderson95771af2011-02-25 21:41:48 +00004678
Chris Lattner4c32bc22010-12-22 07:36:50 +00004679 // If we haven't found a load, we can't narrow it. Don't transform one with
4680 // multiple uses, this would require adding a new load.
4681 if (!isa<LoadSDNode>(N0) || !N0.hasOneUse() ||
4682 // Don't change the width of a volatile load.
4683 cast<LoadSDNode>(N0)->isVolatile())
4684 return SDValue();
Owen Anderson95771af2011-02-25 21:41:48 +00004685
Chris Lattner7a2a7fa2010-12-22 08:01:44 +00004686 // Verify that we are actually reducing a load width here.
4687 if (cast<LoadSDNode>(N0)->getMemoryVT().getSizeInBits() < EVTBits)
Chris Lattner4c32bc22010-12-22 07:36:50 +00004688 return SDValue();
Owen Anderson95771af2011-02-25 21:41:48 +00004689
Chris Lattner4c32bc22010-12-22 07:36:50 +00004690 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
4691 EVT PtrType = N0.getOperand(1).getValueType();
Bill Wendling8509c902009-01-30 22:33:24 +00004692
Chris Lattner4c32bc22010-12-22 07:36:50 +00004693 // For big endian targets, we need to adjust the offset to the pointer to
4694 // load the correct bytes.
4695 if (TLI.isBigEndian()) {
4696 unsigned LVTStoreBits = LN0->getMemoryVT().getStoreSizeInBits();
4697 unsigned EVTStoreBits = ExtVT.getStoreSizeInBits();
4698 ShAmt = LVTStoreBits - EVTStoreBits - ShAmt;
Evan Chengc88138f2007-03-22 01:54:19 +00004699 }
4700
Chris Lattner4c32bc22010-12-22 07:36:50 +00004701 uint64_t PtrOff = ShAmt / 8;
4702 unsigned NewAlign = MinAlign(LN0->getAlignment(), PtrOff);
4703 SDValue NewPtr = DAG.getNode(ISD::ADD, LN0->getDebugLoc(),
4704 PtrType, LN0->getBasePtr(),
4705 DAG.getConstant(PtrOff, PtrType));
4706 AddToWorkList(NewPtr.getNode());
4707
Chris Lattner7a2a7fa2010-12-22 08:01:44 +00004708 SDValue Load;
4709 if (ExtType == ISD::NON_EXTLOAD)
4710 Load = DAG.getLoad(VT, N0.getDebugLoc(), LN0->getChain(), NewPtr,
4711 LN0->getPointerInfo().getWithOffset(PtrOff),
4712 LN0->isVolatile(), LN0->isNonTemporal(), NewAlign);
4713 else
Stuart Hastingsa9011292011-02-16 16:23:55 +00004714 Load = DAG.getExtLoad(ExtType, N0.getDebugLoc(), VT, LN0->getChain(),NewPtr,
Chris Lattner7a2a7fa2010-12-22 08:01:44 +00004715 LN0->getPointerInfo().getWithOffset(PtrOff),
4716 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(),
4717 NewAlign);
Chris Lattner4c32bc22010-12-22 07:36:50 +00004718
4719 // Replace the old load's chain with the new load's chain.
4720 WorkListRemover DeadNodes(*this);
4721 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), Load.getValue(1),
4722 &DeadNodes);
4723
4724 // Shift the result left, if we've swallowed a left shift.
4725 SDValue Result = Load;
4726 if (ShLeftAmt != 0) {
Owen Anderson95771af2011-02-25 21:41:48 +00004727 EVT ShImmTy = getShiftAmountTy(Result.getValueType());
Chris Lattner4c32bc22010-12-22 07:36:50 +00004728 if (!isUIntN(ShImmTy.getSizeInBits(), ShLeftAmt))
4729 ShImmTy = VT;
4730 Result = DAG.getNode(ISD::SHL, N0.getDebugLoc(), VT,
4731 Result, DAG.getConstant(ShLeftAmt, ShImmTy));
4732 }
4733
4734 // Return the new loaded value.
4735 return Result;
Evan Chengc88138f2007-03-22 01:54:19 +00004736}
4737
Dan Gohman475871a2008-07-27 21:46:04 +00004738SDValue DAGCombiner::visitSIGN_EXTEND_INREG(SDNode *N) {
4739 SDValue N0 = N->getOperand(0);
4740 SDValue N1 = N->getOperand(1);
Owen Andersone50ed302009-08-10 22:56:29 +00004741 EVT VT = N->getValueType(0);
4742 EVT EVT = cast<VTSDNode>(N1)->getVT();
Dan Gohman87862e72009-12-11 21:31:27 +00004743 unsigned VTBits = VT.getScalarType().getSizeInBits();
Dan Gohmand1996362010-01-09 02:13:55 +00004744 unsigned EVTBits = EVT.getScalarType().getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00004745
Nate Begeman1d4d4142005-09-01 00:19:25 +00004746 // fold (sext_in_reg c1) -> c1
Chris Lattnereaeda562006-05-08 20:59:41 +00004747 if (isa<ConstantSDNode>(N0) || N0.getOpcode() == ISD::UNDEF)
Bill Wendling8509c902009-01-30 22:33:24 +00004748 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, N0, N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00004749
Chris Lattner541a24f2006-05-06 22:43:44 +00004750 // If the input is already sign extended, just drop the extension.
Dan Gohman87862e72009-12-11 21:31:27 +00004751 if (DAG.ComputeNumSignBits(N0) >= VTBits-EVTBits+1)
Chris Lattneree4ea922006-05-06 09:30:03 +00004752 return N0;
Scott Michelfdc40a02009-02-17 22:15:04 +00004753
Nate Begeman646d7e22005-09-02 21:18:40 +00004754 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt2
4755 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
Duncan Sands8e4eb092008-06-08 20:54:56 +00004756 EVT.bitsLT(cast<VTSDNode>(N0.getOperand(1))->getVT())) {
Bill Wendling8509c902009-01-30 22:33:24 +00004757 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT,
4758 N0.getOperand(0), N1);
Nate Begeman646d7e22005-09-02 21:18:40 +00004759 }
Chris Lattner4b37e872006-05-08 21:18:59 +00004760
Dan Gohman75dcf082008-07-31 00:50:31 +00004761 // fold (sext_in_reg (sext x)) -> (sext x)
4762 // fold (sext_in_reg (aext x)) -> (sext x)
4763 // if x is small enough.
4764 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND) {
4765 SDValue N00 = N0.getOperand(0);
Evan Cheng003d7c42010-04-16 22:26:19 +00004766 if (N00.getValueType().getScalarType().getSizeInBits() <= EVTBits &&
4767 (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND, VT)))
Bill Wendling8509c902009-01-30 22:33:24 +00004768 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, N00, N1);
Dan Gohman75dcf082008-07-31 00:50:31 +00004769 }
4770
Chris Lattner95a5e052007-04-17 19:03:21 +00004771 // fold (sext_in_reg x) -> (zext_in_reg x) if the sign bit is known zero.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00004772 if (DAG.MaskedValueIsZero(N0, APInt::getBitsSet(VTBits, EVTBits-1, EVTBits)))
Bill Wendlingfc4b6772009-02-01 11:19:36 +00004773 return DAG.getZeroExtendInReg(N0, N->getDebugLoc(), EVT);
Scott Michelfdc40a02009-02-17 22:15:04 +00004774
Chris Lattner95a5e052007-04-17 19:03:21 +00004775 // fold operands of sext_in_reg based on knowledge that the top bits are not
4776 // demanded.
Dan Gohman475871a2008-07-27 21:46:04 +00004777 if (SimplifyDemandedBits(SDValue(N, 0)))
4778 return SDValue(N, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00004779
Evan Chengc88138f2007-03-22 01:54:19 +00004780 // fold (sext_in_reg (load x)) -> (smaller sextload x)
4781 // fold (sext_in_reg (srl (load x), c)) -> (smaller sextload (x+c/evtbits))
Dan Gohman475871a2008-07-27 21:46:04 +00004782 SDValue NarrowLoad = ReduceLoadWidth(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00004783 if (NarrowLoad.getNode())
Evan Chengc88138f2007-03-22 01:54:19 +00004784 return NarrowLoad;
4785
Bill Wendling8509c902009-01-30 22:33:24 +00004786 // fold (sext_in_reg (srl X, 24), i8) -> (sra X, 24)
4787 // fold (sext_in_reg (srl X, 23), i8) -> (sra X, 23) iff possible.
Chris Lattner4b37e872006-05-08 21:18:59 +00004788 // We already fold "(sext_in_reg (srl X, 25), i8) -> srl X, 25" above.
4789 if (N0.getOpcode() == ISD::SRL) {
4790 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(N0.getOperand(1)))
Dan Gohman87862e72009-12-11 21:31:27 +00004791 if (ShAmt->getZExtValue()+EVTBits <= VTBits) {
Chris Lattner4b37e872006-05-08 21:18:59 +00004792 // We can turn this into an SRA iff the input to the SRL is already sign
4793 // extended enough.
Dan Gohmanea859be2007-06-22 14:59:07 +00004794 unsigned InSignBits = DAG.ComputeNumSignBits(N0.getOperand(0));
Dan Gohman87862e72009-12-11 21:31:27 +00004795 if (VTBits-(ShAmt->getZExtValue()+EVTBits) < InSignBits)
Bill Wendling8509c902009-01-30 22:33:24 +00004796 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT,
4797 N0.getOperand(0), N0.getOperand(1));
Chris Lattner4b37e872006-05-08 21:18:59 +00004798 }
4799 }
Evan Chengc88138f2007-03-22 01:54:19 +00004800
Nate Begemanded49632005-10-13 03:11:28 +00004801 // fold (sext_inreg (extload x)) -> (sextload x)
Scott Michelfdc40a02009-02-17 22:15:04 +00004802 if (ISD::isEXTLoad(N0.getNode()) &&
Gabor Greifba36cb52008-08-28 21:40:38 +00004803 ISD::isUNINDEXEDLoad(N0.getNode()) &&
Dan Gohmanb625f2f2008-01-30 00:15:11 +00004804 EVT == cast<LoadSDNode>(N0)->getMemoryVT() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004805 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00004806 TLI.isLoadExtLegal(ISD::SEXTLOAD, EVT))) {
Evan Cheng466685d2006-10-09 20:57:25 +00004807 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00004808 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, N->getDebugLoc(), VT,
Bill Wendling8509c902009-01-30 22:33:24 +00004809 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004810 LN0->getBasePtr(), LN0->getPointerInfo(),
4811 EVT,
David Greene1e559442010-02-15 17:00:31 +00004812 LN0->isVolatile(), LN0->isNonTemporal(),
4813 LN0->getAlignment());
Chris Lattnerd4771842005-12-14 19:25:30 +00004814 CombineTo(N, ExtLoad);
Gabor Greifba36cb52008-08-28 21:40:38 +00004815 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00004816 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Nate Begemanded49632005-10-13 03:11:28 +00004817 }
4818 // fold (sext_inreg (zextload x)) -> (sextload x) iff load has one use
Gabor Greifba36cb52008-08-28 21:40:38 +00004819 if (ISD::isZEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
Evan Cheng83060c52007-03-07 08:07:03 +00004820 N0.hasOneUse() &&
Dan Gohmanb625f2f2008-01-30 00:15:11 +00004821 EVT == cast<LoadSDNode>(N0)->getMemoryVT() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004822 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00004823 TLI.isLoadExtLegal(ISD::SEXTLOAD, EVT))) {
Evan Cheng466685d2006-10-09 20:57:25 +00004824 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00004825 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, N->getDebugLoc(), VT,
Bill Wendling8509c902009-01-30 22:33:24 +00004826 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00004827 LN0->getBasePtr(), LN0->getPointerInfo(),
4828 EVT,
David Greene1e559442010-02-15 17:00:31 +00004829 LN0->isVolatile(), LN0->isNonTemporal(),
4830 LN0->getAlignment());
Chris Lattnerd4771842005-12-14 19:25:30 +00004831 CombineTo(N, ExtLoad);
Gabor Greifba36cb52008-08-28 21:40:38 +00004832 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00004833 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Nate Begemanded49632005-10-13 03:11:28 +00004834 }
Evan Cheng9568e5c2011-06-21 06:01:08 +00004835
4836 // Form (sext_inreg (bswap >> 16)) or (sext_inreg (rotl (bswap) 16))
4837 if (EVTBits <= 16 && N0.getOpcode() == ISD::OR) {
4838 SDValue BSwap = MatchBSwapHWordLow(N0.getNode(), N0.getOperand(0),
4839 N0.getOperand(1), false);
4840 if (BSwap.getNode() != 0)
4841 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT,
4842 BSwap, N1);
4843 }
4844
Dan Gohman475871a2008-07-27 21:46:04 +00004845 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00004846}
4847
Dan Gohman475871a2008-07-27 21:46:04 +00004848SDValue DAGCombiner::visitTRUNCATE(SDNode *N) {
4849 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00004850 EVT VT = N->getValueType(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00004851
4852 // noop truncate
4853 if (N0.getValueType() == N->getValueType(0))
Nate Begeman83e75ec2005-09-06 04:43:02 +00004854 return N0;
Nate Begeman1d4d4142005-09-01 00:19:25 +00004855 // fold (truncate c1) -> c1
Chris Lattner310b5782006-05-06 23:06:26 +00004856 if (isa<ConstantSDNode>(N0))
Bill Wendling67a67682009-01-30 22:44:24 +00004857 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00004858 // fold (truncate (truncate x)) -> (truncate x)
4859 if (N0.getOpcode() == ISD::TRUNCATE)
Bill Wendling67a67682009-01-30 22:44:24 +00004860 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0.getOperand(0));
Nate Begeman1d4d4142005-09-01 00:19:25 +00004861 // fold (truncate (ext x)) -> (ext x) or (truncate x) or x
Chris Lattner7f893c02010-04-07 18:13:33 +00004862 if (N0.getOpcode() == ISD::ZERO_EXTEND ||
4863 N0.getOpcode() == ISD::SIGN_EXTEND ||
Chris Lattnerb72773b2006-05-05 22:56:26 +00004864 N0.getOpcode() == ISD::ANY_EXTEND) {
Duncan Sands8e4eb092008-06-08 20:54:56 +00004865 if (N0.getOperand(0).getValueType().bitsLT(VT))
Nate Begeman1d4d4142005-09-01 00:19:25 +00004866 // if the source is smaller than the dest, we still need an extend
Bill Wendling67a67682009-01-30 22:44:24 +00004867 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT,
4868 N0.getOperand(0));
Duncan Sands8e4eb092008-06-08 20:54:56 +00004869 else if (N0.getOperand(0).getValueType().bitsGT(VT))
Nate Begeman1d4d4142005-09-01 00:19:25 +00004870 // if the source is larger than the dest, than we just need the truncate
Bill Wendling67a67682009-01-30 22:44:24 +00004871 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0.getOperand(0));
Nate Begeman1d4d4142005-09-01 00:19:25 +00004872 else
4873 // if the source and dest are the same type, we can drop both the extend
Evan Chengd40d03e2010-01-06 19:38:29 +00004874 // and the truncate.
Nate Begeman83e75ec2005-09-06 04:43:02 +00004875 return N0.getOperand(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00004876 }
Evan Cheng007b69e2007-03-21 20:14:05 +00004877
Chris Lattner2b4c2792007-10-13 06:35:54 +00004878 // See if we can simplify the input to this truncate through knowledge that
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004879 // only the low bits are being used.
4880 // For example "trunc (or (shl x, 8), y)" // -> trunc y
Nadav Rotemfcd96192011-02-27 07:40:43 +00004881 // Currently we only perform this optimization on scalars because vectors
Nadav Rotem8c20ec52011-02-24 21:01:34 +00004882 // may have different active low bits.
4883 if (!VT.isVector()) {
4884 SDValue Shorter =
4885 GetDemandedBits(N0, APInt::getLowBitsSet(N0.getValueSizeInBits(),
4886 VT.getSizeInBits()));
4887 if (Shorter.getNode())
4888 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Shorter);
4889 }
Nate Begeman3df4d522005-10-12 20:40:40 +00004890 // fold (truncate (load x)) -> (smaller load x)
Evan Cheng007b69e2007-03-21 20:14:05 +00004891 // fold (truncate (srl (load x), c)) -> (smaller load (x+c/evtbits))
Dan Gohman4e39e9d2010-06-24 14:30:44 +00004892 if (!LegalTypes || TLI.isTypeDesirableForOp(N0.getOpcode(), VT)) {
4893 SDValue Reduced = ReduceLoadWidth(N);
4894 if (Reduced.getNode())
4895 return Reduced;
4896 }
4897
4898 // Simplify the operands using demanded-bits information.
4899 if (!VT.isVector() &&
4900 SimplifyDemandedBits(SDValue(N, 0)))
4901 return SDValue(N, 0);
4902
Evan Chenge5b51ac2010-04-17 06:13:15 +00004903 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00004904}
4905
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004906static SDNode *getBuildPairElt(SDNode *N, unsigned i) {
Dan Gohman475871a2008-07-27 21:46:04 +00004907 SDValue Elt = N->getOperand(i);
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004908 if (Elt.getOpcode() != ISD::MERGE_VALUES)
Gabor Greifba36cb52008-08-28 21:40:38 +00004909 return Elt.getNode();
4910 return Elt.getOperand(Elt.getResNo()).getNode();
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004911}
4912
4913/// CombineConsecutiveLoads - build_pair (load, load) -> load
Scott Michelfdc40a02009-02-17 22:15:04 +00004914/// if load locations are consecutive.
Owen Andersone50ed302009-08-10 22:56:29 +00004915SDValue DAGCombiner::CombineConsecutiveLoads(SDNode *N, EVT VT) {
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004916 assert(N->getOpcode() == ISD::BUILD_PAIR);
4917
Nate Begemanabc01992009-06-05 21:37:30 +00004918 LoadSDNode *LD1 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 0));
4919 LoadSDNode *LD2 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 1));
Chris Lattnerfa459012010-09-21 16:08:50 +00004920 if (!LD1 || !LD2 || !ISD::isNON_EXTLoad(LD1) || !LD1->hasOneUse() ||
4921 LD1->getPointerInfo().getAddrSpace() !=
4922 LD2->getPointerInfo().getAddrSpace())
Dan Gohman475871a2008-07-27 21:46:04 +00004923 return SDValue();
Owen Andersone50ed302009-08-10 22:56:29 +00004924 EVT LD1VT = LD1->getValueType(0);
Bill Wendling67a67682009-01-30 22:44:24 +00004925
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004926 if (ISD::isNON_EXTLoad(LD2) &&
4927 LD2->hasOneUse() &&
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004928 // If both are volatile this would reduce the number of volatile loads.
4929 // If one is volatile it might be ok, but play conservative and bail out.
Nate Begemanabc01992009-06-05 21:37:30 +00004930 !LD1->isVolatile() &&
4931 !LD2->isVolatile() &&
Evan Cheng64fa4a92009-12-09 01:36:00 +00004932 DAG.isConsecutiveLoad(LD2, LD1, LD1VT.getSizeInBits()/8, 1)) {
Nate Begemanabc01992009-06-05 21:37:30 +00004933 unsigned Align = LD1->getAlignment();
Dan Gohman6448d912008-09-04 15:39:15 +00004934 unsigned NewAlign = TLI.getTargetData()->
Owen Anderson23b9b192009-08-12 00:36:31 +00004935 getABITypeAlignment(VT.getTypeForEVT(*DAG.getContext()));
Bill Wendling67a67682009-01-30 22:44:24 +00004936
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004937 if (NewAlign <= Align &&
Duncan Sands25cf2272008-11-24 14:53:14 +00004938 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT)))
Nate Begemanabc01992009-06-05 21:37:30 +00004939 return DAG.getLoad(VT, N->getDebugLoc(), LD1->getChain(),
Chris Lattnerfa459012010-09-21 16:08:50 +00004940 LD1->getBasePtr(), LD1->getPointerInfo(),
4941 false, false, Align);
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004942 }
Bill Wendling67a67682009-01-30 22:44:24 +00004943
Dan Gohman475871a2008-07-27 21:46:04 +00004944 return SDValue();
Evan Cheng9bfa03c2008-05-12 23:04:07 +00004945}
4946
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004947SDValue DAGCombiner::visitBITCAST(SDNode *N) {
Dan Gohman475871a2008-07-27 21:46:04 +00004948 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00004949 EVT VT = N->getValueType(0);
Chris Lattner94683772005-12-23 05:30:37 +00004950
Dan Gohman7f321562007-06-25 16:23:39 +00004951 // If the input is a BUILD_VECTOR with all constant elements, fold this now.
4952 // Only do this before legalize, since afterward the target may be depending
4953 // on the bitconvert.
4954 // First check to see if this is all constant.
Duncan Sands25cf2272008-11-24 14:53:14 +00004955 if (!LegalTypes &&
Gabor Greifba36cb52008-08-28 21:40:38 +00004956 N0.getOpcode() == ISD::BUILD_VECTOR && N0.getNode()->hasOneUse() &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00004957 VT.isVector()) {
Dan Gohman7f321562007-06-25 16:23:39 +00004958 bool isSimple = true;
4959 for (unsigned i = 0, e = N0.getNumOperands(); i != e; ++i)
4960 if (N0.getOperand(i).getOpcode() != ISD::UNDEF &&
4961 N0.getOperand(i).getOpcode() != ISD::Constant &&
4962 N0.getOperand(i).getOpcode() != ISD::ConstantFP) {
Scott Michelfdc40a02009-02-17 22:15:04 +00004963 isSimple = false;
Dan Gohman7f321562007-06-25 16:23:39 +00004964 break;
4965 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004966
Owen Andersone50ed302009-08-10 22:56:29 +00004967 EVT DestEltVT = N->getValueType(0).getVectorElementType();
Duncan Sands83ec4b62008-06-06 12:08:01 +00004968 assert(!DestEltVT.isVector() &&
Dan Gohman7f321562007-06-25 16:23:39 +00004969 "Element type of vector ValueType must not be vector!");
Bill Wendling67a67682009-01-30 22:44:24 +00004970 if (isSimple)
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004971 return ConstantFoldBITCASTofBUILD_VECTOR(N0.getNode(), DestEltVT);
Dan Gohman7f321562007-06-25 16:23:39 +00004972 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004973
Dan Gohman3dd168d2008-09-05 01:58:21 +00004974 // If the input is a constant, let getNode fold it.
Chris Lattner94683772005-12-23 05:30:37 +00004975 if (isa<ConstantSDNode>(N0) || isa<ConstantFPSDNode>(N0)) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004976 SDValue Res = DAG.getNode(ISD::BITCAST, N->getDebugLoc(), VT, N0);
Dan Gohmana407ca12009-08-10 23:15:10 +00004977 if (Res.getNode() != N) {
4978 if (!LegalOperations ||
4979 TLI.isOperationLegal(Res.getNode()->getOpcode(), VT))
4980 return Res;
4981
4982 // Folding it resulted in an illegal node, and it's too late to
4983 // do that. Clean up the old node and forego the transformation.
4984 // Ideally this won't happen very often, because instcombine
4985 // and the earlier dagcombine runs (where illegal nodes are
4986 // permitted) should have folded most of them already.
4987 DAG.DeleteNode(Res.getNode());
4988 }
Chris Lattner94683772005-12-23 05:30:37 +00004989 }
Scott Michelfdc40a02009-02-17 22:15:04 +00004990
Bill Wendling67a67682009-01-30 22:44:24 +00004991 // (conv (conv x, t1), t2) -> (conv x, t2)
Wesley Peckbf17cfa2010-11-23 03:31:01 +00004992 if (N0.getOpcode() == ISD::BITCAST)
4993 return DAG.getNode(ISD::BITCAST, N->getDebugLoc(), VT,
Bill Wendling67a67682009-01-30 22:44:24 +00004994 N0.getOperand(0));
Chris Lattner6258fb22006-04-02 02:53:43 +00004995
Chris Lattner57104102005-12-23 05:44:41 +00004996 // fold (conv (load x)) -> (load (conv*)x)
Evan Cheng513da432007-10-06 08:19:55 +00004997 // If the resultant load doesn't need a higher alignment than the original!
Gabor Greifba36cb52008-08-28 21:40:38 +00004998 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() &&
Duncan Sandsd4b9c172008-06-13 19:07:40 +00004999 // Do not change the width of a volatile load.
5000 !cast<LoadSDNode>(N0)->isVolatile() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00005001 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT))) {
Evan Cheng466685d2006-10-09 20:57:25 +00005002 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Dan Gohman6448d912008-09-04 15:39:15 +00005003 unsigned Align = TLI.getTargetData()->
Owen Anderson23b9b192009-08-12 00:36:31 +00005004 getABITypeAlignment(VT.getTypeForEVT(*DAG.getContext()));
Evan Cheng59d5b682007-05-07 21:27:48 +00005005 unsigned OrigAlign = LN0->getAlignment();
Bill Wendling67a67682009-01-30 22:44:24 +00005006
Evan Cheng59d5b682007-05-07 21:27:48 +00005007 if (Align <= OrigAlign) {
Bill Wendling67a67682009-01-30 22:44:24 +00005008 SDValue Load = DAG.getLoad(VT, N->getDebugLoc(), LN0->getChain(),
Chris Lattnerfa459012010-09-21 16:08:50 +00005009 LN0->getBasePtr(), LN0->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00005010 LN0->isVolatile(), LN0->isNonTemporal(),
5011 OrigAlign);
Evan Cheng59d5b682007-05-07 21:27:48 +00005012 AddToWorkList(N);
Gabor Greif12632d22008-08-30 19:29:20 +00005013 CombineTo(N0.getNode(),
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005014 DAG.getNode(ISD::BITCAST, N0.getDebugLoc(),
Bill Wendling67a67682009-01-30 22:44:24 +00005015 N0.getValueType(), Load),
Evan Cheng59d5b682007-05-07 21:27:48 +00005016 Load.getValue(1));
5017 return Load;
5018 }
Chris Lattner57104102005-12-23 05:44:41 +00005019 }
Duncan Sandsd4b9c172008-06-13 19:07:40 +00005020
Bill Wendling67a67682009-01-30 22:44:24 +00005021 // fold (bitconvert (fneg x)) -> (xor (bitconvert x), signbit)
5022 // fold (bitconvert (fabs x)) -> (and (bitconvert x), (not signbit))
Chris Lattner3bd39d42008-01-27 17:42:27 +00005023 // This often reduces constant pool loads.
5024 if ((N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FABS) &&
Gabor Greifba36cb52008-08-28 21:40:38 +00005025 N0.getNode()->hasOneUse() && VT.isInteger() && !VT.isVector()) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005026 SDValue NewConv = DAG.getNode(ISD::BITCAST, N0.getDebugLoc(), VT,
Bill Wendling67a67682009-01-30 22:44:24 +00005027 N0.getOperand(0));
Gabor Greifba36cb52008-08-28 21:40:38 +00005028 AddToWorkList(NewConv.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +00005029
Duncan Sands83ec4b62008-06-06 12:08:01 +00005030 APInt SignBit = APInt::getSignBit(VT.getSizeInBits());
Chris Lattner3bd39d42008-01-27 17:42:27 +00005031 if (N0.getOpcode() == ISD::FNEG)
Bill Wendling67a67682009-01-30 22:44:24 +00005032 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT,
5033 NewConv, DAG.getConstant(SignBit, VT));
Chris Lattner3bd39d42008-01-27 17:42:27 +00005034 assert(N0.getOpcode() == ISD::FABS);
Bill Wendling67a67682009-01-30 22:44:24 +00005035 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT,
5036 NewConv, DAG.getConstant(~SignBit, VT));
Chris Lattner3bd39d42008-01-27 17:42:27 +00005037 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005038
Bill Wendling67a67682009-01-30 22:44:24 +00005039 // fold (bitconvert (fcopysign cst, x)) ->
5040 // (or (and (bitconvert x), sign), (and cst, (not sign)))
5041 // Note that we don't handle (copysign x, cst) because this can always be
5042 // folded to an fneg or fabs.
Gabor Greifba36cb52008-08-28 21:40:38 +00005043 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse() &&
Chris Lattnerf32aac32008-01-27 23:32:17 +00005044 isa<ConstantFPSDNode>(N0.getOperand(0)) &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00005045 VT.isInteger() && !VT.isVector()) {
5046 unsigned OrigXWidth = N0.getOperand(1).getValueType().getSizeInBits();
Owen Anderson23b9b192009-08-12 00:36:31 +00005047 EVT IntXVT = EVT::getIntegerVT(*DAG.getContext(), OrigXWidth);
Chris Lattner2392ae72010-04-15 04:48:01 +00005048 if (isTypeLegal(IntXVT)) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005049 SDValue X = DAG.getNode(ISD::BITCAST, N0.getDebugLoc(),
Bill Wendling67a67682009-01-30 22:44:24 +00005050 IntXVT, N0.getOperand(1));
Duncan Sands25cf2272008-11-24 14:53:14 +00005051 AddToWorkList(X.getNode());
Chris Lattner3bd39d42008-01-27 17:42:27 +00005052
Duncan Sands25cf2272008-11-24 14:53:14 +00005053 // If X has a different width than the result/lhs, sext it or truncate it.
5054 unsigned VTWidth = VT.getSizeInBits();
5055 if (OrigXWidth < VTWidth) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00005056 X = DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, X);
Duncan Sands25cf2272008-11-24 14:53:14 +00005057 AddToWorkList(X.getNode());
5058 } else if (OrigXWidth > VTWidth) {
5059 // To get the sign bit in the right place, we have to shift it right
5060 // before truncating.
Bill Wendling9729c5a2009-01-31 03:12:48 +00005061 X = DAG.getNode(ISD::SRL, X.getDebugLoc(),
Bill Wendling67a67682009-01-30 22:44:24 +00005062 X.getValueType(), X,
Duncan Sands25cf2272008-11-24 14:53:14 +00005063 DAG.getConstant(OrigXWidth-VTWidth, X.getValueType()));
5064 AddToWorkList(X.getNode());
Bill Wendling9729c5a2009-01-31 03:12:48 +00005065 X = DAG.getNode(ISD::TRUNCATE, X.getDebugLoc(), VT, X);
Duncan Sands25cf2272008-11-24 14:53:14 +00005066 AddToWorkList(X.getNode());
5067 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005068
Duncan Sands25cf2272008-11-24 14:53:14 +00005069 APInt SignBit = APInt::getSignBit(VT.getSizeInBits());
Bill Wendling9729c5a2009-01-31 03:12:48 +00005070 X = DAG.getNode(ISD::AND, X.getDebugLoc(), VT,
Bill Wendling67a67682009-01-30 22:44:24 +00005071 X, DAG.getConstant(SignBit, VT));
Duncan Sands25cf2272008-11-24 14:53:14 +00005072 AddToWorkList(X.getNode());
Chris Lattner3bd39d42008-01-27 17:42:27 +00005073
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005074 SDValue Cst = DAG.getNode(ISD::BITCAST, N0.getDebugLoc(),
Bill Wendling67a67682009-01-30 22:44:24 +00005075 VT, N0.getOperand(0));
Bill Wendling9729c5a2009-01-31 03:12:48 +00005076 Cst = DAG.getNode(ISD::AND, Cst.getDebugLoc(), VT,
Bill Wendling67a67682009-01-30 22:44:24 +00005077 Cst, DAG.getConstant(~SignBit, VT));
Duncan Sands25cf2272008-11-24 14:53:14 +00005078 AddToWorkList(Cst.getNode());
Chris Lattner3bd39d42008-01-27 17:42:27 +00005079
Bill Wendling67a67682009-01-30 22:44:24 +00005080 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, X, Cst);
Duncan Sands25cf2272008-11-24 14:53:14 +00005081 }
Chris Lattner3bd39d42008-01-27 17:42:27 +00005082 }
Evan Cheng9bfa03c2008-05-12 23:04:07 +00005083
Scott Michelfdc40a02009-02-17 22:15:04 +00005084 // bitconvert(build_pair(ld, ld)) -> ld iff load locations are consecutive.
Evan Cheng9bfa03c2008-05-12 23:04:07 +00005085 if (N0.getOpcode() == ISD::BUILD_PAIR) {
Gabor Greifba36cb52008-08-28 21:40:38 +00005086 SDValue CombineLD = CombineConsecutiveLoads(N0.getNode(), VT);
5087 if (CombineLD.getNode())
Evan Cheng9bfa03c2008-05-12 23:04:07 +00005088 return CombineLD;
5089 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005090
Dan Gohman475871a2008-07-27 21:46:04 +00005091 return SDValue();
Chris Lattner94683772005-12-23 05:30:37 +00005092}
5093
Dan Gohman475871a2008-07-27 21:46:04 +00005094SDValue DAGCombiner::visitBUILD_PAIR(SDNode *N) {
Owen Andersone50ed302009-08-10 22:56:29 +00005095 EVT VT = N->getValueType(0);
Evan Cheng9bfa03c2008-05-12 23:04:07 +00005096 return CombineConsecutiveLoads(N, VT);
5097}
5098
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005099/// ConstantFoldBITCASTofBUILD_VECTOR - We know that BV is a build_vector
Scott Michelfdc40a02009-02-17 22:15:04 +00005100/// node with Constant, ConstantFP or Undef operands. DstEltVT indicates the
Chris Lattner6258fb22006-04-02 02:53:43 +00005101/// destination element value type.
Dan Gohman475871a2008-07-27 21:46:04 +00005102SDValue DAGCombiner::
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005103ConstantFoldBITCASTofBUILD_VECTOR(SDNode *BV, EVT DstEltVT) {
Owen Andersone50ed302009-08-10 22:56:29 +00005104 EVT SrcEltVT = BV->getValueType(0).getVectorElementType();
Scott Michelfdc40a02009-02-17 22:15:04 +00005105
Chris Lattner6258fb22006-04-02 02:53:43 +00005106 // If this is already the right type, we're done.
Dan Gohman475871a2008-07-27 21:46:04 +00005107 if (SrcEltVT == DstEltVT) return SDValue(BV, 0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005108
Duncan Sands83ec4b62008-06-06 12:08:01 +00005109 unsigned SrcBitSize = SrcEltVT.getSizeInBits();
5110 unsigned DstBitSize = DstEltVT.getSizeInBits();
Scott Michelfdc40a02009-02-17 22:15:04 +00005111
Chris Lattner6258fb22006-04-02 02:53:43 +00005112 // If this is a conversion of N elements of one type to N elements of another
5113 // type, convert each element. This handles FP<->INT cases.
5114 if (SrcBitSize == DstBitSize) {
Nate Begemane0efc212010-07-27 18:02:18 +00005115 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT,
5116 BV->getValueType(0).getVectorNumElements());
5117
5118 // Due to the FP element handling below calling this routine recursively,
5119 // we can end up with a scalar-to-vector node here.
5120 if (BV->getOpcode() == ISD::SCALAR_TO_VECTOR)
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005121 return DAG.getNode(ISD::SCALAR_TO_VECTOR, BV->getDebugLoc(), VT,
5122 DAG.getNode(ISD::BITCAST, BV->getDebugLoc(),
Nate Begemane0efc212010-07-27 18:02:18 +00005123 DstEltVT, BV->getOperand(0)));
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005124
Dan Gohman475871a2008-07-27 21:46:04 +00005125 SmallVector<SDValue, 8> Ops;
Dan Gohman7f321562007-06-25 16:23:39 +00005126 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) {
Bob Wilsonb1303d02009-04-13 22:05:19 +00005127 SDValue Op = BV->getOperand(i);
5128 // If the vector element type is not legal, the BUILD_VECTOR operands
5129 // are promoted and implicitly truncated. Make that explicit here.
Bob Wilsonc8851652009-04-20 17:27:09 +00005130 if (Op.getValueType() != SrcEltVT)
5131 Op = DAG.getNode(ISD::TRUNCATE, BV->getDebugLoc(), SrcEltVT, Op);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005132 Ops.push_back(DAG.getNode(ISD::BITCAST, BV->getDebugLoc(),
Bob Wilsonb1303d02009-04-13 22:05:19 +00005133 DstEltVT, Op));
Gabor Greifba36cb52008-08-28 21:40:38 +00005134 AddToWorkList(Ops.back().getNode());
Chris Lattner3e104b12006-04-08 04:15:24 +00005135 }
Evan Chenga87008d2009-02-25 22:49:59 +00005136 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT,
5137 &Ops[0], Ops.size());
Chris Lattner6258fb22006-04-02 02:53:43 +00005138 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005139
Chris Lattner6258fb22006-04-02 02:53:43 +00005140 // Otherwise, we're growing or shrinking the elements. To avoid having to
5141 // handle annoying details of growing/shrinking FP values, we convert them to
5142 // int first.
Duncan Sands83ec4b62008-06-06 12:08:01 +00005143 if (SrcEltVT.isFloatingPoint()) {
Chris Lattner6258fb22006-04-02 02:53:43 +00005144 // Convert the input float vector to a int vector where the elements are the
5145 // same sizes.
Owen Anderson825b72b2009-08-11 20:47:22 +00005146 assert((SrcEltVT == MVT::f32 || SrcEltVT == MVT::f64) && "Unknown FP VT!");
Owen Anderson23b9b192009-08-12 00:36:31 +00005147 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), SrcEltVT.getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005148 BV = ConstantFoldBITCASTofBUILD_VECTOR(BV, IntVT).getNode();
Chris Lattner6258fb22006-04-02 02:53:43 +00005149 SrcEltVT = IntVT;
5150 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005151
Chris Lattner6258fb22006-04-02 02:53:43 +00005152 // Now we know the input is an integer vector. If the output is a FP type,
5153 // convert to integer first, then to FP of the right size.
Duncan Sands83ec4b62008-06-06 12:08:01 +00005154 if (DstEltVT.isFloatingPoint()) {
Owen Anderson825b72b2009-08-11 20:47:22 +00005155 assert((DstEltVT == MVT::f32 || DstEltVT == MVT::f64) && "Unknown FP VT!");
Owen Anderson23b9b192009-08-12 00:36:31 +00005156 EVT TmpVT = EVT::getIntegerVT(*DAG.getContext(), DstEltVT.getSizeInBits());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005157 SDNode *Tmp = ConstantFoldBITCASTofBUILD_VECTOR(BV, TmpVT).getNode();
Scott Michelfdc40a02009-02-17 22:15:04 +00005158
Chris Lattner6258fb22006-04-02 02:53:43 +00005159 // Next, convert to FP elements of the same size.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005160 return ConstantFoldBITCASTofBUILD_VECTOR(Tmp, DstEltVT);
Chris Lattner6258fb22006-04-02 02:53:43 +00005161 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005162
Chris Lattner6258fb22006-04-02 02:53:43 +00005163 // Okay, we know the src/dst types are both integers of differing types.
5164 // Handling growing first.
Duncan Sands83ec4b62008-06-06 12:08:01 +00005165 assert(SrcEltVT.isInteger() && DstEltVT.isInteger());
Chris Lattner6258fb22006-04-02 02:53:43 +00005166 if (SrcBitSize < DstBitSize) {
5167 unsigned NumInputsPerOutput = DstBitSize/SrcBitSize;
Scott Michelfdc40a02009-02-17 22:15:04 +00005168
Dan Gohman475871a2008-07-27 21:46:04 +00005169 SmallVector<SDValue, 8> Ops;
Dan Gohman7f321562007-06-25 16:23:39 +00005170 for (unsigned i = 0, e = BV->getNumOperands(); i != e;
Chris Lattner6258fb22006-04-02 02:53:43 +00005171 i += NumInputsPerOutput) {
5172 bool isLE = TLI.isLittleEndian();
Dan Gohman220a8232008-03-03 23:51:38 +00005173 APInt NewBits = APInt(DstBitSize, 0);
Chris Lattner6258fb22006-04-02 02:53:43 +00005174 bool EltIsUndef = true;
5175 for (unsigned j = 0; j != NumInputsPerOutput; ++j) {
5176 // Shift the previously computed bits over.
5177 NewBits <<= SrcBitSize;
Dan Gohman475871a2008-07-27 21:46:04 +00005178 SDValue Op = BV->getOperand(i+ (isLE ? (NumInputsPerOutput-j-1) : j));
Chris Lattner6258fb22006-04-02 02:53:43 +00005179 if (Op.getOpcode() == ISD::UNDEF) continue;
5180 EltIsUndef = false;
Scott Michelfdc40a02009-02-17 22:15:04 +00005181
Jay Foad40f8f622010-12-07 08:25:19 +00005182 NewBits |= cast<ConstantSDNode>(Op)->getAPIntValue().
Dan Gohman58c25872010-04-12 02:24:01 +00005183 zextOrTrunc(SrcBitSize).zext(DstBitSize);
Chris Lattner6258fb22006-04-02 02:53:43 +00005184 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005185
Chris Lattner6258fb22006-04-02 02:53:43 +00005186 if (EltIsUndef)
Dale Johannesene8d72302009-02-06 23:05:02 +00005187 Ops.push_back(DAG.getUNDEF(DstEltVT));
Chris Lattner6258fb22006-04-02 02:53:43 +00005188 else
5189 Ops.push_back(DAG.getConstant(NewBits, DstEltVT));
5190 }
5191
Owen Anderson23b9b192009-08-12 00:36:31 +00005192 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, Ops.size());
Evan Chenga87008d2009-02-25 22:49:59 +00005193 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT,
5194 &Ops[0], Ops.size());
Chris Lattner6258fb22006-04-02 02:53:43 +00005195 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005196
Chris Lattner6258fb22006-04-02 02:53:43 +00005197 // Finally, this must be the case where we are shrinking elements: each input
5198 // turns into multiple outputs.
Evan Chengefec7512008-02-18 23:04:32 +00005199 bool isS2V = ISD::isScalarToVector(BV);
Chris Lattner6258fb22006-04-02 02:53:43 +00005200 unsigned NumOutputsPerInput = SrcBitSize/DstBitSize;
Owen Anderson23b9b192009-08-12 00:36:31 +00005201 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT,
5202 NumOutputsPerInput*BV->getNumOperands());
Dan Gohman475871a2008-07-27 21:46:04 +00005203 SmallVector<SDValue, 8> Ops;
Bill Wendlingb0162f52009-01-30 22:53:48 +00005204
Dan Gohman7f321562007-06-25 16:23:39 +00005205 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) {
Chris Lattner6258fb22006-04-02 02:53:43 +00005206 if (BV->getOperand(i).getOpcode() == ISD::UNDEF) {
5207 for (unsigned j = 0; j != NumOutputsPerInput; ++j)
Dale Johannesene8d72302009-02-06 23:05:02 +00005208 Ops.push_back(DAG.getUNDEF(DstEltVT));
Chris Lattner6258fb22006-04-02 02:53:43 +00005209 continue;
5210 }
Bill Wendlingb0162f52009-01-30 22:53:48 +00005211
Jay Foad40f8f622010-12-07 08:25:19 +00005212 APInt OpVal = cast<ConstantSDNode>(BV->getOperand(i))->
5213 getAPIntValue().zextOrTrunc(SrcBitSize);
Bill Wendlingb0162f52009-01-30 22:53:48 +00005214
Chris Lattner6258fb22006-04-02 02:53:43 +00005215 for (unsigned j = 0; j != NumOutputsPerInput; ++j) {
Jay Foad40f8f622010-12-07 08:25:19 +00005216 APInt ThisVal = OpVal.trunc(DstBitSize);
Chris Lattner6258fb22006-04-02 02:53:43 +00005217 Ops.push_back(DAG.getConstant(ThisVal, DstEltVT));
Jay Foad40f8f622010-12-07 08:25:19 +00005218 if (isS2V && i == 0 && j == 0 && ThisVal.zext(SrcBitSize) == OpVal)
Evan Chengefec7512008-02-18 23:04:32 +00005219 // Simply turn this into a SCALAR_TO_VECTOR of the new type.
Bill Wendlingb0162f52009-01-30 22:53:48 +00005220 return DAG.getNode(ISD::SCALAR_TO_VECTOR, BV->getDebugLoc(), VT,
5221 Ops[0]);
Dan Gohman220a8232008-03-03 23:51:38 +00005222 OpVal = OpVal.lshr(DstBitSize);
Chris Lattner6258fb22006-04-02 02:53:43 +00005223 }
5224
5225 // For big endian targets, swap the order of the pieces of each element.
Duncan Sands0753fc12008-02-11 10:37:04 +00005226 if (TLI.isBigEndian())
Chris Lattner6258fb22006-04-02 02:53:43 +00005227 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end());
5228 }
Bill Wendlingb0162f52009-01-30 22:53:48 +00005229
Evan Chenga87008d2009-02-25 22:49:59 +00005230 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT,
5231 &Ops[0], Ops.size());
Chris Lattner6258fb22006-04-02 02:53:43 +00005232}
5233
Dan Gohman475871a2008-07-27 21:46:04 +00005234SDValue DAGCombiner::visitFADD(SDNode *N) {
5235 SDValue N0 = N->getOperand(0);
5236 SDValue N1 = N->getOperand(1);
Nate Begemana0e221d2005-10-18 00:28:13 +00005237 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5238 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005239 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005240
Dan Gohman7f321562007-06-25 16:23:39 +00005241 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00005242 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005243 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00005244 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00005245 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005246
Bill Wendlingb0162f52009-01-30 22:53:48 +00005247 // fold (fadd c1, c2) -> (fadd c1, c2)
Owen Anderson825b72b2009-08-11 20:47:22 +00005248 if (N0CFP && N1CFP && VT != MVT::ppcf128)
Bill Wendlingb0162f52009-01-30 22:53:48 +00005249 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0, N1);
Nate Begemana0e221d2005-10-18 00:28:13 +00005250 // canonicalize constant to RHS
5251 if (N0CFP && !N1CFP)
Bill Wendlingb0162f52009-01-30 22:53:48 +00005252 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N1, N0);
5253 // fold (fadd A, 0) -> A
Dan Gohman760f86f2009-01-22 21:58:43 +00005254 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero())
5255 return N0;
Bill Wendlingb0162f52009-01-30 22:53:48 +00005256 // fold (fadd A, (fneg B)) -> (fsub A, B)
Duncan Sands25cf2272008-11-24 14:53:14 +00005257 if (isNegatibleForFree(N1, LegalOperations) == 2)
Bill Wendlingb0162f52009-01-30 22:53:48 +00005258 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N0,
Duncan Sands25cf2272008-11-24 14:53:14 +00005259 GetNegatedExpression(N1, DAG, LegalOperations));
Bill Wendlingb0162f52009-01-30 22:53:48 +00005260 // fold (fadd (fneg A), B) -> (fsub B, A)
Duncan Sands25cf2272008-11-24 14:53:14 +00005261 if (isNegatibleForFree(N0, LegalOperations) == 2)
Bill Wendlingb0162f52009-01-30 22:53:48 +00005262 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N1,
Duncan Sands25cf2272008-11-24 14:53:14 +00005263 GetNegatedExpression(N0, DAG, LegalOperations));
Scott Michelfdc40a02009-02-17 22:15:04 +00005264
Chris Lattnerddae4bd2007-01-08 23:04:05 +00005265 // If allowed, fold (fadd (fadd x, c1), c2) -> (fadd x, (fadd c1, c2))
5266 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FADD &&
Gabor Greifba36cb52008-08-28 21:40:38 +00005267 N0.getNode()->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1)))
Bill Wendlingb0162f52009-01-30 22:53:48 +00005268 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0.getOperand(0),
Bill Wendlingfc4b6772009-02-01 11:19:36 +00005269 DAG.getNode(ISD::FADD, N->getDebugLoc(), VT,
5270 N0.getOperand(1), N1));
Scott Michelfdc40a02009-02-17 22:15:04 +00005271
Dan Gohman475871a2008-07-27 21:46:04 +00005272 return SDValue();
Chris Lattner01b3d732005-09-28 22:28:18 +00005273}
5274
Dan Gohman475871a2008-07-27 21:46:04 +00005275SDValue DAGCombiner::visitFSUB(SDNode *N) {
5276 SDValue N0 = N->getOperand(0);
5277 SDValue N1 = N->getOperand(1);
Nate Begemana0e221d2005-10-18 00:28:13 +00005278 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5279 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005280 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005281
Dan Gohman7f321562007-06-25 16:23:39 +00005282 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00005283 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005284 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00005285 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00005286 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005287
Nate Begemana0e221d2005-10-18 00:28:13 +00005288 // fold (fsub c1, c2) -> c1-c2
Owen Anderson825b72b2009-08-11 20:47:22 +00005289 if (N0CFP && N1CFP && VT != MVT::ppcf128)
Bill Wendlingfc4b6772009-02-01 11:19:36 +00005290 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N0, N1);
Bill Wendlingb0162f52009-01-30 22:53:48 +00005291 // fold (fsub A, 0) -> A
Dan Gohmana90c8e62009-01-23 19:10:37 +00005292 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero())
5293 return N0;
Bill Wendlingb0162f52009-01-30 22:53:48 +00005294 // fold (fsub 0, B) -> -B
Dale Johannesenc4dd3c32007-08-31 23:34:27 +00005295 if (UnsafeFPMath && N0CFP && N0CFP->getValueAPF().isZero()) {
Duncan Sands25cf2272008-11-24 14:53:14 +00005296 if (isNegatibleForFree(N1, LegalOperations))
5297 return GetNegatedExpression(N1, DAG, LegalOperations);
Dan Gohman760f86f2009-01-22 21:58:43 +00005298 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
Bill Wendlingb0162f52009-01-30 22:53:48 +00005299 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT, N1);
Dan Gohman23ff1822007-07-02 15:48:56 +00005300 }
Bill Wendlingb0162f52009-01-30 22:53:48 +00005301 // fold (fsub A, (fneg B)) -> (fadd A, B)
Duncan Sands25cf2272008-11-24 14:53:14 +00005302 if (isNegatibleForFree(N1, LegalOperations))
Bill Wendlingb0162f52009-01-30 22:53:48 +00005303 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0,
Duncan Sands25cf2272008-11-24 14:53:14 +00005304 GetNegatedExpression(N1, DAG, LegalOperations));
Scott Michelfdc40a02009-02-17 22:15:04 +00005305
Dan Gohman475871a2008-07-27 21:46:04 +00005306 return SDValue();
Chris Lattner01b3d732005-09-28 22:28:18 +00005307}
5308
Dan Gohman475871a2008-07-27 21:46:04 +00005309SDValue DAGCombiner::visitFMUL(SDNode *N) {
5310 SDValue N0 = N->getOperand(0);
5311 SDValue N1 = N->getOperand(1);
Nate Begeman11af4ea2005-10-17 20:40:11 +00005312 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5313 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005314 EVT VT = N->getValueType(0);
Chris Lattner01b3d732005-09-28 22:28:18 +00005315
Dan Gohman7f321562007-06-25 16:23:39 +00005316 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00005317 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005318 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00005319 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00005320 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005321
Nate Begeman11af4ea2005-10-17 20:40:11 +00005322 // fold (fmul c1, c2) -> c1*c2
Owen Anderson825b72b2009-08-11 20:47:22 +00005323 if (N0CFP && N1CFP && VT != MVT::ppcf128)
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005324 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N0, N1);
Nate Begeman11af4ea2005-10-17 20:40:11 +00005325 // canonicalize constant to RHS
Nate Begemana0e221d2005-10-18 00:28:13 +00005326 if (N0CFP && !N1CFP)
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005327 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N1, N0);
5328 // fold (fmul A, 0) -> 0
Dan Gohman760f86f2009-01-22 21:58:43 +00005329 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero())
5330 return N1;
Dan Gohman77b81fe2009-06-04 17:12:12 +00005331 // fold (fmul A, 0) -> 0, vector edition.
5332 if (UnsafeFPMath && ISD::isBuildVectorAllZeros(N1.getNode()))
5333 return N1;
Nate Begeman11af4ea2005-10-17 20:40:11 +00005334 // fold (fmul X, 2.0) -> (fadd X, X)
5335 if (N1CFP && N1CFP->isExactlyValue(+2.0))
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005336 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0, N0);
Dan Gohmaneb1fedc2009-08-10 16:50:32 +00005337 // fold (fmul X, -1.0) -> (fneg X)
Chris Lattner29446522007-05-14 22:04:50 +00005338 if (N1CFP && N1CFP->isExactlyValue(-1.0))
Dan Gohman760f86f2009-01-22 21:58:43 +00005339 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005340 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005341
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005342 // fold (fmul (fneg X), (fneg Y)) -> (fmul X, Y)
Duncan Sands25cf2272008-11-24 14:53:14 +00005343 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations)) {
5344 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations)) {
Chris Lattner29446522007-05-14 22:04:50 +00005345 // Both can be negated for free, check to see if at least one is cheaper
5346 // negated.
5347 if (LHSNeg == 2 || RHSNeg == 2)
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005348 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT,
Duncan Sands25cf2272008-11-24 14:53:14 +00005349 GetNegatedExpression(N0, DAG, LegalOperations),
5350 GetNegatedExpression(N1, DAG, LegalOperations));
Chris Lattner29446522007-05-14 22:04:50 +00005351 }
5352 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005353
Chris Lattnerddae4bd2007-01-08 23:04:05 +00005354 // If allowed, fold (fmul (fmul x, c1), c2) -> (fmul x, (fmul c1, c2))
5355 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FMUL &&
Gabor Greifba36cb52008-08-28 21:40:38 +00005356 N0.getNode()->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1)))
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005357 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N0.getOperand(0),
Scott Michelfdc40a02009-02-17 22:15:04 +00005358 DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT,
Dale Johannesende064702009-02-06 21:50:26 +00005359 N0.getOperand(1), N1));
Scott Michelfdc40a02009-02-17 22:15:04 +00005360
Dan Gohman475871a2008-07-27 21:46:04 +00005361 return SDValue();
Chris Lattner01b3d732005-09-28 22:28:18 +00005362}
5363
Dan Gohman475871a2008-07-27 21:46:04 +00005364SDValue DAGCombiner::visitFDIV(SDNode *N) {
5365 SDValue N0 = N->getOperand(0);
5366 SDValue N1 = N->getOperand(1);
Nate Begemana148d982006-01-18 22:35:16 +00005367 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5368 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005369 EVT VT = N->getValueType(0);
Chris Lattner01b3d732005-09-28 22:28:18 +00005370
Dan Gohman7f321562007-06-25 16:23:39 +00005371 // fold vector ops
Duncan Sands83ec4b62008-06-06 12:08:01 +00005372 if (VT.isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005373 SDValue FoldedVOp = SimplifyVBinOp(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00005374 if (FoldedVOp.getNode()) return FoldedVOp;
Dan Gohman05d92fe2007-07-13 20:03:40 +00005375 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005376
Nate Begemana148d982006-01-18 22:35:16 +00005377 // fold (fdiv c1, c2) -> c1/c2
Owen Anderson825b72b2009-08-11 20:47:22 +00005378 if (N0CFP && N1CFP && VT != MVT::ppcf128)
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005379 return DAG.getNode(ISD::FDIV, N->getDebugLoc(), VT, N0, N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00005380
5381
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005382 // (fdiv (fneg X), (fneg Y)) -> (fdiv X, Y)
Duncan Sands25cf2272008-11-24 14:53:14 +00005383 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations)) {
5384 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations)) {
Chris Lattner29446522007-05-14 22:04:50 +00005385 // Both can be negated for free, check to see if at least one is cheaper
5386 // negated.
5387 if (LHSNeg == 2 || RHSNeg == 2)
Scott Michelfdc40a02009-02-17 22:15:04 +00005388 return DAG.getNode(ISD::FDIV, N->getDebugLoc(), VT,
Duncan Sands25cf2272008-11-24 14:53:14 +00005389 GetNegatedExpression(N0, DAG, LegalOperations),
5390 GetNegatedExpression(N1, DAG, LegalOperations));
Chris Lattner29446522007-05-14 22:04:50 +00005391 }
5392 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005393
Dan Gohman475871a2008-07-27 21:46:04 +00005394 return SDValue();
Chris Lattner01b3d732005-09-28 22:28:18 +00005395}
5396
Dan Gohman475871a2008-07-27 21:46:04 +00005397SDValue DAGCombiner::visitFREM(SDNode *N) {
5398 SDValue N0 = N->getOperand(0);
5399 SDValue N1 = N->getOperand(1);
Nate Begemana148d982006-01-18 22:35:16 +00005400 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5401 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005402 EVT VT = N->getValueType(0);
Chris Lattner01b3d732005-09-28 22:28:18 +00005403
Nate Begemana148d982006-01-18 22:35:16 +00005404 // fold (frem c1, c2) -> fmod(c1,c2)
Owen Anderson825b72b2009-08-11 20:47:22 +00005405 if (N0CFP && N1CFP && VT != MVT::ppcf128)
Bill Wendlinga03e74b2009-01-30 22:57:07 +00005406 return DAG.getNode(ISD::FREM, N->getDebugLoc(), VT, N0, N1);
Dan Gohman7f321562007-06-25 16:23:39 +00005407
Dan Gohman475871a2008-07-27 21:46:04 +00005408 return SDValue();
Chris Lattner01b3d732005-09-28 22:28:18 +00005409}
5410
Dan Gohman475871a2008-07-27 21:46:04 +00005411SDValue DAGCombiner::visitFCOPYSIGN(SDNode *N) {
5412 SDValue N0 = N->getOperand(0);
5413 SDValue N1 = N->getOperand(1);
Chris Lattner12d83032006-03-05 05:30:57 +00005414 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
5415 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
Owen Andersone50ed302009-08-10 22:56:29 +00005416 EVT VT = N->getValueType(0);
Chris Lattner12d83032006-03-05 05:30:57 +00005417
Owen Anderson825b72b2009-08-11 20:47:22 +00005418 if (N0CFP && N1CFP && VT != MVT::ppcf128) // Constant fold
Bill Wendlingfc4b6772009-02-01 11:19:36 +00005419 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, N0, N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00005420
Chris Lattner12d83032006-03-05 05:30:57 +00005421 if (N1CFP) {
Dale Johannesene6c17422007-08-26 01:18:27 +00005422 const APFloat& V = N1CFP->getValueAPF();
Chris Lattner12d83032006-03-05 05:30:57 +00005423 // copysign(x, c1) -> fabs(x) iff ispos(c1)
5424 // copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1)
Dan Gohman760f86f2009-01-22 21:58:43 +00005425 if (!V.isNegative()) {
5426 if (!LegalOperations || TLI.isOperationLegal(ISD::FABS, VT))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005427 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0);
Dan Gohman760f86f2009-01-22 21:58:43 +00005428 } else {
5429 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005430 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT,
Bill Wendling9729c5a2009-01-31 03:12:48 +00005431 DAG.getNode(ISD::FABS, N0.getDebugLoc(), VT, N0));
Dan Gohman760f86f2009-01-22 21:58:43 +00005432 }
Chris Lattner12d83032006-03-05 05:30:57 +00005433 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005434
Chris Lattner12d83032006-03-05 05:30:57 +00005435 // copysign(fabs(x), y) -> copysign(x, y)
5436 // copysign(fneg(x), y) -> copysign(x, y)
5437 // copysign(copysign(x,z), y) -> copysign(x, y)
5438 if (N0.getOpcode() == ISD::FABS || N0.getOpcode() == ISD::FNEG ||
5439 N0.getOpcode() == ISD::FCOPYSIGN)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005440 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT,
5441 N0.getOperand(0), N1);
Chris Lattner12d83032006-03-05 05:30:57 +00005442
5443 // copysign(x, abs(y)) -> abs(x)
5444 if (N1.getOpcode() == ISD::FABS)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005445 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005446
Chris Lattner12d83032006-03-05 05:30:57 +00005447 // copysign(x, copysign(y,z)) -> copysign(x, z)
5448 if (N1.getOpcode() == ISD::FCOPYSIGN)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005449 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT,
5450 N0, N1.getOperand(1));
Scott Michelfdc40a02009-02-17 22:15:04 +00005451
Chris Lattner12d83032006-03-05 05:30:57 +00005452 // copysign(x, fp_extend(y)) -> copysign(x, y)
5453 // copysign(x, fp_round(y)) -> copysign(x, y)
5454 if (N1.getOpcode() == ISD::FP_EXTEND || N1.getOpcode() == ISD::FP_ROUND)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005455 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT,
5456 N0, N1.getOperand(0));
Scott Michelfdc40a02009-02-17 22:15:04 +00005457
Dan Gohman475871a2008-07-27 21:46:04 +00005458 return SDValue();
Chris Lattner12d83032006-03-05 05:30:57 +00005459}
5460
Dan Gohman475871a2008-07-27 21:46:04 +00005461SDValue DAGCombiner::visitSINT_TO_FP(SDNode *N) {
5462 SDValue N0 = N->getOperand(0);
Nate Begeman646d7e22005-09-02 21:18:40 +00005463 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005464 EVT VT = N->getValueType(0);
5465 EVT OpVT = N0.getValueType();
Chris Lattnercda88752008-06-26 00:16:49 +00005466
Nate Begeman1d4d4142005-09-01 00:19:25 +00005467 // fold (sint_to_fp c1) -> c1fp
Stuart Hastings7e334182011-03-02 19:36:30 +00005468 if (N0C && OpVT != MVT::ppcf128 &&
5469 // ...but only if the target supports immediate floating-point values
Evan Cheng9568e5c2011-06-21 06:01:08 +00005470 (Level == llvm::Unrestricted ||
5471 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT)))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005472 return DAG.getNode(ISD::SINT_TO_FP, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005473
Chris Lattnercda88752008-06-26 00:16:49 +00005474 // If the input is a legal type, and SINT_TO_FP is not legal on this target,
5475 // but UINT_TO_FP is legal on this target, try to convert.
Dan Gohmanf560ffa2009-01-28 17:46:25 +00005476 if (!TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT) &&
5477 TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT)) {
Scott Michelfdc40a02009-02-17 22:15:04 +00005478 // If the sign bit is known to be zero, we can change this to UINT_TO_FP.
Chris Lattnercda88752008-06-26 00:16:49 +00005479 if (DAG.SignBitIsZero(N0))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005480 return DAG.getNode(ISD::UINT_TO_FP, N->getDebugLoc(), VT, N0);
Chris Lattnercda88752008-06-26 00:16:49 +00005481 }
Bill Wendling0225a1d2009-01-30 23:15:49 +00005482
Dan Gohman475871a2008-07-27 21:46:04 +00005483 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005484}
5485
Dan Gohman475871a2008-07-27 21:46:04 +00005486SDValue DAGCombiner::visitUINT_TO_FP(SDNode *N) {
5487 SDValue N0 = N->getOperand(0);
Nate Begeman646d7e22005-09-02 21:18:40 +00005488 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005489 EVT VT = N->getValueType(0);
5490 EVT OpVT = N0.getValueType();
Nate Begemana148d982006-01-18 22:35:16 +00005491
Nate Begeman1d4d4142005-09-01 00:19:25 +00005492 // fold (uint_to_fp c1) -> c1fp
Stuart Hastings7e334182011-03-02 19:36:30 +00005493 if (N0C && OpVT != MVT::ppcf128 &&
5494 // ...but only if the target supports immediate floating-point values
Evan Cheng9568e5c2011-06-21 06:01:08 +00005495 (Level == llvm::Unrestricted ||
5496 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT)))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005497 return DAG.getNode(ISD::UINT_TO_FP, N->getDebugLoc(), VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005498
Chris Lattnercda88752008-06-26 00:16:49 +00005499 // If the input is a legal type, and UINT_TO_FP is not legal on this target,
5500 // but SINT_TO_FP is legal on this target, try to convert.
Dan Gohmanf560ffa2009-01-28 17:46:25 +00005501 if (!TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT) &&
5502 TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT)) {
Scott Michelfdc40a02009-02-17 22:15:04 +00005503 // If the sign bit is known to be zero, we can change this to SINT_TO_FP.
Chris Lattnercda88752008-06-26 00:16:49 +00005504 if (DAG.SignBitIsZero(N0))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005505 return DAG.getNode(ISD::SINT_TO_FP, N->getDebugLoc(), VT, N0);
Chris Lattnercda88752008-06-26 00:16:49 +00005506 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005507
Dan Gohman475871a2008-07-27 21:46:04 +00005508 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005509}
5510
Dan Gohman475871a2008-07-27 21:46:04 +00005511SDValue DAGCombiner::visitFP_TO_SINT(SDNode *N) {
5512 SDValue N0 = N->getOperand(0);
Nate Begemana148d982006-01-18 22:35:16 +00005513 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005514 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005515
Nate Begeman1d4d4142005-09-01 00:19:25 +00005516 // fold (fp_to_sint c1fp) -> c1
Nate Begeman646d7e22005-09-02 21:18:40 +00005517 if (N0CFP)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005518 return DAG.getNode(ISD::FP_TO_SINT, N->getDebugLoc(), VT, N0);
5519
Dan Gohman475871a2008-07-27 21:46:04 +00005520 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005521}
5522
Dan Gohman475871a2008-07-27 21:46:04 +00005523SDValue DAGCombiner::visitFP_TO_UINT(SDNode *N) {
5524 SDValue N0 = N->getOperand(0);
Nate Begemana148d982006-01-18 22:35:16 +00005525 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005526 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005527
Nate Begeman1d4d4142005-09-01 00:19:25 +00005528 // fold (fp_to_uint c1fp) -> c1
Owen Anderson825b72b2009-08-11 20:47:22 +00005529 if (N0CFP && VT != MVT::ppcf128)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005530 return DAG.getNode(ISD::FP_TO_UINT, N->getDebugLoc(), VT, N0);
5531
Dan Gohman475871a2008-07-27 21:46:04 +00005532 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005533}
5534
Dan Gohman475871a2008-07-27 21:46:04 +00005535SDValue DAGCombiner::visitFP_ROUND(SDNode *N) {
5536 SDValue N0 = N->getOperand(0);
5537 SDValue N1 = N->getOperand(1);
Nate Begemana148d982006-01-18 22:35:16 +00005538 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005539 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005540
Nate Begeman1d4d4142005-09-01 00:19:25 +00005541 // fold (fp_round c1fp) -> c1fp
Owen Anderson825b72b2009-08-11 20:47:22 +00005542 if (N0CFP && N0.getValueType() != MVT::ppcf128)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005543 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT, N0, N1);
Scott Michelfdc40a02009-02-17 22:15:04 +00005544
Chris Lattner79dbea52006-03-13 06:26:26 +00005545 // fold (fp_round (fp_extend x)) -> x
5546 if (N0.getOpcode() == ISD::FP_EXTEND && VT == N0.getOperand(0).getValueType())
5547 return N0.getOperand(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005548
Chris Lattner0aa5e6f2008-01-24 06:45:35 +00005549 // fold (fp_round (fp_round x)) -> (fp_round x)
5550 if (N0.getOpcode() == ISD::FP_ROUND) {
5551 // This is a value preserving truncation if both round's are.
5552 bool IsTrunc = N->getConstantOperandVal(1) == 1 &&
Gabor Greifba36cb52008-08-28 21:40:38 +00005553 N0.getNode()->getConstantOperandVal(1) == 1;
Bill Wendling0225a1d2009-01-30 23:15:49 +00005554 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT, N0.getOperand(0),
Chris Lattner0aa5e6f2008-01-24 06:45:35 +00005555 DAG.getIntPtrConstant(IsTrunc));
5556 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005557
Chris Lattner79dbea52006-03-13 06:26:26 +00005558 // fold (fp_round (copysign X, Y)) -> (copysign (fp_round X), Y)
Gabor Greifba36cb52008-08-28 21:40:38 +00005559 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse()) {
Bill Wendling0225a1d2009-01-30 23:15:49 +00005560 SDValue Tmp = DAG.getNode(ISD::FP_ROUND, N0.getDebugLoc(), VT,
5561 N0.getOperand(0), N1);
Gabor Greifba36cb52008-08-28 21:40:38 +00005562 AddToWorkList(Tmp.getNode());
Bill Wendling0225a1d2009-01-30 23:15:49 +00005563 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT,
5564 Tmp, N0.getOperand(1));
Chris Lattner79dbea52006-03-13 06:26:26 +00005565 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005566
Dan Gohman475871a2008-07-27 21:46:04 +00005567 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005568}
5569
Dan Gohman475871a2008-07-27 21:46:04 +00005570SDValue DAGCombiner::visitFP_ROUND_INREG(SDNode *N) {
5571 SDValue N0 = N->getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00005572 EVT VT = N->getValueType(0);
5573 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
Nate Begeman646d7e22005-09-02 21:18:40 +00005574 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005575
Nate Begeman1d4d4142005-09-01 00:19:25 +00005576 // fold (fp_round_inreg c1fp) -> c1fp
Chris Lattner2392ae72010-04-15 04:48:01 +00005577 if (N0CFP && isTypeLegal(EVT)) {
Dan Gohman4fbd7962008-09-12 18:08:03 +00005578 SDValue Round = DAG.getConstantFP(*N0CFP->getConstantFPValue(), EVT);
Bill Wendling0225a1d2009-01-30 23:15:49 +00005579 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, Round);
Nate Begeman1d4d4142005-09-01 00:19:25 +00005580 }
Bill Wendling0225a1d2009-01-30 23:15:49 +00005581
Dan Gohman475871a2008-07-27 21:46:04 +00005582 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005583}
5584
Dan Gohman475871a2008-07-27 21:46:04 +00005585SDValue DAGCombiner::visitFP_EXTEND(SDNode *N) {
5586 SDValue N0 = N->getOperand(0);
Nate Begemana148d982006-01-18 22:35:16 +00005587 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005588 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005589
Chris Lattner5938bef2007-12-29 06:55:23 +00005590 // If this is fp_round(fpextend), don't fold it, allow ourselves to be folded.
Scott Michelfdc40a02009-02-17 22:15:04 +00005591 if (N->hasOneUse() &&
Dan Gohmane7852d02009-01-26 04:35:06 +00005592 N->use_begin()->getOpcode() == ISD::FP_ROUND)
Dan Gohman475871a2008-07-27 21:46:04 +00005593 return SDValue();
Chris Lattner0bd48932008-01-17 07:00:52 +00005594
Nate Begeman1d4d4142005-09-01 00:19:25 +00005595 // fold (fp_extend c1fp) -> c1fp
Owen Anderson825b72b2009-08-11 20:47:22 +00005596 if (N0CFP && VT != MVT::ppcf128)
Bill Wendling0225a1d2009-01-30 23:15:49 +00005597 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, N0);
Chris Lattner0bd48932008-01-17 07:00:52 +00005598
5599 // Turn fp_extend(fp_round(X, 1)) -> x since the fp_round doesn't affect the
5600 // value of X.
Gabor Greif12632d22008-08-30 19:29:20 +00005601 if (N0.getOpcode() == ISD::FP_ROUND
5602 && N0.getNode()->getConstantOperandVal(1) == 1) {
Dan Gohman475871a2008-07-27 21:46:04 +00005603 SDValue In = N0.getOperand(0);
Chris Lattner0bd48932008-01-17 07:00:52 +00005604 if (In.getValueType() == VT) return In;
Duncan Sands8e4eb092008-06-08 20:54:56 +00005605 if (VT.bitsLT(In.getValueType()))
Bill Wendling0225a1d2009-01-30 23:15:49 +00005606 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT,
5607 In, N0.getOperand(1));
5608 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, In);
Chris Lattner0bd48932008-01-17 07:00:52 +00005609 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005610
Chris Lattner0bd48932008-01-17 07:00:52 +00005611 // fold (fpext (load x)) -> (fpext (fptrunc (extload x)))
Gabor Greifba36cb52008-08-28 21:40:38 +00005612 if (ISD::isNON_EXTLoad(N0.getNode()) && N0.hasOneUse() &&
Duncan Sands25cf2272008-11-24 14:53:14 +00005613 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
Evan Cheng03294662008-10-14 21:26:46 +00005614 TLI.isLoadExtLegal(ISD::EXTLOAD, N0.getValueType()))) {
Evan Cheng466685d2006-10-09 20:57:25 +00005615 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
Stuart Hastingsa9011292011-02-16 16:23:55 +00005616 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, N->getDebugLoc(), VT,
Bill Wendling0225a1d2009-01-30 23:15:49 +00005617 LN0->getChain(),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00005618 LN0->getBasePtr(), LN0->getPointerInfo(),
Duncan Sands25cf2272008-11-24 14:53:14 +00005619 N0.getValueType(),
David Greene1e559442010-02-15 17:00:31 +00005620 LN0->isVolatile(), LN0->isNonTemporal(),
5621 LN0->getAlignment());
Chris Lattnere564dbb2006-05-05 21:34:35 +00005622 CombineTo(N, ExtLoad);
Bill Wendling0225a1d2009-01-30 23:15:49 +00005623 CombineTo(N0.getNode(),
5624 DAG.getNode(ISD::FP_ROUND, N0.getDebugLoc(),
5625 N0.getValueType(), ExtLoad, DAG.getIntPtrConstant(1)),
Chris Lattnere564dbb2006-05-05 21:34:35 +00005626 ExtLoad.getValue(1));
Dan Gohman475871a2008-07-27 21:46:04 +00005627 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Chris Lattnere564dbb2006-05-05 21:34:35 +00005628 }
Duncan Sandsd4b9c172008-06-13 19:07:40 +00005629
Dan Gohman475871a2008-07-27 21:46:04 +00005630 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005631}
5632
Dan Gohman475871a2008-07-27 21:46:04 +00005633SDValue DAGCombiner::visitFNEG(SDNode *N) {
5634 SDValue N0 = N->getOperand(0);
Anton Korobeynikov2bcf60a2009-10-20 21:37:45 +00005635 EVT VT = N->getValueType(0);
Nate Begemana148d982006-01-18 22:35:16 +00005636
Duncan Sands25cf2272008-11-24 14:53:14 +00005637 if (isNegatibleForFree(N0, LegalOperations))
5638 return GetNegatedExpression(N0, DAG, LegalOperations);
Dan Gohman23ff1822007-07-02 15:48:56 +00005639
Chris Lattner3bd39d42008-01-27 17:42:27 +00005640 // Transform fneg(bitconvert(x)) -> bitconvert(x^sign) to avoid loading
5641 // constant pool values.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005642 if (N0.getOpcode() == ISD::BITCAST &&
Anton Korobeynikov2bcf60a2009-10-20 21:37:45 +00005643 !VT.isVector() &&
5644 N0.getNode()->hasOneUse() &&
5645 N0.getOperand(0).getValueType().isInteger()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005646 SDValue Int = N0.getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00005647 EVT IntVT = Int.getValueType();
Duncan Sands83ec4b62008-06-06 12:08:01 +00005648 if (IntVT.isInteger() && !IntVT.isVector()) {
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00005649 Int = DAG.getNode(ISD::XOR, N0.getDebugLoc(), IntVT, Int,
5650 DAG.getConstant(APInt::getSignBit(IntVT.getSizeInBits()), IntVT));
Gabor Greifba36cb52008-08-28 21:40:38 +00005651 AddToWorkList(Int.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005652 return DAG.getNode(ISD::BITCAST, N->getDebugLoc(),
Anton Korobeynikov2bcf60a2009-10-20 21:37:45 +00005653 VT, Int);
Chris Lattner3bd39d42008-01-27 17:42:27 +00005654 }
5655 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005656
Dan Gohman475871a2008-07-27 21:46:04 +00005657 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005658}
5659
Dan Gohman475871a2008-07-27 21:46:04 +00005660SDValue DAGCombiner::visitFABS(SDNode *N) {
5661 SDValue N0 = N->getOperand(0);
Nate Begemana148d982006-01-18 22:35:16 +00005662 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
Owen Andersone50ed302009-08-10 22:56:29 +00005663 EVT VT = N->getValueType(0);
Scott Michelfdc40a02009-02-17 22:15:04 +00005664
Nate Begeman1d4d4142005-09-01 00:19:25 +00005665 // fold (fabs c1) -> fabs(c1)
Owen Anderson825b72b2009-08-11 20:47:22 +00005666 if (N0CFP && VT != MVT::ppcf128)
Bill Wendlingc0debad2009-01-30 23:27:35 +00005667 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00005668 // fold (fabs (fabs x)) -> (fabs x)
Chris Lattner12d83032006-03-05 05:30:57 +00005669 if (N0.getOpcode() == ISD::FABS)
Nate Begeman83e75ec2005-09-06 04:43:02 +00005670 return N->getOperand(0);
Nate Begeman1d4d4142005-09-01 00:19:25 +00005671 // fold (fabs (fneg x)) -> (fabs x)
Chris Lattner12d83032006-03-05 05:30:57 +00005672 // fold (fabs (fcopysign x, y)) -> (fabs x)
5673 if (N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FCOPYSIGN)
Bill Wendlingc0debad2009-01-30 23:27:35 +00005674 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0.getOperand(0));
Scott Michelfdc40a02009-02-17 22:15:04 +00005675
Chris Lattner3bd39d42008-01-27 17:42:27 +00005676 // Transform fabs(bitconvert(x)) -> bitconvert(x&~sign) to avoid loading
5677 // constant pool values.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005678 if (N0.getOpcode() == ISD::BITCAST && N0.getNode()->hasOneUse() &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00005679 N0.getOperand(0).getValueType().isInteger() &&
5680 !N0.getOperand(0).getValueType().isVector()) {
Dan Gohman475871a2008-07-27 21:46:04 +00005681 SDValue Int = N0.getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00005682 EVT IntVT = Int.getValueType();
Duncan Sands83ec4b62008-06-06 12:08:01 +00005683 if (IntVT.isInteger() && !IntVT.isVector()) {
Scott Michelfdc40a02009-02-17 22:15:04 +00005684 Int = DAG.getNode(ISD::AND, N0.getDebugLoc(), IntVT, Int,
Duncan Sandsb0d5cdd2009-02-01 18:06:53 +00005685 DAG.getConstant(~APInt::getSignBit(IntVT.getSizeInBits()), IntVT));
Gabor Greifba36cb52008-08-28 21:40:38 +00005686 AddToWorkList(Int.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005687 return DAG.getNode(ISD::BITCAST, N->getDebugLoc(),
Bill Wendlingc0debad2009-01-30 23:27:35 +00005688 N->getValueType(0), Int);
Chris Lattner3bd39d42008-01-27 17:42:27 +00005689 }
5690 }
Scott Michelfdc40a02009-02-17 22:15:04 +00005691
Dan Gohman475871a2008-07-27 21:46:04 +00005692 return SDValue();
Nate Begeman1d4d4142005-09-01 00:19:25 +00005693}
5694
Dan Gohman475871a2008-07-27 21:46:04 +00005695SDValue DAGCombiner::visitBRCOND(SDNode *N) {
5696 SDValue Chain = N->getOperand(0);
5697 SDValue N1 = N->getOperand(1);
5698 SDValue N2 = N->getOperand(2);
Scott Michelfdc40a02009-02-17 22:15:04 +00005699
Dan Gohmane0f06c72009-11-17 00:47:23 +00005700 // If N is a constant we could fold this into a fallthrough or unconditional
5701 // branch. However that doesn't happen very often in normal code, because
5702 // Instcombine/SimplifyCFG should have handled the available opportunities.
5703 // If we did this folding here, it would be necessary to update the
5704 // MachineBasicBlock CFG, which is awkward.
5705
Nate Begeman750ac1b2006-02-01 07:19:44 +00005706 // fold a brcond with a setcc condition into a BR_CC node if BR_CC is legal
5707 // on the target.
Scott Michelfdc40a02009-02-17 22:15:04 +00005708 if (N1.getOpcode() == ISD::SETCC &&
Owen Anderson825b72b2009-08-11 20:47:22 +00005709 TLI.isOperationLegalOrCustom(ISD::BR_CC, MVT::Other)) {
5710 return DAG.getNode(ISD::BR_CC, N->getDebugLoc(), MVT::Other,
Bill Wendlingc0debad2009-01-30 23:27:35 +00005711 Chain, N1.getOperand(2),
Nate Begeman750ac1b2006-02-01 07:19:44 +00005712 N1.getOperand(0), N1.getOperand(1), N2);
5713 }
Bill Wendlingc0debad2009-01-30 23:27:35 +00005714
Evan Cheng2a135ae2010-10-04 22:41:01 +00005715 if ((N1.hasOneUse() && N1.getOpcode() == ISD::SRL) ||
5716 ((N1.getOpcode() == ISD::TRUNCATE && N1.hasOneUse()) &&
5717 (N1.getOperand(0).hasOneUse() &&
5718 N1.getOperand(0).getOpcode() == ISD::SRL))) {
5719 SDNode *Trunc = 0;
5720 if (N1.getOpcode() == ISD::TRUNCATE) {
5721 // Look pass the truncate.
5722 Trunc = N1.getNode();
5723 N1 = N1.getOperand(0);
5724 }
Evan Chengd40d03e2010-01-06 19:38:29 +00005725
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005726 // Match this pattern so that we can generate simpler code:
5727 //
5728 // %a = ...
5729 // %b = and i32 %a, 2
5730 // %c = srl i32 %b, 1
5731 // brcond i32 %c ...
5732 //
5733 // into
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005734 //
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005735 // %a = ...
Evan Chengd40d03e2010-01-06 19:38:29 +00005736 // %b = and i32 %a, 2
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005737 // %c = setcc eq %b, 0
5738 // brcond %c ...
5739 //
5740 // This applies only when the AND constant value has one bit set and the
5741 // SRL constant is equal to the log2 of the AND constant. The back-end is
5742 // smart enough to convert the result into a TEST/JMP sequence.
5743 SDValue Op0 = N1.getOperand(0);
5744 SDValue Op1 = N1.getOperand(1);
5745
5746 if (Op0.getOpcode() == ISD::AND &&
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005747 Op1.getOpcode() == ISD::Constant) {
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005748 SDValue AndOp1 = Op0.getOperand(1);
5749
5750 if (AndOp1.getOpcode() == ISD::Constant) {
5751 const APInt &AndConst = cast<ConstantSDNode>(AndOp1)->getAPIntValue();
5752
5753 if (AndConst.isPowerOf2() &&
5754 cast<ConstantSDNode>(Op1)->getAPIntValue()==AndConst.logBase2()) {
5755 SDValue SetCC =
5756 DAG.getSetCC(N->getDebugLoc(),
5757 TLI.getSetCCResultType(Op0.getValueType()),
5758 Op0, DAG.getConstant(0, Op0.getValueType()),
5759 ISD::SETNE);
5760
Evan Chengd40d03e2010-01-06 19:38:29 +00005761 SDValue NewBRCond = DAG.getNode(ISD::BRCOND, N->getDebugLoc(),
5762 MVT::Other, Chain, SetCC, N2);
5763 // Don't add the new BRCond into the worklist or else SimplifySelectCC
5764 // will convert it back to (X & C1) >> C2.
5765 CombineTo(N, NewBRCond, false);
5766 // Truncate is dead.
5767 if (Trunc) {
5768 removeFromWorkList(Trunc);
5769 DAG.DeleteNode(Trunc);
5770 }
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005771 // Replace the uses of SRL with SETCC
Evan Cheng2c755ba2010-02-27 07:36:59 +00005772 WorkListRemover DeadNodes(*this);
5773 DAG.ReplaceAllUsesOfValueWith(N1, SetCC, &DeadNodes);
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005774 removeFromWorkList(N1.getNode());
5775 DAG.DeleteNode(N1.getNode());
Evan Chengd40d03e2010-01-06 19:38:29 +00005776 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005777 }
5778 }
5779 }
Evan Cheng2a135ae2010-10-04 22:41:01 +00005780
5781 if (Trunc)
5782 // Restore N1 if the above transformation doesn't match.
5783 N1 = N->getOperand(1);
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005784 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00005785
Evan Cheng2c755ba2010-02-27 07:36:59 +00005786 // Transform br(xor(x, y)) -> br(x != y)
5787 // Transform br(xor(xor(x,y), 1)) -> br (x == y)
5788 if (N1.hasOneUse() && N1.getOpcode() == ISD::XOR) {
5789 SDNode *TheXor = N1.getNode();
5790 SDValue Op0 = TheXor->getOperand(0);
5791 SDValue Op1 = TheXor->getOperand(1);
5792 if (Op0.getOpcode() == Op1.getOpcode()) {
5793 // Avoid missing important xor optimizations.
5794 SDValue Tmp = visitXOR(TheXor);
Bill Wendling86c5abb2010-04-20 01:25:01 +00005795 if (Tmp.getNode() && Tmp.getNode() != TheXor) {
Evan Cheng2c755ba2010-02-27 07:36:59 +00005796 DEBUG(dbgs() << "\nReplacing.8 ";
5797 TheXor->dump(&DAG);
5798 dbgs() << "\nWith: ";
5799 Tmp.getNode()->dump(&DAG);
5800 dbgs() << '\n');
5801 WorkListRemover DeadNodes(*this);
5802 DAG.ReplaceAllUsesOfValueWith(N1, Tmp, &DeadNodes);
5803 removeFromWorkList(TheXor);
5804 DAG.DeleteNode(TheXor);
5805 return DAG.getNode(ISD::BRCOND, N->getDebugLoc(),
5806 MVT::Other, Chain, Tmp, N2);
5807 }
5808 }
5809
5810 if (Op0.getOpcode() != ISD::SETCC && Op1.getOpcode() != ISD::SETCC) {
5811 bool Equal = false;
5812 if (ConstantSDNode *RHSCI = dyn_cast<ConstantSDNode>(Op0))
5813 if (RHSCI->getAPIntValue() == 1 && Op0.hasOneUse() &&
5814 Op0.getOpcode() == ISD::XOR) {
5815 TheXor = Op0.getNode();
5816 Equal = true;
5817 }
5818
Evan Cheng2a135ae2010-10-04 22:41:01 +00005819 EVT SetCCVT = N1.getValueType();
Evan Cheng2c755ba2010-02-27 07:36:59 +00005820 if (LegalTypes)
5821 SetCCVT = TLI.getSetCCResultType(SetCCVT);
5822 SDValue SetCC = DAG.getSetCC(TheXor->getDebugLoc(),
5823 SetCCVT,
5824 Op0, Op1,
5825 Equal ? ISD::SETEQ : ISD::SETNE);
5826 // Replace the uses of XOR with SETCC
5827 WorkListRemover DeadNodes(*this);
Evan Cheng2a135ae2010-10-04 22:41:01 +00005828 DAG.ReplaceAllUsesOfValueWith(N1, SetCC, &DeadNodes);
5829 removeFromWorkList(N1.getNode());
5830 DAG.DeleteNode(N1.getNode());
Evan Cheng2c755ba2010-02-27 07:36:59 +00005831 return DAG.getNode(ISD::BRCOND, N->getDebugLoc(),
5832 MVT::Other, Chain, SetCC, N2);
5833 }
5834 }
Bill Wendlinga02a3dd2009-03-26 06:14:09 +00005835
Dan Gohman475871a2008-07-27 21:46:04 +00005836 return SDValue();
Nate Begeman44728a72005-09-19 22:34:01 +00005837}
5838
Chris Lattner3ea0b472005-10-05 06:47:48 +00005839// Operand List for BR_CC: Chain, CondCC, CondLHS, CondRHS, DestBB.
5840//
Dan Gohman475871a2008-07-27 21:46:04 +00005841SDValue DAGCombiner::visitBR_CC(SDNode *N) {
Chris Lattner3ea0b472005-10-05 06:47:48 +00005842 CondCodeSDNode *CC = cast<CondCodeSDNode>(N->getOperand(1));
Dan Gohman475871a2008-07-27 21:46:04 +00005843 SDValue CondLHS = N->getOperand(2), CondRHS = N->getOperand(3);
Scott Michelfdc40a02009-02-17 22:15:04 +00005844
Dan Gohmane0f06c72009-11-17 00:47:23 +00005845 // If N is a constant we could fold this into a fallthrough or unconditional
5846 // branch. However that doesn't happen very often in normal code, because
5847 // Instcombine/SimplifyCFG should have handled the available opportunities.
5848 // If we did this folding here, it would be necessary to update the
5849 // MachineBasicBlock CFG, which is awkward.
5850
Duncan Sands8eab8a22008-06-09 11:32:28 +00005851 // Use SimplifySetCC to simplify SETCC's.
Duncan Sands5480c042009-01-01 15:52:00 +00005852 SDValue Simp = SimplifySetCC(TLI.getSetCCResultType(CondLHS.getValueType()),
Dale Johannesenff97d4f2009-02-03 00:47:48 +00005853 CondLHS, CondRHS, CC->get(), N->getDebugLoc(),
5854 false);
Gabor Greifba36cb52008-08-28 21:40:38 +00005855 if (Simp.getNode()) AddToWorkList(Simp.getNode());
Chris Lattner30f73e72006-10-14 03:52:46 +00005856
Nate Begemane17daeb2005-10-05 21:43:42 +00005857 // fold to a simpler setcc
Gabor Greifba36cb52008-08-28 21:40:38 +00005858 if (Simp.getNode() && Simp.getOpcode() == ISD::SETCC)
Owen Anderson825b72b2009-08-11 20:47:22 +00005859 return DAG.getNode(ISD::BR_CC, N->getDebugLoc(), MVT::Other,
Bill Wendlingc0debad2009-01-30 23:27:35 +00005860 N->getOperand(0), Simp.getOperand(2),
5861 Simp.getOperand(0), Simp.getOperand(1),
5862 N->getOperand(4));
5863
Dan Gohman475871a2008-07-27 21:46:04 +00005864 return SDValue();
Nate Begeman44728a72005-09-19 22:34:01 +00005865}
5866
Duncan Sandsec87aa82008-06-15 20:12:31 +00005867/// CombineToPreIndexedLoadStore - Try turning a load / store into a
5868/// pre-indexed load / store when the base pointer is an add or subtract
Chris Lattner448f2192006-11-11 00:39:41 +00005869/// and it has other uses besides the load / store. After the
5870/// transformation, the new indexed load / store has effectively folded
5871/// the add / subtract in and all of its other uses are redirected to the
5872/// new load / store.
5873bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) {
Duncan Sands25cf2272008-11-24 14:53:14 +00005874 if (!LegalOperations)
Chris Lattner448f2192006-11-11 00:39:41 +00005875 return false;
5876
5877 bool isLoad = true;
Dan Gohman475871a2008-07-27 21:46:04 +00005878 SDValue Ptr;
Owen Andersone50ed302009-08-10 22:56:29 +00005879 EVT VT;
Chris Lattner448f2192006-11-11 00:39:41 +00005880 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
Chris Lattnerddf89562008-01-17 19:59:44 +00005881 if (LD->isIndexed())
Evan Chenge90460e2006-12-16 06:25:23 +00005882 return false;
Dan Gohmanb625f2f2008-01-30 00:15:11 +00005883 VT = LD->getMemoryVT();
Evan Cheng83060c52007-03-07 08:07:03 +00005884 if (!TLI.isIndexedLoadLegal(ISD::PRE_INC, VT) &&
Chris Lattner448f2192006-11-11 00:39:41 +00005885 !TLI.isIndexedLoadLegal(ISD::PRE_DEC, VT))
5886 return false;
5887 Ptr = LD->getBasePtr();
5888 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
Chris Lattnerddf89562008-01-17 19:59:44 +00005889 if (ST->isIndexed())
Evan Chenge90460e2006-12-16 06:25:23 +00005890 return false;
Dan Gohmanb625f2f2008-01-30 00:15:11 +00005891 VT = ST->getMemoryVT();
Chris Lattner448f2192006-11-11 00:39:41 +00005892 if (!TLI.isIndexedStoreLegal(ISD::PRE_INC, VT) &&
5893 !TLI.isIndexedStoreLegal(ISD::PRE_DEC, VT))
5894 return false;
5895 Ptr = ST->getBasePtr();
5896 isLoad = false;
Bill Wendlingc0debad2009-01-30 23:27:35 +00005897 } else {
Chris Lattner448f2192006-11-11 00:39:41 +00005898 return false;
Bill Wendlingc0debad2009-01-30 23:27:35 +00005899 }
Chris Lattner448f2192006-11-11 00:39:41 +00005900
Chris Lattner9f1794e2006-11-11 00:56:29 +00005901 // If the pointer is not an add/sub, or if it doesn't have multiple uses, bail
5902 // out. There is no reason to make this a preinc/predec.
5903 if ((Ptr.getOpcode() != ISD::ADD && Ptr.getOpcode() != ISD::SUB) ||
Gabor Greifba36cb52008-08-28 21:40:38 +00005904 Ptr.getNode()->hasOneUse())
Chris Lattner9f1794e2006-11-11 00:56:29 +00005905 return false;
Chris Lattner448f2192006-11-11 00:39:41 +00005906
Chris Lattner9f1794e2006-11-11 00:56:29 +00005907 // Ask the target to do addressing mode selection.
Dan Gohman475871a2008-07-27 21:46:04 +00005908 SDValue BasePtr;
5909 SDValue Offset;
Chris Lattner9f1794e2006-11-11 00:56:29 +00005910 ISD::MemIndexedMode AM = ISD::UNINDEXED;
5911 if (!TLI.getPreIndexedAddressParts(N, BasePtr, Offset, AM, DAG))
5912 return false;
Evan Chenga7d4a042007-05-03 23:52:19 +00005913 // Don't create a indexed load / store with zero offset.
5914 if (isa<ConstantSDNode>(Offset) &&
Dan Gohman002e5d02008-03-13 22:13:53 +00005915 cast<ConstantSDNode>(Offset)->isNullValue())
Evan Chenga7d4a042007-05-03 23:52:19 +00005916 return false;
Scott Michelfdc40a02009-02-17 22:15:04 +00005917
Chris Lattner41e53fd2006-11-11 01:00:15 +00005918 // Try turning it into a pre-indexed load / store except when:
Evan Chengc843abe2007-05-24 02:35:39 +00005919 // 1) The new base ptr is a frame index.
5920 // 2) If N is a store and the new base ptr is either the same as or is a
Chris Lattner9f1794e2006-11-11 00:56:29 +00005921 // predecessor of the value being stored.
Evan Chengc843abe2007-05-24 02:35:39 +00005922 // 3) Another use of old base ptr is a predecessor of N. If ptr is folded
Chris Lattner9f1794e2006-11-11 00:56:29 +00005923 // that would create a cycle.
Evan Chengc843abe2007-05-24 02:35:39 +00005924 // 4) All uses are load / store ops that use it as old base ptr.
Chris Lattner448f2192006-11-11 00:39:41 +00005925
Chris Lattner41e53fd2006-11-11 01:00:15 +00005926 // Check #1. Preinc'ing a frame index would require copying the stack pointer
5927 // (plus the implicit offset) to a register to preinc anyway.
Evan Chengcaab1292009-05-06 18:25:01 +00005928 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr))
Chris Lattner41e53fd2006-11-11 01:00:15 +00005929 return false;
Scott Michelfdc40a02009-02-17 22:15:04 +00005930
Chris Lattner41e53fd2006-11-11 01:00:15 +00005931 // Check #2.
Chris Lattner9f1794e2006-11-11 00:56:29 +00005932 if (!isLoad) {
Dan Gohman475871a2008-07-27 21:46:04 +00005933 SDValue Val = cast<StoreSDNode>(N)->getValue();
Gabor Greifba36cb52008-08-28 21:40:38 +00005934 if (Val == BasePtr || BasePtr.getNode()->isPredecessorOf(Val.getNode()))
Chris Lattner9f1794e2006-11-11 00:56:29 +00005935 return false;
Chris Lattner448f2192006-11-11 00:39:41 +00005936 }
Chris Lattner9f1794e2006-11-11 00:56:29 +00005937
Evan Chengc843abe2007-05-24 02:35:39 +00005938 // Now check for #3 and #4.
Chris Lattner9f1794e2006-11-11 00:56:29 +00005939 bool RealUse = false;
Lang Hames944520f2011-07-07 04:31:51 +00005940
5941 // Caches for hasPredecessorHelper
5942 SmallPtrSet<const SDNode *, 32> Visited;
5943 SmallVector<const SDNode *, 16> Worklist;
5944
Gabor Greifba36cb52008-08-28 21:40:38 +00005945 for (SDNode::use_iterator I = Ptr.getNode()->use_begin(),
5946 E = Ptr.getNode()->use_end(); I != E; ++I) {
Dan Gohman89684502008-07-27 20:43:25 +00005947 SDNode *Use = *I;
Chris Lattner9f1794e2006-11-11 00:56:29 +00005948 if (Use == N)
5949 continue;
Lang Hames944520f2011-07-07 04:31:51 +00005950 if (N->hasPredecessorHelper(Use, Visited, Worklist))
Chris Lattner9f1794e2006-11-11 00:56:29 +00005951 return false;
5952
5953 if (!((Use->getOpcode() == ISD::LOAD &&
5954 cast<LoadSDNode>(Use)->getBasePtr() == Ptr) ||
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00005955 (Use->getOpcode() == ISD::STORE &&
5956 cast<StoreSDNode>(Use)->getBasePtr() == Ptr)))
Chris Lattner9f1794e2006-11-11 00:56:29 +00005957 RealUse = true;
5958 }
Bill Wendlingc0debad2009-01-30 23:27:35 +00005959
Chris Lattner9f1794e2006-11-11 00:56:29 +00005960 if (!RealUse)
5961 return false;
5962
Dan Gohman475871a2008-07-27 21:46:04 +00005963 SDValue Result;
Chris Lattner9f1794e2006-11-11 00:56:29 +00005964 if (isLoad)
Bill Wendlingc0debad2009-01-30 23:27:35 +00005965 Result = DAG.getIndexedLoad(SDValue(N,0), N->getDebugLoc(),
5966 BasePtr, Offset, AM);
Chris Lattner9f1794e2006-11-11 00:56:29 +00005967 else
Bill Wendlingc0debad2009-01-30 23:27:35 +00005968 Result = DAG.getIndexedStore(SDValue(N,0), N->getDebugLoc(),
5969 BasePtr, Offset, AM);
Chris Lattner9f1794e2006-11-11 00:56:29 +00005970 ++PreIndexedNodes;
5971 ++NodesCombined;
David Greenef1090292010-01-05 01:25:00 +00005972 DEBUG(dbgs() << "\nReplacing.4 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00005973 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00005974 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00005975 Result.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00005976 dbgs() << '\n');
Chris Lattnerf8dc0612008-02-03 06:49:24 +00005977 WorkListRemover DeadNodes(*this);
Chris Lattner9f1794e2006-11-11 00:56:29 +00005978 if (isLoad) {
Dan Gohman475871a2008-07-27 21:46:04 +00005979 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00005980 &DeadNodes);
Dan Gohman475871a2008-07-27 21:46:04 +00005981 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00005982 &DeadNodes);
Chris Lattner9f1794e2006-11-11 00:56:29 +00005983 } else {
Dan Gohman475871a2008-07-27 21:46:04 +00005984 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00005985 &DeadNodes);
Chris Lattner9f1794e2006-11-11 00:56:29 +00005986 }
5987
Chris Lattner9f1794e2006-11-11 00:56:29 +00005988 // Finally, since the node is now dead, remove it from the graph.
5989 DAG.DeleteNode(N);
5990
5991 // Replace the uses of Ptr with uses of the updated base value.
5992 DAG.ReplaceAllUsesOfValueWith(Ptr, Result.getValue(isLoad ? 1 : 0),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00005993 &DeadNodes);
Gabor Greifba36cb52008-08-28 21:40:38 +00005994 removeFromWorkList(Ptr.getNode());
5995 DAG.DeleteNode(Ptr.getNode());
Chris Lattner9f1794e2006-11-11 00:56:29 +00005996
5997 return true;
Chris Lattner448f2192006-11-11 00:39:41 +00005998}
5999
Duncan Sandsec87aa82008-06-15 20:12:31 +00006000/// CombineToPostIndexedLoadStore - Try to combine a load / store with a
Chris Lattner448f2192006-11-11 00:39:41 +00006001/// add / sub of the base pointer node into a post-indexed load / store.
6002/// The transformation folded the add / subtract into the new indexed
6003/// load / store effectively and all of its uses are redirected to the
6004/// new load / store.
6005bool DAGCombiner::CombineToPostIndexedLoadStore(SDNode *N) {
Duncan Sands25cf2272008-11-24 14:53:14 +00006006 if (!LegalOperations)
Chris Lattner448f2192006-11-11 00:39:41 +00006007 return false;
6008
6009 bool isLoad = true;
Dan Gohman475871a2008-07-27 21:46:04 +00006010 SDValue Ptr;
Owen Andersone50ed302009-08-10 22:56:29 +00006011 EVT VT;
Chris Lattner448f2192006-11-11 00:39:41 +00006012 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
Chris Lattnerddf89562008-01-17 19:59:44 +00006013 if (LD->isIndexed())
Evan Chenge90460e2006-12-16 06:25:23 +00006014 return false;
Dan Gohmanb625f2f2008-01-30 00:15:11 +00006015 VT = LD->getMemoryVT();
Chris Lattner448f2192006-11-11 00:39:41 +00006016 if (!TLI.isIndexedLoadLegal(ISD::POST_INC, VT) &&
6017 !TLI.isIndexedLoadLegal(ISD::POST_DEC, VT))
6018 return false;
6019 Ptr = LD->getBasePtr();
6020 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
Chris Lattnerddf89562008-01-17 19:59:44 +00006021 if (ST->isIndexed())
Evan Chenge90460e2006-12-16 06:25:23 +00006022 return false;
Dan Gohmanb625f2f2008-01-30 00:15:11 +00006023 VT = ST->getMemoryVT();
Chris Lattner448f2192006-11-11 00:39:41 +00006024 if (!TLI.isIndexedStoreLegal(ISD::POST_INC, VT) &&
6025 !TLI.isIndexedStoreLegal(ISD::POST_DEC, VT))
6026 return false;
6027 Ptr = ST->getBasePtr();
6028 isLoad = false;
Bill Wendlingc0debad2009-01-30 23:27:35 +00006029 } else {
Chris Lattner448f2192006-11-11 00:39:41 +00006030 return false;
Bill Wendlingc0debad2009-01-30 23:27:35 +00006031 }
Chris Lattner448f2192006-11-11 00:39:41 +00006032
Gabor Greifba36cb52008-08-28 21:40:38 +00006033 if (Ptr.getNode()->hasOneUse())
Chris Lattner9f1794e2006-11-11 00:56:29 +00006034 return false;
Scott Michelfdc40a02009-02-17 22:15:04 +00006035
Gabor Greifba36cb52008-08-28 21:40:38 +00006036 for (SDNode::use_iterator I = Ptr.getNode()->use_begin(),
6037 E = Ptr.getNode()->use_end(); I != E; ++I) {
Dan Gohman89684502008-07-27 20:43:25 +00006038 SDNode *Op = *I;
Chris Lattner9f1794e2006-11-11 00:56:29 +00006039 if (Op == N ||
6040 (Op->getOpcode() != ISD::ADD && Op->getOpcode() != ISD::SUB))
6041 continue;
6042
Dan Gohman475871a2008-07-27 21:46:04 +00006043 SDValue BasePtr;
6044 SDValue Offset;
Chris Lattner9f1794e2006-11-11 00:56:29 +00006045 ISD::MemIndexedMode AM = ISD::UNINDEXED;
6046 if (TLI.getPostIndexedAddressParts(N, Op, BasePtr, Offset, AM, DAG)) {
Evan Chenga7d4a042007-05-03 23:52:19 +00006047 // Don't create a indexed load / store with zero offset.
6048 if (isa<ConstantSDNode>(Offset) &&
Dan Gohman002e5d02008-03-13 22:13:53 +00006049 cast<ConstantSDNode>(Offset)->isNullValue())
Evan Chenga7d4a042007-05-03 23:52:19 +00006050 continue;
Chris Lattner448f2192006-11-11 00:39:41 +00006051
Chris Lattner9f1794e2006-11-11 00:56:29 +00006052 // Try turning it into a post-indexed load / store except when
6053 // 1) All uses are load / store ops that use it as base ptr.
6054 // 2) Op must be independent of N, i.e. Op is neither a predecessor
6055 // nor a successor of N. Otherwise, if Op is folded that would
6056 // create a cycle.
6057
Evan Chengcaab1292009-05-06 18:25:01 +00006058 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr))
6059 continue;
6060
Chris Lattner9f1794e2006-11-11 00:56:29 +00006061 // Check for #1.
6062 bool TryNext = false;
Gabor Greifba36cb52008-08-28 21:40:38 +00006063 for (SDNode::use_iterator II = BasePtr.getNode()->use_begin(),
6064 EE = BasePtr.getNode()->use_end(); II != EE; ++II) {
Dan Gohman89684502008-07-27 20:43:25 +00006065 SDNode *Use = *II;
Gabor Greifba36cb52008-08-28 21:40:38 +00006066 if (Use == Ptr.getNode())
Chris Lattner448f2192006-11-11 00:39:41 +00006067 continue;
6068
Chris Lattner9f1794e2006-11-11 00:56:29 +00006069 // If all the uses are load / store addresses, then don't do the
6070 // transformation.
6071 if (Use->getOpcode() == ISD::ADD || Use->getOpcode() == ISD::SUB){
6072 bool RealUse = false;
6073 for (SDNode::use_iterator III = Use->use_begin(),
6074 EEE = Use->use_end(); III != EEE; ++III) {
Dan Gohman89684502008-07-27 20:43:25 +00006075 SDNode *UseUse = *III;
Chris Lattner9f1794e2006-11-11 00:56:29 +00006076 if (!((UseUse->getOpcode() == ISD::LOAD &&
Gabor Greifba36cb52008-08-28 21:40:38 +00006077 cast<LoadSDNode>(UseUse)->getBasePtr().getNode() == Use) ||
Anton Korobeynikov4c71dfe2008-02-20 11:10:28 +00006078 (UseUse->getOpcode() == ISD::STORE &&
Gabor Greifba36cb52008-08-28 21:40:38 +00006079 cast<StoreSDNode>(UseUse)->getBasePtr().getNode() == Use)))
Chris Lattner9f1794e2006-11-11 00:56:29 +00006080 RealUse = true;
6081 }
Chris Lattner448f2192006-11-11 00:39:41 +00006082
Chris Lattner9f1794e2006-11-11 00:56:29 +00006083 if (!RealUse) {
6084 TryNext = true;
6085 break;
Chris Lattner448f2192006-11-11 00:39:41 +00006086 }
6087 }
Chris Lattner9f1794e2006-11-11 00:56:29 +00006088 }
Bill Wendlingc0debad2009-01-30 23:27:35 +00006089
Chris Lattner9f1794e2006-11-11 00:56:29 +00006090 if (TryNext)
6091 continue;
Chris Lattner448f2192006-11-11 00:39:41 +00006092
Chris Lattner9f1794e2006-11-11 00:56:29 +00006093 // Check for #2
Evan Cheng917be682008-03-04 00:41:45 +00006094 if (!Op->isPredecessorOf(N) && !N->isPredecessorOf(Op)) {
Dan Gohman475871a2008-07-27 21:46:04 +00006095 SDValue Result = isLoad
Bill Wendlingc0debad2009-01-30 23:27:35 +00006096 ? DAG.getIndexedLoad(SDValue(N,0), N->getDebugLoc(),
6097 BasePtr, Offset, AM)
6098 : DAG.getIndexedStore(SDValue(N,0), N->getDebugLoc(),
6099 BasePtr, Offset, AM);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006100 ++PostIndexedNodes;
6101 ++NodesCombined;
David Greenef1090292010-01-05 01:25:00 +00006102 DEBUG(dbgs() << "\nReplacing.5 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006103 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006104 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006105 Result.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006106 dbgs() << '\n');
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006107 WorkListRemover DeadNodes(*this);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006108 if (isLoad) {
Dan Gohman475871a2008-07-27 21:46:04 +00006109 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006110 &DeadNodes);
Dan Gohman475871a2008-07-27 21:46:04 +00006111 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006112 &DeadNodes);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006113 } else {
Dan Gohman475871a2008-07-27 21:46:04 +00006114 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006115 &DeadNodes);
Chris Lattner448f2192006-11-11 00:39:41 +00006116 }
Chris Lattner9f1794e2006-11-11 00:56:29 +00006117
Chris Lattner9f1794e2006-11-11 00:56:29 +00006118 // Finally, since the node is now dead, remove it from the graph.
6119 DAG.DeleteNode(N);
6120
6121 // Replace the uses of Use with uses of the updated base value.
Dan Gohman475871a2008-07-27 21:46:04 +00006122 DAG.ReplaceAllUsesOfValueWith(SDValue(Op, 0),
Chris Lattner9f1794e2006-11-11 00:56:29 +00006123 Result.getValue(isLoad ? 1 : 0),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006124 &DeadNodes);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006125 removeFromWorkList(Op);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006126 DAG.DeleteNode(Op);
Chris Lattner9f1794e2006-11-11 00:56:29 +00006127 return true;
Chris Lattner448f2192006-11-11 00:39:41 +00006128 }
6129 }
6130 }
Bill Wendlingc0debad2009-01-30 23:27:35 +00006131
Chris Lattner448f2192006-11-11 00:39:41 +00006132 return false;
6133}
6134
Dan Gohman475871a2008-07-27 21:46:04 +00006135SDValue DAGCombiner::visitLOAD(SDNode *N) {
Evan Cheng466685d2006-10-09 20:57:25 +00006136 LoadSDNode *LD = cast<LoadSDNode>(N);
Dan Gohman475871a2008-07-27 21:46:04 +00006137 SDValue Chain = LD->getChain();
6138 SDValue Ptr = LD->getBasePtr();
Scott Michelfdc40a02009-02-17 22:15:04 +00006139
Evan Cheng45a7ca92007-05-01 00:38:21 +00006140 // If load is not volatile and there are no uses of the loaded value (and
6141 // the updated indexed value in case of indexed loads), change uses of the
6142 // chain value into uses of the chain input (i.e. delete the dead load).
6143 if (!LD->isVolatile()) {
Owen Anderson825b72b2009-08-11 20:47:22 +00006144 if (N->getValueType(1) == MVT::Other) {
Evan Cheng498f5592007-05-01 08:53:39 +00006145 // Unindexed loads.
Evan Cheng02c42852008-01-16 23:11:54 +00006146 if (N->hasNUsesOfValue(0, 0)) {
6147 // It's not safe to use the two value CombineTo variant here. e.g.
6148 // v1, chain2 = load chain1, loc
6149 // v2, chain3 = load chain2, loc
6150 // v3 = add v2, c
Chris Lattner125991a2008-01-24 07:57:06 +00006151 // Now we replace use of chain2 with chain1. This makes the second load
6152 // isomorphic to the one we are deleting, and thus makes this load live.
David Greenef1090292010-01-05 01:25:00 +00006153 DEBUG(dbgs() << "\nReplacing.6 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006154 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006155 dbgs() << "\nWith chain: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006156 Chain.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006157 dbgs() << "\n");
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006158 WorkListRemover DeadNodes(*this);
Dan Gohman475871a2008-07-27 21:46:04 +00006159 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain, &DeadNodes);
Bill Wendlingc0debad2009-01-30 23:27:35 +00006160
Chris Lattner125991a2008-01-24 07:57:06 +00006161 if (N->use_empty()) {
6162 removeFromWorkList(N);
6163 DAG.DeleteNode(N);
6164 }
Bill Wendlingc0debad2009-01-30 23:27:35 +00006165
Dan Gohman475871a2008-07-27 21:46:04 +00006166 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng02c42852008-01-16 23:11:54 +00006167 }
Evan Cheng498f5592007-05-01 08:53:39 +00006168 } else {
6169 // Indexed loads.
Owen Anderson825b72b2009-08-11 20:47:22 +00006170 assert(N->getValueType(2) == MVT::Other && "Malformed indexed loads?");
Evan Cheng498f5592007-05-01 08:53:39 +00006171 if (N->hasNUsesOfValue(0, 0) && N->hasNUsesOfValue(0, 1)) {
Dale Johannesene8d72302009-02-06 23:05:02 +00006172 SDValue Undef = DAG.getUNDEF(N->getValueType(0));
Evan Cheng2c755ba2010-02-27 07:36:59 +00006173 DEBUG(dbgs() << "\nReplacing.7 ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006174 N->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006175 dbgs() << "\nWith: ";
Chris Lattnerbbbfa992009-08-23 06:35:02 +00006176 Undef.getNode()->dump(&DAG);
David Greenef1090292010-01-05 01:25:00 +00006177 dbgs() << " and 2 other values\n");
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006178 WorkListRemover DeadNodes(*this);
Dan Gohman475871a2008-07-27 21:46:04 +00006179 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Undef, &DeadNodes);
6180 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1),
Dale Johannesene8d72302009-02-06 23:05:02 +00006181 DAG.getUNDEF(N->getValueType(1)),
Chris Lattnerf8dc0612008-02-03 06:49:24 +00006182 &DeadNodes);
Dan Gohman475871a2008-07-27 21:46:04 +00006183 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 2), Chain, &DeadNodes);
Evan Cheng02c42852008-01-16 23:11:54 +00006184 removeFromWorkList(N);
Evan Cheng02c42852008-01-16 23:11:54 +00006185 DAG.DeleteNode(N);
Dan Gohman475871a2008-07-27 21:46:04 +00006186 return SDValue(N, 0); // Return N so it doesn't get rechecked!
Evan Cheng45a7ca92007-05-01 00:38:21 +00006187 }
Evan Cheng45a7ca92007-05-01 00:38:21 +00006188 }
6189 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006190
Chris Lattner01a22022005-10-10 22:04:48 +00006191 // If this load is directly stored, replace the load value with the stored
6192 // value.
6193 // TODO: Handle store large -> read small portion.
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006194 // TODO: Handle TRUNCSTORE/LOADEXT
Evan Cheng9ef82ce2011-03-11 00:48:56 +00006195 if (ISD::isNormalLoad(N) && !LD->isVolatile()) {
Gabor Greifba36cb52008-08-28 21:40:38 +00006196 if (ISD::isNON_TRUNCStore(Chain.getNode())) {
Evan Cheng8b2794a2006-10-13 21:14:26 +00006197 StoreSDNode *PrevST = cast<StoreSDNode>(Chain);
6198 if (PrevST->getBasePtr() == Ptr &&
6199 PrevST->getValue().getValueType() == N->getValueType(0))
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006200 return CombineTo(N, Chain.getOperand(1), Chain);
Evan Cheng8b2794a2006-10-13 21:14:26 +00006201 }
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006202 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006203
Evan Cheng255f20f2010-04-01 06:04:33 +00006204 // Try to infer better alignment information than the load already has.
6205 if (OptLevel != CodeGenOpt::None && LD->isUnindexed()) {
6206 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) {
6207 if (Align > LD->getAlignment())
Stuart Hastingsa9011292011-02-16 16:23:55 +00006208 return DAG.getExtLoad(LD->getExtensionType(), N->getDebugLoc(),
6209 LD->getValueType(0),
Chris Lattner3d6ccfb2010-09-21 17:04:51 +00006210 Chain, Ptr, LD->getPointerInfo(),
6211 LD->getMemoryVT(),
Evan Cheng255f20f2010-04-01 06:04:33 +00006212 LD->isVolatile(), LD->isNonTemporal(), Align);
6213 }
6214 }
6215
Jim Laskey7ca56af2006-10-11 13:47:09 +00006216 if (CombinerAA) {
Jim Laskey279f0532006-09-25 16:29:54 +00006217 // Walk up chain skipping non-aliasing memory nodes.
Dan Gohman475871a2008-07-27 21:46:04 +00006218 SDValue BetterChain = FindBetterChain(N, Chain);
Scott Michelfdc40a02009-02-17 22:15:04 +00006219
Jim Laskey6ff23e52006-10-04 16:53:27 +00006220 // If there is a better chain.
Jim Laskey279f0532006-09-25 16:29:54 +00006221 if (Chain != BetterChain) {
Dan Gohman475871a2008-07-27 21:46:04 +00006222 SDValue ReplLoad;
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006223
Jim Laskey279f0532006-09-25 16:29:54 +00006224 // Replace the chain to void dependency.
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006225 if (LD->getExtensionType() == ISD::NON_EXTLOAD) {
Bill Wendlingc0debad2009-01-30 23:27:35 +00006226 ReplLoad = DAG.getLoad(N->getValueType(0), LD->getDebugLoc(),
Chris Lattnerfa459012010-09-21 16:08:50 +00006227 BetterChain, Ptr, LD->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00006228 LD->isVolatile(), LD->isNonTemporal(),
6229 LD->getAlignment());
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006230 } else {
Stuart Hastingsa9011292011-02-16 16:23:55 +00006231 ReplLoad = DAG.getExtLoad(LD->getExtensionType(), LD->getDebugLoc(),
6232 LD->getValueType(0),
Chris Lattnerfa459012010-09-21 16:08:50 +00006233 BetterChain, Ptr, LD->getPointerInfo(),
Dan Gohmanb625f2f2008-01-30 00:15:11 +00006234 LD->getMemoryVT(),
Scott Michelfdc40a02009-02-17 22:15:04 +00006235 LD->isVolatile(),
David Greene1e559442010-02-15 17:00:31 +00006236 LD->isNonTemporal(),
Christopher Lamb95c218a2007-04-22 23:15:30 +00006237 LD->getAlignment());
Jim Laskeyc2b19f32006-10-11 17:47:52 +00006238 }
Jim Laskey279f0532006-09-25 16:29:54 +00006239
Jim Laskey6ff23e52006-10-04 16:53:27 +00006240 // Create token factor to keep old chain connected.
Bill Wendlingc0debad2009-01-30 23:27:35 +00006241 SDValue Token = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(),
Owen Anderson825b72b2009-08-11 20:47:22 +00006242 MVT::Other, Chain, ReplLoad.getValue(1));
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006243
Nate Begemanb6aef5c2009-09-15 00:18:30 +00006244 // Make sure the new and old chains are cleaned up.
6245 AddToWorkList(Token.getNode());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006246
Jim Laskey274062c2006-10-13 23:32:28 +00006247 // Replace uses with load result and token factor. Don't add users
6248 // to work list.
6249 return CombineTo(N, ReplLoad.getValue(0), Token, false);
Jim Laskey279f0532006-09-25 16:29:54 +00006250 }
6251 }
6252
Evan Cheng7fc033a2006-11-03 03:06:21 +00006253 // Try transforming N to an indexed load.
Evan Chengbbd6f6e2006-11-07 09:03:05 +00006254 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
Dan Gohman475871a2008-07-27 21:46:04 +00006255 return SDValue(N, 0);
Evan Cheng7fc033a2006-11-03 03:06:21 +00006256
Dan Gohman475871a2008-07-27 21:46:04 +00006257 return SDValue();
Chris Lattner01a22022005-10-10 22:04:48 +00006258}
6259
Chris Lattner2392ae72010-04-15 04:48:01 +00006260/// CheckForMaskedLoad - Check to see if V is (and load (ptr), imm), where the
6261/// load is having specific bytes cleared out. If so, return the byte size
6262/// being masked out and the shift amount.
6263static std::pair<unsigned, unsigned>
6264CheckForMaskedLoad(SDValue V, SDValue Ptr, SDValue Chain) {
6265 std::pair<unsigned, unsigned> Result(0, 0);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006266
Chris Lattner2392ae72010-04-15 04:48:01 +00006267 // Check for the structure we're looking for.
6268 if (V->getOpcode() != ISD::AND ||
6269 !isa<ConstantSDNode>(V->getOperand(1)) ||
6270 !ISD::isNormalLoad(V->getOperand(0).getNode()))
6271 return Result;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006272
Chris Lattnere6987582010-04-15 06:10:49 +00006273 // Check the chain and pointer.
Chris Lattner2392ae72010-04-15 04:48:01 +00006274 LoadSDNode *LD = cast<LoadSDNode>(V->getOperand(0));
Chris Lattnere6987582010-04-15 06:10:49 +00006275 if (LD->getBasePtr() != Ptr) return Result; // Not from same pointer.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006276
Chris Lattnere6987582010-04-15 06:10:49 +00006277 // The store should be chained directly to the load or be an operand of a
6278 // tokenfactor.
6279 if (LD == Chain.getNode())
6280 ; // ok.
6281 else if (Chain->getOpcode() != ISD::TokenFactor)
6282 return Result; // Fail.
6283 else {
6284 bool isOk = false;
6285 for (unsigned i = 0, e = Chain->getNumOperands(); i != e; ++i)
6286 if (Chain->getOperand(i).getNode() == LD) {
6287 isOk = true;
6288 break;
6289 }
6290 if (!isOk) return Result;
6291 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006292
Chris Lattner2392ae72010-04-15 04:48:01 +00006293 // This only handles simple types.
6294 if (V.getValueType() != MVT::i16 &&
6295 V.getValueType() != MVT::i32 &&
6296 V.getValueType() != MVT::i64)
6297 return Result;
6298
6299 // Check the constant mask. Invert it so that the bits being masked out are
6300 // 0 and the bits being kept are 1. Use getSExtValue so that leading bits
6301 // follow the sign bit for uniformity.
6302 uint64_t NotMask = ~cast<ConstantSDNode>(V->getOperand(1))->getSExtValue();
6303 unsigned NotMaskLZ = CountLeadingZeros_64(NotMask);
6304 if (NotMaskLZ & 7) return Result; // Must be multiple of a byte.
6305 unsigned NotMaskTZ = CountTrailingZeros_64(NotMask);
6306 if (NotMaskTZ & 7) return Result; // Must be multiple of a byte.
6307 if (NotMaskLZ == 64) return Result; // All zero mask.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006308
Chris Lattner2392ae72010-04-15 04:48:01 +00006309 // See if we have a continuous run of bits. If so, we have 0*1+0*
6310 if (CountTrailingOnes_64(NotMask >> NotMaskTZ)+NotMaskTZ+NotMaskLZ != 64)
6311 return Result;
6312
6313 // Adjust NotMaskLZ down to be from the actual size of the int instead of i64.
6314 if (V.getValueType() != MVT::i64 && NotMaskLZ)
6315 NotMaskLZ -= 64-V.getValueSizeInBits();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006316
Chris Lattner2392ae72010-04-15 04:48:01 +00006317 unsigned MaskedBytes = (V.getValueSizeInBits()-NotMaskLZ-NotMaskTZ)/8;
6318 switch (MaskedBytes) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006319 case 1:
6320 case 2:
Chris Lattner2392ae72010-04-15 04:48:01 +00006321 case 4: break;
6322 default: return Result; // All one mask, or 5-byte mask.
6323 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006324
Chris Lattner2392ae72010-04-15 04:48:01 +00006325 // Verify that the first bit starts at a multiple of mask so that the access
6326 // is aligned the same as the access width.
6327 if (NotMaskTZ && NotMaskTZ/8 % MaskedBytes) return Result;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006328
Chris Lattner2392ae72010-04-15 04:48:01 +00006329 Result.first = MaskedBytes;
6330 Result.second = NotMaskTZ/8;
6331 return Result;
6332}
6333
6334
6335/// ShrinkLoadReplaceStoreWithStore - Check to see if IVal is something that
6336/// provides a value as specified by MaskInfo. If so, replace the specified
6337/// store with a narrower store of truncated IVal.
6338static SDNode *
6339ShrinkLoadReplaceStoreWithStore(const std::pair<unsigned, unsigned> &MaskInfo,
6340 SDValue IVal, StoreSDNode *St,
6341 DAGCombiner *DC) {
6342 unsigned NumBytes = MaskInfo.first;
6343 unsigned ByteShift = MaskInfo.second;
6344 SelectionDAG &DAG = DC->getDAG();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006345
Chris Lattner2392ae72010-04-15 04:48:01 +00006346 // Check to see if IVal is all zeros in the part being masked in by the 'or'
6347 // that uses this. If not, this is not a replacement.
6348 APInt Mask = ~APInt::getBitsSet(IVal.getValueSizeInBits(),
6349 ByteShift*8, (ByteShift+NumBytes)*8);
6350 if (!DAG.MaskedValueIsZero(IVal, Mask)) return 0;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006351
Chris Lattner2392ae72010-04-15 04:48:01 +00006352 // Check that it is legal on the target to do this. It is legal if the new
6353 // VT we're shrinking to (i8/i16/i32) is legal or we're still before type
6354 // legalization.
6355 MVT VT = MVT::getIntegerVT(NumBytes*8);
6356 if (!DC->isTypeLegal(VT))
6357 return 0;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006358
Chris Lattner2392ae72010-04-15 04:48:01 +00006359 // Okay, we can do this! Replace the 'St' store with a store of IVal that is
6360 // shifted by ByteShift and truncated down to NumBytes.
6361 if (ByteShift)
6362 IVal = DAG.getNode(ISD::SRL, IVal->getDebugLoc(), IVal.getValueType(), IVal,
Owen Anderson95771af2011-02-25 21:41:48 +00006363 DAG.getConstant(ByteShift*8,
6364 DC->getShiftAmountTy(IVal.getValueType())));
Chris Lattner2392ae72010-04-15 04:48:01 +00006365
6366 // Figure out the offset for the store and the alignment of the access.
6367 unsigned StOffset;
6368 unsigned NewAlign = St->getAlignment();
6369
6370 if (DAG.getTargetLoweringInfo().isLittleEndian())
6371 StOffset = ByteShift;
6372 else
6373 StOffset = IVal.getValueType().getStoreSize() - ByteShift - NumBytes;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006374
Chris Lattner2392ae72010-04-15 04:48:01 +00006375 SDValue Ptr = St->getBasePtr();
6376 if (StOffset) {
6377 Ptr = DAG.getNode(ISD::ADD, IVal->getDebugLoc(), Ptr.getValueType(),
6378 Ptr, DAG.getConstant(StOffset, Ptr.getValueType()));
6379 NewAlign = MinAlign(NewAlign, StOffset);
6380 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006381
Chris Lattner2392ae72010-04-15 04:48:01 +00006382 // Truncate down to the new size.
6383 IVal = DAG.getNode(ISD::TRUNCATE, IVal->getDebugLoc(), VT, IVal);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006384
Chris Lattner2392ae72010-04-15 04:48:01 +00006385 ++OpsNarrowed;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006386 return DAG.getStore(St->getChain(), St->getDebugLoc(), IVal, Ptr,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006387 St->getPointerInfo().getWithOffset(StOffset),
Chris Lattner2392ae72010-04-15 04:48:01 +00006388 false, false, NewAlign).getNode();
6389}
6390
Evan Cheng8b944d32009-05-28 00:35:15 +00006391
6392/// ReduceLoadOpStoreWidth - Look for sequence of load / op / store where op is
6393/// one of 'or', 'xor', and 'and' of immediates. If 'op' is only touching some
6394/// of the loaded bits, try narrowing the load and store if it would end up
6395/// being a win for performance or code size.
6396SDValue DAGCombiner::ReduceLoadOpStoreWidth(SDNode *N) {
6397 StoreSDNode *ST = cast<StoreSDNode>(N);
Evan Chengcdcecc02009-05-28 18:41:02 +00006398 if (ST->isVolatile())
6399 return SDValue();
6400
Evan Cheng8b944d32009-05-28 00:35:15 +00006401 SDValue Chain = ST->getChain();
6402 SDValue Value = ST->getValue();
6403 SDValue Ptr = ST->getBasePtr();
Owen Andersone50ed302009-08-10 22:56:29 +00006404 EVT VT = Value.getValueType();
Evan Cheng8b944d32009-05-28 00:35:15 +00006405
6406 if (ST->isTruncatingStore() || VT.isVector() || !Value.hasOneUse())
Evan Chengcdcecc02009-05-28 18:41:02 +00006407 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006408
6409 unsigned Opc = Value.getOpcode();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006410
Chris Lattner2392ae72010-04-15 04:48:01 +00006411 // If this is "store (or X, Y), P" and X is "(and (load P), cst)", where cst
6412 // is a byte mask indicating a consecutive number of bytes, check to see if
6413 // Y is known to provide just those bytes. If so, we try to replace the
6414 // load + replace + store sequence with a single (narrower) store, which makes
6415 // the load dead.
6416 if (Opc == ISD::OR) {
6417 std::pair<unsigned, unsigned> MaskedLoad;
6418 MaskedLoad = CheckForMaskedLoad(Value.getOperand(0), Ptr, Chain);
6419 if (MaskedLoad.first)
6420 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad,
6421 Value.getOperand(1), ST,this))
6422 return SDValue(NewST, 0);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006423
Chris Lattner2392ae72010-04-15 04:48:01 +00006424 // Or is commutative, so try swapping X and Y.
6425 MaskedLoad = CheckForMaskedLoad(Value.getOperand(1), Ptr, Chain);
6426 if (MaskedLoad.first)
6427 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad,
6428 Value.getOperand(0), ST,this))
6429 return SDValue(NewST, 0);
6430 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006431
Evan Cheng8b944d32009-05-28 00:35:15 +00006432 if ((Opc != ISD::OR && Opc != ISD::XOR && Opc != ISD::AND) ||
6433 Value.getOperand(1).getOpcode() != ISD::Constant)
Evan Chengcdcecc02009-05-28 18:41:02 +00006434 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006435
6436 SDValue N0 = Value.getOperand(0);
Dan Gohman24bde5b2010-09-02 21:18:42 +00006437 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() &&
6438 Chain == SDValue(N0.getNode(), 1)) {
Evan Cheng8b944d32009-05-28 00:35:15 +00006439 LoadSDNode *LD = cast<LoadSDNode>(N0);
Chris Lattnerfa459012010-09-21 16:08:50 +00006440 if (LD->getBasePtr() != Ptr ||
6441 LD->getPointerInfo().getAddrSpace() !=
6442 ST->getPointerInfo().getAddrSpace())
Evan Chengcdcecc02009-05-28 18:41:02 +00006443 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006444
6445 // Find the type to narrow it the load / op / store to.
6446 SDValue N1 = Value.getOperand(1);
6447 unsigned BitWidth = N1.getValueSizeInBits();
6448 APInt Imm = cast<ConstantSDNode>(N1)->getAPIntValue();
6449 if (Opc == ISD::AND)
6450 Imm ^= APInt::getAllOnesValue(BitWidth);
Evan Chengd3c76bb2009-05-28 23:52:18 +00006451 if (Imm == 0 || Imm.isAllOnesValue())
6452 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006453 unsigned ShAmt = Imm.countTrailingZeros();
6454 unsigned MSB = BitWidth - Imm.countLeadingZeros() - 1;
6455 unsigned NewBW = NextPowerOf2(MSB - ShAmt);
Owen Anderson23b9b192009-08-12 00:36:31 +00006456 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW);
Evan Cheng8b944d32009-05-28 00:35:15 +00006457 while (NewBW < BitWidth &&
Evan Chengcdcecc02009-05-28 18:41:02 +00006458 !(TLI.isOperationLegalOrCustom(Opc, NewVT) &&
Evan Cheng8b944d32009-05-28 00:35:15 +00006459 TLI.isNarrowingProfitable(VT, NewVT))) {
6460 NewBW = NextPowerOf2(NewBW);
Owen Anderson23b9b192009-08-12 00:36:31 +00006461 NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW);
Evan Cheng8b944d32009-05-28 00:35:15 +00006462 }
Evan Chengcdcecc02009-05-28 18:41:02 +00006463 if (NewBW >= BitWidth)
6464 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006465
6466 // If the lsb changed does not start at the type bitwidth boundary,
6467 // start at the previous one.
6468 if (ShAmt % NewBW)
6469 ShAmt = (((ShAmt + NewBW - 1) / NewBW) * NewBW) - NewBW;
6470 APInt Mask = APInt::getBitsSet(BitWidth, ShAmt, ShAmt + NewBW);
6471 if ((Imm & Mask) == Imm) {
6472 APInt NewImm = (Imm & Mask).lshr(ShAmt).trunc(NewBW);
6473 if (Opc == ISD::AND)
6474 NewImm ^= APInt::getAllOnesValue(NewBW);
6475 uint64_t PtrOff = ShAmt / 8;
6476 // For big endian targets, we need to adjust the offset to the pointer to
6477 // load the correct bytes.
6478 if (TLI.isBigEndian())
Evan Chengcdcecc02009-05-28 18:41:02 +00006479 PtrOff = (BitWidth + 7 - NewBW) / 8 - PtrOff;
Evan Cheng8b944d32009-05-28 00:35:15 +00006480
6481 unsigned NewAlign = MinAlign(LD->getAlignment(), PtrOff);
Chris Lattnerdb125cf2011-07-18 04:54:35 +00006482 Type *NewVTTy = NewVT.getTypeForEVT(*DAG.getContext());
Chris Lattner2392ae72010-04-15 04:48:01 +00006483 if (NewAlign < TLI.getTargetData()->getABITypeAlignment(NewVTTy))
Evan Chengcdcecc02009-05-28 18:41:02 +00006484 return SDValue();
6485
Evan Cheng8b944d32009-05-28 00:35:15 +00006486 SDValue NewPtr = DAG.getNode(ISD::ADD, LD->getDebugLoc(),
6487 Ptr.getValueType(), Ptr,
6488 DAG.getConstant(PtrOff, Ptr.getValueType()));
6489 SDValue NewLD = DAG.getLoad(NewVT, N0.getDebugLoc(),
6490 LD->getChain(), NewPtr,
Chris Lattnerfa459012010-09-21 16:08:50 +00006491 LD->getPointerInfo().getWithOffset(PtrOff),
David Greene1e559442010-02-15 17:00:31 +00006492 LD->isVolatile(), LD->isNonTemporal(),
6493 NewAlign);
Evan Cheng8b944d32009-05-28 00:35:15 +00006494 SDValue NewVal = DAG.getNode(Opc, Value.getDebugLoc(), NewVT, NewLD,
6495 DAG.getConstant(NewImm, NewVT));
6496 SDValue NewST = DAG.getStore(Chain, N->getDebugLoc(),
6497 NewVal, NewPtr,
Chris Lattnerfa459012010-09-21 16:08:50 +00006498 ST->getPointerInfo().getWithOffset(PtrOff),
David Greene1e559442010-02-15 17:00:31 +00006499 false, false, NewAlign);
Evan Cheng8b944d32009-05-28 00:35:15 +00006500
6501 AddToWorkList(NewPtr.getNode());
6502 AddToWorkList(NewLD.getNode());
6503 AddToWorkList(NewVal.getNode());
6504 WorkListRemover DeadNodes(*this);
6505 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), NewLD.getValue(1),
6506 &DeadNodes);
6507 ++OpsNarrowed;
6508 return NewST;
6509 }
6510 }
6511
Evan Chengcdcecc02009-05-28 18:41:02 +00006512 return SDValue();
Evan Cheng8b944d32009-05-28 00:35:15 +00006513}
6514
Evan Cheng31959b12011-02-02 01:06:55 +00006515/// TransformFPLoadStorePair - For a given floating point load / store pair,
6516/// if the load value isn't used by any other operations, then consider
6517/// transforming the pair to integer load / store operations if the target
6518/// deems the transformation profitable.
6519SDValue DAGCombiner::TransformFPLoadStorePair(SDNode *N) {
6520 StoreSDNode *ST = cast<StoreSDNode>(N);
6521 SDValue Chain = ST->getChain();
6522 SDValue Value = ST->getValue();
6523 if (ISD::isNormalStore(ST) && ISD::isNormalLoad(Value.getNode()) &&
6524 Value.hasOneUse() &&
6525 Chain == SDValue(Value.getNode(), 1)) {
6526 LoadSDNode *LD = cast<LoadSDNode>(Value);
6527 EVT VT = LD->getMemoryVT();
6528 if (!VT.isFloatingPoint() ||
6529 VT != ST->getMemoryVT() ||
6530 LD->isNonTemporal() ||
6531 ST->isNonTemporal() ||
6532 LD->getPointerInfo().getAddrSpace() != 0 ||
6533 ST->getPointerInfo().getAddrSpace() != 0)
6534 return SDValue();
6535
6536 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits());
6537 if (!TLI.isOperationLegal(ISD::LOAD, IntVT) ||
6538 !TLI.isOperationLegal(ISD::STORE, IntVT) ||
6539 !TLI.isDesirableToTransformToIntegerOp(ISD::LOAD, VT) ||
6540 !TLI.isDesirableToTransformToIntegerOp(ISD::STORE, VT))
6541 return SDValue();
6542
6543 unsigned LDAlign = LD->getAlignment();
6544 unsigned STAlign = ST->getAlignment();
Chris Lattnerdb125cf2011-07-18 04:54:35 +00006545 Type *IntVTTy = IntVT.getTypeForEVT(*DAG.getContext());
Evan Cheng31959b12011-02-02 01:06:55 +00006546 unsigned ABIAlign = TLI.getTargetData()->getABITypeAlignment(IntVTTy);
6547 if (LDAlign < ABIAlign || STAlign < ABIAlign)
6548 return SDValue();
6549
6550 SDValue NewLD = DAG.getLoad(IntVT, Value.getDebugLoc(),
6551 LD->getChain(), LD->getBasePtr(),
6552 LD->getPointerInfo(),
6553 false, false, LDAlign);
6554
6555 SDValue NewST = DAG.getStore(NewLD.getValue(1), N->getDebugLoc(),
6556 NewLD, ST->getBasePtr(),
6557 ST->getPointerInfo(),
6558 false, false, STAlign);
6559
6560 AddToWorkList(NewLD.getNode());
6561 AddToWorkList(NewST.getNode());
6562 WorkListRemover DeadNodes(*this);
6563 DAG.ReplaceAllUsesOfValueWith(Value.getValue(1), NewLD.getValue(1),
6564 &DeadNodes);
6565 ++LdStFP2Int;
6566 return NewST;
6567 }
6568
6569 return SDValue();
6570}
6571
Dan Gohman475871a2008-07-27 21:46:04 +00006572SDValue DAGCombiner::visitSTORE(SDNode *N) {
Evan Cheng8b2794a2006-10-13 21:14:26 +00006573 StoreSDNode *ST = cast<StoreSDNode>(N);
Dan Gohman475871a2008-07-27 21:46:04 +00006574 SDValue Chain = ST->getChain();
6575 SDValue Value = ST->getValue();
6576 SDValue Ptr = ST->getBasePtr();
Scott Michelfdc40a02009-02-17 22:15:04 +00006577
Evan Cheng59d5b682007-05-07 21:27:48 +00006578 // If this is a store of a bit convert, store the input value if the
Evan Cheng2c4f9432007-05-09 21:49:47 +00006579 // resultant store does not need a higher alignment than the original.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006580 if (Value.getOpcode() == ISD::BITCAST && !ST->isTruncatingStore() &&
Chris Lattnerddf89562008-01-17 19:59:44 +00006581 ST->isUnindexed()) {
Dan Gohman1ba519b2009-02-20 23:29:13 +00006582 unsigned OrigAlign = ST->getAlignment();
Owen Andersone50ed302009-08-10 22:56:29 +00006583 EVT SVT = Value.getOperand(0).getValueType();
Dan Gohman1ba519b2009-02-20 23:29:13 +00006584 unsigned Align = TLI.getTargetData()->
Owen Anderson23b9b192009-08-12 00:36:31 +00006585 getABITypeAlignment(SVT.getTypeForEVT(*DAG.getContext()));
Duncan Sandsd4b9c172008-06-13 19:07:40 +00006586 if (Align <= OrigAlign &&
Duncan Sands25cf2272008-11-24 14:53:14 +00006587 ((!LegalOperations && !ST->isVolatile()) ||
Dan Gohmanf560ffa2009-01-28 17:46:25 +00006588 TLI.isOperationLegalOrCustom(ISD::STORE, SVT)))
Bill Wendlingc144a572009-01-30 23:36:47 +00006589 return DAG.getStore(Chain, N->getDebugLoc(), Value.getOperand(0),
Chris Lattner6229d0a2010-09-21 18:41:36 +00006590 Ptr, ST->getPointerInfo(), ST->isVolatile(),
David Greene1e559442010-02-15 17:00:31 +00006591 ST->isNonTemporal(), OrigAlign);
Jim Laskey279f0532006-09-25 16:29:54 +00006592 }
Owen Andersona34d9362011-04-14 17:30:49 +00006593
Chris Lattnerb3452ea2011-04-09 02:32:02 +00006594 // Turn 'store undef, Ptr' -> nothing.
6595 if (Value.getOpcode() == ISD::UNDEF && ST->isUnindexed())
6596 return Chain;
Duncan Sandsd4b9c172008-06-13 19:07:40 +00006597
Nate Begeman2cbba892006-12-11 02:23:46 +00006598 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
Nate Begeman2cbba892006-12-11 02:23:46 +00006599 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Value)) {
Duncan Sandsd4b9c172008-06-13 19:07:40 +00006600 // NOTE: If the original store is volatile, this transform must not increase
6601 // the number of stores. For example, on x86-32 an f64 can be stored in one
6602 // processor operation but an i64 (which is not legal) requires two. So the
6603 // transform should not be done in this case.
Evan Cheng25ece662006-12-11 17:25:19 +00006604 if (Value.getOpcode() != ISD::TargetConstantFP) {
Dan Gohman475871a2008-07-27 21:46:04 +00006605 SDValue Tmp;
Owen Anderson825b72b2009-08-11 20:47:22 +00006606 switch (CFP->getValueType(0).getSimpleVT().SimpleTy) {
Torok Edwinc23197a2009-07-14 16:55:14 +00006607 default: llvm_unreachable("Unknown FP type");
Owen Anderson825b72b2009-08-11 20:47:22 +00006608 case MVT::f80: // We don't do this for these yet.
6609 case MVT::f128:
6610 case MVT::ppcf128:
Dale Johannesenc7b21d52007-09-18 18:36:59 +00006611 break;
Owen Anderson825b72b2009-08-11 20:47:22 +00006612 case MVT::f32:
Chris Lattner2392ae72010-04-15 04:48:01 +00006613 if ((isTypeLegal(MVT::i32) && !LegalOperations && !ST->isVolatile()) ||
Owen Anderson825b72b2009-08-11 20:47:22 +00006614 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) {
Dale Johannesen9d5f4562007-09-12 03:30:33 +00006615 Tmp = DAG.getConstant((uint32_t)CFP->getValueAPF().
Owen Anderson825b72b2009-08-11 20:47:22 +00006616 bitcastToAPInt().getZExtValue(), MVT::i32);
Bill Wendlingc144a572009-01-30 23:36:47 +00006617 return DAG.getStore(Chain, N->getDebugLoc(), Tmp,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006618 Ptr, ST->getPointerInfo(), ST->isVolatile(),
David Greene1e559442010-02-15 17:00:31 +00006619 ST->isNonTemporal(), ST->getAlignment());
Chris Lattner62be1a72006-12-12 04:16:14 +00006620 }
6621 break;
Owen Anderson825b72b2009-08-11 20:47:22 +00006622 case MVT::f64:
Chris Lattner2392ae72010-04-15 04:48:01 +00006623 if ((TLI.isTypeLegal(MVT::i64) && !LegalOperations &&
Dan Gohmanf560ffa2009-01-28 17:46:25 +00006624 !ST->isVolatile()) ||
Owen Anderson825b72b2009-08-11 20:47:22 +00006625 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i64)) {
Dale Johannesen7111b022008-10-09 18:53:47 +00006626 Tmp = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
Owen Anderson825b72b2009-08-11 20:47:22 +00006627 getZExtValue(), MVT::i64);
Bill Wendlingc144a572009-01-30 23:36:47 +00006628 return DAG.getStore(Chain, N->getDebugLoc(), Tmp,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006629 Ptr, ST->getPointerInfo(), ST->isVolatile(),
David Greene1e559442010-02-15 17:00:31 +00006630 ST->isNonTemporal(), ST->getAlignment());
Chris Lattnerb3452ea2011-04-09 02:32:02 +00006631 }
Owen Andersona34d9362011-04-14 17:30:49 +00006632
Chris Lattnerb3452ea2011-04-09 02:32:02 +00006633 if (!ST->isVolatile() &&
6634 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) {
Duncan Sandsdc846502007-10-28 12:59:45 +00006635 // Many FP stores are not made apparent until after legalize, e.g. for
Chris Lattner62be1a72006-12-12 04:16:14 +00006636 // argument passing. Since this is so common, custom legalize the
6637 // 64-bit integer store into two 32-bit stores.
Dale Johannesen7111b022008-10-09 18:53:47 +00006638 uint64_t Val = CFP->getValueAPF().bitcastToAPInt().getZExtValue();
Owen Anderson825b72b2009-08-11 20:47:22 +00006639 SDValue Lo = DAG.getConstant(Val & 0xFFFFFFFF, MVT::i32);
6640 SDValue Hi = DAG.getConstant(Val >> 32, MVT::i32);
Duncan Sands0753fc12008-02-11 10:37:04 +00006641 if (TLI.isBigEndian()) std::swap(Lo, Hi);
Chris Lattner62be1a72006-12-12 04:16:14 +00006642
Dan Gohmand6fd1bc2007-07-09 22:18:38 +00006643 unsigned Alignment = ST->getAlignment();
6644 bool isVolatile = ST->isVolatile();
David Greene1e559442010-02-15 17:00:31 +00006645 bool isNonTemporal = ST->isNonTemporal();
Dan Gohmand6fd1bc2007-07-09 22:18:38 +00006646
Bill Wendlingc144a572009-01-30 23:36:47 +00006647 SDValue St0 = DAG.getStore(Chain, ST->getDebugLoc(), Lo,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006648 Ptr, ST->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00006649 isVolatile, isNonTemporal,
6650 ST->getAlignment());
Bill Wendlingc144a572009-01-30 23:36:47 +00006651 Ptr = DAG.getNode(ISD::ADD, N->getDebugLoc(), Ptr.getValueType(), Ptr,
Chris Lattner62be1a72006-12-12 04:16:14 +00006652 DAG.getConstant(4, Ptr.getValueType()));
Duncan Sandsdc846502007-10-28 12:59:45 +00006653 Alignment = MinAlign(Alignment, 4U);
Bill Wendlingc144a572009-01-30 23:36:47 +00006654 SDValue St1 = DAG.getStore(Chain, ST->getDebugLoc(), Hi,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006655 Ptr, ST->getPointerInfo().getWithOffset(4),
6656 isVolatile, isNonTemporal,
David Greene1e559442010-02-15 17:00:31 +00006657 Alignment);
Owen Anderson825b72b2009-08-11 20:47:22 +00006658 return DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), MVT::Other,
Bill Wendlingc144a572009-01-30 23:36:47 +00006659 St0, St1);
Chris Lattner62be1a72006-12-12 04:16:14 +00006660 }
Bill Wendlingc144a572009-01-30 23:36:47 +00006661
Chris Lattner62be1a72006-12-12 04:16:14 +00006662 break;
Evan Cheng25ece662006-12-11 17:25:19 +00006663 }
Nate Begeman2cbba892006-12-11 02:23:46 +00006664 }
Nate Begeman2cbba892006-12-11 02:23:46 +00006665 }
6666
Evan Cheng255f20f2010-04-01 06:04:33 +00006667 // Try to infer better alignment information than the store already has.
6668 if (OptLevel != CodeGenOpt::None && ST->isUnindexed()) {
6669 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) {
6670 if (Align > ST->getAlignment())
6671 return DAG.getTruncStore(Chain, N->getDebugLoc(), Value,
Chris Lattnerda2d8e12010-09-21 17:42:31 +00006672 Ptr, ST->getPointerInfo(), ST->getMemoryVT(),
Evan Cheng255f20f2010-04-01 06:04:33 +00006673 ST->isVolatile(), ST->isNonTemporal(), Align);
6674 }
6675 }
6676
Evan Cheng31959b12011-02-02 01:06:55 +00006677 // Try transforming a pair floating point load / store ops to integer
6678 // load / store ops.
6679 SDValue NewST = TransformFPLoadStorePair(N);
6680 if (NewST.getNode())
6681 return NewST;
6682
Scott Michelfdc40a02009-02-17 22:15:04 +00006683 if (CombinerAA) {
Jim Laskey279f0532006-09-25 16:29:54 +00006684 // Walk up chain skipping non-aliasing memory nodes.
Dan Gohman475871a2008-07-27 21:46:04 +00006685 SDValue BetterChain = FindBetterChain(N, Chain);
Scott Michelfdc40a02009-02-17 22:15:04 +00006686
Jim Laskey6ff23e52006-10-04 16:53:27 +00006687 // If there is a better chain.
Jim Laskey279f0532006-09-25 16:29:54 +00006688 if (Chain != BetterChain) {
Dan Gohman475871a2008-07-27 21:46:04 +00006689 SDValue ReplStore;
Nate Begemanb6aef5c2009-09-15 00:18:30 +00006690
6691 // Replace the chain to avoid dependency.
Jim Laskeyd4edf2c2006-10-14 12:14:27 +00006692 if (ST->isTruncatingStore()) {
Bill Wendlingc144a572009-01-30 23:36:47 +00006693 ReplStore = DAG.getTruncStore(BetterChain, N->getDebugLoc(), Value, Ptr,
Chris Lattnerda2d8e12010-09-21 17:42:31 +00006694 ST->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00006695 ST->getMemoryVT(), ST->isVolatile(),
6696 ST->isNonTemporal(), ST->getAlignment());
Jim Laskeyd4edf2c2006-10-14 12:14:27 +00006697 } else {
Bill Wendlingc144a572009-01-30 23:36:47 +00006698 ReplStore = DAG.getStore(BetterChain, N->getDebugLoc(), Value, Ptr,
Chris Lattner6229d0a2010-09-21 18:41:36 +00006699 ST->getPointerInfo(),
David Greene1e559442010-02-15 17:00:31 +00006700 ST->isVolatile(), ST->isNonTemporal(),
6701 ST->getAlignment());
Jim Laskeyd4edf2c2006-10-14 12:14:27 +00006702 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006703
Jim Laskey279f0532006-09-25 16:29:54 +00006704 // Create token to keep both nodes around.
Bill Wendlingc144a572009-01-30 23:36:47 +00006705 SDValue Token = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(),
Owen Anderson825b72b2009-08-11 20:47:22 +00006706 MVT::Other, Chain, ReplStore);
Bill Wendlingc144a572009-01-30 23:36:47 +00006707
Nate Begemanb6aef5c2009-09-15 00:18:30 +00006708 // Make sure the new and old chains are cleaned up.
6709 AddToWorkList(Token.getNode());
6710
Jim Laskey274062c2006-10-13 23:32:28 +00006711 // Don't add users to work list.
6712 return CombineTo(N, Token, false);
Jim Laskey279f0532006-09-25 16:29:54 +00006713 }
Jim Laskeyd1aed7a2006-09-21 16:28:59 +00006714 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006715
Evan Cheng33dbedc2006-11-05 09:31:14 +00006716 // Try transforming N to an indexed store.
Evan Chengbbd6f6e2006-11-07 09:03:05 +00006717 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
Dan Gohman475871a2008-07-27 21:46:04 +00006718 return SDValue(N, 0);
Evan Cheng33dbedc2006-11-05 09:31:14 +00006719
Chris Lattner3c872852007-12-29 06:26:16 +00006720 // FIXME: is there such a thing as a truncating indexed store?
Chris Lattnerddf89562008-01-17 19:59:44 +00006721 if (ST->isTruncatingStore() && ST->isUnindexed() &&
Nadav Rotembaff46f2011-06-15 11:19:12 +00006722 Value.getValueType().isInteger()) {
Chris Lattner2b4c2792007-10-13 06:35:54 +00006723 // See if we can simplify the input to this truncstore with knowledge that
6724 // only the low bits are being used. For example:
6725 // "truncstore (or (shl x, 8), y), i8" -> "truncstore y, i8"
Scott Michelfdc40a02009-02-17 22:15:04 +00006726 SDValue Shorter =
Dan Gohman2e68b6f2008-02-25 21:11:39 +00006727 GetDemandedBits(Value,
Nadav Rotembaff46f2011-06-15 11:19:12 +00006728 APInt::getLowBitsSet(
6729 Value.getValueType().getScalarType().getSizeInBits(),
6730 ST->getMemoryVT().getScalarType().getSizeInBits()));
Gabor Greifba36cb52008-08-28 21:40:38 +00006731 AddToWorkList(Value.getNode());
6732 if (Shorter.getNode())
Bill Wendlingc144a572009-01-30 23:36:47 +00006733 return DAG.getTruncStore(Chain, N->getDebugLoc(), Shorter,
Chris Lattnerda2d8e12010-09-21 17:42:31 +00006734 Ptr, ST->getPointerInfo(), ST->getMemoryVT(),
David Greene1e559442010-02-15 17:00:31 +00006735 ST->isVolatile(), ST->isNonTemporal(),
6736 ST->getAlignment());
Scott Michelfdc40a02009-02-17 22:15:04 +00006737
Chris Lattnere33544c2007-10-13 06:58:48 +00006738 // Otherwise, see if we can simplify the operation with
6739 // SimplifyDemandedBits, which only works if the value has a single use.
Dan Gohman7b8d4a92008-02-27 00:25:32 +00006740 if (SimplifyDemandedBits(Value,
Eric Christopher503a64d2010-12-09 04:48:06 +00006741 APInt::getLowBitsSet(
6742 Value.getValueType().getScalarType().getSizeInBits(),
6743 ST->getMemoryVT().getScalarType().getSizeInBits())))
Dan Gohman475871a2008-07-27 21:46:04 +00006744 return SDValue(N, 0);
Chris Lattner2b4c2792007-10-13 06:35:54 +00006745 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006746
Chris Lattner3c872852007-12-29 06:26:16 +00006747 // If this is a load followed by a store to the same location, then the store
6748 // is dead/noop.
6749 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Value)) {
Dan Gohmanb625f2f2008-01-30 00:15:11 +00006750 if (Ld->getBasePtr() == Ptr && ST->getMemoryVT() == Ld->getMemoryVT() &&
Chris Lattnerddf89562008-01-17 19:59:44 +00006751 ST->isUnindexed() && !ST->isVolatile() &&
Chris Lattner07649d92008-01-08 23:08:06 +00006752 // There can't be any side effects between the load and store, such as
6753 // a call or store.
Dan Gohman475871a2008-07-27 21:46:04 +00006754 Chain.reachesChainWithoutSideEffects(SDValue(Ld, 1))) {
Chris Lattner3c872852007-12-29 06:26:16 +00006755 // The store is dead, remove it.
6756 return Chain;
6757 }
6758 }
Duncan Sandsd4b9c172008-06-13 19:07:40 +00006759
Chris Lattnerddf89562008-01-17 19:59:44 +00006760 // If this is an FP_ROUND or TRUNC followed by a store, fold this into a
6761 // truncating store. We can do this even if this is already a truncstore.
6762 if ((Value.getOpcode() == ISD::FP_ROUND || Value.getOpcode() == ISD::TRUNCATE)
Gabor Greifba36cb52008-08-28 21:40:38 +00006763 && Value.getNode()->hasOneUse() && ST->isUnindexed() &&
Chris Lattnerddf89562008-01-17 19:59:44 +00006764 TLI.isTruncStoreLegal(Value.getOperand(0).getValueType(),
Dan Gohmanb625f2f2008-01-30 00:15:11 +00006765 ST->getMemoryVT())) {
Bill Wendlingc144a572009-01-30 23:36:47 +00006766 return DAG.getTruncStore(Chain, N->getDebugLoc(), Value.getOperand(0),
Chris Lattnerda2d8e12010-09-21 17:42:31 +00006767 Ptr, ST->getPointerInfo(), ST->getMemoryVT(),
David Greene1e559442010-02-15 17:00:31 +00006768 ST->isVolatile(), ST->isNonTemporal(),
6769 ST->getAlignment());
Chris Lattnerddf89562008-01-17 19:59:44 +00006770 }
Duncan Sandsd4b9c172008-06-13 19:07:40 +00006771
Evan Cheng8b944d32009-05-28 00:35:15 +00006772 return ReduceLoadOpStoreWidth(N);
Chris Lattner87514ca2005-10-10 22:31:19 +00006773}
6774
Dan Gohman475871a2008-07-27 21:46:04 +00006775SDValue DAGCombiner::visitINSERT_VECTOR_ELT(SDNode *N) {
6776 SDValue InVec = N->getOperand(0);
6777 SDValue InVal = N->getOperand(1);
6778 SDValue EltNo = N->getOperand(2);
Scott Michelfdc40a02009-02-17 22:15:04 +00006779
Bob Wilson492fd452010-05-19 23:42:58 +00006780 // If the inserted element is an UNDEF, just use the input vector.
6781 if (InVal.getOpcode() == ISD::UNDEF)
6782 return InVec;
6783
Nadav Rotem609d54e2011-02-12 14:40:33 +00006784 EVT VT = InVec.getValueType();
6785
Owen Anderson95771af2011-02-25 21:41:48 +00006786 // If we can't generate a legal BUILD_VECTOR, exit
Nadav Rotem609d54e2011-02-12 14:40:33 +00006787 if (LegalOperations && !TLI.isOperationLegal(ISD::BUILD_VECTOR, VT))
6788 return SDValue();
6789
Chris Lattnerca242442006-03-19 01:27:56 +00006790 // If the invec is a BUILD_VECTOR and if EltNo is a constant, build a new
6791 // vector with the inserted element.
6792 if (InVec.getOpcode() == ISD::BUILD_VECTOR && isa<ConstantSDNode>(EltNo)) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00006793 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
Gabor Greif12632d22008-08-30 19:29:20 +00006794 SmallVector<SDValue, 8> Ops(InVec.getNode()->op_begin(),
6795 InVec.getNode()->op_end());
Chris Lattnerca242442006-03-19 01:27:56 +00006796 if (Elt < Ops.size())
6797 Ops[Elt] = InVal;
Evan Chenga87008d2009-02-25 22:49:59 +00006798 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(),
Nadav Rotem609d54e2011-02-12 14:40:33 +00006799 VT, &Ops[0], Ops.size());
Chris Lattnerca242442006-03-19 01:27:56 +00006800 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006801 // If the invec is an UNDEF and if EltNo is a constant, create a new
Nate Begeman9008ca62009-04-27 18:41:29 +00006802 // BUILD_VECTOR with undef elements and the inserted element.
Nadav Rotem609d54e2011-02-12 14:40:33 +00006803 if (InVec.getOpcode() == ISD::UNDEF &&
Nate Begeman9008ca62009-04-27 18:41:29 +00006804 isa<ConstantSDNode>(EltNo)) {
Dan Gohman8a55ce42009-09-23 21:02:20 +00006805 EVT EltVT = VT.getVectorElementType();
Nate Begeman9008ca62009-04-27 18:41:29 +00006806 unsigned NElts = VT.getVectorNumElements();
Dan Gohman8a55ce42009-09-23 21:02:20 +00006807 SmallVector<SDValue, 8> Ops(NElts, DAG.getUNDEF(EltVT));
Scott Michelfdc40a02009-02-17 22:15:04 +00006808
Nate Begeman9008ca62009-04-27 18:41:29 +00006809 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
6810 if (Elt < Ops.size())
6811 Ops[Elt] = InVal;
6812 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(),
Nadav Rotem609d54e2011-02-12 14:40:33 +00006813 VT, &Ops[0], Ops.size());
Nate Begeman9008ca62009-04-27 18:41:29 +00006814 }
Dan Gohman475871a2008-07-27 21:46:04 +00006815 return SDValue();
Chris Lattnerca242442006-03-19 01:27:56 +00006816}
6817
Dan Gohman475871a2008-07-27 21:46:04 +00006818SDValue DAGCombiner::visitEXTRACT_VECTOR_ELT(SDNode *N) {
Mon P Wang7ac9cdf2009-01-17 00:07:25 +00006819 // (vextract (scalar_to_vector val, 0) -> val
6820 SDValue InVec = N->getOperand(0);
Mon P Wang7ac9cdf2009-01-17 00:07:25 +00006821
Duncan Sandsc356f332011-05-09 08:03:33 +00006822 if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR) {
6823 // Check if the result type doesn't match the inserted element type. A
6824 // SCALAR_TO_VECTOR may truncate the inserted element and the
6825 // EXTRACT_VECTOR_ELT may widen the extracted vector.
6826 SDValue InOp = InVec.getOperand(0);
6827 EVT NVT = N->getValueType(0);
6828 if (InOp.getValueType() != NVT) {
6829 assert(InOp.getValueType().isInteger() && NVT.isInteger());
6830 return DAG.getSExtOrTrunc(InOp, InVec.getDebugLoc(), NVT);
6831 }
6832 return InOp;
6833 }
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006834
6835 // Perform only after legalization to ensure build_vector / vector_shuffle
6836 // optimizations have already been done.
Duncan Sands25cf2272008-11-24 14:53:14 +00006837 if (!LegalOperations) return SDValue();
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006838
Mon P Wang7ac9cdf2009-01-17 00:07:25 +00006839 // (vextract (v4f32 load $addr), c) -> (f32 load $addr+c*size)
6840 // (vextract (v4f32 s2v (f32 load $addr)), c) -> (f32 load $addr+c*size)
6841 // (vextract (v4f32 shuffle (load $addr), <1,u,u,u>), 0) -> (f32 load $addr)
Mon P Wange3bc6ae2009-01-18 06:43:40 +00006842 SDValue EltNo = N->getOperand(1);
Evan Cheng513da432007-10-06 08:19:55 +00006843
Evan Cheng513da432007-10-06 08:19:55 +00006844 if (isa<ConstantSDNode>(EltNo)) {
Eric Christophercaebdd42010-11-03 09:36:40 +00006845 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
Evan Cheng513da432007-10-06 08:19:55 +00006846 bool NewLoad = false;
Mon P Wanga60b5232008-12-11 00:26:16 +00006847 bool BCNumEltsChanged = false;
Owen Andersone50ed302009-08-10 22:56:29 +00006848 EVT VT = InVec.getValueType();
6849 EVT ExtVT = VT.getVectorElementType();
6850 EVT LVT = ExtVT;
Bill Wendlingc144a572009-01-30 23:36:47 +00006851
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006852 if (InVec.getOpcode() == ISD::BITCAST) {
Owen Andersone50ed302009-08-10 22:56:29 +00006853 EVT BCVT = InVec.getOperand(0).getValueType();
6854 if (!BCVT.isVector() || ExtVT.bitsGT(BCVT.getVectorElementType()))
Dan Gohman475871a2008-07-27 21:46:04 +00006855 return SDValue();
Mon P Wanga60b5232008-12-11 00:26:16 +00006856 if (VT.getVectorNumElements() != BCVT.getVectorNumElements())
6857 BCNumEltsChanged = true;
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006858 InVec = InVec.getOperand(0);
Owen Andersone50ed302009-08-10 22:56:29 +00006859 ExtVT = BCVT.getVectorElementType();
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006860 NewLoad = true;
6861 }
Evan Cheng513da432007-10-06 08:19:55 +00006862
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006863 LoadSDNode *LN0 = NULL;
Nate Begeman5a5ca152009-04-29 05:20:52 +00006864 const ShuffleVectorSDNode *SVN = NULL;
Bill Wendlingc144a572009-01-30 23:36:47 +00006865 if (ISD::isNormalLoad(InVec.getNode())) {
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006866 LN0 = cast<LoadSDNode>(InVec);
Bill Wendlingc144a572009-01-30 23:36:47 +00006867 } else if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR &&
Owen Andersone50ed302009-08-10 22:56:29 +00006868 InVec.getOperand(0).getValueType() == ExtVT &&
Bill Wendlingc144a572009-01-30 23:36:47 +00006869 ISD::isNormalLoad(InVec.getOperand(0).getNode())) {
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006870 LN0 = cast<LoadSDNode>(InVec.getOperand(0));
Nate Begeman5a5ca152009-04-29 05:20:52 +00006871 } else if ((SVN = dyn_cast<ShuffleVectorSDNode>(InVec))) {
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006872 // (vextract (vector_shuffle (load $addr), v2, <1, u, u, u>), 1)
6873 // =>
6874 // (load $addr+1*size)
Scott Michelfdc40a02009-02-17 22:15:04 +00006875
Mon P Wanga60b5232008-12-11 00:26:16 +00006876 // If the bit convert changed the number of elements, it is unsafe
6877 // to examine the mask.
6878 if (BCNumEltsChanged)
6879 return SDValue();
Nate Begeman5a5ca152009-04-29 05:20:52 +00006880
6881 // Select the input vector, guarding against out of range extract vector.
6882 unsigned NumElems = VT.getVectorNumElements();
Eric Christophercaebdd42010-11-03 09:36:40 +00006883 int Idx = (Elt > (int)NumElems) ? -1 : SVN->getMaskElt(Elt);
Nate Begeman5a5ca152009-04-29 05:20:52 +00006884 InVec = (Idx < (int)NumElems) ? InVec.getOperand(0) : InVec.getOperand(1);
6885
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006886 if (InVec.getOpcode() == ISD::BITCAST)
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006887 InVec = InVec.getOperand(0);
Gabor Greifba36cb52008-08-28 21:40:38 +00006888 if (ISD::isNormalLoad(InVec.getNode())) {
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006889 LN0 = cast<LoadSDNode>(InVec);
Ted Kremenekd0e88f32010-04-08 18:49:30 +00006890 Elt = (Idx < (int)NumElems) ? Idx : Idx - (int)NumElems;
Evan Cheng513da432007-10-06 08:19:55 +00006891 }
6892 }
Bill Wendlingc144a572009-01-30 23:36:47 +00006893
Nadav Rotem42febc62011-05-11 14:40:50 +00006894 if (!LN0 || !LN0->hasNUsesOfValue(1,0) || LN0->isVolatile())
Dan Gohman475871a2008-07-27 21:46:04 +00006895 return SDValue();
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006896
Eric Christopherd81f17a2010-11-03 20:44:42 +00006897 // If Idx was -1 above, Elt is going to be -1, so just return undef.
6898 if (Elt == -1)
6899 return DAG.getUNDEF(LN0->getBasePtr().getValueType());
6900
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006901 unsigned Align = LN0->getAlignment();
6902 if (NewLoad) {
6903 // Check the resultant load doesn't need a higher alignment than the
6904 // original load.
Bill Wendlingc144a572009-01-30 23:36:47 +00006905 unsigned NewAlign =
Eric Christopher503a64d2010-12-09 04:48:06 +00006906 TLI.getTargetData()
6907 ->getABITypeAlignment(LVT.getTypeForEVT(*DAG.getContext()));
Bill Wendlingc144a572009-01-30 23:36:47 +00006908
Dan Gohmanf560ffa2009-01-28 17:46:25 +00006909 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, LVT))
Dan Gohman475871a2008-07-27 21:46:04 +00006910 return SDValue();
Bill Wendlingc144a572009-01-30 23:36:47 +00006911
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006912 Align = NewAlign;
6913 }
6914
Dan Gohman475871a2008-07-27 21:46:04 +00006915 SDValue NewPtr = LN0->getBasePtr();
Chris Lattnerfa459012010-09-21 16:08:50 +00006916 unsigned PtrOff = 0;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006917
Eric Christopherd81f17a2010-11-03 20:44:42 +00006918 if (Elt) {
Chris Lattnerfa459012010-09-21 16:08:50 +00006919 PtrOff = LVT.getSizeInBits() * Elt / 8;
Owen Andersone50ed302009-08-10 22:56:29 +00006920 EVT PtrType = NewPtr.getValueType();
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006921 if (TLI.isBigEndian())
Duncan Sands83ec4b62008-06-06 12:08:01 +00006922 PtrOff = VT.getSizeInBits() / 8 - PtrOff;
Bill Wendlingc144a572009-01-30 23:36:47 +00006923 NewPtr = DAG.getNode(ISD::ADD, N->getDebugLoc(), PtrType, NewPtr,
Evan Cheng77f0b7a2008-05-13 08:35:03 +00006924 DAG.getConstant(PtrOff, PtrType));
6925 }
Bill Wendlingc144a572009-01-30 23:36:47 +00006926
6927 return DAG.getLoad(LVT, N->getDebugLoc(), LN0->getChain(), NewPtr,
Chris Lattnerfa459012010-09-21 16:08:50 +00006928 LN0->getPointerInfo().getWithOffset(PtrOff),
David Greene1e559442010-02-15 17:00:31 +00006929 LN0->isVolatile(), LN0->isNonTemporal(), Align);
Evan Cheng513da432007-10-06 08:19:55 +00006930 }
Bill Wendlingc144a572009-01-30 23:36:47 +00006931
Dan Gohman475871a2008-07-27 21:46:04 +00006932 return SDValue();
Evan Cheng513da432007-10-06 08:19:55 +00006933}
Evan Cheng513da432007-10-06 08:19:55 +00006934
Dan Gohman475871a2008-07-27 21:46:04 +00006935SDValue DAGCombiner::visitBUILD_VECTOR(SDNode *N) {
Dan Gohman7f321562007-06-25 16:23:39 +00006936 unsigned NumInScalars = N->getNumOperands();
Owen Andersone50ed302009-08-10 22:56:29 +00006937 EVT VT = N->getValueType(0);
Chris Lattnerca242442006-03-19 01:27:56 +00006938
Dan Gohman7f321562007-06-25 16:23:39 +00006939 // Check to see if this is a BUILD_VECTOR of a bunch of EXTRACT_VECTOR_ELT
6940 // operations. If so, and if the EXTRACT_VECTOR_ELT vector inputs come from
6941 // at most two distinct vectors, turn this into a shuffle node.
Dan Gohman475871a2008-07-27 21:46:04 +00006942 SDValue VecIn1, VecIn2;
Chris Lattnerd7648c82006-03-28 20:28:38 +00006943 for (unsigned i = 0; i != NumInScalars; ++i) {
6944 // Ignore undef inputs.
6945 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
Scott Michelfdc40a02009-02-17 22:15:04 +00006946
Dan Gohman7f321562007-06-25 16:23:39 +00006947 // If this input is something other than a EXTRACT_VECTOR_ELT with a
Chris Lattnerd7648c82006-03-28 20:28:38 +00006948 // constant index, bail out.
Dan Gohman7f321562007-06-25 16:23:39 +00006949 if (N->getOperand(i).getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
Chris Lattnerd7648c82006-03-28 20:28:38 +00006950 !isa<ConstantSDNode>(N->getOperand(i).getOperand(1))) {
Dan Gohman475871a2008-07-27 21:46:04 +00006951 VecIn1 = VecIn2 = SDValue(0, 0);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006952 break;
6953 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006954
Dan Gohman7f321562007-06-25 16:23:39 +00006955 // If the input vector type disagrees with the result of the build_vector,
Chris Lattnerd7648c82006-03-28 20:28:38 +00006956 // we can't make a shuffle.
Dan Gohman475871a2008-07-27 21:46:04 +00006957 SDValue ExtractedFromVec = N->getOperand(i).getOperand(0);
Dan Gohman7f321562007-06-25 16:23:39 +00006958 if (ExtractedFromVec.getValueType() != VT) {
Dan Gohman475871a2008-07-27 21:46:04 +00006959 VecIn1 = VecIn2 = SDValue(0, 0);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006960 break;
6961 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006962
Chris Lattnerd7648c82006-03-28 20:28:38 +00006963 // Otherwise, remember this. We allow up to two distinct input vectors.
6964 if (ExtractedFromVec == VecIn1 || ExtractedFromVec == VecIn2)
6965 continue;
Scott Michelfdc40a02009-02-17 22:15:04 +00006966
Gabor Greifba36cb52008-08-28 21:40:38 +00006967 if (VecIn1.getNode() == 0) {
Chris Lattnerd7648c82006-03-28 20:28:38 +00006968 VecIn1 = ExtractedFromVec;
Gabor Greifba36cb52008-08-28 21:40:38 +00006969 } else if (VecIn2.getNode() == 0) {
Chris Lattnerd7648c82006-03-28 20:28:38 +00006970 VecIn2 = ExtractedFromVec;
6971 } else {
6972 // Too many inputs.
Dan Gohman475871a2008-07-27 21:46:04 +00006973 VecIn1 = VecIn2 = SDValue(0, 0);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006974 break;
6975 }
6976 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006977
Chris Lattnerd7648c82006-03-28 20:28:38 +00006978 // If everything is good, we can make a shuffle operation.
Gabor Greifba36cb52008-08-28 21:40:38 +00006979 if (VecIn1.getNode()) {
Nate Begeman9008ca62009-04-27 18:41:29 +00006980 SmallVector<int, 8> Mask;
Chris Lattnerd7648c82006-03-28 20:28:38 +00006981 for (unsigned i = 0; i != NumInScalars; ++i) {
6982 if (N->getOperand(i).getOpcode() == ISD::UNDEF) {
Nate Begeman9008ca62009-04-27 18:41:29 +00006983 Mask.push_back(-1);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006984 continue;
6985 }
Scott Michelfdc40a02009-02-17 22:15:04 +00006986
Rafael Espindola15684b22009-04-24 12:40:33 +00006987 // If extracting from the first vector, just use the index directly.
Nate Begeman9008ca62009-04-27 18:41:29 +00006988 SDValue Extract = N->getOperand(i);
Mon P Wang93b74152009-03-17 06:33:10 +00006989 SDValue ExtVal = Extract.getOperand(1);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006990 if (Extract.getOperand(0) == VecIn1) {
Nate Begeman5a5ca152009-04-29 05:20:52 +00006991 unsigned ExtIndex = cast<ConstantSDNode>(ExtVal)->getZExtValue();
6992 if (ExtIndex > VT.getVectorNumElements())
6993 return SDValue();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00006994
Nate Begeman5a5ca152009-04-29 05:20:52 +00006995 Mask.push_back(ExtIndex);
Chris Lattnerd7648c82006-03-28 20:28:38 +00006996 continue;
6997 }
6998
6999 // Otherwise, use InIdx + VecSize
Mon P Wang93b74152009-03-17 06:33:10 +00007000 unsigned Idx = cast<ConstantSDNode>(ExtVal)->getZExtValue();
Nate Begeman9008ca62009-04-27 18:41:29 +00007001 Mask.push_back(Idx+NumInScalars);
Chris Lattnerd7648c82006-03-28 20:28:38 +00007002 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007003
Chris Lattnerd7648c82006-03-28 20:28:38 +00007004 // Add count and size info.
Chris Lattner2392ae72010-04-15 04:48:01 +00007005 if (!isTypeLegal(VT))
Duncan Sands25cf2272008-11-24 14:53:14 +00007006 return SDValue();
7007
Dan Gohman7f321562007-06-25 16:23:39 +00007008 // Return the new VECTOR_SHUFFLE node.
Nate Begeman9008ca62009-04-27 18:41:29 +00007009 SDValue Ops[2];
Chris Lattnerbd564bf2006-08-08 02:23:42 +00007010 Ops[0] = VecIn1;
Nate Begeman9008ca62009-04-27 18:41:29 +00007011 Ops[1] = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT);
7012 return DAG.getVectorShuffle(VT, N->getDebugLoc(), Ops[0], Ops[1], &Mask[0]);
Chris Lattnerd7648c82006-03-28 20:28:38 +00007013 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007014
Dan Gohman475871a2008-07-27 21:46:04 +00007015 return SDValue();
Chris Lattnerd7648c82006-03-28 20:28:38 +00007016}
7017
Dan Gohman475871a2008-07-27 21:46:04 +00007018SDValue DAGCombiner::visitCONCAT_VECTORS(SDNode *N) {
Dan Gohman7f321562007-06-25 16:23:39 +00007019 // TODO: Check to see if this is a CONCAT_VECTORS of a bunch of
7020 // EXTRACT_SUBVECTOR operations. If so, and if the EXTRACT_SUBVECTOR vector
7021 // inputs come from at most two distinct vectors, turn this into a shuffle
7022 // node.
7023
7024 // If we only have one input vector, we don't need to do any concatenation.
Bill Wendlingc144a572009-01-30 23:36:47 +00007025 if (N->getNumOperands() == 1)
Dan Gohman7f321562007-06-25 16:23:39 +00007026 return N->getOperand(0);
Dan Gohman7f321562007-06-25 16:23:39 +00007027
Dan Gohman475871a2008-07-27 21:46:04 +00007028 return SDValue();
Dan Gohman7f321562007-06-25 16:23:39 +00007029}
7030
Dan Gohman475871a2008-07-27 21:46:04 +00007031SDValue DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) {
Owen Andersone50ed302009-08-10 22:56:29 +00007032 EVT VT = N->getValueType(0);
Nate Begeman9008ca62009-04-27 18:41:29 +00007033 unsigned NumElts = VT.getVectorNumElements();
Chris Lattnerf1d0c622006-03-31 22:16:43 +00007034
Mon P Wangaeb06d22008-11-10 04:46:22 +00007035 SDValue N0 = N->getOperand(0);
Mon P Wangaeb06d22008-11-10 04:46:22 +00007036
7037 assert(N0.getValueType().getVectorNumElements() == NumElts &&
7038 "Vector shuffle must be normalized in DAG");
7039
Nate Begeman9008ca62009-04-27 18:41:29 +00007040 // FIXME: implement canonicalizations from DAG.getVectorShuffle()
Evan Chenge7bec0d2006-07-20 22:44:41 +00007041
Bob Wilson0f1db1a2010-10-28 17:06:14 +00007042 // If it is a splat, check if the argument vector is another splat or a
7043 // build_vector with all scalar elements the same.
7044 ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
7045 if (SVN->isSplat() && SVN->getSplatIndex() < (int)NumElts) {
Gabor Greifba36cb52008-08-28 21:40:38 +00007046 SDNode *V = N0.getNode();
Evan Cheng917ec982006-07-21 08:25:53 +00007047
Dan Gohman7f321562007-06-25 16:23:39 +00007048 // If this is a bit convert that changes the element type of the vector but
Evan Cheng59569222006-10-16 22:49:37 +00007049 // not the number of vector elements, look through it. Be careful not to
7050 // look though conversions that change things like v4f32 to v2f64.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007051 if (V->getOpcode() == ISD::BITCAST) {
Dan Gohman475871a2008-07-27 21:46:04 +00007052 SDValue ConvInput = V->getOperand(0);
Evan Cheng29257862008-07-22 20:42:56 +00007053 if (ConvInput.getValueType().isVector() &&
7054 ConvInput.getValueType().getVectorNumElements() == NumElts)
Gabor Greifba36cb52008-08-28 21:40:38 +00007055 V = ConvInput.getNode();
Evan Cheng59569222006-10-16 22:49:37 +00007056 }
7057
Dan Gohman7f321562007-06-25 16:23:39 +00007058 if (V->getOpcode() == ISD::BUILD_VECTOR) {
Bob Wilson0f1db1a2010-10-28 17:06:14 +00007059 assert(V->getNumOperands() == NumElts &&
7060 "BUILD_VECTOR has wrong number of operands");
7061 SDValue Base;
7062 bool AllSame = true;
7063 for (unsigned i = 0; i != NumElts; ++i) {
7064 if (V->getOperand(i).getOpcode() != ISD::UNDEF) {
7065 Base = V->getOperand(i);
7066 break;
Evan Cheng917ec982006-07-21 08:25:53 +00007067 }
Evan Cheng917ec982006-07-21 08:25:53 +00007068 }
Bob Wilson0f1db1a2010-10-28 17:06:14 +00007069 // Splat of <u, u, u, u>, return <u, u, u, u>
7070 if (!Base.getNode())
7071 return N0;
7072 for (unsigned i = 0; i != NumElts; ++i) {
7073 if (V->getOperand(i) != Base) {
7074 AllSame = false;
7075 break;
7076 }
7077 }
7078 // Splat of <x, x, x, x>, return <x, x, x, x>
7079 if (AllSame)
7080 return N0;
Evan Cheng917ec982006-07-21 08:25:53 +00007081 }
7082 }
Dan Gohman475871a2008-07-27 21:46:04 +00007083 return SDValue();
Chris Lattnerf1d0c622006-03-31 22:16:43 +00007084}
7085
Jim Grosbach9a526492010-06-23 16:07:42 +00007086SDValue DAGCombiner::visitMEMBARRIER(SDNode* N) {
7087 if (!TLI.getShouldFoldAtomicFences())
7088 return SDValue();
7089
7090 SDValue atomic = N->getOperand(0);
7091 switch (atomic.getOpcode()) {
7092 case ISD::ATOMIC_CMP_SWAP:
7093 case ISD::ATOMIC_SWAP:
7094 case ISD::ATOMIC_LOAD_ADD:
7095 case ISD::ATOMIC_LOAD_SUB:
7096 case ISD::ATOMIC_LOAD_AND:
7097 case ISD::ATOMIC_LOAD_OR:
7098 case ISD::ATOMIC_LOAD_XOR:
7099 case ISD::ATOMIC_LOAD_NAND:
7100 case ISD::ATOMIC_LOAD_MIN:
7101 case ISD::ATOMIC_LOAD_MAX:
7102 case ISD::ATOMIC_LOAD_UMIN:
7103 case ISD::ATOMIC_LOAD_UMAX:
7104 break;
7105 default:
7106 return SDValue();
7107 }
7108
7109 SDValue fence = atomic.getOperand(0);
7110 if (fence.getOpcode() != ISD::MEMBARRIER)
7111 return SDValue();
7112
7113 switch (atomic.getOpcode()) {
7114 case ISD::ATOMIC_CMP_SWAP:
7115 return SDValue(DAG.UpdateNodeOperands(atomic.getNode(),
7116 fence.getOperand(0),
7117 atomic.getOperand(1), atomic.getOperand(2),
7118 atomic.getOperand(3)), atomic.getResNo());
7119 case ISD::ATOMIC_SWAP:
7120 case ISD::ATOMIC_LOAD_ADD:
7121 case ISD::ATOMIC_LOAD_SUB:
7122 case ISD::ATOMIC_LOAD_AND:
7123 case ISD::ATOMIC_LOAD_OR:
7124 case ISD::ATOMIC_LOAD_XOR:
7125 case ISD::ATOMIC_LOAD_NAND:
7126 case ISD::ATOMIC_LOAD_MIN:
7127 case ISD::ATOMIC_LOAD_MAX:
7128 case ISD::ATOMIC_LOAD_UMIN:
7129 case ISD::ATOMIC_LOAD_UMAX:
7130 return SDValue(DAG.UpdateNodeOperands(atomic.getNode(),
7131 fence.getOperand(0),
7132 atomic.getOperand(1), atomic.getOperand(2)),
7133 atomic.getResNo());
7134 default:
7135 return SDValue();
7136 }
7137}
7138
Evan Cheng44f1f092006-04-20 08:56:16 +00007139/// XformToShuffleWithZero - Returns a vector_shuffle if it able to transform
Dan Gohman7f321562007-06-25 16:23:39 +00007140/// an AND to a vector_shuffle with the destination vector and a zero vector.
7141/// e.g. AND V, <0xffffffff, 0, 0xffffffff, 0>. ==>
Evan Cheng44f1f092006-04-20 08:56:16 +00007142/// vector_shuffle V, Zero, <0, 4, 2, 4>
Dan Gohman475871a2008-07-27 21:46:04 +00007143SDValue DAGCombiner::XformToShuffleWithZero(SDNode *N) {
Owen Andersone50ed302009-08-10 22:56:29 +00007144 EVT VT = N->getValueType(0);
Nate Begeman9008ca62009-04-27 18:41:29 +00007145 DebugLoc dl = N->getDebugLoc();
Dan Gohman475871a2008-07-27 21:46:04 +00007146 SDValue LHS = N->getOperand(0);
7147 SDValue RHS = N->getOperand(1);
Dan Gohman7f321562007-06-25 16:23:39 +00007148 if (N->getOpcode() == ISD::AND) {
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007149 if (RHS.getOpcode() == ISD::BITCAST)
Evan Cheng44f1f092006-04-20 08:56:16 +00007150 RHS = RHS.getOperand(0);
Dan Gohman7f321562007-06-25 16:23:39 +00007151 if (RHS.getOpcode() == ISD::BUILD_VECTOR) {
Nate Begeman9008ca62009-04-27 18:41:29 +00007152 SmallVector<int, 8> Indices;
7153 unsigned NumElts = RHS.getNumOperands();
Evan Cheng44f1f092006-04-20 08:56:16 +00007154 for (unsigned i = 0; i != NumElts; ++i) {
Dan Gohman475871a2008-07-27 21:46:04 +00007155 SDValue Elt = RHS.getOperand(i);
Evan Cheng44f1f092006-04-20 08:56:16 +00007156 if (!isa<ConstantSDNode>(Elt))
Dan Gohman475871a2008-07-27 21:46:04 +00007157 return SDValue();
Evan Cheng44f1f092006-04-20 08:56:16 +00007158 else if (cast<ConstantSDNode>(Elt)->isAllOnesValue())
Nate Begeman9008ca62009-04-27 18:41:29 +00007159 Indices.push_back(i);
Evan Cheng44f1f092006-04-20 08:56:16 +00007160 else if (cast<ConstantSDNode>(Elt)->isNullValue())
Nate Begeman9008ca62009-04-27 18:41:29 +00007161 Indices.push_back(NumElts);
Evan Cheng44f1f092006-04-20 08:56:16 +00007162 else
Dan Gohman475871a2008-07-27 21:46:04 +00007163 return SDValue();
Evan Cheng44f1f092006-04-20 08:56:16 +00007164 }
7165
7166 // Let's see if the target supports this vector_shuffle.
Owen Andersone50ed302009-08-10 22:56:29 +00007167 EVT RVT = RHS.getValueType();
Nate Begeman9008ca62009-04-27 18:41:29 +00007168 if (!TLI.isVectorClearMaskLegal(Indices, RVT))
Dan Gohman475871a2008-07-27 21:46:04 +00007169 return SDValue();
Evan Cheng44f1f092006-04-20 08:56:16 +00007170
Dan Gohman7f321562007-06-25 16:23:39 +00007171 // Return the new VECTOR_SHUFFLE node.
Dan Gohman8a55ce42009-09-23 21:02:20 +00007172 EVT EltVT = RVT.getVectorElementType();
Nate Begeman9008ca62009-04-27 18:41:29 +00007173 SmallVector<SDValue,8> ZeroOps(RVT.getVectorNumElements(),
Dan Gohman8a55ce42009-09-23 21:02:20 +00007174 DAG.getConstant(0, EltVT));
Nate Begeman9008ca62009-04-27 18:41:29 +00007175 SDValue Zero = DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(),
7176 RVT, &ZeroOps[0], ZeroOps.size());
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007177 LHS = DAG.getNode(ISD::BITCAST, dl, RVT, LHS);
Nate Begeman9008ca62009-04-27 18:41:29 +00007178 SDValue Shuf = DAG.getVectorShuffle(RVT, dl, LHS, Zero, &Indices[0]);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007179 return DAG.getNode(ISD::BITCAST, dl, VT, Shuf);
Evan Cheng44f1f092006-04-20 08:56:16 +00007180 }
7181 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007182
Dan Gohman475871a2008-07-27 21:46:04 +00007183 return SDValue();
Evan Cheng44f1f092006-04-20 08:56:16 +00007184}
7185
Dan Gohman7f321562007-06-25 16:23:39 +00007186/// SimplifyVBinOp - Visit a binary vector operation, like ADD.
Dan Gohman475871a2008-07-27 21:46:04 +00007187SDValue DAGCombiner::SimplifyVBinOp(SDNode *N) {
Dan Gohman7f321562007-06-25 16:23:39 +00007188 // After legalize, the target may be depending on adds and other
7189 // binary ops to provide legal ways to construct constants or other
7190 // things. Simplifying them may result in a loss of legality.
Duncan Sands25cf2272008-11-24 14:53:14 +00007191 if (LegalOperations) return SDValue();
Dan Gohman7f321562007-06-25 16:23:39 +00007192
Bob Wilsond7273432010-12-17 23:06:49 +00007193 assert(N->getValueType(0).isVector() &&
7194 "SimplifyVBinOp only works on vectors!");
Dan Gohman7f321562007-06-25 16:23:39 +00007195
Dan Gohman475871a2008-07-27 21:46:04 +00007196 SDValue LHS = N->getOperand(0);
7197 SDValue RHS = N->getOperand(1);
7198 SDValue Shuffle = XformToShuffleWithZero(N);
Gabor Greifba36cb52008-08-28 21:40:38 +00007199 if (Shuffle.getNode()) return Shuffle;
Evan Cheng44f1f092006-04-20 08:56:16 +00007200
Dan Gohman7f321562007-06-25 16:23:39 +00007201 // If the LHS and RHS are BUILD_VECTOR nodes, see if we can constant fold
Chris Lattneredab1b92006-04-02 03:25:57 +00007202 // this operation.
Scott Michelfdc40a02009-02-17 22:15:04 +00007203 if (LHS.getOpcode() == ISD::BUILD_VECTOR &&
Dan Gohman7f321562007-06-25 16:23:39 +00007204 RHS.getOpcode() == ISD::BUILD_VECTOR) {
Dan Gohman475871a2008-07-27 21:46:04 +00007205 SmallVector<SDValue, 8> Ops;
Dan Gohman7f321562007-06-25 16:23:39 +00007206 for (unsigned i = 0, e = LHS.getNumOperands(); i != e; ++i) {
Dan Gohman475871a2008-07-27 21:46:04 +00007207 SDValue LHSOp = LHS.getOperand(i);
7208 SDValue RHSOp = RHS.getOperand(i);
Chris Lattneredab1b92006-04-02 03:25:57 +00007209 // If these two elements can't be folded, bail out.
7210 if ((LHSOp.getOpcode() != ISD::UNDEF &&
7211 LHSOp.getOpcode() != ISD::Constant &&
7212 LHSOp.getOpcode() != ISD::ConstantFP) ||
7213 (RHSOp.getOpcode() != ISD::UNDEF &&
7214 RHSOp.getOpcode() != ISD::Constant &&
7215 RHSOp.getOpcode() != ISD::ConstantFP))
7216 break;
Bill Wendling836ca7d2009-01-30 23:59:18 +00007217
Evan Cheng7b336a82006-05-31 06:08:35 +00007218 // Can't fold divide by zero.
Dan Gohman7f321562007-06-25 16:23:39 +00007219 if (N->getOpcode() == ISD::SDIV || N->getOpcode() == ISD::UDIV ||
7220 N->getOpcode() == ISD::FDIV) {
Evan Cheng7b336a82006-05-31 06:08:35 +00007221 if ((RHSOp.getOpcode() == ISD::Constant &&
Gabor Greifba36cb52008-08-28 21:40:38 +00007222 cast<ConstantSDNode>(RHSOp.getNode())->isNullValue()) ||
Evan Cheng7b336a82006-05-31 06:08:35 +00007223 (RHSOp.getOpcode() == ISD::ConstantFP &&
Gabor Greifba36cb52008-08-28 21:40:38 +00007224 cast<ConstantFPSDNode>(RHSOp.getNode())->getValueAPF().isZero()))
Evan Cheng7b336a82006-05-31 06:08:35 +00007225 break;
7226 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007227
Bob Wilsond7273432010-12-17 23:06:49 +00007228 EVT VT = LHSOp.getValueType();
7229 assert(RHSOp.getValueType() == VT &&
7230 "SimplifyVBinOp with different BUILD_VECTOR element types");
7231 SDValue FoldOp = DAG.getNode(N->getOpcode(), LHS.getDebugLoc(), VT,
Evan Chenga0839882010-05-18 00:03:40 +00007232 LHSOp, RHSOp);
7233 if (FoldOp.getOpcode() != ISD::UNDEF &&
7234 FoldOp.getOpcode() != ISD::Constant &&
7235 FoldOp.getOpcode() != ISD::ConstantFP)
7236 break;
7237 Ops.push_back(FoldOp);
7238 AddToWorkList(FoldOp.getNode());
Chris Lattneredab1b92006-04-02 03:25:57 +00007239 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007240
Bob Wilsond7273432010-12-17 23:06:49 +00007241 if (Ops.size() == LHS.getNumOperands())
7242 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(),
7243 LHS.getValueType(), &Ops[0], Ops.size());
Chris Lattneredab1b92006-04-02 03:25:57 +00007244 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007245
Dan Gohman475871a2008-07-27 21:46:04 +00007246 return SDValue();
Chris Lattneredab1b92006-04-02 03:25:57 +00007247}
7248
Bill Wendling836ca7d2009-01-30 23:59:18 +00007249SDValue DAGCombiner::SimplifySelect(DebugLoc DL, SDValue N0,
7250 SDValue N1, SDValue N2){
Nate Begemanf845b452005-10-08 00:29:44 +00007251 assert(N0.getOpcode() ==ISD::SETCC && "First argument must be a SetCC node!");
Scott Michelfdc40a02009-02-17 22:15:04 +00007252
Bill Wendling836ca7d2009-01-30 23:59:18 +00007253 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2,
Nate Begemanf845b452005-10-08 00:29:44 +00007254 cast<CondCodeSDNode>(N0.getOperand(2))->get());
Bill Wendling836ca7d2009-01-30 23:59:18 +00007255
Nate Begemanf845b452005-10-08 00:29:44 +00007256 // If we got a simplified select_cc node back from SimplifySelectCC, then
7257 // break it down into a new SETCC node, and a new SELECT node, and then return
7258 // the SELECT node, since we were called with a SELECT node.
Gabor Greifba36cb52008-08-28 21:40:38 +00007259 if (SCC.getNode()) {
Nate Begemanf845b452005-10-08 00:29:44 +00007260 // Check to see if we got a select_cc back (to turn into setcc/select).
7261 // Otherwise, just return whatever node we got back, like fabs.
7262 if (SCC.getOpcode() == ISD::SELECT_CC) {
Bill Wendling836ca7d2009-01-30 23:59:18 +00007263 SDValue SETCC = DAG.getNode(ISD::SETCC, N0.getDebugLoc(),
7264 N0.getValueType(),
Scott Michelfdc40a02009-02-17 22:15:04 +00007265 SCC.getOperand(0), SCC.getOperand(1),
Bill Wendling836ca7d2009-01-30 23:59:18 +00007266 SCC.getOperand(4));
Gabor Greifba36cb52008-08-28 21:40:38 +00007267 AddToWorkList(SETCC.getNode());
Bill Wendling836ca7d2009-01-30 23:59:18 +00007268 return DAG.getNode(ISD::SELECT, SCC.getDebugLoc(), SCC.getValueType(),
7269 SCC.getOperand(2), SCC.getOperand(3), SETCC);
Nate Begemanf845b452005-10-08 00:29:44 +00007270 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007271
Nate Begemanf845b452005-10-08 00:29:44 +00007272 return SCC;
7273 }
Dan Gohman475871a2008-07-27 21:46:04 +00007274 return SDValue();
Nate Begeman44728a72005-09-19 22:34:01 +00007275}
7276
Chris Lattner40c62d52005-10-18 06:04:22 +00007277/// SimplifySelectOps - Given a SELECT or a SELECT_CC node, where LHS and RHS
7278/// are the two values being selected between, see if we can simplify the
Chris Lattner729c6d12006-05-27 00:43:02 +00007279/// select. Callers of this should assume that TheSelect is deleted if this
7280/// returns true. As such, they should return the appropriate thing (e.g. the
7281/// node) back to the top-level of the DAG combiner loop to avoid it being
7282/// looked at.
Scott Michelfdc40a02009-02-17 22:15:04 +00007283bool DAGCombiner::SimplifySelectOps(SDNode *TheSelect, SDValue LHS,
Dan Gohman475871a2008-07-27 21:46:04 +00007284 SDValue RHS) {
Scott Michelfdc40a02009-02-17 22:15:04 +00007285
Nadav Rotemf94fdb62011-02-11 19:57:47 +00007286 // Cannot simplify select with vector condition
7287 if (TheSelect->getOperand(0).getValueType().isVector()) return false;
7288
Chris Lattner40c62d52005-10-18 06:04:22 +00007289 // If this is a select from two identical things, try to pull the operation
7290 // through the select.
Chris Lattner18061612010-09-21 15:46:59 +00007291 if (LHS.getOpcode() != RHS.getOpcode() ||
7292 !LHS.hasOneUse() || !RHS.hasOneUse())
7293 return false;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007294
Chris Lattner18061612010-09-21 15:46:59 +00007295 // If this is a load and the token chain is identical, replace the select
7296 // of two loads with a load through a select of the address to load from.
7297 // This triggers in things like "select bool X, 10.0, 123.0" after the FP
7298 // constants have been dropped into the constant pool.
7299 if (LHS.getOpcode() == ISD::LOAD) {
7300 LoadSDNode *LLD = cast<LoadSDNode>(LHS);
7301 LoadSDNode *RLD = cast<LoadSDNode>(RHS);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007302
Chris Lattner18061612010-09-21 15:46:59 +00007303 // Token chains must be identical.
7304 if (LHS.getOperand(0) != RHS.getOperand(0) ||
Duncan Sandsd4b9c172008-06-13 19:07:40 +00007305 // Do not let this transformation reduce the number of volatile loads.
Chris Lattner18061612010-09-21 15:46:59 +00007306 LLD->isVolatile() || RLD->isVolatile() ||
7307 // If this is an EXTLOAD, the VT's must match.
7308 LLD->getMemoryVT() != RLD->getMemoryVT() ||
Duncan Sandsdcfd3a72010-11-18 20:05:18 +00007309 // If this is an EXTLOAD, the kind of extension must match.
7310 (LLD->getExtensionType() != RLD->getExtensionType() &&
7311 // The only exception is if one of the extensions is anyext.
7312 LLD->getExtensionType() != ISD::EXTLOAD &&
7313 RLD->getExtensionType() != ISD::EXTLOAD) ||
Dan Gohman75832d72009-10-31 14:14:04 +00007314 // FIXME: this discards src value information. This is
7315 // over-conservative. It would be beneficial to be able to remember
Mon P Wangfe240b12010-01-11 20:12:49 +00007316 // both potential memory locations. Since we are discarding
7317 // src value info, don't do the transformation if the memory
7318 // locations are not in the default address space.
Chris Lattner18061612010-09-21 15:46:59 +00007319 LLD->getPointerInfo().getAddrSpace() != 0 ||
7320 RLD->getPointerInfo().getAddrSpace() != 0)
7321 return false;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007322
Chris Lattnerf1658062010-09-21 15:58:55 +00007323 // Check that the select condition doesn't reach either load. If so,
7324 // folding this will induce a cycle into the DAG. If not, this is safe to
7325 // xform, so create a select of the addresses.
Chris Lattner18061612010-09-21 15:46:59 +00007326 SDValue Addr;
7327 if (TheSelect->getOpcode() == ISD::SELECT) {
Chris Lattnerf1658062010-09-21 15:58:55 +00007328 SDNode *CondNode = TheSelect->getOperand(0).getNode();
7329 if ((LLD->hasAnyUseOfValue(1) && LLD->isPredecessorOf(CondNode)) ||
7330 (RLD->hasAnyUseOfValue(1) && RLD->isPredecessorOf(CondNode)))
7331 return false;
7332 Addr = DAG.getNode(ISD::SELECT, TheSelect->getDebugLoc(),
7333 LLD->getBasePtr().getValueType(),
7334 TheSelect->getOperand(0), LLD->getBasePtr(),
7335 RLD->getBasePtr());
Chris Lattner18061612010-09-21 15:46:59 +00007336 } else { // Otherwise SELECT_CC
Chris Lattnerf1658062010-09-21 15:58:55 +00007337 SDNode *CondLHS = TheSelect->getOperand(0).getNode();
7338 SDNode *CondRHS = TheSelect->getOperand(1).getNode();
7339
7340 if ((LLD->hasAnyUseOfValue(1) &&
7341 (LLD->isPredecessorOf(CondLHS) || LLD->isPredecessorOf(CondRHS))) ||
7342 (LLD->hasAnyUseOfValue(1) &&
7343 (LLD->isPredecessorOf(CondLHS) || LLD->isPredecessorOf(CondRHS))))
7344 return false;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007345
Chris Lattnerf1658062010-09-21 15:58:55 +00007346 Addr = DAG.getNode(ISD::SELECT_CC, TheSelect->getDebugLoc(),
7347 LLD->getBasePtr().getValueType(),
7348 TheSelect->getOperand(0),
7349 TheSelect->getOperand(1),
7350 LLD->getBasePtr(), RLD->getBasePtr(),
7351 TheSelect->getOperand(4));
Chris Lattner18061612010-09-21 15:46:59 +00007352 }
7353
Chris Lattnerf1658062010-09-21 15:58:55 +00007354 SDValue Load;
7355 if (LLD->getExtensionType() == ISD::NON_EXTLOAD) {
7356 Load = DAG.getLoad(TheSelect->getValueType(0),
7357 TheSelect->getDebugLoc(),
7358 // FIXME: Discards pointer info.
7359 LLD->getChain(), Addr, MachinePointerInfo(),
7360 LLD->isVolatile(), LLD->isNonTemporal(),
7361 LLD->getAlignment());
7362 } else {
Duncan Sandsb9064bb2010-11-18 21:16:28 +00007363 Load = DAG.getExtLoad(LLD->getExtensionType() == ISD::EXTLOAD ?
7364 RLD->getExtensionType() : LLD->getExtensionType(),
Chris Lattnerf1658062010-09-21 15:58:55 +00007365 TheSelect->getDebugLoc(),
Stuart Hastingsa9011292011-02-16 16:23:55 +00007366 TheSelect->getValueType(0),
Chris Lattnerf1658062010-09-21 15:58:55 +00007367 // FIXME: Discards pointer info.
7368 LLD->getChain(), Addr, MachinePointerInfo(),
7369 LLD->getMemoryVT(), LLD->isVolatile(),
7370 LLD->isNonTemporal(), LLD->getAlignment());
Chris Lattner40c62d52005-10-18 06:04:22 +00007371 }
Chris Lattnerf1658062010-09-21 15:58:55 +00007372
7373 // Users of the select now use the result of the load.
7374 CombineTo(TheSelect, Load);
7375
7376 // Users of the old loads now use the new load's chain. We know the
7377 // old-load value is dead now.
7378 CombineTo(LHS.getNode(), Load.getValue(0), Load.getValue(1));
7379 CombineTo(RHS.getNode(), Load.getValue(0), Load.getValue(1));
7380 return true;
Chris Lattner40c62d52005-10-18 06:04:22 +00007381 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007382
Chris Lattner40c62d52005-10-18 06:04:22 +00007383 return false;
7384}
7385
Chris Lattner600fec32009-03-11 05:08:08 +00007386/// SimplifySelectCC - Simplify an expression of the form (N0 cond N1) ? N2 : N3
7387/// where 'cond' is the comparison specified by CC.
Scott Michelfdc40a02009-02-17 22:15:04 +00007388SDValue DAGCombiner::SimplifySelectCC(DebugLoc DL, SDValue N0, SDValue N1,
Dan Gohman475871a2008-07-27 21:46:04 +00007389 SDValue N2, SDValue N3,
7390 ISD::CondCode CC, bool NotExtCompare) {
Chris Lattner600fec32009-03-11 05:08:08 +00007391 // (x ? y : y) -> y.
7392 if (N2 == N3) return N2;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007393
Owen Andersone50ed302009-08-10 22:56:29 +00007394 EVT VT = N2.getValueType();
Gabor Greifba36cb52008-08-28 21:40:38 +00007395 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
7396 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode());
7397 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.getNode());
Nate Begemanf845b452005-10-08 00:29:44 +00007398
7399 // Determine if the condition we're dealing with is constant
Duncan Sands5480c042009-01-01 15:52:00 +00007400 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()),
Dale Johannesenff97d4f2009-02-03 00:47:48 +00007401 N0, N1, CC, DL, false);
Gabor Greifba36cb52008-08-28 21:40:38 +00007402 if (SCC.getNode()) AddToWorkList(SCC.getNode());
7403 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode());
Nate Begemanf845b452005-10-08 00:29:44 +00007404
7405 // fold select_cc true, x, y -> x
Dan Gohman002e5d02008-03-13 22:13:53 +00007406 if (SCCC && !SCCC->isNullValue())
Nate Begemanf845b452005-10-08 00:29:44 +00007407 return N2;
7408 // fold select_cc false, x, y -> y
Dan Gohman002e5d02008-03-13 22:13:53 +00007409 if (SCCC && SCCC->isNullValue())
Nate Begemanf845b452005-10-08 00:29:44 +00007410 return N3;
Scott Michelfdc40a02009-02-17 22:15:04 +00007411
Nate Begemanf845b452005-10-08 00:29:44 +00007412 // Check to see if we can simplify the select into an fabs node
7413 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1)) {
7414 // Allow either -0.0 or 0.0
Dale Johannesen87503a62007-08-25 22:10:57 +00007415 if (CFP->getValueAPF().isZero()) {
Nate Begemanf845b452005-10-08 00:29:44 +00007416 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs
7417 if ((CC == ISD::SETGE || CC == ISD::SETGT) &&
7418 N0 == N2 && N3.getOpcode() == ISD::FNEG &&
7419 N2 == N3.getOperand(0))
Bill Wendling836ca7d2009-01-30 23:59:18 +00007420 return DAG.getNode(ISD::FABS, DL, VT, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00007421
Nate Begemanf845b452005-10-08 00:29:44 +00007422 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs
7423 if ((CC == ISD::SETLT || CC == ISD::SETLE) &&
7424 N0 == N3 && N2.getOpcode() == ISD::FNEG &&
7425 N2.getOperand(0) == N3)
Bill Wendling836ca7d2009-01-30 23:59:18 +00007426 return DAG.getNode(ISD::FABS, DL, VT, N3);
Nate Begemanf845b452005-10-08 00:29:44 +00007427 }
7428 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007429
Chris Lattner600fec32009-03-11 05:08:08 +00007430 // Turn "(a cond b) ? 1.0f : 2.0f" into "load (tmp + ((a cond b) ? 0 : 4)"
7431 // where "tmp" is a constant pool entry containing an array with 1.0 and 2.0
7432 // in it. This is a win when the constant is not otherwise available because
7433 // it replaces two constant pool loads with one. We only do this if the FP
7434 // type is known to be legal, because if it isn't, then we are before legalize
7435 // types an we want the other legalization to happen first (e.g. to avoid
Mon P Wang0b7a7862009-03-14 00:25:19 +00007436 // messing with soft float) and if the ConstantFP is not legal, because if
7437 // it is legal, we may not need to store the FP constant in a constant pool.
Chris Lattner600fec32009-03-11 05:08:08 +00007438 if (ConstantFPSDNode *TV = dyn_cast<ConstantFPSDNode>(N2))
7439 if (ConstantFPSDNode *FV = dyn_cast<ConstantFPSDNode>(N3)) {
7440 if (TLI.isTypeLegal(N2.getValueType()) &&
Mon P Wang0b7a7862009-03-14 00:25:19 +00007441 (TLI.getOperationAction(ISD::ConstantFP, N2.getValueType()) !=
7442 TargetLowering::Legal) &&
Chris Lattner600fec32009-03-11 05:08:08 +00007443 // If both constants have multiple uses, then we won't need to do an
7444 // extra load, they are likely around in registers for other users.
7445 (TV->hasOneUse() || FV->hasOneUse())) {
7446 Constant *Elts[] = {
7447 const_cast<ConstantFP*>(FV->getConstantFPValue()),
7448 const_cast<ConstantFP*>(TV->getConstantFPValue())
7449 };
Chris Lattnerdb125cf2011-07-18 04:54:35 +00007450 Type *FPTy = Elts[0]->getType();
Chris Lattner600fec32009-03-11 05:08:08 +00007451 const TargetData &TD = *TLI.getTargetData();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007452
Chris Lattner600fec32009-03-11 05:08:08 +00007453 // Create a ConstantArray of the two constants.
Jay Foad26701082011-06-22 09:24:39 +00007454 Constant *CA = ConstantArray::get(ArrayType::get(FPTy, 2), Elts);
Chris Lattner600fec32009-03-11 05:08:08 +00007455 SDValue CPIdx = DAG.getConstantPool(CA, TLI.getPointerTy(),
7456 TD.getPrefTypeAlignment(FPTy));
Evan Cheng1606e8e2009-03-13 07:51:59 +00007457 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
Chris Lattner600fec32009-03-11 05:08:08 +00007458
7459 // Get the offsets to the 0 and 1 element of the array so that we can
7460 // select between them.
7461 SDValue Zero = DAG.getIntPtrConstant(0);
Duncan Sands777d2302009-05-09 07:06:46 +00007462 unsigned EltSize = (unsigned)TD.getTypeAllocSize(Elts[0]->getType());
Chris Lattner600fec32009-03-11 05:08:08 +00007463 SDValue One = DAG.getIntPtrConstant(EltSize);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007464
Chris Lattner600fec32009-03-11 05:08:08 +00007465 SDValue Cond = DAG.getSetCC(DL,
7466 TLI.getSetCCResultType(N0.getValueType()),
7467 N0, N1, CC);
7468 SDValue CstOffset = DAG.getNode(ISD::SELECT, DL, Zero.getValueType(),
7469 Cond, One, Zero);
7470 CPIdx = DAG.getNode(ISD::ADD, DL, TLI.getPointerTy(), CPIdx,
7471 CstOffset);
7472 return DAG.getLoad(TV->getValueType(0), DL, DAG.getEntryNode(), CPIdx,
Chris Lattner85ca1062010-09-21 07:32:19 +00007473 MachinePointerInfo::getConstantPool(), false,
David Greene1e559442010-02-15 17:00:31 +00007474 false, Alignment);
Chris Lattner600fec32009-03-11 05:08:08 +00007475
7476 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007477 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007478
Nate Begemanf845b452005-10-08 00:29:44 +00007479 // Check to see if we can perform the "gzip trick", transforming
Bill Wendling836ca7d2009-01-30 23:59:18 +00007480 // (select_cc setlt X, 0, A, 0) -> (and (sra X, (sub size(X), 1), A)
Chris Lattnere3152e52006-09-20 06:41:35 +00007481 if (N1C && N3C && N3C->isNullValue() && CC == ISD::SETLT &&
Duncan Sands83ec4b62008-06-06 12:08:01 +00007482 N0.getValueType().isInteger() &&
7483 N2.getValueType().isInteger() &&
Dan Gohman002e5d02008-03-13 22:13:53 +00007484 (N1C->isNullValue() || // (a < 0) ? b : 0
7485 (N1C->getAPIntValue() == 1 && N0 == N2))) { // (a < 1) ? a : 0
Owen Andersone50ed302009-08-10 22:56:29 +00007486 EVT XType = N0.getValueType();
7487 EVT AType = N2.getValueType();
Duncan Sands8e4eb092008-06-08 20:54:56 +00007488 if (XType.bitsGE(AType)) {
Nate Begemanf845b452005-10-08 00:29:44 +00007489 // and (sra X, size(X)-1, A) -> "and (srl X, C2), A" iff A is a
Nate Begeman07ed4172005-10-10 21:26:48 +00007490 // single-bit constant.
Dan Gohman002e5d02008-03-13 22:13:53 +00007491 if (N2C && ((N2C->getAPIntValue() & (N2C->getAPIntValue()-1)) == 0)) {
7492 unsigned ShCtV = N2C->getAPIntValue().logBase2();
Duncan Sands83ec4b62008-06-06 12:08:01 +00007493 ShCtV = XType.getSizeInBits()-ShCtV-1;
Owen Anderson95771af2011-02-25 21:41:48 +00007494 SDValue ShCt = DAG.getConstant(ShCtV,
7495 getShiftAmountTy(N0.getValueType()));
Bill Wendling9729c5a2009-01-31 03:12:48 +00007496 SDValue Shift = DAG.getNode(ISD::SRL, N0.getDebugLoc(),
Bill Wendling836ca7d2009-01-30 23:59:18 +00007497 XType, N0, ShCt);
Gabor Greifba36cb52008-08-28 21:40:38 +00007498 AddToWorkList(Shift.getNode());
Bill Wendling836ca7d2009-01-30 23:59:18 +00007499
Duncan Sands8e4eb092008-06-08 20:54:56 +00007500 if (XType.bitsGT(AType)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00007501 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift);
Gabor Greifba36cb52008-08-28 21:40:38 +00007502 AddToWorkList(Shift.getNode());
Nate Begemanf845b452005-10-08 00:29:44 +00007503 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007504
7505 return DAG.getNode(ISD::AND, DL, AType, Shift, N2);
Nate Begemanf845b452005-10-08 00:29:44 +00007506 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007507
Bill Wendling9729c5a2009-01-31 03:12:48 +00007508 SDValue Shift = DAG.getNode(ISD::SRA, N0.getDebugLoc(),
Bill Wendling836ca7d2009-01-30 23:59:18 +00007509 XType, N0,
7510 DAG.getConstant(XType.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +00007511 getShiftAmountTy(N0.getValueType())));
Gabor Greifba36cb52008-08-28 21:40:38 +00007512 AddToWorkList(Shift.getNode());
Bill Wendling836ca7d2009-01-30 23:59:18 +00007513
Duncan Sands8e4eb092008-06-08 20:54:56 +00007514 if (XType.bitsGT(AType)) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00007515 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift);
Gabor Greifba36cb52008-08-28 21:40:38 +00007516 AddToWorkList(Shift.getNode());
Nate Begemanf845b452005-10-08 00:29:44 +00007517 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007518
7519 return DAG.getNode(ISD::AND, DL, AType, Shift, N2);
Nate Begemanf845b452005-10-08 00:29:44 +00007520 }
7521 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007522
Owen Andersoned1088a2010-09-22 22:58:22 +00007523 // fold (select_cc seteq (and x, y), 0, 0, A) -> (and (shr (shl x)) A)
7524 // where y is has a single bit set.
7525 // A plaintext description would be, we can turn the SELECT_CC into an AND
7526 // when the condition can be materialized as an all-ones register. Any
7527 // single bit-test can be materialized as an all-ones register with
7528 // shift-left and shift-right-arith.
7529 if (CC == ISD::SETEQ && N0->getOpcode() == ISD::AND &&
7530 N0->getValueType(0) == VT &&
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007531 N1C && N1C->isNullValue() &&
Owen Andersoned1088a2010-09-22 22:58:22 +00007532 N2C && N2C->isNullValue()) {
7533 SDValue AndLHS = N0->getOperand(0);
7534 ConstantSDNode *ConstAndRHS = dyn_cast<ConstantSDNode>(N0->getOperand(1));
7535 if (ConstAndRHS && ConstAndRHS->getAPIntValue().countPopulation() == 1) {
7536 // Shift the tested bit over the sign bit.
7537 APInt AndMask = ConstAndRHS->getAPIntValue();
7538 SDValue ShlAmt =
Owen Anderson95771af2011-02-25 21:41:48 +00007539 DAG.getConstant(AndMask.countLeadingZeros(),
7540 getShiftAmountTy(AndLHS.getValueType()));
Owen Andersoned1088a2010-09-22 22:58:22 +00007541 SDValue Shl = DAG.getNode(ISD::SHL, N0.getDebugLoc(), VT, AndLHS, ShlAmt);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007542
Owen Andersoned1088a2010-09-22 22:58:22 +00007543 // Now arithmetic right shift it all the way over, so the result is either
7544 // all-ones, or zero.
7545 SDValue ShrAmt =
Owen Anderson95771af2011-02-25 21:41:48 +00007546 DAG.getConstant(AndMask.getBitWidth()-1,
7547 getShiftAmountTy(Shl.getValueType()));
Owen Andersoned1088a2010-09-22 22:58:22 +00007548 SDValue Shr = DAG.getNode(ISD::SRA, N0.getDebugLoc(), VT, Shl, ShrAmt);
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007549
Owen Andersoned1088a2010-09-22 22:58:22 +00007550 return DAG.getNode(ISD::AND, DL, VT, Shr, N3);
7551 }
7552 }
7553
Nate Begeman07ed4172005-10-10 21:26:48 +00007554 // fold select C, 16, 0 -> shl C, 4
Dan Gohman002e5d02008-03-13 22:13:53 +00007555 if (N2C && N3C && N3C->isNullValue() && N2C->getAPIntValue().isPowerOf2() &&
Duncan Sands03228082008-11-23 15:47:28 +00007556 TLI.getBooleanContents() == TargetLowering::ZeroOrOneBooleanContent) {
Scott Michelfdc40a02009-02-17 22:15:04 +00007557
Chris Lattner1eba01e2007-04-11 06:50:51 +00007558 // If the caller doesn't want us to simplify this into a zext of a compare,
7559 // don't do it.
Dan Gohman002e5d02008-03-13 22:13:53 +00007560 if (NotExtCompare && N2C->getAPIntValue() == 1)
Dan Gohman475871a2008-07-27 21:46:04 +00007561 return SDValue();
Scott Michelfdc40a02009-02-17 22:15:04 +00007562
Nate Begeman07ed4172005-10-10 21:26:48 +00007563 // Get a SetCC of the condition
7564 // FIXME: Should probably make sure that setcc is legal if we ever have a
7565 // target where it isn't.
Dan Gohman475871a2008-07-27 21:46:04 +00007566 SDValue Temp, SCC;
Nate Begeman07ed4172005-10-10 21:26:48 +00007567 // cast from setcc result type to select result type
Duncan Sands25cf2272008-11-24 14:53:14 +00007568 if (LegalTypes) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00007569 SCC = DAG.getSetCC(DL, TLI.getSetCCResultType(N0.getValueType()),
Duncan Sands5480c042009-01-01 15:52:00 +00007570 N0, N1, CC);
Duncan Sands8e4eb092008-06-08 20:54:56 +00007571 if (N2.getValueType().bitsLT(SCC.getValueType()))
Bill Wendling9729c5a2009-01-31 03:12:48 +00007572 Temp = DAG.getZeroExtendInReg(SCC, N2.getDebugLoc(), N2.getValueType());
Chris Lattner555d8d62006-12-07 22:36:47 +00007573 else
Bill Wendling9729c5a2009-01-31 03:12:48 +00007574 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getDebugLoc(),
Bill Wendling836ca7d2009-01-30 23:59:18 +00007575 N2.getValueType(), SCC);
Nate Begemanb0d04a72006-02-18 02:40:58 +00007576 } else {
Owen Anderson825b72b2009-08-11 20:47:22 +00007577 SCC = DAG.getSetCC(N0.getDebugLoc(), MVT::i1, N0, N1, CC);
Bill Wendling9729c5a2009-01-31 03:12:48 +00007578 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getDebugLoc(),
Bill Wendling836ca7d2009-01-30 23:59:18 +00007579 N2.getValueType(), SCC);
Nate Begemanb0d04a72006-02-18 02:40:58 +00007580 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007581
Gabor Greifba36cb52008-08-28 21:40:38 +00007582 AddToWorkList(SCC.getNode());
7583 AddToWorkList(Temp.getNode());
Scott Michelfdc40a02009-02-17 22:15:04 +00007584
Dan Gohman002e5d02008-03-13 22:13:53 +00007585 if (N2C->getAPIntValue() == 1)
Chris Lattnerc56a81d2007-04-11 06:43:25 +00007586 return Temp;
Bill Wendling836ca7d2009-01-30 23:59:18 +00007587
Nate Begeman07ed4172005-10-10 21:26:48 +00007588 // shl setcc result by log2 n2c
Bill Wendling836ca7d2009-01-30 23:59:18 +00007589 return DAG.getNode(ISD::SHL, DL, N2.getValueType(), Temp,
Dan Gohman002e5d02008-03-13 22:13:53 +00007590 DAG.getConstant(N2C->getAPIntValue().logBase2(),
Owen Anderson95771af2011-02-25 21:41:48 +00007591 getShiftAmountTy(Temp.getValueType())));
Nate Begeman07ed4172005-10-10 21:26:48 +00007592 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007593
Nate Begemanf845b452005-10-08 00:29:44 +00007594 // Check to see if this is the equivalent of setcc
7595 // FIXME: Turn all of these into setcc if setcc if setcc is legal
7596 // otherwise, go ahead with the folds.
Dan Gohman002e5d02008-03-13 22:13:53 +00007597 if (0 && N3C && N3C->isNullValue() && N2C && (N2C->getAPIntValue() == 1ULL)) {
Owen Andersone50ed302009-08-10 22:56:29 +00007598 EVT XType = N0.getValueType();
Duncan Sands25cf2272008-11-24 14:53:14 +00007599 if (!LegalOperations ||
Duncan Sands5480c042009-01-01 15:52:00 +00007600 TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultType(XType))) {
Bill Wendling836ca7d2009-01-30 23:59:18 +00007601 SDValue Res = DAG.getSetCC(DL, TLI.getSetCCResultType(XType), N0, N1, CC);
Nate Begemanf845b452005-10-08 00:29:44 +00007602 if (Res.getValueType() != VT)
Bill Wendling836ca7d2009-01-30 23:59:18 +00007603 Res = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, Res);
Nate Begemanf845b452005-10-08 00:29:44 +00007604 return Res;
7605 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007606
Bill Wendling836ca7d2009-01-30 23:59:18 +00007607 // fold (seteq X, 0) -> (srl (ctlz X, log2(size(X))))
Scott Michelfdc40a02009-02-17 22:15:04 +00007608 if (N1C && N1C->isNullValue() && CC == ISD::SETEQ &&
Duncan Sands25cf2272008-11-24 14:53:14 +00007609 (!LegalOperations ||
Duncan Sands184a8762008-06-14 17:48:34 +00007610 TLI.isOperationLegal(ISD::CTLZ, XType))) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00007611 SDValue Ctlz = DAG.getNode(ISD::CTLZ, N0.getDebugLoc(), XType, N0);
Scott Michelfdc40a02009-02-17 22:15:04 +00007612 return DAG.getNode(ISD::SRL, DL, XType, Ctlz,
Duncan Sands83ec4b62008-06-06 12:08:01 +00007613 DAG.getConstant(Log2_32(XType.getSizeInBits()),
Owen Anderson95771af2011-02-25 21:41:48 +00007614 getShiftAmountTy(Ctlz.getValueType())));
Nate Begemanf845b452005-10-08 00:29:44 +00007615 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007616 // fold (setgt X, 0) -> (srl (and (-X, ~X), size(X)-1))
Scott Michelfdc40a02009-02-17 22:15:04 +00007617 if (N1C && N1C->isNullValue() && CC == ISD::SETGT) {
Bill Wendling836ca7d2009-01-30 23:59:18 +00007618 SDValue NegN0 = DAG.getNode(ISD::SUB, N0.getDebugLoc(),
7619 XType, DAG.getConstant(0, XType), N0);
Bill Wendling7581bfa2009-01-30 23:03:19 +00007620 SDValue NotN0 = DAG.getNOT(N0.getDebugLoc(), N0, XType);
Bill Wendling836ca7d2009-01-30 23:59:18 +00007621 return DAG.getNode(ISD::SRL, DL, XType,
Bill Wendlingfc4b6772009-02-01 11:19:36 +00007622 DAG.getNode(ISD::AND, DL, XType, NegN0, NotN0),
Duncan Sands83ec4b62008-06-06 12:08:01 +00007623 DAG.getConstant(XType.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +00007624 getShiftAmountTy(XType)));
Nate Begemanf845b452005-10-08 00:29:44 +00007625 }
Bill Wendling836ca7d2009-01-30 23:59:18 +00007626 // fold (setgt X, -1) -> (xor (srl (X, size(X)-1), 1))
Nate Begemanf845b452005-10-08 00:29:44 +00007627 if (N1C && N1C->isAllOnesValue() && CC == ISD::SETGT) {
Bill Wendling9729c5a2009-01-31 03:12:48 +00007628 SDValue Sign = DAG.getNode(ISD::SRL, N0.getDebugLoc(), XType, N0,
Bill Wendling836ca7d2009-01-30 23:59:18 +00007629 DAG.getConstant(XType.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +00007630 getShiftAmountTy(N0.getValueType())));
Bill Wendling836ca7d2009-01-30 23:59:18 +00007631 return DAG.getNode(ISD::XOR, DL, XType, Sign, DAG.getConstant(1, XType));
Nate Begemanf845b452005-10-08 00:29:44 +00007632 }
7633 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007634
Benjamin Kramercde51102010-07-08 12:09:56 +00007635 // Check to see if this is an integer abs.
7636 // select_cc setg[te] X, 0, X, -X ->
7637 // select_cc setgt X, -1, X, -X ->
7638 // select_cc setl[te] X, 0, -X, X ->
7639 // select_cc setlt X, 1, -X, X ->
Nate Begemanf845b452005-10-08 00:29:44 +00007640 // Y = sra (X, size(X)-1); xor (add (X, Y), Y)
Benjamin Kramercde51102010-07-08 12:09:56 +00007641 if (N1C) {
7642 ConstantSDNode *SubC = NULL;
7643 if (((N1C->isNullValue() && (CC == ISD::SETGT || CC == ISD::SETGE)) ||
7644 (N1C->isAllOnesValue() && CC == ISD::SETGT)) &&
7645 N0 == N2 && N3.getOpcode() == ISD::SUB && N0 == N3.getOperand(1))
7646 SubC = dyn_cast<ConstantSDNode>(N3.getOperand(0));
7647 else if (((N1C->isNullValue() && (CC == ISD::SETLT || CC == ISD::SETLE)) ||
7648 (N1C->isOne() && CC == ISD::SETLT)) &&
7649 N0 == N3 && N2.getOpcode() == ISD::SUB && N0 == N2.getOperand(1))
7650 SubC = dyn_cast<ConstantSDNode>(N2.getOperand(0));
7651
Owen Andersone50ed302009-08-10 22:56:29 +00007652 EVT XType = N0.getValueType();
Benjamin Kramercde51102010-07-08 12:09:56 +00007653 if (SubC && SubC->isNullValue() && XType.isInteger()) {
7654 SDValue Shift = DAG.getNode(ISD::SRA, N0.getDebugLoc(), XType,
7655 N0,
7656 DAG.getConstant(XType.getSizeInBits()-1,
Owen Anderson95771af2011-02-25 21:41:48 +00007657 getShiftAmountTy(N0.getValueType())));
Benjamin Kramercde51102010-07-08 12:09:56 +00007658 SDValue Add = DAG.getNode(ISD::ADD, N0.getDebugLoc(),
7659 XType, N0, Shift);
7660 AddToWorkList(Shift.getNode());
7661 AddToWorkList(Add.getNode());
7662 return DAG.getNode(ISD::XOR, DL, XType, Add, Shift);
Nate Begemanf845b452005-10-08 00:29:44 +00007663 }
7664 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007665
Dan Gohman475871a2008-07-27 21:46:04 +00007666 return SDValue();
Nate Begeman44728a72005-09-19 22:34:01 +00007667}
7668
Evan Chengfa1eb272007-02-08 22:13:59 +00007669/// SimplifySetCC - This is a stub for TargetLowering::SimplifySetCC.
Owen Andersone50ed302009-08-10 22:56:29 +00007670SDValue DAGCombiner::SimplifySetCC(EVT VT, SDValue N0,
Dan Gohman475871a2008-07-27 21:46:04 +00007671 SDValue N1, ISD::CondCode Cond,
Dale Johannesenff97d4f2009-02-03 00:47:48 +00007672 DebugLoc DL, bool foldBooleans) {
Scott Michelfdc40a02009-02-17 22:15:04 +00007673 TargetLowering::DAGCombinerInfo
Jakob Stoklund Olesen78d12642009-07-24 18:22:59 +00007674 DagCombineInfo(DAG, !LegalTypes, !LegalOperations, false, this);
Dale Johannesenff97d4f2009-02-03 00:47:48 +00007675 return TLI.SimplifySetCC(VT, N0, N1, Cond, foldBooleans, DagCombineInfo, DL);
Nate Begeman452d7beb2005-09-16 00:54:12 +00007676}
7677
Nate Begeman69575232005-10-20 02:15:44 +00007678/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
7679/// return a DAG expression to select that will generate the same value by
7680/// multiplying by a magic number. See:
7681/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Dan Gohman475871a2008-07-27 21:46:04 +00007682SDValue DAGCombiner::BuildSDIV(SDNode *N) {
Andrew Lenharth232c9102006-06-12 16:07:18 +00007683 std::vector<SDNode*> Built;
Dan Gohman475871a2008-07-27 21:46:04 +00007684 SDValue S = TLI.BuildSDIV(N, DAG, &Built);
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +00007685
Andrew Lenharth232c9102006-06-12 16:07:18 +00007686 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end();
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +00007687 ii != ee; ++ii)
7688 AddToWorkList(*ii);
7689 return S;
Nate Begeman69575232005-10-20 02:15:44 +00007690}
7691
7692/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
7693/// return a DAG expression to select that will generate the same value by
7694/// multiplying by a magic number. See:
7695/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
Dan Gohman475871a2008-07-27 21:46:04 +00007696SDValue DAGCombiner::BuildUDIV(SDNode *N) {
Andrew Lenharth232c9102006-06-12 16:07:18 +00007697 std::vector<SDNode*> Built;
Dan Gohman475871a2008-07-27 21:46:04 +00007698 SDValue S = TLI.BuildUDIV(N, DAG, &Built);
Nate Begeman69575232005-10-20 02:15:44 +00007699
Andrew Lenharth232c9102006-06-12 16:07:18 +00007700 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end();
Andrew Lenharthdae9cbe2006-05-16 17:42:15 +00007701 ii != ee; ++ii)
7702 AddToWorkList(*ii);
7703 return S;
Nate Begeman69575232005-10-20 02:15:44 +00007704}
7705
Nate Begemancc66cdd2009-09-25 06:05:26 +00007706/// FindBaseOffset - Return true if base is a frame index, which is known not
Eric Christopher503a64d2010-12-09 04:48:06 +00007707// to alias with anything but itself. Provides base object and offset as
7708// results.
Nate Begemancc66cdd2009-09-25 06:05:26 +00007709static bool FindBaseOffset(SDValue Ptr, SDValue &Base, int64_t &Offset,
Dan Gohman46510a72010-04-15 01:51:59 +00007710 const GlobalValue *&GV, void *&CV) {
Jim Laskey71382342006-10-07 23:37:56 +00007711 // Assume it is a primitive operation.
Nate Begemancc66cdd2009-09-25 06:05:26 +00007712 Base = Ptr; Offset = 0; GV = 0; CV = 0;
Scott Michelfdc40a02009-02-17 22:15:04 +00007713
Jim Laskey71382342006-10-07 23:37:56 +00007714 // If it's an adding a simple constant then integrate the offset.
7715 if (Base.getOpcode() == ISD::ADD) {
7716 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Base.getOperand(1))) {
7717 Base = Base.getOperand(0);
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00007718 Offset += C->getZExtValue();
Jim Laskey71382342006-10-07 23:37:56 +00007719 }
7720 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007721
Nate Begemancc66cdd2009-09-25 06:05:26 +00007722 // Return the underlying GlobalValue, and update the Offset. Return false
7723 // for GlobalAddressSDNode since the same GlobalAddress may be represented
7724 // by multiple nodes with different offsets.
7725 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Base)) {
7726 GV = G->getGlobal();
7727 Offset += G->getOffset();
7728 return false;
7729 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007730
Nate Begemancc66cdd2009-09-25 06:05:26 +00007731 // Return the underlying Constant value, and update the Offset. Return false
7732 // for ConstantSDNodes since the same constant pool entry may be represented
7733 // by multiple nodes with different offsets.
7734 if (ConstantPoolSDNode *C = dyn_cast<ConstantPoolSDNode>(Base)) {
7735 CV = C->isMachineConstantPoolEntry() ? (void *)C->getMachineCPVal()
7736 : (void *)C->getConstVal();
7737 Offset += C->getOffset();
7738 return false;
7739 }
Jim Laskey71382342006-10-07 23:37:56 +00007740 // If it's any of the following then it can't alias with anything but itself.
Nate Begemancc66cdd2009-09-25 06:05:26 +00007741 return isa<FrameIndexSDNode>(Base);
Jim Laskey71382342006-10-07 23:37:56 +00007742}
7743
7744/// isAlias - Return true if there is any possibility that the two addresses
7745/// overlap.
Dan Gohman475871a2008-07-27 21:46:04 +00007746bool DAGCombiner::isAlias(SDValue Ptr1, int64_t Size1,
Jim Laskey096c22e2006-10-18 12:29:57 +00007747 const Value *SrcValue1, int SrcValueOffset1,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007748 unsigned SrcValueAlign1,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007749 const MDNode *TBAAInfo1,
Dan Gohman475871a2008-07-27 21:46:04 +00007750 SDValue Ptr2, int64_t Size2,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007751 const Value *SrcValue2, int SrcValueOffset2,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007752 unsigned SrcValueAlign2,
7753 const MDNode *TBAAInfo2) const {
Jim Laskey71382342006-10-07 23:37:56 +00007754 // If they are the same then they must be aliases.
7755 if (Ptr1 == Ptr2) return true;
Scott Michelfdc40a02009-02-17 22:15:04 +00007756
Jim Laskey71382342006-10-07 23:37:56 +00007757 // Gather base node and offset information.
Dan Gohman475871a2008-07-27 21:46:04 +00007758 SDValue Base1, Base2;
Jim Laskey71382342006-10-07 23:37:56 +00007759 int64_t Offset1, Offset2;
Dan Gohman46510a72010-04-15 01:51:59 +00007760 const GlobalValue *GV1, *GV2;
Nate Begemancc66cdd2009-09-25 06:05:26 +00007761 void *CV1, *CV2;
7762 bool isFrameIndex1 = FindBaseOffset(Ptr1, Base1, Offset1, GV1, CV1);
7763 bool isFrameIndex2 = FindBaseOffset(Ptr2, Base2, Offset2, GV2, CV2);
Scott Michelfdc40a02009-02-17 22:15:04 +00007764
Nate Begemancc66cdd2009-09-25 06:05:26 +00007765 // If they have a same base address then check to see if they overlap.
7766 if (Base1 == Base2 || (GV1 && (GV1 == GV2)) || (CV1 && (CV1 == CV2)))
Bill Wendling836ca7d2009-01-30 23:59:18 +00007767 return !((Offset1 + Size1) <= Offset2 || (Offset2 + Size2) <= Offset1);
Scott Michelfdc40a02009-02-17 22:15:04 +00007768
Owen Anderson4a9f1502010-09-20 20:39:59 +00007769 // It is possible for different frame indices to alias each other, mostly
7770 // when tail call optimization reuses return address slots for arguments.
7771 // To catch this case, look up the actual index of frame indices to compute
7772 // the real alias relationship.
7773 if (isFrameIndex1 && isFrameIndex2) {
7774 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
7775 Offset1 += MFI->getObjectOffset(cast<FrameIndexSDNode>(Base1)->getIndex());
7776 Offset2 += MFI->getObjectOffset(cast<FrameIndexSDNode>(Base2)->getIndex());
7777 return !((Offset1 + Size1) <= Offset2 || (Offset2 + Size2) <= Offset1);
7778 }
7779
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007780 // Otherwise, if we know what the bases are, and they aren't identical, then
Owen Anderson4a9f1502010-09-20 20:39:59 +00007781 // we know they cannot alias.
Nate Begemancc66cdd2009-09-25 06:05:26 +00007782 if ((isFrameIndex1 || CV1 || GV1) && (isFrameIndex2 || CV2 || GV2))
7783 return false;
Jim Laskey096c22e2006-10-18 12:29:57 +00007784
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007785 // If we know required SrcValue1 and SrcValue2 have relatively large alignment
7786 // compared to the size and offset of the access, we may be able to prove they
7787 // do not alias. This check is conservative for now to catch cases created by
7788 // splitting vector types.
7789 if ((SrcValueAlign1 == SrcValueAlign2) &&
7790 (SrcValueOffset1 != SrcValueOffset2) &&
7791 (Size1 == Size2) && (SrcValueAlign1 > Size1)) {
7792 int64_t OffAlign1 = SrcValueOffset1 % SrcValueAlign1;
7793 int64_t OffAlign2 = SrcValueOffset2 % SrcValueAlign1;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007794
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007795 // There is no overlap between these relatively aligned accesses of similar
7796 // size, return no alias.
7797 if ((OffAlign1 + Size1) <= OffAlign2 || (OffAlign2 + Size2) <= OffAlign1)
7798 return false;
7799 }
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007800
Jim Laskey07a27092006-10-18 19:08:31 +00007801 if (CombinerGlobalAA) {
7802 // Use alias analysis information.
Dan Gohmane9c8fa02007-08-27 16:32:11 +00007803 int64_t MinOffset = std::min(SrcValueOffset1, SrcValueOffset2);
7804 int64_t Overlap1 = Size1 + SrcValueOffset1 - MinOffset;
7805 int64_t Overlap2 = Size2 + SrcValueOffset2 - MinOffset;
Scott Michelfdc40a02009-02-17 22:15:04 +00007806 AliasAnalysis::AliasResult AAResult =
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007807 AA.alias(AliasAnalysis::Location(SrcValue1, Overlap1, TBAAInfo1),
7808 AliasAnalysis::Location(SrcValue2, Overlap2, TBAAInfo2));
Jim Laskey07a27092006-10-18 19:08:31 +00007809 if (AAResult == AliasAnalysis::NoAlias)
7810 return false;
7811 }
Jim Laskey096c22e2006-10-18 12:29:57 +00007812
7813 // Otherwise we have to assume they alias.
7814 return true;
Jim Laskey71382342006-10-07 23:37:56 +00007815}
7816
7817/// FindAliasInfo - Extracts the relevant alias information from the memory
7818/// node. Returns true if the operand was a load.
Jim Laskey7ca56af2006-10-11 13:47:09 +00007819bool DAGCombiner::FindAliasInfo(SDNode *N,
Dan Gohman475871a2008-07-27 21:46:04 +00007820 SDValue &Ptr, int64_t &Size,
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007821 const Value *&SrcValue,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007822 int &SrcValueOffset,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007823 unsigned &SrcValueAlign,
7824 const MDNode *&TBAAInfo) const {
Jim Laskey7ca56af2006-10-11 13:47:09 +00007825 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
7826 Ptr = LD->getBasePtr();
Duncan Sands83ec4b62008-06-06 12:08:01 +00007827 Size = LD->getMemoryVT().getSizeInBits() >> 3;
Jim Laskey7ca56af2006-10-11 13:47:09 +00007828 SrcValue = LD->getSrcValue();
Jim Laskey096c22e2006-10-18 12:29:57 +00007829 SrcValueOffset = LD->getSrcValueOffset();
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007830 SrcValueAlign = LD->getOriginalAlignment();
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007831 TBAAInfo = LD->getTBAAInfo();
Jim Laskey71382342006-10-07 23:37:56 +00007832 return true;
Dan Gohman71dc7c92011-05-17 22:20:36 +00007833 }
7834 if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
Jim Laskey7ca56af2006-10-11 13:47:09 +00007835 Ptr = ST->getBasePtr();
Duncan Sands83ec4b62008-06-06 12:08:01 +00007836 Size = ST->getMemoryVT().getSizeInBits() >> 3;
Jim Laskey7ca56af2006-10-11 13:47:09 +00007837 SrcValue = ST->getSrcValue();
Jim Laskey096c22e2006-10-18 12:29:57 +00007838 SrcValueOffset = ST->getSrcValueOffset();
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007839 SrcValueAlign = ST->getOriginalAlignment();
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007840 TBAAInfo = ST->getTBAAInfo();
Dan Gohman71dc7c92011-05-17 22:20:36 +00007841 return false;
Jim Laskey71382342006-10-07 23:37:56 +00007842 }
Dan Gohman71dc7c92011-05-17 22:20:36 +00007843 llvm_unreachable("FindAliasInfo expected a memory operand");
Jim Laskey71382342006-10-07 23:37:56 +00007844}
7845
Jim Laskey6ff23e52006-10-04 16:53:27 +00007846/// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes,
7847/// looking for aliasing nodes and adding them to the Aliases vector.
Dan Gohman475871a2008-07-27 21:46:04 +00007848void DAGCombiner::GatherAllAliases(SDNode *N, SDValue OriginalChain,
7849 SmallVector<SDValue, 8> &Aliases) {
7850 SmallVector<SDValue, 8> Chains; // List of chains to visit.
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007851 SmallPtrSet<SDNode *, 16> Visited; // Visited node set.
Scott Michelfdc40a02009-02-17 22:15:04 +00007852
Jim Laskey279f0532006-09-25 16:29:54 +00007853 // Get alias information for node.
Dan Gohman475871a2008-07-27 21:46:04 +00007854 SDValue Ptr;
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007855 int64_t Size;
7856 const Value *SrcValue;
7857 int SrcValueOffset;
7858 unsigned SrcValueAlign;
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007859 const MDNode *SrcTBAAInfo;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007860 bool IsLoad = FindAliasInfo(N, Ptr, Size, SrcValue, SrcValueOffset,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007861 SrcValueAlign, SrcTBAAInfo);
Jim Laskey279f0532006-09-25 16:29:54 +00007862
Jim Laskey6ff23e52006-10-04 16:53:27 +00007863 // Starting off.
Jim Laskeybc588b82006-10-05 15:07:25 +00007864 Chains.push_back(OriginalChain);
Nate Begeman677c89d2009-10-12 05:53:58 +00007865 unsigned Depth = 0;
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007866
Jim Laskeybc588b82006-10-05 15:07:25 +00007867 // Look at each chain and determine if it is an alias. If so, add it to the
7868 // aliases list. If not, then continue up the chain looking for the next
Scott Michelfdc40a02009-02-17 22:15:04 +00007869 // candidate.
Jim Laskeybc588b82006-10-05 15:07:25 +00007870 while (!Chains.empty()) {
Dan Gohman475871a2008-07-27 21:46:04 +00007871 SDValue Chain = Chains.back();
Jim Laskeybc588b82006-10-05 15:07:25 +00007872 Chains.pop_back();
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007873
7874 // For TokenFactor nodes, look at each operand and only continue up the
7875 // chain until we find two aliases. If we've seen two aliases, assume we'll
Nate Begeman677c89d2009-10-12 05:53:58 +00007876 // find more and revert to original chain since the xform is unlikely to be
7877 // profitable.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007878 //
7879 // FIXME: The depth check could be made to return the last non-aliasing
Nate Begeman677c89d2009-10-12 05:53:58 +00007880 // chain we found before we hit a tokenfactor rather than the original
7881 // chain.
7882 if (Depth > 6 || Aliases.size() == 2) {
7883 Aliases.clear();
7884 Aliases.push_back(OriginalChain);
7885 break;
7886 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007887
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007888 // Don't bother if we've been before.
7889 if (!Visited.insert(Chain.getNode()))
7890 continue;
Scott Michelfdc40a02009-02-17 22:15:04 +00007891
Jim Laskeybc588b82006-10-05 15:07:25 +00007892 switch (Chain.getOpcode()) {
7893 case ISD::EntryToken:
7894 // Entry token is ideal chain operand, but handled in FindBetterChain.
7895 break;
Scott Michelfdc40a02009-02-17 22:15:04 +00007896
Jim Laskeybc588b82006-10-05 15:07:25 +00007897 case ISD::LOAD:
7898 case ISD::STORE: {
7899 // Get alias information for Chain.
Dan Gohman475871a2008-07-27 21:46:04 +00007900 SDValue OpPtr;
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007901 int64_t OpSize;
7902 const Value *OpSrcValue;
7903 int OpSrcValueOffset;
7904 unsigned OpSrcValueAlign;
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007905 const MDNode *OpSrcTBAAInfo;
Gabor Greifba36cb52008-08-28 21:40:38 +00007906 bool IsOpLoad = FindAliasInfo(Chain.getNode(), OpPtr, OpSize,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007907 OpSrcValue, OpSrcValueOffset,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007908 OpSrcValueAlign,
7909 OpSrcTBAAInfo);
Scott Michelfdc40a02009-02-17 22:15:04 +00007910
Jim Laskeybc588b82006-10-05 15:07:25 +00007911 // If chain is alias then stop here.
7912 if (!(IsLoad && IsOpLoad) &&
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007913 isAlias(Ptr, Size, SrcValue, SrcValueOffset, SrcValueAlign,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007914 SrcTBAAInfo,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007915 OpPtr, OpSize, OpSrcValue, OpSrcValueOffset,
Dan Gohmanf96e4bd2010-10-20 00:31:05 +00007916 OpSrcValueAlign, OpSrcTBAAInfo)) {
Jim Laskeybc588b82006-10-05 15:07:25 +00007917 Aliases.push_back(Chain);
7918 } else {
7919 // Look further up the chain.
Scott Michelfdc40a02009-02-17 22:15:04 +00007920 Chains.push_back(Chain.getOperand(0));
Nate Begeman677c89d2009-10-12 05:53:58 +00007921 ++Depth;
Jim Laskey279f0532006-09-25 16:29:54 +00007922 }
Jim Laskeybc588b82006-10-05 15:07:25 +00007923 break;
7924 }
Scott Michelfdc40a02009-02-17 22:15:04 +00007925
Jim Laskeybc588b82006-10-05 15:07:25 +00007926 case ISD::TokenFactor:
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007927 // We have to check each of the operands of the token factor for "small"
7928 // token factors, so we queue them up. Adding the operands to the queue
7929 // (stack) in reverse order maintains the original order and increases the
7930 // likelihood that getNode will find a matching token factor (CSE.)
7931 if (Chain.getNumOperands() > 16) {
7932 Aliases.push_back(Chain);
7933 break;
7934 }
Jim Laskeybc588b82006-10-05 15:07:25 +00007935 for (unsigned n = Chain.getNumOperands(); n;)
7936 Chains.push_back(Chain.getOperand(--n));
Nate Begeman677c89d2009-10-12 05:53:58 +00007937 ++Depth;
Jim Laskeybc588b82006-10-05 15:07:25 +00007938 break;
Scott Michelfdc40a02009-02-17 22:15:04 +00007939
Jim Laskeybc588b82006-10-05 15:07:25 +00007940 default:
7941 // For all other instructions we will just have to take what we can get.
7942 Aliases.push_back(Chain);
7943 break;
Jim Laskey279f0532006-09-25 16:29:54 +00007944 }
7945 }
Jim Laskey6ff23e52006-10-04 16:53:27 +00007946}
7947
7948/// FindBetterChain - Walk up chain skipping non-aliasing memory nodes, looking
7949/// for a better chain (aliasing node.)
Dan Gohman475871a2008-07-27 21:46:04 +00007950SDValue DAGCombiner::FindBetterChain(SDNode *N, SDValue OldChain) {
7951 SmallVector<SDValue, 8> Aliases; // Ops for replacing token factor.
Scott Michelfdc40a02009-02-17 22:15:04 +00007952
Jim Laskey6ff23e52006-10-04 16:53:27 +00007953 // Accumulate all the aliases to this node.
7954 GatherAllAliases(N, OldChain, Aliases);
Scott Michelfdc40a02009-02-17 22:15:04 +00007955
Dan Gohman71dc7c92011-05-17 22:20:36 +00007956 // If no operands then chain to entry token.
7957 if (Aliases.size() == 0)
Jim Laskey6ff23e52006-10-04 16:53:27 +00007958 return DAG.getEntryNode();
Dan Gohman71dc7c92011-05-17 22:20:36 +00007959
7960 // If a single operand then chain to it. We don't need to revisit it.
7961 if (Aliases.size() == 1)
Jim Laskey6ff23e52006-10-04 16:53:27 +00007962 return Aliases[0];
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007963
Jim Laskey6ff23e52006-10-04 16:53:27 +00007964 // Construct a custom tailored token factor.
Wesley Peckbf17cfa2010-11-23 03:31:01 +00007965 return DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), MVT::Other,
Nate Begemanb6aef5c2009-09-15 00:18:30 +00007966 &Aliases[0], Aliases.size());
Jim Laskey279f0532006-09-25 16:29:54 +00007967}
7968
Nate Begeman1d4d4142005-09-01 00:19:25 +00007969// SelectionDAG::Combine - This is the entry point for the file.
7970//
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00007971void SelectionDAG::Combine(CombineLevel Level, AliasAnalysis &AA,
Bill Wendling98a366d2009-04-29 23:29:43 +00007972 CodeGenOpt::Level OptLevel) {
Nate Begeman1d4d4142005-09-01 00:19:25 +00007973 /// run - This is the main entry point to this class.
7974 ///
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00007975 DAGCombiner(*this, AA, OptLevel).Run(Level);
Nate Begeman1d4d4142005-09-01 00:19:25 +00007976}