DAGCombiner.cpp revision d303da66e894ca276164414ceb99b18eb9e1dae0
1//===-- DAGCombiner.cpp - Implement a DAG node combiner -------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 10// This pass combines dag nodes to form fewer, simpler DAG nodes. It can be run 11// both before and after the DAG is legalized. 12// 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. 16// 17//===----------------------------------------------------------------------===// 18 19#define DEBUG_TYPE "dagcombine" 20#include "llvm/CodeGen/SelectionDAG.h" 21#include "llvm/DerivedTypes.h" 22#include "llvm/LLVMContext.h" 23#include "llvm/CodeGen/MachineFunction.h" 24#include "llvm/CodeGen/MachineFrameInfo.h" 25#include "llvm/CodeGen/PseudoSourceValue.h" 26#include "llvm/Analysis/AliasAnalysis.h" 27#include "llvm/Target/TargetData.h" 28#include "llvm/Target/TargetFrameInfo.h" 29#include "llvm/Target/TargetLowering.h" 30#include "llvm/Target/TargetMachine.h" 31#include "llvm/Target/TargetOptions.h" 32#include "llvm/ADT/SmallPtrSet.h" 33#include "llvm/ADT/Statistic.h" 34#include "llvm/Support/CommandLine.h" 35#include "llvm/Support/Debug.h" 36#include "llvm/Support/ErrorHandling.h" 37#include "llvm/Support/MathExtras.h" 38#include "llvm/Support/raw_ostream.h" 39#include <algorithm> 40using namespace llvm; 41 42STATISTIC(NodesCombined , "Number of dag nodes combined"); 43STATISTIC(PreIndexedNodes , "Number of pre-indexed nodes created"); 44STATISTIC(PostIndexedNodes, "Number of post-indexed nodes created"); 45STATISTIC(OpsNarrowed , "Number of load/op/store narrowed"); 46 47namespace { 48 static cl::opt<bool> 49 CombinerAA("combiner-alias-analysis", cl::Hidden, 50 cl::desc("Turn on alias analysis during testing")); 51 52 static cl::opt<bool> 53 CombinerGlobalAA("combiner-global-alias-analysis", cl::Hidden, 54 cl::desc("Include global information in alias analysis")); 55 56//------------------------------ DAGCombiner ---------------------------------// 57 58 class DAGCombiner { 59 SelectionDAG &DAG; 60 const TargetLowering &TLI; 61 CombineLevel Level; 62 CodeGenOpt::Level OptLevel; 63 bool LegalOperations; 64 bool LegalTypes; 65 66 // Worklist of all of the nodes that need to be simplified. 67 std::vector<SDNode*> WorkList; 68 69 // AA - Used for DAG load/store alias analysis. 70 AliasAnalysis &AA; 71 72 /// AddUsersToWorkList - When an instruction is simplified, add all users of 73 /// the instruction to the work lists because they might get more simplified 74 /// now. 75 /// 76 void AddUsersToWorkList(SDNode *N) { 77 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end(); 78 UI != UE; ++UI) 79 AddToWorkList(*UI); 80 } 81 82 /// visit - call the node-specific routine that knows how to fold each 83 /// particular type of node. 84 SDValue visit(SDNode *N); 85 86 public: 87 /// AddToWorkList - Add to the work list making sure it's instance is at the 88 /// the back (next to be processed.) 89 void AddToWorkList(SDNode *N) { 90 removeFromWorkList(N); 91 WorkList.push_back(N); 92 } 93 94 /// removeFromWorkList - remove all instances of N from the worklist. 95 /// 96 void removeFromWorkList(SDNode *N) { 97 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N), 98 WorkList.end()); 99 } 100 101 SDValue CombineTo(SDNode *N, const SDValue *To, unsigned NumTo, 102 bool AddTo = true); 103 104 SDValue CombineTo(SDNode *N, SDValue Res, bool AddTo = true) { 105 return CombineTo(N, &Res, 1, AddTo); 106 } 107 108 SDValue CombineTo(SDNode *N, SDValue Res0, SDValue Res1, 109 bool AddTo = true) { 110 SDValue To[] = { Res0, Res1 }; 111 return CombineTo(N, To, 2, AddTo); 112 } 113 114 void CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO); 115 116 private: 117 118 /// SimplifyDemandedBits - Check the specified integer node value to see if 119 /// it can be simplified or if things it uses can be simplified by bit 120 /// propagation. If so, return true. 121 bool SimplifyDemandedBits(SDValue Op) { 122 unsigned BitWidth = Op.getValueType().getScalarType().getSizeInBits(); 123 APInt Demanded = APInt::getAllOnesValue(BitWidth); 124 return SimplifyDemandedBits(Op, Demanded); 125 } 126 127 bool SimplifyDemandedBits(SDValue Op, const APInt &Demanded); 128 129 bool CombineToPreIndexedLoadStore(SDNode *N); 130 bool CombineToPostIndexedLoadStore(SDNode *N); 131 132 void ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad); 133 SDValue PromoteOperand(SDValue Op, EVT PVT, bool &Replace); 134 SDValue SExtPromoteOperand(SDValue Op, EVT PVT); 135 SDValue ZExtPromoteOperand(SDValue Op, EVT PVT); 136 SDValue PromoteIntBinOp(SDValue Op); 137 SDValue PromoteIntShiftOp(SDValue Op); 138 SDValue PromoteExtend(SDValue Op); 139 bool PromoteLoad(SDValue Op); 140 141 /// combine - call the node-specific routine that knows how to fold each 142 /// particular type of node. If that doesn't do anything, try the 143 /// target-specific DAG combines. 144 SDValue combine(SDNode *N); 145 146 // Visitation implementation - Implement dag node combining for different 147 // node types. The semantics are as follows: 148 // Return Value: 149 // SDValue.getNode() == 0 - No change was made 150 // SDValue.getNode() == N - N was replaced, is dead and has been handled. 151 // otherwise - N should be replaced by the returned Operand. 152 // 153 SDValue visitTokenFactor(SDNode *N); 154 SDValue visitMERGE_VALUES(SDNode *N); 155 SDValue visitADD(SDNode *N); 156 SDValue visitSUB(SDNode *N); 157 SDValue visitADDC(SDNode *N); 158 SDValue visitADDE(SDNode *N); 159 SDValue visitMUL(SDNode *N); 160 SDValue visitSDIV(SDNode *N); 161 SDValue visitUDIV(SDNode *N); 162 SDValue visitSREM(SDNode *N); 163 SDValue visitUREM(SDNode *N); 164 SDValue visitMULHU(SDNode *N); 165 SDValue visitMULHS(SDNode *N); 166 SDValue visitSMUL_LOHI(SDNode *N); 167 SDValue visitUMUL_LOHI(SDNode *N); 168 SDValue visitSDIVREM(SDNode *N); 169 SDValue visitUDIVREM(SDNode *N); 170 SDValue visitAND(SDNode *N); 171 SDValue visitOR(SDNode *N); 172 SDValue visitXOR(SDNode *N); 173 SDValue SimplifyVBinOp(SDNode *N); 174 SDValue visitSHL(SDNode *N); 175 SDValue visitSRA(SDNode *N); 176 SDValue visitSRL(SDNode *N); 177 SDValue visitCTLZ(SDNode *N); 178 SDValue visitCTTZ(SDNode *N); 179 SDValue visitCTPOP(SDNode *N); 180 SDValue visitSELECT(SDNode *N); 181 SDValue visitSELECT_CC(SDNode *N); 182 SDValue visitSETCC(SDNode *N); 183 SDValue visitSIGN_EXTEND(SDNode *N); 184 SDValue visitZERO_EXTEND(SDNode *N); 185 SDValue visitANY_EXTEND(SDNode *N); 186 SDValue visitSIGN_EXTEND_INREG(SDNode *N); 187 SDValue visitTRUNCATE(SDNode *N); 188 SDValue visitBIT_CONVERT(SDNode *N); 189 SDValue visitBUILD_PAIR(SDNode *N); 190 SDValue visitFADD(SDNode *N); 191 SDValue visitFSUB(SDNode *N); 192 SDValue visitFMUL(SDNode *N); 193 SDValue visitFDIV(SDNode *N); 194 SDValue visitFREM(SDNode *N); 195 SDValue visitFCOPYSIGN(SDNode *N); 196 SDValue visitSINT_TO_FP(SDNode *N); 197 SDValue visitUINT_TO_FP(SDNode *N); 198 SDValue visitFP_TO_SINT(SDNode *N); 199 SDValue visitFP_TO_UINT(SDNode *N); 200 SDValue visitFP_ROUND(SDNode *N); 201 SDValue visitFP_ROUND_INREG(SDNode *N); 202 SDValue visitFP_EXTEND(SDNode *N); 203 SDValue visitFNEG(SDNode *N); 204 SDValue visitFABS(SDNode *N); 205 SDValue visitBRCOND(SDNode *N); 206 SDValue visitBR_CC(SDNode *N); 207 SDValue visitLOAD(SDNode *N); 208 SDValue visitSTORE(SDNode *N); 209 SDValue visitINSERT_VECTOR_ELT(SDNode *N); 210 SDValue visitEXTRACT_VECTOR_ELT(SDNode *N); 211 SDValue visitBUILD_VECTOR(SDNode *N); 212 SDValue visitCONCAT_VECTORS(SDNode *N); 213 SDValue visitVECTOR_SHUFFLE(SDNode *N); 214 SDValue visitMEMBARRIER(SDNode *N); 215 216 SDValue XformToShuffleWithZero(SDNode *N); 217 SDValue ReassociateOps(unsigned Opc, DebugLoc DL, SDValue LHS, SDValue RHS); 218 219 SDValue visitShiftByConstant(SDNode *N, unsigned Amt); 220 221 bool SimplifySelectOps(SDNode *SELECT, SDValue LHS, SDValue RHS); 222 SDValue SimplifyBinOpWithSameOpcodeHands(SDNode *N); 223 SDValue SimplifySelect(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2); 224 SDValue SimplifySelectCC(DebugLoc DL, SDValue N0, SDValue N1, SDValue N2, 225 SDValue N3, ISD::CondCode CC, 226 bool NotExtCompare = false); 227 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond, 228 DebugLoc DL, bool foldBooleans = true); 229 SDValue SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp, 230 unsigned HiOp); 231 SDValue CombineConsecutiveLoads(SDNode *N, EVT VT); 232 SDValue ConstantFoldBIT_CONVERTofBUILD_VECTOR(SDNode *, EVT); 233 SDValue BuildSDIV(SDNode *N); 234 SDValue BuildUDIV(SDNode *N); 235 SDNode *MatchRotate(SDValue LHS, SDValue RHS, DebugLoc DL); 236 SDValue ReduceLoadWidth(SDNode *N); 237 SDValue ReduceLoadOpStoreWidth(SDNode *N); 238 239 SDValue GetDemandedBits(SDValue V, const APInt &Mask); 240 241 /// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes, 242 /// looking for aliasing nodes and adding them to the Aliases vector. 243 void GatherAllAliases(SDNode *N, SDValue OriginalChain, 244 SmallVector<SDValue, 8> &Aliases); 245 246 /// isAlias - Return true if there is any possibility that the two addresses 247 /// overlap. 248 bool isAlias(SDValue Ptr1, int64_t Size1, 249 const Value *SrcValue1, int SrcValueOffset1, 250 unsigned SrcValueAlign1, 251 SDValue Ptr2, int64_t Size2, 252 const Value *SrcValue2, int SrcValueOffset2, 253 unsigned SrcValueAlign2) const; 254 255 /// FindAliasInfo - Extracts the relevant alias information from the memory 256 /// node. Returns true if the operand was a load. 257 bool FindAliasInfo(SDNode *N, 258 SDValue &Ptr, int64_t &Size, 259 const Value *&SrcValue, int &SrcValueOffset, 260 unsigned &SrcValueAlignment) const; 261 262 /// FindBetterChain - Walk up chain skipping non-aliasing memory nodes, 263 /// looking for a better chain (aliasing node.) 264 SDValue FindBetterChain(SDNode *N, SDValue Chain); 265 266 public: 267 DAGCombiner(SelectionDAG &D, AliasAnalysis &A, CodeGenOpt::Level OL) 268 : DAG(D), TLI(D.getTargetLoweringInfo()), Level(Unrestricted), 269 OptLevel(OL), LegalOperations(false), LegalTypes(false), AA(A) {} 270 271 /// Run - runs the dag combiner on all nodes in the work list 272 void Run(CombineLevel AtLevel); 273 274 SelectionDAG &getDAG() const { return DAG; } 275 276 /// getShiftAmountTy - Returns a type large enough to hold any valid 277 /// shift amount - before type legalization these can be huge. 278 EVT getShiftAmountTy() { 279 return LegalTypes ? TLI.getShiftAmountTy() : TLI.getPointerTy(); 280 } 281 282 /// isTypeLegal - This method returns true if we are running before type 283 /// legalization or if the specified VT is legal. 284 bool isTypeLegal(const EVT &VT) { 285 if (!LegalTypes) return true; 286 return TLI.isTypeLegal(VT); 287 } 288 }; 289} 290 291 292namespace { 293/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 294/// nodes from the worklist. 295class WorkListRemover : public SelectionDAG::DAGUpdateListener { 296 DAGCombiner &DC; 297public: 298 explicit WorkListRemover(DAGCombiner &dc) : DC(dc) {} 299 300 virtual void NodeDeleted(SDNode *N, SDNode *E) { 301 DC.removeFromWorkList(N); 302 } 303 304 virtual void NodeUpdated(SDNode *N) { 305 // Ignore updates. 306 } 307}; 308} 309 310//===----------------------------------------------------------------------===// 311// TargetLowering::DAGCombinerInfo implementation 312//===----------------------------------------------------------------------===// 313 314void TargetLowering::DAGCombinerInfo::AddToWorklist(SDNode *N) { 315 ((DAGCombiner*)DC)->AddToWorkList(N); 316} 317 318SDValue TargetLowering::DAGCombinerInfo:: 319CombineTo(SDNode *N, const std::vector<SDValue> &To, bool AddTo) { 320 return ((DAGCombiner*)DC)->CombineTo(N, &To[0], To.size(), AddTo); 321} 322 323SDValue TargetLowering::DAGCombinerInfo:: 324CombineTo(SDNode *N, SDValue Res, bool AddTo) { 325 return ((DAGCombiner*)DC)->CombineTo(N, Res, AddTo); 326} 327 328 329SDValue TargetLowering::DAGCombinerInfo:: 330CombineTo(SDNode *N, SDValue Res0, SDValue Res1, bool AddTo) { 331 return ((DAGCombiner*)DC)->CombineTo(N, Res0, Res1, AddTo); 332} 333 334void TargetLowering::DAGCombinerInfo:: 335CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) { 336 return ((DAGCombiner*)DC)->CommitTargetLoweringOpt(TLO); 337} 338 339//===----------------------------------------------------------------------===// 340// Helper Functions 341//===----------------------------------------------------------------------===// 342 343/// isNegatibleForFree - Return 1 if we can compute the negated form of the 344/// specified expression for the same cost as the expression itself, or 2 if we 345/// can compute the negated form more cheaply than the expression itself. 346static char isNegatibleForFree(SDValue Op, bool LegalOperations, 347 unsigned Depth = 0) { 348 // No compile time optimizations on this type. 349 if (Op.getValueType() == MVT::ppcf128) 350 return 0; 351 352 // fneg is removable even if it has multiple uses. 353 if (Op.getOpcode() == ISD::FNEG) return 2; 354 355 // Don't allow anything with multiple uses. 356 if (!Op.hasOneUse()) return 0; 357 358 // Don't recurse exponentially. 359 if (Depth > 6) return 0; 360 361 switch (Op.getOpcode()) { 362 default: return false; 363 case ISD::ConstantFP: 364 // Don't invert constant FP values after legalize. The negated constant 365 // isn't necessarily legal. 366 return LegalOperations ? 0 : 1; 367 case ISD::FADD: 368 // FIXME: determine better conditions for this xform. 369 if (!UnsafeFPMath) return 0; 370 371 // fold (fsub (fadd A, B)) -> (fsub (fneg A), B) 372 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1)) 373 return V; 374 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A) 375 return isNegatibleForFree(Op.getOperand(1), LegalOperations, Depth+1); 376 case ISD::FSUB: 377 // We can't turn -(A-B) into B-A when we honor signed zeros. 378 if (!UnsafeFPMath) return 0; 379 380 // fold (fneg (fsub A, B)) -> (fsub B, A) 381 return 1; 382 383 case ISD::FMUL: 384 case ISD::FDIV: 385 if (HonorSignDependentRoundingFPMath()) return 0; 386 387 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y) or (fmul X, (fneg Y)) 388 if (char V = isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1)) 389 return V; 390 391 return isNegatibleForFree(Op.getOperand(1), LegalOperations, Depth+1); 392 393 case ISD::FP_EXTEND: 394 case ISD::FP_ROUND: 395 case ISD::FSIN: 396 return isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1); 397 } 398} 399 400/// GetNegatedExpression - If isNegatibleForFree returns true, this function 401/// returns the newly negated expression. 402static SDValue GetNegatedExpression(SDValue Op, SelectionDAG &DAG, 403 bool LegalOperations, unsigned Depth = 0) { 404 // fneg is removable even if it has multiple uses. 405 if (Op.getOpcode() == ISD::FNEG) return Op.getOperand(0); 406 407 // Don't allow anything with multiple uses. 408 assert(Op.hasOneUse() && "Unknown reuse!"); 409 410 assert(Depth <= 6 && "GetNegatedExpression doesn't match isNegatibleForFree"); 411 switch (Op.getOpcode()) { 412 default: llvm_unreachable("Unknown code"); 413 case ISD::ConstantFP: { 414 APFloat V = cast<ConstantFPSDNode>(Op)->getValueAPF(); 415 V.changeSign(); 416 return DAG.getConstantFP(V, Op.getValueType()); 417 } 418 case ISD::FADD: 419 // FIXME: determine better conditions for this xform. 420 assert(UnsafeFPMath); 421 422 // fold (fneg (fadd A, B)) -> (fsub (fneg A), B) 423 if (isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1)) 424 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(), 425 GetNegatedExpression(Op.getOperand(0), DAG, 426 LegalOperations, Depth+1), 427 Op.getOperand(1)); 428 // fold (fneg (fadd A, B)) -> (fsub (fneg B), A) 429 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(), 430 GetNegatedExpression(Op.getOperand(1), DAG, 431 LegalOperations, Depth+1), 432 Op.getOperand(0)); 433 case ISD::FSUB: 434 // We can't turn -(A-B) into B-A when we honor signed zeros. 435 assert(UnsafeFPMath); 436 437 // fold (fneg (fsub 0, B)) -> B 438 if (ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(Op.getOperand(0))) 439 if (N0CFP->getValueAPF().isZero()) 440 return Op.getOperand(1); 441 442 // fold (fneg (fsub A, B)) -> (fsub B, A) 443 return DAG.getNode(ISD::FSUB, Op.getDebugLoc(), Op.getValueType(), 444 Op.getOperand(1), Op.getOperand(0)); 445 446 case ISD::FMUL: 447 case ISD::FDIV: 448 assert(!HonorSignDependentRoundingFPMath()); 449 450 // fold (fneg (fmul X, Y)) -> (fmul (fneg X), Y) 451 if (isNegatibleForFree(Op.getOperand(0), LegalOperations, Depth+1)) 452 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(), 453 GetNegatedExpression(Op.getOperand(0), DAG, 454 LegalOperations, Depth+1), 455 Op.getOperand(1)); 456 457 // fold (fneg (fmul X, Y)) -> (fmul X, (fneg Y)) 458 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(), 459 Op.getOperand(0), 460 GetNegatedExpression(Op.getOperand(1), DAG, 461 LegalOperations, Depth+1)); 462 463 case ISD::FP_EXTEND: 464 case ISD::FSIN: 465 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), Op.getValueType(), 466 GetNegatedExpression(Op.getOperand(0), DAG, 467 LegalOperations, Depth+1)); 468 case ISD::FP_ROUND: 469 return DAG.getNode(ISD::FP_ROUND, Op.getDebugLoc(), Op.getValueType(), 470 GetNegatedExpression(Op.getOperand(0), DAG, 471 LegalOperations, Depth+1), 472 Op.getOperand(1)); 473 } 474} 475 476 477// isSetCCEquivalent - Return true if this node is a setcc, or is a select_cc 478// that selects between the values 1 and 0, making it equivalent to a setcc. 479// Also, set the incoming LHS, RHS, and CC references to the appropriate 480// nodes based on the type of node we are checking. This simplifies life a 481// bit for the callers. 482static bool isSetCCEquivalent(SDValue N, SDValue &LHS, SDValue &RHS, 483 SDValue &CC) { 484 if (N.getOpcode() == ISD::SETCC) { 485 LHS = N.getOperand(0); 486 RHS = N.getOperand(1); 487 CC = N.getOperand(2); 488 return true; 489 } 490 if (N.getOpcode() == ISD::SELECT_CC && 491 N.getOperand(2).getOpcode() == ISD::Constant && 492 N.getOperand(3).getOpcode() == ISD::Constant && 493 cast<ConstantSDNode>(N.getOperand(2))->getAPIntValue() == 1 && 494 cast<ConstantSDNode>(N.getOperand(3))->isNullValue()) { 495 LHS = N.getOperand(0); 496 RHS = N.getOperand(1); 497 CC = N.getOperand(4); 498 return true; 499 } 500 return false; 501} 502 503// isOneUseSetCC - Return true if this is a SetCC-equivalent operation with only 504// one use. If this is true, it allows the users to invert the operation for 505// free when it is profitable to do so. 506static bool isOneUseSetCC(SDValue N) { 507 SDValue N0, N1, N2; 508 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) 509 return true; 510 return false; 511} 512 513SDValue DAGCombiner::ReassociateOps(unsigned Opc, DebugLoc DL, 514 SDValue N0, SDValue N1) { 515 EVT VT = N0.getValueType(); 516 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1))) { 517 if (isa<ConstantSDNode>(N1)) { 518 // reassoc. (op (op x, c1), c2) -> (op x, (op c1, c2)) 519 SDValue OpNode = 520 DAG.FoldConstantArithmetic(Opc, VT, 521 cast<ConstantSDNode>(N0.getOperand(1)), 522 cast<ConstantSDNode>(N1)); 523 return DAG.getNode(Opc, DL, VT, N0.getOperand(0), OpNode); 524 } else if (N0.hasOneUse()) { 525 // reassoc. (op (op x, c1), y) -> (op (op x, y), c1) iff x+c1 has one use 526 SDValue OpNode = DAG.getNode(Opc, N0.getDebugLoc(), VT, 527 N0.getOperand(0), N1); 528 AddToWorkList(OpNode.getNode()); 529 return DAG.getNode(Opc, DL, VT, OpNode, N0.getOperand(1)); 530 } 531 } 532 533 if (N1.getOpcode() == Opc && isa<ConstantSDNode>(N1.getOperand(1))) { 534 if (isa<ConstantSDNode>(N0)) { 535 // reassoc. (op c2, (op x, c1)) -> (op x, (op c1, c2)) 536 SDValue OpNode = 537 DAG.FoldConstantArithmetic(Opc, VT, 538 cast<ConstantSDNode>(N1.getOperand(1)), 539 cast<ConstantSDNode>(N0)); 540 return DAG.getNode(Opc, DL, VT, N1.getOperand(0), OpNode); 541 } else if (N1.hasOneUse()) { 542 // reassoc. (op y, (op x, c1)) -> (op (op x, y), c1) iff x+c1 has one use 543 SDValue OpNode = DAG.getNode(Opc, N0.getDebugLoc(), VT, 544 N1.getOperand(0), N0); 545 AddToWorkList(OpNode.getNode()); 546 return DAG.getNode(Opc, DL, VT, OpNode, N1.getOperand(1)); 547 } 548 } 549 550 return SDValue(); 551} 552 553SDValue DAGCombiner::CombineTo(SDNode *N, const SDValue *To, unsigned NumTo, 554 bool AddTo) { 555 assert(N->getNumValues() == NumTo && "Broken CombineTo call!"); 556 ++NodesCombined; 557 DEBUG(dbgs() << "\nReplacing.1 "; 558 N->dump(&DAG); 559 dbgs() << "\nWith: "; 560 To[0].getNode()->dump(&DAG); 561 dbgs() << " and " << NumTo-1 << " other values\n"; 562 for (unsigned i = 0, e = NumTo; i != e; ++i) 563 assert((!To[i].getNode() || 564 N->getValueType(i) == To[i].getValueType()) && 565 "Cannot combine value to value of different type!")); 566 WorkListRemover DeadNodes(*this); 567 DAG.ReplaceAllUsesWith(N, To, &DeadNodes); 568 569 if (AddTo) { 570 // Push the new nodes and any users onto the worklist 571 for (unsigned i = 0, e = NumTo; i != e; ++i) { 572 if (To[i].getNode()) { 573 AddToWorkList(To[i].getNode()); 574 AddUsersToWorkList(To[i].getNode()); 575 } 576 } 577 } 578 579 // Finally, if the node is now dead, remove it from the graph. The node 580 // may not be dead if the replacement process recursively simplified to 581 // something else needing this node. 582 if (N->use_empty()) { 583 // Nodes can be reintroduced into the worklist. Make sure we do not 584 // process a node that has been replaced. 585 removeFromWorkList(N); 586 587 // Finally, since the node is now dead, remove it from the graph. 588 DAG.DeleteNode(N); 589 } 590 return SDValue(N, 0); 591} 592 593void DAGCombiner:: 594CommitTargetLoweringOpt(const TargetLowering::TargetLoweringOpt &TLO) { 595 // Replace all uses. If any nodes become isomorphic to other nodes and 596 // are deleted, make sure to remove them from our worklist. 597 WorkListRemover DeadNodes(*this); 598 DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 599 600 // Push the new node and any (possibly new) users onto the worklist. 601 AddToWorkList(TLO.New.getNode()); 602 AddUsersToWorkList(TLO.New.getNode()); 603 604 // Finally, if the node is now dead, remove it from the graph. The node 605 // may not be dead if the replacement process recursively simplified to 606 // something else needing this node. 607 if (TLO.Old.getNode()->use_empty()) { 608 removeFromWorkList(TLO.Old.getNode()); 609 610 // If the operands of this node are only used by the node, they will now 611 // be dead. Make sure to visit them first to delete dead nodes early. 612 for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); i != e; ++i) 613 if (TLO.Old.getNode()->getOperand(i).getNode()->hasOneUse()) 614 AddToWorkList(TLO.Old.getNode()->getOperand(i).getNode()); 615 616 DAG.DeleteNode(TLO.Old.getNode()); 617 } 618} 619 620/// SimplifyDemandedBits - Check the specified integer node value to see if 621/// it can be simplified or if things it uses can be simplified by bit 622/// propagation. If so, return true. 623bool DAGCombiner::SimplifyDemandedBits(SDValue Op, const APInt &Demanded) { 624 TargetLowering::TargetLoweringOpt TLO(DAG, LegalTypes, LegalOperations); 625 APInt KnownZero, KnownOne; 626 if (!TLI.SimplifyDemandedBits(Op, Demanded, KnownZero, KnownOne, TLO)) 627 return false; 628 629 // Revisit the node. 630 AddToWorkList(Op.getNode()); 631 632 // Replace the old value with the new one. 633 ++NodesCombined; 634 DEBUG(dbgs() << "\nReplacing.2 "; 635 TLO.Old.getNode()->dump(&DAG); 636 dbgs() << "\nWith: "; 637 TLO.New.getNode()->dump(&DAG); 638 dbgs() << '\n'); 639 640 CommitTargetLoweringOpt(TLO); 641 return true; 642} 643 644void DAGCombiner::ReplaceLoadWithPromotedLoad(SDNode *Load, SDNode *ExtLoad) { 645 DebugLoc dl = Load->getDebugLoc(); 646 EVT VT = Load->getValueType(0); 647 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, dl, VT, SDValue(ExtLoad, 0)); 648 649 DEBUG(dbgs() << "\nReplacing.9 "; 650 Load->dump(&DAG); 651 dbgs() << "\nWith: "; 652 Trunc.getNode()->dump(&DAG); 653 dbgs() << '\n'); 654 WorkListRemover DeadNodes(*this); 655 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 0), Trunc, &DeadNodes); 656 DAG.ReplaceAllUsesOfValueWith(SDValue(Load, 1), SDValue(ExtLoad, 1), 657 &DeadNodes); 658 removeFromWorkList(Load); 659 DAG.DeleteNode(Load); 660 AddToWorkList(Trunc.getNode()); 661} 662 663SDValue DAGCombiner::PromoteOperand(SDValue Op, EVT PVT, bool &Replace) { 664 Replace = false; 665 DebugLoc dl = Op.getDebugLoc(); 666 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(Op)) { 667 EVT MemVT = LD->getMemoryVT(); 668 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD) 669 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT) ? ISD::ZEXTLOAD : ISD::EXTLOAD) 670 : LD->getExtensionType(); 671 Replace = true; 672 return DAG.getExtLoad(ExtType, PVT, dl, 673 LD->getChain(), LD->getBasePtr(), 674 LD->getPointerInfo(), 675 MemVT, LD->isVolatile(), 676 LD->isNonTemporal(), LD->getAlignment()); 677 } 678 679 unsigned Opc = Op.getOpcode(); 680 switch (Opc) { 681 default: break; 682 case ISD::AssertSext: 683 return DAG.getNode(ISD::AssertSext, dl, PVT, 684 SExtPromoteOperand(Op.getOperand(0), PVT), 685 Op.getOperand(1)); 686 case ISD::AssertZext: 687 return DAG.getNode(ISD::AssertZext, dl, PVT, 688 ZExtPromoteOperand(Op.getOperand(0), PVT), 689 Op.getOperand(1)); 690 case ISD::Constant: { 691 unsigned ExtOpc = 692 Op.getValueType().isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 693 return DAG.getNode(ExtOpc, dl, PVT, Op); 694 } 695 } 696 697 if (!TLI.isOperationLegal(ISD::ANY_EXTEND, PVT)) 698 return SDValue(); 699 return DAG.getNode(ISD::ANY_EXTEND, dl, PVT, Op); 700} 701 702SDValue DAGCombiner::SExtPromoteOperand(SDValue Op, EVT PVT) { 703 if (!TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, PVT)) 704 return SDValue(); 705 EVT OldVT = Op.getValueType(); 706 DebugLoc dl = Op.getDebugLoc(); 707 bool Replace = false; 708 SDValue NewOp = PromoteOperand(Op, PVT, Replace); 709 if (NewOp.getNode() == 0) 710 return SDValue(); 711 AddToWorkList(NewOp.getNode()); 712 713 if (Replace) 714 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode()); 715 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NewOp.getValueType(), NewOp, 716 DAG.getValueType(OldVT)); 717} 718 719SDValue DAGCombiner::ZExtPromoteOperand(SDValue Op, EVT PVT) { 720 EVT OldVT = Op.getValueType(); 721 DebugLoc dl = Op.getDebugLoc(); 722 bool Replace = false; 723 SDValue NewOp = PromoteOperand(Op, PVT, Replace); 724 if (NewOp.getNode() == 0) 725 return SDValue(); 726 AddToWorkList(NewOp.getNode()); 727 728 if (Replace) 729 ReplaceLoadWithPromotedLoad(Op.getNode(), NewOp.getNode()); 730 return DAG.getZeroExtendInReg(NewOp, dl, OldVT); 731} 732 733/// PromoteIntBinOp - Promote the specified integer binary operation if the 734/// target indicates it is beneficial. e.g. On x86, it's usually better to 735/// promote i16 operations to i32 since i16 instructions are longer. 736SDValue DAGCombiner::PromoteIntBinOp(SDValue Op) { 737 if (!LegalOperations) 738 return SDValue(); 739 740 EVT VT = Op.getValueType(); 741 if (VT.isVector() || !VT.isInteger()) 742 return SDValue(); 743 744 // If operation type is 'undesirable', e.g. i16 on x86, consider 745 // promoting it. 746 unsigned Opc = Op.getOpcode(); 747 if (TLI.isTypeDesirableForOp(Opc, VT)) 748 return SDValue(); 749 750 EVT PVT = VT; 751 // Consult target whether it is a good idea to promote this operation and 752 // what's the right type to promote it to. 753 if (TLI.IsDesirableToPromoteOp(Op, PVT)) { 754 assert(PVT != VT && "Don't know what type to promote to!"); 755 756 bool Replace0 = false; 757 SDValue N0 = Op.getOperand(0); 758 SDValue NN0 = PromoteOperand(N0, PVT, Replace0); 759 if (NN0.getNode() == 0) 760 return SDValue(); 761 762 bool Replace1 = false; 763 SDValue N1 = Op.getOperand(1); 764 SDValue NN1; 765 if (N0 == N1) 766 NN1 = NN0; 767 else { 768 NN1 = PromoteOperand(N1, PVT, Replace1); 769 if (NN1.getNode() == 0) 770 return SDValue(); 771 } 772 773 AddToWorkList(NN0.getNode()); 774 if (NN1.getNode()) 775 AddToWorkList(NN1.getNode()); 776 777 if (Replace0) 778 ReplaceLoadWithPromotedLoad(N0.getNode(), NN0.getNode()); 779 if (Replace1) 780 ReplaceLoadWithPromotedLoad(N1.getNode(), NN1.getNode()); 781 782 DEBUG(dbgs() << "\nPromoting "; 783 Op.getNode()->dump(&DAG)); 784 DebugLoc dl = Op.getDebugLoc(); 785 return DAG.getNode(ISD::TRUNCATE, dl, VT, 786 DAG.getNode(Opc, dl, PVT, NN0, NN1)); 787 } 788 return SDValue(); 789} 790 791/// PromoteIntShiftOp - Promote the specified integer shift operation if the 792/// target indicates it is beneficial. e.g. On x86, it's usually better to 793/// promote i16 operations to i32 since i16 instructions are longer. 794SDValue DAGCombiner::PromoteIntShiftOp(SDValue Op) { 795 if (!LegalOperations) 796 return SDValue(); 797 798 EVT VT = Op.getValueType(); 799 if (VT.isVector() || !VT.isInteger()) 800 return SDValue(); 801 802 // If operation type is 'undesirable', e.g. i16 on x86, consider 803 // promoting it. 804 unsigned Opc = Op.getOpcode(); 805 if (TLI.isTypeDesirableForOp(Opc, VT)) 806 return SDValue(); 807 808 EVT PVT = VT; 809 // Consult target whether it is a good idea to promote this operation and 810 // what's the right type to promote it to. 811 if (TLI.IsDesirableToPromoteOp(Op, PVT)) { 812 assert(PVT != VT && "Don't know what type to promote to!"); 813 814 bool Replace = false; 815 SDValue N0 = Op.getOperand(0); 816 if (Opc == ISD::SRA) 817 N0 = SExtPromoteOperand(Op.getOperand(0), PVT); 818 else if (Opc == ISD::SRL) 819 N0 = ZExtPromoteOperand(Op.getOperand(0), PVT); 820 else 821 N0 = PromoteOperand(N0, PVT, Replace); 822 if (N0.getNode() == 0) 823 return SDValue(); 824 825 AddToWorkList(N0.getNode()); 826 if (Replace) 827 ReplaceLoadWithPromotedLoad(Op.getOperand(0).getNode(), N0.getNode()); 828 829 DEBUG(dbgs() << "\nPromoting "; 830 Op.getNode()->dump(&DAG)); 831 DebugLoc dl = Op.getDebugLoc(); 832 return DAG.getNode(ISD::TRUNCATE, dl, VT, 833 DAG.getNode(Opc, dl, PVT, N0, Op.getOperand(1))); 834 } 835 return SDValue(); 836} 837 838SDValue DAGCombiner::PromoteExtend(SDValue Op) { 839 if (!LegalOperations) 840 return SDValue(); 841 842 EVT VT = Op.getValueType(); 843 if (VT.isVector() || !VT.isInteger()) 844 return SDValue(); 845 846 // If operation type is 'undesirable', e.g. i16 on x86, consider 847 // promoting it. 848 unsigned Opc = Op.getOpcode(); 849 if (TLI.isTypeDesirableForOp(Opc, VT)) 850 return SDValue(); 851 852 EVT PVT = VT; 853 // Consult target whether it is a good idea to promote this operation and 854 // what's the right type to promote it to. 855 if (TLI.IsDesirableToPromoteOp(Op, PVT)) { 856 assert(PVT != VT && "Don't know what type to promote to!"); 857 // fold (aext (aext x)) -> (aext x) 858 // fold (aext (zext x)) -> (zext x) 859 // fold (aext (sext x)) -> (sext x) 860 DEBUG(dbgs() << "\nPromoting "; 861 Op.getNode()->dump(&DAG)); 862 return DAG.getNode(Op.getOpcode(), Op.getDebugLoc(), VT, Op.getOperand(0)); 863 } 864 return SDValue(); 865} 866 867bool DAGCombiner::PromoteLoad(SDValue Op) { 868 if (!LegalOperations) 869 return false; 870 871 EVT VT = Op.getValueType(); 872 if (VT.isVector() || !VT.isInteger()) 873 return false; 874 875 // If operation type is 'undesirable', e.g. i16 on x86, consider 876 // promoting it. 877 unsigned Opc = Op.getOpcode(); 878 if (TLI.isTypeDesirableForOp(Opc, VT)) 879 return false; 880 881 EVT PVT = VT; 882 // Consult target whether it is a good idea to promote this operation and 883 // what's the right type to promote it to. 884 if (TLI.IsDesirableToPromoteOp(Op, PVT)) { 885 assert(PVT != VT && "Don't know what type to promote to!"); 886 887 DebugLoc dl = Op.getDebugLoc(); 888 SDNode *N = Op.getNode(); 889 LoadSDNode *LD = cast<LoadSDNode>(N); 890 EVT MemVT = LD->getMemoryVT(); 891 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(LD) 892 ? (TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT) ? ISD::ZEXTLOAD : ISD::EXTLOAD) 893 : LD->getExtensionType(); 894 SDValue NewLD = DAG.getExtLoad(ExtType, PVT, dl, 895 LD->getChain(), LD->getBasePtr(), 896 LD->getPointerInfo(), 897 MemVT, LD->isVolatile(), 898 LD->isNonTemporal(), LD->getAlignment()); 899 SDValue Result = DAG.getNode(ISD::TRUNCATE, dl, VT, NewLD); 900 901 DEBUG(dbgs() << "\nPromoting "; 902 N->dump(&DAG); 903 dbgs() << "\nTo: "; 904 Result.getNode()->dump(&DAG); 905 dbgs() << '\n'); 906 WorkListRemover DeadNodes(*this); 907 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result, &DeadNodes); 908 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), NewLD.getValue(1), &DeadNodes); 909 removeFromWorkList(N); 910 DAG.DeleteNode(N); 911 AddToWorkList(Result.getNode()); 912 return true; 913 } 914 return false; 915} 916 917 918//===----------------------------------------------------------------------===// 919// Main DAG Combiner implementation 920//===----------------------------------------------------------------------===// 921 922void DAGCombiner::Run(CombineLevel AtLevel) { 923 // set the instance variables, so that the various visit routines may use it. 924 Level = AtLevel; 925 LegalOperations = Level >= NoIllegalOperations; 926 LegalTypes = Level >= NoIllegalTypes; 927 928 // Add all the dag nodes to the worklist. 929 WorkList.reserve(DAG.allnodes_size()); 930 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(), 931 E = DAG.allnodes_end(); I != E; ++I) 932 WorkList.push_back(I); 933 934 // Create a dummy node (which is not added to allnodes), that adds a reference 935 // to the root node, preventing it from being deleted, and tracking any 936 // changes of the root. 937 HandleSDNode Dummy(DAG.getRoot()); 938 939 // The root of the dag may dangle to deleted nodes until the dag combiner is 940 // done. Set it to null to avoid confusion. 941 DAG.setRoot(SDValue()); 942 943 // while the worklist isn't empty, inspect the node on the end of it and 944 // try and combine it. 945 while (!WorkList.empty()) { 946 SDNode *N = WorkList.back(); 947 WorkList.pop_back(); 948 949 // If N has no uses, it is dead. Make sure to revisit all N's operands once 950 // N is deleted from the DAG, since they too may now be dead or may have a 951 // reduced number of uses, allowing other xforms. 952 if (N->use_empty() && N != &Dummy) { 953 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 954 AddToWorkList(N->getOperand(i).getNode()); 955 956 DAG.DeleteNode(N); 957 continue; 958 } 959 960 SDValue RV = combine(N); 961 962 if (RV.getNode() == 0) 963 continue; 964 965 ++NodesCombined; 966 967 // If we get back the same node we passed in, rather than a new node or 968 // zero, we know that the node must have defined multiple values and 969 // CombineTo was used. Since CombineTo takes care of the worklist 970 // mechanics for us, we have no work to do in this case. 971 if (RV.getNode() == N) 972 continue; 973 974 assert(N->getOpcode() != ISD::DELETED_NODE && 975 RV.getNode()->getOpcode() != ISD::DELETED_NODE && 976 "Node was deleted but visit returned new node!"); 977 978 DEBUG(dbgs() << "\nReplacing.3 "; 979 N->dump(&DAG); 980 dbgs() << "\nWith: "; 981 RV.getNode()->dump(&DAG); 982 dbgs() << '\n'); 983 WorkListRemover DeadNodes(*this); 984 if (N->getNumValues() == RV.getNode()->getNumValues()) 985 DAG.ReplaceAllUsesWith(N, RV.getNode(), &DeadNodes); 986 else { 987 assert(N->getValueType(0) == RV.getValueType() && 988 N->getNumValues() == 1 && "Type mismatch"); 989 SDValue OpV = RV; 990 DAG.ReplaceAllUsesWith(N, &OpV, &DeadNodes); 991 } 992 993 // Push the new node and any users onto the worklist 994 AddToWorkList(RV.getNode()); 995 AddUsersToWorkList(RV.getNode()); 996 997 // Add any uses of the old node to the worklist in case this node is the 998 // last one that uses them. They may become dead after this node is 999 // deleted. 1000 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 1001 AddToWorkList(N->getOperand(i).getNode()); 1002 1003 // Finally, if the node is now dead, remove it from the graph. The node 1004 // may not be dead if the replacement process recursively simplified to 1005 // something else needing this node. 1006 if (N->use_empty()) { 1007 // Nodes can be reintroduced into the worklist. Make sure we do not 1008 // process a node that has been replaced. 1009 removeFromWorkList(N); 1010 1011 // Finally, since the node is now dead, remove it from the graph. 1012 DAG.DeleteNode(N); 1013 } 1014 } 1015 1016 // If the root changed (e.g. it was a dead load, update the root). 1017 DAG.setRoot(Dummy.getValue()); 1018} 1019 1020SDValue DAGCombiner::visit(SDNode *N) { 1021 switch (N->getOpcode()) { 1022 default: break; 1023 case ISD::TokenFactor: return visitTokenFactor(N); 1024 case ISD::MERGE_VALUES: return visitMERGE_VALUES(N); 1025 case ISD::ADD: return visitADD(N); 1026 case ISD::SUB: return visitSUB(N); 1027 case ISD::ADDC: return visitADDC(N); 1028 case ISD::ADDE: return visitADDE(N); 1029 case ISD::MUL: return visitMUL(N); 1030 case ISD::SDIV: return visitSDIV(N); 1031 case ISD::UDIV: return visitUDIV(N); 1032 case ISD::SREM: return visitSREM(N); 1033 case ISD::UREM: return visitUREM(N); 1034 case ISD::MULHU: return visitMULHU(N); 1035 case ISD::MULHS: return visitMULHS(N); 1036 case ISD::SMUL_LOHI: return visitSMUL_LOHI(N); 1037 case ISD::UMUL_LOHI: return visitUMUL_LOHI(N); 1038 case ISD::SDIVREM: return visitSDIVREM(N); 1039 case ISD::UDIVREM: return visitUDIVREM(N); 1040 case ISD::AND: return visitAND(N); 1041 case ISD::OR: return visitOR(N); 1042 case ISD::XOR: return visitXOR(N); 1043 case ISD::SHL: return visitSHL(N); 1044 case ISD::SRA: return visitSRA(N); 1045 case ISD::SRL: return visitSRL(N); 1046 case ISD::CTLZ: return visitCTLZ(N); 1047 case ISD::CTTZ: return visitCTTZ(N); 1048 case ISD::CTPOP: return visitCTPOP(N); 1049 case ISD::SELECT: return visitSELECT(N); 1050 case ISD::SELECT_CC: return visitSELECT_CC(N); 1051 case ISD::SETCC: return visitSETCC(N); 1052 case ISD::SIGN_EXTEND: return visitSIGN_EXTEND(N); 1053 case ISD::ZERO_EXTEND: return visitZERO_EXTEND(N); 1054 case ISD::ANY_EXTEND: return visitANY_EXTEND(N); 1055 case ISD::SIGN_EXTEND_INREG: return visitSIGN_EXTEND_INREG(N); 1056 case ISD::TRUNCATE: return visitTRUNCATE(N); 1057 case ISD::BIT_CONVERT: return visitBIT_CONVERT(N); 1058 case ISD::BUILD_PAIR: return visitBUILD_PAIR(N); 1059 case ISD::FADD: return visitFADD(N); 1060 case ISD::FSUB: return visitFSUB(N); 1061 case ISD::FMUL: return visitFMUL(N); 1062 case ISD::FDIV: return visitFDIV(N); 1063 case ISD::FREM: return visitFREM(N); 1064 case ISD::FCOPYSIGN: return visitFCOPYSIGN(N); 1065 case ISD::SINT_TO_FP: return visitSINT_TO_FP(N); 1066 case ISD::UINT_TO_FP: return visitUINT_TO_FP(N); 1067 case ISD::FP_TO_SINT: return visitFP_TO_SINT(N); 1068 case ISD::FP_TO_UINT: return visitFP_TO_UINT(N); 1069 case ISD::FP_ROUND: return visitFP_ROUND(N); 1070 case ISD::FP_ROUND_INREG: return visitFP_ROUND_INREG(N); 1071 case ISD::FP_EXTEND: return visitFP_EXTEND(N); 1072 case ISD::FNEG: return visitFNEG(N); 1073 case ISD::FABS: return visitFABS(N); 1074 case ISD::BRCOND: return visitBRCOND(N); 1075 case ISD::BR_CC: return visitBR_CC(N); 1076 case ISD::LOAD: return visitLOAD(N); 1077 case ISD::STORE: return visitSTORE(N); 1078 case ISD::INSERT_VECTOR_ELT: return visitINSERT_VECTOR_ELT(N); 1079 case ISD::EXTRACT_VECTOR_ELT: return visitEXTRACT_VECTOR_ELT(N); 1080 case ISD::BUILD_VECTOR: return visitBUILD_VECTOR(N); 1081 case ISD::CONCAT_VECTORS: return visitCONCAT_VECTORS(N); 1082 case ISD::VECTOR_SHUFFLE: return visitVECTOR_SHUFFLE(N); 1083 case ISD::MEMBARRIER: return visitMEMBARRIER(N); 1084 } 1085 return SDValue(); 1086} 1087 1088SDValue DAGCombiner::combine(SDNode *N) { 1089 SDValue RV = visit(N); 1090 1091 // If nothing happened, try a target-specific DAG combine. 1092 if (RV.getNode() == 0) { 1093 assert(N->getOpcode() != ISD::DELETED_NODE && 1094 "Node was deleted but visit returned NULL!"); 1095 1096 if (N->getOpcode() >= ISD::BUILTIN_OP_END || 1097 TLI.hasTargetDAGCombine((ISD::NodeType)N->getOpcode())) { 1098 1099 // Expose the DAG combiner to the target combiner impls. 1100 TargetLowering::DAGCombinerInfo 1101 DagCombineInfo(DAG, !LegalTypes, !LegalOperations, false, this); 1102 1103 RV = TLI.PerformDAGCombine(N, DagCombineInfo); 1104 } 1105 } 1106 1107 // If nothing happened still, try promoting the operation. 1108 if (RV.getNode() == 0) { 1109 switch (N->getOpcode()) { 1110 default: break; 1111 case ISD::ADD: 1112 case ISD::SUB: 1113 case ISD::MUL: 1114 case ISD::AND: 1115 case ISD::OR: 1116 case ISD::XOR: 1117 RV = PromoteIntBinOp(SDValue(N, 0)); 1118 break; 1119 case ISD::SHL: 1120 case ISD::SRA: 1121 case ISD::SRL: 1122 RV = PromoteIntShiftOp(SDValue(N, 0)); 1123 break; 1124 case ISD::SIGN_EXTEND: 1125 case ISD::ZERO_EXTEND: 1126 case ISD::ANY_EXTEND: 1127 RV = PromoteExtend(SDValue(N, 0)); 1128 break; 1129 case ISD::LOAD: 1130 if (PromoteLoad(SDValue(N, 0))) 1131 RV = SDValue(N, 0); 1132 break; 1133 } 1134 } 1135 1136 // If N is a commutative binary node, try commuting it to enable more 1137 // sdisel CSE. 1138 if (RV.getNode() == 0 && 1139 SelectionDAG::isCommutativeBinOp(N->getOpcode()) && 1140 N->getNumValues() == 1) { 1141 SDValue N0 = N->getOperand(0); 1142 SDValue N1 = N->getOperand(1); 1143 1144 // Constant operands are canonicalized to RHS. 1145 if (isa<ConstantSDNode>(N0) || !isa<ConstantSDNode>(N1)) { 1146 SDValue Ops[] = { N1, N0 }; 1147 SDNode *CSENode = DAG.getNodeIfExists(N->getOpcode(), N->getVTList(), 1148 Ops, 2); 1149 if (CSENode) 1150 return SDValue(CSENode, 0); 1151 } 1152 } 1153 1154 return RV; 1155} 1156 1157/// getInputChainForNode - Given a node, return its input chain if it has one, 1158/// otherwise return a null sd operand. 1159static SDValue getInputChainForNode(SDNode *N) { 1160 if (unsigned NumOps = N->getNumOperands()) { 1161 if (N->getOperand(0).getValueType() == MVT::Other) 1162 return N->getOperand(0); 1163 else if (N->getOperand(NumOps-1).getValueType() == MVT::Other) 1164 return N->getOperand(NumOps-1); 1165 for (unsigned i = 1; i < NumOps-1; ++i) 1166 if (N->getOperand(i).getValueType() == MVT::Other) 1167 return N->getOperand(i); 1168 } 1169 return SDValue(); 1170} 1171 1172SDValue DAGCombiner::visitTokenFactor(SDNode *N) { 1173 // If N has two operands, where one has an input chain equal to the other, 1174 // the 'other' chain is redundant. 1175 if (N->getNumOperands() == 2) { 1176 if (getInputChainForNode(N->getOperand(0).getNode()) == N->getOperand(1)) 1177 return N->getOperand(0); 1178 if (getInputChainForNode(N->getOperand(1).getNode()) == N->getOperand(0)) 1179 return N->getOperand(1); 1180 } 1181 1182 SmallVector<SDNode *, 8> TFs; // List of token factors to visit. 1183 SmallVector<SDValue, 8> Ops; // Ops for replacing token factor. 1184 SmallPtrSet<SDNode*, 16> SeenOps; 1185 bool Changed = false; // If we should replace this token factor. 1186 1187 // Start out with this token factor. 1188 TFs.push_back(N); 1189 1190 // Iterate through token factors. The TFs grows when new token factors are 1191 // encountered. 1192 for (unsigned i = 0; i < TFs.size(); ++i) { 1193 SDNode *TF = TFs[i]; 1194 1195 // Check each of the operands. 1196 for (unsigned i = 0, ie = TF->getNumOperands(); i != ie; ++i) { 1197 SDValue Op = TF->getOperand(i); 1198 1199 switch (Op.getOpcode()) { 1200 case ISD::EntryToken: 1201 // Entry tokens don't need to be added to the list. They are 1202 // rededundant. 1203 Changed = true; 1204 break; 1205 1206 case ISD::TokenFactor: 1207 if (Op.hasOneUse() && 1208 std::find(TFs.begin(), TFs.end(), Op.getNode()) == TFs.end()) { 1209 // Queue up for processing. 1210 TFs.push_back(Op.getNode()); 1211 // Clean up in case the token factor is removed. 1212 AddToWorkList(Op.getNode()); 1213 Changed = true; 1214 break; 1215 } 1216 // Fall thru 1217 1218 default: 1219 // Only add if it isn't already in the list. 1220 if (SeenOps.insert(Op.getNode())) 1221 Ops.push_back(Op); 1222 else 1223 Changed = true; 1224 break; 1225 } 1226 } 1227 } 1228 1229 SDValue Result; 1230 1231 // If we've change things around then replace token factor. 1232 if (Changed) { 1233 if (Ops.empty()) { 1234 // The entry token is the only possible outcome. 1235 Result = DAG.getEntryNode(); 1236 } else { 1237 // New and improved token factor. 1238 Result = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), 1239 MVT::Other, &Ops[0], Ops.size()); 1240 } 1241 1242 // Don't add users to work list. 1243 return CombineTo(N, Result, false); 1244 } 1245 1246 return Result; 1247} 1248 1249/// MERGE_VALUES can always be eliminated. 1250SDValue DAGCombiner::visitMERGE_VALUES(SDNode *N) { 1251 WorkListRemover DeadNodes(*this); 1252 // Replacing results may cause a different MERGE_VALUES to suddenly 1253 // be CSE'd with N, and carry its uses with it. Iterate until no 1254 // uses remain, to ensure that the node can be safely deleted. 1255 do { 1256 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 1257 DAG.ReplaceAllUsesOfValueWith(SDValue(N, i), N->getOperand(i), 1258 &DeadNodes); 1259 } while (!N->use_empty()); 1260 removeFromWorkList(N); 1261 DAG.DeleteNode(N); 1262 return SDValue(N, 0); // Return N so it doesn't get rechecked! 1263} 1264 1265static 1266SDValue combineShlAddConstant(DebugLoc DL, SDValue N0, SDValue N1, 1267 SelectionDAG &DAG) { 1268 EVT VT = N0.getValueType(); 1269 SDValue N00 = N0.getOperand(0); 1270 SDValue N01 = N0.getOperand(1); 1271 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N01); 1272 1273 if (N01C && N00.getOpcode() == ISD::ADD && N00.getNode()->hasOneUse() && 1274 isa<ConstantSDNode>(N00.getOperand(1))) { 1275 // fold (add (shl (add x, c1), c2), ) -> (add (add (shl x, c2), c1<<c2), ) 1276 N0 = DAG.getNode(ISD::ADD, N0.getDebugLoc(), VT, 1277 DAG.getNode(ISD::SHL, N00.getDebugLoc(), VT, 1278 N00.getOperand(0), N01), 1279 DAG.getNode(ISD::SHL, N01.getDebugLoc(), VT, 1280 N00.getOperand(1), N01)); 1281 return DAG.getNode(ISD::ADD, DL, VT, N0, N1); 1282 } 1283 1284 return SDValue(); 1285} 1286 1287SDValue DAGCombiner::visitADD(SDNode *N) { 1288 SDValue N0 = N->getOperand(0); 1289 SDValue N1 = N->getOperand(1); 1290 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1291 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1292 EVT VT = N0.getValueType(); 1293 1294 // fold vector ops 1295 if (VT.isVector()) { 1296 SDValue FoldedVOp = SimplifyVBinOp(N); 1297 if (FoldedVOp.getNode()) return FoldedVOp; 1298 } 1299 1300 // fold (add x, undef) -> undef 1301 if (N0.getOpcode() == ISD::UNDEF) 1302 return N0; 1303 if (N1.getOpcode() == ISD::UNDEF) 1304 return N1; 1305 // fold (add c1, c2) -> c1+c2 1306 if (N0C && N1C) 1307 return DAG.FoldConstantArithmetic(ISD::ADD, VT, N0C, N1C); 1308 // canonicalize constant to RHS 1309 if (N0C && !N1C) 1310 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1, N0); 1311 // fold (add x, 0) -> x 1312 if (N1C && N1C->isNullValue()) 1313 return N0; 1314 // fold (add Sym, c) -> Sym+c 1315 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(N0)) 1316 if (!LegalOperations && TLI.isOffsetFoldingLegal(GA) && N1C && 1317 GA->getOpcode() == ISD::GlobalAddress) 1318 return DAG.getGlobalAddress(GA->getGlobal(), N1C->getDebugLoc(), VT, 1319 GA->getOffset() + 1320 (uint64_t)N1C->getSExtValue()); 1321 // fold ((c1-A)+c2) -> (c1+c2)-A 1322 if (N1C && N0.getOpcode() == ISD::SUB) 1323 if (ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getOperand(0))) 1324 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1325 DAG.getConstant(N1C->getAPIntValue()+ 1326 N0C->getAPIntValue(), VT), 1327 N0.getOperand(1)); 1328 // reassociate add 1329 SDValue RADD = ReassociateOps(ISD::ADD, N->getDebugLoc(), N0, N1); 1330 if (RADD.getNode() != 0) 1331 return RADD; 1332 // fold ((0-A) + B) -> B-A 1333 if (N0.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N0.getOperand(0)) && 1334 cast<ConstantSDNode>(N0.getOperand(0))->isNullValue()) 1335 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1, N0.getOperand(1)); 1336 // fold (A + (0-B)) -> A-B 1337 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) && 1338 cast<ConstantSDNode>(N1.getOperand(0))->isNullValue()) 1339 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, N1.getOperand(1)); 1340 // fold (A+(B-A)) -> B 1341 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(1)) 1342 return N1.getOperand(0); 1343 // fold ((B-A)+A) -> B 1344 if (N0.getOpcode() == ISD::SUB && N1 == N0.getOperand(1)) 1345 return N0.getOperand(0); 1346 // fold (A+(B-(A+C))) to (B-C) 1347 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD && 1348 N0 == N1.getOperand(1).getOperand(0)) 1349 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1.getOperand(0), 1350 N1.getOperand(1).getOperand(1)); 1351 // fold (A+(B-(C+A))) to (B-C) 1352 if (N1.getOpcode() == ISD::SUB && N1.getOperand(1).getOpcode() == ISD::ADD && 1353 N0 == N1.getOperand(1).getOperand(1)) 1354 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1.getOperand(0), 1355 N1.getOperand(1).getOperand(0)); 1356 // fold (A+((B-A)+or-C)) to (B+or-C) 1357 if ((N1.getOpcode() == ISD::SUB || N1.getOpcode() == ISD::ADD) && 1358 N1.getOperand(0).getOpcode() == ISD::SUB && 1359 N0 == N1.getOperand(0).getOperand(1)) 1360 return DAG.getNode(N1.getOpcode(), N->getDebugLoc(), VT, 1361 N1.getOperand(0).getOperand(0), N1.getOperand(1)); 1362 1363 // fold (A-B)+(C-D) to (A+C)-(B+D) when A or C is constant 1364 if (N0.getOpcode() == ISD::SUB && N1.getOpcode() == ISD::SUB) { 1365 SDValue N00 = N0.getOperand(0); 1366 SDValue N01 = N0.getOperand(1); 1367 SDValue N10 = N1.getOperand(0); 1368 SDValue N11 = N1.getOperand(1); 1369 1370 if (isa<ConstantSDNode>(N00) || isa<ConstantSDNode>(N10)) 1371 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1372 DAG.getNode(ISD::ADD, N0.getDebugLoc(), VT, N00, N10), 1373 DAG.getNode(ISD::ADD, N1.getDebugLoc(), VT, N01, N11)); 1374 } 1375 1376 if (!VT.isVector() && SimplifyDemandedBits(SDValue(N, 0))) 1377 return SDValue(N, 0); 1378 1379 // fold (a+b) -> (a|b) iff a and b share no bits. 1380 if (VT.isInteger() && !VT.isVector()) { 1381 APInt LHSZero, LHSOne; 1382 APInt RHSZero, RHSOne; 1383 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits()); 1384 DAG.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne); 1385 1386 if (LHSZero.getBoolValue()) { 1387 DAG.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne); 1388 1389 // If all possibly-set bits on the LHS are clear on the RHS, return an OR. 1390 // If all possibly-set bits on the RHS are clear on the LHS, return an OR. 1391 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) || 1392 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask)) 1393 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N1); 1394 } 1395 } 1396 1397 // fold (add (shl (add x, c1), c2), ) -> (add (add (shl x, c2), c1<<c2), ) 1398 if (N0.getOpcode() == ISD::SHL && N0.getNode()->hasOneUse()) { 1399 SDValue Result = combineShlAddConstant(N->getDebugLoc(), N0, N1, DAG); 1400 if (Result.getNode()) return Result; 1401 } 1402 if (N1.getOpcode() == ISD::SHL && N1.getNode()->hasOneUse()) { 1403 SDValue Result = combineShlAddConstant(N->getDebugLoc(), N1, N0, DAG); 1404 if (Result.getNode()) return Result; 1405 } 1406 1407 // fold (add x, shl(0 - y, n)) -> sub(x, shl(y, n)) 1408 if (N1.getOpcode() == ISD::SHL && 1409 N1.getOperand(0).getOpcode() == ISD::SUB) 1410 if (ConstantSDNode *C = 1411 dyn_cast<ConstantSDNode>(N1.getOperand(0).getOperand(0))) 1412 if (C->getAPIntValue() == 0) 1413 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, 1414 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, 1415 N1.getOperand(0).getOperand(1), 1416 N1.getOperand(1))); 1417 if (N0.getOpcode() == ISD::SHL && 1418 N0.getOperand(0).getOpcode() == ISD::SUB) 1419 if (ConstantSDNode *C = 1420 dyn_cast<ConstantSDNode>(N0.getOperand(0).getOperand(0))) 1421 if (C->getAPIntValue() == 0) 1422 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N1, 1423 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, 1424 N0.getOperand(0).getOperand(1), 1425 N0.getOperand(1))); 1426 1427 return SDValue(); 1428} 1429 1430SDValue DAGCombiner::visitADDC(SDNode *N) { 1431 SDValue N0 = N->getOperand(0); 1432 SDValue N1 = N->getOperand(1); 1433 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1434 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1435 EVT VT = N0.getValueType(); 1436 1437 // If the flag result is dead, turn this into an ADD. 1438 if (N->hasNUsesOfValue(0, 1)) 1439 return CombineTo(N, DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1, N0), 1440 DAG.getNode(ISD::CARRY_FALSE, 1441 N->getDebugLoc(), MVT::Flag)); 1442 1443 // canonicalize constant to RHS. 1444 if (N0C && !N1C) 1445 return DAG.getNode(ISD::ADDC, N->getDebugLoc(), N->getVTList(), N1, N0); 1446 1447 // fold (addc x, 0) -> x + no carry out 1448 if (N1C && N1C->isNullValue()) 1449 return CombineTo(N, N0, DAG.getNode(ISD::CARRY_FALSE, 1450 N->getDebugLoc(), MVT::Flag)); 1451 1452 // fold (addc a, b) -> (or a, b), CARRY_FALSE iff a and b share no bits. 1453 APInt LHSZero, LHSOne; 1454 APInt RHSZero, RHSOne; 1455 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits()); 1456 DAG.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne); 1457 1458 if (LHSZero.getBoolValue()) { 1459 DAG.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne); 1460 1461 // If all possibly-set bits on the LHS are clear on the RHS, return an OR. 1462 // If all possibly-set bits on the RHS are clear on the LHS, return an OR. 1463 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) || 1464 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask)) 1465 return CombineTo(N, DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N1), 1466 DAG.getNode(ISD::CARRY_FALSE, 1467 N->getDebugLoc(), MVT::Flag)); 1468 } 1469 1470 return SDValue(); 1471} 1472 1473SDValue DAGCombiner::visitADDE(SDNode *N) { 1474 SDValue N0 = N->getOperand(0); 1475 SDValue N1 = N->getOperand(1); 1476 SDValue CarryIn = N->getOperand(2); 1477 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1478 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1479 1480 // canonicalize constant to RHS 1481 if (N0C && !N1C) 1482 return DAG.getNode(ISD::ADDE, N->getDebugLoc(), N->getVTList(), 1483 N1, N0, CarryIn); 1484 1485 // fold (adde x, y, false) -> (addc x, y) 1486 if (CarryIn.getOpcode() == ISD::CARRY_FALSE) 1487 return DAG.getNode(ISD::ADDC, N->getDebugLoc(), N->getVTList(), N1, N0); 1488 1489 return SDValue(); 1490} 1491 1492SDValue DAGCombiner::visitSUB(SDNode *N) { 1493 SDValue N0 = N->getOperand(0); 1494 SDValue N1 = N->getOperand(1); 1495 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode()); 1496 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode()); 1497 EVT VT = N0.getValueType(); 1498 1499 // fold vector ops 1500 if (VT.isVector()) { 1501 SDValue FoldedVOp = SimplifyVBinOp(N); 1502 if (FoldedVOp.getNode()) return FoldedVOp; 1503 } 1504 1505 // fold (sub x, x) -> 0 1506 if (N0 == N1) 1507 return DAG.getConstant(0, N->getValueType(0)); 1508 // fold (sub c1, c2) -> c1-c2 1509 if (N0C && N1C) 1510 return DAG.FoldConstantArithmetic(ISD::SUB, VT, N0C, N1C); 1511 // fold (sub x, c) -> (add x, -c) 1512 if (N1C) 1513 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N0, 1514 DAG.getConstant(-N1C->getAPIntValue(), VT)); 1515 // Canonicalize (sub -1, x) -> ~x, i.e. (xor x, -1) 1516 if (N0C && N0C->isAllOnesValue()) 1517 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N1, N0); 1518 // fold (A+B)-A -> B 1519 if (N0.getOpcode() == ISD::ADD && N0.getOperand(0) == N1) 1520 return N0.getOperand(1); 1521 // fold (A+B)-B -> A 1522 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1) == N1) 1523 return N0.getOperand(0); 1524 // fold ((A+(B+or-C))-B) -> A+or-C 1525 if (N0.getOpcode() == ISD::ADD && 1526 (N0.getOperand(1).getOpcode() == ISD::SUB || 1527 N0.getOperand(1).getOpcode() == ISD::ADD) && 1528 N0.getOperand(1).getOperand(0) == N1) 1529 return DAG.getNode(N0.getOperand(1).getOpcode(), N->getDebugLoc(), VT, 1530 N0.getOperand(0), N0.getOperand(1).getOperand(1)); 1531 // fold ((A+(C+B))-B) -> A+C 1532 if (N0.getOpcode() == ISD::ADD && 1533 N0.getOperand(1).getOpcode() == ISD::ADD && 1534 N0.getOperand(1).getOperand(1) == N1) 1535 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, 1536 N0.getOperand(0), N0.getOperand(1).getOperand(0)); 1537 // fold ((A-(B-C))-C) -> A-B 1538 if (N0.getOpcode() == ISD::SUB && 1539 N0.getOperand(1).getOpcode() == ISD::SUB && 1540 N0.getOperand(1).getOperand(1) == N1) 1541 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1542 N0.getOperand(0), N0.getOperand(1).getOperand(0)); 1543 1544 // If either operand of a sub is undef, the result is undef 1545 if (N0.getOpcode() == ISD::UNDEF) 1546 return N0; 1547 if (N1.getOpcode() == ISD::UNDEF) 1548 return N1; 1549 1550 // If the relocation model supports it, consider symbol offsets. 1551 if (GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(N0)) 1552 if (!LegalOperations && TLI.isOffsetFoldingLegal(GA)) { 1553 // fold (sub Sym, c) -> Sym-c 1554 if (N1C && GA->getOpcode() == ISD::GlobalAddress) 1555 return DAG.getGlobalAddress(GA->getGlobal(), N1C->getDebugLoc(), VT, 1556 GA->getOffset() - 1557 (uint64_t)N1C->getSExtValue()); 1558 // fold (sub Sym+c1, Sym+c2) -> c1-c2 1559 if (GlobalAddressSDNode *GB = dyn_cast<GlobalAddressSDNode>(N1)) 1560 if (GA->getGlobal() == GB->getGlobal()) 1561 return DAG.getConstant((uint64_t)GA->getOffset() - GB->getOffset(), 1562 VT); 1563 } 1564 1565 return SDValue(); 1566} 1567 1568SDValue DAGCombiner::visitMUL(SDNode *N) { 1569 SDValue N0 = N->getOperand(0); 1570 SDValue N1 = N->getOperand(1); 1571 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1572 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1573 EVT VT = N0.getValueType(); 1574 1575 // fold vector ops 1576 if (VT.isVector()) { 1577 SDValue FoldedVOp = SimplifyVBinOp(N); 1578 if (FoldedVOp.getNode()) return FoldedVOp; 1579 } 1580 1581 // fold (mul x, undef) -> 0 1582 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF) 1583 return DAG.getConstant(0, VT); 1584 // fold (mul c1, c2) -> c1*c2 1585 if (N0C && N1C) 1586 return DAG.FoldConstantArithmetic(ISD::MUL, VT, N0C, N1C); 1587 // canonicalize constant to RHS 1588 if (N0C && !N1C) 1589 return DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, N1, N0); 1590 // fold (mul x, 0) -> 0 1591 if (N1C && N1C->isNullValue()) 1592 return N1; 1593 // fold (mul x, -1) -> 0-x 1594 if (N1C && N1C->isAllOnesValue()) 1595 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1596 DAG.getConstant(0, VT), N0); 1597 // fold (mul x, (1 << c)) -> x << c 1598 if (N1C && N1C->getAPIntValue().isPowerOf2()) 1599 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0, 1600 DAG.getConstant(N1C->getAPIntValue().logBase2(), 1601 getShiftAmountTy())); 1602 // fold (mul x, -(1 << c)) -> -(x << c) or (-x) << c 1603 if (N1C && (-N1C->getAPIntValue()).isPowerOf2()) { 1604 unsigned Log2Val = (-N1C->getAPIntValue()).logBase2(); 1605 // FIXME: If the input is something that is easily negated (e.g. a 1606 // single-use add), we should put the negate there. 1607 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1608 DAG.getConstant(0, VT), 1609 DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0, 1610 DAG.getConstant(Log2Val, getShiftAmountTy()))); 1611 } 1612 // (mul (shl X, c1), c2) -> (mul X, c2 << c1) 1613 if (N1C && N0.getOpcode() == ISD::SHL && 1614 isa<ConstantSDNode>(N0.getOperand(1))) { 1615 SDValue C3 = DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, 1616 N1, N0.getOperand(1)); 1617 AddToWorkList(C3.getNode()); 1618 return DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, 1619 N0.getOperand(0), C3); 1620 } 1621 1622 // Change (mul (shl X, C), Y) -> (shl (mul X, Y), C) when the shift has one 1623 // use. 1624 { 1625 SDValue Sh(0,0), Y(0,0); 1626 // Check for both (mul (shl X, C), Y) and (mul Y, (shl X, C)). 1627 if (N0.getOpcode() == ISD::SHL && isa<ConstantSDNode>(N0.getOperand(1)) && 1628 N0.getNode()->hasOneUse()) { 1629 Sh = N0; Y = N1; 1630 } else if (N1.getOpcode() == ISD::SHL && 1631 isa<ConstantSDNode>(N1.getOperand(1)) && 1632 N1.getNode()->hasOneUse()) { 1633 Sh = N1; Y = N0; 1634 } 1635 1636 if (Sh.getNode()) { 1637 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, 1638 Sh.getOperand(0), Y); 1639 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, 1640 Mul, Sh.getOperand(1)); 1641 } 1642 } 1643 1644 // fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2) 1645 if (N1C && N0.getOpcode() == ISD::ADD && N0.getNode()->hasOneUse() && 1646 isa<ConstantSDNode>(N0.getOperand(1))) 1647 return DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, 1648 DAG.getNode(ISD::MUL, N0.getDebugLoc(), VT, 1649 N0.getOperand(0), N1), 1650 DAG.getNode(ISD::MUL, N1.getDebugLoc(), VT, 1651 N0.getOperand(1), N1)); 1652 1653 // reassociate mul 1654 SDValue RMUL = ReassociateOps(ISD::MUL, N->getDebugLoc(), N0, N1); 1655 if (RMUL.getNode() != 0) 1656 return RMUL; 1657 1658 return SDValue(); 1659} 1660 1661SDValue DAGCombiner::visitSDIV(SDNode *N) { 1662 SDValue N0 = N->getOperand(0); 1663 SDValue N1 = N->getOperand(1); 1664 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode()); 1665 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode()); 1666 EVT VT = N->getValueType(0); 1667 1668 // fold vector ops 1669 if (VT.isVector()) { 1670 SDValue FoldedVOp = SimplifyVBinOp(N); 1671 if (FoldedVOp.getNode()) return FoldedVOp; 1672 } 1673 1674 // fold (sdiv c1, c2) -> c1/c2 1675 if (N0C && N1C && !N1C->isNullValue()) 1676 return DAG.FoldConstantArithmetic(ISD::SDIV, VT, N0C, N1C); 1677 // fold (sdiv X, 1) -> X 1678 if (N1C && N1C->getSExtValue() == 1LL) 1679 return N0; 1680 // fold (sdiv X, -1) -> 0-X 1681 if (N1C && N1C->isAllOnesValue()) 1682 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1683 DAG.getConstant(0, VT), N0); 1684 // If we know the sign bits of both operands are zero, strength reduce to a 1685 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2 1686 if (!VT.isVector()) { 1687 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0)) 1688 return DAG.getNode(ISD::UDIV, N->getDebugLoc(), N1.getValueType(), 1689 N0, N1); 1690 } 1691 // fold (sdiv X, pow2) -> simple ops after legalize 1692 if (N1C && !N1C->isNullValue() && !TLI.isIntDivCheap() && 1693 (isPowerOf2_64(N1C->getSExtValue()) || 1694 isPowerOf2_64(-N1C->getSExtValue()))) { 1695 // If dividing by powers of two is cheap, then don't perform the following 1696 // fold. 1697 if (TLI.isPow2DivCheap()) 1698 return SDValue(); 1699 1700 int64_t pow2 = N1C->getSExtValue(); 1701 int64_t abs2 = pow2 > 0 ? pow2 : -pow2; 1702 unsigned lg2 = Log2_64(abs2); 1703 1704 // Splat the sign bit into the register 1705 SDValue SGN = DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0, 1706 DAG.getConstant(VT.getSizeInBits()-1, 1707 getShiftAmountTy())); 1708 AddToWorkList(SGN.getNode()); 1709 1710 // Add (N0 < 0) ? abs2 - 1 : 0; 1711 SDValue SRL = DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, SGN, 1712 DAG.getConstant(VT.getSizeInBits() - lg2, 1713 getShiftAmountTy())); 1714 SDValue ADD = DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N0, SRL); 1715 AddToWorkList(SRL.getNode()); 1716 AddToWorkList(ADD.getNode()); // Divide by pow2 1717 SDValue SRA = DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, ADD, 1718 DAG.getConstant(lg2, getShiftAmountTy())); 1719 1720 // If we're dividing by a positive value, we're done. Otherwise, we must 1721 // negate the result. 1722 if (pow2 > 0) 1723 return SRA; 1724 1725 AddToWorkList(SRA.getNode()); 1726 return DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, 1727 DAG.getConstant(0, VT), SRA); 1728 } 1729 1730 // if integer divide is expensive and we satisfy the requirements, emit an 1731 // alternate sequence. 1732 if (N1C && (N1C->getSExtValue() < -1 || N1C->getSExtValue() > 1) && 1733 !TLI.isIntDivCheap()) { 1734 SDValue Op = BuildSDIV(N); 1735 if (Op.getNode()) return Op; 1736 } 1737 1738 // undef / X -> 0 1739 if (N0.getOpcode() == ISD::UNDEF) 1740 return DAG.getConstant(0, VT); 1741 // X / undef -> undef 1742 if (N1.getOpcode() == ISD::UNDEF) 1743 return N1; 1744 1745 return SDValue(); 1746} 1747 1748SDValue DAGCombiner::visitUDIV(SDNode *N) { 1749 SDValue N0 = N->getOperand(0); 1750 SDValue N1 = N->getOperand(1); 1751 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getNode()); 1752 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode()); 1753 EVT VT = N->getValueType(0); 1754 1755 // fold vector ops 1756 if (VT.isVector()) { 1757 SDValue FoldedVOp = SimplifyVBinOp(N); 1758 if (FoldedVOp.getNode()) return FoldedVOp; 1759 } 1760 1761 // fold (udiv c1, c2) -> c1/c2 1762 if (N0C && N1C && !N1C->isNullValue()) 1763 return DAG.FoldConstantArithmetic(ISD::UDIV, VT, N0C, N1C); 1764 // fold (udiv x, (1 << c)) -> x >>u c 1765 if (N1C && N1C->getAPIntValue().isPowerOf2()) 1766 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, 1767 DAG.getConstant(N1C->getAPIntValue().logBase2(), 1768 getShiftAmountTy())); 1769 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2 1770 if (N1.getOpcode() == ISD::SHL) { 1771 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) { 1772 if (SHC->getAPIntValue().isPowerOf2()) { 1773 EVT ADDVT = N1.getOperand(1).getValueType(); 1774 SDValue Add = DAG.getNode(ISD::ADD, N->getDebugLoc(), ADDVT, 1775 N1.getOperand(1), 1776 DAG.getConstant(SHC->getAPIntValue() 1777 .logBase2(), 1778 ADDVT)); 1779 AddToWorkList(Add.getNode()); 1780 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, Add); 1781 } 1782 } 1783 } 1784 // fold (udiv x, c) -> alternate 1785 if (N1C && !N1C->isNullValue() && !TLI.isIntDivCheap()) { 1786 SDValue Op = BuildUDIV(N); 1787 if (Op.getNode()) return Op; 1788 } 1789 1790 // undef / X -> 0 1791 if (N0.getOpcode() == ISD::UNDEF) 1792 return DAG.getConstant(0, VT); 1793 // X / undef -> undef 1794 if (N1.getOpcode() == ISD::UNDEF) 1795 return N1; 1796 1797 return SDValue(); 1798} 1799 1800SDValue DAGCombiner::visitSREM(SDNode *N) { 1801 SDValue N0 = N->getOperand(0); 1802 SDValue N1 = N->getOperand(1); 1803 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1804 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1805 EVT VT = N->getValueType(0); 1806 1807 // fold (srem c1, c2) -> c1%c2 1808 if (N0C && N1C && !N1C->isNullValue()) 1809 return DAG.FoldConstantArithmetic(ISD::SREM, VT, N0C, N1C); 1810 // If we know the sign bits of both operands are zero, strength reduce to a 1811 // urem instead. Handles (X & 0x0FFFFFFF) %s 16 -> X&15 1812 if (!VT.isVector()) { 1813 if (DAG.SignBitIsZero(N1) && DAG.SignBitIsZero(N0)) 1814 return DAG.getNode(ISD::UREM, N->getDebugLoc(), VT, N0, N1); 1815 } 1816 1817 // If X/C can be simplified by the division-by-constant logic, lower 1818 // X%C to the equivalent of X-X/C*C. 1819 if (N1C && !N1C->isNullValue()) { 1820 SDValue Div = DAG.getNode(ISD::SDIV, N->getDebugLoc(), VT, N0, N1); 1821 AddToWorkList(Div.getNode()); 1822 SDValue OptimizedDiv = combine(Div.getNode()); 1823 if (OptimizedDiv.getNode() && OptimizedDiv.getNode() != Div.getNode()) { 1824 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, 1825 OptimizedDiv, N1); 1826 SDValue Sub = DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, Mul); 1827 AddToWorkList(Mul.getNode()); 1828 return Sub; 1829 } 1830 } 1831 1832 // undef % X -> 0 1833 if (N0.getOpcode() == ISD::UNDEF) 1834 return DAG.getConstant(0, VT); 1835 // X % undef -> undef 1836 if (N1.getOpcode() == ISD::UNDEF) 1837 return N1; 1838 1839 return SDValue(); 1840} 1841 1842SDValue DAGCombiner::visitUREM(SDNode *N) { 1843 SDValue N0 = N->getOperand(0); 1844 SDValue N1 = N->getOperand(1); 1845 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1846 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1847 EVT VT = N->getValueType(0); 1848 1849 // fold (urem c1, c2) -> c1%c2 1850 if (N0C && N1C && !N1C->isNullValue()) 1851 return DAG.FoldConstantArithmetic(ISD::UREM, VT, N0C, N1C); 1852 // fold (urem x, pow2) -> (and x, pow2-1) 1853 if (N1C && !N1C->isNullValue() && N1C->getAPIntValue().isPowerOf2()) 1854 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, 1855 DAG.getConstant(N1C->getAPIntValue()-1,VT)); 1856 // fold (urem x, (shl pow2, y)) -> (and x, (add (shl pow2, y), -1)) 1857 if (N1.getOpcode() == ISD::SHL) { 1858 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) { 1859 if (SHC->getAPIntValue().isPowerOf2()) { 1860 SDValue Add = 1861 DAG.getNode(ISD::ADD, N->getDebugLoc(), VT, N1, 1862 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), 1863 VT)); 1864 AddToWorkList(Add.getNode()); 1865 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, Add); 1866 } 1867 } 1868 } 1869 1870 // If X/C can be simplified by the division-by-constant logic, lower 1871 // X%C to the equivalent of X-X/C*C. 1872 if (N1C && !N1C->isNullValue()) { 1873 SDValue Div = DAG.getNode(ISD::UDIV, N->getDebugLoc(), VT, N0, N1); 1874 AddToWorkList(Div.getNode()); 1875 SDValue OptimizedDiv = combine(Div.getNode()); 1876 if (OptimizedDiv.getNode() && OptimizedDiv.getNode() != Div.getNode()) { 1877 SDValue Mul = DAG.getNode(ISD::MUL, N->getDebugLoc(), VT, 1878 OptimizedDiv, N1); 1879 SDValue Sub = DAG.getNode(ISD::SUB, N->getDebugLoc(), VT, N0, Mul); 1880 AddToWorkList(Mul.getNode()); 1881 return Sub; 1882 } 1883 } 1884 1885 // undef % X -> 0 1886 if (N0.getOpcode() == ISD::UNDEF) 1887 return DAG.getConstant(0, VT); 1888 // X % undef -> undef 1889 if (N1.getOpcode() == ISD::UNDEF) 1890 return N1; 1891 1892 return SDValue(); 1893} 1894 1895SDValue DAGCombiner::visitMULHS(SDNode *N) { 1896 SDValue N0 = N->getOperand(0); 1897 SDValue N1 = N->getOperand(1); 1898 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1899 EVT VT = N->getValueType(0); 1900 1901 // fold (mulhs x, 0) -> 0 1902 if (N1C && N1C->isNullValue()) 1903 return N1; 1904 // fold (mulhs x, 1) -> (sra x, size(x)-1) 1905 if (N1C && N1C->getAPIntValue() == 1) 1906 return DAG.getNode(ISD::SRA, N->getDebugLoc(), N0.getValueType(), N0, 1907 DAG.getConstant(N0.getValueType().getSizeInBits() - 1, 1908 getShiftAmountTy())); 1909 // fold (mulhs x, undef) -> 0 1910 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF) 1911 return DAG.getConstant(0, VT); 1912 1913 return SDValue(); 1914} 1915 1916SDValue DAGCombiner::visitMULHU(SDNode *N) { 1917 SDValue N0 = N->getOperand(0); 1918 SDValue N1 = N->getOperand(1); 1919 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1920 EVT VT = N->getValueType(0); 1921 1922 // fold (mulhu x, 0) -> 0 1923 if (N1C && N1C->isNullValue()) 1924 return N1; 1925 // fold (mulhu x, 1) -> 0 1926 if (N1C && N1C->getAPIntValue() == 1) 1927 return DAG.getConstant(0, N0.getValueType()); 1928 // fold (mulhu x, undef) -> 0 1929 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF) 1930 return DAG.getConstant(0, VT); 1931 1932 return SDValue(); 1933} 1934 1935/// SimplifyNodeWithTwoResults - Perform optimizations common to nodes that 1936/// compute two values. LoOp and HiOp give the opcodes for the two computations 1937/// that are being performed. Return true if a simplification was made. 1938/// 1939SDValue DAGCombiner::SimplifyNodeWithTwoResults(SDNode *N, unsigned LoOp, 1940 unsigned HiOp) { 1941 // If the high half is not needed, just compute the low half. 1942 bool HiExists = N->hasAnyUseOfValue(1); 1943 if (!HiExists && 1944 (!LegalOperations || 1945 TLI.isOperationLegal(LoOp, N->getValueType(0)))) { 1946 SDValue Res = DAG.getNode(LoOp, N->getDebugLoc(), N->getValueType(0), 1947 N->op_begin(), N->getNumOperands()); 1948 return CombineTo(N, Res, Res); 1949 } 1950 1951 // If the low half is not needed, just compute the high half. 1952 bool LoExists = N->hasAnyUseOfValue(0); 1953 if (!LoExists && 1954 (!LegalOperations || 1955 TLI.isOperationLegal(HiOp, N->getValueType(1)))) { 1956 SDValue Res = DAG.getNode(HiOp, N->getDebugLoc(), N->getValueType(1), 1957 N->op_begin(), N->getNumOperands()); 1958 return CombineTo(N, Res, Res); 1959 } 1960 1961 // If both halves are used, return as it is. 1962 if (LoExists && HiExists) 1963 return SDValue(); 1964 1965 // If the two computed results can be simplified separately, separate them. 1966 if (LoExists) { 1967 SDValue Lo = DAG.getNode(LoOp, N->getDebugLoc(), N->getValueType(0), 1968 N->op_begin(), N->getNumOperands()); 1969 AddToWorkList(Lo.getNode()); 1970 SDValue LoOpt = combine(Lo.getNode()); 1971 if (LoOpt.getNode() && LoOpt.getNode() != Lo.getNode() && 1972 (!LegalOperations || 1973 TLI.isOperationLegal(LoOpt.getOpcode(), LoOpt.getValueType()))) 1974 return CombineTo(N, LoOpt, LoOpt); 1975 } 1976 1977 if (HiExists) { 1978 SDValue Hi = DAG.getNode(HiOp, N->getDebugLoc(), N->getValueType(1), 1979 N->op_begin(), N->getNumOperands()); 1980 AddToWorkList(Hi.getNode()); 1981 SDValue HiOpt = combine(Hi.getNode()); 1982 if (HiOpt.getNode() && HiOpt != Hi && 1983 (!LegalOperations || 1984 TLI.isOperationLegal(HiOpt.getOpcode(), HiOpt.getValueType()))) 1985 return CombineTo(N, HiOpt, HiOpt); 1986 } 1987 1988 return SDValue(); 1989} 1990 1991SDValue DAGCombiner::visitSMUL_LOHI(SDNode *N) { 1992 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHS); 1993 if (Res.getNode()) return Res; 1994 1995 return SDValue(); 1996} 1997 1998SDValue DAGCombiner::visitUMUL_LOHI(SDNode *N) { 1999 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::MUL, ISD::MULHU); 2000 if (Res.getNode()) return Res; 2001 2002 return SDValue(); 2003} 2004 2005SDValue DAGCombiner::visitSDIVREM(SDNode *N) { 2006 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::SDIV, ISD::SREM); 2007 if (Res.getNode()) return Res; 2008 2009 return SDValue(); 2010} 2011 2012SDValue DAGCombiner::visitUDIVREM(SDNode *N) { 2013 SDValue Res = SimplifyNodeWithTwoResults(N, ISD::UDIV, ISD::UREM); 2014 if (Res.getNode()) return Res; 2015 2016 return SDValue(); 2017} 2018 2019/// SimplifyBinOpWithSameOpcodeHands - If this is a binary operator with 2020/// two operands of the same opcode, try to simplify it. 2021SDValue DAGCombiner::SimplifyBinOpWithSameOpcodeHands(SDNode *N) { 2022 SDValue N0 = N->getOperand(0), N1 = N->getOperand(1); 2023 EVT VT = N0.getValueType(); 2024 assert(N0.getOpcode() == N1.getOpcode() && "Bad input!"); 2025 2026 // Bail early if none of these transforms apply. 2027 if (N0.getNode()->getNumOperands() == 0) return SDValue(); 2028 2029 // For each of OP in AND/OR/XOR: 2030 // fold (OP (zext x), (zext y)) -> (zext (OP x, y)) 2031 // fold (OP (sext x), (sext y)) -> (sext (OP x, y)) 2032 // fold (OP (aext x), (aext y)) -> (aext (OP x, y)) 2033 // fold (OP (trunc x), (trunc y)) -> (trunc (OP x, y)) (if trunc isn't free) 2034 // 2035 // do not sink logical op inside of a vector extend, since it may combine 2036 // into a vsetcc. 2037 EVT Op0VT = N0.getOperand(0).getValueType(); 2038 if ((N0.getOpcode() == ISD::ZERO_EXTEND || 2039 N0.getOpcode() == ISD::SIGN_EXTEND || 2040 // Avoid infinite looping with PromoteIntBinOp. 2041 (N0.getOpcode() == ISD::ANY_EXTEND && 2042 (!LegalTypes || TLI.isTypeDesirableForOp(N->getOpcode(), Op0VT))) || 2043 (N0.getOpcode() == ISD::TRUNCATE && 2044 (!TLI.isZExtFree(VT, Op0VT) || 2045 !TLI.isTruncateFree(Op0VT, VT)) && 2046 TLI.isTypeLegal(Op0VT))) && 2047 !VT.isVector() && 2048 Op0VT == N1.getOperand(0).getValueType() && 2049 (!LegalOperations || TLI.isOperationLegal(N->getOpcode(), Op0VT))) { 2050 SDValue ORNode = DAG.getNode(N->getOpcode(), N0.getDebugLoc(), 2051 N0.getOperand(0).getValueType(), 2052 N0.getOperand(0), N1.getOperand(0)); 2053 AddToWorkList(ORNode.getNode()); 2054 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, ORNode); 2055 } 2056 2057 // For each of OP in SHL/SRL/SRA/AND... 2058 // fold (and (OP x, z), (OP y, z)) -> (OP (and x, y), z) 2059 // fold (or (OP x, z), (OP y, z)) -> (OP (or x, y), z) 2060 // fold (xor (OP x, z), (OP y, z)) -> (OP (xor x, y), z) 2061 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL || 2062 N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::AND) && 2063 N0.getOperand(1) == N1.getOperand(1)) { 2064 SDValue ORNode = DAG.getNode(N->getOpcode(), N0.getDebugLoc(), 2065 N0.getOperand(0).getValueType(), 2066 N0.getOperand(0), N1.getOperand(0)); 2067 AddToWorkList(ORNode.getNode()); 2068 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, 2069 ORNode, N0.getOperand(1)); 2070 } 2071 2072 return SDValue(); 2073} 2074 2075SDValue DAGCombiner::visitAND(SDNode *N) { 2076 SDValue N0 = N->getOperand(0); 2077 SDValue N1 = N->getOperand(1); 2078 SDValue LL, LR, RL, RR, CC0, CC1; 2079 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2080 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2081 EVT VT = N1.getValueType(); 2082 unsigned BitWidth = VT.getScalarType().getSizeInBits(); 2083 2084 // fold vector ops 2085 if (VT.isVector()) { 2086 SDValue FoldedVOp = SimplifyVBinOp(N); 2087 if (FoldedVOp.getNode()) return FoldedVOp; 2088 } 2089 2090 // fold (and x, undef) -> 0 2091 if (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF) 2092 return DAG.getConstant(0, VT); 2093 // fold (and c1, c2) -> c1&c2 2094 if (N0C && N1C) 2095 return DAG.FoldConstantArithmetic(ISD::AND, VT, N0C, N1C); 2096 // canonicalize constant to RHS 2097 if (N0C && !N1C) 2098 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N1, N0); 2099 // fold (and x, -1) -> x 2100 if (N1C && N1C->isAllOnesValue()) 2101 return N0; 2102 // if (and x, c) is known to be zero, return 0 2103 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0), 2104 APInt::getAllOnesValue(BitWidth))) 2105 return DAG.getConstant(0, VT); 2106 // reassociate and 2107 SDValue RAND = ReassociateOps(ISD::AND, N->getDebugLoc(), N0, N1); 2108 if (RAND.getNode() != 0) 2109 return RAND; 2110 // fold (and (or x, C), D) -> D if (C & D) == D 2111 if (N1C && N0.getOpcode() == ISD::OR) 2112 if (ConstantSDNode *ORI = dyn_cast<ConstantSDNode>(N0.getOperand(1))) 2113 if ((ORI->getAPIntValue() & N1C->getAPIntValue()) == N1C->getAPIntValue()) 2114 return N1; 2115 // fold (and (any_ext V), c) -> (zero_ext V) if 'and' only clears top bits. 2116 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) { 2117 SDValue N0Op0 = N0.getOperand(0); 2118 APInt Mask = ~N1C->getAPIntValue(); 2119 Mask.trunc(N0Op0.getValueSizeInBits()); 2120 if (DAG.MaskedValueIsZero(N0Op0, Mask)) { 2121 SDValue Zext = DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), 2122 N0.getValueType(), N0Op0); 2123 2124 // Replace uses of the AND with uses of the Zero extend node. 2125 CombineTo(N, Zext); 2126 2127 // We actually want to replace all uses of the any_extend with the 2128 // zero_extend, to avoid duplicating things. This will later cause this 2129 // AND to be folded. 2130 CombineTo(N0.getNode(), Zext); 2131 return SDValue(N, 0); // Return N so it doesn't get rechecked! 2132 } 2133 } 2134 // fold (and (setcc x), (setcc y)) -> (setcc (and x, y)) 2135 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){ 2136 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get(); 2137 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get(); 2138 2139 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 && 2140 LL.getValueType().isInteger()) { 2141 // fold (and (seteq X, 0), (seteq Y, 0)) -> (seteq (or X, Y), 0) 2142 if (cast<ConstantSDNode>(LR)->isNullValue() && Op1 == ISD::SETEQ) { 2143 SDValue ORNode = DAG.getNode(ISD::OR, N0.getDebugLoc(), 2144 LR.getValueType(), LL, RL); 2145 AddToWorkList(ORNode.getNode()); 2146 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1); 2147 } 2148 // fold (and (seteq X, -1), (seteq Y, -1)) -> (seteq (and X, Y), -1) 2149 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETEQ) { 2150 SDValue ANDNode = DAG.getNode(ISD::AND, N0.getDebugLoc(), 2151 LR.getValueType(), LL, RL); 2152 AddToWorkList(ANDNode.getNode()); 2153 return DAG.getSetCC(N->getDebugLoc(), VT, ANDNode, LR, Op1); 2154 } 2155 // fold (and (setgt X, -1), (setgt Y, -1)) -> (setgt (or X, Y), -1) 2156 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETGT) { 2157 SDValue ORNode = DAG.getNode(ISD::OR, N0.getDebugLoc(), 2158 LR.getValueType(), LL, RL); 2159 AddToWorkList(ORNode.getNode()); 2160 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1); 2161 } 2162 } 2163 // canonicalize equivalent to ll == rl 2164 if (LL == RR && LR == RL) { 2165 Op1 = ISD::getSetCCSwappedOperands(Op1); 2166 std::swap(RL, RR); 2167 } 2168 if (LL == RL && LR == RR) { 2169 bool isInteger = LL.getValueType().isInteger(); 2170 ISD::CondCode Result = ISD::getSetCCAndOperation(Op0, Op1, isInteger); 2171 if (Result != ISD::SETCC_INVALID && 2172 (!LegalOperations || TLI.isCondCodeLegal(Result, LL.getValueType()))) 2173 return DAG.getSetCC(N->getDebugLoc(), N0.getValueType(), 2174 LL, LR, Result); 2175 } 2176 } 2177 2178 // Simplify: (and (op x...), (op y...)) -> (op (and x, y)) 2179 if (N0.getOpcode() == N1.getOpcode()) { 2180 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N); 2181 if (Tmp.getNode()) return Tmp; 2182 } 2183 2184 // fold (and (sign_extend_inreg x, i16 to i32), 1) -> (and x, 1) 2185 // fold (and (sra)) -> (and (srl)) when possible. 2186 if (!VT.isVector() && 2187 SimplifyDemandedBits(SDValue(N, 0))) 2188 return SDValue(N, 0); 2189 2190 // fold (zext_inreg (extload x)) -> (zextload x) 2191 if (ISD::isEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode())) { 2192 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 2193 EVT MemVT = LN0->getMemoryVT(); 2194 // If we zero all the possible extended bits, then we can turn this into 2195 // a zextload if we are running before legalize or the operation is legal. 2196 unsigned BitWidth = N1.getValueType().getScalarType().getSizeInBits(); 2197 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth, 2198 BitWidth - MemVT.getScalarType().getSizeInBits())) && 2199 ((!LegalOperations && !LN0->isVolatile()) || 2200 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT))) { 2201 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getDebugLoc(), 2202 LN0->getChain(), LN0->getBasePtr(), 2203 LN0->getPointerInfo(), MemVT, 2204 LN0->isVolatile(), LN0->isNonTemporal(), 2205 LN0->getAlignment()); 2206 AddToWorkList(N); 2207 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1)); 2208 return SDValue(N, 0); // Return N so it doesn't get rechecked! 2209 } 2210 } 2211 // fold (zext_inreg (sextload x)) -> (zextload x) iff load has one use 2212 if (ISD::isSEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) && 2213 N0.hasOneUse()) { 2214 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 2215 EVT MemVT = LN0->getMemoryVT(); 2216 // If we zero all the possible extended bits, then we can turn this into 2217 // a zextload if we are running before legalize or the operation is legal. 2218 unsigned BitWidth = N1.getValueType().getScalarType().getSizeInBits(); 2219 if (DAG.MaskedValueIsZero(N1, APInt::getHighBitsSet(BitWidth, 2220 BitWidth - MemVT.getScalarType().getSizeInBits())) && 2221 ((!LegalOperations && !LN0->isVolatile()) || 2222 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT))) { 2223 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getDebugLoc(), 2224 LN0->getChain(), 2225 LN0->getBasePtr(), LN0->getPointerInfo(), 2226 MemVT, 2227 LN0->isVolatile(), LN0->isNonTemporal(), 2228 LN0->getAlignment()); 2229 AddToWorkList(N); 2230 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1)); 2231 return SDValue(N, 0); // Return N so it doesn't get rechecked! 2232 } 2233 } 2234 2235 // fold (and (load x), 255) -> (zextload x, i8) 2236 // fold (and (extload x, i16), 255) -> (zextload x, i8) 2237 // fold (and (any_ext (extload x, i16)), 255) -> (zextload x, i8) 2238 if (N1C && (N0.getOpcode() == ISD::LOAD || 2239 (N0.getOpcode() == ISD::ANY_EXTEND && 2240 N0.getOperand(0).getOpcode() == ISD::LOAD))) { 2241 bool HasAnyExt = N0.getOpcode() == ISD::ANY_EXTEND; 2242 LoadSDNode *LN0 = HasAnyExt 2243 ? cast<LoadSDNode>(N0.getOperand(0)) 2244 : cast<LoadSDNode>(N0); 2245 if (LN0->getExtensionType() != ISD::SEXTLOAD && 2246 LN0->isUnindexed() && N0.hasOneUse() && LN0->hasOneUse()) { 2247 uint32_t ActiveBits = N1C->getAPIntValue().getActiveBits(); 2248 if (ActiveBits > 0 && APIntOps::isMask(ActiveBits, N1C->getAPIntValue())){ 2249 EVT ExtVT = EVT::getIntegerVT(*DAG.getContext(), ActiveBits); 2250 EVT LoadedVT = LN0->getMemoryVT(); 2251 2252 if (ExtVT == LoadedVT && 2253 (!LegalOperations || TLI.isLoadExtLegal(ISD::ZEXTLOAD, ExtVT))) { 2254 EVT LoadResultTy = HasAnyExt ? LN0->getValueType(0) : VT; 2255 2256 SDValue NewLoad = 2257 DAG.getExtLoad(ISD::ZEXTLOAD, LoadResultTy, LN0->getDebugLoc(), 2258 LN0->getChain(), LN0->getBasePtr(), 2259 LN0->getPointerInfo(), 2260 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(), 2261 LN0->getAlignment()); 2262 AddToWorkList(N); 2263 CombineTo(LN0, NewLoad, NewLoad.getValue(1)); 2264 return SDValue(N, 0); // Return N so it doesn't get rechecked! 2265 } 2266 2267 // Do not change the width of a volatile load. 2268 // Do not generate loads of non-round integer types since these can 2269 // be expensive (and would be wrong if the type is not byte sized). 2270 if (!LN0->isVolatile() && LoadedVT.bitsGT(ExtVT) && ExtVT.isRound() && 2271 (!LegalOperations || TLI.isLoadExtLegal(ISD::ZEXTLOAD, ExtVT))) { 2272 EVT PtrType = LN0->getOperand(1).getValueType(); 2273 2274 unsigned Alignment = LN0->getAlignment(); 2275 SDValue NewPtr = LN0->getBasePtr(); 2276 2277 // For big endian targets, we need to add an offset to the pointer 2278 // to load the correct bytes. For little endian systems, we merely 2279 // need to read fewer bytes from the same pointer. 2280 if (TLI.isBigEndian()) { 2281 unsigned LVTStoreBytes = LoadedVT.getStoreSize(); 2282 unsigned EVTStoreBytes = ExtVT.getStoreSize(); 2283 unsigned PtrOff = LVTStoreBytes - EVTStoreBytes; 2284 NewPtr = DAG.getNode(ISD::ADD, LN0->getDebugLoc(), PtrType, 2285 NewPtr, DAG.getConstant(PtrOff, PtrType)); 2286 Alignment = MinAlign(Alignment, PtrOff); 2287 } 2288 2289 AddToWorkList(NewPtr.getNode()); 2290 2291 EVT LoadResultTy = HasAnyExt ? LN0->getValueType(0) : VT; 2292 SDValue Load = 2293 DAG.getExtLoad(ISD::ZEXTLOAD, LoadResultTy, LN0->getDebugLoc(), 2294 LN0->getChain(), NewPtr, 2295 LN0->getPointerInfo(), 2296 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(), 2297 Alignment); 2298 AddToWorkList(N); 2299 CombineTo(LN0, Load, Load.getValue(1)); 2300 return SDValue(N, 0); // Return N so it doesn't get rechecked! 2301 } 2302 } 2303 } 2304 } 2305 2306 return SDValue(); 2307} 2308 2309SDValue DAGCombiner::visitOR(SDNode *N) { 2310 SDValue N0 = N->getOperand(0); 2311 SDValue N1 = N->getOperand(1); 2312 SDValue LL, LR, RL, RR, CC0, CC1; 2313 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2314 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2315 EVT VT = N1.getValueType(); 2316 2317 // fold vector ops 2318 if (VT.isVector()) { 2319 SDValue FoldedVOp = SimplifyVBinOp(N); 2320 if (FoldedVOp.getNode()) return FoldedVOp; 2321 } 2322 2323 // fold (or x, undef) -> -1 2324 if (!LegalOperations && 2325 (N0.getOpcode() == ISD::UNDEF || N1.getOpcode() == ISD::UNDEF)) { 2326 EVT EltVT = VT.isVector() ? VT.getVectorElementType() : VT; 2327 return DAG.getConstant(APInt::getAllOnesValue(EltVT.getSizeInBits()), VT); 2328 } 2329 // fold (or c1, c2) -> c1|c2 2330 if (N0C && N1C) 2331 return DAG.FoldConstantArithmetic(ISD::OR, VT, N0C, N1C); 2332 // canonicalize constant to RHS 2333 if (N0C && !N1C) 2334 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N1, N0); 2335 // fold (or x, 0) -> x 2336 if (N1C && N1C->isNullValue()) 2337 return N0; 2338 // fold (or x, -1) -> -1 2339 if (N1C && N1C->isAllOnesValue()) 2340 return N1; 2341 // fold (or x, c) -> c iff (x & ~c) == 0 2342 if (N1C && DAG.MaskedValueIsZero(N0, ~N1C->getAPIntValue())) 2343 return N1; 2344 // reassociate or 2345 SDValue ROR = ReassociateOps(ISD::OR, N->getDebugLoc(), N0, N1); 2346 if (ROR.getNode() != 0) 2347 return ROR; 2348 // Canonicalize (or (and X, c1), c2) -> (and (or X, c2), c1|c2) 2349 // iff (c1 & c2) == 0. 2350 if (N1C && N0.getOpcode() == ISD::AND && N0.getNode()->hasOneUse() && 2351 isa<ConstantSDNode>(N0.getOperand(1))) { 2352 ConstantSDNode *C1 = cast<ConstantSDNode>(N0.getOperand(1)); 2353 if ((C1->getAPIntValue() & N1C->getAPIntValue()) != 0) 2354 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 2355 DAG.getNode(ISD::OR, N0.getDebugLoc(), VT, 2356 N0.getOperand(0), N1), 2357 DAG.FoldConstantArithmetic(ISD::OR, VT, N1C, C1)); 2358 } 2359 // fold (or (setcc x), (setcc y)) -> (setcc (or x, y)) 2360 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){ 2361 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get(); 2362 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get(); 2363 2364 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 && 2365 LL.getValueType().isInteger()) { 2366 // fold (or (setne X, 0), (setne Y, 0)) -> (setne (or X, Y), 0) 2367 // fold (or (setlt X, 0), (setlt Y, 0)) -> (setne (or X, Y), 0) 2368 if (cast<ConstantSDNode>(LR)->isNullValue() && 2369 (Op1 == ISD::SETNE || Op1 == ISD::SETLT)) { 2370 SDValue ORNode = DAG.getNode(ISD::OR, LR.getDebugLoc(), 2371 LR.getValueType(), LL, RL); 2372 AddToWorkList(ORNode.getNode()); 2373 return DAG.getSetCC(N->getDebugLoc(), VT, ORNode, LR, Op1); 2374 } 2375 // fold (or (setne X, -1), (setne Y, -1)) -> (setne (and X, Y), -1) 2376 // fold (or (setgt X, -1), (setgt Y -1)) -> (setgt (and X, Y), -1) 2377 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && 2378 (Op1 == ISD::SETNE || Op1 == ISD::SETGT)) { 2379 SDValue ANDNode = DAG.getNode(ISD::AND, LR.getDebugLoc(), 2380 LR.getValueType(), LL, RL); 2381 AddToWorkList(ANDNode.getNode()); 2382 return DAG.getSetCC(N->getDebugLoc(), VT, ANDNode, LR, Op1); 2383 } 2384 } 2385 // canonicalize equivalent to ll == rl 2386 if (LL == RR && LR == RL) { 2387 Op1 = ISD::getSetCCSwappedOperands(Op1); 2388 std::swap(RL, RR); 2389 } 2390 if (LL == RL && LR == RR) { 2391 bool isInteger = LL.getValueType().isInteger(); 2392 ISD::CondCode Result = ISD::getSetCCOrOperation(Op0, Op1, isInteger); 2393 if (Result != ISD::SETCC_INVALID && 2394 (!LegalOperations || TLI.isCondCodeLegal(Result, LL.getValueType()))) 2395 return DAG.getSetCC(N->getDebugLoc(), N0.getValueType(), 2396 LL, LR, Result); 2397 } 2398 } 2399 2400 // Simplify: (or (op x...), (op y...)) -> (op (or x, y)) 2401 if (N0.getOpcode() == N1.getOpcode()) { 2402 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N); 2403 if (Tmp.getNode()) return Tmp; 2404 } 2405 2406 // (or (and X, C1), (and Y, C2)) -> (and (or X, Y), C3) if possible. 2407 if (N0.getOpcode() == ISD::AND && 2408 N1.getOpcode() == ISD::AND && 2409 N0.getOperand(1).getOpcode() == ISD::Constant && 2410 N1.getOperand(1).getOpcode() == ISD::Constant && 2411 // Don't increase # computations. 2412 (N0.getNode()->hasOneUse() || N1.getNode()->hasOneUse())) { 2413 // We can only do this xform if we know that bits from X that are set in C2 2414 // but not in C1 are already zero. Likewise for Y. 2415 const APInt &LHSMask = 2416 cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue(); 2417 const APInt &RHSMask = 2418 cast<ConstantSDNode>(N1.getOperand(1))->getAPIntValue(); 2419 2420 if (DAG.MaskedValueIsZero(N0.getOperand(0), RHSMask&~LHSMask) && 2421 DAG.MaskedValueIsZero(N1.getOperand(0), LHSMask&~RHSMask)) { 2422 SDValue X = DAG.getNode(ISD::OR, N0.getDebugLoc(), VT, 2423 N0.getOperand(0), N1.getOperand(0)); 2424 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, X, 2425 DAG.getConstant(LHSMask | RHSMask, VT)); 2426 } 2427 } 2428 2429 // See if this is some rotate idiom. 2430 if (SDNode *Rot = MatchRotate(N0, N1, N->getDebugLoc())) 2431 return SDValue(Rot, 0); 2432 2433 // Simplify the operands using demanded-bits information. 2434 if (!VT.isVector() && 2435 SimplifyDemandedBits(SDValue(N, 0))) 2436 return SDValue(N, 0); 2437 2438 return SDValue(); 2439} 2440 2441/// MatchRotateHalf - Match "(X shl/srl V1) & V2" where V2 may not be present. 2442static bool MatchRotateHalf(SDValue Op, SDValue &Shift, SDValue &Mask) { 2443 if (Op.getOpcode() == ISD::AND) { 2444 if (isa<ConstantSDNode>(Op.getOperand(1))) { 2445 Mask = Op.getOperand(1); 2446 Op = Op.getOperand(0); 2447 } else { 2448 return false; 2449 } 2450 } 2451 2452 if (Op.getOpcode() == ISD::SRL || Op.getOpcode() == ISD::SHL) { 2453 Shift = Op; 2454 return true; 2455 } 2456 2457 return false; 2458} 2459 2460// MatchRotate - Handle an 'or' of two operands. If this is one of the many 2461// idioms for rotate, and if the target supports rotation instructions, generate 2462// a rot[lr]. 2463SDNode *DAGCombiner::MatchRotate(SDValue LHS, SDValue RHS, DebugLoc DL) { 2464 // Must be a legal type. Expanded 'n promoted things won't work with rotates. 2465 EVT VT = LHS.getValueType(); 2466 if (!TLI.isTypeLegal(VT)) return 0; 2467 2468 // The target must have at least one rotate flavor. 2469 bool HasROTL = TLI.isOperationLegalOrCustom(ISD::ROTL, VT); 2470 bool HasROTR = TLI.isOperationLegalOrCustom(ISD::ROTR, VT); 2471 if (!HasROTL && !HasROTR) return 0; 2472 2473 // Match "(X shl/srl V1) & V2" where V2 may not be present. 2474 SDValue LHSShift; // The shift. 2475 SDValue LHSMask; // AND value if any. 2476 if (!MatchRotateHalf(LHS, LHSShift, LHSMask)) 2477 return 0; // Not part of a rotate. 2478 2479 SDValue RHSShift; // The shift. 2480 SDValue RHSMask; // AND value if any. 2481 if (!MatchRotateHalf(RHS, RHSShift, RHSMask)) 2482 return 0; // Not part of a rotate. 2483 2484 if (LHSShift.getOperand(0) != RHSShift.getOperand(0)) 2485 return 0; // Not shifting the same value. 2486 2487 if (LHSShift.getOpcode() == RHSShift.getOpcode()) 2488 return 0; // Shifts must disagree. 2489 2490 // Canonicalize shl to left side in a shl/srl pair. 2491 if (RHSShift.getOpcode() == ISD::SHL) { 2492 std::swap(LHS, RHS); 2493 std::swap(LHSShift, RHSShift); 2494 std::swap(LHSMask , RHSMask ); 2495 } 2496 2497 unsigned OpSizeInBits = VT.getSizeInBits(); 2498 SDValue LHSShiftArg = LHSShift.getOperand(0); 2499 SDValue LHSShiftAmt = LHSShift.getOperand(1); 2500 SDValue RHSShiftAmt = RHSShift.getOperand(1); 2501 2502 // fold (or (shl x, C1), (srl x, C2)) -> (rotl x, C1) 2503 // fold (or (shl x, C1), (srl x, C2)) -> (rotr x, C2) 2504 if (LHSShiftAmt.getOpcode() == ISD::Constant && 2505 RHSShiftAmt.getOpcode() == ISD::Constant) { 2506 uint64_t LShVal = cast<ConstantSDNode>(LHSShiftAmt)->getZExtValue(); 2507 uint64_t RShVal = cast<ConstantSDNode>(RHSShiftAmt)->getZExtValue(); 2508 if ((LShVal + RShVal) != OpSizeInBits) 2509 return 0; 2510 2511 SDValue Rot; 2512 if (HasROTL) 2513 Rot = DAG.getNode(ISD::ROTL, DL, VT, LHSShiftArg, LHSShiftAmt); 2514 else 2515 Rot = DAG.getNode(ISD::ROTR, DL, VT, LHSShiftArg, RHSShiftAmt); 2516 2517 // If there is an AND of either shifted operand, apply it to the result. 2518 if (LHSMask.getNode() || RHSMask.getNode()) { 2519 APInt Mask = APInt::getAllOnesValue(OpSizeInBits); 2520 2521 if (LHSMask.getNode()) { 2522 APInt RHSBits = APInt::getLowBitsSet(OpSizeInBits, LShVal); 2523 Mask &= cast<ConstantSDNode>(LHSMask)->getAPIntValue() | RHSBits; 2524 } 2525 if (RHSMask.getNode()) { 2526 APInt LHSBits = APInt::getHighBitsSet(OpSizeInBits, RShVal); 2527 Mask &= cast<ConstantSDNode>(RHSMask)->getAPIntValue() | LHSBits; 2528 } 2529 2530 Rot = DAG.getNode(ISD::AND, DL, VT, Rot, DAG.getConstant(Mask, VT)); 2531 } 2532 2533 return Rot.getNode(); 2534 } 2535 2536 // If there is a mask here, and we have a variable shift, we can't be sure 2537 // that we're masking out the right stuff. 2538 if (LHSMask.getNode() || RHSMask.getNode()) 2539 return 0; 2540 2541 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotl x, y) 2542 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotr x, (sub 32, y)) 2543 if (RHSShiftAmt.getOpcode() == ISD::SUB && 2544 LHSShiftAmt == RHSShiftAmt.getOperand(1)) { 2545 if (ConstantSDNode *SUBC = 2546 dyn_cast<ConstantSDNode>(RHSShiftAmt.getOperand(0))) { 2547 if (SUBC->getAPIntValue() == OpSizeInBits) { 2548 if (HasROTL) 2549 return DAG.getNode(ISD::ROTL, DL, VT, 2550 LHSShiftArg, LHSShiftAmt).getNode(); 2551 else 2552 return DAG.getNode(ISD::ROTR, DL, VT, 2553 LHSShiftArg, RHSShiftAmt).getNode(); 2554 } 2555 } 2556 } 2557 2558 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotr x, y) 2559 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotl x, (sub 32, y)) 2560 if (LHSShiftAmt.getOpcode() == ISD::SUB && 2561 RHSShiftAmt == LHSShiftAmt.getOperand(1)) { 2562 if (ConstantSDNode *SUBC = 2563 dyn_cast<ConstantSDNode>(LHSShiftAmt.getOperand(0))) { 2564 if (SUBC->getAPIntValue() == OpSizeInBits) { 2565 if (HasROTR) 2566 return DAG.getNode(ISD::ROTR, DL, VT, 2567 LHSShiftArg, RHSShiftAmt).getNode(); 2568 else 2569 return DAG.getNode(ISD::ROTL, DL, VT, 2570 LHSShiftArg, LHSShiftAmt).getNode(); 2571 } 2572 } 2573 } 2574 2575 // Look for sign/zext/any-extended or truncate cases: 2576 if ((LHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND 2577 || LHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND 2578 || LHSShiftAmt.getOpcode() == ISD::ANY_EXTEND 2579 || LHSShiftAmt.getOpcode() == ISD::TRUNCATE) && 2580 (RHSShiftAmt.getOpcode() == ISD::SIGN_EXTEND 2581 || RHSShiftAmt.getOpcode() == ISD::ZERO_EXTEND 2582 || RHSShiftAmt.getOpcode() == ISD::ANY_EXTEND 2583 || RHSShiftAmt.getOpcode() == ISD::TRUNCATE)) { 2584 SDValue LExtOp0 = LHSShiftAmt.getOperand(0); 2585 SDValue RExtOp0 = RHSShiftAmt.getOperand(0); 2586 if (RExtOp0.getOpcode() == ISD::SUB && 2587 RExtOp0.getOperand(1) == LExtOp0) { 2588 // fold (or (shl x, (*ext y)), (srl x, (*ext (sub 32, y)))) -> 2589 // (rotl x, y) 2590 // fold (or (shl x, (*ext y)), (srl x, (*ext (sub 32, y)))) -> 2591 // (rotr x, (sub 32, y)) 2592 if (ConstantSDNode *SUBC = 2593 dyn_cast<ConstantSDNode>(RExtOp0.getOperand(0))) { 2594 if (SUBC->getAPIntValue() == OpSizeInBits) { 2595 return DAG.getNode(HasROTL ? ISD::ROTL : ISD::ROTR, DL, VT, 2596 LHSShiftArg, 2597 HasROTL ? LHSShiftAmt : RHSShiftAmt).getNode(); 2598 } 2599 } 2600 } else if (LExtOp0.getOpcode() == ISD::SUB && 2601 RExtOp0 == LExtOp0.getOperand(1)) { 2602 // fold (or (shl x, (*ext (sub 32, y))), (srl x, (*ext y))) -> 2603 // (rotr x, y) 2604 // fold (or (shl x, (*ext (sub 32, y))), (srl x, (*ext y))) -> 2605 // (rotl x, (sub 32, y)) 2606 if (ConstantSDNode *SUBC = 2607 dyn_cast<ConstantSDNode>(LExtOp0.getOperand(0))) { 2608 if (SUBC->getAPIntValue() == OpSizeInBits) { 2609 return DAG.getNode(HasROTR ? ISD::ROTR : ISD::ROTL, DL, VT, 2610 LHSShiftArg, 2611 HasROTR ? RHSShiftAmt : LHSShiftAmt).getNode(); 2612 } 2613 } 2614 } 2615 } 2616 2617 return 0; 2618} 2619 2620SDValue DAGCombiner::visitXOR(SDNode *N) { 2621 SDValue N0 = N->getOperand(0); 2622 SDValue N1 = N->getOperand(1); 2623 SDValue LHS, RHS, CC; 2624 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2625 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2626 EVT VT = N0.getValueType(); 2627 2628 // fold vector ops 2629 if (VT.isVector()) { 2630 SDValue FoldedVOp = SimplifyVBinOp(N); 2631 if (FoldedVOp.getNode()) return FoldedVOp; 2632 } 2633 2634 // fold (xor undef, undef) -> 0. This is a common idiom (misuse). 2635 if (N0.getOpcode() == ISD::UNDEF && N1.getOpcode() == ISD::UNDEF) 2636 return DAG.getConstant(0, VT); 2637 // fold (xor x, undef) -> undef 2638 if (N0.getOpcode() == ISD::UNDEF) 2639 return N0; 2640 if (N1.getOpcode() == ISD::UNDEF) 2641 return N1; 2642 // fold (xor c1, c2) -> c1^c2 2643 if (N0C && N1C) 2644 return DAG.FoldConstantArithmetic(ISD::XOR, VT, N0C, N1C); 2645 // canonicalize constant to RHS 2646 if (N0C && !N1C) 2647 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N1, N0); 2648 // fold (xor x, 0) -> x 2649 if (N1C && N1C->isNullValue()) 2650 return N0; 2651 // reassociate xor 2652 SDValue RXOR = ReassociateOps(ISD::XOR, N->getDebugLoc(), N0, N1); 2653 if (RXOR.getNode() != 0) 2654 return RXOR; 2655 2656 // fold !(x cc y) -> (x !cc y) 2657 if (N1C && N1C->getAPIntValue() == 1 && isSetCCEquivalent(N0, LHS, RHS, CC)) { 2658 bool isInt = LHS.getValueType().isInteger(); 2659 ISD::CondCode NotCC = ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(), 2660 isInt); 2661 2662 if (!LegalOperations || TLI.isCondCodeLegal(NotCC, LHS.getValueType())) { 2663 switch (N0.getOpcode()) { 2664 default: 2665 llvm_unreachable("Unhandled SetCC Equivalent!"); 2666 case ISD::SETCC: 2667 return DAG.getSetCC(N->getDebugLoc(), VT, LHS, RHS, NotCC); 2668 case ISD::SELECT_CC: 2669 return DAG.getSelectCC(N->getDebugLoc(), LHS, RHS, N0.getOperand(2), 2670 N0.getOperand(3), NotCC); 2671 } 2672 } 2673 } 2674 2675 // fold (not (zext (setcc x, y))) -> (zext (not (setcc x, y))) 2676 if (N1C && N1C->getAPIntValue() == 1 && N0.getOpcode() == ISD::ZERO_EXTEND && 2677 N0.getNode()->hasOneUse() && 2678 isSetCCEquivalent(N0.getOperand(0), LHS, RHS, CC)){ 2679 SDValue V = N0.getOperand(0); 2680 V = DAG.getNode(ISD::XOR, N0.getDebugLoc(), V.getValueType(), V, 2681 DAG.getConstant(1, V.getValueType())); 2682 AddToWorkList(V.getNode()); 2683 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, V); 2684 } 2685 2686 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are setcc 2687 if (N1C && N1C->getAPIntValue() == 1 && VT == MVT::i1 && 2688 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) { 2689 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1); 2690 if (isOneUseSetCC(RHS) || isOneUseSetCC(LHS)) { 2691 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND; 2692 LHS = DAG.getNode(ISD::XOR, LHS.getDebugLoc(), VT, LHS, N1); // LHS = ~LHS 2693 RHS = DAG.getNode(ISD::XOR, RHS.getDebugLoc(), VT, RHS, N1); // RHS = ~RHS 2694 AddToWorkList(LHS.getNode()); AddToWorkList(RHS.getNode()); 2695 return DAG.getNode(NewOpcode, N->getDebugLoc(), VT, LHS, RHS); 2696 } 2697 } 2698 // fold (not (or x, y)) -> (and (not x), (not y)) iff x or y are constants 2699 if (N1C && N1C->isAllOnesValue() && 2700 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) { 2701 SDValue LHS = N0.getOperand(0), RHS = N0.getOperand(1); 2702 if (isa<ConstantSDNode>(RHS) || isa<ConstantSDNode>(LHS)) { 2703 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND; 2704 LHS = DAG.getNode(ISD::XOR, LHS.getDebugLoc(), VT, LHS, N1); // LHS = ~LHS 2705 RHS = DAG.getNode(ISD::XOR, RHS.getDebugLoc(), VT, RHS, N1); // RHS = ~RHS 2706 AddToWorkList(LHS.getNode()); AddToWorkList(RHS.getNode()); 2707 return DAG.getNode(NewOpcode, N->getDebugLoc(), VT, LHS, RHS); 2708 } 2709 } 2710 // fold (xor (xor x, c1), c2) -> (xor x, (xor c1, c2)) 2711 if (N1C && N0.getOpcode() == ISD::XOR) { 2712 ConstantSDNode *N00C = dyn_cast<ConstantSDNode>(N0.getOperand(0)); 2713 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1)); 2714 if (N00C) 2715 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N0.getOperand(1), 2716 DAG.getConstant(N1C->getAPIntValue() ^ 2717 N00C->getAPIntValue(), VT)); 2718 if (N01C) 2719 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, N0.getOperand(0), 2720 DAG.getConstant(N1C->getAPIntValue() ^ 2721 N01C->getAPIntValue(), VT)); 2722 } 2723 // fold (xor x, x) -> 0 2724 if (N0 == N1) { 2725 if (!VT.isVector()) { 2726 return DAG.getConstant(0, VT); 2727 } else if (!LegalOperations || TLI.isOperationLegal(ISD::BUILD_VECTOR, VT)){ 2728 // Produce a vector of zeros. 2729 SDValue El = DAG.getConstant(0, VT.getVectorElementType()); 2730 std::vector<SDValue> Ops(VT.getVectorNumElements(), El); 2731 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT, 2732 &Ops[0], Ops.size()); 2733 } 2734 } 2735 2736 // Simplify: xor (op x...), (op y...) -> (op (xor x, y)) 2737 if (N0.getOpcode() == N1.getOpcode()) { 2738 SDValue Tmp = SimplifyBinOpWithSameOpcodeHands(N); 2739 if (Tmp.getNode()) return Tmp; 2740 } 2741 2742 // Simplify the expression using non-local knowledge. 2743 if (!VT.isVector() && 2744 SimplifyDemandedBits(SDValue(N, 0))) 2745 return SDValue(N, 0); 2746 2747 return SDValue(); 2748} 2749 2750/// visitShiftByConstant - Handle transforms common to the three shifts, when 2751/// the shift amount is a constant. 2752SDValue DAGCombiner::visitShiftByConstant(SDNode *N, unsigned Amt) { 2753 SDNode *LHS = N->getOperand(0).getNode(); 2754 if (!LHS->hasOneUse()) return SDValue(); 2755 2756 // We want to pull some binops through shifts, so that we have (and (shift)) 2757 // instead of (shift (and)), likewise for add, or, xor, etc. This sort of 2758 // thing happens with address calculations, so it's important to canonicalize 2759 // it. 2760 bool HighBitSet = false; // Can we transform this if the high bit is set? 2761 2762 switch (LHS->getOpcode()) { 2763 default: return SDValue(); 2764 case ISD::OR: 2765 case ISD::XOR: 2766 HighBitSet = false; // We can only transform sra if the high bit is clear. 2767 break; 2768 case ISD::AND: 2769 HighBitSet = true; // We can only transform sra if the high bit is set. 2770 break; 2771 case ISD::ADD: 2772 if (N->getOpcode() != ISD::SHL) 2773 return SDValue(); // only shl(add) not sr[al](add). 2774 HighBitSet = false; // We can only transform sra if the high bit is clear. 2775 break; 2776 } 2777 2778 // We require the RHS of the binop to be a constant as well. 2779 ConstantSDNode *BinOpCst = dyn_cast<ConstantSDNode>(LHS->getOperand(1)); 2780 if (!BinOpCst) return SDValue(); 2781 2782 // FIXME: disable this unless the input to the binop is a shift by a constant. 2783 // If it is not a shift, it pessimizes some common cases like: 2784 // 2785 // void foo(int *X, int i) { X[i & 1235] = 1; } 2786 // int bar(int *X, int i) { return X[i & 255]; } 2787 SDNode *BinOpLHSVal = LHS->getOperand(0).getNode(); 2788 if ((BinOpLHSVal->getOpcode() != ISD::SHL && 2789 BinOpLHSVal->getOpcode() != ISD::SRA && 2790 BinOpLHSVal->getOpcode() != ISD::SRL) || 2791 !isa<ConstantSDNode>(BinOpLHSVal->getOperand(1))) 2792 return SDValue(); 2793 2794 EVT VT = N->getValueType(0); 2795 2796 // If this is a signed shift right, and the high bit is modified by the 2797 // logical operation, do not perform the transformation. The highBitSet 2798 // boolean indicates the value of the high bit of the constant which would 2799 // cause it to be modified for this operation. 2800 if (N->getOpcode() == ISD::SRA) { 2801 bool BinOpRHSSignSet = BinOpCst->getAPIntValue().isNegative(); 2802 if (BinOpRHSSignSet != HighBitSet) 2803 return SDValue(); 2804 } 2805 2806 // Fold the constants, shifting the binop RHS by the shift amount. 2807 SDValue NewRHS = DAG.getNode(N->getOpcode(), LHS->getOperand(1).getDebugLoc(), 2808 N->getValueType(0), 2809 LHS->getOperand(1), N->getOperand(1)); 2810 2811 // Create the new shift. 2812 SDValue NewShift = DAG.getNode(N->getOpcode(), LHS->getOperand(0).getDebugLoc(), 2813 VT, LHS->getOperand(0), N->getOperand(1)); 2814 2815 // Create the new binop. 2816 return DAG.getNode(LHS->getOpcode(), N->getDebugLoc(), VT, NewShift, NewRHS); 2817} 2818 2819SDValue DAGCombiner::visitSHL(SDNode *N) { 2820 SDValue N0 = N->getOperand(0); 2821 SDValue N1 = N->getOperand(1); 2822 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2823 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2824 EVT VT = N0.getValueType(); 2825 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits(); 2826 2827 // fold (shl c1, c2) -> c1<<c2 2828 if (N0C && N1C) 2829 return DAG.FoldConstantArithmetic(ISD::SHL, VT, N0C, N1C); 2830 // fold (shl 0, x) -> 0 2831 if (N0C && N0C->isNullValue()) 2832 return N0; 2833 // fold (shl x, c >= size(x)) -> undef 2834 if (N1C && N1C->getZExtValue() >= OpSizeInBits) 2835 return DAG.getUNDEF(VT); 2836 // fold (shl x, 0) -> x 2837 if (N1C && N1C->isNullValue()) 2838 return N0; 2839 // if (shl x, c) is known to be zero, return 0 2840 if (DAG.MaskedValueIsZero(SDValue(N, 0), 2841 APInt::getAllOnesValue(OpSizeInBits))) 2842 return DAG.getConstant(0, VT); 2843 // fold (shl x, (trunc (and y, c))) -> (shl x, (and (trunc y), (trunc c))). 2844 if (N1.getOpcode() == ISD::TRUNCATE && 2845 N1.getOperand(0).getOpcode() == ISD::AND && 2846 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) { 2847 SDValue N101 = N1.getOperand(0).getOperand(1); 2848 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) { 2849 EVT TruncVT = N1.getValueType(); 2850 SDValue N100 = N1.getOperand(0).getOperand(0); 2851 APInt TruncC = N101C->getAPIntValue(); 2852 TruncC.trunc(TruncVT.getSizeInBits()); 2853 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0, 2854 DAG.getNode(ISD::AND, N->getDebugLoc(), TruncVT, 2855 DAG.getNode(ISD::TRUNCATE, 2856 N->getDebugLoc(), 2857 TruncVT, N100), 2858 DAG.getConstant(TruncC, TruncVT))); 2859 } 2860 } 2861 2862 if (N1C && SimplifyDemandedBits(SDValue(N, 0))) 2863 return SDValue(N, 0); 2864 2865 // fold (shl (shl x, c1), c2) -> 0 or (shl x, (add c1, c2)) 2866 if (N1C && N0.getOpcode() == ISD::SHL && 2867 N0.getOperand(1).getOpcode() == ISD::Constant) { 2868 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue(); 2869 uint64_t c2 = N1C->getZExtValue(); 2870 if (c1 + c2 > OpSizeInBits) 2871 return DAG.getConstant(0, VT); 2872 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, N0.getOperand(0), 2873 DAG.getConstant(c1 + c2, N1.getValueType())); 2874 } 2875 // fold (shl (srl x, c1), c2) -> (shl (and x, (shl -1, c1)), (sub c2, c1)) or 2876 // (srl (and x, (shl -1, c1)), (sub c1, c2)) 2877 if (N1C && N0.getOpcode() == ISD::SRL && 2878 N0.getOperand(1).getOpcode() == ISD::Constant) { 2879 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue(); 2880 if (c1 < VT.getSizeInBits()) { 2881 uint64_t c2 = N1C->getZExtValue(); 2882 SDValue HiBitsMask = 2883 DAG.getConstant(APInt::getHighBitsSet(VT.getSizeInBits(), 2884 VT.getSizeInBits() - c1), 2885 VT); 2886 SDValue Mask = DAG.getNode(ISD::AND, N0.getDebugLoc(), VT, 2887 N0.getOperand(0), 2888 HiBitsMask); 2889 if (c2 > c1) 2890 return DAG.getNode(ISD::SHL, N->getDebugLoc(), VT, Mask, 2891 DAG.getConstant(c2-c1, N1.getValueType())); 2892 else 2893 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, Mask, 2894 DAG.getConstant(c1-c2, N1.getValueType())); 2895 } 2896 } 2897 // fold (shl (sra x, c1), c1) -> (and x, (shl -1, c1)) 2898 if (N1C && N0.getOpcode() == ISD::SRA && N1 == N0.getOperand(1)) { 2899 SDValue HiBitsMask = 2900 DAG.getConstant(APInt::getHighBitsSet(VT.getSizeInBits(), 2901 VT.getSizeInBits() - 2902 N1C->getZExtValue()), 2903 VT); 2904 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0.getOperand(0), 2905 HiBitsMask); 2906 } 2907 2908 if (N1C) { 2909 SDValue NewSHL = visitShiftByConstant(N, N1C->getZExtValue()); 2910 if (NewSHL.getNode()) 2911 return NewSHL; 2912 } 2913 2914 return SDValue(); 2915} 2916 2917SDValue DAGCombiner::visitSRA(SDNode *N) { 2918 SDValue N0 = N->getOperand(0); 2919 SDValue N1 = N->getOperand(1); 2920 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2921 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2922 EVT VT = N0.getValueType(); 2923 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits(); 2924 2925 // fold (sra c1, c2) -> (sra c1, c2) 2926 if (N0C && N1C) 2927 return DAG.FoldConstantArithmetic(ISD::SRA, VT, N0C, N1C); 2928 // fold (sra 0, x) -> 0 2929 if (N0C && N0C->isNullValue()) 2930 return N0; 2931 // fold (sra -1, x) -> -1 2932 if (N0C && N0C->isAllOnesValue()) 2933 return N0; 2934 // fold (sra x, (setge c, size(x))) -> undef 2935 if (N1C && N1C->getZExtValue() >= OpSizeInBits) 2936 return DAG.getUNDEF(VT); 2937 // fold (sra x, 0) -> x 2938 if (N1C && N1C->isNullValue()) 2939 return N0; 2940 // fold (sra (shl x, c1), c1) -> sext_inreg for some c1 and target supports 2941 // sext_inreg. 2942 if (N1C && N0.getOpcode() == ISD::SHL && N1 == N0.getOperand(1)) { 2943 unsigned LowBits = OpSizeInBits - (unsigned)N1C->getZExtValue(); 2944 EVT ExtVT = EVT::getIntegerVT(*DAG.getContext(), LowBits); 2945 if (VT.isVector()) 2946 ExtVT = EVT::getVectorVT(*DAG.getContext(), 2947 ExtVT, VT.getVectorNumElements()); 2948 if ((!LegalOperations || 2949 TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, ExtVT))) 2950 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, 2951 N0.getOperand(0), DAG.getValueType(ExtVT)); 2952 } 2953 2954 // fold (sra (sra x, c1), c2) -> (sra x, (add c1, c2)) 2955 if (N1C && N0.getOpcode() == ISD::SRA) { 2956 if (ConstantSDNode *C1 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) { 2957 unsigned Sum = N1C->getZExtValue() + C1->getZExtValue(); 2958 if (Sum >= OpSizeInBits) Sum = OpSizeInBits-1; 2959 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0.getOperand(0), 2960 DAG.getConstant(Sum, N1C->getValueType(0))); 2961 } 2962 } 2963 2964 // fold (sra (shl X, m), (sub result_size, n)) 2965 // -> (sign_extend (trunc (shl X, (sub (sub result_size, n), m)))) for 2966 // result_size - n != m. 2967 // If truncate is free for the target sext(shl) is likely to result in better 2968 // code. 2969 if (N0.getOpcode() == ISD::SHL) { 2970 // Get the two constanst of the shifts, CN0 = m, CN = n. 2971 const ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1)); 2972 if (N01C && N1C) { 2973 // Determine what the truncate's result bitsize and type would be. 2974 EVT TruncVT = 2975 EVT::getIntegerVT(*DAG.getContext(), OpSizeInBits - N1C->getZExtValue()); 2976 // Determine the residual right-shift amount. 2977 signed ShiftAmt = N1C->getZExtValue() - N01C->getZExtValue(); 2978 2979 // If the shift is not a no-op (in which case this should be just a sign 2980 // extend already), the truncated to type is legal, sign_extend is legal 2981 // on that type, and the truncate to that type is both legal and free, 2982 // perform the transform. 2983 if ((ShiftAmt > 0) && 2984 TLI.isOperationLegalOrCustom(ISD::SIGN_EXTEND, TruncVT) && 2985 TLI.isOperationLegalOrCustom(ISD::TRUNCATE, VT) && 2986 TLI.isTruncateFree(VT, TruncVT)) { 2987 2988 SDValue Amt = DAG.getConstant(ShiftAmt, getShiftAmountTy()); 2989 SDValue Shift = DAG.getNode(ISD::SRL, N0.getDebugLoc(), VT, 2990 N0.getOperand(0), Amt); 2991 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), TruncVT, 2992 Shift); 2993 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), 2994 N->getValueType(0), Trunc); 2995 } 2996 } 2997 } 2998 2999 // fold (sra x, (trunc (and y, c))) -> (sra x, (and (trunc y), (trunc c))). 3000 if (N1.getOpcode() == ISD::TRUNCATE && 3001 N1.getOperand(0).getOpcode() == ISD::AND && 3002 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) { 3003 SDValue N101 = N1.getOperand(0).getOperand(1); 3004 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) { 3005 EVT TruncVT = N1.getValueType(); 3006 SDValue N100 = N1.getOperand(0).getOperand(0); 3007 APInt TruncC = N101C->getAPIntValue(); 3008 TruncC.trunc(TruncVT.getScalarType().getSizeInBits()); 3009 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, N0, 3010 DAG.getNode(ISD::AND, N->getDebugLoc(), 3011 TruncVT, 3012 DAG.getNode(ISD::TRUNCATE, 3013 N->getDebugLoc(), 3014 TruncVT, N100), 3015 DAG.getConstant(TruncC, TruncVT))); 3016 } 3017 } 3018 3019 // Simplify, based on bits shifted out of the LHS. 3020 if (N1C && SimplifyDemandedBits(SDValue(N, 0))) 3021 return SDValue(N, 0); 3022 3023 3024 // If the sign bit is known to be zero, switch this to a SRL. 3025 if (DAG.SignBitIsZero(N0)) 3026 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, N1); 3027 3028 if (N1C) { 3029 SDValue NewSRA = visitShiftByConstant(N, N1C->getZExtValue()); 3030 if (NewSRA.getNode()) 3031 return NewSRA; 3032 } 3033 3034 return SDValue(); 3035} 3036 3037SDValue DAGCombiner::visitSRL(SDNode *N) { 3038 SDValue N0 = N->getOperand(0); 3039 SDValue N1 = N->getOperand(1); 3040 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 3041 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 3042 EVT VT = N0.getValueType(); 3043 unsigned OpSizeInBits = VT.getScalarType().getSizeInBits(); 3044 3045 // fold (srl c1, c2) -> c1 >>u c2 3046 if (N0C && N1C) 3047 return DAG.FoldConstantArithmetic(ISD::SRL, VT, N0C, N1C); 3048 // fold (srl 0, x) -> 0 3049 if (N0C && N0C->isNullValue()) 3050 return N0; 3051 // fold (srl x, c >= size(x)) -> undef 3052 if (N1C && N1C->getZExtValue() >= OpSizeInBits) 3053 return DAG.getUNDEF(VT); 3054 // fold (srl x, 0) -> x 3055 if (N1C && N1C->isNullValue()) 3056 return N0; 3057 // if (srl x, c) is known to be zero, return 0 3058 if (N1C && DAG.MaskedValueIsZero(SDValue(N, 0), 3059 APInt::getAllOnesValue(OpSizeInBits))) 3060 return DAG.getConstant(0, VT); 3061 3062 // fold (srl (srl x, c1), c2) -> 0 or (srl x, (add c1, c2)) 3063 if (N1C && N0.getOpcode() == ISD::SRL && 3064 N0.getOperand(1).getOpcode() == ISD::Constant) { 3065 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue(); 3066 uint64_t c2 = N1C->getZExtValue(); 3067 if (c1 + c2 > OpSizeInBits) 3068 return DAG.getConstant(0, VT); 3069 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0.getOperand(0), 3070 DAG.getConstant(c1 + c2, N1.getValueType())); 3071 } 3072 3073 // fold (srl (shl x, c), c) -> (and x, cst2) 3074 if (N1C && N0.getOpcode() == ISD::SHL && N0.getOperand(1) == N1 && 3075 N0.getValueSizeInBits() <= 64) { 3076 uint64_t ShAmt = N1C->getZExtValue()+64-N0.getValueSizeInBits(); 3077 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0.getOperand(0), 3078 DAG.getConstant(~0ULL >> ShAmt, VT)); 3079 } 3080 3081 3082 // fold (srl (anyextend x), c) -> (anyextend (srl x, c)) 3083 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) { 3084 // Shifting in all undef bits? 3085 EVT SmallVT = N0.getOperand(0).getValueType(); 3086 if (N1C->getZExtValue() >= SmallVT.getSizeInBits()) 3087 return DAG.getUNDEF(VT); 3088 3089 if (!LegalTypes || TLI.isTypeDesirableForOp(ISD::SRL, SmallVT)) { 3090 SDValue SmallShift = DAG.getNode(ISD::SRL, N0.getDebugLoc(), SmallVT, 3091 N0.getOperand(0), N1); 3092 AddToWorkList(SmallShift.getNode()); 3093 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, SmallShift); 3094 } 3095 } 3096 3097 // fold (srl (sra X, Y), 31) -> (srl X, 31). This srl only looks at the sign 3098 // bit, which is unmodified by sra. 3099 if (N1C && N1C->getZExtValue() + 1 == VT.getSizeInBits()) { 3100 if (N0.getOpcode() == ISD::SRA) 3101 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0.getOperand(0), N1); 3102 } 3103 3104 // fold (srl (ctlz x), "5") -> x iff x has one bit set (the low bit). 3105 if (N1C && N0.getOpcode() == ISD::CTLZ && 3106 N1C->getAPIntValue() == Log2_32(VT.getSizeInBits())) { 3107 APInt KnownZero, KnownOne; 3108 APInt Mask = APInt::getAllOnesValue(VT.getScalarType().getSizeInBits()); 3109 DAG.ComputeMaskedBits(N0.getOperand(0), Mask, KnownZero, KnownOne); 3110 3111 // If any of the input bits are KnownOne, then the input couldn't be all 3112 // zeros, thus the result of the srl will always be zero. 3113 if (KnownOne.getBoolValue()) return DAG.getConstant(0, VT); 3114 3115 // If all of the bits input the to ctlz node are known to be zero, then 3116 // the result of the ctlz is "32" and the result of the shift is one. 3117 APInt UnknownBits = ~KnownZero & Mask; 3118 if (UnknownBits == 0) return DAG.getConstant(1, VT); 3119 3120 // Otherwise, check to see if there is exactly one bit input to the ctlz. 3121 if ((UnknownBits & (UnknownBits - 1)) == 0) { 3122 // Okay, we know that only that the single bit specified by UnknownBits 3123 // could be set on input to the CTLZ node. If this bit is set, the SRL 3124 // will return 0, if it is clear, it returns 1. Change the CTLZ/SRL pair 3125 // to an SRL/XOR pair, which is likely to simplify more. 3126 unsigned ShAmt = UnknownBits.countTrailingZeros(); 3127 SDValue Op = N0.getOperand(0); 3128 3129 if (ShAmt) { 3130 Op = DAG.getNode(ISD::SRL, N0.getDebugLoc(), VT, Op, 3131 DAG.getConstant(ShAmt, getShiftAmountTy())); 3132 AddToWorkList(Op.getNode()); 3133 } 3134 3135 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, 3136 Op, DAG.getConstant(1, VT)); 3137 } 3138 } 3139 3140 // fold (srl x, (trunc (and y, c))) -> (srl x, (and (trunc y), (trunc c))). 3141 if (N1.getOpcode() == ISD::TRUNCATE && 3142 N1.getOperand(0).getOpcode() == ISD::AND && 3143 N1.hasOneUse() && N1.getOperand(0).hasOneUse()) { 3144 SDValue N101 = N1.getOperand(0).getOperand(1); 3145 if (ConstantSDNode *N101C = dyn_cast<ConstantSDNode>(N101)) { 3146 EVT TruncVT = N1.getValueType(); 3147 SDValue N100 = N1.getOperand(0).getOperand(0); 3148 APInt TruncC = N101C->getAPIntValue(); 3149 TruncC.trunc(TruncVT.getSizeInBits()); 3150 return DAG.getNode(ISD::SRL, N->getDebugLoc(), VT, N0, 3151 DAG.getNode(ISD::AND, N->getDebugLoc(), 3152 TruncVT, 3153 DAG.getNode(ISD::TRUNCATE, 3154 N->getDebugLoc(), 3155 TruncVT, N100), 3156 DAG.getConstant(TruncC, TruncVT))); 3157 } 3158 } 3159 3160 // fold operands of srl based on knowledge that the low bits are not 3161 // demanded. 3162 if (N1C && SimplifyDemandedBits(SDValue(N, 0))) 3163 return SDValue(N, 0); 3164 3165 if (N1C) { 3166 SDValue NewSRL = visitShiftByConstant(N, N1C->getZExtValue()); 3167 if (NewSRL.getNode()) 3168 return NewSRL; 3169 } 3170 3171 // Attempt to convert a srl of a load into a narrower zero-extending load. 3172 SDValue NarrowLoad = ReduceLoadWidth(N); 3173 if (NarrowLoad.getNode()) 3174 return NarrowLoad; 3175 3176 // Here is a common situation. We want to optimize: 3177 // 3178 // %a = ... 3179 // %b = and i32 %a, 2 3180 // %c = srl i32 %b, 1 3181 // brcond i32 %c ... 3182 // 3183 // into 3184 // 3185 // %a = ... 3186 // %b = and %a, 2 3187 // %c = setcc eq %b, 0 3188 // brcond %c ... 3189 // 3190 // However when after the source operand of SRL is optimized into AND, the SRL 3191 // itself may not be optimized further. Look for it and add the BRCOND into 3192 // the worklist. 3193 if (N->hasOneUse()) { 3194 SDNode *Use = *N->use_begin(); 3195 if (Use->getOpcode() == ISD::BRCOND) 3196 AddToWorkList(Use); 3197 else if (Use->getOpcode() == ISD::TRUNCATE && Use->hasOneUse()) { 3198 // Also look pass the truncate. 3199 Use = *Use->use_begin(); 3200 if (Use->getOpcode() == ISD::BRCOND) 3201 AddToWorkList(Use); 3202 } 3203 } 3204 3205 return SDValue(); 3206} 3207 3208SDValue DAGCombiner::visitCTLZ(SDNode *N) { 3209 SDValue N0 = N->getOperand(0); 3210 EVT VT = N->getValueType(0); 3211 3212 // fold (ctlz c1) -> c2 3213 if (isa<ConstantSDNode>(N0)) 3214 return DAG.getNode(ISD::CTLZ, N->getDebugLoc(), VT, N0); 3215 return SDValue(); 3216} 3217 3218SDValue DAGCombiner::visitCTTZ(SDNode *N) { 3219 SDValue N0 = N->getOperand(0); 3220 EVT VT = N->getValueType(0); 3221 3222 // fold (cttz c1) -> c2 3223 if (isa<ConstantSDNode>(N0)) 3224 return DAG.getNode(ISD::CTTZ, N->getDebugLoc(), VT, N0); 3225 return SDValue(); 3226} 3227 3228SDValue DAGCombiner::visitCTPOP(SDNode *N) { 3229 SDValue N0 = N->getOperand(0); 3230 EVT VT = N->getValueType(0); 3231 3232 // fold (ctpop c1) -> c2 3233 if (isa<ConstantSDNode>(N0)) 3234 return DAG.getNode(ISD::CTPOP, N->getDebugLoc(), VT, N0); 3235 return SDValue(); 3236} 3237 3238SDValue DAGCombiner::visitSELECT(SDNode *N) { 3239 SDValue N0 = N->getOperand(0); 3240 SDValue N1 = N->getOperand(1); 3241 SDValue N2 = N->getOperand(2); 3242 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 3243 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 3244 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2); 3245 EVT VT = N->getValueType(0); 3246 EVT VT0 = N0.getValueType(); 3247 3248 // fold (select C, X, X) -> X 3249 if (N1 == N2) 3250 return N1; 3251 // fold (select true, X, Y) -> X 3252 if (N0C && !N0C->isNullValue()) 3253 return N1; 3254 // fold (select false, X, Y) -> Y 3255 if (N0C && N0C->isNullValue()) 3256 return N2; 3257 // fold (select C, 1, X) -> (or C, X) 3258 if (VT == MVT::i1 && N1C && N1C->getAPIntValue() == 1) 3259 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N2); 3260 // fold (select C, 0, 1) -> (xor C, 1) 3261 if (VT.isInteger() && 3262 (VT0 == MVT::i1 || 3263 (VT0.isInteger() && 3264 TLI.getBooleanContents() == TargetLowering::ZeroOrOneBooleanContent)) && 3265 N1C && N2C && N1C->isNullValue() && N2C->getAPIntValue() == 1) { 3266 SDValue XORNode; 3267 if (VT == VT0) 3268 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT0, 3269 N0, DAG.getConstant(1, VT0)); 3270 XORNode = DAG.getNode(ISD::XOR, N0.getDebugLoc(), VT0, 3271 N0, DAG.getConstant(1, VT0)); 3272 AddToWorkList(XORNode.getNode()); 3273 if (VT.bitsGT(VT0)) 3274 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, XORNode); 3275 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, XORNode); 3276 } 3277 // fold (select C, 0, X) -> (and (not C), X) 3278 if (VT == VT0 && VT == MVT::i1 && N1C && N1C->isNullValue()) { 3279 SDValue NOTNode = DAG.getNOT(N0.getDebugLoc(), N0, VT); 3280 AddToWorkList(NOTNode.getNode()); 3281 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, NOTNode, N2); 3282 } 3283 // fold (select C, X, 1) -> (or (not C), X) 3284 if (VT == VT0 && VT == MVT::i1 && N2C && N2C->getAPIntValue() == 1) { 3285 SDValue NOTNode = DAG.getNOT(N0.getDebugLoc(), N0, VT); 3286 AddToWorkList(NOTNode.getNode()); 3287 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, NOTNode, N1); 3288 } 3289 // fold (select C, X, 0) -> (and C, X) 3290 if (VT == MVT::i1 && N2C && N2C->isNullValue()) 3291 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, N1); 3292 // fold (select X, X, Y) -> (or X, Y) 3293 // fold (select X, 1, Y) -> (or X, Y) 3294 if (VT == MVT::i1 && (N0 == N1 || (N1C && N1C->getAPIntValue() == 1))) 3295 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, N0, N2); 3296 // fold (select X, Y, X) -> (and X, Y) 3297 // fold (select X, Y, 0) -> (and X, Y) 3298 if (VT == MVT::i1 && (N0 == N2 || (N2C && N2C->getAPIntValue() == 0))) 3299 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, N0, N1); 3300 3301 // If we can fold this based on the true/false value, do so. 3302 if (SimplifySelectOps(N, N1, N2)) 3303 return SDValue(N, 0); // Don't revisit N. 3304 3305 // fold selects based on a setcc into other things, such as min/max/abs 3306 if (N0.getOpcode() == ISD::SETCC) { 3307 // FIXME: 3308 // Check against MVT::Other for SELECT_CC, which is a workaround for targets 3309 // having to say they don't support SELECT_CC on every type the DAG knows 3310 // about, since there is no way to mark an opcode illegal at all value types 3311 if (TLI.isOperationLegalOrCustom(ISD::SELECT_CC, MVT::Other) && 3312 TLI.isOperationLegalOrCustom(ISD::SELECT_CC, VT)) 3313 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(), VT, 3314 N0.getOperand(0), N0.getOperand(1), 3315 N1, N2, N0.getOperand(2)); 3316 return SimplifySelect(N->getDebugLoc(), N0, N1, N2); 3317 } 3318 3319 return SDValue(); 3320} 3321 3322SDValue DAGCombiner::visitSELECT_CC(SDNode *N) { 3323 SDValue N0 = N->getOperand(0); 3324 SDValue N1 = N->getOperand(1); 3325 SDValue N2 = N->getOperand(2); 3326 SDValue N3 = N->getOperand(3); 3327 SDValue N4 = N->getOperand(4); 3328 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get(); 3329 3330 // fold select_cc lhs, rhs, x, x, cc -> x 3331 if (N2 == N3) 3332 return N2; 3333 3334 // Determine if the condition we're dealing with is constant 3335 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), 3336 N0, N1, CC, N->getDebugLoc(), false); 3337 if (SCC.getNode()) AddToWorkList(SCC.getNode()); 3338 3339 if (ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode())) { 3340 if (!SCCC->isNullValue()) 3341 return N2; // cond always true -> true val 3342 else 3343 return N3; // cond always false -> false val 3344 } 3345 3346 // Fold to a simpler select_cc 3347 if (SCC.getNode() && SCC.getOpcode() == ISD::SETCC) 3348 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(), N2.getValueType(), 3349 SCC.getOperand(0), SCC.getOperand(1), N2, N3, 3350 SCC.getOperand(2)); 3351 3352 // If we can fold this based on the true/false value, do so. 3353 if (SimplifySelectOps(N, N2, N3)) 3354 return SDValue(N, 0); // Don't revisit N. 3355 3356 // fold select_cc into other things, such as min/max/abs 3357 return SimplifySelectCC(N->getDebugLoc(), N0, N1, N2, N3, CC); 3358} 3359 3360SDValue DAGCombiner::visitSETCC(SDNode *N) { 3361 return SimplifySetCC(N->getValueType(0), N->getOperand(0), N->getOperand(1), 3362 cast<CondCodeSDNode>(N->getOperand(2))->get(), 3363 N->getDebugLoc()); 3364} 3365 3366// ExtendUsesToFormExtLoad - Trying to extend uses of a load to enable this: 3367// "fold ({s|z|a}ext (load x)) -> ({s|z|a}ext (truncate ({s|z|a}extload x)))" 3368// transformation. Returns true if extension are possible and the above 3369// mentioned transformation is profitable. 3370static bool ExtendUsesToFormExtLoad(SDNode *N, SDValue N0, 3371 unsigned ExtOpc, 3372 SmallVector<SDNode*, 4> &ExtendNodes, 3373 const TargetLowering &TLI) { 3374 bool HasCopyToRegUses = false; 3375 bool isTruncFree = TLI.isTruncateFree(N->getValueType(0), N0.getValueType()); 3376 for (SDNode::use_iterator UI = N0.getNode()->use_begin(), 3377 UE = N0.getNode()->use_end(); 3378 UI != UE; ++UI) { 3379 SDNode *User = *UI; 3380 if (User == N) 3381 continue; 3382 if (UI.getUse().getResNo() != N0.getResNo()) 3383 continue; 3384 // FIXME: Only extend SETCC N, N and SETCC N, c for now. 3385 if (ExtOpc != ISD::ANY_EXTEND && User->getOpcode() == ISD::SETCC) { 3386 ISD::CondCode CC = cast<CondCodeSDNode>(User->getOperand(2))->get(); 3387 if (ExtOpc == ISD::ZERO_EXTEND && ISD::isSignedIntSetCC(CC)) 3388 // Sign bits will be lost after a zext. 3389 return false; 3390 bool Add = false; 3391 for (unsigned i = 0; i != 2; ++i) { 3392 SDValue UseOp = User->getOperand(i); 3393 if (UseOp == N0) 3394 continue; 3395 if (!isa<ConstantSDNode>(UseOp)) 3396 return false; 3397 Add = true; 3398 } 3399 if (Add) 3400 ExtendNodes.push_back(User); 3401 continue; 3402 } 3403 // If truncates aren't free and there are users we can't 3404 // extend, it isn't worthwhile. 3405 if (!isTruncFree) 3406 return false; 3407 // Remember if this value is live-out. 3408 if (User->getOpcode() == ISD::CopyToReg) 3409 HasCopyToRegUses = true; 3410 } 3411 3412 if (HasCopyToRegUses) { 3413 bool BothLiveOut = false; 3414 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end(); 3415 UI != UE; ++UI) { 3416 SDUse &Use = UI.getUse(); 3417 if (Use.getResNo() == 0 && Use.getUser()->getOpcode() == ISD::CopyToReg) { 3418 BothLiveOut = true; 3419 break; 3420 } 3421 } 3422 if (BothLiveOut) 3423 // Both unextended and extended values are live out. There had better be 3424 // good a reason for the transformation. 3425 return ExtendNodes.size(); 3426 } 3427 return true; 3428} 3429 3430SDValue DAGCombiner::visitSIGN_EXTEND(SDNode *N) { 3431 SDValue N0 = N->getOperand(0); 3432 EVT VT = N->getValueType(0); 3433 3434 // fold (sext c1) -> c1 3435 if (isa<ConstantSDNode>(N0)) 3436 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, N0); 3437 3438 // fold (sext (sext x)) -> (sext x) 3439 // fold (sext (aext x)) -> (sext x) 3440 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND) 3441 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, 3442 N0.getOperand(0)); 3443 3444 if (N0.getOpcode() == ISD::TRUNCATE) { 3445 // fold (sext (truncate (load x))) -> (sext (smaller load x)) 3446 // fold (sext (truncate (srl (load x), c))) -> (sext (smaller load (x+c/n))) 3447 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode()); 3448 if (NarrowLoad.getNode()) { 3449 SDNode* oye = N0.getNode()->getOperand(0).getNode(); 3450 if (NarrowLoad.getNode() != N0.getNode()) { 3451 CombineTo(N0.getNode(), NarrowLoad); 3452 // CombineTo deleted the truncate, if needed, but not what's under it. 3453 AddToWorkList(oye); 3454 } 3455 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3456 } 3457 3458 // See if the value being truncated is already sign extended. If so, just 3459 // eliminate the trunc/sext pair. 3460 SDValue Op = N0.getOperand(0); 3461 unsigned OpBits = Op.getValueType().getScalarType().getSizeInBits(); 3462 unsigned MidBits = N0.getValueType().getScalarType().getSizeInBits(); 3463 unsigned DestBits = VT.getScalarType().getSizeInBits(); 3464 unsigned NumSignBits = DAG.ComputeNumSignBits(Op); 3465 3466 if (OpBits == DestBits) { 3467 // Op is i32, Mid is i8, and Dest is i32. If Op has more than 24 sign 3468 // bits, it is already ready. 3469 if (NumSignBits > DestBits-MidBits) 3470 return Op; 3471 } else if (OpBits < DestBits) { 3472 // Op is i32, Mid is i8, and Dest is i64. If Op has more than 24 sign 3473 // bits, just sext from i32. 3474 if (NumSignBits > OpBits-MidBits) 3475 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, Op); 3476 } else { 3477 // Op is i64, Mid is i8, and Dest is i32. If Op has more than 56 sign 3478 // bits, just truncate to i32. 3479 if (NumSignBits > OpBits-MidBits) 3480 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Op); 3481 } 3482 3483 // fold (sext (truncate x)) -> (sextinreg x). 3484 if (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, 3485 N0.getValueType())) { 3486 if (OpBits < DestBits) 3487 Op = DAG.getNode(ISD::ANY_EXTEND, N0.getDebugLoc(), VT, Op); 3488 else if (OpBits > DestBits) 3489 Op = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), VT, Op); 3490 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, Op, 3491 DAG.getValueType(N0.getValueType())); 3492 } 3493 } 3494 3495 // fold (sext (load x)) -> (sext (truncate (sextload x))) 3496 if (ISD::isNON_EXTLoad(N0.getNode()) && 3497 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 3498 TLI.isLoadExtLegal(ISD::SEXTLOAD, N0.getValueType()))) { 3499 bool DoXform = true; 3500 SmallVector<SDNode*, 4> SetCCs; 3501 if (!N0.hasOneUse()) 3502 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::SIGN_EXTEND, SetCCs, TLI); 3503 if (DoXform) { 3504 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3505 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N->getDebugLoc(), 3506 LN0->getChain(), 3507 LN0->getBasePtr(), LN0->getPointerInfo(), 3508 N0.getValueType(), 3509 LN0->isVolatile(), LN0->isNonTemporal(), 3510 LN0->getAlignment()); 3511 CombineTo(N, ExtLoad); 3512 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), 3513 N0.getValueType(), ExtLoad); 3514 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1)); 3515 3516 // Extend SetCC uses if necessary. 3517 for (unsigned i = 0, e = SetCCs.size(); i != e; ++i) { 3518 SDNode *SetCC = SetCCs[i]; 3519 SmallVector<SDValue, 4> Ops; 3520 3521 for (unsigned j = 0; j != 2; ++j) { 3522 SDValue SOp = SetCC->getOperand(j); 3523 if (SOp == Trunc) 3524 Ops.push_back(ExtLoad); 3525 else 3526 Ops.push_back(DAG.getNode(ISD::SIGN_EXTEND, 3527 N->getDebugLoc(), VT, SOp)); 3528 } 3529 3530 Ops.push_back(SetCC->getOperand(2)); 3531 CombineTo(SetCC, DAG.getNode(ISD::SETCC, N->getDebugLoc(), 3532 SetCC->getValueType(0), 3533 &Ops[0], Ops.size())); 3534 } 3535 3536 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3537 } 3538 } 3539 3540 // fold (sext (sextload x)) -> (sext (truncate (sextload x))) 3541 // fold (sext ( extload x)) -> (sext (truncate (sextload x))) 3542 if ((ISD::isSEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) && 3543 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) { 3544 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3545 EVT MemVT = LN0->getMemoryVT(); 3546 if ((!LegalOperations && !LN0->isVolatile()) || 3547 TLI.isLoadExtLegal(ISD::SEXTLOAD, MemVT)) { 3548 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N->getDebugLoc(), 3549 LN0->getChain(), 3550 LN0->getBasePtr(), LN0->getPointerInfo(), 3551 MemVT, 3552 LN0->isVolatile(), LN0->isNonTemporal(), 3553 LN0->getAlignment()); 3554 CombineTo(N, ExtLoad); 3555 CombineTo(N0.getNode(), 3556 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), 3557 N0.getValueType(), ExtLoad), 3558 ExtLoad.getValue(1)); 3559 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3560 } 3561 } 3562 3563 if (N0.getOpcode() == ISD::SETCC) { 3564 // sext(setcc) -> sext_in_reg(vsetcc) for vectors. 3565 // Only do this before legalize for now. 3566 if (VT.isVector() && !LegalOperations) { 3567 EVT N0VT = N0.getOperand(0).getValueType(); 3568 // We know that the # elements of the results is the same as the 3569 // # elements of the compare (and the # elements of the compare result 3570 // for that matter). Check to see that they are the same size. If so, 3571 // we know that the element size of the sext'd result matches the 3572 // element size of the compare operands. 3573 if (VT.getSizeInBits() == N0VT.getSizeInBits()) 3574 return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0), 3575 N0.getOperand(1), 3576 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 3577 // If the desired elements are smaller or larger than the source 3578 // elements we can use a matching integer vector type and then 3579 // truncate/sign extend 3580 else { 3581 EVT MatchingElementType = 3582 EVT::getIntegerVT(*DAG.getContext(), 3583 N0VT.getScalarType().getSizeInBits()); 3584 EVT MatchingVectorType = 3585 EVT::getVectorVT(*DAG.getContext(), MatchingElementType, 3586 N0VT.getVectorNumElements()); 3587 SDValue VsetCC = 3588 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0), 3589 N0.getOperand(1), 3590 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 3591 return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT); 3592 } 3593 } 3594 3595 // sext(setcc x, y, cc) -> (select_cc x, y, -1, 0, cc) 3596 unsigned ElementWidth = VT.getScalarType().getSizeInBits(); 3597 SDValue NegOne = 3598 DAG.getConstant(APInt::getAllOnesValue(ElementWidth), VT); 3599 SDValue SCC = 3600 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1), 3601 NegOne, DAG.getConstant(0, VT), 3602 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true); 3603 if (SCC.getNode()) return SCC; 3604 if (!LegalOperations || 3605 TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultType(VT))) 3606 return DAG.getNode(ISD::SELECT, N->getDebugLoc(), VT, 3607 DAG.getSetCC(N->getDebugLoc(), 3608 TLI.getSetCCResultType(VT), 3609 N0.getOperand(0), N0.getOperand(1), 3610 cast<CondCodeSDNode>(N0.getOperand(2))->get()), 3611 NegOne, DAG.getConstant(0, VT)); 3612 } 3613 3614 // fold (sext x) -> (zext x) if the sign bit is known zero. 3615 if ((!LegalOperations || TLI.isOperationLegal(ISD::ZERO_EXTEND, VT)) && 3616 DAG.SignBitIsZero(N0)) 3617 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, N0); 3618 3619 return SDValue(); 3620} 3621 3622SDValue DAGCombiner::visitZERO_EXTEND(SDNode *N) { 3623 SDValue N0 = N->getOperand(0); 3624 EVT VT = N->getValueType(0); 3625 3626 // fold (zext c1) -> c1 3627 if (isa<ConstantSDNode>(N0)) 3628 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, N0); 3629 // fold (zext (zext x)) -> (zext x) 3630 // fold (zext (aext x)) -> (zext x) 3631 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND) 3632 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, 3633 N0.getOperand(0)); 3634 3635 // fold (zext (truncate (load x))) -> (zext (smaller load x)) 3636 // fold (zext (truncate (srl (load x), c))) -> (zext (small load (x+c/n))) 3637 if (N0.getOpcode() == ISD::TRUNCATE) { 3638 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode()); 3639 if (NarrowLoad.getNode()) { 3640 SDNode* oye = N0.getNode()->getOperand(0).getNode(); 3641 if (NarrowLoad.getNode() != N0.getNode()) { 3642 CombineTo(N0.getNode(), NarrowLoad); 3643 // CombineTo deleted the truncate, if needed, but not what's under it. 3644 AddToWorkList(oye); 3645 } 3646 return DAG.getNode(ISD::ZERO_EXTEND, N->getDebugLoc(), VT, NarrowLoad); 3647 } 3648 } 3649 3650 // fold (zext (truncate x)) -> (and x, mask) 3651 if (N0.getOpcode() == ISD::TRUNCATE && 3652 (!LegalOperations || TLI.isOperationLegal(ISD::AND, VT))) { 3653 SDValue Op = N0.getOperand(0); 3654 if (Op.getValueType().bitsLT(VT)) { 3655 Op = DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, Op); 3656 } else if (Op.getValueType().bitsGT(VT)) { 3657 Op = DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Op); 3658 } 3659 return DAG.getZeroExtendInReg(Op, N->getDebugLoc(), 3660 N0.getValueType().getScalarType()); 3661 } 3662 3663 // Fold (zext (and (trunc x), cst)) -> (and x, cst), 3664 // if either of the casts is not free. 3665 if (N0.getOpcode() == ISD::AND && 3666 N0.getOperand(0).getOpcode() == ISD::TRUNCATE && 3667 N0.getOperand(1).getOpcode() == ISD::Constant && 3668 (!TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(), 3669 N0.getValueType()) || 3670 !TLI.isZExtFree(N0.getValueType(), VT))) { 3671 SDValue X = N0.getOperand(0).getOperand(0); 3672 if (X.getValueType().bitsLT(VT)) { 3673 X = DAG.getNode(ISD::ANY_EXTEND, X.getDebugLoc(), VT, X); 3674 } else if (X.getValueType().bitsGT(VT)) { 3675 X = DAG.getNode(ISD::TRUNCATE, X.getDebugLoc(), VT, X); 3676 } 3677 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue(); 3678 Mask.zext(VT.getSizeInBits()); 3679 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 3680 X, DAG.getConstant(Mask, VT)); 3681 } 3682 3683 // fold (zext (load x)) -> (zext (truncate (zextload x))) 3684 if (ISD::isNON_EXTLoad(N0.getNode()) && 3685 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 3686 TLI.isLoadExtLegal(ISD::ZEXTLOAD, N0.getValueType()))) { 3687 bool DoXform = true; 3688 SmallVector<SDNode*, 4> SetCCs; 3689 if (!N0.hasOneUse()) 3690 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ZERO_EXTEND, SetCCs, TLI); 3691 if (DoXform) { 3692 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3693 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N->getDebugLoc(), 3694 LN0->getChain(), 3695 LN0->getBasePtr(), LN0->getPointerInfo(), 3696 N0.getValueType(), 3697 LN0->isVolatile(), LN0->isNonTemporal(), 3698 LN0->getAlignment()); 3699 CombineTo(N, ExtLoad); 3700 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), 3701 N0.getValueType(), ExtLoad); 3702 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1)); 3703 3704 // Extend SetCC uses if necessary. 3705 for (unsigned i = 0, e = SetCCs.size(); i != e; ++i) { 3706 SDNode *SetCC = SetCCs[i]; 3707 SmallVector<SDValue, 4> Ops; 3708 3709 for (unsigned j = 0; j != 2; ++j) { 3710 SDValue SOp = SetCC->getOperand(j); 3711 if (SOp == Trunc) 3712 Ops.push_back(ExtLoad); 3713 else 3714 Ops.push_back(DAG.getNode(ISD::ZERO_EXTEND, 3715 N->getDebugLoc(), VT, SOp)); 3716 } 3717 3718 Ops.push_back(SetCC->getOperand(2)); 3719 CombineTo(SetCC, DAG.getNode(ISD::SETCC, N->getDebugLoc(), 3720 SetCC->getValueType(0), 3721 &Ops[0], Ops.size())); 3722 } 3723 3724 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3725 } 3726 } 3727 3728 // fold (zext (zextload x)) -> (zext (truncate (zextload x))) 3729 // fold (zext ( extload x)) -> (zext (truncate (zextload x))) 3730 if ((ISD::isZEXTLoad(N0.getNode()) || ISD::isEXTLoad(N0.getNode())) && 3731 ISD::isUNINDEXEDLoad(N0.getNode()) && N0.hasOneUse()) { 3732 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3733 EVT MemVT = LN0->getMemoryVT(); 3734 if ((!LegalOperations && !LN0->isVolatile()) || 3735 TLI.isLoadExtLegal(ISD::ZEXTLOAD, MemVT)) { 3736 SDValue ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N->getDebugLoc(), 3737 LN0->getChain(), 3738 LN0->getBasePtr(), LN0->getPointerInfo(), 3739 MemVT, 3740 LN0->isVolatile(), LN0->isNonTemporal(), 3741 LN0->getAlignment()); 3742 CombineTo(N, ExtLoad); 3743 CombineTo(N0.getNode(), 3744 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), N0.getValueType(), 3745 ExtLoad), 3746 ExtLoad.getValue(1)); 3747 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3748 } 3749 } 3750 3751 if (N0.getOpcode() == ISD::SETCC) { 3752 if (!LegalOperations && VT.isVector()) { 3753 // zext(setcc) -> (and (vsetcc), (1, 1, ...) for vectors. 3754 // Only do this before legalize for now. 3755 EVT N0VT = N0.getOperand(0).getValueType(); 3756 EVT EltVT = VT.getVectorElementType(); 3757 SmallVector<SDValue,8> OneOps(VT.getVectorNumElements(), 3758 DAG.getConstant(1, EltVT)); 3759 if (VT.getSizeInBits() == N0VT.getSizeInBits()) { 3760 // We know that the # elements of the results is the same as the 3761 // # elements of the compare (and the # elements of the compare result 3762 // for that matter). Check to see that they are the same size. If so, 3763 // we know that the element size of the sext'd result matches the 3764 // element size of the compare operands. 3765 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 3766 DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0), 3767 N0.getOperand(1), 3768 cast<CondCodeSDNode>(N0.getOperand(2))->get()), 3769 DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT, 3770 &OneOps[0], OneOps.size())); 3771 } else { 3772 // If the desired elements are smaller or larger than the source 3773 // elements we can use a matching integer vector type and then 3774 // truncate/sign extend 3775 EVT MatchingElementType = 3776 EVT::getIntegerVT(*DAG.getContext(), 3777 N0VT.getScalarType().getSizeInBits()); 3778 EVT MatchingVectorType = 3779 EVT::getVectorVT(*DAG.getContext(), MatchingElementType, 3780 N0VT.getVectorNumElements()); 3781 SDValue VsetCC = 3782 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0), 3783 N0.getOperand(1), 3784 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 3785 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 3786 DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT), 3787 DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT, 3788 &OneOps[0], OneOps.size())); 3789 } 3790 } 3791 3792 // zext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc 3793 SDValue SCC = 3794 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1), 3795 DAG.getConstant(1, VT), DAG.getConstant(0, VT), 3796 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true); 3797 if (SCC.getNode()) return SCC; 3798 } 3799 3800 // (zext (shl (zext x), cst)) -> (shl (zext x), cst) 3801 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL) && 3802 isa<ConstantSDNode>(N0.getOperand(1)) && 3803 N0.getOperand(0).getOpcode() == ISD::ZERO_EXTEND && 3804 N0.hasOneUse()) { 3805 if (N0.getOpcode() == ISD::SHL) { 3806 // If the original shl may be shifting out bits, do not perform this 3807 // transformation. 3808 unsigned ShAmt = cast<ConstantSDNode>(N0.getOperand(1))->getZExtValue(); 3809 unsigned KnownZeroBits = N0.getOperand(0).getValueType().getSizeInBits() - 3810 N0.getOperand(0).getOperand(0).getValueType().getSizeInBits(); 3811 if (ShAmt > KnownZeroBits) 3812 return SDValue(); 3813 } 3814 DebugLoc dl = N->getDebugLoc(); 3815 return DAG.getNode(N0.getOpcode(), dl, VT, 3816 DAG.getNode(ISD::ZERO_EXTEND, dl, VT, N0.getOperand(0)), 3817 DAG.getNode(ISD::ZERO_EXTEND, dl, 3818 N0.getOperand(1).getValueType(), 3819 N0.getOperand(1))); 3820 } 3821 3822 return SDValue(); 3823} 3824 3825SDValue DAGCombiner::visitANY_EXTEND(SDNode *N) { 3826 SDValue N0 = N->getOperand(0); 3827 EVT VT = N->getValueType(0); 3828 3829 // fold (aext c1) -> c1 3830 if (isa<ConstantSDNode>(N0)) 3831 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, N0); 3832 // fold (aext (aext x)) -> (aext x) 3833 // fold (aext (zext x)) -> (zext x) 3834 // fold (aext (sext x)) -> (sext x) 3835 if (N0.getOpcode() == ISD::ANY_EXTEND || 3836 N0.getOpcode() == ISD::ZERO_EXTEND || 3837 N0.getOpcode() == ISD::SIGN_EXTEND) 3838 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, N0.getOperand(0)); 3839 3840 // fold (aext (truncate (load x))) -> (aext (smaller load x)) 3841 // fold (aext (truncate (srl (load x), c))) -> (aext (small load (x+c/n))) 3842 if (N0.getOpcode() == ISD::TRUNCATE) { 3843 SDValue NarrowLoad = ReduceLoadWidth(N0.getNode()); 3844 if (NarrowLoad.getNode()) { 3845 SDNode* oye = N0.getNode()->getOperand(0).getNode(); 3846 if (NarrowLoad.getNode() != N0.getNode()) { 3847 CombineTo(N0.getNode(), NarrowLoad); 3848 // CombineTo deleted the truncate, if needed, but not what's under it. 3849 AddToWorkList(oye); 3850 } 3851 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, NarrowLoad); 3852 } 3853 } 3854 3855 // fold (aext (truncate x)) 3856 if (N0.getOpcode() == ISD::TRUNCATE) { 3857 SDValue TruncOp = N0.getOperand(0); 3858 if (TruncOp.getValueType() == VT) 3859 return TruncOp; // x iff x size == zext size. 3860 if (TruncOp.getValueType().bitsGT(VT)) 3861 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, TruncOp); 3862 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, TruncOp); 3863 } 3864 3865 // Fold (aext (and (trunc x), cst)) -> (and x, cst) 3866 // if the trunc is not free. 3867 if (N0.getOpcode() == ISD::AND && 3868 N0.getOperand(0).getOpcode() == ISD::TRUNCATE && 3869 N0.getOperand(1).getOpcode() == ISD::Constant && 3870 !TLI.isTruncateFree(N0.getOperand(0).getOperand(0).getValueType(), 3871 N0.getValueType())) { 3872 SDValue X = N0.getOperand(0).getOperand(0); 3873 if (X.getValueType().bitsLT(VT)) { 3874 X = DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), VT, X); 3875 } else if (X.getValueType().bitsGT(VT)) { 3876 X = DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, X); 3877 } 3878 APInt Mask = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue(); 3879 Mask.zext(VT.getSizeInBits()); 3880 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 3881 X, DAG.getConstant(Mask, VT)); 3882 } 3883 3884 // fold (aext (load x)) -> (aext (truncate (extload x))) 3885 if (ISD::isNON_EXTLoad(N0.getNode()) && 3886 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 3887 TLI.isLoadExtLegal(ISD::EXTLOAD, N0.getValueType()))) { 3888 bool DoXform = true; 3889 SmallVector<SDNode*, 4> SetCCs; 3890 if (!N0.hasOneUse()) 3891 DoXform = ExtendUsesToFormExtLoad(N, N0, ISD::ANY_EXTEND, SetCCs, TLI); 3892 if (DoXform) { 3893 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3894 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, N->getDebugLoc(), 3895 LN0->getChain(), 3896 LN0->getBasePtr(), LN0->getPointerInfo(), 3897 N0.getValueType(), 3898 LN0->isVolatile(), LN0->isNonTemporal(), 3899 LN0->getAlignment()); 3900 CombineTo(N, ExtLoad); 3901 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), 3902 N0.getValueType(), ExtLoad); 3903 CombineTo(N0.getNode(), Trunc, ExtLoad.getValue(1)); 3904 3905 // Extend SetCC uses if necessary. 3906 for (unsigned i = 0, e = SetCCs.size(); i != e; ++i) { 3907 SDNode *SetCC = SetCCs[i]; 3908 SmallVector<SDValue, 4> Ops; 3909 3910 for (unsigned j = 0; j != 2; ++j) { 3911 SDValue SOp = SetCC->getOperand(j); 3912 if (SOp == Trunc) 3913 Ops.push_back(ExtLoad); 3914 else 3915 Ops.push_back(DAG.getNode(ISD::ANY_EXTEND, 3916 N->getDebugLoc(), VT, SOp)); 3917 } 3918 3919 Ops.push_back(SetCC->getOperand(2)); 3920 CombineTo(SetCC, DAG.getNode(ISD::SETCC, N->getDebugLoc(), 3921 SetCC->getValueType(0), 3922 &Ops[0], Ops.size())); 3923 } 3924 3925 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3926 } 3927 } 3928 3929 // fold (aext (zextload x)) -> (aext (truncate (zextload x))) 3930 // fold (aext (sextload x)) -> (aext (truncate (sextload x))) 3931 // fold (aext ( extload x)) -> (aext (truncate (extload x))) 3932 if (N0.getOpcode() == ISD::LOAD && 3933 !ISD::isNON_EXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) && 3934 N0.hasOneUse()) { 3935 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 3936 EVT MemVT = LN0->getMemoryVT(); 3937 SDValue ExtLoad = DAG.getExtLoad(LN0->getExtensionType(), VT, 3938 N->getDebugLoc(), 3939 LN0->getChain(), LN0->getBasePtr(), 3940 LN0->getPointerInfo(), MemVT, 3941 LN0->isVolatile(), LN0->isNonTemporal(), 3942 LN0->getAlignment()); 3943 CombineTo(N, ExtLoad); 3944 CombineTo(N0.getNode(), 3945 DAG.getNode(ISD::TRUNCATE, N0.getDebugLoc(), 3946 N0.getValueType(), ExtLoad), 3947 ExtLoad.getValue(1)); 3948 return SDValue(N, 0); // Return N so it doesn't get rechecked! 3949 } 3950 3951 if (N0.getOpcode() == ISD::SETCC) { 3952 // aext(setcc) -> sext_in_reg(vsetcc) for vectors. 3953 // Only do this before legalize for now. 3954 if (VT.isVector() && !LegalOperations) { 3955 EVT N0VT = N0.getOperand(0).getValueType(); 3956 // We know that the # elements of the results is the same as the 3957 // # elements of the compare (and the # elements of the compare result 3958 // for that matter). Check to see that they are the same size. If so, 3959 // we know that the element size of the sext'd result matches the 3960 // element size of the compare operands. 3961 if (VT.getSizeInBits() == N0VT.getSizeInBits()) 3962 return DAG.getVSetCC(N->getDebugLoc(), VT, N0.getOperand(0), 3963 N0.getOperand(1), 3964 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 3965 // If the desired elements are smaller or larger than the source 3966 // elements we can use a matching integer vector type and then 3967 // truncate/sign extend 3968 else { 3969 EVT MatchingElementType = 3970 EVT::getIntegerVT(*DAG.getContext(), 3971 N0VT.getScalarType().getSizeInBits()); 3972 EVT MatchingVectorType = 3973 EVT::getVectorVT(*DAG.getContext(), MatchingElementType, 3974 N0VT.getVectorNumElements()); 3975 SDValue VsetCC = 3976 DAG.getVSetCC(N->getDebugLoc(), MatchingVectorType, N0.getOperand(0), 3977 N0.getOperand(1), 3978 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 3979 return DAG.getSExtOrTrunc(VsetCC, N->getDebugLoc(), VT); 3980 } 3981 } 3982 3983 // aext(setcc x,y,cc) -> select_cc x, y, 1, 0, cc 3984 SDValue SCC = 3985 SimplifySelectCC(N->getDebugLoc(), N0.getOperand(0), N0.getOperand(1), 3986 DAG.getConstant(1, VT), DAG.getConstant(0, VT), 3987 cast<CondCodeSDNode>(N0.getOperand(2))->get(), true); 3988 if (SCC.getNode()) 3989 return SCC; 3990 } 3991 3992 return SDValue(); 3993} 3994 3995/// GetDemandedBits - See if the specified operand can be simplified with the 3996/// knowledge that only the bits specified by Mask are used. If so, return the 3997/// simpler operand, otherwise return a null SDValue. 3998SDValue DAGCombiner::GetDemandedBits(SDValue V, const APInt &Mask) { 3999 switch (V.getOpcode()) { 4000 default: break; 4001 case ISD::OR: 4002 case ISD::XOR: 4003 // If the LHS or RHS don't contribute bits to the or, drop them. 4004 if (DAG.MaskedValueIsZero(V.getOperand(0), Mask)) 4005 return V.getOperand(1); 4006 if (DAG.MaskedValueIsZero(V.getOperand(1), Mask)) 4007 return V.getOperand(0); 4008 break; 4009 case ISD::SRL: 4010 // Only look at single-use SRLs. 4011 if (!V.getNode()->hasOneUse()) 4012 break; 4013 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(V.getOperand(1))) { 4014 // See if we can recursively simplify the LHS. 4015 unsigned Amt = RHSC->getZExtValue(); 4016 4017 // Watch out for shift count overflow though. 4018 if (Amt >= Mask.getBitWidth()) break; 4019 APInt NewMask = Mask << Amt; 4020 SDValue SimplifyLHS = GetDemandedBits(V.getOperand(0), NewMask); 4021 if (SimplifyLHS.getNode()) 4022 return DAG.getNode(ISD::SRL, V.getDebugLoc(), V.getValueType(), 4023 SimplifyLHS, V.getOperand(1)); 4024 } 4025 } 4026 return SDValue(); 4027} 4028 4029/// ReduceLoadWidth - If the result of a wider load is shifted to right of N 4030/// bits and then truncated to a narrower type and where N is a multiple 4031/// of number of bits of the narrower type, transform it to a narrower load 4032/// from address + N / num of bits of new type. If the result is to be 4033/// extended, also fold the extension to form a extending load. 4034SDValue DAGCombiner::ReduceLoadWidth(SDNode *N) { 4035 unsigned Opc = N->getOpcode(); 4036 4037 ISD::LoadExtType ExtType = ISD::NON_EXTLOAD; 4038 SDValue N0 = N->getOperand(0); 4039 EVT VT = N->getValueType(0); 4040 EVT ExtVT = VT; 4041 4042 // This transformation isn't valid for vector loads. 4043 if (VT.isVector()) 4044 return SDValue(); 4045 4046 // Special case: SIGN_EXTEND_INREG is basically truncating to ExtVT then 4047 // extended to VT. 4048 if (Opc == ISD::SIGN_EXTEND_INREG) { 4049 ExtType = ISD::SEXTLOAD; 4050 ExtVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 4051 if (LegalOperations && !TLI.isLoadExtLegal(ISD::SEXTLOAD, ExtVT)) 4052 return SDValue(); 4053 } else if (Opc == ISD::SRL) { 4054 // Annother special-case: SRL is basically zero-extending a narrower 4055 // value. 4056 ExtType = ISD::ZEXTLOAD; 4057 N0 = SDValue(N, 0); 4058 ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1)); 4059 if (!N01) return SDValue(); 4060 ExtVT = EVT::getIntegerVT(*DAG.getContext(), 4061 VT.getSizeInBits() - N01->getZExtValue()); 4062 } 4063 4064 unsigned EVTBits = ExtVT.getSizeInBits(); 4065 unsigned ShAmt = 0; 4066 if (N0.getOpcode() == ISD::SRL && N0.hasOneUse() && ExtVT.isRound()) { 4067 if (ConstantSDNode *N01 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) { 4068 ShAmt = N01->getZExtValue(); 4069 // Is the shift amount a multiple of size of VT? 4070 if ((ShAmt & (EVTBits-1)) == 0) { 4071 N0 = N0.getOperand(0); 4072 // Is the load width a multiple of size of VT? 4073 if ((N0.getValueType().getSizeInBits() & (EVTBits-1)) != 0) 4074 return SDValue(); 4075 } 4076 } 4077 } 4078 4079 // Do not generate loads of non-round integer types since these can 4080 // be expensive (and would be wrong if the type is not byte sized). 4081 if (isa<LoadSDNode>(N0) && N0.hasOneUse() && ExtVT.isRound() && 4082 cast<LoadSDNode>(N0)->getMemoryVT().getSizeInBits() >= EVTBits && 4083 // Do not change the width of a volatile load. 4084 !cast<LoadSDNode>(N0)->isVolatile()) { 4085 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 4086 EVT PtrType = N0.getOperand(1).getValueType(); 4087 4088 // For big endian targets, we need to adjust the offset to the pointer to 4089 // load the correct bytes. 4090 if (TLI.isBigEndian()) { 4091 unsigned LVTStoreBits = LN0->getMemoryVT().getStoreSizeInBits(); 4092 unsigned EVTStoreBits = ExtVT.getStoreSizeInBits(); 4093 ShAmt = LVTStoreBits - EVTStoreBits - ShAmt; 4094 } 4095 4096 uint64_t PtrOff = ShAmt / 8; 4097 unsigned NewAlign = MinAlign(LN0->getAlignment(), PtrOff); 4098 SDValue NewPtr = DAG.getNode(ISD::ADD, LN0->getDebugLoc(), 4099 PtrType, LN0->getBasePtr(), 4100 DAG.getConstant(PtrOff, PtrType)); 4101 AddToWorkList(NewPtr.getNode()); 4102 4103 SDValue Load = (ExtType == ISD::NON_EXTLOAD) 4104 ? DAG.getLoad(VT, N0.getDebugLoc(), LN0->getChain(), NewPtr, 4105 LN0->getPointerInfo().getWithOffset(PtrOff), 4106 LN0->isVolatile(), LN0->isNonTemporal(), NewAlign) 4107 : DAG.getExtLoad(ExtType, VT, N0.getDebugLoc(), LN0->getChain(), NewPtr, 4108 LN0->getPointerInfo().getWithOffset(PtrOff), 4109 ExtVT, LN0->isVolatile(), LN0->isNonTemporal(), 4110 NewAlign); 4111 4112 // Replace the old load's chain with the new load's chain. 4113 WorkListRemover DeadNodes(*this); 4114 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), Load.getValue(1), 4115 &DeadNodes); 4116 4117 // Return the new loaded value. 4118 return Load; 4119 } 4120 4121 return SDValue(); 4122} 4123 4124SDValue DAGCombiner::visitSIGN_EXTEND_INREG(SDNode *N) { 4125 SDValue N0 = N->getOperand(0); 4126 SDValue N1 = N->getOperand(1); 4127 EVT VT = N->getValueType(0); 4128 EVT EVT = cast<VTSDNode>(N1)->getVT(); 4129 unsigned VTBits = VT.getScalarType().getSizeInBits(); 4130 unsigned EVTBits = EVT.getScalarType().getSizeInBits(); 4131 4132 // fold (sext_in_reg c1) -> c1 4133 if (isa<ConstantSDNode>(N0) || N0.getOpcode() == ISD::UNDEF) 4134 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, N0, N1); 4135 4136 // If the input is already sign extended, just drop the extension. 4137 if (DAG.ComputeNumSignBits(N0) >= VTBits-EVTBits+1) 4138 return N0; 4139 4140 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt2 4141 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG && 4142 EVT.bitsLT(cast<VTSDNode>(N0.getOperand(1))->getVT())) { 4143 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), VT, 4144 N0.getOperand(0), N1); 4145 } 4146 4147 // fold (sext_in_reg (sext x)) -> (sext x) 4148 // fold (sext_in_reg (aext x)) -> (sext x) 4149 // if x is small enough. 4150 if (N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND) { 4151 SDValue N00 = N0.getOperand(0); 4152 if (N00.getValueType().getScalarType().getSizeInBits() <= EVTBits && 4153 (!LegalOperations || TLI.isOperationLegal(ISD::SIGN_EXTEND, VT))) 4154 return DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, N00, N1); 4155 } 4156 4157 // fold (sext_in_reg x) -> (zext_in_reg x) if the sign bit is known zero. 4158 if (DAG.MaskedValueIsZero(N0, APInt::getBitsSet(VTBits, EVTBits-1, EVTBits))) 4159 return DAG.getZeroExtendInReg(N0, N->getDebugLoc(), EVT); 4160 4161 // fold operands of sext_in_reg based on knowledge that the top bits are not 4162 // demanded. 4163 if (SimplifyDemandedBits(SDValue(N, 0))) 4164 return SDValue(N, 0); 4165 4166 // fold (sext_in_reg (load x)) -> (smaller sextload x) 4167 // fold (sext_in_reg (srl (load x), c)) -> (smaller sextload (x+c/evtbits)) 4168 SDValue NarrowLoad = ReduceLoadWidth(N); 4169 if (NarrowLoad.getNode()) 4170 return NarrowLoad; 4171 4172 // fold (sext_in_reg (srl X, 24), i8) -> (sra X, 24) 4173 // fold (sext_in_reg (srl X, 23), i8) -> (sra X, 23) iff possible. 4174 // We already fold "(sext_in_reg (srl X, 25), i8) -> srl X, 25" above. 4175 if (N0.getOpcode() == ISD::SRL) { 4176 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(N0.getOperand(1))) 4177 if (ShAmt->getZExtValue()+EVTBits <= VTBits) { 4178 // We can turn this into an SRA iff the input to the SRL is already sign 4179 // extended enough. 4180 unsigned InSignBits = DAG.ComputeNumSignBits(N0.getOperand(0)); 4181 if (VTBits-(ShAmt->getZExtValue()+EVTBits) < InSignBits) 4182 return DAG.getNode(ISD::SRA, N->getDebugLoc(), VT, 4183 N0.getOperand(0), N0.getOperand(1)); 4184 } 4185 } 4186 4187 // fold (sext_inreg (extload x)) -> (sextload x) 4188 if (ISD::isEXTLoad(N0.getNode()) && 4189 ISD::isUNINDEXEDLoad(N0.getNode()) && 4190 EVT == cast<LoadSDNode>(N0)->getMemoryVT() && 4191 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 4192 TLI.isLoadExtLegal(ISD::SEXTLOAD, EVT))) { 4193 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 4194 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N->getDebugLoc(), 4195 LN0->getChain(), 4196 LN0->getBasePtr(), LN0->getPointerInfo(), 4197 EVT, 4198 LN0->isVolatile(), LN0->isNonTemporal(), 4199 LN0->getAlignment()); 4200 CombineTo(N, ExtLoad); 4201 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1)); 4202 return SDValue(N, 0); // Return N so it doesn't get rechecked! 4203 } 4204 // fold (sext_inreg (zextload x)) -> (sextload x) iff load has one use 4205 if (ISD::isZEXTLoad(N0.getNode()) && ISD::isUNINDEXEDLoad(N0.getNode()) && 4206 N0.hasOneUse() && 4207 EVT == cast<LoadSDNode>(N0)->getMemoryVT() && 4208 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 4209 TLI.isLoadExtLegal(ISD::SEXTLOAD, EVT))) { 4210 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 4211 SDValue ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N->getDebugLoc(), 4212 LN0->getChain(), 4213 LN0->getBasePtr(), LN0->getPointerInfo(), 4214 EVT, 4215 LN0->isVolatile(), LN0->isNonTemporal(), 4216 LN0->getAlignment()); 4217 CombineTo(N, ExtLoad); 4218 CombineTo(N0.getNode(), ExtLoad, ExtLoad.getValue(1)); 4219 return SDValue(N, 0); // Return N so it doesn't get rechecked! 4220 } 4221 return SDValue(); 4222} 4223 4224SDValue DAGCombiner::visitTRUNCATE(SDNode *N) { 4225 SDValue N0 = N->getOperand(0); 4226 EVT VT = N->getValueType(0); 4227 4228 // noop truncate 4229 if (N0.getValueType() == N->getValueType(0)) 4230 return N0; 4231 // fold (truncate c1) -> c1 4232 if (isa<ConstantSDNode>(N0)) 4233 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0); 4234 // fold (truncate (truncate x)) -> (truncate x) 4235 if (N0.getOpcode() == ISD::TRUNCATE) 4236 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0.getOperand(0)); 4237 // fold (truncate (ext x)) -> (ext x) or (truncate x) or x 4238 if (N0.getOpcode() == ISD::ZERO_EXTEND || 4239 N0.getOpcode() == ISD::SIGN_EXTEND || 4240 N0.getOpcode() == ISD::ANY_EXTEND) { 4241 if (N0.getOperand(0).getValueType().bitsLT(VT)) 4242 // if the source is smaller than the dest, we still need an extend 4243 return DAG.getNode(N0.getOpcode(), N->getDebugLoc(), VT, 4244 N0.getOperand(0)); 4245 else if (N0.getOperand(0).getValueType().bitsGT(VT)) 4246 // if the source is larger than the dest, than we just need the truncate 4247 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, N0.getOperand(0)); 4248 else 4249 // if the source and dest are the same type, we can drop both the extend 4250 // and the truncate. 4251 return N0.getOperand(0); 4252 } 4253 4254 // See if we can simplify the input to this truncate through knowledge that 4255 // only the low bits are being used. For example "trunc (or (shl x, 8), y)" 4256 // -> trunc y 4257 SDValue Shorter = 4258 GetDemandedBits(N0, APInt::getLowBitsSet(N0.getValueSizeInBits(), 4259 VT.getSizeInBits())); 4260 if (Shorter.getNode()) 4261 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), VT, Shorter); 4262 4263 // fold (truncate (load x)) -> (smaller load x) 4264 // fold (truncate (srl (load x), c)) -> (smaller load (x+c/evtbits)) 4265 if (!LegalTypes || TLI.isTypeDesirableForOp(N0.getOpcode(), VT)) { 4266 SDValue Reduced = ReduceLoadWidth(N); 4267 if (Reduced.getNode()) 4268 return Reduced; 4269 } 4270 4271 // Simplify the operands using demanded-bits information. 4272 if (!VT.isVector() && 4273 SimplifyDemandedBits(SDValue(N, 0))) 4274 return SDValue(N, 0); 4275 4276 return SDValue(); 4277} 4278 4279static SDNode *getBuildPairElt(SDNode *N, unsigned i) { 4280 SDValue Elt = N->getOperand(i); 4281 if (Elt.getOpcode() != ISD::MERGE_VALUES) 4282 return Elt.getNode(); 4283 return Elt.getOperand(Elt.getResNo()).getNode(); 4284} 4285 4286/// CombineConsecutiveLoads - build_pair (load, load) -> load 4287/// if load locations are consecutive. 4288SDValue DAGCombiner::CombineConsecutiveLoads(SDNode *N, EVT VT) { 4289 assert(N->getOpcode() == ISD::BUILD_PAIR); 4290 4291 LoadSDNode *LD1 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 0)); 4292 LoadSDNode *LD2 = dyn_cast<LoadSDNode>(getBuildPairElt(N, 1)); 4293 if (!LD1 || !LD2 || !ISD::isNON_EXTLoad(LD1) || !LD1->hasOneUse() || 4294 LD1->getPointerInfo().getAddrSpace() != 4295 LD2->getPointerInfo().getAddrSpace()) 4296 return SDValue(); 4297 EVT LD1VT = LD1->getValueType(0); 4298 4299 if (ISD::isNON_EXTLoad(LD2) && 4300 LD2->hasOneUse() && 4301 // If both are volatile this would reduce the number of volatile loads. 4302 // If one is volatile it might be ok, but play conservative and bail out. 4303 !LD1->isVolatile() && 4304 !LD2->isVolatile() && 4305 DAG.isConsecutiveLoad(LD2, LD1, LD1VT.getSizeInBits()/8, 1)) { 4306 unsigned Align = LD1->getAlignment(); 4307 unsigned NewAlign = TLI.getTargetData()-> 4308 getABITypeAlignment(VT.getTypeForEVT(*DAG.getContext())); 4309 4310 if (NewAlign <= Align && 4311 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT))) 4312 return DAG.getLoad(VT, N->getDebugLoc(), LD1->getChain(), 4313 LD1->getBasePtr(), LD1->getPointerInfo(), 4314 false, false, Align); 4315 } 4316 4317 return SDValue(); 4318} 4319 4320SDValue DAGCombiner::visitBIT_CONVERT(SDNode *N) { 4321 SDValue N0 = N->getOperand(0); 4322 EVT VT = N->getValueType(0); 4323 4324 // If the input is a BUILD_VECTOR with all constant elements, fold this now. 4325 // Only do this before legalize, since afterward the target may be depending 4326 // on the bitconvert. 4327 // First check to see if this is all constant. 4328 if (!LegalTypes && 4329 N0.getOpcode() == ISD::BUILD_VECTOR && N0.getNode()->hasOneUse() && 4330 VT.isVector()) { 4331 bool isSimple = true; 4332 for (unsigned i = 0, e = N0.getNumOperands(); i != e; ++i) 4333 if (N0.getOperand(i).getOpcode() != ISD::UNDEF && 4334 N0.getOperand(i).getOpcode() != ISD::Constant && 4335 N0.getOperand(i).getOpcode() != ISD::ConstantFP) { 4336 isSimple = false; 4337 break; 4338 } 4339 4340 EVT DestEltVT = N->getValueType(0).getVectorElementType(); 4341 assert(!DestEltVT.isVector() && 4342 "Element type of vector ValueType must not be vector!"); 4343 if (isSimple) 4344 return ConstantFoldBIT_CONVERTofBUILD_VECTOR(N0.getNode(), DestEltVT); 4345 } 4346 4347 // If the input is a constant, let getNode fold it. 4348 if (isa<ConstantSDNode>(N0) || isa<ConstantFPSDNode>(N0)) { 4349 SDValue Res = DAG.getNode(ISD::BIT_CONVERT, N->getDebugLoc(), VT, N0); 4350 if (Res.getNode() != N) { 4351 if (!LegalOperations || 4352 TLI.isOperationLegal(Res.getNode()->getOpcode(), VT)) 4353 return Res; 4354 4355 // Folding it resulted in an illegal node, and it's too late to 4356 // do that. Clean up the old node and forego the transformation. 4357 // Ideally this won't happen very often, because instcombine 4358 // and the earlier dagcombine runs (where illegal nodes are 4359 // permitted) should have folded most of them already. 4360 DAG.DeleteNode(Res.getNode()); 4361 } 4362 } 4363 4364 // (conv (conv x, t1), t2) -> (conv x, t2) 4365 if (N0.getOpcode() == ISD::BIT_CONVERT) 4366 return DAG.getNode(ISD::BIT_CONVERT, N->getDebugLoc(), VT, 4367 N0.getOperand(0)); 4368 4369 // fold (conv (load x)) -> (load (conv*)x) 4370 // If the resultant load doesn't need a higher alignment than the original! 4371 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() && 4372 // Do not change the width of a volatile load. 4373 !cast<LoadSDNode>(N0)->isVolatile() && 4374 (!LegalOperations || TLI.isOperationLegal(ISD::LOAD, VT))) { 4375 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 4376 unsigned Align = TLI.getTargetData()-> 4377 getABITypeAlignment(VT.getTypeForEVT(*DAG.getContext())); 4378 unsigned OrigAlign = LN0->getAlignment(); 4379 4380 if (Align <= OrigAlign) { 4381 SDValue Load = DAG.getLoad(VT, N->getDebugLoc(), LN0->getChain(), 4382 LN0->getBasePtr(), LN0->getPointerInfo(), 4383 LN0->isVolatile(), LN0->isNonTemporal(), 4384 OrigAlign); 4385 AddToWorkList(N); 4386 CombineTo(N0.getNode(), 4387 DAG.getNode(ISD::BIT_CONVERT, N0.getDebugLoc(), 4388 N0.getValueType(), Load), 4389 Load.getValue(1)); 4390 return Load; 4391 } 4392 } 4393 4394 // fold (bitconvert (fneg x)) -> (xor (bitconvert x), signbit) 4395 // fold (bitconvert (fabs x)) -> (and (bitconvert x), (not signbit)) 4396 // This often reduces constant pool loads. 4397 if ((N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FABS) && 4398 N0.getNode()->hasOneUse() && VT.isInteger() && !VT.isVector()) { 4399 SDValue NewConv = DAG.getNode(ISD::BIT_CONVERT, N0.getDebugLoc(), VT, 4400 N0.getOperand(0)); 4401 AddToWorkList(NewConv.getNode()); 4402 4403 APInt SignBit = APInt::getSignBit(VT.getSizeInBits()); 4404 if (N0.getOpcode() == ISD::FNEG) 4405 return DAG.getNode(ISD::XOR, N->getDebugLoc(), VT, 4406 NewConv, DAG.getConstant(SignBit, VT)); 4407 assert(N0.getOpcode() == ISD::FABS); 4408 return DAG.getNode(ISD::AND, N->getDebugLoc(), VT, 4409 NewConv, DAG.getConstant(~SignBit, VT)); 4410 } 4411 4412 // fold (bitconvert (fcopysign cst, x)) -> 4413 // (or (and (bitconvert x), sign), (and cst, (not sign))) 4414 // Note that we don't handle (copysign x, cst) because this can always be 4415 // folded to an fneg or fabs. 4416 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse() && 4417 isa<ConstantFPSDNode>(N0.getOperand(0)) && 4418 VT.isInteger() && !VT.isVector()) { 4419 unsigned OrigXWidth = N0.getOperand(1).getValueType().getSizeInBits(); 4420 EVT IntXVT = EVT::getIntegerVT(*DAG.getContext(), OrigXWidth); 4421 if (isTypeLegal(IntXVT)) { 4422 SDValue X = DAG.getNode(ISD::BIT_CONVERT, N0.getDebugLoc(), 4423 IntXVT, N0.getOperand(1)); 4424 AddToWorkList(X.getNode()); 4425 4426 // If X has a different width than the result/lhs, sext it or truncate it. 4427 unsigned VTWidth = VT.getSizeInBits(); 4428 if (OrigXWidth < VTWidth) { 4429 X = DAG.getNode(ISD::SIGN_EXTEND, N->getDebugLoc(), VT, X); 4430 AddToWorkList(X.getNode()); 4431 } else if (OrigXWidth > VTWidth) { 4432 // To get the sign bit in the right place, we have to shift it right 4433 // before truncating. 4434 X = DAG.getNode(ISD::SRL, X.getDebugLoc(), 4435 X.getValueType(), X, 4436 DAG.getConstant(OrigXWidth-VTWidth, X.getValueType())); 4437 AddToWorkList(X.getNode()); 4438 X = DAG.getNode(ISD::TRUNCATE, X.getDebugLoc(), VT, X); 4439 AddToWorkList(X.getNode()); 4440 } 4441 4442 APInt SignBit = APInt::getSignBit(VT.getSizeInBits()); 4443 X = DAG.getNode(ISD::AND, X.getDebugLoc(), VT, 4444 X, DAG.getConstant(SignBit, VT)); 4445 AddToWorkList(X.getNode()); 4446 4447 SDValue Cst = DAG.getNode(ISD::BIT_CONVERT, N0.getDebugLoc(), 4448 VT, N0.getOperand(0)); 4449 Cst = DAG.getNode(ISD::AND, Cst.getDebugLoc(), VT, 4450 Cst, DAG.getConstant(~SignBit, VT)); 4451 AddToWorkList(Cst.getNode()); 4452 4453 return DAG.getNode(ISD::OR, N->getDebugLoc(), VT, X, Cst); 4454 } 4455 } 4456 4457 // bitconvert(build_pair(ld, ld)) -> ld iff load locations are consecutive. 4458 if (N0.getOpcode() == ISD::BUILD_PAIR) { 4459 SDValue CombineLD = CombineConsecutiveLoads(N0.getNode(), VT); 4460 if (CombineLD.getNode()) 4461 return CombineLD; 4462 } 4463 4464 return SDValue(); 4465} 4466 4467SDValue DAGCombiner::visitBUILD_PAIR(SDNode *N) { 4468 EVT VT = N->getValueType(0); 4469 return CombineConsecutiveLoads(N, VT); 4470} 4471 4472/// ConstantFoldBIT_CONVERTofBUILD_VECTOR - We know that BV is a build_vector 4473/// node with Constant, ConstantFP or Undef operands. DstEltVT indicates the 4474/// destination element value type. 4475SDValue DAGCombiner:: 4476ConstantFoldBIT_CONVERTofBUILD_VECTOR(SDNode *BV, EVT DstEltVT) { 4477 EVT SrcEltVT = BV->getValueType(0).getVectorElementType(); 4478 4479 // If this is already the right type, we're done. 4480 if (SrcEltVT == DstEltVT) return SDValue(BV, 0); 4481 4482 unsigned SrcBitSize = SrcEltVT.getSizeInBits(); 4483 unsigned DstBitSize = DstEltVT.getSizeInBits(); 4484 4485 // If this is a conversion of N elements of one type to N elements of another 4486 // type, convert each element. This handles FP<->INT cases. 4487 if (SrcBitSize == DstBitSize) { 4488 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, 4489 BV->getValueType(0).getVectorNumElements()); 4490 4491 // Due to the FP element handling below calling this routine recursively, 4492 // we can end up with a scalar-to-vector node here. 4493 if (BV->getOpcode() == ISD::SCALAR_TO_VECTOR) 4494 return DAG.getNode(ISD::SCALAR_TO_VECTOR, BV->getDebugLoc(), VT, 4495 DAG.getNode(ISD::BIT_CONVERT, BV->getDebugLoc(), 4496 DstEltVT, BV->getOperand(0))); 4497 4498 SmallVector<SDValue, 8> Ops; 4499 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) { 4500 SDValue Op = BV->getOperand(i); 4501 // If the vector element type is not legal, the BUILD_VECTOR operands 4502 // are promoted and implicitly truncated. Make that explicit here. 4503 if (Op.getValueType() != SrcEltVT) 4504 Op = DAG.getNode(ISD::TRUNCATE, BV->getDebugLoc(), SrcEltVT, Op); 4505 Ops.push_back(DAG.getNode(ISD::BIT_CONVERT, BV->getDebugLoc(), 4506 DstEltVT, Op)); 4507 AddToWorkList(Ops.back().getNode()); 4508 } 4509 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT, 4510 &Ops[0], Ops.size()); 4511 } 4512 4513 // Otherwise, we're growing or shrinking the elements. To avoid having to 4514 // handle annoying details of growing/shrinking FP values, we convert them to 4515 // int first. 4516 if (SrcEltVT.isFloatingPoint()) { 4517 // Convert the input float vector to a int vector where the elements are the 4518 // same sizes. 4519 assert((SrcEltVT == MVT::f32 || SrcEltVT == MVT::f64) && "Unknown FP VT!"); 4520 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), SrcEltVT.getSizeInBits()); 4521 BV = ConstantFoldBIT_CONVERTofBUILD_VECTOR(BV, IntVT).getNode(); 4522 SrcEltVT = IntVT; 4523 } 4524 4525 // Now we know the input is an integer vector. If the output is a FP type, 4526 // convert to integer first, then to FP of the right size. 4527 if (DstEltVT.isFloatingPoint()) { 4528 assert((DstEltVT == MVT::f32 || DstEltVT == MVT::f64) && "Unknown FP VT!"); 4529 EVT TmpVT = EVT::getIntegerVT(*DAG.getContext(), DstEltVT.getSizeInBits()); 4530 SDNode *Tmp = ConstantFoldBIT_CONVERTofBUILD_VECTOR(BV, TmpVT).getNode(); 4531 4532 // Next, convert to FP elements of the same size. 4533 return ConstantFoldBIT_CONVERTofBUILD_VECTOR(Tmp, DstEltVT); 4534 } 4535 4536 // Okay, we know the src/dst types are both integers of differing types. 4537 // Handling growing first. 4538 assert(SrcEltVT.isInteger() && DstEltVT.isInteger()); 4539 if (SrcBitSize < DstBitSize) { 4540 unsigned NumInputsPerOutput = DstBitSize/SrcBitSize; 4541 4542 SmallVector<SDValue, 8> Ops; 4543 for (unsigned i = 0, e = BV->getNumOperands(); i != e; 4544 i += NumInputsPerOutput) { 4545 bool isLE = TLI.isLittleEndian(); 4546 APInt NewBits = APInt(DstBitSize, 0); 4547 bool EltIsUndef = true; 4548 for (unsigned j = 0; j != NumInputsPerOutput; ++j) { 4549 // Shift the previously computed bits over. 4550 NewBits <<= SrcBitSize; 4551 SDValue Op = BV->getOperand(i+ (isLE ? (NumInputsPerOutput-j-1) : j)); 4552 if (Op.getOpcode() == ISD::UNDEF) continue; 4553 EltIsUndef = false; 4554 4555 NewBits |= APInt(cast<ConstantSDNode>(Op)->getAPIntValue()). 4556 zextOrTrunc(SrcBitSize).zext(DstBitSize); 4557 } 4558 4559 if (EltIsUndef) 4560 Ops.push_back(DAG.getUNDEF(DstEltVT)); 4561 else 4562 Ops.push_back(DAG.getConstant(NewBits, DstEltVT)); 4563 } 4564 4565 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, Ops.size()); 4566 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT, 4567 &Ops[0], Ops.size()); 4568 } 4569 4570 // Finally, this must be the case where we are shrinking elements: each input 4571 // turns into multiple outputs. 4572 bool isS2V = ISD::isScalarToVector(BV); 4573 unsigned NumOutputsPerInput = SrcBitSize/DstBitSize; 4574 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, 4575 NumOutputsPerInput*BV->getNumOperands()); 4576 SmallVector<SDValue, 8> Ops; 4577 4578 for (unsigned i = 0, e = BV->getNumOperands(); i != e; ++i) { 4579 if (BV->getOperand(i).getOpcode() == ISD::UNDEF) { 4580 for (unsigned j = 0; j != NumOutputsPerInput; ++j) 4581 Ops.push_back(DAG.getUNDEF(DstEltVT)); 4582 continue; 4583 } 4584 4585 APInt OpVal = APInt(cast<ConstantSDNode>(BV->getOperand(i))-> 4586 getAPIntValue()).zextOrTrunc(SrcBitSize); 4587 4588 for (unsigned j = 0; j != NumOutputsPerInput; ++j) { 4589 APInt ThisVal = APInt(OpVal).trunc(DstBitSize); 4590 Ops.push_back(DAG.getConstant(ThisVal, DstEltVT)); 4591 if (isS2V && i == 0 && j == 0 && APInt(ThisVal).zext(SrcBitSize) == OpVal) 4592 // Simply turn this into a SCALAR_TO_VECTOR of the new type. 4593 return DAG.getNode(ISD::SCALAR_TO_VECTOR, BV->getDebugLoc(), VT, 4594 Ops[0]); 4595 OpVal = OpVal.lshr(DstBitSize); 4596 } 4597 4598 // For big endian targets, swap the order of the pieces of each element. 4599 if (TLI.isBigEndian()) 4600 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end()); 4601 } 4602 4603 return DAG.getNode(ISD::BUILD_VECTOR, BV->getDebugLoc(), VT, 4604 &Ops[0], Ops.size()); 4605} 4606 4607SDValue DAGCombiner::visitFADD(SDNode *N) { 4608 SDValue N0 = N->getOperand(0); 4609 SDValue N1 = N->getOperand(1); 4610 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4611 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4612 EVT VT = N->getValueType(0); 4613 4614 // fold vector ops 4615 if (VT.isVector()) { 4616 SDValue FoldedVOp = SimplifyVBinOp(N); 4617 if (FoldedVOp.getNode()) return FoldedVOp; 4618 } 4619 4620 // fold (fadd c1, c2) -> (fadd c1, c2) 4621 if (N0CFP && N1CFP && VT != MVT::ppcf128) 4622 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0, N1); 4623 // canonicalize constant to RHS 4624 if (N0CFP && !N1CFP) 4625 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N1, N0); 4626 // fold (fadd A, 0) -> A 4627 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero()) 4628 return N0; 4629 // fold (fadd A, (fneg B)) -> (fsub A, B) 4630 if (isNegatibleForFree(N1, LegalOperations) == 2) 4631 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N0, 4632 GetNegatedExpression(N1, DAG, LegalOperations)); 4633 // fold (fadd (fneg A), B) -> (fsub B, A) 4634 if (isNegatibleForFree(N0, LegalOperations) == 2) 4635 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N1, 4636 GetNegatedExpression(N0, DAG, LegalOperations)); 4637 4638 // If allowed, fold (fadd (fadd x, c1), c2) -> (fadd x, (fadd c1, c2)) 4639 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FADD && 4640 N0.getNode()->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1))) 4641 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0.getOperand(0), 4642 DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, 4643 N0.getOperand(1), N1)); 4644 4645 return SDValue(); 4646} 4647 4648SDValue DAGCombiner::visitFSUB(SDNode *N) { 4649 SDValue N0 = N->getOperand(0); 4650 SDValue N1 = N->getOperand(1); 4651 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4652 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4653 EVT VT = N->getValueType(0); 4654 4655 // fold vector ops 4656 if (VT.isVector()) { 4657 SDValue FoldedVOp = SimplifyVBinOp(N); 4658 if (FoldedVOp.getNode()) return FoldedVOp; 4659 } 4660 4661 // fold (fsub c1, c2) -> c1-c2 4662 if (N0CFP && N1CFP && VT != MVT::ppcf128) 4663 return DAG.getNode(ISD::FSUB, N->getDebugLoc(), VT, N0, N1); 4664 // fold (fsub A, 0) -> A 4665 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero()) 4666 return N0; 4667 // fold (fsub 0, B) -> -B 4668 if (UnsafeFPMath && N0CFP && N0CFP->getValueAPF().isZero()) { 4669 if (isNegatibleForFree(N1, LegalOperations)) 4670 return GetNegatedExpression(N1, DAG, LegalOperations); 4671 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT)) 4672 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT, N1); 4673 } 4674 // fold (fsub A, (fneg B)) -> (fadd A, B) 4675 if (isNegatibleForFree(N1, LegalOperations)) 4676 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0, 4677 GetNegatedExpression(N1, DAG, LegalOperations)); 4678 4679 return SDValue(); 4680} 4681 4682SDValue DAGCombiner::visitFMUL(SDNode *N) { 4683 SDValue N0 = N->getOperand(0); 4684 SDValue N1 = N->getOperand(1); 4685 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4686 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4687 EVT VT = N->getValueType(0); 4688 4689 // fold vector ops 4690 if (VT.isVector()) { 4691 SDValue FoldedVOp = SimplifyVBinOp(N); 4692 if (FoldedVOp.getNode()) return FoldedVOp; 4693 } 4694 4695 // fold (fmul c1, c2) -> c1*c2 4696 if (N0CFP && N1CFP && VT != MVT::ppcf128) 4697 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N0, N1); 4698 // canonicalize constant to RHS 4699 if (N0CFP && !N1CFP) 4700 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N1, N0); 4701 // fold (fmul A, 0) -> 0 4702 if (UnsafeFPMath && N1CFP && N1CFP->getValueAPF().isZero()) 4703 return N1; 4704 // fold (fmul A, 0) -> 0, vector edition. 4705 if (UnsafeFPMath && ISD::isBuildVectorAllZeros(N1.getNode())) 4706 return N1; 4707 // fold (fmul X, 2.0) -> (fadd X, X) 4708 if (N1CFP && N1CFP->isExactlyValue(+2.0)) 4709 return DAG.getNode(ISD::FADD, N->getDebugLoc(), VT, N0, N0); 4710 // fold (fmul X, -1.0) -> (fneg X) 4711 if (N1CFP && N1CFP->isExactlyValue(-1.0)) 4712 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT)) 4713 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT, N0); 4714 4715 // fold (fmul (fneg X), (fneg Y)) -> (fmul X, Y) 4716 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations)) { 4717 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations)) { 4718 // Both can be negated for free, check to see if at least one is cheaper 4719 // negated. 4720 if (LHSNeg == 2 || RHSNeg == 2) 4721 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, 4722 GetNegatedExpression(N0, DAG, LegalOperations), 4723 GetNegatedExpression(N1, DAG, LegalOperations)); 4724 } 4725 } 4726 4727 // If allowed, fold (fmul (fmul x, c1), c2) -> (fmul x, (fmul c1, c2)) 4728 if (UnsafeFPMath && N1CFP && N0.getOpcode() == ISD::FMUL && 4729 N0.getNode()->hasOneUse() && isa<ConstantFPSDNode>(N0.getOperand(1))) 4730 return DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, N0.getOperand(0), 4731 DAG.getNode(ISD::FMUL, N->getDebugLoc(), VT, 4732 N0.getOperand(1), N1)); 4733 4734 return SDValue(); 4735} 4736 4737SDValue DAGCombiner::visitFDIV(SDNode *N) { 4738 SDValue N0 = N->getOperand(0); 4739 SDValue N1 = N->getOperand(1); 4740 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4741 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4742 EVT VT = N->getValueType(0); 4743 4744 // fold vector ops 4745 if (VT.isVector()) { 4746 SDValue FoldedVOp = SimplifyVBinOp(N); 4747 if (FoldedVOp.getNode()) return FoldedVOp; 4748 } 4749 4750 // fold (fdiv c1, c2) -> c1/c2 4751 if (N0CFP && N1CFP && VT != MVT::ppcf128) 4752 return DAG.getNode(ISD::FDIV, N->getDebugLoc(), VT, N0, N1); 4753 4754 4755 // (fdiv (fneg X), (fneg Y)) -> (fdiv X, Y) 4756 if (char LHSNeg = isNegatibleForFree(N0, LegalOperations)) { 4757 if (char RHSNeg = isNegatibleForFree(N1, LegalOperations)) { 4758 // Both can be negated for free, check to see if at least one is cheaper 4759 // negated. 4760 if (LHSNeg == 2 || RHSNeg == 2) 4761 return DAG.getNode(ISD::FDIV, N->getDebugLoc(), VT, 4762 GetNegatedExpression(N0, DAG, LegalOperations), 4763 GetNegatedExpression(N1, DAG, LegalOperations)); 4764 } 4765 } 4766 4767 return SDValue(); 4768} 4769 4770SDValue DAGCombiner::visitFREM(SDNode *N) { 4771 SDValue N0 = N->getOperand(0); 4772 SDValue N1 = N->getOperand(1); 4773 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4774 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4775 EVT VT = N->getValueType(0); 4776 4777 // fold (frem c1, c2) -> fmod(c1,c2) 4778 if (N0CFP && N1CFP && VT != MVT::ppcf128) 4779 return DAG.getNode(ISD::FREM, N->getDebugLoc(), VT, N0, N1); 4780 4781 return SDValue(); 4782} 4783 4784SDValue DAGCombiner::visitFCOPYSIGN(SDNode *N) { 4785 SDValue N0 = N->getOperand(0); 4786 SDValue N1 = N->getOperand(1); 4787 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4788 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 4789 EVT VT = N->getValueType(0); 4790 4791 if (N0CFP && N1CFP && VT != MVT::ppcf128) // Constant fold 4792 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, N0, N1); 4793 4794 if (N1CFP) { 4795 const APFloat& V = N1CFP->getValueAPF(); 4796 // copysign(x, c1) -> fabs(x) iff ispos(c1) 4797 // copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1) 4798 if (!V.isNegative()) { 4799 if (!LegalOperations || TLI.isOperationLegal(ISD::FABS, VT)) 4800 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0); 4801 } else { 4802 if (!LegalOperations || TLI.isOperationLegal(ISD::FNEG, VT)) 4803 return DAG.getNode(ISD::FNEG, N->getDebugLoc(), VT, 4804 DAG.getNode(ISD::FABS, N0.getDebugLoc(), VT, N0)); 4805 } 4806 } 4807 4808 // copysign(fabs(x), y) -> copysign(x, y) 4809 // copysign(fneg(x), y) -> copysign(x, y) 4810 // copysign(copysign(x,z), y) -> copysign(x, y) 4811 if (N0.getOpcode() == ISD::FABS || N0.getOpcode() == ISD::FNEG || 4812 N0.getOpcode() == ISD::FCOPYSIGN) 4813 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, 4814 N0.getOperand(0), N1); 4815 4816 // copysign(x, abs(y)) -> abs(x) 4817 if (N1.getOpcode() == ISD::FABS) 4818 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0); 4819 4820 // copysign(x, copysign(y,z)) -> copysign(x, z) 4821 if (N1.getOpcode() == ISD::FCOPYSIGN) 4822 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, 4823 N0, N1.getOperand(1)); 4824 4825 // copysign(x, fp_extend(y)) -> copysign(x, y) 4826 // copysign(x, fp_round(y)) -> copysign(x, y) 4827 if (N1.getOpcode() == ISD::FP_EXTEND || N1.getOpcode() == ISD::FP_ROUND) 4828 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, 4829 N0, N1.getOperand(0)); 4830 4831 return SDValue(); 4832} 4833 4834SDValue DAGCombiner::visitSINT_TO_FP(SDNode *N) { 4835 SDValue N0 = N->getOperand(0); 4836 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 4837 EVT VT = N->getValueType(0); 4838 EVT OpVT = N0.getValueType(); 4839 4840 // fold (sint_to_fp c1) -> c1fp 4841 if (N0C && OpVT != MVT::ppcf128) 4842 return DAG.getNode(ISD::SINT_TO_FP, N->getDebugLoc(), VT, N0); 4843 4844 // If the input is a legal type, and SINT_TO_FP is not legal on this target, 4845 // but UINT_TO_FP is legal on this target, try to convert. 4846 if (!TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT) && 4847 TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT)) { 4848 // If the sign bit is known to be zero, we can change this to UINT_TO_FP. 4849 if (DAG.SignBitIsZero(N0)) 4850 return DAG.getNode(ISD::UINT_TO_FP, N->getDebugLoc(), VT, N0); 4851 } 4852 4853 return SDValue(); 4854} 4855 4856SDValue DAGCombiner::visitUINT_TO_FP(SDNode *N) { 4857 SDValue N0 = N->getOperand(0); 4858 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 4859 EVT VT = N->getValueType(0); 4860 EVT OpVT = N0.getValueType(); 4861 4862 // fold (uint_to_fp c1) -> c1fp 4863 if (N0C && OpVT != MVT::ppcf128) 4864 return DAG.getNode(ISD::UINT_TO_FP, N->getDebugLoc(), VT, N0); 4865 4866 // If the input is a legal type, and UINT_TO_FP is not legal on this target, 4867 // but SINT_TO_FP is legal on this target, try to convert. 4868 if (!TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, OpVT) && 4869 TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, OpVT)) { 4870 // If the sign bit is known to be zero, we can change this to SINT_TO_FP. 4871 if (DAG.SignBitIsZero(N0)) 4872 return DAG.getNode(ISD::SINT_TO_FP, N->getDebugLoc(), VT, N0); 4873 } 4874 4875 return SDValue(); 4876} 4877 4878SDValue DAGCombiner::visitFP_TO_SINT(SDNode *N) { 4879 SDValue N0 = N->getOperand(0); 4880 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4881 EVT VT = N->getValueType(0); 4882 4883 // fold (fp_to_sint c1fp) -> c1 4884 if (N0CFP) 4885 return DAG.getNode(ISD::FP_TO_SINT, N->getDebugLoc(), VT, N0); 4886 4887 return SDValue(); 4888} 4889 4890SDValue DAGCombiner::visitFP_TO_UINT(SDNode *N) { 4891 SDValue N0 = N->getOperand(0); 4892 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4893 EVT VT = N->getValueType(0); 4894 4895 // fold (fp_to_uint c1fp) -> c1 4896 if (N0CFP && VT != MVT::ppcf128) 4897 return DAG.getNode(ISD::FP_TO_UINT, N->getDebugLoc(), VT, N0); 4898 4899 return SDValue(); 4900} 4901 4902SDValue DAGCombiner::visitFP_ROUND(SDNode *N) { 4903 SDValue N0 = N->getOperand(0); 4904 SDValue N1 = N->getOperand(1); 4905 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4906 EVT VT = N->getValueType(0); 4907 4908 // fold (fp_round c1fp) -> c1fp 4909 if (N0CFP && N0.getValueType() != MVT::ppcf128) 4910 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT, N0, N1); 4911 4912 // fold (fp_round (fp_extend x)) -> x 4913 if (N0.getOpcode() == ISD::FP_EXTEND && VT == N0.getOperand(0).getValueType()) 4914 return N0.getOperand(0); 4915 4916 // fold (fp_round (fp_round x)) -> (fp_round x) 4917 if (N0.getOpcode() == ISD::FP_ROUND) { 4918 // This is a value preserving truncation if both round's are. 4919 bool IsTrunc = N->getConstantOperandVal(1) == 1 && 4920 N0.getNode()->getConstantOperandVal(1) == 1; 4921 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT, N0.getOperand(0), 4922 DAG.getIntPtrConstant(IsTrunc)); 4923 } 4924 4925 // fold (fp_round (copysign X, Y)) -> (copysign (fp_round X), Y) 4926 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.getNode()->hasOneUse()) { 4927 SDValue Tmp = DAG.getNode(ISD::FP_ROUND, N0.getDebugLoc(), VT, 4928 N0.getOperand(0), N1); 4929 AddToWorkList(Tmp.getNode()); 4930 return DAG.getNode(ISD::FCOPYSIGN, N->getDebugLoc(), VT, 4931 Tmp, N0.getOperand(1)); 4932 } 4933 4934 return SDValue(); 4935} 4936 4937SDValue DAGCombiner::visitFP_ROUND_INREG(SDNode *N) { 4938 SDValue N0 = N->getOperand(0); 4939 EVT VT = N->getValueType(0); 4940 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 4941 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4942 4943 // fold (fp_round_inreg c1fp) -> c1fp 4944 if (N0CFP && isTypeLegal(EVT)) { 4945 SDValue Round = DAG.getConstantFP(*N0CFP->getConstantFPValue(), EVT); 4946 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, Round); 4947 } 4948 4949 return SDValue(); 4950} 4951 4952SDValue DAGCombiner::visitFP_EXTEND(SDNode *N) { 4953 SDValue N0 = N->getOperand(0); 4954 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 4955 EVT VT = N->getValueType(0); 4956 4957 // If this is fp_round(fpextend), don't fold it, allow ourselves to be folded. 4958 if (N->hasOneUse() && 4959 N->use_begin()->getOpcode() == ISD::FP_ROUND) 4960 return SDValue(); 4961 4962 // fold (fp_extend c1fp) -> c1fp 4963 if (N0CFP && VT != MVT::ppcf128) 4964 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, N0); 4965 4966 // Turn fp_extend(fp_round(X, 1)) -> x since the fp_round doesn't affect the 4967 // value of X. 4968 if (N0.getOpcode() == ISD::FP_ROUND 4969 && N0.getNode()->getConstantOperandVal(1) == 1) { 4970 SDValue In = N0.getOperand(0); 4971 if (In.getValueType() == VT) return In; 4972 if (VT.bitsLT(In.getValueType())) 4973 return DAG.getNode(ISD::FP_ROUND, N->getDebugLoc(), VT, 4974 In, N0.getOperand(1)); 4975 return DAG.getNode(ISD::FP_EXTEND, N->getDebugLoc(), VT, In); 4976 } 4977 4978 // fold (fpext (load x)) -> (fpext (fptrunc (extload x))) 4979 if (ISD::isNON_EXTLoad(N0.getNode()) && N0.hasOneUse() && 4980 ((!LegalOperations && !cast<LoadSDNode>(N0)->isVolatile()) || 4981 TLI.isLoadExtLegal(ISD::EXTLOAD, N0.getValueType()))) { 4982 LoadSDNode *LN0 = cast<LoadSDNode>(N0); 4983 SDValue ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, N->getDebugLoc(), 4984 LN0->getChain(), 4985 LN0->getBasePtr(), LN0->getPointerInfo(), 4986 N0.getValueType(), 4987 LN0->isVolatile(), LN0->isNonTemporal(), 4988 LN0->getAlignment()); 4989 CombineTo(N, ExtLoad); 4990 CombineTo(N0.getNode(), 4991 DAG.getNode(ISD::FP_ROUND, N0.getDebugLoc(), 4992 N0.getValueType(), ExtLoad, DAG.getIntPtrConstant(1)), 4993 ExtLoad.getValue(1)); 4994 return SDValue(N, 0); // Return N so it doesn't get rechecked! 4995 } 4996 4997 return SDValue(); 4998} 4999 5000SDValue DAGCombiner::visitFNEG(SDNode *N) { 5001 SDValue N0 = N->getOperand(0); 5002 EVT VT = N->getValueType(0); 5003 5004 if (isNegatibleForFree(N0, LegalOperations)) 5005 return GetNegatedExpression(N0, DAG, LegalOperations); 5006 5007 // Transform fneg(bitconvert(x)) -> bitconvert(x^sign) to avoid loading 5008 // constant pool values. 5009 if (N0.getOpcode() == ISD::BIT_CONVERT && 5010 !VT.isVector() && 5011 N0.getNode()->hasOneUse() && 5012 N0.getOperand(0).getValueType().isInteger()) { 5013 SDValue Int = N0.getOperand(0); 5014 EVT IntVT = Int.getValueType(); 5015 if (IntVT.isInteger() && !IntVT.isVector()) { 5016 Int = DAG.getNode(ISD::XOR, N0.getDebugLoc(), IntVT, Int, 5017 DAG.getConstant(APInt::getSignBit(IntVT.getSizeInBits()), IntVT)); 5018 AddToWorkList(Int.getNode()); 5019 return DAG.getNode(ISD::BIT_CONVERT, N->getDebugLoc(), 5020 VT, Int); 5021 } 5022 } 5023 5024 return SDValue(); 5025} 5026 5027SDValue DAGCombiner::visitFABS(SDNode *N) { 5028 SDValue N0 = N->getOperand(0); 5029 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 5030 EVT VT = N->getValueType(0); 5031 5032 // fold (fabs c1) -> fabs(c1) 5033 if (N0CFP && VT != MVT::ppcf128) 5034 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0); 5035 // fold (fabs (fabs x)) -> (fabs x) 5036 if (N0.getOpcode() == ISD::FABS) 5037 return N->getOperand(0); 5038 // fold (fabs (fneg x)) -> (fabs x) 5039 // fold (fabs (fcopysign x, y)) -> (fabs x) 5040 if (N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FCOPYSIGN) 5041 return DAG.getNode(ISD::FABS, N->getDebugLoc(), VT, N0.getOperand(0)); 5042 5043 // Transform fabs(bitconvert(x)) -> bitconvert(x&~sign) to avoid loading 5044 // constant pool values. 5045 if (N0.getOpcode() == ISD::BIT_CONVERT && N0.getNode()->hasOneUse() && 5046 N0.getOperand(0).getValueType().isInteger() && 5047 !N0.getOperand(0).getValueType().isVector()) { 5048 SDValue Int = N0.getOperand(0); 5049 EVT IntVT = Int.getValueType(); 5050 if (IntVT.isInteger() && !IntVT.isVector()) { 5051 Int = DAG.getNode(ISD::AND, N0.getDebugLoc(), IntVT, Int, 5052 DAG.getConstant(~APInt::getSignBit(IntVT.getSizeInBits()), IntVT)); 5053 AddToWorkList(Int.getNode()); 5054 return DAG.getNode(ISD::BIT_CONVERT, N->getDebugLoc(), 5055 N->getValueType(0), Int); 5056 } 5057 } 5058 5059 return SDValue(); 5060} 5061 5062SDValue DAGCombiner::visitBRCOND(SDNode *N) { 5063 SDValue Chain = N->getOperand(0); 5064 SDValue N1 = N->getOperand(1); 5065 SDValue N2 = N->getOperand(2); 5066 5067 // If N is a constant we could fold this into a fallthrough or unconditional 5068 // branch. However that doesn't happen very often in normal code, because 5069 // Instcombine/SimplifyCFG should have handled the available opportunities. 5070 // If we did this folding here, it would be necessary to update the 5071 // MachineBasicBlock CFG, which is awkward. 5072 5073 // fold a brcond with a setcc condition into a BR_CC node if BR_CC is legal 5074 // on the target. 5075 if (N1.getOpcode() == ISD::SETCC && 5076 TLI.isOperationLegalOrCustom(ISD::BR_CC, MVT::Other)) { 5077 return DAG.getNode(ISD::BR_CC, N->getDebugLoc(), MVT::Other, 5078 Chain, N1.getOperand(2), 5079 N1.getOperand(0), N1.getOperand(1), N2); 5080 } 5081 5082 SDNode *Trunc = 0; 5083 if (N1.getOpcode() == ISD::TRUNCATE && N1.hasOneUse()) { 5084 // Look past truncate. 5085 Trunc = N1.getNode(); 5086 N1 = N1.getOperand(0); 5087 } 5088 5089 if (N1.hasOneUse() && N1.getOpcode() == ISD::SRL) { 5090 // Match this pattern so that we can generate simpler code: 5091 // 5092 // %a = ... 5093 // %b = and i32 %a, 2 5094 // %c = srl i32 %b, 1 5095 // brcond i32 %c ... 5096 // 5097 // into 5098 // 5099 // %a = ... 5100 // %b = and i32 %a, 2 5101 // %c = setcc eq %b, 0 5102 // brcond %c ... 5103 // 5104 // This applies only when the AND constant value has one bit set and the 5105 // SRL constant is equal to the log2 of the AND constant. The back-end is 5106 // smart enough to convert the result into a TEST/JMP sequence. 5107 SDValue Op0 = N1.getOperand(0); 5108 SDValue Op1 = N1.getOperand(1); 5109 5110 if (Op0.getOpcode() == ISD::AND && 5111 Op1.getOpcode() == ISD::Constant) { 5112 SDValue AndOp1 = Op0.getOperand(1); 5113 5114 if (AndOp1.getOpcode() == ISD::Constant) { 5115 const APInt &AndConst = cast<ConstantSDNode>(AndOp1)->getAPIntValue(); 5116 5117 if (AndConst.isPowerOf2() && 5118 cast<ConstantSDNode>(Op1)->getAPIntValue()==AndConst.logBase2()) { 5119 SDValue SetCC = 5120 DAG.getSetCC(N->getDebugLoc(), 5121 TLI.getSetCCResultType(Op0.getValueType()), 5122 Op0, DAG.getConstant(0, Op0.getValueType()), 5123 ISD::SETNE); 5124 5125 SDValue NewBRCond = DAG.getNode(ISD::BRCOND, N->getDebugLoc(), 5126 MVT::Other, Chain, SetCC, N2); 5127 // Don't add the new BRCond into the worklist or else SimplifySelectCC 5128 // will convert it back to (X & C1) >> C2. 5129 CombineTo(N, NewBRCond, false); 5130 // Truncate is dead. 5131 if (Trunc) { 5132 removeFromWorkList(Trunc); 5133 DAG.DeleteNode(Trunc); 5134 } 5135 // Replace the uses of SRL with SETCC 5136 WorkListRemover DeadNodes(*this); 5137 DAG.ReplaceAllUsesOfValueWith(N1, SetCC, &DeadNodes); 5138 removeFromWorkList(N1.getNode()); 5139 DAG.DeleteNode(N1.getNode()); 5140 return SDValue(N, 0); // Return N so it doesn't get rechecked! 5141 } 5142 } 5143 } 5144 } 5145 5146 // Transform br(xor(x, y)) -> br(x != y) 5147 // Transform br(xor(xor(x,y), 1)) -> br (x == y) 5148 if (N1.hasOneUse() && N1.getOpcode() == ISD::XOR) { 5149 SDNode *TheXor = N1.getNode(); 5150 SDValue Op0 = TheXor->getOperand(0); 5151 SDValue Op1 = TheXor->getOperand(1); 5152 if (Op0.getOpcode() == Op1.getOpcode()) { 5153 // Avoid missing important xor optimizations. 5154 SDValue Tmp = visitXOR(TheXor); 5155 if (Tmp.getNode() && Tmp.getNode() != TheXor) { 5156 DEBUG(dbgs() << "\nReplacing.8 "; 5157 TheXor->dump(&DAG); 5158 dbgs() << "\nWith: "; 5159 Tmp.getNode()->dump(&DAG); 5160 dbgs() << '\n'); 5161 WorkListRemover DeadNodes(*this); 5162 DAG.ReplaceAllUsesOfValueWith(N1, Tmp, &DeadNodes); 5163 removeFromWorkList(TheXor); 5164 DAG.DeleteNode(TheXor); 5165 return DAG.getNode(ISD::BRCOND, N->getDebugLoc(), 5166 MVT::Other, Chain, Tmp, N2); 5167 } 5168 } 5169 5170 if (Op0.getOpcode() != ISD::SETCC && Op1.getOpcode() != ISD::SETCC) { 5171 bool Equal = false; 5172 if (ConstantSDNode *RHSCI = dyn_cast<ConstantSDNode>(Op0)) 5173 if (RHSCI->getAPIntValue() == 1 && Op0.hasOneUse() && 5174 Op0.getOpcode() == ISD::XOR) { 5175 TheXor = Op0.getNode(); 5176 Equal = true; 5177 } 5178 5179 SDValue NodeToReplace = Trunc ? SDValue(Trunc, 0) : N1; 5180 5181 EVT SetCCVT = NodeToReplace.getValueType(); 5182 if (LegalTypes) 5183 SetCCVT = TLI.getSetCCResultType(SetCCVT); 5184 SDValue SetCC = DAG.getSetCC(TheXor->getDebugLoc(), 5185 SetCCVT, 5186 Op0, Op1, 5187 Equal ? ISD::SETEQ : ISD::SETNE); 5188 // Replace the uses of XOR with SETCC 5189 WorkListRemover DeadNodes(*this); 5190 DAG.ReplaceAllUsesOfValueWith(NodeToReplace, SetCC, &DeadNodes); 5191 removeFromWorkList(NodeToReplace.getNode()); 5192 DAG.DeleteNode(NodeToReplace.getNode()); 5193 return DAG.getNode(ISD::BRCOND, N->getDebugLoc(), 5194 MVT::Other, Chain, SetCC, N2); 5195 } 5196 } 5197 5198 return SDValue(); 5199} 5200 5201// Operand List for BR_CC: Chain, CondCC, CondLHS, CondRHS, DestBB. 5202// 5203SDValue DAGCombiner::visitBR_CC(SDNode *N) { 5204 CondCodeSDNode *CC = cast<CondCodeSDNode>(N->getOperand(1)); 5205 SDValue CondLHS = N->getOperand(2), CondRHS = N->getOperand(3); 5206 5207 // If N is a constant we could fold this into a fallthrough or unconditional 5208 // branch. However that doesn't happen very often in normal code, because 5209 // Instcombine/SimplifyCFG should have handled the available opportunities. 5210 // If we did this folding here, it would be necessary to update the 5211 // MachineBasicBlock CFG, which is awkward. 5212 5213 // Use SimplifySetCC to simplify SETCC's. 5214 SDValue Simp = SimplifySetCC(TLI.getSetCCResultType(CondLHS.getValueType()), 5215 CondLHS, CondRHS, CC->get(), N->getDebugLoc(), 5216 false); 5217 if (Simp.getNode()) AddToWorkList(Simp.getNode()); 5218 5219 // fold to a simpler setcc 5220 if (Simp.getNode() && Simp.getOpcode() == ISD::SETCC) 5221 return DAG.getNode(ISD::BR_CC, N->getDebugLoc(), MVT::Other, 5222 N->getOperand(0), Simp.getOperand(2), 5223 Simp.getOperand(0), Simp.getOperand(1), 5224 N->getOperand(4)); 5225 5226 return SDValue(); 5227} 5228 5229/// CombineToPreIndexedLoadStore - Try turning a load / store into a 5230/// pre-indexed load / store when the base pointer is an add or subtract 5231/// and it has other uses besides the load / store. After the 5232/// transformation, the new indexed load / store has effectively folded 5233/// the add / subtract in and all of its other uses are redirected to the 5234/// new load / store. 5235bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) { 5236 if (!LegalOperations) 5237 return false; 5238 5239 bool isLoad = true; 5240 SDValue Ptr; 5241 EVT VT; 5242 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 5243 if (LD->isIndexed()) 5244 return false; 5245 VT = LD->getMemoryVT(); 5246 if (!TLI.isIndexedLoadLegal(ISD::PRE_INC, VT) && 5247 !TLI.isIndexedLoadLegal(ISD::PRE_DEC, VT)) 5248 return false; 5249 Ptr = LD->getBasePtr(); 5250 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 5251 if (ST->isIndexed()) 5252 return false; 5253 VT = ST->getMemoryVT(); 5254 if (!TLI.isIndexedStoreLegal(ISD::PRE_INC, VT) && 5255 !TLI.isIndexedStoreLegal(ISD::PRE_DEC, VT)) 5256 return false; 5257 Ptr = ST->getBasePtr(); 5258 isLoad = false; 5259 } else { 5260 return false; 5261 } 5262 5263 // If the pointer is not an add/sub, or if it doesn't have multiple uses, bail 5264 // out. There is no reason to make this a preinc/predec. 5265 if ((Ptr.getOpcode() != ISD::ADD && Ptr.getOpcode() != ISD::SUB) || 5266 Ptr.getNode()->hasOneUse()) 5267 return false; 5268 5269 // Ask the target to do addressing mode selection. 5270 SDValue BasePtr; 5271 SDValue Offset; 5272 ISD::MemIndexedMode AM = ISD::UNINDEXED; 5273 if (!TLI.getPreIndexedAddressParts(N, BasePtr, Offset, AM, DAG)) 5274 return false; 5275 // Don't create a indexed load / store with zero offset. 5276 if (isa<ConstantSDNode>(Offset) && 5277 cast<ConstantSDNode>(Offset)->isNullValue()) 5278 return false; 5279 5280 // Try turning it into a pre-indexed load / store except when: 5281 // 1) The new base ptr is a frame index. 5282 // 2) If N is a store and the new base ptr is either the same as or is a 5283 // predecessor of the value being stored. 5284 // 3) Another use of old base ptr is a predecessor of N. If ptr is folded 5285 // that would create a cycle. 5286 // 4) All uses are load / store ops that use it as old base ptr. 5287 5288 // Check #1. Preinc'ing a frame index would require copying the stack pointer 5289 // (plus the implicit offset) to a register to preinc anyway. 5290 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr)) 5291 return false; 5292 5293 // Check #2. 5294 if (!isLoad) { 5295 SDValue Val = cast<StoreSDNode>(N)->getValue(); 5296 if (Val == BasePtr || BasePtr.getNode()->isPredecessorOf(Val.getNode())) 5297 return false; 5298 } 5299 5300 // Now check for #3 and #4. 5301 bool RealUse = false; 5302 for (SDNode::use_iterator I = Ptr.getNode()->use_begin(), 5303 E = Ptr.getNode()->use_end(); I != E; ++I) { 5304 SDNode *Use = *I; 5305 if (Use == N) 5306 continue; 5307 if (Use->isPredecessorOf(N)) 5308 return false; 5309 5310 if (!((Use->getOpcode() == ISD::LOAD && 5311 cast<LoadSDNode>(Use)->getBasePtr() == Ptr) || 5312 (Use->getOpcode() == ISD::STORE && 5313 cast<StoreSDNode>(Use)->getBasePtr() == Ptr))) 5314 RealUse = true; 5315 } 5316 5317 if (!RealUse) 5318 return false; 5319 5320 SDValue Result; 5321 if (isLoad) 5322 Result = DAG.getIndexedLoad(SDValue(N,0), N->getDebugLoc(), 5323 BasePtr, Offset, AM); 5324 else 5325 Result = DAG.getIndexedStore(SDValue(N,0), N->getDebugLoc(), 5326 BasePtr, Offset, AM); 5327 ++PreIndexedNodes; 5328 ++NodesCombined; 5329 DEBUG(dbgs() << "\nReplacing.4 "; 5330 N->dump(&DAG); 5331 dbgs() << "\nWith: "; 5332 Result.getNode()->dump(&DAG); 5333 dbgs() << '\n'); 5334 WorkListRemover DeadNodes(*this); 5335 if (isLoad) { 5336 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0), 5337 &DeadNodes); 5338 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2), 5339 &DeadNodes); 5340 } else { 5341 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1), 5342 &DeadNodes); 5343 } 5344 5345 // Finally, since the node is now dead, remove it from the graph. 5346 DAG.DeleteNode(N); 5347 5348 // Replace the uses of Ptr with uses of the updated base value. 5349 DAG.ReplaceAllUsesOfValueWith(Ptr, Result.getValue(isLoad ? 1 : 0), 5350 &DeadNodes); 5351 removeFromWorkList(Ptr.getNode()); 5352 DAG.DeleteNode(Ptr.getNode()); 5353 5354 return true; 5355} 5356 5357/// CombineToPostIndexedLoadStore - Try to combine a load / store with a 5358/// add / sub of the base pointer node into a post-indexed load / store. 5359/// The transformation folded the add / subtract into the new indexed 5360/// load / store effectively and all of its uses are redirected to the 5361/// new load / store. 5362bool DAGCombiner::CombineToPostIndexedLoadStore(SDNode *N) { 5363 if (!LegalOperations) 5364 return false; 5365 5366 bool isLoad = true; 5367 SDValue Ptr; 5368 EVT VT; 5369 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 5370 if (LD->isIndexed()) 5371 return false; 5372 VT = LD->getMemoryVT(); 5373 if (!TLI.isIndexedLoadLegal(ISD::POST_INC, VT) && 5374 !TLI.isIndexedLoadLegal(ISD::POST_DEC, VT)) 5375 return false; 5376 Ptr = LD->getBasePtr(); 5377 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 5378 if (ST->isIndexed()) 5379 return false; 5380 VT = ST->getMemoryVT(); 5381 if (!TLI.isIndexedStoreLegal(ISD::POST_INC, VT) && 5382 !TLI.isIndexedStoreLegal(ISD::POST_DEC, VT)) 5383 return false; 5384 Ptr = ST->getBasePtr(); 5385 isLoad = false; 5386 } else { 5387 return false; 5388 } 5389 5390 if (Ptr.getNode()->hasOneUse()) 5391 return false; 5392 5393 for (SDNode::use_iterator I = Ptr.getNode()->use_begin(), 5394 E = Ptr.getNode()->use_end(); I != E; ++I) { 5395 SDNode *Op = *I; 5396 if (Op == N || 5397 (Op->getOpcode() != ISD::ADD && Op->getOpcode() != ISD::SUB)) 5398 continue; 5399 5400 SDValue BasePtr; 5401 SDValue Offset; 5402 ISD::MemIndexedMode AM = ISD::UNINDEXED; 5403 if (TLI.getPostIndexedAddressParts(N, Op, BasePtr, Offset, AM, DAG)) { 5404 // Don't create a indexed load / store with zero offset. 5405 if (isa<ConstantSDNode>(Offset) && 5406 cast<ConstantSDNode>(Offset)->isNullValue()) 5407 continue; 5408 5409 // Try turning it into a post-indexed load / store except when 5410 // 1) All uses are load / store ops that use it as base ptr. 5411 // 2) Op must be independent of N, i.e. Op is neither a predecessor 5412 // nor a successor of N. Otherwise, if Op is folded that would 5413 // create a cycle. 5414 5415 if (isa<FrameIndexSDNode>(BasePtr) || isa<RegisterSDNode>(BasePtr)) 5416 continue; 5417 5418 // Check for #1. 5419 bool TryNext = false; 5420 for (SDNode::use_iterator II = BasePtr.getNode()->use_begin(), 5421 EE = BasePtr.getNode()->use_end(); II != EE; ++II) { 5422 SDNode *Use = *II; 5423 if (Use == Ptr.getNode()) 5424 continue; 5425 5426 // If all the uses are load / store addresses, then don't do the 5427 // transformation. 5428 if (Use->getOpcode() == ISD::ADD || Use->getOpcode() == ISD::SUB){ 5429 bool RealUse = false; 5430 for (SDNode::use_iterator III = Use->use_begin(), 5431 EEE = Use->use_end(); III != EEE; ++III) { 5432 SDNode *UseUse = *III; 5433 if (!((UseUse->getOpcode() == ISD::LOAD && 5434 cast<LoadSDNode>(UseUse)->getBasePtr().getNode() == Use) || 5435 (UseUse->getOpcode() == ISD::STORE && 5436 cast<StoreSDNode>(UseUse)->getBasePtr().getNode() == Use))) 5437 RealUse = true; 5438 } 5439 5440 if (!RealUse) { 5441 TryNext = true; 5442 break; 5443 } 5444 } 5445 } 5446 5447 if (TryNext) 5448 continue; 5449 5450 // Check for #2 5451 if (!Op->isPredecessorOf(N) && !N->isPredecessorOf(Op)) { 5452 SDValue Result = isLoad 5453 ? DAG.getIndexedLoad(SDValue(N,0), N->getDebugLoc(), 5454 BasePtr, Offset, AM) 5455 : DAG.getIndexedStore(SDValue(N,0), N->getDebugLoc(), 5456 BasePtr, Offset, AM); 5457 ++PostIndexedNodes; 5458 ++NodesCombined; 5459 DEBUG(dbgs() << "\nReplacing.5 "; 5460 N->dump(&DAG); 5461 dbgs() << "\nWith: "; 5462 Result.getNode()->dump(&DAG); 5463 dbgs() << '\n'); 5464 WorkListRemover DeadNodes(*this); 5465 if (isLoad) { 5466 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0), 5467 &DeadNodes); 5468 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Result.getValue(2), 5469 &DeadNodes); 5470 } else { 5471 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(1), 5472 &DeadNodes); 5473 } 5474 5475 // Finally, since the node is now dead, remove it from the graph. 5476 DAG.DeleteNode(N); 5477 5478 // Replace the uses of Use with uses of the updated base value. 5479 DAG.ReplaceAllUsesOfValueWith(SDValue(Op, 0), 5480 Result.getValue(isLoad ? 1 : 0), 5481 &DeadNodes); 5482 removeFromWorkList(Op); 5483 DAG.DeleteNode(Op); 5484 return true; 5485 } 5486 } 5487 } 5488 5489 return false; 5490} 5491 5492SDValue DAGCombiner::visitLOAD(SDNode *N) { 5493 LoadSDNode *LD = cast<LoadSDNode>(N); 5494 SDValue Chain = LD->getChain(); 5495 SDValue Ptr = LD->getBasePtr(); 5496 5497 // If load is not volatile and there are no uses of the loaded value (and 5498 // the updated indexed value in case of indexed loads), change uses of the 5499 // chain value into uses of the chain input (i.e. delete the dead load). 5500 if (!LD->isVolatile()) { 5501 if (N->getValueType(1) == MVT::Other) { 5502 // Unindexed loads. 5503 if (N->hasNUsesOfValue(0, 0)) { 5504 // It's not safe to use the two value CombineTo variant here. e.g. 5505 // v1, chain2 = load chain1, loc 5506 // v2, chain3 = load chain2, loc 5507 // v3 = add v2, c 5508 // Now we replace use of chain2 with chain1. This makes the second load 5509 // isomorphic to the one we are deleting, and thus makes this load live. 5510 DEBUG(dbgs() << "\nReplacing.6 "; 5511 N->dump(&DAG); 5512 dbgs() << "\nWith chain: "; 5513 Chain.getNode()->dump(&DAG); 5514 dbgs() << "\n"); 5515 WorkListRemover DeadNodes(*this); 5516 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain, &DeadNodes); 5517 5518 if (N->use_empty()) { 5519 removeFromWorkList(N); 5520 DAG.DeleteNode(N); 5521 } 5522 5523 return SDValue(N, 0); // Return N so it doesn't get rechecked! 5524 } 5525 } else { 5526 // Indexed loads. 5527 assert(N->getValueType(2) == MVT::Other && "Malformed indexed loads?"); 5528 if (N->hasNUsesOfValue(0, 0) && N->hasNUsesOfValue(0, 1)) { 5529 SDValue Undef = DAG.getUNDEF(N->getValueType(0)); 5530 DEBUG(dbgs() << "\nReplacing.7 "; 5531 N->dump(&DAG); 5532 dbgs() << "\nWith: "; 5533 Undef.getNode()->dump(&DAG); 5534 dbgs() << " and 2 other values\n"); 5535 WorkListRemover DeadNodes(*this); 5536 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Undef, &DeadNodes); 5537 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), 5538 DAG.getUNDEF(N->getValueType(1)), 5539 &DeadNodes); 5540 DAG.ReplaceAllUsesOfValueWith(SDValue(N, 2), Chain, &DeadNodes); 5541 removeFromWorkList(N); 5542 DAG.DeleteNode(N); 5543 return SDValue(N, 0); // Return N so it doesn't get rechecked! 5544 } 5545 } 5546 } 5547 5548 // If this load is directly stored, replace the load value with the stored 5549 // value. 5550 // TODO: Handle store large -> read small portion. 5551 // TODO: Handle TRUNCSTORE/LOADEXT 5552 if (LD->getExtensionType() == ISD::NON_EXTLOAD && 5553 !LD->isVolatile()) { 5554 if (ISD::isNON_TRUNCStore(Chain.getNode())) { 5555 StoreSDNode *PrevST = cast<StoreSDNode>(Chain); 5556 if (PrevST->getBasePtr() == Ptr && 5557 PrevST->getValue().getValueType() == N->getValueType(0)) 5558 return CombineTo(N, Chain.getOperand(1), Chain); 5559 } 5560 } 5561 5562 // Try to infer better alignment information than the load already has. 5563 if (OptLevel != CodeGenOpt::None && LD->isUnindexed()) { 5564 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) { 5565 if (Align > LD->getAlignment()) 5566 return DAG.getExtLoad(LD->getExtensionType(), LD->getValueType(0), 5567 N->getDebugLoc(), 5568 Chain, Ptr, LD->getPointerInfo(), 5569 LD->getMemoryVT(), 5570 LD->isVolatile(), LD->isNonTemporal(), Align); 5571 } 5572 } 5573 5574 if (CombinerAA) { 5575 // Walk up chain skipping non-aliasing memory nodes. 5576 SDValue BetterChain = FindBetterChain(N, Chain); 5577 5578 // If there is a better chain. 5579 if (Chain != BetterChain) { 5580 SDValue ReplLoad; 5581 5582 // Replace the chain to void dependency. 5583 if (LD->getExtensionType() == ISD::NON_EXTLOAD) { 5584 ReplLoad = DAG.getLoad(N->getValueType(0), LD->getDebugLoc(), 5585 BetterChain, Ptr, LD->getPointerInfo(), 5586 LD->isVolatile(), LD->isNonTemporal(), 5587 LD->getAlignment()); 5588 } else { 5589 ReplLoad = DAG.getExtLoad(LD->getExtensionType(), LD->getValueType(0), 5590 LD->getDebugLoc(), 5591 BetterChain, Ptr, LD->getPointerInfo(), 5592 LD->getMemoryVT(), 5593 LD->isVolatile(), 5594 LD->isNonTemporal(), 5595 LD->getAlignment()); 5596 } 5597 5598 // Create token factor to keep old chain connected. 5599 SDValue Token = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), 5600 MVT::Other, Chain, ReplLoad.getValue(1)); 5601 5602 // Make sure the new and old chains are cleaned up. 5603 AddToWorkList(Token.getNode()); 5604 5605 // Replace uses with load result and token factor. Don't add users 5606 // to work list. 5607 return CombineTo(N, ReplLoad.getValue(0), Token, false); 5608 } 5609 } 5610 5611 // Try transforming N to an indexed load. 5612 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N)) 5613 return SDValue(N, 0); 5614 5615 return SDValue(); 5616} 5617 5618/// CheckForMaskedLoad - Check to see if V is (and load (ptr), imm), where the 5619/// load is having specific bytes cleared out. If so, return the byte size 5620/// being masked out and the shift amount. 5621static std::pair<unsigned, unsigned> 5622CheckForMaskedLoad(SDValue V, SDValue Ptr, SDValue Chain) { 5623 std::pair<unsigned, unsigned> Result(0, 0); 5624 5625 // Check for the structure we're looking for. 5626 if (V->getOpcode() != ISD::AND || 5627 !isa<ConstantSDNode>(V->getOperand(1)) || 5628 !ISD::isNormalLoad(V->getOperand(0).getNode())) 5629 return Result; 5630 5631 // Check the chain and pointer. 5632 LoadSDNode *LD = cast<LoadSDNode>(V->getOperand(0)); 5633 if (LD->getBasePtr() != Ptr) return Result; // Not from same pointer. 5634 5635 // The store should be chained directly to the load or be an operand of a 5636 // tokenfactor. 5637 if (LD == Chain.getNode()) 5638 ; // ok. 5639 else if (Chain->getOpcode() != ISD::TokenFactor) 5640 return Result; // Fail. 5641 else { 5642 bool isOk = false; 5643 for (unsigned i = 0, e = Chain->getNumOperands(); i != e; ++i) 5644 if (Chain->getOperand(i).getNode() == LD) { 5645 isOk = true; 5646 break; 5647 } 5648 if (!isOk) return Result; 5649 } 5650 5651 // This only handles simple types. 5652 if (V.getValueType() != MVT::i16 && 5653 V.getValueType() != MVT::i32 && 5654 V.getValueType() != MVT::i64) 5655 return Result; 5656 5657 // Check the constant mask. Invert it so that the bits being masked out are 5658 // 0 and the bits being kept are 1. Use getSExtValue so that leading bits 5659 // follow the sign bit for uniformity. 5660 uint64_t NotMask = ~cast<ConstantSDNode>(V->getOperand(1))->getSExtValue(); 5661 unsigned NotMaskLZ = CountLeadingZeros_64(NotMask); 5662 if (NotMaskLZ & 7) return Result; // Must be multiple of a byte. 5663 unsigned NotMaskTZ = CountTrailingZeros_64(NotMask); 5664 if (NotMaskTZ & 7) return Result; // Must be multiple of a byte. 5665 if (NotMaskLZ == 64) return Result; // All zero mask. 5666 5667 // See if we have a continuous run of bits. If so, we have 0*1+0* 5668 if (CountTrailingOnes_64(NotMask >> NotMaskTZ)+NotMaskTZ+NotMaskLZ != 64) 5669 return Result; 5670 5671 // Adjust NotMaskLZ down to be from the actual size of the int instead of i64. 5672 if (V.getValueType() != MVT::i64 && NotMaskLZ) 5673 NotMaskLZ -= 64-V.getValueSizeInBits(); 5674 5675 unsigned MaskedBytes = (V.getValueSizeInBits()-NotMaskLZ-NotMaskTZ)/8; 5676 switch (MaskedBytes) { 5677 case 1: 5678 case 2: 5679 case 4: break; 5680 default: return Result; // All one mask, or 5-byte mask. 5681 } 5682 5683 // Verify that the first bit starts at a multiple of mask so that the access 5684 // is aligned the same as the access width. 5685 if (NotMaskTZ && NotMaskTZ/8 % MaskedBytes) return Result; 5686 5687 Result.first = MaskedBytes; 5688 Result.second = NotMaskTZ/8; 5689 return Result; 5690} 5691 5692 5693/// ShrinkLoadReplaceStoreWithStore - Check to see if IVal is something that 5694/// provides a value as specified by MaskInfo. If so, replace the specified 5695/// store with a narrower store of truncated IVal. 5696static SDNode * 5697ShrinkLoadReplaceStoreWithStore(const std::pair<unsigned, unsigned> &MaskInfo, 5698 SDValue IVal, StoreSDNode *St, 5699 DAGCombiner *DC) { 5700 unsigned NumBytes = MaskInfo.first; 5701 unsigned ByteShift = MaskInfo.second; 5702 SelectionDAG &DAG = DC->getDAG(); 5703 5704 // Check to see if IVal is all zeros in the part being masked in by the 'or' 5705 // that uses this. If not, this is not a replacement. 5706 APInt Mask = ~APInt::getBitsSet(IVal.getValueSizeInBits(), 5707 ByteShift*8, (ByteShift+NumBytes)*8); 5708 if (!DAG.MaskedValueIsZero(IVal, Mask)) return 0; 5709 5710 // Check that it is legal on the target to do this. It is legal if the new 5711 // VT we're shrinking to (i8/i16/i32) is legal or we're still before type 5712 // legalization. 5713 MVT VT = MVT::getIntegerVT(NumBytes*8); 5714 if (!DC->isTypeLegal(VT)) 5715 return 0; 5716 5717 // Okay, we can do this! Replace the 'St' store with a store of IVal that is 5718 // shifted by ByteShift and truncated down to NumBytes. 5719 if (ByteShift) 5720 IVal = DAG.getNode(ISD::SRL, IVal->getDebugLoc(), IVal.getValueType(), IVal, 5721 DAG.getConstant(ByteShift*8, DC->getShiftAmountTy())); 5722 5723 // Figure out the offset for the store and the alignment of the access. 5724 unsigned StOffset; 5725 unsigned NewAlign = St->getAlignment(); 5726 5727 if (DAG.getTargetLoweringInfo().isLittleEndian()) 5728 StOffset = ByteShift; 5729 else 5730 StOffset = IVal.getValueType().getStoreSize() - ByteShift - NumBytes; 5731 5732 SDValue Ptr = St->getBasePtr(); 5733 if (StOffset) { 5734 Ptr = DAG.getNode(ISD::ADD, IVal->getDebugLoc(), Ptr.getValueType(), 5735 Ptr, DAG.getConstant(StOffset, Ptr.getValueType())); 5736 NewAlign = MinAlign(NewAlign, StOffset); 5737 } 5738 5739 // Truncate down to the new size. 5740 IVal = DAG.getNode(ISD::TRUNCATE, IVal->getDebugLoc(), VT, IVal); 5741 5742 ++OpsNarrowed; 5743 return DAG.getStore(St->getChain(), St->getDebugLoc(), IVal, Ptr, 5744 St->getSrcValue(), St->getSrcValueOffset()+StOffset, 5745 false, false, NewAlign).getNode(); 5746} 5747 5748 5749/// ReduceLoadOpStoreWidth - Look for sequence of load / op / store where op is 5750/// one of 'or', 'xor', and 'and' of immediates. If 'op' is only touching some 5751/// of the loaded bits, try narrowing the load and store if it would end up 5752/// being a win for performance or code size. 5753SDValue DAGCombiner::ReduceLoadOpStoreWidth(SDNode *N) { 5754 StoreSDNode *ST = cast<StoreSDNode>(N); 5755 if (ST->isVolatile()) 5756 return SDValue(); 5757 5758 SDValue Chain = ST->getChain(); 5759 SDValue Value = ST->getValue(); 5760 SDValue Ptr = ST->getBasePtr(); 5761 EVT VT = Value.getValueType(); 5762 5763 if (ST->isTruncatingStore() || VT.isVector() || !Value.hasOneUse()) 5764 return SDValue(); 5765 5766 unsigned Opc = Value.getOpcode(); 5767 5768 // If this is "store (or X, Y), P" and X is "(and (load P), cst)", where cst 5769 // is a byte mask indicating a consecutive number of bytes, check to see if 5770 // Y is known to provide just those bytes. If so, we try to replace the 5771 // load + replace + store sequence with a single (narrower) store, which makes 5772 // the load dead. 5773 if (Opc == ISD::OR) { 5774 std::pair<unsigned, unsigned> MaskedLoad; 5775 MaskedLoad = CheckForMaskedLoad(Value.getOperand(0), Ptr, Chain); 5776 if (MaskedLoad.first) 5777 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad, 5778 Value.getOperand(1), ST,this)) 5779 return SDValue(NewST, 0); 5780 5781 // Or is commutative, so try swapping X and Y. 5782 MaskedLoad = CheckForMaskedLoad(Value.getOperand(1), Ptr, Chain); 5783 if (MaskedLoad.first) 5784 if (SDNode *NewST = ShrinkLoadReplaceStoreWithStore(MaskedLoad, 5785 Value.getOperand(0), ST,this)) 5786 return SDValue(NewST, 0); 5787 } 5788 5789 if ((Opc != ISD::OR && Opc != ISD::XOR && Opc != ISD::AND) || 5790 Value.getOperand(1).getOpcode() != ISD::Constant) 5791 return SDValue(); 5792 5793 SDValue N0 = Value.getOperand(0); 5794 if (ISD::isNormalLoad(N0.getNode()) && N0.hasOneUse() && 5795 Chain == SDValue(N0.getNode(), 1)) { 5796 LoadSDNode *LD = cast<LoadSDNode>(N0); 5797 if (LD->getBasePtr() != Ptr || 5798 LD->getPointerInfo().getAddrSpace() != 5799 ST->getPointerInfo().getAddrSpace()) 5800 return SDValue(); 5801 5802 // Find the type to narrow it the load / op / store to. 5803 SDValue N1 = Value.getOperand(1); 5804 unsigned BitWidth = N1.getValueSizeInBits(); 5805 APInt Imm = cast<ConstantSDNode>(N1)->getAPIntValue(); 5806 if (Opc == ISD::AND) 5807 Imm ^= APInt::getAllOnesValue(BitWidth); 5808 if (Imm == 0 || Imm.isAllOnesValue()) 5809 return SDValue(); 5810 unsigned ShAmt = Imm.countTrailingZeros(); 5811 unsigned MSB = BitWidth - Imm.countLeadingZeros() - 1; 5812 unsigned NewBW = NextPowerOf2(MSB - ShAmt); 5813 EVT NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW); 5814 while (NewBW < BitWidth && 5815 !(TLI.isOperationLegalOrCustom(Opc, NewVT) && 5816 TLI.isNarrowingProfitable(VT, NewVT))) { 5817 NewBW = NextPowerOf2(NewBW); 5818 NewVT = EVT::getIntegerVT(*DAG.getContext(), NewBW); 5819 } 5820 if (NewBW >= BitWidth) 5821 return SDValue(); 5822 5823 // If the lsb changed does not start at the type bitwidth boundary, 5824 // start at the previous one. 5825 if (ShAmt % NewBW) 5826 ShAmt = (((ShAmt + NewBW - 1) / NewBW) * NewBW) - NewBW; 5827 APInt Mask = APInt::getBitsSet(BitWidth, ShAmt, ShAmt + NewBW); 5828 if ((Imm & Mask) == Imm) { 5829 APInt NewImm = (Imm & Mask).lshr(ShAmt).trunc(NewBW); 5830 if (Opc == ISD::AND) 5831 NewImm ^= APInt::getAllOnesValue(NewBW); 5832 uint64_t PtrOff = ShAmt / 8; 5833 // For big endian targets, we need to adjust the offset to the pointer to 5834 // load the correct bytes. 5835 if (TLI.isBigEndian()) 5836 PtrOff = (BitWidth + 7 - NewBW) / 8 - PtrOff; 5837 5838 unsigned NewAlign = MinAlign(LD->getAlignment(), PtrOff); 5839 const Type *NewVTTy = NewVT.getTypeForEVT(*DAG.getContext()); 5840 if (NewAlign < TLI.getTargetData()->getABITypeAlignment(NewVTTy)) 5841 return SDValue(); 5842 5843 SDValue NewPtr = DAG.getNode(ISD::ADD, LD->getDebugLoc(), 5844 Ptr.getValueType(), Ptr, 5845 DAG.getConstant(PtrOff, Ptr.getValueType())); 5846 SDValue NewLD = DAG.getLoad(NewVT, N0.getDebugLoc(), 5847 LD->getChain(), NewPtr, 5848 LD->getPointerInfo().getWithOffset(PtrOff), 5849 LD->isVolatile(), LD->isNonTemporal(), 5850 NewAlign); 5851 SDValue NewVal = DAG.getNode(Opc, Value.getDebugLoc(), NewVT, NewLD, 5852 DAG.getConstant(NewImm, NewVT)); 5853 SDValue NewST = DAG.getStore(Chain, N->getDebugLoc(), 5854 NewVal, NewPtr, 5855 ST->getPointerInfo().getWithOffset(PtrOff), 5856 false, false, NewAlign); 5857 5858 AddToWorkList(NewPtr.getNode()); 5859 AddToWorkList(NewLD.getNode()); 5860 AddToWorkList(NewVal.getNode()); 5861 WorkListRemover DeadNodes(*this); 5862 DAG.ReplaceAllUsesOfValueWith(N0.getValue(1), NewLD.getValue(1), 5863 &DeadNodes); 5864 ++OpsNarrowed; 5865 return NewST; 5866 } 5867 } 5868 5869 return SDValue(); 5870} 5871 5872SDValue DAGCombiner::visitSTORE(SDNode *N) { 5873 StoreSDNode *ST = cast<StoreSDNode>(N); 5874 SDValue Chain = ST->getChain(); 5875 SDValue Value = ST->getValue(); 5876 SDValue Ptr = ST->getBasePtr(); 5877 5878 // If this is a store of a bit convert, store the input value if the 5879 // resultant store does not need a higher alignment than the original. 5880 if (Value.getOpcode() == ISD::BIT_CONVERT && !ST->isTruncatingStore() && 5881 ST->isUnindexed()) { 5882 unsigned OrigAlign = ST->getAlignment(); 5883 EVT SVT = Value.getOperand(0).getValueType(); 5884 unsigned Align = TLI.getTargetData()-> 5885 getABITypeAlignment(SVT.getTypeForEVT(*DAG.getContext())); 5886 if (Align <= OrigAlign && 5887 ((!LegalOperations && !ST->isVolatile()) || 5888 TLI.isOperationLegalOrCustom(ISD::STORE, SVT))) 5889 return DAG.getStore(Chain, N->getDebugLoc(), Value.getOperand(0), 5890 Ptr, ST->getSrcValue(), 5891 ST->getSrcValueOffset(), ST->isVolatile(), 5892 ST->isNonTemporal(), OrigAlign); 5893 } 5894 5895 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr' 5896 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(Value)) { 5897 // NOTE: If the original store is volatile, this transform must not increase 5898 // the number of stores. For example, on x86-32 an f64 can be stored in one 5899 // processor operation but an i64 (which is not legal) requires two. So the 5900 // transform should not be done in this case. 5901 if (Value.getOpcode() != ISD::TargetConstantFP) { 5902 SDValue Tmp; 5903 switch (CFP->getValueType(0).getSimpleVT().SimpleTy) { 5904 default: llvm_unreachable("Unknown FP type"); 5905 case MVT::f80: // We don't do this for these yet. 5906 case MVT::f128: 5907 case MVT::ppcf128: 5908 break; 5909 case MVT::f32: 5910 if ((isTypeLegal(MVT::i32) && !LegalOperations && !ST->isVolatile()) || 5911 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) { 5912 Tmp = DAG.getConstant((uint32_t)CFP->getValueAPF(). 5913 bitcastToAPInt().getZExtValue(), MVT::i32); 5914 return DAG.getStore(Chain, N->getDebugLoc(), Tmp, 5915 Ptr, ST->getSrcValue(), 5916 ST->getSrcValueOffset(), ST->isVolatile(), 5917 ST->isNonTemporal(), ST->getAlignment()); 5918 } 5919 break; 5920 case MVT::f64: 5921 if ((TLI.isTypeLegal(MVT::i64) && !LegalOperations && 5922 !ST->isVolatile()) || 5923 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i64)) { 5924 Tmp = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt(). 5925 getZExtValue(), MVT::i64); 5926 return DAG.getStore(Chain, N->getDebugLoc(), Tmp, 5927 Ptr, ST->getSrcValue(), 5928 ST->getSrcValueOffset(), ST->isVolatile(), 5929 ST->isNonTemporal(), ST->getAlignment()); 5930 } else if (!ST->isVolatile() && 5931 TLI.isOperationLegalOrCustom(ISD::STORE, MVT::i32)) { 5932 // Many FP stores are not made apparent until after legalize, e.g. for 5933 // argument passing. Since this is so common, custom legalize the 5934 // 64-bit integer store into two 32-bit stores. 5935 uint64_t Val = CFP->getValueAPF().bitcastToAPInt().getZExtValue(); 5936 SDValue Lo = DAG.getConstant(Val & 0xFFFFFFFF, MVT::i32); 5937 SDValue Hi = DAG.getConstant(Val >> 32, MVT::i32); 5938 if (TLI.isBigEndian()) std::swap(Lo, Hi); 5939 5940 int SVOffset = ST->getSrcValueOffset(); 5941 unsigned Alignment = ST->getAlignment(); 5942 bool isVolatile = ST->isVolatile(); 5943 bool isNonTemporal = ST->isNonTemporal(); 5944 5945 SDValue St0 = DAG.getStore(Chain, ST->getDebugLoc(), Lo, 5946 Ptr, ST->getSrcValue(), 5947 ST->getSrcValueOffset(), 5948 isVolatile, isNonTemporal, 5949 ST->getAlignment()); 5950 Ptr = DAG.getNode(ISD::ADD, N->getDebugLoc(), Ptr.getValueType(), Ptr, 5951 DAG.getConstant(4, Ptr.getValueType())); 5952 SVOffset += 4; 5953 Alignment = MinAlign(Alignment, 4U); 5954 SDValue St1 = DAG.getStore(Chain, ST->getDebugLoc(), Hi, 5955 Ptr, ST->getSrcValue(), 5956 SVOffset, isVolatile, isNonTemporal, 5957 Alignment); 5958 return DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), MVT::Other, 5959 St0, St1); 5960 } 5961 5962 break; 5963 } 5964 } 5965 } 5966 5967 // Try to infer better alignment information than the store already has. 5968 if (OptLevel != CodeGenOpt::None && ST->isUnindexed()) { 5969 if (unsigned Align = DAG.InferPtrAlignment(Ptr)) { 5970 if (Align > ST->getAlignment()) 5971 return DAG.getTruncStore(Chain, N->getDebugLoc(), Value, 5972 Ptr, ST->getSrcValue(), 5973 ST->getSrcValueOffset(), ST->getMemoryVT(), 5974 ST->isVolatile(), ST->isNonTemporal(), Align); 5975 } 5976 } 5977 5978 if (CombinerAA) { 5979 // Walk up chain skipping non-aliasing memory nodes. 5980 SDValue BetterChain = FindBetterChain(N, Chain); 5981 5982 // If there is a better chain. 5983 if (Chain != BetterChain) { 5984 SDValue ReplStore; 5985 5986 // Replace the chain to avoid dependency. 5987 if (ST->isTruncatingStore()) { 5988 ReplStore = DAG.getTruncStore(BetterChain, N->getDebugLoc(), Value, Ptr, 5989 ST->getSrcValue(),ST->getSrcValueOffset(), 5990 ST->getMemoryVT(), ST->isVolatile(), 5991 ST->isNonTemporal(), ST->getAlignment()); 5992 } else { 5993 ReplStore = DAG.getStore(BetterChain, N->getDebugLoc(), Value, Ptr, 5994 ST->getSrcValue(), ST->getSrcValueOffset(), 5995 ST->isVolatile(), ST->isNonTemporal(), 5996 ST->getAlignment()); 5997 } 5998 5999 // Create token to keep both nodes around. 6000 SDValue Token = DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), 6001 MVT::Other, Chain, ReplStore); 6002 6003 // Make sure the new and old chains are cleaned up. 6004 AddToWorkList(Token.getNode()); 6005 6006 // Don't add users to work list. 6007 return CombineTo(N, Token, false); 6008 } 6009 } 6010 6011 // Try transforming N to an indexed store. 6012 if (CombineToPreIndexedLoadStore(N) || CombineToPostIndexedLoadStore(N)) 6013 return SDValue(N, 0); 6014 6015 // FIXME: is there such a thing as a truncating indexed store? 6016 if (ST->isTruncatingStore() && ST->isUnindexed() && 6017 Value.getValueType().isInteger()) { 6018 // See if we can simplify the input to this truncstore with knowledge that 6019 // only the low bits are being used. For example: 6020 // "truncstore (or (shl x, 8), y), i8" -> "truncstore y, i8" 6021 SDValue Shorter = 6022 GetDemandedBits(Value, 6023 APInt::getLowBitsSet(Value.getValueSizeInBits(), 6024 ST->getMemoryVT().getSizeInBits())); 6025 AddToWorkList(Value.getNode()); 6026 if (Shorter.getNode()) 6027 return DAG.getTruncStore(Chain, N->getDebugLoc(), Shorter, 6028 Ptr, ST->getSrcValue(), 6029 ST->getSrcValueOffset(), ST->getMemoryVT(), 6030 ST->isVolatile(), ST->isNonTemporal(), 6031 ST->getAlignment()); 6032 6033 // Otherwise, see if we can simplify the operation with 6034 // SimplifyDemandedBits, which only works if the value has a single use. 6035 if (SimplifyDemandedBits(Value, 6036 APInt::getLowBitsSet( 6037 Value.getValueType().getScalarType().getSizeInBits(), 6038 ST->getMemoryVT().getScalarType().getSizeInBits()))) 6039 return SDValue(N, 0); 6040 } 6041 6042 // If this is a load followed by a store to the same location, then the store 6043 // is dead/noop. 6044 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(Value)) { 6045 if (Ld->getBasePtr() == Ptr && ST->getMemoryVT() == Ld->getMemoryVT() && 6046 ST->isUnindexed() && !ST->isVolatile() && 6047 // There can't be any side effects between the load and store, such as 6048 // a call or store. 6049 Chain.reachesChainWithoutSideEffects(SDValue(Ld, 1))) { 6050 // The store is dead, remove it. 6051 return Chain; 6052 } 6053 } 6054 6055 // If this is an FP_ROUND or TRUNC followed by a store, fold this into a 6056 // truncating store. We can do this even if this is already a truncstore. 6057 if ((Value.getOpcode() == ISD::FP_ROUND || Value.getOpcode() == ISD::TRUNCATE) 6058 && Value.getNode()->hasOneUse() && ST->isUnindexed() && 6059 TLI.isTruncStoreLegal(Value.getOperand(0).getValueType(), 6060 ST->getMemoryVT())) { 6061 return DAG.getTruncStore(Chain, N->getDebugLoc(), Value.getOperand(0), 6062 Ptr, ST->getSrcValue(), 6063 ST->getSrcValueOffset(), ST->getMemoryVT(), 6064 ST->isVolatile(), ST->isNonTemporal(), 6065 ST->getAlignment()); 6066 } 6067 6068 return ReduceLoadOpStoreWidth(N); 6069} 6070 6071SDValue DAGCombiner::visitINSERT_VECTOR_ELT(SDNode *N) { 6072 SDValue InVec = N->getOperand(0); 6073 SDValue InVal = N->getOperand(1); 6074 SDValue EltNo = N->getOperand(2); 6075 6076 // If the inserted element is an UNDEF, just use the input vector. 6077 if (InVal.getOpcode() == ISD::UNDEF) 6078 return InVec; 6079 6080 // If the invec is a BUILD_VECTOR and if EltNo is a constant, build a new 6081 // vector with the inserted element. 6082 if (InVec.getOpcode() == ISD::BUILD_VECTOR && isa<ConstantSDNode>(EltNo)) { 6083 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue(); 6084 SmallVector<SDValue, 8> Ops(InVec.getNode()->op_begin(), 6085 InVec.getNode()->op_end()); 6086 if (Elt < Ops.size()) 6087 Ops[Elt] = InVal; 6088 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), 6089 InVec.getValueType(), &Ops[0], Ops.size()); 6090 } 6091 // If the invec is an UNDEF and if EltNo is a constant, create a new 6092 // BUILD_VECTOR with undef elements and the inserted element. 6093 if (!LegalOperations && InVec.getOpcode() == ISD::UNDEF && 6094 isa<ConstantSDNode>(EltNo)) { 6095 EVT VT = InVec.getValueType(); 6096 EVT EltVT = VT.getVectorElementType(); 6097 unsigned NElts = VT.getVectorNumElements(); 6098 SmallVector<SDValue, 8> Ops(NElts, DAG.getUNDEF(EltVT)); 6099 6100 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue(); 6101 if (Elt < Ops.size()) 6102 Ops[Elt] = InVal; 6103 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), 6104 InVec.getValueType(), &Ops[0], Ops.size()); 6105 } 6106 return SDValue(); 6107} 6108 6109SDValue DAGCombiner::visitEXTRACT_VECTOR_ELT(SDNode *N) { 6110 // (vextract (scalar_to_vector val, 0) -> val 6111 SDValue InVec = N->getOperand(0); 6112 6113 if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR) { 6114 // Check if the result type doesn't match the inserted element type. A 6115 // SCALAR_TO_VECTOR may truncate the inserted element and the 6116 // EXTRACT_VECTOR_ELT may widen the extracted vector. 6117 SDValue InOp = InVec.getOperand(0); 6118 EVT NVT = N->getValueType(0); 6119 if (InOp.getValueType() != NVT) { 6120 assert(InOp.getValueType().isInteger() && NVT.isInteger()); 6121 return DAG.getSExtOrTrunc(InOp, InVec.getDebugLoc(), NVT); 6122 } 6123 return InOp; 6124 } 6125 6126 // Perform only after legalization to ensure build_vector / vector_shuffle 6127 // optimizations have already been done. 6128 if (!LegalOperations) return SDValue(); 6129 6130 // (vextract (v4f32 load $addr), c) -> (f32 load $addr+c*size) 6131 // (vextract (v4f32 s2v (f32 load $addr)), c) -> (f32 load $addr+c*size) 6132 // (vextract (v4f32 shuffle (load $addr), <1,u,u,u>), 0) -> (f32 load $addr) 6133 SDValue EltNo = N->getOperand(1); 6134 6135 if (isa<ConstantSDNode>(EltNo)) { 6136 unsigned Elt = cast<ConstantSDNode>(EltNo)->getZExtValue(); 6137 bool NewLoad = false; 6138 bool BCNumEltsChanged = false; 6139 EVT VT = InVec.getValueType(); 6140 EVT ExtVT = VT.getVectorElementType(); 6141 EVT LVT = ExtVT; 6142 6143 if (InVec.getOpcode() == ISD::BIT_CONVERT) { 6144 EVT BCVT = InVec.getOperand(0).getValueType(); 6145 if (!BCVT.isVector() || ExtVT.bitsGT(BCVT.getVectorElementType())) 6146 return SDValue(); 6147 if (VT.getVectorNumElements() != BCVT.getVectorNumElements()) 6148 BCNumEltsChanged = true; 6149 InVec = InVec.getOperand(0); 6150 ExtVT = BCVT.getVectorElementType(); 6151 NewLoad = true; 6152 } 6153 6154 LoadSDNode *LN0 = NULL; 6155 const ShuffleVectorSDNode *SVN = NULL; 6156 if (ISD::isNormalLoad(InVec.getNode())) { 6157 LN0 = cast<LoadSDNode>(InVec); 6158 } else if (InVec.getOpcode() == ISD::SCALAR_TO_VECTOR && 6159 InVec.getOperand(0).getValueType() == ExtVT && 6160 ISD::isNormalLoad(InVec.getOperand(0).getNode())) { 6161 LN0 = cast<LoadSDNode>(InVec.getOperand(0)); 6162 } else if ((SVN = dyn_cast<ShuffleVectorSDNode>(InVec))) { 6163 // (vextract (vector_shuffle (load $addr), v2, <1, u, u, u>), 1) 6164 // => 6165 // (load $addr+1*size) 6166 6167 // If the bit convert changed the number of elements, it is unsafe 6168 // to examine the mask. 6169 if (BCNumEltsChanged) 6170 return SDValue(); 6171 6172 // Select the input vector, guarding against out of range extract vector. 6173 unsigned NumElems = VT.getVectorNumElements(); 6174 int Idx = (Elt > NumElems) ? -1 : SVN->getMaskElt(Elt); 6175 InVec = (Idx < (int)NumElems) ? InVec.getOperand(0) : InVec.getOperand(1); 6176 6177 if (InVec.getOpcode() == ISD::BIT_CONVERT) 6178 InVec = InVec.getOperand(0); 6179 if (ISD::isNormalLoad(InVec.getNode())) { 6180 LN0 = cast<LoadSDNode>(InVec); 6181 Elt = (Idx < (int)NumElems) ? Idx : Idx - (int)NumElems; 6182 } 6183 } 6184 6185 if (!LN0 || !LN0->hasOneUse() || LN0->isVolatile()) 6186 return SDValue(); 6187 6188 unsigned Align = LN0->getAlignment(); 6189 if (NewLoad) { 6190 // Check the resultant load doesn't need a higher alignment than the 6191 // original load. 6192 unsigned NewAlign = 6193 TLI.getTargetData()->getABITypeAlignment(LVT.getTypeForEVT(*DAG.getContext())); 6194 6195 if (NewAlign > Align || !TLI.isOperationLegalOrCustom(ISD::LOAD, LVT)) 6196 return SDValue(); 6197 6198 Align = NewAlign; 6199 } 6200 6201 SDValue NewPtr = LN0->getBasePtr(); 6202 unsigned PtrOff = 0; 6203 if (Elt) { 6204 PtrOff = LVT.getSizeInBits() * Elt / 8; 6205 EVT PtrType = NewPtr.getValueType(); 6206 if (TLI.isBigEndian()) 6207 PtrOff = VT.getSizeInBits() / 8 - PtrOff; 6208 NewPtr = DAG.getNode(ISD::ADD, N->getDebugLoc(), PtrType, NewPtr, 6209 DAG.getConstant(PtrOff, PtrType)); 6210 } 6211 6212 return DAG.getLoad(LVT, N->getDebugLoc(), LN0->getChain(), NewPtr, 6213 LN0->getPointerInfo().getWithOffset(PtrOff), 6214 LN0->isVolatile(), LN0->isNonTemporal(), Align); 6215 } 6216 6217 return SDValue(); 6218} 6219 6220SDValue DAGCombiner::visitBUILD_VECTOR(SDNode *N) { 6221 unsigned NumInScalars = N->getNumOperands(); 6222 EVT VT = N->getValueType(0); 6223 6224 // Check to see if this is a BUILD_VECTOR of a bunch of EXTRACT_VECTOR_ELT 6225 // operations. If so, and if the EXTRACT_VECTOR_ELT vector inputs come from 6226 // at most two distinct vectors, turn this into a shuffle node. 6227 SDValue VecIn1, VecIn2; 6228 for (unsigned i = 0; i != NumInScalars; ++i) { 6229 // Ignore undef inputs. 6230 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue; 6231 6232 // If this input is something other than a EXTRACT_VECTOR_ELT with a 6233 // constant index, bail out. 6234 if (N->getOperand(i).getOpcode() != ISD::EXTRACT_VECTOR_ELT || 6235 !isa<ConstantSDNode>(N->getOperand(i).getOperand(1))) { 6236 VecIn1 = VecIn2 = SDValue(0, 0); 6237 break; 6238 } 6239 6240 // If the input vector type disagrees with the result of the build_vector, 6241 // we can't make a shuffle. 6242 SDValue ExtractedFromVec = N->getOperand(i).getOperand(0); 6243 if (ExtractedFromVec.getValueType() != VT) { 6244 VecIn1 = VecIn2 = SDValue(0, 0); 6245 break; 6246 } 6247 6248 // Otherwise, remember this. We allow up to two distinct input vectors. 6249 if (ExtractedFromVec == VecIn1 || ExtractedFromVec == VecIn2) 6250 continue; 6251 6252 if (VecIn1.getNode() == 0) { 6253 VecIn1 = ExtractedFromVec; 6254 } else if (VecIn2.getNode() == 0) { 6255 VecIn2 = ExtractedFromVec; 6256 } else { 6257 // Too many inputs. 6258 VecIn1 = VecIn2 = SDValue(0, 0); 6259 break; 6260 } 6261 } 6262 6263 // If everything is good, we can make a shuffle operation. 6264 if (VecIn1.getNode()) { 6265 SmallVector<int, 8> Mask; 6266 for (unsigned i = 0; i != NumInScalars; ++i) { 6267 if (N->getOperand(i).getOpcode() == ISD::UNDEF) { 6268 Mask.push_back(-1); 6269 continue; 6270 } 6271 6272 // If extracting from the first vector, just use the index directly. 6273 SDValue Extract = N->getOperand(i); 6274 SDValue ExtVal = Extract.getOperand(1); 6275 if (Extract.getOperand(0) == VecIn1) { 6276 unsigned ExtIndex = cast<ConstantSDNode>(ExtVal)->getZExtValue(); 6277 if (ExtIndex > VT.getVectorNumElements()) 6278 return SDValue(); 6279 6280 Mask.push_back(ExtIndex); 6281 continue; 6282 } 6283 6284 // Otherwise, use InIdx + VecSize 6285 unsigned Idx = cast<ConstantSDNode>(ExtVal)->getZExtValue(); 6286 Mask.push_back(Idx+NumInScalars); 6287 } 6288 6289 // Add count and size info. 6290 if (!isTypeLegal(VT)) 6291 return SDValue(); 6292 6293 // Return the new VECTOR_SHUFFLE node. 6294 SDValue Ops[2]; 6295 Ops[0] = VecIn1; 6296 Ops[1] = VecIn2.getNode() ? VecIn2 : DAG.getUNDEF(VT); 6297 return DAG.getVectorShuffle(VT, N->getDebugLoc(), Ops[0], Ops[1], &Mask[0]); 6298 } 6299 6300 return SDValue(); 6301} 6302 6303SDValue DAGCombiner::visitCONCAT_VECTORS(SDNode *N) { 6304 // TODO: Check to see if this is a CONCAT_VECTORS of a bunch of 6305 // EXTRACT_SUBVECTOR operations. If so, and if the EXTRACT_SUBVECTOR vector 6306 // inputs come from at most two distinct vectors, turn this into a shuffle 6307 // node. 6308 6309 // If we only have one input vector, we don't need to do any concatenation. 6310 if (N->getNumOperands() == 1) 6311 return N->getOperand(0); 6312 6313 return SDValue(); 6314} 6315 6316SDValue DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) { 6317 EVT VT = N->getValueType(0); 6318 unsigned NumElts = VT.getVectorNumElements(); 6319 6320 SDValue N0 = N->getOperand(0); 6321 6322 assert(N0.getValueType().getVectorNumElements() == NumElts && 6323 "Vector shuffle must be normalized in DAG"); 6324 6325 // FIXME: implement canonicalizations from DAG.getVectorShuffle() 6326 6327 // If it is a splat, check if the argument vector is a build_vector with 6328 // all scalar elements the same. 6329 if (cast<ShuffleVectorSDNode>(N)->isSplat()) { 6330 SDNode *V = N0.getNode(); 6331 6332 // If this is a bit convert that changes the element type of the vector but 6333 // not the number of vector elements, look through it. Be careful not to 6334 // look though conversions that change things like v4f32 to v2f64. 6335 if (V->getOpcode() == ISD::BIT_CONVERT) { 6336 SDValue ConvInput = V->getOperand(0); 6337 if (ConvInput.getValueType().isVector() && 6338 ConvInput.getValueType().getVectorNumElements() == NumElts) 6339 V = ConvInput.getNode(); 6340 } 6341 6342 if (V->getOpcode() == ISD::BUILD_VECTOR) { 6343 unsigned NumElems = V->getNumOperands(); 6344 unsigned BaseIdx = cast<ShuffleVectorSDNode>(N)->getSplatIndex(); 6345 if (NumElems > BaseIdx) { 6346 SDValue Base; 6347 bool AllSame = true; 6348 for (unsigned i = 0; i != NumElems; ++i) { 6349 if (V->getOperand(i).getOpcode() != ISD::UNDEF) { 6350 Base = V->getOperand(i); 6351 break; 6352 } 6353 } 6354 // Splat of <u, u, u, u>, return <u, u, u, u> 6355 if (!Base.getNode()) 6356 return N0; 6357 for (unsigned i = 0; i != NumElems; ++i) { 6358 if (V->getOperand(i) != Base) { 6359 AllSame = false; 6360 break; 6361 } 6362 } 6363 // Splat of <x, x, x, x>, return <x, x, x, x> 6364 if (AllSame) 6365 return N0; 6366 } 6367 } 6368 } 6369 return SDValue(); 6370} 6371 6372SDValue DAGCombiner::visitMEMBARRIER(SDNode* N) { 6373 if (!TLI.getShouldFoldAtomicFences()) 6374 return SDValue(); 6375 6376 SDValue atomic = N->getOperand(0); 6377 switch (atomic.getOpcode()) { 6378 case ISD::ATOMIC_CMP_SWAP: 6379 case ISD::ATOMIC_SWAP: 6380 case ISD::ATOMIC_LOAD_ADD: 6381 case ISD::ATOMIC_LOAD_SUB: 6382 case ISD::ATOMIC_LOAD_AND: 6383 case ISD::ATOMIC_LOAD_OR: 6384 case ISD::ATOMIC_LOAD_XOR: 6385 case ISD::ATOMIC_LOAD_NAND: 6386 case ISD::ATOMIC_LOAD_MIN: 6387 case ISD::ATOMIC_LOAD_MAX: 6388 case ISD::ATOMIC_LOAD_UMIN: 6389 case ISD::ATOMIC_LOAD_UMAX: 6390 break; 6391 default: 6392 return SDValue(); 6393 } 6394 6395 SDValue fence = atomic.getOperand(0); 6396 if (fence.getOpcode() != ISD::MEMBARRIER) 6397 return SDValue(); 6398 6399 switch (atomic.getOpcode()) { 6400 case ISD::ATOMIC_CMP_SWAP: 6401 return SDValue(DAG.UpdateNodeOperands(atomic.getNode(), 6402 fence.getOperand(0), 6403 atomic.getOperand(1), atomic.getOperand(2), 6404 atomic.getOperand(3)), atomic.getResNo()); 6405 case ISD::ATOMIC_SWAP: 6406 case ISD::ATOMIC_LOAD_ADD: 6407 case ISD::ATOMIC_LOAD_SUB: 6408 case ISD::ATOMIC_LOAD_AND: 6409 case ISD::ATOMIC_LOAD_OR: 6410 case ISD::ATOMIC_LOAD_XOR: 6411 case ISD::ATOMIC_LOAD_NAND: 6412 case ISD::ATOMIC_LOAD_MIN: 6413 case ISD::ATOMIC_LOAD_MAX: 6414 case ISD::ATOMIC_LOAD_UMIN: 6415 case ISD::ATOMIC_LOAD_UMAX: 6416 return SDValue(DAG.UpdateNodeOperands(atomic.getNode(), 6417 fence.getOperand(0), 6418 atomic.getOperand(1), atomic.getOperand(2)), 6419 atomic.getResNo()); 6420 default: 6421 return SDValue(); 6422 } 6423} 6424 6425/// XformToShuffleWithZero - Returns a vector_shuffle if it able to transform 6426/// an AND to a vector_shuffle with the destination vector and a zero vector. 6427/// e.g. AND V, <0xffffffff, 0, 0xffffffff, 0>. ==> 6428/// vector_shuffle V, Zero, <0, 4, 2, 4> 6429SDValue DAGCombiner::XformToShuffleWithZero(SDNode *N) { 6430 EVT VT = N->getValueType(0); 6431 DebugLoc dl = N->getDebugLoc(); 6432 SDValue LHS = N->getOperand(0); 6433 SDValue RHS = N->getOperand(1); 6434 if (N->getOpcode() == ISD::AND) { 6435 if (RHS.getOpcode() == ISD::BIT_CONVERT) 6436 RHS = RHS.getOperand(0); 6437 if (RHS.getOpcode() == ISD::BUILD_VECTOR) { 6438 SmallVector<int, 8> Indices; 6439 unsigned NumElts = RHS.getNumOperands(); 6440 for (unsigned i = 0; i != NumElts; ++i) { 6441 SDValue Elt = RHS.getOperand(i); 6442 if (!isa<ConstantSDNode>(Elt)) 6443 return SDValue(); 6444 else if (cast<ConstantSDNode>(Elt)->isAllOnesValue()) 6445 Indices.push_back(i); 6446 else if (cast<ConstantSDNode>(Elt)->isNullValue()) 6447 Indices.push_back(NumElts); 6448 else 6449 return SDValue(); 6450 } 6451 6452 // Let's see if the target supports this vector_shuffle. 6453 EVT RVT = RHS.getValueType(); 6454 if (!TLI.isVectorClearMaskLegal(Indices, RVT)) 6455 return SDValue(); 6456 6457 // Return the new VECTOR_SHUFFLE node. 6458 EVT EltVT = RVT.getVectorElementType(); 6459 SmallVector<SDValue,8> ZeroOps(RVT.getVectorNumElements(), 6460 DAG.getConstant(0, EltVT)); 6461 SDValue Zero = DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), 6462 RVT, &ZeroOps[0], ZeroOps.size()); 6463 LHS = DAG.getNode(ISD::BIT_CONVERT, dl, RVT, LHS); 6464 SDValue Shuf = DAG.getVectorShuffle(RVT, dl, LHS, Zero, &Indices[0]); 6465 return DAG.getNode(ISD::BIT_CONVERT, dl, VT, Shuf); 6466 } 6467 } 6468 6469 return SDValue(); 6470} 6471 6472/// SimplifyVBinOp - Visit a binary vector operation, like ADD. 6473SDValue DAGCombiner::SimplifyVBinOp(SDNode *N) { 6474 // After legalize, the target may be depending on adds and other 6475 // binary ops to provide legal ways to construct constants or other 6476 // things. Simplifying them may result in a loss of legality. 6477 if (LegalOperations) return SDValue(); 6478 6479 EVT VT = N->getValueType(0); 6480 assert(VT.isVector() && "SimplifyVBinOp only works on vectors!"); 6481 6482 EVT EltType = VT.getVectorElementType(); 6483 SDValue LHS = N->getOperand(0); 6484 SDValue RHS = N->getOperand(1); 6485 SDValue Shuffle = XformToShuffleWithZero(N); 6486 if (Shuffle.getNode()) return Shuffle; 6487 6488 // If the LHS and RHS are BUILD_VECTOR nodes, see if we can constant fold 6489 // this operation. 6490 if (LHS.getOpcode() == ISD::BUILD_VECTOR && 6491 RHS.getOpcode() == ISD::BUILD_VECTOR) { 6492 SmallVector<SDValue, 8> Ops; 6493 for (unsigned i = 0, e = LHS.getNumOperands(); i != e; ++i) { 6494 SDValue LHSOp = LHS.getOperand(i); 6495 SDValue RHSOp = RHS.getOperand(i); 6496 // If these two elements can't be folded, bail out. 6497 if ((LHSOp.getOpcode() != ISD::UNDEF && 6498 LHSOp.getOpcode() != ISD::Constant && 6499 LHSOp.getOpcode() != ISD::ConstantFP) || 6500 (RHSOp.getOpcode() != ISD::UNDEF && 6501 RHSOp.getOpcode() != ISD::Constant && 6502 RHSOp.getOpcode() != ISD::ConstantFP)) 6503 break; 6504 6505 // Can't fold divide by zero. 6506 if (N->getOpcode() == ISD::SDIV || N->getOpcode() == ISD::UDIV || 6507 N->getOpcode() == ISD::FDIV) { 6508 if ((RHSOp.getOpcode() == ISD::Constant && 6509 cast<ConstantSDNode>(RHSOp.getNode())->isNullValue()) || 6510 (RHSOp.getOpcode() == ISD::ConstantFP && 6511 cast<ConstantFPSDNode>(RHSOp.getNode())->getValueAPF().isZero())) 6512 break; 6513 } 6514 6515 // If the vector element type is not legal, the BUILD_VECTOR operands 6516 // are promoted and implicitly truncated. Make that explicit here. 6517 if (LHSOp.getValueType() != EltType) 6518 LHSOp = DAG.getNode(ISD::TRUNCATE, LHS.getDebugLoc(), EltType, LHSOp); 6519 if (RHSOp.getValueType() != EltType) 6520 RHSOp = DAG.getNode(ISD::TRUNCATE, RHS.getDebugLoc(), EltType, RHSOp); 6521 6522 SDValue FoldOp = DAG.getNode(N->getOpcode(), LHS.getDebugLoc(), EltType, 6523 LHSOp, RHSOp); 6524 if (FoldOp.getOpcode() != ISD::UNDEF && 6525 FoldOp.getOpcode() != ISD::Constant && 6526 FoldOp.getOpcode() != ISD::ConstantFP) 6527 break; 6528 Ops.push_back(FoldOp); 6529 AddToWorkList(FoldOp.getNode()); 6530 } 6531 6532 if (Ops.size() == LHS.getNumOperands()) { 6533 EVT VT = LHS.getValueType(); 6534 return DAG.getNode(ISD::BUILD_VECTOR, N->getDebugLoc(), VT, 6535 &Ops[0], Ops.size()); 6536 } 6537 } 6538 6539 return SDValue(); 6540} 6541 6542SDValue DAGCombiner::SimplifySelect(DebugLoc DL, SDValue N0, 6543 SDValue N1, SDValue N2){ 6544 assert(N0.getOpcode() ==ISD::SETCC && "First argument must be a SetCC node!"); 6545 6546 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2, 6547 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 6548 6549 // If we got a simplified select_cc node back from SimplifySelectCC, then 6550 // break it down into a new SETCC node, and a new SELECT node, and then return 6551 // the SELECT node, since we were called with a SELECT node. 6552 if (SCC.getNode()) { 6553 // Check to see if we got a select_cc back (to turn into setcc/select). 6554 // Otherwise, just return whatever node we got back, like fabs. 6555 if (SCC.getOpcode() == ISD::SELECT_CC) { 6556 SDValue SETCC = DAG.getNode(ISD::SETCC, N0.getDebugLoc(), 6557 N0.getValueType(), 6558 SCC.getOperand(0), SCC.getOperand(1), 6559 SCC.getOperand(4)); 6560 AddToWorkList(SETCC.getNode()); 6561 return DAG.getNode(ISD::SELECT, SCC.getDebugLoc(), SCC.getValueType(), 6562 SCC.getOperand(2), SCC.getOperand(3), SETCC); 6563 } 6564 6565 return SCC; 6566 } 6567 return SDValue(); 6568} 6569 6570/// SimplifySelectOps - Given a SELECT or a SELECT_CC node, where LHS and RHS 6571/// are the two values being selected between, see if we can simplify the 6572/// select. Callers of this should assume that TheSelect is deleted if this 6573/// returns true. As such, they should return the appropriate thing (e.g. the 6574/// node) back to the top-level of the DAG combiner loop to avoid it being 6575/// looked at. 6576bool DAGCombiner::SimplifySelectOps(SDNode *TheSelect, SDValue LHS, 6577 SDValue RHS) { 6578 6579 // If this is a select from two identical things, try to pull the operation 6580 // through the select. 6581 if (LHS.getOpcode() != RHS.getOpcode() || 6582 !LHS.hasOneUse() || !RHS.hasOneUse()) 6583 return false; 6584 6585 // If this is a load and the token chain is identical, replace the select 6586 // of two loads with a load through a select of the address to load from. 6587 // This triggers in things like "select bool X, 10.0, 123.0" after the FP 6588 // constants have been dropped into the constant pool. 6589 if (LHS.getOpcode() == ISD::LOAD) { 6590 LoadSDNode *LLD = cast<LoadSDNode>(LHS); 6591 LoadSDNode *RLD = cast<LoadSDNode>(RHS); 6592 6593 // Token chains must be identical. 6594 if (LHS.getOperand(0) != RHS.getOperand(0) || 6595 // Do not let this transformation reduce the number of volatile loads. 6596 LLD->isVolatile() || RLD->isVolatile() || 6597 // If this is an EXTLOAD, the VT's must match. 6598 LLD->getMemoryVT() != RLD->getMemoryVT() || 6599 // FIXME: this discards src value information. This is 6600 // over-conservative. It would be beneficial to be able to remember 6601 // both potential memory locations. Since we are discarding 6602 // src value info, don't do the transformation if the memory 6603 // locations are not in the default address space. 6604 LLD->getPointerInfo().getAddrSpace() != 0 || 6605 RLD->getPointerInfo().getAddrSpace() != 0) 6606 return false; 6607 6608 // Check that the select condition doesn't reach either load. If so, 6609 // folding this will induce a cycle into the DAG. If not, this is safe to 6610 // xform, so create a select of the addresses. 6611 SDValue Addr; 6612 if (TheSelect->getOpcode() == ISD::SELECT) { 6613 SDNode *CondNode = TheSelect->getOperand(0).getNode(); 6614 if ((LLD->hasAnyUseOfValue(1) && LLD->isPredecessorOf(CondNode)) || 6615 (RLD->hasAnyUseOfValue(1) && RLD->isPredecessorOf(CondNode))) 6616 return false; 6617 Addr = DAG.getNode(ISD::SELECT, TheSelect->getDebugLoc(), 6618 LLD->getBasePtr().getValueType(), 6619 TheSelect->getOperand(0), LLD->getBasePtr(), 6620 RLD->getBasePtr()); 6621 } else { // Otherwise SELECT_CC 6622 SDNode *CondLHS = TheSelect->getOperand(0).getNode(); 6623 SDNode *CondRHS = TheSelect->getOperand(1).getNode(); 6624 6625 if ((LLD->hasAnyUseOfValue(1) && 6626 (LLD->isPredecessorOf(CondLHS) || LLD->isPredecessorOf(CondRHS))) || 6627 (LLD->hasAnyUseOfValue(1) && 6628 (LLD->isPredecessorOf(CondLHS) || LLD->isPredecessorOf(CondRHS)))) 6629 return false; 6630 6631 Addr = DAG.getNode(ISD::SELECT_CC, TheSelect->getDebugLoc(), 6632 LLD->getBasePtr().getValueType(), 6633 TheSelect->getOperand(0), 6634 TheSelect->getOperand(1), 6635 LLD->getBasePtr(), RLD->getBasePtr(), 6636 TheSelect->getOperand(4)); 6637 } 6638 6639 SDValue Load; 6640 if (LLD->getExtensionType() == ISD::NON_EXTLOAD) { 6641 Load = DAG.getLoad(TheSelect->getValueType(0), 6642 TheSelect->getDebugLoc(), 6643 // FIXME: Discards pointer info. 6644 LLD->getChain(), Addr, MachinePointerInfo(), 6645 LLD->isVolatile(), LLD->isNonTemporal(), 6646 LLD->getAlignment()); 6647 } else { 6648 Load = DAG.getExtLoad(LLD->getExtensionType(), 6649 TheSelect->getValueType(0), 6650 TheSelect->getDebugLoc(), 6651 // FIXME: Discards pointer info. 6652 LLD->getChain(), Addr, MachinePointerInfo(), 6653 LLD->getMemoryVT(), LLD->isVolatile(), 6654 LLD->isNonTemporal(), LLD->getAlignment()); 6655 } 6656 6657 // Users of the select now use the result of the load. 6658 CombineTo(TheSelect, Load); 6659 6660 // Users of the old loads now use the new load's chain. We know the 6661 // old-load value is dead now. 6662 CombineTo(LHS.getNode(), Load.getValue(0), Load.getValue(1)); 6663 CombineTo(RHS.getNode(), Load.getValue(0), Load.getValue(1)); 6664 return true; 6665 } 6666 6667 return false; 6668} 6669 6670/// SimplifySelectCC - Simplify an expression of the form (N0 cond N1) ? N2 : N3 6671/// where 'cond' is the comparison specified by CC. 6672SDValue DAGCombiner::SimplifySelectCC(DebugLoc DL, SDValue N0, SDValue N1, 6673 SDValue N2, SDValue N3, 6674 ISD::CondCode CC, bool NotExtCompare) { 6675 // (x ? y : y) -> y. 6676 if (N2 == N3) return N2; 6677 6678 EVT VT = N2.getValueType(); 6679 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode()); 6680 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode()); 6681 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.getNode()); 6682 6683 // Determine if the condition we're dealing with is constant 6684 SDValue SCC = SimplifySetCC(TLI.getSetCCResultType(N0.getValueType()), 6685 N0, N1, CC, DL, false); 6686 if (SCC.getNode()) AddToWorkList(SCC.getNode()); 6687 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.getNode()); 6688 6689 // fold select_cc true, x, y -> x 6690 if (SCCC && !SCCC->isNullValue()) 6691 return N2; 6692 // fold select_cc false, x, y -> y 6693 if (SCCC && SCCC->isNullValue()) 6694 return N3; 6695 6696 // Check to see if we can simplify the select into an fabs node 6697 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1)) { 6698 // Allow either -0.0 or 0.0 6699 if (CFP->getValueAPF().isZero()) { 6700 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs 6701 if ((CC == ISD::SETGE || CC == ISD::SETGT) && 6702 N0 == N2 && N3.getOpcode() == ISD::FNEG && 6703 N2 == N3.getOperand(0)) 6704 return DAG.getNode(ISD::FABS, DL, VT, N0); 6705 6706 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs 6707 if ((CC == ISD::SETLT || CC == ISD::SETLE) && 6708 N0 == N3 && N2.getOpcode() == ISD::FNEG && 6709 N2.getOperand(0) == N3) 6710 return DAG.getNode(ISD::FABS, DL, VT, N3); 6711 } 6712 } 6713 6714 // Turn "(a cond b) ? 1.0f : 2.0f" into "load (tmp + ((a cond b) ? 0 : 4)" 6715 // where "tmp" is a constant pool entry containing an array with 1.0 and 2.0 6716 // in it. This is a win when the constant is not otherwise available because 6717 // it replaces two constant pool loads with one. We only do this if the FP 6718 // type is known to be legal, because if it isn't, then we are before legalize 6719 // types an we want the other legalization to happen first (e.g. to avoid 6720 // messing with soft float) and if the ConstantFP is not legal, because if 6721 // it is legal, we may not need to store the FP constant in a constant pool. 6722 if (ConstantFPSDNode *TV = dyn_cast<ConstantFPSDNode>(N2)) 6723 if (ConstantFPSDNode *FV = dyn_cast<ConstantFPSDNode>(N3)) { 6724 if (TLI.isTypeLegal(N2.getValueType()) && 6725 (TLI.getOperationAction(ISD::ConstantFP, N2.getValueType()) != 6726 TargetLowering::Legal) && 6727 // If both constants have multiple uses, then we won't need to do an 6728 // extra load, they are likely around in registers for other users. 6729 (TV->hasOneUse() || FV->hasOneUse())) { 6730 Constant *Elts[] = { 6731 const_cast<ConstantFP*>(FV->getConstantFPValue()), 6732 const_cast<ConstantFP*>(TV->getConstantFPValue()) 6733 }; 6734 const Type *FPTy = Elts[0]->getType(); 6735 const TargetData &TD = *TLI.getTargetData(); 6736 6737 // Create a ConstantArray of the two constants. 6738 Constant *CA = ConstantArray::get(ArrayType::get(FPTy, 2), Elts, 2); 6739 SDValue CPIdx = DAG.getConstantPool(CA, TLI.getPointerTy(), 6740 TD.getPrefTypeAlignment(FPTy)); 6741 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment(); 6742 6743 // Get the offsets to the 0 and 1 element of the array so that we can 6744 // select between them. 6745 SDValue Zero = DAG.getIntPtrConstant(0); 6746 unsigned EltSize = (unsigned)TD.getTypeAllocSize(Elts[0]->getType()); 6747 SDValue One = DAG.getIntPtrConstant(EltSize); 6748 6749 SDValue Cond = DAG.getSetCC(DL, 6750 TLI.getSetCCResultType(N0.getValueType()), 6751 N0, N1, CC); 6752 SDValue CstOffset = DAG.getNode(ISD::SELECT, DL, Zero.getValueType(), 6753 Cond, One, Zero); 6754 CPIdx = DAG.getNode(ISD::ADD, DL, TLI.getPointerTy(), CPIdx, 6755 CstOffset); 6756 return DAG.getLoad(TV->getValueType(0), DL, DAG.getEntryNode(), CPIdx, 6757 MachinePointerInfo::getConstantPool(), false, 6758 false, Alignment); 6759 6760 } 6761 } 6762 6763 // Check to see if we can perform the "gzip trick", transforming 6764 // (select_cc setlt X, 0, A, 0) -> (and (sra X, (sub size(X), 1), A) 6765 if (N1C && N3C && N3C->isNullValue() && CC == ISD::SETLT && 6766 N0.getValueType().isInteger() && 6767 N2.getValueType().isInteger() && 6768 (N1C->isNullValue() || // (a < 0) ? b : 0 6769 (N1C->getAPIntValue() == 1 && N0 == N2))) { // (a < 1) ? a : 0 6770 EVT XType = N0.getValueType(); 6771 EVT AType = N2.getValueType(); 6772 if (XType.bitsGE(AType)) { 6773 // and (sra X, size(X)-1, A) -> "and (srl X, C2), A" iff A is a 6774 // single-bit constant. 6775 if (N2C && ((N2C->getAPIntValue() & (N2C->getAPIntValue()-1)) == 0)) { 6776 unsigned ShCtV = N2C->getAPIntValue().logBase2(); 6777 ShCtV = XType.getSizeInBits()-ShCtV-1; 6778 SDValue ShCt = DAG.getConstant(ShCtV, getShiftAmountTy()); 6779 SDValue Shift = DAG.getNode(ISD::SRL, N0.getDebugLoc(), 6780 XType, N0, ShCt); 6781 AddToWorkList(Shift.getNode()); 6782 6783 if (XType.bitsGT(AType)) { 6784 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift); 6785 AddToWorkList(Shift.getNode()); 6786 } 6787 6788 return DAG.getNode(ISD::AND, DL, AType, Shift, N2); 6789 } 6790 6791 SDValue Shift = DAG.getNode(ISD::SRA, N0.getDebugLoc(), 6792 XType, N0, 6793 DAG.getConstant(XType.getSizeInBits()-1, 6794 getShiftAmountTy())); 6795 AddToWorkList(Shift.getNode()); 6796 6797 if (XType.bitsGT(AType)) { 6798 Shift = DAG.getNode(ISD::TRUNCATE, DL, AType, Shift); 6799 AddToWorkList(Shift.getNode()); 6800 } 6801 6802 return DAG.getNode(ISD::AND, DL, AType, Shift, N2); 6803 } 6804 } 6805 6806 // fold select C, 16, 0 -> shl C, 4 6807 if (N2C && N3C && N3C->isNullValue() && N2C->getAPIntValue().isPowerOf2() && 6808 TLI.getBooleanContents() == TargetLowering::ZeroOrOneBooleanContent) { 6809 6810 // If the caller doesn't want us to simplify this into a zext of a compare, 6811 // don't do it. 6812 if (NotExtCompare && N2C->getAPIntValue() == 1) 6813 return SDValue(); 6814 6815 // Get a SetCC of the condition 6816 // FIXME: Should probably make sure that setcc is legal if we ever have a 6817 // target where it isn't. 6818 SDValue Temp, SCC; 6819 // cast from setcc result type to select result type 6820 if (LegalTypes) { 6821 SCC = DAG.getSetCC(DL, TLI.getSetCCResultType(N0.getValueType()), 6822 N0, N1, CC); 6823 if (N2.getValueType().bitsLT(SCC.getValueType())) 6824 Temp = DAG.getZeroExtendInReg(SCC, N2.getDebugLoc(), N2.getValueType()); 6825 else 6826 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getDebugLoc(), 6827 N2.getValueType(), SCC); 6828 } else { 6829 SCC = DAG.getSetCC(N0.getDebugLoc(), MVT::i1, N0, N1, CC); 6830 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getDebugLoc(), 6831 N2.getValueType(), SCC); 6832 } 6833 6834 AddToWorkList(SCC.getNode()); 6835 AddToWorkList(Temp.getNode()); 6836 6837 if (N2C->getAPIntValue() == 1) 6838 return Temp; 6839 6840 // shl setcc result by log2 n2c 6841 return DAG.getNode(ISD::SHL, DL, N2.getValueType(), Temp, 6842 DAG.getConstant(N2C->getAPIntValue().logBase2(), 6843 getShiftAmountTy())); 6844 } 6845 6846 // Check to see if this is the equivalent of setcc 6847 // FIXME: Turn all of these into setcc if setcc if setcc is legal 6848 // otherwise, go ahead with the folds. 6849 if (0 && N3C && N3C->isNullValue() && N2C && (N2C->getAPIntValue() == 1ULL)) { 6850 EVT XType = N0.getValueType(); 6851 if (!LegalOperations || 6852 TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultType(XType))) { 6853 SDValue Res = DAG.getSetCC(DL, TLI.getSetCCResultType(XType), N0, N1, CC); 6854 if (Res.getValueType() != VT) 6855 Res = DAG.getNode(ISD::ZERO_EXTEND, DL, VT, Res); 6856 return Res; 6857 } 6858 6859 // fold (seteq X, 0) -> (srl (ctlz X, log2(size(X)))) 6860 if (N1C && N1C->isNullValue() && CC == ISD::SETEQ && 6861 (!LegalOperations || 6862 TLI.isOperationLegal(ISD::CTLZ, XType))) { 6863 SDValue Ctlz = DAG.getNode(ISD::CTLZ, N0.getDebugLoc(), XType, N0); 6864 return DAG.getNode(ISD::SRL, DL, XType, Ctlz, 6865 DAG.getConstant(Log2_32(XType.getSizeInBits()), 6866 getShiftAmountTy())); 6867 } 6868 // fold (setgt X, 0) -> (srl (and (-X, ~X), size(X)-1)) 6869 if (N1C && N1C->isNullValue() && CC == ISD::SETGT) { 6870 SDValue NegN0 = DAG.getNode(ISD::SUB, N0.getDebugLoc(), 6871 XType, DAG.getConstant(0, XType), N0); 6872 SDValue NotN0 = DAG.getNOT(N0.getDebugLoc(), N0, XType); 6873 return DAG.getNode(ISD::SRL, DL, XType, 6874 DAG.getNode(ISD::AND, DL, XType, NegN0, NotN0), 6875 DAG.getConstant(XType.getSizeInBits()-1, 6876 getShiftAmountTy())); 6877 } 6878 // fold (setgt X, -1) -> (xor (srl (X, size(X)-1), 1)) 6879 if (N1C && N1C->isAllOnesValue() && CC == ISD::SETGT) { 6880 SDValue Sign = DAG.getNode(ISD::SRL, N0.getDebugLoc(), XType, N0, 6881 DAG.getConstant(XType.getSizeInBits()-1, 6882 getShiftAmountTy())); 6883 return DAG.getNode(ISD::XOR, DL, XType, Sign, DAG.getConstant(1, XType)); 6884 } 6885 } 6886 6887 // Check to see if this is an integer abs. 6888 // select_cc setg[te] X, 0, X, -X -> 6889 // select_cc setgt X, -1, X, -X -> 6890 // select_cc setl[te] X, 0, -X, X -> 6891 // select_cc setlt X, 1, -X, X -> 6892 // Y = sra (X, size(X)-1); xor (add (X, Y), Y) 6893 if (N1C) { 6894 ConstantSDNode *SubC = NULL; 6895 if (((N1C->isNullValue() && (CC == ISD::SETGT || CC == ISD::SETGE)) || 6896 (N1C->isAllOnesValue() && CC == ISD::SETGT)) && 6897 N0 == N2 && N3.getOpcode() == ISD::SUB && N0 == N3.getOperand(1)) 6898 SubC = dyn_cast<ConstantSDNode>(N3.getOperand(0)); 6899 else if (((N1C->isNullValue() && (CC == ISD::SETLT || CC == ISD::SETLE)) || 6900 (N1C->isOne() && CC == ISD::SETLT)) && 6901 N0 == N3 && N2.getOpcode() == ISD::SUB && N0 == N2.getOperand(1)) 6902 SubC = dyn_cast<ConstantSDNode>(N2.getOperand(0)); 6903 6904 EVT XType = N0.getValueType(); 6905 if (SubC && SubC->isNullValue() && XType.isInteger()) { 6906 SDValue Shift = DAG.getNode(ISD::SRA, N0.getDebugLoc(), XType, 6907 N0, 6908 DAG.getConstant(XType.getSizeInBits()-1, 6909 getShiftAmountTy())); 6910 SDValue Add = DAG.getNode(ISD::ADD, N0.getDebugLoc(), 6911 XType, N0, Shift); 6912 AddToWorkList(Shift.getNode()); 6913 AddToWorkList(Add.getNode()); 6914 return DAG.getNode(ISD::XOR, DL, XType, Add, Shift); 6915 } 6916 } 6917 6918 return SDValue(); 6919} 6920 6921/// SimplifySetCC - This is a stub for TargetLowering::SimplifySetCC. 6922SDValue DAGCombiner::SimplifySetCC(EVT VT, SDValue N0, 6923 SDValue N1, ISD::CondCode Cond, 6924 DebugLoc DL, bool foldBooleans) { 6925 TargetLowering::DAGCombinerInfo 6926 DagCombineInfo(DAG, !LegalTypes, !LegalOperations, false, this); 6927 return TLI.SimplifySetCC(VT, N0, N1, Cond, foldBooleans, DagCombineInfo, DL); 6928} 6929 6930/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant, 6931/// return a DAG expression to select that will generate the same value by 6932/// multiplying by a magic number. See: 6933/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html> 6934SDValue DAGCombiner::BuildSDIV(SDNode *N) { 6935 std::vector<SDNode*> Built; 6936 SDValue S = TLI.BuildSDIV(N, DAG, &Built); 6937 6938 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end(); 6939 ii != ee; ++ii) 6940 AddToWorkList(*ii); 6941 return S; 6942} 6943 6944/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant, 6945/// return a DAG expression to select that will generate the same value by 6946/// multiplying by a magic number. See: 6947/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html> 6948SDValue DAGCombiner::BuildUDIV(SDNode *N) { 6949 std::vector<SDNode*> Built; 6950 SDValue S = TLI.BuildUDIV(N, DAG, &Built); 6951 6952 for (std::vector<SDNode*>::iterator ii = Built.begin(), ee = Built.end(); 6953 ii != ee; ++ii) 6954 AddToWorkList(*ii); 6955 return S; 6956} 6957 6958/// FindBaseOffset - Return true if base is a frame index, which is known not 6959// to alias with anything but itself. Provides base object and offset as results. 6960static bool FindBaseOffset(SDValue Ptr, SDValue &Base, int64_t &Offset, 6961 const GlobalValue *&GV, void *&CV) { 6962 // Assume it is a primitive operation. 6963 Base = Ptr; Offset = 0; GV = 0; CV = 0; 6964 6965 // If it's an adding a simple constant then integrate the offset. 6966 if (Base.getOpcode() == ISD::ADD) { 6967 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Base.getOperand(1))) { 6968 Base = Base.getOperand(0); 6969 Offset += C->getZExtValue(); 6970 } 6971 } 6972 6973 // Return the underlying GlobalValue, and update the Offset. Return false 6974 // for GlobalAddressSDNode since the same GlobalAddress may be represented 6975 // by multiple nodes with different offsets. 6976 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(Base)) { 6977 GV = G->getGlobal(); 6978 Offset += G->getOffset(); 6979 return false; 6980 } 6981 6982 // Return the underlying Constant value, and update the Offset. Return false 6983 // for ConstantSDNodes since the same constant pool entry may be represented 6984 // by multiple nodes with different offsets. 6985 if (ConstantPoolSDNode *C = dyn_cast<ConstantPoolSDNode>(Base)) { 6986 CV = C->isMachineConstantPoolEntry() ? (void *)C->getMachineCPVal() 6987 : (void *)C->getConstVal(); 6988 Offset += C->getOffset(); 6989 return false; 6990 } 6991 // If it's any of the following then it can't alias with anything but itself. 6992 return isa<FrameIndexSDNode>(Base); 6993} 6994 6995/// isAlias - Return true if there is any possibility that the two addresses 6996/// overlap. 6997bool DAGCombiner::isAlias(SDValue Ptr1, int64_t Size1, 6998 const Value *SrcValue1, int SrcValueOffset1, 6999 unsigned SrcValueAlign1, 7000 SDValue Ptr2, int64_t Size2, 7001 const Value *SrcValue2, int SrcValueOffset2, 7002 unsigned SrcValueAlign2) const { 7003 // If they are the same then they must be aliases. 7004 if (Ptr1 == Ptr2) return true; 7005 7006 // Gather base node and offset information. 7007 SDValue Base1, Base2; 7008 int64_t Offset1, Offset2; 7009 const GlobalValue *GV1, *GV2; 7010 void *CV1, *CV2; 7011 bool isFrameIndex1 = FindBaseOffset(Ptr1, Base1, Offset1, GV1, CV1); 7012 bool isFrameIndex2 = FindBaseOffset(Ptr2, Base2, Offset2, GV2, CV2); 7013 7014 // If they have a same base address then check to see if they overlap. 7015 if (Base1 == Base2 || (GV1 && (GV1 == GV2)) || (CV1 && (CV1 == CV2))) 7016 return !((Offset1 + Size1) <= Offset2 || (Offset2 + Size2) <= Offset1); 7017 7018 // It is possible for different frame indices to alias each other, mostly 7019 // when tail call optimization reuses return address slots for arguments. 7020 // To catch this case, look up the actual index of frame indices to compute 7021 // the real alias relationship. 7022 if (isFrameIndex1 && isFrameIndex2) { 7023 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo(); 7024 Offset1 += MFI->getObjectOffset(cast<FrameIndexSDNode>(Base1)->getIndex()); 7025 Offset2 += MFI->getObjectOffset(cast<FrameIndexSDNode>(Base2)->getIndex()); 7026 return !((Offset1 + Size1) <= Offset2 || (Offset2 + Size2) <= Offset1); 7027 } 7028 7029 // Otherwise, if we know what the bases are, and they aren't identical, then 7030 // we know they cannot alias. 7031 if ((isFrameIndex1 || CV1 || GV1) && (isFrameIndex2 || CV2 || GV2)) 7032 return false; 7033 7034 // If we know required SrcValue1 and SrcValue2 have relatively large alignment 7035 // compared to the size and offset of the access, we may be able to prove they 7036 // do not alias. This check is conservative for now to catch cases created by 7037 // splitting vector types. 7038 if ((SrcValueAlign1 == SrcValueAlign2) && 7039 (SrcValueOffset1 != SrcValueOffset2) && 7040 (Size1 == Size2) && (SrcValueAlign1 > Size1)) { 7041 int64_t OffAlign1 = SrcValueOffset1 % SrcValueAlign1; 7042 int64_t OffAlign2 = SrcValueOffset2 % SrcValueAlign1; 7043 7044 // There is no overlap between these relatively aligned accesses of similar 7045 // size, return no alias. 7046 if ((OffAlign1 + Size1) <= OffAlign2 || (OffAlign2 + Size2) <= OffAlign1) 7047 return false; 7048 } 7049 7050 if (CombinerGlobalAA) { 7051 // Use alias analysis information. 7052 int64_t MinOffset = std::min(SrcValueOffset1, SrcValueOffset2); 7053 int64_t Overlap1 = Size1 + SrcValueOffset1 - MinOffset; 7054 int64_t Overlap2 = Size2 + SrcValueOffset2 - MinOffset; 7055 AliasAnalysis::AliasResult AAResult = 7056 AA.alias(SrcValue1, Overlap1, SrcValue2, Overlap2); 7057 if (AAResult == AliasAnalysis::NoAlias) 7058 return false; 7059 } 7060 7061 // Otherwise we have to assume they alias. 7062 return true; 7063} 7064 7065/// FindAliasInfo - Extracts the relevant alias information from the memory 7066/// node. Returns true if the operand was a load. 7067bool DAGCombiner::FindAliasInfo(SDNode *N, 7068 SDValue &Ptr, int64_t &Size, 7069 const Value *&SrcValue, 7070 int &SrcValueOffset, 7071 unsigned &SrcValueAlign) const { 7072 if (LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) { 7073 Ptr = LD->getBasePtr(); 7074 Size = LD->getMemoryVT().getSizeInBits() >> 3; 7075 SrcValue = LD->getSrcValue(); 7076 SrcValueOffset = LD->getSrcValueOffset(); 7077 SrcValueAlign = LD->getOriginalAlignment(); 7078 return true; 7079 } else if (StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) { 7080 Ptr = ST->getBasePtr(); 7081 Size = ST->getMemoryVT().getSizeInBits() >> 3; 7082 SrcValue = ST->getSrcValue(); 7083 SrcValueOffset = ST->getSrcValueOffset(); 7084 SrcValueAlign = ST->getOriginalAlignment(); 7085 } else { 7086 llvm_unreachable("FindAliasInfo expected a memory operand"); 7087 } 7088 7089 return false; 7090} 7091 7092/// GatherAllAliases - Walk up chain skipping non-aliasing memory nodes, 7093/// looking for aliasing nodes and adding them to the Aliases vector. 7094void DAGCombiner::GatherAllAliases(SDNode *N, SDValue OriginalChain, 7095 SmallVector<SDValue, 8> &Aliases) { 7096 SmallVector<SDValue, 8> Chains; // List of chains to visit. 7097 SmallPtrSet<SDNode *, 16> Visited; // Visited node set. 7098 7099 // Get alias information for node. 7100 SDValue Ptr; 7101 int64_t Size; 7102 const Value *SrcValue; 7103 int SrcValueOffset; 7104 unsigned SrcValueAlign; 7105 bool IsLoad = FindAliasInfo(N, Ptr, Size, SrcValue, SrcValueOffset, 7106 SrcValueAlign); 7107 7108 // Starting off. 7109 Chains.push_back(OriginalChain); 7110 unsigned Depth = 0; 7111 7112 // Look at each chain and determine if it is an alias. If so, add it to the 7113 // aliases list. If not, then continue up the chain looking for the next 7114 // candidate. 7115 while (!Chains.empty()) { 7116 SDValue Chain = Chains.back(); 7117 Chains.pop_back(); 7118 7119 // For TokenFactor nodes, look at each operand and only continue up the 7120 // chain until we find two aliases. If we've seen two aliases, assume we'll 7121 // find more and revert to original chain since the xform is unlikely to be 7122 // profitable. 7123 // 7124 // FIXME: The depth check could be made to return the last non-aliasing 7125 // chain we found before we hit a tokenfactor rather than the original 7126 // chain. 7127 if (Depth > 6 || Aliases.size() == 2) { 7128 Aliases.clear(); 7129 Aliases.push_back(OriginalChain); 7130 break; 7131 } 7132 7133 // Don't bother if we've been before. 7134 if (!Visited.insert(Chain.getNode())) 7135 continue; 7136 7137 switch (Chain.getOpcode()) { 7138 case ISD::EntryToken: 7139 // Entry token is ideal chain operand, but handled in FindBetterChain. 7140 break; 7141 7142 case ISD::LOAD: 7143 case ISD::STORE: { 7144 // Get alias information for Chain. 7145 SDValue OpPtr; 7146 int64_t OpSize; 7147 const Value *OpSrcValue; 7148 int OpSrcValueOffset; 7149 unsigned OpSrcValueAlign; 7150 bool IsOpLoad = FindAliasInfo(Chain.getNode(), OpPtr, OpSize, 7151 OpSrcValue, OpSrcValueOffset, 7152 OpSrcValueAlign); 7153 7154 // If chain is alias then stop here. 7155 if (!(IsLoad && IsOpLoad) && 7156 isAlias(Ptr, Size, SrcValue, SrcValueOffset, SrcValueAlign, 7157 OpPtr, OpSize, OpSrcValue, OpSrcValueOffset, 7158 OpSrcValueAlign)) { 7159 Aliases.push_back(Chain); 7160 } else { 7161 // Look further up the chain. 7162 Chains.push_back(Chain.getOperand(0)); 7163 ++Depth; 7164 } 7165 break; 7166 } 7167 7168 case ISD::TokenFactor: 7169 // We have to check each of the operands of the token factor for "small" 7170 // token factors, so we queue them up. Adding the operands to the queue 7171 // (stack) in reverse order maintains the original order and increases the 7172 // likelihood that getNode will find a matching token factor (CSE.) 7173 if (Chain.getNumOperands() > 16) { 7174 Aliases.push_back(Chain); 7175 break; 7176 } 7177 for (unsigned n = Chain.getNumOperands(); n;) 7178 Chains.push_back(Chain.getOperand(--n)); 7179 ++Depth; 7180 break; 7181 7182 default: 7183 // For all other instructions we will just have to take what we can get. 7184 Aliases.push_back(Chain); 7185 break; 7186 } 7187 } 7188} 7189 7190/// FindBetterChain - Walk up chain skipping non-aliasing memory nodes, looking 7191/// for a better chain (aliasing node.) 7192SDValue DAGCombiner::FindBetterChain(SDNode *N, SDValue OldChain) { 7193 SmallVector<SDValue, 8> Aliases; // Ops for replacing token factor. 7194 7195 // Accumulate all the aliases to this node. 7196 GatherAllAliases(N, OldChain, Aliases); 7197 7198 if (Aliases.size() == 0) { 7199 // If no operands then chain to entry token. 7200 return DAG.getEntryNode(); 7201 } else if (Aliases.size() == 1) { 7202 // If a single operand then chain to it. We don't need to revisit it. 7203 return Aliases[0]; 7204 } 7205 7206 // Construct a custom tailored token factor. 7207 return DAG.getNode(ISD::TokenFactor, N->getDebugLoc(), MVT::Other, 7208 &Aliases[0], Aliases.size()); 7209} 7210 7211// SelectionDAG::Combine - This is the entry point for the file. 7212// 7213void SelectionDAG::Combine(CombineLevel Level, AliasAnalysis &AA, 7214 CodeGenOpt::Level OptLevel) { 7215 /// run - This is the main entry point to this class. 7216 /// 7217 DAGCombiner(*this, AA, OptLevel).Run(Level); 7218} 7219