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