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