1 //===-- DAGCombiner.cpp - Implement a DAG node combiner -------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Nate Begeman and is distributed under the
6 // University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
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.
13 // FIXME: Missing folds
14 // sdiv, udiv, srem, urem (X, const) where X is an integer can be expanded into
15 // a sequence of multiplies, shifts, and adds. This should be controlled by
16 // some kind of hint from the target that int div is expensive.
17 // various folds of mulh[s,u] by constants such as -1, powers of 2, etc.
19 // FIXME: select C, pow2, pow2 -> something smart
20 // FIXME: trunc(select X, Y, Z) -> select X, trunc(Y), trunc(Z)
21 // FIXME: Dead stores -> nuke
22 // FIXME: shr X, (and Y,31) -> shr X, Y (TRICKY!)
23 // FIXME: mul (x, const) -> shifts + adds
24 // FIXME: undef values
25 // FIXME: divide by zero is currently left unfolded. do we want to turn this
27 // FIXME: select ne (select cc, 1, 0), 0, true, false -> select cc, true, false
29 //===----------------------------------------------------------------------===//
31 #define DEBUG_TYPE "dagcombine"
32 #include "llvm/ADT/Statistic.h"
33 #include "llvm/Analysis/AliasAnalysis.h"
34 #include "llvm/CodeGen/SelectionDAG.h"
35 #include "llvm/Support/Debug.h"
36 #include "llvm/Support/MathExtras.h"
37 #include "llvm/Target/TargetLowering.h"
38 #include "llvm/Target/TargetOptions.h"
39 #include "llvm/Support/Compiler.h"
40 #include "llvm/Support/CommandLine.h"
44 STATISTIC(NodesCombined , "Number of dag nodes combined");
45 STATISTIC(PreIndexedNodes , "Number of pre-indexed nodes created");
46 STATISTIC(PostIndexedNodes, "Number of post-indexed nodes created");
51 ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
52 cl::desc("Pop up a window to show dags before the first "
55 ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
56 cl::desc("Pop up a window to show dags before the second "
59 static const bool ViewDAGCombine1 = false;
60 static const bool ViewDAGCombine2 = false;
64 CombinerAA("combiner-alias-analysis", cl::Hidden,
65 cl::desc("Turn on alias analysis during testing"));
68 CombinerGlobalAA("combiner-global-alias-analysis", cl::Hidden,
69 cl::desc("Include global information in alias analysis"));
71 //------------------------------ DAGCombiner ---------------------------------//
73 class VISIBILITY_HIDDEN DAGCombiner {
78 // Worklist of all of the nodes that need to be simplified.
79 std::vector<SDNode*> WorkList;
81 // AA - Used for DAG load/store alias analysis.
84 /// AddUsersToWorkList - When an instruction is simplified, add all users of
85 /// the instruction to the work lists because they might get more simplified
88 void AddUsersToWorkList(SDNode *N) {
89 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
94 /// removeFromWorkList - remove all instances of N from the worklist.
96 void removeFromWorkList(SDNode *N) {
97 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N),
102 /// AddToWorkList - Add to the work list making sure it's instance is at the
103 /// the back (next to be processed.)
104 void AddToWorkList(SDNode *N) {
105 removeFromWorkList(N);
106 WorkList.push_back(N);
109 SDOperand CombineTo(SDNode *N, const SDOperand *To, unsigned NumTo,
111 assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
113 DOUT << "\nReplacing.1 "; DEBUG(N->dump());
114 DOUT << "\nWith: "; DEBUG(To[0].Val->dump(&DAG));
115 DOUT << " and " << NumTo-1 << " other values\n";
116 std::vector<SDNode*> NowDead;
117 DAG.ReplaceAllUsesWith(N, To, &NowDead);
120 // Push the new nodes and any users onto the worklist
121 for (unsigned i = 0, e = NumTo; i != e; ++i) {
122 AddToWorkList(To[i].Val);
123 AddUsersToWorkList(To[i].Val);
127 // Nodes can be reintroduced into the worklist. Make sure we do not
128 // process a node that has been replaced.
129 removeFromWorkList(N);
130 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
131 removeFromWorkList(NowDead[i]);
133 // Finally, since the node is now dead, remove it from the graph.
135 return SDOperand(N, 0);
138 SDOperand CombineTo(SDNode *N, SDOperand Res, bool AddTo = true) {
139 return CombineTo(N, &Res, 1, AddTo);
142 SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1,
144 SDOperand To[] = { Res0, Res1 };
145 return CombineTo(N, To, 2, AddTo);
149 /// SimplifyDemandedBits - Check the specified integer node value to see if
150 /// it can be simplified or if things it uses can be simplified by bit
151 /// propagation. If so, return true.
152 bool SimplifyDemandedBits(SDOperand Op) {
153 TargetLowering::TargetLoweringOpt TLO(DAG);
154 uint64_t KnownZero, KnownOne;
155 uint64_t Demanded = MVT::getIntVTBitMask(Op.getValueType());
156 if (!TLI.SimplifyDemandedBits(Op, Demanded, KnownZero, KnownOne, TLO))
160 AddToWorkList(Op.Val);
162 // Replace the old value with the new one.
164 DOUT << "\nReplacing.2 "; DEBUG(TLO.Old.Val->dump());
165 DOUT << "\nWith: "; DEBUG(TLO.New.Val->dump(&DAG));
168 std::vector<SDNode*> NowDead;
169 DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, NowDead);
171 // Push the new node and any (possibly new) users onto the worklist.
172 AddToWorkList(TLO.New.Val);
173 AddUsersToWorkList(TLO.New.Val);
175 // Nodes can end up on the worklist more than once. Make sure we do
176 // not process a node that has been replaced.
177 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
178 removeFromWorkList(NowDead[i]);
180 // Finally, if the node is now dead, remove it from the graph. The node
181 // may not be dead if the replacement process recursively simplified to
182 // something else needing this node.
183 if (TLO.Old.Val->use_empty()) {
184 removeFromWorkList(TLO.Old.Val);
185 DAG.DeleteNode(TLO.Old.Val);
190 bool CombineToPreIndexedLoadStore(SDNode *N);
191 bool CombineToPostIndexedLoadStore(SDNode *N);
194 /// visit - call the node-specific routine that knows how to fold each
195 /// particular type of node.
196 SDOperand visit(SDNode *N);
198 // Visitation implementation - Implement dag node combining for different
199 // node types. The semantics are as follows:
201 // SDOperand.Val == 0 - No change was made
202 // SDOperand.Val == N - N was replaced, is dead, and is already handled.
203 // otherwise - N should be replaced by the returned Operand.
205 SDOperand visitTokenFactor(SDNode *N);
206 SDOperand visitADD(SDNode *N);
207 SDOperand visitSUB(SDNode *N);
208 SDOperand visitADDC(SDNode *N);
209 SDOperand visitADDE(SDNode *N);
210 SDOperand visitMUL(SDNode *N);
211 SDOperand visitSDIV(SDNode *N);
212 SDOperand visitUDIV(SDNode *N);
213 SDOperand visitSREM(SDNode *N);
214 SDOperand visitUREM(SDNode *N);
215 SDOperand visitMULHU(SDNode *N);
216 SDOperand visitMULHS(SDNode *N);
217 SDOperand visitAND(SDNode *N);
218 SDOperand visitOR(SDNode *N);
219 SDOperand visitXOR(SDNode *N);
220 SDOperand visitVBinOp(SDNode *N, ISD::NodeType IntOp, ISD::NodeType FPOp);
221 SDOperand visitSHL(SDNode *N);
222 SDOperand visitSRA(SDNode *N);
223 SDOperand visitSRL(SDNode *N);
224 SDOperand visitCTLZ(SDNode *N);
225 SDOperand visitCTTZ(SDNode *N);
226 SDOperand visitCTPOP(SDNode *N);
227 SDOperand visitSELECT(SDNode *N);
228 SDOperand visitSELECT_CC(SDNode *N);
229 SDOperand visitSETCC(SDNode *N);
230 SDOperand visitSIGN_EXTEND(SDNode *N);
231 SDOperand visitZERO_EXTEND(SDNode *N);
232 SDOperand visitANY_EXTEND(SDNode *N);
233 SDOperand visitSIGN_EXTEND_INREG(SDNode *N);
234 SDOperand visitTRUNCATE(SDNode *N);
235 SDOperand visitBIT_CONVERT(SDNode *N);
236 SDOperand visitVBIT_CONVERT(SDNode *N);
237 SDOperand visitFADD(SDNode *N);
238 SDOperand visitFSUB(SDNode *N);
239 SDOperand visitFMUL(SDNode *N);
240 SDOperand visitFDIV(SDNode *N);
241 SDOperand visitFREM(SDNode *N);
242 SDOperand visitFCOPYSIGN(SDNode *N);
243 SDOperand visitSINT_TO_FP(SDNode *N);
244 SDOperand visitUINT_TO_FP(SDNode *N);
245 SDOperand visitFP_TO_SINT(SDNode *N);
246 SDOperand visitFP_TO_UINT(SDNode *N);
247 SDOperand visitFP_ROUND(SDNode *N);
248 SDOperand visitFP_ROUND_INREG(SDNode *N);
249 SDOperand visitFP_EXTEND(SDNode *N);
250 SDOperand visitFNEG(SDNode *N);
251 SDOperand visitFABS(SDNode *N);
252 SDOperand visitBRCOND(SDNode *N);
253 SDOperand visitBR_CC(SDNode *N);
254 SDOperand visitLOAD(SDNode *N);
255 SDOperand visitSTORE(SDNode *N);
256 SDOperand visitINSERT_VECTOR_ELT(SDNode *N);
257 SDOperand visitVINSERT_VECTOR_ELT(SDNode *N);
258 SDOperand visitVBUILD_VECTOR(SDNode *N);
259 SDOperand visitVECTOR_SHUFFLE(SDNode *N);
260 SDOperand visitVVECTOR_SHUFFLE(SDNode *N);
262 SDOperand XformToShuffleWithZero(SDNode *N);
263 SDOperand ReassociateOps(unsigned Opc, SDOperand LHS, SDOperand RHS);
265 bool SimplifySelectOps(SDNode *SELECT, SDOperand LHS, SDOperand RHS);
266 SDOperand SimplifyBinOpWithSameOpcodeHands(SDNode *N);
267 SDOperand SimplifySelect(SDOperand N0, SDOperand N1, SDOperand N2);
268 SDOperand SimplifySelectCC(SDOperand N0, SDOperand N1, SDOperand N2,
269 SDOperand N3, ISD::CondCode CC);
270 SDOperand SimplifySetCC(MVT::ValueType VT, SDOperand N0, SDOperand N1,
271 ISD::CondCode Cond, bool foldBooleans = true);
272 SDOperand ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(SDNode *, MVT::ValueType);
273 SDOperand BuildSDIV(SDNode *N);
274 SDOperand BuildUDIV(SDNode *N);
275 SDNode *MatchRotate(SDOperand LHS, SDOperand RHS);
276 SDOperand ReduceLoadWidth(SDNode *N);
278 /// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes,
279 /// looking for aliasing nodes and adding them to the Aliases vector.
280 void GatherAllAliases(SDNode *N, SDOperand OriginalChain,
281 SmallVector<SDOperand, 8> &Aliases);
283 /// isAlias - Return true if there is any possibility that the two addresses
285 bool isAlias(SDOperand Ptr1, int64_t Size1,
286 const Value *SrcValue1, int SrcValueOffset1,
287 SDOperand Ptr2, int64_t Size2,
288 const Value *SrcValue2, int SrcValueOffset2);
290 /// FindAliasInfo - Extracts the relevant alias information from the memory
291 /// node. Returns true if the operand was a load.
292 bool FindAliasInfo(SDNode *N,
293 SDOperand &Ptr, int64_t &Size,
294 const Value *&SrcValue, int &SrcValueOffset);
296 /// FindBetterChain - Walk up chain skipping non-aliasing memory nodes,
297 /// looking for a better chain (aliasing node.)
298 SDOperand FindBetterChain(SDNode *N, SDOperand Chain);
301 DAGCombiner(SelectionDAG &D, AliasAnalysis &A)
303 TLI(D.getTargetLoweringInfo()),
304 AfterLegalize(false),
307 /// Run - runs the dag combiner on all nodes in the work list
308 void Run(bool RunningAfterLegalize);
312 //===----------------------------------------------------------------------===//
313 // TargetLowering::DAGCombinerInfo implementation
314 //===----------------------------------------------------------------------===//
316 void TargetLowering::DAGCombinerInfo::AddToWorklist(SDNode *N) {
317 ((DAGCombiner*)DC)->AddToWorkList(N);
320 SDOperand TargetLowering::DAGCombinerInfo::
321 CombineTo(SDNode *N, const std::vector<SDOperand> &To) {
322 return ((DAGCombiner*)DC)->CombineTo(N, &To[0], To.size());
325 SDOperand TargetLowering::DAGCombinerInfo::
326 CombineTo(SDNode *N, SDOperand Res) {
327 return ((DAGCombiner*)DC)->CombineTo(N, Res);
331 SDOperand TargetLowering::DAGCombinerInfo::
332 CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1) {
333 return ((DAGCombiner*)DC)->CombineTo(N, Res0, Res1);
339 //===----------------------------------------------------------------------===//
342 // isSetCCEquivalent - Return true if this node is a setcc, or is a select_cc
343 // that selects between the values 1 and 0, making it equivalent to a setcc.
344 // Also, set the incoming LHS, RHS, and CC references to the appropriate
345 // nodes based on the type of node we are checking. This simplifies life a
346 // bit for the callers.
347 static bool isSetCCEquivalent(SDOperand N, SDOperand &LHS, SDOperand &RHS,
349 if (N.getOpcode() == ISD::SETCC) {
350 LHS = N.getOperand(0);
351 RHS = N.getOperand(1);
352 CC = N.getOperand(2);
355 if (N.getOpcode() == ISD::SELECT_CC &&
356 N.getOperand(2).getOpcode() == ISD::Constant &&
357 N.getOperand(3).getOpcode() == ISD::Constant &&
358 cast<ConstantSDNode>(N.getOperand(2))->getValue() == 1 &&
359 cast<ConstantSDNode>(N.getOperand(3))->isNullValue()) {
360 LHS = N.getOperand(0);
361 RHS = N.getOperand(1);
362 CC = N.getOperand(4);
368 // isOneUseSetCC - Return true if this is a SetCC-equivalent operation with only
369 // one use. If this is true, it allows the users to invert the operation for
370 // free when it is profitable to do so.
371 static bool isOneUseSetCC(SDOperand N) {
372 SDOperand N0, N1, N2;
373 if (isSetCCEquivalent(N, N0, N1, N2) && N.Val->hasOneUse())
378 SDOperand DAGCombiner::ReassociateOps(unsigned Opc, SDOperand N0, SDOperand N1){
379 MVT::ValueType VT = N0.getValueType();
380 // reassoc. (op (op x, c1), y) -> (op (op x, y), c1) iff x+c1 has one use
381 // reassoc. (op (op x, c1), c2) -> (op x, (op c1, c2))
382 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1))) {
383 if (isa<ConstantSDNode>(N1)) {
384 SDOperand OpNode = DAG.getNode(Opc, VT, N0.getOperand(1), N1);
385 AddToWorkList(OpNode.Val);
386 return DAG.getNode(Opc, VT, OpNode, N0.getOperand(0));
387 } else if (N0.hasOneUse()) {
388 SDOperand OpNode = DAG.getNode(Opc, VT, N0.getOperand(0), N1);
389 AddToWorkList(OpNode.Val);
390 return DAG.getNode(Opc, VT, OpNode, N0.getOperand(1));
393 // reassoc. (op y, (op x, c1)) -> (op (op x, y), c1) iff x+c1 has one use
394 // reassoc. (op c2, (op x, c1)) -> (op x, (op c1, c2))
395 if (N1.getOpcode() == Opc && isa<ConstantSDNode>(N1.getOperand(1))) {
396 if (isa<ConstantSDNode>(N0)) {
397 SDOperand OpNode = DAG.getNode(Opc, VT, N1.getOperand(1), N0);
398 AddToWorkList(OpNode.Val);
399 return DAG.getNode(Opc, VT, OpNode, N1.getOperand(0));
400 } else if (N1.hasOneUse()) {
401 SDOperand OpNode = DAG.getNode(Opc, VT, N1.getOperand(0), N0);
402 AddToWorkList(OpNode.Val);
403 return DAG.getNode(Opc, VT, OpNode, N1.getOperand(1));
409 void DAGCombiner::Run(bool RunningAfterLegalize) {
410 // set the instance variable, so that the various visit routines may use it.
411 AfterLegalize = RunningAfterLegalize;
413 // Add all the dag nodes to the worklist.
414 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
415 E = DAG.allnodes_end(); I != E; ++I)
416 WorkList.push_back(I);
418 // Create a dummy node (which is not added to allnodes), that adds a reference
419 // to the root node, preventing it from being deleted, and tracking any
420 // changes of the root.
421 HandleSDNode Dummy(DAG.getRoot());
423 // The root of the dag may dangle to deleted nodes until the dag combiner is
424 // done. Set it to null to avoid confusion.
425 DAG.setRoot(SDOperand());
427 /// DagCombineInfo - Expose the DAG combiner to the target combiner impls.
428 TargetLowering::DAGCombinerInfo
429 DagCombineInfo(DAG, !RunningAfterLegalize, false, this);
431 // while the worklist isn't empty, inspect the node on the end of it and
432 // try and combine it.
433 while (!WorkList.empty()) {
434 SDNode *N = WorkList.back();
437 // If N has no uses, it is dead. Make sure to revisit all N's operands once
438 // N is deleted from the DAG, since they too may now be dead or may have a
439 // reduced number of uses, allowing other xforms.
440 if (N->use_empty() && N != &Dummy) {
441 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
442 AddToWorkList(N->getOperand(i).Val);
448 SDOperand RV = visit(N);
450 // If nothing happened, try a target-specific DAG combine.
452 assert(N->getOpcode() != ISD::DELETED_NODE &&
453 "Node was deleted but visit returned NULL!");
454 if (N->getOpcode() >= ISD::BUILTIN_OP_END ||
455 TLI.hasTargetDAGCombine((ISD::NodeType)N->getOpcode()))
456 RV = TLI.PerformDAGCombine(N, DagCombineInfo);
461 // If we get back the same node we passed in, rather than a new node or
462 // zero, we know that the node must have defined multiple values and
463 // CombineTo was used. Since CombineTo takes care of the worklist
464 // mechanics for us, we have no work to do in this case.
466 assert(N->getOpcode() != ISD::DELETED_NODE &&
467 RV.Val->getOpcode() != ISD::DELETED_NODE &&
468 "Node was deleted but visit returned new node!");
470 DOUT << "\nReplacing.3 "; DEBUG(N->dump());
471 DOUT << "\nWith: "; DEBUG(RV.Val->dump(&DAG));
473 std::vector<SDNode*> NowDead;
474 if (N->getNumValues() == RV.Val->getNumValues())
475 DAG.ReplaceAllUsesWith(N, RV.Val, &NowDead);
477 assert(N->getValueType(0) == RV.getValueType() && "Type mismatch");
479 DAG.ReplaceAllUsesWith(N, &OpV, &NowDead);
482 // Push the new node and any users onto the worklist
483 AddToWorkList(RV.Val);
484 AddUsersToWorkList(RV.Val);
486 // Nodes can be reintroduced into the worklist. Make sure we do not
487 // process a node that has been replaced.
488 removeFromWorkList(N);
489 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
490 removeFromWorkList(NowDead[i]);
492 // Finally, since the node is now dead, remove it from the graph.
498 // If the root changed (e.g. it was a dead load, update the root).
499 DAG.setRoot(Dummy.getValue());
502 SDOperand DAGCombiner::visit(SDNode *N) {
503 switch(N->getOpcode()) {
505 case ISD::TokenFactor: return visitTokenFactor(N);
506 case ISD::ADD: return visitADD(N);
507 case ISD::SUB: return visitSUB(N);
508 case ISD::ADDC: return visitADDC(N);
509 case ISD::ADDE: return visitADDE(N);
510 case ISD::MUL: return visitMUL(N);
511 case ISD::SDIV: return visitSDIV(N);
512 case ISD::UDIV: return visitUDIV(N);
513 case ISD::SREM: return visitSREM(N);
514 case ISD::UREM: return visitUREM(N);
515 case ISD::MULHU: return visitMULHU(N);
516 case ISD::MULHS: return visitMULHS(N);
517 case ISD::AND: return visitAND(N);
518 case ISD::OR: return visitOR(N);
519 case ISD::XOR: return visitXOR(N);
520 case ISD::SHL: return visitSHL(N);
521 case ISD::SRA: return visitSRA(N);
522 case ISD::SRL: return visitSRL(N);
523 case ISD::CTLZ: return visitCTLZ(N);
524 case ISD::CTTZ: return visitCTTZ(N);
525 case ISD::CTPOP: return visitCTPOP(N);
526 case ISD::SELECT: return visitSELECT(N);
527 case ISD::SELECT_CC: return visitSELECT_CC(N);
528 case ISD::SETCC: return visitSETCC(N);
529 case ISD::SIGN_EXTEND: return visitSIGN_EXTEND(N);
530 case ISD::ZERO_EXTEND: return visitZERO_EXTEND(N);
531 case ISD::ANY_EXTEND: return visitANY_EXTEND(N);
532 case ISD::SIGN_EXTEND_INREG: return visitSIGN_EXTEND_INREG(N);
533 case ISD::TRUNCATE: return visitTRUNCATE(N);
534 case ISD::BIT_CONVERT: return visitBIT_CONVERT(N);
535 case ISD::VBIT_CONVERT: return visitVBIT_CONVERT(N);
536 case ISD::FADD: return visitFADD(N);
537 case ISD::FSUB: return visitFSUB(N);
538 case ISD::FMUL: return visitFMUL(N);
539 case ISD::FDIV: return visitFDIV(N);
540 case ISD::FREM: return visitFREM(N);
541 case ISD::FCOPYSIGN: return visitFCOPYSIGN(N);
542 case ISD::SINT_TO_FP: return visitSINT_TO_FP(N);
543 case ISD::UINT_TO_FP: return visitUINT_TO_FP(N);
544 case ISD::FP_TO_SINT: return visitFP_TO_SINT(N);
545 case ISD::FP_TO_UINT: return visitFP_TO_UINT(N);
546 case ISD::FP_ROUND: return visitFP_ROUND(N);
547 case ISD::FP_ROUND_INREG: return visitFP_ROUND_INREG(N);
548 case ISD::FP_EXTEND: return visitFP_EXTEND(N);
549 case ISD::FNEG: return visitFNEG(N);
550 case ISD::FABS: return visitFABS(N);
551 case ISD::BRCOND: return visitBRCOND(N);
552 case ISD::BR_CC: return visitBR_CC(N);
553 case ISD::LOAD: return visitLOAD(N);
554 case ISD::STORE: return visitSTORE(N);
555 case ISD::INSERT_VECTOR_ELT: return visitINSERT_VECTOR_ELT(N);
556 case ISD::VINSERT_VECTOR_ELT: return visitVINSERT_VECTOR_ELT(N);
557 case ISD::VBUILD_VECTOR: return visitVBUILD_VECTOR(N);
558 case ISD::VECTOR_SHUFFLE: return visitVECTOR_SHUFFLE(N);
559 case ISD::VVECTOR_SHUFFLE: return visitVVECTOR_SHUFFLE(N);
560 case ISD::VADD: return visitVBinOp(N, ISD::ADD , ISD::FADD);
561 case ISD::VSUB: return visitVBinOp(N, ISD::SUB , ISD::FSUB);
562 case ISD::VMUL: return visitVBinOp(N, ISD::MUL , ISD::FMUL);
563 case ISD::VSDIV: return visitVBinOp(N, ISD::SDIV, ISD::FDIV);
564 case ISD::VUDIV: return visitVBinOp(N, ISD::UDIV, ISD::UDIV);
565 case ISD::VAND: return visitVBinOp(N, ISD::AND , ISD::AND);
566 case ISD::VOR: return visitVBinOp(N, ISD::OR , ISD::OR);
567 case ISD::VXOR: return visitVBinOp(N, ISD::XOR , ISD::XOR);
572 /// getInputChainForNode - Given a node, return its input chain if it has one,
573 /// otherwise return a null sd operand.
574 static SDOperand getInputChainForNode(SDNode *N) {
575 if (unsigned NumOps = N->getNumOperands()) {
576 if (N->getOperand(0).getValueType() == MVT::Other)
577 return N->getOperand(0);
578 else if (N->getOperand(NumOps-1).getValueType() == MVT::Other)
579 return N->getOperand(NumOps-1);
580 for (unsigned i = 1; i < NumOps-1; ++i)
581 if (N->getOperand(i).getValueType() == MVT::Other)
582 return N->getOperand(i);
584 return SDOperand(0, 0);
587 SDOperand DAGCombiner::visitTokenFactor(SDNode *N) {
588 // If N has two operands, where one has an input chain equal to the other,
589 // the 'other' chain is redundant.
590 if (N->getNumOperands() == 2) {
591 if (getInputChainForNode(N->getOperand(0).Val) == N->getOperand(1))
592 return N->getOperand(0);
593 if (getInputChainForNode(N->getOperand(1).Val) == N->getOperand(0))
594 return N->getOperand(1);
598 SmallVector<SDNode *, 8> TFs; // List of token factors to visit.
599 SmallVector<SDOperand, 8> Ops; // Ops for replacing token factor.
600 bool Changed = false; // If we should replace this token factor.
602 // Start out with this token factor.
605 // Iterate through token factors. The TFs grows when new token factors are
607 for (unsigned i = 0; i < TFs.size(); ++i) {
610 // Check each of the operands.
611 for (unsigned i = 0, ie = TF->getNumOperands(); i != ie; ++i) {
612 SDOperand Op = TF->getOperand(i);
614 switch (Op.getOpcode()) {
615 case ISD::EntryToken:
616 // Entry tokens don't need to be added to the list. They are
621 case ISD::TokenFactor:
622 if ((CombinerAA || Op.hasOneUse()) &&
623 std::find(TFs.begin(), TFs.end(), Op.Val) == TFs.end()) {
624 // Queue up for processing.
625 TFs.push_back(Op.Val);
626 // Clean up in case the token factor is removed.
627 AddToWorkList(Op.Val);
634 // Only add if not there prior.
635 if (std::find(Ops.begin(), Ops.end(), Op) == Ops.end())
644 // If we've change things around then replace token factor.
646 if (Ops.size() == 0) {
647 // The entry token is the only possible outcome.
648 Result = DAG.getEntryNode();
650 // New and improved token factor.
651 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, &Ops[0], Ops.size());
654 // Don't add users to work list.
655 return CombineTo(N, Result, false);
662 SDOperand combineShlAddConstant(SDOperand N0, SDOperand N1, SelectionDAG &DAG) {
663 MVT::ValueType VT = N0.getValueType();
664 SDOperand N00 = N0.getOperand(0);
665 SDOperand N01 = N0.getOperand(1);
666 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N01);
667 if (N01C && N00.getOpcode() == ISD::ADD && N00.Val->hasOneUse() &&
668 isa<ConstantSDNode>(N00.getOperand(1))) {
669 N0 = DAG.getNode(ISD::ADD, VT,
670 DAG.getNode(ISD::SHL, VT, N00.getOperand(0), N01),
671 DAG.getNode(ISD::SHL, VT, N00.getOperand(1), N01));
672 return DAG.getNode(ISD::ADD, VT, N0, N1);
677 SDOperand DAGCombiner::visitADD(SDNode *N) {
678 SDOperand N0 = N->getOperand(0);
679 SDOperand N1 = N->getOperand(1);
680 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
681 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
682 MVT::ValueType VT = N0.getValueType();
684 // fold (add c1, c2) -> c1+c2
686 return DAG.getNode(ISD::ADD, VT, N0, N1);
687 // canonicalize constant to RHS
689 return DAG.getNode(ISD::ADD, VT, N1, N0);
690 // fold (add x, 0) -> x
691 if (N1C && N1C->isNullValue())
693 // fold ((c1-A)+c2) -> (c1+c2)-A
694 if (N1C && N0.getOpcode() == ISD::SUB)
695 if (ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getOperand(0)))
696 return DAG.getNode(ISD::SUB, VT,
697 DAG.getConstant(N1C->getValue()+N0C->getValue(), VT),
700 SDOperand RADD = ReassociateOps(ISD::ADD, N0, N1);
703 // fold ((0-A) + B) -> B-A
704 if (N0.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N0.getOperand(0)) &&
705 cast<ConstantSDNode>(N0.getOperand(0))->isNullValue())
706 return DAG.getNode(ISD::SUB, VT, N1, N0.getOperand(1));
707 // fold (A + (0-B)) -> A-B
708 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) &&
709 cast<ConstantSDNode>(N1.getOperand(0))->isNullValue())
710 return DAG.getNode(ISD::SUB, VT, N0, N1.getOperand(1));
711 // fold (A+(B-A)) -> B
712 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(1))
713 return N1.getOperand(0);
715 if (!MVT::isVector(VT) && SimplifyDemandedBits(SDOperand(N, 0)))
716 return SDOperand(N, 0);
718 // fold (a+b) -> (a|b) iff a and b share no bits.
719 if (MVT::isInteger(VT) && !MVT::isVector(VT)) {
720 uint64_t LHSZero, LHSOne;
721 uint64_t RHSZero, RHSOne;
722 uint64_t Mask = MVT::getIntVTBitMask(VT);
723 TLI.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne);
725 TLI.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne);
727 // If all possibly-set bits on the LHS are clear on the RHS, return an OR.
728 // If all possibly-set bits on the RHS are clear on the LHS, return an OR.
729 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) ||
730 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask))
731 return DAG.getNode(ISD::OR, VT, N0, N1);
735 // fold (add (shl (add x, c1), c2), ) -> (add (add (shl x, c2), c1<<c2), )
736 if (N0.getOpcode() == ISD::SHL && N0.Val->hasOneUse()) {
737 SDOperand Result = combineShlAddConstant(N0, N1, DAG);
738 if (Result.Val) return Result;
740 if (N1.getOpcode() == ISD::SHL && N1.Val->hasOneUse()) {
741 SDOperand Result = combineShlAddConstant(N1, N0, DAG);
742 if (Result.Val) return Result;
748 SDOperand DAGCombiner::visitADDC(SDNode *N) {
749 SDOperand N0 = N->getOperand(0);
750 SDOperand N1 = N->getOperand(1);
751 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
752 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
753 MVT::ValueType VT = N0.getValueType();
755 // If the flag result is dead, turn this into an ADD.
756 if (N->hasNUsesOfValue(0, 1))
757 return CombineTo(N, DAG.getNode(ISD::ADD, VT, N1, N0),
758 DAG.getNode(ISD::CARRY_FALSE, MVT::Flag));
760 // canonicalize constant to RHS.
762 SDOperand Ops[] = { N1, N0 };
763 return DAG.getNode(ISD::ADDC, N->getVTList(), Ops, 2);
766 // fold (addc x, 0) -> x + no carry out
767 if (N1C && N1C->isNullValue())
768 return CombineTo(N, N0, DAG.getNode(ISD::CARRY_FALSE, MVT::Flag));
770 // fold (addc a, b) -> (or a, b), CARRY_FALSE iff a and b share no bits.
771 uint64_t LHSZero, LHSOne;
772 uint64_t RHSZero, RHSOne;
773 uint64_t Mask = MVT::getIntVTBitMask(VT);
774 TLI.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne);
776 TLI.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne);
778 // If all possibly-set bits on the LHS are clear on the RHS, return an OR.
779 // If all possibly-set bits on the RHS are clear on the LHS, return an OR.
780 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) ||
781 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask))
782 return CombineTo(N, DAG.getNode(ISD::OR, VT, N0, N1),
783 DAG.getNode(ISD::CARRY_FALSE, MVT::Flag));
789 SDOperand DAGCombiner::visitADDE(SDNode *N) {
790 SDOperand N0 = N->getOperand(0);
791 SDOperand N1 = N->getOperand(1);
792 SDOperand CarryIn = N->getOperand(2);
793 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
794 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
795 //MVT::ValueType VT = N0.getValueType();
797 // canonicalize constant to RHS
799 SDOperand Ops[] = { N1, N0, CarryIn };
800 return DAG.getNode(ISD::ADDE, N->getVTList(), Ops, 3);
803 // fold (adde x, y, false) -> (addc x, y)
804 if (CarryIn.getOpcode() == ISD::CARRY_FALSE) {
805 SDOperand Ops[] = { N1, N0 };
806 return DAG.getNode(ISD::ADDC, N->getVTList(), Ops, 2);
814 SDOperand DAGCombiner::visitSUB(SDNode *N) {
815 SDOperand N0 = N->getOperand(0);
816 SDOperand N1 = N->getOperand(1);
817 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val);
818 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
819 MVT::ValueType VT = N0.getValueType();
821 // fold (sub x, x) -> 0
823 return DAG.getConstant(0, N->getValueType(0));
824 // fold (sub c1, c2) -> c1-c2
826 return DAG.getNode(ISD::SUB, VT, N0, N1);
827 // fold (sub x, c) -> (add x, -c)
829 return DAG.getNode(ISD::ADD, VT, N0, DAG.getConstant(-N1C->getValue(), VT));
831 if (N0.getOpcode() == ISD::ADD && N0.getOperand(0) == N1)
832 return N0.getOperand(1);
834 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1) == N1)
835 return N0.getOperand(0);
839 SDOperand DAGCombiner::visitMUL(SDNode *N) {
840 SDOperand N0 = N->getOperand(0);
841 SDOperand N1 = N->getOperand(1);
842 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
843 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
844 MVT::ValueType VT = N0.getValueType();
846 // fold (mul c1, c2) -> c1*c2
848 return DAG.getNode(ISD::MUL, VT, N0, N1);
849 // canonicalize constant to RHS
851 return DAG.getNode(ISD::MUL, VT, N1, N0);
852 // fold (mul x, 0) -> 0
853 if (N1C && N1C->isNullValue())
855 // fold (mul x, -1) -> 0-x
856 if (N1C && N1C->isAllOnesValue())
857 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), N0);
858 // fold (mul x, (1 << c)) -> x << c
859 if (N1C && isPowerOf2_64(N1C->getValue()))
860 return DAG.getNode(ISD::SHL, VT, N0,
861 DAG.getConstant(Log2_64(N1C->getValue()),
862 TLI.getShiftAmountTy()));
863 // fold (mul x, -(1 << c)) -> -(x << c) or (-x) << c
864 if (N1C && isPowerOf2_64(-N1C->getSignExtended())) {
865 // FIXME: If the input is something that is easily negated (e.g. a
866 // single-use add), we should put the negate there.
867 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT),
868 DAG.getNode(ISD::SHL, VT, N0,
869 DAG.getConstant(Log2_64(-N1C->getSignExtended()),
870 TLI.getShiftAmountTy())));
873 // (mul (shl X, c1), c2) -> (mul X, c2 << c1)
874 if (N1C && N0.getOpcode() == ISD::SHL &&
875 isa<ConstantSDNode>(N0.getOperand(1))) {
876 SDOperand C3 = DAG.getNode(ISD::SHL, VT, N1, N0.getOperand(1));
877 AddToWorkList(C3.Val);
878 return DAG.getNode(ISD::MUL, VT, N0.getOperand(0), C3);
881 // Change (mul (shl X, C), Y) -> (shl (mul X, Y), C) when the shift has one
884 SDOperand Sh(0,0), Y(0,0);
885 // Check for both (mul (shl X, C), Y) and (mul Y, (shl X, C)).
886 if (N0.getOpcode() == ISD::SHL && isa<ConstantSDNode>(N0.getOperand(1)) &&
887 N0.Val->hasOneUse()) {
889 } else if (N1.getOpcode() == ISD::SHL &&
890 isa<ConstantSDNode>(N1.getOperand(1)) && N1.Val->hasOneUse()) {
894 SDOperand Mul = DAG.getNode(ISD::MUL, VT, Sh.getOperand(0), Y);
895 return DAG.getNode(ISD::SHL, VT, Mul, Sh.getOperand(1));
898 // fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2)
899 if (N1C && N0.getOpcode() == ISD::ADD && N0.Val->hasOneUse() &&
900 isa<ConstantSDNode>(N0.getOperand(1))) {
901 return DAG.getNode(ISD::ADD, VT,
902 DAG.getNode(ISD::MUL, VT, N0.getOperand(0), N1),
903 DAG.getNode(ISD::MUL, VT, N0.getOperand(1), N1));
907 SDOperand RMUL = ReassociateOps(ISD::MUL, N0, N1);
913 SDOperand DAGCombiner::visitSDIV(SDNode *N) {
914 SDOperand N0 = N->getOperand(0);
915 SDOperand N1 = N->getOperand(1);
916 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val);
917 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
918 MVT::ValueType VT = N->getValueType(0);
920 // fold (sdiv c1, c2) -> c1/c2
921 if (N0C && N1C && !N1C->isNullValue())
922 return DAG.getNode(ISD::SDIV, VT, N0, N1);
923 // fold (sdiv X, 1) -> X
924 if (N1C && N1C->getSignExtended() == 1LL)
926 // fold (sdiv X, -1) -> 0-X
927 if (N1C && N1C->isAllOnesValue())
928 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), N0);
929 // If we know the sign bits of both operands are zero, strength reduce to a
930 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2
931 uint64_t SignBit = 1ULL << (MVT::getSizeInBits(VT)-1);
932 if (TLI.MaskedValueIsZero(N1, SignBit) &&
933 TLI.MaskedValueIsZero(N0, SignBit))
934 return DAG.getNode(ISD::UDIV, N1.getValueType(), N0, N1);
935 // fold (sdiv X, pow2) -> simple ops after legalize
936 if (N1C && N1C->getValue() && !TLI.isIntDivCheap() &&
937 (isPowerOf2_64(N1C->getSignExtended()) ||
938 isPowerOf2_64(-N1C->getSignExtended()))) {
939 // If dividing by powers of two is cheap, then don't perform the following
941 if (TLI.isPow2DivCheap())
943 int64_t pow2 = N1C->getSignExtended();
944 int64_t abs2 = pow2 > 0 ? pow2 : -pow2;
945 unsigned lg2 = Log2_64(abs2);
946 // Splat the sign bit into the register
947 SDOperand SGN = DAG.getNode(ISD::SRA, VT, N0,
948 DAG.getConstant(MVT::getSizeInBits(VT)-1,
949 TLI.getShiftAmountTy()));
950 AddToWorkList(SGN.Val);
951 // Add (N0 < 0) ? abs2 - 1 : 0;
952 SDOperand SRL = DAG.getNode(ISD::SRL, VT, SGN,
953 DAG.getConstant(MVT::getSizeInBits(VT)-lg2,
954 TLI.getShiftAmountTy()));
955 SDOperand ADD = DAG.getNode(ISD::ADD, VT, N0, SRL);
956 AddToWorkList(SRL.Val);
957 AddToWorkList(ADD.Val); // Divide by pow2
958 SDOperand SRA = DAG.getNode(ISD::SRA, VT, ADD,
959 DAG.getConstant(lg2, TLI.getShiftAmountTy()));
960 // If we're dividing by a positive value, we're done. Otherwise, we must
961 // negate the result.
964 AddToWorkList(SRA.Val);
965 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), SRA);
967 // if integer divide is expensive and we satisfy the requirements, emit an
968 // alternate sequence.
969 if (N1C && (N1C->getSignExtended() < -1 || N1C->getSignExtended() > 1) &&
970 !TLI.isIntDivCheap()) {
971 SDOperand Op = BuildSDIV(N);
972 if (Op.Val) return Op;
977 SDOperand DAGCombiner::visitUDIV(SDNode *N) {
978 SDOperand N0 = N->getOperand(0);
979 SDOperand N1 = N->getOperand(1);
980 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val);
981 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
982 MVT::ValueType VT = N->getValueType(0);
984 // fold (udiv c1, c2) -> c1/c2
985 if (N0C && N1C && !N1C->isNullValue())
986 return DAG.getNode(ISD::UDIV, VT, N0, N1);
987 // fold (udiv x, (1 << c)) -> x >>u c
988 if (N1C && isPowerOf2_64(N1C->getValue()))
989 return DAG.getNode(ISD::SRL, VT, N0,
990 DAG.getConstant(Log2_64(N1C->getValue()),
991 TLI.getShiftAmountTy()));
992 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2
993 if (N1.getOpcode() == ISD::SHL) {
994 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) {
995 if (isPowerOf2_64(SHC->getValue())) {
996 MVT::ValueType ADDVT = N1.getOperand(1).getValueType();
997 SDOperand Add = DAG.getNode(ISD::ADD, ADDVT, N1.getOperand(1),
998 DAG.getConstant(Log2_64(SHC->getValue()),
1000 AddToWorkList(Add.Val);
1001 return DAG.getNode(ISD::SRL, VT, N0, Add);
1005 // fold (udiv x, c) -> alternate
1006 if (N1C && N1C->getValue() && !TLI.isIntDivCheap()) {
1007 SDOperand Op = BuildUDIV(N);
1008 if (Op.Val) return Op;
1013 SDOperand DAGCombiner::visitSREM(SDNode *N) {
1014 SDOperand N0 = N->getOperand(0);
1015 SDOperand N1 = N->getOperand(1);
1016 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1017 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1018 MVT::ValueType VT = N->getValueType(0);
1020 // fold (srem c1, c2) -> c1%c2
1021 if (N0C && N1C && !N1C->isNullValue())
1022 return DAG.getNode(ISD::SREM, VT, N0, N1);
1023 // If we know the sign bits of both operands are zero, strength reduce to a
1024 // urem instead. Handles (X & 0x0FFFFFFF) %s 16 -> X&15
1025 uint64_t SignBit = 1ULL << (MVT::getSizeInBits(VT)-1);
1026 if (TLI.MaskedValueIsZero(N1, SignBit) &&
1027 TLI.MaskedValueIsZero(N0, SignBit))
1028 return DAG.getNode(ISD::UREM, VT, N0, N1);
1030 // Unconditionally lower X%C -> X-X/C*C. This allows the X/C logic to hack on
1031 // the remainder operation.
1032 if (N1C && !N1C->isNullValue()) {
1033 SDOperand Div = DAG.getNode(ISD::SDIV, VT, N0, N1);
1034 SDOperand Mul = DAG.getNode(ISD::MUL, VT, Div, N1);
1035 SDOperand Sub = DAG.getNode(ISD::SUB, VT, N0, Mul);
1036 AddToWorkList(Div.Val);
1037 AddToWorkList(Mul.Val);
1044 SDOperand DAGCombiner::visitUREM(SDNode *N) {
1045 SDOperand N0 = N->getOperand(0);
1046 SDOperand N1 = N->getOperand(1);
1047 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1048 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1049 MVT::ValueType VT = N->getValueType(0);
1051 // fold (urem c1, c2) -> c1%c2
1052 if (N0C && N1C && !N1C->isNullValue())
1053 return DAG.getNode(ISD::UREM, VT, N0, N1);
1054 // fold (urem x, pow2) -> (and x, pow2-1)
1055 if (N1C && !N1C->isNullValue() && isPowerOf2_64(N1C->getValue()))
1056 return DAG.getNode(ISD::AND, VT, N0, DAG.getConstant(N1C->getValue()-1,VT));
1057 // fold (urem x, (shl pow2, y)) -> (and x, (add (shl pow2, y), -1))
1058 if (N1.getOpcode() == ISD::SHL) {
1059 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) {
1060 if (isPowerOf2_64(SHC->getValue())) {
1061 SDOperand Add = DAG.getNode(ISD::ADD, VT, N1,DAG.getConstant(~0ULL,VT));
1062 AddToWorkList(Add.Val);
1063 return DAG.getNode(ISD::AND, VT, N0, Add);
1068 // Unconditionally lower X%C -> X-X/C*C. This allows the X/C logic to hack on
1069 // the remainder operation.
1070 if (N1C && !N1C->isNullValue()) {
1071 SDOperand Div = DAG.getNode(ISD::UDIV, VT, N0, N1);
1072 SDOperand Mul = DAG.getNode(ISD::MUL, VT, Div, N1);
1073 SDOperand Sub = DAG.getNode(ISD::SUB, VT, N0, Mul);
1074 AddToWorkList(Div.Val);
1075 AddToWorkList(Mul.Val);
1082 SDOperand DAGCombiner::visitMULHS(SDNode *N) {
1083 SDOperand N0 = N->getOperand(0);
1084 SDOperand N1 = N->getOperand(1);
1085 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1087 // fold (mulhs x, 0) -> 0
1088 if (N1C && N1C->isNullValue())
1090 // fold (mulhs x, 1) -> (sra x, size(x)-1)
1091 if (N1C && N1C->getValue() == 1)
1092 return DAG.getNode(ISD::SRA, N0.getValueType(), N0,
1093 DAG.getConstant(MVT::getSizeInBits(N0.getValueType())-1,
1094 TLI.getShiftAmountTy()));
1098 SDOperand DAGCombiner::visitMULHU(SDNode *N) {
1099 SDOperand N0 = N->getOperand(0);
1100 SDOperand N1 = N->getOperand(1);
1101 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1103 // fold (mulhu x, 0) -> 0
1104 if (N1C && N1C->isNullValue())
1106 // fold (mulhu x, 1) -> 0
1107 if (N1C && N1C->getValue() == 1)
1108 return DAG.getConstant(0, N0.getValueType());
1112 /// SimplifyBinOpWithSameOpcodeHands - If this is a binary operator with
1113 /// two operands of the same opcode, try to simplify it.
1114 SDOperand DAGCombiner::SimplifyBinOpWithSameOpcodeHands(SDNode *N) {
1115 SDOperand N0 = N->getOperand(0), N1 = N->getOperand(1);
1116 MVT::ValueType VT = N0.getValueType();
1117 assert(N0.getOpcode() == N1.getOpcode() && "Bad input!");
1119 // For each of OP in AND/OR/XOR:
1120 // fold (OP (zext x), (zext y)) -> (zext (OP x, y))
1121 // fold (OP (sext x), (sext y)) -> (sext (OP x, y))
1122 // fold (OP (aext x), (aext y)) -> (aext (OP x, y))
1123 // fold (OP (trunc x), (trunc y)) -> (trunc (OP x, y))
1124 if ((N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND||
1125 N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::TRUNCATE) &&
1126 N0.getOperand(0).getValueType() == N1.getOperand(0).getValueType()) {
1127 SDOperand ORNode = DAG.getNode(N->getOpcode(),
1128 N0.getOperand(0).getValueType(),
1129 N0.getOperand(0), N1.getOperand(0));
1130 AddToWorkList(ORNode.Val);
1131 return DAG.getNode(N0.getOpcode(), VT, ORNode);
1134 // For each of OP in SHL/SRL/SRA/AND...
1135 // fold (and (OP x, z), (OP y, z)) -> (OP (and x, y), z)
1136 // fold (or (OP x, z), (OP y, z)) -> (OP (or x, y), z)
1137 // fold (xor (OP x, z), (OP y, z)) -> (OP (xor x, y), z)
1138 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL ||
1139 N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::AND) &&
1140 N0.getOperand(1) == N1.getOperand(1)) {
1141 SDOperand ORNode = DAG.getNode(N->getOpcode(),
1142 N0.getOperand(0).getValueType(),
1143 N0.getOperand(0), N1.getOperand(0));
1144 AddToWorkList(ORNode.Val);
1145 return DAG.getNode(N0.getOpcode(), VT, ORNode, N0.getOperand(1));
1151 SDOperand DAGCombiner::visitAND(SDNode *N) {
1152 SDOperand N0 = N->getOperand(0);
1153 SDOperand N1 = N->getOperand(1);
1154 SDOperand LL, LR, RL, RR, CC0, CC1;
1155 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1156 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1157 MVT::ValueType VT = N1.getValueType();
1159 // fold (and c1, c2) -> c1&c2
1161 return DAG.getNode(ISD::AND, VT, N0, N1);
1162 // canonicalize constant to RHS
1164 return DAG.getNode(ISD::AND, VT, N1, N0);
1165 // fold (and x, -1) -> x
1166 if (N1C && N1C->isAllOnesValue())
1168 // if (and x, c) is known to be zero, return 0
1169 if (N1C && TLI.MaskedValueIsZero(SDOperand(N, 0), MVT::getIntVTBitMask(VT)))
1170 return DAG.getConstant(0, VT);
1172 SDOperand RAND = ReassociateOps(ISD::AND, N0, N1);
1175 // fold (and (or x, 0xFFFF), 0xFF) -> 0xFF
1176 if (N1C && N0.getOpcode() == ISD::OR)
1177 if (ConstantSDNode *ORI = dyn_cast<ConstantSDNode>(N0.getOperand(1)))
1178 if ((ORI->getValue() & N1C->getValue()) == N1C->getValue())
1180 // fold (and (any_ext V), c) -> (zero_ext V) if 'and' only clears top bits.
1181 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
1182 unsigned InMask = MVT::getIntVTBitMask(N0.getOperand(0).getValueType());
1183 if (TLI.MaskedValueIsZero(N0.getOperand(0),
1184 ~N1C->getValue() & InMask)) {
1185 SDOperand Zext = DAG.getNode(ISD::ZERO_EXTEND, N0.getValueType(),
1188 // Replace uses of the AND with uses of the Zero extend node.
1191 // We actually want to replace all uses of the any_extend with the
1192 // zero_extend, to avoid duplicating things. This will later cause this
1193 // AND to be folded.
1194 CombineTo(N0.Val, Zext);
1195 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
1198 // fold (and (setcc x), (setcc y)) -> (setcc (and x, y))
1199 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
1200 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
1201 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
1203 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 &&
1204 MVT::isInteger(LL.getValueType())) {
1205 // fold (X == 0) & (Y == 0) -> (X|Y == 0)
1206 if (cast<ConstantSDNode>(LR)->getValue() == 0 && Op1 == ISD::SETEQ) {
1207 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL);
1208 AddToWorkList(ORNode.Val);
1209 return DAG.getSetCC(VT, ORNode, LR, Op1);
1211 // fold (X == -1) & (Y == -1) -> (X&Y == -1)
1212 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETEQ) {
1213 SDOperand ANDNode = DAG.getNode(ISD::AND, LR.getValueType(), LL, RL);
1214 AddToWorkList(ANDNode.Val);
1215 return DAG.getSetCC(VT, ANDNode, LR, Op1);
1217 // fold (X > -1) & (Y > -1) -> (X|Y > -1)
1218 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETGT) {
1219 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL);
1220 AddToWorkList(ORNode.Val);
1221 return DAG.getSetCC(VT, ORNode, LR, Op1);
1224 // canonicalize equivalent to ll == rl
1225 if (LL == RR && LR == RL) {
1226 Op1 = ISD::getSetCCSwappedOperands(Op1);
1229 if (LL == RL && LR == RR) {
1230 bool isInteger = MVT::isInteger(LL.getValueType());
1231 ISD::CondCode Result = ISD::getSetCCAndOperation(Op0, Op1, isInteger);
1232 if (Result != ISD::SETCC_INVALID)
1233 return DAG.getSetCC(N0.getValueType(), LL, LR, Result);
1237 // Simplify: and (op x...), (op y...) -> (op (and x, y))
1238 if (N0.getOpcode() == N1.getOpcode()) {
1239 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N);
1240 if (Tmp.Val) return Tmp;
1243 // fold (and (sign_extend_inreg x, i16 to i32), 1) -> (and x, 1)
1244 // fold (and (sra)) -> (and (srl)) when possible.
1245 if (!MVT::isVector(VT) &&
1246 SimplifyDemandedBits(SDOperand(N, 0)))
1247 return SDOperand(N, 0);
1248 // fold (zext_inreg (extload x)) -> (zextload x)
1249 if (ISD::isEXTLoad(N0.Val) && ISD::isUNINDEXEDLoad(N0.Val)) {
1250 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
1251 MVT::ValueType EVT = LN0->getLoadedVT();
1252 // If we zero all the possible extended bits, then we can turn this into
1253 // a zextload if we are running before legalize or the operation is legal.
1254 if (TLI.MaskedValueIsZero(N1, ~0ULL << MVT::getSizeInBits(EVT)) &&
1255 (!AfterLegalize || TLI.isLoadXLegal(ISD::ZEXTLOAD, EVT))) {
1256 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, LN0->getChain(),
1257 LN0->getBasePtr(), LN0->getSrcValue(),
1258 LN0->getSrcValueOffset(), EVT);
1260 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1));
1261 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
1264 // fold (zext_inreg (sextload x)) -> (zextload x) iff load has one use
1265 if (ISD::isSEXTLoad(N0.Val) && ISD::isUNINDEXEDLoad(N0.Val) &&
1267 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
1268 MVT::ValueType EVT = LN0->getLoadedVT();
1269 // If we zero all the possible extended bits, then we can turn this into
1270 // a zextload if we are running before legalize or the operation is legal.
1271 if (TLI.MaskedValueIsZero(N1, ~0ULL << MVT::getSizeInBits(EVT)) &&
1272 (!AfterLegalize || TLI.isLoadXLegal(ISD::ZEXTLOAD, EVT))) {
1273 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, LN0->getChain(),
1274 LN0->getBasePtr(), LN0->getSrcValue(),
1275 LN0->getSrcValueOffset(), EVT);
1277 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1));
1278 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
1282 // fold (and (load x), 255) -> (zextload x, i8)
1283 // fold (and (extload x, i16), 255) -> (zextload x, i8)
1284 if (N1C && N0.getOpcode() == ISD::LOAD) {
1285 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
1286 if (LN0->getExtensionType() != ISD::SEXTLOAD &&
1287 LN0->getAddressingMode() == ISD::UNINDEXED &&
1289 MVT::ValueType EVT, LoadedVT;
1290 if (N1C->getValue() == 255)
1292 else if (N1C->getValue() == 65535)
1294 else if (N1C->getValue() == ~0U)
1299 LoadedVT = LN0->getLoadedVT();
1300 if (EVT != MVT::Other && LoadedVT > EVT &&
1301 (!AfterLegalize || TLI.isLoadXLegal(ISD::ZEXTLOAD, EVT))) {
1302 MVT::ValueType PtrType = N0.getOperand(1).getValueType();
1303 // For big endian targets, we need to add an offset to the pointer to
1304 // load the correct bytes. For little endian systems, we merely need to
1305 // read fewer bytes from the same pointer.
1307 (MVT::getSizeInBits(LoadedVT) - MVT::getSizeInBits(EVT)) / 8;
1308 SDOperand NewPtr = LN0->getBasePtr();
1309 if (!TLI.isLittleEndian())
1310 NewPtr = DAG.getNode(ISD::ADD, PtrType, NewPtr,
1311 DAG.getConstant(PtrOff, PtrType));
1312 AddToWorkList(NewPtr.Val);
1314 DAG.getExtLoad(ISD::ZEXTLOAD, VT, LN0->getChain(), NewPtr,
1315 LN0->getSrcValue(), LN0->getSrcValueOffset(), EVT);
1317 CombineTo(N0.Val, Load, Load.getValue(1));
1318 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
1326 SDOperand DAGCombiner::visitOR(SDNode *N) {
1327 SDOperand N0 = N->getOperand(0);
1328 SDOperand N1 = N->getOperand(1);
1329 SDOperand LL, LR, RL, RR, CC0, CC1;
1330 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1331 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1332 MVT::ValueType VT = N1.getValueType();
1333 unsigned OpSizeInBits = MVT::getSizeInBits(VT);
1335 // fold (or c1, c2) -> c1|c2
1337 return DAG.getNode(ISD::OR, VT, N0, N1);
1338 // canonicalize constant to RHS
1340 return DAG.getNode(ISD::OR, VT, N1, N0);
1341 // fold (or x, 0) -> x
1342 if (N1C && N1C->isNullValue())
1344 // fold (or x, -1) -> -1
1345 if (N1C && N1C->isAllOnesValue())
1347 // fold (or x, c) -> c iff (x & ~c) == 0
1349 TLI.MaskedValueIsZero(N0,~N1C->getValue() & (~0ULL>>(64-OpSizeInBits))))
1352 SDOperand ROR = ReassociateOps(ISD::OR, N0, N1);
1355 // Canonicalize (or (and X, c1), c2) -> (and (or X, c2), c1|c2)
1356 if (N1C && N0.getOpcode() == ISD::AND && N0.Val->hasOneUse() &&
1357 isa<ConstantSDNode>(N0.getOperand(1))) {
1358 ConstantSDNode *C1 = cast<ConstantSDNode>(N0.getOperand(1));
1359 return DAG.getNode(ISD::AND, VT, DAG.getNode(ISD::OR, VT, N0.getOperand(0),
1361 DAG.getConstant(N1C->getValue() | C1->getValue(), VT));
1363 // fold (or (setcc x), (setcc y)) -> (setcc (or x, y))
1364 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
1365 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
1366 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
1368 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 &&
1369 MVT::isInteger(LL.getValueType())) {
1370 // fold (X != 0) | (Y != 0) -> (X|Y != 0)
1371 // fold (X < 0) | (Y < 0) -> (X|Y < 0)
1372 if (cast<ConstantSDNode>(LR)->getValue() == 0 &&
1373 (Op1 == ISD::SETNE || Op1 == ISD::SETLT)) {
1374 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL);
1375 AddToWorkList(ORNode.Val);
1376 return DAG.getSetCC(VT, ORNode, LR, Op1);
1378 // fold (X != -1) | (Y != -1) -> (X&Y != -1)
1379 // fold (X > -1) | (Y > -1) -> (X&Y > -1)
1380 if (cast<ConstantSDNode>(LR)->isAllOnesValue() &&
1381 (Op1 == ISD::SETNE || Op1 == ISD::SETGT)) {
1382 SDOperand ANDNode = DAG.getNode(ISD::AND, LR.getValueType(), LL, RL);
1383 AddToWorkList(ANDNode.Val);
1384 return DAG.getSetCC(VT, ANDNode, LR, Op1);
1387 // canonicalize equivalent to ll == rl
1388 if (LL == RR && LR == RL) {
1389 Op1 = ISD::getSetCCSwappedOperands(Op1);
1392 if (LL == RL && LR == RR) {
1393 bool isInteger = MVT::isInteger(LL.getValueType());
1394 ISD::CondCode Result = ISD::getSetCCOrOperation(Op0, Op1, isInteger);
1395 if (Result != ISD::SETCC_INVALID)
1396 return DAG.getSetCC(N0.getValueType(), LL, LR, Result);
1400 // Simplify: or (op x...), (op y...) -> (op (or x, y))
1401 if (N0.getOpcode() == N1.getOpcode()) {
1402 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N);
1403 if (Tmp.Val) return Tmp;
1406 // (X & C1) | (Y & C2) -> (X|Y) & C3 if possible.
1407 if (N0.getOpcode() == ISD::AND &&
1408 N1.getOpcode() == ISD::AND &&
1409 N0.getOperand(1).getOpcode() == ISD::Constant &&
1410 N1.getOperand(1).getOpcode() == ISD::Constant &&
1411 // Don't increase # computations.
1412 (N0.Val->hasOneUse() || N1.Val->hasOneUse())) {
1413 // We can only do this xform if we know that bits from X that are set in C2
1414 // but not in C1 are already zero. Likewise for Y.
1415 uint64_t LHSMask = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
1416 uint64_t RHSMask = cast<ConstantSDNode>(N1.getOperand(1))->getValue();
1418 if (TLI.MaskedValueIsZero(N0.getOperand(0), RHSMask&~LHSMask) &&
1419 TLI.MaskedValueIsZero(N1.getOperand(0), LHSMask&~RHSMask)) {
1420 SDOperand X =DAG.getNode(ISD::OR, VT, N0.getOperand(0), N1.getOperand(0));
1421 return DAG.getNode(ISD::AND, VT, X, DAG.getConstant(LHSMask|RHSMask, VT));
1426 // See if this is some rotate idiom.
1427 if (SDNode *Rot = MatchRotate(N0, N1))
1428 return SDOperand(Rot, 0);
1434 /// MatchRotateHalf - Match "(X shl/srl V1) & V2" where V2 may not be present.
1435 static bool MatchRotateHalf(SDOperand Op, SDOperand &Shift, SDOperand &Mask) {
1436 if (Op.getOpcode() == ISD::AND) {
1437 if (isa<ConstantSDNode>(Op.getOperand(1))) {
1438 Mask = Op.getOperand(1);
1439 Op = Op.getOperand(0);
1445 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SHL) {
1453 // MatchRotate - Handle an 'or' of two operands. If this is one of the many
1454 // idioms for rotate, and if the target supports rotation instructions, generate
1456 SDNode *DAGCombiner::MatchRotate(SDOperand LHS, SDOperand RHS) {
1457 // Must be a legal type. Expanded an promoted things won't work with rotates.
1458 MVT::ValueType VT = LHS.getValueType();
1459 if (!TLI.isTypeLegal(VT)) return 0;
1461 // The target must have at least one rotate flavor.
1462 bool HasROTL = TLI.isOperationLegal(ISD::ROTL, VT);
1463 bool HasROTR = TLI.isOperationLegal(ISD::ROTR, VT);
1464 if (!HasROTL && !HasROTR) return 0;
1466 // Match "(X shl/srl V1) & V2" where V2 may not be present.
1467 SDOperand LHSShift; // The shift.
1468 SDOperand LHSMask; // AND value if any.
1469 if (!MatchRotateHalf(LHS, LHSShift, LHSMask))
1470 return 0; // Not part of a rotate.
1472 SDOperand RHSShift; // The shift.
1473 SDOperand RHSMask; // AND value if any.
1474 if (!MatchRotateHalf(RHS, RHSShift, RHSMask))
1475 return 0; // Not part of a rotate.
1477 if (LHSShift.getOperand(0) != RHSShift.getOperand(0))
1478 return 0; // Not shifting the same value.
1480 if (LHSShift.getOpcode() == RHSShift.getOpcode())
1481 return 0; // Shifts must disagree.
1483 // Canonicalize shl to left side in a shl/srl pair.
1484 if (RHSShift.getOpcode() == ISD::SHL) {
1485 std::swap(LHS, RHS);
1486 std::swap(LHSShift, RHSShift);
1487 std::swap(LHSMask , RHSMask );
1490 unsigned OpSizeInBits = MVT::getSizeInBits(VT);
1492 // fold (or (shl x, C1), (srl x, C2)) -> (rotl x, C1)
1493 // fold (or (shl x, C1), (srl x, C2)) -> (rotr x, C2)
1494 if (LHSShift.getOperand(1).getOpcode() == ISD::Constant &&
1495 RHSShift.getOperand(1).getOpcode() == ISD::Constant) {
1496 uint64_t LShVal = cast<ConstantSDNode>(LHSShift.getOperand(1))->getValue();
1497 uint64_t RShVal = cast<ConstantSDNode>(RHSShift.getOperand(1))->getValue();
1498 if ((LShVal + RShVal) != OpSizeInBits)
1503 Rot = DAG.getNode(ISD::ROTL, VT, LHSShift.getOperand(0),
1504 LHSShift.getOperand(1));
1506 Rot = DAG.getNode(ISD::ROTR, VT, LHSShift.getOperand(0),
1507 RHSShift.getOperand(1));
1509 // If there is an AND of either shifted operand, apply it to the result.
1510 if (LHSMask.Val || RHSMask.Val) {
1511 uint64_t Mask = MVT::getIntVTBitMask(VT);
1514 uint64_t RHSBits = (1ULL << LShVal)-1;
1515 Mask &= cast<ConstantSDNode>(LHSMask)->getValue() | RHSBits;
1518 uint64_t LHSBits = ~((1ULL << (OpSizeInBits-RShVal))-1);
1519 Mask &= cast<ConstantSDNode>(RHSMask)->getValue() | LHSBits;
1522 Rot = DAG.getNode(ISD::AND, VT, Rot, DAG.getConstant(Mask, VT));
1528 // If there is a mask here, and we have a variable shift, we can't be sure
1529 // that we're masking out the right stuff.
1530 if (LHSMask.Val || RHSMask.Val)
1533 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotl x, y)
1534 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotr x, (sub 32, y))
1535 if (RHSShift.getOperand(1).getOpcode() == ISD::SUB &&
1536 LHSShift.getOperand(1) == RHSShift.getOperand(1).getOperand(1)) {
1537 if (ConstantSDNode *SUBC =
1538 dyn_cast<ConstantSDNode>(RHSShift.getOperand(1).getOperand(0))) {
1539 if (SUBC->getValue() == OpSizeInBits)
1541 return DAG.getNode(ISD::ROTL, VT, LHSShift.getOperand(0),
1542 LHSShift.getOperand(1)).Val;
1544 return DAG.getNode(ISD::ROTR, VT, LHSShift.getOperand(0),
1545 LHSShift.getOperand(1)).Val;
1549 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotr x, y)
1550 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotl x, (sub 32, y))
1551 if (LHSShift.getOperand(1).getOpcode() == ISD::SUB &&
1552 RHSShift.getOperand(1) == LHSShift.getOperand(1).getOperand(1)) {
1553 if (ConstantSDNode *SUBC =
1554 dyn_cast<ConstantSDNode>(LHSShift.getOperand(1).getOperand(0))) {
1555 if (SUBC->getValue() == OpSizeInBits)
1557 return DAG.getNode(ISD::ROTL, VT, LHSShift.getOperand(0),
1558 LHSShift.getOperand(1)).Val;
1560 return DAG.getNode(ISD::ROTR, VT, LHSShift.getOperand(0),
1561 RHSShift.getOperand(1)).Val;
1569 SDOperand DAGCombiner::visitXOR(SDNode *N) {
1570 SDOperand N0 = N->getOperand(0);
1571 SDOperand N1 = N->getOperand(1);
1572 SDOperand LHS, RHS, CC;
1573 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1574 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1575 MVT::ValueType VT = N0.getValueType();
1577 // fold (xor c1, c2) -> c1^c2
1579 return DAG.getNode(ISD::XOR, VT, N0, N1);
1580 // canonicalize constant to RHS
1582 return DAG.getNode(ISD::XOR, VT, N1, N0);
1583 // fold (xor x, 0) -> x
1584 if (N1C && N1C->isNullValue())
1587 SDOperand RXOR = ReassociateOps(ISD::XOR, N0, N1);
1590 // fold !(x cc y) -> (x !cc y)
1591 if (N1C && N1C->getValue() == 1 && isSetCCEquivalent(N0, LHS, RHS, CC)) {
1592 bool isInt = MVT::isInteger(LHS.getValueType());
1593 ISD::CondCode NotCC = ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
1595 if (N0.getOpcode() == ISD::SETCC)
1596 return DAG.getSetCC(VT, LHS, RHS, NotCC);
1597 if (N0.getOpcode() == ISD::SELECT_CC)
1598 return DAG.getSelectCC(LHS, RHS, N0.getOperand(2),N0.getOperand(3),NotCC);
1599 assert(0 && "Unhandled SetCC Equivalent!");
1602 // fold !(x or y) -> (!x and !y) iff x or y are setcc
1603 if (N1C && N1C->getValue() == 1 && VT == MVT::i1 &&
1604 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
1605 SDOperand LHS = N0.getOperand(0), RHS = N0.getOperand(1);
1606 if (isOneUseSetCC(RHS) || isOneUseSetCC(LHS)) {
1607 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
1608 LHS = DAG.getNode(ISD::XOR, VT, LHS, N1); // RHS = ~LHS
1609 RHS = DAG.getNode(ISD::XOR, VT, RHS, N1); // RHS = ~RHS
1610 AddToWorkList(LHS.Val); AddToWorkList(RHS.Val);
1611 return DAG.getNode(NewOpcode, VT, LHS, RHS);
1614 // fold !(x or y) -> (!x and !y) iff x or y are constants
1615 if (N1C && N1C->isAllOnesValue() &&
1616 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
1617 SDOperand LHS = N0.getOperand(0), RHS = N0.getOperand(1);
1618 if (isa<ConstantSDNode>(RHS) || isa<ConstantSDNode>(LHS)) {
1619 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
1620 LHS = DAG.getNode(ISD::XOR, VT, LHS, N1); // RHS = ~LHS
1621 RHS = DAG.getNode(ISD::XOR, VT, RHS, N1); // RHS = ~RHS
1622 AddToWorkList(LHS.Val); AddToWorkList(RHS.Val);
1623 return DAG.getNode(NewOpcode, VT, LHS, RHS);
1626 // fold (xor (xor x, c1), c2) -> (xor x, c1^c2)
1627 if (N1C && N0.getOpcode() == ISD::XOR) {
1628 ConstantSDNode *N00C = dyn_cast<ConstantSDNode>(N0.getOperand(0));
1629 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
1631 return DAG.getNode(ISD::XOR, VT, N0.getOperand(1),
1632 DAG.getConstant(N1C->getValue()^N00C->getValue(), VT));
1634 return DAG.getNode(ISD::XOR, VT, N0.getOperand(0),
1635 DAG.getConstant(N1C->getValue()^N01C->getValue(), VT));
1637 // fold (xor x, x) -> 0
1639 if (!MVT::isVector(VT)) {
1640 return DAG.getConstant(0, VT);
1641 } else if (!AfterLegalize || TLI.isOperationLegal(ISD::BUILD_VECTOR, VT)) {
1642 // Produce a vector of zeros.
1643 SDOperand El = DAG.getConstant(0, MVT::getVectorBaseType(VT));
1644 std::vector<SDOperand> Ops(MVT::getVectorNumElements(VT), El);
1645 return DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
1649 // Simplify: xor (op x...), (op y...) -> (op (xor x, y))
1650 if (N0.getOpcode() == N1.getOpcode()) {
1651 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N);
1652 if (Tmp.Val) return Tmp;
1655 // Simplify the expression using non-local knowledge.
1656 if (!MVT::isVector(VT) &&
1657 SimplifyDemandedBits(SDOperand(N, 0)))
1658 return SDOperand(N, 0);
1663 SDOperand DAGCombiner::visitSHL(SDNode *N) {
1664 SDOperand N0 = N->getOperand(0);
1665 SDOperand N1 = N->getOperand(1);
1666 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1667 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1668 MVT::ValueType VT = N0.getValueType();
1669 unsigned OpSizeInBits = MVT::getSizeInBits(VT);
1671 // fold (shl c1, c2) -> c1<<c2
1673 return DAG.getNode(ISD::SHL, VT, N0, N1);
1674 // fold (shl 0, x) -> 0
1675 if (N0C && N0C->isNullValue())
1677 // fold (shl x, c >= size(x)) -> undef
1678 if (N1C && N1C->getValue() >= OpSizeInBits)
1679 return DAG.getNode(ISD::UNDEF, VT);
1680 // fold (shl x, 0) -> x
1681 if (N1C && N1C->isNullValue())
1683 // if (shl x, c) is known to be zero, return 0
1684 if (TLI.MaskedValueIsZero(SDOperand(N, 0), MVT::getIntVTBitMask(VT)))
1685 return DAG.getConstant(0, VT);
1686 if (SimplifyDemandedBits(SDOperand(N, 0)))
1687 return SDOperand(N, 0);
1688 // fold (shl (shl x, c1), c2) -> 0 or (shl x, c1+c2)
1689 if (N1C && N0.getOpcode() == ISD::SHL &&
1690 N0.getOperand(1).getOpcode() == ISD::Constant) {
1691 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
1692 uint64_t c2 = N1C->getValue();
1693 if (c1 + c2 > OpSizeInBits)
1694 return DAG.getConstant(0, VT);
1695 return DAG.getNode(ISD::SHL, VT, N0.getOperand(0),
1696 DAG.getConstant(c1 + c2, N1.getValueType()));
1698 // fold (shl (srl x, c1), c2) -> (shl (and x, -1 << c1), c2-c1) or
1699 // (srl (and x, -1 << c1), c1-c2)
1700 if (N1C && N0.getOpcode() == ISD::SRL &&
1701 N0.getOperand(1).getOpcode() == ISD::Constant) {
1702 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
1703 uint64_t c2 = N1C->getValue();
1704 SDOperand Mask = DAG.getNode(ISD::AND, VT, N0.getOperand(0),
1705 DAG.getConstant(~0ULL << c1, VT));
1707 return DAG.getNode(ISD::SHL, VT, Mask,
1708 DAG.getConstant(c2-c1, N1.getValueType()));
1710 return DAG.getNode(ISD::SRL, VT, Mask,
1711 DAG.getConstant(c1-c2, N1.getValueType()));
1713 // fold (shl (sra x, c1), c1) -> (and x, -1 << c1)
1714 if (N1C && N0.getOpcode() == ISD::SRA && N1 == N0.getOperand(1))
1715 return DAG.getNode(ISD::AND, VT, N0.getOperand(0),
1716 DAG.getConstant(~0ULL << N1C->getValue(), VT));
1720 SDOperand DAGCombiner::visitSRA(SDNode *N) {
1721 SDOperand N0 = N->getOperand(0);
1722 SDOperand N1 = N->getOperand(1);
1723 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1724 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1725 MVT::ValueType VT = N0.getValueType();
1727 // fold (sra c1, c2) -> c1>>c2
1729 return DAG.getNode(ISD::SRA, VT, N0, N1);
1730 // fold (sra 0, x) -> 0
1731 if (N0C && N0C->isNullValue())
1733 // fold (sra -1, x) -> -1
1734 if (N0C && N0C->isAllOnesValue())
1736 // fold (sra x, c >= size(x)) -> undef
1737 if (N1C && N1C->getValue() >= MVT::getSizeInBits(VT))
1738 return DAG.getNode(ISD::UNDEF, VT);
1739 // fold (sra x, 0) -> x
1740 if (N1C && N1C->isNullValue())
1742 // fold (sra (shl x, c1), c1) -> sext_inreg for some c1 and target supports
1744 if (N1C && N0.getOpcode() == ISD::SHL && N1 == N0.getOperand(1)) {
1745 unsigned LowBits = MVT::getSizeInBits(VT) - (unsigned)N1C->getValue();
1748 default: EVT = MVT::Other; break;
1749 case 1: EVT = MVT::i1; break;
1750 case 8: EVT = MVT::i8; break;
1751 case 16: EVT = MVT::i16; break;
1752 case 32: EVT = MVT::i32; break;
1754 if (EVT > MVT::Other && TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, EVT))
1755 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0.getOperand(0),
1756 DAG.getValueType(EVT));
1759 // fold (sra (sra x, c1), c2) -> (sra x, c1+c2)
1760 if (N1C && N0.getOpcode() == ISD::SRA) {
1761 if (ConstantSDNode *C1 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
1762 unsigned Sum = N1C->getValue() + C1->getValue();
1763 if (Sum >= MVT::getSizeInBits(VT)) Sum = MVT::getSizeInBits(VT)-1;
1764 return DAG.getNode(ISD::SRA, VT, N0.getOperand(0),
1765 DAG.getConstant(Sum, N1C->getValueType(0)));
1769 // Simplify, based on bits shifted out of the LHS.
1770 if (N1C && SimplifyDemandedBits(SDOperand(N, 0)))
1771 return SDOperand(N, 0);
1774 // If the sign bit is known to be zero, switch this to a SRL.
1775 if (TLI.MaskedValueIsZero(N0, MVT::getIntVTSignBit(VT)))
1776 return DAG.getNode(ISD::SRL, VT, N0, N1);
1780 SDOperand DAGCombiner::visitSRL(SDNode *N) {
1781 SDOperand N0 = N->getOperand(0);
1782 SDOperand N1 = N->getOperand(1);
1783 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1784 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1785 MVT::ValueType VT = N0.getValueType();
1786 unsigned OpSizeInBits = MVT::getSizeInBits(VT);
1788 // fold (srl c1, c2) -> c1 >>u c2
1790 return DAG.getNode(ISD::SRL, VT, N0, N1);
1791 // fold (srl 0, x) -> 0
1792 if (N0C && N0C->isNullValue())
1794 // fold (srl x, c >= size(x)) -> undef
1795 if (N1C && N1C->getValue() >= OpSizeInBits)
1796 return DAG.getNode(ISD::UNDEF, VT);
1797 // fold (srl x, 0) -> x
1798 if (N1C && N1C->isNullValue())
1800 // if (srl x, c) is known to be zero, return 0
1801 if (N1C && TLI.MaskedValueIsZero(SDOperand(N, 0), ~0ULL >> (64-OpSizeInBits)))
1802 return DAG.getConstant(0, VT);
1803 // fold (srl (srl x, c1), c2) -> 0 or (srl x, c1+c2)
1804 if (N1C && N0.getOpcode() == ISD::SRL &&
1805 N0.getOperand(1).getOpcode() == ISD::Constant) {
1806 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
1807 uint64_t c2 = N1C->getValue();
1808 if (c1 + c2 > OpSizeInBits)
1809 return DAG.getConstant(0, VT);
1810 return DAG.getNode(ISD::SRL, VT, N0.getOperand(0),
1811 DAG.getConstant(c1 + c2, N1.getValueType()));
1814 // fold (srl (anyextend x), c) -> (anyextend (srl x, c))
1815 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
1816 // Shifting in all undef bits?
1817 MVT::ValueType SmallVT = N0.getOperand(0).getValueType();
1818 if (N1C->getValue() >= MVT::getSizeInBits(SmallVT))
1819 return DAG.getNode(ISD::UNDEF, VT);
1821 SDOperand SmallShift = DAG.getNode(ISD::SRL, SmallVT, N0.getOperand(0), N1);
1822 AddToWorkList(SmallShift.Val);
1823 return DAG.getNode(ISD::ANY_EXTEND, VT, SmallShift);
1826 // fold (srl (sra X, Y), 31) -> (srl X, 31). This srl only looks at the sign
1827 // bit, which is unmodified by sra.
1828 if (N1C && N1C->getValue()+1 == MVT::getSizeInBits(VT)) {
1829 if (N0.getOpcode() == ISD::SRA)
1830 return DAG.getNode(ISD::SRL, VT, N0.getOperand(0), N1);
1833 // fold (srl (ctlz x), "5") -> x iff x has one bit set (the low bit).
1834 if (N1C && N0.getOpcode() == ISD::CTLZ &&
1835 N1C->getValue() == Log2_32(MVT::getSizeInBits(VT))) {
1836 uint64_t KnownZero, KnownOne, Mask = MVT::getIntVTBitMask(VT);
1837 TLI.ComputeMaskedBits(N0.getOperand(0), Mask, KnownZero, KnownOne);
1839 // If any of the input bits are KnownOne, then the input couldn't be all
1840 // zeros, thus the result of the srl will always be zero.
1841 if (KnownOne) return DAG.getConstant(0, VT);
1843 // If all of the bits input the to ctlz node are known to be zero, then
1844 // the result of the ctlz is "32" and the result of the shift is one.
1845 uint64_t UnknownBits = ~KnownZero & Mask;
1846 if (UnknownBits == 0) return DAG.getConstant(1, VT);
1848 // Otherwise, check to see if there is exactly one bit input to the ctlz.
1849 if ((UnknownBits & (UnknownBits-1)) == 0) {
1850 // Okay, we know that only that the single bit specified by UnknownBits
1851 // could be set on input to the CTLZ node. If this bit is set, the SRL
1852 // will return 0, if it is clear, it returns 1. Change the CTLZ/SRL pair
1853 // to an SRL,XOR pair, which is likely to simplify more.
1854 unsigned ShAmt = CountTrailingZeros_64(UnknownBits);
1855 SDOperand Op = N0.getOperand(0);
1857 Op = DAG.getNode(ISD::SRL, VT, Op,
1858 DAG.getConstant(ShAmt, TLI.getShiftAmountTy()));
1859 AddToWorkList(Op.Val);
1861 return DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(1, VT));
1868 SDOperand DAGCombiner::visitCTLZ(SDNode *N) {
1869 SDOperand N0 = N->getOperand(0);
1870 MVT::ValueType VT = N->getValueType(0);
1872 // fold (ctlz c1) -> c2
1873 if (isa<ConstantSDNode>(N0))
1874 return DAG.getNode(ISD::CTLZ, VT, N0);
1878 SDOperand DAGCombiner::visitCTTZ(SDNode *N) {
1879 SDOperand N0 = N->getOperand(0);
1880 MVT::ValueType VT = N->getValueType(0);
1882 // fold (cttz c1) -> c2
1883 if (isa<ConstantSDNode>(N0))
1884 return DAG.getNode(ISD::CTTZ, VT, N0);
1888 SDOperand DAGCombiner::visitCTPOP(SDNode *N) {
1889 SDOperand N0 = N->getOperand(0);
1890 MVT::ValueType VT = N->getValueType(0);
1892 // fold (ctpop c1) -> c2
1893 if (isa<ConstantSDNode>(N0))
1894 return DAG.getNode(ISD::CTPOP, VT, N0);
1898 SDOperand DAGCombiner::visitSELECT(SDNode *N) {
1899 SDOperand N0 = N->getOperand(0);
1900 SDOperand N1 = N->getOperand(1);
1901 SDOperand N2 = N->getOperand(2);
1902 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1903 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1904 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2);
1905 MVT::ValueType VT = N->getValueType(0);
1907 // fold select C, X, X -> X
1910 // fold select true, X, Y -> X
1911 if (N0C && !N0C->isNullValue())
1913 // fold select false, X, Y -> Y
1914 if (N0C && N0C->isNullValue())
1916 // fold select C, 1, X -> C | X
1917 if (MVT::i1 == VT && N1C && N1C->getValue() == 1)
1918 return DAG.getNode(ISD::OR, VT, N0, N2);
1919 // fold select C, 0, X -> ~C & X
1920 // FIXME: this should check for C type == X type, not i1?
1921 if (MVT::i1 == VT && N1C && N1C->isNullValue()) {
1922 SDOperand XORNode = DAG.getNode(ISD::XOR, VT, N0, DAG.getConstant(1, VT));
1923 AddToWorkList(XORNode.Val);
1924 return DAG.getNode(ISD::AND, VT, XORNode, N2);
1926 // fold select C, X, 1 -> ~C | X
1927 if (MVT::i1 == VT && N2C && N2C->getValue() == 1) {
1928 SDOperand XORNode = DAG.getNode(ISD::XOR, VT, N0, DAG.getConstant(1, VT));
1929 AddToWorkList(XORNode.Val);
1930 return DAG.getNode(ISD::OR, VT, XORNode, N1);
1932 // fold select C, X, 0 -> C & X
1933 // FIXME: this should check for C type == X type, not i1?
1934 if (MVT::i1 == VT && N2C && N2C->isNullValue())
1935 return DAG.getNode(ISD::AND, VT, N0, N1);
1936 // fold X ? X : Y --> X ? 1 : Y --> X | Y
1937 if (MVT::i1 == VT && N0 == N1)
1938 return DAG.getNode(ISD::OR, VT, N0, N2);
1939 // fold X ? Y : X --> X ? Y : 0 --> X & Y
1940 if (MVT::i1 == VT && N0 == N2)
1941 return DAG.getNode(ISD::AND, VT, N0, N1);
1943 // If we can fold this based on the true/false value, do so.
1944 if (SimplifySelectOps(N, N1, N2))
1945 return SDOperand(N, 0); // Don't revisit N.
1947 // fold selects based on a setcc into other things, such as min/max/abs
1948 if (N0.getOpcode() == ISD::SETCC)
1950 // Check against MVT::Other for SELECT_CC, which is a workaround for targets
1951 // having to say they don't support SELECT_CC on every type the DAG knows
1952 // about, since there is no way to mark an opcode illegal at all value types
1953 if (TLI.isOperationLegal(ISD::SELECT_CC, MVT::Other))
1954 return DAG.getNode(ISD::SELECT_CC, VT, N0.getOperand(0), N0.getOperand(1),
1955 N1, N2, N0.getOperand(2));
1957 return SimplifySelect(N0, N1, N2);
1961 SDOperand DAGCombiner::visitSELECT_CC(SDNode *N) {
1962 SDOperand N0 = N->getOperand(0);
1963 SDOperand N1 = N->getOperand(1);
1964 SDOperand N2 = N->getOperand(2);
1965 SDOperand N3 = N->getOperand(3);
1966 SDOperand N4 = N->getOperand(4);
1967 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get();
1969 // fold select_cc lhs, rhs, x, x, cc -> x
1973 // Determine if the condition we're dealing with is constant
1974 SDOperand SCC = SimplifySetCC(TLI.getSetCCResultTy(), N0, N1, CC, false);
1975 if (SCC.Val) AddToWorkList(SCC.Val);
1977 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.Val)) {
1978 if (SCCC->getValue())
1979 return N2; // cond always true -> true val
1981 return N3; // cond always false -> false val
1984 // Fold to a simpler select_cc
1985 if (SCC.Val && SCC.getOpcode() == ISD::SETCC)
1986 return DAG.getNode(ISD::SELECT_CC, N2.getValueType(),
1987 SCC.getOperand(0), SCC.getOperand(1), N2, N3,
1990 // If we can fold this based on the true/false value, do so.
1991 if (SimplifySelectOps(N, N2, N3))
1992 return SDOperand(N, 0); // Don't revisit N.
1994 // fold select_cc into other things, such as min/max/abs
1995 return SimplifySelectCC(N0, N1, N2, N3, CC);
1998 SDOperand DAGCombiner::visitSETCC(SDNode *N) {
1999 return SimplifySetCC(N->getValueType(0), N->getOperand(0), N->getOperand(1),
2000 cast<CondCodeSDNode>(N->getOperand(2))->get());
2003 SDOperand DAGCombiner::visitSIGN_EXTEND(SDNode *N) {
2004 SDOperand N0 = N->getOperand(0);
2005 MVT::ValueType VT = N->getValueType(0);
2007 // fold (sext c1) -> c1
2008 if (isa<ConstantSDNode>(N0))
2009 return DAG.getNode(ISD::SIGN_EXTEND, VT, N0);
2011 // fold (sext (sext x)) -> (sext x)
2012 // fold (sext (aext x)) -> (sext x)
2013 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
2014 return DAG.getNode(ISD::SIGN_EXTEND, VT, N0.getOperand(0));
2016 // fold (sext (truncate (load x))) -> (sext (smaller load x))
2017 // fold (sext (truncate (srl (load x), c))) -> (sext (smaller load (x+c/n)))
2018 if (N0.getOpcode() == ISD::TRUNCATE) {
2019 SDOperand NarrowLoad = ReduceLoadWidth(N0.Val);
2020 if (NarrowLoad.Val) {
2021 if (NarrowLoad.Val != N0.Val)
2022 CombineTo(N0.Val, NarrowLoad);
2023 return DAG.getNode(ISD::SIGN_EXTEND, VT, NarrowLoad);
2027 // See if the value being truncated is already sign extended. If so, just
2028 // eliminate the trunc/sext pair.
2029 if (N0.getOpcode() == ISD::TRUNCATE) {
2030 SDOperand Op = N0.getOperand(0);
2031 unsigned OpBits = MVT::getSizeInBits(Op.getValueType());
2032 unsigned MidBits = MVT::getSizeInBits(N0.getValueType());
2033 unsigned DestBits = MVT::getSizeInBits(VT);
2034 unsigned NumSignBits = TLI.ComputeNumSignBits(Op);
2036 if (OpBits == DestBits) {
2037 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
2038 // bits, it is already ready.
2039 if (NumSignBits > DestBits-MidBits)
2041 } else if (OpBits < DestBits) {
2042 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
2043 // bits, just sext from i32.
2044 if (NumSignBits > OpBits-MidBits)
2045 return DAG.getNode(ISD::SIGN_EXTEND, VT, Op);
2047 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
2048 // bits, just truncate to i32.
2049 if (NumSignBits > OpBits-MidBits)
2050 return DAG.getNode(ISD::TRUNCATE, VT, Op);
2053 // fold (sext (truncate x)) -> (sextinreg x).
2054 if (!AfterLegalize || TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG,
2055 N0.getValueType())) {
2056 if (Op.getValueType() < VT)
2057 Op = DAG.getNode(ISD::ANY_EXTEND, VT, Op);
2058 else if (Op.getValueType() > VT)
2059 Op = DAG.getNode(ISD::TRUNCATE, VT, Op);
2060 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, Op,
2061 DAG.getValueType(N0.getValueType()));
2065 // fold (sext (load x)) -> (sext (truncate (sextload x)))
2066 if (ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse() &&
2067 (!AfterLegalize||TLI.isLoadXLegal(ISD::SEXTLOAD, N0.getValueType()))){
2068 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2069 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, LN0->getChain(),
2070 LN0->getBasePtr(), LN0->getSrcValue(),
2071 LN0->getSrcValueOffset(),
2073 CombineTo(N, ExtLoad);
2074 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2075 ExtLoad.getValue(1));
2076 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2079 // fold (sext (sextload x)) -> (sext (truncate (sextload x)))
2080 // fold (sext ( extload x)) -> (sext (truncate (sextload x)))
2081 if ((ISD::isSEXTLoad(N0.Val) || ISD::isEXTLoad(N0.Val)) &&
2082 ISD::isUNINDEXEDLoad(N0.Val) && N0.hasOneUse()) {
2083 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2084 MVT::ValueType EVT = LN0->getLoadedVT();
2085 if (!AfterLegalize || TLI.isLoadXLegal(ISD::SEXTLOAD, EVT)) {
2086 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, LN0->getChain(),
2087 LN0->getBasePtr(), LN0->getSrcValue(),
2088 LN0->getSrcValueOffset(), EVT);
2089 CombineTo(N, ExtLoad);
2090 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2091 ExtLoad.getValue(1));
2092 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2099 SDOperand DAGCombiner::visitZERO_EXTEND(SDNode *N) {
2100 SDOperand N0 = N->getOperand(0);
2101 MVT::ValueType VT = N->getValueType(0);
2103 // fold (zext c1) -> c1
2104 if (isa<ConstantSDNode>(N0))
2105 return DAG.getNode(ISD::ZERO_EXTEND, VT, N0);
2106 // fold (zext (zext x)) -> (zext x)
2107 // fold (zext (aext x)) -> (zext x)
2108 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
2109 return DAG.getNode(ISD::ZERO_EXTEND, VT, N0.getOperand(0));
2111 // fold (zext (truncate (load x))) -> (zext (smaller load x))
2112 // fold (zext (truncate (srl (load x), c))) -> (zext (small load (x+c/n)))
2113 if (N0.getOpcode() == ISD::TRUNCATE) {
2114 SDOperand NarrowLoad = ReduceLoadWidth(N0.Val);
2115 if (NarrowLoad.Val) {
2116 if (NarrowLoad.Val != N0.Val)
2117 CombineTo(N0.Val, NarrowLoad);
2118 return DAG.getNode(ISD::ZERO_EXTEND, VT, NarrowLoad);
2122 // fold (zext (truncate x)) -> (and x, mask)
2123 if (N0.getOpcode() == ISD::TRUNCATE &&
2124 (!AfterLegalize || TLI.isOperationLegal(ISD::AND, VT))) {
2125 SDOperand Op = N0.getOperand(0);
2126 if (Op.getValueType() < VT) {
2127 Op = DAG.getNode(ISD::ANY_EXTEND, VT, Op);
2128 } else if (Op.getValueType() > VT) {
2129 Op = DAG.getNode(ISD::TRUNCATE, VT, Op);
2131 return DAG.getZeroExtendInReg(Op, N0.getValueType());
2134 // fold (zext (and (trunc x), cst)) -> (and x, cst).
2135 if (N0.getOpcode() == ISD::AND &&
2136 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
2137 N0.getOperand(1).getOpcode() == ISD::Constant) {
2138 SDOperand X = N0.getOperand(0).getOperand(0);
2139 if (X.getValueType() < VT) {
2140 X = DAG.getNode(ISD::ANY_EXTEND, VT, X);
2141 } else if (X.getValueType() > VT) {
2142 X = DAG.getNode(ISD::TRUNCATE, VT, X);
2144 uint64_t Mask = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
2145 return DAG.getNode(ISD::AND, VT, X, DAG.getConstant(Mask, VT));
2148 // fold (zext (load x)) -> (zext (truncate (zextload x)))
2149 if (ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse() &&
2150 (!AfterLegalize||TLI.isLoadXLegal(ISD::ZEXTLOAD, N0.getValueType()))) {
2151 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2152 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, LN0->getChain(),
2153 LN0->getBasePtr(), LN0->getSrcValue(),
2154 LN0->getSrcValueOffset(),
2156 CombineTo(N, ExtLoad);
2157 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2158 ExtLoad.getValue(1));
2159 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2162 // fold (zext (zextload x)) -> (zext (truncate (zextload x)))
2163 // fold (zext ( extload x)) -> (zext (truncate (zextload x)))
2164 if ((ISD::isZEXTLoad(N0.Val) || ISD::isEXTLoad(N0.Val)) &&
2165 ISD::isUNINDEXEDLoad(N0.Val) && N0.hasOneUse()) {
2166 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2167 MVT::ValueType EVT = LN0->getLoadedVT();
2168 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, LN0->getChain(),
2169 LN0->getBasePtr(), LN0->getSrcValue(),
2170 LN0->getSrcValueOffset(), EVT);
2171 CombineTo(N, ExtLoad);
2172 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2173 ExtLoad.getValue(1));
2174 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2179 SDOperand DAGCombiner::visitANY_EXTEND(SDNode *N) {
2180 SDOperand N0 = N->getOperand(0);
2181 MVT::ValueType VT = N->getValueType(0);
2183 // fold (aext c1) -> c1
2184 if (isa<ConstantSDNode>(N0))
2185 return DAG.getNode(ISD::ANY_EXTEND, VT, N0);
2186 // fold (aext (aext x)) -> (aext x)
2187 // fold (aext (zext x)) -> (zext x)
2188 // fold (aext (sext x)) -> (sext x)
2189 if (N0.getOpcode() == ISD::ANY_EXTEND ||
2190 N0.getOpcode() == ISD::ZERO_EXTEND ||
2191 N0.getOpcode() == ISD::SIGN_EXTEND)
2192 return DAG.getNode(N0.getOpcode(), VT, N0.getOperand(0));
2194 // fold (aext (truncate (load x))) -> (aext (smaller load x))
2195 // fold (aext (truncate (srl (load x), c))) -> (aext (small load (x+c/n)))
2196 if (N0.getOpcode() == ISD::TRUNCATE) {
2197 SDOperand NarrowLoad = ReduceLoadWidth(N0.Val);
2198 if (NarrowLoad.Val) {
2199 if (NarrowLoad.Val != N0.Val)
2200 CombineTo(N0.Val, NarrowLoad);
2201 return DAG.getNode(ISD::ANY_EXTEND, VT, NarrowLoad);
2205 // fold (aext (truncate x))
2206 if (N0.getOpcode() == ISD::TRUNCATE) {
2207 SDOperand TruncOp = N0.getOperand(0);
2208 if (TruncOp.getValueType() == VT)
2209 return TruncOp; // x iff x size == zext size.
2210 if (TruncOp.getValueType() > VT)
2211 return DAG.getNode(ISD::TRUNCATE, VT, TruncOp);
2212 return DAG.getNode(ISD::ANY_EXTEND, VT, TruncOp);
2215 // fold (aext (and (trunc x), cst)) -> (and x, cst).
2216 if (N0.getOpcode() == ISD::AND &&
2217 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
2218 N0.getOperand(1).getOpcode() == ISD::Constant) {
2219 SDOperand X = N0.getOperand(0).getOperand(0);
2220 if (X.getValueType() < VT) {
2221 X = DAG.getNode(ISD::ANY_EXTEND, VT, X);
2222 } else if (X.getValueType() > VT) {
2223 X = DAG.getNode(ISD::TRUNCATE, VT, X);
2225 uint64_t Mask = cast<ConstantSDNode>(N0.getOperand(1))->getValue();
2226 return DAG.getNode(ISD::AND, VT, X, DAG.getConstant(Mask, VT));
2229 // fold (aext (load x)) -> (aext (truncate (extload x)))
2230 if (ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse() &&
2231 (!AfterLegalize||TLI.isLoadXLegal(ISD::EXTLOAD, N0.getValueType()))) {
2232 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2233 SDOperand ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, LN0->getChain(),
2234 LN0->getBasePtr(), LN0->getSrcValue(),
2235 LN0->getSrcValueOffset(),
2237 CombineTo(N, ExtLoad);
2238 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2239 ExtLoad.getValue(1));
2240 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2243 // fold (aext (zextload x)) -> (aext (truncate (zextload x)))
2244 // fold (aext (sextload x)) -> (aext (truncate (sextload x)))
2245 // fold (aext ( extload x)) -> (aext (truncate (extload x)))
2246 if (N0.getOpcode() == ISD::LOAD &&
2247 !ISD::isNON_EXTLoad(N0.Val) && ISD::isUNINDEXEDLoad(N0.Val) &&
2249 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2250 MVT::ValueType EVT = LN0->getLoadedVT();
2251 SDOperand ExtLoad = DAG.getExtLoad(LN0->getExtensionType(), VT,
2252 LN0->getChain(), LN0->getBasePtr(),
2254 LN0->getSrcValueOffset(), EVT);
2255 CombineTo(N, ExtLoad);
2256 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad),
2257 ExtLoad.getValue(1));
2258 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2263 /// ReduceLoadWidth - If the result of a wider load is shifted to right of N
2264 /// bits and then truncated to a narrower type and where N is a multiple
2265 /// of number of bits of the narrower type, transform it to a narrower load
2266 /// from address + N / num of bits of new type. If the result is to be
2267 /// extended, also fold the extension to form a extending load.
2268 SDOperand DAGCombiner::ReduceLoadWidth(SDNode *N) {
2269 unsigned Opc = N->getOpcode();
2270 ISD::LoadExtType ExtType = ISD::NON_EXTLOAD;
2271 SDOperand N0 = N->getOperand(0);
2272 MVT::ValueType VT = N->getValueType(0);
2273 MVT::ValueType EVT = N->getValueType(0);
2275 if (Opc == ISD::SIGN_EXTEND_INREG) {
2276 ExtType = ISD::SEXTLOAD;
2277 EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
2280 unsigned EVTBits = MVT::getSizeInBits(EVT);
2282 if (N0.getOpcode() == ISD::SRL && N0.hasOneUse()) {
2283 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
2284 ShAmt = N01->getValue();
2285 // Is the shift amount a multiple of size of VT?
2286 if ((ShAmt & (EVTBits-1)) == 0) {
2287 N0 = N0.getOperand(0);
2288 if (MVT::getSizeInBits(N0.getValueType()) <= EVTBits)
2295 if (ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse() &&
2296 // Do not allow folding to i1 here. i1 is implicitly stored in memory in
2297 // zero extended form: by shrinking the load, we lose track of the fact
2298 // that it is already zero extended.
2299 // FIXME: This should be reevaluated.
2301 assert(MVT::getSizeInBits(N0.getValueType()) > EVTBits &&
2302 "Cannot truncate to larger type!");
2303 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2304 MVT::ValueType PtrType = N0.getOperand(1).getValueType();
2305 // For big endian targets, we need to add an offset to the pointer to load
2306 // the correct bytes. For little endian systems, we merely need to read
2307 // fewer bytes from the same pointer.
2308 uint64_t PtrOff = ShAmt
2309 ? ShAmt : (TLI.isLittleEndian() ? 0
2310 : (MVT::getSizeInBits(N0.getValueType()) - EVTBits) / 8);
2311 SDOperand NewPtr = DAG.getNode(ISD::ADD, PtrType, LN0->getBasePtr(),
2312 DAG.getConstant(PtrOff, PtrType));
2313 AddToWorkList(NewPtr.Val);
2314 SDOperand Load = (ExtType == ISD::NON_EXTLOAD)
2315 ? DAG.getLoad(VT, LN0->getChain(), NewPtr,
2316 LN0->getSrcValue(), LN0->getSrcValueOffset())
2317 : DAG.getExtLoad(ExtType, VT, LN0->getChain(), NewPtr,
2318 LN0->getSrcValue(), LN0->getSrcValueOffset(), EVT);
2320 CombineTo(N0.Val, Load, Load.getValue(1));
2322 return DAG.getNode(N->getOpcode(), VT, Load);
2323 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2330 SDOperand DAGCombiner::visitSIGN_EXTEND_INREG(SDNode *N) {
2331 SDOperand N0 = N->getOperand(0);
2332 SDOperand N1 = N->getOperand(1);
2333 MVT::ValueType VT = N->getValueType(0);
2334 MVT::ValueType EVT = cast<VTSDNode>(N1)->getVT();
2335 unsigned EVTBits = MVT::getSizeInBits(EVT);
2337 // fold (sext_in_reg c1) -> c1
2338 if (isa<ConstantSDNode>(N0) || N0.getOpcode() == ISD::UNDEF)
2339 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0, N1);
2341 // If the input is already sign extended, just drop the extension.
2342 if (TLI.ComputeNumSignBits(N0) >= MVT::getSizeInBits(VT)-EVTBits+1)
2345 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt2
2346 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2347 EVT < cast<VTSDNode>(N0.getOperand(1))->getVT()) {
2348 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0.getOperand(0), N1);
2351 // fold (sext_in_reg x) -> (zext_in_reg x) if the sign bit is zero
2352 if (TLI.MaskedValueIsZero(N0, 1ULL << (EVTBits-1)))
2353 return DAG.getZeroExtendInReg(N0, EVT);
2355 // fold (sext_in_reg (load x)) -> (smaller sextload x)
2356 // fold (sext_in_reg (srl (load x), c)) -> (smaller sextload (x+c/evtbits))
2357 SDOperand NarrowLoad = ReduceLoadWidth(N);
2361 // fold (sext_in_reg (srl X, 24), i8) -> sra X, 24
2362 // fold (sext_in_reg (srl X, 23), i8) -> sra X, 23 iff possible.
2363 // We already fold "(sext_in_reg (srl X, 25), i8) -> srl X, 25" above.
2364 if (N0.getOpcode() == ISD::SRL) {
2365 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(N0.getOperand(1)))
2366 if (ShAmt->getValue()+EVTBits <= MVT::getSizeInBits(VT)) {
2367 // We can turn this into an SRA iff the input to the SRL is already sign
2369 unsigned InSignBits = TLI.ComputeNumSignBits(N0.getOperand(0));
2370 if (MVT::getSizeInBits(VT)-(ShAmt->getValue()+EVTBits) < InSignBits)
2371 return DAG.getNode(ISD::SRA, VT, N0.getOperand(0), N0.getOperand(1));
2375 // fold (sext_inreg (extload x)) -> (sextload x)
2376 if (ISD::isEXTLoad(N0.Val) &&
2377 ISD::isUNINDEXEDLoad(N0.Val) &&
2378 EVT == cast<LoadSDNode>(N0)->getLoadedVT() &&
2379 (!AfterLegalize || TLI.isLoadXLegal(ISD::SEXTLOAD, EVT))) {
2380 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2381 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, LN0->getChain(),
2382 LN0->getBasePtr(), LN0->getSrcValue(),
2383 LN0->getSrcValueOffset(), EVT);
2384 CombineTo(N, ExtLoad);
2385 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1));
2386 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2388 // fold (sext_inreg (zextload x)) -> (sextload x) iff load has one use
2389 if (ISD::isZEXTLoad(N0.Val) && ISD::isUNINDEXEDLoad(N0.Val) &&
2391 EVT == cast<LoadSDNode>(N0)->getLoadedVT() &&
2392 (!AfterLegalize || TLI.isLoadXLegal(ISD::SEXTLOAD, EVT))) {
2393 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2394 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, LN0->getChain(),
2395 LN0->getBasePtr(), LN0->getSrcValue(),
2396 LN0->getSrcValueOffset(), EVT);
2397 CombineTo(N, ExtLoad);
2398 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1));
2399 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2404 SDOperand DAGCombiner::visitTRUNCATE(SDNode *N) {
2405 SDOperand N0 = N->getOperand(0);
2406 MVT::ValueType VT = N->getValueType(0);
2409 if (N0.getValueType() == N->getValueType(0))
2411 // fold (truncate c1) -> c1
2412 if (isa<ConstantSDNode>(N0))
2413 return DAG.getNode(ISD::TRUNCATE, VT, N0);
2414 // fold (truncate (truncate x)) -> (truncate x)
2415 if (N0.getOpcode() == ISD::TRUNCATE)
2416 return DAG.getNode(ISD::TRUNCATE, VT, N0.getOperand(0));
2417 // fold (truncate (ext x)) -> (ext x) or (truncate x) or x
2418 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::SIGN_EXTEND||
2419 N0.getOpcode() == ISD::ANY_EXTEND) {
2420 if (N0.getOperand(0).getValueType() < VT)
2421 // if the source is smaller than the dest, we still need an extend
2422 return DAG.getNode(N0.getOpcode(), VT, N0.getOperand(0));
2423 else if (N0.getOperand(0).getValueType() > VT)
2424 // if the source is larger than the dest, than we just need the truncate
2425 return DAG.getNode(ISD::TRUNCATE, VT, N0.getOperand(0));
2427 // if the source and dest are the same type, we can drop both the extend
2429 return N0.getOperand(0);
2432 // fold (truncate (load x)) -> (smaller load x)
2433 // fold (truncate (srl (load x), c)) -> (smaller load (x+c/evtbits))
2434 return ReduceLoadWidth(N);
2437 SDOperand DAGCombiner::visitBIT_CONVERT(SDNode *N) {
2438 SDOperand N0 = N->getOperand(0);
2439 MVT::ValueType VT = N->getValueType(0);
2441 // If the input is a constant, let getNode() fold it.
2442 if (isa<ConstantSDNode>(N0) || isa<ConstantFPSDNode>(N0)) {
2443 SDOperand Res = DAG.getNode(ISD::BIT_CONVERT, VT, N0);
2444 if (Res.Val != N) return Res;
2447 if (N0.getOpcode() == ISD::BIT_CONVERT) // conv(conv(x,t1),t2) -> conv(x,t2)
2448 return DAG.getNode(ISD::BIT_CONVERT, VT, N0.getOperand(0));
2450 // fold (conv (load x)) -> (load (conv*)x)
2451 // FIXME: These xforms need to know that the resultant load doesn't need a
2452 // higher alignment than the original!
2453 if (0 && ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse()) {
2454 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2455 SDOperand Load = DAG.getLoad(VT, LN0->getChain(), LN0->getBasePtr(),
2456 LN0->getSrcValue(), LN0->getSrcValueOffset());
2458 CombineTo(N0.Val, DAG.getNode(ISD::BIT_CONVERT, N0.getValueType(), Load),
2466 SDOperand DAGCombiner::visitVBIT_CONVERT(SDNode *N) {
2467 SDOperand N0 = N->getOperand(0);
2468 MVT::ValueType VT = N->getValueType(0);
2470 // If the input is a VBUILD_VECTOR with all constant elements, fold this now.
2471 // First check to see if this is all constant.
2472 if (N0.getOpcode() == ISD::VBUILD_VECTOR && N0.Val->hasOneUse() &&
2473 VT == MVT::Vector) {
2474 bool isSimple = true;
2475 for (unsigned i = 0, e = N0.getNumOperands()-2; i != e; ++i)
2476 if (N0.getOperand(i).getOpcode() != ISD::UNDEF &&
2477 N0.getOperand(i).getOpcode() != ISD::Constant &&
2478 N0.getOperand(i).getOpcode() != ISD::ConstantFP) {
2483 MVT::ValueType DestEltVT = cast<VTSDNode>(N->getOperand(2))->getVT();
2484 if (isSimple && !MVT::isVector(DestEltVT)) {
2485 return ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(N0.Val, DestEltVT);
2492 /// ConstantFoldVBIT_CONVERTofVBUILD_VECTOR - We know that BV is a vbuild_vector
2493 /// node with Constant, ConstantFP or Undef operands. DstEltVT indicates the
2494 /// destination element value type.
2495 SDOperand DAGCombiner::
2496 ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(SDNode *BV, MVT::ValueType DstEltVT) {
2497 MVT::ValueType SrcEltVT = BV->getOperand(0).getValueType();
2499 // If this is already the right type, we're done.
2500 if (SrcEltVT == DstEltVT) return SDOperand(BV, 0);
2502 unsigned SrcBitSize = MVT::getSizeInBits(SrcEltVT);
2503 unsigned DstBitSize = MVT::getSizeInBits(DstEltVT);
2505 // If this is a conversion of N elements of one type to N elements of another
2506 // type, convert each element. This handles FP<->INT cases.
2507 if (SrcBitSize == DstBitSize) {
2508 SmallVector<SDOperand, 8> Ops;
2509 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e; ++i) {
2510 Ops.push_back(DAG.getNode(ISD::BIT_CONVERT, DstEltVT, BV->getOperand(i)));
2511 AddToWorkList(Ops.back().Val);
2513 Ops.push_back(*(BV->op_end()-2)); // Add num elements.
2514 Ops.push_back(DAG.getValueType(DstEltVT));
2515 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size());
2518 // Otherwise, we're growing or shrinking the elements. To avoid having to
2519 // handle annoying details of growing/shrinking FP values, we convert them to
2521 if (MVT::isFloatingPoint(SrcEltVT)) {
2522 // Convert the input float vector to a int vector where the elements are the
2524 assert((SrcEltVT == MVT::f32 || SrcEltVT == MVT::f64) && "Unknown FP VT!");
2525 MVT::ValueType IntVT = SrcEltVT == MVT::f32 ? MVT::i32 : MVT::i64;
2526 BV = ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(BV, IntVT).Val;
2530 // Now we know the input is an integer vector. If the output is a FP type,
2531 // convert to integer first, then to FP of the right size.
2532 if (MVT::isFloatingPoint(DstEltVT)) {
2533 assert((DstEltVT == MVT::f32 || DstEltVT == MVT::f64) && "Unknown FP VT!");
2534 MVT::ValueType TmpVT = DstEltVT == MVT::f32 ? MVT::i32 : MVT::i64;
2535 SDNode *Tmp = ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(BV, TmpVT).Val;
2537 // Next, convert to FP elements of the same size.
2538 return ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(Tmp, DstEltVT);
2541 // Okay, we know the src/dst types are both integers of differing types.
2542 // Handling growing first.
2543 assert(MVT::isInteger(SrcEltVT) && MVT::isInteger(DstEltVT));
2544 if (SrcBitSize < DstBitSize) {
2545 unsigned NumInputsPerOutput = DstBitSize/SrcBitSize;
2547 SmallVector<SDOperand, 8> Ops;
2548 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e;
2549 i += NumInputsPerOutput) {
2550 bool isLE = TLI.isLittleEndian();
2551 uint64_t NewBits = 0;
2552 bool EltIsUndef = true;
2553 for (unsigned j = 0; j != NumInputsPerOutput; ++j) {
2554 // Shift the previously computed bits over.
2555 NewBits <<= SrcBitSize;
2556 SDOperand Op = BV->getOperand(i+ (isLE ? (NumInputsPerOutput-j-1) : j));
2557 if (Op.getOpcode() == ISD::UNDEF) continue;
2560 NewBits |= cast<ConstantSDNode>(Op)->getValue();
2564 Ops.push_back(DAG.getNode(ISD::UNDEF, DstEltVT));
2566 Ops.push_back(DAG.getConstant(NewBits, DstEltVT));
2569 Ops.push_back(DAG.getConstant(Ops.size(), MVT::i32)); // Add num elements.
2570 Ops.push_back(DAG.getValueType(DstEltVT)); // Add element size.
2571 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size());
2574 // Finally, this must be the case where we are shrinking elements: each input
2575 // turns into multiple outputs.
2576 unsigned NumOutputsPerInput = SrcBitSize/DstBitSize;
2577 SmallVector<SDOperand, 8> Ops;
2578 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e; ++i) {
2579 if (BV->getOperand(i).getOpcode() == ISD::UNDEF) {
2580 for (unsigned j = 0; j != NumOutputsPerInput; ++j)
2581 Ops.push_back(DAG.getNode(ISD::UNDEF, DstEltVT));
2584 uint64_t OpVal = cast<ConstantSDNode>(BV->getOperand(i))->getValue();
2586 for (unsigned j = 0; j != NumOutputsPerInput; ++j) {
2587 unsigned ThisVal = OpVal & ((1ULL << DstBitSize)-1);
2588 OpVal >>= DstBitSize;
2589 Ops.push_back(DAG.getConstant(ThisVal, DstEltVT));
2592 // For big endian targets, swap the order of the pieces of each element.
2593 if (!TLI.isLittleEndian())
2594 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end());
2596 Ops.push_back(DAG.getConstant(Ops.size(), MVT::i32)); // Add num elements.
2597 Ops.push_back(DAG.getValueType(DstEltVT)); // Add element size.
2598 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size());
2603 SDOperand DAGCombiner::visitFADD(SDNode *N) {
2604 SDOperand N0 = N->getOperand(0);
2605 SDOperand N1 = N->getOperand(1);
2606 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2607 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2608 MVT::ValueType VT = N->getValueType(0);
2610 // fold (fadd c1, c2) -> c1+c2
2612 return DAG.getNode(ISD::FADD, VT, N0, N1);
2613 // canonicalize constant to RHS
2614 if (N0CFP && !N1CFP)
2615 return DAG.getNode(ISD::FADD, VT, N1, N0);
2616 // fold (A + (-B)) -> A-B
2617 if (N1.getOpcode() == ISD::FNEG)
2618 return DAG.getNode(ISD::FSUB, VT, N0, N1.getOperand(0));
2619 // fold ((-A) + B) -> B-A
2620 if (N0.getOpcode() == ISD::FNEG)
2621 return DAG.getNode(ISD::FSUB, VT, N1, N0.getOperand(0));
2623 // If allowed, fold (fadd (fadd x, c1), c2) -> (fadd x, (fadd c1, c2))
2624 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FADD &&
2625 N0.Val->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1)))
2626 return DAG.getNode(ISD::FADD, VT, N0.getOperand(0),
2627 DAG.getNode(ISD::FADD, VT, N0.getOperand(1), N1));
2632 SDOperand DAGCombiner::visitFSUB(SDNode *N) {
2633 SDOperand N0 = N->getOperand(0);
2634 SDOperand N1 = N->getOperand(1);
2635 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2636 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2637 MVT::ValueType VT = N->getValueType(0);
2639 // fold (fsub c1, c2) -> c1-c2
2641 return DAG.getNode(ISD::FSUB, VT, N0, N1);
2642 // fold (A-(-B)) -> A+B
2643 if (N1.getOpcode() == ISD::FNEG)
2644 return DAG.getNode(ISD::FADD, VT, N0, N1.getOperand(0));
2648 SDOperand DAGCombiner::visitFMUL(SDNode *N) {
2649 SDOperand N0 = N->getOperand(0);
2650 SDOperand N1 = N->getOperand(1);
2651 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2652 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2653 MVT::ValueType VT = N->getValueType(0);
2655 // fold (fmul c1, c2) -> c1*c2
2657 return DAG.getNode(ISD::FMUL, VT, N0, N1);
2658 // canonicalize constant to RHS
2659 if (N0CFP && !N1CFP)
2660 return DAG.getNode(ISD::FMUL, VT, N1, N0);
2661 // fold (fmul X, 2.0) -> (fadd X, X)
2662 if (N1CFP && N1CFP->isExactlyValue(+2.0))
2663 return DAG.getNode(ISD::FADD, VT, N0, N0);
2665 // If allowed, fold (fmul (fmul x, c1), c2) -> (fmul x, (fmul c1, c2))
2666 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FMUL &&
2667 N0.Val->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1)))
2668 return DAG.getNode(ISD::FMUL, VT, N0.getOperand(0),
2669 DAG.getNode(ISD::FMUL, VT, N0.getOperand(1), N1));
2674 SDOperand DAGCombiner::visitFDIV(SDNode *N) {
2675 SDOperand N0 = N->getOperand(0);
2676 SDOperand N1 = N->getOperand(1);
2677 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2678 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2679 MVT::ValueType VT = N->getValueType(0);
2681 // fold (fdiv c1, c2) -> c1/c2
2683 return DAG.getNode(ISD::FDIV, VT, N0, N1);
2687 SDOperand DAGCombiner::visitFREM(SDNode *N) {
2688 SDOperand N0 = N->getOperand(0);
2689 SDOperand N1 = N->getOperand(1);
2690 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2691 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2692 MVT::ValueType VT = N->getValueType(0);
2694 // fold (frem c1, c2) -> fmod(c1,c2)
2696 return DAG.getNode(ISD::FREM, VT, N0, N1);
2700 SDOperand DAGCombiner::visitFCOPYSIGN(SDNode *N) {
2701 SDOperand N0 = N->getOperand(0);
2702 SDOperand N1 = N->getOperand(1);
2703 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2704 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
2705 MVT::ValueType VT = N->getValueType(0);
2707 if (N0CFP && N1CFP) // Constant fold
2708 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1);
2711 // copysign(x, c1) -> fabs(x) iff ispos(c1)
2712 // copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1)
2717 u.d = N1CFP->getValue();
2719 return DAG.getNode(ISD::FABS, VT, N0);
2721 return DAG.getNode(ISD::FNEG, VT, DAG.getNode(ISD::FABS, VT, N0));
2724 // copysign(fabs(x), y) -> copysign(x, y)
2725 // copysign(fneg(x), y) -> copysign(x, y)
2726 // copysign(copysign(x,z), y) -> copysign(x, y)
2727 if (N0.getOpcode() == ISD::FABS || N0.getOpcode() == ISD::FNEG ||
2728 N0.getOpcode() == ISD::FCOPYSIGN)
2729 return DAG.getNode(ISD::FCOPYSIGN, VT, N0.getOperand(0), N1);
2731 // copysign(x, abs(y)) -> abs(x)
2732 if (N1.getOpcode() == ISD::FABS)
2733 return DAG.getNode(ISD::FABS, VT, N0);
2735 // copysign(x, copysign(y,z)) -> copysign(x, z)
2736 if (N1.getOpcode() == ISD::FCOPYSIGN)
2737 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1.getOperand(1));
2739 // copysign(x, fp_extend(y)) -> copysign(x, y)
2740 // copysign(x, fp_round(y)) -> copysign(x, y)
2741 if (N1.getOpcode() == ISD::FP_EXTEND || N1.getOpcode() == ISD::FP_ROUND)
2742 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1.getOperand(0));
2749 SDOperand DAGCombiner::visitSINT_TO_FP(SDNode *N) {
2750 SDOperand N0 = N->getOperand(0);
2751 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
2752 MVT::ValueType VT = N->getValueType(0);
2754 // fold (sint_to_fp c1) -> c1fp
2756 return DAG.getNode(ISD::SINT_TO_FP, VT, N0);
2760 SDOperand DAGCombiner::visitUINT_TO_FP(SDNode *N) {
2761 SDOperand N0 = N->getOperand(0);
2762 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
2763 MVT::ValueType VT = N->getValueType(0);
2765 // fold (uint_to_fp c1) -> c1fp
2767 return DAG.getNode(ISD::UINT_TO_FP, VT, N0);
2771 SDOperand DAGCombiner::visitFP_TO_SINT(SDNode *N) {
2772 SDOperand N0 = N->getOperand(0);
2773 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2774 MVT::ValueType VT = N->getValueType(0);
2776 // fold (fp_to_sint c1fp) -> c1
2778 return DAG.getNode(ISD::FP_TO_SINT, VT, N0);
2782 SDOperand DAGCombiner::visitFP_TO_UINT(SDNode *N) {
2783 SDOperand N0 = N->getOperand(0);
2784 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2785 MVT::ValueType VT = N->getValueType(0);
2787 // fold (fp_to_uint c1fp) -> c1
2789 return DAG.getNode(ISD::FP_TO_UINT, VT, N0);
2793 SDOperand DAGCombiner::visitFP_ROUND(SDNode *N) {
2794 SDOperand N0 = N->getOperand(0);
2795 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2796 MVT::ValueType VT = N->getValueType(0);
2798 // fold (fp_round c1fp) -> c1fp
2800 return DAG.getNode(ISD::FP_ROUND, VT, N0);
2802 // fold (fp_round (fp_extend x)) -> x
2803 if (N0.getOpcode() == ISD::FP_EXTEND && VT == N0.getOperand(0).getValueType())
2804 return N0.getOperand(0);
2806 // fold (fp_round (copysign X, Y)) -> (copysign (fp_round X), Y)
2807 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.Val->hasOneUse()) {
2808 SDOperand Tmp = DAG.getNode(ISD::FP_ROUND, VT, N0.getOperand(0));
2809 AddToWorkList(Tmp.Val);
2810 return DAG.getNode(ISD::FCOPYSIGN, VT, Tmp, N0.getOperand(1));
2816 SDOperand DAGCombiner::visitFP_ROUND_INREG(SDNode *N) {
2817 SDOperand N0 = N->getOperand(0);
2818 MVT::ValueType VT = N->getValueType(0);
2819 MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
2820 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2822 // fold (fp_round_inreg c1fp) -> c1fp
2824 SDOperand Round = DAG.getConstantFP(N0CFP->getValue(), EVT);
2825 return DAG.getNode(ISD::FP_EXTEND, VT, Round);
2830 SDOperand DAGCombiner::visitFP_EXTEND(SDNode *N) {
2831 SDOperand N0 = N->getOperand(0);
2832 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2833 MVT::ValueType VT = N->getValueType(0);
2835 // fold (fp_extend c1fp) -> c1fp
2837 return DAG.getNode(ISD::FP_EXTEND, VT, N0);
2839 // fold (fpext (load x)) -> (fpext (fpround (extload x)))
2840 if (ISD::isNON_EXTLoad(N0.Val) && N0.hasOneUse() &&
2841 (!AfterLegalize||TLI.isLoadXLegal(ISD::EXTLOAD, N0.getValueType()))) {
2842 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
2843 SDOperand ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, LN0->getChain(),
2844 LN0->getBasePtr(), LN0->getSrcValue(),
2845 LN0->getSrcValueOffset(),
2847 CombineTo(N, ExtLoad);
2848 CombineTo(N0.Val, DAG.getNode(ISD::FP_ROUND, N0.getValueType(), ExtLoad),
2849 ExtLoad.getValue(1));
2850 return SDOperand(N, 0); // Return N so it doesn't get rechecked!
2857 SDOperand DAGCombiner::visitFNEG(SDNode *N) {
2858 SDOperand N0 = N->getOperand(0);
2859 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2860 MVT::ValueType VT = N->getValueType(0);
2862 // fold (fneg c1) -> -c1
2864 return DAG.getNode(ISD::FNEG, VT, N0);
2865 // fold (fneg (sub x, y)) -> (sub y, x)
2866 if (N0.getOpcode() == ISD::SUB)
2867 return DAG.getNode(ISD::SUB, VT, N0.getOperand(1), N0.getOperand(0));
2868 // fold (fneg (fneg x)) -> x
2869 if (N0.getOpcode() == ISD::FNEG)
2870 return N0.getOperand(0);
2874 SDOperand DAGCombiner::visitFABS(SDNode *N) {
2875 SDOperand N0 = N->getOperand(0);
2876 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
2877 MVT::ValueType VT = N->getValueType(0);
2879 // fold (fabs c1) -> fabs(c1)
2881 return DAG.getNode(ISD::FABS, VT, N0);
2882 // fold (fabs (fabs x)) -> (fabs x)
2883 if (N0.getOpcode() == ISD::FABS)
2884 return N->getOperand(0);
2885 // fold (fabs (fneg x)) -> (fabs x)
2886 // fold (fabs (fcopysign x, y)) -> (fabs x)
2887 if (N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FCOPYSIGN)
2888 return DAG.getNode(ISD::FABS, VT, N0.getOperand(0));
2893 SDOperand DAGCombiner::visitBRCOND(SDNode *N) {
2894 SDOperand Chain = N->getOperand(0);
2895 SDOperand N1 = N->getOperand(1);
2896 SDOperand N2 = N->getOperand(2);
2897 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
2899 // never taken branch, fold to chain
2900 if (N1C && N1C->isNullValue())
2902 // unconditional branch
2903 if (N1C && N1C->getValue() == 1)
2904 return DAG.getNode(ISD::BR, MVT::Other, Chain, N2);
2905 // fold a brcond with a setcc condition into a BR_CC node if BR_CC is legal
2907 if (N1.getOpcode() == ISD::SETCC &&
2908 TLI.isOperationLegal(ISD::BR_CC, MVT::Other)) {
2909 return DAG.getNode(ISD::BR_CC, MVT::Other, Chain, N1.getOperand(2),
2910 N1.getOperand(0), N1.getOperand(1), N2);
2915 // Operand List for BR_CC: Chain, CondCC, CondLHS, CondRHS, DestBB.
2917 SDOperand DAGCombiner::visitBR_CC(SDNode *N) {
2918 CondCodeSDNode *CC = cast<CondCodeSDNode>(N->getOperand(1));
2919 SDOperand CondLHS = N->getOperand(2), CondRHS = N->getOperand(3);
2921 // Use SimplifySetCC to simplify SETCC's.
2922 SDOperand Simp = SimplifySetCC(MVT::i1, CondLHS, CondRHS, CC->get(), false);
2923 if (Simp.Val) AddToWorkList(Simp.Val);
2925 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(Simp.Val);
2927 // fold br_cc true, dest -> br dest (unconditional branch)
2928 if (SCCC && SCCC->getValue())
2929 return DAG.getNode(ISD::BR, MVT::Other, N->getOperand(0),
2931 // fold br_cc false, dest -> unconditional fall through
2932 if (SCCC && SCCC->isNullValue())
2933 return N->getOperand(0);
2935 // fold to a simpler setcc
2936 if (Simp.Val && Simp.getOpcode() == ISD::SETCC)
2937 return DAG.getNode(ISD::BR_CC, MVT::Other, N->getOperand(0),
2938 Simp.getOperand(2), Simp.getOperand(0),
2939 Simp.getOperand(1), N->getOperand(4));
2944 /// CombineToPreIndexedLoadStore - Try turning a load / store and a
2945 /// pre-indexed load / store when the base pointer is a add or subtract
2946 /// and it has other uses besides the load / store. After the
2947 /// transformation, the new indexed load / store has effectively folded
2948 /// the add / subtract in and all of its other uses are redirected to the
2949 /// new load / store.
2950 bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) {
2957 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
2958 if (LD->getAddressingMode() != ISD::UNINDEXED)
2960 VT = LD->getLoadedVT();
2961 if (!TLI.isIndexedLoadLegal(ISD::PRE_INC, VT) &&
2962 !TLI.isIndexedLoadLegal(ISD::PRE_DEC, VT))
2964 Ptr = LD->getBasePtr();
2965 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
2966 if (ST->getAddressingMode() != ISD::UNINDEXED)
2968 VT = ST->getStoredVT();
2969 if (!TLI.isIndexedStoreLegal(ISD::PRE_INC, VT) &&
2970 !TLI.isIndexedStoreLegal(ISD::PRE_DEC, VT))
2972 Ptr = ST->getBasePtr();
2977 // If the pointer is not an add/sub, or if it doesn't have multiple uses, bail
2978 // out. There is no reason to make this a preinc/predec.
2979 if ((Ptr.getOpcode() != ISD::ADD && Ptr.getOpcode() != ISD::SUB) ||
2980 Ptr.Val->hasOneUse())
2983 // Ask the target to do addressing mode selection.
2986 ISD::MemIndexedMode AM = ISD::UNINDEXED;
2987 if (!TLI.getPreIndexedAddressParts(N, BasePtr, Offset, AM, DAG))
2990 // Try turning it into a pre-indexed load / store except when:
2991 // 1) The base is a frame index.
2992 // 2) If N is a store and the ptr is either the same as or is a
2993 // predecessor of the value being stored.
2994 // 3) Another use of base ptr is a predecessor of N. If ptr is folded
2995 // that would create a cycle.
2996 // 4) All uses are load / store ops that use it as base ptr.
2998 // Check #1. Preinc'ing a frame index would require copying the stack pointer
2999 // (plus the implicit offset) to a register to preinc anyway.
3000 if (isa<FrameIndexSDNode>(BasePtr))
3005 SDOperand Val = cast<StoreSDNode>(N)->getValue();
3006 if (Val == Ptr || Ptr.Val->isPredecessor(Val.Val))
3010 // Now check for #2 and #3.
3011 bool RealUse = false;
3012 for (SDNode::use_iterator I = Ptr.Val->use_begin(),
3013 E = Ptr.Val->use_end(); I != E; ++I) {
3017 if (Use->isPredecessor(N))
3020 if (!((Use->getOpcode() == ISD::LOAD &&
3021 cast<LoadSDNode>(Use)->getBasePtr() == Ptr) ||
3022 (Use->getOpcode() == ISD::STORE) &&
3023 cast<StoreSDNode>(Use)->getBasePtr() == Ptr))
3031 Result = DAG.getIndexedLoad(SDOperand(N,0), BasePtr, Offset, AM);
3033 Result = DAG.getIndexedStore(SDOperand(N,0), BasePtr, Offset, AM);
3036 DOUT << "\nReplacing.4 "; DEBUG(N->dump());
3037 DOUT << "\nWith: "; DEBUG(Result.Val->dump(&DAG));
3039 std::vector<SDNode*> NowDead;
3041 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 0), Result.getValue(0),
3043 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 1), Result.getValue(2),
3046 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 0), Result.getValue(1),
3050 // Nodes can end up on the worklist more than once. Make sure we do
3051 // not process a node that has been replaced.
3052 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
3053 removeFromWorkList(NowDead[i]);
3054 // Finally, since the node is now dead, remove it from the graph.
3057 // Replace the uses of Ptr with uses of the updated base value.
3058 DAG.ReplaceAllUsesOfValueWith(Ptr, Result.getValue(isLoad ? 1 : 0),
3060 removeFromWorkList(Ptr.Val);
3061 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
3062 removeFromWorkList(NowDead[i]);
3063 DAG.DeleteNode(Ptr.Val);
3068 /// CombineToPostIndexedLoadStore - Try combine a load / store with a
3069 /// add / sub of the base pointer node into a post-indexed load / store.
3070 /// The transformation folded the add / subtract into the new indexed
3071 /// load / store effectively and all of its uses are redirected to the
3072 /// new load / store.
3073 bool DAGCombiner::CombineToPostIndexedLoadStore(SDNode *N) {
3080 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
3081 if (LD->getAddressingMode() != ISD::UNINDEXED)
3083 VT = LD->getLoadedVT();
3084 if (!TLI.isIndexedLoadLegal(ISD::POST_INC, VT) &&
3085 !TLI.isIndexedLoadLegal(ISD::POST_DEC, VT))
3087 Ptr = LD->getBasePtr();
3088 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
3089 if (ST->getAddressingMode() != ISD::UNINDEXED)
3091 VT = ST->getStoredVT();
3092 if (!TLI.isIndexedStoreLegal(ISD::POST_INC, VT) &&
3093 !TLI.isIndexedStoreLegal(ISD::POST_DEC, VT))
3095 Ptr = ST->getBasePtr();
3100 if (Ptr.Val->hasOneUse())
3103 for (SDNode::use_iterator I = Ptr.Val->use_begin(),
3104 E = Ptr.Val->use_end(); I != E; ++I) {
3107 (Op->getOpcode() != ISD::ADD && Op->getOpcode() != ISD::SUB))
3112 ISD::MemIndexedMode AM = ISD::UNINDEXED;
3113 if (TLI.getPostIndexedAddressParts(N, Op, BasePtr, Offset, AM, DAG)) {
3115 std::swap(BasePtr, Offset);
3119 // Try turning it into a post-indexed load / store except when
3120 // 1) All uses are load / store ops that use it as base ptr.
3121 // 2) Op must be independent of N, i.e. Op is neither a predecessor
3122 // nor a successor of N. Otherwise, if Op is folded that would
3126 bool TryNext = false;
3127 for (SDNode::use_iterator II = BasePtr.Val->use_begin(),
3128 EE = BasePtr.Val->use_end(); II != EE; ++II) {
3133 // If all the uses are load / store addresses, then don't do the
3135 if (Use->getOpcode() == ISD::ADD || Use->getOpcode() == ISD::SUB){
3136 bool RealUse = false;
3137 for (SDNode::use_iterator III = Use->use_begin(),
3138 EEE = Use->use_end(); III != EEE; ++III) {
3139 SDNode *UseUse = *III;
3140 if (!((UseUse->getOpcode() == ISD::LOAD &&
3141 cast<LoadSDNode>(UseUse)->getBasePtr().Val == Use) ||
3142 (UseUse->getOpcode() == ISD::STORE) &&
3143 cast<StoreSDNode>(UseUse)->getBasePtr().Val == Use))
3157 if (!Op->isPredecessor(N) && !N->isPredecessor(Op)) {
3158 SDOperand Result = isLoad
3159 ? DAG.getIndexedLoad(SDOperand(N,0), BasePtr, Offset, AM)
3160 : DAG.getIndexedStore(SDOperand(N,0), BasePtr, Offset, AM);
3163 DOUT << "\nReplacing.5 "; DEBUG(N->dump());
3164 DOUT << "\nWith: "; DEBUG(Result.Val->dump(&DAG));
3166 std::vector<SDNode*> NowDead;
3168 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 0), Result.getValue(0),
3170 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 1), Result.getValue(2),
3173 DAG.ReplaceAllUsesOfValueWith(SDOperand(N, 0), Result.getValue(1),
3177 // Nodes can end up on the worklist more than once. Make sure we do
3178 // not process a node that has been replaced.
3179 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
3180 removeFromWorkList(NowDead[i]);
3181 // Finally, since the node is now dead, remove it from the graph.
3184 // Replace the uses of Use with uses of the updated base value.
3185 DAG.ReplaceAllUsesOfValueWith(SDOperand(Op, 0),
3186 Result.getValue(isLoad ? 1 : 0),
3188 removeFromWorkList(Op);
3189 for (unsigned i = 0, e = NowDead.size(); i != e; ++i)
3190 removeFromWorkList(NowDead[i]);
3201 SDOperand DAGCombiner::visitLOAD(SDNode *N) {
3202 LoadSDNode *LD = cast<LoadSDNode>(N);
3203 SDOperand Chain = LD->getChain();
3204 SDOperand Ptr = LD->getBasePtr();
3206 // If there are no uses of the loaded value, change uses of the chain value
3207 // into uses of the chain input (i.e. delete the dead load).
3208 if (N->hasNUsesOfValue(0, 0))
3209 return CombineTo(N, DAG.getNode(ISD::UNDEF, N->getValueType(0)), Chain);
3211 // If this load is directly stored, replace the load value with the stored
3213 // TODO: Handle store large -> read small portion.
3214 // TODO: Handle TRUNCSTORE/LOADEXT
3215 if (LD->getExtensionType() == ISD::NON_EXTLOAD) {
3216 if (ISD::isNON_TRUNCStore(Chain.Val)) {
3217 StoreSDNode *PrevST = cast<StoreSDNode>(Chain);
3218 if (PrevST->getBasePtr() == Ptr &&
3219 PrevST->getValue().getValueType() == N->getValueType(0))
3220 return CombineTo(N, Chain.getOperand(1), Chain);
3225 // Walk up chain skipping non-aliasing memory nodes.
3226 SDOperand BetterChain = FindBetterChain(N, Chain);
3228 // If there is a better chain.
3229 if (Chain != BetterChain) {
3232 // Replace the chain to void dependency.
3233 if (LD->getExtensionType() == ISD::NON_EXTLOAD) {
3234 ReplLoad = DAG.getLoad(N->getValueType(0), BetterChain, Ptr,
3235 LD->getSrcValue(), LD->getSrcValueOffset());
3237 ReplLoad = DAG.getExtLoad(LD->getExtensionType(),
3238 LD->getValueType(0),
3239 BetterChain, Ptr, LD->getSrcValue(),
3240 LD->getSrcValueOffset(),
3244 // Create token factor to keep old chain connected.
3245 SDOperand Token = DAG.getNode(ISD::TokenFactor, MVT::Other,
3246 Chain, ReplLoad.getValue(1));
3248 // Replace uses with load result and token factor. Don't add users
3250 return CombineTo(N, ReplLoad.getValue(0), Token, false);
3254 // Try transforming N to an indexed load.
3255 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
3256 return SDOperand(N, 0);
3261 SDOperand DAGCombiner::visitSTORE(SDNode *N) {
3262 StoreSDNode *ST = cast<StoreSDNode>(N);
3263 SDOperand Chain = ST->getChain();
3264 SDOperand Value = ST->getValue();
3265 SDOperand Ptr = ST->getBasePtr();
3267 // If this is a store of a bit convert, store the input value.
3268 // FIXME: This needs to know that the resultant store does not need a
3269 // higher alignment than the original.
3270 if (0 && Value.getOpcode() == ISD::BIT_CONVERT) {
3271 return DAG.getStore(Chain, Value.getOperand(0), Ptr, ST->getSrcValue(),
3272 ST->getSrcValueOffset());
3275 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
3276 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Value)) {
3277 if (Value.getOpcode() != ISD::TargetConstantFP) {
3279 switch (CFP->getValueType(0)) {
3280 default: assert(0 && "Unknown FP type");
3282 if (!AfterLegalize || TLI.isTypeLegal(MVT::i32)) {
3283 Tmp = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32);
3284 return DAG.getStore(Chain, Tmp, Ptr, ST->getSrcValue(),
3285 ST->getSrcValueOffset());
3289 if (!AfterLegalize || TLI.isTypeLegal(MVT::i64)) {
3290 Tmp = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64);
3291 return DAG.getStore(Chain, Tmp, Ptr, ST->getSrcValue(),
3292 ST->getSrcValueOffset());
3293 } else if (TLI.isTypeLegal(MVT::i32)) {
3294 // Many FP stores are not make apparent until after legalize, e.g. for
3295 // argument passing. Since this is so common, custom legalize the
3296 // 64-bit integer store into two 32-bit stores.
3297 uint64_t Val = DoubleToBits(CFP->getValue());
3298 SDOperand Lo = DAG.getConstant(Val & 0xFFFFFFFF, MVT::i32);
3299 SDOperand Hi = DAG.getConstant(Val >> 32, MVT::i32);
3300 if (!TLI.isLittleEndian()) std::swap(Lo, Hi);
3302 SDOperand St0 = DAG.getStore(Chain, Lo, Ptr, ST->getSrcValue(),
3303 ST->getSrcValueOffset());
3304 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
3305 DAG.getConstant(4, Ptr.getValueType()));
3306 SDOperand St1 = DAG.getStore(Chain, Hi, Ptr, ST->getSrcValue(),
3307 ST->getSrcValueOffset()+4);
3308 return DAG.getNode(ISD::TokenFactor, MVT::Other, St0, St1);
3316 // Walk up chain skipping non-aliasing memory nodes.
3317 SDOperand BetterChain = FindBetterChain(N, Chain);
3319 // If there is a better chain.
3320 if (Chain != BetterChain) {
3321 // Replace the chain to avoid dependency.
3322 SDOperand ReplStore;
3323 if (ST->isTruncatingStore()) {
3324 ReplStore = DAG.getTruncStore(BetterChain, Value, Ptr,
3325 ST->getSrcValue(),ST->getSrcValueOffset(), ST->getStoredVT());
3327 ReplStore = DAG.getStore(BetterChain, Value, Ptr,
3328 ST->getSrcValue(), ST->getSrcValueOffset());
3331 // Create token to keep both nodes around.
3333 DAG.getNode(ISD::TokenFactor, MVT::Other, Chain, ReplStore);
3335 // Don't add users to work list.
3336 return CombineTo(N, Token, false);
3340 // Try transforming N to an indexed store.
3341 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
3342 return SDOperand(N, 0);
3347 SDOperand DAGCombiner::visitINSERT_VECTOR_ELT(SDNode *N) {
3348 SDOperand InVec = N->getOperand(0);
3349 SDOperand InVal = N->getOperand(1);
3350 SDOperand EltNo = N->getOperand(2);
3352 // If the invec is a BUILD_VECTOR and if EltNo is a constant, build a new
3353 // vector with the inserted element.
3354 if (InVec.getOpcode() == ISD::BUILD_VECTOR && isa<ConstantSDNode>(EltNo)) {
3355 unsigned Elt = cast<ConstantSDNode>(EltNo)->getValue();
3356 SmallVector<SDOperand, 8> Ops(InVec.Val->op_begin(), InVec.Val->op_end());
3357 if (Elt < Ops.size())
3359 return DAG.getNode(ISD::BUILD_VECTOR, InVec.getValueType(),
3360 &Ops[0], Ops.size());
3366 SDOperand DAGCombiner::visitVINSERT_VECTOR_ELT(SDNode *N) {
3367 SDOperand InVec = N->getOperand(0);
3368 SDOperand InVal = N->getOperand(1);
3369 SDOperand EltNo = N->getOperand(2);
3370 SDOperand NumElts = N->getOperand(3);
3371 SDOperand EltType = N->getOperand(4);
3373 // If the invec is a VBUILD_VECTOR and if EltNo is a constant, build a new
3374 // vector with the inserted element.
3375 if (InVec.getOpcode() == ISD::VBUILD_VECTOR && isa<ConstantSDNode>(EltNo)) {
3376 unsigned Elt = cast<ConstantSDNode>(EltNo)->getValue();
3377 SmallVector<SDOperand, 8> Ops(InVec.Val->op_begin(), InVec.Val->op_end());
3378 if (Elt < Ops.size()-2)
3380 return DAG.getNode(ISD::VBUILD_VECTOR, InVec.getValueType(),
3381 &Ops[0], Ops.size());
3387 SDOperand DAGCombiner::visitVBUILD_VECTOR(SDNode *N) {
3388 unsigned NumInScalars = N->getNumOperands()-2;
3389 SDOperand NumElts = N->getOperand(NumInScalars);
3390 SDOperand EltType = N->getOperand(NumInScalars+1);
3392 // Check to see if this is a VBUILD_VECTOR of a bunch of VEXTRACT_VECTOR_ELT
3393 // operations. If so, and if the EXTRACT_ELT vector inputs come from at most
3394 // two distinct vectors, turn this into a shuffle node.
3395 SDOperand VecIn1, VecIn2;
3396 for (unsigned i = 0; i != NumInScalars; ++i) {
3397 // Ignore undef inputs.
3398 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue;
3400 // If this input is something other than a VEXTRACT_VECTOR_ELT with a
3401 // constant index, bail out.
3402 if (N->getOperand(i).getOpcode() != ISD::VEXTRACT_VECTOR_ELT ||
3403 !isa<ConstantSDNode>(N->getOperand(i).getOperand(1))) {
3404 VecIn1 = VecIn2 = SDOperand(0, 0);
3408 // If the input vector type disagrees with the result of the vbuild_vector,
3409 // we can't make a shuffle.
3410 SDOperand ExtractedFromVec = N->getOperand(i).getOperand(0);
3411 if (*(ExtractedFromVec.Val->op_end()-2) != NumElts ||
3412 *(ExtractedFromVec.Val->op_end()-1) != EltType) {
3413 VecIn1 = VecIn2 = SDOperand(0, 0);
3417 // Otherwise, remember this. We allow up to two distinct input vectors.
3418 if (ExtractedFromVec == VecIn1 || ExtractedFromVec == VecIn2)
3421 if (VecIn1.Val == 0) {
3422 VecIn1 = ExtractedFromVec;
3423 } else if (VecIn2.Val == 0) {
3424 VecIn2 = ExtractedFromVec;
3427 VecIn1 = VecIn2 = SDOperand(0, 0);
3432 // If everything is good, we can make a shuffle operation.
3434 SmallVector<SDOperand, 8> BuildVecIndices;
3435 for (unsigned i = 0; i != NumInScalars; ++i) {
3436 if (N->getOperand(i).getOpcode() == ISD::UNDEF) {
3437 BuildVecIndices.push_back(DAG.getNode(ISD::UNDEF, TLI.getPointerTy()));
3441 SDOperand Extract = N->getOperand(i);
3443 // If extracting from the first vector, just use the index directly.
3444 if (Extract.getOperand(0) == VecIn1) {
3445 BuildVecIndices.push_back(Extract.getOperand(1));
3449 // Otherwise, use InIdx + VecSize
3450 unsigned Idx = cast<ConstantSDNode>(Extract.getOperand(1))->getValue();
3451 BuildVecIndices.push_back(DAG.getConstant(Idx+NumInScalars,
3452 TLI.getPointerTy()));
3455 // Add count and size info.
3456 BuildVecIndices.push_back(NumElts);
3457 BuildVecIndices.push_back(DAG.getValueType(TLI.getPointerTy()));
3459 // Return the new VVECTOR_SHUFFLE node.
3465 // Use an undef vbuild_vector as input for the second operand.
3466 std::vector<SDOperand> UnOps(NumInScalars,
3467 DAG.getNode(ISD::UNDEF,
3468 cast<VTSDNode>(EltType)->getVT()));
3469 UnOps.push_back(NumElts);
3470 UnOps.push_back(EltType);
3471 Ops[1] = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector,
3472 &UnOps[0], UnOps.size());
3473 AddToWorkList(Ops[1].Val);
3475 Ops[2] = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector,
3476 &BuildVecIndices[0], BuildVecIndices.size());
3479 return DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, Ops, 5);
3485 SDOperand DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) {
3486 SDOperand ShufMask = N->getOperand(2);
3487 unsigned NumElts = ShufMask.getNumOperands();
3489 // If the shuffle mask is an identity operation on the LHS, return the LHS.
3490 bool isIdentity = true;
3491 for (unsigned i = 0; i != NumElts; ++i) {
3492 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF &&
3493 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i) {
3498 if (isIdentity) return N->getOperand(0);
3500 // If the shuffle mask is an identity operation on the RHS, return the RHS.
3502 for (unsigned i = 0; i != NumElts; ++i) {
3503 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF &&
3504 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i+NumElts) {
3509 if (isIdentity) return N->getOperand(1);
3511 // Check if the shuffle is a unary shuffle, i.e. one of the vectors is not
3513 bool isUnary = true;
3514 bool isSplat = true;
3516 unsigned BaseIdx = 0;
3517 for (unsigned i = 0; i != NumElts; ++i)
3518 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF) {
3519 unsigned Idx = cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue();
3520 int V = (Idx < NumElts) ? 0 : 1;
3534 SDOperand N0 = N->getOperand(0);
3535 SDOperand N1 = N->getOperand(1);
3536 // Normalize unary shuffle so the RHS is undef.
3537 if (isUnary && VecNum == 1)
3540 // If it is a splat, check if the argument vector is a build_vector with
3541 // all scalar elements the same.
3544 if (V->getOpcode() == ISD::BIT_CONVERT)
3545 V = V->getOperand(0).Val;
3546 if (V->getOpcode() == ISD::BUILD_VECTOR) {
3547 unsigned NumElems = V->getNumOperands()-2;
3548 if (NumElems > BaseIdx) {
3550 bool AllSame = true;
3551 for (unsigned i = 0; i != NumElems; ++i) {
3552 if (V->getOperand(i).getOpcode() != ISD::UNDEF) {
3553 Base = V->getOperand(i);
3557 // Splat of <u, u, u, u>, return <u, u, u, u>
3560 for (unsigned i = 0; i != NumElems; ++i) {
3561 if (V->getOperand(i).getOpcode() != ISD::UNDEF &&
3562 V->getOperand(i) != Base) {
3567 // Splat of <x, x, x, x>, return <x, x, x, x>
3574 // If it is a unary or the LHS and the RHS are the same node, turn the RHS
3576 if (isUnary || N0 == N1) {
3577 if (N0.getOpcode() == ISD::UNDEF)
3578 return DAG.getNode(ISD::UNDEF, N->getValueType(0));
3579 // Check the SHUFFLE mask, mapping any inputs from the 2nd operand into the
3581 SmallVector<SDOperand, 8> MappedOps;
3582 for (unsigned i = 0, e = ShufMask.getNumOperands(); i != e; ++i) {
3583 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF ||
3584 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() < NumElts) {
3585 MappedOps.push_back(ShufMask.getOperand(i));
3588 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() - NumElts;
3589 MappedOps.push_back(DAG.getConstant(NewIdx, MVT::i32));
3592 ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMask.getValueType(),
3593 &MappedOps[0], MappedOps.size());
3594 AddToWorkList(ShufMask.Val);
3595 return DAG.getNode(ISD::VECTOR_SHUFFLE, N->getValueType(0),
3597 DAG.getNode(ISD::UNDEF, N->getValueType(0)),
3604 SDOperand DAGCombiner::visitVVECTOR_SHUFFLE(SDNode *N) {
3605 SDOperand ShufMask = N->getOperand(2);
3606 unsigned NumElts = ShufMask.getNumOperands()-2;
3608 // If the shuffle mask is an identity operation on the LHS, return the LHS.
3609 bool isIdentity = true;
3610 for (unsigned i = 0; i != NumElts; ++i) {
3611 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF &&
3612 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i) {
3617 if (isIdentity) return N->getOperand(0);
3619 // If the shuffle mask is an identity operation on the RHS, return the RHS.
3621 for (unsigned i = 0; i != NumElts; ++i) {
3622 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF &&
3623 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i+NumElts) {
3628 if (isIdentity) return N->getOperand(1);
3630 // Check if the shuffle is a unary shuffle, i.e. one of the vectors is not
3632 bool isUnary = true;
3633 bool isSplat = true;
3635 unsigned BaseIdx = 0;
3636 for (unsigned i = 0; i != NumElts; ++i)
3637 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF) {
3638 unsigned Idx = cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue();
3639 int V = (Idx < NumElts) ? 0 : 1;
3653 SDOperand N0 = N->getOperand(0);
3654 SDOperand N1 = N->getOperand(1);
3655 // Normalize unary shuffle so the RHS is undef.
3656 if (isUnary && VecNum == 1)
3659 // If it is a splat, check if the argument vector is a build_vector with
3660 // all scalar elements the same.
3664 // If this is a vbit convert that changes the element type of the vector but
3665 // not the number of vector elements, look through it. Be careful not to
3666 // look though conversions that change things like v4f32 to v2f64.
3667 if (V->getOpcode() == ISD::VBIT_CONVERT) {
3668 SDOperand ConvInput = V->getOperand(0);
3669 if (ConvInput.getValueType() == MVT::Vector &&
3671 ConvInput.getConstantOperandVal(ConvInput.getNumOperands()-2))
3675 if (V->getOpcode() == ISD::VBUILD_VECTOR) {
3676 unsigned NumElems = V->getNumOperands()-2;
3677 if (NumElems > BaseIdx) {
3679 bool AllSame = true;
3680 for (unsigned i = 0; i != NumElems; ++i) {
3681 if (V->getOperand(i).getOpcode() != ISD::UNDEF) {
3682 Base = V->getOperand(i);
3686 // Splat of <u, u, u, u>, return <u, u, u, u>
3689 for (unsigned i = 0; i != NumElems; ++i) {
3690 if (V->getOperand(i).getOpcode() != ISD::UNDEF &&
3691 V->getOperand(i) != Base) {
3696 // Splat of <x, x, x, x>, return <x, x, x, x>
3703 // If it is a unary or the LHS and the RHS are the same node, turn the RHS
3705 if (isUnary || N0 == N1) {
3706 // Check the SHUFFLE mask, mapping any inputs from the 2nd operand into the
3708 SmallVector<SDOperand, 8> MappedOps;
3709 for (unsigned i = 0; i != NumElts; ++i) {
3710 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF ||
3711 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() < NumElts) {
3712 MappedOps.push_back(ShufMask.getOperand(i));
3715 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() - NumElts;
3716 MappedOps.push_back(DAG.getConstant(NewIdx, MVT::i32));
3719 // Add the type/#elts values.
3720 MappedOps.push_back(ShufMask.getOperand(NumElts));
3721 MappedOps.push_back(ShufMask.getOperand(NumElts+1));
3723 ShufMask = DAG.getNode(ISD::VBUILD_VECTOR, ShufMask.getValueType(),
3724 &MappedOps[0], MappedOps.size());
3725 AddToWorkList(ShufMask.Val);
3727 // Build the undef vector.
3728 SDOperand UDVal = DAG.getNode(ISD::UNDEF, MappedOps[0].getValueType());
3729 for (unsigned i = 0; i != NumElts; ++i)
3730 MappedOps[i] = UDVal;
3731 MappedOps[NumElts ] = *(N0.Val->op_end()-2);
3732 MappedOps[NumElts+1] = *(N0.Val->op_end()-1);
3733 UDVal = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector,
3734 &MappedOps[0], MappedOps.size());
3736 return DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector,
3737 N0, UDVal, ShufMask,
3738 MappedOps[NumElts], MappedOps[NumElts+1]);
3744 /// XformToShuffleWithZero - Returns a vector_shuffle if it able to transform
3745 /// a VAND to a vector_shuffle with the destination vector and a zero vector.
3746 /// e.g. VAND V, <0xffffffff, 0, 0xffffffff, 0>. ==>
3747 /// vector_shuffle V, Zero, <0, 4, 2, 4>
3748 SDOperand DAGCombiner::XformToShuffleWithZero(SDNode *N) {
3749 SDOperand LHS = N->getOperand(0);
3750 SDOperand RHS = N->getOperand(1);
3751 if (N->getOpcode() == ISD::VAND) {
3752 SDOperand DstVecSize = *(LHS.Val->op_end()-2);
3753 SDOperand DstVecEVT = *(LHS.Val->op_end()-1);
3754 if (RHS.getOpcode() == ISD::VBIT_CONVERT)
3755 RHS = RHS.getOperand(0);
3756 if (RHS.getOpcode() == ISD::VBUILD_VECTOR) {
3757 std::vector<SDOperand> IdxOps;
3758 unsigned NumOps = RHS.getNumOperands();
3759 unsigned NumElts = NumOps-2;
3760 MVT::ValueType EVT = cast<VTSDNode>(RHS.getOperand(NumOps-1))->getVT();
3761 for (unsigned i = 0; i != NumElts; ++i) {
3762 SDOperand Elt = RHS.getOperand(i);
3763 if (!isa<ConstantSDNode>(Elt))
3765 else if (cast<ConstantSDNode>(Elt)->isAllOnesValue())
3766 IdxOps.push_back(DAG.getConstant(i, EVT));
3767 else if (cast<ConstantSDNode>(Elt)->isNullValue())
3768 IdxOps.push_back(DAG.getConstant(NumElts, EVT));
3773 // Let's see if the target supports this vector_shuffle.
3774 if (!TLI.isVectorClearMaskLegal(IdxOps, EVT, DAG))
3777 // Return the new VVECTOR_SHUFFLE node.
3778 SDOperand NumEltsNode = DAG.getConstant(NumElts, MVT::i32);
3779 SDOperand EVTNode = DAG.getValueType(EVT);
3780 std::vector<SDOperand> Ops;
3781 LHS = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, LHS, NumEltsNode,
3784 AddToWorkList(LHS.Val);
3785 std::vector<SDOperand> ZeroOps(NumElts, DAG.getConstant(0, EVT));
3786 ZeroOps.push_back(NumEltsNode);
3787 ZeroOps.push_back(EVTNode);
3788 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector,
3789 &ZeroOps[0], ZeroOps.size()));
3790 IdxOps.push_back(NumEltsNode);
3791 IdxOps.push_back(EVTNode);
3792 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector,
3793 &IdxOps[0], IdxOps.size()));
3794 Ops.push_back(NumEltsNode);
3795 Ops.push_back(EVTNode);
3796 SDOperand Result = DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector,
3797 &Ops[0], Ops.size());
3798 if (NumEltsNode != DstVecSize || EVTNode != DstVecEVT) {
3799 Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result,
3800 DstVecSize, DstVecEVT);
3808 /// visitVBinOp - Visit a binary vector operation, like VADD. IntOp indicates
3809 /// the scalar operation of the vop if it is operating on an integer vector
3810 /// (e.g. ADD) and FPOp indicates the FP version (e.g. FADD).
3811 SDOperand DAGCombiner::visitVBinOp(SDNode *N, ISD::NodeType IntOp,
3812 ISD::NodeType FPOp) {
3813 MVT::ValueType EltType = cast<VTSDNode>(*(N->op_end()-1))->getVT();
3814 ISD::NodeType ScalarOp = MVT::isInteger(EltType) ? IntOp : FPOp;
3815 SDOperand LHS = N->getOperand(0);
3816 SDOperand RHS = N->getOperand(1);
3817 SDOperand Shuffle = XformToShuffleWithZero(N);
3818 if (Shuffle.Val) return Shuffle;
3820 // If the LHS and RHS are VBUILD_VECTOR nodes, see if we can constant fold
3822 if (LHS.getOpcode() == ISD::VBUILD_VECTOR &&
3823 RHS.getOpcode() == ISD::VBUILD_VECTOR) {
3824 SmallVector<SDOperand, 8> Ops;
3825 for (unsigned i = 0, e = LHS.getNumOperands()-2; i != e; ++i) {
3826 SDOperand LHSOp = LHS.getOperand(i);
3827 SDOperand RHSOp = RHS.getOperand(i);
3828 // If these two elements can't be folded, bail out.
3829 if ((LHSOp.getOpcode() != ISD::UNDEF &&
3830 LHSOp.getOpcode() != ISD::Constant &&
3831 LHSOp.getOpcode() != ISD::ConstantFP) ||
3832 (RHSOp.getOpcode() != ISD::UNDEF &&
3833 RHSOp.getOpcode() != ISD::Constant &&
3834 RHSOp.getOpcode() != ISD::ConstantFP))
3836 // Can't fold divide by zero.
3837 if (N->getOpcode() == ISD::VSDIV || N->getOpcode() == ISD::VUDIV) {
3838 if ((RHSOp.getOpcode() == ISD::Constant &&
3839 cast<ConstantSDNode>(RHSOp.Val)->isNullValue()) ||
3840 (RHSOp.getOpcode() == ISD::ConstantFP &&
3841 !cast<ConstantFPSDNode>(RHSOp.Val)->getValue()))
3844 Ops.push_back(DAG.getNode(ScalarOp, EltType, LHSOp, RHSOp));
3845 AddToWorkList(Ops.back().Val);
3846 assert((Ops.back().getOpcode() == ISD::UNDEF ||
3847 Ops.back().getOpcode() == ISD::Constant ||
3848 Ops.back().getOpcode() == ISD::ConstantFP) &&
3849 "Scalar binop didn't fold!");
3852 if (Ops.size() == LHS.getNumOperands()-2) {
3853 Ops.push_back(*(LHS.Val->op_end()-2));
3854 Ops.push_back(*(LHS.Val->op_end()-1));
3855 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &Ops[0], Ops.size());
3862 SDOperand DAGCombiner::SimplifySelect(SDOperand N0, SDOperand N1, SDOperand N2){
3863 assert(N0.getOpcode() ==ISD::SETCC && "First argument must be a SetCC node!");
3865 SDOperand SCC = SimplifySelectCC(N0.getOperand(0), N0.getOperand(1), N1, N2,
3866 cast<CondCodeSDNode>(N0.getOperand(2))->get());
3867 // If we got a simplified select_cc node back from SimplifySelectCC, then
3868 // break it down into a new SETCC node, and a new SELECT node, and then return
3869 // the SELECT node, since we were called with a SELECT node.
3871 // Check to see if we got a select_cc back (to turn into setcc/select).
3872 // Otherwise, just return whatever node we got back, like fabs.
3873 if (SCC.getOpcode() == ISD::SELECT_CC) {
3874 SDOperand SETCC = DAG.getNode(ISD::SETCC, N0.getValueType(),
3875 SCC.getOperand(0), SCC.getOperand(1),
3877 AddToWorkList(SETCC.Val);
3878 return DAG.getNode(ISD::SELECT, SCC.getValueType(), SCC.getOperand(2),
3879 SCC.getOperand(3), SETCC);
3886 /// SimplifySelectOps - Given a SELECT or a SELECT_CC node, where LHS and RHS
3887 /// are the two values being selected between, see if we can simplify the
3888 /// select. Callers of this should assume that TheSelect is deleted if this
3889 /// returns true. As such, they should return the appropriate thing (e.g. the
3890 /// node) back to the top-level of the DAG combiner loop to avoid it being
3893 bool DAGCombiner::SimplifySelectOps(SDNode *TheSelect, SDOperand LHS,
3896 // If this is a select from two identical things, try to pull the operation
3897 // through the select.
3898 if (LHS.getOpcode() == RHS.getOpcode() && LHS.hasOneUse() && RHS.hasOneUse()){
3899 // If this is a load and the token chain is identical, replace the select
3900 // of two loads with a load through a select of the address to load from.
3901 // This triggers in things like "select bool X, 10.0, 123.0" after the FP
3902 // constants have been dropped into the constant pool.
3903 if (LHS.getOpcode() == ISD::LOAD &&
3904 // Token chains must be identical.
3905 LHS.getOperand(0) == RHS.getOperand(0)) {
3906 LoadSDNode *LLD = cast<LoadSDNode>(LHS);
3907 LoadSDNode *RLD = cast<LoadSDNode>(RHS);
3909 // If this is an EXTLOAD, the VT's must match.
3910 if (LLD->getLoadedVT() == RLD->getLoadedVT()) {
3911 // FIXME: this conflates two src values, discarding one. This is not
3912 // the right thing to do, but nothing uses srcvalues now. When they do,
3913 // turn SrcValue into a list of locations.
3915 if (TheSelect->getOpcode() == ISD::SELECT) {
3916 // Check that the condition doesn't reach either load. If so, folding
3917 // this will induce a cycle into the DAG.
3918 if (!LLD->isPredecessor(TheSelect->getOperand(0).Val) &&
3919 !RLD->isPredecessor(TheSelect->getOperand(0).Val)) {
3920 Addr = DAG.getNode(ISD::SELECT, LLD->getBasePtr().getValueType(),
3921 TheSelect->getOperand(0), LLD->getBasePtr(),
3925 // Check that the condition doesn't reach either load. If so, folding
3926 // this will induce a cycle into the DAG.
3927 if (!LLD->isPredecessor(TheSelect->getOperand(0).Val) &&
3928 !RLD->isPredecessor(TheSelect->getOperand(0).Val) &&
3929 !LLD->isPredecessor(TheSelect->getOperand(1).Val) &&
3930 !RLD->isPredecessor(TheSelect->getOperand(1).Val)) {
3931 Addr = DAG.getNode(ISD::SELECT_CC, LLD->getBasePtr().getValueType(),
3932 TheSelect->getOperand(0),
3933 TheSelect->getOperand(1),
3934 LLD->getBasePtr(), RLD->getBasePtr(),
3935 TheSelect->getOperand(4));
3941 if (LLD->getExtensionType() == ISD::NON_EXTLOAD)
3942 Load = DAG.getLoad(TheSelect->getValueType(0), LLD->getChain(),
3943 Addr,LLD->getSrcValue(),
3944 LLD->getSrcValueOffset());
3946 Load = DAG.getExtLoad(LLD->getExtensionType(),
3947 TheSelect->getValueType(0),
3948 LLD->getChain(), Addr, LLD->getSrcValue(),
3949 LLD->getSrcValueOffset(),
3950 LLD->getLoadedVT());
3952 // Users of the select now use the result of the load.
3953 CombineTo(TheSelect, Load);
3955 // Users of the old loads now use the new load's chain. We know the
3956 // old-load value is dead now.
3957 CombineTo(LHS.Val, Load.getValue(0), Load.getValue(1));
3958 CombineTo(RHS.Val, Load.getValue(0), Load.getValue(1));
3968 SDOperand DAGCombiner::SimplifySelectCC(SDOperand N0, SDOperand N1,
3969 SDOperand N2, SDOperand N3,
3972 MVT::ValueType VT = N2.getValueType();
3973 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
3974 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
3975 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
3977 // Determine if the condition we're dealing with is constant
3978 SDOperand SCC = SimplifySetCC(TLI.getSetCCResultTy(), N0, N1, CC, false);
3979 if (SCC.Val) AddToWorkList(SCC.Val);
3980 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.Val);
3982 // fold select_cc true, x, y -> x
3983 if (SCCC && SCCC->getValue())
3985 // fold select_cc false, x, y -> y
3986 if (SCCC && SCCC->getValue() == 0)
3989 // Check to see if we can simplify the select into an fabs node
3990 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1)) {
3991 // Allow either -0.0 or 0.0
3992 if (CFP->getValue() == 0.0) {
3993 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs
3994 if ((CC == ISD::SETGE || CC == ISD::SETGT) &&
3995 N0 == N2 && N3.getOpcode() == ISD::FNEG &&
3996 N2 == N3.getOperand(0))
3997 return DAG.getNode(ISD::FABS, VT, N0);
3999 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs
4000 if ((CC == ISD::SETLT || CC == ISD::SETLE) &&
4001 N0 == N3 && N2.getOpcode() == ISD::FNEG &&
4002 N2.getOperand(0) == N3)
4003 return DAG.getNode(ISD::FABS, VT, N3);
4007 // Check to see if we can perform the "gzip trick", transforming
4008 // select_cc setlt X, 0, A, 0 -> and (sra X, size(X)-1), A
4009 if (N1C && N3C && N3C->isNullValue() && CC == ISD::SETLT &&
4010 MVT::isInteger(N0.getValueType()) &&
4011 MVT::isInteger(N2.getValueType()) &&
4012 (N1C->isNullValue() || // (a < 0) ? b : 0
4013 (N1C->getValue() == 1 && N0 == N2))) { // (a < 1) ? a : 0
4014 MVT::ValueType XType = N0.getValueType();
4015 MVT::ValueType AType = N2.getValueType();
4016 if (XType >= AType) {
4017 // and (sra X, size(X)-1, A) -> "and (srl X, C2), A" iff A is a
4018 // single-bit constant.
4019 if (N2C && ((N2C->getValue() & (N2C->getValue()-1)) == 0)) {
4020 unsigned ShCtV = Log2_64(N2C->getValue());
4021 ShCtV = MVT::getSizeInBits(XType)-ShCtV-1;
4022 SDOperand ShCt = DAG.getConstant(ShCtV, TLI.getShiftAmountTy());
4023 SDOperand Shift = DAG.getNode(ISD::SRL, XType, N0, ShCt);
4024 AddToWorkList(Shift.Val);
4025 if (XType > AType) {
4026 Shift = DAG.getNode(ISD::TRUNCATE, AType, Shift);
4027 AddToWorkList(Shift.Val);
4029 return DAG.getNode(ISD::AND, AType, Shift, N2);
4031 SDOperand Shift = DAG.getNode(ISD::SRA, XType, N0,
4032 DAG.getConstant(MVT::getSizeInBits(XType)-1,
4033 TLI.getShiftAmountTy()));
4034 AddToWorkList(Shift.Val);
4035 if (XType > AType) {
4036 Shift = DAG.getNode(ISD::TRUNCATE, AType, Shift);
4037 AddToWorkList(Shift.Val);
4039 return DAG.getNode(ISD::AND, AType, Shift, N2);
4043 // fold select C, 16, 0 -> shl C, 4
4044 if (N2C && N3C && N3C->isNullValue() && isPowerOf2_64(N2C->getValue()) &&
4045 TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult) {
4046 // Get a SetCC of the condition
4047 // FIXME: Should probably make sure that setcc is legal if we ever have a
4048 // target where it isn't.
4049 SDOperand Temp, SCC;
4050 // cast from setcc result type to select result type
4051 if (AfterLegalize) {
4052 SCC = DAG.getSetCC(TLI.getSetCCResultTy(), N0, N1, CC);
4053 if (N2.getValueType() < SCC.getValueType())
4054 Temp = DAG.getZeroExtendInReg(SCC, N2.getValueType());
4056 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getValueType(), SCC);
4058 SCC = DAG.getSetCC(MVT::i1, N0, N1, CC);
4059 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getValueType(), SCC);
4061 AddToWorkList(SCC.Val);
4062 AddToWorkList(Temp.Val);
4063 // shl setcc result by log2 n2c
4064 return DAG.getNode(ISD::SHL, N2.getValueType(), Temp,
4065 DAG.getConstant(Log2_64(N2C->getValue()),
4066 TLI.getShiftAmountTy()));
4069 // Check to see if this is the equivalent of setcc
4070 // FIXME: Turn all of these into setcc if setcc if setcc is legal
4071 // otherwise, go ahead with the folds.
4072 if (0 && N3C && N3C->isNullValue() && N2C && (N2C->getValue() == 1ULL)) {
4073 MVT::ValueType XType = N0.getValueType();
4074 if (TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultTy())) {
4075 SDOperand Res = DAG.getSetCC(TLI.getSetCCResultTy(), N0, N1, CC);
4076 if (Res.getValueType() != VT)
4077 Res = DAG.getNode(ISD::ZERO_EXTEND, VT, Res);
4081 // seteq X, 0 -> srl (ctlz X, log2(size(X)))
4082 if (N1C && N1C->isNullValue() && CC == ISD::SETEQ &&
4083 TLI.isOperationLegal(ISD::CTLZ, XType)) {
4084 SDOperand Ctlz = DAG.getNode(ISD::CTLZ, XType, N0);
4085 return DAG.getNode(ISD::SRL, XType, Ctlz,
4086 DAG.getConstant(Log2_32(MVT::getSizeInBits(XType)),
4087 TLI.getShiftAmountTy()));
4089 // setgt X, 0 -> srl (and (-X, ~X), size(X)-1)
4090 if (N1C && N1C->isNullValue() && CC == ISD::SETGT) {
4091 SDOperand NegN0 = DAG.getNode(ISD::SUB, XType, DAG.getConstant(0, XType),
4093 SDOperand NotN0 = DAG.getNode(ISD::XOR, XType, N0,
4094 DAG.getConstant(~0ULL, XType));
4095 return DAG.getNode(ISD::SRL, XType,
4096 DAG.getNode(ISD::AND, XType, NegN0, NotN0),
4097 DAG.getConstant(MVT::getSizeInBits(XType)-1,
4098 TLI.getShiftAmountTy()));
4100 // setgt X, -1 -> xor (srl (X, size(X)-1), 1)
4101 if (N1C && N1C->isAllOnesValue() && CC == ISD::SETGT) {
4102 SDOperand Sign = DAG.getNode(ISD::SRL, XType, N0,
4103 DAG.getConstant(MVT::getSizeInBits(XType)-1,
4104 TLI.getShiftAmountTy()));
4105 return DAG.getNode(ISD::XOR, XType, Sign, DAG.getConstant(1, XType));
4109 // Check to see if this is an integer abs. select_cc setl[te] X, 0, -X, X ->
4110 // Y = sra (X, size(X)-1); xor (add (X, Y), Y)
4111 if (N1C && N1C->isNullValue() && (CC == ISD::SETLT || CC == ISD::SETLE) &&
4112 N0 == N3 && N2.getOpcode() == ISD::SUB && N0 == N2.getOperand(1)) {
4113 if (ConstantSDNode *SubC = dyn_cast<ConstantSDNode>(N2.getOperand(0))) {
4114 MVT::ValueType XType = N0.getValueType();
4115 if (SubC->isNullValue() && MVT::isInteger(XType)) {
4116 SDOperand Shift = DAG.getNode(ISD::SRA, XType, N0,
4117 DAG.getConstant(MVT::getSizeInBits(XType)-1,
4118 TLI.getShiftAmountTy()));
4119 SDOperand Add = DAG.getNode(ISD::ADD, XType, N0, Shift);
4120 AddToWorkList(Shift.Val);
4121 AddToWorkList(Add.Val);
4122 return DAG.getNode(ISD::XOR, XType, Add, Shift);
4130 /// SimplifySetCC - This is a stub for TargetLowering::SimplifySetCC.
4131 SDOperand DAGCombiner::SimplifySetCC(MVT::ValueType VT, SDOperand N0,
4132 SDOperand N1, ISD::CondCode Cond,
4133 bool foldBooleans) {
4134 TargetLowering::DAGCombinerInfo
4135 DagCombineInfo(DAG, !AfterLegalize, false, this);
4136 return TLI.SimplifySetCC(VT, N0, N1, Cond, foldBooleans, DagCombineInfo);
4139 /// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant,
4140 /// return a DAG expression to select that will generate the same value by
4141 /// multiplying by a magic number. See:
4142 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
4143 SDOperand DAGCombiner::BuildSDIV(SDNode *N) {
4144 std::vector<SDNode*> Built;
4145 SDOperand S = TLI.BuildSDIV(N, DAG, &Built);
4147 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end();
4153 /// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant,
4154 /// return a DAG expression to select that will generate the same value by
4155 /// multiplying by a magic number. See:
4156 /// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html>
4157 SDOperand DAGCombiner::BuildUDIV(SDNode *N) {
4158 std::vector<SDNode*> Built;
4159 SDOperand S = TLI.BuildUDIV(N, DAG, &Built);
4161 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end();
4167 /// FindBaseOffset - Return true if base is known not to alias with anything
4168 /// but itself. Provides base object and offset as results.
4169 static bool FindBaseOffset(SDOperand Ptr, SDOperand &Base, int64_t &Offset) {
4170 // Assume it is a primitive operation.
4171 Base = Ptr; Offset = 0;
4173 // If it's an adding a simple constant then integrate the offset.
4174 if (Base.getOpcode() == ISD::ADD) {
4175 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Base.getOperand(1))) {
4176 Base = Base.getOperand(0);
4177 Offset += C->getValue();
4181 // If it's any of the following then it can't alias with anything but itself.
4182 return isa<FrameIndexSDNode>(Base) ||
4183 isa<ConstantPoolSDNode>(Base) ||
4184 isa<GlobalAddressSDNode>(Base);
4187 /// isAlias - Return true if there is any possibility that the two addresses
4189 bool DAGCombiner::isAlias(SDOperand Ptr1, int64_t Size1,
4190 const Value *SrcValue1, int SrcValueOffset1,
4191 SDOperand Ptr2, int64_t Size2,
4192 const Value *SrcValue2, int SrcValueOffset2)
4194 // If they are the same then they must be aliases.
4195 if (Ptr1 == Ptr2) return true;
4197 // Gather base node and offset information.
4198 SDOperand Base1, Base2;
4199 int64_t Offset1, Offset2;
4200 bool KnownBase1 = FindBaseOffset(Ptr1, Base1, Offset1);
4201 bool KnownBase2 = FindBaseOffset(Ptr2, Base2, Offset2);
4203 // If they have a same base address then...
4204 if (Base1 == Base2) {
4205 // Check to see if the addresses overlap.
4206 return!((Offset1 + Size1) <= Offset2 || (Offset2 + Size2) <= Offset1);
4209 // If we know both bases then they can't alias.
4210 if (KnownBase1 && KnownBase2) return false;
4212 if (CombinerGlobalAA) {
4213 // Use alias analysis information.
4214 int Overlap1 = Size1 + SrcValueOffset1 + Offset1;
4215 int Overlap2 = Size2 + SrcValueOffset2 + Offset2;
4216 AliasAnalysis::AliasResult AAResult =
4217 AA.alias(SrcValue1, Overlap1, SrcValue2, Overlap2);
4218 if (AAResult == AliasAnalysis::NoAlias)
4222 // Otherwise we have to assume they alias.
4226 /// FindAliasInfo - Extracts the relevant alias information from the memory
4227 /// node. Returns true if the operand was a load.
4228 bool DAGCombiner::FindAliasInfo(SDNode *N,
4229 SDOperand &Ptr, int64_t &Size,
4230 const Value *&SrcValue, int &SrcValueOffset) {
4231 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
4232 Ptr = LD->getBasePtr();
4233 Size = MVT::getSizeInBits(LD->getLoadedVT()) >> 3;
4234 SrcValue = LD->getSrcValue();
4235 SrcValueOffset = LD->getSrcValueOffset();
4237 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
4238 Ptr = ST->getBasePtr();
4239 Size = MVT::getSizeInBits(ST->getStoredVT()) >> 3;
4240 SrcValue = ST->getSrcValue();
4241 SrcValueOffset = ST->getSrcValueOffset();
4243 assert(0 && "FindAliasInfo expected a memory operand");
4249 /// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes,
4250 /// looking for aliasing nodes and adding them to the Aliases vector.
4251 void DAGCombiner::GatherAllAliases(SDNode *N, SDOperand OriginalChain,
4252 SmallVector<SDOperand, 8> &Aliases) {
4253 SmallVector<SDOperand, 8> Chains; // List of chains to visit.
4254 std::set<SDNode *> Visited; // Visited node set.
4256 // Get alias information for node.
4259 const Value *SrcValue;
4261 bool IsLoad = FindAliasInfo(N, Ptr, Size, SrcValue, SrcValueOffset);
4264 Chains.push_back(OriginalChain);
4266 // Look at each chain and determine if it is an alias. If so, add it to the
4267 // aliases list. If not, then continue up the chain looking for the next
4269 while (!Chains.empty()) {
4270 SDOperand Chain = Chains.back();
4273 // Don't bother if we've been before.
4274 if (Visited.find(Chain.Val) != Visited.end()) continue;
4275 Visited.insert(Chain.Val);
4277 switch (Chain.getOpcode()) {
4278 case ISD::EntryToken:
4279 // Entry token is ideal chain operand, but handled in FindBetterChain.
4284 // Get alias information for Chain.
4287 const Value *OpSrcValue;
4288 int OpSrcValueOffset;
4289 bool IsOpLoad = FindAliasInfo(Chain.Val, OpPtr, OpSize,
4290 OpSrcValue, OpSrcValueOffset);
4292 // If chain is alias then stop here.
4293 if (!(IsLoad && IsOpLoad) &&
4294 isAlias(Ptr, Size, SrcValue, SrcValueOffset,
4295 OpPtr, OpSize, OpSrcValue, OpSrcValueOffset)) {
4296 Aliases.push_back(Chain);
4298 // Look further up the chain.
4299 Chains.push_back(Chain.getOperand(0));
4300 // Clean up old chain.
4301 AddToWorkList(Chain.Val);
4306 case ISD::TokenFactor:
4307 // We have to check each of the operands of the token factor, so we queue
4308 // then up. Adding the operands to the queue (stack) in reverse order
4309 // maintains the original order and increases the likelihood that getNode
4310 // will find a matching token factor (CSE.)
4311 for (unsigned n = Chain.getNumOperands(); n;)
4312 Chains.push_back(Chain.getOperand(--n));
4313 // Eliminate the token factor if we can.
4314 AddToWorkList(Chain.Val);
4318 // For all other instructions we will just have to take what we can get.
4319 Aliases.push_back(Chain);
4325 /// FindBetterChain - Walk up chain skipping non-aliasing memory nodes, looking
4326 /// for a better chain (aliasing node.)
4327 SDOperand DAGCombiner::FindBetterChain(SDNode *N, SDOperand OldChain) {
4328 SmallVector<SDOperand, 8> Aliases; // Ops for replacing token factor.
4330 // Accumulate all the aliases to this node.
4331 GatherAllAliases(N, OldChain, Aliases);
4333 if (Aliases.size() == 0) {
4334 // If no operands then chain to entry token.
4335 return DAG.getEntryNode();
4336 } else if (Aliases.size() == 1) {
4337 // If a single operand then chain to it. We don't need to revisit it.
4341 // Construct a custom tailored token factor.
4342 SDOperand NewChain = DAG.getNode(ISD::TokenFactor, MVT::Other,
4343 &Aliases[0], Aliases.size());
4345 // Make sure the old chain gets cleaned up.
4346 if (NewChain != OldChain) AddToWorkList(OldChain.Val);
4351 // SelectionDAG::Combine - This is the entry point for the file.
4353 void SelectionDAG::Combine(bool RunningAfterLegalize, AliasAnalysis &AA) {
4354 if (!RunningAfterLegalize && ViewDAGCombine1)
4356 if (RunningAfterLegalize && ViewDAGCombine2)
4358 /// run - This is the main entry point to this class.
4360 DAGCombiner(*this, AA).Run(RunningAfterLegalize);