1 //===-- DAGCombiner.cpp - Implement a DAG node combiner -------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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 // This pass is not a substitute for the LLVM IR instcombine pass. This pass is
14 // primarily intended to handle simplification opportunities that are implicit
15 // in the LLVM IR and exposed by the various codegen lowering phases.
17 //===----------------------------------------------------------------------===//
19 #include "llvm/ADT/SetVector.h"
20 #include "llvm/ADT/SmallBitVector.h"
21 #include "llvm/ADT/SmallPtrSet.h"
22 #include "llvm/ADT/SmallSet.h"
23 #include "llvm/ADT/Statistic.h"
24 #include "llvm/Analysis/AliasAnalysis.h"
25 #include "llvm/CodeGen/MachineFrameInfo.h"
26 #include "llvm/CodeGen/MachineFunction.h"
27 #include "llvm/CodeGen/SelectionDAG.h"
28 #include "llvm/CodeGen/SelectionDAGTargetInfo.h"
29 #include "llvm/IR/DataLayout.h"
30 #include "llvm/IR/DerivedTypes.h"
31 #include "llvm/IR/Function.h"
32 #include "llvm/IR/LLVMContext.h"
33 #include "llvm/Support/CommandLine.h"
34 #include "llvm/Support/Debug.h"
35 #include "llvm/Support/ErrorHandling.h"
36 #include "llvm/Support/MathExtras.h"
37 #include "llvm/Support/raw_ostream.h"
38 #include "llvm/Target/TargetLowering.h"
39 #include "llvm/Target/TargetOptions.h"
40 #include "llvm/Target/TargetRegisterInfo.h"
41 #include "llvm/Target/TargetSubtargetInfo.h"
45 #define DEBUG_TYPE "dagcombine"
47 STATISTIC(NodesCombined , "Number of dag nodes combined");
48 STATISTIC(PreIndexedNodes , "Number of pre-indexed nodes created");
49 STATISTIC(PostIndexedNodes, "Number of post-indexed nodes created");
50 STATISTIC(OpsNarrowed , "Number of load/op/store narrowed");
51 STATISTIC(LdStFP2Int , "Number of fp load/store pairs transformed to int");
52 STATISTIC(SlicedLoads, "Number of load sliced");
56 CombinerAA("combiner-alias-analysis", cl::Hidden,
57 cl::desc("Enable DAG combiner alias-analysis heuristics"));
60 CombinerGlobalAA("combiner-global-alias-analysis", cl::Hidden,
61 cl::desc("Enable DAG combiner's use of IR alias analysis"));
64 UseTBAA("combiner-use-tbaa", cl::Hidden, cl::init(true),
65 cl::desc("Enable DAG combiner's use of TBAA"));
68 static cl::opt<std::string>
69 CombinerAAOnlyFunc("combiner-aa-only-func", cl::Hidden,
70 cl::desc("Only use DAG-combiner alias analysis in this"
74 /// Hidden option to stress test load slicing, i.e., when this option
75 /// is enabled, load slicing bypasses most of its profitability guards.
77 StressLoadSlicing("combiner-stress-load-slicing", cl::Hidden,
78 cl::desc("Bypass the profitability model of load "
83 MaySplitLoadIndex("combiner-split-load-index", cl::Hidden, cl::init(true),
84 cl::desc("DAG combiner may split indexing from loads"));
86 //------------------------------ DAGCombiner ---------------------------------//
90 const TargetLowering &TLI;
92 CodeGenOpt::Level OptLevel;
97 /// \brief Worklist of all of the nodes that need to be simplified.
99 /// This must behave as a stack -- new nodes to process are pushed onto the
100 /// back and when processing we pop off of the back.
102 /// The worklist will not contain duplicates but may contain null entries
103 /// due to nodes being deleted from the underlying DAG.
104 SmallVector<SDNode *, 64> Worklist;
106 /// \brief Mapping from an SDNode to its position on the worklist.
108 /// This is used to find and remove nodes from the worklist (by nulling
109 /// them) when they are deleted from the underlying DAG. It relies on
110 /// stable indices of nodes within the worklist.
111 DenseMap<SDNode *, unsigned> WorklistMap;
113 /// \brief Set of nodes which have been combined (at least once).
115 /// This is used to allow us to reliably add any operands of a DAG node
116 /// which have not yet been combined to the worklist.
117 SmallPtrSet<SDNode *, 32> CombinedNodes;
119 // AA - Used for DAG load/store alias analysis.
122 /// When an instruction is simplified, add all users of the instruction to
123 /// the work lists because they might get more simplified now.
124 void AddUsersToWorklist(SDNode *N) {
125 for (SDNode *Node : N->uses())
129 /// Call the node-specific routine that folds each particular type of node.
130 SDValue visit(SDNode *N);
133 /// Add to the worklist making sure its instance is at the back (next to be
135 void AddToWorklist(SDNode *N) {
136 // Skip handle nodes as they can't usefully be combined and confuse the
137 // zero-use deletion strategy.
138 if (N->getOpcode() == ISD::HANDLENODE)
141 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
142 Worklist.push_back(N);
145 /// Remove all instances of N from the worklist.
146 void removeFromWorklist(SDNode *N) {
147 CombinedNodes.erase(N);
149 auto It = WorklistMap.find(N);
150 if (It == WorklistMap.end())
151 return; // Not in the worklist.
153 // Null out the entry rather than erasing it to avoid a linear operation.
154 Worklist[It->second] = nullptr;
155 WorklistMap.erase(It);
158 void deleteAndRecombine(SDNode *N);
159 bool recursivelyDeleteUnusedNodes(SDNode *N);
161 /// Replaces all uses of the results of one DAG node with new values.
162 SDValue CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
165 /// Replaces all uses of the results of one DAG node with new values.
166 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true) {
167 return CombineTo(N, &Res, 1, AddTo);
170 /// Replaces all uses of the results of one DAG node with new values.
171 SDValue CombineTo(SDNode *N, SDValue Res0, SDValue Res1,
173 SDValue To[] = { Res0, Res1 };
174 return CombineTo(N, To, 2, AddTo);
177 void CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO);
181 /// Check the specified integer node value to see if it can be simplified or
182 /// if things it uses can be simplified by bit propagation.
183 /// If so, return true.
184 bool SimplifyDemandedBits(SDValue Op) {
185 unsigned BitWidth = Op.getScalarValueSizeInBits();
186 APInt Demanded = APInt::getAllOnesValue(BitWidth);
187 return SimplifyDemandedBits(Op, Demanded);
190 bool SimplifyDemandedBits(SDValue Op, const APInt &Demanded);
192 bool CombineToPreIndexedLoadStore(SDNode *N);
193 bool CombineToPostIndexedLoadStore(SDNode *N);
194 SDValue SplitIndexingFromLoad(LoadSDNode *LD);
195 bool SliceUpLoad(SDNode *N);
197 /// \brief Replace an ISD::EXTRACT_VECTOR_ELT of a load with a narrowed
200 /// \param EVE ISD::EXTRACT_VECTOR_ELT to be replaced.
201 /// \param InVecVT type of the input vector to EVE with bitcasts resolved.
202 /// \param EltNo index of the vector element to load.
203 /// \param OriginalLoad load that EVE came from to be replaced.
204 /// \returns EVE on success SDValue() on failure.
205 SDValue ReplaceExtractVectorEltOfLoadWithNarrowedLoad(
206 SDNode *EVE, EVT InVecVT, SDValue EltNo, LoadSDNode *OriginalLoad);
207 void ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad);
208 SDValue PromoteOperand(SDValue Op, EVT PVT, bool &Replace);
209 SDValue SExtPromoteOperand(SDValue Op, EVT PVT);
210 SDValue ZExtPromoteOperand(SDValue Op, EVT PVT);
211 SDValue PromoteIntBinOp(SDValue Op);
212 SDValue PromoteIntShiftOp(SDValue Op);
213 SDValue PromoteExtend(SDValue Op);
214 bool PromoteLoad(SDValue Op);
216 void ExtendSetCCUses(const SmallVectorImpl<SDNode *> &SetCCs, SDValue Trunc,
217 SDValue ExtLoad, const SDLoc &DL,
218 ISD::NodeType ExtType);
220 /// Call the node-specific routine that knows how to fold each
221 /// particular type of node. If that doesn't do anything, try the
222 /// target-specific DAG combines.
223 SDValue combine(SDNode *N);
225 // Visitation implementation - Implement dag node combining for different
226 // node types. The semantics are as follows:
228 // SDValue.getNode() == 0 - No change was made
229 // SDValue.getNode() == N - N was replaced, is dead and has been handled.
230 // otherwise - N should be replaced by the returned Operand.
232 SDValue visitTokenFactor(SDNode *N);
233 SDValue visitMERGE_VALUES(SDNode *N);
234 SDValue visitADD(SDNode *N);
235 SDValue visitSUB(SDNode *N);
236 SDValue visitADDC(SDNode *N);
237 SDValue visitSUBC(SDNode *N);
238 SDValue visitADDE(SDNode *N);
239 SDValue visitSUBE(SDNode *N);
240 SDValue visitMUL(SDNode *N);
241 SDValue useDivRem(SDNode *N);
242 SDValue visitSDIV(SDNode *N);
243 SDValue visitUDIV(SDNode *N);
244 SDValue visitREM(SDNode *N);
245 SDValue visitMULHU(SDNode *N);
246 SDValue visitMULHS(SDNode *N);
247 SDValue visitSMUL_LOHI(SDNode *N);
248 SDValue visitUMUL_LOHI(SDNode *N);
249 SDValue visitSMULO(SDNode *N);
250 SDValue visitUMULO(SDNode *N);
251 SDValue visitIMINMAX(SDNode *N);
252 SDValue visitAND(SDNode *N);
253 SDValue visitANDLike(SDValue N0, SDValue N1, SDNode *LocReference);
254 SDValue visitOR(SDNode *N);
255 SDValue visitORLike(SDValue N0, SDValue N1, SDNode *LocReference);
256 SDValue visitXOR(SDNode *N);
257 SDValue SimplifyVBinOp(SDNode *N);
258 SDValue visitSHL(SDNode *N);
259 SDValue visitSRA(SDNode *N);
260 SDValue visitSRL(SDNode *N);
261 SDValue visitRotate(SDNode *N);
262 SDValue visitBSWAP(SDNode *N);
263 SDValue visitBITREVERSE(SDNode *N);
264 SDValue visitCTLZ(SDNode *N);
265 SDValue visitCTLZ_ZERO_UNDEF(SDNode *N);
266 SDValue visitCTTZ(SDNode *N);
267 SDValue visitCTTZ_ZERO_UNDEF(SDNode *N);
268 SDValue visitCTPOP(SDNode *N);
269 SDValue visitSELECT(SDNode *N);
270 SDValue visitVSELECT(SDNode *N);
271 SDValue visitSELECT_CC(SDNode *N);
272 SDValue visitSETCC(SDNode *N);
273 SDValue visitSETCCE(SDNode *N);
274 SDValue visitSIGN_EXTEND(SDNode *N);
275 SDValue visitZERO_EXTEND(SDNode *N);
276 SDValue visitANY_EXTEND(SDNode *N);
277 SDValue visitSIGN_EXTEND_INREG(SDNode *N);
278 SDValue visitSIGN_EXTEND_VECTOR_INREG(SDNode *N);
279 SDValue visitZERO_EXTEND_VECTOR_INREG(SDNode *N);
280 SDValue visitTRUNCATE(SDNode *N);
281 SDValue visitBITCAST(SDNode *N);
282 SDValue visitBUILD_PAIR(SDNode *N);
283 SDValue visitFADD(SDNode *N);
284 SDValue visitFSUB(SDNode *N);
285 SDValue visitFMUL(SDNode *N);
286 SDValue visitFMA(SDNode *N);
287 SDValue visitFDIV(SDNode *N);
288 SDValue visitFREM(SDNode *N);
289 SDValue visitFSQRT(SDNode *N);
290 SDValue visitFCOPYSIGN(SDNode *N);
291 SDValue visitSINT_TO_FP(SDNode *N);
292 SDValue visitUINT_TO_FP(SDNode *N);
293 SDValue visitFP_TO_SINT(SDNode *N);
294 SDValue visitFP_TO_UINT(SDNode *N);
295 SDValue visitFP_ROUND(SDNode *N);
296 SDValue visitFP_ROUND_INREG(SDNode *N);
297 SDValue visitFP_EXTEND(SDNode *N);
298 SDValue visitFNEG(SDNode *N);
299 SDValue visitFABS(SDNode *N);
300 SDValue visitFCEIL(SDNode *N);
301 SDValue visitFTRUNC(SDNode *N);
302 SDValue visitFFLOOR(SDNode *N);
303 SDValue visitFMINNUM(SDNode *N);
304 SDValue visitFMAXNUM(SDNode *N);
305 SDValue visitBRCOND(SDNode *N);
306 SDValue visitBR_CC(SDNode *N);
307 SDValue visitLOAD(SDNode *N);
309 SDValue replaceStoreChain(StoreSDNode *ST, SDValue BetterChain);
310 SDValue replaceStoreOfFPConstant(StoreSDNode *ST);
312 SDValue visitSTORE(SDNode *N);
313 SDValue visitINSERT_VECTOR_ELT(SDNode *N);
314 SDValue visitEXTRACT_VECTOR_ELT(SDNode *N);
315 SDValue visitBUILD_VECTOR(SDNode *N);
316 SDValue visitCONCAT_VECTORS(SDNode *N);
317 SDValue visitEXTRACT_SUBVECTOR(SDNode *N);
318 SDValue visitVECTOR_SHUFFLE(SDNode *N);
319 SDValue visitSCALAR_TO_VECTOR(SDNode *N);
320 SDValue visitINSERT_SUBVECTOR(SDNode *N);
321 SDValue visitMLOAD(SDNode *N);
322 SDValue visitMSTORE(SDNode *N);
323 SDValue visitMGATHER(SDNode *N);
324 SDValue visitMSCATTER(SDNode *N);
325 SDValue visitFP_TO_FP16(SDNode *N);
326 SDValue visitFP16_TO_FP(SDNode *N);
328 SDValue visitFADDForFMACombine(SDNode *N);
329 SDValue visitFSUBForFMACombine(SDNode *N);
330 SDValue visitFMULForFMADistributiveCombine(SDNode *N);
332 SDValue XformToShuffleWithZero(SDNode *N);
333 SDValue ReassociateOps(unsigned Opc, const SDLoc &DL, SDValue LHS,
336 SDValue visitShiftByConstant(SDNode *N, ConstantSDNode *Amt);
338 SDValue foldSelectOfConstants(SDNode *N);
339 bool SimplifySelectOps(SDNode *SELECT, SDValue LHS, SDValue RHS);
340 SDValue SimplifyBinOpWithSameOpcodeHands(SDNode *N);
341 SDValue SimplifySelect(const SDLoc &DL, SDValue N0, SDValue N1, SDValue N2);
342 SDValue SimplifySelectCC(const SDLoc &DL, SDValue N0, SDValue N1,
343 SDValue N2, SDValue N3, ISD::CondCode CC,
344 bool NotExtCompare = false);
345 SDValue foldSelectCCToShiftAnd(const SDLoc &DL, SDValue N0, SDValue N1,
346 SDValue N2, SDValue N3, ISD::CondCode CC);
347 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
348 const SDLoc &DL, bool foldBooleans = true);
350 bool isSetCCEquivalent(SDValue N, SDValue &LHS, SDValue &RHS,
352 bool isOneUseSetCC(SDValue N) const;
354 SDValue SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp,
356 SDValue CombineConsecutiveLoads(SDNode *N, EVT VT);
357 SDValue CombineExtLoad(SDNode *N);
358 SDValue combineRepeatedFPDivisors(SDNode *N);
359 SDValue ConstantFoldBITCASTofBUILD_VECTOR(SDNode *, EVT);
360 SDValue BuildSDIV(SDNode *N);
361 SDValue BuildSDIVPow2(SDNode *N);
362 SDValue BuildUDIV(SDNode *N);
363 SDValue BuildLogBase2(SDValue Op, const SDLoc &DL);
364 SDValue BuildReciprocalEstimate(SDValue Op, SDNodeFlags *Flags);
365 SDValue buildRsqrtEstimate(SDValue Op, SDNodeFlags *Flags);
366 SDValue buildSqrtEstimate(SDValue Op, SDNodeFlags *Flags);
367 SDValue buildSqrtEstimateImpl(SDValue Op, SDNodeFlags *Flags, bool Recip);
368 SDValue buildSqrtNROneConst(SDValue Op, SDValue Est, unsigned Iterations,
369 SDNodeFlags *Flags, bool Reciprocal);
370 SDValue buildSqrtNRTwoConst(SDValue Op, SDValue Est, unsigned Iterations,
371 SDNodeFlags *Flags, bool Reciprocal);
372 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
373 bool DemandHighBits = true);
374 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
375 SDNode *MatchRotatePosNeg(SDValue Shifted, SDValue Pos, SDValue Neg,
376 SDValue InnerPos, SDValue InnerNeg,
377 unsigned PosOpcode, unsigned NegOpcode,
379 SDNode *MatchRotate(SDValue LHS, SDValue RHS, const SDLoc &DL);
380 SDValue ReduceLoadWidth(SDNode *N);
381 SDValue ReduceLoadOpStoreWidth(SDNode *N);
382 SDValue splitMergedValStore(StoreSDNode *ST);
383 SDValue TransformFPLoadStorePair(SDNode *N);
384 SDValue reduceBuildVecExtToExtBuildVec(SDNode *N);
385 SDValue reduceBuildVecConvertToConvertBuildVec(SDNode *N);
386 SDValue reduceBuildVecToShuffle(SDNode *N);
387 SDValue createBuildVecShuffle(SDLoc DL, SDNode *N, ArrayRef<int> VectorMask,
388 SDValue VecIn1, SDValue VecIn2,
391 SDValue GetDemandedBits(SDValue V, const APInt &Mask);
393 /// Walk up chain skipping non-aliasing memory nodes,
394 /// looking for aliasing nodes and adding them to the Aliases vector.
395 void GatherAllAliases(SDNode *N, SDValue OriginalChain,
396 SmallVectorImpl<SDValue> &Aliases);
398 /// Return true if there is any possibility that the two addresses overlap.
399 bool isAlias(LSBaseSDNode *Op0, LSBaseSDNode *Op1) const;
401 /// Walk up chain skipping non-aliasing memory nodes, looking for a better
402 /// chain (aliasing node.)
403 SDValue FindBetterChain(SDNode *N, SDValue Chain);
405 /// Try to replace a store and any possibly adjacent stores on
406 /// consecutive chains with better chains. Return true only if St is
409 /// Notice that other chains may still be replaced even if the function
411 bool findBetterNeighborChains(StoreSDNode *St);
413 /// Match "(X shl/srl V1) & V2" where V2 may not be present.
414 bool MatchRotateHalf(SDValue Op, SDValue &Shift, SDValue &Mask);
416 /// Holds a pointer to an LSBaseSDNode as well as information on where it
417 /// is located in a sequence of memory operations connected by a chain.
419 MemOpLink (LSBaseSDNode *N, int64_t Offset, unsigned Seq):
420 MemNode(N), OffsetFromBase(Offset), SequenceNum(Seq) { }
421 // Ptr to the mem node.
422 LSBaseSDNode *MemNode;
423 // Offset from the base ptr.
424 int64_t OffsetFromBase;
425 // What is the sequence number of this mem node.
426 // Lowest mem operand in the DAG starts at zero.
427 unsigned SequenceNum;
430 /// This is a helper function for visitMUL to check the profitability
431 /// of folding (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2).
432 /// MulNode is the original multiply, AddNode is (add x, c1),
433 /// and ConstNode is c2.
434 bool isMulAddWithConstProfitable(SDNode *MulNode,
438 /// This is a helper function for MergeStoresOfConstantsOrVecElts. Returns a
439 /// constant build_vector of the stored constant values in Stores.
440 SDValue getMergedConstantVectorStore(SelectionDAG &DAG, const SDLoc &SL,
441 ArrayRef<MemOpLink> Stores,
442 SmallVectorImpl<SDValue> &Chains,
445 /// This is a helper function for visitAND and visitZERO_EXTEND. Returns
446 /// true if the (and (load x) c) pattern matches an extload. ExtVT returns
447 /// the type of the loaded value to be extended. LoadedVT returns the type
448 /// of the original loaded value. NarrowLoad returns whether the load would
449 /// need to be narrowed in order to match.
450 bool isAndLoadExtLoad(ConstantSDNode *AndC, LoadSDNode *LoadN,
451 EVT LoadResultTy, EVT &ExtVT, EVT &LoadedVT,
454 /// This is a helper function for MergeConsecutiveStores. When the source
455 /// elements of the consecutive stores are all constants or all extracted
456 /// vector elements, try to merge them into one larger store.
457 /// \return number of stores that were merged into a merged store (always
458 /// a prefix of \p StoreNode).
459 bool MergeStoresOfConstantsOrVecElts(
460 SmallVectorImpl<MemOpLink> &StoreNodes, EVT MemVT, unsigned NumStores,
461 bool IsConstantSrc, bool UseVector);
463 /// This is a helper function for MergeConsecutiveStores.
464 /// Stores that may be merged are placed in StoreNodes.
465 /// Loads that may alias with those stores are placed in AliasLoadNodes.
466 void getStoreMergeAndAliasCandidates(
467 StoreSDNode* St, SmallVectorImpl<MemOpLink> &StoreNodes,
468 SmallVectorImpl<LSBaseSDNode*> &AliasLoadNodes);
470 /// Helper function for MergeConsecutiveStores. Checks if
471 /// Candidate stores have indirect dependency through their
472 /// operands. \return True if safe to merge
473 bool checkMergeStoreCandidatesForDependencies(
474 SmallVectorImpl<MemOpLink> &StoreNodes);
476 /// Merge consecutive store operations into a wide store.
477 /// This optimization uses wide integers or vectors when possible.
478 /// \return number of stores that were merged into a merged store (the
479 /// affected nodes are stored as a prefix in \p StoreNodes).
480 bool MergeConsecutiveStores(StoreSDNode *N,
481 SmallVectorImpl<MemOpLink> &StoreNodes);
483 /// \brief Try to transform a truncation where C is a constant:
484 /// (trunc (and X, C)) -> (and (trunc X), (trunc C))
486 /// \p N needs to be a truncation and its first operand an AND. Other
487 /// requirements are checked by the function (e.g. that trunc is
488 /// single-use) and if missed an empty SDValue is returned.
489 SDValue distributeTruncateThroughAnd(SDNode *N);
492 DAGCombiner(SelectionDAG &D, AliasAnalysis &A, CodeGenOpt::Level OL)
493 : DAG(D), TLI(D.getTargetLoweringInfo()), Level(BeforeLegalizeTypes),
494 OptLevel(OL), LegalOperations(false), LegalTypes(false), AA(A) {
495 ForCodeSize = DAG.getMachineFunction().getFunction()->optForSize();
498 /// Runs the dag combiner on all nodes in the work list
499 void Run(CombineLevel AtLevel);
501 SelectionDAG &getDAG() const { return DAG; }
503 /// Returns a type large enough to hold any valid shift amount - before type
504 /// legalization these can be huge.
505 EVT getShiftAmountTy(EVT LHSTy) {
506 assert(LHSTy.isInteger() && "Shift amount is not an integer type!");
507 if (LHSTy.isVector())
509 auto &DL = DAG.getDataLayout();
510 return LegalTypes ? TLI.getScalarShiftAmountTy(DL, LHSTy)
511 : TLI.getPointerTy(DL);
514 /// This method returns true if we are running before type legalization or
515 /// if the specified VT is legal.
516 bool isTypeLegal(const EVT &VT) {
517 if (!LegalTypes) return true;
518 return TLI.isTypeLegal(VT);
521 /// Convenience wrapper around TargetLowering::getSetCCResultType
522 EVT getSetCCResultType(EVT VT) const {
523 return TLI.getSetCCResultType(DAG.getDataLayout(), *DAG.getContext(), VT);
530 /// This class is a DAGUpdateListener that removes any deleted
531 /// nodes from the worklist.
532 class WorklistRemover : public SelectionDAG::DAGUpdateListener {
535 explicit WorklistRemover(DAGCombiner &dc)
536 : SelectionDAG::DAGUpdateListener(dc.getDAG()), DC(dc) {}
538 void NodeDeleted(SDNode *N, SDNode *E) override {
539 DC.removeFromWorklist(N);
544 //===----------------------------------------------------------------------===//
545 // TargetLowering::DAGCombinerInfo implementation
546 //===----------------------------------------------------------------------===//
548 void TargetLowering::DAGCombinerInfo::AddToWorklist(SDNode *N) {
549 ((DAGCombiner*)DC)->AddToWorklist(N);
552 SDValue TargetLowering::DAGCombinerInfo::
553 CombineTo(SDNode *N, ArrayRef<SDValue> To, bool AddTo) {
554 return ((DAGCombiner*)DC)->CombineTo(N, &To[0], To.size(), AddTo);
557 SDValue TargetLowering::DAGCombinerInfo::
558 CombineTo(SDNode *N, SDValue Res, bool AddTo) {
559 return ((DAGCombiner*)DC)->CombineTo(N, Res, AddTo);
563 SDValue TargetLowering::DAGCombinerInfo::
564 CombineTo(SDNode *N, SDValue Res0, SDValue Res1, bool AddTo) {
565 return ((DAGCombiner*)DC)->CombineTo(N, Res0, Res1, AddTo);
568 void TargetLowering::DAGCombinerInfo::
569 CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) {
570 return ((DAGCombiner*)DC)->CommitTargetLoweringOpt(TLO);
573 //===----------------------------------------------------------------------===//
575 //===----------------------------------------------------------------------===//
577 void DAGCombiner::deleteAndRecombine(SDNode *N) {
578 removeFromWorklist(N);
580 // If the operands of this node are only used by the node, they will now be
581 // dead. Make sure to re-visit them and recursively delete dead nodes.
582 for (const SDValue &Op : N->ops())
583 // For an operand generating multiple values, one of the values may
584 // become dead allowing further simplification (e.g. split index
585 // arithmetic from an indexed load).
586 if (Op->hasOneUse() || Op->getNumValues() > 1)
587 AddToWorklist(Op.getNode());
592 /// Return 1 if we can compute the negated form of the specified expression for
593 /// the same cost as the expression itself, or 2 if we can compute the negated
594 /// form more cheaply than the expression itself.
595 static char isNegatibleForFree(SDValue Op, bool LegalOperations,
596 const TargetLowering &TLI,
597 const TargetOptions *Options,
598 unsigned Depth = 0) {
599 // fneg is removable even if it has multiple uses.
600 if (Op.getOpcode() == ISD::FNEG) return 2;
602 // Don't allow anything with multiple uses.
603 if (!Op.hasOneUse()) return 0;
605 // Don't recurse exponentially.
606 if (Depth > 6) return 0;
608 switch (Op.getOpcode()) {
609 default: return false;
610 case ISD::ConstantFP:
611 // Don't invert constant FP values after legalize. The negated constant
612 // isn't necessarily legal.
613 return LegalOperations ? 0 : 1;
615 // FIXME: determine better conditions for this xform.
616 if (!Options->UnsafeFPMath) return 0;
618 // After operation legalization, it might not be legal to create new FSUBs.
619 if (LegalOperations &&
620 !TLI.isOperationLegalOrCustom(ISD::FSUB, Op.getValueType()))
623 // fold (fneg (fadd A, B)) -> (fsub (fneg A), B)
624 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, TLI,
627 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A)
628 return isNegatibleForFree(Op.getOperand(1), LegalOperations, TLI, Options,
631 // We can't turn -(A-B) into B-A when we honor signed zeros.
632 if (!Options->UnsafeFPMath && !Op.getNode()->getFlags()->hasNoSignedZeros())
635 // fold (fneg (fsub A, B)) -> (fsub B, A)
640 if (Options->HonorSignDependentRoundingFPMath()) return 0;
642 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y) or (fmul X, (fneg Y))
643 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, TLI,
647 return isNegatibleForFree(Op.getOperand(1), LegalOperations, TLI, Options,
653 return isNegatibleForFree(Op.getOperand(0), LegalOperations, TLI, Options,
658 /// If isNegatibleForFree returns true, return the newly negated expression.
659 static SDValue GetNegatedExpression(SDValue Op, SelectionDAG &DAG,
660 bool LegalOperations, unsigned Depth = 0) {
661 const TargetOptions &Options = DAG.getTarget().Options;
662 // fneg is removable even if it has multiple uses.
663 if (Op.getOpcode() == ISD::FNEG) return Op.getOperand(0);
665 // Don't allow anything with multiple uses.
666 assert(Op.hasOneUse() && "Unknown reuse!");
668 assert(Depth <= 6 && "GetNegatedExpression doesn't match isNegatibleForFree");
670 const SDNodeFlags *Flags = Op.getNode()->getFlags();
672 switch (Op.getOpcode()) {
673 default: llvm_unreachable("Unknown code");
674 case ISD::ConstantFP: {
675 APFloat V = cast<ConstantFPSDNode>(Op)->getValueAPF();
677 return DAG.getConstantFP(V, SDLoc(Op), Op.getValueType());
680 // FIXME: determine better conditions for this xform.
681 assert(Options.UnsafeFPMath);
683 // fold (fneg (fadd A, B)) -> (fsub (fneg A), B)
684 if (isNegatibleForFree(Op.getOperand(0), LegalOperations,
685 DAG.getTargetLoweringInfo(), &Options, Depth+1))
686 return DAG.getNode(ISD::FSUB, SDLoc(Op), Op.getValueType(),
687 GetNegatedExpression(Op.getOperand(0), DAG,
688 LegalOperations, Depth+1),
689 Op.getOperand(1), Flags);
690 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A)
691 return DAG.getNode(ISD::FSUB, SDLoc(Op), Op.getValueType(),
692 GetNegatedExpression(Op.getOperand(1), DAG,
693 LegalOperations, Depth+1),
694 Op.getOperand(0), Flags);
696 // fold (fneg (fsub 0, B)) -> B
697 if (ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(Op.getOperand(0)))
699 return Op.getOperand(1);
701 // fold (fneg (fsub A, B)) -> (fsub B, A)
702 return DAG.getNode(ISD::FSUB, SDLoc(Op), Op.getValueType(),
703 Op.getOperand(1), Op.getOperand(0), Flags);
707 assert(!Options.HonorSignDependentRoundingFPMath());
709 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y)
710 if (isNegatibleForFree(Op.getOperand(0), LegalOperations,
711 DAG.getTargetLoweringInfo(), &Options, Depth+1))
712 return DAG.getNode(Op.getOpcode(), SDLoc(Op), Op.getValueType(),
713 GetNegatedExpression(Op.getOperand(0), DAG,
714 LegalOperations, Depth+1),
715 Op.getOperand(1), Flags);
717 // fold (fneg (fmul X, Y)) -> (fmul X, (fneg Y))
718 return DAG.getNode(Op.getOpcode(), SDLoc(Op), Op.getValueType(),
720 GetNegatedExpression(Op.getOperand(1), DAG,
721 LegalOperations, Depth+1), Flags);
725 return DAG.getNode(Op.getOpcode(), SDLoc(Op), Op.getValueType(),
726 GetNegatedExpression(Op.getOperand(0), DAG,
727 LegalOperations, Depth+1));
729 return DAG.getNode(ISD::FP_ROUND, SDLoc(Op), Op.getValueType(),
730 GetNegatedExpression(Op.getOperand(0), DAG,
731 LegalOperations, Depth+1),
736 // APInts must be the same size for most operations, this helper
737 // function zero extends the shorter of the pair so that they match.
738 // We provide an Offset so that we can create bitwidths that won't overflow.
739 static void zeroExtendToMatch(APInt &LHS, APInt &RHS, unsigned Offset = 0) {
740 unsigned Bits = Offset + std::max(LHS.getBitWidth(), RHS.getBitWidth());
741 LHS = LHS.zextOrSelf(Bits);
742 RHS = RHS.zextOrSelf(Bits);
745 // Return true if this node is a setcc, or is a select_cc
746 // that selects between the target values used for true and false, making it
747 // equivalent to a setcc. Also, set the incoming LHS, RHS, and CC references to
748 // the appropriate nodes based on the type of node we are checking. This
749 // simplifies life a bit for the callers.
750 bool DAGCombiner::isSetCCEquivalent(SDValue N, SDValue &LHS, SDValue &RHS,
752 if (N.getOpcode() == ISD::SETCC) {
753 LHS = N.getOperand(0);
754 RHS = N.getOperand(1);
755 CC = N.getOperand(2);
759 if (N.getOpcode() != ISD::SELECT_CC ||
760 !TLI.isConstTrueVal(N.getOperand(2).getNode()) ||
761 !TLI.isConstFalseVal(N.getOperand(3).getNode()))
764 if (TLI.getBooleanContents(N.getValueType()) ==
765 TargetLowering::UndefinedBooleanContent)
768 LHS = N.getOperand(0);
769 RHS = N.getOperand(1);
770 CC = N.getOperand(4);
774 /// Return true if this is a SetCC-equivalent operation with only one use.
775 /// If this is true, it allows the users to invert the operation for free when
776 /// it is profitable to do so.
777 bool DAGCombiner::isOneUseSetCC(SDValue N) const {
779 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
784 // \brief Returns the SDNode if it is a constant float BuildVector
785 // or constant float.
786 static SDNode *isConstantFPBuildVectorOrConstantFP(SDValue N) {
787 if (isa<ConstantFPSDNode>(N))
789 if (ISD::isBuildVectorOfConstantFPSDNodes(N.getNode()))
794 // Determines if it is a constant integer or a build vector of constant
795 // integers (and undefs).
796 // Do not permit build vector implicit truncation.
797 static bool isConstantOrConstantVector(SDValue N, bool NoOpaques = false) {
798 if (ConstantSDNode *Const = dyn_cast<ConstantSDNode>(N))
799 return !(Const->isOpaque() && NoOpaques);
800 if (N.getOpcode() != ISD::BUILD_VECTOR)
802 unsigned BitWidth = N.getScalarValueSizeInBits();
803 for (const SDValue &Op : N->op_values()) {
806 ConstantSDNode *Const = dyn_cast<ConstantSDNode>(Op);
807 if (!Const || Const->getAPIntValue().getBitWidth() != BitWidth ||
808 (Const->isOpaque() && NoOpaques))
814 // Determines if it is a constant null integer or a splatted vector of a
815 // constant null integer (with no undefs).
816 // Build vector implicit truncation is not an issue for null values.
817 static bool isNullConstantOrNullSplatConstant(SDValue N) {
818 if (ConstantSDNode *Splat = isConstOrConstSplat(N))
819 return Splat->isNullValue();
823 // Determines if it is a constant integer of one or a splatted vector of a
824 // constant integer of one (with no undefs).
825 // Do not permit build vector implicit truncation.
826 static bool isOneConstantOrOneSplatConstant(SDValue N) {
827 unsigned BitWidth = N.getScalarValueSizeInBits();
828 if (ConstantSDNode *Splat = isConstOrConstSplat(N))
829 return Splat->isOne() && Splat->getAPIntValue().getBitWidth() == BitWidth;
833 // Determines if it is a constant integer of all ones or a splatted vector of a
834 // constant integer of all ones (with no undefs).
835 // Do not permit build vector implicit truncation.
836 static bool isAllOnesConstantOrAllOnesSplatConstant(SDValue N) {
837 unsigned BitWidth = N.getScalarValueSizeInBits();
838 if (ConstantSDNode *Splat = isConstOrConstSplat(N))
839 return Splat->isAllOnesValue() &&
840 Splat->getAPIntValue().getBitWidth() == BitWidth;
844 // Determines if a BUILD_VECTOR is composed of all-constants possibly mixed with
846 static bool isAnyConstantBuildVector(const SDNode *N) {
847 return ISD::isBuildVectorOfConstantSDNodes(N) ||
848 ISD::isBuildVectorOfConstantFPSDNodes(N);
851 SDValue DAGCombiner::ReassociateOps(unsigned Opc, const SDLoc &DL, SDValue N0,
853 EVT VT = N0.getValueType();
854 if (N0.getOpcode() == Opc) {
855 if (SDNode *L = DAG.isConstantIntBuildVectorOrConstantInt(N0.getOperand(1))) {
856 if (SDNode *R = DAG.isConstantIntBuildVectorOrConstantInt(N1)) {
857 // reassoc. (op (op x, c1), c2) -> (op x, (op c1, c2))
858 if (SDValue OpNode = DAG.FoldConstantArithmetic(Opc, DL, VT, L, R))
859 return DAG.getNode(Opc, DL, VT, N0.getOperand(0), OpNode);
862 if (N0.hasOneUse()) {
863 // reassoc. (op (op x, c1), y) -> (op (op x, y), c1) iff x+c1 has one
865 SDValue OpNode = DAG.getNode(Opc, SDLoc(N0), VT, N0.getOperand(0), N1);
866 if (!OpNode.getNode())
868 AddToWorklist(OpNode.getNode());
869 return DAG.getNode(Opc, DL, VT, OpNode, N0.getOperand(1));
874 if (N1.getOpcode() == Opc) {
875 if (SDNode *R = DAG.isConstantIntBuildVectorOrConstantInt(N1.getOperand(1))) {
876 if (SDNode *L = DAG.isConstantIntBuildVectorOrConstantInt(N0)) {
877 // reassoc. (op c2, (op x, c1)) -> (op x, (op c1, c2))
878 if (SDValue OpNode = DAG.FoldConstantArithmetic(Opc, DL, VT, R, L))
879 return DAG.getNode(Opc, DL, VT, N1.getOperand(0), OpNode);
882 if (N1.hasOneUse()) {
883 // reassoc. (op x, (op y, c1)) -> (op (op x, y), c1) iff x+c1 has one
885 SDValue OpNode = DAG.getNode(Opc, SDLoc(N0), VT, N0, N1.getOperand(0));
886 if (!OpNode.getNode())
888 AddToWorklist(OpNode.getNode());
889 return DAG.getNode(Opc, DL, VT, OpNode, N1.getOperand(1));
897 SDValue DAGCombiner::CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
899 assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
901 DEBUG(dbgs() << "\nReplacing.1 ";
903 dbgs() << "\nWith: ";
904 To[0].getNode()->dump(&DAG);
905 dbgs() << " and " << NumTo-1 << " other values\n");
906 for (unsigned i = 0, e = NumTo; i != e; ++i)
907 assert((!To[i].getNode() ||
908 N->getValueType(i) == To[i].getValueType()) &&
909 "Cannot combine value to value of different type!");
911 WorklistRemover DeadNodes(*this);
912 DAG.ReplaceAllUsesWith(N, To);
914 // Push the new nodes and any users onto the worklist
915 for (unsigned i = 0, e = NumTo; i != e; ++i) {
916 if (To[i].getNode()) {
917 AddToWorklist(To[i].getNode());
918 AddUsersToWorklist(To[i].getNode());
923 // Finally, if the node is now dead, remove it from the graph. The node
924 // may not be dead if the replacement process recursively simplified to
925 // something else needing this node.
927 deleteAndRecombine(N);
928 return SDValue(N, 0);
932 CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) {
933 // Replace all uses. If any nodes become isomorphic to other nodes and
934 // are deleted, make sure to remove them from our worklist.
935 WorklistRemover DeadNodes(*this);
936 DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New);
938 // Push the new node and any (possibly new) users onto the worklist.
939 AddToWorklist(TLO.New.getNode());
940 AddUsersToWorklist(TLO.New.getNode());
942 // Finally, if the node is now dead, remove it from the graph. The node
943 // may not be dead if the replacement process recursively simplified to
944 // something else needing this node.
945 if (TLO.Old.getNode()->use_empty())
946 deleteAndRecombine(TLO.Old.getNode());
949 /// Check the specified integer node value to see if it can be simplified or if
950 /// things it uses can be simplified by bit propagation. If so, return true.
951 bool DAGCombiner::SimplifyDemandedBits(SDValue Op, const APInt &Demanded) {
952 TargetLowering::TargetLoweringOpt TLO(DAG, LegalTypes, LegalOperations);
953 APInt KnownZero, KnownOne;
954 if (!TLI.SimplifyDemandedBits(Op, Demanded, KnownZero, KnownOne, TLO))
958 AddToWorklist(Op.getNode());
960 // Replace the old value with the new one.
962 DEBUG(dbgs() << "\nReplacing.2 ";
963 TLO.Old.getNode()->dump(&DAG);
964 dbgs() << "\nWith: ";
965 TLO.New.getNode()->dump(&DAG);
968 CommitTargetLoweringOpt(TLO);
972 void DAGCombiner::ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad) {
974 EVT VT = Load->getValueType(0);
975 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, DL, VT, SDValue(ExtLoad, 0));
977 DEBUG(dbgs() << "\nReplacing.9 ";
979 dbgs() << "\nWith: ";
980 Trunc.getNode()->dump(&DAG);
982 WorklistRemover DeadNodes(*this);
983 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 0), Trunc);
984 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 1), SDValue(ExtLoad, 1));
985 deleteAndRecombine(Load);
986 AddToWorklist(Trunc.getNode());
989 SDValue DAGCombiner::PromoteOperand(SDValue Op, EVT PVT, bool &Replace) {
992 if (ISD::isUNINDEXEDLoad(Op.getNode())) {
993 LoadSDNode *LD = cast<LoadSDNode>(Op);
994 EVT MemVT = LD->getMemoryVT();
995 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD)
996 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, PVT, MemVT) ? ISD::ZEXTLOAD
998 : LD->getExtensionType();
1000 return DAG.getExtLoad(ExtType, DL, PVT,
1001 LD->getChain(), LD->getBasePtr(),
1002 MemVT, LD->getMemOperand());
1005 unsigned Opc = Op.getOpcode();
1008 case ISD::AssertSext:
1009 return DAG.getNode(ISD::AssertSext, DL, PVT,
1010 SExtPromoteOperand(Op.getOperand(0), PVT),
1012 case ISD::AssertZext:
1013 return DAG.getNode(ISD::AssertZext, DL, PVT,
1014 ZExtPromoteOperand(Op.getOperand(0), PVT),
1016 case ISD::Constant: {
1018 Op.getValueType().isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
1019 return DAG.getNode(ExtOpc, DL, PVT, Op);
1023 if (!TLI.isOperationLegal(ISD::ANY_EXTEND, PVT))
1025 return DAG.getNode(ISD::ANY_EXTEND, DL, PVT, Op);
1028 SDValue DAGCombiner::SExtPromoteOperand(SDValue Op, EVT PVT) {
1029 if (!TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, PVT))
1031 EVT OldVT = Op.getValueType();
1033 bool Replace = false;
1034 SDValue NewOp = PromoteOperand(Op, PVT, Replace);
1035 if (!NewOp.getNode())
1037 AddToWorklist(NewOp.getNode());
1040 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode());
1041 return DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, NewOp.getValueType(), NewOp,
1042 DAG.getValueType(OldVT));
1045 SDValue DAGCombiner::ZExtPromoteOperand(SDValue Op, EVT PVT) {
1046 EVT OldVT = Op.getValueType();
1048 bool Replace = false;
1049 SDValue NewOp = PromoteOperand(Op, PVT, Replace);
1050 if (!NewOp.getNode())
1052 AddToWorklist(NewOp.getNode());
1055 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode());
1056 return DAG.getZeroExtendInReg(NewOp, DL, OldVT);
1059 /// Promote the specified integer binary operation if the target indicates it is
1060 /// beneficial. e.g. On x86, it's usually better to promote i16 operations to
1061 /// i32 since i16 instructions are longer.
1062 SDValue DAGCombiner::PromoteIntBinOp(SDValue Op) {
1063 if (!LegalOperations)
1066 EVT VT = Op.getValueType();
1067 if (VT.isVector() || !VT.isInteger())
1070 // If operation type is 'undesirable', e.g. i16 on x86, consider
1072 unsigned Opc = Op.getOpcode();
1073 if (TLI.isTypeDesirableForOp(Opc, VT))
1077 // Consult target whether it is a good idea to promote this operation and
1078 // what's the right type to promote it to.
1079 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
1080 assert(PVT != VT && "Don't know what type to promote to!");
1082 bool Replace0 = false;
1083 SDValue N0 = Op.getOperand(0);
1084 SDValue NN0 = PromoteOperand(N0, PVT, Replace0);
1088 bool Replace1 = false;
1089 SDValue N1 = Op.getOperand(1);
1094 NN1 = PromoteOperand(N1, PVT, Replace1);
1099 AddToWorklist(NN0.getNode());
1101 AddToWorklist(NN1.getNode());
1104 ReplaceLoadWithPromotedLoad(N0.getNode(), NN0.getNode());
1106 ReplaceLoadWithPromotedLoad(N1.getNode(), NN1.getNode());
1108 DEBUG(dbgs() << "\nPromoting ";
1109 Op.getNode()->dump(&DAG));
1111 return DAG.getNode(ISD::TRUNCATE, DL, VT,
1112 DAG.getNode(Opc, DL, PVT, NN0, NN1));
1117 /// Promote the specified integer shift operation if the target indicates it is
1118 /// beneficial. e.g. On x86, it's usually better to promote i16 operations to
1119 /// i32 since i16 instructions are longer.
1120 SDValue DAGCombiner::PromoteIntShiftOp(SDValue Op) {
1121 if (!LegalOperations)
1124 EVT VT = Op.getValueType();
1125 if (VT.isVector() || !VT.isInteger())
1128 // If operation type is 'undesirable', e.g. i16 on x86, consider
1130 unsigned Opc = Op.getOpcode();
1131 if (TLI.isTypeDesirableForOp(Opc, VT))
1135 // Consult target whether it is a good idea to promote this operation and
1136 // what's the right type to promote it to.
1137 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
1138 assert(PVT != VT && "Don't know what type to promote to!");
1140 bool Replace = false;
1141 SDValue N0 = Op.getOperand(0);
1142 if (Opc == ISD::SRA)
1143 N0 = SExtPromoteOperand(Op.getOperand(0), PVT);
1144 else if (Opc == ISD::SRL)
1145 N0 = ZExtPromoteOperand(Op.getOperand(0), PVT);
1147 N0 = PromoteOperand(N0, PVT, Replace);
1151 AddToWorklist(N0.getNode());
1153 ReplaceLoadWithPromotedLoad(Op.getOperand(0).getNode(), N0.getNode());
1155 DEBUG(dbgs() << "\nPromoting ";
1156 Op.getNode()->dump(&DAG));
1158 return DAG.getNode(ISD::TRUNCATE, DL, VT,
1159 DAG.getNode(Opc, DL, PVT, N0, Op.getOperand(1)));
1164 SDValue DAGCombiner::PromoteExtend(SDValue Op) {
1165 if (!LegalOperations)
1168 EVT VT = Op.getValueType();
1169 if (VT.isVector() || !VT.isInteger())
1172 // If operation type is 'undesirable', e.g. i16 on x86, consider
1174 unsigned Opc = Op.getOpcode();
1175 if (TLI.isTypeDesirableForOp(Opc, VT))
1179 // Consult target whether it is a good idea to promote this operation and
1180 // what's the right type to promote it to.
1181 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
1182 assert(PVT != VT && "Don't know what type to promote to!");
1183 // fold (aext (aext x)) -> (aext x)
1184 // fold (aext (zext x)) -> (zext x)
1185 // fold (aext (sext x)) -> (sext x)
1186 DEBUG(dbgs() << "\nPromoting ";
1187 Op.getNode()->dump(&DAG));
1188 return DAG.getNode(Op.getOpcode(), SDLoc(Op), VT, Op.getOperand(0));
1193 bool DAGCombiner::PromoteLoad(SDValue Op) {
1194 if (!LegalOperations)
1197 if (!ISD::isUNINDEXEDLoad(Op.getNode()))
1200 EVT VT = Op.getValueType();
1201 if (VT.isVector() || !VT.isInteger())
1204 // If operation type is 'undesirable', e.g. i16 on x86, consider
1206 unsigned Opc = Op.getOpcode();
1207 if (TLI.isTypeDesirableForOp(Opc, VT))
1211 // Consult target whether it is a good idea to promote this operation and
1212 // what's the right type to promote it to.
1213 if (TLI.IsDesirableToPromoteOp(Op, PVT)) {
1214 assert(PVT != VT && "Don't know what type to promote to!");
1217 SDNode *N = Op.getNode();
1218 LoadSDNode *LD = cast<LoadSDNode>(N);
1219 EVT MemVT = LD->getMemoryVT();
1220 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD)
1221 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, PVT, MemVT) ? ISD::ZEXTLOAD
1223 : LD->getExtensionType();
1224 SDValue NewLD = DAG.getExtLoad(ExtType, DL, PVT,
1225 LD->getChain(), LD->getBasePtr(),
1226 MemVT, LD->getMemOperand());
1227 SDValue Result = DAG.getNode(ISD::TRUNCATE, DL, VT, NewLD);
1229 DEBUG(dbgs() << "\nPromoting ";
1232 Result.getNode()->dump(&DAG);
1234 WorklistRemover DeadNodes(*this);
1235 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result);
1236 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), NewLD.getValue(1));
1237 deleteAndRecombine(N);
1238 AddToWorklist(Result.getNode());
1244 /// \brief Recursively delete a node which has no uses and any operands for
1245 /// which it is the only use.
1247 /// Note that this both deletes the nodes and removes them from the worklist.
1248 /// It also adds any nodes who have had a user deleted to the worklist as they
1249 /// may now have only one use and subject to other combines.
1250 bool DAGCombiner::recursivelyDeleteUnusedNodes(SDNode *N) {
1251 if (!N->use_empty())
1254 SmallSetVector<SDNode *, 16> Nodes;
1257 N = Nodes.pop_back_val();
1261 if (N->use_empty()) {
1262 for (const SDValue &ChildN : N->op_values())
1263 Nodes.insert(ChildN.getNode());
1265 removeFromWorklist(N);
1270 } while (!Nodes.empty());
1274 //===----------------------------------------------------------------------===//
1275 // Main DAG Combiner implementation
1276 //===----------------------------------------------------------------------===//
1278 void DAGCombiner::Run(CombineLevel AtLevel) {
1279 // set the instance variables, so that the various visit routines may use it.
1281 LegalOperations = Level >= AfterLegalizeVectorOps;
1282 LegalTypes = Level >= AfterLegalizeTypes;
1284 // Add all the dag nodes to the worklist.
1285 for (SDNode &Node : DAG.allnodes())
1286 AddToWorklist(&Node);
1288 // Create a dummy node (which is not added to allnodes), that adds a reference
1289 // to the root node, preventing it from being deleted, and tracking any
1290 // changes of the root.
1291 HandleSDNode Dummy(DAG.getRoot());
1293 // While the worklist isn't empty, find a node and try to combine it.
1294 while (!WorklistMap.empty()) {
1296 // The Worklist holds the SDNodes in order, but it may contain null entries.
1298 N = Worklist.pop_back_val();
1301 bool GoodWorklistEntry = WorklistMap.erase(N);
1302 (void)GoodWorklistEntry;
1303 assert(GoodWorklistEntry &&
1304 "Found a worklist entry without a corresponding map entry!");
1306 // If N has no uses, it is dead. Make sure to revisit all N's operands once
1307 // N is deleted from the DAG, since they too may now be dead or may have a
1308 // reduced number of uses, allowing other xforms.
1309 if (recursivelyDeleteUnusedNodes(N))
1312 WorklistRemover DeadNodes(*this);
1314 // If this combine is running after legalizing the DAG, re-legalize any
1315 // nodes pulled off the worklist.
1316 if (Level == AfterLegalizeDAG) {
1317 SmallSetVector<SDNode *, 16> UpdatedNodes;
1318 bool NIsValid = DAG.LegalizeOp(N, UpdatedNodes);
1320 for (SDNode *LN : UpdatedNodes) {
1322 AddUsersToWorklist(LN);
1328 DEBUG(dbgs() << "\nCombining: "; N->dump(&DAG));
1330 // Add any operands of the new node which have not yet been combined to the
1331 // worklist as well. Because the worklist uniques things already, this
1332 // won't repeatedly process the same operand.
1333 CombinedNodes.insert(N);
1334 for (const SDValue &ChildN : N->op_values())
1335 if (!CombinedNodes.count(ChildN.getNode()))
1336 AddToWorklist(ChildN.getNode());
1338 SDValue RV = combine(N);
1345 // If we get back the same node we passed in, rather than a new node or
1346 // zero, we know that the node must have defined multiple values and
1347 // CombineTo was used. Since CombineTo takes care of the worklist
1348 // mechanics for us, we have no work to do in this case.
1349 if (RV.getNode() == N)
1352 assert(N->getOpcode() != ISD::DELETED_NODE &&
1353 RV.getOpcode() != ISD::DELETED_NODE &&
1354 "Node was deleted but visit returned new node!");
1356 DEBUG(dbgs() << " ... into: ";
1357 RV.getNode()->dump(&DAG));
1359 if (N->getNumValues() == RV.getNode()->getNumValues())
1360 DAG.ReplaceAllUsesWith(N, RV.getNode());
1362 assert(N->getValueType(0) == RV.getValueType() &&
1363 N->getNumValues() == 1 && "Type mismatch");
1365 DAG.ReplaceAllUsesWith(N, &OpV);
1368 // Push the new node and any users onto the worklist
1369 AddToWorklist(RV.getNode());
1370 AddUsersToWorklist(RV.getNode());
1372 // Finally, if the node is now dead, remove it from the graph. The node
1373 // may not be dead if the replacement process recursively simplified to
1374 // something else needing this node. This will also take care of adding any
1375 // operands which have lost a user to the worklist.
1376 recursivelyDeleteUnusedNodes(N);
1379 // If the root changed (e.g. it was a dead load, update the root).
1380 DAG.setRoot(Dummy.getValue());
1381 DAG.RemoveDeadNodes();
1384 SDValue DAGCombiner::visit(SDNode *N) {
1385 switch (N->getOpcode()) {
1387 case ISD::TokenFactor: return visitTokenFactor(N);
1388 case ISD::MERGE_VALUES: return visitMERGE_VALUES(N);
1389 case ISD::ADD: return visitADD(N);
1390 case ISD::SUB: return visitSUB(N);
1391 case ISD::ADDC: return visitADDC(N);
1392 case ISD::SUBC: return visitSUBC(N);
1393 case ISD::ADDE: return visitADDE(N);
1394 case ISD::SUBE: return visitSUBE(N);
1395 case ISD::MUL: return visitMUL(N);
1396 case ISD::SDIV: return visitSDIV(N);
1397 case ISD::UDIV: return visitUDIV(N);
1399 case ISD::UREM: return visitREM(N);
1400 case ISD::MULHU: return visitMULHU(N);
1401 case ISD::MULHS: return visitMULHS(N);
1402 case ISD::SMUL_LOHI: return visitSMUL_LOHI(N);
1403 case ISD::UMUL_LOHI: return visitUMUL_LOHI(N);
1404 case ISD::SMULO: return visitSMULO(N);
1405 case ISD::UMULO: return visitUMULO(N);
1409 case ISD::UMAX: return visitIMINMAX(N);
1410 case ISD::AND: return visitAND(N);
1411 case ISD::OR: return visitOR(N);
1412 case ISD::XOR: return visitXOR(N);
1413 case ISD::SHL: return visitSHL(N);
1414 case ISD::SRA: return visitSRA(N);
1415 case ISD::SRL: return visitSRL(N);
1417 case ISD::ROTL: return visitRotate(N);
1418 case ISD::BSWAP: return visitBSWAP(N);
1419 case ISD::BITREVERSE: return visitBITREVERSE(N);
1420 case ISD::CTLZ: return visitCTLZ(N);
1421 case ISD::CTLZ_ZERO_UNDEF: return visitCTLZ_ZERO_UNDEF(N);
1422 case ISD::CTTZ: return visitCTTZ(N);
1423 case ISD::CTTZ_ZERO_UNDEF: return visitCTTZ_ZERO_UNDEF(N);
1424 case ISD::CTPOP: return visitCTPOP(N);
1425 case ISD::SELECT: return visitSELECT(N);
1426 case ISD::VSELECT: return visitVSELECT(N);
1427 case ISD::SELECT_CC: return visitSELECT_CC(N);
1428 case ISD::SETCC: return visitSETCC(N);
1429 case ISD::SETCCE: return visitSETCCE(N);
1430 case ISD::SIGN_EXTEND: return visitSIGN_EXTEND(N);
1431 case ISD::ZERO_EXTEND: return visitZERO_EXTEND(N);
1432 case ISD::ANY_EXTEND: return visitANY_EXTEND(N);
1433 case ISD::SIGN_EXTEND_INREG: return visitSIGN_EXTEND_INREG(N);
1434 case ISD::SIGN_EXTEND_VECTOR_INREG: return visitSIGN_EXTEND_VECTOR_INREG(N);
1435 case ISD::ZERO_EXTEND_VECTOR_INREG: return visitZERO_EXTEND_VECTOR_INREG(N);
1436 case ISD::TRUNCATE: return visitTRUNCATE(N);
1437 case ISD::BITCAST: return visitBITCAST(N);
1438 case ISD::BUILD_PAIR: return visitBUILD_PAIR(N);
1439 case ISD::FADD: return visitFADD(N);
1440 case ISD::FSUB: return visitFSUB(N);
1441 case ISD::FMUL: return visitFMUL(N);
1442 case ISD::FMA: return visitFMA(N);
1443 case ISD::FDIV: return visitFDIV(N);
1444 case ISD::FREM: return visitFREM(N);
1445 case ISD::FSQRT: return visitFSQRT(N);
1446 case ISD::FCOPYSIGN: return visitFCOPYSIGN(N);
1447 case ISD::SINT_TO_FP: return visitSINT_TO_FP(N);
1448 case ISD::UINT_TO_FP: return visitUINT_TO_FP(N);
1449 case ISD::FP_TO_SINT: return visitFP_TO_SINT(N);
1450 case ISD::FP_TO_UINT: return visitFP_TO_UINT(N);
1451 case ISD::FP_ROUND: return visitFP_ROUND(N);
1452 case ISD::FP_ROUND_INREG: return visitFP_ROUND_INREG(N);
1453 case ISD::FP_EXTEND: return visitFP_EXTEND(N);
1454 case ISD::FNEG: return visitFNEG(N);
1455 case ISD::FABS: return visitFABS(N);
1456 case ISD::FFLOOR: return visitFFLOOR(N);
1457 case ISD::FMINNUM: return visitFMINNUM(N);
1458 case ISD::FMAXNUM: return visitFMAXNUM(N);
1459 case ISD::FCEIL: return visitFCEIL(N);
1460 case ISD::FTRUNC: return visitFTRUNC(N);
1461 case ISD::BRCOND: return visitBRCOND(N);
1462 case ISD::BR_CC: return visitBR_CC(N);
1463 case ISD::LOAD: return visitLOAD(N);
1464 case ISD::STORE: return visitSTORE(N);
1465 case ISD::INSERT_VECTOR_ELT: return visitINSERT_VECTOR_ELT(N);
1466 case ISD::EXTRACT_VECTOR_ELT: return visitEXTRACT_VECTOR_ELT(N);
1467 case ISD::BUILD_VECTOR: return visitBUILD_VECTOR(N);
1468 case ISD::CONCAT_VECTORS: return visitCONCAT_VECTORS(N);
1469 case ISD::EXTRACT_SUBVECTOR: return visitEXTRACT_SUBVECTOR(N);
1470 case ISD::VECTOR_SHUFFLE: return visitVECTOR_SHUFFLE(N);
1471 case ISD::SCALAR_TO_VECTOR: return visitSCALAR_TO_VECTOR(N);
1472 case ISD::INSERT_SUBVECTOR: return visitINSERT_SUBVECTOR(N);
1473 case ISD::MGATHER: return visitMGATHER(N);
1474 case ISD::MLOAD: return visitMLOAD(N);
1475 case ISD::MSCATTER: return visitMSCATTER(N);
1476 case ISD::MSTORE: return visitMSTORE(N);
1477 case ISD::FP_TO_FP16: return visitFP_TO_FP16(N);
1478 case ISD::FP16_TO_FP: return visitFP16_TO_FP(N);
1483 SDValue DAGCombiner::combine(SDNode *N) {
1484 SDValue RV = visit(N);
1486 // If nothing happened, try a target-specific DAG combine.
1487 if (!RV.getNode()) {
1488 assert(N->getOpcode() != ISD::DELETED_NODE &&
1489 "Node was deleted but visit returned NULL!");
1491 if (N->getOpcode() >= ISD::BUILTIN_OP_END ||
1492 TLI.hasTargetDAGCombine((ISD::NodeType)N->getOpcode())) {
1494 // Expose the DAG combiner to the target combiner impls.
1495 TargetLowering::DAGCombinerInfo
1496 DagCombineInfo(DAG, Level, false, this);
1498 RV = TLI.PerformDAGCombine(N, DagCombineInfo);
1502 // If nothing happened still, try promoting the operation.
1503 if (!RV.getNode()) {
1504 switch (N->getOpcode()) {
1512 RV = PromoteIntBinOp(SDValue(N, 0));
1517 RV = PromoteIntShiftOp(SDValue(N, 0));
1519 case ISD::SIGN_EXTEND:
1520 case ISD::ZERO_EXTEND:
1521 case ISD::ANY_EXTEND:
1522 RV = PromoteExtend(SDValue(N, 0));
1525 if (PromoteLoad(SDValue(N, 0)))
1531 // If N is a commutative binary node, try commuting it to enable more
1533 if (!RV.getNode() && SelectionDAG::isCommutativeBinOp(N->getOpcode()) &&
1534 N->getNumValues() == 1) {
1535 SDValue N0 = N->getOperand(0);
1536 SDValue N1 = N->getOperand(1);
1538 // Constant operands are canonicalized to RHS.
1539 if (isa<ConstantSDNode>(N0) || !isa<ConstantSDNode>(N1)) {
1540 SDValue Ops[] = {N1, N0};
1541 SDNode *CSENode = DAG.getNodeIfExists(N->getOpcode(), N->getVTList(), Ops,
1544 return SDValue(CSENode, 0);
1551 /// Given a node, return its input chain if it has one, otherwise return a null
1553 static SDValue getInputChainForNode(SDNode *N) {
1554 if (unsigned NumOps = N->getNumOperands()) {
1555 if (N->getOperand(0).getValueType() == MVT::Other)
1556 return N->getOperand(0);
1557 if (N->getOperand(NumOps-1).getValueType() == MVT::Other)
1558 return N->getOperand(NumOps-1);
1559 for (unsigned i = 1; i < NumOps-1; ++i)
1560 if (N->getOperand(i).getValueType() == MVT::Other)
1561 return N->getOperand(i);
1566 SDValue DAGCombiner::visitTokenFactor(SDNode *N) {
1567 // If N has two operands, where one has an input chain equal to the other,
1568 // the 'other' chain is redundant.
1569 if (N->getNumOperands() == 2) {
1570 if (getInputChainForNode(N->getOperand(0).getNode()) == N->getOperand(1))
1571 return N->getOperand(0);
1572 if (getInputChainForNode(N->getOperand(1).getNode()) == N->getOperand(0))
1573 return N->getOperand(1);
1576 SmallVector<SDNode *, 8> TFs; // List of token factors to visit.
1577 SmallVector<SDValue, 8> Ops; // Ops for replacing token factor.
1578 SmallPtrSet<SDNode*, 16> SeenOps;
1579 bool Changed = false; // If we should replace this token factor.
1581 // Start out with this token factor.
1584 // Iterate through token factors. The TFs grows when new token factors are
1586 for (unsigned i = 0; i < TFs.size(); ++i) {
1587 SDNode *TF = TFs[i];
1589 // Check each of the operands.
1590 for (const SDValue &Op : TF->op_values()) {
1592 switch (Op.getOpcode()) {
1593 case ISD::EntryToken:
1594 // Entry tokens don't need to be added to the list. They are
1599 case ISD::TokenFactor:
1600 if (Op.hasOneUse() && !is_contained(TFs, Op.getNode())) {
1601 // Queue up for processing.
1602 TFs.push_back(Op.getNode());
1603 // Clean up in case the token factor is removed.
1604 AddToWorklist(Op.getNode());
1611 // Only add if it isn't already in the list.
1612 if (SeenOps.insert(Op.getNode()).second)
1623 // If we've changed things around then replace token factor.
1626 // The entry token is the only possible outcome.
1627 Result = DAG.getEntryNode();
1629 // New and improved token factor.
1630 Result = DAG.getNode(ISD::TokenFactor, SDLoc(N), MVT::Other, Ops);
1633 // Add users to worklist if AA is enabled, since it may introduce
1634 // a lot of new chained token factors while removing memory deps.
1635 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
1636 : DAG.getSubtarget().useAA();
1637 return CombineTo(N, Result, UseAA /*add to worklist*/);
1643 /// MERGE_VALUES can always be eliminated.
1644 SDValue DAGCombiner::visitMERGE_VALUES(SDNode *N) {
1645 WorklistRemover DeadNodes(*this);
1646 // Replacing results may cause a different MERGE_VALUES to suddenly
1647 // be CSE'd with N, and carry its uses with it. Iterate until no
1648 // uses remain, to ensure that the node can be safely deleted.
1649 // First add the users of this node to the work list so that they
1650 // can be tried again once they have new operands.
1651 AddUsersToWorklist(N);
1653 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
1654 DAG.ReplaceAllUsesOfValueWith(SDValue(N, i), N->getOperand(i));
1655 } while (!N->use_empty());
1656 deleteAndRecombine(N);
1657 return SDValue(N, 0); // Return N so it doesn't get rechecked!
1660 /// If \p N is a ConstantSDNode with isOpaque() == false return it casted to a
1661 /// ConstantSDNode pointer else nullptr.
1662 static ConstantSDNode *getAsNonOpaqueConstant(SDValue N) {
1663 ConstantSDNode *Const = dyn_cast<ConstantSDNode>(N);
1664 return Const != nullptr && !Const->isOpaque() ? Const : nullptr;
1667 SDValue DAGCombiner::visitADD(SDNode *N) {
1668 SDValue N0 = N->getOperand(0);
1669 SDValue N1 = N->getOperand(1);
1670 EVT VT = N0.getValueType();
1674 if (VT.isVector()) {
1675 if (SDValue FoldedVOp = SimplifyVBinOp(N))
1678 // fold (add x, 0) -> x, vector edition
1679 if (ISD::isBuildVectorAllZeros(N1.getNode()))
1681 if (ISD::isBuildVectorAllZeros(N0.getNode()))
1685 // fold (add x, undef) -> undef
1692 if (DAG.isConstantIntBuildVectorOrConstantInt(N0)) {
1693 // canonicalize constant to RHS
1694 if (!DAG.isConstantIntBuildVectorOrConstantInt(N1))
1695 return DAG.getNode(ISD::ADD, DL, VT, N1, N0);
1696 // fold (add c1, c2) -> c1+c2
1697 return DAG.FoldConstantArithmetic(ISD::ADD, DL, VT, N0.getNode(),
1701 // fold (add x, 0) -> x
1702 if (isNullConstant(N1))
1705 // fold ((c1-A)+c2) -> (c1+c2)-A
1706 if (isConstantOrConstantVector(N1, /* NoOpaque */ true)) {
1707 if (N0.getOpcode() == ISD::SUB)
1708 if (isConstantOrConstantVector(N0.getOperand(0), /* NoOpaque */ true)) {
1709 return DAG.getNode(ISD::SUB, DL, VT,
1710 DAG.getNode(ISD::ADD, DL, VT, N1, N0.getOperand(0)),
1716 if (SDValue RADD = ReassociateOps(ISD::ADD, DL, N0, N1))
1719 // fold ((0-A) + B) -> B-A
1720 if (N0.getOpcode() == ISD::SUB &&
1721 isNullConstantOrNullSplatConstant(N0.getOperand(0)))
1722 return DAG.getNode(ISD::SUB, DL, VT, N1, N0.getOperand(1));
1724 // fold (A + (0-B)) -> A-B
1725 if (N1.getOpcode() == ISD::SUB &&
1726 isNullConstantOrNullSplatConstant(N1.getOperand(0)))
1727 return DAG.getNode(ISD::SUB, DL, VT, N0, N1.getOperand(1));
1729 // fold (A+(B-A)) -> B
1730 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(1))
1731 return N1.getOperand(0);
1733 // fold ((B-A)+A) -> B
1734 if (N0.getOpcode() == ISD::SUB && N1 == N0.getOperand(1))
1735 return N0.getOperand(0);
1737 // fold (A+(B-(A+C))) to (B-C)
1738 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD &&
1739 N0 == N1.getOperand(1).getOperand(0))
1740 return DAG.getNode(ISD::SUB, DL, VT, N1.getOperand(0),
1741 N1.getOperand(1).getOperand(1));
1743 // fold (A+(B-(C+A))) to (B-C)
1744 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD &&
1745 N0 == N1.getOperand(1).getOperand(1))
1746 return DAG.getNode(ISD::SUB, DL, VT, N1.getOperand(0),
1747 N1.getOperand(1).getOperand(0));
1749 // fold (A+((B-A)+or-C)) to (B+or-C)
1750 if ((N1.getOpcode() == ISD::SUB || N1.getOpcode() == ISD::ADD) &&
1751 N1.getOperand(0).getOpcode() == ISD::SUB &&
1752 N0 == N1.getOperand(0).getOperand(1))
1753 return DAG.getNode(N1.getOpcode(), DL, VT, N1.getOperand(0).getOperand(0),
1756 // fold (A-B)+(C-D) to (A+C)-(B+D) when A or C is constant
1757 if (N0.getOpcode() == ISD::SUB && N1.getOpcode() == ISD::SUB) {
1758 SDValue N00 = N0.getOperand(0);
1759 SDValue N01 = N0.getOperand(1);
1760 SDValue N10 = N1.getOperand(0);
1761 SDValue N11 = N1.getOperand(1);
1763 if (isConstantOrConstantVector(N00) || isConstantOrConstantVector(N10))
1764 return DAG.getNode(ISD::SUB, DL, VT,
1765 DAG.getNode(ISD::ADD, SDLoc(N0), VT, N00, N10),
1766 DAG.getNode(ISD::ADD, SDLoc(N1), VT, N01, N11));
1769 if (SimplifyDemandedBits(SDValue(N, 0)))
1770 return SDValue(N, 0);
1772 // fold (a+b) -> (a|b) iff a and b share no bits.
1773 if ((!LegalOperations || TLI.isOperationLegal(ISD::OR, VT)) &&
1774 VT.isInteger() && DAG.haveNoCommonBitsSet(N0, N1))
1775 return DAG.getNode(ISD::OR, DL, VT, N0, N1);
1777 // fold (add x, shl(0 - y, n)) -> sub(x, shl(y, n))
1778 if (N1.getOpcode() == ISD::SHL && N1.getOperand(0).getOpcode() == ISD::SUB &&
1779 isNullConstantOrNullSplatConstant(N1.getOperand(0).getOperand(0)))
1780 return DAG.getNode(ISD::SUB, DL, VT, N0,
1781 DAG.getNode(ISD::SHL, DL, VT,
1782 N1.getOperand(0).getOperand(1),
1784 if (N0.getOpcode() == ISD::SHL && N0.getOperand(0).getOpcode() == ISD::SUB &&
1785 isNullConstantOrNullSplatConstant(N0.getOperand(0).getOperand(0)))
1786 return DAG.getNode(ISD::SUB, DL, VT, N1,
1787 DAG.getNode(ISD::SHL, DL, VT,
1788 N0.getOperand(0).getOperand(1),
1791 if (N1.getOpcode() == ISD::AND) {
1792 SDValue AndOp0 = N1.getOperand(0);
1793 unsigned NumSignBits = DAG.ComputeNumSignBits(AndOp0);
1794 unsigned DestBits = VT.getScalarSizeInBits();
1796 // (add z, (and (sbbl x, x), 1)) -> (sub z, (sbbl x, x))
1797 // and similar xforms where the inner op is either ~0 or 0.
1798 if (NumSignBits == DestBits &&
1799 isOneConstantOrOneSplatConstant(N1->getOperand(1)))
1800 return DAG.getNode(ISD::SUB, DL, VT, N->getOperand(0), AndOp0);
1803 // add (sext i1), X -> sub X, (zext i1)
1804 if (N0.getOpcode() == ISD::SIGN_EXTEND &&
1805 N0.getOperand(0).getValueType() == MVT::i1 &&
1806 !TLI.isOperationLegal(ISD::SIGN_EXTEND, MVT::i1)) {
1807 SDValue ZExt = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, N0.getOperand(0));
1808 return DAG.getNode(ISD::SUB, DL, VT, N1, ZExt);
1811 // add X, (sextinreg Y i1) -> sub X, (and Y 1)
1812 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) {
1813 VTSDNode *TN = cast<VTSDNode>(N1.getOperand(1));
1814 if (TN->getVT() == MVT::i1) {
1815 SDValue ZExt = DAG.getNode(ISD::AND, DL, VT, N1.getOperand(0),
1816 DAG.getConstant(1, DL, VT));
1817 return DAG.getNode(ISD::SUB, DL, VT, N0, ZExt);
1824 SDValue DAGCombiner::visitADDC(SDNode *N) {
1825 SDValue N0 = N->getOperand(0);
1826 SDValue N1 = N->getOperand(1);
1827 EVT VT = N0.getValueType();
1829 // If the flag result is dead, turn this into an ADD.
1830 if (!N->hasAnyUseOfValue(1))
1831 return CombineTo(N, DAG.getNode(ISD::ADD, SDLoc(N), VT, N0, N1),
1832 DAG.getNode(ISD::CARRY_FALSE,
1833 SDLoc(N), MVT::Glue));
1835 // canonicalize constant to RHS.
1836 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1837 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1839 return DAG.getNode(ISD::ADDC, SDLoc(N), N->getVTList(), N1, N0);
1841 // fold (addc x, 0) -> x + no carry out
1842 if (isNullConstant(N1))
1843 return CombineTo(N, N0, DAG.getNode(ISD::CARRY_FALSE,
1844 SDLoc(N), MVT::Glue));
1846 // fold (addc a, b) -> (or a, b), CARRY_FALSE iff a and b share no bits.
1847 APInt LHSZero, LHSOne;
1848 APInt RHSZero, RHSOne;
1849 DAG.computeKnownBits(N0, LHSZero, LHSOne);
1851 if (LHSZero.getBoolValue()) {
1852 DAG.computeKnownBits(N1, RHSZero, RHSOne);
1854 // If all possibly-set bits on the LHS are clear on the RHS, return an OR.
1855 // If all possibly-set bits on the RHS are clear on the LHS, return an OR.
1856 if ((RHSZero & ~LHSZero) == ~LHSZero || (LHSZero & ~RHSZero) == ~RHSZero)
1857 return CombineTo(N, DAG.getNode(ISD::OR, SDLoc(N), VT, N0, N1),
1858 DAG.getNode(ISD::CARRY_FALSE,
1859 SDLoc(N), MVT::Glue));
1865 SDValue DAGCombiner::visitADDE(SDNode *N) {
1866 SDValue N0 = N->getOperand(0);
1867 SDValue N1 = N->getOperand(1);
1868 SDValue CarryIn = N->getOperand(2);
1870 // canonicalize constant to RHS
1871 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0);
1872 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
1874 return DAG.getNode(ISD::ADDE, SDLoc(N), N->getVTList(),
1877 // fold (adde x, y, false) -> (addc x, y)
1878 if (CarryIn.getOpcode() == ISD::CARRY_FALSE)
1879 return DAG.getNode(ISD::ADDC, SDLoc(N), N->getVTList(), N0, N1);
1884 // Since it may not be valid to emit a fold to zero for vector initializers
1885 // check if we can before folding.
1886 static SDValue tryFoldToZero(const SDLoc &DL, const TargetLowering &TLI, EVT VT,
1887 SelectionDAG &DAG, bool LegalOperations,
1890 return DAG.getConstant(0, DL, VT);
1891 if (!LegalOperations || TLI.isOperationLegal(ISD::BUILD_VECTOR, VT))
1892 return DAG.getConstant(0, DL, VT);
1896 SDValue DAGCombiner::visitSUB(SDNode *N) {
1897 SDValue N0 = N->getOperand(0);
1898 SDValue N1 = N->getOperand(1);
1899 EVT VT = N0.getValueType();
1903 if (VT.isVector()) {
1904 if (SDValue FoldedVOp = SimplifyVBinOp(N))
1907 // fold (sub x, 0) -> x, vector edition
1908 if (ISD::isBuildVectorAllZeros(N1.getNode()))
1912 // fold (sub x, x) -> 0
1913 // FIXME: Refactor this and xor and other similar operations together.
1915 return tryFoldToZero(DL, TLI, VT, DAG, LegalOperations, LegalTypes);
1916 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
1917 DAG.isConstantIntBuildVectorOrConstantInt(N1)) {
1918 // fold (sub c1, c2) -> c1-c2
1919 return DAG.FoldConstantArithmetic(ISD::SUB, DL, VT, N0.getNode(),
1923 ConstantSDNode *N1C = getAsNonOpaqueConstant(N1);
1925 // fold (sub x, c) -> (add x, -c)
1927 return DAG.getNode(ISD::ADD, DL, VT, N0,
1928 DAG.getConstant(-N1C->getAPIntValue(), DL, VT));
1931 if (isNullConstantOrNullSplatConstant(N0)) {
1932 unsigned BitWidth = VT.getScalarSizeInBits();
1933 // Right-shifting everything out but the sign bit followed by negation is
1934 // the same as flipping arithmetic/logical shift type without the negation:
1935 // -(X >>u 31) -> (X >>s 31)
1936 // -(X >>s 31) -> (X >>u 31)
1937 if (N1->getOpcode() == ISD::SRA || N1->getOpcode() == ISD::SRL) {
1938 ConstantSDNode *ShiftAmt = isConstOrConstSplat(N1.getOperand(1));
1939 if (ShiftAmt && ShiftAmt->getZExtValue() == BitWidth - 1) {
1940 auto NewSh = N1->getOpcode() == ISD::SRA ? ISD::SRL : ISD::SRA;
1941 if (!LegalOperations || TLI.isOperationLegal(NewSh, VT))
1942 return DAG.getNode(NewSh, DL, VT, N1.getOperand(0), N1.getOperand(1));
1946 // 0 - X --> 0 if the sub is NUW.
1947 if (N->getFlags()->hasNoUnsignedWrap())
1950 if (DAG.MaskedValueIsZero(N1, ~APInt::getSignBit(BitWidth))) {
1951 // N1 is either 0 or the minimum signed value. If the sub is NSW, then
1952 // N1 must be 0 because negating the minimum signed value is undefined.
1953 if (N->getFlags()->hasNoSignedWrap())
1956 // 0 - X --> X if X is 0 or the minimum signed value.
1961 // Canonicalize (sub -1, x) -> ~x, i.e. (xor x, -1)
1962 if (isAllOnesConstantOrAllOnesSplatConstant(N0))
1963 return DAG.getNode(ISD::XOR, DL, VT, N1, N0);
1965 // fold A-(A-B) -> B
1966 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(0))
1967 return N1.getOperand(1);
1969 // fold (A+B)-A -> B
1970 if (N0.getOpcode() == ISD::ADD && N0.getOperand(0) == N1)
1971 return N0.getOperand(1);
1973 // fold (A+B)-B -> A
1974 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1) == N1)
1975 return N0.getOperand(0);
1977 // fold C2-(A+C1) -> (C2-C1)-A
1978 if (N1.getOpcode() == ISD::ADD) {
1979 SDValue N11 = N1.getOperand(1);
1980 if (isConstantOrConstantVector(N0, /* NoOpaques */ true) &&
1981 isConstantOrConstantVector(N11, /* NoOpaques */ true)) {
1982 SDValue NewC = DAG.getNode(ISD::SUB, DL, VT, N0, N11);
1983 return DAG.getNode(ISD::SUB, DL, VT, NewC, N1.getOperand(0));
1987 // fold ((A+(B+or-C))-B) -> A+or-C
1988 if (N0.getOpcode() == ISD::ADD &&
1989 (N0.getOperand(1).getOpcode() == ISD::SUB ||
1990 N0.getOperand(1).getOpcode() == ISD::ADD) &&
1991 N0.getOperand(1).getOperand(0) == N1)
1992 return DAG.getNode(N0.getOperand(1).getOpcode(), DL, VT, N0.getOperand(0),
1993 N0.getOperand(1).getOperand(1));
1995 // fold ((A+(C+B))-B) -> A+C
1996 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1).getOpcode() == ISD::ADD &&
1997 N0.getOperand(1).getOperand(1) == N1)
1998 return DAG.getNode(ISD::ADD, DL, VT, N0.getOperand(0),
1999 N0.getOperand(1).getOperand(0));
2001 // fold ((A-(B-C))-C) -> A-B
2002 if (N0.getOpcode() == ISD::SUB && N0.getOperand(1).getOpcode() == ISD::SUB &&
2003 N0.getOperand(1).getOperand(1) == N1)
2004 return DAG.getNode(ISD::SUB, DL, VT, N0.getOperand(0),
2005 N0.getOperand(1).getOperand(0));
2007 // If either operand of a sub is undef, the result is undef
2013 // If the relocation model supports it, consider symbol offsets.
2014 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(N0))
2015 if (!LegalOperations && TLI.isOffsetFoldingLegal(GA)) {
2016 // fold (sub Sym, c) -> Sym-c
2017 if (N1C && GA->getOpcode() == ISD::GlobalAddress)
2018 return DAG.getGlobalAddress(GA->getGlobal(), SDLoc(N1C), VT,
2020 (uint64_t)N1C->getSExtValue());
2021 // fold (sub Sym+c1, Sym+c2) -> c1-c2
2022 if (GlobalAddressSDNode *GB = dyn_cast<GlobalAddressSDNode>(N1))
2023 if (GA->getGlobal() == GB->getGlobal())
2024 return DAG.getConstant((uint64_t)GA->getOffset() - GB->getOffset(),
2028 // sub X, (sextinreg Y i1) -> add X, (and Y 1)
2029 if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG) {
2030 VTSDNode *TN = cast<VTSDNode>(N1.getOperand(1));
2031 if (TN->getVT() == MVT::i1) {
2032 SDValue ZExt = DAG.getNode(ISD::AND, DL, VT, N1.getOperand(0),
2033 DAG.getConstant(1, DL, VT));
2034 return DAG.getNode(ISD::ADD, DL, VT, N0, ZExt);
2041 SDValue DAGCombiner::visitSUBC(SDNode *N) {
2042 SDValue N0 = N->getOperand(0);
2043 SDValue N1 = N->getOperand(1);
2044 EVT VT = N0.getValueType();
2047 // If the flag result is dead, turn this into an SUB.
2048 if (!N->hasAnyUseOfValue(1))
2049 return CombineTo(N, DAG.getNode(ISD::SUB, DL, VT, N0, N1),
2050 DAG.getNode(ISD::CARRY_FALSE, DL, MVT::Glue));
2052 // fold (subc x, x) -> 0 + no borrow
2054 return CombineTo(N, DAG.getConstant(0, DL, VT),
2055 DAG.getNode(ISD::CARRY_FALSE, DL, MVT::Glue));
2057 // fold (subc x, 0) -> x + no borrow
2058 if (isNullConstant(N1))
2059 return CombineTo(N, N0, DAG.getNode(ISD::CARRY_FALSE, DL, MVT::Glue));
2061 // Canonicalize (sub -1, x) -> ~x, i.e. (xor x, -1) + no borrow
2062 if (isAllOnesConstant(N0))
2063 return CombineTo(N, DAG.getNode(ISD::XOR, DL, VT, N1, N0),
2064 DAG.getNode(ISD::CARRY_FALSE, DL, MVT::Glue));
2069 SDValue DAGCombiner::visitSUBE(SDNode *N) {
2070 SDValue N0 = N->getOperand(0);
2071 SDValue N1 = N->getOperand(1);
2072 SDValue CarryIn = N->getOperand(2);
2074 // fold (sube x, y, false) -> (subc x, y)
2075 if (CarryIn.getOpcode() == ISD::CARRY_FALSE)
2076 return DAG.getNode(ISD::SUBC, SDLoc(N), N->getVTList(), N0, N1);
2081 SDValue DAGCombiner::visitMUL(SDNode *N) {
2082 SDValue N0 = N->getOperand(0);
2083 SDValue N1 = N->getOperand(1);
2084 EVT VT = N0.getValueType();
2086 // fold (mul x, undef) -> 0
2087 if (N0.isUndef() || N1.isUndef())
2088 return DAG.getConstant(0, SDLoc(N), VT);
2090 bool N0IsConst = false;
2091 bool N1IsConst = false;
2092 bool N1IsOpaqueConst = false;
2093 bool N0IsOpaqueConst = false;
2094 APInt ConstValue0, ConstValue1;
2096 if (VT.isVector()) {
2097 if (SDValue FoldedVOp = SimplifyVBinOp(N))
2100 N0IsConst = ISD::isConstantSplatVector(N0.getNode(), ConstValue0);
2101 N1IsConst = ISD::isConstantSplatVector(N1.getNode(), ConstValue1);
2103 N0IsConst = isa<ConstantSDNode>(N0);
2105 ConstValue0 = cast<ConstantSDNode>(N0)->getAPIntValue();
2106 N0IsOpaqueConst = cast<ConstantSDNode>(N0)->isOpaque();
2108 N1IsConst = isa<ConstantSDNode>(N1);
2110 ConstValue1 = cast<ConstantSDNode>(N1)->getAPIntValue();
2111 N1IsOpaqueConst = cast<ConstantSDNode>(N1)->isOpaque();
2115 // fold (mul c1, c2) -> c1*c2
2116 if (N0IsConst && N1IsConst && !N0IsOpaqueConst && !N1IsOpaqueConst)
2117 return DAG.FoldConstantArithmetic(ISD::MUL, SDLoc(N), VT,
2118 N0.getNode(), N1.getNode());
2120 // canonicalize constant to RHS (vector doesn't have to splat)
2121 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
2122 !DAG.isConstantIntBuildVectorOrConstantInt(N1))
2123 return DAG.getNode(ISD::MUL, SDLoc(N), VT, N1, N0);
2124 // fold (mul x, 0) -> 0
2125 if (N1IsConst && ConstValue1 == 0)
2127 // We require a splat of the entire scalar bit width for non-contiguous
2130 ConstValue1.getBitWidth() == VT.getScalarSizeInBits();
2131 // fold (mul x, 1) -> x
2132 if (N1IsConst && ConstValue1 == 1 && IsFullSplat)
2134 // fold (mul x, -1) -> 0-x
2135 if (N1IsConst && ConstValue1.isAllOnesValue()) {
2137 return DAG.getNode(ISD::SUB, DL, VT,
2138 DAG.getConstant(0, DL, VT), N0);
2140 // fold (mul x, (1 << c)) -> x << c
2141 if (N1IsConst && !N1IsOpaqueConst && ConstValue1.isPowerOf2() &&
2144 return DAG.getNode(ISD::SHL, DL, VT, N0,
2145 DAG.getConstant(ConstValue1.logBase2(), DL,
2146 getShiftAmountTy(N0.getValueType())));
2148 // fold (mul x, -(1 << c)) -> -(x << c) or (-x) << c
2149 if (N1IsConst && !N1IsOpaqueConst && (-ConstValue1).isPowerOf2() &&
2151 unsigned Log2Val = (-ConstValue1).logBase2();
2153 // FIXME: If the input is something that is easily negated (e.g. a
2154 // single-use add), we should put the negate there.
2155 return DAG.getNode(ISD::SUB, DL, VT,
2156 DAG.getConstant(0, DL, VT),
2157 DAG.getNode(ISD::SHL, DL, VT, N0,
2158 DAG.getConstant(Log2Val, DL,
2159 getShiftAmountTy(N0.getValueType()))));
2162 // (mul (shl X, c1), c2) -> (mul X, c2 << c1)
2163 if (N0.getOpcode() == ISD::SHL &&
2164 isConstantOrConstantVector(N1, /* NoOpaques */ true) &&
2165 isConstantOrConstantVector(N0.getOperand(1), /* NoOpaques */ true)) {
2166 SDValue C3 = DAG.getNode(ISD::SHL, SDLoc(N), VT, N1, N0.getOperand(1));
2167 if (isConstantOrConstantVector(C3))
2168 return DAG.getNode(ISD::MUL, SDLoc(N), VT, N0.getOperand(0), C3);
2171 // Change (mul (shl X, C), Y) -> (shl (mul X, Y), C) when the shift has one
2174 SDValue Sh(nullptr, 0), Y(nullptr, 0);
2176 // Check for both (mul (shl X, C), Y) and (mul Y, (shl X, C)).
2177 if (N0.getOpcode() == ISD::SHL &&
2178 isConstantOrConstantVector(N0.getOperand(1)) &&
2179 N0.getNode()->hasOneUse()) {
2181 } else if (N1.getOpcode() == ISD::SHL &&
2182 isConstantOrConstantVector(N1.getOperand(1)) &&
2183 N1.getNode()->hasOneUse()) {
2188 SDValue Mul = DAG.getNode(ISD::MUL, SDLoc(N), VT, Sh.getOperand(0), Y);
2189 return DAG.getNode(ISD::SHL, SDLoc(N), VT, Mul, Sh.getOperand(1));
2193 // fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2)
2194 if (DAG.isConstantIntBuildVectorOrConstantInt(N1) &&
2195 N0.getOpcode() == ISD::ADD &&
2196 DAG.isConstantIntBuildVectorOrConstantInt(N0.getOperand(1)) &&
2197 isMulAddWithConstProfitable(N, N0, N1))
2198 return DAG.getNode(ISD::ADD, SDLoc(N), VT,
2199 DAG.getNode(ISD::MUL, SDLoc(N0), VT,
2200 N0.getOperand(0), N1),
2201 DAG.getNode(ISD::MUL, SDLoc(N1), VT,
2202 N0.getOperand(1), N1));
2205 if (SDValue RMUL = ReassociateOps(ISD::MUL, SDLoc(N), N0, N1))
2211 /// Return true if divmod libcall is available.
2212 static bool isDivRemLibcallAvailable(SDNode *Node, bool isSigned,
2213 const TargetLowering &TLI) {
2215 EVT NodeType = Node->getValueType(0);
2216 if (!NodeType.isSimple())
2218 switch (NodeType.getSimpleVT().SimpleTy) {
2219 default: return false; // No libcall for vector types.
2220 case MVT::i8: LC= isSigned ? RTLIB::SDIVREM_I8 : RTLIB::UDIVREM_I8; break;
2221 case MVT::i16: LC= isSigned ? RTLIB::SDIVREM_I16 : RTLIB::UDIVREM_I16; break;
2222 case MVT::i32: LC= isSigned ? RTLIB::SDIVREM_I32 : RTLIB::UDIVREM_I32; break;
2223 case MVT::i64: LC= isSigned ? RTLIB::SDIVREM_I64 : RTLIB::UDIVREM_I64; break;
2224 case MVT::i128: LC= isSigned ? RTLIB::SDIVREM_I128:RTLIB::UDIVREM_I128; break;
2227 return TLI.getLibcallName(LC) != nullptr;
2230 /// Issue divrem if both quotient and remainder are needed.
2231 SDValue DAGCombiner::useDivRem(SDNode *Node) {
2232 if (Node->use_empty())
2233 return SDValue(); // This is a dead node, leave it alone.
2235 unsigned Opcode = Node->getOpcode();
2236 bool isSigned = (Opcode == ISD::SDIV) || (Opcode == ISD::SREM);
2237 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
2239 // DivMod lib calls can still work on non-legal types if using lib-calls.
2240 EVT VT = Node->getValueType(0);
2241 if (VT.isVector() || !VT.isInteger())
2244 if (!TLI.isTypeLegal(VT) && !TLI.isOperationCustom(DivRemOpc, VT))
2247 // If DIVREM is going to get expanded into a libcall,
2248 // but there is no libcall available, then don't combine.
2249 if (!TLI.isOperationLegalOrCustom(DivRemOpc, VT) &&
2250 !isDivRemLibcallAvailable(Node, isSigned, TLI))
2253 // If div is legal, it's better to do the normal expansion
2254 unsigned OtherOpcode = 0;
2255 if ((Opcode == ISD::SDIV) || (Opcode == ISD::UDIV)) {
2256 OtherOpcode = isSigned ? ISD::SREM : ISD::UREM;
2257 if (TLI.isOperationLegalOrCustom(Opcode, VT))
2260 OtherOpcode = isSigned ? ISD::SDIV : ISD::UDIV;
2261 if (TLI.isOperationLegalOrCustom(OtherOpcode, VT))
2265 SDValue Op0 = Node->getOperand(0);
2266 SDValue Op1 = Node->getOperand(1);
2268 for (SDNode::use_iterator UI = Op0.getNode()->use_begin(),
2269 UE = Op0.getNode()->use_end(); UI != UE;) {
2270 SDNode *User = *UI++;
2271 if (User == Node || User->use_empty())
2273 // Convert the other matching node(s), too;
2274 // otherwise, the DIVREM may get target-legalized into something
2275 // target-specific that we won't be able to recognize.
2276 unsigned UserOpc = User->getOpcode();
2277 if ((UserOpc == Opcode || UserOpc == OtherOpcode || UserOpc == DivRemOpc) &&
2278 User->getOperand(0) == Op0 &&
2279 User->getOperand(1) == Op1) {
2281 if (UserOpc == OtherOpcode) {
2282 SDVTList VTs = DAG.getVTList(VT, VT);
2283 combined = DAG.getNode(DivRemOpc, SDLoc(Node), VTs, Op0, Op1);
2284 } else if (UserOpc == DivRemOpc) {
2285 combined = SDValue(User, 0);
2287 assert(UserOpc == Opcode);
2291 if (UserOpc == ISD::SDIV || UserOpc == ISD::UDIV)
2292 CombineTo(User, combined);
2293 else if (UserOpc == ISD::SREM || UserOpc == ISD::UREM)
2294 CombineTo(User, combined.getValue(1));
2300 SDValue DAGCombiner::visitSDIV(SDNode *N) {
2301 SDValue N0 = N->getOperand(0);
2302 SDValue N1 = N->getOperand(1);
2303 EVT VT = N->getValueType(0);
2307 if (SDValue FoldedVOp = SimplifyVBinOp(N))
2312 // fold (sdiv c1, c2) -> c1/c2
2313 ConstantSDNode *N0C = isConstOrConstSplat(N0);
2314 ConstantSDNode *N1C = isConstOrConstSplat(N1);
2315 if (N0C && N1C && !N0C->isOpaque() && !N1C->isOpaque())
2316 return DAG.FoldConstantArithmetic(ISD::SDIV, DL, VT, N0C, N1C);
2317 // fold (sdiv X, 1) -> X
2318 if (N1C && N1C->isOne())
2320 // fold (sdiv X, -1) -> 0-X
2321 if (N1C && N1C->isAllOnesValue())
2322 return DAG.getNode(ISD::SUB, DL, VT,
2323 DAG.getConstant(0, DL, VT), N0);
2325 // If we know the sign bits of both operands are zero, strength reduce to a
2326 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2
2327 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0))
2328 return DAG.getNode(ISD::UDIV, DL, N1.getValueType(), N0, N1);
2330 // fold (sdiv X, pow2) -> simple ops after legalize
2331 // FIXME: We check for the exact bit here because the generic lowering gives
2332 // better results in that case. The target-specific lowering should learn how
2333 // to handle exact sdivs efficiently.
2334 if (N1C && !N1C->isNullValue() && !N1C->isOpaque() &&
2335 !cast<BinaryWithFlagsSDNode>(N)->Flags.hasExact() &&
2336 (N1C->getAPIntValue().isPowerOf2() ||
2337 (-N1C->getAPIntValue()).isPowerOf2())) {
2338 // Target-specific implementation of sdiv x, pow2.
2339 if (SDValue Res = BuildSDIVPow2(N))
2342 unsigned lg2 = N1C->getAPIntValue().countTrailingZeros();
2344 // Splat the sign bit into the register
2346 DAG.getNode(ISD::SRA, DL, VT, N0,
2347 DAG.getConstant(VT.getScalarSizeInBits() - 1, DL,
2348 getShiftAmountTy(N0.getValueType())));
2349 AddToWorklist(SGN.getNode());
2351 // Add (N0 < 0) ? abs2 - 1 : 0;
2353 DAG.getNode(ISD::SRL, DL, VT, SGN,
2354 DAG.getConstant(VT.getScalarSizeInBits() - lg2, DL,
2355 getShiftAmountTy(SGN.getValueType())));
2356 SDValue ADD = DAG.getNode(ISD::ADD, DL, VT, N0, SRL);
2357 AddToWorklist(SRL.getNode());
2358 AddToWorklist(ADD.getNode()); // Divide by pow2
2359 SDValue SRA = DAG.getNode(ISD::SRA, DL, VT, ADD,
2360 DAG.getConstant(lg2, DL,
2361 getShiftAmountTy(ADD.getValueType())));
2363 // If we're dividing by a positive value, we're done. Otherwise, we must
2364 // negate the result.
2365 if (N1C->getAPIntValue().isNonNegative())
2368 AddToWorklist(SRA.getNode());
2369 return DAG.getNode(ISD::SUB, DL, VT, DAG.getConstant(0, DL, VT), SRA);
2372 // If integer divide is expensive and we satisfy the requirements, emit an
2373 // alternate sequence. Targets may check function attributes for size/speed
2375 AttributeSet Attr = DAG.getMachineFunction().getFunction()->getAttributes();
2376 if (N1C && !TLI.isIntDivCheap(N->getValueType(0), Attr))
2377 if (SDValue Op = BuildSDIV(N))
2380 // sdiv, srem -> sdivrem
2381 // If the divisor is constant, then return DIVREM only if isIntDivCheap() is
2382 // true. Otherwise, we break the simplification logic in visitREM().
2383 if (!N1C || TLI.isIntDivCheap(N->getValueType(0), Attr))
2384 if (SDValue DivRem = useDivRem(N))
2389 return DAG.getConstant(0, DL, VT);
2390 // X / undef -> undef
2397 SDValue DAGCombiner::visitUDIV(SDNode *N) {
2398 SDValue N0 = N->getOperand(0);
2399 SDValue N1 = N->getOperand(1);
2400 EVT VT = N->getValueType(0);
2404 if (SDValue FoldedVOp = SimplifyVBinOp(N))
2409 // fold (udiv c1, c2) -> c1/c2
2410 ConstantSDNode *N0C = isConstOrConstSplat(N0);
2411 ConstantSDNode *N1C = isConstOrConstSplat(N1);
2413 if (SDValue Folded = DAG.FoldConstantArithmetic(ISD::UDIV, DL, VT,
2417 // fold (udiv x, (1 << c)) -> x >>u c
2418 if (isConstantOrConstantVector(N1, /*NoOpaques*/ true) &&
2419 DAG.isKnownToBeAPowerOfTwo(N1)) {
2420 SDValue LogBase2 = BuildLogBase2(N1, DL);
2421 AddToWorklist(LogBase2.getNode());
2423 EVT ShiftVT = getShiftAmountTy(N0.getValueType());
2424 SDValue Trunc = DAG.getZExtOrTrunc(LogBase2, DL, ShiftVT);
2425 AddToWorklist(Trunc.getNode());
2426 return DAG.getNode(ISD::SRL, DL, VT, N0, Trunc);
2429 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2
2430 if (N1.getOpcode() == ISD::SHL) {
2431 SDValue N10 = N1.getOperand(0);
2432 if (isConstantOrConstantVector(N10, /*NoOpaques*/ true) &&
2433 DAG.isKnownToBeAPowerOfTwo(N10)) {
2434 SDValue LogBase2 = BuildLogBase2(N10, DL);
2435 AddToWorklist(LogBase2.getNode());
2437 EVT ADDVT = N1.getOperand(1).getValueType();
2438 SDValue Trunc = DAG.getZExtOrTrunc(LogBase2, DL, ADDVT);
2439 AddToWorklist(Trunc.getNode());
2440 SDValue Add = DAG.getNode(ISD::ADD, DL, ADDVT, N1.getOperand(1), Trunc);
2441 AddToWorklist(Add.getNode());
2442 return DAG.getNode(ISD::SRL, DL, VT, N0, Add);
2446 // fold (udiv x, c) -> alternate
2447 AttributeSet Attr = DAG.getMachineFunction().getFunction()->getAttributes();
2448 if (N1C && !TLI.isIntDivCheap(N->getValueType(0), Attr))
2449 if (SDValue Op = BuildUDIV(N))
2452 // sdiv, srem -> sdivrem
2453 // If the divisor is constant, then return DIVREM only if isIntDivCheap() is
2454 // true. Otherwise, we break the simplification logic in visitREM().
2455 if (!N1C || TLI.isIntDivCheap(N->getValueType(0), Attr))
2456 if (SDValue DivRem = useDivRem(N))
2461 return DAG.getConstant(0, DL, VT);
2462 // X / undef -> undef
2469 // handles ISD::SREM and ISD::UREM
2470 SDValue DAGCombiner::visitREM(SDNode *N) {
2471 unsigned Opcode = N->getOpcode();
2472 SDValue N0 = N->getOperand(0);
2473 SDValue N1 = N->getOperand(1);
2474 EVT VT = N->getValueType(0);
2475 bool isSigned = (Opcode == ISD::SREM);
2478 // fold (rem c1, c2) -> c1%c2
2479 ConstantSDNode *N0C = isConstOrConstSplat(N0);
2480 ConstantSDNode *N1C = isConstOrConstSplat(N1);
2482 if (SDValue Folded = DAG.FoldConstantArithmetic(Opcode, DL, VT, N0C, N1C))
2486 // If we know the sign bits of both operands are zero, strength reduce to a
2487 // urem instead. Handles (X & 0x0FFFFFFF) %s 16 -> X&15
2488 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0))
2489 return DAG.getNode(ISD::UREM, DL, VT, N0, N1);
2491 // fold (urem x, pow2) -> (and x, pow2-1)
2492 if (DAG.isKnownToBeAPowerOfTwo(N1)) {
2493 APInt NegOne = APInt::getAllOnesValue(VT.getScalarSizeInBits());
2495 DAG.getNode(ISD::ADD, DL, VT, N1, DAG.getConstant(NegOne, DL, VT));
2496 AddToWorklist(Add.getNode());
2497 return DAG.getNode(ISD::AND, DL, VT, N0, Add);
2499 // fold (urem x, (shl pow2, y)) -> (and x, (add (shl pow2, y), -1))
2500 if (N1.getOpcode() == ISD::SHL &&
2501 DAG.isKnownToBeAPowerOfTwo(N1.getOperand(0))) {
2502 APInt NegOne = APInt::getAllOnesValue(VT.getScalarSizeInBits());
2504 DAG.getNode(ISD::ADD, DL, VT, N1, DAG.getConstant(NegOne, DL, VT));
2505 AddToWorklist(Add.getNode());
2506 return DAG.getNode(ISD::AND, DL, VT, N0, Add);
2510 AttributeSet Attr = DAG.getMachineFunction().getFunction()->getAttributes();
2512 // If X/C can be simplified by the division-by-constant logic, lower
2513 // X%C to the equivalent of X-X/C*C.
2514 // To avoid mangling nodes, this simplification requires that the combine()
2515 // call for the speculative DIV must not cause a DIVREM conversion. We guard
2516 // against this by skipping the simplification if isIntDivCheap(). When
2517 // div is not cheap, combine will not return a DIVREM. Regardless,
2518 // checking cheapness here makes sense since the simplification results in
2520 if (N1C && !N1C->isNullValue() && !TLI.isIntDivCheap(VT, Attr)) {
2521 unsigned DivOpcode = isSigned ? ISD::SDIV : ISD::UDIV;
2522 SDValue Div = DAG.getNode(DivOpcode, DL, VT, N0, N1);
2523 AddToWorklist(Div.getNode());
2524 SDValue OptimizedDiv = combine(Div.getNode());
2525 if (OptimizedDiv.getNode() && OptimizedDiv.getNode() != Div.getNode()) {
2526 assert((OptimizedDiv.getOpcode() != ISD::UDIVREM) &&
2527 (OptimizedDiv.getOpcode() != ISD::SDIVREM));
2528 SDValue Mul = DAG.getNode(ISD::MUL, DL, VT, OptimizedDiv, N1);
2529 SDValue Sub = DAG.getNode(ISD::SUB, DL, VT, N0, Mul);
2530 AddToWorklist(Mul.getNode());
2535 // sdiv, srem -> sdivrem
2536 if (SDValue DivRem = useDivRem(N))
2537 return DivRem.getValue(1);
2541 return DAG.getConstant(0, DL, VT);
2542 // X % undef -> undef
2549 SDValue DAGCombiner::visitMULHS(SDNode *N) {
2550 SDValue N0 = N->getOperand(0);
2551 SDValue N1 = N->getOperand(1);
2552 EVT VT = N->getValueType(0);
2555 // fold (mulhs x, 0) -> 0
2556 if (isNullConstant(N1))
2558 // fold (mulhs x, 1) -> (sra x, size(x)-1)
2559 if (isOneConstant(N1)) {
2561 return DAG.getNode(ISD::SRA, DL, N0.getValueType(), N0,
2562 DAG.getConstant(N0.getValueSizeInBits() - 1, DL,
2563 getShiftAmountTy(N0.getValueType())));
2565 // fold (mulhs x, undef) -> 0
2566 if (N0.isUndef() || N1.isUndef())
2567 return DAG.getConstant(0, SDLoc(N), VT);
2569 // If the type twice as wide is legal, transform the mulhs to a wider multiply
2571 if (VT.isSimple() && !VT.isVector()) {
2572 MVT Simple = VT.getSimpleVT();
2573 unsigned SimpleSize = Simple.getSizeInBits();
2574 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2575 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2576 N0 = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N0);
2577 N1 = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N1);
2578 N1 = DAG.getNode(ISD::MUL, DL, NewVT, N0, N1);
2579 N1 = DAG.getNode(ISD::SRL, DL, NewVT, N1,
2580 DAG.getConstant(SimpleSize, DL,
2581 getShiftAmountTy(N1.getValueType())));
2582 return DAG.getNode(ISD::TRUNCATE, DL, VT, N1);
2589 SDValue DAGCombiner::visitMULHU(SDNode *N) {
2590 SDValue N0 = N->getOperand(0);
2591 SDValue N1 = N->getOperand(1);
2592 EVT VT = N->getValueType(0);
2595 // fold (mulhu x, 0) -> 0
2596 if (isNullConstant(N1))
2598 // fold (mulhu x, 1) -> 0
2599 if (isOneConstant(N1))
2600 return DAG.getConstant(0, DL, N0.getValueType());
2601 // fold (mulhu x, undef) -> 0
2602 if (N0.isUndef() || N1.isUndef())
2603 return DAG.getConstant(0, DL, VT);
2605 // If the type twice as wide is legal, transform the mulhu to a wider multiply
2607 if (VT.isSimple() && !VT.isVector()) {
2608 MVT Simple = VT.getSimpleVT();
2609 unsigned SimpleSize = Simple.getSizeInBits();
2610 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2611 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2612 N0 = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N0);
2613 N1 = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N1);
2614 N1 = DAG.getNode(ISD::MUL, DL, NewVT, N0, N1);
2615 N1 = DAG.getNode(ISD::SRL, DL, NewVT, N1,
2616 DAG.getConstant(SimpleSize, DL,
2617 getShiftAmountTy(N1.getValueType())));
2618 return DAG.getNode(ISD::TRUNCATE, DL, VT, N1);
2625 /// Perform optimizations common to nodes that compute two values. LoOp and HiOp
2626 /// give the opcodes for the two computations that are being performed. Return
2627 /// true if a simplification was made.
2628 SDValue DAGCombiner::SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp,
2630 // If the high half is not needed, just compute the low half.
2631 bool HiExists = N->hasAnyUseOfValue(1);
2633 (!LegalOperations ||
2634 TLI.isOperationLegalOrCustom(LoOp, N->getValueType(0)))) {
2635 SDValue Res = DAG.getNode(LoOp, SDLoc(N), N->getValueType(0), N->ops());
2636 return CombineTo(N, Res, Res);
2639 // If the low half is not needed, just compute the high half.
2640 bool LoExists = N->hasAnyUseOfValue(0);
2642 (!LegalOperations ||
2643 TLI.isOperationLegal(HiOp, N->getValueType(1)))) {
2644 SDValue Res = DAG.getNode(HiOp, SDLoc(N), N->getValueType(1), N->ops());
2645 return CombineTo(N, Res, Res);
2648 // If both halves are used, return as it is.
2649 if (LoExists && HiExists)
2652 // If the two computed results can be simplified separately, separate them.
2654 SDValue Lo = DAG.getNode(LoOp, SDLoc(N), N->getValueType(0), N->ops());
2655 AddToWorklist(Lo.getNode());
2656 SDValue LoOpt = combine(Lo.getNode());
2657 if (LoOpt.getNode() && LoOpt.getNode() != Lo.getNode() &&
2658 (!LegalOperations ||
2659 TLI.isOperationLegal(LoOpt.getOpcode(), LoOpt.getValueType())))
2660 return CombineTo(N, LoOpt, LoOpt);
2664 SDValue Hi = DAG.getNode(HiOp, SDLoc(N), N->getValueType(1), N->ops());
2665 AddToWorklist(Hi.getNode());
2666 SDValue HiOpt = combine(Hi.getNode());
2667 if (HiOpt.getNode() && HiOpt != Hi &&
2668 (!LegalOperations ||
2669 TLI.isOperationLegal(HiOpt.getOpcode(), HiOpt.getValueType())))
2670 return CombineTo(N, HiOpt, HiOpt);
2676 SDValue DAGCombiner::visitSMUL_LOHI(SDNode *N) {
2677 if (SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHS))
2680 EVT VT = N->getValueType(0);
2683 // If the type is twice as wide is legal, transform the mulhu to a wider
2684 // multiply plus a shift.
2685 if (VT.isSimple() && !VT.isVector()) {
2686 MVT Simple = VT.getSimpleVT();
2687 unsigned SimpleSize = Simple.getSizeInBits();
2688 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2689 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2690 SDValue Lo = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N->getOperand(0));
2691 SDValue Hi = DAG.getNode(ISD::SIGN_EXTEND, DL, NewVT, N->getOperand(1));
2692 Lo = DAG.getNode(ISD::MUL, DL, NewVT, Lo, Hi);
2693 // Compute the high part as N1.
2694 Hi = DAG.getNode(ISD::SRL, DL, NewVT, Lo,
2695 DAG.getConstant(SimpleSize, DL,
2696 getShiftAmountTy(Lo.getValueType())));
2697 Hi = DAG.getNode(ISD::TRUNCATE, DL, VT, Hi);
2698 // Compute the low part as N0.
2699 Lo = DAG.getNode(ISD::TRUNCATE, DL, VT, Lo);
2700 return CombineTo(N, Lo, Hi);
2707 SDValue DAGCombiner::visitUMUL_LOHI(SDNode *N) {
2708 if (SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHU))
2711 EVT VT = N->getValueType(0);
2714 // If the type is twice as wide is legal, transform the mulhu to a wider
2715 // multiply plus a shift.
2716 if (VT.isSimple() && !VT.isVector()) {
2717 MVT Simple = VT.getSimpleVT();
2718 unsigned SimpleSize = Simple.getSizeInBits();
2719 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), SimpleSize*2);
2720 if (TLI.isOperationLegal(ISD::MUL, NewVT)) {
2721 SDValue Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N->getOperand(0));
2722 SDValue Hi = DAG.getNode(ISD::ZERO_EXTEND, DL, NewVT, N->getOperand(1));
2723 Lo = DAG.getNode(ISD::MUL, DL, NewVT, Lo, Hi);
2724 // Compute the high part as N1.
2725 Hi = DAG.getNode(ISD::SRL, DL, NewVT, Lo,
2726 DAG.getConstant(SimpleSize, DL,
2727 getShiftAmountTy(Lo.getValueType())));
2728 Hi = DAG.getNode(ISD::TRUNCATE, DL, VT, Hi);
2729 // Compute the low part as N0.
2730 Lo = DAG.getNode(ISD::TRUNCATE, DL, VT, Lo);
2731 return CombineTo(N, Lo, Hi);
2738 SDValue DAGCombiner::visitSMULO(SDNode *N) {
2739 // (smulo x, 2) -> (saddo x, x)
2740 if (ConstantSDNode *C2 = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2741 if (C2->getAPIntValue() == 2)
2742 return DAG.getNode(ISD::SADDO, SDLoc(N), N->getVTList(),
2743 N->getOperand(0), N->getOperand(0));
2748 SDValue DAGCombiner::visitUMULO(SDNode *N) {
2749 // (umulo x, 2) -> (uaddo x, x)
2750 if (ConstantSDNode *C2 = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2751 if (C2->getAPIntValue() == 2)
2752 return DAG.getNode(ISD::UADDO, SDLoc(N), N->getVTList(),
2753 N->getOperand(0), N->getOperand(0));
2758 SDValue DAGCombiner::visitIMINMAX(SDNode *N) {
2759 SDValue N0 = N->getOperand(0);
2760 SDValue N1 = N->getOperand(1);
2761 EVT VT = N0.getValueType();
2765 if (SDValue FoldedVOp = SimplifyVBinOp(N))
2768 // fold (add c1, c2) -> c1+c2
2769 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
2770 ConstantSDNode *N1C = getAsNonOpaqueConstant(N1);
2772 return DAG.FoldConstantArithmetic(N->getOpcode(), SDLoc(N), VT, N0C, N1C);
2774 // canonicalize constant to RHS
2775 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
2776 !DAG.isConstantIntBuildVectorOrConstantInt(N1))
2777 return DAG.getNode(N->getOpcode(), SDLoc(N), VT, N1, N0);
2782 /// If this is a binary operator with two operands of the same opcode, try to
2784 SDValue DAGCombiner::SimplifyBinOpWithSameOpcodeHands(SDNode *N) {
2785 SDValue N0 = N->getOperand(0), N1 = N->getOperand(1);
2786 EVT VT = N0.getValueType();
2787 assert(N0.getOpcode() == N1.getOpcode() && "Bad input!");
2789 // Bail early if none of these transforms apply.
2790 if (N0.getNumOperands() == 0) return SDValue();
2792 // For each of OP in AND/OR/XOR:
2793 // fold (OP (zext x), (zext y)) -> (zext (OP x, y))
2794 // fold (OP (sext x), (sext y)) -> (sext (OP x, y))
2795 // fold (OP (aext x), (aext y)) -> (aext (OP x, y))
2796 // fold (OP (bswap x), (bswap y)) -> (bswap (OP x, y))
2797 // fold (OP (trunc x), (trunc y)) -> (trunc (OP x, y)) (if trunc isn't free)
2799 // do not sink logical op inside of a vector extend, since it may combine
2801 EVT Op0VT = N0.getOperand(0).getValueType();
2802 if ((N0.getOpcode() == ISD::ZERO_EXTEND ||
2803 N0.getOpcode() == ISD::SIGN_EXTEND ||
2804 N0.getOpcode() == ISD::BSWAP ||
2805 // Avoid infinite looping with PromoteIntBinOp.
2806 (N0.getOpcode() == ISD::ANY_EXTEND &&
2807 (!LegalTypes || TLI.isTypeDesirableForOp(N->getOpcode(), Op0VT))) ||
2808 (N0.getOpcode() == ISD::TRUNCATE &&
2809 (!TLI.isZExtFree(VT, Op0VT) ||
2810 !TLI.isTruncateFree(Op0VT, VT)) &&
2811 TLI.isTypeLegal(Op0VT))) &&
2813 Op0VT == N1.getOperand(0).getValueType() &&
2814 (!LegalOperations || TLI.isOperationLegal(N->getOpcode(), Op0VT))) {
2815 SDValue ORNode = DAG.getNode(N->getOpcode(), SDLoc(N0),
2816 N0.getOperand(0).getValueType(),
2817 N0.getOperand(0), N1.getOperand(0));
2818 AddToWorklist(ORNode.getNode());
2819 return DAG.getNode(N0.getOpcode(), SDLoc(N), VT, ORNode);
2822 // For each of OP in SHL/SRL/SRA/AND...
2823 // fold (and (OP x, z), (OP y, z)) -> (OP (and x, y), z)
2824 // fold (or (OP x, z), (OP y, z)) -> (OP (or x, y), z)
2825 // fold (xor (OP x, z), (OP y, z)) -> (OP (xor x, y), z)
2826 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL ||
2827 N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::AND) &&
2828 N0.getOperand(1) == N1.getOperand(1)) {
2829 SDValue ORNode = DAG.getNode(N->getOpcode(), SDLoc(N0),
2830 N0.getOperand(0).getValueType(),
2831 N0.getOperand(0), N1.getOperand(0));
2832 AddToWorklist(ORNode.getNode());
2833 return DAG.getNode(N0.getOpcode(), SDLoc(N), VT,
2834 ORNode, N0.getOperand(1));
2837 // Simplify xor/and/or (bitcast(A), bitcast(B)) -> bitcast(op (A,B))
2838 // Only perform this optimization up until type legalization, before
2839 // LegalizeVectorOprs. LegalizeVectorOprs promotes vector operations by
2840 // adding bitcasts. For example (xor v4i32) is promoted to (v2i64), and
2841 // we don't want to undo this promotion.
2842 // We also handle SCALAR_TO_VECTOR because xor/or/and operations are cheaper
2844 if ((N0.getOpcode() == ISD::BITCAST ||
2845 N0.getOpcode() == ISD::SCALAR_TO_VECTOR) &&
2846 Level <= AfterLegalizeTypes) {
2847 SDValue In0 = N0.getOperand(0);
2848 SDValue In1 = N1.getOperand(0);
2849 EVT In0Ty = In0.getValueType();
2850 EVT In1Ty = In1.getValueType();
2852 // If both incoming values are integers, and the original types are the
2854 if (In0Ty.isInteger() && In1Ty.isInteger() && In0Ty == In1Ty) {
2855 SDValue Op = DAG.getNode(N->getOpcode(), DL, In0Ty, In0, In1);
2856 SDValue BC = DAG.getNode(N0.getOpcode(), DL, VT, Op);
2857 AddToWorklist(Op.getNode());
2862 // Xor/and/or are indifferent to the swizzle operation (shuffle of one value).
2863 // Simplify xor/and/or (shuff(A), shuff(B)) -> shuff(op (A,B))
2864 // If both shuffles use the same mask, and both shuffle within a single
2865 // vector, then it is worthwhile to move the swizzle after the operation.
2866 // The type-legalizer generates this pattern when loading illegal
2867 // vector types from memory. In many cases this allows additional shuffle
2869 // There are other cases where moving the shuffle after the xor/and/or
2870 // is profitable even if shuffles don't perform a swizzle.
2871 // If both shuffles use the same mask, and both shuffles have the same first
2872 // or second operand, then it might still be profitable to move the shuffle
2873 // after the xor/and/or operation.
2874 if (N0.getOpcode() == ISD::VECTOR_SHUFFLE && Level < AfterLegalizeDAG) {
2875 ShuffleVectorSDNode *SVN0 = cast<ShuffleVectorSDNode>(N0);
2876 ShuffleVectorSDNode *SVN1 = cast<ShuffleVectorSDNode>(N1);
2878 assert(N0.getOperand(0).getValueType() == N1.getOperand(0).getValueType() &&
2879 "Inputs to shuffles are not the same type");
2881 // Check that both shuffles use the same mask. The masks are known to be of
2882 // the same length because the result vector type is the same.
2883 // Check also that shuffles have only one use to avoid introducing extra
2885 if (SVN0->hasOneUse() && SVN1->hasOneUse() &&
2886 SVN0->getMask().equals(SVN1->getMask())) {
2887 SDValue ShOp = N0->getOperand(1);
2889 // Don't try to fold this node if it requires introducing a
2890 // build vector of all zeros that might be illegal at this stage.
2891 if (N->getOpcode() == ISD::XOR && !ShOp.isUndef()) {
2893 ShOp = DAG.getConstant(0, SDLoc(N), VT);
2898 // (AND (shuf (A, C), shuf (B, C)) -> shuf (AND (A, B), C)
2899 // (OR (shuf (A, C), shuf (B, C)) -> shuf (OR (A, B), C)
2900 // (XOR (shuf (A, C), shuf (B, C)) -> shuf (XOR (A, B), V_0)
2901 if (N0.getOperand(1) == N1.getOperand(1) && ShOp.getNode()) {
2902 SDValue NewNode = DAG.getNode(N->getOpcode(), SDLoc(N), VT,
2903 N0->getOperand(0), N1->getOperand(0));
2904 AddToWorklist(NewNode.getNode());
2905 return DAG.getVectorShuffle(VT, SDLoc(N), NewNode, ShOp,
2909 // Don't try to fold this node if it requires introducing a
2910 // build vector of all zeros that might be illegal at this stage.
2911 ShOp = N0->getOperand(0);
2912 if (N->getOpcode() == ISD::XOR && !ShOp.isUndef()) {
2914 ShOp = DAG.getConstant(0, SDLoc(N), VT);
2919 // (AND (shuf (C, A), shuf (C, B)) -> shuf (C, AND (A, B))
2920 // (OR (shuf (C, A), shuf (C, B)) -> shuf (C, OR (A, B))
2921 // (XOR (shuf (C, A), shuf (C, B)) -> shuf (V_0, XOR (A, B))
2922 if (N0->getOperand(0) == N1->getOperand(0) && ShOp.getNode()) {
2923 SDValue NewNode = DAG.getNode(N->getOpcode(), SDLoc(N), VT,
2924 N0->getOperand(1), N1->getOperand(1));
2925 AddToWorklist(NewNode.getNode());
2926 return DAG.getVectorShuffle(VT, SDLoc(N), ShOp, NewNode,
2935 /// This contains all DAGCombine rules which reduce two values combined by
2936 /// an And operation to a single value. This makes them reusable in the context
2937 /// of visitSELECT(). Rules involving constants are not included as
2938 /// visitSELECT() already handles those cases.
2939 SDValue DAGCombiner::visitANDLike(SDValue N0, SDValue N1,
2940 SDNode *LocReference) {
2941 EVT VT = N1.getValueType();
2943 // fold (and x, undef) -> 0
2944 if (N0.isUndef() || N1.isUndef())
2945 return DAG.getConstant(0, SDLoc(LocReference), VT);
2946 // fold (and (setcc x), (setcc y)) -> (setcc (and x, y))
2947 SDValue LL, LR, RL, RR, CC0, CC1;
2948 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
2949 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
2950 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
2952 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 &&
2953 LL.getValueType().isInteger()) {
2954 // fold (and (seteq X, 0), (seteq Y, 0)) -> (seteq (or X, Y), 0)
2955 if (isNullConstant(LR) && Op1 == ISD::SETEQ) {
2956 EVT CCVT = getSetCCResultType(LR.getValueType());
2957 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
2958 SDValue ORNode = DAG.getNode(ISD::OR, SDLoc(N0),
2959 LR.getValueType(), LL, RL);
2960 AddToWorklist(ORNode.getNode());
2961 return DAG.getSetCC(SDLoc(LocReference), VT, ORNode, LR, Op1);
2964 if (isAllOnesConstant(LR)) {
2965 // fold (and (seteq X, -1), (seteq Y, -1)) -> (seteq (and X, Y), -1)
2966 if (Op1 == ISD::SETEQ) {
2967 EVT CCVT = getSetCCResultType(LR.getValueType());
2968 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
2969 SDValue ANDNode = DAG.getNode(ISD::AND, SDLoc(N0),
2970 LR.getValueType(), LL, RL);
2971 AddToWorklist(ANDNode.getNode());
2972 return DAG.getSetCC(SDLoc(LocReference), VT, ANDNode, LR, Op1);
2975 // fold (and (setgt X, -1), (setgt Y, -1)) -> (setgt (or X, Y), -1)
2976 if (Op1 == ISD::SETGT) {
2977 EVT CCVT = getSetCCResultType(LR.getValueType());
2978 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
2979 SDValue ORNode = DAG.getNode(ISD::OR, SDLoc(N0),
2980 LR.getValueType(), LL, RL);
2981 AddToWorklist(ORNode.getNode());
2982 return DAG.getSetCC(SDLoc(LocReference), VT, ORNode, LR, Op1);
2987 // Simplify (and (setne X, 0), (setne X, -1)) -> (setuge (add X, 1), 2)
2988 if (LL == RL && isa<ConstantSDNode>(LR) && isa<ConstantSDNode>(RR) &&
2989 Op0 == Op1 && LL.getValueType().isInteger() &&
2990 Op0 == ISD::SETNE && ((isNullConstant(LR) && isAllOnesConstant(RR)) ||
2991 (isAllOnesConstant(LR) && isNullConstant(RR)))) {
2992 EVT CCVT = getSetCCResultType(LL.getValueType());
2993 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
2995 SDValue ADDNode = DAG.getNode(ISD::ADD, DL, LL.getValueType(),
2996 LL, DAG.getConstant(1, DL,
2997 LL.getValueType()));
2998 AddToWorklist(ADDNode.getNode());
2999 return DAG.getSetCC(SDLoc(LocReference), VT, ADDNode,
3000 DAG.getConstant(2, DL, LL.getValueType()),
3004 // canonicalize equivalent to ll == rl
3005 if (LL == RR && LR == RL) {
3006 Op1 = ISD::getSetCCSwappedOperands(Op1);
3009 if (LL == RL && LR == RR) {
3010 bool isInteger = LL.getValueType().isInteger();
3011 ISD::CondCode Result = ISD::getSetCCAndOperation(Op0, Op1, isInteger);
3012 if (Result != ISD::SETCC_INVALID &&
3013 (!LegalOperations ||
3014 (TLI.isCondCodeLegal(Result, LL.getSimpleValueType()) &&
3015 TLI.isOperationLegal(ISD::SETCC, LL.getValueType())))) {
3016 EVT CCVT = getSetCCResultType(LL.getValueType());
3017 if (N0.getValueType() == CCVT ||
3018 (!LegalOperations && N0.getValueType() == MVT::i1))
3019 return DAG.getSetCC(SDLoc(LocReference), N0.getValueType(),
3025 if (N0.getOpcode() == ISD::ADD && N1.getOpcode() == ISD::SRL &&
3026 VT.getSizeInBits() <= 64) {
3027 if (ConstantSDNode *ADDI = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
3028 APInt ADDC = ADDI->getAPIntValue();
3029 if (!TLI.isLegalAddImmediate(ADDC.getSExtValue())) {
3030 // Look for (and (add x, c1), (lshr y, c2)). If C1 wasn't a legal
3031 // immediate for an add, but it is legal if its top c2 bits are set,
3032 // transform the ADD so the immediate doesn't need to be materialized
3034 if (ConstantSDNode *SRLI = dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
3035 APInt Mask = APInt::getHighBitsSet(VT.getSizeInBits(),
3036 SRLI->getZExtValue());
3037 if (DAG.MaskedValueIsZero(N0.getOperand(1), Mask)) {
3039 if (TLI.isLegalAddImmediate(ADDC.getSExtValue())) {
3042 DAG.getNode(ISD::ADD, DL, VT,
3043 N0.getOperand(0), DAG.getConstant(ADDC, DL, VT));
3044 CombineTo(N0.getNode(), NewAdd);
3045 // Return N so it doesn't get rechecked!
3046 return SDValue(LocReference, 0);
3054 // Reduce bit extract of low half of an integer to the narrower type.
3055 // (and (srl i64:x, K), KMask) ->
3056 // (i64 zero_extend (and (srl (i32 (trunc i64:x)), K)), KMask)
3057 if (N0.getOpcode() == ISD::SRL && N0.hasOneUse()) {
3058 if (ConstantSDNode *CAnd = dyn_cast<ConstantSDNode>(N1)) {
3059 if (ConstantSDNode *CShift = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
3060 unsigned Size = VT.getSizeInBits();
3061 const APInt &AndMask = CAnd->getAPIntValue();
3062 unsigned ShiftBits = CShift->getZExtValue();
3064 // Bail out, this node will probably disappear anyway.
3068 unsigned MaskBits = AndMask.countTrailingOnes();
3069 EVT HalfVT = EVT::getIntegerVT(*DAG.getContext(), Size / 2);
3071 if (APIntOps::isMask(AndMask) &&
3072 // Required bits must not span the two halves of the integer and
3073 // must fit in the half size type.
3074 (ShiftBits + MaskBits <= Size / 2) &&
3075 TLI.isNarrowingProfitable(VT, HalfVT) &&
3076 TLI.isTypeDesirableForOp(ISD::AND, HalfVT) &&
3077 TLI.isTypeDesirableForOp(ISD::SRL, HalfVT) &&
3078 TLI.isTruncateFree(VT, HalfVT) &&
3079 TLI.isZExtFree(HalfVT, VT)) {
3080 // The isNarrowingProfitable is to avoid regressions on PPC and
3081 // AArch64 which match a few 64-bit bit insert / bit extract patterns
3082 // on downstream users of this. Those patterns could probably be
3083 // extended to handle extensions mixed in.
3086 assert(MaskBits <= Size);
3088 // Extracting the highest bit of the low half.
3089 EVT ShiftVT = TLI.getShiftAmountTy(HalfVT, DAG.getDataLayout());
3090 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, SL, HalfVT,
3093 SDValue NewMask = DAG.getConstant(AndMask.trunc(Size / 2), SL, HalfVT);
3094 SDValue ShiftK = DAG.getConstant(ShiftBits, SL, ShiftVT);
3095 SDValue Shift = DAG.getNode(ISD::SRL, SL, HalfVT, Trunc, ShiftK);
3096 SDValue And = DAG.getNode(ISD::AND, SL, HalfVT, Shift, NewMask);
3097 return DAG.getNode(ISD::ZERO_EXTEND, SL, VT, And);
3106 bool DAGCombiner::isAndLoadExtLoad(ConstantSDNode *AndC, LoadSDNode *LoadN,
3107 EVT LoadResultTy, EVT &ExtVT, EVT &LoadedVT,
3109 uint32_t ActiveBits = AndC->getAPIntValue().getActiveBits();
3111 if (ActiveBits == 0 || !APIntOps::isMask(ActiveBits, AndC->getAPIntValue()))
3114 ExtVT = EVT::getIntegerVT(*DAG.getContext(), ActiveBits);
3115 LoadedVT = LoadN->getMemoryVT();
3117 if (ExtVT == LoadedVT &&
3118 (!LegalOperations ||
3119 TLI.isLoadExtLegal(ISD::ZEXTLOAD, LoadResultTy, ExtVT))) {
3120 // ZEXTLOAD will match without needing to change the size of the value being
3126 // Do not change the width of a volatile load.
3127 if (LoadN->isVolatile())
3130 // Do not generate loads of non-round integer types since these can
3131 // be expensive (and would be wrong if the type is not byte sized).
3132 if (!LoadedVT.bitsGT(ExtVT) || !ExtVT.isRound())
3135 if (LegalOperations &&
3136 !TLI.isLoadExtLegal(ISD::ZEXTLOAD, LoadResultTy, ExtVT))
3139 if (!TLI.shouldReduceLoadWidth(LoadN, ISD::ZEXTLOAD, ExtVT))
3146 SDValue DAGCombiner::visitAND(SDNode *N) {
3147 SDValue N0 = N->getOperand(0);
3148 SDValue N1 = N->getOperand(1);
3149 EVT VT = N1.getValueType();
3156 if (VT.isVector()) {
3157 if (SDValue FoldedVOp = SimplifyVBinOp(N))
3160 // fold (and x, 0) -> 0, vector edition
3161 if (ISD::isBuildVectorAllZeros(N0.getNode()))
3162 // do not return N0, because undef node may exist in N0
3163 return DAG.getConstant(APInt::getNullValue(N0.getScalarValueSizeInBits()),
3164 SDLoc(N), N0.getValueType());
3165 if (ISD::isBuildVectorAllZeros(N1.getNode()))
3166 // do not return N1, because undef node may exist in N1
3167 return DAG.getConstant(APInt::getNullValue(N1.getScalarValueSizeInBits()),
3168 SDLoc(N), N1.getValueType());
3170 // fold (and x, -1) -> x, vector edition
3171 if (ISD::isBuildVectorAllOnes(N0.getNode()))
3173 if (ISD::isBuildVectorAllOnes(N1.getNode()))
3177 // fold (and c1, c2) -> c1&c2
3178 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
3179 ConstantSDNode *N1C = isConstOrConstSplat(N1);
3180 if (N0C && N1C && !N1C->isOpaque())
3181 return DAG.FoldConstantArithmetic(ISD::AND, SDLoc(N), VT, N0C, N1C);
3182 // canonicalize constant to RHS
3183 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
3184 !DAG.isConstantIntBuildVectorOrConstantInt(N1))
3185 return DAG.getNode(ISD::AND, SDLoc(N), VT, N1, N0);
3186 // fold (and x, -1) -> x
3187 if (isAllOnesConstant(N1))
3189 // if (and x, c) is known to be zero, return 0
3190 unsigned BitWidth = VT.getScalarSizeInBits();
3191 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0),
3192 APInt::getAllOnesValue(BitWidth)))
3193 return DAG.getConstant(0, SDLoc(N), VT);
3195 if (SDValue RAND = ReassociateOps(ISD::AND, SDLoc(N), N0, N1))
3197 // fold (and (or x, C), D) -> D if (C & D) == D
3198 if (N1C && N0.getOpcode() == ISD::OR)
3199 if (ConstantSDNode *ORI = isConstOrConstSplat(N0.getOperand(1)))
3200 if ((ORI->getAPIntValue() & N1C->getAPIntValue()) == N1C->getAPIntValue())
3202 // fold (and (any_ext V), c) -> (zero_ext V) if 'and' only clears top bits.
3203 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
3204 SDValue N0Op0 = N0.getOperand(0);
3205 APInt Mask = ~N1C->getAPIntValue();
3206 Mask = Mask.trunc(N0Op0.getScalarValueSizeInBits());
3207 if (DAG.MaskedValueIsZero(N0Op0, Mask)) {
3208 SDValue Zext = DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N),
3209 N0.getValueType(), N0Op0);
3211 // Replace uses of the AND with uses of the Zero extend node.
3214 // We actually want to replace all uses of the any_extend with the
3215 // zero_extend, to avoid duplicating things. This will later cause this
3216 // AND to be folded.
3217 CombineTo(N0.getNode(), Zext);
3218 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3221 // similarly fold (and (X (load ([non_ext|any_ext|zero_ext] V))), c) ->
3222 // (X (load ([non_ext|zero_ext] V))) if 'and' only clears top bits which must
3223 // already be zero by virtue of the width of the base type of the load.
3225 // the 'X' node here can either be nothing or an extract_vector_elt to catch
3227 if ((N0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
3228 N0.getValueSizeInBits() == N0.getOperand(0).getScalarValueSizeInBits() &&
3229 N0.getOperand(0).getOpcode() == ISD::LOAD &&
3230 N0.getOperand(0).getResNo() == 0) ||
3231 (N0.getOpcode() == ISD::LOAD && N0.getResNo() == 0)) {
3232 LoadSDNode *Load = cast<LoadSDNode>( (N0.getOpcode() == ISD::LOAD) ?
3233 N0 : N0.getOperand(0) );
3235 // Get the constant (if applicable) the zero'th operand is being ANDed with.
3236 // This can be a pure constant or a vector splat, in which case we treat the
3237 // vector as a scalar and use the splat value.
3238 APInt Constant = APInt::getNullValue(1);
3239 if (const ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
3240 Constant = C->getAPIntValue();
3241 } else if (BuildVectorSDNode *Vector = dyn_cast<BuildVectorSDNode>(N1)) {
3242 APInt SplatValue, SplatUndef;
3243 unsigned SplatBitSize;
3245 bool IsSplat = Vector->isConstantSplat(SplatValue, SplatUndef,
3246 SplatBitSize, HasAnyUndefs);
3248 // Undef bits can contribute to a possible optimisation if set, so
3250 SplatValue |= SplatUndef;
3252 // The splat value may be something like "0x00FFFFFF", which means 0 for
3253 // the first vector value and FF for the rest, repeating. We need a mask
3254 // that will apply equally to all members of the vector, so AND all the
3255 // lanes of the constant together.
3256 EVT VT = Vector->getValueType(0);
3257 unsigned BitWidth = VT.getScalarSizeInBits();
3259 // If the splat value has been compressed to a bitlength lower
3260 // than the size of the vector lane, we need to re-expand it to
3262 if (BitWidth > SplatBitSize)
3263 for (SplatValue = SplatValue.zextOrTrunc(BitWidth);
3264 SplatBitSize < BitWidth;
3265 SplatBitSize = SplatBitSize * 2)
3266 SplatValue |= SplatValue.shl(SplatBitSize);
3268 // Make sure that variable 'Constant' is only set if 'SplatBitSize' is a
3269 // multiple of 'BitWidth'. Otherwise, we could propagate a wrong value.
3270 if (SplatBitSize % BitWidth == 0) {
3271 Constant = APInt::getAllOnesValue(BitWidth);
3272 for (unsigned i = 0, n = SplatBitSize/BitWidth; i < n; ++i)
3273 Constant &= SplatValue.lshr(i*BitWidth).zextOrTrunc(BitWidth);
3278 // If we want to change an EXTLOAD to a ZEXTLOAD, ensure a ZEXTLOAD is
3279 // actually legal and isn't going to get expanded, else this is a false
3281 bool CanZextLoadProfitably = TLI.isLoadExtLegal(ISD::ZEXTLOAD,
3282 Load->getValueType(0),
3283 Load->getMemoryVT());
3285 // Resize the constant to the same size as the original memory access before
3286 // extension. If it is still the AllOnesValue then this AND is completely
3288 Constant = Constant.zextOrTrunc(Load->getMemoryVT().getScalarSizeInBits());
3291 switch (Load->getExtensionType()) {
3292 default: B = false; break;
3293 case ISD::EXTLOAD: B = CanZextLoadProfitably; break;
3295 case ISD::NON_EXTLOAD: B = true; break;
3298 if (B && Constant.isAllOnesValue()) {
3299 // If the load type was an EXTLOAD, convert to ZEXTLOAD in order to
3300 // preserve semantics once we get rid of the AND.
3301 SDValue NewLoad(Load, 0);
3302 if (Load->getExtensionType() == ISD::EXTLOAD) {
3303 NewLoad = DAG.getLoad(Load->getAddressingMode(), ISD::ZEXTLOAD,
3304 Load->getValueType(0), SDLoc(Load),
3305 Load->getChain(), Load->getBasePtr(),
3306 Load->getOffset(), Load->getMemoryVT(),
3307 Load->getMemOperand());
3308 // Replace uses of the EXTLOAD with the new ZEXTLOAD.
3309 if (Load->getNumValues() == 3) {
3310 // PRE/POST_INC loads have 3 values.
3311 SDValue To[] = { NewLoad.getValue(0), NewLoad.getValue(1),
3312 NewLoad.getValue(2) };
3313 CombineTo(Load, To, 3, true);
3315 CombineTo(Load, NewLoad.getValue(0), NewLoad.getValue(1));
3319 // Fold the AND away, taking care not to fold to the old load node if we
3321 CombineTo(N, (N0.getNode() == Load) ? NewLoad : N0);
3323 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3327 // fold (and (load x), 255) -> (zextload x, i8)
3328 // fold (and (extload x, i16), 255) -> (zextload x, i8)
3329 // fold (and (any_ext (extload x, i16)), 255) -> (zextload x, i8)
3330 if (!VT.isVector() && N1C && (N0.getOpcode() == ISD::LOAD ||
3331 (N0.getOpcode() == ISD::ANY_EXTEND &&
3332 N0.getOperand(0).getOpcode() == ISD::LOAD))) {
3333 bool HasAnyExt = N0.getOpcode() == ISD::ANY_EXTEND;
3334 LoadSDNode *LN0 = HasAnyExt
3335 ? cast<LoadSDNode>(N0.getOperand(0))
3336 : cast<LoadSDNode>(N0);
3337 if (LN0->getExtensionType() != ISD::SEXTLOAD &&
3338 LN0->isUnindexed() && N0.hasOneUse() && SDValue(LN0, 0).hasOneUse()) {
3339 auto NarrowLoad = false;
3340 EVT LoadResultTy = HasAnyExt ? LN0->getValueType(0) : VT;
3341 EVT ExtVT, LoadedVT;
3342 if (isAndLoadExtLoad(N1C, LN0, LoadResultTy, ExtVT, LoadedVT,
3346 DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(LN0), LoadResultTy,
3347 LN0->getChain(), LN0->getBasePtr(), ExtVT,
3348 LN0->getMemOperand());
3350 CombineTo(LN0, NewLoad, NewLoad.getValue(1));
3351 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3353 EVT PtrType = LN0->getOperand(1).getValueType();
3355 unsigned Alignment = LN0->getAlignment();
3356 SDValue NewPtr = LN0->getBasePtr();
3358 // For big endian targets, we need to add an offset to the pointer
3359 // to load the correct bytes. For little endian systems, we merely
3360 // need to read fewer bytes from the same pointer.
3361 if (DAG.getDataLayout().isBigEndian()) {
3362 unsigned LVTStoreBytes = LoadedVT.getStoreSize();
3363 unsigned EVTStoreBytes = ExtVT.getStoreSize();
3364 unsigned PtrOff = LVTStoreBytes - EVTStoreBytes;
3366 NewPtr = DAG.getNode(ISD::ADD, DL, PtrType,
3367 NewPtr, DAG.getConstant(PtrOff, DL, PtrType));
3368 Alignment = MinAlign(Alignment, PtrOff);
3371 AddToWorklist(NewPtr.getNode());
3373 SDValue Load = DAG.getExtLoad(
3374 ISD::ZEXTLOAD, SDLoc(LN0), LoadResultTy, LN0->getChain(), NewPtr,
3375 LN0->getPointerInfo(), ExtVT, Alignment,
3376 LN0->getMemOperand()->getFlags(), LN0->getAAInfo());
3378 CombineTo(LN0, Load, Load.getValue(1));
3379 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3385 if (SDValue Combined = visitANDLike(N0, N1, N))
3388 // Simplify: (and (op x...), (op y...)) -> (op (and x, y))
3389 if (N0.getOpcode() == N1.getOpcode())
3390 if (SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N))
3393 // Masking the negated extension of a boolean is just the zero-extended
3395 // and (sub 0, zext(bool X)), 1 --> zext(bool X)
3396 // and (sub 0, sext(bool X)), 1 --> zext(bool X)
3398 // Note: the SimplifyDemandedBits fold below can make an information-losing
3399 // transform, and then we have no way to find this better fold.
3400 if (N1C && N1C->isOne() && N0.getOpcode() == ISD::SUB) {
3401 ConstantSDNode *SubLHS = isConstOrConstSplat(N0.getOperand(0));
3402 SDValue SubRHS = N0.getOperand(1);
3403 if (SubLHS && SubLHS->isNullValue()) {
3404 if (SubRHS.getOpcode() == ISD::ZERO_EXTEND &&
3405 SubRHS.getOperand(0).getScalarValueSizeInBits() == 1)
3407 if (SubRHS.getOpcode() == ISD::SIGN_EXTEND &&
3408 SubRHS.getOperand(0).getScalarValueSizeInBits() == 1)
3409 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N), VT, SubRHS.getOperand(0));
3413 // fold (and (sign_extend_inreg x, i16 to i32), 1) -> (and x, 1)
3414 // fold (and (sra)) -> (and (srl)) when possible.
3415 if (!VT.isVector() && SimplifyDemandedBits(SDValue(N, 0)))
3416 return SDValue(N, 0);
3418 // fold (zext_inreg (extload x)) -> (zextload x)
3419 if (ISD::isEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode())) {
3420 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
3421 EVT MemVT = LN0->getMemoryVT();
3422 // If we zero all the possible extended bits, then we can turn this into
3423 // a zextload if we are running before legalize or the operation is legal.
3424 unsigned BitWidth = N1.getScalarValueSizeInBits();
3425 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth,
3426 BitWidth - MemVT.getScalarSizeInBits())) &&
3427 ((!LegalOperations && !LN0->isVolatile()) ||
3428 TLI.isLoadExtLegal(ISD::ZEXTLOAD, VT, MemVT))) {
3429 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(N0), VT,
3430 LN0->getChain(), LN0->getBasePtr(),
3431 MemVT, LN0->getMemOperand());
3433 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
3434 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3437 // fold (zext_inreg (sextload x)) -> (zextload x) iff load has one use
3438 if (ISD::isSEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
3440 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
3441 EVT MemVT = LN0->getMemoryVT();
3442 // If we zero all the possible extended bits, then we can turn this into
3443 // a zextload if we are running before legalize or the operation is legal.
3444 unsigned BitWidth = N1.getScalarValueSizeInBits();
3445 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth,
3446 BitWidth - MemVT.getScalarSizeInBits())) &&
3447 ((!LegalOperations && !LN0->isVolatile()) ||
3448 TLI.isLoadExtLegal(ISD::ZEXTLOAD, VT, MemVT))) {
3449 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(N0), VT,
3450 LN0->getChain(), LN0->getBasePtr(),
3451 MemVT, LN0->getMemOperand());
3453 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
3454 return SDValue(N, 0); // Return N so it doesn't get rechecked!
3457 // fold (and (or (srl N, 8), (shl N, 8)), 0xffff) -> (srl (bswap N), const)
3458 if (N1C && N1C->getAPIntValue() == 0xffff && N0.getOpcode() == ISD::OR) {
3459 if (SDValue BSwap = MatchBSwapHWordLow(N0.getNode(), N0.getOperand(0),
3460 N0.getOperand(1), false))
3467 /// Match (a >> 8) | (a << 8) as (bswap a) >> 16.
3468 SDValue DAGCombiner::MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
3469 bool DemandHighBits) {
3470 if (!LegalOperations)
3473 EVT VT = N->getValueType(0);
3474 if (VT != MVT::i64 && VT != MVT::i32 && VT != MVT::i16)
3476 if (!TLI.isOperationLegal(ISD::BSWAP, VT))
3479 // Recognize (and (shl a, 8), 0xff), (and (srl a, 8), 0xff00)
3480 bool LookPassAnd0 = false;
3481 bool LookPassAnd1 = false;
3482 if (N0.getOpcode() == ISD::AND && N0.getOperand(0).getOpcode() == ISD::SRL)
3484 if (N1.getOpcode() == ISD::AND && N1.getOperand(0).getOpcode() == ISD::SHL)
3486 if (N0.getOpcode() == ISD::AND) {
3487 if (!N0.getNode()->hasOneUse())
3489 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3490 if (!N01C || N01C->getZExtValue() != 0xFF00)
3492 N0 = N0.getOperand(0);
3493 LookPassAnd0 = true;
3496 if (N1.getOpcode() == ISD::AND) {
3497 if (!N1.getNode()->hasOneUse())
3499 ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
3500 if (!N11C || N11C->getZExtValue() != 0xFF)
3502 N1 = N1.getOperand(0);
3503 LookPassAnd1 = true;
3506 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL)
3508 if (N0.getOpcode() != ISD::SHL || N1.getOpcode() != ISD::SRL)
3510 if (!N0.getNode()->hasOneUse() || !N1.getNode()->hasOneUse())
3513 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3514 ConstantSDNode *N11C = dyn_cast<ConstantSDNode>(N1.getOperand(1));
3517 if (N01C->getZExtValue() != 8 || N11C->getZExtValue() != 8)
3520 // Look for (shl (and a, 0xff), 8), (srl (and a, 0xff00), 8)
3521 SDValue N00 = N0->getOperand(0);
3522 if (!LookPassAnd0 && N00.getOpcode() == ISD::AND) {
3523 if (!N00.getNode()->hasOneUse())
3525 ConstantSDNode *N001C = dyn_cast<ConstantSDNode>(N00.getOperand(1));
3526 if (!N001C || N001C->getZExtValue() != 0xFF)
3528 N00 = N00.getOperand(0);
3529 LookPassAnd0 = true;
3532 SDValue N10 = N1->getOperand(0);
3533 if (!LookPassAnd1 && N10.getOpcode() == ISD::AND) {
3534 if (!N10.getNode()->hasOneUse())
3536 ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N10.getOperand(1));
3537 if (!N101C || N101C->getZExtValue() != 0xFF00)
3539 N10 = N10.getOperand(0);
3540 LookPassAnd1 = true;
3546 // Make sure everything beyond the low halfword gets set to zero since the SRL
3547 // 16 will clear the top bits.
3548 unsigned OpSizeInBits = VT.getSizeInBits();
3549 if (DemandHighBits && OpSizeInBits > 16) {
3550 // If the left-shift isn't masked out then the only way this is a bswap is
3551 // if all bits beyond the low 8 are 0. In that case the entire pattern
3552 // reduces to a left shift anyway: leave it for other parts of the combiner.
3556 // However, if the right shift isn't masked out then it might be because
3557 // it's not needed. See if we can spot that too.
3558 if (!LookPassAnd1 &&
3559 !DAG.MaskedValueIsZero(
3560 N10, APInt::getHighBitsSet(OpSizeInBits, OpSizeInBits - 16)))
3564 SDValue Res = DAG.getNode(ISD::BSWAP, SDLoc(N), VT, N00);
3565 if (OpSizeInBits > 16) {
3567 Res = DAG.getNode(ISD::SRL, DL, VT, Res,
3568 DAG.getConstant(OpSizeInBits - 16, DL,
3569 getShiftAmountTy(VT)));
3574 /// Return true if the specified node is an element that makes up a 32-bit
3575 /// packed halfword byteswap.
3576 /// ((x & 0x000000ff) << 8) |
3577 /// ((x & 0x0000ff00) >> 8) |
3578 /// ((x & 0x00ff0000) << 8) |
3579 /// ((x & 0xff000000) >> 8)
3580 static bool isBSwapHWordElement(SDValue N, MutableArrayRef<SDNode *> Parts) {
3581 if (!N.getNode()->hasOneUse())
3584 unsigned Opc = N.getOpcode();
3585 if (Opc != ISD::AND && Opc != ISD::SHL && Opc != ISD::SRL)
3588 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N.getOperand(1));
3593 switch (N1C->getZExtValue()) {
3596 case 0xFF: Num = 0; break;
3597 case 0xFF00: Num = 1; break;
3598 case 0xFF0000: Num = 2; break;
3599 case 0xFF000000: Num = 3; break;
3602 // Look for (x & 0xff) << 8 as well as ((x << 8) & 0xff00).
3603 SDValue N0 = N.getOperand(0);
3604 if (Opc == ISD::AND) {
3605 if (Num == 0 || Num == 2) {
3607 // (x >> 8) & 0xff0000
3608 if (N0.getOpcode() != ISD::SRL)
3610 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3611 if (!C || C->getZExtValue() != 8)
3614 // (x << 8) & 0xff00
3615 // (x << 8) & 0xff000000
3616 if (N0.getOpcode() != ISD::SHL)
3618 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N0.getOperand(1));
3619 if (!C || C->getZExtValue() != 8)
3622 } else if (Opc == ISD::SHL) {
3624 // (x & 0xff0000) << 8
3625 if (Num != 0 && Num != 2)
3627 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N.getOperand(1));
3628 if (!C || C->getZExtValue() != 8)
3630 } else { // Opc == ISD::SRL
3631 // (x & 0xff00) >> 8
3632 // (x & 0xff000000) >> 8
3633 if (Num != 1 && Num != 3)
3635 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N.getOperand(1));
3636 if (!C || C->getZExtValue() != 8)
3643 Parts[Num] = N0.getOperand(0).getNode();
3647 /// Match a 32-bit packed halfword bswap. That is
3648 /// ((x & 0x000000ff) << 8) |
3649 /// ((x & 0x0000ff00) >> 8) |
3650 /// ((x & 0x00ff0000) << 8) |
3651 /// ((x & 0xff000000) >> 8)
3652 /// => (rotl (bswap x), 16)
3653 SDValue DAGCombiner::MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1) {
3654 if (!LegalOperations)
3657 EVT VT = N->getValueType(0);
3660 if (!TLI.isOperationLegal(ISD::BSWAP, VT))
3664 // (or (or (and), (and)), (or (and), (and)))
3665 // (or (or (or (and), (and)), (and)), (and))
3666 if (N0.getOpcode() != ISD::OR)
3668 SDValue N00 = N0.getOperand(0);
3669 SDValue N01 = N0.getOperand(1);
3670 SDNode *Parts[4] = {};
3672 if (N1.getOpcode() == ISD::OR &&
3673 N00.getNumOperands() == 2 && N01.getNumOperands() == 2) {
3674 // (or (or (and), (and)), (or (and), (and)))
3675 SDValue N000 = N00.getOperand(0);
3676 if (!isBSwapHWordElement(N000, Parts))
3679 SDValue N001 = N00.getOperand(1);
3680 if (!isBSwapHWordElement(N001, Parts))
3682 SDValue N010 = N01.getOperand(0);
3683 if (!isBSwapHWordElement(N010, Parts))
3685 SDValue N011 = N01.getOperand(1);
3686 if (!isBSwapHWordElement(N011, Parts))
3689 // (or (or (or (and), (and)), (and)), (and))
3690 if (!isBSwapHWordElement(N1, Parts))
3692 if (!isBSwapHWordElement(N01, Parts))
3694 if (N00.getOpcode() != ISD::OR)
3696 SDValue N000 = N00.getOperand(0);
3697 if (!isBSwapHWordElement(N000, Parts))
3699 SDValue N001 = N00.getOperand(1);
3700 if (!isBSwapHWordElement(N001, Parts))
3704 // Make sure the parts are all coming from the same node.
3705 if (Parts[0] != Parts[1] || Parts[0] != Parts[2] || Parts[0] != Parts[3])
3709 SDValue BSwap = DAG.getNode(ISD::BSWAP, DL, VT,
3710 SDValue(Parts[0], 0));
3712 // Result of the bswap should be rotated by 16. If it's not legal, then
3713 // do (x << 16) | (x >> 16).
3714 SDValue ShAmt = DAG.getConstant(16, DL, getShiftAmountTy(VT));
3715 if (TLI.isOperationLegalOrCustom(ISD::ROTL, VT))
3716 return DAG.getNode(ISD::ROTL, DL, VT, BSwap, ShAmt);
3717 if (TLI.isOperationLegalOrCustom(ISD::ROTR, VT))
3718 return DAG.getNode(ISD::ROTR, DL, VT, BSwap, ShAmt);
3719 return DAG.getNode(ISD::OR, DL, VT,
3720 DAG.getNode(ISD::SHL, DL, VT, BSwap, ShAmt),
3721 DAG.getNode(ISD::SRL, DL, VT, BSwap, ShAmt));
3724 /// This contains all DAGCombine rules which reduce two values combined by
3725 /// an Or operation to a single value \see visitANDLike().
3726 SDValue DAGCombiner::visitORLike(SDValue N0, SDValue N1, SDNode *LocReference) {
3727 EVT VT = N1.getValueType();
3728 // fold (or x, undef) -> -1
3729 if (!LegalOperations &&
3730 (N0.isUndef() || N1.isUndef())) {
3731 EVT EltVT = VT.isVector() ? VT.getVectorElementType() : VT;
3732 return DAG.getConstant(APInt::getAllOnesValue(EltVT.getSizeInBits()),
3733 SDLoc(LocReference), VT);
3735 // fold (or (setcc x), (setcc y)) -> (setcc (or x, y))
3736 SDValue LL, LR, RL, RR, CC0, CC1;
3737 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
3738 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get();
3739 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get();
3741 if (LR == RR && Op0 == Op1 && LL.getValueType().isInteger()) {
3742 // fold (or (setne X, 0), (setne Y, 0)) -> (setne (or X, Y), 0)
3743 // fold (or (setlt X, 0), (setlt Y, 0)) -> (setne (or X, Y), 0)
3744 if (isNullConstant(LR) && (Op1 == ISD::SETNE || Op1 == ISD::SETLT)) {
3745 EVT CCVT = getSetCCResultType(LR.getValueType());
3746 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
3747 SDValue ORNode = DAG.getNode(ISD::OR, SDLoc(LR),
3748 LR.getValueType(), LL, RL);
3749 AddToWorklist(ORNode.getNode());
3750 return DAG.getSetCC(SDLoc(LocReference), VT, ORNode, LR, Op1);
3753 // fold (or (setne X, -1), (setne Y, -1)) -> (setne (and X, Y), -1)
3754 // fold (or (setgt X, -1), (setgt Y -1)) -> (setgt (and X, Y), -1)
3755 if (isAllOnesConstant(LR) && (Op1 == ISD::SETNE || Op1 == ISD::SETGT)) {
3756 EVT CCVT = getSetCCResultType(LR.getValueType());
3757 if (VT == CCVT || (!LegalOperations && VT == MVT::i1)) {
3758 SDValue ANDNode = DAG.getNode(ISD::AND, SDLoc(LR),
3759 LR.getValueType(), LL, RL);
3760 AddToWorklist(ANDNode.getNode());
3761 return DAG.getSetCC(SDLoc(LocReference), VT, ANDNode, LR, Op1);
3765 // canonicalize equivalent to ll == rl
3766 if (LL == RR && LR == RL) {
3767 Op1 = ISD::getSetCCSwappedOperands(Op1);
3770 if (LL == RL && LR == RR) {
3771 bool isInteger = LL.getValueType().isInteger();
3772 ISD::CondCode Result = ISD::getSetCCOrOperation(Op0, Op1, isInteger);
3773 if (Result != ISD::SETCC_INVALID &&
3774 (!LegalOperations ||
3775 (TLI.isCondCodeLegal(Result, LL.getSimpleValueType()) &&
3776 TLI.isOperationLegal(ISD::SETCC, LL.getValueType())))) {
3777 EVT CCVT = getSetCCResultType(LL.getValueType());
3778 if (N0.getValueType() == CCVT ||
3779 (!LegalOperations && N0.getValueType() == MVT::i1))
3780 return DAG.getSetCC(SDLoc(LocReference), N0.getValueType(),
3786 // (or (and X, C1), (and Y, C2)) -> (and (or X, Y), C3) if possible.
3787 if (N0.getOpcode() == ISD::AND && N1.getOpcode() == ISD::AND &&
3788 // Don't increase # computations.
3789 (N0.getNode()->hasOneUse() || N1.getNode()->hasOneUse())) {
3790 // We can only do this xform if we know that bits from X that are set in C2
3791 // but not in C1 are already zero. Likewise for Y.
3792 if (const ConstantSDNode *N0O1C =
3793 getAsNonOpaqueConstant(N0.getOperand(1))) {
3794 if (const ConstantSDNode *N1O1C =
3795 getAsNonOpaqueConstant(N1.getOperand(1))) {
3796 // We can only do this xform if we know that bits from X that are set in
3797 // C2 but not in C1 are already zero. Likewise for Y.
3798 const APInt &LHSMask = N0O1C->getAPIntValue();
3799 const APInt &RHSMask = N1O1C->getAPIntValue();
3801 if (DAG.MaskedValueIsZero(N0.getOperand(0), RHSMask&~LHSMask) &&
3802 DAG.MaskedValueIsZero(N1.getOperand(0), LHSMask&~RHSMask)) {
3803 SDValue X = DAG.getNode(ISD::OR, SDLoc(N0), VT,
3804 N0.getOperand(0), N1.getOperand(0));
3805 SDLoc DL(LocReference);
3806 return DAG.getNode(ISD::AND, DL, VT, X,
3807 DAG.getConstant(LHSMask | RHSMask, DL, VT));
3813 // (or (and X, M), (and X, N)) -> (and X, (or M, N))
3814 if (N0.getOpcode() == ISD::AND &&
3815 N1.getOpcode() == ISD::AND &&
3816 N0.getOperand(0) == N1.getOperand(0) &&
3817 // Don't increase # computations.
3818 (N0.getNode()->hasOneUse() || N1.getNode()->hasOneUse())) {
3819 SDValue X = DAG.getNode(ISD::OR, SDLoc(N0), VT,
3820 N0.getOperand(1), N1.getOperand(1));
3821 return DAG.getNode(ISD::AND, SDLoc(LocReference), VT, N0.getOperand(0), X);
3827 SDValue DAGCombiner::visitOR(SDNode *N) {
3828 SDValue N0 = N->getOperand(0);
3829 SDValue N1 = N->getOperand(1);
3830 EVT VT = N1.getValueType();
3837 if (VT.isVector()) {
3838 if (SDValue FoldedVOp = SimplifyVBinOp(N))
3841 // fold (or x, 0) -> x, vector edition
3842 if (ISD::isBuildVectorAllZeros(N0.getNode()))
3844 if (ISD::isBuildVectorAllZeros(N1.getNode()))
3847 // fold (or x, -1) -> -1, vector edition
3848 if (ISD::isBuildVectorAllOnes(N0.getNode()))
3849 // do not return N0, because undef node may exist in N0
3850 return DAG.getConstant(
3851 APInt::getAllOnesValue(N0.getScalarValueSizeInBits()), SDLoc(N),
3853 if (ISD::isBuildVectorAllOnes(N1.getNode()))
3854 // do not return N1, because undef node may exist in N1
3855 return DAG.getConstant(
3856 APInt::getAllOnesValue(N1.getScalarValueSizeInBits()), SDLoc(N),
3859 // fold (or (shuf A, V_0, MA), (shuf B, V_0, MB)) -> (shuf A, B, Mask)
3860 // Do this only if the resulting shuffle is legal.
3861 if (isa<ShuffleVectorSDNode>(N0) &&
3862 isa<ShuffleVectorSDNode>(N1) &&
3863 // Avoid folding a node with illegal type.
3864 TLI.isTypeLegal(VT)) {
3865 bool ZeroN00 = ISD::isBuildVectorAllZeros(N0.getOperand(0).getNode());
3866 bool ZeroN01 = ISD::isBuildVectorAllZeros(N0.getOperand(1).getNode());
3867 bool ZeroN10 = ISD::isBuildVectorAllZeros(N1.getOperand(0).getNode());
3868 bool ZeroN11 = ISD::isBuildVectorAllZeros(N1.getOperand(1).getNode());
3869 // Ensure both shuffles have a zero input.
3870 if ((ZeroN00 || ZeroN01) && (ZeroN10 || ZeroN11)) {
3871 assert((!ZeroN00 || !ZeroN01) && "Both inputs zero!");
3872 assert((!ZeroN10 || !ZeroN11) && "Both inputs zero!");
3873 const ShuffleVectorSDNode *SV0 = cast<ShuffleVectorSDNode>(N0);
3874 const ShuffleVectorSDNode *SV1 = cast<ShuffleVectorSDNode>(N1);
3875 bool CanFold = true;
3876 int NumElts = VT.getVectorNumElements();
3877 SmallVector<int, 4> Mask(NumElts);
3879 for (int i = 0; i != NumElts; ++i) {
3880 int M0 = SV0->getMaskElt(i);
3881 int M1 = SV1->getMaskElt(i);
3883 // Determine if either index is pointing to a zero vector.
3884 bool M0Zero = M0 < 0 || (ZeroN00 == (M0 < NumElts));
3885 bool M1Zero = M1 < 0 || (ZeroN10 == (M1 < NumElts));
3887 // If one element is zero and the otherside is undef, keep undef.
3888 // This also handles the case that both are undef.
3889 if ((M0Zero && M1 < 0) || (M1Zero && M0 < 0)) {
3894 // Make sure only one of the elements is zero.
3895 if (M0Zero == M1Zero) {
3900 assert((M0 >= 0 || M1 >= 0) && "Undef index!");
3902 // We have a zero and non-zero element. If the non-zero came from
3903 // SV0 make the index a LHS index. If it came from SV1, make it
3904 // a RHS index. We need to mod by NumElts because we don't care
3905 // which operand it came from in the original shuffles.
3906 Mask[i] = M1Zero ? M0 % NumElts : (M1 % NumElts) + NumElts;
3910 SDValue NewLHS = ZeroN00 ? N0.getOperand(1) : N0.getOperand(0);
3911 SDValue NewRHS = ZeroN10 ? N1.getOperand(1) : N1.getOperand(0);
3913 bool LegalMask = TLI.isShuffleMaskLegal(Mask, VT);
3915 std::swap(NewLHS, NewRHS);
3916 ShuffleVectorSDNode::commuteMask(Mask);
3917 LegalMask = TLI.isShuffleMaskLegal(Mask, VT);
3921 return DAG.getVectorShuffle(VT, SDLoc(N), NewLHS, NewRHS, Mask);
3927 // fold (or c1, c2) -> c1|c2
3928 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
3929 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1);
3930 if (N0C && N1C && !N1C->isOpaque())
3931 return DAG.FoldConstantArithmetic(ISD::OR, SDLoc(N), VT, N0C, N1C);
3932 // canonicalize constant to RHS
3933 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
3934 !DAG.isConstantIntBuildVectorOrConstantInt(N1))
3935 return DAG.getNode(ISD::OR, SDLoc(N), VT, N1, N0);
3936 // fold (or x, 0) -> x
3937 if (isNullConstant(N1))
3939 // fold (or x, -1) -> -1
3940 if (isAllOnesConstant(N1))
3942 // fold (or x, c) -> c iff (x & ~c) == 0
3943 if (N1C && DAG.MaskedValueIsZero(N0, ~N1C->getAPIntValue()))
3946 if (SDValue Combined = visitORLike(N0, N1, N))
3949 // Recognize halfword bswaps as (bswap + rotl 16) or (bswap + shl 16)
3950 if (SDValue BSwap = MatchBSwapHWord(N, N0, N1))
3952 if (SDValue BSwap = MatchBSwapHWordLow(N, N0, N1))
3956 if (SDValue ROR = ReassociateOps(ISD::OR, SDLoc(N), N0, N1))
3958 // Canonicalize (or (and X, c1), c2) -> (and (or X, c2), c1|c2)
3959 // iff (c1 & c2) == 0.
3960 if (N1C && N0.getOpcode() == ISD::AND && N0.getNode()->hasOneUse() &&
3961 isa<ConstantSDNode>(N0.getOperand(1))) {
3962 ConstantSDNode *C1 = cast<ConstantSDNode>(N0.getOperand(1));
3963 if ((C1->getAPIntValue() & N1C->getAPIntValue()) != 0) {
3964 if (SDValue COR = DAG.FoldConstantArithmetic(ISD::OR, SDLoc(N1), VT,
3967 ISD::AND, SDLoc(N), VT,
3968 DAG.getNode(ISD::OR, SDLoc(N0), VT, N0.getOperand(0), N1), COR);
3972 // Simplify: (or (op x...), (op y...)) -> (op (or x, y))
3973 if (N0.getOpcode() == N1.getOpcode())
3974 if (SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N))
3977 // See if this is some rotate idiom.
3978 if (SDNode *Rot = MatchRotate(N0, N1, SDLoc(N)))
3979 return SDValue(Rot, 0);
3981 // Simplify the operands using demanded-bits information.
3982 if (!VT.isVector() &&
3983 SimplifyDemandedBits(SDValue(N, 0)))
3984 return SDValue(N, 0);
3989 /// Match "(X shl/srl V1) & V2" where V2 may not be present.
3990 bool DAGCombiner::MatchRotateHalf(SDValue Op, SDValue &Shift, SDValue &Mask) {
3991 if (Op.getOpcode() == ISD::AND) {
3992 if (DAG.isConstantIntBuildVectorOrConstantInt(Op.getOperand(1))) {
3993 Mask = Op.getOperand(1);
3994 Op = Op.getOperand(0);
4000 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SHL) {
4008 // Return true if we can prove that, whenever Neg and Pos are both in the
4009 // range [0, EltSize), Neg == (Pos == 0 ? 0 : EltSize - Pos). This means that
4010 // for two opposing shifts shift1 and shift2 and a value X with OpBits bits:
4012 // (or (shift1 X, Neg), (shift2 X, Pos))
4014 // reduces to a rotate in direction shift2 by Pos or (equivalently) a rotate
4015 // in direction shift1 by Neg. The range [0, EltSize) means that we only need
4016 // to consider shift amounts with defined behavior.
4017 static bool matchRotateSub(SDValue Pos, SDValue Neg, unsigned EltSize) {
4018 // If EltSize is a power of 2 then:
4020 // (a) (Pos == 0 ? 0 : EltSize - Pos) == (EltSize - Pos) & (EltSize - 1)
4021 // (b) Neg == Neg & (EltSize - 1) whenever Neg is in [0, EltSize).
4023 // So if EltSize is a power of 2 and Neg is (and Neg', EltSize-1), we check
4024 // for the stronger condition:
4026 // Neg & (EltSize - 1) == (EltSize - Pos) & (EltSize - 1) [A]
4028 // for all Neg and Pos. Since Neg & (EltSize - 1) == Neg' & (EltSize - 1)
4029 // we can just replace Neg with Neg' for the rest of the function.
4031 // In other cases we check for the even stronger condition:
4033 // Neg == EltSize - Pos [B]
4035 // for all Neg and Pos. Note that the (or ...) then invokes undefined
4036 // behavior if Pos == 0 (and consequently Neg == EltSize).
4038 // We could actually use [A] whenever EltSize is a power of 2, but the
4039 // only extra cases that it would match are those uninteresting ones
4040 // where Neg and Pos are never in range at the same time. E.g. for
4041 // EltSize == 32, using [A] would allow a Neg of the form (sub 64, Pos)
4042 // as well as (sub 32, Pos), but:
4044 // (or (shift1 X, (sub 64, Pos)), (shift2 X, Pos))
4046 // always invokes undefined behavior for 32-bit X.
4048 // Below, Mask == EltSize - 1 when using [A] and is all-ones otherwise.
4049 unsigned MaskLoBits = 0;
4050 if (Neg.getOpcode() == ISD::AND && isPowerOf2_64(EltSize)) {
4051 if (ConstantSDNode *NegC = isConstOrConstSplat(Neg.getOperand(1))) {
4052 if (NegC->getAPIntValue() == EltSize - 1) {
4053 Neg = Neg.getOperand(0);
4054 MaskLoBits = Log2_64(EltSize);
4059 // Check whether Neg has the form (sub NegC, NegOp1) for some NegC and NegOp1.
4060 if (Neg.getOpcode() != ISD::SUB)
4062 ConstantSDNode *NegC = isConstOrConstSplat(Neg.getOperand(0));
4065 SDValue NegOp1 = Neg.getOperand(1);
4067 // On the RHS of [A], if Pos is Pos' & (EltSize - 1), just replace Pos with
4068 // Pos'. The truncation is redundant for the purpose of the equality.
4069 if (MaskLoBits && Pos.getOpcode() == ISD::AND)
4070 if (ConstantSDNode *PosC = isConstOrConstSplat(Pos.getOperand(1)))
4071 if (PosC->getAPIntValue() == EltSize - 1)
4072 Pos = Pos.getOperand(0);
4074 // The condition we need is now:
4076 // (NegC - NegOp1) & Mask == (EltSize - Pos) & Mask
4078 // If NegOp1 == Pos then we need:
4080 // EltSize & Mask == NegC & Mask
4082 // (because "x & Mask" is a truncation and distributes through subtraction).
4085 Width = NegC->getAPIntValue();
4087 // Check for cases where Pos has the form (add NegOp1, PosC) for some PosC.
4088 // Then the condition we want to prove becomes:
4090 // (NegC - NegOp1) & Mask == (EltSize - (NegOp1 + PosC)) & Mask
4092 // which, again because "x & Mask" is a truncation, becomes:
4094 // NegC & Mask == (EltSize - PosC) & Mask
4095 // EltSize & Mask == (NegC + PosC) & Mask
4096 else if (Pos.getOpcode() == ISD::ADD && Pos.getOperand(0) == NegOp1) {
4097 if (ConstantSDNode *PosC = isConstOrConstSplat(Pos.getOperand(1)))
4098 Width = PosC->getAPIntValue() + NegC->getAPIntValue();
4104 // Now we just need to check that EltSize & Mask == Width & Mask.
4106 // EltSize & Mask is 0 since Mask is EltSize - 1.
4107 return Width.getLoBits(MaskLoBits) == 0;
4108 return Width == EltSize;
4111 // A subroutine of MatchRotate used once we have found an OR of two opposite
4112 // shifts of Shifted. If Neg == <operand size> - Pos then the OR reduces
4113 // to both (PosOpcode Shifted, Pos) and (NegOpcode Shifted, Neg), with the
4114 // former being preferred if supported. InnerPos and InnerNeg are Pos and
4115 // Neg with outer conversions stripped away.
4116 SDNode *DAGCombiner::MatchRotatePosNeg(SDValue Shifted, SDValue Pos,
4117 SDValue Neg, SDValue InnerPos,
4118 SDValue InnerNeg, unsigned PosOpcode,
4119 unsigned NegOpcode, const SDLoc &DL) {
4120 // fold (or (shl x, (*ext y)),
4121 // (srl x, (*ext (sub 32, y)))) ->
4122 // (rotl x, y) or (rotr x, (sub 32, y))
4124 // fold (or (shl x, (*ext (sub 32, y))),
4125 // (srl x, (*ext y))) ->
4126 // (rotr x, y) or (rotl x, (sub 32, y))
4127 EVT VT = Shifted.getValueType();
4128 if (matchRotateSub(InnerPos, InnerNeg, VT.getScalarSizeInBits())) {
4129 bool HasPos = TLI.isOperationLegalOrCustom(PosOpcode, VT);
4130 return DAG.getNode(HasPos ? PosOpcode : NegOpcode, DL, VT, Shifted,
4131 HasPos ? Pos : Neg).getNode();
4137 // MatchRotate - Handle an 'or' of two operands. If this is one of the many
4138 // idioms for rotate, and if the target supports rotation instructions, generate
4140 SDNode *DAGCombiner::MatchRotate(SDValue LHS, SDValue RHS, const SDLoc &DL) {
4141 // Must be a legal type. Expanded 'n promoted things won't work with rotates.
4142 EVT VT = LHS.getValueType();
4143 if (!TLI.isTypeLegal(VT)) return nullptr;
4145 // The target must have at least one rotate flavor.
4146 bool HasROTL = TLI.isOperationLegalOrCustom(ISD::ROTL, VT);
4147 bool HasROTR = TLI.isOperationLegalOrCustom(ISD::ROTR, VT);
4148 if (!HasROTL && !HasROTR) return nullptr;
4150 // Match "(X shl/srl V1) & V2" where V2 may not be present.
4151 SDValue LHSShift; // The shift.
4152 SDValue LHSMask; // AND value if any.
4153 if (!MatchRotateHalf(LHS, LHSShift, LHSMask))
4154 return nullptr; // Not part of a rotate.
4156 SDValue RHSShift; // The shift.
4157 SDValue RHSMask; // AND value if any.
4158 if (!MatchRotateHalf(RHS, RHSShift, RHSMask))
4159 return nullptr; // Not part of a rotate.
4161 if (LHSShift.getOperand(0) != RHSShift.getOperand(0))
4162 return nullptr; // Not shifting the same value.
4164 if (LHSShift.getOpcode() == RHSShift.getOpcode())
4165 return nullptr; // Shifts must disagree.
4167 // Canonicalize shl to left side in a shl/srl pair.
4168 if (RHSShift.getOpcode() == ISD::SHL) {
4169 std::swap(LHS, RHS);
4170 std::swap(LHSShift, RHSShift);
4171 std::swap(LHSMask, RHSMask);
4174 unsigned EltSizeInBits = VT.getScalarSizeInBits();
4175 SDValue LHSShiftArg = LHSShift.getOperand(0);
4176 SDValue LHSShiftAmt = LHSShift.getOperand(1);
4177 SDValue RHSShiftArg = RHSShift.getOperand(0);
4178 SDValue RHSShiftAmt = RHSShift.getOperand(1);
4180 // fold (or (shl x, C1), (srl x, C2)) -> (rotl x, C1)
4181 // fold (or (shl x, C1), (srl x, C2)) -> (rotr x, C2)
4182 if (isConstOrConstSplat(LHSShiftAmt) && isConstOrConstSplat(RHSShiftAmt)) {
4183 uint64_t LShVal = isConstOrConstSplat(LHSShiftAmt)->getZExtValue();
4184 uint64_t RShVal = isConstOrConstSplat(RHSShiftAmt)->getZExtValue();
4185 if ((LShVal + RShVal) != EltSizeInBits)
4188 SDValue Rot = DAG.getNode(HasROTL ? ISD::ROTL : ISD::ROTR, DL, VT,
4189 LHSShiftArg, HasROTL ? LHSShiftAmt : RHSShiftAmt);
4191 // If there is an AND of either shifted operand, apply it to the result.
4192 if (LHSMask.getNode() || RHSMask.getNode()) {
4193 APInt AllBits = APInt::getAllOnesValue(EltSizeInBits);
4194 SDValue Mask = DAG.getConstant(AllBits, DL, VT);
4196 if (LHSMask.getNode()) {
4197 APInt RHSBits = APInt::getLowBitsSet(EltSizeInBits, LShVal);
4198 Mask = DAG.getNode(ISD::AND, DL, VT, Mask,
4199 DAG.getNode(ISD::OR, DL, VT, LHSMask,
4200 DAG.getConstant(RHSBits, DL, VT)));
4202 if (RHSMask.getNode()) {
4203 APInt LHSBits = APInt::getHighBitsSet(EltSizeInBits, RShVal);
4204 Mask = DAG.getNode(ISD::AND, DL, VT, Mask,
4205 DAG.getNode(ISD::OR, DL, VT, RHSMask,
4206 DAG.getConstant(LHSBits, DL, VT)));
4209 Rot = DAG.getNode(ISD::AND, DL, VT, Rot, Mask);
4212 return Rot.getNode();
4215 // If there is a mask here, and we have a variable shift, we can't be sure
4216 // that we're masking out the right stuff.
4217 if (LHSMask.getNode() || RHSMask.getNode())
4220 // If the shift amount is sign/zext/any-extended just peel it off.
4221 SDValue LExtOp0 = LHSShiftAmt;
4222 SDValue RExtOp0 = RHSShiftAmt;
4223 if ((LHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND ||
4224 LHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND ||
4225 LHSShiftAmt.getOpcode() == ISD::ANY_EXTEND ||
4226 LHSShiftAmt.getOpcode() == ISD::TRUNCATE) &&
4227 (RHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND ||
4228 RHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND ||
4229 RHSShiftAmt.getOpcode() == ISD::ANY_EXTEND ||
4230 RHSShiftAmt.getOpcode() == ISD::TRUNCATE)) {
4231 LExtOp0 = LHSShiftAmt.getOperand(0);
4232 RExtOp0 = RHSShiftAmt.getOperand(0);
4235 SDNode *TryL = MatchRotatePosNeg(LHSShiftArg, LHSShiftAmt, RHSShiftAmt,
4236 LExtOp0, RExtOp0, ISD::ROTL, ISD::ROTR, DL);
4240 SDNode *TryR = MatchRotatePosNeg(RHSShiftArg, RHSShiftAmt, LHSShiftAmt,
4241 RExtOp0, LExtOp0, ISD::ROTR, ISD::ROTL, DL);
4249 /// Helper struct to parse and store a memory address as base + index + offset.
4250 /// We ignore sign extensions when it is safe to do so.
4251 /// The following two expressions are not equivalent. To differentiate we need
4252 /// to store whether there was a sign extension involved in the index
4254 /// (load (i64 add (i64 copyfromreg %c)
4255 /// (i64 signextend (add (i8 load %index)
4259 /// (load (i64 add (i64 copyfromreg %c)
4260 /// (i64 signextend (i32 add (i32 signextend (i8 load %index))
4262 struct BaseIndexOffset {
4266 bool IsIndexSignExt;
4268 BaseIndexOffset() : Offset(0), IsIndexSignExt(false) {}
4270 BaseIndexOffset(SDValue Base, SDValue Index, int64_t Offset,
4271 bool IsIndexSignExt) :
4272 Base(Base), Index(Index), Offset(Offset), IsIndexSignExt(IsIndexSignExt) {}
4274 bool equalBaseIndex(const BaseIndexOffset &Other) {
4275 return Other.Base == Base && Other.Index == Index &&
4276 Other.IsIndexSignExt == IsIndexSignExt;
4279 /// Parses tree in Ptr for base, index, offset addresses.
4280 static BaseIndexOffset match(SDValue Ptr, SelectionDAG &DAG,
4281 int64_t PartialOffset = 0) {
4282 bool IsIndexSignExt = false;
4284 // Split up a folded GlobalAddress+Offset into its component parts.
4285 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Ptr))
4286 if (GA->getOpcode() == ISD::GlobalAddress && GA->getOffset() != 0) {
4287 return BaseIndexOffset(DAG.getGlobalAddress(GA->getGlobal(),
4289 GA->getValueType(0),
4290 /*Offset=*/PartialOffset,
4291 /*isTargetGA=*/false,
4292 GA->getTargetFlags()),
4298 // We only can pattern match BASE + INDEX + OFFSET. If Ptr is not an ADD
4299 // instruction, then it could be just the BASE or everything else we don't
4300 // know how to handle. Just use Ptr as BASE and give up.
4301 if (Ptr->getOpcode() != ISD::ADD)
4302 return BaseIndexOffset(Ptr, SDValue(), PartialOffset, IsIndexSignExt);
4304 // We know that we have at least an ADD instruction. Try to pattern match
4305 // the simple case of BASE + OFFSET.
4306 if (isa<ConstantSDNode>(Ptr->getOperand(1))) {
4307 int64_t Offset = cast<ConstantSDNode>(Ptr->getOperand(1))->getSExtValue();
4308 return match(Ptr->getOperand(0), DAG, Offset + PartialOffset);
4311 // Inside a loop the current BASE pointer is calculated using an ADD and a
4312 // MUL instruction. In this case Ptr is the actual BASE pointer.
4313 // (i64 add (i64 %array_ptr)
4314 // (i64 mul (i64 %induction_var)
4315 // (i64 %element_size)))
4316 if (Ptr->getOperand(1)->getOpcode() == ISD::MUL)
4317 return BaseIndexOffset(Ptr, SDValue(), PartialOffset, IsIndexSignExt);
4319 // Look at Base + Index + Offset cases.
4320 SDValue Base = Ptr->getOperand(0);
4321 SDValue IndexOffset = Ptr->getOperand(1);
4323 // Skip signextends.
4324 if (IndexOffset->getOpcode() == ISD::SIGN_EXTEND) {
4325 IndexOffset = IndexOffset->getOperand(0);
4326 IsIndexSignExt = true;
4329 // Either the case of Base + Index (no offset) or something else.
4330 if (IndexOffset->getOpcode() != ISD::ADD)
4331 return BaseIndexOffset(Base, IndexOffset, PartialOffset, IsIndexSignExt);
4333 // Now we have the case of Base + Index + offset.
4334 SDValue Index = IndexOffset->getOperand(0);
4335 SDValue Offset = IndexOffset->getOperand(1);
4337 if (!isa<ConstantSDNode>(Offset))
4338 return BaseIndexOffset(Ptr, SDValue(), PartialOffset, IsIndexSignExt);
4340 // Ignore signextends.
4341 if (Index->getOpcode() == ISD::SIGN_EXTEND) {
4342 Index = Index->getOperand(0);
4343 IsIndexSignExt = true;
4344 } else IsIndexSignExt = false;
4346 int64_t Off = cast<ConstantSDNode>(Offset)->getSExtValue();
4347 return BaseIndexOffset(Base, Index, Off + PartialOffset, IsIndexSignExt);
4352 SDValue DAGCombiner::visitXOR(SDNode *N) {
4353 SDValue N0 = N->getOperand(0);
4354 SDValue N1 = N->getOperand(1);
4355 EVT VT = N0.getValueType();
4358 if (VT.isVector()) {
4359 if (SDValue FoldedVOp = SimplifyVBinOp(N))
4362 // fold (xor x, 0) -> x, vector edition
4363 if (ISD::isBuildVectorAllZeros(N0.getNode()))
4365 if (ISD::isBuildVectorAllZeros(N1.getNode()))
4369 // fold (xor undef, undef) -> 0. This is a common idiom (misuse).
4370 if (N0.isUndef() && N1.isUndef())
4371 return DAG.getConstant(0, SDLoc(N), VT);
4372 // fold (xor x, undef) -> undef
4377 // fold (xor c1, c2) -> c1^c2
4378 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
4379 ConstantSDNode *N1C = getAsNonOpaqueConstant(N1);
4381 return DAG.FoldConstantArithmetic(ISD::XOR, SDLoc(N), VT, N0C, N1C);
4382 // canonicalize constant to RHS
4383 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
4384 !DAG.isConstantIntBuildVectorOrConstantInt(N1))
4385 return DAG.getNode(ISD::XOR, SDLoc(N), VT, N1, N0);
4386 // fold (xor x, 0) -> x
4387 if (isNullConstant(N1))
4390 if (SDValue RXOR = ReassociateOps(ISD::XOR, SDLoc(N), N0, N1))
4393 // fold !(x cc y) -> (x !cc y)
4394 SDValue LHS, RHS, CC;
4395 if (TLI.isConstTrueVal(N1.getNode()) && isSetCCEquivalent(N0, LHS, RHS, CC)) {
4396 bool isInt = LHS.getValueType().isInteger();
4397 ISD::CondCode NotCC = ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(),
4400 if (!LegalOperations ||
4401 TLI.isCondCodeLegal(NotCC, LHS.getSimpleValueType())) {
4402 switch (N0.getOpcode()) {
4404 llvm_unreachable("Unhandled SetCC Equivalent!");
4406 return DAG.getSetCC(SDLoc(N), VT, LHS, RHS, NotCC);
4407 case ISD::SELECT_CC:
4408 return DAG.getSelectCC(SDLoc(N), LHS, RHS, N0.getOperand(2),
4409 N0.getOperand(3), NotCC);
4414 // fold (not (zext (setcc x, y))) -> (zext (not (setcc x, y)))
4415 if (isOneConstant(N1) && N0.getOpcode() == ISD::ZERO_EXTEND &&
4416 N0.getNode()->hasOneUse() &&
4417 isSetCCEquivalent(N0.getOperand(0), LHS, RHS, CC)){
4418 SDValue V = N0.getOperand(0);
4420 V = DAG.getNode(ISD::XOR, DL, V.getValueType(), V,
4421 DAG.getConstant(1, DL, V.getValueType()));
4422 AddToWorklist(V.getNode());
4423 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N), VT, V);
4426 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are setcc
4427 if (isOneConstant(N1) && VT == MVT::i1 &&
4428 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
4429 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1);
4430 if (isOneUseSetCC(RHS) || isOneUseSetCC(LHS)) {
4431 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
4432 LHS = DAG.getNode(ISD::XOR, SDLoc(LHS), VT, LHS, N1); // LHS = ~LHS
4433 RHS = DAG.getNode(ISD::XOR, SDLoc(RHS), VT, RHS, N1); // RHS = ~RHS
4434 AddToWorklist(LHS.getNode()); AddToWorklist(RHS.getNode());
4435 return DAG.getNode(NewOpcode, SDLoc(N), VT, LHS, RHS);
4438 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are constants
4439 if (isAllOnesConstant(N1) &&
4440 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) {
4441 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1);
4442 if (isa<ConstantSDNode>(RHS) || isa<ConstantSDNode>(LHS)) {
4443 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND;
4444 LHS = DAG.getNode(ISD::XOR, SDLoc(LHS), VT, LHS, N1); // LHS = ~LHS
4445 RHS = DAG.getNode(ISD::XOR, SDLoc(RHS), VT, RHS, N1); // RHS = ~RHS
4446 AddToWorklist(LHS.getNode()); AddToWorklist(RHS.getNode());
4447 return DAG.getNode(NewOpcode, SDLoc(N), VT, LHS, RHS);
4450 // fold (xor (and x, y), y) -> (and (not x), y)
4451 if (N0.getOpcode() == ISD::AND && N0.getNode()->hasOneUse() &&
4452 N0->getOperand(1) == N1) {
4453 SDValue X = N0->getOperand(0);
4454 SDValue NotX = DAG.getNOT(SDLoc(X), X, VT);
4455 AddToWorklist(NotX.getNode());
4456 return DAG.getNode(ISD::AND, SDLoc(N), VT, NotX, N1);
4458 // fold (xor (xor x, c1), c2) -> (xor x, (xor c1, c2))
4459 if (N1C && N0.getOpcode() == ISD::XOR) {
4460 if (const ConstantSDNode *N00C = getAsNonOpaqueConstant(N0.getOperand(0))) {
4462 return DAG.getNode(ISD::XOR, DL, VT, N0.getOperand(1),
4463 DAG.getConstant(N1C->getAPIntValue() ^
4464 N00C->getAPIntValue(), DL, VT));
4466 if (const ConstantSDNode *N01C = getAsNonOpaqueConstant(N0.getOperand(1))) {
4468 return DAG.getNode(ISD::XOR, DL, VT, N0.getOperand(0),
4469 DAG.getConstant(N1C->getAPIntValue() ^
4470 N01C->getAPIntValue(), DL, VT));
4473 // fold (xor x, x) -> 0
4475 return tryFoldToZero(SDLoc(N), TLI, VT, DAG, LegalOperations, LegalTypes);
4477 // fold (xor (shl 1, x), -1) -> (rotl ~1, x)
4478 // Here is a concrete example of this equivalence:
4480 // i16 shl == 1 << 14 == 16384 == 0b0100000000000000
4481 // i16 xor == ~(1 << 14) == 49151 == 0b1011111111111111
4485 // i16 ~1 == 0b1111111111111110
4486 // i16 rol(~1, 14) == 0b1011111111111111
4488 // Some additional tips to help conceptualize this transform:
4489 // - Try to see the operation as placing a single zero in a value of all ones.
4490 // - There exists no value for x which would allow the result to contain zero.
4491 // - Values of x larger than the bitwidth are undefined and do not require a
4492 // consistent result.
4493 // - Pushing the zero left requires shifting one bits in from the right.
4494 // A rotate left of ~1 is a nice way of achieving the desired result.
4495 if (TLI.isOperationLegalOrCustom(ISD::ROTL, VT) && N0.getOpcode() == ISD::SHL
4496 && isAllOnesConstant(N1) && isOneConstant(N0.getOperand(0))) {
4498 return DAG.getNode(ISD::ROTL, DL, VT, DAG.getConstant(~1, DL, VT),
4502 // Simplify: xor (op x...), (op y...) -> (op (xor x, y))
4503 if (N0.getOpcode() == N1.getOpcode())
4504 if (SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N))
4507 // Simplify the expression using non-local knowledge.
4508 if (!VT.isVector() &&
4509 SimplifyDemandedBits(SDValue(N, 0)))
4510 return SDValue(N, 0);
4515 /// Handle transforms common to the three shifts, when the shift amount is a
4517 SDValue DAGCombiner::visitShiftByConstant(SDNode *N, ConstantSDNode *Amt) {
4518 SDNode *LHS = N->getOperand(0).getNode();
4519 if (!LHS->hasOneUse()) return SDValue();
4521 // We want to pull some binops through shifts, so that we have (and (shift))
4522 // instead of (shift (and)), likewise for add, or, xor, etc. This sort of
4523 // thing happens with address calculations, so it's important to canonicalize
4525 bool HighBitSet = false; // Can we transform this if the high bit is set?
4527 switch (LHS->getOpcode()) {
4528 default: return SDValue();
4531 HighBitSet = false; // We can only transform sra if the high bit is clear.
4534 HighBitSet = true; // We can only transform sra if the high bit is set.
4537 if (N->getOpcode() != ISD::SHL)
4538 return SDValue(); // only shl(add) not sr[al](add).
4539 HighBitSet = false; // We can only transform sra if the high bit is clear.
4543 // We require the RHS of the binop to be a constant and not opaque as well.
4544 ConstantSDNode *BinOpCst = getAsNonOpaqueConstant(LHS->getOperand(1));
4545 if (!BinOpCst) return SDValue();
4547 // FIXME: disable this unless the input to the binop is a shift by a constant
4548 // or is copy/select.Enable this in other cases when figure out it's exactly profitable.
4549 SDNode *BinOpLHSVal = LHS->getOperand(0).getNode();
4550 bool isShift = BinOpLHSVal->getOpcode() == ISD::SHL ||
4551 BinOpLHSVal->getOpcode() == ISD::SRA ||
4552 BinOpLHSVal->getOpcode() == ISD::SRL;
4553 bool isCopyOrSelect = BinOpLHSVal->getOpcode() == ISD::CopyFromReg ||
4554 BinOpLHSVal->getOpcode() == ISD::SELECT;
4556 if ((!isShift || !isa<ConstantSDNode>(BinOpLHSVal->getOperand(1))) &&
4560 if (isCopyOrSelect && N->hasOneUse())
4563 EVT VT = N->getValueType(0);
4565 // If this is a signed shift right, and the high bit is modified by the
4566 // logical operation, do not perform the transformation. The highBitSet
4567 // boolean indicates the value of the high bit of the constant which would
4568 // cause it to be modified for this operation.
4569 if (N->getOpcode() == ISD::SRA) {
4570 bool BinOpRHSSignSet = BinOpCst->getAPIntValue().isNegative();
4571 if (BinOpRHSSignSet != HighBitSet)
4575 if (!TLI.isDesirableToCommuteWithShift(LHS))
4578 // Fold the constants, shifting the binop RHS by the shift amount.
4579 SDValue NewRHS = DAG.getNode(N->getOpcode(), SDLoc(LHS->getOperand(1)),
4581 LHS->getOperand(1), N->getOperand(1));
4582 assert(isa<ConstantSDNode>(NewRHS) && "Folding was not successful!");
4584 // Create the new shift.
4585 SDValue NewShift = DAG.getNode(N->getOpcode(),
4586 SDLoc(LHS->getOperand(0)),
4587 VT, LHS->getOperand(0), N->getOperand(1));
4589 // Create the new binop.
4590 return DAG.getNode(LHS->getOpcode(), SDLoc(N), VT, NewShift, NewRHS);
4593 SDValue DAGCombiner::distributeTruncateThroughAnd(SDNode *N) {
4594 assert(N->getOpcode() == ISD::TRUNCATE);
4595 assert(N->getOperand(0).getOpcode() == ISD::AND);
4597 // (truncate:TruncVT (and N00, N01C)) -> (and (truncate:TruncVT N00), TruncC)
4598 if (N->hasOneUse() && N->getOperand(0).hasOneUse()) {
4599 SDValue N01 = N->getOperand(0).getOperand(1);
4600 if (isConstantOrConstantVector(N01, /* NoOpaques */ true)) {
4602 EVT TruncVT = N->getValueType(0);
4603 SDValue N00 = N->getOperand(0).getOperand(0);
4604 SDValue Trunc00 = DAG.getNode(ISD::TRUNCATE, DL, TruncVT, N00);
4605 SDValue Trunc01 = DAG.getNode(ISD::TRUNCATE, DL, TruncVT, N01);
4606 AddToWorklist(Trunc00.getNode());
4607 AddToWorklist(Trunc01.getNode());
4608 return DAG.getNode(ISD::AND, DL, TruncVT, Trunc00, Trunc01);
4615 SDValue DAGCombiner::visitRotate(SDNode *N) {
4616 // fold (rot* x, (trunc (and y, c))) -> (rot* x, (and (trunc y), (trunc c))).
4617 if (N->getOperand(1).getOpcode() == ISD::TRUNCATE &&
4618 N->getOperand(1).getOperand(0).getOpcode() == ISD::AND) {
4619 if (SDValue NewOp1 =
4620 distributeTruncateThroughAnd(N->getOperand(1).getNode()))
4621 return DAG.getNode(N->getOpcode(), SDLoc(N), N->getValueType(0),
4622 N->getOperand(0), NewOp1);
4627 SDValue DAGCombiner::visitSHL(SDNode *N) {
4628 SDValue N0 = N->getOperand(0);
4629 SDValue N1 = N->getOperand(1);
4630 EVT VT = N0.getValueType();
4631 unsigned OpSizeInBits = VT.getScalarSizeInBits();
4634 if (VT.isVector()) {
4635 if (SDValue FoldedVOp = SimplifyVBinOp(N))
4638 BuildVectorSDNode *N1CV = dyn_cast<BuildVectorSDNode>(N1);
4639 // If setcc produces all-one true value then:
4640 // (shl (and (setcc) N01CV) N1CV) -> (and (setcc) N01CV<<N1CV)
4641 if (N1CV && N1CV->isConstant()) {
4642 if (N0.getOpcode() == ISD::AND) {
4643 SDValue N00 = N0->getOperand(0);
4644 SDValue N01 = N0->getOperand(1);
4645 BuildVectorSDNode *N01CV = dyn_cast<BuildVectorSDNode>(N01);
4647 if (N01CV && N01CV->isConstant() && N00.getOpcode() == ISD::SETCC &&
4648 TLI.getBooleanContents(N00.getOperand(0).getValueType()) ==
4649 TargetLowering::ZeroOrNegativeOneBooleanContent) {
4650 if (SDValue C = DAG.FoldConstantArithmetic(ISD::SHL, SDLoc(N), VT,
4652 return DAG.getNode(ISD::AND, SDLoc(N), VT, N00, C);
4658 ConstantSDNode *N1C = isConstOrConstSplat(N1);
4660 // fold (shl c1, c2) -> c1<<c2
4661 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
4662 if (N0C && N1C && !N1C->isOpaque())
4663 return DAG.FoldConstantArithmetic(ISD::SHL, SDLoc(N), VT, N0C, N1C);
4664 // fold (shl 0, x) -> 0
4665 if (isNullConstant(N0))
4667 // fold (shl x, c >= size(x)) -> undef
4668 if (N1C && N1C->getAPIntValue().uge(OpSizeInBits))
4669 return DAG.getUNDEF(VT);
4670 // fold (shl x, 0) -> x
4671 if (N1C && N1C->isNullValue())
4673 // fold (shl undef, x) -> 0
4675 return DAG.getConstant(0, SDLoc(N), VT);
4676 // if (shl x, c) is known to be zero, return 0
4677 if (DAG.MaskedValueIsZero(SDValue(N, 0),
4678 APInt::getAllOnesValue(OpSizeInBits)))
4679 return DAG.getConstant(0, SDLoc(N), VT);
4680 // fold (shl x, (trunc (and y, c))) -> (shl x, (and (trunc y), (trunc c))).
4681 if (N1.getOpcode() == ISD::TRUNCATE &&
4682 N1.getOperand(0).getOpcode() == ISD::AND) {
4683 if (SDValue NewOp1 = distributeTruncateThroughAnd(N1.getNode()))
4684 return DAG.getNode(ISD::SHL, SDLoc(N), VT, N0, NewOp1);
4687 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
4688 return SDValue(N, 0);
4690 // fold (shl (shl x, c1), c2) -> 0 or (shl x, (add c1, c2))
4691 if (N1C && N0.getOpcode() == ISD::SHL) {
4692 if (ConstantSDNode *N0C1 = isConstOrConstSplat(N0.getOperand(1))) {
4694 APInt c1 = N0C1->getAPIntValue();
4695 APInt c2 = N1C->getAPIntValue();
4696 zeroExtendToMatch(c1, c2, 1 /* Overflow Bit */);
4698 APInt Sum = c1 + c2;
4699 if (Sum.uge(OpSizeInBits))
4700 return DAG.getConstant(0, DL, VT);
4703 ISD::SHL, DL, VT, N0.getOperand(0),
4704 DAG.getConstant(Sum.getZExtValue(), DL, N1.getValueType()));
4708 // fold (shl (ext (shl x, c1)), c2) -> (ext (shl x, (add c1, c2)))
4709 // For this to be valid, the second form must not preserve any of the bits
4710 // that are shifted out by the inner shift in the first form. This means
4711 // the outer shift size must be >= the number of bits added by the ext.
4712 // As a corollary, we don't care what kind of ext it is.
4713 if (N1C && (N0.getOpcode() == ISD::ZERO_EXTEND ||
4714 N0.getOpcode() == ISD::ANY_EXTEND ||
4715 N0.getOpcode() == ISD::SIGN_EXTEND) &&
4716 N0.getOperand(0).getOpcode() == ISD::SHL) {
4717 SDValue N0Op0 = N0.getOperand(0);
4718 if (ConstantSDNode *N0Op0C1 = isConstOrConstSplat(N0Op0.getOperand(1))) {
4719 APInt c1 = N0Op0C1->getAPIntValue();
4720 APInt c2 = N1C->getAPIntValue();
4721 zeroExtendToMatch(c1, c2, 1 /* Overflow Bit */);
4723 EVT InnerShiftVT = N0Op0.getValueType();
4724 uint64_t InnerShiftSize = InnerShiftVT.getScalarSizeInBits();
4725 if (c2.uge(OpSizeInBits - InnerShiftSize)) {
4727 APInt Sum = c1 + c2;
4728 if (Sum.uge(OpSizeInBits))
4729 return DAG.getConstant(0, DL, VT);
4733 DAG.getNode(N0.getOpcode(), DL, VT, N0Op0->getOperand(0)),
4734 DAG.getConstant(Sum.getZExtValue(), DL, N1.getValueType()));
4739 // fold (shl (zext (srl x, C)), C) -> (zext (shl (srl x, C), C))
4740 // Only fold this if the inner zext has no other uses to avoid increasing
4741 // the total number of instructions.
4742 if (N1C && N0.getOpcode() == ISD::ZERO_EXTEND && N0.hasOneUse() &&
4743 N0.getOperand(0).getOpcode() == ISD::SRL) {
4744 SDValue N0Op0 = N0.getOperand(0);
4745 if (ConstantSDNode *N0Op0C1 = isConstOrConstSplat(N0Op0.getOperand(1))) {
4746 if (N0Op0C1->getAPIntValue().ult(VT.getScalarSizeInBits())) {
4747 uint64_t c1 = N0Op0C1->getZExtValue();
4748 uint64_t c2 = N1C->getZExtValue();
4750 SDValue NewOp0 = N0.getOperand(0);
4751 EVT CountVT = NewOp0.getOperand(1).getValueType();
4753 SDValue NewSHL = DAG.getNode(ISD::SHL, DL, NewOp0.getValueType(),
4755 DAG.getConstant(c2, DL, CountVT));
4756 AddToWorklist(NewSHL.getNode());
4757 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N0), VT, NewSHL);
4763 // fold (shl (sr[la] exact X, C1), C2) -> (shl X, (C2-C1)) if C1 <= C2
4764 // fold (shl (sr[la] exact X, C1), C2) -> (sr[la] X, (C2-C1)) if C1 > C2
4765 if (N1C && (N0.getOpcode() == ISD::SRL || N0.getOpcode() == ISD::SRA) &&
4766 cast<BinaryWithFlagsSDNode>(N0)->Flags.hasExact()) {
4767 if (ConstantSDNode *N0C1 = isConstOrConstSplat(N0.getOperand(1))) {
4768 uint64_t C1 = N0C1->getZExtValue();
4769 uint64_t C2 = N1C->getZExtValue();
4772 return DAG.getNode(ISD::SHL, DL, VT, N0.getOperand(0),
4773 DAG.getConstant(C2 - C1, DL, N1.getValueType()));
4774 return DAG.getNode(N0.getOpcode(), DL, VT, N0.getOperand(0),
4775 DAG.getConstant(C1 - C2, DL, N1.getValueType()));
4779 // fold (shl (srl x, c1), c2) -> (and (shl x, (sub c2, c1), MASK) or
4780 // (and (srl x, (sub c1, c2), MASK)
4781 // Only fold this if the inner shift has no other uses -- if it does, folding
4782 // this will increase the total number of instructions.
4783 if (N1C && N0.getOpcode() == ISD::SRL && N0.hasOneUse()) {
4784 if (ConstantSDNode *N0C1 = isConstOrConstSplat(N0.getOperand(1))) {
4785 uint64_t c1 = N0C1->getZExtValue();
4786 if (c1 < OpSizeInBits) {
4787 uint64_t c2 = N1C->getZExtValue();
4788 APInt Mask = APInt::getHighBitsSet(OpSizeInBits, OpSizeInBits - c1);
4791 Mask = Mask.shl(c2 - c1);
4793 Shift = DAG.getNode(ISD::SHL, DL, VT, N0.getOperand(0),
4794 DAG.getConstant(c2 - c1, DL, N1.getValueType()));
4796 Mask = Mask.lshr(c1 - c2);
4798 Shift = DAG.getNode(ISD::SRL, DL, VT, N0.getOperand(0),
4799 DAG.getConstant(c1 - c2, DL, N1.getValueType()));
4802 return DAG.getNode(ISD::AND, DL, VT, Shift,
4803 DAG.getConstant(Mask, DL, VT));
4808 // fold (shl (sra x, c1), c1) -> (and x, (shl -1, c1))
4809 if (N0.getOpcode() == ISD::SRA && N1 == N0.getOperand(1) &&
4810 isConstantOrConstantVector(N1, /* No Opaques */ true)) {
4811 unsigned BitSize = VT.getScalarSizeInBits();
4813 SDValue AllBits = DAG.getConstant(APInt::getAllOnesValue(BitSize), DL, VT);
4814 SDValue HiBitsMask = DAG.getNode(ISD::SHL, DL, VT, AllBits, N1);
4815 return DAG.getNode(ISD::AND, DL, VT, N0.getOperand(0), HiBitsMask);
4818 // fold (shl (add x, c1), c2) -> (add (shl x, c2), c1 << c2)
4819 // Variant of version done on multiply, except mul by a power of 2 is turned
4821 if (N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse() &&
4822 isConstantOrConstantVector(N1, /* No Opaques */ true) &&
4823 isConstantOrConstantVector(N0.getOperand(1), /* No Opaques */ true)) {
4824 SDValue Shl0 = DAG.getNode(ISD::SHL, SDLoc(N0), VT, N0.getOperand(0), N1);
4825 SDValue Shl1 = DAG.getNode(ISD::SHL, SDLoc(N1), VT, N0.getOperand(1), N1);
4826 AddToWorklist(Shl0.getNode());
4827 AddToWorklist(Shl1.getNode());
4828 return DAG.getNode(ISD::ADD, SDLoc(N), VT, Shl0, Shl1);
4831 // fold (shl (mul x, c1), c2) -> (mul x, c1 << c2)
4832 if (N0.getOpcode() == ISD::MUL && N0.getNode()->hasOneUse() &&
4833 isConstantOrConstantVector(N1, /* No Opaques */ true) &&
4834 isConstantOrConstantVector(N0.getOperand(1), /* No Opaques */ true)) {
4835 SDValue Shl = DAG.getNode(ISD::SHL, SDLoc(N1), VT, N0.getOperand(1), N1);
4836 if (isConstantOrConstantVector(Shl))
4837 return DAG.getNode(ISD::MUL, SDLoc(N), VT, N0.getOperand(0), Shl);
4840 if (N1C && !N1C->isOpaque())
4841 if (SDValue NewSHL = visitShiftByConstant(N, N1C))
4847 SDValue DAGCombiner::visitSRA(SDNode *N) {
4848 SDValue N0 = N->getOperand(0);
4849 SDValue N1 = N->getOperand(1);
4850 EVT VT = N0.getValueType();
4851 unsigned OpSizeInBits = VT.getScalarSizeInBits();
4853 // Arithmetic shifting an all-sign-bit value is a no-op.
4854 if (DAG.ComputeNumSignBits(N0) == OpSizeInBits)
4859 if (SDValue FoldedVOp = SimplifyVBinOp(N))
4862 ConstantSDNode *N1C = isConstOrConstSplat(N1);
4864 // fold (sra c1, c2) -> (sra c1, c2)
4865 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
4866 if (N0C && N1C && !N1C->isOpaque())
4867 return DAG.FoldConstantArithmetic(ISD::SRA, SDLoc(N), VT, N0C, N1C);
4868 // fold (sra 0, x) -> 0
4869 if (isNullConstant(N0))
4871 // fold (sra -1, x) -> -1
4872 if (isAllOnesConstant(N0))
4874 // fold (sra x, c >= size(x)) -> undef
4875 if (N1C && N1C->getAPIntValue().uge(OpSizeInBits))
4876 return DAG.getUNDEF(VT);
4877 // fold (sra x, 0) -> x
4878 if (N1C && N1C->isNullValue())
4880 // fold (sra (shl x, c1), c1) -> sext_inreg for some c1 and target supports
4882 if (N1C && N0.getOpcode() == ISD::SHL && N1 == N0.getOperand(1)) {
4883 unsigned LowBits = OpSizeInBits - (unsigned)N1C->getZExtValue();
4884 EVT ExtVT = EVT::getIntegerVT(*DAG.getContext(), LowBits);
4886 ExtVT = EVT::getVectorVT(*DAG.getContext(),
4887 ExtVT, VT.getVectorNumElements());
4888 if ((!LegalOperations ||
4889 TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, ExtVT)))
4890 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), VT,
4891 N0.getOperand(0), DAG.getValueType(ExtVT));
4894 // fold (sra (sra x, c1), c2) -> (sra x, (add c1, c2))
4895 if (N1C && N0.getOpcode() == ISD::SRA) {
4896 if (ConstantSDNode *N0C1 = isConstOrConstSplat(N0.getOperand(1))) {
4898 APInt c1 = N0C1->getAPIntValue();
4899 APInt c2 = N1C->getAPIntValue();
4900 zeroExtendToMatch(c1, c2, 1 /* Overflow Bit */);
4902 APInt Sum = c1 + c2;
4903 if (Sum.uge(OpSizeInBits))
4904 Sum = APInt(OpSizeInBits, OpSizeInBits - 1);
4907 ISD::SRA, DL, VT, N0.getOperand(0),
4908 DAG.getConstant(Sum.getZExtValue(), DL, N1.getValueType()));
4912 // fold (sra (shl X, m), (sub result_size, n))
4913 // -> (sign_extend (trunc (shl X, (sub (sub result_size, n), m)))) for
4914 // result_size - n != m.
4915 // If truncate is free for the target sext(shl) is likely to result in better
4917 if (N0.getOpcode() == ISD::SHL && N1C) {
4918 // Get the two constanst of the shifts, CN0 = m, CN = n.
4919 const ConstantSDNode *N01C = isConstOrConstSplat(N0.getOperand(1));
4921 LLVMContext &Ctx = *DAG.getContext();
4922 // Determine what the truncate's result bitsize and type would be.
4923 EVT TruncVT = EVT::getIntegerVT(Ctx, OpSizeInBits - N1C->getZExtValue());
4926 TruncVT = EVT::getVectorVT(Ctx, TruncVT, VT.getVectorNumElements());
4928 // Determine the residual right-shift amount.
4929 int ShiftAmt = N1C->getZExtValue() - N01C->getZExtValue();
4931 // If the shift is not a no-op (in which case this should be just a sign
4932 // extend already), the truncated to type is legal, sign_extend is legal
4933 // on that type, and the truncate to that type is both legal and free,
4934 // perform the transform.
4935 if ((ShiftAmt > 0) &&
4936 TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND, TruncVT) &&
4937 TLI.isOperationLegalOrCustom(ISD::TRUNCATE, VT) &&
4938 TLI.isTruncateFree(VT, TruncVT)) {
4941 SDValue Amt = DAG.getConstant(ShiftAmt, DL,
4942 getShiftAmountTy(N0.getOperand(0).getValueType()));
4943 SDValue Shift = DAG.getNode(ISD::SRL, DL, VT,
4944 N0.getOperand(0), Amt);
4945 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, DL, TruncVT,
4947 return DAG.getNode(ISD::SIGN_EXTEND, DL,
4948 N->getValueType(0), Trunc);
4953 // fold (sra x, (trunc (and y, c))) -> (sra x, (and (trunc y), (trunc c))).
4954 if (N1.getOpcode() == ISD::TRUNCATE &&
4955 N1.getOperand(0).getOpcode() == ISD::AND) {
4956 if (SDValue NewOp1 = distributeTruncateThroughAnd(N1.getNode()))
4957 return DAG.getNode(ISD::SRA, SDLoc(N), VT, N0, NewOp1);
4960 // fold (sra (trunc (srl x, c1)), c2) -> (trunc (sra x, c1 + c2))
4961 // if c1 is equal to the number of bits the trunc removes
4962 if (N0.getOpcode() == ISD::TRUNCATE &&
4963 (N0.getOperand(0).getOpcode() == ISD::SRL ||
4964 N0.getOperand(0).getOpcode() == ISD::SRA) &&
4965 N0.getOperand(0).hasOneUse() &&
4966 N0.getOperand(0).getOperand(1).hasOneUse() &&
4968 SDValue N0Op0 = N0.getOperand(0);
4969 if (ConstantSDNode *LargeShift = isConstOrConstSplat(N0Op0.getOperand(1))) {
4970 unsigned LargeShiftVal = LargeShift->getZExtValue();
4971 EVT LargeVT = N0Op0.getValueType();
4973 if (LargeVT.getScalarSizeInBits() - OpSizeInBits == LargeShiftVal) {
4976 DAG.getConstant(LargeShiftVal + N1C->getZExtValue(), DL,
4977 getShiftAmountTy(N0Op0.getOperand(0).getValueType()));
4978 SDValue SRA = DAG.getNode(ISD::SRA, DL, LargeVT,
4979 N0Op0.getOperand(0), Amt);
4980 return DAG.getNode(ISD::TRUNCATE, DL, VT, SRA);
4985 // Simplify, based on bits shifted out of the LHS.
4986 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
4987 return SDValue(N, 0);
4990 // If the sign bit is known to be zero, switch this to a SRL.
4991 if (DAG.SignBitIsZero(N0))
4992 return DAG.getNode(ISD::SRL, SDLoc(N), VT, N0, N1);
4994 if (N1C && !N1C->isOpaque())
4995 if (SDValue NewSRA = visitShiftByConstant(N, N1C))
5001 SDValue DAGCombiner::visitSRL(SDNode *N) {
5002 SDValue N0 = N->getOperand(0);
5003 SDValue N1 = N->getOperand(1);
5004 EVT VT = N0.getValueType();
5005 unsigned OpSizeInBits = VT.getScalarSizeInBits();
5009 if (SDValue FoldedVOp = SimplifyVBinOp(N))
5012 ConstantSDNode *N1C = isConstOrConstSplat(N1);
5014 // fold (srl c1, c2) -> c1 >>u c2
5015 ConstantSDNode *N0C = getAsNonOpaqueConstant(N0);
5016 if (N0C && N1C && !N1C->isOpaque())
5017 return DAG.FoldConstantArithmetic(ISD::SRL, SDLoc(N), VT, N0C, N1C);
5018 // fold (srl 0, x) -> 0
5019 if (isNullConstant(N0))
5021 // fold (srl x, c >= size(x)) -> undef
5022 if (N1C && N1C->getAPIntValue().uge(OpSizeInBits))
5023 return DAG.getUNDEF(VT);
5024 // fold (srl x, 0) -> x
5025 if (N1C && N1C->isNullValue())
5027 // if (srl x, c) is known to be zero, return 0
5028 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0),
5029 APInt::getAllOnesValue(OpSizeInBits)))
5030 return DAG.getConstant(0, SDLoc(N), VT);
5032 // fold (srl (srl x, c1), c2) -> 0 or (srl x, (add c1, c2))
5033 if (N1C && N0.getOpcode() == ISD::SRL) {
5034 if (ConstantSDNode *N0C1 = isConstOrConstSplat(N0.getOperand(1))) {
5036 APInt c1 = N0C1->getAPIntValue();
5037 APInt c2 = N1C->getAPIntValue();
5038 zeroExtendToMatch(c1, c2, 1 /* Overflow Bit */);
5040 APInt Sum = c1 + c2;
5041 if (Sum.uge(OpSizeInBits))
5042 return DAG.getConstant(0, DL, VT);
5045 ISD::SRL, DL, VT, N0.getOperand(0),
5046 DAG.getConstant(Sum.getZExtValue(), DL, N1.getValueType()));
5050 // fold (srl (trunc (srl x, c1)), c2) -> 0 or (trunc (srl x, (add c1, c2)))
5051 if (N1C && N0.getOpcode() == ISD::TRUNCATE &&
5052 N0.getOperand(0).getOpcode() == ISD::SRL &&
5053 isa<ConstantSDNode>(N0.getOperand(0)->getOperand(1))) {
5055 cast<ConstantSDNode>(N0.getOperand(0)->getOperand(1))->getZExtValue();
5056 uint64_t c2 = N1C->getZExtValue();
5057 EVT InnerShiftVT = N0.getOperand(0).getValueType();
5058 EVT ShiftCountVT = N0.getOperand(0)->getOperand(1).getValueType();
5059 uint64_t InnerShiftSize = InnerShiftVT.getScalarSizeInBits();
5060 // This is only valid if the OpSizeInBits + c1 = size of inner shift.
5061 if (c1 + OpSizeInBits == InnerShiftSize) {
5063 if (c1 + c2 >= InnerShiftSize)
5064 return DAG.getConstant(0, DL, VT);
5065 return DAG.getNode(ISD::TRUNCATE, DL, VT,
5066 DAG.getNode(ISD::SRL, DL, InnerShiftVT,
5067 N0.getOperand(0)->getOperand(0),
5068 DAG.getConstant(c1 + c2, DL,
5073 // fold (srl (shl x, c), c) -> (and x, cst2)
5074 if (N0.getOpcode() == ISD::SHL && N0.getOperand(1) == N1 &&
5075 isConstantOrConstantVector(N1, /* NoOpaques */ true)) {
5077 APInt AllBits = APInt::getAllOnesValue(N0.getScalarValueSizeInBits());
5079 DAG.getNode(ISD::SRL, DL, VT, DAG.getConstant(AllBits, DL, VT), N1);
5080 AddToWorklist(Mask.getNode());
5081 return DAG.getNode(ISD::AND, DL, VT, N0.getOperand(0), Mask);
5084 // fold (srl (anyextend x), c) -> (and (anyextend (srl x, c)), mask)
5085 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) {
5086 // Shifting in all undef bits?
5087 EVT SmallVT = N0.getOperand(0).getValueType();
5088 unsigned BitSize = SmallVT.getScalarSizeInBits();
5089 if (N1C->getZExtValue() >= BitSize)
5090 return DAG.getUNDEF(VT);
5092 if (!LegalTypes || TLI.isTypeDesirableForOp(ISD::SRL, SmallVT)) {
5093 uint64_t ShiftAmt = N1C->getZExtValue();
5095 SDValue SmallShift = DAG.getNode(ISD::SRL, DL0, SmallVT,
5097 DAG.getConstant(ShiftAmt, DL0,
5098 getShiftAmountTy(SmallVT)));
5099 AddToWorklist(SmallShift.getNode());
5100 APInt Mask = APInt::getAllOnesValue(OpSizeInBits).lshr(ShiftAmt);
5102 return DAG.getNode(ISD::AND, DL, VT,
5103 DAG.getNode(ISD::ANY_EXTEND, DL, VT, SmallShift),
5104 DAG.getConstant(Mask, DL, VT));
5108 // fold (srl (sra X, Y), 31) -> (srl X, 31). This srl only looks at the sign
5109 // bit, which is unmodified by sra.
5110 if (N1C && N1C->getZExtValue() + 1 == OpSizeInBits) {
5111 if (N0.getOpcode() == ISD::SRA)
5112 return DAG.getNode(ISD::SRL, SDLoc(N), VT, N0.getOperand(0), N1);
5115 // fold (srl (ctlz x), "5") -> x iff x has one bit set (the low bit).
5116 if (N1C && N0.getOpcode() == ISD::CTLZ &&
5117 N1C->getAPIntValue() == Log2_32(OpSizeInBits)) {
5118 APInt KnownZero, KnownOne;
5119 DAG.computeKnownBits(N0.getOperand(0), KnownZero, KnownOne);
5121 // If any of the input bits are KnownOne, then the input couldn't be all
5122 // zeros, thus the result of the srl will always be zero.
5123 if (KnownOne.getBoolValue()) return DAG.getConstant(0, SDLoc(N0), VT);
5125 // If all of the bits input the to ctlz node are known to be zero, then
5126 // the result of the ctlz is "32" and the result of the shift is one.
5127 APInt UnknownBits = ~KnownZero;
5128 if (UnknownBits == 0) return DAG.getConstant(1, SDLoc(N0), VT);
5130 // Otherwise, check to see if there is exactly one bit input to the ctlz.
5131 if ((UnknownBits & (UnknownBits - 1)) == 0) {
5132 // Okay, we know that only that the single bit specified by UnknownBits
5133 // could be set on input to the CTLZ node. If this bit is set, the SRL
5134 // will return 0, if it is clear, it returns 1. Change the CTLZ/SRL pair
5135 // to an SRL/XOR pair, which is likely to simplify more.
5136 unsigned ShAmt = UnknownBits.countTrailingZeros();
5137 SDValue Op = N0.getOperand(0);
5141 Op = DAG.getNode(ISD::SRL, DL, VT, Op,
5142 DAG.getConstant(ShAmt, DL,
5143 getShiftAmountTy(Op.getValueType())));
5144 AddToWorklist(Op.getNode());
5148 return DAG.getNode(ISD::XOR, DL, VT,
5149 Op, DAG.getConstant(1, DL, VT));
5153 // fold (srl x, (trunc (and y, c))) -> (srl x, (and (trunc y), (trunc c))).
5154 if (N1.getOpcode() == ISD::TRUNCATE &&
5155 N1.getOperand(0).getOpcode() == ISD::AND) {
5156 if (SDValue NewOp1 = distributeTruncateThroughAnd(N1.getNode()))
5157 return DAG.getNode(ISD::SRL, SDLoc(N), VT, N0, NewOp1);
5160 // fold operands of srl based on knowledge that the low bits are not
5162 if (N1C && SimplifyDemandedBits(SDValue(N, 0)))
5163 return SDValue(N, 0);
5165 if (N1C && !N1C->isOpaque())
5166 if (SDValue NewSRL = visitShiftByConstant(N, N1C))
5169 // Attempt to convert a srl of a load into a narrower zero-extending load.
5170 if (SDValue NarrowLoad = ReduceLoadWidth(N))
5173 // Here is a common situation. We want to optimize:
5176 // %b = and i32 %a, 2
5177 // %c = srl i32 %b, 1
5178 // brcond i32 %c ...
5184 // %c = setcc eq %b, 0
5187 // However when after the source operand of SRL is optimized into AND, the SRL
5188 // itself may not be optimized further. Look for it and add the BRCOND into
5190 if (N->hasOneUse()) {
5191 SDNode *Use = *N->use_begin();
5192 if (Use->getOpcode() == ISD::BRCOND)
5194 else if (Use->getOpcode() == ISD::TRUNCATE && Use->hasOneUse()) {
5195 // Also look pass the truncate.
5196 Use = *Use->use_begin();
5197 if (Use->getOpcode() == ISD::BRCOND)
5205 SDValue DAGCombiner::visitBSWAP(SDNode *N) {
5206 SDValue N0 = N->getOperand(0);
5207 EVT VT = N->getValueType(0);
5209 // fold (bswap c1) -> c2
5210 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5211 return DAG.getNode(ISD::BSWAP, SDLoc(N), VT, N0);
5212 // fold (bswap (bswap x)) -> x
5213 if (N0.getOpcode() == ISD::BSWAP)
5214 return N0->getOperand(0);
5218 SDValue DAGCombiner::visitBITREVERSE(SDNode *N) {
5219 SDValue N0 = N->getOperand(0);
5221 // fold (bitreverse (bitreverse x)) -> x
5222 if (N0.getOpcode() == ISD::BITREVERSE)
5223 return N0.getOperand(0);
5227 SDValue DAGCombiner::visitCTLZ(SDNode *N) {
5228 SDValue N0 = N->getOperand(0);
5229 EVT VT = N->getValueType(0);
5231 // fold (ctlz c1) -> c2
5232 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5233 return DAG.getNode(ISD::CTLZ, SDLoc(N), VT, N0);
5237 SDValue DAGCombiner::visitCTLZ_ZERO_UNDEF(SDNode *N) {
5238 SDValue N0 = N->getOperand(0);
5239 EVT VT = N->getValueType(0);
5241 // fold (ctlz_zero_undef c1) -> c2
5242 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5243 return DAG.getNode(ISD::CTLZ_ZERO_UNDEF, SDLoc(N), VT, N0);
5247 SDValue DAGCombiner::visitCTTZ(SDNode *N) {
5248 SDValue N0 = N->getOperand(0);
5249 EVT VT = N->getValueType(0);
5251 // fold (cttz c1) -> c2
5252 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5253 return DAG.getNode(ISD::CTTZ, SDLoc(N), VT, N0);
5257 SDValue DAGCombiner::visitCTTZ_ZERO_UNDEF(SDNode *N) {
5258 SDValue N0 = N->getOperand(0);
5259 EVT VT = N->getValueType(0);
5261 // fold (cttz_zero_undef c1) -> c2
5262 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5263 return DAG.getNode(ISD::CTTZ_ZERO_UNDEF, SDLoc(N), VT, N0);
5267 SDValue DAGCombiner::visitCTPOP(SDNode *N) {
5268 SDValue N0 = N->getOperand(0);
5269 EVT VT = N->getValueType(0);
5271 // fold (ctpop c1) -> c2
5272 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
5273 return DAG.getNode(ISD::CTPOP, SDLoc(N), VT, N0);
5278 /// \brief Generate Min/Max node
5279 static SDValue combineMinNumMaxNum(const SDLoc &DL, EVT VT, SDValue LHS,
5280 SDValue RHS, SDValue True, SDValue False,
5281 ISD::CondCode CC, const TargetLowering &TLI,
5282 SelectionDAG &DAG) {
5283 if (!(LHS == True && RHS == False) && !(LHS == False && RHS == True))
5293 unsigned Opcode = (LHS == True) ? ISD::FMINNUM : ISD::FMAXNUM;
5294 if (TLI.isOperationLegal(Opcode, VT))
5295 return DAG.getNode(Opcode, DL, VT, LHS, RHS);
5304 unsigned Opcode = (LHS == True) ? ISD::FMAXNUM : ISD::FMINNUM;
5305 if (TLI.isOperationLegal(Opcode, VT))
5306 return DAG.getNode(Opcode, DL, VT, LHS, RHS);
5314 // TODO: We should handle other cases of selecting between {-1,0,1} here.
5315 SDValue DAGCombiner::foldSelectOfConstants(SDNode *N) {
5316 SDValue Cond = N->getOperand(0);
5317 SDValue N1 = N->getOperand(1);
5318 SDValue N2 = N->getOperand(2);
5319 EVT VT = N->getValueType(0);
5320 EVT CondVT = Cond.getValueType();
5323 // fold (select Cond, 0, 1) -> (xor Cond, 1)
5324 // We can't do this reliably if integer based booleans have different contents
5325 // to floating point based booleans. This is because we can't tell whether we
5326 // have an integer-based boolean or a floating-point-based boolean unless we
5327 // can find the SETCC that produced it and inspect its operands. This is
5328 // fairly easy if C is the SETCC node, but it can potentially be
5329 // undiscoverable (or not reasonably discoverable). For example, it could be
5330 // in another basic block or it could require searching a complicated
5332 if (VT.isInteger() &&
5333 (CondVT == MVT::i1 || (CondVT.isInteger() &&
5334 TLI.getBooleanContents(false, true) ==
5335 TargetLowering::ZeroOrOneBooleanContent &&
5336 TLI.getBooleanContents(false, false) ==
5337 TargetLowering::ZeroOrOneBooleanContent)) &&
5338 isNullConstant(N1) && isOneConstant(N2)) {
5339 SDValue NotCond = DAG.getNode(ISD::XOR, DL, CondVT, Cond,
5340 DAG.getConstant(1, DL, CondVT));
5341 if (VT.bitsEq(CondVT))
5343 return DAG.getZExtOrTrunc(NotCond, DL, VT);
5349 SDValue DAGCombiner::visitSELECT(SDNode *N) {
5350 SDValue N0 = N->getOperand(0);
5351 SDValue N1 = N->getOperand(1);
5352 SDValue N2 = N->getOperand(2);
5353 EVT VT = N->getValueType(0);
5354 EVT VT0 = N0.getValueType();
5356 // fold (select C, X, X) -> X
5359 if (const ConstantSDNode *N0C = dyn_cast<const ConstantSDNode>(N0)) {
5360 // fold (select true, X, Y) -> X
5361 // fold (select false, X, Y) -> Y
5362 return !N0C->isNullValue() ? N1 : N2;
5364 // fold (select X, X, Y) -> (or X, Y)
5365 // fold (select X, 1, Y) -> (or C, Y)
5366 if (VT == VT0 && VT == MVT::i1 && (N0 == N1 || isOneConstant(N1)))
5367 return DAG.getNode(ISD::OR, SDLoc(N), VT, N0, N2);
5369 if (SDValue V = foldSelectOfConstants(N))
5372 // fold (select C, 0, X) -> (and (not C), X)
5373 if (VT == VT0 && VT == MVT::i1 && isNullConstant(N1)) {
5374 SDValue NOTNode = DAG.getNOT(SDLoc(N0), N0, VT);
5375 AddToWorklist(NOTNode.getNode());
5376 return DAG.getNode(ISD::AND, SDLoc(N), VT, NOTNode, N2);
5378 // fold (select C, X, 1) -> (or (not C), X)
5379 if (VT == VT0 && VT == MVT::i1 && isOneConstant(N2)) {
5380 SDValue NOTNode = DAG.getNOT(SDLoc(N0), N0, VT);
5381 AddToWorklist(NOTNode.getNode());
5382 return DAG.getNode(ISD::OR, SDLoc(N), VT, NOTNode, N1);
5384 // fold (select X, Y, X) -> (and X, Y)
5385 // fold (select X, Y, 0) -> (and X, Y)
5386 if (VT == VT0 && VT == MVT::i1 && (N0 == N2 || isNullConstant(N2)))
5387 return DAG.getNode(ISD::AND, SDLoc(N), VT, N0, N1);
5389 // If we can fold this based on the true/false value, do so.
5390 if (SimplifySelectOps(N, N1, N2))
5391 return SDValue(N, 0); // Don't revisit N.
5393 if (VT0 == MVT::i1) {
5394 // The code in this block deals with the following 2 equivalences:
5395 // select(C0|C1, x, y) <=> select(C0, x, select(C1, x, y))
5396 // select(C0&C1, x, y) <=> select(C0, select(C1, x, y), y)
5397 // The target can specify its preferred form with the
5398 // shouldNormalizeToSelectSequence() callback. However we always transform
5399 // to the right anyway if we find the inner select exists in the DAG anyway
5400 // and we always transform to the left side if we know that we can further
5401 // optimize the combination of the conditions.
5402 bool normalizeToSequence
5403 = TLI.shouldNormalizeToSelectSequence(*DAG.getContext(), VT);
5404 // select (and Cond0, Cond1), X, Y
5405 // -> select Cond0, (select Cond1, X, Y), Y
5406 if (N0->getOpcode() == ISD::AND && N0->hasOneUse()) {
5407 SDValue Cond0 = N0->getOperand(0);
5408 SDValue Cond1 = N0->getOperand(1);
5409 SDValue InnerSelect = DAG.getNode(ISD::SELECT, SDLoc(N),
5410 N1.getValueType(), Cond1, N1, N2);
5411 if (normalizeToSequence || !InnerSelect.use_empty())
5412 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), Cond0,
5415 // select (or Cond0, Cond1), X, Y -> select Cond0, X, (select Cond1, X, Y)
5416 if (N0->getOpcode() == ISD::OR && N0->hasOneUse()) {
5417 SDValue Cond0 = N0->getOperand(0);
5418 SDValue Cond1 = N0->getOperand(1);
5419 SDValue InnerSelect = DAG.getNode(ISD::SELECT, SDLoc(N),
5420 N1.getValueType(), Cond1, N1, N2);
5421 if (normalizeToSequence || !InnerSelect.use_empty())
5422 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), Cond0, N1,
5426 // select Cond0, (select Cond1, X, Y), Y -> select (and Cond0, Cond1), X, Y
5427 if (N1->getOpcode() == ISD::SELECT && N1->hasOneUse()) {
5428 SDValue N1_0 = N1->getOperand(0);
5429 SDValue N1_1 = N1->getOperand(1);
5430 SDValue N1_2 = N1->getOperand(2);
5431 if (N1_2 == N2 && N0.getValueType() == N1_0.getValueType()) {
5432 // Create the actual and node if we can generate good code for it.
5433 if (!normalizeToSequence) {
5434 SDValue And = DAG.getNode(ISD::AND, SDLoc(N), N0.getValueType(),
5436 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), And,
5439 // Otherwise see if we can optimize the "and" to a better pattern.
5440 if (SDValue Combined = visitANDLike(N0, N1_0, N))
5441 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), Combined,
5445 // select Cond0, X, (select Cond1, X, Y) -> select (or Cond0, Cond1), X, Y
5446 if (N2->getOpcode() == ISD::SELECT && N2->hasOneUse()) {
5447 SDValue N2_0 = N2->getOperand(0);
5448 SDValue N2_1 = N2->getOperand(1);
5449 SDValue N2_2 = N2->getOperand(2);
5450 if (N2_1 == N1 && N0.getValueType() == N2_0.getValueType()) {
5451 // Create the actual or node if we can generate good code for it.
5452 if (!normalizeToSequence) {
5453 SDValue Or = DAG.getNode(ISD::OR, SDLoc(N), N0.getValueType(),
5455 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), Or,
5458 // Otherwise see if we can optimize to a better pattern.
5459 if (SDValue Combined = visitORLike(N0, N2_0, N))
5460 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(), Combined,
5466 // select (xor Cond, 1), X, Y -> select Cond, Y, X
5467 if (VT0 == MVT::i1) {
5468 if (N0->getOpcode() == ISD::XOR) {
5469 if (auto *C = dyn_cast<ConstantSDNode>(N0->getOperand(1))) {
5470 SDValue Cond0 = N0->getOperand(0);
5472 return DAG.getNode(ISD::SELECT, SDLoc(N), N1.getValueType(),
5478 // fold selects based on a setcc into other things, such as min/max/abs
5479 if (N0.getOpcode() == ISD::SETCC) {
5480 // select x, y (fcmp lt x, y) -> fminnum x, y
5481 // select x, y (fcmp gt x, y) -> fmaxnum x, y
5483 // This is OK if we don't care about what happens if either operand is a
5487 // FIXME: Instead of testing for UnsafeFPMath, this should be checking for
5488 // no signed zeros as well as no nans.
5489 const TargetOptions &Options = DAG.getTarget().Options;
5490 if (Options.UnsafeFPMath &&
5491 VT.isFloatingPoint() && N0.hasOneUse() &&
5492 DAG.isKnownNeverNaN(N1) && DAG.isKnownNeverNaN(N2)) {
5493 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
5495 if (SDValue FMinMax = combineMinNumMaxNum(SDLoc(N), VT, N0.getOperand(0),
5496 N0.getOperand(1), N1, N2, CC,
5501 if ((!LegalOperations &&
5502 TLI.isOperationLegalOrCustom(ISD::SELECT_CC, VT)) ||
5503 TLI.isOperationLegal(ISD::SELECT_CC, VT))
5504 return DAG.getNode(ISD::SELECT_CC, SDLoc(N), VT,
5505 N0.getOperand(0), N0.getOperand(1),
5506 N1, N2, N0.getOperand(2));
5507 return SimplifySelect(SDLoc(N), N0, N1, N2);
5514 std::pair<SDValue, SDValue> SplitVSETCC(const SDNode *N, SelectionDAG &DAG) {
5517 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0));
5519 // Split the inputs.
5520 SDValue Lo, Hi, LL, LH, RL, RH;
5521 std::tie(LL, LH) = DAG.SplitVectorOperand(N, 0);
5522 std::tie(RL, RH) = DAG.SplitVectorOperand(N, 1);
5524 Lo = DAG.getNode(N->getOpcode(), DL, LoVT, LL, RL, N->getOperand(2));
5525 Hi = DAG.getNode(N->getOpcode(), DL, HiVT, LH, RH, N->getOperand(2));
5527 return std::make_pair(Lo, Hi);
5530 // This function assumes all the vselect's arguments are CONCAT_VECTOR
5531 // nodes and that the condition is a BV of ConstantSDNodes (or undefs).
5532 static SDValue ConvertSelectToConcatVector(SDNode *N, SelectionDAG &DAG) {
5534 SDValue Cond = N->getOperand(0);
5535 SDValue LHS = N->getOperand(1);
5536 SDValue RHS = N->getOperand(2);
5537 EVT VT = N->getValueType(0);
5538 int NumElems = VT.getVectorNumElements();
5539 assert(LHS.getOpcode() == ISD::CONCAT_VECTORS &&
5540 RHS.getOpcode() == ISD::CONCAT_VECTORS &&
5541 Cond.getOpcode() == ISD::BUILD_VECTOR);
5543 // CONCAT_VECTOR can take an arbitrary number of arguments. We only care about
5544 // binary ones here.
5545 if (LHS->getNumOperands() != 2 || RHS->getNumOperands() != 2)
5548 // We're sure we have an even number of elements due to the
5549 // concat_vectors we have as arguments to vselect.
5550 // Skip BV elements until we find one that's not an UNDEF
5551 // After we find an UNDEF element, keep looping until we get to half the
5552 // length of the BV and see if all the non-undef nodes are the same.
5553 ConstantSDNode *BottomHalf = nullptr;
5554 for (int i = 0; i < NumElems / 2; ++i) {
5555 if (Cond->getOperand(i)->isUndef())
5558 if (BottomHalf == nullptr)
5559 BottomHalf = cast<ConstantSDNode>(Cond.getOperand(i));
5560 else if (Cond->getOperand(i).getNode() != BottomHalf)
5564 // Do the same for the second half of the BuildVector
5565 ConstantSDNode *TopHalf = nullptr;
5566 for (int i = NumElems / 2; i < NumElems; ++i) {
5567 if (Cond->getOperand(i)->isUndef())
5570 if (TopHalf == nullptr)
5571 TopHalf = cast<ConstantSDNode>(Cond.getOperand(i));
5572 else if (Cond->getOperand(i).getNode() != TopHalf)
5576 assert(TopHalf && BottomHalf &&
5577 "One half of the selector was all UNDEFs and the other was all the "
5578 "same value. This should have been addressed before this function.");
5580 ISD::CONCAT_VECTORS, DL, VT,
5581 BottomHalf->isNullValue() ? RHS->getOperand(0) : LHS->getOperand(0),
5582 TopHalf->isNullValue() ? RHS->getOperand(1) : LHS->getOperand(1));
5585 SDValue DAGCombiner::visitMSCATTER(SDNode *N) {
5587 if (Level >= AfterLegalizeTypes)
5590 MaskedScatterSDNode *MSC = cast<MaskedScatterSDNode>(N);
5591 SDValue Mask = MSC->getMask();
5592 SDValue Data = MSC->getValue();
5595 // If the MSCATTER data type requires splitting and the mask is provided by a
5596 // SETCC, then split both nodes and its operands before legalization. This
5597 // prevents the type legalizer from unrolling SETCC into scalar comparisons
5598 // and enables future optimizations (e.g. min/max pattern matching on X86).
5599 if (Mask.getOpcode() != ISD::SETCC)
5602 // Check if any splitting is required.
5603 if (TLI.getTypeAction(*DAG.getContext(), Data.getValueType()) !=
5604 TargetLowering::TypeSplitVector)
5606 SDValue MaskLo, MaskHi, Lo, Hi;
5607 std::tie(MaskLo, MaskHi) = SplitVSETCC(Mask.getNode(), DAG);
5610 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(MSC->getValueType(0));
5612 SDValue Chain = MSC->getChain();
5614 EVT MemoryVT = MSC->getMemoryVT();
5615 unsigned Alignment = MSC->getOriginalAlignment();
5617 EVT LoMemVT, HiMemVT;
5618 std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT);
5620 SDValue DataLo, DataHi;
5621 std::tie(DataLo, DataHi) = DAG.SplitVector(Data, DL);
5623 SDValue BasePtr = MSC->getBasePtr();
5624 SDValue IndexLo, IndexHi;
5625 std::tie(IndexLo, IndexHi) = DAG.SplitVector(MSC->getIndex(), DL);
5627 MachineMemOperand *MMO = DAG.getMachineFunction().
5628 getMachineMemOperand(MSC->getPointerInfo(),
5629 MachineMemOperand::MOStore, LoMemVT.getStoreSize(),
5630 Alignment, MSC->getAAInfo(), MSC->getRanges());
5632 SDValue OpsLo[] = { Chain, DataLo, MaskLo, BasePtr, IndexLo };
5633 Lo = DAG.getMaskedScatter(DAG.getVTList(MVT::Other), DataLo.getValueType(),
5636 SDValue OpsHi[] = {Chain, DataHi, MaskHi, BasePtr, IndexHi};
5637 Hi = DAG.getMaskedScatter(DAG.getVTList(MVT::Other), DataHi.getValueType(),
5640 AddToWorklist(Lo.getNode());
5641 AddToWorklist(Hi.getNode());
5643 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo, Hi);
5646 SDValue DAGCombiner::visitMSTORE(SDNode *N) {
5648 if (Level >= AfterLegalizeTypes)
5651 MaskedStoreSDNode *MST = dyn_cast<MaskedStoreSDNode>(N);
5652 SDValue Mask = MST->getMask();
5653 SDValue Data = MST->getValue();
5654 EVT VT = Data.getValueType();
5657 // If the MSTORE data type requires splitting and the mask is provided by a
5658 // SETCC, then split both nodes and its operands before legalization. This
5659 // prevents the type legalizer from unrolling SETCC into scalar comparisons
5660 // and enables future optimizations (e.g. min/max pattern matching on X86).
5661 if (Mask.getOpcode() == ISD::SETCC) {
5663 // Check if any splitting is required.
5664 if (TLI.getTypeAction(*DAG.getContext(), VT) !=
5665 TargetLowering::TypeSplitVector)
5668 SDValue MaskLo, MaskHi, Lo, Hi;
5669 std::tie(MaskLo, MaskHi) = SplitVSETCC(Mask.getNode(), DAG);
5671 SDValue Chain = MST->getChain();
5672 SDValue Ptr = MST->getBasePtr();
5674 EVT MemoryVT = MST->getMemoryVT();
5675 unsigned Alignment = MST->getOriginalAlignment();
5677 // if Alignment is equal to the vector size,
5678 // take the half of it for the second part
5679 unsigned SecondHalfAlignment =
5680 (Alignment == VT.getSizeInBits() / 8) ? Alignment / 2 : Alignment;
5682 EVT LoMemVT, HiMemVT;
5683 std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT);
5685 SDValue DataLo, DataHi;
5686 std::tie(DataLo, DataHi) = DAG.SplitVector(Data, DL);
5688 MachineMemOperand *MMO = DAG.getMachineFunction().
5689 getMachineMemOperand(MST->getPointerInfo(),
5690 MachineMemOperand::MOStore, LoMemVT.getStoreSize(),
5691 Alignment, MST->getAAInfo(), MST->getRanges());
5693 Lo = DAG.getMaskedStore(Chain, DL, DataLo, Ptr, MaskLo, LoMemVT, MMO,
5694 MST->isTruncatingStore(),
5695 MST->isCompressingStore());
5697 Ptr = TLI.IncrementMemoryAddress(Ptr, MaskLo, DL, LoMemVT, DAG,
5698 MST->isCompressingStore());
5700 MMO = DAG.getMachineFunction().
5701 getMachineMemOperand(MST->getPointerInfo(),
5702 MachineMemOperand::MOStore, HiMemVT.getStoreSize(),
5703 SecondHalfAlignment, MST->getAAInfo(),
5706 Hi = DAG.getMaskedStore(Chain, DL, DataHi, Ptr, MaskHi, HiMemVT, MMO,
5707 MST->isTruncatingStore(),
5708 MST->isCompressingStore());
5710 AddToWorklist(Lo.getNode());
5711 AddToWorklist(Hi.getNode());
5713 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo, Hi);
5718 SDValue DAGCombiner::visitMGATHER(SDNode *N) {
5720 if (Level >= AfterLegalizeTypes)
5723 MaskedGatherSDNode *MGT = dyn_cast<MaskedGatherSDNode>(N);
5724 SDValue Mask = MGT->getMask();
5727 // If the MGATHER result requires splitting and the mask is provided by a
5728 // SETCC, then split both nodes and its operands before legalization. This
5729 // prevents the type legalizer from unrolling SETCC into scalar comparisons
5730 // and enables future optimizations (e.g. min/max pattern matching on X86).
5732 if (Mask.getOpcode() != ISD::SETCC)
5735 EVT VT = N->getValueType(0);
5737 // Check if any splitting is required.
5738 if (TLI.getTypeAction(*DAG.getContext(), VT) !=
5739 TargetLowering::TypeSplitVector)
5742 SDValue MaskLo, MaskHi, Lo, Hi;
5743 std::tie(MaskLo, MaskHi) = SplitVSETCC(Mask.getNode(), DAG);
5745 SDValue Src0 = MGT->getValue();
5746 SDValue Src0Lo, Src0Hi;
5747 std::tie(Src0Lo, Src0Hi) = DAG.SplitVector(Src0, DL);
5750 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(VT);
5752 SDValue Chain = MGT->getChain();
5753 EVT MemoryVT = MGT->getMemoryVT();
5754 unsigned Alignment = MGT->getOriginalAlignment();
5756 EVT LoMemVT, HiMemVT;
5757 std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT);
5759 SDValue BasePtr = MGT->getBasePtr();
5760 SDValue Index = MGT->getIndex();
5761 SDValue IndexLo, IndexHi;
5762 std::tie(IndexLo, IndexHi) = DAG.SplitVector(Index, DL);
5764 MachineMemOperand *MMO = DAG.getMachineFunction().
5765 getMachineMemOperand(MGT->getPointerInfo(),
5766 MachineMemOperand::MOLoad, LoMemVT.getStoreSize(),
5767 Alignment, MGT->getAAInfo(), MGT->getRanges());
5769 SDValue OpsLo[] = { Chain, Src0Lo, MaskLo, BasePtr, IndexLo };
5770 Lo = DAG.getMaskedGather(DAG.getVTList(LoVT, MVT::Other), LoVT, DL, OpsLo,
5773 SDValue OpsHi[] = {Chain, Src0Hi, MaskHi, BasePtr, IndexHi};
5774 Hi = DAG.getMaskedGather(DAG.getVTList(HiVT, MVT::Other), HiVT, DL, OpsHi,
5777 AddToWorklist(Lo.getNode());
5778 AddToWorklist(Hi.getNode());
5780 // Build a factor node to remember that this load is independent of the
5782 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo.getValue(1),
5785 // Legalized the chain result - switch anything that used the old chain to
5787 DAG.ReplaceAllUsesOfValueWith(SDValue(MGT, 1), Chain);
5789 SDValue GatherRes = DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
5791 SDValue RetOps[] = { GatherRes, Chain };
5792 return DAG.getMergeValues(RetOps, DL);
5795 SDValue DAGCombiner::visitMLOAD(SDNode *N) {
5797 if (Level >= AfterLegalizeTypes)
5800 MaskedLoadSDNode *MLD = dyn_cast<MaskedLoadSDNode>(N);
5801 SDValue Mask = MLD->getMask();
5804 // If the MLOAD result requires splitting and the mask is provided by a
5805 // SETCC, then split both nodes and its operands before legalization. This
5806 // prevents the type legalizer from unrolling SETCC into scalar comparisons
5807 // and enables future optimizations (e.g. min/max pattern matching on X86).
5809 if (Mask.getOpcode() == ISD::SETCC) {
5810 EVT VT = N->getValueType(0);
5812 // Check if any splitting is required.
5813 if (TLI.getTypeAction(*DAG.getContext(), VT) !=
5814 TargetLowering::TypeSplitVector)
5817 SDValue MaskLo, MaskHi, Lo, Hi;
5818 std::tie(MaskLo, MaskHi) = SplitVSETCC(Mask.getNode(), DAG);
5820 SDValue Src0 = MLD->getSrc0();
5821 SDValue Src0Lo, Src0Hi;
5822 std::tie(Src0Lo, Src0Hi) = DAG.SplitVector(Src0, DL);
5825 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(MLD->getValueType(0));
5827 SDValue Chain = MLD->getChain();
5828 SDValue Ptr = MLD->getBasePtr();
5829 EVT MemoryVT = MLD->getMemoryVT();
5830 unsigned Alignment = MLD->getOriginalAlignment();
5832 // if Alignment is equal to the vector size,
5833 // take the half of it for the second part
5834 unsigned SecondHalfAlignment =
5835 (Alignment == MLD->getValueType(0).getSizeInBits()/8) ?
5836 Alignment/2 : Alignment;
5838 EVT LoMemVT, HiMemVT;
5839 std::tie(LoMemVT, HiMemVT) = DAG.GetSplitDestVTs(MemoryVT);
5841 MachineMemOperand *MMO = DAG.getMachineFunction().
5842 getMachineMemOperand(MLD->getPointerInfo(),
5843 MachineMemOperand::MOLoad, LoMemVT.getStoreSize(),
5844 Alignment, MLD->getAAInfo(), MLD->getRanges());
5846 Lo = DAG.getMaskedLoad(LoVT, DL, Chain, Ptr, MaskLo, Src0Lo, LoMemVT, MMO,
5847 ISD::NON_EXTLOAD, MLD->isExpandingLoad());
5849 Ptr = TLI.IncrementMemoryAddress(Ptr, MaskLo, DL, LoMemVT, DAG,
5850 MLD->isExpandingLoad());
5852 MMO = DAG.getMachineFunction().
5853 getMachineMemOperand(MLD->getPointerInfo(),
5854 MachineMemOperand::MOLoad, HiMemVT.getStoreSize(),
5855 SecondHalfAlignment, MLD->getAAInfo(), MLD->getRanges());
5857 Hi = DAG.getMaskedLoad(HiVT, DL, Chain, Ptr, MaskHi, Src0Hi, HiMemVT, MMO,
5858 ISD::NON_EXTLOAD, MLD->isExpandingLoad());
5860 AddToWorklist(Lo.getNode());
5861 AddToWorklist(Hi.getNode());
5863 // Build a factor node to remember that this load is independent of the
5865 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Lo.getValue(1),
5868 // Legalized the chain result - switch anything that used the old chain to
5870 DAG.ReplaceAllUsesOfValueWith(SDValue(MLD, 1), Chain);
5872 SDValue LoadRes = DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
5874 SDValue RetOps[] = { LoadRes, Chain };
5875 return DAG.getMergeValues(RetOps, DL);
5880 SDValue DAGCombiner::visitVSELECT(SDNode *N) {
5881 SDValue N0 = N->getOperand(0);
5882 SDValue N1 = N->getOperand(1);
5883 SDValue N2 = N->getOperand(2);
5886 // fold (vselect C, X, X) -> X
5890 // Canonicalize integer abs.
5891 // vselect (setg[te] X, 0), X, -X ->
5892 // vselect (setgt X, -1), X, -X ->
5893 // vselect (setl[te] X, 0), -X, X ->
5894 // Y = sra (X, size(X)-1); xor (add (X, Y), Y)
5895 if (N0.getOpcode() == ISD::SETCC) {
5896 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1);
5897 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
5899 bool RHSIsAllZeros = ISD::isBuildVectorAllZeros(RHS.getNode());
5901 if (((RHSIsAllZeros && (CC == ISD::SETGT || CC == ISD::SETGE)) ||
5902 (ISD::isBuildVectorAllOnes(RHS.getNode()) && CC == ISD::SETGT)) &&
5903 N1 == LHS && N2.getOpcode() == ISD::SUB && N1 == N2.getOperand(1))
5904 isAbs = ISD::isBuildVectorAllZeros(N2.getOperand(0).getNode());
5905 else if ((RHSIsAllZeros && (CC == ISD::SETLT || CC == ISD::SETLE)) &&
5906 N2 == LHS && N1.getOpcode() == ISD::SUB && N2 == N1.getOperand(1))
5907 isAbs = ISD::isBuildVectorAllZeros(N1.getOperand(0).getNode());
5910 EVT VT = LHS.getValueType();
5911 SDValue Shift = DAG.getNode(
5912 ISD::SRA, DL, VT, LHS,
5913 DAG.getConstant(VT.getScalarSizeInBits() - 1, DL, VT));
5914 SDValue Add = DAG.getNode(ISD::ADD, DL, VT, LHS, Shift);
5915 AddToWorklist(Shift.getNode());
5916 AddToWorklist(Add.getNode());
5917 return DAG.getNode(ISD::XOR, DL, VT, Add, Shift);
5921 if (SimplifySelectOps(N, N1, N2))
5922 return SDValue(N, 0); // Don't revisit N.
5924 // If the VSELECT result requires splitting and the mask is provided by a
5925 // SETCC, then split both nodes and its operands before legalization. This
5926 // prevents the type legalizer from unrolling SETCC into scalar comparisons
5927 // and enables future optimizations (e.g. min/max pattern matching on X86).
5928 if (N0.getOpcode() == ISD::SETCC) {
5929 EVT VT = N->getValueType(0);
5931 // Check if any splitting is required.
5932 if (TLI.getTypeAction(*DAG.getContext(), VT) !=
5933 TargetLowering::TypeSplitVector)
5936 SDValue Lo, Hi, CCLo, CCHi, LL, LH, RL, RH;
5937 std::tie(CCLo, CCHi) = SplitVSETCC(N0.getNode(), DAG);
5938 std::tie(LL, LH) = DAG.SplitVectorOperand(N, 1);
5939 std::tie(RL, RH) = DAG.SplitVectorOperand(N, 2);
5941 Lo = DAG.getNode(N->getOpcode(), DL, LL.getValueType(), CCLo, LL, RL);
5942 Hi = DAG.getNode(N->getOpcode(), DL, LH.getValueType(), CCHi, LH, RH);
5944 // Add the new VSELECT nodes to the work list in case they need to be split
5946 AddToWorklist(Lo.getNode());
5947 AddToWorklist(Hi.getNode());
5949 return DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, Lo, Hi);
5952 // Fold (vselect (build_vector all_ones), N1, N2) -> N1
5953 if (ISD::isBuildVectorAllOnes(N0.getNode()))
5955 // Fold (vselect (build_vector all_zeros), N1, N2) -> N2
5956 if (ISD::isBuildVectorAllZeros(N0.getNode()))
5959 // The ConvertSelectToConcatVector function is assuming both the above
5960 // checks for (vselect (build_vector all{ones,zeros) ...) have been made
5962 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
5963 N2.getOpcode() == ISD::CONCAT_VECTORS &&
5964 ISD::isBuildVectorOfConstantSDNodes(N0.getNode())) {
5965 if (SDValue CV = ConvertSelectToConcatVector(N, DAG))
5972 SDValue DAGCombiner::visitSELECT_CC(SDNode *N) {
5973 SDValue N0 = N->getOperand(0);
5974 SDValue N1 = N->getOperand(1);
5975 SDValue N2 = N->getOperand(2);
5976 SDValue N3 = N->getOperand(3);
5977 SDValue N4 = N->getOperand(4);
5978 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get();
5980 // fold select_cc lhs, rhs, x, x, cc -> x
5984 // Determine if the condition we're dealing with is constant
5985 if (SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), N0, N1,
5986 CC, SDLoc(N), false)) {
5987 AddToWorklist(SCC.getNode());
5989 if (ConstantSDNode *SCCC = dyn_cast<ConstantSDNode>(SCC.getNode())) {
5990 if (!SCCC->isNullValue())
5991 return N2; // cond always true -> true val
5993 return N3; // cond always false -> false val
5994 } else if (SCC->isUndef()) {
5995 // When the condition is UNDEF, just return the first operand. This is
5996 // coherent the DAG creation, no setcc node is created in this case
5998 } else if (SCC.getOpcode() == ISD::SETCC) {
5999 // Fold to a simpler select_cc
6000 return DAG.getNode(ISD::SELECT_CC, SDLoc(N), N2.getValueType(),
6001 SCC.getOperand(0), SCC.getOperand(1), N2, N3,
6006 // If we can fold this based on the true/false value, do so.
6007 if (SimplifySelectOps(N, N2, N3))
6008 return SDValue(N, 0); // Don't revisit N.
6010 // fold select_cc into other things, such as min/max/abs
6011 return SimplifySelectCC(SDLoc(N), N0, N1, N2, N3, CC);
6014 SDValue DAGCombiner::visitSETCC(SDNode *N) {
6015 return SimplifySetCC(N->getValueType(0), N->getOperand(0), N->getOperand(1),
6016 cast<CondCodeSDNode>(N->getOperand(2))->get(),
6020 SDValue DAGCombiner::visitSETCCE(SDNode *N) {
6021 SDValue LHS = N->getOperand(0);
6022 SDValue RHS = N->getOperand(1);
6023 SDValue Carry = N->getOperand(2);
6024 SDValue Cond = N->getOperand(3);
6026 // If Carry is false, fold to a regular SETCC.
6027 if (Carry.getOpcode() == ISD::CARRY_FALSE)
6028 return DAG.getNode(ISD::SETCC, SDLoc(N), N->getVTList(), LHS, RHS, Cond);
6033 /// Try to fold a sext/zext/aext dag node into a ConstantSDNode or
6034 /// a build_vector of constants.
6035 /// This function is called by the DAGCombiner when visiting sext/zext/aext
6036 /// dag nodes (see for example method DAGCombiner::visitSIGN_EXTEND).
6037 /// Vector extends are not folded if operations are legal; this is to
6038 /// avoid introducing illegal build_vector dag nodes.
6039 static SDNode *tryToFoldExtendOfConstant(SDNode *N, const TargetLowering &TLI,
6040 SelectionDAG &DAG, bool LegalTypes,
6041 bool LegalOperations) {
6042 unsigned Opcode = N->getOpcode();
6043 SDValue N0 = N->getOperand(0);
6044 EVT VT = N->getValueType(0);
6046 assert((Opcode == ISD::SIGN_EXTEND || Opcode == ISD::ZERO_EXTEND ||
6047 Opcode == ISD::ANY_EXTEND || Opcode == ISD::SIGN_EXTEND_VECTOR_INREG ||
6048 Opcode == ISD::ZERO_EXTEND_VECTOR_INREG)
6049 && "Expected EXTEND dag node in input!");
6051 // fold (sext c1) -> c1
6052 // fold (zext c1) -> c1
6053 // fold (aext c1) -> c1
6054 if (isa<ConstantSDNode>(N0))
6055 return DAG.getNode(Opcode, SDLoc(N), VT, N0).getNode();
6057 // fold (sext (build_vector AllConstants) -> (build_vector AllConstants)
6058 // fold (zext (build_vector AllConstants) -> (build_vector AllConstants)
6059 // fold (aext (build_vector AllConstants) -> (build_vector AllConstants)
6060 EVT SVT = VT.getScalarType();
6061 if (!(VT.isVector() &&
6062 (!LegalTypes || (!LegalOperations && TLI.isTypeLegal(SVT))) &&
6063 ISD::isBuildVectorOfConstantSDNodes(N0.getNode())))
6066 // We can fold this node into a build_vector.
6067 unsigned VTBits = SVT.getSizeInBits();
6068 unsigned EVTBits = N0->getValueType(0).getScalarSizeInBits();
6069 SmallVector<SDValue, 8> Elts;
6070 unsigned NumElts = VT.getVectorNumElements();
6073 for (unsigned i=0; i != NumElts; ++i) {
6074 SDValue Op = N0->getOperand(i);
6075 if (Op->isUndef()) {
6076 Elts.push_back(DAG.getUNDEF(SVT));
6081 // Get the constant value and if needed trunc it to the size of the type.
6082 // Nodes like build_vector might have constants wider than the scalar type.
6083 APInt C = cast<ConstantSDNode>(Op)->getAPIntValue().zextOrTrunc(EVTBits);
6084 if (Opcode == ISD::SIGN_EXTEND || Opcode == ISD::SIGN_EXTEND_VECTOR_INREG)
6085 Elts.push_back(DAG.getConstant(C.sext(VTBits), DL, SVT));
6087 Elts.push_back(DAG.getConstant(C.zext(VTBits), DL, SVT));
6090 return DAG.getBuildVector(VT, DL, Elts).getNode();
6093 // ExtendUsesToFormExtLoad - Trying to extend uses of a load to enable this:
6094 // "fold ({s|z|a}ext (load x)) -> ({s|z|a}ext (truncate ({s|z|a}extload x)))"
6095 // transformation. Returns true if extension are possible and the above
6096 // mentioned transformation is profitable.
6097 static bool ExtendUsesToFormExtLoad(SDNode *N, SDValue N0,
6099 SmallVectorImpl<SDNode *> &ExtendNodes,
6100 const TargetLowering &TLI) {
6101 bool HasCopyToRegUses = false;
6102 bool isTruncFree = TLI.isTruncateFree(N->getValueType(0), N0.getValueType());
6103 for (SDNode::use_iterator UI = N0.getNode()->use_begin(),
6104 UE = N0.getNode()->use_end();
6109 if (UI.getUse().getResNo() != N0.getResNo())
6111 // FIXME: Only extend SETCC N, N and SETCC N, c for now.
6112 if (ExtOpc != ISD::ANY_EXTEND && User->getOpcode() == ISD::SETCC) {
6113 ISD::CondCode CC = cast<CondCodeSDNode>(User->getOperand(2))->get();
6114 if (ExtOpc == ISD::ZERO_EXTEND && ISD::isSignedIntSetCC(CC))
6115 // Sign bits will be lost after a zext.
6118 for (unsigned i = 0; i != 2; ++i) {
6119 SDValue UseOp = User->getOperand(i);
6122 if (!isa<ConstantSDNode>(UseOp))
6127 ExtendNodes.push_back(User);
6130 // If truncates aren't free and there are users we can't
6131 // extend, it isn't worthwhile.
6134 // Remember if this value is live-out.
6135 if (User->getOpcode() == ISD::CopyToReg)
6136 HasCopyToRegUses = true;
6139 if (HasCopyToRegUses) {
6140 bool BothLiveOut = false;
6141 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
6143 SDUse &Use = UI.getUse();
6144 if (Use.getResNo() == 0 && Use.getUser()->getOpcode() == ISD::CopyToReg) {
6150 // Both unextended and extended values are live out. There had better be
6151 // a good reason for the transformation.
6152 return ExtendNodes.size();
6157 void DAGCombiner::ExtendSetCCUses(const SmallVectorImpl<SDNode *> &SetCCs,
6158 SDValue Trunc, SDValue ExtLoad,
6159 const SDLoc &DL, ISD::NodeType ExtType) {
6160 // Extend SetCC uses if necessary.
6161 for (unsigned i = 0, e = SetCCs.size(); i != e; ++i) {
6162 SDNode *SetCC = SetCCs[i];
6163 SmallVector<SDValue, 4> Ops;
6165 for (unsigned j = 0; j != 2; ++j) {
6166 SDValue SOp = SetCC->getOperand(j);
6168 Ops.push_back(ExtLoad);
6170 Ops.push_back(DAG.getNode(ExtType, DL, ExtLoad->getValueType(0), SOp));
6173 Ops.push_back(SetCC->getOperand(2));
6174 CombineTo(SetCC, DAG.getNode(ISD::SETCC, DL, SetCC->getValueType(0), Ops));
6178 // FIXME: Bring more similar combines here, common to sext/zext (maybe aext?).
6179 SDValue DAGCombiner::CombineExtLoad(SDNode *N) {
6180 SDValue N0 = N->getOperand(0);
6181 EVT DstVT = N->getValueType(0);
6182 EVT SrcVT = N0.getValueType();
6184 assert((N->getOpcode() == ISD::SIGN_EXTEND ||
6185 N->getOpcode() == ISD::ZERO_EXTEND) &&
6186 "Unexpected node type (not an extend)!");
6188 // fold (sext (load x)) to multiple smaller sextloads; same for zext.
6189 // For example, on a target with legal v4i32, but illegal v8i32, turn:
6190 // (v8i32 (sext (v8i16 (load x))))
6192 // (v8i32 (concat_vectors (v4i32 (sextload x)),
6193 // (v4i32 (sextload (x + 16)))))
6194 // Where uses of the original load, i.e.:
6196 // are replaced with:
6198 // (v8i32 (concat_vectors (v4i32 (sextload x)),
6199 // (v4i32 (sextload (x + 16)))))))
6201 // This combine is only applicable to illegal, but splittable, vectors.
6202 // All legal types, and illegal non-vector types, are handled elsewhere.
6203 // This combine is controlled by TargetLowering::isVectorLoadExtDesirable.
6205 if (N0->getOpcode() != ISD::LOAD)
6208 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6210 if (!ISD::isNON_EXTLoad(LN0) || !ISD::isUNINDEXEDLoad(LN0) ||
6211 !N0.hasOneUse() || LN0->isVolatile() || !DstVT.isVector() ||
6212 !DstVT.isPow2VectorType() || !TLI.isVectorLoadExtDesirable(SDValue(N, 0)))
6215 SmallVector<SDNode *, 4> SetCCs;
6216 if (!ExtendUsesToFormExtLoad(N, N0, N->getOpcode(), SetCCs, TLI))
6219 ISD::LoadExtType ExtType =
6220 N->getOpcode() == ISD::SIGN_EXTEND ? ISD::SEXTLOAD : ISD::ZEXTLOAD;
6222 // Try to split the vector types to get down to legal types.
6223 EVT SplitSrcVT = SrcVT;
6224 EVT SplitDstVT = DstVT;
6225 while (!TLI.isLoadExtLegalOrCustom(ExtType, SplitDstVT, SplitSrcVT) &&
6226 SplitSrcVT.getVectorNumElements() > 1) {
6227 SplitDstVT = DAG.GetSplitDestVTs(SplitDstVT).first;
6228 SplitSrcVT = DAG.GetSplitDestVTs(SplitSrcVT).first;
6231 if (!TLI.isLoadExtLegalOrCustom(ExtType, SplitDstVT, SplitSrcVT))
6235 const unsigned NumSplits =
6236 DstVT.getVectorNumElements() / SplitDstVT.getVectorNumElements();
6237 const unsigned Stride = SplitSrcVT.getStoreSize();
6238 SmallVector<SDValue, 4> Loads;
6239 SmallVector<SDValue, 4> Chains;
6241 SDValue BasePtr = LN0->getBasePtr();
6242 for (unsigned Idx = 0; Idx < NumSplits; Idx++) {
6243 const unsigned Offset = Idx * Stride;
6244 const unsigned Align = MinAlign(LN0->getAlignment(), Offset);
6246 SDValue SplitLoad = DAG.getExtLoad(
6247 ExtType, DL, SplitDstVT, LN0->getChain(), BasePtr,
6248 LN0->getPointerInfo().getWithOffset(Offset), SplitSrcVT, Align,
6249 LN0->getMemOperand()->getFlags(), LN0->getAAInfo());
6251 BasePtr = DAG.getNode(ISD::ADD, DL, BasePtr.getValueType(), BasePtr,
6252 DAG.getConstant(Stride, DL, BasePtr.getValueType()));
6254 Loads.push_back(SplitLoad.getValue(0));
6255 Chains.push_back(SplitLoad.getValue(1));
6258 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
6259 SDValue NewValue = DAG.getNode(ISD::CONCAT_VECTORS, DL, DstVT, Loads);
6261 CombineTo(N, NewValue);
6263 // Replace uses of the original load (before extension)
6264 // with a truncate of the concatenated sextloaded vectors.
6266 DAG.getNode(ISD::TRUNCATE, SDLoc(N0), N0.getValueType(), NewValue);
6267 CombineTo(N0.getNode(), Trunc, NewChain);
6268 ExtendSetCCUses(SetCCs, Trunc, NewValue, DL,
6269 (ISD::NodeType)N->getOpcode());
6270 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6273 SDValue DAGCombiner::visitSIGN_EXTEND(SDNode *N) {
6274 SDValue N0 = N->getOperand(0);
6275 EVT VT = N->getValueType(0);
6277 if (SDNode *Res = tryToFoldExtendOfConstant(N, TLI, DAG, LegalTypes,
6279 return SDValue(Res, 0);
6281 // fold (sext (sext x)) -> (sext x)
6282 // fold (sext (aext x)) -> (sext x)
6283 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
6284 return DAG.getNode(ISD::SIGN_EXTEND, SDLoc(N), VT,
6287 if (N0.getOpcode() == ISD::TRUNCATE) {
6288 // fold (sext (truncate (load x))) -> (sext (smaller load x))
6289 // fold (sext (truncate (srl (load x), c))) -> (sext (smaller load (x+c/n)))
6290 if (SDValue NarrowLoad = ReduceLoadWidth(N0.getNode())) {
6291 SDNode *oye = N0.getOperand(0).getNode();
6292 if (NarrowLoad.getNode() != N0.getNode()) {
6293 CombineTo(N0.getNode(), NarrowLoad);
6294 // CombineTo deleted the truncate, if needed, but not what's under it.
6297 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6300 // See if the value being truncated is already sign extended. If so, just
6301 // eliminate the trunc/sext pair.
6302 SDValue Op = N0.getOperand(0);
6303 unsigned OpBits = Op.getScalarValueSizeInBits();
6304 unsigned MidBits = N0.getScalarValueSizeInBits();
6305 unsigned DestBits = VT.getScalarSizeInBits();
6306 unsigned NumSignBits = DAG.ComputeNumSignBits(Op);
6308 if (OpBits == DestBits) {
6309 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign
6310 // bits, it is already ready.
6311 if (NumSignBits > DestBits-MidBits)
6313 } else if (OpBits < DestBits) {
6314 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign
6315 // bits, just sext from i32.
6316 if (NumSignBits > OpBits-MidBits)
6317 return DAG.getNode(ISD::SIGN_EXTEND, SDLoc(N), VT, Op);
6319 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign
6320 // bits, just truncate to i32.
6321 if (NumSignBits > OpBits-MidBits)
6322 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, Op);
6325 // fold (sext (truncate x)) -> (sextinreg x).
6326 if (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG,
6327 N0.getValueType())) {
6328 if (OpBits < DestBits)
6329 Op = DAG.getNode(ISD::ANY_EXTEND, SDLoc(N0), VT, Op);
6330 else if (OpBits > DestBits)
6331 Op = DAG.getNode(ISD::TRUNCATE, SDLoc(N0), VT, Op);
6332 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), VT, Op,
6333 DAG.getValueType(N0.getValueType()));
6337 // fold (sext (load x)) -> (sext (truncate (sextload x)))
6338 // Only generate vector extloads when 1) they're legal, and 2) they are
6339 // deemed desirable by the target.
6340 if (ISD::isNON_EXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
6341 ((!LegalOperations && !VT.isVector() &&
6342 !cast<LoadSDNode>(N0)->isVolatile()) ||
6343 TLI.isLoadExtLegal(ISD::SEXTLOAD, VT, N0.getValueType()))) {
6344 bool DoXform = true;
6345 SmallVector<SDNode*, 4> SetCCs;
6346 if (!N0.hasOneUse())
6347 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::SIGN_EXTEND, SetCCs, TLI);
6349 DoXform &= TLI.isVectorLoadExtDesirable(SDValue(N, 0));
6351 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6352 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, SDLoc(N), VT,
6354 LN0->getBasePtr(), N0.getValueType(),
6355 LN0->getMemOperand());
6356 CombineTo(N, ExtLoad);
6357 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, SDLoc(N0),
6358 N0.getValueType(), ExtLoad);
6359 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
6360 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, SDLoc(N),
6362 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6366 // fold (sext (load x)) to multiple smaller sextloads.
6367 // Only on illegal but splittable vectors.
6368 if (SDValue ExtLoad = CombineExtLoad(N))
6371 // fold (sext (sextload x)) -> (sext (truncate (sextload x)))
6372 // fold (sext ( extload x)) -> (sext (truncate (sextload x)))
6373 if ((ISD::isSEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) &&
6374 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) {
6375 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6376 EVT MemVT = LN0->getMemoryVT();
6377 if ((!LegalOperations && !LN0->isVolatile()) ||
6378 TLI.isLoadExtLegal(ISD::SEXTLOAD, VT, MemVT)) {
6379 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, SDLoc(N), VT,
6381 LN0->getBasePtr(), MemVT,
6382 LN0->getMemOperand());
6383 CombineTo(N, ExtLoad);
6384 CombineTo(N0.getNode(),
6385 DAG.getNode(ISD::TRUNCATE, SDLoc(N0),
6386 N0.getValueType(), ExtLoad),
6387 ExtLoad.getValue(1));
6388 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6392 // fold (sext (and/or/xor (load x), cst)) ->
6393 // (and/or/xor (sextload x), (sext cst))
6394 if ((N0.getOpcode() == ISD::AND || N0.getOpcode() == ISD::OR ||
6395 N0.getOpcode() == ISD::XOR) &&
6396 isa<LoadSDNode>(N0.getOperand(0)) &&
6397 N0.getOperand(1).getOpcode() == ISD::Constant &&
6398 TLI.isLoadExtLegal(ISD::SEXTLOAD, VT, N0.getValueType()) &&
6399 (!LegalOperations && TLI.isOperationLegal(N0.getOpcode(), VT))) {
6400 LoadSDNode *LN0 = cast<LoadSDNode>(N0.getOperand(0));
6401 if (LN0->getExtensionType() != ISD::ZEXTLOAD && LN0->isUnindexed()) {
6402 bool DoXform = true;
6403 SmallVector<SDNode*, 4> SetCCs;
6404 if (!N0.hasOneUse())
6405 DoXform = ExtendUsesToFormExtLoad(N, N0.getOperand(0), ISD::SIGN_EXTEND,
6408 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, SDLoc(LN0), VT,
6409 LN0->getChain(), LN0->getBasePtr(),
6411 LN0->getMemOperand());
6412 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
6413 Mask = Mask.sext(VT.getSizeInBits());
6415 SDValue And = DAG.getNode(N0.getOpcode(), DL, VT,
6416 ExtLoad, DAG.getConstant(Mask, DL, VT));
6417 SDValue Trunc = DAG.getNode(ISD::TRUNCATE,
6418 SDLoc(N0.getOperand(0)),
6419 N0.getOperand(0).getValueType(), ExtLoad);
6421 CombineTo(N0.getOperand(0).getNode(), Trunc, ExtLoad.getValue(1));
6422 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, DL,
6424 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6429 if (N0.getOpcode() == ISD::SETCC) {
6430 EVT N0VT = N0.getOperand(0).getValueType();
6431 // sext(setcc) -> sext_in_reg(vsetcc) for vectors.
6432 // Only do this before legalize for now.
6433 if (VT.isVector() && !LegalOperations &&
6434 TLI.getBooleanContents(N0VT) ==
6435 TargetLowering::ZeroOrNegativeOneBooleanContent) {
6436 // On some architectures (such as SSE/NEON/etc) the SETCC result type is
6437 // of the same size as the compared operands. Only optimize sext(setcc())
6438 // if this is the case.
6439 EVT SVT = getSetCCResultType(N0VT);
6441 // We know that the # elements of the results is the same as the
6442 // # elements of the compare (and the # elements of the compare result
6443 // for that matter). Check to see that they are the same size. If so,
6444 // we know that the element size of the sext'd result matches the
6445 // element size of the compare operands.
6446 if (VT.getSizeInBits() == SVT.getSizeInBits())
6447 return DAG.getSetCC(SDLoc(N), VT, N0.getOperand(0),
6449 cast<CondCodeSDNode>(N0.getOperand(2))->get());
6451 // If the desired elements are smaller or larger than the source
6452 // elements we can use a matching integer vector type and then
6453 // truncate/sign extend
6454 EVT MatchingVectorType = N0VT.changeVectorElementTypeToInteger();
6455 if (SVT == MatchingVectorType) {
6456 SDValue VsetCC = DAG.getSetCC(SDLoc(N), MatchingVectorType,
6457 N0.getOperand(0), N0.getOperand(1),
6458 cast<CondCodeSDNode>(N0.getOperand(2))->get());
6459 return DAG.getSExtOrTrunc(VsetCC, SDLoc(N), VT);
6463 // sext(setcc x, y, cc) -> (select (setcc x, y, cc), T, 0)
6464 // Here, T can be 1 or -1, depending on the type of the setcc and
6465 // getBooleanContents().
6466 unsigned SetCCWidth = N0.getScalarValueSizeInBits();
6469 // To determine the "true" side of the select, we need to know the high bit
6470 // of the value returned by the setcc if it evaluates to true.
6471 // If the type of the setcc is i1, then the true case of the select is just
6472 // sext(i1 1), that is, -1.
6473 // If the type of the setcc is larger (say, i8) then the value of the high
6474 // bit depends on getBooleanContents(). So, ask TLI for a real "true" value
6475 // of the appropriate width.
6476 SDValue ExtTrueVal =
6478 ? DAG.getConstant(APInt::getAllOnesValue(VT.getScalarSizeInBits()),
6480 : TLI.getConstTrueVal(DAG, VT, DL);
6482 if (SDValue SCC = SimplifySelectCC(
6483 DL, N0.getOperand(0), N0.getOperand(1), ExtTrueVal,
6484 DAG.getConstant(0, DL, VT),
6485 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true))
6488 if (!VT.isVector()) {
6489 EVT SetCCVT = getSetCCResultType(N0.getOperand(0).getValueType());
6490 if (!LegalOperations ||
6491 TLI.isOperationLegal(ISD::SETCC, N0.getOperand(0).getValueType())) {
6493 ISD::CondCode CC = cast<CondCodeSDNode>(N0.getOperand(2))->get();
6495 DAG.getSetCC(DL, SetCCVT, N0.getOperand(0), N0.getOperand(1), CC);
6496 return DAG.getSelect(DL, VT, SetCC, ExtTrueVal,
6497 DAG.getConstant(0, DL, VT));
6502 // fold (sext x) -> (zext x) if the sign bit is known zero.
6503 if ((!LegalOperations || TLI.isOperationLegal(ISD::ZERO_EXTEND, VT)) &&
6504 DAG.SignBitIsZero(N0))
6505 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N), VT, N0);
6510 // isTruncateOf - If N is a truncate of some other value, return true, record
6511 // the value being truncated in Op and which of Op's bits are zero in KnownZero.
6512 // This function computes KnownZero to avoid a duplicated call to
6513 // computeKnownBits in the caller.
6514 static bool isTruncateOf(SelectionDAG &DAG, SDValue N, SDValue &Op,
6517 if (N->getOpcode() == ISD::TRUNCATE) {
6518 Op = N->getOperand(0);
6519 DAG.computeKnownBits(Op, KnownZero, KnownOne);
6523 if (N->getOpcode() != ISD::SETCC || N->getValueType(0) != MVT::i1 ||
6524 cast<CondCodeSDNode>(N->getOperand(2))->get() != ISD::SETNE)
6527 SDValue Op0 = N->getOperand(0);
6528 SDValue Op1 = N->getOperand(1);
6529 assert(Op0.getValueType() == Op1.getValueType());
6531 if (isNullConstant(Op0))
6533 else if (isNullConstant(Op1))
6538 DAG.computeKnownBits(Op, KnownZero, KnownOne);
6540 if (!(KnownZero | APInt(Op.getValueSizeInBits(), 1)).isAllOnesValue())
6546 SDValue DAGCombiner::visitZERO_EXTEND(SDNode *N) {
6547 SDValue N0 = N->getOperand(0);
6548 EVT VT = N->getValueType(0);
6550 if (SDNode *Res = tryToFoldExtendOfConstant(N, TLI, DAG, LegalTypes,
6552 return SDValue(Res, 0);
6554 // fold (zext (zext x)) -> (zext x)
6555 // fold (zext (aext x)) -> (zext x)
6556 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND)
6557 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N), VT,
6560 // fold (zext (truncate x)) -> (zext x) or
6561 // (zext (truncate x)) -> (truncate x)
6562 // This is valid when the truncated bits of x are already zero.
6563 // FIXME: We should extend this to work for vectors too.
6566 if (!VT.isVector() && isTruncateOf(DAG, N0, Op, KnownZero)) {
6567 APInt TruncatedBits =
6568 (Op.getValueSizeInBits() == N0.getValueSizeInBits()) ?
6569 APInt(Op.getValueSizeInBits(), 0) :
6570 APInt::getBitsSet(Op.getValueSizeInBits(),
6571 N0.getValueSizeInBits(),
6572 std::min(Op.getValueSizeInBits(),
6573 VT.getSizeInBits()));
6574 if (TruncatedBits == (KnownZero & TruncatedBits)) {
6575 if (VT.bitsGT(Op.getValueType()))
6576 return DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N), VT, Op);
6577 if (VT.bitsLT(Op.getValueType()))
6578 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, Op);
6584 // fold (zext (truncate (load x))) -> (zext (smaller load x))
6585 // fold (zext (truncate (srl (load x), c))) -> (zext (small load (x+c/n)))
6586 if (N0.getOpcode() == ISD::TRUNCATE) {
6587 if (SDValue NarrowLoad = ReduceLoadWidth(N0.getNode())) {
6588 SDNode *oye = N0.getOperand(0).getNode();
6589 if (NarrowLoad.getNode() != N0.getNode()) {
6590 CombineTo(N0.getNode(), NarrowLoad);
6591 // CombineTo deleted the truncate, if needed, but not what's under it.
6594 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6598 // fold (zext (truncate x)) -> (and x, mask)
6599 if (N0.getOpcode() == ISD::TRUNCATE) {
6600 // fold (zext (truncate (load x))) -> (zext (smaller load x))
6601 // fold (zext (truncate (srl (load x), c))) -> (zext (smaller load (x+c/n)))
6602 if (SDValue NarrowLoad = ReduceLoadWidth(N0.getNode())) {
6603 SDNode *oye = N0.getOperand(0).getNode();
6604 if (NarrowLoad.getNode() != N0.getNode()) {
6605 CombineTo(N0.getNode(), NarrowLoad);
6606 // CombineTo deleted the truncate, if needed, but not what's under it.
6609 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6612 EVT SrcVT = N0.getOperand(0).getValueType();
6613 EVT MinVT = N0.getValueType();
6615 // Try to mask before the extension to avoid having to generate a larger mask,
6616 // possibly over several sub-vectors.
6617 if (SrcVT.bitsLT(VT)) {
6618 if (!LegalOperations || (TLI.isOperationLegal(ISD::AND, SrcVT) &&
6619 TLI.isOperationLegal(ISD::ZERO_EXTEND, VT))) {
6620 SDValue Op = N0.getOperand(0);
6621 Op = DAG.getZeroExtendInReg(Op, SDLoc(N), MinVT.getScalarType());
6622 AddToWorklist(Op.getNode());
6623 return DAG.getZExtOrTrunc(Op, SDLoc(N), VT);
6627 if (!LegalOperations || TLI.isOperationLegal(ISD::AND, VT)) {
6628 SDValue Op = N0.getOperand(0);
6629 if (SrcVT.bitsLT(VT)) {
6630 Op = DAG.getNode(ISD::ANY_EXTEND, SDLoc(N), VT, Op);
6631 AddToWorklist(Op.getNode());
6632 } else if (SrcVT.bitsGT(VT)) {
6633 Op = DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, Op);
6634 AddToWorklist(Op.getNode());
6636 return DAG.getZeroExtendInReg(Op, SDLoc(N), MinVT.getScalarType());
6640 // Fold (zext (and (trunc x), cst)) -> (and x, cst),
6641 // if either of the casts is not free.
6642 if (N0.getOpcode() == ISD::AND &&
6643 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
6644 N0.getOperand(1).getOpcode() == ISD::Constant &&
6645 (!TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(),
6646 N0.getValueType()) ||
6647 !TLI.isZExtFree(N0.getValueType(), VT))) {
6648 SDValue X = N0.getOperand(0).getOperand(0);
6649 if (X.getValueType().bitsLT(VT)) {
6650 X = DAG.getNode(ISD::ANY_EXTEND, SDLoc(X), VT, X);
6651 } else if (X.getValueType().bitsGT(VT)) {
6652 X = DAG.getNode(ISD::TRUNCATE, SDLoc(X), VT, X);
6654 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
6655 Mask = Mask.zext(VT.getSizeInBits());
6657 return DAG.getNode(ISD::AND, DL, VT,
6658 X, DAG.getConstant(Mask, DL, VT));
6661 // fold (zext (load x)) -> (zext (truncate (zextload x)))
6662 // Only generate vector extloads when 1) they're legal, and 2) they are
6663 // deemed desirable by the target.
6664 if (ISD::isNON_EXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
6665 ((!LegalOperations && !VT.isVector() &&
6666 !cast<LoadSDNode>(N0)->isVolatile()) ||
6667 TLI.isLoadExtLegal(ISD::ZEXTLOAD, VT, N0.getValueType()))) {
6668 bool DoXform = true;
6669 SmallVector<SDNode*, 4> SetCCs;
6670 if (!N0.hasOneUse())
6671 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ZERO_EXTEND, SetCCs, TLI);
6673 DoXform &= TLI.isVectorLoadExtDesirable(SDValue(N, 0));
6675 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6676 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(N), VT,
6678 LN0->getBasePtr(), N0.getValueType(),
6679 LN0->getMemOperand());
6680 CombineTo(N, ExtLoad);
6681 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, SDLoc(N0),
6682 N0.getValueType(), ExtLoad);
6683 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
6685 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, SDLoc(N),
6687 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6691 // fold (zext (load x)) to multiple smaller zextloads.
6692 // Only on illegal but splittable vectors.
6693 if (SDValue ExtLoad = CombineExtLoad(N))
6696 // fold (zext (and/or/xor (load x), cst)) ->
6697 // (and/or/xor (zextload x), (zext cst))
6698 // Unless (and (load x) cst) will match as a zextload already and has
6699 // additional users.
6700 if ((N0.getOpcode() == ISD::AND || N0.getOpcode() == ISD::OR ||
6701 N0.getOpcode() == ISD::XOR) &&
6702 isa<LoadSDNode>(N0.getOperand(0)) &&
6703 N0.getOperand(1).getOpcode() == ISD::Constant &&
6704 TLI.isLoadExtLegal(ISD::ZEXTLOAD, VT, N0.getValueType()) &&
6705 (!LegalOperations && TLI.isOperationLegal(N0.getOpcode(), VT))) {
6706 LoadSDNode *LN0 = cast<LoadSDNode>(N0.getOperand(0));
6707 if (LN0->getExtensionType() != ISD::SEXTLOAD && LN0->isUnindexed()) {
6708 bool DoXform = true;
6709 SmallVector<SDNode*, 4> SetCCs;
6710 if (!N0.hasOneUse()) {
6711 if (N0.getOpcode() == ISD::AND) {
6712 auto *AndC = cast<ConstantSDNode>(N0.getOperand(1));
6713 auto NarrowLoad = false;
6714 EVT LoadResultTy = AndC->getValueType(0);
6715 EVT ExtVT, LoadedVT;
6716 if (isAndLoadExtLoad(AndC, LN0, LoadResultTy, ExtVT, LoadedVT,
6721 DoXform = ExtendUsesToFormExtLoad(N, N0.getOperand(0),
6722 ISD::ZERO_EXTEND, SetCCs, TLI);
6725 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(LN0), VT,
6726 LN0->getChain(), LN0->getBasePtr(),
6728 LN0->getMemOperand());
6729 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
6730 Mask = Mask.zext(VT.getSizeInBits());
6732 SDValue And = DAG.getNode(N0.getOpcode(), DL, VT,
6733 ExtLoad, DAG.getConstant(Mask, DL, VT));
6734 SDValue Trunc = DAG.getNode(ISD::TRUNCATE,
6735 SDLoc(N0.getOperand(0)),
6736 N0.getOperand(0).getValueType(), ExtLoad);
6738 CombineTo(N0.getOperand(0).getNode(), Trunc, ExtLoad.getValue(1));
6739 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, DL,
6741 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6746 // fold (zext (zextload x)) -> (zext (truncate (zextload x)))
6747 // fold (zext ( extload x)) -> (zext (truncate (zextload x)))
6748 if ((ISD::isZEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) &&
6749 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) {
6750 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6751 EVT MemVT = LN0->getMemoryVT();
6752 if ((!LegalOperations && !LN0->isVolatile()) ||
6753 TLI.isLoadExtLegal(ISD::ZEXTLOAD, VT, MemVT)) {
6754 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, SDLoc(N), VT,
6756 LN0->getBasePtr(), MemVT,
6757 LN0->getMemOperand());
6758 CombineTo(N, ExtLoad);
6759 CombineTo(N0.getNode(),
6760 DAG.getNode(ISD::TRUNCATE, SDLoc(N0), N0.getValueType(),
6762 ExtLoad.getValue(1));
6763 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6767 if (N0.getOpcode() == ISD::SETCC) {
6768 // Only do this before legalize for now.
6769 if (!LegalOperations && VT.isVector() &&
6770 N0.getValueType().getVectorElementType() == MVT::i1) {
6771 EVT N00VT = N0.getOperand(0).getValueType();
6772 if (getSetCCResultType(N00VT) == N0.getValueType())
6775 // We know that the # elements of the results is the same as the #
6776 // elements of the compare (and the # elements of the compare result for
6777 // that matter). Check to see that they are the same size. If so, we know
6778 // that the element size of the sext'd result matches the element size of
6779 // the compare operands.
6781 SDValue VecOnes = DAG.getConstant(1, DL, VT);
6782 if (VT.getSizeInBits() == N00VT.getSizeInBits()) {
6783 // zext(setcc) -> (and (vsetcc), (1, 1, ...) for vectors.
6784 SDValue VSetCC = DAG.getNode(ISD::SETCC, DL, VT, N0.getOperand(0),
6785 N0.getOperand(1), N0.getOperand(2));
6786 return DAG.getNode(ISD::AND, DL, VT, VSetCC, VecOnes);
6789 // If the desired elements are smaller or larger than the source
6790 // elements we can use a matching integer vector type and then
6791 // truncate/sign extend.
6792 EVT MatchingElementType = EVT::getIntegerVT(
6793 *DAG.getContext(), N00VT.getScalarSizeInBits());
6794 EVT MatchingVectorType = EVT::getVectorVT(
6795 *DAG.getContext(), MatchingElementType, N00VT.getVectorNumElements());
6797 DAG.getNode(ISD::SETCC, DL, MatchingVectorType, N0.getOperand(0),
6798 N0.getOperand(1), N0.getOperand(2));
6799 return DAG.getNode(ISD::AND, DL, VT, DAG.getSExtOrTrunc(VsetCC, DL, VT),
6803 // zext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc
6805 if (SDValue SCC = SimplifySelectCC(
6806 DL, N0.getOperand(0), N0.getOperand(1), DAG.getConstant(1, DL, VT),
6807 DAG.getConstant(0, DL, VT),
6808 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true))
6812 // (zext (shl (zext x), cst)) -> (shl (zext x), cst)
6813 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL) &&
6814 isa<ConstantSDNode>(N0.getOperand(1)) &&
6815 N0.getOperand(0).getOpcode() == ISD::ZERO_EXTEND &&
6817 SDValue ShAmt = N0.getOperand(1);
6818 unsigned ShAmtVal = cast<ConstantSDNode>(ShAmt)->getZExtValue();
6819 if (N0.getOpcode() == ISD::SHL) {
6820 SDValue InnerZExt = N0.getOperand(0);
6821 // If the original shl may be shifting out bits, do not perform this
6823 unsigned KnownZeroBits = InnerZExt.getValueSizeInBits() -
6824 InnerZExt.getOperand(0).getValueSizeInBits();
6825 if (ShAmtVal > KnownZeroBits)
6831 // Ensure that the shift amount is wide enough for the shifted value.
6832 if (VT.getSizeInBits() >= 256)
6833 ShAmt = DAG.getNode(ISD::ZERO_EXTEND, DL, MVT::i32, ShAmt);
6835 return DAG.getNode(N0.getOpcode(), DL, VT,
6836 DAG.getNode(ISD::ZERO_EXTEND, DL, VT, N0.getOperand(0)),
6843 SDValue DAGCombiner::visitANY_EXTEND(SDNode *N) {
6844 SDValue N0 = N->getOperand(0);
6845 EVT VT = N->getValueType(0);
6847 if (SDNode *Res = tryToFoldExtendOfConstant(N, TLI, DAG, LegalTypes,
6849 return SDValue(Res, 0);
6851 // fold (aext (aext x)) -> (aext x)
6852 // fold (aext (zext x)) -> (zext x)
6853 // fold (aext (sext x)) -> (sext x)
6854 if (N0.getOpcode() == ISD::ANY_EXTEND ||
6855 N0.getOpcode() == ISD::ZERO_EXTEND ||
6856 N0.getOpcode() == ISD::SIGN_EXTEND)
6857 return DAG.getNode(N0.getOpcode(), SDLoc(N), VT, N0.getOperand(0));
6859 // fold (aext (truncate (load x))) -> (aext (smaller load x))
6860 // fold (aext (truncate (srl (load x), c))) -> (aext (small load (x+c/n)))
6861 if (N0.getOpcode() == ISD::TRUNCATE) {
6862 if (SDValue NarrowLoad = ReduceLoadWidth(N0.getNode())) {
6863 SDNode *oye = N0.getOperand(0).getNode();
6864 if (NarrowLoad.getNode() != N0.getNode()) {
6865 CombineTo(N0.getNode(), NarrowLoad);
6866 // CombineTo deleted the truncate, if needed, but not what's under it.
6869 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6873 // fold (aext (truncate x))
6874 if (N0.getOpcode() == ISD::TRUNCATE) {
6875 SDValue TruncOp = N0.getOperand(0);
6876 if (TruncOp.getValueType() == VT)
6877 return TruncOp; // x iff x size == zext size.
6878 if (TruncOp.getValueType().bitsGT(VT))
6879 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, TruncOp);
6880 return DAG.getNode(ISD::ANY_EXTEND, SDLoc(N), VT, TruncOp);
6883 // Fold (aext (and (trunc x), cst)) -> (and x, cst)
6884 // if the trunc is not free.
6885 if (N0.getOpcode() == ISD::AND &&
6886 N0.getOperand(0).getOpcode() == ISD::TRUNCATE &&
6887 N0.getOperand(1).getOpcode() == ISD::Constant &&
6888 !TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(),
6889 N0.getValueType())) {
6891 SDValue X = N0.getOperand(0).getOperand(0);
6892 if (X.getValueType().bitsLT(VT)) {
6893 X = DAG.getNode(ISD::ANY_EXTEND, DL, VT, X);
6894 } else if (X.getValueType().bitsGT(VT)) {
6895 X = DAG.getNode(ISD::TRUNCATE, DL, VT, X);
6897 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue();
6898 Mask = Mask.zext(VT.getSizeInBits());
6899 return DAG.getNode(ISD::AND, DL, VT,
6900 X, DAG.getConstant(Mask, DL, VT));
6903 // fold (aext (load x)) -> (aext (truncate (extload x)))
6904 // None of the supported targets knows how to perform load and any_ext
6905 // on vectors in one instruction. We only perform this transformation on
6907 if (ISD::isNON_EXTLoad(N0.getNode()) && !VT.isVector() &&
6908 ISD::isUNINDEXEDLoad(N0.getNode()) &&
6909 TLI.isLoadExtLegal(ISD::EXTLOAD, VT, N0.getValueType())) {
6910 bool DoXform = true;
6911 SmallVector<SDNode*, 4> SetCCs;
6912 if (!N0.hasOneUse())
6913 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ANY_EXTEND, SetCCs, TLI);
6915 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6916 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, SDLoc(N), VT,
6918 LN0->getBasePtr(), N0.getValueType(),
6919 LN0->getMemOperand());
6920 CombineTo(N, ExtLoad);
6921 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, SDLoc(N0),
6922 N0.getValueType(), ExtLoad);
6923 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1));
6924 ExtendSetCCUses(SetCCs, Trunc, ExtLoad, SDLoc(N),
6926 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6930 // fold (aext (zextload x)) -> (aext (truncate (zextload x)))
6931 // fold (aext (sextload x)) -> (aext (truncate (sextload x)))
6932 // fold (aext ( extload x)) -> (aext (truncate (extload x)))
6933 if (N0.getOpcode() == ISD::LOAD &&
6934 !ISD::isNON_EXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
6936 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
6937 ISD::LoadExtType ExtType = LN0->getExtensionType();
6938 EVT MemVT = LN0->getMemoryVT();
6939 if (!LegalOperations || TLI.isLoadExtLegal(ExtType, VT, MemVT)) {
6940 SDValue ExtLoad = DAG.getExtLoad(ExtType, SDLoc(N),
6941 VT, LN0->getChain(), LN0->getBasePtr(),
6942 MemVT, LN0->getMemOperand());
6943 CombineTo(N, ExtLoad);
6944 CombineTo(N0.getNode(),
6945 DAG.getNode(ISD::TRUNCATE, SDLoc(N0),
6946 N0.getValueType(), ExtLoad),
6947 ExtLoad.getValue(1));
6948 return SDValue(N, 0); // Return N so it doesn't get rechecked!
6952 if (N0.getOpcode() == ISD::SETCC) {
6954 // aext(setcc) -> vsetcc
6955 // aext(setcc) -> truncate(vsetcc)
6956 // aext(setcc) -> aext(vsetcc)
6957 // Only do this before legalize for now.
6958 if (VT.isVector() && !LegalOperations) {
6959 EVT N0VT = N0.getOperand(0).getValueType();
6960 // We know that the # elements of the results is the same as the
6961 // # elements of the compare (and the # elements of the compare result
6962 // for that matter). Check to see that they are the same size. If so,
6963 // we know that the element size of the sext'd result matches the
6964 // element size of the compare operands.
6965 if (VT.getSizeInBits() == N0VT.getSizeInBits())
6966 return DAG.getSetCC(SDLoc(N), VT, N0.getOperand(0),
6968 cast<CondCodeSDNode>(N0.getOperand(2))->get());
6969 // If the desired elements are smaller or larger than the source
6970 // elements we can use a matching integer vector type and then
6971 // truncate/any extend
6973 EVT MatchingVectorType = N0VT.changeVectorElementTypeToInteger();
6975 DAG.getSetCC(SDLoc(N), MatchingVectorType, N0.getOperand(0),
6977 cast<CondCodeSDNode>(N0.getOperand(2))->get());
6978 return DAG.getAnyExtOrTrunc(VsetCC, SDLoc(N), VT);
6982 // aext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc
6984 if (SDValue SCC = SimplifySelectCC(
6985 DL, N0.getOperand(0), N0.getOperand(1), DAG.getConstant(1, DL, VT),
6986 DAG.getConstant(0, DL, VT),
6987 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true))
6994 /// See if the specified operand can be simplified with the knowledge that only
6995 /// the bits specified by Mask are used. If so, return the simpler operand,
6996 /// otherwise return a null SDValue.
6997 SDValue DAGCombiner::GetDemandedBits(SDValue V, const APInt &Mask) {
6998 switch (V.getOpcode()) {
7000 case ISD::Constant: {
7001 const ConstantSDNode *CV = cast<ConstantSDNode>(V.getNode());
7002 assert(CV && "Const value should be ConstSDNode.");
7003 const APInt &CVal = CV->getAPIntValue();
7004 APInt NewVal = CVal & Mask;
7006 return DAG.getConstant(NewVal, SDLoc(V), V.getValueType());
7011 // If the LHS or RHS don't contribute bits to the or, drop them.
7012 if (DAG.MaskedValueIsZero(V.getOperand(0), Mask))
7013 return V.getOperand(1);
7014 if (DAG.MaskedValueIsZero(V.getOperand(1), Mask))
7015 return V.getOperand(0);
7018 // Only look at single-use SRLs.
7019 if (!V.getNode()->hasOneUse())
7021 if (ConstantSDNode *RHSC = getAsNonOpaqueConstant(V.getOperand(1))) {
7022 // See if we can recursively simplify the LHS.
7023 unsigned Amt = RHSC->getZExtValue();
7025 // Watch out for shift count overflow though.
7026 if (Amt >= Mask.getBitWidth()) break;
7027 APInt NewMask = Mask << Amt;
7028 if (SDValue SimplifyLHS = GetDemandedBits(V.getOperand(0), NewMask))
7029 return DAG.getNode(ISD::SRL, SDLoc(V), V.getValueType(),
7030 SimplifyLHS, V.getOperand(1));
7036 /// If the result of a wider load is shifted to right of N bits and then
7037 /// truncated to a narrower type and where N is a multiple of number of bits of
7038 /// the narrower type, transform it to a narrower load from address + N / num of
7039 /// bits of new type. If the result is to be extended, also fold the extension
7040 /// to form a extending load.
7041 SDValue DAGCombiner::ReduceLoadWidth(SDNode *N) {
7042 unsigned Opc = N->getOpcode();
7044 ISD::LoadExtType ExtType = ISD::NON_EXTLOAD;
7045 SDValue N0 = N->getOperand(0);
7046 EVT VT = N->getValueType(0);
7049 // This transformation isn't valid for vector loads.
7053 // Special case: SIGN_EXTEND_INREG is basically truncating to ExtVT then
7055 if (Opc == ISD::SIGN_EXTEND_INREG) {
7056 ExtType = ISD::SEXTLOAD;
7057 ExtVT = cast<VTSDNode>(N->getOperand(1))->getVT();
7058 } else if (Opc == ISD::SRL) {
7059 // Another special-case: SRL is basically zero-extending a narrower value.
7060 ExtType = ISD::ZEXTLOAD;
7062 ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1));
7063 if (!N01) return SDValue();
7064 ExtVT = EVT::getIntegerVT(*DAG.getContext(),
7065 VT.getSizeInBits() - N01->getZExtValue());
7067 if (LegalOperations && !TLI.isLoadExtLegal(ExtType, VT, ExtVT))
7070 unsigned EVTBits = ExtVT.getSizeInBits();
7072 // Do not generate loads of non-round integer types since these can
7073 // be expensive (and would be wrong if the type is not byte sized).
7074 if (!ExtVT.isRound())
7078 if (N0.getOpcode() == ISD::SRL && N0.hasOneUse()) {
7079 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
7080 ShAmt = N01->getZExtValue();
7081 // Is the shift amount a multiple of size of VT?
7082 if ((ShAmt & (EVTBits-1)) == 0) {
7083 N0 = N0.getOperand(0);
7084 // Is the load width a multiple of size of VT?
7085 if ((N0.getValueSizeInBits() & (EVTBits-1)) != 0)
7089 // At this point, we must have a load or else we can't do the transform.
7090 if (!isa<LoadSDNode>(N0)) return SDValue();
7092 // Because a SRL must be assumed to *need* to zero-extend the high bits
7093 // (as opposed to anyext the high bits), we can't combine the zextload
7094 // lowering of SRL and an sextload.
7095 if (cast<LoadSDNode>(N0)->getExtensionType() == ISD::SEXTLOAD)
7098 // If the shift amount is larger than the input type then we're not
7099 // accessing any of the loaded bytes. If the load was a zextload/extload
7100 // then the result of the shift+trunc is zero/undef (handled elsewhere).
7101 if (ShAmt >= cast<LoadSDNode>(N0)->getMemoryVT().getSizeInBits())
7106 // If the load is shifted left (and the result isn't shifted back right),
7107 // we can fold the truncate through the shift.
7108 unsigned ShLeftAmt = 0;
7109 if (ShAmt == 0 && N0.getOpcode() == ISD::SHL && N0.hasOneUse() &&
7110 ExtVT == VT && TLI.isNarrowingProfitable(N0.getValueType(), VT)) {
7111 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) {
7112 ShLeftAmt = N01->getZExtValue();
7113 N0 = N0.getOperand(0);
7117 // If we haven't found a load, we can't narrow it. Don't transform one with
7118 // multiple uses, this would require adding a new load.
7119 if (!isa<LoadSDNode>(N0) || !N0.hasOneUse())
7122 // Don't change the width of a volatile load.
7123 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
7124 if (LN0->isVolatile())
7127 // Verify that we are actually reducing a load width here.
7128 if (LN0->getMemoryVT().getSizeInBits() < EVTBits)
7131 // For the transform to be legal, the load must produce only two values
7132 // (the value loaded and the chain). Don't transform a pre-increment
7133 // load, for example, which produces an extra value. Otherwise the
7134 // transformation is not equivalent, and the downstream logic to replace
7135 // uses gets things wrong.
7136 if (LN0->getNumValues() > 2)
7139 // If the load that we're shrinking is an extload and we're not just
7140 // discarding the extension we can't simply shrink the load. Bail.
7141 // TODO: It would be possible to merge the extensions in some cases.
7142 if (LN0->getExtensionType() != ISD::NON_EXTLOAD &&
7143 LN0->getMemoryVT().getSizeInBits() < ExtVT.getSizeInBits() + ShAmt)
7146 if (!TLI.shouldReduceLoadWidth(LN0, ExtType, ExtVT))
7149 EVT PtrType = N0.getOperand(1).getValueType();
7151 if (PtrType == MVT::Untyped || PtrType.isExtended())
7152 // It's not possible to generate a constant of extended or untyped type.
7155 // For big endian targets, we need to adjust the offset to the pointer to
7156 // load the correct bytes.
7157 if (DAG.getDataLayout().isBigEndian()) {
7158 unsigned LVTStoreBits = LN0->getMemoryVT().getStoreSizeInBits();
7159 unsigned EVTStoreBits = ExtVT.getStoreSizeInBits();
7160 ShAmt = LVTStoreBits - EVTStoreBits - ShAmt;
7163 uint64_t PtrOff = ShAmt / 8;
7164 unsigned NewAlign = MinAlign(LN0->getAlignment(), PtrOff);
7166 // The original load itself didn't wrap, so an offset within it doesn't.
7168 Flags.setNoUnsignedWrap(true);
7169 SDValue NewPtr = DAG.getNode(ISD::ADD, DL,
7170 PtrType, LN0->getBasePtr(),
7171 DAG.getConstant(PtrOff, DL, PtrType),
7173 AddToWorklist(NewPtr.getNode());
7176 if (ExtType == ISD::NON_EXTLOAD)
7177 Load = DAG.getLoad(VT, SDLoc(N0), LN0->getChain(), NewPtr,
7178 LN0->getPointerInfo().getWithOffset(PtrOff), NewAlign,
7179 LN0->getMemOperand()->getFlags(), LN0->getAAInfo());
7181 Load = DAG.getExtLoad(ExtType, SDLoc(N0), VT, LN0->getChain(), NewPtr,
7182 LN0->getPointerInfo().getWithOffset(PtrOff), ExtVT,
7183 NewAlign, LN0->getMemOperand()->getFlags(),
7186 // Replace the old load's chain with the new load's chain.
7187 WorklistRemover DeadNodes(*this);
7188 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), Load.getValue(1));
7190 // Shift the result left, if we've swallowed a left shift.
7191 SDValue Result = Load;
7192 if (ShLeftAmt != 0) {
7193 EVT ShImmTy = getShiftAmountTy(Result.getValueType());
7194 if (!isUIntN(ShImmTy.getSizeInBits(), ShLeftAmt))
7196 // If the shift amount is as large as the result size (but, presumably,
7197 // no larger than the source) then the useful bits of the result are
7198 // zero; we can't simply return the shortened shift, because the result
7199 // of that operation is undefined.
7201 if (ShLeftAmt >= VT.getSizeInBits())
7202 Result = DAG.getConstant(0, DL, VT);
7204 Result = DAG.getNode(ISD::SHL, DL, VT,
7205 Result, DAG.getConstant(ShLeftAmt, DL, ShImmTy));
7208 // Return the new loaded value.
7212 SDValue DAGCombiner::visitSIGN_EXTEND_INREG(SDNode *N) {
7213 SDValue N0 = N->getOperand(0);
7214 SDValue N1 = N->getOperand(1);
7215 EVT VT = N->getValueType(0);
7216 EVT EVT = cast<VTSDNode>(N1)->getVT();
7217 unsigned VTBits = VT.getScalarSizeInBits();
7218 unsigned EVTBits = EVT.getScalarSizeInBits();
7221 return DAG.getUNDEF(VT);
7223 // fold (sext_in_reg c1) -> c1
7224 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
7225 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), VT, N0, N1);
7227 // If the input is already sign extended, just drop the extension.
7228 if (DAG.ComputeNumSignBits(N0) >= VTBits-EVTBits+1)
7231 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt2
7232 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG &&
7233 EVT.bitsLT(cast<VTSDNode>(N0.getOperand(1))->getVT()))
7234 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), VT,
7235 N0.getOperand(0), N1);
7237 // fold (sext_in_reg (sext x)) -> (sext x)
7238 // fold (sext_in_reg (aext x)) -> (sext x)
7239 // if x is small enough.
7240 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND) {
7241 SDValue N00 = N0.getOperand(0);
7242 if (N00.getScalarValueSizeInBits() <= EVTBits &&
7243 (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND, VT)))
7244 return DAG.getNode(ISD::SIGN_EXTEND, SDLoc(N), VT, N00, N1);
7247 // fold (sext_in_reg (zext x)) -> (sext x)
7248 // iff we are extending the source sign bit.
7249 if (N0.getOpcode() == ISD::ZERO_EXTEND) {
7250 SDValue N00 = N0.getOperand(0);
7251 if (N00.getScalarValueSizeInBits() == EVTBits &&
7252 (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND, VT)))
7253 return DAG.getNode(ISD::SIGN_EXTEND, SDLoc(N), VT, N00, N1);
7256 // fold (sext_in_reg x) -> (zext_in_reg x) if the sign bit is known zero.
7257 if (DAG.MaskedValueIsZero(N0, APInt::getBitsSet(VTBits, EVTBits-1, EVTBits)))
7258 return DAG.getZeroExtendInReg(N0, SDLoc(N), EVT.getScalarType());
7260 // fold operands of sext_in_reg based on knowledge that the top bits are not
7262 if (SimplifyDemandedBits(SDValue(N, 0)))
7263 return SDValue(N, 0);
7265 // fold (sext_in_reg (load x)) -> (smaller sextload x)
7266 // fold (sext_in_reg (srl (load x), c)) -> (smaller sextload (x+c/evtbits))
7267 if (SDValue NarrowLoad = ReduceLoadWidth(N))
7270 // fold (sext_in_reg (srl X, 24), i8) -> (sra X, 24)
7271 // fold (sext_in_reg (srl X, 23), i8) -> (sra X, 23) iff possible.
7272 // We already fold "(sext_in_reg (srl X, 25), i8) -> srl X, 25" above.
7273 if (N0.getOpcode() == ISD::SRL) {
7274 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(N0.getOperand(1)))
7275 if (ShAmt->getZExtValue()+EVTBits <= VTBits) {
7276 // We can turn this into an SRA iff the input to the SRL is already sign
7278 unsigned InSignBits = DAG.ComputeNumSignBits(N0.getOperand(0));
7279 if (VTBits-(ShAmt->getZExtValue()+EVTBits) < InSignBits)
7280 return DAG.getNode(ISD::SRA, SDLoc(N), VT,
7281 N0.getOperand(0), N0.getOperand(1));
7285 // fold (sext_inreg (extload x)) -> (sextload x)
7286 if (ISD::isEXTLoad(N0.getNode()) &&
7287 ISD::isUNINDEXEDLoad(N0.getNode()) &&
7288 EVT == cast<LoadSDNode>(N0)->getMemoryVT() &&
7289 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
7290 TLI.isLoadExtLegal(ISD::SEXTLOAD, VT, EVT))) {
7291 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
7292 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, SDLoc(N), VT,
7294 LN0->getBasePtr(), EVT,
7295 LN0->getMemOperand());
7296 CombineTo(N, ExtLoad);
7297 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
7298 AddToWorklist(ExtLoad.getNode());
7299 return SDValue(N, 0); // Return N so it doesn't get rechecked!
7301 // fold (sext_inreg (zextload x)) -> (sextload x) iff load has one use
7302 if (ISD::isZEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) &&
7304 EVT == cast<LoadSDNode>(N0)->getMemoryVT() &&
7305 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) ||
7306 TLI.isLoadExtLegal(ISD::SEXTLOAD, VT, EVT))) {
7307 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
7308 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, SDLoc(N), VT,
7310 LN0->getBasePtr(), EVT,
7311 LN0->getMemOperand());
7312 CombineTo(N, ExtLoad);
7313 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1));
7314 return SDValue(N, 0); // Return N so it doesn't get rechecked!
7317 // Form (sext_inreg (bswap >> 16)) or (sext_inreg (rotl (bswap) 16))
7318 if (EVTBits <= 16 && N0.getOpcode() == ISD::OR) {
7319 if (SDValue BSwap = MatchBSwapHWordLow(N0.getNode(), N0.getOperand(0),
7320 N0.getOperand(1), false))
7321 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N), VT,
7328 SDValue DAGCombiner::visitSIGN_EXTEND_VECTOR_INREG(SDNode *N) {
7329 SDValue N0 = N->getOperand(0);
7330 EVT VT = N->getValueType(0);
7333 return DAG.getUNDEF(VT);
7335 if (SDNode *Res = tryToFoldExtendOfConstant(N, TLI, DAG, LegalTypes,
7337 return SDValue(Res, 0);
7342 SDValue DAGCombiner::visitZERO_EXTEND_VECTOR_INREG(SDNode *N) {
7343 SDValue N0 = N->getOperand(0);
7344 EVT VT = N->getValueType(0);
7347 return DAG.getUNDEF(VT);
7349 if (SDNode *Res = tryToFoldExtendOfConstant(N, TLI, DAG, LegalTypes,
7351 return SDValue(Res, 0);
7356 SDValue DAGCombiner::visitTRUNCATE(SDNode *N) {
7357 SDValue N0 = N->getOperand(0);
7358 EVT VT = N->getValueType(0);
7359 bool isLE = DAG.getDataLayout().isLittleEndian();
7362 if (N0.getValueType() == N->getValueType(0))
7364 // fold (truncate c1) -> c1
7365 if (DAG.isConstantIntBuildVectorOrConstantInt(N0))
7366 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, N0);
7367 // fold (truncate (truncate x)) -> (truncate x)
7368 if (N0.getOpcode() == ISD::TRUNCATE)
7369 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, N0.getOperand(0));
7370 // fold (truncate (ext x)) -> (ext x) or (truncate x) or x
7371 if (N0.getOpcode() == ISD::ZERO_EXTEND ||
7372 N0.getOpcode() == ISD::SIGN_EXTEND ||
7373 N0.getOpcode() == ISD::ANY_EXTEND) {
7374 // if the source is smaller than the dest, we still need an extend.
7375 if (N0.getOperand(0).getValueType().bitsLT(VT))
7376 return DAG.getNode(N0.getOpcode(), SDLoc(N), VT, N0.getOperand(0));
7377 // if the source is larger than the dest, than we just need the truncate.
7378 if (N0.getOperand(0).getValueType().bitsGT(VT))
7379 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, N0.getOperand(0));
7380 // if the source and dest are the same type, we can drop both the extend
7381 // and the truncate.
7382 return N0.getOperand(0);
7385 // If this is anyext(trunc), don't fold it, allow ourselves to be folded.
7386 if (N->hasOneUse() && (N->use_begin()->getOpcode() == ISD::ANY_EXTEND))
7389 // Fold extract-and-trunc into a narrow extract. For example:
7390 // i64 x = EXTRACT_VECTOR_ELT(v2i64 val, i32 1)
7391 // i32 y = TRUNCATE(i64 x)
7393 // v16i8 b = BITCAST (v2i64 val)
7394 // i8 x = EXTRACT_VECTOR_ELT(v16i8 b, i32 8)
7396 // Note: We only run this optimization after type legalization (which often
7397 // creates this pattern) and before operation legalization after which
7398 // we need to be more careful about the vector instructions that we generate.
7399 if (N0.getOpcode() == ISD::EXTRACT_VECTOR_ELT &&
7400 LegalTypes && !LegalOperations && N0->hasOneUse() && VT != MVT::i1) {
7402 EVT VecTy = N0.getOperand(0).getValueType();
7403 EVT ExTy = N0.getValueType();
7404 EVT TrTy = N->getValueType(0);
7406 unsigned NumElem = VecTy.getVectorNumElements();
7407 unsigned SizeRatio = ExTy.getSizeInBits()/TrTy.getSizeInBits();
7409 EVT NVT = EVT::getVectorVT(*DAG.getContext(), TrTy, SizeRatio * NumElem);
7410 assert(NVT.getSizeInBits() == VecTy.getSizeInBits() && "Invalid Size");
7412 SDValue EltNo = N0->getOperand(1);
7413 if (isa<ConstantSDNode>(EltNo) && isTypeLegal(NVT)) {
7414 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
7415 EVT IndexTy = TLI.getVectorIdxTy(DAG.getDataLayout());
7416 int Index = isLE ? (Elt*SizeRatio) : (Elt*SizeRatio + (SizeRatio-1));
7419 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, DL, TrTy,
7420 DAG.getBitcast(NVT, N0.getOperand(0)),
7421 DAG.getConstant(Index, DL, IndexTy));
7425 // trunc (select c, a, b) -> select c, (trunc a), (trunc b)
7426 if (N0.getOpcode() == ISD::SELECT && N0.hasOneUse()) {
7427 EVT SrcVT = N0.getValueType();
7428 if ((!LegalOperations || TLI.isOperationLegal(ISD::SELECT, SrcVT)) &&
7429 TLI.isTruncateFree(SrcVT, VT)) {
7431 SDValue Cond = N0.getOperand(0);
7432 SDValue TruncOp0 = DAG.getNode(ISD::TRUNCATE, SL, VT, N0.getOperand(1));
7433 SDValue TruncOp1 = DAG.getNode(ISD::TRUNCATE, SL, VT, N0.getOperand(2));
7434 return DAG.getNode(ISD::SELECT, SDLoc(N), VT, Cond, TruncOp0, TruncOp1);
7438 // trunc (shl x, K) -> shl (trunc x), K => K < VT.getScalarSizeInBits()
7439 if (N0.getOpcode() == ISD::SHL && N0.hasOneUse() &&
7440 (!LegalOperations || TLI.isOperationLegalOrCustom(ISD::SHL, VT)) &&
7441 TLI.isTypeDesirableForOp(ISD::SHL, VT)) {
7442 if (const ConstantSDNode *CAmt = isConstOrConstSplat(N0.getOperand(1))) {
7443 uint64_t Amt = CAmt->getZExtValue();
7444 unsigned Size = VT.getScalarSizeInBits();
7448 EVT AmtVT = TLI.getShiftAmountTy(VT, DAG.getDataLayout());
7450 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, SL, VT, N0.getOperand(0));
7451 return DAG.getNode(ISD::SHL, SL, VT, Trunc,
7452 DAG.getConstant(Amt, SL, AmtVT));
7457 // Fold a series of buildvector, bitcast, and truncate if possible.
7459 // (2xi32 trunc (bitcast ((4xi32)buildvector x, x, y, y) 2xi64)) to
7460 // (2xi32 (buildvector x, y)).
7461 if (Level == AfterLegalizeVectorOps && VT.isVector() &&
7462 N0.getOpcode() == ISD::BITCAST && N0.hasOneUse() &&
7463 N0.getOperand(0).getOpcode() == ISD::BUILD_VECTOR &&
7464 N0.getOperand(0).hasOneUse()) {
7466 SDValue BuildVect = N0.getOperand(0);
7467 EVT BuildVectEltTy = BuildVect.getValueType().getVectorElementType();
7468 EVT TruncVecEltTy = VT.getVectorElementType();
7470 // Check that the element types match.
7471 if (BuildVectEltTy == TruncVecEltTy) {
7472 // Now we only need to compute the offset of the truncated elements.
7473 unsigned BuildVecNumElts = BuildVect.getNumOperands();
7474 unsigned TruncVecNumElts = VT.getVectorNumElements();
7475 unsigned TruncEltOffset = BuildVecNumElts / TruncVecNumElts;
7477 assert((BuildVecNumElts % TruncVecNumElts) == 0 &&
7478 "Invalid number of elements");
7480 SmallVector<SDValue, 8> Opnds;
7481 for (unsigned i = 0, e = BuildVecNumElts; i != e; i += TruncEltOffset)
7482 Opnds.push_back(BuildVect.getOperand(i));
7484 return DAG.getBuildVector(VT, SDLoc(N), Opnds);
7488 // See if we can simplify the input to this truncate through knowledge that
7489 // only the low bits are being used.
7490 // For example "trunc (or (shl x, 8), y)" // -> trunc y
7491 // Currently we only perform this optimization on scalars because vectors
7492 // may have different active low bits.
7493 if (!VT.isVector()) {
7494 if (SDValue Shorter =
7495 GetDemandedBits(N0, APInt::getLowBitsSet(N0.getValueSizeInBits(),
7496 VT.getSizeInBits())))
7497 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, Shorter);
7499 // fold (truncate (load x)) -> (smaller load x)
7500 // fold (truncate (srl (load x), c)) -> (smaller load (x+c/evtbits))
7501 if (!LegalTypes || TLI.isTypeDesirableForOp(N0.getOpcode(), VT)) {
7502 if (SDValue Reduced = ReduceLoadWidth(N))
7505 // Handle the case where the load remains an extending load even
7506 // after truncation.
7507 if (N0.hasOneUse() && ISD::isUNINDEXEDLoad(N0.getNode())) {
7508 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
7509 if (!LN0->isVolatile() &&
7510 LN0->getMemoryVT().getStoreSizeInBits() < VT.getSizeInBits()) {
7511 SDValue NewLoad = DAG.getExtLoad(LN0->getExtensionType(), SDLoc(LN0),
7512 VT, LN0->getChain(), LN0->getBasePtr(),
7514 LN0->getMemOperand());
7515 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), NewLoad.getValue(1));
7520 // fold (trunc (concat ... x ...)) -> (concat ..., (trunc x), ...)),
7521 // where ... are all 'undef'.
7522 if (N0.getOpcode() == ISD::CONCAT_VECTORS && !LegalTypes) {
7523 SmallVector<EVT, 8> VTs;
7526 unsigned NumDefs = 0;
7528 for (unsigned i = 0, e = N0.getNumOperands(); i != e; ++i) {
7529 SDValue X = N0.getOperand(i);
7535 // Stop if more than one members are non-undef.
7538 VTs.push_back(EVT::getVectorVT(*DAG.getContext(),
7539 VT.getVectorElementType(),
7540 X.getValueType().getVectorNumElements()));
7544 return DAG.getUNDEF(VT);
7547 assert(V.getNode() && "The single defined operand is empty!");
7548 SmallVector<SDValue, 8> Opnds;
7549 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
7551 Opnds.push_back(DAG.getUNDEF(VTs[i]));
7554 SDValue NV = DAG.getNode(ISD::TRUNCATE, SDLoc(V), VTs[i], V);
7555 AddToWorklist(NV.getNode());
7556 Opnds.push_back(NV);
7558 return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), VT, Opnds);
7562 // Fold truncate of a bitcast of a vector to an extract of the low vector
7565 // e.g. trunc (i64 (bitcast v2i32:x)) -> extract_vector_elt v2i32:x, 0
7566 if (N0.getOpcode() == ISD::BITCAST && !VT.isVector()) {
7567 SDValue VecSrc = N0.getOperand(0);
7568 EVT SrcVT = VecSrc.getValueType();
7569 if (SrcVT.isVector() && SrcVT.getScalarType() == VT &&
7570 (!LegalOperations ||
7571 TLI.isOperationLegal(ISD::EXTRACT_VECTOR_ELT, SrcVT))) {
7574 EVT IdxVT = TLI.getVectorIdxTy(DAG.getDataLayout());
7575 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SL, VT,
7576 VecSrc, DAG.getConstant(0, SL, IdxVT));
7580 // Simplify the operands using demanded-bits information.
7581 if (!VT.isVector() &&
7582 SimplifyDemandedBits(SDValue(N, 0)))
7583 return SDValue(N, 0);
7588 static SDNode *getBuildPairElt(SDNode *N, unsigned i) {
7589 SDValue Elt = N->getOperand(i);
7590 if (Elt.getOpcode() != ISD::MERGE_VALUES)
7591 return Elt.getNode();
7592 return Elt.getOperand(Elt.getResNo()).getNode();
7595 /// build_pair (load, load) -> load
7596 /// if load locations are consecutive.
7597 SDValue DAGCombiner::CombineConsecutiveLoads(SDNode *N, EVT VT) {
7598 assert(N->getOpcode() == ISD::BUILD_PAIR);
7600 LoadSDNode *LD1 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 0));
7601 LoadSDNode *LD2 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 1));
7602 if (!LD1 || !LD2 || !ISD::isNON_EXTLoad(LD1) || !LD1->hasOneUse() ||
7603 LD1->getAddressSpace() != LD2->getAddressSpace())
7605 EVT LD1VT = LD1->getValueType(0);
7606 unsigned LD1Bytes = LD1VT.getSizeInBits() / 8;
7607 if (ISD::isNON_EXTLoad(LD2) && LD2->hasOneUse() &&
7608 DAG.areNonVolatileConsecutiveLoads(LD2, LD1, LD1Bytes, 1)) {
7609 unsigned Align = LD1->getAlignment();
7610 unsigned NewAlign = DAG.getDataLayout().getABITypeAlignment(
7611 VT.getTypeForEVT(*DAG.getContext()));
7613 if (NewAlign <= Align &&
7614 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT)))
7615 return DAG.getLoad(VT, SDLoc(N), LD1->getChain(), LD1->getBasePtr(),
7616 LD1->getPointerInfo(), Align);
7622 static unsigned getPPCf128HiElementSelector(const SelectionDAG &DAG) {
7623 // On little-endian machines, bitcasting from ppcf128 to i128 does swap the Hi
7624 // and Lo parts; on big-endian machines it doesn't.
7625 return DAG.getDataLayout().isBigEndian() ? 1 : 0;
7628 static SDValue foldBitcastedFPLogic(SDNode *N, SelectionDAG &DAG,
7629 const TargetLowering &TLI) {
7630 // If this is not a bitcast to an FP type or if the target doesn't have
7631 // IEEE754-compliant FP logic, we're done.
7632 EVT VT = N->getValueType(0);
7633 if (!VT.isFloatingPoint() || !TLI.hasBitPreservingFPLogic(VT))
7636 // TODO: Use splat values for the constant-checking below and remove this
7638 SDValue N0 = N->getOperand(0);
7639 EVT SourceVT = N0.getValueType();
7640 if (SourceVT.isVector())
7645 switch (N0.getOpcode()) {
7647 FPOpcode = ISD::FABS;
7648 SignMask = ~APInt::getSignBit(SourceVT.getSizeInBits());
7651 FPOpcode = ISD::FNEG;
7652 SignMask = APInt::getSignBit(SourceVT.getSizeInBits());
7654 // TODO: ISD::OR --> ISD::FNABS?
7659 // Fold (bitcast int (and (bitcast fp X to int), 0x7fff...) to fp) -> fabs X
7660 // Fold (bitcast int (xor (bitcast fp X to int), 0x8000...) to fp) -> fneg X
7661 SDValue LogicOp0 = N0.getOperand(0);
7662 ConstantSDNode *LogicOp1 = dyn_cast<ConstantSDNode>(N0.getOperand(1));
7663 if (LogicOp1 && LogicOp1->getAPIntValue() == SignMask &&
7664 LogicOp0.getOpcode() == ISD::BITCAST &&
7665 LogicOp0->getOperand(0).getValueType() == VT)
7666 return DAG.getNode(FPOpcode, SDLoc(N), VT, LogicOp0->getOperand(0));
7671 SDValue DAGCombiner::visitBITCAST(SDNode *N) {
7672 SDValue N0 = N->getOperand(0);
7673 EVT VT = N->getValueType(0);
7675 // If the input is a BUILD_VECTOR with all constant elements, fold this now.
7676 // Only do this before legalize, since afterward the target may be depending
7677 // on the bitconvert.
7678 // First check to see if this is all constant.
7680 N0.getOpcode() == ISD::BUILD_VECTOR && N0.getNode()->hasOneUse() &&
7682 bool isSimple = cast<BuildVectorSDNode>(N0)->isConstant();
7684 EVT DestEltVT = N->getValueType(0).getVectorElementType();
7685 assert(!DestEltVT.isVector() &&
7686 "Element type of vector ValueType must not be vector!");
7688 return ConstantFoldBITCASTofBUILD_VECTOR(N0.getNode(), DestEltVT);
7691 // If the input is a constant, let getNode fold it.
7692 if (isa<ConstantSDNode>(N0) || isa<ConstantFPSDNode>(N0)) {
7693 // If we can't allow illegal operations, we need to check that this is just
7694 // a fp -> int or int -> conversion and that the resulting operation will
7696 if (!LegalOperations ||
7697 (isa<ConstantSDNode>(N0) && VT.isFloatingPoint() && !VT.isVector() &&
7698 TLI.isOperationLegal(ISD::ConstantFP, VT)) ||
7699 (isa<ConstantFPSDNode>(N0) && VT.isInteger() && !VT.isVector() &&
7700 TLI.isOperationLegal(ISD::Constant, VT)))
7701 return DAG.getBitcast(VT, N0);
7704 // (conv (conv x, t1), t2) -> (conv x, t2)
7705 if (N0.getOpcode() == ISD::BITCAST)
7706 return DAG.getBitcast(VT, N0.getOperand(0));
7708 // fold (conv (load x)) -> (load (conv*)x)
7709 // If the resultant load doesn't need a higher alignment than the original!
7710 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() &&
7711 // Do not change the width of a volatile load.
7712 !cast<LoadSDNode>(N0)->isVolatile() &&
7713 // Do not remove the cast if the types differ in endian layout.
7714 TLI.hasBigEndianPartOrdering(N0.getValueType(), DAG.getDataLayout()) ==
7715 TLI.hasBigEndianPartOrdering(VT, DAG.getDataLayout()) &&
7716 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT)) &&
7717 TLI.isLoadBitCastBeneficial(N0.getValueType(), VT)) {
7718 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
7719 unsigned OrigAlign = LN0->getAlignment();
7722 if (TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), VT,
7723 LN0->getAddressSpace(), OrigAlign, &Fast) &&
7726 DAG.getLoad(VT, SDLoc(N), LN0->getChain(), LN0->getBasePtr(),
7727 LN0->getPointerInfo(), OrigAlign,
7728 LN0->getMemOperand()->getFlags(), LN0->getAAInfo());
7729 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), Load.getValue(1));
7734 if (SDValue V = foldBitcastedFPLogic(N, DAG, TLI))
7737 // fold (bitconvert (fneg x)) -> (xor (bitconvert x), signbit)
7738 // fold (bitconvert (fabs x)) -> (and (bitconvert x), (not signbit))
7741 // fold (bitcast (fneg x)) ->
7742 // flipbit = signbit
7743 // (xor (bitcast x) (build_pair flipbit, flipbit))
7745 // fold (bitcast (fabs x)) ->
7746 // flipbit = (and (extract_element (bitcast x), 0), signbit)
7747 // (xor (bitcast x) (build_pair flipbit, flipbit))
7748 // This often reduces constant pool loads.
7749 if (((N0.getOpcode() == ISD::FNEG && !TLI.isFNegFree(N0.getValueType())) ||
7750 (N0.getOpcode() == ISD::FABS && !TLI.isFAbsFree(N0.getValueType()))) &&
7751 N0.getNode()->hasOneUse() && VT.isInteger() &&
7752 !VT.isVector() && !N0.getValueType().isVector()) {
7753 SDValue NewConv = DAG.getBitcast(VT, N0.getOperand(0));
7754 AddToWorklist(NewConv.getNode());
7757 if (N0.getValueType() == MVT::ppcf128 && !LegalTypes) {
7758 assert(VT.getSizeInBits() == 128);
7759 SDValue SignBit = DAG.getConstant(
7760 APInt::getSignBit(VT.getSizeInBits() / 2), SDLoc(N0), MVT::i64);
7762 if (N0.getOpcode() == ISD::FNEG) {
7764 AddToWorklist(FlipBit.getNode());
7766 assert(N0.getOpcode() == ISD::FABS);
7768 DAG.getNode(ISD::EXTRACT_ELEMENT, SDLoc(NewConv), MVT::i64, NewConv,
7769 DAG.getIntPtrConstant(getPPCf128HiElementSelector(DAG),
7771 AddToWorklist(Hi.getNode());
7772 FlipBit = DAG.getNode(ISD::AND, SDLoc(N0), MVT::i64, Hi, SignBit);
7773 AddToWorklist(FlipBit.getNode());
7776 DAG.getNode(ISD::BUILD_PAIR, SDLoc(N0), VT, FlipBit, FlipBit);
7777 AddToWorklist(FlipBits.getNode());
7778 return DAG.getNode(ISD::XOR, DL, VT, NewConv, FlipBits);
7780 APInt SignBit = APInt::getSignBit(VT.getSizeInBits());
7781 if (N0.getOpcode() == ISD::FNEG)
7782 return DAG.getNode(ISD::XOR, DL, VT,
7783 NewConv, DAG.getConstant(SignBit, DL, VT));
7784 assert(N0.getOpcode() == ISD::FABS);
7785 return DAG.getNode(ISD::AND, DL, VT,
7786 NewConv, DAG.getConstant(~SignBit, DL, VT));
7789 // fold (bitconvert (fcopysign cst, x)) ->
7790 // (or (and (bitconvert x), sign), (and cst, (not sign)))
7791 // Note that we don't handle (copysign x, cst) because this can always be
7792 // folded to an fneg or fabs.
7795 // fold (bitcast (fcopysign cst, x)) ->
7796 // flipbit = (and (extract_element
7797 // (xor (bitcast cst), (bitcast x)), 0),
7799 // (xor (bitcast cst) (build_pair flipbit, flipbit))
7800 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse() &&
7801 isa<ConstantFPSDNode>(N0.getOperand(0)) &&
7802 VT.isInteger() && !VT.isVector()) {
7803 unsigned OrigXWidth = N0.getOperand(1).getValueSizeInBits();
7804 EVT IntXVT = EVT::getIntegerVT(*DAG.getContext(), OrigXWidth);
7805 if (isTypeLegal(IntXVT)) {
7806 SDValue X = DAG.getBitcast(IntXVT, N0.getOperand(1));
7807 AddToWorklist(X.getNode());
7809 // If X has a different width than the result/lhs, sext it or truncate it.
7810 unsigned VTWidth = VT.getSizeInBits();
7811 if (OrigXWidth < VTWidth) {
7812 X = DAG.getNode(ISD::SIGN_EXTEND, SDLoc(N), VT, X);
7813 AddToWorklist(X.getNode());
7814 } else if (OrigXWidth > VTWidth) {
7815 // To get the sign bit in the right place, we have to shift it right
7816 // before truncating.
7818 X = DAG.getNode(ISD::SRL, DL,
7819 X.getValueType(), X,
7820 DAG.getConstant(OrigXWidth-VTWidth, DL,
7822 AddToWorklist(X.getNode());
7823 X = DAG.getNode(ISD::TRUNCATE, SDLoc(X), VT, X);
7824 AddToWorklist(X.getNode());
7827 if (N0.getValueType() == MVT::ppcf128 && !LegalTypes) {
7828 APInt SignBit = APInt::getSignBit(VT.getSizeInBits() / 2);
7829 SDValue Cst = DAG.getBitcast(VT, N0.getOperand(0));
7830 AddToWorklist(Cst.getNode());
7831 SDValue X = DAG.getBitcast(VT, N0.getOperand(1));
7832 AddToWorklist(X.getNode());
7833 SDValue XorResult = DAG.getNode(ISD::XOR, SDLoc(N0), VT, Cst, X);
7834 AddToWorklist(XorResult.getNode());
7835 SDValue XorResult64 = DAG.getNode(
7836 ISD::EXTRACT_ELEMENT, SDLoc(XorResult), MVT::i64, XorResult,
7837 DAG.getIntPtrConstant(getPPCf128HiElementSelector(DAG),
7839 AddToWorklist(XorResult64.getNode());
7841 DAG.getNode(ISD::AND, SDLoc(XorResult64), MVT::i64, XorResult64,
7842 DAG.getConstant(SignBit, SDLoc(XorResult64), MVT::i64));
7843 AddToWorklist(FlipBit.getNode());
7845 DAG.getNode(ISD::BUILD_PAIR, SDLoc(N0), VT, FlipBit, FlipBit);
7846 AddToWorklist(FlipBits.getNode());
7847 return DAG.getNode(ISD::XOR, SDLoc(N), VT, Cst, FlipBits);
7849 APInt SignBit = APInt::getSignBit(VT.getSizeInBits());
7850 X = DAG.getNode(ISD::AND, SDLoc(X), VT,
7851 X, DAG.getConstant(SignBit, SDLoc(X), VT));
7852 AddToWorklist(X.getNode());
7854 SDValue Cst = DAG.getBitcast(VT, N0.getOperand(0));
7855 Cst = DAG.getNode(ISD::AND, SDLoc(Cst), VT,
7856 Cst, DAG.getConstant(~SignBit, SDLoc(Cst), VT));
7857 AddToWorklist(Cst.getNode());
7859 return DAG.getNode(ISD::OR, SDLoc(N), VT, X, Cst);
7863 // bitconvert(build_pair(ld, ld)) -> ld iff load locations are consecutive.
7864 if (N0.getOpcode() == ISD::BUILD_PAIR)
7865 if (SDValue CombineLD = CombineConsecutiveLoads(N0.getNode(), VT))
7868 // Remove double bitcasts from shuffles - this is often a legacy of
7869 // XformToShuffleWithZero being used to combine bitmaskings (of
7870 // float vectors bitcast to integer vectors) into shuffles.
7871 // bitcast(shuffle(bitcast(s0),bitcast(s1))) -> shuffle(s0,s1)
7872 if (Level < AfterLegalizeDAG && TLI.isTypeLegal(VT) && VT.isVector() &&
7873 N0->getOpcode() == ISD::VECTOR_SHUFFLE &&
7874 VT.getVectorNumElements() >= N0.getValueType().getVectorNumElements() &&
7875 !(VT.getVectorNumElements() % N0.getValueType().getVectorNumElements())) {
7876 ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N0);
7878 // If operands are a bitcast, peek through if it casts the original VT.
7879 // If operands are a constant, just bitcast back to original VT.
7880 auto PeekThroughBitcast = [&](SDValue Op) {
7881 if (Op.getOpcode() == ISD::BITCAST &&
7882 Op.getOperand(0).getValueType() == VT)
7883 return SDValue(Op.getOperand(0));
7884 if (ISD::isBuildVectorOfConstantSDNodes(Op.getNode()) ||
7885 ISD::isBuildVectorOfConstantFPSDNodes(Op.getNode()))
7886 return DAG.getBitcast(VT, Op);
7890 SDValue SV0 = PeekThroughBitcast(N0->getOperand(0));
7891 SDValue SV1 = PeekThroughBitcast(N0->getOperand(1));
7896 VT.getVectorNumElements() / N0.getValueType().getVectorNumElements();
7897 SmallVector<int, 8> NewMask;
7898 for (int M : SVN->getMask())
7899 for (int i = 0; i != MaskScale; ++i)
7900 NewMask.push_back(M < 0 ? -1 : M * MaskScale + i);
7902 bool LegalMask = TLI.isShuffleMaskLegal(NewMask, VT);
7904 std::swap(SV0, SV1);
7905 ShuffleVectorSDNode::commuteMask(NewMask);
7906 LegalMask = TLI.isShuffleMaskLegal(NewMask, VT);
7910 return DAG.getVectorShuffle(VT, SDLoc(N), SV0, SV1, NewMask);
7916 SDValue DAGCombiner::visitBUILD_PAIR(SDNode *N) {
7917 EVT VT = N->getValueType(0);
7918 return CombineConsecutiveLoads(N, VT);
7921 /// We know that BV is a build_vector node with Constant, ConstantFP or Undef
7922 /// operands. DstEltVT indicates the destination element value type.
7923 SDValue DAGCombiner::
7924 ConstantFoldBITCASTofBUILD_VECTOR(SDNode *BV, EVT DstEltVT) {
7925 EVT SrcEltVT = BV->getValueType(0).getVectorElementType();
7927 // If this is already the right type, we're done.
7928 if (SrcEltVT == DstEltVT) return SDValue(BV, 0);
7930 unsigned SrcBitSize = SrcEltVT.getSizeInBits();
7931 unsigned DstBitSize = DstEltVT.getSizeInBits();
7933 // If this is a conversion of N elements of one type to N elements of another
7934 // type, convert each element. This handles FP<->INT cases.
7935 if (SrcBitSize == DstBitSize) {
7936 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT,
7937 BV->getValueType(0).getVectorNumElements());
7939 // Due to the FP element handling below calling this routine recursively,
7940 // we can end up with a scalar-to-vector node here.
7941 if (BV->getOpcode() == ISD::SCALAR_TO_VECTOR)
7942 return DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(BV), VT,
7943 DAG.getBitcast(DstEltVT, BV->getOperand(0)));
7945 SmallVector<SDValue, 8> Ops;
7946 for (SDValue Op : BV->op_values()) {
7947 // If the vector element type is not legal, the BUILD_VECTOR operands
7948 // are promoted and implicitly truncated. Make that explicit here.
7949 if (Op.getValueType() != SrcEltVT)
7950 Op = DAG.getNode(ISD::TRUNCATE, SDLoc(BV), SrcEltVT, Op);
7951 Ops.push_back(DAG.getBitcast(DstEltVT, Op));
7952 AddToWorklist(Ops.back().getNode());
7954 return DAG.getBuildVector(VT, SDLoc(BV), Ops);
7957 // Otherwise, we're growing or shrinking the elements. To avoid having to
7958 // handle annoying details of growing/shrinking FP values, we convert them to
7960 if (SrcEltVT.isFloatingPoint()) {
7961 // Convert the input float vector to a int vector where the elements are the
7963 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), SrcEltVT.getSizeInBits());
7964 BV = ConstantFoldBITCASTofBUILD_VECTOR(BV, IntVT).getNode();
7968 // Now we know the input is an integer vector. If the output is a FP type,
7969 // convert to integer first, then to FP of the right size.
7970 if (DstEltVT.isFloatingPoint()) {
7971 EVT TmpVT = EVT::getIntegerVT(*DAG.getContext(), DstEltVT.getSizeInBits());
7972 SDNode *Tmp = ConstantFoldBITCASTofBUILD_VECTOR(BV, TmpVT).getNode();
7974 // Next, convert to FP elements of the same size.
7975 return ConstantFoldBITCASTofBUILD_VECTOR(Tmp, DstEltVT);
7980 // Okay, we know the src/dst types are both integers of differing types.
7981 // Handling growing first.
7982 assert(SrcEltVT.isInteger() && DstEltVT.isInteger());
7983 if (SrcBitSize < DstBitSize) {
7984 unsigned NumInputsPerOutput = DstBitSize/SrcBitSize;
7986 SmallVector<SDValue, 8> Ops;
7987 for (unsigned i = 0, e = BV->getNumOperands(); i != e;
7988 i += NumInputsPerOutput) {
7989 bool isLE = DAG.getDataLayout().isLittleEndian();
7990 APInt NewBits = APInt(DstBitSize, 0);
7991 bool EltIsUndef = true;
7992 for (unsigned j = 0; j != NumInputsPerOutput; ++j) {
7993 // Shift the previously computed bits over.
7994 NewBits <<= SrcBitSize;
7995 SDValue Op = BV->getOperand(i+ (isLE ? (NumInputsPerOutput-j-1) : j));
7996 if (Op.isUndef()) continue;
7999 NewBits |= cast<ConstantSDNode>(Op)->getAPIntValue().
8000 zextOrTrunc(SrcBitSize).zext(DstBitSize);
8004 Ops.push_back(DAG.getUNDEF(DstEltVT));
8006 Ops.push_back(DAG.getConstant(NewBits, DL, DstEltVT));
8009 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, Ops.size());
8010 return DAG.getBuildVector(VT, DL, Ops);
8013 // Finally, this must be the case where we are shrinking elements: each input
8014 // turns into multiple outputs.
8015 unsigned NumOutputsPerInput = SrcBitSize/DstBitSize;
8016 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT,
8017 NumOutputsPerInput*BV->getNumOperands());
8018 SmallVector<SDValue, 8> Ops;
8020 for (const SDValue &Op : BV->op_values()) {
8022 Ops.append(NumOutputsPerInput, DAG.getUNDEF(DstEltVT));
8026 APInt OpVal = cast<ConstantSDNode>(Op)->
8027 getAPIntValue().zextOrTrunc(SrcBitSize);
8029 for (unsigned j = 0; j != NumOutputsPerInput; ++j) {
8030 APInt ThisVal = OpVal.trunc(DstBitSize);
8031 Ops.push_back(DAG.getConstant(ThisVal, DL, DstEltVT));
8032 OpVal = OpVal.lshr(DstBitSize);
8035 // For big endian targets, swap the order of the pieces of each element.
8036 if (DAG.getDataLayout().isBigEndian())
8037 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end());
8040 return DAG.getBuildVector(VT, DL, Ops);
8043 /// Try to perform FMA combining on a given FADD node.
8044 SDValue DAGCombiner::visitFADDForFMACombine(SDNode *N) {
8045 SDValue N0 = N->getOperand(0);
8046 SDValue N1 = N->getOperand(1);
8047 EVT VT = N->getValueType(0);
8050 const TargetOptions &Options = DAG.getTarget().Options;
8052 (Options.AllowFPOpFusion == FPOpFusion::Fast || Options.UnsafeFPMath);
8054 // Floating-point multiply-add with intermediate rounding.
8055 bool HasFMAD = (LegalOperations && TLI.isOperationLegal(ISD::FMAD, VT));
8057 // Floating-point multiply-add without intermediate rounding.
8059 AllowFusion && TLI.isFMAFasterThanFMulAndFAdd(VT) &&
8060 (!LegalOperations || TLI.isOperationLegalOrCustom(ISD::FMA, VT));
8062 // No valid opcode, do not combine.
8063 if (!HasFMAD && !HasFMA)
8066 const SelectionDAGTargetInfo *STI = DAG.getSubtarget().getSelectionDAGInfo();
8068 if (AllowFusion && STI && STI->generateFMAsInMachineCombiner(OptLevel))
8071 // Always prefer FMAD to FMA for precision.
8072 unsigned PreferredFusedOpcode = HasFMAD ? ISD::FMAD : ISD::FMA;
8073 bool Aggressive = TLI.enableAggressiveFMAFusion(VT);
8074 bool LookThroughFPExt = TLI.isFPExtFree(VT);
8076 // If we have two choices trying to fold (fadd (fmul u, v), (fmul x, y)),
8077 // prefer to fold the multiply with fewer uses.
8078 if (Aggressive && N0.getOpcode() == ISD::FMUL &&
8079 N1.getOpcode() == ISD::FMUL) {
8080 if (N0.getNode()->use_size() > N1.getNode()->use_size())
8084 // fold (fadd (fmul x, y), z) -> (fma x, y, z)
8085 if (N0.getOpcode() == ISD::FMUL &&
8086 (Aggressive || N0->hasOneUse())) {
8087 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8088 N0.getOperand(0), N0.getOperand(1), N1);
8091 // fold (fadd x, (fmul y, z)) -> (fma y, z, x)
8092 // Note: Commutes FADD operands.
8093 if (N1.getOpcode() == ISD::FMUL &&
8094 (Aggressive || N1->hasOneUse())) {
8095 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8096 N1.getOperand(0), N1.getOperand(1), N0);
8099 // Look through FP_EXTEND nodes to do more combining.
8100 if (AllowFusion && LookThroughFPExt) {
8101 // fold (fadd (fpext (fmul x, y)), z) -> (fma (fpext x), (fpext y), z)
8102 if (N0.getOpcode() == ISD::FP_EXTEND) {
8103 SDValue N00 = N0.getOperand(0);
8104 if (N00.getOpcode() == ISD::FMUL)
8105 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8106 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8108 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8109 N00.getOperand(1)), N1);
8112 // fold (fadd x, (fpext (fmul y, z))) -> (fma (fpext y), (fpext z), x)
8113 // Note: Commutes FADD operands.
8114 if (N1.getOpcode() == ISD::FP_EXTEND) {
8115 SDValue N10 = N1.getOperand(0);
8116 if (N10.getOpcode() == ISD::FMUL)
8117 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8118 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8120 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8121 N10.getOperand(1)), N0);
8125 // More folding opportunities when target permits.
8126 if ((AllowFusion || HasFMAD) && Aggressive) {
8127 // fold (fadd (fma x, y, (fmul u, v)), z) -> (fma x, y (fma u, v, z))
8128 if (N0.getOpcode() == PreferredFusedOpcode &&
8129 N0.getOperand(2).getOpcode() == ISD::FMUL &&
8130 N0->hasOneUse() && N0.getOperand(2)->hasOneUse()) {
8131 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8132 N0.getOperand(0), N0.getOperand(1),
8133 DAG.getNode(PreferredFusedOpcode, SL, VT,
8134 N0.getOperand(2).getOperand(0),
8135 N0.getOperand(2).getOperand(1),
8139 // fold (fadd x, (fma y, z, (fmul u, v)) -> (fma y, z (fma u, v, x))
8140 if (N1->getOpcode() == PreferredFusedOpcode &&
8141 N1.getOperand(2).getOpcode() == ISD::FMUL &&
8142 N1->hasOneUse() && N1.getOperand(2)->hasOneUse()) {
8143 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8144 N1.getOperand(0), N1.getOperand(1),
8145 DAG.getNode(PreferredFusedOpcode, SL, VT,
8146 N1.getOperand(2).getOperand(0),
8147 N1.getOperand(2).getOperand(1),
8151 if (AllowFusion && LookThroughFPExt) {
8152 // fold (fadd (fma x, y, (fpext (fmul u, v))), z)
8153 // -> (fma x, y, (fma (fpext u), (fpext v), z))
8154 auto FoldFAddFMAFPExtFMul = [&] (
8155 SDValue X, SDValue Y, SDValue U, SDValue V, SDValue Z) {
8156 return DAG.getNode(PreferredFusedOpcode, SL, VT, X, Y,
8157 DAG.getNode(PreferredFusedOpcode, SL, VT,
8158 DAG.getNode(ISD::FP_EXTEND, SL, VT, U),
8159 DAG.getNode(ISD::FP_EXTEND, SL, VT, V),
8162 if (N0.getOpcode() == PreferredFusedOpcode) {
8163 SDValue N02 = N0.getOperand(2);
8164 if (N02.getOpcode() == ISD::FP_EXTEND) {
8165 SDValue N020 = N02.getOperand(0);
8166 if (N020.getOpcode() == ISD::FMUL)
8167 return FoldFAddFMAFPExtFMul(N0.getOperand(0), N0.getOperand(1),
8168 N020.getOperand(0), N020.getOperand(1),
8173 // fold (fadd (fpext (fma x, y, (fmul u, v))), z)
8174 // -> (fma (fpext x), (fpext y), (fma (fpext u), (fpext v), z))
8175 // FIXME: This turns two single-precision and one double-precision
8176 // operation into two double-precision operations, which might not be
8177 // interesting for all targets, especially GPUs.
8178 auto FoldFAddFPExtFMAFMul = [&] (
8179 SDValue X, SDValue Y, SDValue U, SDValue V, SDValue Z) {
8180 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8181 DAG.getNode(ISD::FP_EXTEND, SL, VT, X),
8182 DAG.getNode(ISD::FP_EXTEND, SL, VT, Y),
8183 DAG.getNode(PreferredFusedOpcode, SL, VT,
8184 DAG.getNode(ISD::FP_EXTEND, SL, VT, U),
8185 DAG.getNode(ISD::FP_EXTEND, SL, VT, V),
8188 if (N0.getOpcode() == ISD::FP_EXTEND) {
8189 SDValue N00 = N0.getOperand(0);
8190 if (N00.getOpcode() == PreferredFusedOpcode) {
8191 SDValue N002 = N00.getOperand(2);
8192 if (N002.getOpcode() == ISD::FMUL)
8193 return FoldFAddFPExtFMAFMul(N00.getOperand(0), N00.getOperand(1),
8194 N002.getOperand(0), N002.getOperand(1),
8199 // fold (fadd x, (fma y, z, (fpext (fmul u, v)))
8200 // -> (fma y, z, (fma (fpext u), (fpext v), x))
8201 if (N1.getOpcode() == PreferredFusedOpcode) {
8202 SDValue N12 = N1.getOperand(2);
8203 if (N12.getOpcode() == ISD::FP_EXTEND) {
8204 SDValue N120 = N12.getOperand(0);
8205 if (N120.getOpcode() == ISD::FMUL)
8206 return FoldFAddFMAFPExtFMul(N1.getOperand(0), N1.getOperand(1),
8207 N120.getOperand(0), N120.getOperand(1),
8212 // fold (fadd x, (fpext (fma y, z, (fmul u, v)))
8213 // -> (fma (fpext y), (fpext z), (fma (fpext u), (fpext v), x))
8214 // FIXME: This turns two single-precision and one double-precision
8215 // operation into two double-precision operations, which might not be
8216 // interesting for all targets, especially GPUs.
8217 if (N1.getOpcode() == ISD::FP_EXTEND) {
8218 SDValue N10 = N1.getOperand(0);
8219 if (N10.getOpcode() == PreferredFusedOpcode) {
8220 SDValue N102 = N10.getOperand(2);
8221 if (N102.getOpcode() == ISD::FMUL)
8222 return FoldFAddFPExtFMAFMul(N10.getOperand(0), N10.getOperand(1),
8223 N102.getOperand(0), N102.getOperand(1),
8233 /// Try to perform FMA combining on a given FSUB node.
8234 SDValue DAGCombiner::visitFSUBForFMACombine(SDNode *N) {
8235 SDValue N0 = N->getOperand(0);
8236 SDValue N1 = N->getOperand(1);
8237 EVT VT = N->getValueType(0);
8240 const TargetOptions &Options = DAG.getTarget().Options;
8242 (Options.AllowFPOpFusion == FPOpFusion::Fast || Options.UnsafeFPMath);
8244 // Floating-point multiply-add with intermediate rounding.
8245 bool HasFMAD = (LegalOperations && TLI.isOperationLegal(ISD::FMAD, VT));
8247 // Floating-point multiply-add without intermediate rounding.
8249 AllowFusion && TLI.isFMAFasterThanFMulAndFAdd(VT) &&
8250 (!LegalOperations || TLI.isOperationLegalOrCustom(ISD::FMA, VT));
8252 // No valid opcode, do not combine.
8253 if (!HasFMAD && !HasFMA)
8256 const SelectionDAGTargetInfo *STI = DAG.getSubtarget().getSelectionDAGInfo();
8257 if (AllowFusion && STI && STI->generateFMAsInMachineCombiner(OptLevel))
8260 // Always prefer FMAD to FMA for precision.
8261 unsigned PreferredFusedOpcode = HasFMAD ? ISD::FMAD : ISD::FMA;
8262 bool Aggressive = TLI.enableAggressiveFMAFusion(VT);
8263 bool LookThroughFPExt = TLI.isFPExtFree(VT);
8265 // fold (fsub (fmul x, y), z) -> (fma x, y, (fneg z))
8266 if (N0.getOpcode() == ISD::FMUL &&
8267 (Aggressive || N0->hasOneUse())) {
8268 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8269 N0.getOperand(0), N0.getOperand(1),
8270 DAG.getNode(ISD::FNEG, SL, VT, N1));
8273 // fold (fsub x, (fmul y, z)) -> (fma (fneg y), z, x)
8274 // Note: Commutes FSUB operands.
8275 if (N1.getOpcode() == ISD::FMUL &&
8276 (Aggressive || N1->hasOneUse()))
8277 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8278 DAG.getNode(ISD::FNEG, SL, VT,
8280 N1.getOperand(1), N0);
8282 // fold (fsub (fneg (fmul, x, y)), z) -> (fma (fneg x), y, (fneg z))
8283 if (N0.getOpcode() == ISD::FNEG &&
8284 N0.getOperand(0).getOpcode() == ISD::FMUL &&
8285 (Aggressive || (N0->hasOneUse() && N0.getOperand(0).hasOneUse()))) {
8286 SDValue N00 = N0.getOperand(0).getOperand(0);
8287 SDValue N01 = N0.getOperand(0).getOperand(1);
8288 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8289 DAG.getNode(ISD::FNEG, SL, VT, N00), N01,
8290 DAG.getNode(ISD::FNEG, SL, VT, N1));
8293 // Look through FP_EXTEND nodes to do more combining.
8294 if (AllowFusion && LookThroughFPExt) {
8295 // fold (fsub (fpext (fmul x, y)), z)
8296 // -> (fma (fpext x), (fpext y), (fneg z))
8297 if (N0.getOpcode() == ISD::FP_EXTEND) {
8298 SDValue N00 = N0.getOperand(0);
8299 if (N00.getOpcode() == ISD::FMUL)
8300 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8301 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8303 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8305 DAG.getNode(ISD::FNEG, SL, VT, N1));
8308 // fold (fsub x, (fpext (fmul y, z)))
8309 // -> (fma (fneg (fpext y)), (fpext z), x)
8310 // Note: Commutes FSUB operands.
8311 if (N1.getOpcode() == ISD::FP_EXTEND) {
8312 SDValue N10 = N1.getOperand(0);
8313 if (N10.getOpcode() == ISD::FMUL)
8314 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8315 DAG.getNode(ISD::FNEG, SL, VT,
8316 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8317 N10.getOperand(0))),
8318 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8323 // fold (fsub (fpext (fneg (fmul, x, y))), z)
8324 // -> (fneg (fma (fpext x), (fpext y), z))
8325 // Note: This could be removed with appropriate canonicalization of the
8326 // input expression into (fneg (fadd (fpext (fmul, x, y)), z). However, the
8327 // orthogonal flags -fp-contract=fast and -enable-unsafe-fp-math prevent
8328 // from implementing the canonicalization in visitFSUB.
8329 if (N0.getOpcode() == ISD::FP_EXTEND) {
8330 SDValue N00 = N0.getOperand(0);
8331 if (N00.getOpcode() == ISD::FNEG) {
8332 SDValue N000 = N00.getOperand(0);
8333 if (N000.getOpcode() == ISD::FMUL) {
8334 return DAG.getNode(ISD::FNEG, SL, VT,
8335 DAG.getNode(PreferredFusedOpcode, SL, VT,
8336 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8337 N000.getOperand(0)),
8338 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8339 N000.getOperand(1)),
8345 // fold (fsub (fneg (fpext (fmul, x, y))), z)
8346 // -> (fneg (fma (fpext x)), (fpext y), z)
8347 // Note: This could be removed with appropriate canonicalization of the
8348 // input expression into (fneg (fadd (fpext (fmul, x, y)), z). However, the
8349 // orthogonal flags -fp-contract=fast and -enable-unsafe-fp-math prevent
8350 // from implementing the canonicalization in visitFSUB.
8351 if (N0.getOpcode() == ISD::FNEG) {
8352 SDValue N00 = N0.getOperand(0);
8353 if (N00.getOpcode() == ISD::FP_EXTEND) {
8354 SDValue N000 = N00.getOperand(0);
8355 if (N000.getOpcode() == ISD::FMUL) {
8356 return DAG.getNode(ISD::FNEG, SL, VT,
8357 DAG.getNode(PreferredFusedOpcode, SL, VT,
8358 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8359 N000.getOperand(0)),
8360 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8361 N000.getOperand(1)),
8369 // More folding opportunities when target permits.
8370 if ((AllowFusion || HasFMAD) && Aggressive) {
8371 // fold (fsub (fma x, y, (fmul u, v)), z)
8372 // -> (fma x, y (fma u, v, (fneg z)))
8373 if (N0.getOpcode() == PreferredFusedOpcode &&
8374 N0.getOperand(2).getOpcode() == ISD::FMUL &&
8375 N0->hasOneUse() && N0.getOperand(2)->hasOneUse()) {
8376 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8377 N0.getOperand(0), N0.getOperand(1),
8378 DAG.getNode(PreferredFusedOpcode, SL, VT,
8379 N0.getOperand(2).getOperand(0),
8380 N0.getOperand(2).getOperand(1),
8381 DAG.getNode(ISD::FNEG, SL, VT,
8385 // fold (fsub x, (fma y, z, (fmul u, v)))
8386 // -> (fma (fneg y), z, (fma (fneg u), v, x))
8387 if (N1.getOpcode() == PreferredFusedOpcode &&
8388 N1.getOperand(2).getOpcode() == ISD::FMUL) {
8389 SDValue N20 = N1.getOperand(2).getOperand(0);
8390 SDValue N21 = N1.getOperand(2).getOperand(1);
8391 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8392 DAG.getNode(ISD::FNEG, SL, VT,
8395 DAG.getNode(PreferredFusedOpcode, SL, VT,
8396 DAG.getNode(ISD::FNEG, SL, VT, N20),
8401 if (AllowFusion && LookThroughFPExt) {
8402 // fold (fsub (fma x, y, (fpext (fmul u, v))), z)
8403 // -> (fma x, y (fma (fpext u), (fpext v), (fneg z)))
8404 if (N0.getOpcode() == PreferredFusedOpcode) {
8405 SDValue N02 = N0.getOperand(2);
8406 if (N02.getOpcode() == ISD::FP_EXTEND) {
8407 SDValue N020 = N02.getOperand(0);
8408 if (N020.getOpcode() == ISD::FMUL)
8409 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8410 N0.getOperand(0), N0.getOperand(1),
8411 DAG.getNode(PreferredFusedOpcode, SL, VT,
8412 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8413 N020.getOperand(0)),
8414 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8415 N020.getOperand(1)),
8416 DAG.getNode(ISD::FNEG, SL, VT,
8421 // fold (fsub (fpext (fma x, y, (fmul u, v))), z)
8422 // -> (fma (fpext x), (fpext y),
8423 // (fma (fpext u), (fpext v), (fneg z)))
8424 // FIXME: This turns two single-precision and one double-precision
8425 // operation into two double-precision operations, which might not be
8426 // interesting for all targets, especially GPUs.
8427 if (N0.getOpcode() == ISD::FP_EXTEND) {
8428 SDValue N00 = N0.getOperand(0);
8429 if (N00.getOpcode() == PreferredFusedOpcode) {
8430 SDValue N002 = N00.getOperand(2);
8431 if (N002.getOpcode() == ISD::FMUL)
8432 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8433 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8435 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8437 DAG.getNode(PreferredFusedOpcode, SL, VT,
8438 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8439 N002.getOperand(0)),
8440 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8441 N002.getOperand(1)),
8442 DAG.getNode(ISD::FNEG, SL, VT,
8447 // fold (fsub x, (fma y, z, (fpext (fmul u, v))))
8448 // -> (fma (fneg y), z, (fma (fneg (fpext u)), (fpext v), x))
8449 if (N1.getOpcode() == PreferredFusedOpcode &&
8450 N1.getOperand(2).getOpcode() == ISD::FP_EXTEND) {
8451 SDValue N120 = N1.getOperand(2).getOperand(0);
8452 if (N120.getOpcode() == ISD::FMUL) {
8453 SDValue N1200 = N120.getOperand(0);
8454 SDValue N1201 = N120.getOperand(1);
8455 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8456 DAG.getNode(ISD::FNEG, SL, VT, N1.getOperand(0)),
8458 DAG.getNode(PreferredFusedOpcode, SL, VT,
8459 DAG.getNode(ISD::FNEG, SL, VT,
8460 DAG.getNode(ISD::FP_EXTEND, SL,
8462 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8468 // fold (fsub x, (fpext (fma y, z, (fmul u, v))))
8469 // -> (fma (fneg (fpext y)), (fpext z),
8470 // (fma (fneg (fpext u)), (fpext v), x))
8471 // FIXME: This turns two single-precision and one double-precision
8472 // operation into two double-precision operations, which might not be
8473 // interesting for all targets, especially GPUs.
8474 if (N1.getOpcode() == ISD::FP_EXTEND &&
8475 N1.getOperand(0).getOpcode() == PreferredFusedOpcode) {
8476 SDValue N100 = N1.getOperand(0).getOperand(0);
8477 SDValue N101 = N1.getOperand(0).getOperand(1);
8478 SDValue N102 = N1.getOperand(0).getOperand(2);
8479 if (N102.getOpcode() == ISD::FMUL) {
8480 SDValue N1020 = N102.getOperand(0);
8481 SDValue N1021 = N102.getOperand(1);
8482 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8483 DAG.getNode(ISD::FNEG, SL, VT,
8484 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8486 DAG.getNode(ISD::FP_EXTEND, SL, VT, N101),
8487 DAG.getNode(PreferredFusedOpcode, SL, VT,
8488 DAG.getNode(ISD::FNEG, SL, VT,
8489 DAG.getNode(ISD::FP_EXTEND, SL,
8491 DAG.getNode(ISD::FP_EXTEND, SL, VT,
8502 /// Try to perform FMA combining on a given FMUL node based on the distributive
8503 /// law x * (y + 1) = x * y + x and variants thereof (commuted versions,
8504 /// subtraction instead of addition).
8505 SDValue DAGCombiner::visitFMULForFMADistributiveCombine(SDNode *N) {
8506 SDValue N0 = N->getOperand(0);
8507 SDValue N1 = N->getOperand(1);
8508 EVT VT = N->getValueType(0);
8511 assert(N->getOpcode() == ISD::FMUL && "Expected FMUL Operation");
8513 const TargetOptions &Options = DAG.getTarget().Options;
8515 // The transforms below are incorrect when x == 0 and y == inf, because the
8516 // intermediate multiplication produces a nan.
8517 if (!Options.NoInfsFPMath)
8520 // Floating-point multiply-add without intermediate rounding.
8522 (Options.AllowFPOpFusion == FPOpFusion::Fast || Options.UnsafeFPMath) &&
8523 TLI.isFMAFasterThanFMulAndFAdd(VT) &&
8524 (!LegalOperations || TLI.isOperationLegalOrCustom(ISD::FMA, VT));
8526 // Floating-point multiply-add with intermediate rounding. This can result
8527 // in a less precise result due to the changed rounding order.
8528 bool HasFMAD = Options.UnsafeFPMath &&
8529 (LegalOperations && TLI.isOperationLegal(ISD::FMAD, VT));
8531 // No valid opcode, do not combine.
8532 if (!HasFMAD && !HasFMA)
8535 // Always prefer FMAD to FMA for precision.
8536 unsigned PreferredFusedOpcode = HasFMAD ? ISD::FMAD : ISD::FMA;
8537 bool Aggressive = TLI.enableAggressiveFMAFusion(VT);
8539 // fold (fmul (fadd x, +1.0), y) -> (fma x, y, y)
8540 // fold (fmul (fadd x, -1.0), y) -> (fma x, y, (fneg y))
8541 auto FuseFADD = [&](SDValue X, SDValue Y) {
8542 if (X.getOpcode() == ISD::FADD && (Aggressive || X->hasOneUse())) {
8543 auto XC1 = isConstOrConstSplatFP(X.getOperand(1));
8544 if (XC1 && XC1->isExactlyValue(+1.0))
8545 return DAG.getNode(PreferredFusedOpcode, SL, VT, X.getOperand(0), Y, Y);
8546 if (XC1 && XC1->isExactlyValue(-1.0))
8547 return DAG.getNode(PreferredFusedOpcode, SL, VT, X.getOperand(0), Y,
8548 DAG.getNode(ISD::FNEG, SL, VT, Y));
8553 if (SDValue FMA = FuseFADD(N0, N1))
8555 if (SDValue FMA = FuseFADD(N1, N0))
8558 // fold (fmul (fsub +1.0, x), y) -> (fma (fneg x), y, y)
8559 // fold (fmul (fsub -1.0, x), y) -> (fma (fneg x), y, (fneg y))
8560 // fold (fmul (fsub x, +1.0), y) -> (fma x, y, (fneg y))
8561 // fold (fmul (fsub x, -1.0), y) -> (fma x, y, y)
8562 auto FuseFSUB = [&](SDValue X, SDValue Y) {
8563 if (X.getOpcode() == ISD::FSUB && (Aggressive || X->hasOneUse())) {
8564 auto XC0 = isConstOrConstSplatFP(X.getOperand(0));
8565 if (XC0 && XC0->isExactlyValue(+1.0))
8566 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8567 DAG.getNode(ISD::FNEG, SL, VT, X.getOperand(1)), Y,
8569 if (XC0 && XC0->isExactlyValue(-1.0))
8570 return DAG.getNode(PreferredFusedOpcode, SL, VT,
8571 DAG.getNode(ISD::FNEG, SL, VT, X.getOperand(1)), Y,
8572 DAG.getNode(ISD::FNEG, SL, VT, Y));
8574 auto XC1 = isConstOrConstSplatFP(X.getOperand(1));
8575 if (XC1 && XC1->isExactlyValue(+1.0))
8576 return DAG.getNode(PreferredFusedOpcode, SL, VT, X.getOperand(0), Y,
8577 DAG.getNode(ISD::FNEG, SL, VT, Y));
8578 if (XC1 && XC1->isExactlyValue(-1.0))
8579 return DAG.getNode(PreferredFusedOpcode, SL, VT, X.getOperand(0), Y, Y);
8584 if (SDValue FMA = FuseFSUB(N0, N1))
8586 if (SDValue FMA = FuseFSUB(N1, N0))
8592 SDValue DAGCombiner::visitFADD(SDNode *N) {
8593 SDValue N0 = N->getOperand(0);
8594 SDValue N1 = N->getOperand(1);
8595 bool N0CFP = isConstantFPBuildVectorOrConstantFP(N0);
8596 bool N1CFP = isConstantFPBuildVectorOrConstantFP(N1);
8597 EVT VT = N->getValueType(0);
8599 const TargetOptions &Options = DAG.getTarget().Options;
8600 const SDNodeFlags *Flags = &cast<BinaryWithFlagsSDNode>(N)->Flags;
8604 if (SDValue FoldedVOp = SimplifyVBinOp(N))
8607 // fold (fadd c1, c2) -> c1 + c2
8609 return DAG.getNode(ISD::FADD, DL, VT, N0, N1, Flags);
8611 // canonicalize constant to RHS
8612 if (N0CFP && !N1CFP)
8613 return DAG.getNode(ISD::FADD, DL, VT, N1, N0, Flags);
8615 // fold (fadd A, (fneg B)) -> (fsub A, B)
8616 if ((!LegalOperations || TLI.isOperationLegalOrCustom(ISD::FSUB, VT)) &&
8617 isNegatibleForFree(N1, LegalOperations, TLI, &Options) == 2)
8618 return DAG.getNode(ISD::FSUB, DL, VT, N0,
8619 GetNegatedExpression(N1, DAG, LegalOperations), Flags);
8621 // fold (fadd (fneg A), B) -> (fsub B, A)
8622 if ((!LegalOperations || TLI.isOperationLegalOrCustom(ISD::FSUB, VT)) &&
8623 isNegatibleForFree(N0, LegalOperations, TLI, &Options) == 2)
8624 return DAG.getNode(ISD::FSUB, DL, VT, N1,
8625 GetNegatedExpression(N0, DAG, LegalOperations), Flags);
8627 // FIXME: Auto-upgrade the target/function-level option.
8628 if (Options.UnsafeFPMath || N->getFlags()->hasNoSignedZeros()) {
8629 // fold (fadd A, 0) -> A
8630 if (ConstantFPSDNode *N1C = isConstOrConstSplatFP(N1))
8635 // If 'unsafe math' is enabled, fold lots of things.
8636 if (Options.UnsafeFPMath) {
8637 // No FP constant should be created after legalization as Instruction
8638 // Selection pass has a hard time dealing with FP constants.
8639 bool AllowNewConst = (Level < AfterLegalizeDAG);
8641 // fold (fadd (fadd x, c1), c2) -> (fadd x, (fadd c1, c2))
8642 if (N1CFP && N0.getOpcode() == ISD::FADD && N0.getNode()->hasOneUse() &&
8643 isConstantFPBuildVectorOrConstantFP(N0.getOperand(1)))
8644 return DAG.getNode(ISD::FADD, DL, VT, N0.getOperand(0),
8645 DAG.getNode(ISD::FADD, DL, VT, N0.getOperand(1), N1,
8649 // If allowed, fold (fadd (fneg x), x) -> 0.0
8650 if (AllowNewConst && N0.getOpcode() == ISD::FNEG && N0.getOperand(0) == N1)
8651 return DAG.getConstantFP(0.0, DL, VT);
8653 // If allowed, fold (fadd x, (fneg x)) -> 0.0
8654 if (AllowNewConst && N1.getOpcode() == ISD::FNEG && N1.getOperand(0) == N0)
8655 return DAG.getConstantFP(0.0, DL, VT);
8657 // We can fold chains of FADD's of the same value into multiplications.
8658 // This transform is not safe in general because we are reducing the number
8659 // of rounding steps.
8660 if (TLI.isOperationLegalOrCustom(ISD::FMUL, VT) && !N0CFP && !N1CFP) {
8661 if (N0.getOpcode() == ISD::FMUL) {
8662 bool CFP00 = isConstantFPBuildVectorOrConstantFP(N0.getOperand(0));
8663 bool CFP01 = isConstantFPBuildVectorOrConstantFP(N0.getOperand(1));
8665 // (fadd (fmul x, c), x) -> (fmul x, c+1)
8666 if (CFP01 && !CFP00 && N0.getOperand(0) == N1) {
8667 SDValue NewCFP = DAG.getNode(ISD::FADD, DL, VT, N0.getOperand(1),
8668 DAG.getConstantFP(1.0, DL, VT), Flags);
8669 return DAG.getNode(ISD::FMUL, DL, VT, N1, NewCFP, Flags);
8672 // (fadd (fmul x, c), (fadd x, x)) -> (fmul x, c+2)
8673 if (CFP01 && !CFP00 && N1.getOpcode() == ISD::FADD &&
8674 N1.getOperand(0) == N1.getOperand(1) &&
8675 N0.getOperand(0) == N1.getOperand(0)) {
8676 SDValue NewCFP = DAG.getNode(ISD::FADD, DL, VT, N0.getOperand(1),
8677 DAG.getConstantFP(2.0, DL, VT), Flags);
8678 return DAG.getNode(ISD::FMUL, DL, VT, N0.getOperand(0), NewCFP, Flags);
8682 if (N1.getOpcode() == ISD::FMUL) {
8683 bool CFP10 = isConstantFPBuildVectorOrConstantFP(N1.getOperand(0));
8684 bool CFP11 = isConstantFPBuildVectorOrConstantFP(N1.getOperand(1));
8686 // (fadd x, (fmul x, c)) -> (fmul x, c+1)
8687 if (CFP11 && !CFP10 && N1.getOperand(0) == N0) {
8688 SDValue NewCFP = DAG.getNode(ISD::FADD, DL, VT, N1.getOperand(1),
8689 DAG.getConstantFP(1.0, DL, VT), Flags);
8690 return DAG.getNode(ISD::FMUL, DL, VT, N0, NewCFP, Flags);
8693 // (fadd (fadd x, x), (fmul x, c)) -> (fmul x, c+2)
8694 if (CFP11 && !CFP10 && N0.getOpcode() == ISD::FADD &&
8695 N0.getOperand(0) == N0.getOperand(1) &&
8696 N1.getOperand(0) == N0.getOperand(0)) {
8697 SDValue NewCFP = DAG.getNode(ISD::FADD, DL, VT, N1.getOperand(1),
8698 DAG.getConstantFP(2.0, DL, VT), Flags);
8699 return DAG.getNode(ISD::FMUL, DL, VT, N1.getOperand(0), NewCFP, Flags);
8703 if (N0.getOpcode() == ISD::FADD && AllowNewConst) {
8704 bool CFP00 = isConstantFPBuildVectorOrConstantFP(N0.getOperand(0));
8705 // (fadd (fadd x, x), x) -> (fmul x, 3.0)
8706 if (!CFP00 && N0.getOperand(0) == N0.getOperand(1) &&
8707 (N0.getOperand(0) == N1)) {
8708 return DAG.getNode(ISD::FMUL, DL, VT,
8709 N1, DAG.getConstantFP(3.0, DL, VT), Flags);
8713 if (N1.getOpcode() == ISD::FADD && AllowNewConst) {
8714 bool CFP10 = isConstantFPBuildVectorOrConstantFP(N1.getOperand(0));
8715 // (fadd x, (fadd x, x)) -> (fmul x, 3.0)
8716 if (!CFP10 && N1.getOperand(0) == N1.getOperand(1) &&
8717 N1.getOperand(0) == N0) {
8718 return DAG.getNode(ISD::FMUL, DL, VT,
8719 N0, DAG.getConstantFP(3.0, DL, VT), Flags);
8723 // (fadd (fadd x, x), (fadd x, x)) -> (fmul x, 4.0)
8724 if (AllowNewConst &&
8725 N0.getOpcode() == ISD::FADD && N1.getOpcode() == ISD::FADD &&
8726 N0.getOperand(0) == N0.getOperand(1) &&
8727 N1.getOperand(0) == N1.getOperand(1) &&
8728 N0.getOperand(0) == N1.getOperand(0)) {
8729 return DAG.getNode(ISD::FMUL, DL, VT, N0.getOperand(0),
8730 DAG.getConstantFP(4.0, DL, VT), Flags);
8733 } // enable-unsafe-fp-math
8735 // FADD -> FMA combines:
8736 if (SDValue Fused = visitFADDForFMACombine(N)) {
8737 AddToWorklist(Fused.getNode());
8743 SDValue DAGCombiner::visitFSUB(SDNode *N) {
8744 SDValue N0 = N->getOperand(0);
8745 SDValue N1 = N->getOperand(1);
8746 ConstantFPSDNode *N0CFP = isConstOrConstSplatFP(N0);
8747 ConstantFPSDNode *N1CFP = isConstOrConstSplatFP(N1);
8748 EVT VT = N->getValueType(0);
8750 const TargetOptions &Options = DAG.getTarget().Options;
8751 const SDNodeFlags *Flags = &cast<BinaryWithFlagsSDNode>(N)->Flags;
8755 if (SDValue FoldedVOp = SimplifyVBinOp(N))
8758 // fold (fsub c1, c2) -> c1-c2
8760 return DAG.getNode(ISD::FSUB, DL, VT, N0, N1, Flags);
8762 // fold (fsub A, (fneg B)) -> (fadd A, B)
8763 if (isNegatibleForFree(N1, LegalOperations, TLI, &Options))
8764 return DAG.getNode(ISD::FADD, DL, VT, N0,
8765 GetNegatedExpression(N1, DAG, LegalOperations), Flags);
8767 // FIXME: Auto-upgrade the target/function-level option.
8768 if (Options.UnsafeFPMath || N->getFlags()->hasNoSignedZeros()) {
8769 // (fsub 0, B) -> -B
8770 if (N0CFP && N0CFP->isZero()) {
8771 if (isNegatibleForFree(N1, LegalOperations, TLI, &Options))
8772 return GetNegatedExpression(N1, DAG, LegalOperations);
8773 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
8774 return DAG.getNode(ISD::FNEG, DL, VT, N1, Flags);
8778 // If 'unsafe math' is enabled, fold lots of things.
8779 if (Options.UnsafeFPMath) {
8781 if (N1CFP && N1CFP->isZero())
8784 // (fsub x, x) -> 0.0
8786 return DAG.getConstantFP(0.0f, DL, VT);
8788 // (fsub x, (fadd x, y)) -> (fneg y)
8789 // (fsub x, (fadd y, x)) -> (fneg y)
8790 if (N1.getOpcode() == ISD::FADD) {
8791 SDValue N10 = N1->getOperand(0);
8792 SDValue N11 = N1->getOperand(1);
8794 if (N10 == N0 && isNegatibleForFree(N11, LegalOperations, TLI, &Options))
8795 return GetNegatedExpression(N11, DAG, LegalOperations);
8797 if (N11 == N0 && isNegatibleForFree(N10, LegalOperations, TLI, &Options))
8798 return GetNegatedExpression(N10, DAG, LegalOperations);
8802 // FSUB -> FMA combines:
8803 if (SDValue Fused = visitFSUBForFMACombine(N)) {
8804 AddToWorklist(Fused.getNode());
8811 SDValue DAGCombiner::visitFMUL(SDNode *N) {
8812 SDValue N0 = N->getOperand(0);
8813 SDValue N1 = N->getOperand(1);
8814 ConstantFPSDNode *N0CFP = isConstOrConstSplatFP(N0);
8815 ConstantFPSDNode *N1CFP = isConstOrConstSplatFP(N1);
8816 EVT VT = N->getValueType(0);
8818 const TargetOptions &Options = DAG.getTarget().Options;
8819 const SDNodeFlags *Flags = &cast<BinaryWithFlagsSDNode>(N)->Flags;
8822 if (VT.isVector()) {
8823 // This just handles C1 * C2 for vectors. Other vector folds are below.
8824 if (SDValue FoldedVOp = SimplifyVBinOp(N))
8828 // fold (fmul c1, c2) -> c1*c2
8830 return DAG.getNode(ISD::FMUL, DL, VT, N0, N1, Flags);
8832 // canonicalize constant to RHS
8833 if (isConstantFPBuildVectorOrConstantFP(N0) &&
8834 !isConstantFPBuildVectorOrConstantFP(N1))
8835 return DAG.getNode(ISD::FMUL, DL, VT, N1, N0, Flags);
8837 // fold (fmul A, 1.0) -> A
8838 if (N1CFP && N1CFP->isExactlyValue(1.0))
8841 if (Options.UnsafeFPMath) {
8842 // fold (fmul A, 0) -> 0
8843 if (N1CFP && N1CFP->isZero())
8846 // fold (fmul (fmul x, c1), c2) -> (fmul x, (fmul c1, c2))
8847 if (N0.getOpcode() == ISD::FMUL) {
8848 // Fold scalars or any vector constants (not just splats).
8849 // This fold is done in general by InstCombine, but extra fmul insts
8850 // may have been generated during lowering.
8851 SDValue N00 = N0.getOperand(0);
8852 SDValue N01 = N0.getOperand(1);
8853 auto *BV1 = dyn_cast<BuildVectorSDNode>(N1);
8854 auto *BV00 = dyn_cast<BuildVectorSDNode>(N00);
8855 auto *BV01 = dyn_cast<BuildVectorSDNode>(N01);
8857 // Check 1: Make sure that the first operand of the inner multiply is NOT
8858 // a constant. Otherwise, we may induce infinite looping.
8859 if (!(isConstOrConstSplatFP(N00) || (BV00 && BV00->isConstant()))) {
8860 // Check 2: Make sure that the second operand of the inner multiply and
8861 // the second operand of the outer multiply are constants.
8862 if ((N1CFP && isConstOrConstSplatFP(N01)) ||
8863 (BV1 && BV01 && BV1->isConstant() && BV01->isConstant())) {
8864 SDValue MulConsts = DAG.getNode(ISD::FMUL, DL, VT, N01, N1, Flags);
8865 return DAG.getNode(ISD::FMUL, DL, VT, N00, MulConsts, Flags);
8870 // fold (fmul (fadd x, x), c) -> (fmul x, (fmul 2.0, c))
8871 // Undo the fmul 2.0, x -> fadd x, x transformation, since if it occurs
8872 // during an early run of DAGCombiner can prevent folding with fmuls
8873 // inserted during lowering.
8874 if (N0.getOpcode() == ISD::FADD &&
8875 (N0.getOperand(0) == N0.getOperand(1)) &&
8877 const SDValue Two = DAG.getConstantFP(2.0, DL, VT);
8878 SDValue MulConsts = DAG.getNode(ISD::FMUL, DL, VT, Two, N1, Flags);
8879 return DAG.getNode(ISD::FMUL, DL, VT, N0.getOperand(0), MulConsts, Flags);
8883 // fold (fmul X, 2.0) -> (fadd X, X)
8884 if (N1CFP && N1CFP->isExactlyValue(+2.0))
8885 return DAG.getNode(ISD::FADD, DL, VT, N0, N0, Flags);
8887 // fold (fmul X, -1.0) -> (fneg X)
8888 if (N1CFP && N1CFP->isExactlyValue(-1.0))
8889 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
8890 return DAG.getNode(ISD::FNEG, DL, VT, N0);
8892 // fold (fmul (fneg X), (fneg Y)) -> (fmul X, Y)
8893 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations, TLI, &Options)) {
8894 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations, TLI, &Options)) {
8895 // Both can be negated for free, check to see if at least one is cheaper
8897 if (LHSNeg == 2 || RHSNeg == 2)
8898 return DAG.getNode(ISD::FMUL, DL, VT,
8899 GetNegatedExpression(N0, DAG, LegalOperations),
8900 GetNegatedExpression(N1, DAG, LegalOperations),
8905 // FMUL -> FMA combines:
8906 if (SDValue Fused = visitFMULForFMADistributiveCombine(N)) {
8907 AddToWorklist(Fused.getNode());
8914 SDValue DAGCombiner::visitFMA(SDNode *N) {
8915 SDValue N0 = N->getOperand(0);
8916 SDValue N1 = N->getOperand(1);
8917 SDValue N2 = N->getOperand(2);
8918 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
8919 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
8920 EVT VT = N->getValueType(0);
8922 const TargetOptions &Options = DAG.getTarget().Options;
8924 // Constant fold FMA.
8925 if (isa<ConstantFPSDNode>(N0) &&
8926 isa<ConstantFPSDNode>(N1) &&
8927 isa<ConstantFPSDNode>(N2)) {
8928 return DAG.getNode(ISD::FMA, DL, VT, N0, N1, N2);
8931 if (Options.UnsafeFPMath) {
8932 if (N0CFP && N0CFP->isZero())
8934 if (N1CFP && N1CFP->isZero())
8937 // TODO: The FMA node should have flags that propagate to these nodes.
8938 if (N0CFP && N0CFP->isExactlyValue(1.0))
8939 return DAG.getNode(ISD::FADD, SDLoc(N), VT, N1, N2);
8940 if (N1CFP && N1CFP->isExactlyValue(1.0))
8941 return DAG.getNode(ISD::FADD, SDLoc(N), VT, N0, N2);
8943 // Canonicalize (fma c, x, y) -> (fma x, c, y)
8944 if (isConstantFPBuildVectorOrConstantFP(N0) &&
8945 !isConstantFPBuildVectorOrConstantFP(N1))
8946 return DAG.getNode(ISD::FMA, SDLoc(N), VT, N1, N0, N2);
8948 // TODO: FMA nodes should have flags that propagate to the created nodes.
8949 // For now, create a Flags object for use with all unsafe math transforms.
8951 Flags.setUnsafeAlgebra(true);
8953 if (Options.UnsafeFPMath) {
8954 // (fma x, c1, (fmul x, c2)) -> (fmul x, c1+c2)
8955 if (N2.getOpcode() == ISD::FMUL && N0 == N2.getOperand(0) &&
8956 isConstantFPBuildVectorOrConstantFP(N1) &&
8957 isConstantFPBuildVectorOrConstantFP(N2.getOperand(1))) {
8958 return DAG.getNode(ISD::FMUL, DL, VT, N0,
8959 DAG.getNode(ISD::FADD, DL, VT, N1, N2.getOperand(1),
8963 // (fma (fmul x, c1), c2, y) -> (fma x, c1*c2, y)
8964 if (N0.getOpcode() == ISD::FMUL &&
8965 isConstantFPBuildVectorOrConstantFP(N1) &&
8966 isConstantFPBuildVectorOrConstantFP(N0.getOperand(1))) {
8967 return DAG.getNode(ISD::FMA, DL, VT,
8969 DAG.getNode(ISD::FMUL, DL, VT, N1, N0.getOperand(1),
8975 // (fma x, 1, y) -> (fadd x, y)
8976 // (fma x, -1, y) -> (fadd (fneg x), y)
8978 if (N1CFP->isExactlyValue(1.0))
8979 // TODO: The FMA node should have flags that propagate to this node.
8980 return DAG.getNode(ISD::FADD, DL, VT, N0, N2);
8982 if (N1CFP->isExactlyValue(-1.0) &&
8983 (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))) {
8984 SDValue RHSNeg = DAG.getNode(ISD::FNEG, DL, VT, N0);
8985 AddToWorklist(RHSNeg.getNode());
8986 // TODO: The FMA node should have flags that propagate to this node.
8987 return DAG.getNode(ISD::FADD, DL, VT, N2, RHSNeg);
8991 if (Options.UnsafeFPMath) {
8992 // (fma x, c, x) -> (fmul x, (c+1))
8993 if (N1CFP && N0 == N2) {
8994 return DAG.getNode(ISD::FMUL, DL, VT, N0,
8995 DAG.getNode(ISD::FADD, DL, VT, N1,
8996 DAG.getConstantFP(1.0, DL, VT), &Flags),
9000 // (fma x, c, (fneg x)) -> (fmul x, (c-1))
9001 if (N1CFP && N2.getOpcode() == ISD::FNEG && N2.getOperand(0) == N0) {
9002 return DAG.getNode(ISD::FMUL, DL, VT, N0,
9003 DAG.getNode(ISD::FADD, DL, VT, N1,
9004 DAG.getConstantFP(-1.0, DL, VT), &Flags),
9012 // Combine multiple FDIVs with the same divisor into multiple FMULs by the
9014 // E.g., (a / D; b / D;) -> (recip = 1.0 / D; a * recip; b * recip)
9015 // Notice that this is not always beneficial. One reason is different targets
9016 // may have different costs for FDIV and FMUL, so sometimes the cost of two
9017 // FDIVs may be lower than the cost of one FDIV and two FMULs. Another reason
9018 // is the critical path is increased from "one FDIV" to "one FDIV + one FMUL".
9019 SDValue DAGCombiner::combineRepeatedFPDivisors(SDNode *N) {
9020 bool UnsafeMath = DAG.getTarget().Options.UnsafeFPMath;
9021 const SDNodeFlags *Flags = N->getFlags();
9022 if (!UnsafeMath && !Flags->hasAllowReciprocal())
9025 // Skip if current node is a reciprocal.
9026 SDValue N0 = N->getOperand(0);
9027 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9028 if (N0CFP && N0CFP->isExactlyValue(1.0))
9031 // Exit early if the target does not want this transform or if there can't
9032 // possibly be enough uses of the divisor to make the transform worthwhile.
9033 SDValue N1 = N->getOperand(1);
9034 unsigned MinUses = TLI.combineRepeatedFPDivisors();
9035 if (!MinUses || N1->use_size() < MinUses)
9038 // Find all FDIV users of the same divisor.
9039 // Use a set because duplicates may be present in the user list.
9040 SetVector<SDNode *> Users;
9041 for (auto *U : N1->uses()) {
9042 if (U->getOpcode() == ISD::FDIV && U->getOperand(1) == N1) {
9043 // This division is eligible for optimization only if global unsafe math
9044 // is enabled or if this division allows reciprocal formation.
9045 if (UnsafeMath || U->getFlags()->hasAllowReciprocal())
9050 // Now that we have the actual number of divisor uses, make sure it meets
9051 // the minimum threshold specified by the target.
9052 if (Users.size() < MinUses)
9055 EVT VT = N->getValueType(0);
9057 SDValue FPOne = DAG.getConstantFP(1.0, DL, VT);
9058 SDValue Reciprocal = DAG.getNode(ISD::FDIV, DL, VT, FPOne, N1, Flags);
9060 // Dividend / Divisor -> Dividend * Reciprocal
9061 for (auto *U : Users) {
9062 SDValue Dividend = U->getOperand(0);
9063 if (Dividend != FPOne) {
9064 SDValue NewNode = DAG.getNode(ISD::FMUL, SDLoc(U), VT, Dividend,
9066 CombineTo(U, NewNode);
9067 } else if (U != Reciprocal.getNode()) {
9068 // In the absence of fast-math-flags, this user node is always the
9069 // same node as Reciprocal, but with FMF they may be different nodes.
9070 CombineTo(U, Reciprocal);
9073 return SDValue(N, 0); // N was replaced.
9076 SDValue DAGCombiner::visitFDIV(SDNode *N) {
9077 SDValue N0 = N->getOperand(0);
9078 SDValue N1 = N->getOperand(1);
9079 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9080 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
9081 EVT VT = N->getValueType(0);
9083 const TargetOptions &Options = DAG.getTarget().Options;
9084 SDNodeFlags *Flags = &cast<BinaryWithFlagsSDNode>(N)->Flags;
9088 if (SDValue FoldedVOp = SimplifyVBinOp(N))
9091 // fold (fdiv c1, c2) -> c1/c2
9093 return DAG.getNode(ISD::FDIV, SDLoc(N), VT, N0, N1, Flags);
9095 if (Options.UnsafeFPMath) {
9096 // fold (fdiv X, c2) -> fmul X, 1/c2 if losing precision is acceptable.
9098 // Compute the reciprocal 1.0 / c2.
9099 const APFloat &N1APF = N1CFP->getValueAPF();
9100 APFloat Recip(N1APF.getSemantics(), 1); // 1.0
9101 APFloat::opStatus st = Recip.divide(N1APF, APFloat::rmNearestTiesToEven);
9102 // Only do the transform if the reciprocal is a legal fp immediate that
9103 // isn't too nasty (eg NaN, denormal, ...).
9104 if ((st == APFloat::opOK || st == APFloat::opInexact) && // Not too nasty
9105 (!LegalOperations ||
9106 // FIXME: custom lowering of ConstantFP might fail (see e.g. ARM
9107 // backend)... we should handle this gracefully after Legalize.
9108 // TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT) ||
9109 TLI.isOperationLegal(llvm::ISD::ConstantFP, VT) ||
9110 TLI.isFPImmLegal(Recip, VT)))
9111 return DAG.getNode(ISD::FMUL, DL, VT, N0,
9112 DAG.getConstantFP(Recip, DL, VT), Flags);
9115 // If this FDIV is part of a reciprocal square root, it may be folded
9116 // into a target-specific square root estimate instruction.
9117 if (N1.getOpcode() == ISD::FSQRT) {
9118 if (SDValue RV = buildRsqrtEstimate(N1.getOperand(0), Flags)) {
9119 return DAG.getNode(ISD::FMUL, DL, VT, N0, RV, Flags);
9121 } else if (N1.getOpcode() == ISD::FP_EXTEND &&
9122 N1.getOperand(0).getOpcode() == ISD::FSQRT) {
9123 if (SDValue RV = buildRsqrtEstimate(N1.getOperand(0).getOperand(0),
9125 RV = DAG.getNode(ISD::FP_EXTEND, SDLoc(N1), VT, RV);
9126 AddToWorklist(RV.getNode());
9127 return DAG.getNode(ISD::FMUL, DL, VT, N0, RV, Flags);
9129 } else if (N1.getOpcode() == ISD::FP_ROUND &&
9130 N1.getOperand(0).getOpcode() == ISD::FSQRT) {
9131 if (SDValue RV = buildRsqrtEstimate(N1.getOperand(0).getOperand(0),
9133 RV = DAG.getNode(ISD::FP_ROUND, SDLoc(N1), VT, RV, N1.getOperand(1));
9134 AddToWorklist(RV.getNode());
9135 return DAG.getNode(ISD::FMUL, DL, VT, N0, RV, Flags);
9137 } else if (N1.getOpcode() == ISD::FMUL) {
9138 // Look through an FMUL. Even though this won't remove the FDIV directly,
9139 // it's still worthwhile to get rid of the FSQRT if possible.
9142 if (N1.getOperand(0).getOpcode() == ISD::FSQRT) {
9143 SqrtOp = N1.getOperand(0);
9144 OtherOp = N1.getOperand(1);
9145 } else if (N1.getOperand(1).getOpcode() == ISD::FSQRT) {
9146 SqrtOp = N1.getOperand(1);
9147 OtherOp = N1.getOperand(0);
9149 if (SqrtOp.getNode()) {
9150 // We found a FSQRT, so try to make this fold:
9151 // x / (y * sqrt(z)) -> x * (rsqrt(z) / y)
9152 if (SDValue RV = buildRsqrtEstimate(SqrtOp.getOperand(0), Flags)) {
9153 RV = DAG.getNode(ISD::FDIV, SDLoc(N1), VT, RV, OtherOp, Flags);
9154 AddToWorklist(RV.getNode());
9155 return DAG.getNode(ISD::FMUL, DL, VT, N0, RV, Flags);
9160 // Fold into a reciprocal estimate and multiply instead of a real divide.
9161 if (SDValue RV = BuildReciprocalEstimate(N1, Flags)) {
9162 AddToWorklist(RV.getNode());
9163 return DAG.getNode(ISD::FMUL, DL, VT, N0, RV, Flags);
9167 // (fdiv (fneg X), (fneg Y)) -> (fdiv X, Y)
9168 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations, TLI, &Options)) {
9169 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations, TLI, &Options)) {
9170 // Both can be negated for free, check to see if at least one is cheaper
9172 if (LHSNeg == 2 || RHSNeg == 2)
9173 return DAG.getNode(ISD::FDIV, SDLoc(N), VT,
9174 GetNegatedExpression(N0, DAG, LegalOperations),
9175 GetNegatedExpression(N1, DAG, LegalOperations),
9180 if (SDValue CombineRepeatedDivisors = combineRepeatedFPDivisors(N))
9181 return CombineRepeatedDivisors;
9186 SDValue DAGCombiner::visitFREM(SDNode *N) {
9187 SDValue N0 = N->getOperand(0);
9188 SDValue N1 = N->getOperand(1);
9189 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9190 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
9191 EVT VT = N->getValueType(0);
9193 // fold (frem c1, c2) -> fmod(c1,c2)
9195 return DAG.getNode(ISD::FREM, SDLoc(N), VT, N0, N1,
9196 &cast<BinaryWithFlagsSDNode>(N)->Flags);
9201 SDValue DAGCombiner::visitFSQRT(SDNode *N) {
9202 if (!DAG.getTarget().Options.UnsafeFPMath)
9205 SDValue N0 = N->getOperand(0);
9206 if (TLI.isFsqrtCheap(N0, DAG))
9209 // TODO: FSQRT nodes should have flags that propagate to the created nodes.
9210 // For now, create a Flags object for use with all unsafe math transforms.
9212 Flags.setUnsafeAlgebra(true);
9213 return buildSqrtEstimate(N0, &Flags);
9216 /// copysign(x, fp_extend(y)) -> copysign(x, y)
9217 /// copysign(x, fp_round(y)) -> copysign(x, y)
9218 static inline bool CanCombineFCOPYSIGN_EXTEND_ROUND(SDNode *N) {
9219 SDValue N1 = N->getOperand(1);
9220 if ((N1.getOpcode() == ISD::FP_EXTEND ||
9221 N1.getOpcode() == ISD::FP_ROUND)) {
9222 // Do not optimize out type conversion of f128 type yet.
9223 // For some targets like x86_64, configuration is changed to keep one f128
9224 // value in one SSE register, but instruction selection cannot handle
9225 // FCOPYSIGN on SSE registers yet.
9226 EVT N1VT = N1->getValueType(0);
9227 EVT N1Op0VT = N1->getOperand(0)->getValueType(0);
9228 return (N1VT == N1Op0VT || N1Op0VT != MVT::f128);
9233 SDValue DAGCombiner::visitFCOPYSIGN(SDNode *N) {
9234 SDValue N0 = N->getOperand(0);
9235 SDValue N1 = N->getOperand(1);
9236 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9237 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1);
9238 EVT VT = N->getValueType(0);
9240 if (N0CFP && N1CFP) // Constant fold
9241 return DAG.getNode(ISD::FCOPYSIGN, SDLoc(N), VT, N0, N1);
9244 const APFloat &V = N1CFP->getValueAPF();
9245 // copysign(x, c1) -> fabs(x) iff ispos(c1)
9246 // copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1)
9247 if (!V.isNegative()) {
9248 if (!LegalOperations || TLI.isOperationLegal(ISD::FABS, VT))
9249 return DAG.getNode(ISD::FABS, SDLoc(N), VT, N0);
9251 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT))
9252 return DAG.getNode(ISD::FNEG, SDLoc(N), VT,
9253 DAG.getNode(ISD::FABS, SDLoc(N0), VT, N0));
9257 // copysign(fabs(x), y) -> copysign(x, y)
9258 // copysign(fneg(x), y) -> copysign(x, y)
9259 // copysign(copysign(x,z), y) -> copysign(x, y)
9260 if (N0.getOpcode() == ISD::FABS || N0.getOpcode() == ISD::FNEG ||
9261 N0.getOpcode() == ISD::FCOPYSIGN)
9262 return DAG.getNode(ISD::FCOPYSIGN, SDLoc(N), VT, N0.getOperand(0), N1);
9264 // copysign(x, abs(y)) -> abs(x)
9265 if (N1.getOpcode() == ISD::FABS)
9266 return DAG.getNode(ISD::FABS, SDLoc(N), VT, N0);
9268 // copysign(x, copysign(y,z)) -> copysign(x, z)
9269 if (N1.getOpcode() == ISD::FCOPYSIGN)
9270 return DAG.getNode(ISD::FCOPYSIGN, SDLoc(N), VT, N0, N1.getOperand(1));
9272 // copysign(x, fp_extend(y)) -> copysign(x, y)
9273 // copysign(x, fp_round(y)) -> copysign(x, y)
9274 if (CanCombineFCOPYSIGN_EXTEND_ROUND(N))
9275 return DAG.getNode(ISD::FCOPYSIGN, SDLoc(N), VT, N0, N1.getOperand(0));
9280 SDValue DAGCombiner::visitSINT_TO_FP(SDNode *N) {
9281 SDValue N0 = N->getOperand(0);
9282 EVT VT = N->getValueType(0);
9283 EVT OpVT = N0.getValueType();
9285 // fold (sint_to_fp c1) -> c1fp
9286 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
9287 // ...but only if the target supports immediate floating-point values
9288 (!LegalOperations ||
9289 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT)))
9290 return DAG.getNode(ISD::SINT_TO_FP, SDLoc(N), VT, N0);
9292 // If the input is a legal type, and SINT_TO_FP is not legal on this target,
9293 // but UINT_TO_FP is legal on this target, try to convert.
9294 if (!TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT) &&
9295 TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT)) {
9296 // If the sign bit is known to be zero, we can change this to UINT_TO_FP.
9297 if (DAG.SignBitIsZero(N0))
9298 return DAG.getNode(ISD::UINT_TO_FP, SDLoc(N), VT, N0);
9301 // The next optimizations are desirable only if SELECT_CC can be lowered.
9302 if (TLI.isOperationLegalOrCustom(ISD::SELECT_CC, VT) || !LegalOperations) {
9303 // fold (sint_to_fp (setcc x, y, cc)) -> (select_cc x, y, -1.0, 0.0,, cc)
9304 if (N0.getOpcode() == ISD::SETCC && N0.getValueType() == MVT::i1 &&
9306 (!LegalOperations ||
9307 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT))) {
9310 { N0.getOperand(0), N0.getOperand(1),
9311 DAG.getConstantFP(-1.0, DL, VT), DAG.getConstantFP(0.0, DL, VT),
9313 return DAG.getNode(ISD::SELECT_CC, DL, VT, Ops);
9316 // fold (sint_to_fp (zext (setcc x, y, cc))) ->
9317 // (select_cc x, y, 1.0, 0.0,, cc)
9318 if (N0.getOpcode() == ISD::ZERO_EXTEND &&
9319 N0.getOperand(0).getOpcode() == ISD::SETCC &&!VT.isVector() &&
9320 (!LegalOperations ||
9321 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT))) {
9324 { N0.getOperand(0).getOperand(0), N0.getOperand(0).getOperand(1),
9325 DAG.getConstantFP(1.0, DL, VT), DAG.getConstantFP(0.0, DL, VT),
9326 N0.getOperand(0).getOperand(2) };
9327 return DAG.getNode(ISD::SELECT_CC, DL, VT, Ops);
9334 SDValue DAGCombiner::visitUINT_TO_FP(SDNode *N) {
9335 SDValue N0 = N->getOperand(0);
9336 EVT VT = N->getValueType(0);
9337 EVT OpVT = N0.getValueType();
9339 // fold (uint_to_fp c1) -> c1fp
9340 if (DAG.isConstantIntBuildVectorOrConstantInt(N0) &&
9341 // ...but only if the target supports immediate floating-point values
9342 (!LegalOperations ||
9343 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT)))
9344 return DAG.getNode(ISD::UINT_TO_FP, SDLoc(N), VT, N0);
9346 // If the input is a legal type, and UINT_TO_FP is not legal on this target,
9347 // but SINT_TO_FP is legal on this target, try to convert.
9348 if (!TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT) &&
9349 TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT)) {
9350 // If the sign bit is known to be zero, we can change this to SINT_TO_FP.
9351 if (DAG.SignBitIsZero(N0))
9352 return DAG.getNode(ISD::SINT_TO_FP, SDLoc(N), VT, N0);
9355 // The next optimizations are desirable only if SELECT_CC can be lowered.
9356 if (TLI.isOperationLegalOrCustom(ISD::SELECT_CC, VT) || !LegalOperations) {
9357 // fold (uint_to_fp (setcc x, y, cc)) -> (select_cc x, y, -1.0, 0.0,, cc)
9359 if (N0.getOpcode() == ISD::SETCC && !VT.isVector() &&
9360 (!LegalOperations ||
9361 TLI.isOperationLegalOrCustom(llvm::ISD::ConstantFP, VT))) {
9364 { N0.getOperand(0), N0.getOperand(1),
9365 DAG.getConstantFP(1.0, DL, VT), DAG.getConstantFP(0.0, DL, VT),
9367 return DAG.getNode(ISD::SELECT_CC, DL, VT, Ops);
9374 // Fold (fp_to_{s/u}int ({s/u}int_to_fpx)) -> zext x, sext x, trunc x, or x
9375 static SDValue FoldIntToFPToInt(SDNode *N, SelectionDAG &DAG) {
9376 SDValue N0 = N->getOperand(0);
9377 EVT VT = N->getValueType(0);
9379 if (N0.getOpcode() != ISD::UINT_TO_FP && N0.getOpcode() != ISD::SINT_TO_FP)
9382 SDValue Src = N0.getOperand(0);
9383 EVT SrcVT = Src.getValueType();
9384 bool IsInputSigned = N0.getOpcode() == ISD::SINT_TO_FP;
9385 bool IsOutputSigned = N->getOpcode() == ISD::FP_TO_SINT;
9387 // We can safely assume the conversion won't overflow the output range,
9388 // because (for example) (uint8_t)18293.f is undefined behavior.
9390 // Since we can assume the conversion won't overflow, our decision as to
9391 // whether the input will fit in the float should depend on the minimum
9392 // of the input range and output range.
9394 // This means this is also safe for a signed input and unsigned output, since
9395 // a negative input would lead to undefined behavior.
9396 unsigned InputSize = (int)SrcVT.getScalarSizeInBits() - IsInputSigned;
9397 unsigned OutputSize = (int)VT.getScalarSizeInBits() - IsOutputSigned;
9398 unsigned ActualSize = std::min(InputSize, OutputSize);
9399 const fltSemantics &sem = DAG.EVTToAPFloatSemantics(N0.getValueType());
9401 // We can only fold away the float conversion if the input range can be
9402 // represented exactly in the float range.
9403 if (APFloat::semanticsPrecision(sem) >= ActualSize) {
9404 if (VT.getScalarSizeInBits() > SrcVT.getScalarSizeInBits()) {
9405 unsigned ExtOp = IsInputSigned && IsOutputSigned ? ISD::SIGN_EXTEND
9407 return DAG.getNode(ExtOp, SDLoc(N), VT, Src);
9409 if (VT.getScalarSizeInBits() < SrcVT.getScalarSizeInBits())
9410 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), VT, Src);
9411 return DAG.getBitcast(VT, Src);
9416 SDValue DAGCombiner::visitFP_TO_SINT(SDNode *N) {
9417 SDValue N0 = N->getOperand(0);
9418 EVT VT = N->getValueType(0);
9420 // fold (fp_to_sint c1fp) -> c1
9421 if (isConstantFPBuildVectorOrConstantFP(N0))
9422 return DAG.getNode(ISD::FP_TO_SINT, SDLoc(N), VT, N0);
9424 return FoldIntToFPToInt(N, DAG);
9427 SDValue DAGCombiner::visitFP_TO_UINT(SDNode *N) {
9428 SDValue N0 = N->getOperand(0);
9429 EVT VT = N->getValueType(0);
9431 // fold (fp_to_uint c1fp) -> c1
9432 if (isConstantFPBuildVectorOrConstantFP(N0))
9433 return DAG.getNode(ISD::FP_TO_UINT, SDLoc(N), VT, N0);
9435 return FoldIntToFPToInt(N, DAG);
9438 SDValue DAGCombiner::visitFP_ROUND(SDNode *N) {
9439 SDValue N0 = N->getOperand(0);
9440 SDValue N1 = N->getOperand(1);
9441 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9442 EVT VT = N->getValueType(0);
9444 // fold (fp_round c1fp) -> c1fp
9446 return DAG.getNode(ISD::FP_ROUND, SDLoc(N), VT, N0, N1);
9448 // fold (fp_round (fp_extend x)) -> x
9449 if (N0.getOpcode() == ISD::FP_EXTEND && VT == N0.getOperand(0).getValueType())
9450 return N0.getOperand(0);
9452 // fold (fp_round (fp_round x)) -> (fp_round x)
9453 if (N0.getOpcode() == ISD::FP_ROUND) {
9454 const bool NIsTrunc = N->getConstantOperandVal(1) == 1;
9455 const bool N0IsTrunc = N0.getConstantOperandVal(1) == 1;
9457 // Skip this folding if it results in an fp_round from f80 to f16.
9459 // f80 to f16 always generates an expensive (and as yet, unimplemented)
9460 // libcall to __truncxfhf2 instead of selecting native f16 conversion
9461 // instructions from f32 or f64. Moreover, the first (value-preserving)
9462 // fp_round from f80 to either f32 or f64 may become a NOP in platforms like
9464 if (N0.getOperand(0).getValueType() == MVT::f80 && VT == MVT::f16)
9467 // If the first fp_round isn't a value preserving truncation, it might
9468 // introduce a tie in the second fp_round, that wouldn't occur in the
9469 // single-step fp_round we want to fold to.
9470 // In other words, double rounding isn't the same as rounding.
9471 // Also, this is a value preserving truncation iff both fp_round's are.
9472 if (DAG.getTarget().Options.UnsafeFPMath || N0IsTrunc) {
9474 return DAG.getNode(ISD::FP_ROUND, DL, VT, N0.getOperand(0),
9475 DAG.getIntPtrConstant(NIsTrunc && N0IsTrunc, DL));
9479 // fold (fp_round (copysign X, Y)) -> (copysign (fp_round X), Y)
9480 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse()) {
9481 SDValue Tmp = DAG.getNode(ISD::FP_ROUND, SDLoc(N0), VT,
9482 N0.getOperand(0), N1);
9483 AddToWorklist(Tmp.getNode());
9484 return DAG.getNode(ISD::FCOPYSIGN, SDLoc(N), VT,
9485 Tmp, N0.getOperand(1));
9491 SDValue DAGCombiner::visitFP_ROUND_INREG(SDNode *N) {
9492 SDValue N0 = N->getOperand(0);
9493 EVT VT = N->getValueType(0);
9494 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
9495 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0);
9497 // fold (fp_round_inreg c1fp) -> c1fp
9498 if (N0CFP && isTypeLegal(EVT)) {
9500 SDValue Round = DAG.getConstantFP(*N0CFP->getConstantFPValue(), DL, EVT);
9501 return DAG.getNode(ISD::FP_EXTEND, DL, VT, Round);
9507 SDValue DAGCombiner::visitFP_EXTEND(SDNode *N) {
9508 SDValue N0 = N->getOperand(0);
9509 EVT VT = N->getValueType(0);
9511 // If this is fp_round(fpextend), don't fold it, allow ourselves to be folded.
9512 if (N->hasOneUse() &&
9513 N->use_begin()->getOpcode() == ISD::FP_ROUND)
9516 // fold (fp_extend c1fp) -> c1fp
9517 if (isConstantFPBuildVectorOrConstantFP(N0))
9518 return DAG.getNode(ISD::FP_EXTEND, SDLoc(N), VT, N0);
9520 // fold (fp_extend (fp16_to_fp op)) -> (fp16_to_fp op)
9521 if (N0.getOpcode() == ISD::FP16_TO_FP &&
9522 TLI.getOperationAction(ISD::FP16_TO_FP, VT) == TargetLowering::Legal)
9523 return DAG.getNode(ISD::FP16_TO_FP, SDLoc(N), VT, N0.getOperand(0));
9525 // Turn fp_extend(fp_round(X, 1)) -> x since the fp_round doesn't affect the
9527 if (N0.getOpcode() == ISD::FP_ROUND
9528 && N0.getConstantOperandVal(1) == 1) {
9529 SDValue In = N0.getOperand(0);
9530 if (In.getValueType() == VT) return In;
9531 if (VT.bitsLT(In.getValueType()))
9532 return DAG.getNode(ISD::FP_ROUND, SDLoc(N), VT,
9533 In, N0.getOperand(1));
9534 return DAG.getNode(ISD::FP_EXTEND, SDLoc(N), VT, In);
9537 // fold (fpext (load x)) -> (fpext (fptrunc (extload x)))
9538 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() &&
9539 TLI.isLoadExtLegal(ISD::EXTLOAD, VT, N0.getValueType())) {
9540 LoadSDNode *LN0 = cast<LoadSDNode>(N0);
9541 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, SDLoc(N), VT,
9543 LN0->getBasePtr(), N0.getValueType(),
9544 LN0->getMemOperand());
9545 CombineTo(N, ExtLoad);
9546 CombineTo(N0.getNode(),
9547 DAG.getNode(ISD::FP_ROUND, SDLoc(N0),
9548 N0.getValueType(), ExtLoad,
9549 DAG.getIntPtrConstant(1, SDLoc(N0))),
9550 ExtLoad.getValue(1));
9551 return SDValue(N, 0); // Return N so it doesn't get rechecked!
9557 SDValue DAGCombiner::visitFCEIL(SDNode *N) {
9558 SDValue N0 = N->getOperand(0);
9559 EVT VT = N->getValueType(0);
9561 // fold (fceil c1) -> fceil(c1)
9562 if (isConstantFPBuildVectorOrConstantFP(N0))
9563 return DAG.getNode(ISD::FCEIL, SDLoc(N), VT, N0);
9568 SDValue DAGCombiner::visitFTRUNC(SDNode *N) {
9569 SDValue N0 = N->getOperand(0);
9570 EVT VT = N->getValueType(0);
9572 // fold (ftrunc c1) -> ftrunc(c1)
9573 if (isConstantFPBuildVectorOrConstantFP(N0))
9574 return DAG.getNode(ISD::FTRUNC, SDLoc(N), VT, N0);
9579 SDValue DAGCombiner::visitFFLOOR(SDNode *N) {
9580 SDValue N0 = N->getOperand(0);
9581 EVT VT = N->getValueType(0);
9583 // fold (ffloor c1) -> ffloor(c1)
9584 if (isConstantFPBuildVectorOrConstantFP(N0))
9585 return DAG.getNode(ISD::FFLOOR, SDLoc(N), VT, N0);
9590 // FIXME: FNEG and FABS have a lot in common; refactor.
9591 SDValue DAGCombiner::visitFNEG(SDNode *N) {
9592 SDValue N0 = N->getOperand(0);
9593 EVT VT = N->getValueType(0);
9595 // Constant fold FNEG.
9596 if (isConstantFPBuildVectorOrConstantFP(N0))
9597 return DAG.getNode(ISD::FNEG, SDLoc(N), VT, N0);
9599 if (isNegatibleForFree(N0, LegalOperations, DAG.getTargetLoweringInfo(),
9600 &DAG.getTarget().Options))
9601 return GetNegatedExpression(N0, DAG, LegalOperations);
9603 // Transform fneg(bitconvert(x)) -> bitconvert(x ^ sign) to avoid loading
9604 // constant pool values.
9605 if (!TLI.isFNegFree(VT) &&
9606 N0.getOpcode() == ISD::BITCAST &&
9607 N0.getNode()->hasOneUse()) {
9608 SDValue Int = N0.getOperand(0);
9609 EVT IntVT = Int.getValueType();
9610 if (IntVT.isInteger() && !IntVT.isVector()) {
9612 if (N0.getValueType().isVector()) {
9613 // For a vector, get a mask such as 0x80... per scalar element
9615 SignMask = APInt::getSignBit(N0.getScalarValueSizeInBits());
9616 SignMask = APInt::getSplat(IntVT.getSizeInBits(), SignMask);
9618 // For a scalar, just generate 0x80...
9619 SignMask = APInt::getSignBit(IntVT.getSizeInBits());
9622 Int = DAG.getNode(ISD::XOR, DL0, IntVT, Int,
9623 DAG.getConstant(SignMask, DL0, IntVT));
9624 AddToWorklist(Int.getNode());
9625 return DAG.getBitcast(VT, Int);
9629 // (fneg (fmul c, x)) -> (fmul -c, x)
9630 if (N0.getOpcode() == ISD::FMUL &&
9631 (N0.getNode()->hasOneUse() || !TLI.isFNegFree(VT))) {
9632 ConstantFPSDNode *CFP1 = dyn_cast<ConstantFPSDNode>(N0.getOperand(1));
9634 APFloat CVal = CFP1->getValueAPF();
9636 if (Level >= AfterLegalizeDAG &&
9637 (TLI.isFPImmLegal(CVal, VT) ||
9638 TLI.isOperationLegal(ISD::ConstantFP, VT)))
9639 return DAG.getNode(ISD::FMUL, SDLoc(N), VT, N0.getOperand(0),
9640 DAG.getNode(ISD::FNEG, SDLoc(N), VT,
9642 &cast<BinaryWithFlagsSDNode>(N0)->Flags);
9649 SDValue DAGCombiner::visitFMINNUM(SDNode *N) {
9650 SDValue N0 = N->getOperand(0);
9651 SDValue N1 = N->getOperand(1);
9652 EVT VT = N->getValueType(0);
9653 const ConstantFPSDNode *N0CFP = isConstOrConstSplatFP(N0);
9654 const ConstantFPSDNode *N1CFP = isConstOrConstSplatFP(N1);
9656 if (N0CFP && N1CFP) {
9657 const APFloat &C0 = N0CFP->getValueAPF();
9658 const APFloat &C1 = N1CFP->getValueAPF();
9659 return DAG.getConstantFP(minnum(C0, C1), SDLoc(N), VT);
9662 // Canonicalize to constant on RHS.
9663 if (isConstantFPBuildVectorOrConstantFP(N0) &&
9664 !isConstantFPBuildVectorOrConstantFP(N1))
9665 return DAG.getNode(ISD::FMINNUM, SDLoc(N), VT, N1, N0);
9670 SDValue DAGCombiner::visitFMAXNUM(SDNode *N) {
9671 SDValue N0 = N->getOperand(0);
9672 SDValue N1 = N->getOperand(1);
9673 EVT VT = N->getValueType(0);
9674 const ConstantFPSDNode *N0CFP = isConstOrConstSplatFP(N0);
9675 const ConstantFPSDNode *N1CFP = isConstOrConstSplatFP(N1);
9677 if (N0CFP && N1CFP) {
9678 const APFloat &C0 = N0CFP->getValueAPF();
9679 const APFloat &C1 = N1CFP->getValueAPF();
9680 return DAG.getConstantFP(maxnum(C0, C1), SDLoc(N), VT);
9683 // Canonicalize to constant on RHS.
9684 if (isConstantFPBuildVectorOrConstantFP(N0) &&
9685 !isConstantFPBuildVectorOrConstantFP(N1))
9686 return DAG.getNode(ISD::FMAXNUM, SDLoc(N), VT, N1, N0);
9691 SDValue DAGCombiner::visitFABS(SDNode *N) {
9692 SDValue N0 = N->getOperand(0);
9693 EVT VT = N->getValueType(0);
9695 // fold (fabs c1) -> fabs(c1)
9696 if (isConstantFPBuildVectorOrConstantFP(N0))
9697 return DAG.getNode(ISD::FABS, SDLoc(N), VT, N0);
9699 // fold (fabs (fabs x)) -> (fabs x)
9700 if (N0.getOpcode() == ISD::FABS)
9701 return N->getOperand(0);
9703 // fold (fabs (fneg x)) -> (fabs x)
9704 // fold (fabs (fcopysign x, y)) -> (fabs x)
9705 if (N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FCOPYSIGN)
9706 return DAG.getNode(ISD::FABS, SDLoc(N), VT, N0.getOperand(0));
9708 // Transform fabs(bitconvert(x)) -> bitconvert(x & ~sign) to avoid loading
9709 // constant pool values.
9710 if (!TLI.isFAbsFree(VT) &&
9711 N0.getOpcode() == ISD::BITCAST &&
9712 N0.getNode()->hasOneUse()) {
9713 SDValue Int = N0.getOperand(0);
9714 EVT IntVT = Int.getValueType();
9715 if (IntVT.isInteger() && !IntVT.isVector()) {
9717 if (N0.getValueType().isVector()) {
9718 // For a vector, get a mask such as 0x7f... per scalar element
9720 SignMask = ~APInt::getSignBit(N0.getScalarValueSizeInBits());
9721 SignMask = APInt::getSplat(IntVT.getSizeInBits(), SignMask);
9723 // For a scalar, just generate 0x7f...
9724 SignMask = ~APInt::getSignBit(IntVT.getSizeInBits());
9727 Int = DAG.getNode(ISD::AND, DL, IntVT, Int,
9728 DAG.getConstant(SignMask, DL, IntVT));
9729 AddToWorklist(Int.getNode());
9730 return DAG.getBitcast(N->getValueType(0), Int);
9737 SDValue DAGCombiner::visitBRCOND(SDNode *N) {
9738 SDValue Chain = N->getOperand(0);
9739 SDValue N1 = N->getOperand(1);
9740 SDValue N2 = N->getOperand(2);
9742 // If N is a constant we could fold this into a fallthrough or unconditional
9743 // branch. However that doesn't happen very often in normal code, because
9744 // Instcombine/SimplifyCFG should have handled the available opportunities.
9745 // If we did this folding here, it would be necessary to update the
9746 // MachineBasicBlock CFG, which is awkward.
9748 // fold a brcond with a setcc condition into a BR_CC node if BR_CC is legal
9750 if (N1.getOpcode() == ISD::SETCC &&
9751 TLI.isOperationLegalOrCustom(ISD::BR_CC,
9752 N1.getOperand(0).getValueType())) {
9753 return DAG.getNode(ISD::BR_CC, SDLoc(N), MVT::Other,
9754 Chain, N1.getOperand(2),
9755 N1.getOperand(0), N1.getOperand(1), N2);
9758 if ((N1.hasOneUse() && N1.getOpcode() == ISD::SRL) ||
9759 ((N1.getOpcode() == ISD::TRUNCATE && N1.hasOneUse()) &&
9760 (N1.getOperand(0).hasOneUse() &&
9761 N1.getOperand(0).getOpcode() == ISD::SRL))) {
9762 SDNode *Trunc = nullptr;
9763 if (N1.getOpcode() == ISD::TRUNCATE) {
9764 // Look pass the truncate.
9765 Trunc = N1.getNode();
9766 N1 = N1.getOperand(0);
9769 // Match this pattern so that we can generate simpler code:
9772 // %b = and i32 %a, 2
9773 // %c = srl i32 %b, 1
9774 // brcond i32 %c ...
9779 // %b = and i32 %a, 2
9780 // %c = setcc eq %b, 0
9783 // This applies only when the AND constant value has one bit set and the
9784 // SRL constant is equal to the log2 of the AND constant. The back-end is
9785 // smart enough to convert the result into a TEST/JMP sequence.
9786 SDValue Op0 = N1.getOperand(0);
9787 SDValue Op1 = N1.getOperand(1);
9789 if (Op0.getOpcode() == ISD::AND &&
9790 Op1.getOpcode() == ISD::Constant) {
9791 SDValue AndOp1 = Op0.getOperand(1);
9793 if (AndOp1.getOpcode() == ISD::Constant) {
9794 const APInt &AndConst = cast<ConstantSDNode>(AndOp1)->getAPIntValue();
9796 if (AndConst.isPowerOf2() &&
9797 cast<ConstantSDNode>(Op1)->getAPIntValue()==AndConst.logBase2()) {
9801 getSetCCResultType(Op0.getValueType()),
9802 Op0, DAG.getConstant(0, DL, Op0.getValueType()),
9805 SDValue NewBRCond = DAG.getNode(ISD::BRCOND, DL,
9806 MVT::Other, Chain, SetCC, N2);
9807 // Don't add the new BRCond into the worklist or else SimplifySelectCC
9808 // will convert it back to (X & C1) >> C2.
9809 CombineTo(N, NewBRCond, false);
9810 // Truncate is dead.
9812 deleteAndRecombine(Trunc);
9813 // Replace the uses of SRL with SETCC
9814 WorklistRemover DeadNodes(*this);
9815 DAG.ReplaceAllUsesOfValueWith(N1, SetCC);
9816 deleteAndRecombine(N1.getNode());
9817 return SDValue(N, 0); // Return N so it doesn't get rechecked!
9823 // Restore N1 if the above transformation doesn't match.
9824 N1 = N->getOperand(1);
9827 // Transform br(xor(x, y)) -> br(x != y)
9828 // Transform br(xor(xor(x,y), 1)) -> br (x == y)
9829 if (N1.hasOneUse() && N1.getOpcode() == ISD::XOR) {
9830 SDNode *TheXor = N1.getNode();
9831 SDValue Op0 = TheXor->getOperand(0);
9832 SDValue Op1 = TheXor->getOperand(1);
9833 if (Op0.getOpcode() == Op1.getOpcode()) {
9834 // Avoid missing important xor optimizations.
9835 if (SDValue Tmp = visitXOR(TheXor)) {
9836 if (Tmp.getNode() != TheXor) {
9837 DEBUG(dbgs() << "\nReplacing.8 ";
9839 dbgs() << "\nWith: ";
9840 Tmp.getNode()->dump(&DAG);
9842 WorklistRemover DeadNodes(*this);
9843 DAG.ReplaceAllUsesOfValueWith(N1, Tmp);
9844 deleteAndRecombine(TheXor);
9845 return DAG.getNode(ISD::BRCOND, SDLoc(N),
9846 MVT::Other, Chain, Tmp, N2);
9849 // visitXOR has changed XOR's operands or replaced the XOR completely,
9851 return SDValue(N, 0);
9855 if (Op0.getOpcode() != ISD::SETCC && Op1.getOpcode() != ISD::SETCC) {
9857 if (isOneConstant(Op0) && Op0.hasOneUse() &&
9858 Op0.getOpcode() == ISD::XOR) {
9859 TheXor = Op0.getNode();
9863 EVT SetCCVT = N1.getValueType();
9865 SetCCVT = getSetCCResultType(SetCCVT);
9866 SDValue SetCC = DAG.getSetCC(SDLoc(TheXor),
9869 Equal ? ISD::SETEQ : ISD::SETNE);
9870 // Replace the uses of XOR with SETCC
9871 WorklistRemover DeadNodes(*this);
9872 DAG.ReplaceAllUsesOfValueWith(N1, SetCC);
9873 deleteAndRecombine(N1.getNode());
9874 return DAG.getNode(ISD::BRCOND, SDLoc(N),
9875 MVT::Other, Chain, SetCC, N2);
9882 // Operand List for BR_CC: Chain, CondCC, CondLHS, CondRHS, DestBB.
9884 SDValue DAGCombiner::visitBR_CC(SDNode *N) {
9885 CondCodeSDNode *CC = cast<CondCodeSDNode>(N->getOperand(1));
9886 SDValue CondLHS = N->getOperand(2), CondRHS = N->getOperand(3);
9888 // If N is a constant we could fold this into a fallthrough or unconditional
9889 // branch. However that doesn't happen very often in normal code, because
9890 // Instcombine/SimplifyCFG should have handled the available opportunities.
9891 // If we did this folding here, it would be necessary to update the
9892 // MachineBasicBlock CFG, which is awkward.
9894 // Use SimplifySetCC to simplify SETCC's.
9895 SDValue Simp = SimplifySetCC(getSetCCResultType(CondLHS.getValueType()),
9896 CondLHS, CondRHS, CC->get(), SDLoc(N),
9898 if (Simp.getNode()) AddToWorklist(Simp.getNode());
9900 // fold to a simpler setcc
9901 if (Simp.getNode() && Simp.getOpcode() == ISD::SETCC)
9902 return DAG.getNode(ISD::BR_CC, SDLoc(N), MVT::Other,
9903 N->getOperand(0), Simp.getOperand(2),
9904 Simp.getOperand(0), Simp.getOperand(1),
9910 /// Return true if 'Use' is a load or a store that uses N as its base pointer
9911 /// and that N may be folded in the load / store addressing mode.
9912 static bool canFoldInAddressingMode(SDNode *N, SDNode *Use,
9914 const TargetLowering &TLI) {
9918 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(Use)) {
9919 if (LD->isIndexed() || LD->getBasePtr().getNode() != N)
9921 VT = LD->getMemoryVT();
9922 AS = LD->getAddressSpace();
9923 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(Use)) {
9924 if (ST->isIndexed() || ST->getBasePtr().getNode() != N)
9926 VT = ST->getMemoryVT();
9927 AS = ST->getAddressSpace();
9931 TargetLowering::AddrMode AM;
9932 if (N->getOpcode() == ISD::ADD) {
9933 ConstantSDNode *Offset = dyn_cast<ConstantSDNode>(N->getOperand(1));
9936 AM.BaseOffs = Offset->getSExtValue();
9940 } else if (N->getOpcode() == ISD::SUB) {
9941 ConstantSDNode *Offset = dyn_cast<ConstantSDNode>(N->getOperand(1));
9944 AM.BaseOffs = -Offset->getSExtValue();
9951 return TLI.isLegalAddressingMode(DAG.getDataLayout(), AM,
9952 VT.getTypeForEVT(*DAG.getContext()), AS);
9955 /// Try turning a load/store into a pre-indexed load/store when the base
9956 /// pointer is an add or subtract and it has other uses besides the load/store.
9957 /// After the transformation, the new indexed load/store has effectively folded
9958 /// the add/subtract in and all of its other uses are redirected to the
9960 bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) {
9961 if (Level < AfterLegalizeDAG)
9967 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
9968 if (LD->isIndexed())
9970 VT = LD->getMemoryVT();
9971 if (!TLI.isIndexedLoadLegal(ISD::PRE_INC, VT) &&
9972 !TLI.isIndexedLoadLegal(ISD::PRE_DEC, VT))
9974 Ptr = LD->getBasePtr();
9975 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
9976 if (ST->isIndexed())
9978 VT = ST->getMemoryVT();
9979 if (!TLI.isIndexedStoreLegal(ISD::PRE_INC, VT) &&
9980 !TLI.isIndexedStoreLegal(ISD::PRE_DEC, VT))
9982 Ptr = ST->getBasePtr();
9988 // If the pointer is not an add/sub, or if it doesn't have multiple uses, bail
9989 // out. There is no reason to make this a preinc/predec.
9990 if ((Ptr.getOpcode() != ISD::ADD && Ptr.getOpcode() != ISD::SUB) ||
9991 Ptr.getNode()->hasOneUse())
9994 // Ask the target to do addressing mode selection.
9997 ISD::MemIndexedMode AM = ISD::UNINDEXED;
9998 if (!TLI.getPreIndexedAddressParts(N, BasePtr, Offset, AM, DAG))
10001 // Backends without true r+i pre-indexed forms may need to pass a
10002 // constant base with a variable offset so that constant coercion
10003 // will work with the patterns in canonical form.
10004 bool Swapped = false;
10005 if (isa<ConstantSDNode>(BasePtr)) {
10006 std::swap(BasePtr, Offset);
10010 // Don't create a indexed load / store with zero offset.
10011 if (isNullConstant(Offset))
10014 // Try turning it into a pre-indexed load / store except when:
10015 // 1) The new base ptr is a frame index.
10016 // 2) If N is a store and the new base ptr is either the same as or is a
10017 // predecessor of the value being stored.
10018 // 3) Another use of old base ptr is a predecessor of N. If ptr is folded
10019 // that would create a cycle.
10020 // 4) All uses are load / store ops that use it as old base ptr.
10022 // Check #1. Preinc'ing a frame index would require copying the stack pointer
10023 // (plus the implicit offset) to a register to preinc anyway.
10024 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr))
10029 SDValue Val = cast<StoreSDNode>(N)->getValue();
10030 if (Val == BasePtr || BasePtr.getNode()->isPredecessorOf(Val.getNode()))
10034 // Caches for hasPredecessorHelper.
10035 SmallPtrSet<const SDNode *, 32> Visited;
10036 SmallVector<const SDNode *, 16> Worklist;
10037 Worklist.push_back(N);
10039 // If the offset is a constant, there may be other adds of constants that
10040 // can be folded with this one. We should do this to avoid having to keep
10041 // a copy of the original base pointer.
10042 SmallVector<SDNode *, 16> OtherUses;
10043 if (isa<ConstantSDNode>(Offset))
10044 for (SDNode::use_iterator UI = BasePtr.getNode()->use_begin(),
10045 UE = BasePtr.getNode()->use_end();
10047 SDUse &Use = UI.getUse();
10048 // Skip the use that is Ptr and uses of other results from BasePtr's
10049 // node (important for nodes that return multiple results).
10050 if (Use.getUser() == Ptr.getNode() || Use != BasePtr)
10053 if (SDNode::hasPredecessorHelper(Use.getUser(), Visited, Worklist))
10056 if (Use.getUser()->getOpcode() != ISD::ADD &&
10057 Use.getUser()->getOpcode() != ISD::SUB) {
10062 SDValue Op1 = Use.getUser()->getOperand((UI.getOperandNo() + 1) & 1);
10063 if (!isa<ConstantSDNode>(Op1)) {
10068 // FIXME: In some cases, we can be smarter about this.
10069 if (Op1.getValueType() != Offset.getValueType()) {
10074 OtherUses.push_back(Use.getUser());
10078 std::swap(BasePtr, Offset);
10080 // Now check for #3 and #4.
10081 bool RealUse = false;
10083 for (SDNode *Use : Ptr.getNode()->uses()) {
10086 if (SDNode::hasPredecessorHelper(Use, Visited, Worklist))
10089 // If Ptr may be folded in addressing mode of other use, then it's
10090 // not profitable to do this transformation.
10091 if (!canFoldInAddressingMode(Ptr.getNode(), Use, DAG, TLI))
10100 Result = DAG.getIndexedLoad(SDValue(N,0), SDLoc(N),
10101 BasePtr, Offset, AM);
10103 Result = DAG.getIndexedStore(SDValue(N,0), SDLoc(N),
10104 BasePtr, Offset, AM);
10107 DEBUG(dbgs() << "\nReplacing.4 ";
10109 dbgs() << "\nWith: ";
10110 Result.getNode()->dump(&DAG);
10112 WorklistRemover DeadNodes(*this);
10114 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0));
10115 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2));
10117 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1));
10120 // Finally, since the node is now dead, remove it from the graph.
10121 deleteAndRecombine(N);
10124 std::swap(BasePtr, Offset);
10126 // Replace other uses of BasePtr that can be updated to use Ptr
10127 for (unsigned i = 0, e = OtherUses.size(); i != e; ++i) {
10128 unsigned OffsetIdx = 1;
10129 if (OtherUses[i]->getOperand(OffsetIdx).getNode() == BasePtr.getNode())
10131 assert(OtherUses[i]->getOperand(!OffsetIdx).getNode() ==
10132 BasePtr.getNode() && "Expected BasePtr operand");
10134 // We need to replace ptr0 in the following expression:
10135 // x0 * offset0 + y0 * ptr0 = t0
10137 // x1 * offset1 + y1 * ptr0 = t1 (the indexed load/store)
10139 // where x0, x1, y0 and y1 in {-1, 1} are given by the types of the
10140 // indexed load/store and the expresion that needs to be re-written.
10142 // Therefore, we have:
10143 // t0 = (x0 * offset0 - x1 * y0 * y1 *offset1) + (y0 * y1) * t1
10145 ConstantSDNode *CN =
10146 cast<ConstantSDNode>(OtherUses[i]->getOperand(OffsetIdx));
10147 int X0, X1, Y0, Y1;
10148 const APInt &Offset0 = CN->getAPIntValue();
10149 APInt Offset1 = cast<ConstantSDNode>(Offset)->getAPIntValue();
10151 X0 = (OtherUses[i]->getOpcode() == ISD::SUB && OffsetIdx == 1) ? -1 : 1;
10152 Y0 = (OtherUses[i]->getOpcode() == ISD::SUB && OffsetIdx == 0) ? -1 : 1;
10153 X1 = (AM == ISD::PRE_DEC && !Swapped) ? -1 : 1;
10154 Y1 = (AM == ISD::PRE_DEC && Swapped) ? -1 : 1;
10156 unsigned Opcode = (Y0 * Y1 < 0) ? ISD::SUB : ISD::ADD;
10158 APInt CNV = Offset0;
10159 if (X0 < 0) CNV = -CNV;
10160 if (X1 * Y0 * Y1 < 0) CNV = CNV + Offset1;
10161 else CNV = CNV - Offset1;
10163 SDLoc DL(OtherUses[i]);
10165 // We can now generate the new expression.
10166 SDValue NewOp1 = DAG.getConstant(CNV, DL, CN->getValueType(0));
10167 SDValue NewOp2 = Result.getValue(isLoad ? 1 : 0);
10169 SDValue NewUse = DAG.getNode(Opcode,
10171 OtherUses[i]->getValueType(0), NewOp1, NewOp2);
10172 DAG.ReplaceAllUsesOfValueWith(SDValue(OtherUses[i], 0), NewUse);
10173 deleteAndRecombine(OtherUses[i]);
10176 // Replace the uses of Ptr with uses of the updated base value.
10177 DAG.ReplaceAllUsesOfValueWith(Ptr, Result.getValue(isLoad ? 1 : 0));
10178 deleteAndRecombine(Ptr.getNode());
10183 /// Try to combine a load/store with a add/sub of the base pointer node into a
10184 /// post-indexed load/store. The transformation folded the add/subtract into the
10185 /// new indexed load/store effectively and all of its uses are redirected to the
10186 /// new load/store.
10187 bool DAGCombiner::CombineToPostIndexedLoadStore(SDNode *N) {
10188 if (Level < AfterLegalizeDAG)
10191 bool isLoad = true;
10194 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
10195 if (LD->isIndexed())
10197 VT = LD->getMemoryVT();
10198 if (!TLI.isIndexedLoadLegal(ISD::POST_INC, VT) &&
10199 !TLI.isIndexedLoadLegal(ISD::POST_DEC, VT))
10201 Ptr = LD->getBasePtr();
10202 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
10203 if (ST->isIndexed())
10205 VT = ST->getMemoryVT();
10206 if (!TLI.isIndexedStoreLegal(ISD::POST_INC, VT) &&
10207 !TLI.isIndexedStoreLegal(ISD::POST_DEC, VT))
10209 Ptr = ST->getBasePtr();
10215 if (Ptr.getNode()->hasOneUse())
10218 for (SDNode *Op : Ptr.getNode()->uses()) {
10220 (Op->getOpcode() != ISD::ADD && Op->getOpcode() != ISD::SUB))
10225 ISD::MemIndexedMode AM = ISD::UNINDEXED;
10226 if (TLI.getPostIndexedAddressParts(N, Op, BasePtr, Offset, AM, DAG)) {
10227 // Don't create a indexed load / store with zero offset.
10228 if (isNullConstant(Offset))
10231 // Try turning it into a post-indexed load / store except when
10232 // 1) All uses are load / store ops that use it as base ptr (and
10233 // it may be folded as addressing mmode).
10234 // 2) Op must be independent of N, i.e. Op is neither a predecessor
10235 // nor a successor of N. Otherwise, if Op is folded that would
10238 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr))
10242 bool TryNext = false;
10243 for (SDNode *Use : BasePtr.getNode()->uses()) {
10244 if (Use == Ptr.getNode())
10247 // If all the uses are load / store addresses, then don't do the
10249 if (Use->getOpcode() == ISD::ADD || Use->getOpcode() == ISD::SUB){
10250 bool RealUse = false;
10251 for (SDNode *UseUse : Use->uses()) {
10252 if (!canFoldInAddressingMode(Use, UseUse, DAG, TLI))
10267 if (!Op->isPredecessorOf(N) && !N->isPredecessorOf(Op)) {
10268 SDValue Result = isLoad
10269 ? DAG.getIndexedLoad(SDValue(N,0), SDLoc(N),
10270 BasePtr, Offset, AM)
10271 : DAG.getIndexedStore(SDValue(N,0), SDLoc(N),
10272 BasePtr, Offset, AM);
10273 ++PostIndexedNodes;
10275 DEBUG(dbgs() << "\nReplacing.5 ";
10277 dbgs() << "\nWith: ";
10278 Result.getNode()->dump(&DAG);
10280 WorklistRemover DeadNodes(*this);
10282 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0));
10283 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2));
10285 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1));
10288 // Finally, since the node is now dead, remove it from the graph.
10289 deleteAndRecombine(N);
10291 // Replace the uses of Use with uses of the updated base value.
10292 DAG.ReplaceAllUsesOfValueWith(SDValue(Op, 0),
10293 Result.getValue(isLoad ? 1 : 0));
10294 deleteAndRecombine(Op);
10303 /// \brief Return the base-pointer arithmetic from an indexed \p LD.
10304 SDValue DAGCombiner::SplitIndexingFromLoad(LoadSDNode *LD) {
10305 ISD::MemIndexedMode AM = LD->getAddressingMode();
10306 assert(AM != ISD::UNINDEXED);
10307 SDValue BP = LD->getOperand(1);
10308 SDValue Inc = LD->getOperand(2);
10310 // Some backends use TargetConstants for load offsets, but don't expect
10311 // TargetConstants in general ADD nodes. We can convert these constants into
10312 // regular Constants (if the constant is not opaque).
10313 assert((Inc.getOpcode() != ISD::TargetConstant ||
10314 !cast<ConstantSDNode>(Inc)->isOpaque()) &&
10315 "Cannot split out indexing using opaque target constants");
10316 if (Inc.getOpcode() == ISD::TargetConstant) {
10317 ConstantSDNode *ConstInc = cast<ConstantSDNode>(Inc);
10318 Inc = DAG.getConstant(*ConstInc->getConstantIntValue(), SDLoc(Inc),
10319 ConstInc->getValueType(0));
10323 (AM == ISD::PRE_INC || AM == ISD::POST_INC ? ISD::ADD : ISD::SUB);
10324 return DAG.getNode(Opc, SDLoc(LD), BP.getSimpleValueType(), BP, Inc);
10327 SDValue DAGCombiner::visitLOAD(SDNode *N) {
10328 LoadSDNode *LD = cast<LoadSDNode>(N);
10329 SDValue Chain = LD->getChain();
10330 SDValue Ptr = LD->getBasePtr();
10332 // If load is not volatile and there are no uses of the loaded value (and
10333 // the updated indexed value in case of indexed loads), change uses of the
10334 // chain value into uses of the chain input (i.e. delete the dead load).
10335 if (!LD->isVolatile()) {
10336 if (N->getValueType(1) == MVT::Other) {
10337 // Unindexed loads.
10338 if (!N->hasAnyUseOfValue(0)) {
10339 // It's not safe to use the two value CombineTo variant here. e.g.
10340 // v1, chain2 = load chain1, loc
10341 // v2, chain3 = load chain2, loc
10343 // Now we replace use of chain2 with chain1. This makes the second load
10344 // isomorphic to the one we are deleting, and thus makes this load live.
10345 DEBUG(dbgs() << "\nReplacing.6 ";
10347 dbgs() << "\nWith chain: ";
10348 Chain.getNode()->dump(&DAG);
10350 WorklistRemover DeadNodes(*this);
10351 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain);
10353 if (N->use_empty())
10354 deleteAndRecombine(N);
10356 return SDValue(N, 0); // Return N so it doesn't get rechecked!
10360 assert(N->getValueType(2) == MVT::Other && "Malformed indexed loads?");
10362 // If this load has an opaque TargetConstant offset, then we cannot split
10363 // the indexing into an add/sub directly (that TargetConstant may not be
10364 // valid for a different type of node, and we cannot convert an opaque
10365 // target constant into a regular constant).
10366 bool HasOTCInc = LD->getOperand(2).getOpcode() == ISD::TargetConstant &&
10367 cast<ConstantSDNode>(LD->getOperand(2))->isOpaque();
10369 if (!N->hasAnyUseOfValue(0) &&
10370 ((MaySplitLoadIndex && !HasOTCInc) || !N->hasAnyUseOfValue(1))) {
10371 SDValue Undef = DAG.getUNDEF(N->getValueType(0));
10373 if (N->hasAnyUseOfValue(1) && MaySplitLoadIndex && !HasOTCInc) {
10374 Index = SplitIndexingFromLoad(LD);
10375 // Try to fold the base pointer arithmetic into subsequent loads and
10377 AddUsersToWorklist(N);
10379 Index = DAG.getUNDEF(N->getValueType(1));
10380 DEBUG(dbgs() << "\nReplacing.7 ";
10382 dbgs() << "\nWith: ";
10383 Undef.getNode()->dump(&DAG);
10384 dbgs() << " and 2 other values\n");
10385 WorklistRemover DeadNodes(*this);
10386 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Undef);
10387 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Index);
10388 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 2), Chain);
10389 deleteAndRecombine(N);
10390 return SDValue(N, 0); // Return N so it doesn't get rechecked!
10395 // If this load is directly stored, replace the load value with the stored
10397 // TODO: Handle store large -> read small portion.
10398 // TODO: Handle TRUNCSTORE/LOADEXT
10399 if (OptLevel != CodeGenOpt::None &&
10400 ISD::isNormalLoad(N) && !LD->isVolatile()) {
10401 if (ISD::isNON_TRUNCStore(Chain.getNode())) {
10402 StoreSDNode *PrevST = cast<StoreSDNode>(Chain);
10403 if (PrevST->getBasePtr() == Ptr &&
10404 PrevST->getValue().getValueType() == N->getValueType(0))
10405 return CombineTo(N, Chain.getOperand(1), Chain);
10409 // Try to infer better alignment information than the load already has.
10410 if (OptLevel != CodeGenOpt::None && LD->isUnindexed()) {
10411 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) {
10412 if (Align > LD->getMemOperand()->getBaseAlignment()) {
10413 SDValue NewLoad = DAG.getExtLoad(
10414 LD->getExtensionType(), SDLoc(N), LD->getValueType(0), Chain, Ptr,
10415 LD->getPointerInfo(), LD->getMemoryVT(), Align,
10416 LD->getMemOperand()->getFlags(), LD->getAAInfo());
10417 if (NewLoad.getNode() != N)
10418 return CombineTo(N, NewLoad, SDValue(NewLoad.getNode(), 1), true);
10423 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
10424 : DAG.getSubtarget().useAA();
10426 if (CombinerAAOnlyFunc.getNumOccurrences() &&
10427 CombinerAAOnlyFunc != DAG.getMachineFunction().getName())
10430 if (UseAA && LD->isUnindexed()) {
10431 // Walk up chain skipping non-aliasing memory nodes.
10432 SDValue BetterChain = FindBetterChain(N, Chain);
10434 // If there is a better chain.
10435 if (Chain != BetterChain) {
10438 // Replace the chain to void dependency.
10439 if (LD->getExtensionType() == ISD::NON_EXTLOAD) {
10440 ReplLoad = DAG.getLoad(N->getValueType(0), SDLoc(LD),
10441 BetterChain, Ptr, LD->getMemOperand());
10443 ReplLoad = DAG.getExtLoad(LD->getExtensionType(), SDLoc(LD),
10444 LD->getValueType(0),
10445 BetterChain, Ptr, LD->getMemoryVT(),
10446 LD->getMemOperand());
10449 // Create token factor to keep old chain connected.
10450 SDValue Token = DAG.getNode(ISD::TokenFactor, SDLoc(N),
10451 MVT::Other, Chain, ReplLoad.getValue(1));
10453 // Make sure the new and old chains are cleaned up.
10454 AddToWorklist(Token.getNode());
10456 // Replace uses with load result and token factor. Don't add users
10458 return CombineTo(N, ReplLoad.getValue(0), Token, false);
10462 // Try transforming N to an indexed load.
10463 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
10464 return SDValue(N, 0);
10466 // Try to slice up N to more direct loads if the slices are mapped to
10467 // different register banks or pairing can take place.
10468 if (SliceUpLoad(N))
10469 return SDValue(N, 0);
10475 /// \brief Helper structure used to slice a load in smaller loads.
10476 /// Basically a slice is obtained from the following sequence:
10477 /// Origin = load Ty1, Base
10478 /// Shift = srl Ty1 Origin, CstTy Amount
10479 /// Inst = trunc Shift to Ty2
10481 /// Then, it will be rewriten into:
10482 /// Slice = load SliceTy, Base + SliceOffset
10483 /// [Inst = zext Slice to Ty2], only if SliceTy <> Ty2
10485 /// SliceTy is deduced from the number of bits that are actually used to
10487 struct LoadedSlice {
10488 /// \brief Helper structure used to compute the cost of a slice.
10490 /// Are we optimizing for code size.
10494 unsigned Truncates;
10495 unsigned CrossRegisterBanksCopies;
10499 Cost(bool ForCodeSize = false)
10500 : ForCodeSize(ForCodeSize), Loads(0), Truncates(0),
10501 CrossRegisterBanksCopies(0), ZExts(0), Shift(0) {}
10503 /// \brief Get the cost of one isolated slice.
10504 Cost(const LoadedSlice &LS, bool ForCodeSize = false)
10505 : ForCodeSize(ForCodeSize), Loads(1), Truncates(0),
10506 CrossRegisterBanksCopies(0), ZExts(0), Shift(0) {
10507 EVT TruncType = LS.Inst->getValueType(0);
10508 EVT LoadedType = LS.getLoadedType();
10509 if (TruncType != LoadedType &&
10510 !LS.DAG->getTargetLoweringInfo().isZExtFree(LoadedType, TruncType))
10514 /// \brief Account for slicing gain in the current cost.
10515 /// Slicing provide a few gains like removing a shift or a
10516 /// truncate. This method allows to grow the cost of the original
10517 /// load with the gain from this slice.
10518 void addSliceGain(const LoadedSlice &LS) {
10519 // Each slice saves a truncate.
10520 const TargetLowering &TLI = LS.DAG->getTargetLoweringInfo();
10521 if (!TLI.isTruncateFree(LS.Inst->getOperand(0).getValueType(),
10522 LS.Inst->getValueType(0)))
10524 // If there is a shift amount, this slice gets rid of it.
10527 // If this slice can merge a cross register bank copy, account for it.
10528 if (LS.canMergeExpensiveCrossRegisterBankCopy())
10529 ++CrossRegisterBanksCopies;
10532 Cost &operator+=(const Cost &RHS) {
10533 Loads += RHS.Loads;
10534 Truncates += RHS.Truncates;
10535 CrossRegisterBanksCopies += RHS.CrossRegisterBanksCopies;
10536 ZExts += RHS.ZExts;
10537 Shift += RHS.Shift;
10541 bool operator==(const Cost &RHS) const {
10542 return Loads == RHS.Loads && Truncates == RHS.Truncates &&
10543 CrossRegisterBanksCopies == RHS.CrossRegisterBanksCopies &&
10544 ZExts == RHS.ZExts && Shift == RHS.Shift;
10547 bool operator!=(const Cost &RHS) const { return !(*this == RHS); }
10549 bool operator<(const Cost &RHS) const {
10550 // Assume cross register banks copies are as expensive as loads.
10551 // FIXME: Do we want some more target hooks?
10552 unsigned ExpensiveOpsLHS = Loads + CrossRegisterBanksCopies;
10553 unsigned ExpensiveOpsRHS = RHS.Loads + RHS.CrossRegisterBanksCopies;
10554 // Unless we are optimizing for code size, consider the
10555 // expensive operation first.
10556 if (!ForCodeSize && ExpensiveOpsLHS != ExpensiveOpsRHS)
10557 return ExpensiveOpsLHS < ExpensiveOpsRHS;
10558 return (Truncates + ZExts + Shift + ExpensiveOpsLHS) <
10559 (RHS.Truncates + RHS.ZExts + RHS.Shift + ExpensiveOpsRHS);
10562 bool operator>(const Cost &RHS) const { return RHS < *this; }
10564 bool operator<=(const Cost &RHS) const { return !(RHS < *this); }
10566 bool operator>=(const Cost &RHS) const { return !(*this < RHS); }
10568 // The last instruction that represent the slice. This should be a
10569 // truncate instruction.
10571 // The original load instruction.
10572 LoadSDNode *Origin;
10573 // The right shift amount in bits from the original load.
10575 // The DAG from which Origin came from.
10576 // This is used to get some contextual information about legal types, etc.
10579 LoadedSlice(SDNode *Inst = nullptr, LoadSDNode *Origin = nullptr,
10580 unsigned Shift = 0, SelectionDAG *DAG = nullptr)
10581 : Inst(Inst), Origin(Origin), Shift(Shift), DAG(DAG) {}
10583 /// \brief Get the bits used in a chunk of bits \p BitWidth large.
10584 /// \return Result is \p BitWidth and has used bits set to 1 and
10585 /// not used bits set to 0.
10586 APInt getUsedBits() const {
10587 // Reproduce the trunc(lshr) sequence:
10588 // - Start from the truncated value.
10589 // - Zero extend to the desired bit width.
10591 assert(Origin && "No original load to compare against.");
10592 unsigned BitWidth = Origin->getValueSizeInBits(0);
10593 assert(Inst && "This slice is not bound to an instruction");
10594 assert(Inst->getValueSizeInBits(0) <= BitWidth &&
10595 "Extracted slice is bigger than the whole type!");
10596 APInt UsedBits(Inst->getValueSizeInBits(0), 0);
10597 UsedBits.setAllBits();
10598 UsedBits = UsedBits.zext(BitWidth);
10599 UsedBits <<= Shift;
10603 /// \brief Get the size of the slice to be loaded in bytes.
10604 unsigned getLoadedSize() const {
10605 unsigned SliceSize = getUsedBits().countPopulation();
10606 assert(!(SliceSize & 0x7) && "Size is not a multiple of a byte.");
10607 return SliceSize / 8;
10610 /// \brief Get the type that will be loaded for this slice.
10611 /// Note: This may not be the final type for the slice.
10612 EVT getLoadedType() const {
10613 assert(DAG && "Missing context");
10614 LLVMContext &Ctxt = *DAG->getContext();
10615 return EVT::getIntegerVT(Ctxt, getLoadedSize() * 8);
10618 /// \brief Get the alignment of the load used for this slice.
10619 unsigned getAlignment() const {
10620 unsigned Alignment = Origin->getAlignment();
10621 unsigned Offset = getOffsetFromBase();
10623 Alignment = MinAlign(Alignment, Alignment + Offset);
10627 /// \brief Check if this slice can be rewritten with legal operations.
10628 bool isLegal() const {
10629 // An invalid slice is not legal.
10630 if (!Origin || !Inst || !DAG)
10633 // Offsets are for indexed load only, we do not handle that.
10634 if (!Origin->getOffset().isUndef())
10637 const TargetLowering &TLI = DAG->getTargetLoweringInfo();
10639 // Check that the type is legal.
10640 EVT SliceType = getLoadedType();
10641 if (!TLI.isTypeLegal(SliceType))
10644 // Check that the load is legal for this type.
10645 if (!TLI.isOperationLegal(ISD::LOAD, SliceType))
10648 // Check that the offset can be computed.
10649 // 1. Check its type.
10650 EVT PtrType = Origin->getBasePtr().getValueType();
10651 if (PtrType == MVT::Untyped || PtrType.isExtended())
10654 // 2. Check that it fits in the immediate.
10655 if (!TLI.isLegalAddImmediate(getOffsetFromBase()))
10658 // 3. Check that the computation is legal.
10659 if (!TLI.isOperationLegal(ISD::ADD, PtrType))
10662 // Check that the zext is legal if it needs one.
10663 EVT TruncateType = Inst->getValueType(0);
10664 if (TruncateType != SliceType &&
10665 !TLI.isOperationLegal(ISD::ZERO_EXTEND, TruncateType))
10671 /// \brief Get the offset in bytes of this slice in the original chunk of
10673 /// \pre DAG != nullptr.
10674 uint64_t getOffsetFromBase() const {
10675 assert(DAG && "Missing context.");
10676 bool IsBigEndian = DAG->getDataLayout().isBigEndian();
10677 assert(!(Shift & 0x7) && "Shifts not aligned on Bytes are not supported.");
10678 uint64_t Offset = Shift / 8;
10679 unsigned TySizeInBytes = Origin->getValueSizeInBits(0) / 8;
10680 assert(!(Origin->getValueSizeInBits(0) & 0x7) &&
10681 "The size of the original loaded type is not a multiple of a"
10683 // If Offset is bigger than TySizeInBytes, it means we are loading all
10684 // zeros. This should have been optimized before in the process.
10685 assert(TySizeInBytes > Offset &&
10686 "Invalid shift amount for given loaded size");
10688 Offset = TySizeInBytes - Offset - getLoadedSize();
10692 /// \brief Generate the sequence of instructions to load the slice
10693 /// represented by this object and redirect the uses of this slice to
10694 /// this new sequence of instructions.
10695 /// \pre this->Inst && this->Origin are valid Instructions and this
10696 /// object passed the legal check: LoadedSlice::isLegal returned true.
10697 /// \return The last instruction of the sequence used to load the slice.
10698 SDValue loadSlice() const {
10699 assert(Inst && Origin && "Unable to replace a non-existing slice.");
10700 const SDValue &OldBaseAddr = Origin->getBasePtr();
10701 SDValue BaseAddr = OldBaseAddr;
10702 // Get the offset in that chunk of bytes w.r.t. the endianness.
10703 int64_t Offset = static_cast<int64_t>(getOffsetFromBase());
10704 assert(Offset >= 0 && "Offset too big to fit in int64_t!");
10706 // BaseAddr = BaseAddr + Offset.
10707 EVT ArithType = BaseAddr.getValueType();
10709 BaseAddr = DAG->getNode(ISD::ADD, DL, ArithType, BaseAddr,
10710 DAG->getConstant(Offset, DL, ArithType));
10713 // Create the type of the loaded slice according to its size.
10714 EVT SliceType = getLoadedType();
10716 // Create the load for the slice.
10718 DAG->getLoad(SliceType, SDLoc(Origin), Origin->getChain(), BaseAddr,
10719 Origin->getPointerInfo().getWithOffset(Offset),
10720 getAlignment(), Origin->getMemOperand()->getFlags());
10721 // If the final type is not the same as the loaded type, this means that
10722 // we have to pad with zero. Create a zero extend for that.
10723 EVT FinalType = Inst->getValueType(0);
10724 if (SliceType != FinalType)
10726 DAG->getNode(ISD::ZERO_EXTEND, SDLoc(LastInst), FinalType, LastInst);
10730 /// \brief Check if this slice can be merged with an expensive cross register
10731 /// bank copy. E.g.,
10733 /// f = bitcast i32 i to float
10734 bool canMergeExpensiveCrossRegisterBankCopy() const {
10735 if (!Inst || !Inst->hasOneUse())
10737 SDNode *Use = *Inst->use_begin();
10738 if (Use->getOpcode() != ISD::BITCAST)
10740 assert(DAG && "Missing context");
10741 const TargetLowering &TLI = DAG->getTargetLoweringInfo();
10742 EVT ResVT = Use->getValueType(0);
10743 const TargetRegisterClass *ResRC = TLI.getRegClassFor(ResVT.getSimpleVT());
10744 const TargetRegisterClass *ArgRC =
10745 TLI.getRegClassFor(Use->getOperand(0).getValueType().getSimpleVT());
10746 if (ArgRC == ResRC || !TLI.isOperationLegal(ISD::LOAD, ResVT))
10749 // At this point, we know that we perform a cross-register-bank copy.
10750 // Check if it is expensive.
10751 const TargetRegisterInfo *TRI = DAG->getSubtarget().getRegisterInfo();
10752 // Assume bitcasts are cheap, unless both register classes do not
10753 // explicitly share a common sub class.
10754 if (!TRI || TRI->getCommonSubClass(ArgRC, ResRC))
10757 // Check if it will be merged with the load.
10758 // 1. Check the alignment constraint.
10759 unsigned RequiredAlignment = DAG->getDataLayout().getABITypeAlignment(
10760 ResVT.getTypeForEVT(*DAG->getContext()));
10762 if (RequiredAlignment > getAlignment())
10765 // 2. Check that the load is a legal operation for that type.
10766 if (!TLI.isOperationLegal(ISD::LOAD, ResVT))
10769 // 3. Check that we do not have a zext in the way.
10770 if (Inst->getValueType(0) != getLoadedType())
10778 /// \brief Check that all bits set in \p UsedBits form a dense region, i.e.,
10779 /// \p UsedBits looks like 0..0 1..1 0..0.
10780 static bool areUsedBitsDense(const APInt &UsedBits) {
10781 // If all the bits are one, this is dense!
10782 if (UsedBits.isAllOnesValue())
10785 // Get rid of the unused bits on the right.
10786 APInt NarrowedUsedBits = UsedBits.lshr(UsedBits.countTrailingZeros());
10787 // Get rid of the unused bits on the left.
10788 if (NarrowedUsedBits.countLeadingZeros())
10789 NarrowedUsedBits = NarrowedUsedBits.trunc(NarrowedUsedBits.getActiveBits());
10790 // Check that the chunk of bits is completely used.
10791 return NarrowedUsedBits.isAllOnesValue();
10794 /// \brief Check whether or not \p First and \p Second are next to each other
10795 /// in memory. This means that there is no hole between the bits loaded
10796 /// by \p First and the bits loaded by \p Second.
10797 static bool areSlicesNextToEachOther(const LoadedSlice &First,
10798 const LoadedSlice &Second) {
10799 assert(First.Origin == Second.Origin && First.Origin &&
10800 "Unable to match different memory origins.");
10801 APInt UsedBits = First.getUsedBits();
10802 assert((UsedBits & Second.getUsedBits()) == 0 &&
10803 "Slices are not supposed to overlap.");
10804 UsedBits |= Second.getUsedBits();
10805 return areUsedBitsDense(UsedBits);
10808 /// \brief Adjust the \p GlobalLSCost according to the target
10809 /// paring capabilities and the layout of the slices.
10810 /// \pre \p GlobalLSCost should account for at least as many loads as
10811 /// there is in the slices in \p LoadedSlices.
10812 static void adjustCostForPairing(SmallVectorImpl<LoadedSlice> &LoadedSlices,
10813 LoadedSlice::Cost &GlobalLSCost) {
10814 unsigned NumberOfSlices = LoadedSlices.size();
10815 // If there is less than 2 elements, no pairing is possible.
10816 if (NumberOfSlices < 2)
10819 // Sort the slices so that elements that are likely to be next to each
10820 // other in memory are next to each other in the list.
10821 std::sort(LoadedSlices.begin(), LoadedSlices.end(),
10822 [](const LoadedSlice &LHS, const LoadedSlice &RHS) {
10823 assert(LHS.Origin == RHS.Origin && "Different bases not implemented.");
10824 return LHS.getOffsetFromBase() < RHS.getOffsetFromBase();
10826 const TargetLowering &TLI = LoadedSlices[0].DAG->getTargetLoweringInfo();
10827 // First (resp. Second) is the first (resp. Second) potentially candidate
10828 // to be placed in a paired load.
10829 const LoadedSlice *First = nullptr;
10830 const LoadedSlice *Second = nullptr;
10831 for (unsigned CurrSlice = 0; CurrSlice < NumberOfSlices; ++CurrSlice,
10832 // Set the beginning of the pair.
10835 Second = &LoadedSlices[CurrSlice];
10837 // If First is NULL, it means we start a new pair.
10838 // Get to the next slice.
10842 EVT LoadedType = First->getLoadedType();
10844 // If the types of the slices are different, we cannot pair them.
10845 if (LoadedType != Second->getLoadedType())
10848 // Check if the target supplies paired loads for this type.
10849 unsigned RequiredAlignment = 0;
10850 if (!TLI.hasPairedLoad(LoadedType, RequiredAlignment)) {
10851 // move to the next pair, this type is hopeless.
10855 // Check if we meet the alignment requirement.
10856 if (RequiredAlignment > First->getAlignment())
10859 // Check that both loads are next to each other in memory.
10860 if (!areSlicesNextToEachOther(*First, *Second))
10863 assert(GlobalLSCost.Loads > 0 && "We save more loads than we created!");
10864 --GlobalLSCost.Loads;
10865 // Move to the next pair.
10870 /// \brief Check the profitability of all involved LoadedSlice.
10871 /// Currently, it is considered profitable if there is exactly two
10872 /// involved slices (1) which are (2) next to each other in memory, and
10873 /// whose cost (\see LoadedSlice::Cost) is smaller than the original load (3).
10875 /// Note: The order of the elements in \p LoadedSlices may be modified, but not
10876 /// the elements themselves.
10878 /// FIXME: When the cost model will be mature enough, we can relax
10879 /// constraints (1) and (2).
10880 static bool isSlicingProfitable(SmallVectorImpl<LoadedSlice> &LoadedSlices,
10881 const APInt &UsedBits, bool ForCodeSize) {
10882 unsigned NumberOfSlices = LoadedSlices.size();
10883 if (StressLoadSlicing)
10884 return NumberOfSlices > 1;
10887 if (NumberOfSlices != 2)
10891 if (!areUsedBitsDense(UsedBits))
10895 LoadedSlice::Cost OrigCost(ForCodeSize), GlobalSlicingCost(ForCodeSize);
10896 // The original code has one big load.
10897 OrigCost.Loads = 1;
10898 for (unsigned CurrSlice = 0; CurrSlice < NumberOfSlices; ++CurrSlice) {
10899 const LoadedSlice &LS = LoadedSlices[CurrSlice];
10900 // Accumulate the cost of all the slices.
10901 LoadedSlice::Cost SliceCost(LS, ForCodeSize);
10902 GlobalSlicingCost += SliceCost;
10904 // Account as cost in the original configuration the gain obtained
10905 // with the current slices.
10906 OrigCost.addSliceGain(LS);
10909 // If the target supports paired load, adjust the cost accordingly.
10910 adjustCostForPairing(LoadedSlices, GlobalSlicingCost);
10911 return OrigCost > GlobalSlicingCost;
10914 /// \brief If the given load, \p LI, is used only by trunc or trunc(lshr)
10915 /// operations, split it in the various pieces being extracted.
10917 /// This sort of thing is introduced by SROA.
10918 /// This slicing takes care not to insert overlapping loads.
10919 /// \pre LI is a simple load (i.e., not an atomic or volatile load).
10920 bool DAGCombiner::SliceUpLoad(SDNode *N) {
10921 if (Level < AfterLegalizeDAG)
10924 LoadSDNode *LD = cast<LoadSDNode>(N);
10925 if (LD->isVolatile() || !ISD::isNormalLoad(LD) ||
10926 !LD->getValueType(0).isInteger())
10929 // Keep track of already used bits to detect overlapping values.
10930 // In that case, we will just abort the transformation.
10931 APInt UsedBits(LD->getValueSizeInBits(0), 0);
10933 SmallVector<LoadedSlice, 4> LoadedSlices;
10935 // Check if this load is used as several smaller chunks of bits.
10936 // Basically, look for uses in trunc or trunc(lshr) and record a new chain
10937 // of computation for each trunc.
10938 for (SDNode::use_iterator UI = LD->use_begin(), UIEnd = LD->use_end();
10939 UI != UIEnd; ++UI) {
10940 // Skip the uses of the chain.
10941 if (UI.getUse().getResNo() != 0)
10944 SDNode *User = *UI;
10945 unsigned Shift = 0;
10947 // Check if this is a trunc(lshr).
10948 if (User->getOpcode() == ISD::SRL && User->hasOneUse() &&
10949 isa<ConstantSDNode>(User->getOperand(1))) {
10950 Shift = cast<ConstantSDNode>(User->getOperand(1))->getZExtValue();
10951 User = *User->use_begin();
10954 // At this point, User is a Truncate, iff we encountered, trunc or
10956 if (User->getOpcode() != ISD::TRUNCATE)
10959 // The width of the type must be a power of 2 and greater than 8-bits.
10960 // Otherwise the load cannot be represented in LLVM IR.
10961 // Moreover, if we shifted with a non-8-bits multiple, the slice
10962 // will be across several bytes. We do not support that.
10963 unsigned Width = User->getValueSizeInBits(0);
10964 if (Width < 8 || !isPowerOf2_32(Width) || (Shift & 0x7))
10967 // Build the slice for this chain of computations.
10968 LoadedSlice LS(User, LD, Shift, &DAG);
10969 APInt CurrentUsedBits = LS.getUsedBits();
10971 // Check if this slice overlaps with another.
10972 if ((CurrentUsedBits & UsedBits) != 0)
10974 // Update the bits used globally.
10975 UsedBits |= CurrentUsedBits;
10977 // Check if the new slice would be legal.
10981 // Record the slice.
10982 LoadedSlices.push_back(LS);
10985 // Abort slicing if it does not seem to be profitable.
10986 if (!isSlicingProfitable(LoadedSlices, UsedBits, ForCodeSize))
10991 // Rewrite each chain to use an independent load.
10992 // By construction, each chain can be represented by a unique load.
10994 // Prepare the argument for the new token factor for all the slices.
10995 SmallVector<SDValue, 8> ArgChains;
10996 for (SmallVectorImpl<LoadedSlice>::const_iterator
10997 LSIt = LoadedSlices.begin(),
10998 LSItEnd = LoadedSlices.end();
10999 LSIt != LSItEnd; ++LSIt) {
11000 SDValue SliceInst = LSIt->loadSlice();
11001 CombineTo(LSIt->Inst, SliceInst, true);
11002 if (SliceInst.getOpcode() != ISD::LOAD)
11003 SliceInst = SliceInst.getOperand(0);
11004 assert(SliceInst->getOpcode() == ISD::LOAD &&
11005 "It takes more than a zext to get to the loaded slice!!");
11006 ArgChains.push_back(SliceInst.getValue(1));
11009 SDValue Chain = DAG.getNode(ISD::TokenFactor, SDLoc(LD), MVT::Other,
11011 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain);
11015 /// Check to see if V is (and load (ptr), imm), where the load is having
11016 /// specific bytes cleared out. If so, return the byte size being masked out
11017 /// and the shift amount.
11018 static std::pair<unsigned, unsigned>
11019 CheckForMaskedLoad(SDValue V, SDValue Ptr, SDValue Chain) {
11020 std::pair<unsigned, unsigned> Result(0, 0);
11022 // Check for the structure we're looking for.
11023 if (V->getOpcode() != ISD::AND ||
11024 !isa<ConstantSDNode>(V->getOperand(1)) ||
11025 !ISD::isNormalLoad(V->getOperand(0).getNode()))
11028 // Check the chain and pointer.
11029 LoadSDNode *LD = cast<LoadSDNode>(V->getOperand(0));
11030 if (LD->getBasePtr() != Ptr) return Result; // Not from same pointer.
11032 // The store should be chained directly to the load or be an operand of a
11034 if (LD == Chain.getNode())
11036 else if (Chain->getOpcode() != ISD::TokenFactor)
11037 return Result; // Fail.
11040 for (const SDValue &ChainOp : Chain->op_values())
11041 if (ChainOp.getNode() == LD) {
11045 if (!isOk) return Result;
11048 // This only handles simple types.
11049 if (V.getValueType() != MVT::i16 &&
11050 V.getValueType() != MVT::i32 &&
11051 V.getValueType() != MVT::i64)
11054 // Check the constant mask. Invert it so that the bits being masked out are
11055 // 0 and the bits being kept are 1. Use getSExtValue so that leading bits
11056 // follow the sign bit for uniformity.
11057 uint64_t NotMask = ~cast<ConstantSDNode>(V->getOperand(1))->getSExtValue();
11058 unsigned NotMaskLZ = countLeadingZeros(NotMask);
11059 if (NotMaskLZ & 7) return Result; // Must be multiple of a byte.
11060 unsigned NotMaskTZ = countTrailingZeros(NotMask);
11061 if (NotMaskTZ & 7) return Result; // Must be multiple of a byte.
11062 if (NotMaskLZ == 64) return Result; // All zero mask.
11064 // See if we have a continuous run of bits. If so, we have 0*1+0*
11065 if (countTrailingOnes(NotMask >> NotMaskTZ) + NotMaskTZ + NotMaskLZ != 64)
11068 // Adjust NotMaskLZ down to be from the actual size of the int instead of i64.
11069 if (V.getValueType() != MVT::i64 && NotMaskLZ)
11070 NotMaskLZ -= 64-V.getValueSizeInBits();
11072 unsigned MaskedBytes = (V.getValueSizeInBits()-NotMaskLZ-NotMaskTZ)/8;
11073 switch (MaskedBytes) {
11077 default: return Result; // All one mask, or 5-byte mask.
11080 // Verify that the first bit starts at a multiple of mask so that the access
11081 // is aligned the same as the access width.
11082 if (NotMaskTZ && NotMaskTZ/8 % MaskedBytes) return Result;
11084 Result.first = MaskedBytes;
11085 Result.second = NotMaskTZ/8;
11090 /// Check to see if IVal is something that provides a value as specified by
11091 /// MaskInfo. If so, replace the specified store with a narrower store of
11092 /// truncated IVal.
11094 ShrinkLoadReplaceStoreWithStore(const std::pair<unsigned, unsigned> &MaskInfo,
11095 SDValue IVal, StoreSDNode *St,
11097 unsigned NumBytes = MaskInfo.first;
11098 unsigned ByteShift = MaskInfo.second;
11099 SelectionDAG &DAG = DC->getDAG();
11101 // Check to see if IVal is all zeros in the part being masked in by the 'or'
11102 // that uses this. If not, this is not a replacement.
11103 APInt Mask = ~APInt::getBitsSet(IVal.getValueSizeInBits(),
11104 ByteShift*8, (ByteShift+NumBytes)*8);
11105 if (!DAG.MaskedValueIsZero(IVal, Mask)) return nullptr;
11107 // Check that it is legal on the target to do this. It is legal if the new
11108 // VT we're shrinking to (i8/i16/i32) is legal or we're still before type
11110 MVT VT = MVT::getIntegerVT(NumBytes*8);
11111 if (!DC->isTypeLegal(VT))
11114 // Okay, we can do this! Replace the 'St' store with a store of IVal that is
11115 // shifted by ByteShift and truncated down to NumBytes.
11118 IVal = DAG.getNode(ISD::SRL, DL, IVal.getValueType(), IVal,
11119 DAG.getConstant(ByteShift*8, DL,
11120 DC->getShiftAmountTy(IVal.getValueType())));
11123 // Figure out the offset for the store and the alignment of the access.
11125 unsigned NewAlign = St->getAlignment();
11127 if (DAG.getDataLayout().isLittleEndian())
11128 StOffset = ByteShift;
11130 StOffset = IVal.getValueType().getStoreSize() - ByteShift - NumBytes;
11132 SDValue Ptr = St->getBasePtr();
11135 Ptr = DAG.getNode(ISD::ADD, DL, Ptr.getValueType(),
11136 Ptr, DAG.getConstant(StOffset, DL, Ptr.getValueType()));
11137 NewAlign = MinAlign(NewAlign, StOffset);
11140 // Truncate down to the new size.
11141 IVal = DAG.getNode(ISD::TRUNCATE, SDLoc(IVal), VT, IVal);
11145 .getStore(St->getChain(), SDLoc(St), IVal, Ptr,
11146 St->getPointerInfo().getWithOffset(StOffset), NewAlign)
11151 /// Look for sequence of load / op / store where op is one of 'or', 'xor', and
11152 /// 'and' of immediates. If 'op' is only touching some of the loaded bits, try
11153 /// narrowing the load and store if it would end up being a win for performance
11155 SDValue DAGCombiner::ReduceLoadOpStoreWidth(SDNode *N) {
11156 StoreSDNode *ST = cast<StoreSDNode>(N);
11157 if (ST->isVolatile())
11160 SDValue Chain = ST->getChain();
11161 SDValue Value = ST->getValue();
11162 SDValue Ptr = ST->getBasePtr();
11163 EVT VT = Value.getValueType();
11165 if (ST->isTruncatingStore() || VT.isVector() || !Value.hasOneUse())
11168 unsigned Opc = Value.getOpcode();
11170 // If this is "store (or X, Y), P" and X is "(and (load P), cst)", where cst
11171 // is a byte mask indicating a consecutive number of bytes, check to see if
11172 // Y is known to provide just those bytes. If so, we try to replace the
11173 // load + replace + store sequence with a single (narrower) store, which makes
11175 if (Opc == ISD::OR) {
11176 std::pair<unsigned, unsigned> MaskedLoad;
11177 MaskedLoad = CheckForMaskedLoad(Value.getOperand(0), Ptr, Chain);
11178 if (MaskedLoad.first)
11179 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad,
11180 Value.getOperand(1), ST,this))
11181 return SDValue(NewST, 0);
11183 // Or is commutative, so try swapping X and Y.
11184 MaskedLoad = CheckForMaskedLoad(Value.getOperand(1), Ptr, Chain);
11185 if (MaskedLoad.first)
11186 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad,
11187 Value.getOperand(0), ST,this))
11188 return SDValue(NewST, 0);
11191 if ((Opc != ISD::OR && Opc != ISD::XOR && Opc != ISD::AND) ||
11192 Value.getOperand(1).getOpcode() != ISD::Constant)
11195 SDValue N0 = Value.getOperand(0);
11196 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() &&
11197 Chain == SDValue(N0.getNode(), 1)) {
11198 LoadSDNode *LD = cast<LoadSDNode>(N0);
11199 if (LD->getBasePtr() != Ptr ||
11200 LD->getPointerInfo().getAddrSpace() !=
11201 ST->getPointerInfo().getAddrSpace())
11204 // Find the type to narrow it the load / op / store to.
11205 SDValue N1 = Value.getOperand(1);
11206 unsigned BitWidth = N1.getValueSizeInBits();
11207 APInt Imm = cast<ConstantSDNode>(N1)->getAPIntValue();
11208 if (Opc == ISD::AND)
11209 Imm ^= APInt::getAllOnesValue(BitWidth);
11210 if (Imm == 0 || Imm.isAllOnesValue())
11212 unsigned ShAmt = Imm.countTrailingZeros();
11213 unsigned MSB = BitWidth - Imm.countLeadingZeros() - 1;
11214 unsigned NewBW = NextPowerOf2(MSB - ShAmt);
11215 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW);
11216 // The narrowing should be profitable, the load/store operation should be
11217 // legal (or custom) and the store size should be equal to the NewVT width.
11218 while (NewBW < BitWidth &&
11219 (NewVT.getStoreSizeInBits() != NewBW ||
11220 !TLI.isOperationLegalOrCustom(Opc, NewVT) ||
11221 !TLI.isNarrowingProfitable(VT, NewVT))) {
11222 NewBW = NextPowerOf2(NewBW);
11223 NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW);
11225 if (NewBW >= BitWidth)
11228 // If the lsb changed does not start at the type bitwidth boundary,
11229 // start at the previous one.
11231 ShAmt = (((ShAmt + NewBW - 1) / NewBW) * NewBW) - NewBW;
11232 APInt Mask = APInt::getBitsSet(BitWidth, ShAmt,
11233 std::min(BitWidth, ShAmt + NewBW));
11234 if ((Imm & Mask) == Imm) {
11235 APInt NewImm = (Imm & Mask).lshr(ShAmt).trunc(NewBW);
11236 if (Opc == ISD::AND)
11237 NewImm ^= APInt::getAllOnesValue(NewBW);
11238 uint64_t PtrOff = ShAmt / 8;
11239 // For big endian targets, we need to adjust the offset to the pointer to
11240 // load the correct bytes.
11241 if (DAG.getDataLayout().isBigEndian())
11242 PtrOff = (BitWidth + 7 - NewBW) / 8 - PtrOff;
11244 unsigned NewAlign = MinAlign(LD->getAlignment(), PtrOff);
11245 Type *NewVTTy = NewVT.getTypeForEVT(*DAG.getContext());
11246 if (NewAlign < DAG.getDataLayout().getABITypeAlignment(NewVTTy))
11249 SDValue NewPtr = DAG.getNode(ISD::ADD, SDLoc(LD),
11250 Ptr.getValueType(), Ptr,
11251 DAG.getConstant(PtrOff, SDLoc(LD),
11252 Ptr.getValueType()));
11254 DAG.getLoad(NewVT, SDLoc(N0), LD->getChain(), NewPtr,
11255 LD->getPointerInfo().getWithOffset(PtrOff), NewAlign,
11256 LD->getMemOperand()->getFlags(), LD->getAAInfo());
11257 SDValue NewVal = DAG.getNode(Opc, SDLoc(Value), NewVT, NewLD,
11258 DAG.getConstant(NewImm, SDLoc(Value),
11261 DAG.getStore(Chain, SDLoc(N), NewVal, NewPtr,
11262 ST->getPointerInfo().getWithOffset(PtrOff), NewAlign);
11264 AddToWorklist(NewPtr.getNode());
11265 AddToWorklist(NewLD.getNode());
11266 AddToWorklist(NewVal.getNode());
11267 WorklistRemover DeadNodes(*this);
11268 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), NewLD.getValue(1));
11277 /// For a given floating point load / store pair, if the load value isn't used
11278 /// by any other operations, then consider transforming the pair to integer
11279 /// load / store operations if the target deems the transformation profitable.
11280 SDValue DAGCombiner::TransformFPLoadStorePair(SDNode *N) {
11281 StoreSDNode *ST = cast<StoreSDNode>(N);
11282 SDValue Chain = ST->getChain();
11283 SDValue Value = ST->getValue();
11284 if (ISD::isNormalStore(ST) && ISD::isNormalLoad(Value.getNode()) &&
11285 Value.hasOneUse() &&
11286 Chain == SDValue(Value.getNode(), 1)) {
11287 LoadSDNode *LD = cast<LoadSDNode>(Value);
11288 EVT VT = LD->getMemoryVT();
11289 if (!VT.isFloatingPoint() ||
11290 VT != ST->getMemoryVT() ||
11291 LD->isNonTemporal() ||
11292 ST->isNonTemporal() ||
11293 LD->getPointerInfo().getAddrSpace() != 0 ||
11294 ST->getPointerInfo().getAddrSpace() != 0)
11297 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits());
11298 if (!TLI.isOperationLegal(ISD::LOAD, IntVT) ||
11299 !TLI.isOperationLegal(ISD::STORE, IntVT) ||
11300 !TLI.isDesirableToTransformToIntegerOp(ISD::LOAD, VT) ||
11301 !TLI.isDesirableToTransformToIntegerOp(ISD::STORE, VT))
11304 unsigned LDAlign = LD->getAlignment();
11305 unsigned STAlign = ST->getAlignment();
11306 Type *IntVTTy = IntVT.getTypeForEVT(*DAG.getContext());
11307 unsigned ABIAlign = DAG.getDataLayout().getABITypeAlignment(IntVTTy);
11308 if (LDAlign < ABIAlign || STAlign < ABIAlign)
11312 DAG.getLoad(IntVT, SDLoc(Value), LD->getChain(), LD->getBasePtr(),
11313 LD->getPointerInfo(), LDAlign);
11316 DAG.getStore(NewLD.getValue(1), SDLoc(N), NewLD, ST->getBasePtr(),
11317 ST->getPointerInfo(), STAlign);
11319 AddToWorklist(NewLD.getNode());
11320 AddToWorklist(NewST.getNode());
11321 WorklistRemover DeadNodes(*this);
11322 DAG.ReplaceAllUsesOfValueWith(Value.getValue(1), NewLD.getValue(1));
11330 // This is a helper function for visitMUL to check the profitability
11331 // of folding (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2).
11332 // MulNode is the original multiply, AddNode is (add x, c1),
11333 // and ConstNode is c2.
11335 // If the (add x, c1) has multiple uses, we could increase
11336 // the number of adds if we make this transformation.
11337 // It would only be worth doing this if we can remove a
11338 // multiply in the process. Check for that here.
11342 // We're checking for cases where we have common "c3 * A" expressions.
11343 bool DAGCombiner::isMulAddWithConstProfitable(SDNode *MulNode,
11345 SDValue &ConstNode) {
11348 // If the add only has one use, this would be OK to do.
11349 if (AddNode.getNode()->hasOneUse())
11352 // Walk all the users of the constant with which we're multiplying.
11353 for (SDNode *Use : ConstNode->uses()) {
11355 if (Use == MulNode) // This use is the one we're on right now. Skip it.
11358 if (Use->getOpcode() == ISD::MUL) { // We have another multiply use.
11360 SDNode *MulVar = AddNode.getOperand(0).getNode();
11362 // OtherOp is what we're multiplying against the constant.
11363 if (Use->getOperand(0) == ConstNode)
11364 OtherOp = Use->getOperand(1).getNode();
11366 OtherOp = Use->getOperand(0).getNode();
11368 // Check to see if multiply is with the same operand of our "add".
11370 // ConstNode = CONST
11371 // Use = ConstNode * A <-- visiting Use. OtherOp is A.
11373 // AddNode = (A + c1) <-- MulVar is A.
11374 // = AddNode * ConstNode <-- current visiting instruction.
11376 // If we make this transformation, we will have a common
11377 // multiply (ConstNode * A) that we can save.
11378 if (OtherOp == MulVar)
11381 // Now check to see if a future expansion will give us a common
11384 // ConstNode = CONST
11385 // AddNode = (A + c1)
11386 // ... = AddNode * ConstNode <-- current visiting instruction.
11388 // OtherOp = (A + c2)
11389 // Use = OtherOp * ConstNode <-- visiting Use.
11391 // If we make this transformation, we will have a common
11392 // multiply (CONST * A) after we also do the same transformation
11393 // to the "t2" instruction.
11394 if (OtherOp->getOpcode() == ISD::ADD &&
11395 DAG.isConstantIntBuildVectorOrConstantInt(OtherOp->getOperand(1)) &&
11396 OtherOp->getOperand(0).getNode() == MulVar)
11401 // Didn't find a case where this would be profitable.
11405 SDValue DAGCombiner::getMergedConstantVectorStore(
11406 SelectionDAG &DAG, const SDLoc &SL, ArrayRef<MemOpLink> Stores,
11407 SmallVectorImpl<SDValue> &Chains, EVT Ty) const {
11408 SmallVector<SDValue, 8> BuildVector;
11410 for (unsigned I = 0, E = Ty.getVectorNumElements(); I != E; ++I) {
11411 StoreSDNode *St = cast<StoreSDNode>(Stores[I].MemNode);
11412 Chains.push_back(St->getChain());
11413 BuildVector.push_back(St->getValue());
11416 return DAG.getBuildVector(Ty, SL, BuildVector);
11419 bool DAGCombiner::MergeStoresOfConstantsOrVecElts(
11420 SmallVectorImpl<MemOpLink> &StoreNodes, EVT MemVT,
11421 unsigned NumStores, bool IsConstantSrc, bool UseVector) {
11422 // Make sure we have something to merge.
11426 int64_t ElementSizeBytes = MemVT.getSizeInBits() / 8;
11427 LSBaseSDNode *FirstInChain = StoreNodes[0].MemNode;
11428 unsigned LatestNodeUsed = 0;
11430 for (unsigned i=0; i < NumStores; ++i) {
11431 // Find a chain for the new wide-store operand. Notice that some
11432 // of the store nodes that we found may not be selected for inclusion
11433 // in the wide store. The chain we use needs to be the chain of the
11434 // latest store node which is *used* and replaced by the wide store.
11435 if (StoreNodes[i].SequenceNum < StoreNodes[LatestNodeUsed].SequenceNum)
11436 LatestNodeUsed = i;
11439 SmallVector<SDValue, 8> Chains;
11441 // The latest Node in the DAG.
11442 LSBaseSDNode *LatestOp = StoreNodes[LatestNodeUsed].MemNode;
11443 SDLoc DL(StoreNodes[0].MemNode);
11447 bool IsVec = MemVT.isVector();
11448 unsigned Elts = NumStores;
11450 // When merging vector stores, get the total number of elements.
11451 Elts *= MemVT.getVectorNumElements();
11453 // Get the type for the merged vector store.
11454 EVT Ty = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(), Elts);
11455 assert(TLI.isTypeLegal(Ty) && "Illegal vector store");
11457 if (IsConstantSrc) {
11458 StoredVal = getMergedConstantVectorStore(DAG, DL, StoreNodes, Chains, Ty);
11460 SmallVector<SDValue, 8> Ops;
11461 for (unsigned i = 0; i < NumStores; ++i) {
11462 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
11463 SDValue Val = St->getValue();
11464 // All operands of BUILD_VECTOR / CONCAT_VECTOR must have the same type.
11465 if (Val.getValueType() != MemVT)
11467 Ops.push_back(Val);
11468 Chains.push_back(St->getChain());
11471 // Build the extracted vector elements back into a vector.
11472 StoredVal = DAG.getNode(IsVec ? ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR,
11475 // We should always use a vector store when merging extracted vector
11476 // elements, so this path implies a store of constants.
11477 assert(IsConstantSrc && "Merged vector elements should use vector store");
11479 unsigned SizeInBits = NumStores * ElementSizeBytes * 8;
11480 APInt StoreInt(SizeInBits, 0);
11482 // Construct a single integer constant which is made of the smaller
11483 // constant inputs.
11484 bool IsLE = DAG.getDataLayout().isLittleEndian();
11485 for (unsigned i = 0; i < NumStores; ++i) {
11486 unsigned Idx = IsLE ? (NumStores - 1 - i) : i;
11487 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[Idx].MemNode);
11488 Chains.push_back(St->getChain());
11490 SDValue Val = St->getValue();
11491 StoreInt <<= ElementSizeBytes * 8;
11492 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Val)) {
11493 StoreInt |= C->getAPIntValue().zext(SizeInBits);
11494 } else if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Val)) {
11495 StoreInt |= C->getValueAPF().bitcastToAPInt().zext(SizeInBits);
11497 llvm_unreachable("Invalid constant element type");
11501 // Create the new Load and Store operations.
11502 EVT StoreTy = EVT::getIntegerVT(*DAG.getContext(), SizeInBits);
11503 StoredVal = DAG.getConstant(StoreInt, DL, StoreTy);
11506 assert(!Chains.empty());
11508 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
11509 SDValue NewStore = DAG.getStore(NewChain, DL, StoredVal,
11510 FirstInChain->getBasePtr(),
11511 FirstInChain->getPointerInfo(),
11512 FirstInChain->getAlignment());
11514 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
11515 : DAG.getSubtarget().useAA();
11517 // Replace all merged stores with the new store.
11518 for (unsigned i = 0; i < NumStores; ++i)
11519 CombineTo(StoreNodes[i].MemNode, NewStore);
11521 // Replace the last store with the new store.
11522 CombineTo(LatestOp, NewStore);
11523 // Erase all other stores.
11524 for (unsigned i = 0; i < NumStores; ++i) {
11525 if (StoreNodes[i].MemNode == LatestOp)
11527 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
11528 // ReplaceAllUsesWith will replace all uses that existed when it was
11529 // called, but graph optimizations may cause new ones to appear. For
11530 // example, the case in pr14333 looks like
11532 // St's chain -> St -> another store -> X
11534 // And the only difference from St to the other store is the chain.
11535 // When we change it's chain to be St's chain they become identical,
11536 // get CSEed and the net result is that X is now a use of St.
11537 // Since we know that St is redundant, just iterate.
11538 while (!St->use_empty())
11539 DAG.ReplaceAllUsesWith(SDValue(St, 0), St->getChain());
11540 deleteAndRecombine(St);
11544 StoreNodes.erase(StoreNodes.begin() + NumStores, StoreNodes.end());
11548 void DAGCombiner::getStoreMergeAndAliasCandidates(
11549 StoreSDNode* St, SmallVectorImpl<MemOpLink> &StoreNodes,
11550 SmallVectorImpl<LSBaseSDNode*> &AliasLoadNodes) {
11551 // This holds the base pointer, index, and the offset in bytes from the base
11553 BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr(), DAG);
11555 // We must have a base and an offset.
11556 if (!BasePtr.Base.getNode())
11559 // Do not handle stores to undef base pointers.
11560 if (BasePtr.Base.isUndef())
11563 // Walk up the chain and look for nodes with offsets from the same
11564 // base pointer. Stop when reaching an instruction with a different kind
11565 // or instruction which has a different base pointer.
11566 EVT MemVT = St->getMemoryVT();
11568 StoreSDNode *Index = St;
11571 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
11572 : DAG.getSubtarget().useAA();
11575 // Look at other users of the same chain. Stores on the same chain do not
11576 // alias. If combiner-aa is enabled, non-aliasing stores are canonicalized
11577 // to be on the same chain, so don't bother looking at adjacent chains.
11579 SDValue Chain = St->getChain();
11580 for (auto I = Chain->use_begin(), E = Chain->use_end(); I != E; ++I) {
11581 if (StoreSDNode *OtherST = dyn_cast<StoreSDNode>(*I)) {
11582 if (I.getOperandNo() != 0)
11585 if (OtherST->isVolatile() || OtherST->isIndexed())
11588 if (OtherST->getMemoryVT() != MemVT)
11591 BaseIndexOffset Ptr = BaseIndexOffset::match(OtherST->getBasePtr(), DAG);
11593 if (Ptr.equalBaseIndex(BasePtr))
11594 StoreNodes.push_back(MemOpLink(OtherST, Ptr.Offset, Seq++));
11602 // If the chain has more than one use, then we can't reorder the mem ops.
11603 if (Index != St && !SDValue(Index, 0)->hasOneUse())
11606 // Find the base pointer and offset for this memory node.
11607 BaseIndexOffset Ptr = BaseIndexOffset::match(Index->getBasePtr(), DAG);
11609 // Check that the base pointer is the same as the original one.
11610 if (!Ptr.equalBaseIndex(BasePtr))
11613 // The memory operands must not be volatile.
11614 if (Index->isVolatile() || Index->isIndexed())
11618 if (Index->isTruncatingStore())
11621 // The stored memory type must be the same.
11622 if (Index->getMemoryVT() != MemVT)
11625 // We do not allow under-aligned stores in order to prevent
11626 // overriding stores. NOTE: this is a bad hack. Alignment SHOULD
11627 // be irrelevant here; what MATTERS is that we not move memory
11628 // operations that potentially overlap past each-other.
11629 if (Index->getAlignment() < MemVT.getStoreSize())
11632 // We found a potential memory operand to merge.
11633 StoreNodes.push_back(MemOpLink(Index, Ptr.Offset, Seq++));
11635 // Find the next memory operand in the chain. If the next operand in the
11636 // chain is a store then move up and continue the scan with the next
11637 // memory operand. If the next operand is a load save it and use alias
11638 // information to check if it interferes with anything.
11639 SDNode *NextInChain = Index->getChain().getNode();
11641 if (StoreSDNode *STn = dyn_cast<StoreSDNode>(NextInChain)) {
11642 // We found a store node. Use it for the next iteration.
11645 } else if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(NextInChain)) {
11646 if (Ldn->isVolatile()) {
11651 // Save the load node for later. Continue the scan.
11652 AliasLoadNodes.push_back(Ldn);
11653 NextInChain = Ldn->getChain().getNode();
11663 // We need to check that merging these stores does not cause a loop
11664 // in the DAG. Any store candidate may depend on another candidate
11665 // indirectly through its operand (we already consider dependencies
11666 // through the chain). Check in parallel by searching up from
11667 // non-chain operands of candidates.
11668 bool DAGCombiner::checkMergeStoreCandidatesForDependencies(
11669 SmallVectorImpl<MemOpLink> &StoreNodes) {
11670 SmallPtrSet<const SDNode *, 16> Visited;
11671 SmallVector<const SDNode *, 8> Worklist;
11672 // search ops of store candidates
11673 for (unsigned i = 0; i < StoreNodes.size(); ++i) {
11674 SDNode *n = StoreNodes[i].MemNode;
11675 // Potential loops may happen only through non-chain operands
11676 for (unsigned j = 1; j < n->getNumOperands(); ++j)
11677 Worklist.push_back(n->getOperand(j).getNode());
11679 // search through DAG. We can stop early if we find a storenode
11680 for (unsigned i = 0; i < StoreNodes.size(); ++i) {
11681 if (SDNode::hasPredecessorHelper(StoreNodes[i].MemNode, Visited, Worklist))
11687 bool DAGCombiner::MergeConsecutiveStores(
11688 StoreSDNode* St, SmallVectorImpl<MemOpLink> &StoreNodes) {
11689 if (OptLevel == CodeGenOpt::None)
11692 EVT MemVT = St->getMemoryVT();
11693 int64_t ElementSizeBytes = MemVT.getSizeInBits() / 8;
11694 bool NoVectors = DAG.getMachineFunction().getFunction()->hasFnAttribute(
11695 Attribute::NoImplicitFloat);
11697 // This function cannot currently deal with non-byte-sized memory sizes.
11698 if (ElementSizeBytes * 8 != MemVT.getSizeInBits())
11701 if (!MemVT.isSimple())
11704 // Perform an early exit check. Do not bother looking at stored values that
11705 // are not constants, loads, or extracted vector elements.
11706 SDValue StoredVal = St->getValue();
11707 bool IsLoadSrc = isa<LoadSDNode>(StoredVal);
11708 bool IsConstantSrc = isa<ConstantSDNode>(StoredVal) ||
11709 isa<ConstantFPSDNode>(StoredVal);
11710 bool IsExtractVecSrc = (StoredVal.getOpcode() == ISD::EXTRACT_VECTOR_ELT ||
11711 StoredVal.getOpcode() == ISD::EXTRACT_SUBVECTOR);
11713 if (!IsConstantSrc && !IsLoadSrc && !IsExtractVecSrc)
11716 // Don't merge vectors into wider vectors if the source data comes from loads.
11717 // TODO: This restriction can be lifted by using logic similar to the
11718 // ExtractVecSrc case.
11719 if (MemVT.isVector() && IsLoadSrc)
11722 // Only look at ends of store sequences.
11723 SDValue Chain = SDValue(St, 0);
11724 if (Chain->hasOneUse() && Chain->use_begin()->getOpcode() == ISD::STORE)
11727 // Save the LoadSDNodes that we find in the chain.
11728 // We need to make sure that these nodes do not interfere with
11729 // any of the store nodes.
11730 SmallVector<LSBaseSDNode*, 8> AliasLoadNodes;
11732 getStoreMergeAndAliasCandidates(St, StoreNodes, AliasLoadNodes);
11734 // Check if there is anything to merge.
11735 if (StoreNodes.size() < 2)
11738 // only do dependence check in AA case
11739 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
11740 : DAG.getSubtarget().useAA();
11741 if (UseAA && !checkMergeStoreCandidatesForDependencies(StoreNodes))
11744 // Sort the memory operands according to their distance from the
11745 // base pointer. As a secondary criteria: make sure stores coming
11746 // later in the code come first in the list. This is important for
11747 // the non-UseAA case, because we're merging stores into the FINAL
11748 // store along a chain which potentially contains aliasing stores.
11749 // Thus, if there are multiple stores to the same address, the last
11750 // one can be considered for merging but not the others.
11751 std::sort(StoreNodes.begin(), StoreNodes.end(),
11752 [](MemOpLink LHS, MemOpLink RHS) {
11753 return LHS.OffsetFromBase < RHS.OffsetFromBase ||
11754 (LHS.OffsetFromBase == RHS.OffsetFromBase &&
11755 LHS.SequenceNum < RHS.SequenceNum);
11758 // Scan the memory operations on the chain and find the first non-consecutive
11759 // store memory address.
11760 unsigned LastConsecutiveStore = 0;
11761 int64_t StartAddress = StoreNodes[0].OffsetFromBase;
11762 for (unsigned i = 0, e = StoreNodes.size(); i < e; ++i) {
11764 // Check that the addresses are consecutive starting from the second
11765 // element in the list of stores.
11767 int64_t CurrAddress = StoreNodes[i].OffsetFromBase;
11768 if (CurrAddress - StartAddress != (ElementSizeBytes * i))
11772 // Check if this store interferes with any of the loads that we found.
11773 // If we find a load that alias with this store. Stop the sequence.
11774 if (any_of(AliasLoadNodes, [&](LSBaseSDNode *Ldn) {
11775 return isAlias(Ldn, StoreNodes[i].MemNode);
11779 // Mark this node as useful.
11780 LastConsecutiveStore = i;
11783 // The node with the lowest store address.
11784 LSBaseSDNode *FirstInChain = StoreNodes[0].MemNode;
11785 unsigned FirstStoreAS = FirstInChain->getAddressSpace();
11786 unsigned FirstStoreAlign = FirstInChain->getAlignment();
11787 LLVMContext &Context = *DAG.getContext();
11788 const DataLayout &DL = DAG.getDataLayout();
11790 // Store the constants into memory as one consecutive store.
11791 if (IsConstantSrc) {
11792 unsigned LastLegalType = 0;
11793 unsigned LastLegalVectorType = 0;
11794 bool NonZero = false;
11795 for (unsigned i=0; i<LastConsecutiveStore+1; ++i) {
11796 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
11797 SDValue StoredVal = St->getValue();
11799 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(StoredVal)) {
11800 NonZero |= !C->isNullValue();
11801 } else if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(StoredVal)) {
11802 NonZero |= !C->getConstantFPValue()->isNullValue();
11808 // Find a legal type for the constant store.
11809 unsigned SizeInBits = (i+1) * ElementSizeBytes * 8;
11810 EVT StoreTy = EVT::getIntegerVT(Context, SizeInBits);
11812 if (TLI.isTypeLegal(StoreTy) &&
11813 TLI.allowsMemoryAccess(Context, DL, StoreTy, FirstStoreAS,
11814 FirstStoreAlign, &IsFast) && IsFast) {
11815 LastLegalType = i+1;
11816 // Or check whether a truncstore is legal.
11817 } else if (TLI.getTypeAction(Context, StoreTy) ==
11818 TargetLowering::TypePromoteInteger) {
11819 EVT LegalizedStoredValueTy =
11820 TLI.getTypeToTransformTo(Context, StoredVal.getValueType());
11821 if (TLI.isTruncStoreLegal(LegalizedStoredValueTy, StoreTy) &&
11822 TLI.allowsMemoryAccess(Context, DL, LegalizedStoredValueTy,
11823 FirstStoreAS, FirstStoreAlign, &IsFast) &&
11825 LastLegalType = i + 1;
11829 // We only use vectors if the constant is known to be zero or the target
11830 // allows it and the function is not marked with the noimplicitfloat
11832 if ((!NonZero || TLI.storeOfVectorConstantIsCheap(MemVT, i+1,
11835 // Find a legal type for the vector store.
11836 EVT Ty = EVT::getVectorVT(Context, MemVT, i+1);
11837 if (TLI.isTypeLegal(Ty) &&
11838 TLI.allowsMemoryAccess(Context, DL, Ty, FirstStoreAS,
11839 FirstStoreAlign, &IsFast) && IsFast)
11840 LastLegalVectorType = i + 1;
11844 // Check if we found a legal integer type to store.
11845 if (LastLegalType == 0 && LastLegalVectorType == 0)
11848 bool UseVector = (LastLegalVectorType > LastLegalType) && !NoVectors;
11849 unsigned NumElem = UseVector ? LastLegalVectorType : LastLegalType;
11851 return MergeStoresOfConstantsOrVecElts(StoreNodes, MemVT, NumElem,
11855 // When extracting multiple vector elements, try to store them
11856 // in one vector store rather than a sequence of scalar stores.
11857 if (IsExtractVecSrc) {
11858 unsigned NumStoresToMerge = 0;
11859 bool IsVec = MemVT.isVector();
11860 for (unsigned i = 0; i < LastConsecutiveStore + 1; ++i) {
11861 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
11862 unsigned StoreValOpcode = St->getValue().getOpcode();
11863 // This restriction could be loosened.
11864 // Bail out if any stored values are not elements extracted from a vector.
11865 // It should be possible to handle mixed sources, but load sources need
11866 // more careful handling (see the block of code below that handles
11867 // consecutive loads).
11868 if (StoreValOpcode != ISD::EXTRACT_VECTOR_ELT &&
11869 StoreValOpcode != ISD::EXTRACT_SUBVECTOR)
11872 // Find a legal type for the vector store.
11873 unsigned Elts = i + 1;
11875 // When merging vector stores, get the total number of elements.
11876 Elts *= MemVT.getVectorNumElements();
11878 EVT Ty = EVT::getVectorVT(*DAG.getContext(), MemVT.getScalarType(), Elts);
11880 if (TLI.isTypeLegal(Ty) &&
11881 TLI.allowsMemoryAccess(Context, DL, Ty, FirstStoreAS,
11882 FirstStoreAlign, &IsFast) && IsFast)
11883 NumStoresToMerge = i + 1;
11886 return MergeStoresOfConstantsOrVecElts(StoreNodes, MemVT, NumStoresToMerge,
11890 // Below we handle the case of multiple consecutive stores that
11891 // come from multiple consecutive loads. We merge them into a single
11892 // wide load and a single wide store.
11894 // Look for load nodes which are used by the stored values.
11895 SmallVector<MemOpLink, 8> LoadNodes;
11897 // Find acceptable loads. Loads need to have the same chain (token factor),
11898 // must not be zext, volatile, indexed, and they must be consecutive.
11899 BaseIndexOffset LdBasePtr;
11900 for (unsigned i=0; i<LastConsecutiveStore+1; ++i) {
11901 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
11902 LoadSDNode *Ld = dyn_cast<LoadSDNode>(St->getValue());
11905 // Loads must only have one use.
11906 if (!Ld->hasNUsesOfValue(1, 0))
11909 // The memory operands must not be volatile.
11910 if (Ld->isVolatile() || Ld->isIndexed())
11913 // We do not accept ext loads.
11914 if (Ld->getExtensionType() != ISD::NON_EXTLOAD)
11917 // The stored memory type must be the same.
11918 if (Ld->getMemoryVT() != MemVT)
11921 BaseIndexOffset LdPtr = BaseIndexOffset::match(Ld->getBasePtr(), DAG);
11922 // If this is not the first ptr that we check.
11923 if (LdBasePtr.Base.getNode()) {
11924 // The base ptr must be the same.
11925 if (!LdPtr.equalBaseIndex(LdBasePtr))
11928 // Check that all other base pointers are the same as this one.
11932 // We found a potential memory operand to merge.
11933 LoadNodes.push_back(MemOpLink(Ld, LdPtr.Offset, 0));
11936 if (LoadNodes.size() < 2)
11939 // If we have load/store pair instructions and we only have two values,
11941 unsigned RequiredAlignment;
11942 if (LoadNodes.size() == 2 && TLI.hasPairedLoad(MemVT, RequiredAlignment) &&
11943 St->getAlignment() >= RequiredAlignment)
11946 LoadSDNode *FirstLoad = cast<LoadSDNode>(LoadNodes[0].MemNode);
11947 unsigned FirstLoadAS = FirstLoad->getAddressSpace();
11948 unsigned FirstLoadAlign = FirstLoad->getAlignment();
11950 // Scan the memory operations on the chain and find the first non-consecutive
11951 // load memory address. These variables hold the index in the store node
11953 unsigned LastConsecutiveLoad = 0;
11954 // This variable refers to the size and not index in the array.
11955 unsigned LastLegalVectorType = 0;
11956 unsigned LastLegalIntegerType = 0;
11957 StartAddress = LoadNodes[0].OffsetFromBase;
11958 SDValue FirstChain = FirstLoad->getChain();
11959 for (unsigned i = 1; i < LoadNodes.size(); ++i) {
11960 // All loads must share the same chain.
11961 if (LoadNodes[i].MemNode->getChain() != FirstChain)
11964 int64_t CurrAddress = LoadNodes[i].OffsetFromBase;
11965 if (CurrAddress - StartAddress != (ElementSizeBytes * i))
11967 LastConsecutiveLoad = i;
11968 // Find a legal type for the vector store.
11969 EVT StoreTy = EVT::getVectorVT(Context, MemVT, i+1);
11970 bool IsFastSt, IsFastLd;
11971 if (TLI.isTypeLegal(StoreTy) &&
11972 TLI.allowsMemoryAccess(Context, DL, StoreTy, FirstStoreAS,
11973 FirstStoreAlign, &IsFastSt) && IsFastSt &&
11974 TLI.allowsMemoryAccess(Context, DL, StoreTy, FirstLoadAS,
11975 FirstLoadAlign, &IsFastLd) && IsFastLd) {
11976 LastLegalVectorType = i + 1;
11979 // Find a legal type for the integer store.
11980 unsigned SizeInBits = (i+1) * ElementSizeBytes * 8;
11981 StoreTy = EVT::getIntegerVT(Context, SizeInBits);
11982 if (TLI.isTypeLegal(StoreTy) &&
11983 TLI.allowsMemoryAccess(Context, DL, StoreTy, FirstStoreAS,
11984 FirstStoreAlign, &IsFastSt) && IsFastSt &&
11985 TLI.allowsMemoryAccess(Context, DL, StoreTy, FirstLoadAS,
11986 FirstLoadAlign, &IsFastLd) && IsFastLd)
11987 LastLegalIntegerType = i + 1;
11988 // Or check whether a truncstore and extload is legal.
11989 else if (TLI.getTypeAction(Context, StoreTy) ==
11990 TargetLowering::TypePromoteInteger) {
11991 EVT LegalizedStoredValueTy =
11992 TLI.getTypeToTransformTo(Context, StoreTy);
11993 if (TLI.isTruncStoreLegal(LegalizedStoredValueTy, StoreTy) &&
11994 TLI.isLoadExtLegal(ISD::ZEXTLOAD, LegalizedStoredValueTy, StoreTy) &&
11995 TLI.isLoadExtLegal(ISD::SEXTLOAD, LegalizedStoredValueTy, StoreTy) &&
11996 TLI.isLoadExtLegal(ISD::EXTLOAD, LegalizedStoredValueTy, StoreTy) &&
11997 TLI.allowsMemoryAccess(Context, DL, LegalizedStoredValueTy,
11998 FirstStoreAS, FirstStoreAlign, &IsFastSt) &&
12000 TLI.allowsMemoryAccess(Context, DL, LegalizedStoredValueTy,
12001 FirstLoadAS, FirstLoadAlign, &IsFastLd) &&
12003 LastLegalIntegerType = i+1;
12007 // Only use vector types if the vector type is larger than the integer type.
12008 // If they are the same, use integers.
12009 bool UseVectorTy = LastLegalVectorType > LastLegalIntegerType && !NoVectors;
12010 unsigned LastLegalType = std::max(LastLegalVectorType, LastLegalIntegerType);
12012 // We add +1 here because the LastXXX variables refer to location while
12013 // the NumElem refers to array/index size.
12014 unsigned NumElem = std::min(LastConsecutiveStore, LastConsecutiveLoad) + 1;
12015 NumElem = std::min(LastLegalType, NumElem);
12020 // Collect the chains from all merged stores.
12021 SmallVector<SDValue, 8> MergeStoreChains;
12022 MergeStoreChains.push_back(StoreNodes[0].MemNode->getChain());
12024 // The latest Node in the DAG.
12025 unsigned LatestNodeUsed = 0;
12026 for (unsigned i=1; i<NumElem; ++i) {
12027 // Find a chain for the new wide-store operand. Notice that some
12028 // of the store nodes that we found may not be selected for inclusion
12029 // in the wide store. The chain we use needs to be the chain of the
12030 // latest store node which is *used* and replaced by the wide store.
12031 if (StoreNodes[i].SequenceNum < StoreNodes[LatestNodeUsed].SequenceNum)
12032 LatestNodeUsed = i;
12034 MergeStoreChains.push_back(StoreNodes[i].MemNode->getChain());
12037 LSBaseSDNode *LatestOp = StoreNodes[LatestNodeUsed].MemNode;
12039 // Find if it is better to use vectors or integers to load and store
12043 JointMemOpVT = EVT::getVectorVT(Context, MemVT, NumElem);
12045 unsigned SizeInBits = NumElem * ElementSizeBytes * 8;
12046 JointMemOpVT = EVT::getIntegerVT(Context, SizeInBits);
12049 SDLoc LoadDL(LoadNodes[0].MemNode);
12050 SDLoc StoreDL(StoreNodes[0].MemNode);
12052 // The merged loads are required to have the same incoming chain, so
12053 // using the first's chain is acceptable.
12054 SDValue NewLoad = DAG.getLoad(JointMemOpVT, LoadDL, FirstLoad->getChain(),
12055 FirstLoad->getBasePtr(),
12056 FirstLoad->getPointerInfo(), FirstLoadAlign);
12058 SDValue NewStoreChain =
12059 DAG.getNode(ISD::TokenFactor, StoreDL, MVT::Other, MergeStoreChains);
12062 DAG.getStore(NewStoreChain, StoreDL, NewLoad, FirstInChain->getBasePtr(),
12063 FirstInChain->getPointerInfo(), FirstStoreAlign);
12065 // Transfer chain users from old loads to the new load.
12066 for (unsigned i = 0; i < NumElem; ++i) {
12067 LoadSDNode *Ld = cast<LoadSDNode>(LoadNodes[i].MemNode);
12068 DAG.ReplaceAllUsesOfValueWith(SDValue(Ld, 1),
12069 SDValue(NewLoad.getNode(), 1));
12073 // Replace the all stores with the new store.
12074 for (unsigned i = 0; i < NumElem; ++i)
12075 CombineTo(StoreNodes[i].MemNode, NewStore);
12077 // Replace the last store with the new store.
12078 CombineTo(LatestOp, NewStore);
12079 // Erase all other stores.
12080 for (unsigned i = 0; i < NumElem; ++i) {
12081 // Remove all Store nodes.
12082 if (StoreNodes[i].MemNode == LatestOp)
12084 StoreSDNode *St = cast<StoreSDNode>(StoreNodes[i].MemNode);
12085 DAG.ReplaceAllUsesOfValueWith(SDValue(St, 0), St->getChain());
12086 deleteAndRecombine(St);
12090 StoreNodes.erase(StoreNodes.begin() + NumElem, StoreNodes.end());
12094 SDValue DAGCombiner::replaceStoreChain(StoreSDNode *ST, SDValue BetterChain) {
12098 // Replace the chain to avoid dependency.
12099 if (ST->isTruncatingStore()) {
12100 ReplStore = DAG.getTruncStore(BetterChain, SL, ST->getValue(),
12101 ST->getBasePtr(), ST->getMemoryVT(),
12102 ST->getMemOperand());
12104 ReplStore = DAG.getStore(BetterChain, SL, ST->getValue(), ST->getBasePtr(),
12105 ST->getMemOperand());
12108 // Create token to keep both nodes around.
12109 SDValue Token = DAG.getNode(ISD::TokenFactor, SL,
12110 MVT::Other, ST->getChain(), ReplStore);
12112 // Make sure the new and old chains are cleaned up.
12113 AddToWorklist(Token.getNode());
12115 // Don't add users to work list.
12116 return CombineTo(ST, Token, false);
12119 SDValue DAGCombiner::replaceStoreOfFPConstant(StoreSDNode *ST) {
12120 SDValue Value = ST->getValue();
12121 if (Value.getOpcode() == ISD::TargetConstantFP)
12126 SDValue Chain = ST->getChain();
12127 SDValue Ptr = ST->getBasePtr();
12129 const ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Value);
12131 // NOTE: If the original store is volatile, this transform must not increase
12132 // the number of stores. For example, on x86-32 an f64 can be stored in one
12133 // processor operation but an i64 (which is not legal) requires two. So the
12134 // transform should not be done in this case.
12137 switch (CFP->getSimpleValueType(0).SimpleTy) {
12139 llvm_unreachable("Unknown FP type");
12140 case MVT::f16: // We don't do this for these yet.
12146 if ((isTypeLegal(MVT::i32) && !LegalOperations && !ST->isVolatile()) ||
12147 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) {
12149 Tmp = DAG.getConstant((uint32_t)CFP->getValueAPF().
12150 bitcastToAPInt().getZExtValue(), SDLoc(CFP),
12152 return DAG.getStore(Chain, DL, Tmp, Ptr, ST->getMemOperand());
12157 if ((TLI.isTypeLegal(MVT::i64) && !LegalOperations &&
12158 !ST->isVolatile()) ||
12159 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i64)) {
12161 Tmp = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
12162 getZExtValue(), SDLoc(CFP), MVT::i64);
12163 return DAG.getStore(Chain, DL, Tmp,
12164 Ptr, ST->getMemOperand());
12167 if (!ST->isVolatile() &&
12168 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) {
12169 // Many FP stores are not made apparent until after legalize, e.g. for
12170 // argument passing. Since this is so common, custom legalize the
12171 // 64-bit integer store into two 32-bit stores.
12172 uint64_t Val = CFP->getValueAPF().bitcastToAPInt().getZExtValue();
12173 SDValue Lo = DAG.getConstant(Val & 0xFFFFFFFF, SDLoc(CFP), MVT::i32);
12174 SDValue Hi = DAG.getConstant(Val >> 32, SDLoc(CFP), MVT::i32);
12175 if (DAG.getDataLayout().isBigEndian())
12178 unsigned Alignment = ST->getAlignment();
12179 MachineMemOperand::Flags MMOFlags = ST->getMemOperand()->getFlags();
12180 AAMDNodes AAInfo = ST->getAAInfo();
12182 SDValue St0 = DAG.getStore(Chain, DL, Lo, Ptr, ST->getPointerInfo(),
12183 ST->getAlignment(), MMOFlags, AAInfo);
12184 Ptr = DAG.getNode(ISD::ADD, DL, Ptr.getValueType(), Ptr,
12185 DAG.getConstant(4, DL, Ptr.getValueType()));
12186 Alignment = MinAlign(Alignment, 4U);
12187 SDValue St1 = DAG.getStore(Chain, DL, Hi, Ptr,
12188 ST->getPointerInfo().getWithOffset(4),
12189 Alignment, MMOFlags, AAInfo);
12190 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other,
12198 SDValue DAGCombiner::visitSTORE(SDNode *N) {
12199 StoreSDNode *ST = cast<StoreSDNode>(N);
12200 SDValue Chain = ST->getChain();
12201 SDValue Value = ST->getValue();
12202 SDValue Ptr = ST->getBasePtr();
12204 // If this is a store of a bit convert, store the input value if the
12205 // resultant store does not need a higher alignment than the original.
12206 if (Value.getOpcode() == ISD::BITCAST && !ST->isTruncatingStore() &&
12207 ST->isUnindexed()) {
12208 EVT SVT = Value.getOperand(0).getValueType();
12209 if (((!LegalOperations && !ST->isVolatile()) ||
12210 TLI.isOperationLegalOrCustom(ISD::STORE, SVT)) &&
12211 TLI.isStoreBitCastBeneficial(Value.getValueType(), SVT)) {
12212 unsigned OrigAlign = ST->getAlignment();
12214 if (TLI.allowsMemoryAccess(*DAG.getContext(), DAG.getDataLayout(), SVT,
12215 ST->getAddressSpace(), OrigAlign, &Fast) &&
12217 return DAG.getStore(Chain, SDLoc(N), Value.getOperand(0), Ptr,
12218 ST->getPointerInfo(), OrigAlign,
12219 ST->getMemOperand()->getFlags(), ST->getAAInfo());
12224 // Turn 'store undef, Ptr' -> nothing.
12225 if (Value.isUndef() && ST->isUnindexed())
12228 // Try to infer better alignment information than the store already has.
12229 if (OptLevel != CodeGenOpt::None && ST->isUnindexed()) {
12230 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) {
12231 if (Align > ST->getAlignment()) {
12233 DAG.getTruncStore(Chain, SDLoc(N), Value, Ptr, ST->getPointerInfo(),
12234 ST->getMemoryVT(), Align,
12235 ST->getMemOperand()->getFlags(), ST->getAAInfo());
12236 if (NewStore.getNode() != N)
12237 return CombineTo(ST, NewStore, true);
12242 // Try transforming a pair floating point load / store ops to integer
12243 // load / store ops.
12244 if (SDValue NewST = TransformFPLoadStorePair(N))
12247 bool UseAA = CombinerAA.getNumOccurrences() > 0 ? CombinerAA
12248 : DAG.getSubtarget().useAA();
12250 if (CombinerAAOnlyFunc.getNumOccurrences() &&
12251 CombinerAAOnlyFunc != DAG.getMachineFunction().getName())
12254 if (UseAA && ST->isUnindexed()) {
12255 // FIXME: We should do this even without AA enabled. AA will just allow
12256 // FindBetterChain to work in more situations. The problem with this is that
12257 // any combine that expects memory operations to be on consecutive chains
12258 // first needs to be updated to look for users of the same chain.
12260 // Walk up chain skipping non-aliasing memory nodes, on this store and any
12261 // adjacent stores.
12262 if (findBetterNeighborChains(ST)) {
12263 // replaceStoreChain uses CombineTo, which handled all of the worklist
12264 // manipulation. Return the original node to not do anything else.
12265 return SDValue(ST, 0);
12267 Chain = ST->getChain();
12270 // Try transforming N to an indexed store.
12271 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N))
12272 return SDValue(N, 0);
12274 // FIXME: is there such a thing as a truncating indexed store?
12275 if (ST->isTruncatingStore() && ST->isUnindexed() &&
12276 Value.getValueType().isInteger()) {
12277 // See if we can simplify the input to this truncstore with knowledge that
12278 // only the low bits are being used. For example:
12279 // "truncstore (or (shl x, 8), y), i8" -> "truncstore y, i8"
12280 SDValue Shorter = GetDemandedBits(
12281 Value, APInt::getLowBitsSet(Value.getScalarValueSizeInBits(),
12282 ST->getMemoryVT().getScalarSizeInBits()));
12283 AddToWorklist(Value.getNode());
12284 if (Shorter.getNode())
12285 return DAG.getTruncStore(Chain, SDLoc(N), Shorter,
12286 Ptr, ST->getMemoryVT(), ST->getMemOperand());
12288 // Otherwise, see if we can simplify the operation with
12289 // SimplifyDemandedBits, which only works if the value has a single use.
12290 if (SimplifyDemandedBits(
12292 APInt::getLowBitsSet(Value.getScalarValueSizeInBits(),
12293 ST->getMemoryVT().getScalarSizeInBits())))
12294 return SDValue(N, 0);
12297 // If this is a load followed by a store to the same location, then the store
12299 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Value)) {
12300 if (Ld->getBasePtr() == Ptr && ST->getMemoryVT() == Ld->getMemoryVT() &&
12301 ST->isUnindexed() && !ST->isVolatile() &&
12302 // There can't be any side effects between the load and store, such as
12303 // a call or store.
12304 Chain.reachesChainWithoutSideEffects(SDValue(Ld, 1))) {
12305 // The store is dead, remove it.
12310 // If this is a store followed by a store with the same value to the same
12311 // location, then the store is dead/noop.
12312 if (StoreSDNode *ST1 = dyn_cast<StoreSDNode>(Chain)) {
12313 if (ST1->getBasePtr() == Ptr && ST->getMemoryVT() == ST1->getMemoryVT() &&
12314 ST1->getValue() == Value && ST->isUnindexed() && !ST->isVolatile() &&
12315 ST1->isUnindexed() && !ST1->isVolatile()) {
12316 // The store is dead, remove it.
12321 // If this is an FP_ROUND or TRUNC followed by a store, fold this into a
12322 // truncating store. We can do this even if this is already a truncstore.
12323 if ((Value.getOpcode() == ISD::FP_ROUND || Value.getOpcode() == ISD::TRUNCATE)
12324 && Value.getNode()->hasOneUse() && ST->isUnindexed() &&
12325 TLI.isTruncStoreLegal(Value.getOperand(0).getValueType(),
12326 ST->getMemoryVT())) {
12327 return DAG.getTruncStore(Chain, SDLoc(N), Value.getOperand(0),
12328 Ptr, ST->getMemoryVT(), ST->getMemOperand());
12331 // Only perform this optimization before the types are legal, because we
12332 // don't want to perform this optimization on every DAGCombine invocation.
12335 // There can be multiple store sequences on the same chain.
12336 // Keep trying to merge store sequences until we are unable to do so
12337 // or until we merge the last store on the chain.
12338 SmallVector<MemOpLink, 8> StoreNodes;
12339 bool Changed = MergeConsecutiveStores(ST, StoreNodes);
12340 if (!Changed) break;
12342 if (any_of(StoreNodes,
12343 [ST](const MemOpLink &Link) { return Link.MemNode == ST; })) {
12344 // ST has been merged and no longer exists.
12345 return SDValue(N, 0);
12350 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
12352 // Make sure to do this only after attempting to merge stores in order to
12353 // avoid changing the types of some subset of stores due to visit order,
12354 // preventing their merging.
12355 if (isa<ConstantFPSDNode>(Value)) {
12356 if (SDValue NewSt = replaceStoreOfFPConstant(ST))
12360 if (SDValue NewSt = splitMergedValStore(ST))
12363 return ReduceLoadOpStoreWidth(N);
12366 /// For the instruction sequence of store below, F and I values
12367 /// are bundled together as an i64 value before being stored into memory.
12368 /// Sometimes it is more efficent to generate separate stores for F and I,
12369 /// which can remove the bitwise instructions or sink them to colder places.
12371 /// (store (or (zext (bitcast F to i32) to i64),
12372 /// (shl (zext I to i64), 32)), addr) -->
12373 /// (store F, addr) and (store I, addr+4)
12375 /// Similarly, splitting for other merged store can also be beneficial, like:
12376 /// For pair of {i32, i32}, i64 store --> two i32 stores.
12377 /// For pair of {i32, i16}, i64 store --> two i32 stores.
12378 /// For pair of {i16, i16}, i32 store --> two i16 stores.
12379 /// For pair of {i16, i8}, i32 store --> two i16 stores.
12380 /// For pair of {i8, i8}, i16 store --> two i8 stores.
12382 /// We allow each target to determine specifically which kind of splitting is
12385 /// The store patterns are commonly seen from the simple code snippet below
12386 /// if only std::make_pair(...) is sroa transformed before inlined into hoo.
12387 /// void goo(const std::pair<int, float> &);
12390 /// goo(std::make_pair(tmp, ftmp));
12394 SDValue DAGCombiner::splitMergedValStore(StoreSDNode *ST) {
12395 if (OptLevel == CodeGenOpt::None)
12398 SDValue Val = ST->getValue();
12401 // Match OR operand.
12402 if (!Val.getValueType().isScalarInteger() || Val.getOpcode() != ISD::OR)
12405 // Match SHL operand and get Lower and Higher parts of Val.
12406 SDValue Op1 = Val.getOperand(0);
12407 SDValue Op2 = Val.getOperand(1);
12409 if (Op1.getOpcode() != ISD::SHL) {
12410 std::swap(Op1, Op2);
12411 if (Op1.getOpcode() != ISD::SHL)
12415 Hi = Op1.getOperand(0);
12416 if (!Op1.hasOneUse())
12419 // Match shift amount to HalfValBitSize.
12420 unsigned HalfValBitSize = Val.getValueSizeInBits() / 2;
12421 ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(Op1.getOperand(1));
12422 if (!ShAmt || ShAmt->getAPIntValue() != HalfValBitSize)
12425 // Lo and Hi are zero-extended from int with size less equal than 32
12427 if (Lo.getOpcode() != ISD::ZERO_EXTEND || !Lo.hasOneUse() ||
12428 !Lo.getOperand(0).getValueType().isScalarInteger() ||
12429 Lo.getOperand(0).getValueSizeInBits() > HalfValBitSize ||
12430 Hi.getOpcode() != ISD::ZERO_EXTEND || !Hi.hasOneUse() ||
12431 !Hi.getOperand(0).getValueType().isScalarInteger() ||
12432 Hi.getOperand(0).getValueSizeInBits() > HalfValBitSize)
12435 // Use the EVT of low and high parts before bitcast as the input
12436 // of target query.
12437 EVT LowTy = (Lo.getOperand(0).getOpcode() == ISD::BITCAST)
12438 ? Lo.getOperand(0).getValueType()
12439 : Lo.getValueType();
12440 EVT HighTy = (Hi.getOperand(0).getOpcode() == ISD::BITCAST)
12441 ? Hi.getOperand(0).getValueType()
12442 : Hi.getValueType();
12443 if (!TLI.isMultiStoresCheaperThanBitsMerge(LowTy, HighTy))
12446 // Start to split store.
12447 unsigned Alignment = ST->getAlignment();
12448 MachineMemOperand::Flags MMOFlags = ST->getMemOperand()->getFlags();
12449 AAMDNodes AAInfo = ST->getAAInfo();
12451 // Change the sizes of Lo and Hi's value types to HalfValBitSize.
12452 EVT VT = EVT::getIntegerVT(*DAG.getContext(), HalfValBitSize);
12453 Lo = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, Lo.getOperand(0));
12454 Hi = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, Hi.getOperand(0));
12456 SDValue Chain = ST->getChain();
12457 SDValue Ptr = ST->getBasePtr();
12458 // Lower value store.
12459 SDValue St0 = DAG.getStore(Chain, DL, Lo, Ptr, ST->getPointerInfo(),
12460 ST->getAlignment(), MMOFlags, AAInfo);
12462 DAG.getNode(ISD::ADD, DL, Ptr.getValueType(), Ptr,
12463 DAG.getConstant(HalfValBitSize / 8, DL, Ptr.getValueType()));
12464 // Higher value store.
12466 DAG.getStore(St0, DL, Hi, Ptr,
12467 ST->getPointerInfo().getWithOffset(HalfValBitSize / 8),
12468 Alignment / 2, MMOFlags, AAInfo);
12472 SDValue DAGCombiner::visitINSERT_VECTOR_ELT(SDNode *N) {
12473 SDValue InVec = N->getOperand(0);
12474 SDValue InVal = N->getOperand(1);
12475 SDValue EltNo = N->getOperand(2);
12478 // If the inserted element is an UNDEF, just use the input vector.
12479 if (InVal.isUndef())
12482 EVT VT = InVec.getValueType();
12484 // If we can't generate a legal BUILD_VECTOR, exit
12485 if (LegalOperations && !TLI.isOperationLegal(ISD::BUILD_VECTOR, VT))
12488 // Check that we know which element is being inserted
12489 if (!isa<ConstantSDNode>(EltNo))
12491 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
12493 // Canonicalize insert_vector_elt dag nodes.
12495 // (insert_vector_elt (insert_vector_elt A, Idx0), Idx1)
12496 // -> (insert_vector_elt (insert_vector_elt A, Idx1), Idx0)
12498 // Do this only if the child insert_vector node has one use; also
12499 // do this only if indices are both constants and Idx1 < Idx0.
12500 if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT && InVec.hasOneUse()
12501 && isa<ConstantSDNode>(InVec.getOperand(2))) {
12502 unsigned OtherElt =
12503 cast<ConstantSDNode>(InVec.getOperand(2))->getZExtValue();
12504 if (Elt < OtherElt) {
12506 SDValue NewOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, VT,
12507 InVec.getOperand(0), InVal, EltNo);
12508 AddToWorklist(NewOp.getNode());
12509 return DAG.getNode(ISD::INSERT_VECTOR_ELT, SDLoc(InVec.getNode()),
12510 VT, NewOp, InVec.getOperand(1), InVec.getOperand(2));
12514 // Check that the operand is a BUILD_VECTOR (or UNDEF, which can essentially
12515 // be converted to a BUILD_VECTOR). Fill in the Ops vector with the
12516 // vector elements.
12517 SmallVector<SDValue, 8> Ops;
12518 // Do not combine these two vectors if the output vector will not replace
12519 // the input vector.
12520 if (InVec.getOpcode() == ISD::BUILD_VECTOR && InVec.hasOneUse()) {
12521 Ops.append(InVec.getNode()->op_begin(),
12522 InVec.getNode()->op_end());
12523 } else if (InVec.isUndef()) {
12524 unsigned NElts = VT.getVectorNumElements();
12525 Ops.append(NElts, DAG.getUNDEF(InVal.getValueType()));
12530 // Insert the element
12531 if (Elt < Ops.size()) {
12532 // All the operands of BUILD_VECTOR must have the same type;
12533 // we enforce that here.
12534 EVT OpVT = Ops[0].getValueType();
12535 if (InVal.getValueType() != OpVT)
12536 InVal = OpVT.bitsGT(InVal.getValueType()) ?
12537 DAG.getNode(ISD::ANY_EXTEND, DL, OpVT, InVal) :
12538 DAG.getNode(ISD::TRUNCATE, DL, OpVT, InVal);
12542 // Return the new vector
12543 return DAG.getBuildVector(VT, DL, Ops);
12546 SDValue DAGCombiner::ReplaceExtractVectorEltOfLoadWithNarrowedLoad(
12547 SDNode *EVE, EVT InVecVT, SDValue EltNo, LoadSDNode *OriginalLoad) {
12548 assert(!OriginalLoad->isVolatile());
12550 EVT ResultVT = EVE->getValueType(0);
12551 EVT VecEltVT = InVecVT.getVectorElementType();
12552 unsigned Align = OriginalLoad->getAlignment();
12553 unsigned NewAlign = DAG.getDataLayout().getABITypeAlignment(
12554 VecEltVT.getTypeForEVT(*DAG.getContext()));
12556 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, VecEltVT))
12561 SDValue NewPtr = OriginalLoad->getBasePtr();
12563 EVT PtrType = NewPtr.getValueType();
12564 MachinePointerInfo MPI;
12566 if (auto *ConstEltNo = dyn_cast<ConstantSDNode>(EltNo)) {
12567 int Elt = ConstEltNo->getZExtValue();
12568 unsigned PtrOff = VecEltVT.getSizeInBits() * Elt / 8;
12569 Offset = DAG.getConstant(PtrOff, DL, PtrType);
12570 MPI = OriginalLoad->getPointerInfo().getWithOffset(PtrOff);
12572 Offset = DAG.getZExtOrTrunc(EltNo, DL, PtrType);
12573 Offset = DAG.getNode(
12574 ISD::MUL, DL, PtrType, Offset,
12575 DAG.getConstant(VecEltVT.getStoreSize(), DL, PtrType));
12576 MPI = OriginalLoad->getPointerInfo();
12578 NewPtr = DAG.getNode(ISD::ADD, DL, PtrType, NewPtr, Offset);
12580 // The replacement we need to do here is a little tricky: we need to
12581 // replace an extractelement of a load with a load.
12582 // Use ReplaceAllUsesOfValuesWith to do the replacement.
12583 // Note that this replacement assumes that the extractvalue is the only
12584 // use of the load; that's okay because we don't want to perform this
12585 // transformation in other cases anyway.
12588 if (ResultVT.bitsGT(VecEltVT)) {
12589 // If the result type of vextract is wider than the load, then issue an
12590 // extending load instead.
12591 ISD::LoadExtType ExtType = TLI.isLoadExtLegal(ISD::ZEXTLOAD, ResultVT,
12595 Load = DAG.getExtLoad(ExtType, SDLoc(EVE), ResultVT,
12596 OriginalLoad->getChain(), NewPtr, MPI, VecEltVT,
12597 Align, OriginalLoad->getMemOperand()->getFlags(),
12598 OriginalLoad->getAAInfo());
12599 Chain = Load.getValue(1);
12601 Load = DAG.getLoad(VecEltVT, SDLoc(EVE), OriginalLoad->getChain(), NewPtr,
12602 MPI, Align, OriginalLoad->getMemOperand()->getFlags(),
12603 OriginalLoad->getAAInfo());
12604 Chain = Load.getValue(1);
12605 if (ResultVT.bitsLT(VecEltVT))
12606 Load = DAG.getNode(ISD::TRUNCATE, SDLoc(EVE), ResultVT, Load);
12608 Load = DAG.getBitcast(ResultVT, Load);
12610 WorklistRemover DeadNodes(*this);
12611 SDValue From[] = { SDValue(EVE, 0), SDValue(OriginalLoad, 1) };
12612 SDValue To[] = { Load, Chain };
12613 DAG.ReplaceAllUsesOfValuesWith(From, To, 2);
12614 // Since we're explicitly calling ReplaceAllUses, add the new node to the
12615 // worklist explicitly as well.
12616 AddToWorklist(Load.getNode());
12617 AddUsersToWorklist(Load.getNode()); // Add users too
12618 // Make sure to revisit this node to clean it up; it will usually be dead.
12619 AddToWorklist(EVE);
12621 return SDValue(EVE, 0);
12624 SDValue DAGCombiner::visitEXTRACT_VECTOR_ELT(SDNode *N) {
12625 // (vextract (scalar_to_vector val, 0) -> val
12626 SDValue InVec = N->getOperand(0);
12627 EVT VT = InVec.getValueType();
12628 EVT NVT = N->getValueType(0);
12630 if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR) {
12631 // Check if the result type doesn't match the inserted element type. A
12632 // SCALAR_TO_VECTOR may truncate the inserted element and the
12633 // EXTRACT_VECTOR_ELT may widen the extracted vector.
12634 SDValue InOp = InVec.getOperand(0);
12635 if (InOp.getValueType() != NVT) {
12636 assert(InOp.getValueType().isInteger() && NVT.isInteger());
12637 return DAG.getSExtOrTrunc(InOp, SDLoc(InVec), NVT);
12642 SDValue EltNo = N->getOperand(1);
12643 ConstantSDNode *ConstEltNo = dyn_cast<ConstantSDNode>(EltNo);
12645 // extract_vector_elt (build_vector x, y), 1 -> y
12647 InVec.getOpcode() == ISD::BUILD_VECTOR &&
12648 TLI.isTypeLegal(VT) &&
12649 (InVec.hasOneUse() ||
12650 TLI.aggressivelyPreferBuildVectorSources(VT))) {
12651 SDValue Elt = InVec.getOperand(ConstEltNo->getZExtValue());
12652 EVT InEltVT = Elt.getValueType();
12654 // Sometimes build_vector's scalar input types do not match result type.
12655 if (NVT == InEltVT)
12658 // TODO: It may be useful to truncate if free if the build_vector implicitly
12662 // extract_vector_elt (v2i32 (bitcast i64:x)), 0 -> i32 (trunc i64:x)
12663 if (ConstEltNo && InVec.getOpcode() == ISD::BITCAST && InVec.hasOneUse() &&
12664 ConstEltNo->isNullValue() && VT.isInteger()) {
12665 SDValue BCSrc = InVec.getOperand(0);
12666 if (BCSrc.getValueType().isScalarInteger())
12667 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), NVT, BCSrc);
12670 // extract_vector_elt (insert_vector_elt vec, val, idx), idx) -> val
12672 // This only really matters if the index is non-constant since other combines
12673 // on the constant elements already work.
12674 if (InVec.getOpcode() == ISD::INSERT_VECTOR_ELT &&
12675 EltNo == InVec.getOperand(2)) {
12676 SDValue Elt = InVec.getOperand(1);
12677 return VT.isInteger() ? DAG.getAnyExtOrTrunc(Elt, SDLoc(N), NVT) : Elt;
12680 // Transform: (EXTRACT_VECTOR_ELT( VECTOR_SHUFFLE )) -> EXTRACT_VECTOR_ELT.
12681 // We only perform this optimization before the op legalization phase because
12682 // we may introduce new vector instructions which are not backed by TD
12683 // patterns. For example on AVX, extracting elements from a wide vector
12684 // without using extract_subvector. However, if we can find an underlying
12685 // scalar value, then we can always use that.
12686 if (ConstEltNo && InVec.getOpcode() == ISD::VECTOR_SHUFFLE) {
12687 int NumElem = VT.getVectorNumElements();
12688 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(InVec);
12689 // Find the new index to extract from.
12690 int OrigElt = SVOp->getMaskElt(ConstEltNo->getZExtValue());
12692 // Extracting an undef index is undef.
12694 return DAG.getUNDEF(NVT);
12696 // Select the right vector half to extract from.
12698 if (OrigElt < NumElem) {
12699 SVInVec = InVec->getOperand(0);
12701 SVInVec = InVec->getOperand(1);
12702 OrigElt -= NumElem;
12705 if (SVInVec.getOpcode() == ISD::BUILD_VECTOR) {
12706 SDValue InOp = SVInVec.getOperand(OrigElt);
12707 if (InOp.getValueType() != NVT) {
12708 assert(InOp.getValueType().isInteger() && NVT.isInteger());
12709 InOp = DAG.getSExtOrTrunc(InOp, SDLoc(SVInVec), NVT);
12715 // FIXME: We should handle recursing on other vector shuffles and
12716 // scalar_to_vector here as well.
12718 if (!LegalOperations) {
12719 EVT IndexTy = TLI.getVectorIdxTy(DAG.getDataLayout());
12720 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, SDLoc(N), NVT, SVInVec,
12721 DAG.getConstant(OrigElt, SDLoc(SVOp), IndexTy));
12725 bool BCNumEltsChanged = false;
12726 EVT ExtVT = VT.getVectorElementType();
12729 // If the result of load has to be truncated, then it's not necessarily
12731 if (NVT.bitsLT(LVT) && !TLI.isTruncateFree(LVT, NVT))
12734 if (InVec.getOpcode() == ISD::BITCAST) {
12735 // Don't duplicate a load with other uses.
12736 if (!InVec.hasOneUse())
12739 EVT BCVT = InVec.getOperand(0).getValueType();
12740 if (!BCVT.isVector() || ExtVT.bitsGT(BCVT.getVectorElementType()))
12742 if (VT.getVectorNumElements() != BCVT.getVectorNumElements())
12743 BCNumEltsChanged = true;
12744 InVec = InVec.getOperand(0);
12745 ExtVT = BCVT.getVectorElementType();
12748 // (vextract (vN[if]M load $addr), i) -> ([if]M load $addr + i * size)
12749 if (!LegalOperations && !ConstEltNo && InVec.hasOneUse() &&
12750 ISD::isNormalLoad(InVec.getNode()) &&
12751 !N->getOperand(1)->hasPredecessor(InVec.getNode())) {
12752 SDValue Index = N->getOperand(1);
12753 if (LoadSDNode *OrigLoad = dyn_cast<LoadSDNode>(InVec)) {
12754 if (!OrigLoad->isVolatile()) {
12755 return ReplaceExtractVectorEltOfLoadWithNarrowedLoad(N, VT, Index,
12761 // Perform only after legalization to ensure build_vector / vector_shuffle
12762 // optimizations have already been done.
12763 if (!LegalOperations) return SDValue();
12765 // (vextract (v4f32 load $addr), c) -> (f32 load $addr+c*size)
12766 // (vextract (v4f32 s2v (f32 load $addr)), c) -> (f32 load $addr+c*size)
12767 // (vextract (v4f32 shuffle (load $addr), <1,u,u,u>), 0) -> (f32 load $addr)
12770 int Elt = cast<ConstantSDNode>(EltNo)->getZExtValue();
12772 LoadSDNode *LN0 = nullptr;
12773 const ShuffleVectorSDNode *SVN = nullptr;
12774 if (ISD::isNormalLoad(InVec.getNode())) {
12775 LN0 = cast<LoadSDNode>(InVec);
12776 } else if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR &&
12777 InVec.getOperand(0).getValueType() == ExtVT &&
12778 ISD::isNormalLoad(InVec.getOperand(0).getNode())) {
12779 // Don't duplicate a load with other uses.
12780 if (!InVec.hasOneUse())
12783 LN0 = cast<LoadSDNode>(InVec.getOperand(0));
12784 } else if ((SVN = dyn_cast<ShuffleVectorSDNode>(InVec))) {
12785 // (vextract (vector_shuffle (load $addr), v2, <1, u, u, u>), 1)
12787 // (load $addr+1*size)
12789 // Don't duplicate a load with other uses.
12790 if (!InVec.hasOneUse())
12793 // If the bit convert changed the number of elements, it is unsafe
12794 // to examine the mask.
12795 if (BCNumEltsChanged)
12798 // Select the input vector, guarding against out of range extract vector.
12799 unsigned NumElems = VT.getVectorNumElements();
12800 int Idx = (Elt > (int)NumElems) ? -1 : SVN->getMaskElt(Elt);
12801 InVec = (Idx < (int)NumElems) ? InVec.getOperand(0) : InVec.getOperand(1);
12803 if (InVec.getOpcode() == ISD::BITCAST) {
12804 // Don't duplicate a load with other uses.
12805 if (!InVec.hasOneUse())
12808 InVec = InVec.getOperand(0);
12810 if (ISD::isNormalLoad(InVec.getNode())) {
12811 LN0 = cast<LoadSDNode>(InVec);
12812 Elt = (Idx < (int)NumElems) ? Idx : Idx - (int)NumElems;
12813 EltNo = DAG.getConstant(Elt, SDLoc(EltNo), EltNo.getValueType());
12817 // Make sure we found a non-volatile load and the extractelement is
12819 if (!LN0 || !LN0->hasNUsesOfValue(1,0) || LN0->isVolatile())
12822 // If Idx was -1 above, Elt is going to be -1, so just return undef.
12824 return DAG.getUNDEF(LVT);
12826 return ReplaceExtractVectorEltOfLoadWithNarrowedLoad(N, VT, EltNo, LN0);
12832 // Simplify (build_vec (ext )) to (bitcast (build_vec ))
12833 SDValue DAGCombiner::reduceBuildVecExtToExtBuildVec(SDNode *N) {
12834 // We perform this optimization post type-legalization because
12835 // the type-legalizer often scalarizes integer-promoted vectors.
12836 // Performing this optimization before may create bit-casts which
12837 // will be type-legalized to complex code sequences.
12838 // We perform this optimization only before the operation legalizer because we
12839 // may introduce illegal operations.
12840 if (Level != AfterLegalizeVectorOps && Level != AfterLegalizeTypes)
12843 unsigned NumInScalars = N->getNumOperands();
12845 EVT VT = N->getValueType(0);
12847 // Check to see if this is a BUILD_VECTOR of a bunch of values
12848 // which come from any_extend or zero_extend nodes. If so, we can create
12849 // a new BUILD_VECTOR using bit-casts which may enable other BUILD_VECTOR
12850 // optimizations. We do not handle sign-extend because we can't fill the sign
12852 EVT SourceType = MVT::Other;
12853 bool AllAnyExt = true;
12855 for (unsigned i = 0; i != NumInScalars; ++i) {
12856 SDValue In = N->getOperand(i);
12857 // Ignore undef inputs.
12858 if (In.isUndef()) continue;
12860 bool AnyExt = In.getOpcode() == ISD::ANY_EXTEND;
12861 bool ZeroExt = In.getOpcode() == ISD::ZERO_EXTEND;
12863 // Abort if the element is not an extension.
12864 if (!ZeroExt && !AnyExt) {
12865 SourceType = MVT::Other;
12869 // The input is a ZeroExt or AnyExt. Check the original type.
12870 EVT InTy = In.getOperand(0).getValueType();
12872 // Check that all of the widened source types are the same.
12873 if (SourceType == MVT::Other)
12876 else if (InTy != SourceType) {
12877 // Multiple income types. Abort.
12878 SourceType = MVT::Other;
12882 // Check if all of the extends are ANY_EXTENDs.
12883 AllAnyExt &= AnyExt;
12886 // In order to have valid types, all of the inputs must be extended from the
12887 // same source type and all of the inputs must be any or zero extend.
12888 // Scalar sizes must be a power of two.
12889 EVT OutScalarTy = VT.getScalarType();
12890 bool ValidTypes = SourceType != MVT::Other &&
12891 isPowerOf2_32(OutScalarTy.getSizeInBits()) &&
12892 isPowerOf2_32(SourceType.getSizeInBits());
12894 // Create a new simpler BUILD_VECTOR sequence which other optimizations can
12895 // turn into a single shuffle instruction.
12899 bool isLE = DAG.getDataLayout().isLittleEndian();
12900 unsigned ElemRatio = OutScalarTy.getSizeInBits()/SourceType.getSizeInBits();
12901 assert(ElemRatio > 1 && "Invalid element size ratio");
12902 SDValue Filler = AllAnyExt ? DAG.getUNDEF(SourceType):
12903 DAG.getConstant(0, DL, SourceType);
12905 unsigned NewBVElems = ElemRatio * VT.getVectorNumElements();
12906 SmallVector<SDValue, 8> Ops(NewBVElems, Filler);
12908 // Populate the new build_vector
12909 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
12910 SDValue Cast = N->getOperand(i);
12911 assert((Cast.getOpcode() == ISD::ANY_EXTEND ||
12912 Cast.getOpcode() == ISD::ZERO_EXTEND ||
12913 Cast.isUndef()) && "Invalid cast opcode");
12915 if (Cast.isUndef())
12916 In = DAG.getUNDEF(SourceType);
12918 In = Cast->getOperand(0);
12919 unsigned Index = isLE ? (i * ElemRatio) :
12920 (i * ElemRatio + (ElemRatio - 1));
12922 assert(Index < Ops.size() && "Invalid index");
12926 // The type of the new BUILD_VECTOR node.
12927 EVT VecVT = EVT::getVectorVT(*DAG.getContext(), SourceType, NewBVElems);
12928 assert(VecVT.getSizeInBits() == VT.getSizeInBits() &&
12929 "Invalid vector size");
12930 // Check if the new vector type is legal.
12931 if (!isTypeLegal(VecVT)) return SDValue();
12933 // Make the new BUILD_VECTOR.
12934 SDValue BV = DAG.getBuildVector(VecVT, DL, Ops);
12936 // The new BUILD_VECTOR node has the potential to be further optimized.
12937 AddToWorklist(BV.getNode());
12938 // Bitcast to the desired type.
12939 return DAG.getBitcast(VT, BV);
12942 SDValue DAGCombiner::reduceBuildVecConvertToConvertBuildVec(SDNode *N) {
12943 EVT VT = N->getValueType(0);
12945 unsigned NumInScalars = N->getNumOperands();
12948 EVT SrcVT = MVT::Other;
12949 unsigned Opcode = ISD::DELETED_NODE;
12950 unsigned NumDefs = 0;
12952 for (unsigned i = 0; i != NumInScalars; ++i) {
12953 SDValue In = N->getOperand(i);
12954 unsigned Opc = In.getOpcode();
12956 if (Opc == ISD::UNDEF)
12959 // If all scalar values are floats and converted from integers.
12960 if (Opcode == ISD::DELETED_NODE &&
12961 (Opc == ISD::UINT_TO_FP || Opc == ISD::SINT_TO_FP)) {
12968 EVT InVT = In.getOperand(0).getValueType();
12970 // If all scalar values are typed differently, bail out. It's chosen to
12971 // simplify BUILD_VECTOR of integer types.
12972 if (SrcVT == MVT::Other)
12979 // If the vector has just one element defined, it's not worth to fold it into
12980 // a vectorized one.
12984 assert((Opcode == ISD::UINT_TO_FP || Opcode == ISD::SINT_TO_FP)
12985 && "Should only handle conversion from integer to float.");
12986 assert(SrcVT != MVT::Other && "Cannot determine source type!");
12988 EVT NVT = EVT::getVectorVT(*DAG.getContext(), SrcVT, NumInScalars);
12990 if (!TLI.isOperationLegalOrCustom(Opcode, NVT))
12993 // Just because the floating-point vector type is legal does not necessarily
12994 // mean that the corresponding integer vector type is.
12995 if (!isTypeLegal(NVT))
12998 SmallVector<SDValue, 8> Opnds;
12999 for (unsigned i = 0; i != NumInScalars; ++i) {
13000 SDValue In = N->getOperand(i);
13003 Opnds.push_back(DAG.getUNDEF(SrcVT));
13005 Opnds.push_back(In.getOperand(0));
13007 SDValue BV = DAG.getBuildVector(NVT, DL, Opnds);
13008 AddToWorklist(BV.getNode());
13010 return DAG.getNode(Opcode, DL, VT, BV);
13013 SDValue DAGCombiner::createBuildVecShuffle(SDLoc DL, SDNode *N,
13014 ArrayRef<int> VectorMask,
13015 SDValue VecIn1, SDValue VecIn2,
13016 unsigned LeftIdx) {
13017 MVT IdxTy = TLI.getVectorIdxTy(DAG.getDataLayout());
13018 SDValue ZeroIdx = DAG.getConstant(0, DL, IdxTy);
13020 EVT VT = N->getValueType(0);
13021 EVT InVT1 = VecIn1.getValueType();
13022 EVT InVT2 = VecIn2.getNode() ? VecIn2.getValueType() : InVT1;
13024 unsigned Vec2Offset = InVT1.getVectorNumElements();
13025 unsigned NumElems = VT.getVectorNumElements();
13026 unsigned ShuffleNumElems = NumElems;
13028 // We can't generate a shuffle node with mismatched input and output types.
13029 // Try to make the types match the type of the output.
13030 if (InVT1 != VT || InVT2 != VT) {
13031 if ((VT.getSizeInBits() % InVT1.getSizeInBits() == 0) && InVT1 == InVT2) {
13032 // If the output vector length is a multiple of both input lengths,
13033 // we can concatenate them and pad the rest with undefs.
13034 unsigned NumConcats = VT.getSizeInBits() / InVT1.getSizeInBits();
13035 assert(NumConcats >= 2 && "Concat needs at least two inputs!");
13036 SmallVector<SDValue, 2> ConcatOps(NumConcats, DAG.getUNDEF(InVT1));
13037 ConcatOps[0] = VecIn1;
13038 ConcatOps[1] = VecIn2 ? VecIn2 : DAG.getUNDEF(InVT1);
13039 VecIn1 = DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, ConcatOps);
13040 VecIn2 = SDValue();
13041 } else if (InVT1.getSizeInBits() == VT.getSizeInBits() * 2) {
13042 if (!TLI.isExtractSubvectorCheap(VT, NumElems))
13045 if (!VecIn2.getNode()) {
13046 // If we only have one input vector, and it's twice the size of the
13047 // output, split it in two.
13048 VecIn2 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, VecIn1,
13049 DAG.getConstant(NumElems, DL, IdxTy));
13050 VecIn1 = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, VecIn1, ZeroIdx);
13051 // Since we now have shorter input vectors, adjust the offset of the
13052 // second vector's start.
13053 Vec2Offset = NumElems;
13054 } else if (InVT2.getSizeInBits() <= InVT1.getSizeInBits()) {
13055 // VecIn1 is wider than the output, and we have another, possibly
13056 // smaller input. Pad the smaller input with undefs, shuffle at the
13057 // input vector width, and extract the output.
13058 // The shuffle type is different than VT, so check legality again.
13059 if (LegalOperations &&
13060 !TLI.isOperationLegal(ISD::VECTOR_SHUFFLE, InVT1))
13063 if (InVT1 != InVT2)
13064 VecIn2 = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, InVT1,
13065 DAG.getUNDEF(InVT1), VecIn2, ZeroIdx);
13066 ShuffleNumElems = NumElems * 2;
13068 // Both VecIn1 and VecIn2 are wider than the output, and VecIn2 is wider
13069 // than VecIn1. We can't handle this for now - this case will disappear
13070 // when we start sorting the vectors by type.
13074 // TODO: Support cases where the length mismatch isn't exactly by a
13076 // TODO: Move this check upwards, so that if we have bad type
13077 // mismatches, we don't create any DAG nodes.
13082 // Initialize mask to undef.
13083 SmallVector<int, 8> Mask(ShuffleNumElems, -1);
13085 // Only need to run up to the number of elements actually used, not the
13086 // total number of elements in the shuffle - if we are shuffling a wider
13087 // vector, the high lanes should be set to undef.
13088 for (unsigned i = 0; i != NumElems; ++i) {
13089 if (VectorMask[i] <= 0)
13092 unsigned ExtIndex = N->getOperand(i).getConstantOperandVal(1);
13093 if (VectorMask[i] == (int)LeftIdx) {
13094 Mask[i] = ExtIndex;
13095 } else if (VectorMask[i] == (int)LeftIdx + 1) {
13096 Mask[i] = Vec2Offset + ExtIndex;
13100 // The type the input vectors may have changed above.
13101 InVT1 = VecIn1.getValueType();
13103 // If we already have a VecIn2, it should have the same type as VecIn1.
13104 // If we don't, get an undef/zero vector of the appropriate type.
13105 VecIn2 = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(InVT1);
13106 assert(InVT1 == VecIn2.getValueType() && "Unexpected second input type.");
13108 SDValue Shuffle = DAG.getVectorShuffle(InVT1, DL, VecIn1, VecIn2, Mask);
13109 if (ShuffleNumElems > NumElems)
13110 Shuffle = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, VT, Shuffle, ZeroIdx);
13115 // Check to see if this is a BUILD_VECTOR of a bunch of EXTRACT_VECTOR_ELT
13116 // operations. If the types of the vectors we're extracting from allow it,
13117 // turn this into a vector_shuffle node.
13118 SDValue DAGCombiner::reduceBuildVecToShuffle(SDNode *N) {
13120 EVT VT = N->getValueType(0);
13122 // Only type-legal BUILD_VECTOR nodes are converted to shuffle nodes.
13123 if (!isTypeLegal(VT))
13126 // May only combine to shuffle after legalize if shuffle is legal.
13127 if (LegalOperations && !TLI.isOperationLegal(ISD::VECTOR_SHUFFLE, VT))
13130 bool UsesZeroVector = false;
13131 unsigned NumElems = N->getNumOperands();
13133 // Record, for each element of the newly built vector, which input vector
13134 // that element comes from. -1 stands for undef, 0 for the zero vector,
13135 // and positive values for the input vectors.
13136 // VectorMask maps each element to its vector number, and VecIn maps vector
13137 // numbers to their initial SDValues.
13139 SmallVector<int, 8> VectorMask(NumElems, -1);
13140 SmallVector<SDValue, 8> VecIn;
13141 VecIn.push_back(SDValue());
13143 for (unsigned i = 0; i != NumElems; ++i) {
13144 SDValue Op = N->getOperand(i);
13149 // See if we can use a blend with a zero vector.
13150 // TODO: Should we generalize this to a blend with an arbitrary constant
13152 if (isNullConstant(Op) || isNullFPConstant(Op)) {
13153 UsesZeroVector = true;
13158 // Not an undef or zero. If the input is something other than an
13159 // EXTRACT_VECTOR_ELT with a constant index, bail out.
13160 if (Op.getOpcode() != ISD::EXTRACT_VECTOR_ELT ||
13161 !isa<ConstantSDNode>(Op.getOperand(1)))
13164 SDValue ExtractedFromVec = Op.getOperand(0);
13166 // All inputs must have the same element type as the output.
13167 if (VT.getVectorElementType() !=
13168 ExtractedFromVec.getValueType().getVectorElementType())
13171 // Have we seen this input vector before?
13172 // The vectors are expected to be tiny (usually 1 or 2 elements), so using
13173 // a map back from SDValues to numbers isn't worth it.
13174 unsigned Idx = std::distance(
13175 VecIn.begin(), std::find(VecIn.begin(), VecIn.end(), ExtractedFromVec));
13176 if (Idx == VecIn.size())
13177 VecIn.push_back(ExtractedFromVec);
13179 VectorMask[i] = Idx;
13182 // If we didn't find at least one input vector, bail out.
13183 if (VecIn.size() < 2)
13186 // TODO: We want to sort the vectors by descending length, so that adjacent
13187 // pairs have similar length, and the longer vector is always first in the
13190 // TODO: Should this fire if some of the input vectors has illegal type (like
13191 // it does now), or should we let legalization run its course first?
13194 // Take pairs of vectors, and shuffle them so that the result has elements
13195 // from these vectors in the correct places.
13196 // For example, given:
13197 // t10: i32 = extract_vector_elt t1, Constant:i64<0>
13198 // t11: i32 = extract_vector_elt t2, Constant:i64<0>
13199 // t12: i32 = extract_vector_elt t3, Constant:i64<0>
13200 // t13: i32 = extract_vector_elt t1, Constant:i64<1>
13201 // t14: v4i32 = BUILD_VECTOR t10, t11, t12, t13
13202 // We will generate:
13203 // t20: v4i32 = vector_shuffle<0,4,u,1> t1, t2
13204 // t21: v4i32 = vector_shuffle<u,u,0,u> t3, undef
13205 SmallVector<SDValue, 4> Shuffles;
13206 for (unsigned In = 0, Len = (VecIn.size() / 2); In < Len; ++In) {
13207 unsigned LeftIdx = 2 * In + 1;
13208 SDValue VecLeft = VecIn[LeftIdx];
13210 (LeftIdx + 1) < VecIn.size() ? VecIn[LeftIdx + 1] : SDValue();
13212 if (SDValue Shuffle = createBuildVecShuffle(DL, N, VectorMask, VecLeft,
13213 VecRight, LeftIdx))
13214 Shuffles.push_back(Shuffle);
13219 // If we need the zero vector as an "ingredient" in the blend tree, add it
13220 // to the list of shuffles.
13221 if (UsesZeroVector)
13222 Shuffles.push_back(VT.isInteger() ? DAG.getConstant(0, DL, VT)
13223 : DAG.getConstantFP(0.0, DL, VT));
13225 // If we only have one shuffle, we're done.
13226 if (Shuffles.size() == 1)
13227 return Shuffles[0];
13229 // Update the vector mask to point to the post-shuffle vectors.
13230 for (int &Vec : VectorMask)
13232 Vec = Shuffles.size() - 1;
13234 Vec = (Vec - 1) / 2;
13236 // More than one shuffle. Generate a binary tree of blends, e.g. if from
13237 // the previous step we got the set of shuffles t10, t11, t12, t13, we will
13239 // t10: v8i32 = vector_shuffle<0,8,u,u,u,u,u,u> t1, t2
13240 // t11: v8i32 = vector_shuffle<u,u,0,8,u,u,u,u> t3, t4
13241 // t12: v8i32 = vector_shuffle<u,u,u,u,0,8,u,u> t5, t6
13242 // t13: v8i32 = vector_shuffle<u,u,u,u,u,u,0,8> t7, t8
13243 // t20: v8i32 = vector_shuffle<0,1,10,11,u,u,u,u> t10, t11
13244 // t21: v8i32 = vector_shuffle<u,u,u,u,4,5,14,15> t12, t13
13245 // t30: v8i32 = vector_shuffle<0,1,2,3,12,13,14,15> t20, t21
13247 // Make sure the initial size of the shuffle list is even.
13248 if (Shuffles.size() % 2)
13249 Shuffles.push_back(DAG.getUNDEF(VT));
13251 for (unsigned CurSize = Shuffles.size(); CurSize > 1; CurSize /= 2) {
13253 Shuffles[CurSize] = DAG.getUNDEF(VT);
13256 for (unsigned In = 0, Len = CurSize / 2; In < Len; ++In) {
13258 int Right = 2 * In + 1;
13259 SmallVector<int, 8> Mask(NumElems, -1);
13260 for (unsigned i = 0; i != NumElems; ++i) {
13261 if (VectorMask[i] == Left) {
13263 VectorMask[i] = In;
13264 } else if (VectorMask[i] == Right) {
13265 Mask[i] = i + NumElems;
13266 VectorMask[i] = In;
13271 DAG.getVectorShuffle(VT, DL, Shuffles[Left], Shuffles[Right], Mask);
13275 return Shuffles[0];
13278 SDValue DAGCombiner::visitBUILD_VECTOR(SDNode *N) {
13279 EVT VT = N->getValueType(0);
13281 // A vector built entirely of undefs is undef.
13282 if (ISD::allOperandsUndef(N))
13283 return DAG.getUNDEF(VT);
13285 if (SDValue V = reduceBuildVecExtToExtBuildVec(N))
13288 if (SDValue V = reduceBuildVecConvertToConvertBuildVec(N))
13291 if (SDValue V = reduceBuildVecToShuffle(N))
13297 static SDValue combineConcatVectorOfScalars(SDNode *N, SelectionDAG &DAG) {
13298 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
13299 EVT OpVT = N->getOperand(0).getValueType();
13301 // If the operands are legal vectors, leave them alone.
13302 if (TLI.isTypeLegal(OpVT))
13306 EVT VT = N->getValueType(0);
13307 SmallVector<SDValue, 8> Ops;
13309 EVT SVT = EVT::getIntegerVT(*DAG.getContext(), OpVT.getSizeInBits());
13310 SDValue ScalarUndef = DAG.getNode(ISD::UNDEF, DL, SVT);
13312 // Keep track of what we encounter.
13313 bool AnyInteger = false;
13314 bool AnyFP = false;
13315 for (const SDValue &Op : N->ops()) {
13316 if (ISD::BITCAST == Op.getOpcode() &&
13317 !Op.getOperand(0).getValueType().isVector())
13318 Ops.push_back(Op.getOperand(0));
13319 else if (ISD::UNDEF == Op.getOpcode())
13320 Ops.push_back(ScalarUndef);
13324 // Note whether we encounter an integer or floating point scalar.
13325 // If it's neither, bail out, it could be something weird like x86mmx.
13326 EVT LastOpVT = Ops.back().getValueType();
13327 if (LastOpVT.isFloatingPoint())
13329 else if (LastOpVT.isInteger())
13335 // If any of the operands is a floating point scalar bitcast to a vector,
13336 // use floating point types throughout, and bitcast everything.
13337 // Replace UNDEFs by another scalar UNDEF node, of the final desired type.
13339 SVT = EVT::getFloatingPointVT(OpVT.getSizeInBits());
13340 ScalarUndef = DAG.getNode(ISD::UNDEF, DL, SVT);
13342 for (SDValue &Op : Ops) {
13343 if (Op.getValueType() == SVT)
13348 Op = DAG.getBitcast(SVT, Op);
13353 EVT VecVT = EVT::getVectorVT(*DAG.getContext(), SVT,
13354 VT.getSizeInBits() / SVT.getSizeInBits());
13355 return DAG.getBitcast(VT, DAG.getBuildVector(VecVT, DL, Ops));
13358 // Check to see if this is a CONCAT_VECTORS of a bunch of EXTRACT_SUBVECTOR
13359 // operations. If so, and if the EXTRACT_SUBVECTOR vector inputs come from at
13360 // most two distinct vectors the same size as the result, attempt to turn this
13361 // into a legal shuffle.
13362 static SDValue combineConcatVectorOfExtracts(SDNode *N, SelectionDAG &DAG) {
13363 EVT VT = N->getValueType(0);
13364 EVT OpVT = N->getOperand(0).getValueType();
13365 int NumElts = VT.getVectorNumElements();
13366 int NumOpElts = OpVT.getVectorNumElements();
13368 SDValue SV0 = DAG.getUNDEF(VT), SV1 = DAG.getUNDEF(VT);
13369 SmallVector<int, 8> Mask;
13371 for (SDValue Op : N->ops()) {
13372 // Peek through any bitcast.
13373 while (Op.getOpcode() == ISD::BITCAST)
13374 Op = Op.getOperand(0);
13376 // UNDEF nodes convert to UNDEF shuffle mask values.
13377 if (Op.isUndef()) {
13378 Mask.append((unsigned)NumOpElts, -1);
13382 if (Op.getOpcode() != ISD::EXTRACT_SUBVECTOR)
13385 // What vector are we extracting the subvector from and at what index?
13386 SDValue ExtVec = Op.getOperand(0);
13388 // We want the EVT of the original extraction to correctly scale the
13389 // extraction index.
13390 EVT ExtVT = ExtVec.getValueType();
13392 // Peek through any bitcast.
13393 while (ExtVec.getOpcode() == ISD::BITCAST)
13394 ExtVec = ExtVec.getOperand(0);
13396 // UNDEF nodes convert to UNDEF shuffle mask values.
13397 if (ExtVec.isUndef()) {
13398 Mask.append((unsigned)NumOpElts, -1);
13402 if (!isa<ConstantSDNode>(Op.getOperand(1)))
13404 int ExtIdx = cast<ConstantSDNode>(Op.getOperand(1))->getZExtValue();
13406 // Ensure that we are extracting a subvector from a vector the same
13407 // size as the result.
13408 if (ExtVT.getSizeInBits() != VT.getSizeInBits())
13411 // Scale the subvector index to account for any bitcast.
13412 int NumExtElts = ExtVT.getVectorNumElements();
13413 if (0 == (NumExtElts % NumElts))
13414 ExtIdx /= (NumExtElts / NumElts);
13415 else if (0 == (NumElts % NumExtElts))
13416 ExtIdx *= (NumElts / NumExtElts);
13420 // At most we can reference 2 inputs in the final shuffle.
13421 if (SV0.isUndef() || SV0 == ExtVec) {
13423 for (int i = 0; i != NumOpElts; ++i)
13424 Mask.push_back(i + ExtIdx);
13425 } else if (SV1.isUndef() || SV1 == ExtVec) {
13427 for (int i = 0; i != NumOpElts; ++i)
13428 Mask.push_back(i + ExtIdx + NumElts);
13434 if (!DAG.getTargetLoweringInfo().isShuffleMaskLegal(Mask, VT))
13437 return DAG.getVectorShuffle(VT, SDLoc(N), DAG.getBitcast(VT, SV0),
13438 DAG.getBitcast(VT, SV1), Mask);
13441 SDValue DAGCombiner::visitCONCAT_VECTORS(SDNode *N) {
13442 // If we only have one input vector, we don't need to do any concatenation.
13443 if (N->getNumOperands() == 1)
13444 return N->getOperand(0);
13446 // Check if all of the operands are undefs.
13447 EVT VT = N->getValueType(0);
13448 if (ISD::allOperandsUndef(N))
13449 return DAG.getUNDEF(VT);
13451 // Optimize concat_vectors where all but the first of the vectors are undef.
13452 if (std::all_of(std::next(N->op_begin()), N->op_end(), [](const SDValue &Op) {
13453 return Op.isUndef();
13455 SDValue In = N->getOperand(0);
13456 assert(In.getValueType().isVector() && "Must concat vectors");
13458 // Transform: concat_vectors(scalar, undef) -> scalar_to_vector(sclr).
13459 if (In->getOpcode() == ISD::BITCAST &&
13460 !In->getOperand(0)->getValueType(0).isVector()) {
13461 SDValue Scalar = In->getOperand(0);
13463 // If the bitcast type isn't legal, it might be a trunc of a legal type;
13464 // look through the trunc so we can still do the transform:
13465 // concat_vectors(trunc(scalar), undef) -> scalar_to_vector(scalar)
13466 if (Scalar->getOpcode() == ISD::TRUNCATE &&
13467 !TLI.isTypeLegal(Scalar.getValueType()) &&
13468 TLI.isTypeLegal(Scalar->getOperand(0).getValueType()))
13469 Scalar = Scalar->getOperand(0);
13471 EVT SclTy = Scalar->getValueType(0);
13473 if (!SclTy.isFloatingPoint() && !SclTy.isInteger())
13476 EVT NVT = EVT::getVectorVT(*DAG.getContext(), SclTy,
13477 VT.getSizeInBits() / SclTy.getSizeInBits());
13478 if (!TLI.isTypeLegal(NVT) || !TLI.isTypeLegal(Scalar.getValueType()))
13481 SDValue Res = DAG.getNode(ISD::SCALAR_TO_VECTOR, SDLoc(N), NVT, Scalar);
13482 return DAG.getBitcast(VT, Res);
13486 // Fold any combination of BUILD_VECTOR or UNDEF nodes into one BUILD_VECTOR.
13487 // We have already tested above for an UNDEF only concatenation.
13488 // fold (concat_vectors (BUILD_VECTOR A, B, ...), (BUILD_VECTOR C, D, ...))
13489 // -> (BUILD_VECTOR A, B, ..., C, D, ...)
13490 auto IsBuildVectorOrUndef = [](const SDValue &Op) {
13491 return ISD::UNDEF == Op.getOpcode() || ISD::BUILD_VECTOR == Op.getOpcode();
13493 if (llvm::all_of(N->ops(), IsBuildVectorOrUndef)) {
13494 SmallVector<SDValue, 8> Opnds;
13495 EVT SVT = VT.getScalarType();
13498 if (!SVT.isFloatingPoint()) {
13499 // If BUILD_VECTOR are from built from integer, they may have different
13500 // operand types. Get the smallest type and truncate all operands to it.
13501 bool FoundMinVT = false;
13502 for (const SDValue &Op : N->ops())
13503 if (ISD::BUILD_VECTOR == Op.getOpcode()) {
13504 EVT OpSVT = Op.getOperand(0)->getValueType(0);
13505 MinVT = (!FoundMinVT || OpSVT.bitsLE(MinVT)) ? OpSVT : MinVT;
13508 assert(FoundMinVT && "Concat vector type mismatch");
13511 for (const SDValue &Op : N->ops()) {
13512 EVT OpVT = Op.getValueType();
13513 unsigned NumElts = OpVT.getVectorNumElements();
13515 if (ISD::UNDEF == Op.getOpcode())
13516 Opnds.append(NumElts, DAG.getUNDEF(MinVT));
13518 if (ISD::BUILD_VECTOR == Op.getOpcode()) {
13519 if (SVT.isFloatingPoint()) {
13520 assert(SVT == OpVT.getScalarType() && "Concat vector type mismatch");
13521 Opnds.append(Op->op_begin(), Op->op_begin() + NumElts);
13523 for (unsigned i = 0; i != NumElts; ++i)
13525 DAG.getNode(ISD::TRUNCATE, SDLoc(N), MinVT, Op.getOperand(i)));
13530 assert(VT.getVectorNumElements() == Opnds.size() &&
13531 "Concat vector type mismatch");
13532 return DAG.getBuildVector(VT, SDLoc(N), Opnds);
13535 // Fold CONCAT_VECTORS of only bitcast scalars (or undef) to BUILD_VECTOR.
13536 if (SDValue V = combineConcatVectorOfScalars(N, DAG))
13539 // Fold CONCAT_VECTORS of EXTRACT_SUBVECTOR (or undef) to VECTOR_SHUFFLE.
13540 if (Level < AfterLegalizeVectorOps && TLI.isTypeLegal(VT))
13541 if (SDValue V = combineConcatVectorOfExtracts(N, DAG))
13544 // Type legalization of vectors and DAG canonicalization of SHUFFLE_VECTOR
13545 // nodes often generate nop CONCAT_VECTOR nodes.
13546 // Scan the CONCAT_VECTOR operands and look for a CONCAT operations that
13547 // place the incoming vectors at the exact same location.
13548 SDValue SingleSource = SDValue();
13549 unsigned PartNumElem = N->getOperand(0).getValueType().getVectorNumElements();
13551 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
13552 SDValue Op = N->getOperand(i);
13557 // Check if this is the identity extract:
13558 if (Op.getOpcode() != ISD::EXTRACT_SUBVECTOR)
13561 // Find the single incoming vector for the extract_subvector.
13562 if (SingleSource.getNode()) {
13563 if (Op.getOperand(0) != SingleSource)
13566 SingleSource = Op.getOperand(0);
13568 // Check the source type is the same as the type of the result.
13569 // If not, this concat may extend the vector, so we can not
13570 // optimize it away.
13571 if (SingleSource.getValueType() != N->getValueType(0))
13575 unsigned IdentityIndex = i * PartNumElem;
13576 ConstantSDNode *CS = dyn_cast<ConstantSDNode>(Op.getOperand(1));
13577 // The extract index must be constant.
13581 // Check that we are reading from the identity index.
13582 if (CS->getZExtValue() != IdentityIndex)
13586 if (SingleSource.getNode())
13587 return SingleSource;
13592 SDValue DAGCombiner::visitEXTRACT_SUBVECTOR(SDNode* N) {
13593 EVT NVT = N->getValueType(0);
13594 SDValue V = N->getOperand(0);
13596 if (V->getOpcode() == ISD::CONCAT_VECTORS) {
13598 // (extract_subvec (concat V1, V2, ...), i)
13601 // Only operand 0 is checked as 'concat' assumes all inputs of the same
13603 if (V->getOperand(0).getValueType() != NVT)
13605 unsigned Idx = N->getConstantOperandVal(1);
13606 unsigned NumElems = NVT.getVectorNumElements();
13607 assert((Idx % NumElems) == 0 &&
13608 "IDX in concat is not a multiple of the result vector length.");
13609 return V->getOperand(Idx / NumElems);
13613 if (V->getOpcode() == ISD::BITCAST)
13614 V = V.getOperand(0);
13616 if (V->getOpcode() == ISD::INSERT_SUBVECTOR) {
13617 // Handle only simple case where vector being inserted and vector
13618 // being extracted are of same type, and are half size of larger vectors.
13619 EVT BigVT = V->getOperand(0).getValueType();
13620 EVT SmallVT = V->getOperand(1).getValueType();
13621 if (!NVT.bitsEq(SmallVT) || NVT.getSizeInBits()*2 != BigVT.getSizeInBits())
13624 // Only handle cases where both indexes are constants with the same type.
13625 ConstantSDNode *ExtIdx = dyn_cast<ConstantSDNode>(N->getOperand(1));
13626 ConstantSDNode *InsIdx = dyn_cast<ConstantSDNode>(V->getOperand(2));
13628 if (InsIdx && ExtIdx &&
13629 InsIdx->getValueType(0).getSizeInBits() <= 64 &&
13630 ExtIdx->getValueType(0).getSizeInBits() <= 64) {
13632 // (extract_subvec (insert_subvec V1, V2, InsIdx), ExtIdx)
13634 // indices are equal or bit offsets are equal => V1
13635 // otherwise => (extract_subvec V1, ExtIdx)
13636 if (InsIdx->getZExtValue() * SmallVT.getScalarSizeInBits() ==
13637 ExtIdx->getZExtValue() * NVT.getScalarSizeInBits())
13638 return DAG.getBitcast(NVT, V->getOperand(1));
13639 return DAG.getNode(
13640 ISD::EXTRACT_SUBVECTOR, SDLoc(N), NVT,
13641 DAG.getBitcast(N->getOperand(0).getValueType(), V->getOperand(0)),
13649 static SDValue simplifyShuffleOperandRecursively(SmallBitVector &UsedElements,
13650 SDValue V, SelectionDAG &DAG) {
13652 EVT VT = V.getValueType();
13654 switch (V.getOpcode()) {
13658 case ISD::CONCAT_VECTORS: {
13659 EVT OpVT = V->getOperand(0).getValueType();
13660 int OpSize = OpVT.getVectorNumElements();
13661 SmallBitVector OpUsedElements(OpSize, false);
13662 bool FoundSimplification = false;
13663 SmallVector<SDValue, 4> NewOps;
13664 NewOps.reserve(V->getNumOperands());
13665 for (int i = 0, NumOps = V->getNumOperands(); i < NumOps; ++i) {
13666 SDValue Op = V->getOperand(i);
13667 bool OpUsed = false;
13668 for (int j = 0; j < OpSize; ++j)
13669 if (UsedElements[i * OpSize + j]) {
13670 OpUsedElements[j] = true;
13674 OpUsed ? simplifyShuffleOperandRecursively(OpUsedElements, Op, DAG)
13675 : DAG.getUNDEF(OpVT));
13676 FoundSimplification |= Op == NewOps.back();
13677 OpUsedElements.reset();
13679 if (FoundSimplification)
13680 V = DAG.getNode(ISD::CONCAT_VECTORS, DL, VT, NewOps);
13684 case ISD::INSERT_SUBVECTOR: {
13685 SDValue BaseV = V->getOperand(0);
13686 SDValue SubV = V->getOperand(1);
13687 auto *IdxN = dyn_cast<ConstantSDNode>(V->getOperand(2));
13691 int SubSize = SubV.getValueType().getVectorNumElements();
13692 int Idx = IdxN->getZExtValue();
13693 bool SubVectorUsed = false;
13694 SmallBitVector SubUsedElements(SubSize, false);
13695 for (int i = 0; i < SubSize; ++i)
13696 if (UsedElements[i + Idx]) {
13697 SubVectorUsed = true;
13698 SubUsedElements[i] = true;
13699 UsedElements[i + Idx] = false;
13702 // Now recurse on both the base and sub vectors.
13703 SDValue SimplifiedSubV =
13705 ? simplifyShuffleOperandRecursively(SubUsedElements, SubV, DAG)
13706 : DAG.getUNDEF(SubV.getValueType());
13707 SDValue SimplifiedBaseV = simplifyShuffleOperandRecursively(UsedElements, BaseV, DAG);
13708 if (SimplifiedSubV != SubV || SimplifiedBaseV != BaseV)
13709 V = DAG.getNode(ISD::INSERT_SUBVECTOR, DL, VT,
13710 SimplifiedBaseV, SimplifiedSubV, V->getOperand(2));
13716 static SDValue simplifyShuffleOperands(ShuffleVectorSDNode *SVN, SDValue N0,
13717 SDValue N1, SelectionDAG &DAG) {
13718 EVT VT = SVN->getValueType(0);
13719 int NumElts = VT.getVectorNumElements();
13720 SmallBitVector N0UsedElements(NumElts, false), N1UsedElements(NumElts, false);
13721 for (int M : SVN->getMask())
13722 if (M >= 0 && M < NumElts)
13723 N0UsedElements[M] = true;
13724 else if (M >= NumElts)
13725 N1UsedElements[M - NumElts] = true;
13727 SDValue S0 = simplifyShuffleOperandRecursively(N0UsedElements, N0, DAG);
13728 SDValue S1 = simplifyShuffleOperandRecursively(N1UsedElements, N1, DAG);
13729 if (S0 == N0 && S1 == N1)
13732 return DAG.getVectorShuffle(VT, SDLoc(SVN), S0, S1, SVN->getMask());
13735 // Tries to turn a shuffle of two CONCAT_VECTORS into a single concat,
13736 // or turn a shuffle of a single concat into simpler shuffle then concat.
13737 static SDValue partitionShuffleOfConcats(SDNode *N, SelectionDAG &DAG) {
13738 EVT VT = N->getValueType(0);
13739 unsigned NumElts = VT.getVectorNumElements();
13741 SDValue N0 = N->getOperand(0);
13742 SDValue N1 = N->getOperand(1);
13743 ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
13745 SmallVector<SDValue, 4> Ops;
13746 EVT ConcatVT = N0.getOperand(0).getValueType();
13747 unsigned NumElemsPerConcat = ConcatVT.getVectorNumElements();
13748 unsigned NumConcats = NumElts / NumElemsPerConcat;
13750 // Special case: shuffle(concat(A,B)) can be more efficiently represented
13751 // as concat(shuffle(A,B),UNDEF) if the shuffle doesn't set any of the high
13752 // half vector elements.
13753 if (NumElemsPerConcat * 2 == NumElts && N1.isUndef() &&
13754 std::all_of(SVN->getMask().begin() + NumElemsPerConcat,
13755 SVN->getMask().end(), [](int i) { return i == -1; })) {
13756 N0 = DAG.getVectorShuffle(ConcatVT, SDLoc(N), N0.getOperand(0), N0.getOperand(1),
13757 makeArrayRef(SVN->getMask().begin(), NumElemsPerConcat));
13758 N1 = DAG.getUNDEF(ConcatVT);
13759 return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), VT, N0, N1);
13762 // Look at every vector that's inserted. We're looking for exact
13763 // subvector-sized copies from a concatenated vector
13764 for (unsigned I = 0; I != NumConcats; ++I) {
13765 // Make sure we're dealing with a copy.
13766 unsigned Begin = I * NumElemsPerConcat;
13767 bool AllUndef = true, NoUndef = true;
13768 for (unsigned J = Begin; J != Begin + NumElemsPerConcat; ++J) {
13769 if (SVN->getMaskElt(J) >= 0)
13776 if (SVN->getMaskElt(Begin) % NumElemsPerConcat != 0)
13779 for (unsigned J = 1; J != NumElemsPerConcat; ++J)
13780 if (SVN->getMaskElt(Begin + J - 1) + 1 != SVN->getMaskElt(Begin + J))
13783 unsigned FirstElt = SVN->getMaskElt(Begin) / NumElemsPerConcat;
13784 if (FirstElt < N0.getNumOperands())
13785 Ops.push_back(N0.getOperand(FirstElt));
13787 Ops.push_back(N1.getOperand(FirstElt - N0.getNumOperands()));
13789 } else if (AllUndef) {
13790 Ops.push_back(DAG.getUNDEF(N0.getOperand(0).getValueType()));
13791 } else { // Mixed with general masks and undefs, can't do optimization.
13796 return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), VT, Ops);
13799 // Attempt to combine a shuffle of 2 inputs of 'scalar sources' -
13800 // BUILD_VECTOR or SCALAR_TO_VECTOR into a single BUILD_VECTOR.
13802 // SHUFFLE(BUILD_VECTOR(), BUILD_VECTOR()) -> BUILD_VECTOR() is always
13803 // a simplification in some sense, but it isn't appropriate in general: some
13804 // BUILD_VECTORs are substantially cheaper than others. The general case
13805 // of a BUILD_VECTOR requires inserting each element individually (or
13806 // performing the equivalent in a temporary stack variable). A BUILD_VECTOR of
13807 // all constants is a single constant pool load. A BUILD_VECTOR where each
13808 // element is identical is a splat. A BUILD_VECTOR where most of the operands
13809 // are undef lowers to a small number of element insertions.
13811 // To deal with this, we currently use a bunch of mostly arbitrary heuristics.
13812 // We don't fold shuffles where one side is a non-zero constant, and we don't
13813 // fold shuffles if the resulting BUILD_VECTOR would have duplicate
13814 // non-constant operands. This seems to work out reasonably well in practice.
13815 static SDValue combineShuffleOfScalars(ShuffleVectorSDNode *SVN,
13817 const TargetLowering &TLI) {
13818 EVT VT = SVN->getValueType(0);
13819 unsigned NumElts = VT.getVectorNumElements();
13820 SDValue N0 = SVN->getOperand(0);
13821 SDValue N1 = SVN->getOperand(1);
13823 if (!N0->hasOneUse() || !N1->hasOneUse())
13825 // If only one of N1,N2 is constant, bail out if it is not ALL_ZEROS as
13826 // discussed above.
13827 if (!N1.isUndef()) {
13828 bool N0AnyConst = isAnyConstantBuildVector(N0.getNode());
13829 bool N1AnyConst = isAnyConstantBuildVector(N1.getNode());
13830 if (N0AnyConst && !N1AnyConst && !ISD::isBuildVectorAllZeros(N0.getNode()))
13832 if (!N0AnyConst && N1AnyConst && !ISD::isBuildVectorAllZeros(N1.getNode()))
13836 SmallVector<SDValue, 8> Ops;
13837 SmallSet<SDValue, 16> DuplicateOps;
13838 for (int M : SVN->getMask()) {
13839 SDValue Op = DAG.getUNDEF(VT.getScalarType());
13841 int Idx = M < (int)NumElts ? M : M - NumElts;
13842 SDValue &S = (M < (int)NumElts ? N0 : N1);
13843 if (S.getOpcode() == ISD::BUILD_VECTOR) {
13844 Op = S.getOperand(Idx);
13845 } else if (S.getOpcode() == ISD::SCALAR_TO_VECTOR) {
13847 Op = S.getOperand(0);
13849 // Operand can't be combined - bail out.
13854 // Don't duplicate a non-constant BUILD_VECTOR operand; semantically, this is
13855 // fine, but it's likely to generate low-quality code if the target can't
13856 // reconstruct an appropriate shuffle.
13857 if (!Op.isUndef() && !isa<ConstantSDNode>(Op) && !isa<ConstantFPSDNode>(Op))
13858 if (!DuplicateOps.insert(Op).second)
13863 // BUILD_VECTOR requires all inputs to be of the same type, find the
13864 // maximum type and extend them all.
13865 EVT SVT = VT.getScalarType();
13866 if (SVT.isInteger())
13867 for (SDValue &Op : Ops)
13868 SVT = (SVT.bitsLT(Op.getValueType()) ? Op.getValueType() : SVT);
13869 if (SVT != VT.getScalarType())
13870 for (SDValue &Op : Ops)
13871 Op = TLI.isZExtFree(Op.getValueType(), SVT)
13872 ? DAG.getZExtOrTrunc(Op, SDLoc(SVN), SVT)
13873 : DAG.getSExtOrTrunc(Op, SDLoc(SVN), SVT);
13874 return DAG.getBuildVector(VT, SDLoc(SVN), Ops);
13877 SDValue DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) {
13878 EVT VT = N->getValueType(0);
13879 unsigned NumElts = VT.getVectorNumElements();
13881 SDValue N0 = N->getOperand(0);
13882 SDValue N1 = N->getOperand(1);
13884 assert(N0.getValueType() == VT && "Vector shuffle must be normalized in DAG");
13886 // Canonicalize shuffle undef, undef -> undef
13887 if (N0.isUndef() && N1.isUndef())
13888 return DAG.getUNDEF(VT);
13890 ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
13892 // Canonicalize shuffle v, v -> v, undef
13894 SmallVector<int, 8> NewMask;
13895 for (unsigned i = 0; i != NumElts; ++i) {
13896 int Idx = SVN->getMaskElt(i);
13897 if (Idx >= (int)NumElts) Idx -= NumElts;
13898 NewMask.push_back(Idx);
13900 return DAG.getVectorShuffle(VT, SDLoc(N), N0, DAG.getUNDEF(VT), NewMask);
13903 // Canonicalize shuffle undef, v -> v, undef. Commute the shuffle mask.
13905 return DAG.getCommutedVectorShuffle(*SVN);
13907 // Remove references to rhs if it is undef
13908 if (N1.isUndef()) {
13909 bool Changed = false;
13910 SmallVector<int, 8> NewMask;
13911 for (unsigned i = 0; i != NumElts; ++i) {
13912 int Idx = SVN->getMaskElt(i);
13913 if (Idx >= (int)NumElts) {
13917 NewMask.push_back(Idx);
13920 return DAG.getVectorShuffle(VT, SDLoc(N), N0, N1, NewMask);
13923 // If it is a splat, check if the argument vector is another splat or a
13925 if (SVN->isSplat() && SVN->getSplatIndex() < (int)NumElts) {
13926 SDNode *V = N0.getNode();
13928 // If this is a bit convert that changes the element type of the vector but
13929 // not the number of vector elements, look through it. Be careful not to
13930 // look though conversions that change things like v4f32 to v2f64.
13931 if (V->getOpcode() == ISD::BITCAST) {
13932 SDValue ConvInput = V->getOperand(0);
13933 if (ConvInput.getValueType().isVector() &&
13934 ConvInput.getValueType().getVectorNumElements() == NumElts)
13935 V = ConvInput.getNode();
13938 if (V->getOpcode() == ISD::BUILD_VECTOR) {
13939 assert(V->getNumOperands() == NumElts &&
13940 "BUILD_VECTOR has wrong number of operands");
13942 bool AllSame = true;
13943 for (unsigned i = 0; i != NumElts; ++i) {
13944 if (!V->getOperand(i).isUndef()) {
13945 Base = V->getOperand(i);
13949 // Splat of <u, u, u, u>, return <u, u, u, u>
13950 if (!Base.getNode())
13952 for (unsigned i = 0; i != NumElts; ++i) {
13953 if (V->getOperand(i) != Base) {
13958 // Splat of <x, x, x, x>, return <x, x, x, x>
13962 // Canonicalize any other splat as a build_vector.
13963 const SDValue &Splatted = V->getOperand(SVN->getSplatIndex());
13964 SmallVector<SDValue, 8> Ops(NumElts, Splatted);
13965 SDValue NewBV = DAG.getBuildVector(V->getValueType(0), SDLoc(N), Ops);
13967 // We may have jumped through bitcasts, so the type of the
13968 // BUILD_VECTOR may not match the type of the shuffle.
13969 if (V->getValueType(0) != VT)
13970 NewBV = DAG.getBitcast(VT, NewBV);
13975 // There are various patterns used to build up a vector from smaller vectors,
13976 // subvectors, or elements. Scan chains of these and replace unused insertions
13977 // or components with undef.
13978 if (SDValue S = simplifyShuffleOperands(SVN, N0, N1, DAG))
13981 if (N0.getOpcode() == ISD::CONCAT_VECTORS &&
13982 Level < AfterLegalizeVectorOps &&
13984 (N1.getOpcode() == ISD::CONCAT_VECTORS &&
13985 N0.getOperand(0).getValueType() == N1.getOperand(0).getValueType()))) {
13986 if (SDValue V = partitionShuffleOfConcats(N, DAG))
13990 // Attempt to combine a shuffle of 2 inputs of 'scalar sources' -
13991 // BUILD_VECTOR or SCALAR_TO_VECTOR into a single BUILD_VECTOR.
13992 if (Level < AfterLegalizeVectorOps && TLI.isTypeLegal(VT))
13993 if (SDValue Res = combineShuffleOfScalars(SVN, DAG, TLI))
13996 // If this shuffle only has a single input that is a bitcasted shuffle,
13997 // attempt to merge the 2 shuffles and suitably bitcast the inputs/output
13998 // back to their original types.
13999 if (N0.getOpcode() == ISD::BITCAST && N0.hasOneUse() &&
14000 N1.isUndef() && Level < AfterLegalizeVectorOps &&
14001 TLI.isTypeLegal(VT)) {
14003 // Peek through the bitcast only if there is one user.
14005 while (BC0.getOpcode() == ISD::BITCAST) {
14006 if (!BC0.hasOneUse())
14008 BC0 = BC0.getOperand(0);
14011 auto ScaleShuffleMask = [](ArrayRef<int> Mask, int Scale) {
14013 return SmallVector<int, 8>(Mask.begin(), Mask.end());
14015 SmallVector<int, 8> NewMask;
14017 for (int s = 0; s != Scale; ++s)
14018 NewMask.push_back(M < 0 ? -1 : Scale * M + s);
14022 if (BC0.getOpcode() == ISD::VECTOR_SHUFFLE && BC0.hasOneUse()) {
14023 EVT SVT = VT.getScalarType();
14024 EVT InnerVT = BC0->getValueType(0);
14025 EVT InnerSVT = InnerVT.getScalarType();
14027 // Determine which shuffle works with the smaller scalar type.
14028 EVT ScaleVT = SVT.bitsLT(InnerSVT) ? VT : InnerVT;
14029 EVT ScaleSVT = ScaleVT.getScalarType();
14031 if (TLI.isTypeLegal(ScaleVT) &&
14032 0 == (InnerSVT.getSizeInBits() % ScaleSVT.getSizeInBits()) &&
14033 0 == (SVT.getSizeInBits() % ScaleSVT.getSizeInBits())) {
14035 int InnerScale = InnerSVT.getSizeInBits() / ScaleSVT.getSizeInBits();
14036 int OuterScale = SVT.getSizeInBits() / ScaleSVT.getSizeInBits();
14038 // Scale the shuffle masks to the smaller scalar type.
14039 ShuffleVectorSDNode *InnerSVN = cast<ShuffleVectorSDNode>(BC0);
14040 SmallVector<int, 8> InnerMask =
14041 ScaleShuffleMask(InnerSVN->getMask(), InnerScale);
14042 SmallVector<int, 8> OuterMask =
14043 ScaleShuffleMask(SVN->getMask(), OuterScale);
14045 // Merge the shuffle masks.
14046 SmallVector<int, 8> NewMask;
14047 for (int M : OuterMask)
14048 NewMask.push_back(M < 0 ? -1 : InnerMask[M]);
14050 // Test for shuffle mask legality over both commutations.
14051 SDValue SV0 = BC0->getOperand(0);
14052 SDValue SV1 = BC0->getOperand(1);
14053 bool LegalMask = TLI.isShuffleMaskLegal(NewMask, ScaleVT);
14055 std::swap(SV0, SV1);
14056 ShuffleVectorSDNode::commuteMask(NewMask);
14057 LegalMask = TLI.isShuffleMaskLegal(NewMask, ScaleVT);
14061 SV0 = DAG.getBitcast(ScaleVT, SV0);
14062 SV1 = DAG.getBitcast(ScaleVT, SV1);
14063 return DAG.getBitcast(
14064 VT, DAG.getVectorShuffle(ScaleVT, SDLoc(N), SV0, SV1, NewMask));
14070 // Canonicalize shuffles according to rules:
14071 // shuffle(A, shuffle(A, B)) -> shuffle(shuffle(A,B), A)
14072 // shuffle(B, shuffle(A, B)) -> shuffle(shuffle(A,B), B)
14073 // shuffle(B, shuffle(A, Undef)) -> shuffle(shuffle(A, Undef), B)
14074 if (N1.getOpcode() == ISD::VECTOR_SHUFFLE &&
14075 N0.getOpcode() != ISD::VECTOR_SHUFFLE && Level < AfterLegalizeDAG &&
14076 TLI.isTypeLegal(VT)) {
14077 // The incoming shuffle must be of the same type as the result of the
14078 // current shuffle.
14079 assert(N1->getOperand(0).getValueType() == VT &&
14080 "Shuffle types don't match");
14082 SDValue SV0 = N1->getOperand(0);
14083 SDValue SV1 = N1->getOperand(1);
14084 bool HasSameOp0 = N0 == SV0;
14085 bool IsSV1Undef = SV1.isUndef();
14086 if (HasSameOp0 || IsSV1Undef || N0 == SV1)
14087 // Commute the operands of this shuffle so that next rule
14089 return DAG.getCommutedVectorShuffle(*SVN);
14092 // Try to fold according to rules:
14093 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(A, B, M2)
14094 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(A, C, M2)
14095 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(B, C, M2)
14096 // Don't try to fold shuffles with illegal type.
14097 // Only fold if this shuffle is the only user of the other shuffle.
14098 if (N0.getOpcode() == ISD::VECTOR_SHUFFLE && N->isOnlyUserOf(N0.getNode()) &&
14099 Level < AfterLegalizeDAG && TLI.isTypeLegal(VT)) {
14100 ShuffleVectorSDNode *OtherSV = cast<ShuffleVectorSDNode>(N0);
14102 // Don't try to fold splats; they're likely to simplify somehow, or they
14104 if (OtherSV->isSplat())
14107 // The incoming shuffle must be of the same type as the result of the
14108 // current shuffle.
14109 assert(OtherSV->getOperand(0).getValueType() == VT &&
14110 "Shuffle types don't match");
14113 SmallVector<int, 4> Mask;
14114 // Compute the combined shuffle mask for a shuffle with SV0 as the first
14115 // operand, and SV1 as the second operand.
14116 for (unsigned i = 0; i != NumElts; ++i) {
14117 int Idx = SVN->getMaskElt(i);
14119 // Propagate Undef.
14120 Mask.push_back(Idx);
14124 SDValue CurrentVec;
14125 if (Idx < (int)NumElts) {
14126 // This shuffle index refers to the inner shuffle N0. Lookup the inner
14127 // shuffle mask to identify which vector is actually referenced.
14128 Idx = OtherSV->getMaskElt(Idx);
14130 // Propagate Undef.
14131 Mask.push_back(Idx);
14135 CurrentVec = (Idx < (int) NumElts) ? OtherSV->getOperand(0)
14136 : OtherSV->getOperand(1);
14138 // This shuffle index references an element within N1.
14142 // Simple case where 'CurrentVec' is UNDEF.
14143 if (CurrentVec.isUndef()) {
14144 Mask.push_back(-1);
14148 // Canonicalize the shuffle index. We don't know yet if CurrentVec
14149 // will be the first or second operand of the combined shuffle.
14150 Idx = Idx % NumElts;
14151 if (!SV0.getNode() || SV0 == CurrentVec) {
14152 // Ok. CurrentVec is the left hand side.
14153 // Update the mask accordingly.
14155 Mask.push_back(Idx);
14159 // Bail out if we cannot convert the shuffle pair into a single shuffle.
14160 if (SV1.getNode() && SV1 != CurrentVec)
14163 // Ok. CurrentVec is the right hand side.
14164 // Update the mask accordingly.
14166 Mask.push_back(Idx + NumElts);
14169 // Check if all indices in Mask are Undef. In case, propagate Undef.
14170 bool isUndefMask = true;
14171 for (unsigned i = 0; i != NumElts && isUndefMask; ++i)
14172 isUndefMask &= Mask[i] < 0;
14175 return DAG.getUNDEF(VT);
14177 if (!SV0.getNode())
14178 SV0 = DAG.getUNDEF(VT);
14179 if (!SV1.getNode())
14180 SV1 = DAG.getUNDEF(VT);
14182 // Avoid introducing shuffles with illegal mask.
14183 if (!TLI.isShuffleMaskLegal(Mask, VT)) {
14184 ShuffleVectorSDNode::commuteMask(Mask);
14186 if (!TLI.isShuffleMaskLegal(Mask, VT))
14189 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(B, A, M2)
14190 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(C, A, M2)
14191 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(C, B, M2)
14192 std::swap(SV0, SV1);
14195 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(A, B, M2)
14196 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(A, C, M2)
14197 // shuffle(shuffle(A, B, M0), C, M1) -> shuffle(B, C, M2)
14198 return DAG.getVectorShuffle(VT, SDLoc(N), SV0, SV1, Mask);
14204 SDValue DAGCombiner::visitSCALAR_TO_VECTOR(SDNode *N) {
14205 SDValue InVal = N->getOperand(0);
14206 EVT VT = N->getValueType(0);
14208 // Replace a SCALAR_TO_VECTOR(EXTRACT_VECTOR_ELT(V,C0)) pattern
14209 // with a VECTOR_SHUFFLE.
14210 if (InVal.getOpcode() == ISD::EXTRACT_VECTOR_ELT) {
14211 SDValue InVec = InVal->getOperand(0);
14212 SDValue EltNo = InVal->getOperand(1);
14214 // FIXME: We could support implicit truncation if the shuffle can be
14215 // scaled to a smaller vector scalar type.
14216 ConstantSDNode *C0 = dyn_cast<ConstantSDNode>(EltNo);
14217 if (C0 && VT == InVec.getValueType() &&
14218 VT.getScalarType() == InVal.getValueType()) {
14219 SmallVector<int, 8> NewMask(VT.getVectorNumElements(), -1);
14220 int Elt = C0->getZExtValue();
14223 if (TLI.isShuffleMaskLegal(NewMask, VT))
14224 return DAG.getVectorShuffle(VT, SDLoc(N), InVec, DAG.getUNDEF(VT),
14232 SDValue DAGCombiner::visitINSERT_SUBVECTOR(SDNode *N) {
14233 EVT VT = N->getValueType(0);
14234 SDValue N0 = N->getOperand(0);
14235 SDValue N1 = N->getOperand(1);
14236 SDValue N2 = N->getOperand(2);
14238 // Combine INSERT_SUBVECTORs where we are inserting to the same index.
14239 // INSERT_SUBVECTOR( INSERT_SUBVECTOR( Vec, SubOld, Idx ), SubNew, Idx )
14240 // --> INSERT_SUBVECTOR( Vec, SubNew, Idx )
14241 if (N0.getOpcode() == ISD::INSERT_SUBVECTOR &&
14242 N0.getOperand(1).getValueType() == N1.getValueType() &&
14243 N0.getOperand(2) == N2)
14244 return DAG.getNode(ISD::INSERT_SUBVECTOR, SDLoc(N), VT, N0.getOperand(0),
14247 if (N0.getValueType() != N1.getValueType())
14250 // If the input vector is a concatenation, and the insert replaces
14251 // one of the halves, we can optimize into a single concat_vectors.
14252 if (N0.getOpcode() == ISD::CONCAT_VECTORS && N0->getNumOperands() == 2 &&
14253 N2.getOpcode() == ISD::Constant) {
14254 APInt InsIdx = cast<ConstantSDNode>(N2)->getAPIntValue();
14256 // Lower half: fold (insert_subvector (concat_vectors X, Y), Z) ->
14257 // (concat_vectors Z, Y)
14259 return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), VT, N1,
14262 // Upper half: fold (insert_subvector (concat_vectors X, Y), Z) ->
14263 // (concat_vectors X, Z)
14264 if (InsIdx == VT.getVectorNumElements() / 2)
14265 return DAG.getNode(ISD::CONCAT_VECTORS, SDLoc(N), VT, N0.getOperand(0),
14272 SDValue DAGCombiner::visitFP_TO_FP16(SDNode *N) {
14273 SDValue N0 = N->getOperand(0);
14275 // fold (fp_to_fp16 (fp16_to_fp op)) -> op
14276 if (N0->getOpcode() == ISD::FP16_TO_FP)
14277 return N0->getOperand(0);
14282 SDValue DAGCombiner::visitFP16_TO_FP(SDNode *N) {
14283 SDValue N0 = N->getOperand(0);
14285 // fold fp16_to_fp(op & 0xffff) -> fp16_to_fp(op)
14286 if (N0->getOpcode() == ISD::AND) {
14287 ConstantSDNode *AndConst = getAsNonOpaqueConstant(N0.getOperand(1));
14288 if (AndConst && AndConst->getAPIntValue() == 0xffff) {
14289 return DAG.getNode(ISD::FP16_TO_FP, SDLoc(N), N->getValueType(0),
14297 /// Returns a vector_shuffle if it able to transform an AND to a vector_shuffle
14298 /// with the destination vector and a zero vector.
14299 /// e.g. AND V, <0xffffffff, 0, 0xffffffff, 0>. ==>
14300 /// vector_shuffle V, Zero, <0, 4, 2, 4>
14301 SDValue DAGCombiner::XformToShuffleWithZero(SDNode *N) {
14302 EVT VT = N->getValueType(0);
14303 SDValue LHS = N->getOperand(0);
14304 SDValue RHS = N->getOperand(1);
14307 // Make sure we're not running after operation legalization where it
14308 // may have custom lowered the vector shuffles.
14309 if (LegalOperations)
14312 if (N->getOpcode() != ISD::AND)
14315 if (RHS.getOpcode() == ISD::BITCAST)
14316 RHS = RHS.getOperand(0);
14318 if (RHS.getOpcode() != ISD::BUILD_VECTOR)
14321 EVT RVT = RHS.getValueType();
14322 unsigned NumElts = RHS.getNumOperands();
14324 // Attempt to create a valid clear mask, splitting the mask into
14325 // sub elements and checking to see if each is
14326 // all zeros or all ones - suitable for shuffle masking.
14327 auto BuildClearMask = [&](int Split) {
14328 int NumSubElts = NumElts * Split;
14329 int NumSubBits = RVT.getScalarSizeInBits() / Split;
14331 SmallVector<int, 8> Indices;
14332 for (int i = 0; i != NumSubElts; ++i) {
14333 int EltIdx = i / Split;
14334 int SubIdx = i % Split;
14335 SDValue Elt = RHS.getOperand(EltIdx);
14336 if (Elt.isUndef()) {
14337 Indices.push_back(-1);
14342 if (isa<ConstantSDNode>(Elt))
14343 Bits = cast<ConstantSDNode>(Elt)->getAPIntValue();
14344 else if (isa<ConstantFPSDNode>(Elt))
14345 Bits = cast<ConstantFPSDNode>(Elt)->getValueAPF().bitcastToAPInt();
14349 // Extract the sub element from the constant bit mask.
14350 if (DAG.getDataLayout().isBigEndian()) {
14351 Bits = Bits.lshr((Split - SubIdx - 1) * NumSubBits);
14353 Bits = Bits.lshr(SubIdx * NumSubBits);
14357 Bits = Bits.trunc(NumSubBits);
14359 if (Bits.isAllOnesValue())
14360 Indices.push_back(i);
14361 else if (Bits == 0)
14362 Indices.push_back(i + NumSubElts);
14367 // Let's see if the target supports this vector_shuffle.
14368 EVT ClearSVT = EVT::getIntegerVT(*DAG.getContext(), NumSubBits);
14369 EVT ClearVT = EVT::getVectorVT(*DAG.getContext(), ClearSVT, NumSubElts);
14370 if (!TLI.isVectorClearMaskLegal(Indices, ClearVT))
14373 SDValue Zero = DAG.getConstant(0, DL, ClearVT);
14374 return DAG.getBitcast(VT, DAG.getVectorShuffle(ClearVT, DL,
14375 DAG.getBitcast(ClearVT, LHS),
14379 // Determine maximum split level (byte level masking).
14381 if (RVT.getScalarSizeInBits() % 8 == 0)
14382 MaxSplit = RVT.getScalarSizeInBits() / 8;
14384 for (int Split = 1; Split <= MaxSplit; ++Split)
14385 if (RVT.getScalarSizeInBits() % Split == 0)
14386 if (SDValue S = BuildClearMask(Split))
14392 /// Visit a binary vector operation, like ADD.
14393 SDValue DAGCombiner::SimplifyVBinOp(SDNode *N) {
14394 assert(N->getValueType(0).isVector() &&
14395 "SimplifyVBinOp only works on vectors!");
14397 SDValue LHS = N->getOperand(0);
14398 SDValue RHS = N->getOperand(1);
14399 SDValue Ops[] = {LHS, RHS};
14401 // See if we can constant fold the vector operation.
14402 if (SDValue Fold = DAG.FoldConstantVectorArithmetic(
14403 N->getOpcode(), SDLoc(LHS), LHS.getValueType(), Ops, N->getFlags()))
14406 // Try to convert a constant mask AND into a shuffle clear mask.
14407 if (SDValue Shuffle = XformToShuffleWithZero(N))
14410 // Type legalization might introduce new shuffles in the DAG.
14411 // Fold (VBinOp (shuffle (A, Undef, Mask)), (shuffle (B, Undef, Mask)))
14412 // -> (shuffle (VBinOp (A, B)), Undef, Mask).
14413 if (LegalTypes && isa<ShuffleVectorSDNode>(LHS) &&
14414 isa<ShuffleVectorSDNode>(RHS) && LHS.hasOneUse() && RHS.hasOneUse() &&
14415 LHS.getOperand(1).isUndef() &&
14416 RHS.getOperand(1).isUndef()) {
14417 ShuffleVectorSDNode *SVN0 = cast<ShuffleVectorSDNode>(LHS);
14418 ShuffleVectorSDNode *SVN1 = cast<ShuffleVectorSDNode>(RHS);
14420 if (SVN0->getMask().equals(SVN1->getMask())) {
14421 EVT VT = N->getValueType(0);
14422 SDValue UndefVector = LHS.getOperand(1);
14423 SDValue NewBinOp = DAG.getNode(N->getOpcode(), SDLoc(N), VT,
14424 LHS.getOperand(0), RHS.getOperand(0),
14426 AddUsersToWorklist(N);
14427 return DAG.getVectorShuffle(VT, SDLoc(N), NewBinOp, UndefVector,
14435 SDValue DAGCombiner::SimplifySelect(const SDLoc &DL, SDValue N0, SDValue N1,
14437 assert(N0.getOpcode() ==ISD::SETCC && "First argument must be a SetCC node!");
14439 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2,
14440 cast<CondCodeSDNode>(N0.getOperand(2))->get());
14442 // If we got a simplified select_cc node back from SimplifySelectCC, then
14443 // break it down into a new SETCC node, and a new SELECT node, and then return
14444 // the SELECT node, since we were called with a SELECT node.
14445 if (SCC.getNode()) {
14446 // Check to see if we got a select_cc back (to turn into setcc/select).
14447 // Otherwise, just return whatever node we got back, like fabs.
14448 if (SCC.getOpcode() == ISD::SELECT_CC) {
14449 SDValue SETCC = DAG.getNode(ISD::SETCC, SDLoc(N0),
14451 SCC.getOperand(0), SCC.getOperand(1),
14452 SCC.getOperand(4));
14453 AddToWorklist(SETCC.getNode());
14454 return DAG.getSelect(SDLoc(SCC), SCC.getValueType(), SETCC,
14455 SCC.getOperand(2), SCC.getOperand(3));
14463 /// Given a SELECT or a SELECT_CC node, where LHS and RHS are the two values
14464 /// being selected between, see if we can simplify the select. Callers of this
14465 /// should assume that TheSelect is deleted if this returns true. As such, they
14466 /// should return the appropriate thing (e.g. the node) back to the top-level of
14467 /// the DAG combiner loop to avoid it being looked at.
14468 bool DAGCombiner::SimplifySelectOps(SDNode *TheSelect, SDValue LHS,
14471 // fold (select (setcc x, [+-]0.0, *lt), NaN, (fsqrt x))
14472 // The select + setcc is redundant, because fsqrt returns NaN for X < 0.
14473 if (const ConstantFPSDNode *NaN = isConstOrConstSplatFP(LHS)) {
14474 if (NaN->isNaN() && RHS.getOpcode() == ISD::FSQRT) {
14475 // We have: (select (setcc ?, ?, ?), NaN, (fsqrt ?))
14476 SDValue Sqrt = RHS;
14479 const ConstantFPSDNode *Zero = nullptr;
14481 if (TheSelect->getOpcode() == ISD::SELECT_CC) {
14482 CC = dyn_cast<CondCodeSDNode>(TheSelect->getOperand(4))->get();
14483 CmpLHS = TheSelect->getOperand(0);
14484 Zero = isConstOrConstSplatFP(TheSelect->getOperand(1));
14486 // SELECT or VSELECT
14487 SDValue Cmp = TheSelect->getOperand(0);
14488 if (Cmp.getOpcode() == ISD::SETCC) {
14489 CC = dyn_cast<CondCodeSDNode>(Cmp.getOperand(2))->get();
14490 CmpLHS = Cmp.getOperand(0);
14491 Zero = isConstOrConstSplatFP(Cmp.getOperand(1));
14494 if (Zero && Zero->isZero() &&
14495 Sqrt.getOperand(0) == CmpLHS && (CC == ISD::SETOLT ||
14496 CC == ISD::SETULT || CC == ISD::SETLT)) {
14497 // We have: (select (setcc x, [+-]0.0, *lt), NaN, (fsqrt x))
14498 CombineTo(TheSelect, Sqrt);
14503 // Cannot simplify select with vector condition
14504 if (TheSelect->getOperand(0).getValueType().isVector()) return false;
14506 // If this is a select from two identical things, try to pull the operation
14507 // through the select.
14508 if (LHS.getOpcode() != RHS.getOpcode() ||
14509 !LHS.hasOneUse() || !RHS.hasOneUse())
14512 // If this is a load and the token chain is identical, replace the select
14513 // of two loads with a load through a select of the address to load from.
14514 // This triggers in things like "select bool X, 10.0, 123.0" after the FP
14515 // constants have been dropped into the constant pool.
14516 if (LHS.getOpcode() == ISD::LOAD) {
14517 LoadSDNode *LLD = cast<LoadSDNode>(LHS);
14518 LoadSDNode *RLD = cast<LoadSDNode>(RHS);
14520 // Token chains must be identical.
14521 if (LHS.getOperand(0) != RHS.getOperand(0) ||
14522 // Do not let this transformation reduce the number of volatile loads.
14523 LLD->isVolatile() || RLD->isVolatile() ||
14524 // FIXME: If either is a pre/post inc/dec load,
14525 // we'd need to split out the address adjustment.
14526 LLD->isIndexed() || RLD->isIndexed() ||
14527 // If this is an EXTLOAD, the VT's must match.
14528 LLD->getMemoryVT() != RLD->getMemoryVT() ||
14529 // If this is an EXTLOAD, the kind of extension must match.
14530 (LLD->getExtensionType() != RLD->getExtensionType() &&
14531 // The only exception is if one of the extensions is anyext.
14532 LLD->getExtensionType() != ISD::EXTLOAD &&
14533 RLD->getExtensionType() != ISD::EXTLOAD) ||
14534 // FIXME: this discards src value information. This is
14535 // over-conservative. It would be beneficial to be able to remember
14536 // both potential memory locations. Since we are discarding
14537 // src value info, don't do the transformation if the memory
14538 // locations are not in the default address space.
14539 LLD->getPointerInfo().getAddrSpace() != 0 ||
14540 RLD->getPointerInfo().getAddrSpace() != 0 ||
14541 !TLI.isOperationLegalOrCustom(TheSelect->getOpcode(),
14542 LLD->getBasePtr().getValueType()))
14545 // Check that the select condition doesn't reach either load. If so,
14546 // folding this will induce a cycle into the DAG. If not, this is safe to
14547 // xform, so create a select of the addresses.
14549 if (TheSelect->getOpcode() == ISD::SELECT) {
14550 SDNode *CondNode = TheSelect->getOperand(0).getNode();
14551 if ((LLD->hasAnyUseOfValue(1) && LLD->isPredecessorOf(CondNode)) ||
14552 (RLD->hasAnyUseOfValue(1) && RLD->isPredecessorOf(CondNode)))
14554 // The loads must not depend on one another.
14555 if (LLD->isPredecessorOf(RLD) ||
14556 RLD->isPredecessorOf(LLD))
14558 Addr = DAG.getSelect(SDLoc(TheSelect),
14559 LLD->getBasePtr().getValueType(),
14560 TheSelect->getOperand(0), LLD->getBasePtr(),
14561 RLD->getBasePtr());
14562 } else { // Otherwise SELECT_CC
14563 SDNode *CondLHS = TheSelect->getOperand(0).getNode();
14564 SDNode *CondRHS = TheSelect->getOperand(1).getNode();
14566 if ((LLD->hasAnyUseOfValue(1) &&
14567 (LLD->isPredecessorOf(CondLHS) || LLD->isPredecessorOf(CondRHS))) ||
14568 (RLD->hasAnyUseOfValue(1) &&
14569 (RLD->isPredecessorOf(CondLHS) || RLD->isPredecessorOf(CondRHS))))
14572 Addr = DAG.getNode(ISD::SELECT_CC, SDLoc(TheSelect),
14573 LLD->getBasePtr().getValueType(),
14574 TheSelect->getOperand(0),
14575 TheSelect->getOperand(1),
14576 LLD->getBasePtr(), RLD->getBasePtr(),
14577 TheSelect->getOperand(4));
14581 // It is safe to replace the two loads if they have different alignments,
14582 // but the new load must be the minimum (most restrictive) alignment of the
14584 unsigned Alignment = std::min(LLD->getAlignment(), RLD->getAlignment());
14585 MachineMemOperand::Flags MMOFlags = LLD->getMemOperand()->getFlags();
14586 if (!RLD->isInvariant())
14587 MMOFlags &= ~MachineMemOperand::MOInvariant;
14588 if (!RLD->isDereferenceable())
14589 MMOFlags &= ~MachineMemOperand::MODereferenceable;
14590 if (LLD->getExtensionType() == ISD::NON_EXTLOAD) {
14591 // FIXME: Discards pointer and AA info.
14592 Load = DAG.getLoad(TheSelect->getValueType(0), SDLoc(TheSelect),
14593 LLD->getChain(), Addr, MachinePointerInfo(), Alignment,
14596 // FIXME: Discards pointer and AA info.
14597 Load = DAG.getExtLoad(
14598 LLD->getExtensionType() == ISD::EXTLOAD ? RLD->getExtensionType()
14599 : LLD->getExtensionType(),
14600 SDLoc(TheSelect), TheSelect->getValueType(0), LLD->getChain(), Addr,
14601 MachinePointerInfo(), LLD->getMemoryVT(), Alignment, MMOFlags);
14604 // Users of the select now use the result of the load.
14605 CombineTo(TheSelect, Load);
14607 // Users of the old loads now use the new load's chain. We know the
14608 // old-load value is dead now.
14609 CombineTo(LHS.getNode(), Load.getValue(0), Load.getValue(1));
14610 CombineTo(RHS.getNode(), Load.getValue(0), Load.getValue(1));
14617 /// Try to fold an expression of the form (N0 cond N1) ? N2 : N3 to a shift and
14619 SDValue DAGCombiner::foldSelectCCToShiftAnd(const SDLoc &DL, SDValue N0,
14620 SDValue N1, SDValue N2, SDValue N3,
14621 ISD::CondCode CC) {
14622 // If this is a select where the false operand is zero and the compare is a
14623 // check of the sign bit, see if we can perform the "gzip trick":
14624 // select_cc setlt X, 0, A, 0 -> and (sra X, size(X)-1), A
14625 // select_cc setgt X, 0, A, 0 -> and (not (sra X, size(X)-1)), A
14626 EVT XType = N0.getValueType();
14627 EVT AType = N2.getValueType();
14628 if (!isNullConstant(N3) || !XType.bitsGE(AType))
14631 // If the comparison is testing for a positive value, we have to invert
14632 // the sign bit mask, so only do that transform if the target has a bitwise
14633 // 'and not' instruction (the invert is free).
14634 if (CC == ISD::SETGT && TLI.hasAndNot(N2)) {
14635 // (X > -1) ? A : 0
14636 // (X > 0) ? X : 0 <-- This is canonical signed max.
14637 if (!(isAllOnesConstant(N1) || (isNullConstant(N1) && N0 == N2)))
14639 } else if (CC == ISD::SETLT) {
14641 // (X < 1) ? X : 0 <-- This is un-canonicalized signed min.
14642 if (!(isNullConstant(N1) || (isOneConstant(N1) && N0 == N2)))
14648 // and (sra X, size(X)-1), A -> "and (srl X, C2), A" iff A is a single-bit
14650 EVT ShiftAmtTy = getShiftAmountTy(N0.getValueType());
14651 auto *N2C = dyn_cast<ConstantSDNode>(N2.getNode());
14652 if (N2C && ((N2C->getAPIntValue() & (N2C->getAPIntValue() - 1)) == 0)) {
14653 unsigned ShCt = XType.getSizeInBits() - N2C->getAPIntValue().logBase2() - 1;
14654 SDValue ShiftAmt = DAG.getConstant(ShCt, DL, ShiftAmtTy);
14655 SDValue Shift = DAG.getNode(ISD::SRL, DL, XType, N0, ShiftAmt);
14656 AddToWorklist(Shift.getNode());
14658 if (XType.bitsGT(AType)) {
14659 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift);
14660 AddToWorklist(Shift.getNode());
14663 if (CC == ISD::SETGT)
14664 Shift = DAG.getNOT(DL, Shift, AType);
14666 return DAG.getNode(ISD::AND, DL, AType, Shift, N2);
14669 SDValue ShiftAmt = DAG.getConstant(XType.getSizeInBits() - 1, DL, ShiftAmtTy);
14670 SDValue Shift = DAG.getNode(ISD::SRA, DL, XType, N0, ShiftAmt);
14671 AddToWorklist(Shift.getNode());
14673 if (XType.bitsGT(AType)) {
14674 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift);
14675 AddToWorklist(Shift.getNode());
14678 if (CC == ISD::SETGT)
14679 Shift = DAG.getNOT(DL, Shift, AType);
14681 return DAG.getNode(ISD::AND, DL, AType, Shift, N2);
14684 /// Simplify an expression of the form (N0 cond N1) ? N2 : N3
14685 /// where 'cond' is the comparison specified by CC.
14686 SDValue DAGCombiner::SimplifySelectCC(const SDLoc &DL, SDValue N0, SDValue N1,
14687 SDValue N2, SDValue N3, ISD::CondCode CC,
14688 bool NotExtCompare) {
14689 // (x ? y : y) -> y.
14690 if (N2 == N3) return N2;
14692 EVT VT = N2.getValueType();
14693 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
14694 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode());
14696 // Determine if the condition we're dealing with is constant
14697 SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()),
14698 N0, N1, CC, DL, false);
14699 if (SCC.getNode()) AddToWorklist(SCC.getNode());
14701 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) {
14702 // fold select_cc true, x, y -> x
14703 // fold select_cc false, x, y -> y
14704 return !SCCC->isNullValue() ? N2 : N3;
14707 // Check to see if we can simplify the select into an fabs node
14708 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1)) {
14709 // Allow either -0.0 or 0.0
14710 if (CFP->isZero()) {
14711 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs
14712 if ((CC == ISD::SETGE || CC == ISD::SETGT) &&
14713 N0 == N2 && N3.getOpcode() == ISD::FNEG &&
14714 N2 == N3.getOperand(0))
14715 return DAG.getNode(ISD::FABS, DL, VT, N0);
14717 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs
14718 if ((CC == ISD::SETLT || CC == ISD::SETLE) &&
14719 N0 == N3 && N2.getOpcode() == ISD::FNEG &&
14720 N2.getOperand(0) == N3)
14721 return DAG.getNode(ISD::FABS, DL, VT, N3);
14725 // Turn "(a cond b) ? 1.0f : 2.0f" into "load (tmp + ((a cond b) ? 0 : 4)"
14726 // where "tmp" is a constant pool entry containing an array with 1.0 and 2.0
14727 // in it. This is a win when the constant is not otherwise available because
14728 // it replaces two constant pool loads with one. We only do this if the FP
14729 // type is known to be legal, because if it isn't, then we are before legalize
14730 // types an we want the other legalization to happen first (e.g. to avoid
14731 // messing with soft float) and if the ConstantFP is not legal, because if
14732 // it is legal, we may not need to store the FP constant in a constant pool.
14733 if (ConstantFPSDNode *TV = dyn_cast<ConstantFPSDNode>(N2))
14734 if (ConstantFPSDNode *FV = dyn_cast<ConstantFPSDNode>(N3)) {
14735 if (TLI.isTypeLegal(N2.getValueType()) &&
14736 (TLI.getOperationAction(ISD::ConstantFP, N2.getValueType()) !=
14737 TargetLowering::Legal &&
14738 !TLI.isFPImmLegal(TV->getValueAPF(), TV->getValueType(0)) &&
14739 !TLI.isFPImmLegal(FV->getValueAPF(), FV->getValueType(0))) &&
14740 // If both constants have multiple uses, then we won't need to do an
14741 // extra load, they are likely around in registers for other users.
14742 (TV->hasOneUse() || FV->hasOneUse())) {
14743 Constant *Elts[] = {
14744 const_cast<ConstantFP*>(FV->getConstantFPValue()),
14745 const_cast<ConstantFP*>(TV->getConstantFPValue())
14747 Type *FPTy = Elts[0]->getType();
14748 const DataLayout &TD = DAG.getDataLayout();
14750 // Create a ConstantArray of the two constants.
14751 Constant *CA = ConstantArray::get(ArrayType::get(FPTy, 2), Elts);
14753 DAG.getConstantPool(CA, TLI.getPointerTy(DAG.getDataLayout()),
14754 TD.getPrefTypeAlignment(FPTy));
14755 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
14757 // Get the offsets to the 0 and 1 element of the array so that we can
14758 // select between them.
14759 SDValue Zero = DAG.getIntPtrConstant(0, DL);
14760 unsigned EltSize = (unsigned)TD.getTypeAllocSize(Elts[0]->getType());
14761 SDValue One = DAG.getIntPtrConstant(EltSize, SDLoc(FV));
14763 SDValue Cond = DAG.getSetCC(DL,
14764 getSetCCResultType(N0.getValueType()),
14766 AddToWorklist(Cond.getNode());
14767 SDValue CstOffset = DAG.getSelect(DL, Zero.getValueType(),
14769 AddToWorklist(CstOffset.getNode());
14770 CPIdx = DAG.getNode(ISD::ADD, DL, CPIdx.getValueType(), CPIdx,
14772 AddToWorklist(CPIdx.getNode());
14773 return DAG.getLoad(
14774 TV->getValueType(0), DL, DAG.getEntryNode(), CPIdx,
14775 MachinePointerInfo::getConstantPool(DAG.getMachineFunction()),
14780 if (SDValue V = foldSelectCCToShiftAnd(DL, N0, N1, N2, N3, CC))
14783 // fold (select_cc seteq (and x, y), 0, 0, A) -> (and (shr (shl x)) A)
14784 // where y is has a single bit set.
14785 // A plaintext description would be, we can turn the SELECT_CC into an AND
14786 // when the condition can be materialized as an all-ones register. Any
14787 // single bit-test can be materialized as an all-ones register with
14788 // shift-left and shift-right-arith.
14789 if (CC == ISD::SETEQ && N0->getOpcode() == ISD::AND &&
14790 N0->getValueType(0) == VT && isNullConstant(N1) && isNullConstant(N2)) {
14791 SDValue AndLHS = N0->getOperand(0);
14792 ConstantSDNode *ConstAndRHS = dyn_cast<ConstantSDNode>(N0->getOperand(1));
14793 if (ConstAndRHS && ConstAndRHS->getAPIntValue().countPopulation() == 1) {
14794 // Shift the tested bit over the sign bit.
14795 const APInt &AndMask = ConstAndRHS->getAPIntValue();
14797 DAG.getConstant(AndMask.countLeadingZeros(), SDLoc(AndLHS),
14798 getShiftAmountTy(AndLHS.getValueType()));
14799 SDValue Shl = DAG.getNode(ISD::SHL, SDLoc(N0), VT, AndLHS, ShlAmt);
14801 // Now arithmetic right shift it all the way over, so the result is either
14802 // all-ones, or zero.
14804 DAG.getConstant(AndMask.getBitWidth() - 1, SDLoc(Shl),
14805 getShiftAmountTy(Shl.getValueType()));
14806 SDValue Shr = DAG.getNode(ISD::SRA, SDLoc(N0), VT, Shl, ShrAmt);
14808 return DAG.getNode(ISD::AND, DL, VT, Shr, N3);
14812 // fold select C, 16, 0 -> shl C, 4
14813 if (N2C && isNullConstant(N3) && N2C->getAPIntValue().isPowerOf2() &&
14814 TLI.getBooleanContents(N0.getValueType()) ==
14815 TargetLowering::ZeroOrOneBooleanContent) {
14817 // If the caller doesn't want us to simplify this into a zext of a compare,
14819 if (NotExtCompare && N2C->isOne())
14822 // Get a SetCC of the condition
14823 // NOTE: Don't create a SETCC if it's not legal on this target.
14824 if (!LegalOperations ||
14825 TLI.isOperationLegal(ISD::SETCC, N0.getValueType())) {
14827 // cast from setcc result type to select result type
14829 SCC = DAG.getSetCC(DL, getSetCCResultType(N0.getValueType()),
14831 if (N2.getValueType().bitsLT(SCC.getValueType()))
14832 Temp = DAG.getZeroExtendInReg(SCC, SDLoc(N2),
14833 N2.getValueType());
14835 Temp = DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N2),
14836 N2.getValueType(), SCC);
14838 SCC = DAG.getSetCC(SDLoc(N0), MVT::i1, N0, N1, CC);
14839 Temp = DAG.getNode(ISD::ZERO_EXTEND, SDLoc(N2),
14840 N2.getValueType(), SCC);
14843 AddToWorklist(SCC.getNode());
14844 AddToWorklist(Temp.getNode());
14849 // shl setcc result by log2 n2c
14850 return DAG.getNode(
14851 ISD::SHL, DL, N2.getValueType(), Temp,
14852 DAG.getConstant(N2C->getAPIntValue().logBase2(), SDLoc(Temp),
14853 getShiftAmountTy(Temp.getValueType())));
14857 // Check to see if this is an integer abs.
14858 // select_cc setg[te] X, 0, X, -X ->
14859 // select_cc setgt X, -1, X, -X ->
14860 // select_cc setl[te] X, 0, -X, X ->
14861 // select_cc setlt X, 1, -X, X ->
14862 // Y = sra (X, size(X)-1); xor (add (X, Y), Y)
14864 ConstantSDNode *SubC = nullptr;
14865 if (((N1C->isNullValue() && (CC == ISD::SETGT || CC == ISD::SETGE)) ||
14866 (N1C->isAllOnesValue() && CC == ISD::SETGT)) &&
14867 N0 == N2 && N3.getOpcode() == ISD::SUB && N0 == N3.getOperand(1))
14868 SubC = dyn_cast<ConstantSDNode>(N3.getOperand(0));
14869 else if (((N1C->isNullValue() && (CC == ISD::SETLT || CC == ISD::SETLE)) ||
14870 (N1C->isOne() && CC == ISD::SETLT)) &&
14871 N0 == N3 && N2.getOpcode() == ISD::SUB && N0 == N2.getOperand(1))
14872 SubC = dyn_cast<ConstantSDNode>(N2.getOperand(0));
14874 EVT XType = N0.getValueType();
14875 if (SubC && SubC->isNullValue() && XType.isInteger()) {
14877 SDValue Shift = DAG.getNode(ISD::SRA, DL, XType,
14879 DAG.getConstant(XType.getSizeInBits() - 1, DL,
14880 getShiftAmountTy(N0.getValueType())));
14881 SDValue Add = DAG.getNode(ISD::ADD, DL,
14883 AddToWorklist(Shift.getNode());
14884 AddToWorklist(Add.getNode());
14885 return DAG.getNode(ISD::XOR, DL, XType, Add, Shift);
14889 // select_cc seteq X, 0, sizeof(X), ctlz(X) -> ctlz(X)
14890 // select_cc seteq X, 0, sizeof(X), ctlz_zero_undef(X) -> ctlz(X)
14891 // select_cc seteq X, 0, sizeof(X), cttz(X) -> cttz(X)
14892 // select_cc seteq X, 0, sizeof(X), cttz_zero_undef(X) -> cttz(X)
14893 // select_cc setne X, 0, ctlz(X), sizeof(X) -> ctlz(X)
14894 // select_cc setne X, 0, ctlz_zero_undef(X), sizeof(X) -> ctlz(X)
14895 // select_cc setne X, 0, cttz(X), sizeof(X) -> cttz(X)
14896 // select_cc setne X, 0, cttz_zero_undef(X), sizeof(X) -> cttz(X)
14897 if (N1C && N1C->isNullValue() && (CC == ISD::SETEQ || CC == ISD::SETNE)) {
14898 SDValue ValueOnZero = N2;
14899 SDValue Count = N3;
14900 // If the condition is NE instead of E, swap the operands.
14901 if (CC == ISD::SETNE)
14902 std::swap(ValueOnZero, Count);
14903 // Check if the value on zero is a constant equal to the bits in the type.
14904 if (auto *ValueOnZeroC = dyn_cast<ConstantSDNode>(ValueOnZero)) {
14905 if (ValueOnZeroC->getAPIntValue() == VT.getSizeInBits()) {
14906 // If the other operand is cttz/cttz_zero_undef of N0, and cttz is
14907 // legal, combine to just cttz.
14908 if ((Count.getOpcode() == ISD::CTTZ ||
14909 Count.getOpcode() == ISD::CTTZ_ZERO_UNDEF) &&
14910 N0 == Count.getOperand(0) &&
14911 (!LegalOperations || TLI.isOperationLegal(ISD::CTTZ, VT)))
14912 return DAG.getNode(ISD::CTTZ, DL, VT, N0);
14913 // If the other operand is ctlz/ctlz_zero_undef of N0, and ctlz is
14914 // legal, combine to just ctlz.
14915 if ((Count.getOpcode() == ISD::CTLZ ||
14916 Count.getOpcode() == ISD::CTLZ_ZERO_UNDEF) &&
14917 N0 == Count.getOperand(0) &&
14918 (!LegalOperations || TLI.isOperationLegal(ISD::CTLZ, VT)))
14919 return DAG.getNode(ISD::CTLZ, DL, VT, N0);
14927 /// This is a stub for TargetLowering::SimplifySetCC.
14928 SDValue DAGCombiner::SimplifySetCC(EVT VT, SDValue N0, SDValue N1,
14929 ISD::CondCode Cond, const SDLoc &DL,
14930 bool foldBooleans) {
14931 TargetLowering::DAGCombinerInfo
14932 DagCombineInfo(DAG, Level, false, this);
14933 return TLI.SimplifySetCC(VT, N0, N1, Cond, foldBooleans, DagCombineInfo, DL);
14936 /// Given an ISD::SDIV node expressing a divide by constant, return
14937 /// a DAG expression to select that will generate the same value by multiplying
14938 /// by a magic number.
14939 /// Ref: "Hacker's Delight" or "The PowerPC Compiler Writer's Guide".
14940 SDValue DAGCombiner::BuildSDIV(SDNode *N) {
14941 // when optimising for minimum size, we don't want to expand a div to a mul
14943 if (DAG.getMachineFunction().getFunction()->optForMinSize())
14946 ConstantSDNode *C = isConstOrConstSplat(N->getOperand(1));
14950 // Avoid division by zero.
14951 if (C->isNullValue())
14954 std::vector<SDNode*> Built;
14956 TLI.BuildSDIV(N, C->getAPIntValue(), DAG, LegalOperations, &Built);
14958 for (SDNode *N : Built)
14963 /// Given an ISD::SDIV node expressing a divide by constant power of 2, return a
14964 /// DAG expression that will generate the same value by right shifting.
14965 SDValue DAGCombiner::BuildSDIVPow2(SDNode *N) {
14966 ConstantSDNode *C = isConstOrConstSplat(N->getOperand(1));
14970 // Avoid division by zero.
14971 if (C->isNullValue())
14974 std::vector<SDNode *> Built;
14975 SDValue S = TLI.BuildSDIVPow2(N, C->getAPIntValue(), DAG, &Built);
14977 for (SDNode *N : Built)
14982 /// Given an ISD::UDIV node expressing a divide by constant, return a DAG
14983 /// expression that will generate the same value by multiplying by a magic
14985 /// Ref: "Hacker's Delight" or "The PowerPC Compiler Writer's Guide".
14986 SDValue DAGCombiner::BuildUDIV(SDNode *N) {
14987 // when optimising for minimum size, we don't want to expand a div to a mul
14989 if (DAG.getMachineFunction().getFunction()->optForMinSize())
14992 ConstantSDNode *C = isConstOrConstSplat(N->getOperand(1));
14996 // Avoid division by zero.
14997 if (C->isNullValue())
15000 std::vector<SDNode*> Built;
15002 TLI.BuildUDIV(N, C->getAPIntValue(), DAG, LegalOperations, &Built);
15004 for (SDNode *N : Built)
15009 /// Determines the LogBase2 value for a non-null input value using the
15010 /// transform: LogBase2(V) = (EltBits - 1) - ctlz(V).
15011 SDValue DAGCombiner::BuildLogBase2(SDValue V, const SDLoc &DL) {
15012 EVT VT = V.getValueType();
15013 unsigned EltBits = VT.getScalarSizeInBits();
15014 SDValue Ctlz = DAG.getNode(ISD::CTLZ, DL, VT, V);
15015 SDValue Base = DAG.getConstant(EltBits - 1, DL, VT);
15016 SDValue LogBase2 = DAG.getNode(ISD::SUB, DL, VT, Base, Ctlz);
15020 /// Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i)
15021 /// For the reciprocal, we need to find the zero of the function:
15022 /// F(X) = A X - 1 [which has a zero at X = 1/A]
15024 /// X_{i+1} = X_i (2 - A X_i) = X_i + X_i (1 - A X_i) [this second form
15025 /// does not require additional intermediate precision]
15026 SDValue DAGCombiner::BuildReciprocalEstimate(SDValue Op, SDNodeFlags *Flags) {
15027 if (Level >= AfterLegalizeDAG)
15030 // TODO: Handle half and/or extended types?
15031 EVT VT = Op.getValueType();
15032 if (VT.getScalarType() != MVT::f32 && VT.getScalarType() != MVT::f64)
15035 // If estimates are explicitly disabled for this function, we're done.
15036 MachineFunction &MF = DAG.getMachineFunction();
15037 int Enabled = TLI.getRecipEstimateDivEnabled(VT, MF);
15038 if (Enabled == TLI.ReciprocalEstimate::Disabled)
15041 // Estimates may be explicitly enabled for this type with a custom number of
15042 // refinement steps.
15043 int Iterations = TLI.getDivRefinementSteps(VT, MF);
15044 if (SDValue Est = TLI.getRecipEstimate(Op, DAG, Enabled, Iterations)) {
15045 AddToWorklist(Est.getNode());
15048 EVT VT = Op.getValueType();
15050 SDValue FPOne = DAG.getConstantFP(1.0, DL, VT);
15052 // Newton iterations: Est = Est + Est (1 - Arg * Est)
15053 for (int i = 0; i < Iterations; ++i) {
15054 SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Op, Est, Flags);
15055 AddToWorklist(NewEst.getNode());
15057 NewEst = DAG.getNode(ISD::FSUB, DL, VT, FPOne, NewEst, Flags);
15058 AddToWorklist(NewEst.getNode());
15060 NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst, Flags);
15061 AddToWorklist(NewEst.getNode());
15063 Est = DAG.getNode(ISD::FADD, DL, VT, Est, NewEst, Flags);
15064 AddToWorklist(Est.getNode());
15073 /// Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i)
15074 /// For the reciprocal sqrt, we need to find the zero of the function:
15075 /// F(X) = 1/X^2 - A [which has a zero at X = 1/sqrt(A)]
15077 /// X_{i+1} = X_i (1.5 - A X_i^2 / 2)
15078 /// As a result, we precompute A/2 prior to the iteration loop.
15079 SDValue DAGCombiner::buildSqrtNROneConst(SDValue Arg, SDValue Est,
15080 unsigned Iterations,
15081 SDNodeFlags *Flags, bool Reciprocal) {
15082 EVT VT = Arg.getValueType();
15084 SDValue ThreeHalves = DAG.getConstantFP(1.5, DL, VT);
15086 // We now need 0.5 * Arg which we can write as (1.5 * Arg - Arg) so that
15087 // this entire sequence requires only one FP constant.
15088 SDValue HalfArg = DAG.getNode(ISD::FMUL, DL, VT, ThreeHalves, Arg, Flags);
15089 AddToWorklist(HalfArg.getNode());
15091 HalfArg = DAG.getNode(ISD::FSUB, DL, VT, HalfArg, Arg, Flags);
15092 AddToWorklist(HalfArg.getNode());
15094 // Newton iterations: Est = Est * (1.5 - HalfArg * Est * Est)
15095 for (unsigned i = 0; i < Iterations; ++i) {
15096 SDValue NewEst = DAG.getNode(ISD::FMUL, DL, VT, Est, Est, Flags);
15097 AddToWorklist(NewEst.getNode());
15099 NewEst = DAG.getNode(ISD::FMUL, DL, VT, HalfArg, NewEst, Flags);
15100 AddToWorklist(NewEst.getNode());
15102 NewEst = DAG.getNode(ISD::FSUB, DL, VT, ThreeHalves, NewEst, Flags);
15103 AddToWorklist(NewEst.getNode());
15105 Est = DAG.getNode(ISD::FMUL, DL, VT, Est, NewEst, Flags);
15106 AddToWorklist(Est.getNode());
15109 // If non-reciprocal square root is requested, multiply the result by Arg.
15111 Est = DAG.getNode(ISD::FMUL, DL, VT, Est, Arg, Flags);
15112 AddToWorklist(Est.getNode());
15118 /// Newton iteration for a function: F(X) is X_{i+1} = X_i - F(X_i)/F'(X_i)
15119 /// For the reciprocal sqrt, we need to find the zero of the function:
15120 /// F(X) = 1/X^2 - A [which has a zero at X = 1/sqrt(A)]
15122 /// X_{i+1} = (-0.5 * X_i) * (A * X_i * X_i + (-3.0))
15123 SDValue DAGCombiner::buildSqrtNRTwoConst(SDValue Arg, SDValue Est,
15124 unsigned Iterations,
15125 SDNodeFlags *Flags, bool Reciprocal) {
15126 EVT VT = Arg.getValueType();
15128 SDValue MinusThree = DAG.getConstantFP(-3.0, DL, VT);
15129 SDValue MinusHalf = DAG.getConstantFP(-0.5, DL, VT);
15131 // This routine must enter the loop below to work correctly
15132 // when (Reciprocal == false).
15133 assert(Iterations > 0);
15135 // Newton iterations for reciprocal square root:
15136 // E = (E * -0.5) * ((A * E) * E + -3.0)
15137 for (unsigned i = 0; i < Iterations; ++i) {
15138 SDValue AE = DAG.getNode(ISD::FMUL, DL, VT, Arg, Est, Flags);
15139 AddToWorklist(AE.getNode());
15141 SDValue AEE = DAG.getNode(ISD::FMUL, DL, VT, AE, Est, Flags);
15142 AddToWorklist(AEE.getNode());
15144 SDValue RHS = DAG.getNode(ISD::FADD, DL, VT, AEE, MinusThree, Flags);
15145 AddToWorklist(RHS.getNode());
15147 // When calculating a square root at the last iteration build:
15148 // S = ((A * E) * -0.5) * ((A * E) * E + -3.0)
15149 // (notice a common subexpression)
15151 if (Reciprocal || (i + 1) < Iterations) {
15152 // RSQRT: LHS = (E * -0.5)
15153 LHS = DAG.getNode(ISD::FMUL, DL, VT, Est, MinusHalf, Flags);
15155 // SQRT: LHS = (A * E) * -0.5
15156 LHS = DAG.getNode(ISD::FMUL, DL, VT, AE, MinusHalf, Flags);
15158 AddToWorklist(LHS.getNode());
15160 Est = DAG.getNode(ISD::FMUL, DL, VT, LHS, RHS, Flags);
15161 AddToWorklist(Est.getNode());
15167 /// Build code to calculate either rsqrt(Op) or sqrt(Op). In the latter case
15168 /// Op*rsqrt(Op) is actually computed, so additional postprocessing is needed if
15169 /// Op can be zero.
15170 SDValue DAGCombiner::buildSqrtEstimateImpl(SDValue Op, SDNodeFlags *Flags,
15172 if (Level >= AfterLegalizeDAG)
15175 // TODO: Handle half and/or extended types?
15176 EVT VT = Op.getValueType();
15177 if (VT.getScalarType() != MVT::f32 && VT.getScalarType() != MVT::f64)
15180 // If estimates are explicitly disabled for this function, we're done.
15181 MachineFunction &MF = DAG.getMachineFunction();
15182 int Enabled = TLI.getRecipEstimateSqrtEnabled(VT, MF);
15183 if (Enabled == TLI.ReciprocalEstimate::Disabled)
15186 // Estimates may be explicitly enabled for this type with a custom number of
15187 // refinement steps.
15188 int Iterations = TLI.getSqrtRefinementSteps(VT, MF);
15190 bool UseOneConstNR = false;
15192 TLI.getSqrtEstimate(Op, DAG, Enabled, Iterations, UseOneConstNR,
15194 AddToWorklist(Est.getNode());
15197 Est = UseOneConstNR
15198 ? buildSqrtNROneConst(Op, Est, Iterations, Flags, Reciprocal)
15199 : buildSqrtNRTwoConst(Op, Est, Iterations, Flags, Reciprocal);
15202 // Unfortunately, Est is now NaN if the input was exactly 0.0.
15203 // Select out this case and force the answer to 0.0.
15204 EVT VT = Op.getValueType();
15207 SDValue FPZero = DAG.getConstantFP(0.0, DL, VT);
15208 EVT CCVT = getSetCCResultType(VT);
15209 SDValue ZeroCmp = DAG.getSetCC(DL, CCVT, Op, FPZero, ISD::SETEQ);
15210 AddToWorklist(ZeroCmp.getNode());
15212 Est = DAG.getNode(VT.isVector() ? ISD::VSELECT : ISD::SELECT, DL, VT,
15213 ZeroCmp, FPZero, Est);
15214 AddToWorklist(Est.getNode());
15223 SDValue DAGCombiner::buildRsqrtEstimate(SDValue Op, SDNodeFlags *Flags) {
15224 return buildSqrtEstimateImpl(Op, Flags, true);
15227 SDValue DAGCombiner::buildSqrtEstimate(SDValue Op, SDNodeFlags *Flags) {
15228 return buildSqrtEstimateImpl(Op, Flags, false);
15231 /// Return true if base is a frame index, which is known not to alias with
15232 /// anything but itself. Provides base object and offset as results.
15233 static bool FindBaseOffset(SDValue Ptr, SDValue &Base, int64_t &Offset,
15234 const GlobalValue *&GV, const void *&CV) {
15235 // Assume it is a primitive operation.
15236 Base = Ptr; Offset = 0; GV = nullptr; CV = nullptr;
15238 // If it's an adding a simple constant then integrate the offset.
15239 if (Base.getOpcode() == ISD::ADD) {
15240 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Base.getOperand(1))) {
15241 Base = Base.getOperand(0);
15242 Offset += C->getZExtValue();
15246 // Return the underlying GlobalValue, and update the Offset. Return false
15247 // for GlobalAddressSDNode since the same GlobalAddress may be represented
15248 // by multiple nodes with different offsets.
15249 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Base)) {
15250 GV = G->getGlobal();
15251 Offset += G->getOffset();
15255 // Return the underlying Constant value, and update the Offset. Return false
15256 // for ConstantSDNodes since the same constant pool entry may be represented
15257 // by multiple nodes with different offsets.
15258 if (ConstantPoolSDNode *C = dyn_cast<ConstantPoolSDNode>(Base)) {
15259 CV = C->isMachineConstantPoolEntry() ? (const void *)C->getMachineCPVal()
15260 : (const void *)C->getConstVal();
15261 Offset += C->getOffset();
15264 // If it's any of the following then it can't alias with anything but itself.
15265 return isa<FrameIndexSDNode>(Base);
15268 /// Return true if there is any possibility that the two addresses overlap.
15269 bool DAGCombiner::isAlias(LSBaseSDNode *Op0, LSBaseSDNode *Op1) const {
15270 // If they are the same then they must be aliases.
15271 if (Op0->getBasePtr() == Op1->getBasePtr()) return true;
15273 // If they are both volatile then they cannot be reordered.
15274 if (Op0->isVolatile() && Op1->isVolatile()) return true;
15276 // If one operation reads from invariant memory, and the other may store, they
15277 // cannot alias. These should really be checking the equivalent of mayWrite,
15278 // but it only matters for memory nodes other than load /store.
15279 if (Op0->isInvariant() && Op1->writeMem())
15282 if (Op1->isInvariant() && Op0->writeMem())
15285 // Gather base node and offset information.
15286 SDValue Base1, Base2;
15287 int64_t Offset1, Offset2;
15288 const GlobalValue *GV1, *GV2;
15289 const void *CV1, *CV2;
15290 bool isFrameIndex1 = FindBaseOffset(Op0->getBasePtr(),
15291 Base1, Offset1, GV1, CV1);
15292 bool isFrameIndex2 = FindBaseOffset(Op1->getBasePtr(),
15293 Base2, Offset2, GV2, CV2);
15295 // If they have a same base address then check to see if they overlap.
15296 if (Base1 == Base2 || (GV1 && (GV1 == GV2)) || (CV1 && (CV1 == CV2)))
15297 return !((Offset1 + (Op0->getMemoryVT().getSizeInBits() >> 3)) <= Offset2 ||
15298 (Offset2 + (Op1->getMemoryVT().getSizeInBits() >> 3)) <= Offset1);
15300 // It is possible for different frame indices to alias each other, mostly
15301 // when tail call optimization reuses return address slots for arguments.
15302 // To catch this case, look up the actual index of frame indices to compute
15303 // the real alias relationship.
15304 if (isFrameIndex1 && isFrameIndex2) {
15305 MachineFrameInfo &MFI = DAG.getMachineFunction().getFrameInfo();
15306 Offset1 += MFI.getObjectOffset(cast<FrameIndexSDNode>(Base1)->getIndex());
15307 Offset2 += MFI.getObjectOffset(cast<FrameIndexSDNode>(Base2)->getIndex());
15308 return !((Offset1 + (Op0->getMemoryVT().getSizeInBits() >> 3)) <= Offset2 ||
15309 (Offset2 + (Op1->getMemoryVT().getSizeInBits() >> 3)) <= Offset1);
15312 // Otherwise, if we know what the bases are, and they aren't identical, then
15313 // we know they cannot alias.
15314 if ((isFrameIndex1 || CV1 || GV1) && (isFrameIndex2 || CV2 || GV2))
15317 // If we know required SrcValue1 and SrcValue2 have relatively large alignment
15318 // compared to the size and offset of the access, we may be able to prove they
15319 // do not alias. This check is conservative for now to catch cases created by
15320 // splitting vector types.
15321 if ((Op0->getOriginalAlignment() == Op1->getOriginalAlignment()) &&
15322 (Op0->getSrcValueOffset() != Op1->getSrcValueOffset()) &&
15323 (Op0->getMemoryVT().getSizeInBits() >> 3 ==
15324 Op1->getMemoryVT().getSizeInBits() >> 3) &&
15325 (Op0->getOriginalAlignment() > (Op0->getMemoryVT().getSizeInBits() >> 3))) {
15326 int64_t OffAlign1 = Op0->getSrcValueOffset() % Op0->getOriginalAlignment();
15327 int64_t OffAlign2 = Op1->getSrcValueOffset() % Op1->getOriginalAlignment();
15329 // There is no overlap between these relatively aligned accesses of similar
15330 // size, return no alias.
15331 if ((OffAlign1 + (Op0->getMemoryVT().getSizeInBits() >> 3)) <= OffAlign2 ||
15332 (OffAlign2 + (Op1->getMemoryVT().getSizeInBits() >> 3)) <= OffAlign1)
15336 bool UseAA = CombinerGlobalAA.getNumOccurrences() > 0
15338 : DAG.getSubtarget().useAA();
15340 if (CombinerAAOnlyFunc.getNumOccurrences() &&
15341 CombinerAAOnlyFunc != DAG.getMachineFunction().getName())
15345 Op0->getMemOperand()->getValue() && Op1->getMemOperand()->getValue()) {
15346 // Use alias analysis information.
15347 int64_t MinOffset = std::min(Op0->getSrcValueOffset(),
15348 Op1->getSrcValueOffset());
15349 int64_t Overlap1 = (Op0->getMemoryVT().getSizeInBits() >> 3) +
15350 Op0->getSrcValueOffset() - MinOffset;
15351 int64_t Overlap2 = (Op1->getMemoryVT().getSizeInBits() >> 3) +
15352 Op1->getSrcValueOffset() - MinOffset;
15353 AliasResult AAResult =
15354 AA.alias(MemoryLocation(Op0->getMemOperand()->getValue(), Overlap1,
15355 UseTBAA ? Op0->getAAInfo() : AAMDNodes()),
15356 MemoryLocation(Op1->getMemOperand()->getValue(), Overlap2,
15357 UseTBAA ? Op1->getAAInfo() : AAMDNodes()));
15358 if (AAResult == NoAlias)
15362 // Otherwise we have to assume they alias.
15366 /// Walk up chain skipping non-aliasing memory nodes,
15367 /// looking for aliasing nodes and adding them to the Aliases vector.
15368 void DAGCombiner::GatherAllAliases(SDNode *N, SDValue OriginalChain,
15369 SmallVectorImpl<SDValue> &Aliases) {
15370 SmallVector<SDValue, 8> Chains; // List of chains to visit.
15371 SmallPtrSet<SDNode *, 16> Visited; // Visited node set.
15373 // Get alias information for node.
15374 bool IsLoad = isa<LoadSDNode>(N) && !cast<LSBaseSDNode>(N)->isVolatile();
15377 Chains.push_back(OriginalChain);
15378 unsigned Depth = 0;
15380 // Look at each chain and determine if it is an alias. If so, add it to the
15381 // aliases list. If not, then continue up the chain looking for the next
15383 while (!Chains.empty()) {
15384 SDValue Chain = Chains.pop_back_val();
15386 // For TokenFactor nodes, look at each operand and only continue up the
15387 // chain until we reach the depth limit.
15389 // FIXME: The depth check could be made to return the last non-aliasing
15390 // chain we found before we hit a tokenfactor rather than the original
15392 if (Depth > TLI.getGatherAllAliasesMaxDepth()) {
15394 Aliases.push_back(OriginalChain);
15398 // Don't bother if we've been before.
15399 if (!Visited.insert(Chain.getNode()).second)
15402 switch (Chain.getOpcode()) {
15403 case ISD::EntryToken:
15404 // Entry token is ideal chain operand, but handled in FindBetterChain.
15409 // Get alias information for Chain.
15410 bool IsOpLoad = isa<LoadSDNode>(Chain.getNode()) &&
15411 !cast<LSBaseSDNode>(Chain.getNode())->isVolatile();
15413 // If chain is alias then stop here.
15414 if (!(IsLoad && IsOpLoad) &&
15415 isAlias(cast<LSBaseSDNode>(N), cast<LSBaseSDNode>(Chain.getNode()))) {
15416 Aliases.push_back(Chain);
15418 // Look further up the chain.
15419 Chains.push_back(Chain.getOperand(0));
15425 case ISD::TokenFactor:
15426 // We have to check each of the operands of the token factor for "small"
15427 // token factors, so we queue them up. Adding the operands to the queue
15428 // (stack) in reverse order maintains the original order and increases the
15429 // likelihood that getNode will find a matching token factor (CSE.)
15430 if (Chain.getNumOperands() > 16) {
15431 Aliases.push_back(Chain);
15434 for (unsigned n = Chain.getNumOperands(); n;)
15435 Chains.push_back(Chain.getOperand(--n));
15440 // For all other instructions we will just have to take what we can get.
15441 Aliases.push_back(Chain);
15447 /// Walk up chain skipping non-aliasing memory nodes, looking for a better chain
15448 /// (aliasing node.)
15449 SDValue DAGCombiner::FindBetterChain(SDNode *N, SDValue OldChain) {
15450 SmallVector<SDValue, 8> Aliases; // Ops for replacing token factor.
15452 // Accumulate all the aliases to this node.
15453 GatherAllAliases(N, OldChain, Aliases);
15455 // If no operands then chain to entry token.
15456 if (Aliases.size() == 0)
15457 return DAG.getEntryNode();
15459 // If a single operand then chain to it. We don't need to revisit it.
15460 if (Aliases.size() == 1)
15463 // Construct a custom tailored token factor.
15464 return DAG.getNode(ISD::TokenFactor, SDLoc(N), MVT::Other, Aliases);
15467 bool DAGCombiner::findBetterNeighborChains(StoreSDNode *St) {
15468 // This holds the base pointer, index, and the offset in bytes from the base
15470 BaseIndexOffset BasePtr = BaseIndexOffset::match(St->getBasePtr(), DAG);
15472 // We must have a base and an offset.
15473 if (!BasePtr.Base.getNode())
15476 // Do not handle stores to undef base pointers.
15477 if (BasePtr.Base.isUndef())
15480 SmallVector<StoreSDNode *, 8> ChainedStores;
15481 ChainedStores.push_back(St);
15483 // Walk up the chain and look for nodes with offsets from the same
15484 // base pointer. Stop when reaching an instruction with a different kind
15485 // or instruction which has a different base pointer.
15486 StoreSDNode *Index = St;
15488 // If the chain has more than one use, then we can't reorder the mem ops.
15489 if (Index != St && !SDValue(Index, 0)->hasOneUse())
15492 if (Index->isVolatile() || Index->isIndexed())
15495 // Find the base pointer and offset for this memory node.
15496 BaseIndexOffset Ptr = BaseIndexOffset::match(Index->getBasePtr(), DAG);
15498 // Check that the base pointer is the same as the original one.
15499 if (!Ptr.equalBaseIndex(BasePtr))
15502 // Find the next memory operand in the chain. If the next operand in the
15503 // chain is a store then move up and continue the scan with the next
15504 // memory operand. If the next operand is a load save it and use alias
15505 // information to check if it interferes with anything.
15506 SDNode *NextInChain = Index->getChain().getNode();
15508 if (StoreSDNode *STn = dyn_cast<StoreSDNode>(NextInChain)) {
15509 // We found a store node. Use it for the next iteration.
15510 if (STn->isVolatile() || STn->isIndexed()) {
15514 ChainedStores.push_back(STn);
15517 } else if (LoadSDNode *Ldn = dyn_cast<LoadSDNode>(NextInChain)) {
15518 NextInChain = Ldn->getChain().getNode();
15527 bool MadeChangeToSt = false;
15528 SmallVector<std::pair<StoreSDNode *, SDValue>, 8> BetterChains;
15530 for (StoreSDNode *ChainedStore : ChainedStores) {
15531 SDValue Chain = ChainedStore->getChain();
15532 SDValue BetterChain = FindBetterChain(ChainedStore, Chain);
15534 if (Chain != BetterChain) {
15535 if (ChainedStore == St)
15536 MadeChangeToSt = true;
15537 BetterChains.push_back(std::make_pair(ChainedStore, BetterChain));
15541 // Do all replacements after finding the replacements to make to avoid making
15542 // the chains more complicated by introducing new TokenFactors.
15543 for (auto Replacement : BetterChains)
15544 replaceStoreChain(Replacement.first, Replacement.second);
15546 return MadeChangeToSt;
15549 /// This is the entry point for the file.
15550 void SelectionDAG::Combine(CombineLevel Level, AliasAnalysis &AA,
15551 CodeGenOpt::Level OptLevel) {
15552 /// This is the main entry point to this class.
15553 DAGCombiner(*this, AA, OptLevel).Run(Level);