DAGCombiner.cpp revision ee4ea923589a2556ff85edbaf444d9575050613a
1//===-- DAGCombiner.cpp - Implement a DAG node combiner -------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file was developed by Nate Begeman and is distributed under the 6// University of Illinois Open Source License. See LICENSE.TXT for details. 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// FIXME: Missing folds 14// sdiv, udiv, srem, urem (X, const) where X is an integer can be expanded into 15// a sequence of multiplies, shifts, and adds. This should be controlled by 16// some kind of hint from the target that int div is expensive. 17// various folds of mulh[s,u] by constants such as -1, powers of 2, etc. 18// 19// FIXME: select C, pow2, pow2 -> something smart 20// FIXME: trunc(select X, Y, Z) -> select X, trunc(Y), trunc(Z) 21// FIXME: Dead stores -> nuke 22// FIXME: shr X, (and Y,31) -> shr X, Y (TRICKY!) 23// FIXME: mul (x, const) -> shifts + adds 24// FIXME: undef values 25// FIXME: make truncate see through SIGN_EXTEND and AND 26// FIXME: divide by zero is currently left unfolded. do we want to turn this 27// into an undef? 28// FIXME: select ne (select cc, 1, 0), 0, true, false -> select cc, true, false 29// 30//===----------------------------------------------------------------------===// 31 32#define DEBUG_TYPE "dagcombine" 33#include "llvm/ADT/Statistic.h" 34#include "llvm/CodeGen/SelectionDAG.h" 35#include "llvm/Support/Debug.h" 36#include "llvm/Support/MathExtras.h" 37#include "llvm/Target/TargetLowering.h" 38#include <algorithm> 39#include <cmath> 40#include <iostream> 41using namespace llvm; 42 43namespace { 44 Statistic<> NodesCombined ("dagcombiner", "Number of dag nodes combined"); 45 46 class DAGCombiner { 47 SelectionDAG &DAG; 48 TargetLowering &TLI; 49 bool AfterLegalize; 50 51 // Worklist of all of the nodes that need to be simplified. 52 std::vector<SDNode*> WorkList; 53 54 /// AddUsersToWorkList - When an instruction is simplified, add all users of 55 /// the instruction to the work lists because they might get more simplified 56 /// now. 57 /// 58 void AddUsersToWorkList(SDNode *N) { 59 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end(); 60 UI != UE; ++UI) 61 WorkList.push_back(*UI); 62 } 63 64 /// removeFromWorkList - remove all instances of N from the worklist. 65 /// 66 void removeFromWorkList(SDNode *N) { 67 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), N), 68 WorkList.end()); 69 } 70 71 public: 72 void AddToWorkList(SDNode *N) { 73 WorkList.push_back(N); 74 } 75 76 SDOperand CombineTo(SDNode *N, const std::vector<SDOperand> &To) { 77 ++NodesCombined; 78 DEBUG(std::cerr << "\nReplacing "; N->dump(); 79 std::cerr << "\nWith: "; To[0].Val->dump(); 80 std::cerr << " and " << To.size()-1 << " other values\n"); 81 std::vector<SDNode*> NowDead; 82 DAG.ReplaceAllUsesWith(N, To, &NowDead); 83 84 // Push the new nodes and any users onto the worklist 85 for (unsigned i = 0, e = To.size(); i != e; ++i) { 86 WorkList.push_back(To[i].Val); 87 AddUsersToWorkList(To[i].Val); 88 } 89 90 // Nodes can end up on the worklist more than once. Make sure we do 91 // not process a node that has been replaced. 92 removeFromWorkList(N); 93 for (unsigned i = 0, e = NowDead.size(); i != e; ++i) 94 removeFromWorkList(NowDead[i]); 95 96 // Finally, since the node is now dead, remove it from the graph. 97 DAG.DeleteNode(N); 98 return SDOperand(N, 0); 99 } 100 101 SDOperand CombineTo(SDNode *N, SDOperand Res) { 102 std::vector<SDOperand> To; 103 To.push_back(Res); 104 return CombineTo(N, To); 105 } 106 107 SDOperand CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1) { 108 std::vector<SDOperand> To; 109 To.push_back(Res0); 110 To.push_back(Res1); 111 return CombineTo(N, To); 112 } 113 private: 114 115 /// SimplifyDemandedBits - Check the specified integer node value to see if 116 /// it can be simplified or if things it uses can be simplified by bit 117 /// propagation. If so, return true. 118 bool SimplifyDemandedBits(SDOperand Op) { 119 TargetLowering::TargetLoweringOpt TLO(DAG); 120 uint64_t KnownZero, KnownOne; 121 uint64_t Demanded = MVT::getIntVTBitMask(Op.getValueType()); 122 if (!TLI.SimplifyDemandedBits(Op, Demanded, KnownZero, KnownOne, TLO)) 123 return false; 124 125 // Revisit the node. 126 WorkList.push_back(Op.Val); 127 128 // Replace the old value with the new one. 129 ++NodesCombined; 130 DEBUG(std::cerr << "\nReplacing "; TLO.Old.Val->dump(); 131 std::cerr << "\nWith: "; TLO.New.Val->dump()); 132 133 std::vector<SDNode*> NowDead; 134 DAG.ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, NowDead); 135 136 // Push the new node and any (possibly new) users onto the worklist. 137 WorkList.push_back(TLO.New.Val); 138 AddUsersToWorkList(TLO.New.Val); 139 140 // Nodes can end up on the worklist more than once. Make sure we do 141 // not process a node that has been replaced. 142 for (unsigned i = 0, e = NowDead.size(); i != e; ++i) 143 removeFromWorkList(NowDead[i]); 144 145 // Finally, if the node is now dead, remove it from the graph. The node 146 // may not be dead if the replacement process recursively simplified to 147 // something else needing this node. 148 if (TLO.Old.Val->use_empty()) { 149 removeFromWorkList(TLO.Old.Val); 150 DAG.DeleteNode(TLO.Old.Val); 151 } 152 return true; 153 } 154 155 /// visit - call the node-specific routine that knows how to fold each 156 /// particular type of node. 157 SDOperand visit(SDNode *N); 158 159 // Visitation implementation - Implement dag node combining for different 160 // node types. The semantics are as follows: 161 // Return Value: 162 // SDOperand.Val == 0 - No change was made 163 // SDOperand.Val == N - N was replaced, is dead, and is already handled. 164 // otherwise - N should be replaced by the returned Operand. 165 // 166 SDOperand visitTokenFactor(SDNode *N); 167 SDOperand visitADD(SDNode *N); 168 SDOperand visitSUB(SDNode *N); 169 SDOperand visitMUL(SDNode *N); 170 SDOperand visitSDIV(SDNode *N); 171 SDOperand visitUDIV(SDNode *N); 172 SDOperand visitSREM(SDNode *N); 173 SDOperand visitUREM(SDNode *N); 174 SDOperand visitMULHU(SDNode *N); 175 SDOperand visitMULHS(SDNode *N); 176 SDOperand visitAND(SDNode *N); 177 SDOperand visitOR(SDNode *N); 178 SDOperand visitXOR(SDNode *N); 179 SDOperand visitVBinOp(SDNode *N, ISD::NodeType IntOp, ISD::NodeType FPOp); 180 SDOperand visitSHL(SDNode *N); 181 SDOperand visitSRA(SDNode *N); 182 SDOperand visitSRL(SDNode *N); 183 SDOperand visitCTLZ(SDNode *N); 184 SDOperand visitCTTZ(SDNode *N); 185 SDOperand visitCTPOP(SDNode *N); 186 SDOperand visitSELECT(SDNode *N); 187 SDOperand visitSELECT_CC(SDNode *N); 188 SDOperand visitSETCC(SDNode *N); 189 SDOperand visitSIGN_EXTEND(SDNode *N); 190 SDOperand visitZERO_EXTEND(SDNode *N); 191 SDOperand visitANY_EXTEND(SDNode *N); 192 SDOperand visitSIGN_EXTEND_INREG(SDNode *N); 193 SDOperand visitTRUNCATE(SDNode *N); 194 SDOperand visitBIT_CONVERT(SDNode *N); 195 SDOperand visitVBIT_CONVERT(SDNode *N); 196 SDOperand visitFADD(SDNode *N); 197 SDOperand visitFSUB(SDNode *N); 198 SDOperand visitFMUL(SDNode *N); 199 SDOperand visitFDIV(SDNode *N); 200 SDOperand visitFREM(SDNode *N); 201 SDOperand visitFCOPYSIGN(SDNode *N); 202 SDOperand visitSINT_TO_FP(SDNode *N); 203 SDOperand visitUINT_TO_FP(SDNode *N); 204 SDOperand visitFP_TO_SINT(SDNode *N); 205 SDOperand visitFP_TO_UINT(SDNode *N); 206 SDOperand visitFP_ROUND(SDNode *N); 207 SDOperand visitFP_ROUND_INREG(SDNode *N); 208 SDOperand visitFP_EXTEND(SDNode *N); 209 SDOperand visitFNEG(SDNode *N); 210 SDOperand visitFABS(SDNode *N); 211 SDOperand visitBRCOND(SDNode *N); 212 SDOperand visitBR_CC(SDNode *N); 213 SDOperand visitLOAD(SDNode *N); 214 SDOperand visitXEXTLOAD(SDNode *N); 215 SDOperand visitSTORE(SDNode *N); 216 SDOperand visitINSERT_VECTOR_ELT(SDNode *N); 217 SDOperand visitVINSERT_VECTOR_ELT(SDNode *N); 218 SDOperand visitVBUILD_VECTOR(SDNode *N); 219 SDOperand visitVECTOR_SHUFFLE(SDNode *N); 220 SDOperand visitVVECTOR_SHUFFLE(SDNode *N); 221 222 SDOperand XformToShuffleWithZero(SDNode *N); 223 SDOperand ReassociateOps(unsigned Opc, SDOperand LHS, SDOperand RHS); 224 225 bool SimplifySelectOps(SDNode *SELECT, SDOperand LHS, SDOperand RHS); 226 SDOperand SimplifyBinOpWithSameOpcodeHands(SDNode *N); 227 SDOperand SimplifySelect(SDOperand N0, SDOperand N1, SDOperand N2); 228 SDOperand SimplifySelectCC(SDOperand N0, SDOperand N1, SDOperand N2, 229 SDOperand N3, ISD::CondCode CC); 230 SDOperand SimplifySetCC(MVT::ValueType VT, SDOperand N0, SDOperand N1, 231 ISD::CondCode Cond, bool foldBooleans = true); 232 SDOperand ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(SDNode *, MVT::ValueType); 233 SDOperand BuildSDIV(SDNode *N); 234 SDOperand BuildUDIV(SDNode *N); 235public: 236 DAGCombiner(SelectionDAG &D) 237 : DAG(D), TLI(D.getTargetLoweringInfo()), AfterLegalize(false) {} 238 239 /// Run - runs the dag combiner on all nodes in the work list 240 void Run(bool RunningAfterLegalize); 241 }; 242} 243 244//===----------------------------------------------------------------------===// 245// TargetLowering::DAGCombinerInfo implementation 246//===----------------------------------------------------------------------===// 247 248void TargetLowering::DAGCombinerInfo::AddToWorklist(SDNode *N) { 249 ((DAGCombiner*)DC)->AddToWorkList(N); 250} 251 252SDOperand TargetLowering::DAGCombinerInfo:: 253CombineTo(SDNode *N, const std::vector<SDOperand> &To) { 254 return ((DAGCombiner*)DC)->CombineTo(N, To); 255} 256 257SDOperand TargetLowering::DAGCombinerInfo:: 258CombineTo(SDNode *N, SDOperand Res) { 259 return ((DAGCombiner*)DC)->CombineTo(N, Res); 260} 261 262 263SDOperand TargetLowering::DAGCombinerInfo:: 264CombineTo(SDNode *N, SDOperand Res0, SDOperand Res1) { 265 return ((DAGCombiner*)DC)->CombineTo(N, Res0, Res1); 266} 267 268 269 270 271//===----------------------------------------------------------------------===// 272 273 274struct ms { 275 int64_t m; // magic number 276 int64_t s; // shift amount 277}; 278 279struct mu { 280 uint64_t m; // magic number 281 int64_t a; // add indicator 282 int64_t s; // shift amount 283}; 284 285/// magic - calculate the magic numbers required to codegen an integer sdiv as 286/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1, 287/// or -1. 288static ms magic32(int32_t d) { 289 int32_t p; 290 uint32_t ad, anc, delta, q1, r1, q2, r2, t; 291 const uint32_t two31 = 0x80000000U; 292 struct ms mag; 293 294 ad = abs(d); 295 t = two31 + ((uint32_t)d >> 31); 296 anc = t - 1 - t%ad; // absolute value of nc 297 p = 31; // initialize p 298 q1 = two31/anc; // initialize q1 = 2p/abs(nc) 299 r1 = two31 - q1*anc; // initialize r1 = rem(2p,abs(nc)) 300 q2 = two31/ad; // initialize q2 = 2p/abs(d) 301 r2 = two31 - q2*ad; // initialize r2 = rem(2p,abs(d)) 302 do { 303 p = p + 1; 304 q1 = 2*q1; // update q1 = 2p/abs(nc) 305 r1 = 2*r1; // update r1 = rem(2p/abs(nc)) 306 if (r1 >= anc) { // must be unsigned comparison 307 q1 = q1 + 1; 308 r1 = r1 - anc; 309 } 310 q2 = 2*q2; // update q2 = 2p/abs(d) 311 r2 = 2*r2; // update r2 = rem(2p/abs(d)) 312 if (r2 >= ad) { // must be unsigned comparison 313 q2 = q2 + 1; 314 r2 = r2 - ad; 315 } 316 delta = ad - r2; 317 } while (q1 < delta || (q1 == delta && r1 == 0)); 318 319 mag.m = (int32_t)(q2 + 1); // make sure to sign extend 320 if (d < 0) mag.m = -mag.m; // resulting magic number 321 mag.s = p - 32; // resulting shift 322 return mag; 323} 324 325/// magicu - calculate the magic numbers required to codegen an integer udiv as 326/// a sequence of multiply, add and shifts. Requires that the divisor not be 0. 327static mu magicu32(uint32_t d) { 328 int32_t p; 329 uint32_t nc, delta, q1, r1, q2, r2; 330 struct mu magu; 331 magu.a = 0; // initialize "add" indicator 332 nc = - 1 - (-d)%d; 333 p = 31; // initialize p 334 q1 = 0x80000000/nc; // initialize q1 = 2p/nc 335 r1 = 0x80000000 - q1*nc; // initialize r1 = rem(2p,nc) 336 q2 = 0x7FFFFFFF/d; // initialize q2 = (2p-1)/d 337 r2 = 0x7FFFFFFF - q2*d; // initialize r2 = rem((2p-1),d) 338 do { 339 p = p + 1; 340 if (r1 >= nc - r1 ) { 341 q1 = 2*q1 + 1; // update q1 342 r1 = 2*r1 - nc; // update r1 343 } 344 else { 345 q1 = 2*q1; // update q1 346 r1 = 2*r1; // update r1 347 } 348 if (r2 + 1 >= d - r2) { 349 if (q2 >= 0x7FFFFFFF) magu.a = 1; 350 q2 = 2*q2 + 1; // update q2 351 r2 = 2*r2 + 1 - d; // update r2 352 } 353 else { 354 if (q2 >= 0x80000000) magu.a = 1; 355 q2 = 2*q2; // update q2 356 r2 = 2*r2 + 1; // update r2 357 } 358 delta = d - 1 - r2; 359 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0))); 360 magu.m = q2 + 1; // resulting magic number 361 magu.s = p - 32; // resulting shift 362 return magu; 363} 364 365/// magic - calculate the magic numbers required to codegen an integer sdiv as 366/// a sequence of multiply and shifts. Requires that the divisor not be 0, 1, 367/// or -1. 368static ms magic64(int64_t d) { 369 int64_t p; 370 uint64_t ad, anc, delta, q1, r1, q2, r2, t; 371 const uint64_t two63 = 9223372036854775808ULL; // 2^63 372 struct ms mag; 373 374 ad = d >= 0 ? d : -d; 375 t = two63 + ((uint64_t)d >> 63); 376 anc = t - 1 - t%ad; // absolute value of nc 377 p = 63; // initialize p 378 q1 = two63/anc; // initialize q1 = 2p/abs(nc) 379 r1 = two63 - q1*anc; // initialize r1 = rem(2p,abs(nc)) 380 q2 = two63/ad; // initialize q2 = 2p/abs(d) 381 r2 = two63 - q2*ad; // initialize r2 = rem(2p,abs(d)) 382 do { 383 p = p + 1; 384 q1 = 2*q1; // update q1 = 2p/abs(nc) 385 r1 = 2*r1; // update r1 = rem(2p/abs(nc)) 386 if (r1 >= anc) { // must be unsigned comparison 387 q1 = q1 + 1; 388 r1 = r1 - anc; 389 } 390 q2 = 2*q2; // update q2 = 2p/abs(d) 391 r2 = 2*r2; // update r2 = rem(2p/abs(d)) 392 if (r2 >= ad) { // must be unsigned comparison 393 q2 = q2 + 1; 394 r2 = r2 - ad; 395 } 396 delta = ad - r2; 397 } while (q1 < delta || (q1 == delta && r1 == 0)); 398 399 mag.m = q2 + 1; 400 if (d < 0) mag.m = -mag.m; // resulting magic number 401 mag.s = p - 64; // resulting shift 402 return mag; 403} 404 405/// magicu - calculate the magic numbers required to codegen an integer udiv as 406/// a sequence of multiply, add and shifts. Requires that the divisor not be 0. 407static mu magicu64(uint64_t d) 408{ 409 int64_t p; 410 uint64_t nc, delta, q1, r1, q2, r2; 411 struct mu magu; 412 magu.a = 0; // initialize "add" indicator 413 nc = - 1 - (-d)%d; 414 p = 63; // initialize p 415 q1 = 0x8000000000000000ull/nc; // initialize q1 = 2p/nc 416 r1 = 0x8000000000000000ull - q1*nc; // initialize r1 = rem(2p,nc) 417 q2 = 0x7FFFFFFFFFFFFFFFull/d; // initialize q2 = (2p-1)/d 418 r2 = 0x7FFFFFFFFFFFFFFFull - q2*d; // initialize r2 = rem((2p-1),d) 419 do { 420 p = p + 1; 421 if (r1 >= nc - r1 ) { 422 q1 = 2*q1 + 1; // update q1 423 r1 = 2*r1 - nc; // update r1 424 } 425 else { 426 q1 = 2*q1; // update q1 427 r1 = 2*r1; // update r1 428 } 429 if (r2 + 1 >= d - r2) { 430 if (q2 >= 0x7FFFFFFFFFFFFFFFull) magu.a = 1; 431 q2 = 2*q2 + 1; // update q2 432 r2 = 2*r2 + 1 - d; // update r2 433 } 434 else { 435 if (q2 >= 0x8000000000000000ull) magu.a = 1; 436 q2 = 2*q2; // update q2 437 r2 = 2*r2 + 1; // update r2 438 } 439 delta = d - 1 - r2; 440 } while (p < 64 && (q1 < delta || (q1 == delta && r1 == 0))); 441 magu.m = q2 + 1; // resulting magic number 442 magu.s = p - 64; // resulting shift 443 return magu; 444} 445 446// isSetCCEquivalent - Return true if this node is a setcc, or is a select_cc 447// that selects between the values 1 and 0, making it equivalent to a setcc. 448// Also, set the incoming LHS, RHS, and CC references to the appropriate 449// nodes based on the type of node we are checking. This simplifies life a 450// bit for the callers. 451static bool isSetCCEquivalent(SDOperand N, SDOperand &LHS, SDOperand &RHS, 452 SDOperand &CC) { 453 if (N.getOpcode() == ISD::SETCC) { 454 LHS = N.getOperand(0); 455 RHS = N.getOperand(1); 456 CC = N.getOperand(2); 457 return true; 458 } 459 if (N.getOpcode() == ISD::SELECT_CC && 460 N.getOperand(2).getOpcode() == ISD::Constant && 461 N.getOperand(3).getOpcode() == ISD::Constant && 462 cast<ConstantSDNode>(N.getOperand(2))->getValue() == 1 && 463 cast<ConstantSDNode>(N.getOperand(3))->isNullValue()) { 464 LHS = N.getOperand(0); 465 RHS = N.getOperand(1); 466 CC = N.getOperand(4); 467 return true; 468 } 469 return false; 470} 471 472// isOneUseSetCC - Return true if this is a SetCC-equivalent operation with only 473// one use. If this is true, it allows the users to invert the operation for 474// free when it is profitable to do so. 475static bool isOneUseSetCC(SDOperand N) { 476 SDOperand N0, N1, N2; 477 if (isSetCCEquivalent(N, N0, N1, N2) && N.Val->hasOneUse()) 478 return true; 479 return false; 480} 481 482// FIXME: This should probably go in the ISD class rather than being duplicated 483// in several files. 484static bool isCommutativeBinOp(unsigned Opcode) { 485 switch (Opcode) { 486 case ISD::ADD: 487 case ISD::MUL: 488 case ISD::AND: 489 case ISD::OR: 490 case ISD::XOR: return true; 491 default: return false; // FIXME: Need commutative info for user ops! 492 } 493} 494 495SDOperand DAGCombiner::ReassociateOps(unsigned Opc, SDOperand N0, SDOperand N1){ 496 MVT::ValueType VT = N0.getValueType(); 497 // reassoc. (op (op x, c1), y) -> (op (op x, y), c1) iff x+c1 has one use 498 // reassoc. (op (op x, c1), c2) -> (op x, (op c1, c2)) 499 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1))) { 500 if (isa<ConstantSDNode>(N1)) { 501 SDOperand OpNode = DAG.getNode(Opc, VT, N0.getOperand(1), N1); 502 AddToWorkList(OpNode.Val); 503 return DAG.getNode(Opc, VT, OpNode, N0.getOperand(0)); 504 } else if (N0.hasOneUse()) { 505 SDOperand OpNode = DAG.getNode(Opc, VT, N0.getOperand(0), N1); 506 AddToWorkList(OpNode.Val); 507 return DAG.getNode(Opc, VT, OpNode, N0.getOperand(1)); 508 } 509 } 510 // reassoc. (op y, (op x, c1)) -> (op (op x, y), c1) iff x+c1 has one use 511 // reassoc. (op c2, (op x, c1)) -> (op x, (op c1, c2)) 512 if (N1.getOpcode() == Opc && isa<ConstantSDNode>(N1.getOperand(1))) { 513 if (isa<ConstantSDNode>(N0)) { 514 SDOperand OpNode = DAG.getNode(Opc, VT, N1.getOperand(1), N0); 515 AddToWorkList(OpNode.Val); 516 return DAG.getNode(Opc, VT, OpNode, N1.getOperand(0)); 517 } else if (N1.hasOneUse()) { 518 SDOperand OpNode = DAG.getNode(Opc, VT, N1.getOperand(0), N0); 519 AddToWorkList(OpNode.Val); 520 return DAG.getNode(Opc, VT, OpNode, N1.getOperand(1)); 521 } 522 } 523 return SDOperand(); 524} 525 526void DAGCombiner::Run(bool RunningAfterLegalize) { 527 // set the instance variable, so that the various visit routines may use it. 528 AfterLegalize = RunningAfterLegalize; 529 530 // Add all the dag nodes to the worklist. 531 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(), 532 E = DAG.allnodes_end(); I != E; ++I) 533 WorkList.push_back(I); 534 535 // Create a dummy node (which is not added to allnodes), that adds a reference 536 // to the root node, preventing it from being deleted, and tracking any 537 // changes of the root. 538 HandleSDNode Dummy(DAG.getRoot()); 539 540 541 /// DagCombineInfo - Expose the DAG combiner to the target combiner impls. 542 TargetLowering::DAGCombinerInfo 543 DagCombineInfo(DAG, !RunningAfterLegalize, this); 544 545 // while the worklist isn't empty, inspect the node on the end of it and 546 // try and combine it. 547 while (!WorkList.empty()) { 548 SDNode *N = WorkList.back(); 549 WorkList.pop_back(); 550 551 // If N has no uses, it is dead. Make sure to revisit all N's operands once 552 // N is deleted from the DAG, since they too may now be dead or may have a 553 // reduced number of uses, allowing other xforms. 554 if (N->use_empty() && N != &Dummy) { 555 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 556 WorkList.push_back(N->getOperand(i).Val); 557 558 removeFromWorkList(N); 559 DAG.DeleteNode(N); 560 continue; 561 } 562 563 SDOperand RV = visit(N); 564 565 // If nothing happened, try a target-specific DAG combine. 566 if (RV.Val == 0) { 567 if (N->getOpcode() >= ISD::BUILTIN_OP_END || 568 TLI.hasTargetDAGCombine((ISD::NodeType)N->getOpcode())) 569 RV = TLI.PerformDAGCombine(N, DagCombineInfo); 570 } 571 572 if (RV.Val) { 573 ++NodesCombined; 574 // If we get back the same node we passed in, rather than a new node or 575 // zero, we know that the node must have defined multiple values and 576 // CombineTo was used. Since CombineTo takes care of the worklist 577 // mechanics for us, we have no work to do in this case. 578 if (RV.Val != N) { 579 DEBUG(std::cerr << "\nReplacing "; N->dump(); 580 std::cerr << "\nWith: "; RV.Val->dump(); 581 std::cerr << '\n'); 582 std::vector<SDNode*> NowDead; 583 DAG.ReplaceAllUsesWith(N, std::vector<SDOperand>(1, RV), &NowDead); 584 585 // Push the new node and any users onto the worklist 586 WorkList.push_back(RV.Val); 587 AddUsersToWorkList(RV.Val); 588 589 // Nodes can end up on the worklist more than once. Make sure we do 590 // not process a node that has been replaced. 591 removeFromWorkList(N); 592 for (unsigned i = 0, e = NowDead.size(); i != e; ++i) 593 removeFromWorkList(NowDead[i]); 594 595 // Finally, since the node is now dead, remove it from the graph. 596 DAG.DeleteNode(N); 597 } 598 } 599 } 600 601 // If the root changed (e.g. it was a dead load, update the root). 602 DAG.setRoot(Dummy.getValue()); 603} 604 605SDOperand DAGCombiner::visit(SDNode *N) { 606 switch(N->getOpcode()) { 607 default: break; 608 case ISD::TokenFactor: return visitTokenFactor(N); 609 case ISD::ADD: return visitADD(N); 610 case ISD::SUB: return visitSUB(N); 611 case ISD::MUL: return visitMUL(N); 612 case ISD::SDIV: return visitSDIV(N); 613 case ISD::UDIV: return visitUDIV(N); 614 case ISD::SREM: return visitSREM(N); 615 case ISD::UREM: return visitUREM(N); 616 case ISD::MULHU: return visitMULHU(N); 617 case ISD::MULHS: return visitMULHS(N); 618 case ISD::AND: return visitAND(N); 619 case ISD::OR: return visitOR(N); 620 case ISD::XOR: return visitXOR(N); 621 case ISD::SHL: return visitSHL(N); 622 case ISD::SRA: return visitSRA(N); 623 case ISD::SRL: return visitSRL(N); 624 case ISD::CTLZ: return visitCTLZ(N); 625 case ISD::CTTZ: return visitCTTZ(N); 626 case ISD::CTPOP: return visitCTPOP(N); 627 case ISD::SELECT: return visitSELECT(N); 628 case ISD::SELECT_CC: return visitSELECT_CC(N); 629 case ISD::SETCC: return visitSETCC(N); 630 case ISD::SIGN_EXTEND: return visitSIGN_EXTEND(N); 631 case ISD::ZERO_EXTEND: return visitZERO_EXTEND(N); 632 case ISD::ANY_EXTEND: return visitANY_EXTEND(N); 633 case ISD::SIGN_EXTEND_INREG: return visitSIGN_EXTEND_INREG(N); 634 case ISD::TRUNCATE: return visitTRUNCATE(N); 635 case ISD::BIT_CONVERT: return visitBIT_CONVERT(N); 636 case ISD::VBIT_CONVERT: return visitVBIT_CONVERT(N); 637 case ISD::FADD: return visitFADD(N); 638 case ISD::FSUB: return visitFSUB(N); 639 case ISD::FMUL: return visitFMUL(N); 640 case ISD::FDIV: return visitFDIV(N); 641 case ISD::FREM: return visitFREM(N); 642 case ISD::FCOPYSIGN: return visitFCOPYSIGN(N); 643 case ISD::SINT_TO_FP: return visitSINT_TO_FP(N); 644 case ISD::UINT_TO_FP: return visitUINT_TO_FP(N); 645 case ISD::FP_TO_SINT: return visitFP_TO_SINT(N); 646 case ISD::FP_TO_UINT: return visitFP_TO_UINT(N); 647 case ISD::FP_ROUND: return visitFP_ROUND(N); 648 case ISD::FP_ROUND_INREG: return visitFP_ROUND_INREG(N); 649 case ISD::FP_EXTEND: return visitFP_EXTEND(N); 650 case ISD::FNEG: return visitFNEG(N); 651 case ISD::FABS: return visitFABS(N); 652 case ISD::BRCOND: return visitBRCOND(N); 653 case ISD::BR_CC: return visitBR_CC(N); 654 case ISD::LOAD: return visitLOAD(N); 655 case ISD::EXTLOAD: 656 case ISD::SEXTLOAD: 657 case ISD::ZEXTLOAD: return visitXEXTLOAD(N); 658 case ISD::STORE: return visitSTORE(N); 659 case ISD::INSERT_VECTOR_ELT: return visitINSERT_VECTOR_ELT(N); 660 case ISD::VINSERT_VECTOR_ELT: return visitVINSERT_VECTOR_ELT(N); 661 case ISD::VBUILD_VECTOR: return visitVBUILD_VECTOR(N); 662 case ISD::VECTOR_SHUFFLE: return visitVECTOR_SHUFFLE(N); 663 case ISD::VVECTOR_SHUFFLE: return visitVVECTOR_SHUFFLE(N); 664 case ISD::VADD: return visitVBinOp(N, ISD::ADD , ISD::FADD); 665 case ISD::VSUB: return visitVBinOp(N, ISD::SUB , ISD::FSUB); 666 case ISD::VMUL: return visitVBinOp(N, ISD::MUL , ISD::FMUL); 667 case ISD::VSDIV: return visitVBinOp(N, ISD::SDIV, ISD::FDIV); 668 case ISD::VUDIV: return visitVBinOp(N, ISD::UDIV, ISD::UDIV); 669 case ISD::VAND: return visitVBinOp(N, ISD::AND , ISD::AND); 670 case ISD::VOR: return visitVBinOp(N, ISD::OR , ISD::OR); 671 case ISD::VXOR: return visitVBinOp(N, ISD::XOR , ISD::XOR); 672 } 673 return SDOperand(); 674} 675 676SDOperand DAGCombiner::visitTokenFactor(SDNode *N) { 677 std::vector<SDOperand> Ops; 678 bool Changed = false; 679 680 // If the token factor has two operands and one is the entry token, replace 681 // the token factor with the other operand. 682 if (N->getNumOperands() == 2) { 683 if (N->getOperand(0).getOpcode() == ISD::EntryToken) 684 return N->getOperand(1); 685 if (N->getOperand(1).getOpcode() == ISD::EntryToken) 686 return N->getOperand(0); 687 } 688 689 // fold (tokenfactor (tokenfactor)) -> tokenfactor 690 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 691 SDOperand Op = N->getOperand(i); 692 if (Op.getOpcode() == ISD::TokenFactor && Op.hasOneUse()) { 693 AddToWorkList(Op.Val); // Remove dead node. 694 Changed = true; 695 for (unsigned j = 0, e = Op.getNumOperands(); j != e; ++j) 696 Ops.push_back(Op.getOperand(j)); 697 } else { 698 Ops.push_back(Op); 699 } 700 } 701 if (Changed) 702 return DAG.getNode(ISD::TokenFactor, MVT::Other, Ops); 703 return SDOperand(); 704} 705 706SDOperand DAGCombiner::visitADD(SDNode *N) { 707 SDOperand N0 = N->getOperand(0); 708 SDOperand N1 = N->getOperand(1); 709 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 710 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 711 MVT::ValueType VT = N0.getValueType(); 712 713 // fold (add c1, c2) -> c1+c2 714 if (N0C && N1C) 715 return DAG.getNode(ISD::ADD, VT, N0, N1); 716 // canonicalize constant to RHS 717 if (N0C && !N1C) 718 return DAG.getNode(ISD::ADD, VT, N1, N0); 719 // fold (add x, 0) -> x 720 if (N1C && N1C->isNullValue()) 721 return N0; 722 // fold ((c1-A)+c2) -> (c1+c2)-A 723 if (N1C && N0.getOpcode() == ISD::SUB) 724 if (ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.getOperand(0))) 725 return DAG.getNode(ISD::SUB, VT, 726 DAG.getConstant(N1C->getValue()+N0C->getValue(), VT), 727 N0.getOperand(1)); 728 // reassociate add 729 SDOperand RADD = ReassociateOps(ISD::ADD, N0, N1); 730 if (RADD.Val != 0) 731 return RADD; 732 // fold ((0-A) + B) -> B-A 733 if (N0.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N0.getOperand(0)) && 734 cast<ConstantSDNode>(N0.getOperand(0))->isNullValue()) 735 return DAG.getNode(ISD::SUB, VT, N1, N0.getOperand(1)); 736 // fold (A + (0-B)) -> A-B 737 if (N1.getOpcode() == ISD::SUB && isa<ConstantSDNode>(N1.getOperand(0)) && 738 cast<ConstantSDNode>(N1.getOperand(0))->isNullValue()) 739 return DAG.getNode(ISD::SUB, VT, N0, N1.getOperand(1)); 740 // fold (A+(B-A)) -> B 741 if (N1.getOpcode() == ISD::SUB && N0 == N1.getOperand(1)) 742 return N1.getOperand(0); 743 744 if (!MVT::isVector(VT) && SimplifyDemandedBits(SDOperand(N, 0))) 745 return SDOperand(N, 0); 746 747 // fold (a+b) -> (a|b) iff a and b share no bits. 748 if (MVT::isInteger(VT) && !MVT::isVector(VT)) { 749 uint64_t LHSZero, LHSOne; 750 uint64_t RHSZero, RHSOne; 751 uint64_t Mask = MVT::getIntVTBitMask(VT); 752 TLI.ComputeMaskedBits(N0, Mask, LHSZero, LHSOne); 753 if (LHSZero) { 754 TLI.ComputeMaskedBits(N1, Mask, RHSZero, RHSOne); 755 756 // If all possibly-set bits on the LHS are clear on the RHS, return an OR. 757 // If all possibly-set bits on the RHS are clear on the LHS, return an OR. 758 if ((RHSZero & (~LHSZero & Mask)) == (~LHSZero & Mask) || 759 (LHSZero & (~RHSZero & Mask)) == (~RHSZero & Mask)) 760 return DAG.getNode(ISD::OR, VT, N0, N1); 761 } 762 } 763 764 return SDOperand(); 765} 766 767SDOperand DAGCombiner::visitSUB(SDNode *N) { 768 SDOperand N0 = N->getOperand(0); 769 SDOperand N1 = N->getOperand(1); 770 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val); 771 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 772 MVT::ValueType VT = N0.getValueType(); 773 774 // fold (sub x, x) -> 0 775 if (N0 == N1) 776 return DAG.getConstant(0, N->getValueType(0)); 777 // fold (sub c1, c2) -> c1-c2 778 if (N0C && N1C) 779 return DAG.getNode(ISD::SUB, VT, N0, N1); 780 // fold (sub x, c) -> (add x, -c) 781 if (N1C) 782 return DAG.getNode(ISD::ADD, VT, N0, DAG.getConstant(-N1C->getValue(), VT)); 783 // fold (A+B)-A -> B 784 if (N0.getOpcode() == ISD::ADD && N0.getOperand(0) == N1) 785 return N0.getOperand(1); 786 // fold (A+B)-B -> A 787 if (N0.getOpcode() == ISD::ADD && N0.getOperand(1) == N1) 788 return N0.getOperand(0); 789 return SDOperand(); 790} 791 792SDOperand DAGCombiner::visitMUL(SDNode *N) { 793 SDOperand N0 = N->getOperand(0); 794 SDOperand N1 = N->getOperand(1); 795 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 796 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 797 MVT::ValueType VT = N0.getValueType(); 798 799 // fold (mul c1, c2) -> c1*c2 800 if (N0C && N1C) 801 return DAG.getNode(ISD::MUL, VT, N0, N1); 802 // canonicalize constant to RHS 803 if (N0C && !N1C) 804 return DAG.getNode(ISD::MUL, VT, N1, N0); 805 // fold (mul x, 0) -> 0 806 if (N1C && N1C->isNullValue()) 807 return N1; 808 // fold (mul x, -1) -> 0-x 809 if (N1C && N1C->isAllOnesValue()) 810 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), N0); 811 // fold (mul x, (1 << c)) -> x << c 812 if (N1C && isPowerOf2_64(N1C->getValue())) 813 return DAG.getNode(ISD::SHL, VT, N0, 814 DAG.getConstant(Log2_64(N1C->getValue()), 815 TLI.getShiftAmountTy())); 816 // fold (mul x, -(1 << c)) -> -(x << c) or (-x) << c 817 if (N1C && isPowerOf2_64(-N1C->getSignExtended())) { 818 // FIXME: If the input is something that is easily negated (e.g. a 819 // single-use add), we should put the negate there. 820 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), 821 DAG.getNode(ISD::SHL, VT, N0, 822 DAG.getConstant(Log2_64(-N1C->getSignExtended()), 823 TLI.getShiftAmountTy()))); 824 } 825 826 // (mul (shl X, c1), c2) -> (mul X, c2 << c1) 827 if (N1C && N0.getOpcode() == ISD::SHL && 828 isa<ConstantSDNode>(N0.getOperand(1))) { 829 SDOperand C3 = DAG.getNode(ISD::SHL, VT, N1, N0.getOperand(1)); 830 AddToWorkList(C3.Val); 831 return DAG.getNode(ISD::MUL, VT, N0.getOperand(0), C3); 832 } 833 834 // Change (mul (shl X, C), Y) -> (shl (mul X, Y), C) when the shift has one 835 // use. 836 { 837 SDOperand Sh(0,0), Y(0,0); 838 // Check for both (mul (shl X, C), Y) and (mul Y, (shl X, C)). 839 if (N0.getOpcode() == ISD::SHL && isa<ConstantSDNode>(N0.getOperand(1)) && 840 N0.Val->hasOneUse()) { 841 Sh = N0; Y = N1; 842 } else if (N1.getOpcode() == ISD::SHL && 843 isa<ConstantSDNode>(N1.getOperand(1)) && N1.Val->hasOneUse()) { 844 Sh = N1; Y = N0; 845 } 846 if (Sh.Val) { 847 SDOperand Mul = DAG.getNode(ISD::MUL, VT, Sh.getOperand(0), Y); 848 return DAG.getNode(ISD::SHL, VT, Mul, Sh.getOperand(1)); 849 } 850 } 851 // fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2) 852 if (N1C && N0.getOpcode() == ISD::ADD && N0.Val->hasOneUse() && 853 isa<ConstantSDNode>(N0.getOperand(1))) { 854 return DAG.getNode(ISD::ADD, VT, 855 DAG.getNode(ISD::MUL, VT, N0.getOperand(0), N1), 856 DAG.getNode(ISD::MUL, VT, N0.getOperand(1), N1)); 857 } 858 859 // reassociate mul 860 SDOperand RMUL = ReassociateOps(ISD::MUL, N0, N1); 861 if (RMUL.Val != 0) 862 return RMUL; 863 return SDOperand(); 864} 865 866SDOperand DAGCombiner::visitSDIV(SDNode *N) { 867 SDOperand N0 = N->getOperand(0); 868 SDOperand N1 = N->getOperand(1); 869 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val); 870 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 871 MVT::ValueType VT = N->getValueType(0); 872 873 // fold (sdiv c1, c2) -> c1/c2 874 if (N0C && N1C && !N1C->isNullValue()) 875 return DAG.getNode(ISD::SDIV, VT, N0, N1); 876 // fold (sdiv X, 1) -> X 877 if (N1C && N1C->getSignExtended() == 1LL) 878 return N0; 879 // fold (sdiv X, -1) -> 0-X 880 if (N1C && N1C->isAllOnesValue()) 881 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), N0); 882 // If we know the sign bits of both operands are zero, strength reduce to a 883 // udiv instead. Handles (X&15) /s 4 -> X&15 >> 2 884 uint64_t SignBit = 1ULL << (MVT::getSizeInBits(VT)-1); 885 if (TLI.MaskedValueIsZero(N1, SignBit) && 886 TLI.MaskedValueIsZero(N0, SignBit)) 887 return DAG.getNode(ISD::UDIV, N1.getValueType(), N0, N1); 888 // fold (sdiv X, pow2) -> simple ops after legalize 889 if (N1C && N1C->getValue() && !TLI.isIntDivCheap() && 890 (isPowerOf2_64(N1C->getSignExtended()) || 891 isPowerOf2_64(-N1C->getSignExtended()))) { 892 // If dividing by powers of two is cheap, then don't perform the following 893 // fold. 894 if (TLI.isPow2DivCheap()) 895 return SDOperand(); 896 int64_t pow2 = N1C->getSignExtended(); 897 int64_t abs2 = pow2 > 0 ? pow2 : -pow2; 898 unsigned lg2 = Log2_64(abs2); 899 // Splat the sign bit into the register 900 SDOperand SGN = DAG.getNode(ISD::SRA, VT, N0, 901 DAG.getConstant(MVT::getSizeInBits(VT)-1, 902 TLI.getShiftAmountTy())); 903 AddToWorkList(SGN.Val); 904 // Add (N0 < 0) ? abs2 - 1 : 0; 905 SDOperand SRL = DAG.getNode(ISD::SRL, VT, SGN, 906 DAG.getConstant(MVT::getSizeInBits(VT)-lg2, 907 TLI.getShiftAmountTy())); 908 SDOperand ADD = DAG.getNode(ISD::ADD, VT, N0, SRL); 909 AddToWorkList(SRL.Val); 910 AddToWorkList(ADD.Val); // Divide by pow2 911 SDOperand SRA = DAG.getNode(ISD::SRA, VT, ADD, 912 DAG.getConstant(lg2, TLI.getShiftAmountTy())); 913 // If we're dividing by a positive value, we're done. Otherwise, we must 914 // negate the result. 915 if (pow2 > 0) 916 return SRA; 917 AddToWorkList(SRA.Val); 918 return DAG.getNode(ISD::SUB, VT, DAG.getConstant(0, VT), SRA); 919 } 920 // if integer divide is expensive and we satisfy the requirements, emit an 921 // alternate sequence. 922 if (N1C && (N1C->getSignExtended() < -1 || N1C->getSignExtended() > 1) && 923 !TLI.isIntDivCheap()) { 924 SDOperand Op = BuildSDIV(N); 925 if (Op.Val) return Op; 926 } 927 return SDOperand(); 928} 929 930SDOperand DAGCombiner::visitUDIV(SDNode *N) { 931 SDOperand N0 = N->getOperand(0); 932 SDOperand N1 = N->getOperand(1); 933 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val); 934 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 935 MVT::ValueType VT = N->getValueType(0); 936 937 // fold (udiv c1, c2) -> c1/c2 938 if (N0C && N1C && !N1C->isNullValue()) 939 return DAG.getNode(ISD::UDIV, VT, N0, N1); 940 // fold (udiv x, (1 << c)) -> x >>u c 941 if (N1C && isPowerOf2_64(N1C->getValue())) 942 return DAG.getNode(ISD::SRL, VT, N0, 943 DAG.getConstant(Log2_64(N1C->getValue()), 944 TLI.getShiftAmountTy())); 945 // fold (udiv x, (shl c, y)) -> x >>u (log2(c)+y) iff c is power of 2 946 if (N1.getOpcode() == ISD::SHL) { 947 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) { 948 if (isPowerOf2_64(SHC->getValue())) { 949 MVT::ValueType ADDVT = N1.getOperand(1).getValueType(); 950 SDOperand Add = DAG.getNode(ISD::ADD, ADDVT, N1.getOperand(1), 951 DAG.getConstant(Log2_64(SHC->getValue()), 952 ADDVT)); 953 AddToWorkList(Add.Val); 954 return DAG.getNode(ISD::SRL, VT, N0, Add); 955 } 956 } 957 } 958 // fold (udiv x, c) -> alternate 959 if (N1C && N1C->getValue() && !TLI.isIntDivCheap()) { 960 SDOperand Op = BuildUDIV(N); 961 if (Op.Val) return Op; 962 } 963 return SDOperand(); 964} 965 966SDOperand DAGCombiner::visitSREM(SDNode *N) { 967 SDOperand N0 = N->getOperand(0); 968 SDOperand N1 = N->getOperand(1); 969 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 970 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 971 MVT::ValueType VT = N->getValueType(0); 972 973 // fold (srem c1, c2) -> c1%c2 974 if (N0C && N1C && !N1C->isNullValue()) 975 return DAG.getNode(ISD::SREM, VT, N0, N1); 976 // If we know the sign bits of both operands are zero, strength reduce to a 977 // urem instead. Handles (X & 0x0FFFFFFF) %s 16 -> X&15 978 uint64_t SignBit = 1ULL << (MVT::getSizeInBits(VT)-1); 979 if (TLI.MaskedValueIsZero(N1, SignBit) && 980 TLI.MaskedValueIsZero(N0, SignBit)) 981 return DAG.getNode(ISD::UREM, VT, N0, N1); 982 return SDOperand(); 983} 984 985SDOperand DAGCombiner::visitUREM(SDNode *N) { 986 SDOperand N0 = N->getOperand(0); 987 SDOperand N1 = N->getOperand(1); 988 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 989 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 990 MVT::ValueType VT = N->getValueType(0); 991 992 // fold (urem c1, c2) -> c1%c2 993 if (N0C && N1C && !N1C->isNullValue()) 994 return DAG.getNode(ISD::UREM, VT, N0, N1); 995 // fold (urem x, pow2) -> (and x, pow2-1) 996 if (N1C && !N1C->isNullValue() && isPowerOf2_64(N1C->getValue())) 997 return DAG.getNode(ISD::AND, VT, N0, DAG.getConstant(N1C->getValue()-1,VT)); 998 // fold (urem x, (shl pow2, y)) -> (and x, (add (shl pow2, y), -1)) 999 if (N1.getOpcode() == ISD::SHL) { 1000 if (ConstantSDNode *SHC = dyn_cast<ConstantSDNode>(N1.getOperand(0))) { 1001 if (isPowerOf2_64(SHC->getValue())) { 1002 SDOperand Add = DAG.getNode(ISD::ADD, VT, N1,DAG.getConstant(~0ULL,VT)); 1003 AddToWorkList(Add.Val); 1004 return DAG.getNode(ISD::AND, VT, N0, Add); 1005 } 1006 } 1007 } 1008 return SDOperand(); 1009} 1010 1011SDOperand DAGCombiner::visitMULHS(SDNode *N) { 1012 SDOperand N0 = N->getOperand(0); 1013 SDOperand N1 = N->getOperand(1); 1014 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1015 1016 // fold (mulhs x, 0) -> 0 1017 if (N1C && N1C->isNullValue()) 1018 return N1; 1019 // fold (mulhs x, 1) -> (sra x, size(x)-1) 1020 if (N1C && N1C->getValue() == 1) 1021 return DAG.getNode(ISD::SRA, N0.getValueType(), N0, 1022 DAG.getConstant(MVT::getSizeInBits(N0.getValueType())-1, 1023 TLI.getShiftAmountTy())); 1024 return SDOperand(); 1025} 1026 1027SDOperand DAGCombiner::visitMULHU(SDNode *N) { 1028 SDOperand N0 = N->getOperand(0); 1029 SDOperand N1 = N->getOperand(1); 1030 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1031 1032 // fold (mulhu x, 0) -> 0 1033 if (N1C && N1C->isNullValue()) 1034 return N1; 1035 // fold (mulhu x, 1) -> 0 1036 if (N1C && N1C->getValue() == 1) 1037 return DAG.getConstant(0, N0.getValueType()); 1038 return SDOperand(); 1039} 1040 1041/// SimplifyBinOpWithSameOpcodeHands - If this is a binary operator with 1042/// two operands of the same opcode, try to simplify it. 1043SDOperand DAGCombiner::SimplifyBinOpWithSameOpcodeHands(SDNode *N) { 1044 SDOperand N0 = N->getOperand(0), N1 = N->getOperand(1); 1045 MVT::ValueType VT = N0.getValueType(); 1046 assert(N0.getOpcode() == N1.getOpcode() && "Bad input!"); 1047 1048 // For each of OP in AND/OR/XOR: 1049 // fold (OP (zext x), (zext y)) -> (zext (OP x, y)) 1050 // fold (OP (sext x), (sext y)) -> (sext (OP x, y)) 1051 // fold (OP (aext x), (aext y)) -> (aext (OP x, y)) 1052 // fold (OP (trunc x), (trunc y)) -> (trunc (OP x, y)) 1053 if ((N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::ANY_EXTEND|| 1054 N0.getOpcode() == ISD::SIGN_EXTEND || N0.getOpcode() == ISD::TRUNCATE) && 1055 N0.getOperand(0).getValueType() == N1.getOperand(0).getValueType()) { 1056 SDOperand ORNode = DAG.getNode(N->getOpcode(), 1057 N0.getOperand(0).getValueType(), 1058 N0.getOperand(0), N1.getOperand(0)); 1059 AddToWorkList(ORNode.Val); 1060 return DAG.getNode(N0.getOpcode(), VT, ORNode); 1061 } 1062 1063 // For each of OP in SHL/SRL/SRA/AND... 1064 // fold (and (OP x, z), (OP y, z)) -> (OP (and x, y), z) 1065 // fold (or (OP x, z), (OP y, z)) -> (OP (or x, y), z) 1066 // fold (xor (OP x, z), (OP y, z)) -> (OP (xor x, y), z) 1067 if ((N0.getOpcode() == ISD::SHL || N0.getOpcode() == ISD::SRL || 1068 N0.getOpcode() == ISD::SRA || N0.getOpcode() == ISD::AND) && 1069 N0.getOperand(1) == N1.getOperand(1)) { 1070 SDOperand ORNode = DAG.getNode(N->getOpcode(), 1071 N0.getOperand(0).getValueType(), 1072 N0.getOperand(0), N1.getOperand(0)); 1073 AddToWorkList(ORNode.Val); 1074 return DAG.getNode(N0.getOpcode(), VT, ORNode, N0.getOperand(1)); 1075 } 1076 1077 return SDOperand(); 1078} 1079 1080SDOperand DAGCombiner::visitAND(SDNode *N) { 1081 SDOperand N0 = N->getOperand(0); 1082 SDOperand N1 = N->getOperand(1); 1083 SDOperand LL, LR, RL, RR, CC0, CC1; 1084 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1085 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1086 MVT::ValueType VT = N1.getValueType(); 1087 unsigned OpSizeInBits = MVT::getSizeInBits(VT); 1088 1089 // fold (and c1, c2) -> c1&c2 1090 if (N0C && N1C) 1091 return DAG.getNode(ISD::AND, VT, N0, N1); 1092 // canonicalize constant to RHS 1093 if (N0C && !N1C) 1094 return DAG.getNode(ISD::AND, VT, N1, N0); 1095 // fold (and x, -1) -> x 1096 if (N1C && N1C->isAllOnesValue()) 1097 return N0; 1098 // if (and x, c) is known to be zero, return 0 1099 if (N1C && TLI.MaskedValueIsZero(SDOperand(N, 0), MVT::getIntVTBitMask(VT))) 1100 return DAG.getConstant(0, VT); 1101 // reassociate and 1102 SDOperand RAND = ReassociateOps(ISD::AND, N0, N1); 1103 if (RAND.Val != 0) 1104 return RAND; 1105 // fold (and (or x, 0xFFFF), 0xFF) -> 0xFF 1106 if (N1C && N0.getOpcode() == ISD::OR) 1107 if (ConstantSDNode *ORI = dyn_cast<ConstantSDNode>(N0.getOperand(1))) 1108 if ((ORI->getValue() & N1C->getValue()) == N1C->getValue()) 1109 return N1; 1110 // fold (and (any_ext V), c) -> (zero_ext V) if 'and' only clears top bits. 1111 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) { 1112 unsigned InMask = MVT::getIntVTBitMask(N0.getOperand(0).getValueType()); 1113 if (TLI.MaskedValueIsZero(N0.getOperand(0), 1114 ~N1C->getValue() & InMask)) { 1115 SDOperand Zext = DAG.getNode(ISD::ZERO_EXTEND, N0.getValueType(), 1116 N0.getOperand(0)); 1117 1118 // Replace uses of the AND with uses of the Zero extend node. 1119 CombineTo(N, Zext); 1120 1121 // We actually want to replace all uses of the any_extend with the 1122 // zero_extend, to avoid duplicating things. This will later cause this 1123 // AND to be folded. 1124 CombineTo(N0.Val, Zext); 1125 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1126 } 1127 } 1128 // fold (and (setcc x), (setcc y)) -> (setcc (and x, y)) 1129 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){ 1130 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get(); 1131 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get(); 1132 1133 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 && 1134 MVT::isInteger(LL.getValueType())) { 1135 // fold (X == 0) & (Y == 0) -> (X|Y == 0) 1136 if (cast<ConstantSDNode>(LR)->getValue() == 0 && Op1 == ISD::SETEQ) { 1137 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL); 1138 AddToWorkList(ORNode.Val); 1139 return DAG.getSetCC(VT, ORNode, LR, Op1); 1140 } 1141 // fold (X == -1) & (Y == -1) -> (X&Y == -1) 1142 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETEQ) { 1143 SDOperand ANDNode = DAG.getNode(ISD::AND, LR.getValueType(), LL, RL); 1144 AddToWorkList(ANDNode.Val); 1145 return DAG.getSetCC(VT, ANDNode, LR, Op1); 1146 } 1147 // fold (X > -1) & (Y > -1) -> (X|Y > -1) 1148 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && Op1 == ISD::SETGT) { 1149 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL); 1150 AddToWorkList(ORNode.Val); 1151 return DAG.getSetCC(VT, ORNode, LR, Op1); 1152 } 1153 } 1154 // canonicalize equivalent to ll == rl 1155 if (LL == RR && LR == RL) { 1156 Op1 = ISD::getSetCCSwappedOperands(Op1); 1157 std::swap(RL, RR); 1158 } 1159 if (LL == RL && LR == RR) { 1160 bool isInteger = MVT::isInteger(LL.getValueType()); 1161 ISD::CondCode Result = ISD::getSetCCAndOperation(Op0, Op1, isInteger); 1162 if (Result != ISD::SETCC_INVALID) 1163 return DAG.getSetCC(N0.getValueType(), LL, LR, Result); 1164 } 1165 } 1166 1167 // Simplify: and (op x...), (op y...) -> (op (and x, y)) 1168 if (N0.getOpcode() == N1.getOpcode()) { 1169 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N); 1170 if (Tmp.Val) return Tmp; 1171 } 1172 1173 // fold (and (sign_extend_inreg x, i16 to i32), 1) -> (and x, 1) 1174 // fold (and (sra)) -> (and (srl)) when possible. 1175 if (!MVT::isVector(VT) && 1176 SimplifyDemandedBits(SDOperand(N, 0))) 1177 return SDOperand(N, 0); 1178 // fold (zext_inreg (extload x)) -> (zextload x) 1179 if (N0.getOpcode() == ISD::EXTLOAD) { 1180 MVT::ValueType EVT = cast<VTSDNode>(N0.getOperand(3))->getVT(); 1181 // If we zero all the possible extended bits, then we can turn this into 1182 // a zextload if we are running before legalize or the operation is legal. 1183 if (TLI.MaskedValueIsZero(N1, ~0ULL << MVT::getSizeInBits(EVT)) && 1184 (!AfterLegalize || TLI.isOperationLegal(ISD::ZEXTLOAD, EVT))) { 1185 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getOperand(0), 1186 N0.getOperand(1), N0.getOperand(2), 1187 EVT); 1188 AddToWorkList(N); 1189 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1)); 1190 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1191 } 1192 } 1193 // fold (zext_inreg (sextload x)) -> (zextload x) iff load has one use 1194 if (N0.getOpcode() == ISD::SEXTLOAD && N0.hasOneUse()) { 1195 MVT::ValueType EVT = cast<VTSDNode>(N0.getOperand(3))->getVT(); 1196 // If we zero all the possible extended bits, then we can turn this into 1197 // a zextload if we are running before legalize or the operation is legal. 1198 if (TLI.MaskedValueIsZero(N1, ~0ULL << MVT::getSizeInBits(EVT)) && 1199 (!AfterLegalize || TLI.isOperationLegal(ISD::ZEXTLOAD, EVT))) { 1200 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getOperand(0), 1201 N0.getOperand(1), N0.getOperand(2), 1202 EVT); 1203 AddToWorkList(N); 1204 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1)); 1205 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1206 } 1207 } 1208 1209 // fold (and (load x), 255) -> (zextload x, i8) 1210 // fold (and (extload x, i16), 255) -> (zextload x, i8) 1211 if (N1C && 1212 (N0.getOpcode() == ISD::LOAD || N0.getOpcode() == ISD::EXTLOAD || 1213 N0.getOpcode() == ISD::ZEXTLOAD) && 1214 N0.hasOneUse()) { 1215 MVT::ValueType EVT, LoadedVT; 1216 if (N1C->getValue() == 255) 1217 EVT = MVT::i8; 1218 else if (N1C->getValue() == 65535) 1219 EVT = MVT::i16; 1220 else if (N1C->getValue() == ~0U) 1221 EVT = MVT::i32; 1222 else 1223 EVT = MVT::Other; 1224 1225 LoadedVT = N0.getOpcode() == ISD::LOAD ? VT : 1226 cast<VTSDNode>(N0.getOperand(3))->getVT(); 1227 if (EVT != MVT::Other && LoadedVT > EVT && 1228 (!AfterLegalize || TLI.isOperationLegal(ISD::ZEXTLOAD, EVT))) { 1229 MVT::ValueType PtrType = N0.getOperand(1).getValueType(); 1230 // For big endian targets, we need to add an offset to the pointer to load 1231 // the correct bytes. For little endian systems, we merely need to read 1232 // fewer bytes from the same pointer. 1233 unsigned PtrOff = 1234 (MVT::getSizeInBits(LoadedVT) - MVT::getSizeInBits(EVT)) / 8; 1235 SDOperand NewPtr = N0.getOperand(1); 1236 if (!TLI.isLittleEndian()) 1237 NewPtr = DAG.getNode(ISD::ADD, PtrType, NewPtr, 1238 DAG.getConstant(PtrOff, PtrType)); 1239 AddToWorkList(NewPtr.Val); 1240 SDOperand Load = 1241 DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getOperand(0), NewPtr, 1242 N0.getOperand(2), EVT); 1243 AddToWorkList(N); 1244 CombineTo(N0.Val, Load, Load.getValue(1)); 1245 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1246 } 1247 } 1248 1249 return SDOperand(); 1250} 1251 1252SDOperand DAGCombiner::visitOR(SDNode *N) { 1253 SDOperand N0 = N->getOperand(0); 1254 SDOperand N1 = N->getOperand(1); 1255 SDOperand LL, LR, RL, RR, CC0, CC1; 1256 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1257 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1258 MVT::ValueType VT = N1.getValueType(); 1259 unsigned OpSizeInBits = MVT::getSizeInBits(VT); 1260 1261 // fold (or c1, c2) -> c1|c2 1262 if (N0C && N1C) 1263 return DAG.getNode(ISD::OR, VT, N0, N1); 1264 // canonicalize constant to RHS 1265 if (N0C && !N1C) 1266 return DAG.getNode(ISD::OR, VT, N1, N0); 1267 // fold (or x, 0) -> x 1268 if (N1C && N1C->isNullValue()) 1269 return N0; 1270 // fold (or x, -1) -> -1 1271 if (N1C && N1C->isAllOnesValue()) 1272 return N1; 1273 // fold (or x, c) -> c iff (x & ~c) == 0 1274 if (N1C && 1275 TLI.MaskedValueIsZero(N0,~N1C->getValue() & (~0ULL>>(64-OpSizeInBits)))) 1276 return N1; 1277 // reassociate or 1278 SDOperand ROR = ReassociateOps(ISD::OR, N0, N1); 1279 if (ROR.Val != 0) 1280 return ROR; 1281 // Canonicalize (or (and X, c1), c2) -> (and (or X, c2), c1|c2) 1282 if (N1C && N0.getOpcode() == ISD::AND && N0.Val->hasOneUse() && 1283 isa<ConstantSDNode>(N0.getOperand(1))) { 1284 ConstantSDNode *C1 = cast<ConstantSDNode>(N0.getOperand(1)); 1285 return DAG.getNode(ISD::AND, VT, DAG.getNode(ISD::OR, VT, N0.getOperand(0), 1286 N1), 1287 DAG.getConstant(N1C->getValue() | C1->getValue(), VT)); 1288 } 1289 // fold (or (setcc x), (setcc y)) -> (setcc (or x, y)) 1290 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){ 1291 ISD::CondCode Op0 = cast<CondCodeSDNode>(CC0)->get(); 1292 ISD::CondCode Op1 = cast<CondCodeSDNode>(CC1)->get(); 1293 1294 if (LR == RR && isa<ConstantSDNode>(LR) && Op0 == Op1 && 1295 MVT::isInteger(LL.getValueType())) { 1296 // fold (X != 0) | (Y != 0) -> (X|Y != 0) 1297 // fold (X < 0) | (Y < 0) -> (X|Y < 0) 1298 if (cast<ConstantSDNode>(LR)->getValue() == 0 && 1299 (Op1 == ISD::SETNE || Op1 == ISD::SETLT)) { 1300 SDOperand ORNode = DAG.getNode(ISD::OR, LR.getValueType(), LL, RL); 1301 AddToWorkList(ORNode.Val); 1302 return DAG.getSetCC(VT, ORNode, LR, Op1); 1303 } 1304 // fold (X != -1) | (Y != -1) -> (X&Y != -1) 1305 // fold (X > -1) | (Y > -1) -> (X&Y > -1) 1306 if (cast<ConstantSDNode>(LR)->isAllOnesValue() && 1307 (Op1 == ISD::SETNE || Op1 == ISD::SETGT)) { 1308 SDOperand ANDNode = DAG.getNode(ISD::AND, LR.getValueType(), LL, RL); 1309 AddToWorkList(ANDNode.Val); 1310 return DAG.getSetCC(VT, ANDNode, LR, Op1); 1311 } 1312 } 1313 // canonicalize equivalent to ll == rl 1314 if (LL == RR && LR == RL) { 1315 Op1 = ISD::getSetCCSwappedOperands(Op1); 1316 std::swap(RL, RR); 1317 } 1318 if (LL == RL && LR == RR) { 1319 bool isInteger = MVT::isInteger(LL.getValueType()); 1320 ISD::CondCode Result = ISD::getSetCCOrOperation(Op0, Op1, isInteger); 1321 if (Result != ISD::SETCC_INVALID) 1322 return DAG.getSetCC(N0.getValueType(), LL, LR, Result); 1323 } 1324 } 1325 1326 // Simplify: or (op x...), (op y...) -> (op (or x, y)) 1327 if (N0.getOpcode() == N1.getOpcode()) { 1328 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N); 1329 if (Tmp.Val) return Tmp; 1330 } 1331 1332 // canonicalize shl to left side in a shl/srl pair, to match rotate 1333 if (N0.getOpcode() == ISD::SRL && N1.getOpcode() == ISD::SHL) 1334 std::swap(N0, N1); 1335 // check for rotl, rotr 1336 if (N0.getOpcode() == ISD::SHL && N1.getOpcode() == ISD::SRL && 1337 N0.getOperand(0) == N1.getOperand(0) && 1338 TLI.isOperationLegal(ISD::ROTL, VT) && TLI.isTypeLegal(VT)) { 1339 // fold (or (shl x, C1), (srl x, C2)) -> (rotl x, C1) 1340 if (N0.getOperand(1).getOpcode() == ISD::Constant && 1341 N1.getOperand(1).getOpcode() == ISD::Constant) { 1342 uint64_t c1val = cast<ConstantSDNode>(N0.getOperand(1))->getValue(); 1343 uint64_t c2val = cast<ConstantSDNode>(N1.getOperand(1))->getValue(); 1344 if ((c1val + c2val) == OpSizeInBits) 1345 return DAG.getNode(ISD::ROTL, VT, N0.getOperand(0), N0.getOperand(1)); 1346 } 1347 // fold (or (shl x, y), (srl x, (sub 32, y))) -> (rotl x, y) 1348 if (N1.getOperand(1).getOpcode() == ISD::SUB && 1349 N0.getOperand(1) == N1.getOperand(1).getOperand(1)) 1350 if (ConstantSDNode *SUBC = 1351 dyn_cast<ConstantSDNode>(N1.getOperand(1).getOperand(0))) 1352 if (SUBC->getValue() == OpSizeInBits) 1353 return DAG.getNode(ISD::ROTL, VT, N0.getOperand(0), N0.getOperand(1)); 1354 // fold (or (shl x, (sub 32, y)), (srl x, r)) -> (rotr x, y) 1355 if (N0.getOperand(1).getOpcode() == ISD::SUB && 1356 N1.getOperand(1) == N0.getOperand(1).getOperand(1)) 1357 if (ConstantSDNode *SUBC = 1358 dyn_cast<ConstantSDNode>(N0.getOperand(1).getOperand(0))) 1359 if (SUBC->getValue() == OpSizeInBits) { 1360 if (TLI.isOperationLegal(ISD::ROTR, VT) && TLI.isTypeLegal(VT)) 1361 return DAG.getNode(ISD::ROTR, VT, N0.getOperand(0), 1362 N1.getOperand(1)); 1363 else 1364 return DAG.getNode(ISD::ROTL, VT, N0.getOperand(0), 1365 N0.getOperand(1)); 1366 } 1367 } 1368 return SDOperand(); 1369} 1370 1371SDOperand DAGCombiner::visitXOR(SDNode *N) { 1372 SDOperand N0 = N->getOperand(0); 1373 SDOperand N1 = N->getOperand(1); 1374 SDOperand LHS, RHS, CC; 1375 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1376 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1377 MVT::ValueType VT = N0.getValueType(); 1378 1379 // fold (xor c1, c2) -> c1^c2 1380 if (N0C && N1C) 1381 return DAG.getNode(ISD::XOR, VT, N0, N1); 1382 // canonicalize constant to RHS 1383 if (N0C && !N1C) 1384 return DAG.getNode(ISD::XOR, VT, N1, N0); 1385 // fold (xor x, 0) -> x 1386 if (N1C && N1C->isNullValue()) 1387 return N0; 1388 // reassociate xor 1389 SDOperand RXOR = ReassociateOps(ISD::XOR, N0, N1); 1390 if (RXOR.Val != 0) 1391 return RXOR; 1392 // fold !(x cc y) -> (x !cc y) 1393 if (N1C && N1C->getValue() == 1 && isSetCCEquivalent(N0, LHS, RHS, CC)) { 1394 bool isInt = MVT::isInteger(LHS.getValueType()); 1395 ISD::CondCode NotCC = ISD::getSetCCInverse(cast<CondCodeSDNode>(CC)->get(), 1396 isInt); 1397 if (N0.getOpcode() == ISD::SETCC) 1398 return DAG.getSetCC(VT, LHS, RHS, NotCC); 1399 if (N0.getOpcode() == ISD::SELECT_CC) 1400 return DAG.getSelectCC(LHS, RHS, N0.getOperand(2),N0.getOperand(3),NotCC); 1401 assert(0 && "Unhandled SetCC Equivalent!"); 1402 abort(); 1403 } 1404 // fold !(x or y) -> (!x and !y) iff x or y are setcc 1405 if (N1C && N1C->getValue() == 1 && 1406 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) { 1407 SDOperand LHS = N0.getOperand(0), RHS = N0.getOperand(1); 1408 if (isOneUseSetCC(RHS) || isOneUseSetCC(LHS)) { 1409 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND; 1410 LHS = DAG.getNode(ISD::XOR, VT, LHS, N1); // RHS = ~LHS 1411 RHS = DAG.getNode(ISD::XOR, VT, RHS, N1); // RHS = ~RHS 1412 AddToWorkList(LHS.Val); AddToWorkList(RHS.Val); 1413 return DAG.getNode(NewOpcode, VT, LHS, RHS); 1414 } 1415 } 1416 // fold !(x or y) -> (!x and !y) iff x or y are constants 1417 if (N1C && N1C->isAllOnesValue() && 1418 (N0.getOpcode() == ISD::OR || N0.getOpcode() == ISD::AND)) { 1419 SDOperand LHS = N0.getOperand(0), RHS = N0.getOperand(1); 1420 if (isa<ConstantSDNode>(RHS) || isa<ConstantSDNode>(LHS)) { 1421 unsigned NewOpcode = N0.getOpcode() == ISD::AND ? ISD::OR : ISD::AND; 1422 LHS = DAG.getNode(ISD::XOR, VT, LHS, N1); // RHS = ~LHS 1423 RHS = DAG.getNode(ISD::XOR, VT, RHS, N1); // RHS = ~RHS 1424 AddToWorkList(LHS.Val); AddToWorkList(RHS.Val); 1425 return DAG.getNode(NewOpcode, VT, LHS, RHS); 1426 } 1427 } 1428 // fold (xor (xor x, c1), c2) -> (xor x, c1^c2) 1429 if (N1C && N0.getOpcode() == ISD::XOR) { 1430 ConstantSDNode *N00C = dyn_cast<ConstantSDNode>(N0.getOperand(0)); 1431 ConstantSDNode *N01C = dyn_cast<ConstantSDNode>(N0.getOperand(1)); 1432 if (N00C) 1433 return DAG.getNode(ISD::XOR, VT, N0.getOperand(1), 1434 DAG.getConstant(N1C->getValue()^N00C->getValue(), VT)); 1435 if (N01C) 1436 return DAG.getNode(ISD::XOR, VT, N0.getOperand(0), 1437 DAG.getConstant(N1C->getValue()^N01C->getValue(), VT)); 1438 } 1439 // fold (xor x, x) -> 0 1440 if (N0 == N1) { 1441 if (!MVT::isVector(VT)) { 1442 return DAG.getConstant(0, VT); 1443 } else if (!AfterLegalize || TLI.isOperationLegal(ISD::BUILD_VECTOR, VT)) { 1444 // Produce a vector of zeros. 1445 SDOperand El = DAG.getConstant(0, MVT::getVectorBaseType(VT)); 1446 std::vector<SDOperand> Ops(MVT::getVectorNumElements(VT), El); 1447 return DAG.getNode(ISD::BUILD_VECTOR, VT, Ops); 1448 } 1449 } 1450 1451 // Simplify: xor (op x...), (op y...) -> (op (xor x, y)) 1452 if (N0.getOpcode() == N1.getOpcode()) { 1453 SDOperand Tmp = SimplifyBinOpWithSameOpcodeHands(N); 1454 if (Tmp.Val) return Tmp; 1455 } 1456 1457 // Simplify the expression using non-local knowledge. 1458 if (!MVT::isVector(VT) && 1459 SimplifyDemandedBits(SDOperand(N, 0))) 1460 return SDOperand(N, 0); 1461 1462 return SDOperand(); 1463} 1464 1465SDOperand DAGCombiner::visitSHL(SDNode *N) { 1466 SDOperand N0 = N->getOperand(0); 1467 SDOperand N1 = N->getOperand(1); 1468 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1469 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1470 MVT::ValueType VT = N0.getValueType(); 1471 unsigned OpSizeInBits = MVT::getSizeInBits(VT); 1472 1473 // fold (shl c1, c2) -> c1<<c2 1474 if (N0C && N1C) 1475 return DAG.getNode(ISD::SHL, VT, N0, N1); 1476 // fold (shl 0, x) -> 0 1477 if (N0C && N0C->isNullValue()) 1478 return N0; 1479 // fold (shl x, c >= size(x)) -> undef 1480 if (N1C && N1C->getValue() >= OpSizeInBits) 1481 return DAG.getNode(ISD::UNDEF, VT); 1482 // fold (shl x, 0) -> x 1483 if (N1C && N1C->isNullValue()) 1484 return N0; 1485 // if (shl x, c) is known to be zero, return 0 1486 if (TLI.MaskedValueIsZero(SDOperand(N, 0), MVT::getIntVTBitMask(VT))) 1487 return DAG.getConstant(0, VT); 1488 if (SimplifyDemandedBits(SDOperand(N, 0))) 1489 return SDOperand(N, 0); 1490 // fold (shl (shl x, c1), c2) -> 0 or (shl x, c1+c2) 1491 if (N1C && N0.getOpcode() == ISD::SHL && 1492 N0.getOperand(1).getOpcode() == ISD::Constant) { 1493 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue(); 1494 uint64_t c2 = N1C->getValue(); 1495 if (c1 + c2 > OpSizeInBits) 1496 return DAG.getConstant(0, VT); 1497 return DAG.getNode(ISD::SHL, VT, N0.getOperand(0), 1498 DAG.getConstant(c1 + c2, N1.getValueType())); 1499 } 1500 // fold (shl (srl x, c1), c2) -> (shl (and x, -1 << c1), c2-c1) or 1501 // (srl (and x, -1 << c1), c1-c2) 1502 if (N1C && N0.getOpcode() == ISD::SRL && 1503 N0.getOperand(1).getOpcode() == ISD::Constant) { 1504 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue(); 1505 uint64_t c2 = N1C->getValue(); 1506 SDOperand Mask = DAG.getNode(ISD::AND, VT, N0.getOperand(0), 1507 DAG.getConstant(~0ULL << c1, VT)); 1508 if (c2 > c1) 1509 return DAG.getNode(ISD::SHL, VT, Mask, 1510 DAG.getConstant(c2-c1, N1.getValueType())); 1511 else 1512 return DAG.getNode(ISD::SRL, VT, Mask, 1513 DAG.getConstant(c1-c2, N1.getValueType())); 1514 } 1515 // fold (shl (sra x, c1), c1) -> (and x, -1 << c1) 1516 if (N1C && N0.getOpcode() == ISD::SRA && N1 == N0.getOperand(1)) 1517 return DAG.getNode(ISD::AND, VT, N0.getOperand(0), 1518 DAG.getConstant(~0ULL << N1C->getValue(), VT)); 1519 // fold (shl (add x, c1), c2) -> (add (shl x, c2), c1<<c2) 1520 if (N1C && N0.getOpcode() == ISD::ADD && N0.Val->hasOneUse() && 1521 isa<ConstantSDNode>(N0.getOperand(1))) { 1522 return DAG.getNode(ISD::ADD, VT, 1523 DAG.getNode(ISD::SHL, VT, N0.getOperand(0), N1), 1524 DAG.getNode(ISD::SHL, VT, N0.getOperand(1), N1)); 1525 } 1526 return SDOperand(); 1527} 1528 1529SDOperand DAGCombiner::visitSRA(SDNode *N) { 1530 SDOperand N0 = N->getOperand(0); 1531 SDOperand N1 = N->getOperand(1); 1532 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1533 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1534 MVT::ValueType VT = N0.getValueType(); 1535 1536 // fold (sra c1, c2) -> c1>>c2 1537 if (N0C && N1C) 1538 return DAG.getNode(ISD::SRA, VT, N0, N1); 1539 // fold (sra 0, x) -> 0 1540 if (N0C && N0C->isNullValue()) 1541 return N0; 1542 // fold (sra -1, x) -> -1 1543 if (N0C && N0C->isAllOnesValue()) 1544 return N0; 1545 // fold (sra x, c >= size(x)) -> undef 1546 if (N1C && N1C->getValue() >= MVT::getSizeInBits(VT)) 1547 return DAG.getNode(ISD::UNDEF, VT); 1548 // fold (sra x, 0) -> x 1549 if (N1C && N1C->isNullValue()) 1550 return N0; 1551 // fold (sra (shl x, c1), c1) -> sext_inreg for some c1 and target supports 1552 // sext_inreg. 1553 if (N1C && N0.getOpcode() == ISD::SHL && N1 == N0.getOperand(1)) { 1554 unsigned LowBits = MVT::getSizeInBits(VT) - (unsigned)N1C->getValue(); 1555 MVT::ValueType EVT; 1556 switch (LowBits) { 1557 default: EVT = MVT::Other; break; 1558 case 1: EVT = MVT::i1; break; 1559 case 8: EVT = MVT::i8; break; 1560 case 16: EVT = MVT::i16; break; 1561 case 32: EVT = MVT::i32; break; 1562 } 1563 if (EVT > MVT::Other && TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, EVT)) 1564 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0.getOperand(0), 1565 DAG.getValueType(EVT)); 1566 } 1567 1568 // fold (sra (sra x, c1), c2) -> (sra x, c1+c2) 1569 if (N1C && N0.getOpcode() == ISD::SRA) { 1570 if (ConstantSDNode *C1 = dyn_cast<ConstantSDNode>(N0.getOperand(1))) { 1571 unsigned Sum = N1C->getValue() + C1->getValue(); 1572 if (Sum >= MVT::getSizeInBits(VT)) Sum = MVT::getSizeInBits(VT)-1; 1573 return DAG.getNode(ISD::SRA, VT, N0.getOperand(0), 1574 DAG.getConstant(Sum, N1C->getValueType(0))); 1575 } 1576 } 1577 1578 // If the sign bit is known to be zero, switch this to a SRL. 1579 if (TLI.MaskedValueIsZero(N0, MVT::getIntVTSignBit(VT))) 1580 return DAG.getNode(ISD::SRL, VT, N0, N1); 1581 return SDOperand(); 1582} 1583 1584SDOperand DAGCombiner::visitSRL(SDNode *N) { 1585 SDOperand N0 = N->getOperand(0); 1586 SDOperand N1 = N->getOperand(1); 1587 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1588 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1589 MVT::ValueType VT = N0.getValueType(); 1590 unsigned OpSizeInBits = MVT::getSizeInBits(VT); 1591 1592 // fold (srl c1, c2) -> c1 >>u c2 1593 if (N0C && N1C) 1594 return DAG.getNode(ISD::SRL, VT, N0, N1); 1595 // fold (srl 0, x) -> 0 1596 if (N0C && N0C->isNullValue()) 1597 return N0; 1598 // fold (srl x, c >= size(x)) -> undef 1599 if (N1C && N1C->getValue() >= OpSizeInBits) 1600 return DAG.getNode(ISD::UNDEF, VT); 1601 // fold (srl x, 0) -> x 1602 if (N1C && N1C->isNullValue()) 1603 return N0; 1604 // if (srl x, c) is known to be zero, return 0 1605 if (N1C && TLI.MaskedValueIsZero(SDOperand(N, 0), ~0ULL >> (64-OpSizeInBits))) 1606 return DAG.getConstant(0, VT); 1607 // fold (srl (srl x, c1), c2) -> 0 or (srl x, c1+c2) 1608 if (N1C && N0.getOpcode() == ISD::SRL && 1609 N0.getOperand(1).getOpcode() == ISD::Constant) { 1610 uint64_t c1 = cast<ConstantSDNode>(N0.getOperand(1))->getValue(); 1611 uint64_t c2 = N1C->getValue(); 1612 if (c1 + c2 > OpSizeInBits) 1613 return DAG.getConstant(0, VT); 1614 return DAG.getNode(ISD::SRL, VT, N0.getOperand(0), 1615 DAG.getConstant(c1 + c2, N1.getValueType())); 1616 } 1617 1618 // fold (srl (anyextend x), c) -> (anyextend (srl x, c)) 1619 if (N1C && N0.getOpcode() == ISD::ANY_EXTEND) { 1620 // Shifting in all undef bits? 1621 MVT::ValueType SmallVT = N0.getOperand(0).getValueType(); 1622 if (N1C->getValue() >= MVT::getSizeInBits(SmallVT)) 1623 return DAG.getNode(ISD::UNDEF, VT); 1624 1625 SDOperand SmallShift = DAG.getNode(ISD::SRL, SmallVT, N0.getOperand(0), N1); 1626 AddToWorkList(SmallShift.Val); 1627 return DAG.getNode(ISD::ANY_EXTEND, VT, SmallShift); 1628 } 1629 1630 // fold (srl (ctlz x), "5") -> x iff x has one bit set (the low bit). 1631 if (N1C && N0.getOpcode() == ISD::CTLZ && 1632 N1C->getValue() == Log2_32(MVT::getSizeInBits(VT))) { 1633 uint64_t KnownZero, KnownOne, Mask = MVT::getIntVTBitMask(VT); 1634 TLI.ComputeMaskedBits(N0.getOperand(0), Mask, KnownZero, KnownOne); 1635 1636 // If any of the input bits are KnownOne, then the input couldn't be all 1637 // zeros, thus the result of the srl will always be zero. 1638 if (KnownOne) return DAG.getConstant(0, VT); 1639 1640 // If all of the bits input the to ctlz node are known to be zero, then 1641 // the result of the ctlz is "32" and the result of the shift is one. 1642 uint64_t UnknownBits = ~KnownZero & Mask; 1643 if (UnknownBits == 0) return DAG.getConstant(1, VT); 1644 1645 // Otherwise, check to see if there is exactly one bit input to the ctlz. 1646 if ((UnknownBits & (UnknownBits-1)) == 0) { 1647 // Okay, we know that only that the single bit specified by UnknownBits 1648 // could be set on input to the CTLZ node. If this bit is set, the SRL 1649 // will return 0, if it is clear, it returns 1. Change the CTLZ/SRL pair 1650 // to an SRL,XOR pair, which is likely to simplify more. 1651 unsigned ShAmt = CountTrailingZeros_64(UnknownBits); 1652 SDOperand Op = N0.getOperand(0); 1653 if (ShAmt) { 1654 Op = DAG.getNode(ISD::SRL, VT, Op, 1655 DAG.getConstant(ShAmt, TLI.getShiftAmountTy())); 1656 AddToWorkList(Op.Val); 1657 } 1658 return DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(1, VT)); 1659 } 1660 } 1661 1662 return SDOperand(); 1663} 1664 1665SDOperand DAGCombiner::visitCTLZ(SDNode *N) { 1666 SDOperand N0 = N->getOperand(0); 1667 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1668 MVT::ValueType VT = N->getValueType(0); 1669 1670 // fold (ctlz c1) -> c2 1671 if (N0C) 1672 return DAG.getNode(ISD::CTLZ, VT, N0); 1673 return SDOperand(); 1674} 1675 1676SDOperand DAGCombiner::visitCTTZ(SDNode *N) { 1677 SDOperand N0 = N->getOperand(0); 1678 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1679 MVT::ValueType VT = N->getValueType(0); 1680 1681 // fold (cttz c1) -> c2 1682 if (N0C) 1683 return DAG.getNode(ISD::CTTZ, VT, N0); 1684 return SDOperand(); 1685} 1686 1687SDOperand DAGCombiner::visitCTPOP(SDNode *N) { 1688 SDOperand N0 = N->getOperand(0); 1689 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1690 MVT::ValueType VT = N->getValueType(0); 1691 1692 // fold (ctpop c1) -> c2 1693 if (N0C) 1694 return DAG.getNode(ISD::CTPOP, VT, N0); 1695 return SDOperand(); 1696} 1697 1698SDOperand DAGCombiner::visitSELECT(SDNode *N) { 1699 SDOperand N0 = N->getOperand(0); 1700 SDOperand N1 = N->getOperand(1); 1701 SDOperand N2 = N->getOperand(2); 1702 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1703 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1704 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2); 1705 MVT::ValueType VT = N->getValueType(0); 1706 1707 // fold select C, X, X -> X 1708 if (N1 == N2) 1709 return N1; 1710 // fold select true, X, Y -> X 1711 if (N0C && !N0C->isNullValue()) 1712 return N1; 1713 // fold select false, X, Y -> Y 1714 if (N0C && N0C->isNullValue()) 1715 return N2; 1716 // fold select C, 1, X -> C | X 1717 if (MVT::i1 == VT && N1C && N1C->getValue() == 1) 1718 return DAG.getNode(ISD::OR, VT, N0, N2); 1719 // fold select C, 0, X -> ~C & X 1720 // FIXME: this should check for C type == X type, not i1? 1721 if (MVT::i1 == VT && N1C && N1C->isNullValue()) { 1722 SDOperand XORNode = DAG.getNode(ISD::XOR, VT, N0, DAG.getConstant(1, VT)); 1723 AddToWorkList(XORNode.Val); 1724 return DAG.getNode(ISD::AND, VT, XORNode, N2); 1725 } 1726 // fold select C, X, 1 -> ~C | X 1727 if (MVT::i1 == VT && N2C && N2C->getValue() == 1) { 1728 SDOperand XORNode = DAG.getNode(ISD::XOR, VT, N0, DAG.getConstant(1, VT)); 1729 AddToWorkList(XORNode.Val); 1730 return DAG.getNode(ISD::OR, VT, XORNode, N1); 1731 } 1732 // fold select C, X, 0 -> C & X 1733 // FIXME: this should check for C type == X type, not i1? 1734 if (MVT::i1 == VT && N2C && N2C->isNullValue()) 1735 return DAG.getNode(ISD::AND, VT, N0, N1); 1736 // fold X ? X : Y --> X ? 1 : Y --> X | Y 1737 if (MVT::i1 == VT && N0 == N1) 1738 return DAG.getNode(ISD::OR, VT, N0, N2); 1739 // fold X ? Y : X --> X ? Y : 0 --> X & Y 1740 if (MVT::i1 == VT && N0 == N2) 1741 return DAG.getNode(ISD::AND, VT, N0, N1); 1742 // If we can fold this based on the true/false value, do so. 1743 if (SimplifySelectOps(N, N1, N2)) 1744 return SDOperand(); 1745 // fold selects based on a setcc into other things, such as min/max/abs 1746 if (N0.getOpcode() == ISD::SETCC) 1747 // FIXME: 1748 // Check against MVT::Other for SELECT_CC, which is a workaround for targets 1749 // having to say they don't support SELECT_CC on every type the DAG knows 1750 // about, since there is no way to mark an opcode illegal at all value types 1751 if (TLI.isOperationLegal(ISD::SELECT_CC, MVT::Other)) 1752 return DAG.getNode(ISD::SELECT_CC, VT, N0.getOperand(0), N0.getOperand(1), 1753 N1, N2, N0.getOperand(2)); 1754 else 1755 return SimplifySelect(N0, N1, N2); 1756 return SDOperand(); 1757} 1758 1759SDOperand DAGCombiner::visitSELECT_CC(SDNode *N) { 1760 SDOperand N0 = N->getOperand(0); 1761 SDOperand N1 = N->getOperand(1); 1762 SDOperand N2 = N->getOperand(2); 1763 SDOperand N3 = N->getOperand(3); 1764 SDOperand N4 = N->getOperand(4); 1765 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1766 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 1767 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2); 1768 ISD::CondCode CC = cast<CondCodeSDNode>(N4)->get(); 1769 1770 // Determine if the condition we're dealing with is constant 1771 SDOperand SCC = SimplifySetCC(TLI.getSetCCResultTy(), N0, N1, CC, false); 1772 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.Val); 1773 1774 // fold select_cc lhs, rhs, x, x, cc -> x 1775 if (N2 == N3) 1776 return N2; 1777 1778 // If we can fold this based on the true/false value, do so. 1779 if (SimplifySelectOps(N, N2, N3)) 1780 return SDOperand(); 1781 1782 // fold select_cc into other things, such as min/max/abs 1783 return SimplifySelectCC(N0, N1, N2, N3, CC); 1784} 1785 1786SDOperand DAGCombiner::visitSETCC(SDNode *N) { 1787 return SimplifySetCC(N->getValueType(0), N->getOperand(0), N->getOperand(1), 1788 cast<CondCodeSDNode>(N->getOperand(2))->get()); 1789} 1790 1791SDOperand DAGCombiner::visitSIGN_EXTEND(SDNode *N) { 1792 SDOperand N0 = N->getOperand(0); 1793 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1794 MVT::ValueType VT = N->getValueType(0); 1795 1796 // fold (sext c1) -> c1 1797 if (N0C) 1798 return DAG.getNode(ISD::SIGN_EXTEND, VT, N0); 1799 // fold (sext (sext x)) -> (sext x) 1800 if (N0.getOpcode() == ISD::SIGN_EXTEND) 1801 return DAG.getNode(ISD::SIGN_EXTEND, VT, N0.getOperand(0)); 1802 // fold (sext (truncate x)) -> (sextinreg x) iff x size == sext size. 1803 if (N0.getOpcode() == ISD::TRUNCATE && N0.getOperand(0).getValueType() == VT&& 1804 (!AfterLegalize || 1805 TLI.isOperationLegal(ISD::SIGN_EXTEND_INREG, N0.getValueType()))) 1806 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0.getOperand(0), 1807 DAG.getValueType(N0.getValueType())); 1808 // fold (sext (load x)) -> (sext (truncate (sextload x))) 1809 if (N0.getOpcode() == ISD::LOAD && N0.hasOneUse() && 1810 (!AfterLegalize||TLI.isOperationLegal(ISD::SEXTLOAD, N0.getValueType()))){ 1811 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N0.getOperand(0), 1812 N0.getOperand(1), N0.getOperand(2), 1813 N0.getValueType()); 1814 CombineTo(N, ExtLoad); 1815 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1816 ExtLoad.getValue(1)); 1817 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1818 } 1819 1820 // fold (sext (sextload x)) -> (sext (truncate (sextload x))) 1821 // fold (sext ( extload x)) -> (sext (truncate (sextload x))) 1822 if ((N0.getOpcode() == ISD::SEXTLOAD || N0.getOpcode() == ISD::EXTLOAD) && 1823 N0.hasOneUse()) { 1824 SDOperand ExtLoad = DAG.getNode(ISD::SEXTLOAD, VT, N0.getOperand(0), 1825 N0.getOperand(1), N0.getOperand(2), 1826 N0.getOperand(3)); 1827 CombineTo(N, ExtLoad); 1828 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1829 ExtLoad.getValue(1)); 1830 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1831 } 1832 1833 return SDOperand(); 1834} 1835 1836SDOperand DAGCombiner::visitZERO_EXTEND(SDNode *N) { 1837 SDOperand N0 = N->getOperand(0); 1838 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1839 MVT::ValueType VT = N->getValueType(0); 1840 1841 // fold (zext c1) -> c1 1842 if (N0C) 1843 return DAG.getNode(ISD::ZERO_EXTEND, VT, N0); 1844 // fold (zext (zext x)) -> (zext x) 1845 if (N0.getOpcode() == ISD::ZERO_EXTEND) 1846 return DAG.getNode(ISD::ZERO_EXTEND, VT, N0.getOperand(0)); 1847 // fold (zext (truncate x)) -> (zextinreg x) iff x size == zext size. 1848 if (N0.getOpcode() == ISD::TRUNCATE && N0.getOperand(0).getValueType() == VT&& 1849 (!AfterLegalize || TLI.isOperationLegal(ISD::AND, N0.getValueType()))) 1850 return DAG.getZeroExtendInReg(N0.getOperand(0), N0.getValueType()); 1851 // fold (zext (load x)) -> (zext (truncate (zextload x))) 1852 if (N0.getOpcode() == ISD::LOAD && N0.hasOneUse() && 1853 (!AfterLegalize||TLI.isOperationLegal(ISD::ZEXTLOAD, N0.getValueType()))){ 1854 SDOperand ExtLoad = DAG.getExtLoad(ISD::ZEXTLOAD, VT, N0.getOperand(0), 1855 N0.getOperand(1), N0.getOperand(2), 1856 N0.getValueType()); 1857 CombineTo(N, ExtLoad); 1858 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1859 ExtLoad.getValue(1)); 1860 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1861 } 1862 1863 // fold (zext (zextload x)) -> (zext (truncate (zextload x))) 1864 // fold (zext ( extload x)) -> (zext (truncate (zextload x))) 1865 if ((N0.getOpcode() == ISD::ZEXTLOAD || N0.getOpcode() == ISD::EXTLOAD) && 1866 N0.hasOneUse()) { 1867 SDOperand ExtLoad = DAG.getNode(ISD::ZEXTLOAD, VT, N0.getOperand(0), 1868 N0.getOperand(1), N0.getOperand(2), 1869 N0.getOperand(3)); 1870 CombineTo(N, ExtLoad); 1871 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1872 ExtLoad.getValue(1)); 1873 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1874 } 1875 return SDOperand(); 1876} 1877 1878SDOperand DAGCombiner::visitANY_EXTEND(SDNode *N) { 1879 SDOperand N0 = N->getOperand(0); 1880 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1881 MVT::ValueType VT = N->getValueType(0); 1882 1883 // fold (aext c1) -> c1 1884 if (N0C) 1885 return DAG.getNode(ISD::ANY_EXTEND, VT, N0); 1886 // fold (aext (aext x)) -> (aext x) 1887 // fold (aext (zext x)) -> (zext x) 1888 // fold (aext (sext x)) -> (sext x) 1889 if (N0.getOpcode() == ISD::ANY_EXTEND || 1890 N0.getOpcode() == ISD::ZERO_EXTEND || 1891 N0.getOpcode() == ISD::SIGN_EXTEND) 1892 return DAG.getNode(N0.getOpcode(), VT, N0.getOperand(0)); 1893 1894 // fold (aext (truncate x)) -> x iff x size == zext size. 1895 if (N0.getOpcode() == ISD::TRUNCATE && N0.getOperand(0).getValueType() == VT) 1896 return N0.getOperand(0); 1897 // fold (aext (load x)) -> (aext (truncate (extload x))) 1898 if (N0.getOpcode() == ISD::LOAD && N0.hasOneUse() && 1899 (!AfterLegalize||TLI.isOperationLegal(ISD::EXTLOAD, N0.getValueType()))) { 1900 SDOperand ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, N0.getOperand(0), 1901 N0.getOperand(1), N0.getOperand(2), 1902 N0.getValueType()); 1903 CombineTo(N, ExtLoad); 1904 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1905 ExtLoad.getValue(1)); 1906 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1907 } 1908 1909 // fold (aext (zextload x)) -> (aext (truncate (zextload x))) 1910 // fold (aext (sextload x)) -> (aext (truncate (sextload x))) 1911 // fold (aext ( extload x)) -> (aext (truncate (extload x))) 1912 if ((N0.getOpcode() == ISD::ZEXTLOAD || N0.getOpcode() == ISD::EXTLOAD || 1913 N0.getOpcode() == ISD::SEXTLOAD) && 1914 N0.hasOneUse()) { 1915 SDOperand ExtLoad = DAG.getNode(N0.getOpcode(), VT, N0.getOperand(0), 1916 N0.getOperand(1), N0.getOperand(2), 1917 N0.getOperand(3)); 1918 CombineTo(N, ExtLoad); 1919 CombineTo(N0.Val, DAG.getNode(ISD::TRUNCATE, N0.getValueType(), ExtLoad), 1920 ExtLoad.getValue(1)); 1921 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1922 } 1923 return SDOperand(); 1924} 1925 1926 1927SDOperand DAGCombiner::visitSIGN_EXTEND_INREG(SDNode *N) { 1928 SDOperand N0 = N->getOperand(0); 1929 SDOperand N1 = N->getOperand(1); 1930 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1931 MVT::ValueType VT = N->getValueType(0); 1932 MVT::ValueType EVT = cast<VTSDNode>(N1)->getVT(); 1933 unsigned EVTBits = MVT::getSizeInBits(EVT); 1934 1935 // fold (sext_in_reg c1) -> c1 1936 if (N0C) { 1937 SDOperand Truncate = DAG.getConstant(N0C->getValue(), EVT); 1938 return DAG.getNode(ISD::SIGN_EXTEND, VT, Truncate); 1939 } 1940 1941 // If the input is already sign extended, just drop the extend. 1942 if (TLI.ComputeNumSignBits(N0) >= MVT::getSizeInBits(VT)-EVTBits+1) 1943 return N0; 1944 1945 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt1 1946 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG && 1947 cast<VTSDNode>(N0.getOperand(1))->getVT() <= EVT) { 1948 return N0; 1949 } 1950 // fold (sext_in_reg (sext_in_reg x, VT2), VT1) -> (sext_in_reg x, minVT) pt2 1951 if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG && 1952 EVT < cast<VTSDNode>(N0.getOperand(1))->getVT()) { 1953 return DAG.getNode(ISD::SIGN_EXTEND_INREG, VT, N0.getOperand(0), N1); 1954 } 1955 // fold (sext_in_reg (sextload x)) -> (sextload x) 1956 if (N0.getOpcode() == ISD::SEXTLOAD && 1957 cast<VTSDNode>(N0.getOperand(3))->getVT() <= EVT) { 1958 return N0; 1959 } 1960 // fold (sext_in_reg (setcc x)) -> setcc x iff (setcc x) == 0 or -1 1961 if (N0.getOpcode() == ISD::SETCC && 1962 TLI.getSetCCResultContents() == 1963 TargetLowering::ZeroOrNegativeOneSetCCResult) 1964 return N0; 1965 // fold (sext_in_reg x) -> (zext_in_reg x) if the sign bit is zero 1966 if (TLI.MaskedValueIsZero(N0, 1ULL << (EVTBits-1))) 1967 return DAG.getZeroExtendInReg(N0, EVT); 1968 // fold (sext_inreg (extload x)) -> (sextload x) 1969 if (N0.getOpcode() == ISD::EXTLOAD && 1970 EVT == cast<VTSDNode>(N0.getOperand(3))->getVT() && 1971 (!AfterLegalize || TLI.isOperationLegal(ISD::SEXTLOAD, EVT))) { 1972 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N0.getOperand(0), 1973 N0.getOperand(1), N0.getOperand(2), 1974 EVT); 1975 CombineTo(N, ExtLoad); 1976 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1)); 1977 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1978 } 1979 // fold (sext_inreg (zextload x)) -> (sextload x) iff load has one use 1980 if (N0.getOpcode() == ISD::ZEXTLOAD && N0.hasOneUse() && 1981 EVT == cast<VTSDNode>(N0.getOperand(3))->getVT() && 1982 (!AfterLegalize || TLI.isOperationLegal(ISD::SEXTLOAD, EVT))) { 1983 SDOperand ExtLoad = DAG.getExtLoad(ISD::SEXTLOAD, VT, N0.getOperand(0), 1984 N0.getOperand(1), N0.getOperand(2), 1985 EVT); 1986 CombineTo(N, ExtLoad); 1987 CombineTo(N0.Val, ExtLoad, ExtLoad.getValue(1)); 1988 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 1989 } 1990 return SDOperand(); 1991} 1992 1993SDOperand DAGCombiner::visitTRUNCATE(SDNode *N) { 1994 SDOperand N0 = N->getOperand(0); 1995 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 1996 MVT::ValueType VT = N->getValueType(0); 1997 1998 // noop truncate 1999 if (N0.getValueType() == N->getValueType(0)) 2000 return N0; 2001 // fold (truncate c1) -> c1 2002 if (N0C) 2003 return DAG.getNode(ISD::TRUNCATE, VT, N0); 2004 // fold (truncate (truncate x)) -> (truncate x) 2005 if (N0.getOpcode() == ISD::TRUNCATE) 2006 return DAG.getNode(ISD::TRUNCATE, VT, N0.getOperand(0)); 2007 // fold (truncate (ext x)) -> (ext x) or (truncate x) or x 2008 if (N0.getOpcode() == ISD::ZERO_EXTEND || N0.getOpcode() == ISD::SIGN_EXTEND|| 2009 N0.getOpcode() == ISD::ANY_EXTEND) { 2010 if (N0.getValueType() < VT) 2011 // if the source is smaller than the dest, we still need an extend 2012 return DAG.getNode(N0.getOpcode(), VT, N0.getOperand(0)); 2013 else if (N0.getValueType() > VT) 2014 // if the source is larger than the dest, than we just need the truncate 2015 return DAG.getNode(ISD::TRUNCATE, VT, N0.getOperand(0)); 2016 else 2017 // if the source and dest are the same type, we can drop both the extend 2018 // and the truncate 2019 return N0.getOperand(0); 2020 } 2021 // fold (truncate (load x)) -> (smaller load x) 2022 if (N0.getOpcode() == ISD::LOAD && N0.hasOneUse()) { 2023 assert(MVT::getSizeInBits(N0.getValueType()) > MVT::getSizeInBits(VT) && 2024 "Cannot truncate to larger type!"); 2025 MVT::ValueType PtrType = N0.getOperand(1).getValueType(); 2026 // For big endian targets, we need to add an offset to the pointer to load 2027 // the correct bytes. For little endian systems, we merely need to read 2028 // fewer bytes from the same pointer. 2029 uint64_t PtrOff = 2030 (MVT::getSizeInBits(N0.getValueType()) - MVT::getSizeInBits(VT)) / 8; 2031 SDOperand NewPtr = TLI.isLittleEndian() ? N0.getOperand(1) : 2032 DAG.getNode(ISD::ADD, PtrType, N0.getOperand(1), 2033 DAG.getConstant(PtrOff, PtrType)); 2034 AddToWorkList(NewPtr.Val); 2035 SDOperand Load = DAG.getLoad(VT, N0.getOperand(0), NewPtr,N0.getOperand(2)); 2036 AddToWorkList(N); 2037 CombineTo(N0.Val, Load, Load.getValue(1)); 2038 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 2039 } 2040 return SDOperand(); 2041} 2042 2043SDOperand DAGCombiner::visitBIT_CONVERT(SDNode *N) { 2044 SDOperand N0 = N->getOperand(0); 2045 MVT::ValueType VT = N->getValueType(0); 2046 2047 // If the input is a constant, let getNode() fold it. 2048 if (isa<ConstantSDNode>(N0) || isa<ConstantFPSDNode>(N0)) { 2049 SDOperand Res = DAG.getNode(ISD::BIT_CONVERT, VT, N0); 2050 if (Res.Val != N) return Res; 2051 } 2052 2053 if (N0.getOpcode() == ISD::BIT_CONVERT) // conv(conv(x,t1),t2) -> conv(x,t2) 2054 return DAG.getNode(ISD::BIT_CONVERT, VT, N0.getOperand(0)); 2055 2056 // fold (conv (load x)) -> (load (conv*)x) 2057 // FIXME: These xforms need to know that the resultant load doesn't need a 2058 // higher alignment than the original! 2059 if (0 && N0.getOpcode() == ISD::LOAD && N0.hasOneUse()) { 2060 SDOperand Load = DAG.getLoad(VT, N0.getOperand(0), N0.getOperand(1), 2061 N0.getOperand(2)); 2062 AddToWorkList(N); 2063 CombineTo(N0.Val, DAG.getNode(ISD::BIT_CONVERT, N0.getValueType(), Load), 2064 Load.getValue(1)); 2065 return Load; 2066 } 2067 2068 return SDOperand(); 2069} 2070 2071SDOperand DAGCombiner::visitVBIT_CONVERT(SDNode *N) { 2072 SDOperand N0 = N->getOperand(0); 2073 MVT::ValueType VT = N->getValueType(0); 2074 2075 // If the input is a VBUILD_VECTOR with all constant elements, fold this now. 2076 // First check to see if this is all constant. 2077 if (N0.getOpcode() == ISD::VBUILD_VECTOR && N0.Val->hasOneUse() && 2078 VT == MVT::Vector) { 2079 bool isSimple = true; 2080 for (unsigned i = 0, e = N0.getNumOperands()-2; i != e; ++i) 2081 if (N0.getOperand(i).getOpcode() != ISD::UNDEF && 2082 N0.getOperand(i).getOpcode() != ISD::Constant && 2083 N0.getOperand(i).getOpcode() != ISD::ConstantFP) { 2084 isSimple = false; 2085 break; 2086 } 2087 2088 MVT::ValueType DestEltVT = cast<VTSDNode>(N->getOperand(2))->getVT(); 2089 if (isSimple && !MVT::isVector(DestEltVT)) { 2090 return ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(N0.Val, DestEltVT); 2091 } 2092 } 2093 2094 return SDOperand(); 2095} 2096 2097/// ConstantFoldVBIT_CONVERTofVBUILD_VECTOR - We know that BV is a vbuild_vector 2098/// node with Constant, ConstantFP or Undef operands. DstEltVT indicates the 2099/// destination element value type. 2100SDOperand DAGCombiner:: 2101ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(SDNode *BV, MVT::ValueType DstEltVT) { 2102 MVT::ValueType SrcEltVT = BV->getOperand(0).getValueType(); 2103 2104 // If this is already the right type, we're done. 2105 if (SrcEltVT == DstEltVT) return SDOperand(BV, 0); 2106 2107 unsigned SrcBitSize = MVT::getSizeInBits(SrcEltVT); 2108 unsigned DstBitSize = MVT::getSizeInBits(DstEltVT); 2109 2110 // If this is a conversion of N elements of one type to N elements of another 2111 // type, convert each element. This handles FP<->INT cases. 2112 if (SrcBitSize == DstBitSize) { 2113 std::vector<SDOperand> Ops; 2114 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e; ++i) { 2115 Ops.push_back(DAG.getNode(ISD::BIT_CONVERT, DstEltVT, BV->getOperand(i))); 2116 AddToWorkList(Ops.back().Val); 2117 } 2118 Ops.push_back(*(BV->op_end()-2)); // Add num elements. 2119 Ops.push_back(DAG.getValueType(DstEltVT)); 2120 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 2121 } 2122 2123 // Otherwise, we're growing or shrinking the elements. To avoid having to 2124 // handle annoying details of growing/shrinking FP values, we convert them to 2125 // int first. 2126 if (MVT::isFloatingPoint(SrcEltVT)) { 2127 // Convert the input float vector to a int vector where the elements are the 2128 // same sizes. 2129 assert((SrcEltVT == MVT::f32 || SrcEltVT == MVT::f64) && "Unknown FP VT!"); 2130 MVT::ValueType IntVT = SrcEltVT == MVT::f32 ? MVT::i32 : MVT::i64; 2131 BV = ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(BV, IntVT).Val; 2132 SrcEltVT = IntVT; 2133 } 2134 2135 // Now we know the input is an integer vector. If the output is a FP type, 2136 // convert to integer first, then to FP of the right size. 2137 if (MVT::isFloatingPoint(DstEltVT)) { 2138 assert((DstEltVT == MVT::f32 || DstEltVT == MVT::f64) && "Unknown FP VT!"); 2139 MVT::ValueType TmpVT = DstEltVT == MVT::f32 ? MVT::i32 : MVT::i64; 2140 SDNode *Tmp = ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(BV, TmpVT).Val; 2141 2142 // Next, convert to FP elements of the same size. 2143 return ConstantFoldVBIT_CONVERTofVBUILD_VECTOR(Tmp, DstEltVT); 2144 } 2145 2146 // Okay, we know the src/dst types are both integers of differing types. 2147 // Handling growing first. 2148 assert(MVT::isInteger(SrcEltVT) && MVT::isInteger(DstEltVT)); 2149 if (SrcBitSize < DstBitSize) { 2150 unsigned NumInputsPerOutput = DstBitSize/SrcBitSize; 2151 2152 std::vector<SDOperand> Ops; 2153 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e; 2154 i += NumInputsPerOutput) { 2155 bool isLE = TLI.isLittleEndian(); 2156 uint64_t NewBits = 0; 2157 bool EltIsUndef = true; 2158 for (unsigned j = 0; j != NumInputsPerOutput; ++j) { 2159 // Shift the previously computed bits over. 2160 NewBits <<= SrcBitSize; 2161 SDOperand Op = BV->getOperand(i+ (isLE ? (NumInputsPerOutput-j-1) : j)); 2162 if (Op.getOpcode() == ISD::UNDEF) continue; 2163 EltIsUndef = false; 2164 2165 NewBits |= cast<ConstantSDNode>(Op)->getValue(); 2166 } 2167 2168 if (EltIsUndef) 2169 Ops.push_back(DAG.getNode(ISD::UNDEF, DstEltVT)); 2170 else 2171 Ops.push_back(DAG.getConstant(NewBits, DstEltVT)); 2172 } 2173 2174 Ops.push_back(DAG.getConstant(Ops.size(), MVT::i32)); // Add num elements. 2175 Ops.push_back(DAG.getValueType(DstEltVT)); // Add element size. 2176 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 2177 } 2178 2179 // Finally, this must be the case where we are shrinking elements: each input 2180 // turns into multiple outputs. 2181 unsigned NumOutputsPerInput = SrcBitSize/DstBitSize; 2182 std::vector<SDOperand> Ops; 2183 for (unsigned i = 0, e = BV->getNumOperands()-2; i != e; ++i) { 2184 if (BV->getOperand(i).getOpcode() == ISD::UNDEF) { 2185 for (unsigned j = 0; j != NumOutputsPerInput; ++j) 2186 Ops.push_back(DAG.getNode(ISD::UNDEF, DstEltVT)); 2187 continue; 2188 } 2189 uint64_t OpVal = cast<ConstantSDNode>(BV->getOperand(i))->getValue(); 2190 2191 for (unsigned j = 0; j != NumOutputsPerInput; ++j) { 2192 unsigned ThisVal = OpVal & ((1ULL << DstBitSize)-1); 2193 OpVal >>= DstBitSize; 2194 Ops.push_back(DAG.getConstant(ThisVal, DstEltVT)); 2195 } 2196 2197 // For big endian targets, swap the order of the pieces of each element. 2198 if (!TLI.isLittleEndian()) 2199 std::reverse(Ops.end()-NumOutputsPerInput, Ops.end()); 2200 } 2201 Ops.push_back(DAG.getConstant(Ops.size(), MVT::i32)); // Add num elements. 2202 Ops.push_back(DAG.getValueType(DstEltVT)); // Add element size. 2203 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 2204} 2205 2206 2207 2208SDOperand DAGCombiner::visitFADD(SDNode *N) { 2209 SDOperand N0 = N->getOperand(0); 2210 SDOperand N1 = N->getOperand(1); 2211 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2212 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2213 MVT::ValueType VT = N->getValueType(0); 2214 2215 // fold (fadd c1, c2) -> c1+c2 2216 if (N0CFP && N1CFP) 2217 return DAG.getNode(ISD::FADD, VT, N0, N1); 2218 // canonicalize constant to RHS 2219 if (N0CFP && !N1CFP) 2220 return DAG.getNode(ISD::FADD, VT, N1, N0); 2221 // fold (A + (-B)) -> A-B 2222 if (N1.getOpcode() == ISD::FNEG) 2223 return DAG.getNode(ISD::FSUB, VT, N0, N1.getOperand(0)); 2224 // fold ((-A) + B) -> B-A 2225 if (N0.getOpcode() == ISD::FNEG) 2226 return DAG.getNode(ISD::FSUB, VT, N1, N0.getOperand(0)); 2227 return SDOperand(); 2228} 2229 2230SDOperand DAGCombiner::visitFSUB(SDNode *N) { 2231 SDOperand N0 = N->getOperand(0); 2232 SDOperand N1 = N->getOperand(1); 2233 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2234 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2235 MVT::ValueType VT = N->getValueType(0); 2236 2237 // fold (fsub c1, c2) -> c1-c2 2238 if (N0CFP && N1CFP) 2239 return DAG.getNode(ISD::FSUB, VT, N0, N1); 2240 // fold (A-(-B)) -> A+B 2241 if (N1.getOpcode() == ISD::FNEG) 2242 return DAG.getNode(ISD::FADD, VT, N0, N1.getOperand(0)); 2243 return SDOperand(); 2244} 2245 2246SDOperand DAGCombiner::visitFMUL(SDNode *N) { 2247 SDOperand N0 = N->getOperand(0); 2248 SDOperand N1 = N->getOperand(1); 2249 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2250 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2251 MVT::ValueType VT = N->getValueType(0); 2252 2253 // fold (fmul c1, c2) -> c1*c2 2254 if (N0CFP && N1CFP) 2255 return DAG.getNode(ISD::FMUL, VT, N0, N1); 2256 // canonicalize constant to RHS 2257 if (N0CFP && !N1CFP) 2258 return DAG.getNode(ISD::FMUL, VT, N1, N0); 2259 // fold (fmul X, 2.0) -> (fadd X, X) 2260 if (N1CFP && N1CFP->isExactlyValue(+2.0)) 2261 return DAG.getNode(ISD::FADD, VT, N0, N0); 2262 return SDOperand(); 2263} 2264 2265SDOperand DAGCombiner::visitFDIV(SDNode *N) { 2266 SDOperand N0 = N->getOperand(0); 2267 SDOperand N1 = N->getOperand(1); 2268 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2269 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2270 MVT::ValueType VT = N->getValueType(0); 2271 2272 // fold (fdiv c1, c2) -> c1/c2 2273 if (N0CFP && N1CFP) 2274 return DAG.getNode(ISD::FDIV, VT, N0, N1); 2275 return SDOperand(); 2276} 2277 2278SDOperand DAGCombiner::visitFREM(SDNode *N) { 2279 SDOperand N0 = N->getOperand(0); 2280 SDOperand N1 = N->getOperand(1); 2281 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2282 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2283 MVT::ValueType VT = N->getValueType(0); 2284 2285 // fold (frem c1, c2) -> fmod(c1,c2) 2286 if (N0CFP && N1CFP) 2287 return DAG.getNode(ISD::FREM, VT, N0, N1); 2288 return SDOperand(); 2289} 2290 2291SDOperand DAGCombiner::visitFCOPYSIGN(SDNode *N) { 2292 SDOperand N0 = N->getOperand(0); 2293 SDOperand N1 = N->getOperand(1); 2294 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2295 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1); 2296 MVT::ValueType VT = N->getValueType(0); 2297 2298 if (N0CFP && N1CFP) // Constant fold 2299 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1); 2300 2301 if (N1CFP) { 2302 // copysign(x, c1) -> fabs(x) iff ispos(c1) 2303 // copysign(x, c1) -> fneg(fabs(x)) iff isneg(c1) 2304 union { 2305 double d; 2306 int64_t i; 2307 } u; 2308 u.d = N1CFP->getValue(); 2309 if (u.i >= 0) 2310 return DAG.getNode(ISD::FABS, VT, N0); 2311 else 2312 return DAG.getNode(ISD::FNEG, VT, DAG.getNode(ISD::FABS, VT, N0)); 2313 } 2314 2315 // copysign(fabs(x), y) -> copysign(x, y) 2316 // copysign(fneg(x), y) -> copysign(x, y) 2317 // copysign(copysign(x,z), y) -> copysign(x, y) 2318 if (N0.getOpcode() == ISD::FABS || N0.getOpcode() == ISD::FNEG || 2319 N0.getOpcode() == ISD::FCOPYSIGN) 2320 return DAG.getNode(ISD::FCOPYSIGN, VT, N0.getOperand(0), N1); 2321 2322 // copysign(x, abs(y)) -> abs(x) 2323 if (N1.getOpcode() == ISD::FABS) 2324 return DAG.getNode(ISD::FABS, VT, N0); 2325 2326 // copysign(x, copysign(y,z)) -> copysign(x, z) 2327 if (N1.getOpcode() == ISD::FCOPYSIGN) 2328 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1.getOperand(1)); 2329 2330 // copysign(x, fp_extend(y)) -> copysign(x, y) 2331 // copysign(x, fp_round(y)) -> copysign(x, y) 2332 if (N1.getOpcode() == ISD::FP_EXTEND || N1.getOpcode() == ISD::FP_ROUND) 2333 return DAG.getNode(ISD::FCOPYSIGN, VT, N0, N1.getOperand(0)); 2334 2335 return SDOperand(); 2336} 2337 2338 2339 2340SDOperand DAGCombiner::visitSINT_TO_FP(SDNode *N) { 2341 SDOperand N0 = N->getOperand(0); 2342 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2343 MVT::ValueType VT = N->getValueType(0); 2344 2345 // fold (sint_to_fp c1) -> c1fp 2346 if (N0C) 2347 return DAG.getNode(ISD::SINT_TO_FP, VT, N0); 2348 return SDOperand(); 2349} 2350 2351SDOperand DAGCombiner::visitUINT_TO_FP(SDNode *N) { 2352 SDOperand N0 = N->getOperand(0); 2353 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0); 2354 MVT::ValueType VT = N->getValueType(0); 2355 2356 // fold (uint_to_fp c1) -> c1fp 2357 if (N0C) 2358 return DAG.getNode(ISD::UINT_TO_FP, VT, N0); 2359 return SDOperand(); 2360} 2361 2362SDOperand DAGCombiner::visitFP_TO_SINT(SDNode *N) { 2363 SDOperand N0 = N->getOperand(0); 2364 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2365 MVT::ValueType VT = N->getValueType(0); 2366 2367 // fold (fp_to_sint c1fp) -> c1 2368 if (N0CFP) 2369 return DAG.getNode(ISD::FP_TO_SINT, VT, N0); 2370 return SDOperand(); 2371} 2372 2373SDOperand DAGCombiner::visitFP_TO_UINT(SDNode *N) { 2374 SDOperand N0 = N->getOperand(0); 2375 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2376 MVT::ValueType VT = N->getValueType(0); 2377 2378 // fold (fp_to_uint c1fp) -> c1 2379 if (N0CFP) 2380 return DAG.getNode(ISD::FP_TO_UINT, VT, N0); 2381 return SDOperand(); 2382} 2383 2384SDOperand DAGCombiner::visitFP_ROUND(SDNode *N) { 2385 SDOperand N0 = N->getOperand(0); 2386 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2387 MVT::ValueType VT = N->getValueType(0); 2388 2389 // fold (fp_round c1fp) -> c1fp 2390 if (N0CFP) 2391 return DAG.getNode(ISD::FP_ROUND, VT, N0); 2392 2393 // fold (fp_round (fp_extend x)) -> x 2394 if (N0.getOpcode() == ISD::FP_EXTEND && VT == N0.getOperand(0).getValueType()) 2395 return N0.getOperand(0); 2396 2397 // fold (fp_round (copysign X, Y)) -> (copysign (fp_round X), Y) 2398 if (N0.getOpcode() == ISD::FCOPYSIGN && N0.Val->hasOneUse()) { 2399 SDOperand Tmp = DAG.getNode(ISD::FP_ROUND, VT, N0.getOperand(0)); 2400 AddToWorkList(Tmp.Val); 2401 return DAG.getNode(ISD::FCOPYSIGN, VT, Tmp, N0.getOperand(1)); 2402 } 2403 2404 return SDOperand(); 2405} 2406 2407SDOperand DAGCombiner::visitFP_ROUND_INREG(SDNode *N) { 2408 SDOperand N0 = N->getOperand(0); 2409 MVT::ValueType VT = N->getValueType(0); 2410 MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 2411 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2412 2413 // fold (fp_round_inreg c1fp) -> c1fp 2414 if (N0CFP) { 2415 SDOperand Round = DAG.getConstantFP(N0CFP->getValue(), EVT); 2416 return DAG.getNode(ISD::FP_EXTEND, VT, Round); 2417 } 2418 return SDOperand(); 2419} 2420 2421SDOperand DAGCombiner::visitFP_EXTEND(SDNode *N) { 2422 SDOperand N0 = N->getOperand(0); 2423 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2424 MVT::ValueType VT = N->getValueType(0); 2425 2426 // fold (fp_extend c1fp) -> c1fp 2427 if (N0CFP) 2428 return DAG.getNode(ISD::FP_EXTEND, VT, N0); 2429 2430 // fold (fpext (load x)) -> (fpext (fpround (extload x))) 2431 if (N0.getOpcode() == ISD::LOAD && N0.hasOneUse() && 2432 (!AfterLegalize||TLI.isOperationLegal(ISD::EXTLOAD, N0.getValueType()))) { 2433 SDOperand ExtLoad = DAG.getExtLoad(ISD::EXTLOAD, VT, N0.getOperand(0), 2434 N0.getOperand(1), N0.getOperand(2), 2435 N0.getValueType()); 2436 CombineTo(N, ExtLoad); 2437 CombineTo(N0.Val, DAG.getNode(ISD::FP_ROUND, N0.getValueType(), ExtLoad), 2438 ExtLoad.getValue(1)); 2439 return SDOperand(N, 0); // Return N so it doesn't get rechecked! 2440 } 2441 2442 2443 return SDOperand(); 2444} 2445 2446SDOperand DAGCombiner::visitFNEG(SDNode *N) { 2447 SDOperand N0 = N->getOperand(0); 2448 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2449 MVT::ValueType VT = N->getValueType(0); 2450 2451 // fold (fneg c1) -> -c1 2452 if (N0CFP) 2453 return DAG.getNode(ISD::FNEG, VT, N0); 2454 // fold (fneg (sub x, y)) -> (sub y, x) 2455 if (N0.getOpcode() == ISD::SUB) 2456 return DAG.getNode(ISD::SUB, VT, N0.getOperand(1), N0.getOperand(0)); 2457 // fold (fneg (fneg x)) -> x 2458 if (N0.getOpcode() == ISD::FNEG) 2459 return N0.getOperand(0); 2460 return SDOperand(); 2461} 2462 2463SDOperand DAGCombiner::visitFABS(SDNode *N) { 2464 SDOperand N0 = N->getOperand(0); 2465 ConstantFPSDNode *N0CFP = dyn_cast<ConstantFPSDNode>(N0); 2466 MVT::ValueType VT = N->getValueType(0); 2467 2468 // fold (fabs c1) -> fabs(c1) 2469 if (N0CFP) 2470 return DAG.getNode(ISD::FABS, VT, N0); 2471 // fold (fabs (fabs x)) -> (fabs x) 2472 if (N0.getOpcode() == ISD::FABS) 2473 return N->getOperand(0); 2474 // fold (fabs (fneg x)) -> (fabs x) 2475 // fold (fabs (fcopysign x, y)) -> (fabs x) 2476 if (N0.getOpcode() == ISD::FNEG || N0.getOpcode() == ISD::FCOPYSIGN) 2477 return DAG.getNode(ISD::FABS, VT, N0.getOperand(0)); 2478 2479 return SDOperand(); 2480} 2481 2482SDOperand DAGCombiner::visitBRCOND(SDNode *N) { 2483 SDOperand Chain = N->getOperand(0); 2484 SDOperand N1 = N->getOperand(1); 2485 SDOperand N2 = N->getOperand(2); 2486 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1); 2487 2488 // never taken branch, fold to chain 2489 if (N1C && N1C->isNullValue()) 2490 return Chain; 2491 // unconditional branch 2492 if (N1C && N1C->getValue() == 1) 2493 return DAG.getNode(ISD::BR, MVT::Other, Chain, N2); 2494 // fold a brcond with a setcc condition into a BR_CC node if BR_CC is legal 2495 // on the target. 2496 if (N1.getOpcode() == ISD::SETCC && 2497 TLI.isOperationLegal(ISD::BR_CC, MVT::Other)) { 2498 return DAG.getNode(ISD::BR_CC, MVT::Other, Chain, N1.getOperand(2), 2499 N1.getOperand(0), N1.getOperand(1), N2); 2500 } 2501 return SDOperand(); 2502} 2503 2504// Operand List for BR_CC: Chain, CondCC, CondLHS, CondRHS, DestBB. 2505// 2506SDOperand DAGCombiner::visitBR_CC(SDNode *N) { 2507 CondCodeSDNode *CC = cast<CondCodeSDNode>(N->getOperand(1)); 2508 SDOperand CondLHS = N->getOperand(2), CondRHS = N->getOperand(3); 2509 2510 // Use SimplifySetCC to simplify SETCC's. 2511 SDOperand Simp = SimplifySetCC(MVT::i1, CondLHS, CondRHS, CC->get(), false); 2512 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(Simp.Val); 2513 2514 // fold br_cc true, dest -> br dest (unconditional branch) 2515 if (SCCC && SCCC->getValue()) 2516 return DAG.getNode(ISD::BR, MVT::Other, N->getOperand(0), 2517 N->getOperand(4)); 2518 // fold br_cc false, dest -> unconditional fall through 2519 if (SCCC && SCCC->isNullValue()) 2520 return N->getOperand(0); 2521 // fold to a simpler setcc 2522 if (Simp.Val && Simp.getOpcode() == ISD::SETCC) 2523 return DAG.getNode(ISD::BR_CC, MVT::Other, N->getOperand(0), 2524 Simp.getOperand(2), Simp.getOperand(0), 2525 Simp.getOperand(1), N->getOperand(4)); 2526 return SDOperand(); 2527} 2528 2529SDOperand DAGCombiner::visitLOAD(SDNode *N) { 2530 SDOperand Chain = N->getOperand(0); 2531 SDOperand Ptr = N->getOperand(1); 2532 SDOperand SrcValue = N->getOperand(2); 2533 2534 // If there are no uses of the loaded value, change uses of the chain value 2535 // into uses of the chain input (i.e. delete the dead load). 2536 if (N->hasNUsesOfValue(0, 0)) 2537 return CombineTo(N, DAG.getNode(ISD::UNDEF, N->getValueType(0)), Chain); 2538 2539 // If this load is directly stored, replace the load value with the stored 2540 // value. 2541 // TODO: Handle store large -> read small portion. 2542 // TODO: Handle TRUNCSTORE/EXTLOAD 2543 if (Chain.getOpcode() == ISD::STORE && Chain.getOperand(2) == Ptr && 2544 Chain.getOperand(1).getValueType() == N->getValueType(0)) 2545 return CombineTo(N, Chain.getOperand(1), Chain); 2546 2547 return SDOperand(); 2548} 2549 2550/// visitXEXTLOAD - Handle EXTLOAD/ZEXTLOAD/SEXTLOAD. 2551SDOperand DAGCombiner::visitXEXTLOAD(SDNode *N) { 2552 SDOperand Chain = N->getOperand(0); 2553 SDOperand Ptr = N->getOperand(1); 2554 SDOperand SrcValue = N->getOperand(2); 2555 SDOperand EVT = N->getOperand(3); 2556 2557 // If there are no uses of the loaded value, change uses of the chain value 2558 // into uses of the chain input (i.e. delete the dead load). 2559 if (N->hasNUsesOfValue(0, 0)) 2560 return CombineTo(N, DAG.getNode(ISD::UNDEF, N->getValueType(0)), Chain); 2561 2562 return SDOperand(); 2563} 2564 2565SDOperand DAGCombiner::visitSTORE(SDNode *N) { 2566 SDOperand Chain = N->getOperand(0); 2567 SDOperand Value = N->getOperand(1); 2568 SDOperand Ptr = N->getOperand(2); 2569 SDOperand SrcValue = N->getOperand(3); 2570 2571 // If this is a store that kills a previous store, remove the previous store. 2572 if (Chain.getOpcode() == ISD::STORE && Chain.getOperand(2) == Ptr && 2573 Chain.Val->hasOneUse() /* Avoid introducing DAG cycles */ && 2574 // Make sure that these stores are the same value type: 2575 // FIXME: we really care that the second store is >= size of the first. 2576 Value.getValueType() == Chain.getOperand(1).getValueType()) { 2577 // Create a new store of Value that replaces both stores. 2578 SDNode *PrevStore = Chain.Val; 2579 if (PrevStore->getOperand(1) == Value) // Same value multiply stored. 2580 return Chain; 2581 SDOperand NewStore = DAG.getNode(ISD::STORE, MVT::Other, 2582 PrevStore->getOperand(0), Value, Ptr, 2583 SrcValue); 2584 CombineTo(N, NewStore); // Nuke this store. 2585 CombineTo(PrevStore, NewStore); // Nuke the previous store. 2586 return SDOperand(N, 0); 2587 } 2588 2589 // If this is a store of a bit convert, store the input value. 2590 // FIXME: This needs to know that the resultant store does not need a 2591 // higher alignment than the original. 2592 if (0 && Value.getOpcode() == ISD::BIT_CONVERT) 2593 return DAG.getNode(ISD::STORE, MVT::Other, Chain, Value.getOperand(0), 2594 Ptr, SrcValue); 2595 2596 return SDOperand(); 2597} 2598 2599SDOperand DAGCombiner::visitINSERT_VECTOR_ELT(SDNode *N) { 2600 SDOperand InVec = N->getOperand(0); 2601 SDOperand InVal = N->getOperand(1); 2602 SDOperand EltNo = N->getOperand(2); 2603 2604 // If the invec is a BUILD_VECTOR and if EltNo is a constant, build a new 2605 // vector with the inserted element. 2606 if (InVec.getOpcode() == ISD::BUILD_VECTOR && isa<ConstantSDNode>(EltNo)) { 2607 unsigned Elt = cast<ConstantSDNode>(EltNo)->getValue(); 2608 std::vector<SDOperand> Ops(InVec.Val->op_begin(), InVec.Val->op_end()); 2609 if (Elt < Ops.size()) 2610 Ops[Elt] = InVal; 2611 return DAG.getNode(ISD::BUILD_VECTOR, InVec.getValueType(), Ops); 2612 } 2613 2614 return SDOperand(); 2615} 2616 2617SDOperand DAGCombiner::visitVINSERT_VECTOR_ELT(SDNode *N) { 2618 SDOperand InVec = N->getOperand(0); 2619 SDOperand InVal = N->getOperand(1); 2620 SDOperand EltNo = N->getOperand(2); 2621 SDOperand NumElts = N->getOperand(3); 2622 SDOperand EltType = N->getOperand(4); 2623 2624 // If the invec is a VBUILD_VECTOR and if EltNo is a constant, build a new 2625 // vector with the inserted element. 2626 if (InVec.getOpcode() == ISD::VBUILD_VECTOR && isa<ConstantSDNode>(EltNo)) { 2627 unsigned Elt = cast<ConstantSDNode>(EltNo)->getValue(); 2628 std::vector<SDOperand> Ops(InVec.Val->op_begin(), InVec.Val->op_end()); 2629 if (Elt < Ops.size()-2) 2630 Ops[Elt] = InVal; 2631 return DAG.getNode(ISD::VBUILD_VECTOR, InVec.getValueType(), Ops); 2632 } 2633 2634 return SDOperand(); 2635} 2636 2637SDOperand DAGCombiner::visitVBUILD_VECTOR(SDNode *N) { 2638 unsigned NumInScalars = N->getNumOperands()-2; 2639 SDOperand NumElts = N->getOperand(NumInScalars); 2640 SDOperand EltType = N->getOperand(NumInScalars+1); 2641 2642 // Check to see if this is a VBUILD_VECTOR of a bunch of VEXTRACT_VECTOR_ELT 2643 // operations. If so, and if the EXTRACT_ELT vector inputs come from at most 2644 // two distinct vectors, turn this into a shuffle node. 2645 SDOperand VecIn1, VecIn2; 2646 for (unsigned i = 0; i != NumInScalars; ++i) { 2647 // Ignore undef inputs. 2648 if (N->getOperand(i).getOpcode() == ISD::UNDEF) continue; 2649 2650 // If this input is something other than a VEXTRACT_VECTOR_ELT with a 2651 // constant index, bail out. 2652 if (N->getOperand(i).getOpcode() != ISD::VEXTRACT_VECTOR_ELT || 2653 !isa<ConstantSDNode>(N->getOperand(i).getOperand(1))) { 2654 VecIn1 = VecIn2 = SDOperand(0, 0); 2655 break; 2656 } 2657 2658 // If the input vector type disagrees with the result of the vbuild_vector, 2659 // we can't make a shuffle. 2660 SDOperand ExtractedFromVec = N->getOperand(i).getOperand(0); 2661 if (*(ExtractedFromVec.Val->op_end()-2) != NumElts || 2662 *(ExtractedFromVec.Val->op_end()-1) != EltType) { 2663 VecIn1 = VecIn2 = SDOperand(0, 0); 2664 break; 2665 } 2666 2667 // Otherwise, remember this. We allow up to two distinct input vectors. 2668 if (ExtractedFromVec == VecIn1 || ExtractedFromVec == VecIn2) 2669 continue; 2670 2671 if (VecIn1.Val == 0) { 2672 VecIn1 = ExtractedFromVec; 2673 } else if (VecIn2.Val == 0) { 2674 VecIn2 = ExtractedFromVec; 2675 } else { 2676 // Too many inputs. 2677 VecIn1 = VecIn2 = SDOperand(0, 0); 2678 break; 2679 } 2680 } 2681 2682 // If everything is good, we can make a shuffle operation. 2683 if (VecIn1.Val) { 2684 std::vector<SDOperand> BuildVecIndices; 2685 for (unsigned i = 0; i != NumInScalars; ++i) { 2686 if (N->getOperand(i).getOpcode() == ISD::UNDEF) { 2687 BuildVecIndices.push_back(DAG.getNode(ISD::UNDEF, MVT::i32)); 2688 continue; 2689 } 2690 2691 SDOperand Extract = N->getOperand(i); 2692 2693 // If extracting from the first vector, just use the index directly. 2694 if (Extract.getOperand(0) == VecIn1) { 2695 BuildVecIndices.push_back(Extract.getOperand(1)); 2696 continue; 2697 } 2698 2699 // Otherwise, use InIdx + VecSize 2700 unsigned Idx = cast<ConstantSDNode>(Extract.getOperand(1))->getValue(); 2701 BuildVecIndices.push_back(DAG.getConstant(Idx+NumInScalars, MVT::i32)); 2702 } 2703 2704 // Add count and size info. 2705 BuildVecIndices.push_back(NumElts); 2706 BuildVecIndices.push_back(DAG.getValueType(MVT::i32)); 2707 2708 // Return the new VVECTOR_SHUFFLE node. 2709 std::vector<SDOperand> Ops; 2710 Ops.push_back(VecIn1); 2711 if (VecIn2.Val) { 2712 Ops.push_back(VecIn2); 2713 } else { 2714 // Use an undef vbuild_vector as input for the second operand. 2715 std::vector<SDOperand> UnOps(NumInScalars, 2716 DAG.getNode(ISD::UNDEF, 2717 cast<VTSDNode>(EltType)->getVT())); 2718 UnOps.push_back(NumElts); 2719 UnOps.push_back(EltType); 2720 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, UnOps)); 2721 AddToWorkList(Ops.back().Val); 2722 } 2723 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR,MVT::Vector, BuildVecIndices)); 2724 Ops.push_back(NumElts); 2725 Ops.push_back(EltType); 2726 return DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, Ops); 2727 } 2728 2729 return SDOperand(); 2730} 2731 2732SDOperand DAGCombiner::visitVECTOR_SHUFFLE(SDNode *N) { 2733 SDOperand ShufMask = N->getOperand(2); 2734 unsigned NumElts = ShufMask.getNumOperands(); 2735 2736 // If the shuffle mask is an identity operation on the LHS, return the LHS. 2737 bool isIdentity = true; 2738 for (unsigned i = 0; i != NumElts; ++i) { 2739 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF && 2740 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i) { 2741 isIdentity = false; 2742 break; 2743 } 2744 } 2745 if (isIdentity) return N->getOperand(0); 2746 2747 // If the shuffle mask is an identity operation on the RHS, return the RHS. 2748 isIdentity = true; 2749 for (unsigned i = 0; i != NumElts; ++i) { 2750 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF && 2751 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i+NumElts) { 2752 isIdentity = false; 2753 break; 2754 } 2755 } 2756 if (isIdentity) return N->getOperand(1); 2757 2758 // If the LHS and the RHS are the same node, turn the RHS into an undef. 2759 if (N->getOperand(0) == N->getOperand(1)) { 2760 if (N->getOperand(0).getOpcode() == ISD::UNDEF) 2761 return DAG.getNode(ISD::UNDEF, N->getValueType(0)); 2762 // Check the SHUFFLE mask, mapping any inputs from the 2nd operand into the 2763 // first operand. 2764 std::vector<SDOperand> MappedOps; 2765 for (unsigned i = 0, e = ShufMask.getNumOperands(); i != e; ++i) { 2766 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF || 2767 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() < NumElts) { 2768 MappedOps.push_back(ShufMask.getOperand(i)); 2769 } else { 2770 unsigned NewIdx = 2771 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() - NumElts; 2772 MappedOps.push_back(DAG.getConstant(NewIdx, MVT::i32)); 2773 } 2774 } 2775 ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMask.getValueType(), 2776 MappedOps); 2777 AddToWorkList(ShufMask.Val); 2778 return DAG.getNode(ISD::VECTOR_SHUFFLE, N->getValueType(0), 2779 N->getOperand(0), 2780 DAG.getNode(ISD::UNDEF, N->getValueType(0)), 2781 ShufMask); 2782 } 2783 2784 return SDOperand(); 2785} 2786 2787SDOperand DAGCombiner::visitVVECTOR_SHUFFLE(SDNode *N) { 2788 SDOperand ShufMask = N->getOperand(2); 2789 unsigned NumElts = ShufMask.getNumOperands()-2; 2790 2791 // If the shuffle mask is an identity operation on the LHS, return the LHS. 2792 bool isIdentity = true; 2793 for (unsigned i = 0; i != NumElts; ++i) { 2794 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF && 2795 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i) { 2796 isIdentity = false; 2797 break; 2798 } 2799 } 2800 if (isIdentity) return N->getOperand(0); 2801 2802 // If the shuffle mask is an identity operation on the RHS, return the RHS. 2803 isIdentity = true; 2804 for (unsigned i = 0; i != NumElts; ++i) { 2805 if (ShufMask.getOperand(i).getOpcode() != ISD::UNDEF && 2806 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() != i+NumElts) { 2807 isIdentity = false; 2808 break; 2809 } 2810 } 2811 if (isIdentity) return N->getOperand(1); 2812 2813 // If the LHS and the RHS are the same node, turn the RHS into an undef. 2814 if (N->getOperand(0) == N->getOperand(1)) { 2815 // Check the SHUFFLE mask, mapping any inputs from the 2nd operand into the 2816 // first operand. 2817 std::vector<SDOperand> MappedOps; 2818 for (unsigned i = 0; i != NumElts; ++i) { 2819 if (ShufMask.getOperand(i).getOpcode() == ISD::UNDEF || 2820 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() < NumElts) { 2821 MappedOps.push_back(ShufMask.getOperand(i)); 2822 } else { 2823 unsigned NewIdx = 2824 cast<ConstantSDNode>(ShufMask.getOperand(i))->getValue() - NumElts; 2825 MappedOps.push_back(DAG.getConstant(NewIdx, MVT::i32)); 2826 } 2827 } 2828 // Add the type/#elts values. 2829 MappedOps.push_back(ShufMask.getOperand(NumElts)); 2830 MappedOps.push_back(ShufMask.getOperand(NumElts+1)); 2831 2832 ShufMask = DAG.getNode(ISD::VBUILD_VECTOR, ShufMask.getValueType(), 2833 MappedOps); 2834 AddToWorkList(ShufMask.Val); 2835 2836 // Build the undef vector. 2837 SDOperand UDVal = DAG.getNode(ISD::UNDEF, MappedOps[0].getValueType()); 2838 for (unsigned i = 0; i != NumElts; ++i) 2839 MappedOps[i] = UDVal; 2840 MappedOps[NumElts ] = *(N->getOperand(0).Val->op_end()-2); 2841 MappedOps[NumElts+1] = *(N->getOperand(0).Val->op_end()-1); 2842 UDVal = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, MappedOps); 2843 2844 return DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, 2845 N->getOperand(0), UDVal, ShufMask, 2846 MappedOps[NumElts], MappedOps[NumElts+1]); 2847 } 2848 2849 return SDOperand(); 2850} 2851 2852/// XformToShuffleWithZero - Returns a vector_shuffle if it able to transform 2853/// a VAND to a vector_shuffle with the destination vector and a zero vector. 2854/// e.g. VAND V, <0xffffffff, 0, 0xffffffff, 0>. ==> 2855/// vector_shuffle V, Zero, <0, 4, 2, 4> 2856SDOperand DAGCombiner::XformToShuffleWithZero(SDNode *N) { 2857 SDOperand LHS = N->getOperand(0); 2858 SDOperand RHS = N->getOperand(1); 2859 if (N->getOpcode() == ISD::VAND) { 2860 SDOperand DstVecSize = *(LHS.Val->op_end()-2); 2861 SDOperand DstVecEVT = *(LHS.Val->op_end()-1); 2862 if (RHS.getOpcode() == ISD::VBIT_CONVERT) 2863 RHS = RHS.getOperand(0); 2864 if (RHS.getOpcode() == ISD::VBUILD_VECTOR) { 2865 std::vector<SDOperand> IdxOps; 2866 unsigned NumOps = RHS.getNumOperands(); 2867 unsigned NumElts = NumOps-2; 2868 MVT::ValueType EVT = cast<VTSDNode>(RHS.getOperand(NumOps-1))->getVT(); 2869 for (unsigned i = 0; i != NumElts; ++i) { 2870 SDOperand Elt = RHS.getOperand(i); 2871 if (!isa<ConstantSDNode>(Elt)) 2872 return SDOperand(); 2873 else if (cast<ConstantSDNode>(Elt)->isAllOnesValue()) 2874 IdxOps.push_back(DAG.getConstant(i, EVT)); 2875 else if (cast<ConstantSDNode>(Elt)->isNullValue()) 2876 IdxOps.push_back(DAG.getConstant(NumElts, EVT)); 2877 else 2878 return SDOperand(); 2879 } 2880 2881 // Let's see if the target supports this vector_shuffle. 2882 if (!TLI.isVectorClearMaskLegal(IdxOps, EVT, DAG)) 2883 return SDOperand(); 2884 2885 // Return the new VVECTOR_SHUFFLE node. 2886 SDOperand NumEltsNode = DAG.getConstant(NumElts, MVT::i32); 2887 SDOperand EVTNode = DAG.getValueType(EVT); 2888 std::vector<SDOperand> Ops; 2889 LHS = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, LHS, NumEltsNode, EVTNode); 2890 Ops.push_back(LHS); 2891 AddToWorkList(LHS.Val); 2892 std::vector<SDOperand> ZeroOps(NumElts, DAG.getConstant(0, EVT)); 2893 ZeroOps.push_back(NumEltsNode); 2894 ZeroOps.push_back(EVTNode); 2895 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, ZeroOps)); 2896 IdxOps.push_back(NumEltsNode); 2897 IdxOps.push_back(EVTNode); 2898 Ops.push_back(DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, IdxOps)); 2899 Ops.push_back(NumEltsNode); 2900 Ops.push_back(EVTNode); 2901 SDOperand Result = DAG.getNode(ISD::VVECTOR_SHUFFLE, MVT::Vector, Ops); 2902 if (NumEltsNode != DstVecSize || EVTNode != DstVecEVT) { 2903 Result = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Result, 2904 DstVecSize, DstVecEVT); 2905 } 2906 return Result; 2907 } 2908 } 2909 return SDOperand(); 2910} 2911 2912/// visitVBinOp - Visit a binary vector operation, like VADD. IntOp indicates 2913/// the scalar operation of the vop if it is operating on an integer vector 2914/// (e.g. ADD) and FPOp indicates the FP version (e.g. FADD). 2915SDOperand DAGCombiner::visitVBinOp(SDNode *N, ISD::NodeType IntOp, 2916 ISD::NodeType FPOp) { 2917 MVT::ValueType EltType = cast<VTSDNode>(*(N->op_end()-1))->getVT(); 2918 ISD::NodeType ScalarOp = MVT::isInteger(EltType) ? IntOp : FPOp; 2919 SDOperand LHS = N->getOperand(0); 2920 SDOperand RHS = N->getOperand(1); 2921 SDOperand Shuffle = XformToShuffleWithZero(N); 2922 if (Shuffle.Val) return Shuffle; 2923 2924 // If the LHS and RHS are VBUILD_VECTOR nodes, see if we can constant fold 2925 // this operation. 2926 if (LHS.getOpcode() == ISD::VBUILD_VECTOR && 2927 RHS.getOpcode() == ISD::VBUILD_VECTOR) { 2928 std::vector<SDOperand> Ops; 2929 for (unsigned i = 0, e = LHS.getNumOperands()-2; i != e; ++i) { 2930 SDOperand LHSOp = LHS.getOperand(i); 2931 SDOperand RHSOp = RHS.getOperand(i); 2932 // If these two elements can't be folded, bail out. 2933 if ((LHSOp.getOpcode() != ISD::UNDEF && 2934 LHSOp.getOpcode() != ISD::Constant && 2935 LHSOp.getOpcode() != ISD::ConstantFP) || 2936 (RHSOp.getOpcode() != ISD::UNDEF && 2937 RHSOp.getOpcode() != ISD::Constant && 2938 RHSOp.getOpcode() != ISD::ConstantFP)) 2939 break; 2940 Ops.push_back(DAG.getNode(ScalarOp, EltType, LHSOp, RHSOp)); 2941 AddToWorkList(Ops.back().Val); 2942 assert((Ops.back().getOpcode() == ISD::UNDEF || 2943 Ops.back().getOpcode() == ISD::Constant || 2944 Ops.back().getOpcode() == ISD::ConstantFP) && 2945 "Scalar binop didn't fold!"); 2946 } 2947 2948 if (Ops.size() == LHS.getNumOperands()-2) { 2949 Ops.push_back(*(LHS.Val->op_end()-2)); 2950 Ops.push_back(*(LHS.Val->op_end()-1)); 2951 return DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, Ops); 2952 } 2953 } 2954 2955 return SDOperand(); 2956} 2957 2958SDOperand DAGCombiner::SimplifySelect(SDOperand N0, SDOperand N1, SDOperand N2){ 2959 assert(N0.getOpcode() ==ISD::SETCC && "First argument must be a SetCC node!"); 2960 2961 SDOperand SCC = SimplifySelectCC(N0.getOperand(0), N0.getOperand(1), N1, N2, 2962 cast<CondCodeSDNode>(N0.getOperand(2))->get()); 2963 // If we got a simplified select_cc node back from SimplifySelectCC, then 2964 // break it down into a new SETCC node, and a new SELECT node, and then return 2965 // the SELECT node, since we were called with a SELECT node. 2966 if (SCC.Val) { 2967 // Check to see if we got a select_cc back (to turn into setcc/select). 2968 // Otherwise, just return whatever node we got back, like fabs. 2969 if (SCC.getOpcode() == ISD::SELECT_CC) { 2970 SDOperand SETCC = DAG.getNode(ISD::SETCC, N0.getValueType(), 2971 SCC.getOperand(0), SCC.getOperand(1), 2972 SCC.getOperand(4)); 2973 AddToWorkList(SETCC.Val); 2974 return DAG.getNode(ISD::SELECT, SCC.getValueType(), SCC.getOperand(2), 2975 SCC.getOperand(3), SETCC); 2976 } 2977 return SCC; 2978 } 2979 return SDOperand(); 2980} 2981 2982/// SimplifySelectOps - Given a SELECT or a SELECT_CC node, where LHS and RHS 2983/// are the two values being selected between, see if we can simplify the 2984/// select. 2985/// 2986bool DAGCombiner::SimplifySelectOps(SDNode *TheSelect, SDOperand LHS, 2987 SDOperand RHS) { 2988 2989 // If this is a select from two identical things, try to pull the operation 2990 // through the select. 2991 if (LHS.getOpcode() == RHS.getOpcode() && LHS.hasOneUse() && RHS.hasOneUse()){ 2992#if 0 2993 std::cerr << "SELECT: ["; LHS.Val->dump(); 2994 std::cerr << "] ["; RHS.Val->dump(); 2995 std::cerr << "]\n"; 2996#endif 2997 2998 // If this is a load and the token chain is identical, replace the select 2999 // of two loads with a load through a select of the address to load from. 3000 // This triggers in things like "select bool X, 10.0, 123.0" after the FP 3001 // constants have been dropped into the constant pool. 3002 if ((LHS.getOpcode() == ISD::LOAD || 3003 LHS.getOpcode() == ISD::EXTLOAD || 3004 LHS.getOpcode() == ISD::ZEXTLOAD || 3005 LHS.getOpcode() == ISD::SEXTLOAD) && 3006 // Token chains must be identical. 3007 LHS.getOperand(0) == RHS.getOperand(0) && 3008 // If this is an EXTLOAD, the VT's must match. 3009 (LHS.getOpcode() == ISD::LOAD || 3010 LHS.getOperand(3) == RHS.getOperand(3))) { 3011 // FIXME: this conflates two src values, discarding one. This is not 3012 // the right thing to do, but nothing uses srcvalues now. When they do, 3013 // turn SrcValue into a list of locations. 3014 SDOperand Addr; 3015 if (TheSelect->getOpcode() == ISD::SELECT) 3016 Addr = DAG.getNode(ISD::SELECT, LHS.getOperand(1).getValueType(), 3017 TheSelect->getOperand(0), LHS.getOperand(1), 3018 RHS.getOperand(1)); 3019 else 3020 Addr = DAG.getNode(ISD::SELECT_CC, LHS.getOperand(1).getValueType(), 3021 TheSelect->getOperand(0), 3022 TheSelect->getOperand(1), 3023 LHS.getOperand(1), RHS.getOperand(1), 3024 TheSelect->getOperand(4)); 3025 3026 SDOperand Load; 3027 if (LHS.getOpcode() == ISD::LOAD) 3028 Load = DAG.getLoad(TheSelect->getValueType(0), LHS.getOperand(0), 3029 Addr, LHS.getOperand(2)); 3030 else 3031 Load = DAG.getExtLoad(LHS.getOpcode(), TheSelect->getValueType(0), 3032 LHS.getOperand(0), Addr, LHS.getOperand(2), 3033 cast<VTSDNode>(LHS.getOperand(3))->getVT()); 3034 // Users of the select now use the result of the load. 3035 CombineTo(TheSelect, Load); 3036 3037 // Users of the old loads now use the new load's chain. We know the 3038 // old-load value is dead now. 3039 CombineTo(LHS.Val, Load.getValue(0), Load.getValue(1)); 3040 CombineTo(RHS.Val, Load.getValue(0), Load.getValue(1)); 3041 return true; 3042 } 3043 } 3044 3045 return false; 3046} 3047 3048SDOperand DAGCombiner::SimplifySelectCC(SDOperand N0, SDOperand N1, 3049 SDOperand N2, SDOperand N3, 3050 ISD::CondCode CC) { 3051 3052 MVT::ValueType VT = N2.getValueType(); 3053 ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val); 3054 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val); 3055 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val); 3056 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val); 3057 3058 // Determine if the condition we're dealing with is constant 3059 SDOperand SCC = SimplifySetCC(TLI.getSetCCResultTy(), N0, N1, CC, false); 3060 ConstantSDNode *SCCC = dyn_cast_or_null<ConstantSDNode>(SCC.Val); 3061 3062 // fold select_cc true, x, y -> x 3063 if (SCCC && SCCC->getValue()) 3064 return N2; 3065 // fold select_cc false, x, y -> y 3066 if (SCCC && SCCC->getValue() == 0) 3067 return N3; 3068 3069 // Check to see if we can simplify the select into an fabs node 3070 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1)) { 3071 // Allow either -0.0 or 0.0 3072 if (CFP->getValue() == 0.0) { 3073 // select (setg[te] X, +/-0.0), X, fneg(X) -> fabs 3074 if ((CC == ISD::SETGE || CC == ISD::SETGT) && 3075 N0 == N2 && N3.getOpcode() == ISD::FNEG && 3076 N2 == N3.getOperand(0)) 3077 return DAG.getNode(ISD::FABS, VT, N0); 3078 3079 // select (setl[te] X, +/-0.0), fneg(X), X -> fabs 3080 if ((CC == ISD::SETLT || CC == ISD::SETLE) && 3081 N0 == N3 && N2.getOpcode() == ISD::FNEG && 3082 N2.getOperand(0) == N3) 3083 return DAG.getNode(ISD::FABS, VT, N3); 3084 } 3085 } 3086 3087 // Check to see if we can perform the "gzip trick", transforming 3088 // select_cc setlt X, 0, A, 0 -> and (sra X, size(X)-1), A 3089 if (N1C && N1C->isNullValue() && N3C && N3C->isNullValue() && 3090 MVT::isInteger(N0.getValueType()) && 3091 MVT::isInteger(N2.getValueType()) && CC == ISD::SETLT) { 3092 MVT::ValueType XType = N0.getValueType(); 3093 MVT::ValueType AType = N2.getValueType(); 3094 if (XType >= AType) { 3095 // and (sra X, size(X)-1, A) -> "and (srl X, C2), A" iff A is a 3096 // single-bit constant. 3097 if (N2C && ((N2C->getValue() & (N2C->getValue()-1)) == 0)) { 3098 unsigned ShCtV = Log2_64(N2C->getValue()); 3099 ShCtV = MVT::getSizeInBits(XType)-ShCtV-1; 3100 SDOperand ShCt = DAG.getConstant(ShCtV, TLI.getShiftAmountTy()); 3101 SDOperand Shift = DAG.getNode(ISD::SRL, XType, N0, ShCt); 3102 AddToWorkList(Shift.Val); 3103 if (XType > AType) { 3104 Shift = DAG.getNode(ISD::TRUNCATE, AType, Shift); 3105 AddToWorkList(Shift.Val); 3106 } 3107 return DAG.getNode(ISD::AND, AType, Shift, N2); 3108 } 3109 SDOperand Shift = DAG.getNode(ISD::SRA, XType, N0, 3110 DAG.getConstant(MVT::getSizeInBits(XType)-1, 3111 TLI.getShiftAmountTy())); 3112 AddToWorkList(Shift.Val); 3113 if (XType > AType) { 3114 Shift = DAG.getNode(ISD::TRUNCATE, AType, Shift); 3115 AddToWorkList(Shift.Val); 3116 } 3117 return DAG.getNode(ISD::AND, AType, Shift, N2); 3118 } 3119 } 3120 3121 // fold select C, 16, 0 -> shl C, 4 3122 if (N2C && N3C && N3C->isNullValue() && isPowerOf2_64(N2C->getValue()) && 3123 TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult) { 3124 // Get a SetCC of the condition 3125 // FIXME: Should probably make sure that setcc is legal if we ever have a 3126 // target where it isn't. 3127 SDOperand Temp, SCC; 3128 // cast from setcc result type to select result type 3129 if (AfterLegalize) { 3130 SCC = DAG.getSetCC(TLI.getSetCCResultTy(), N0, N1, CC); 3131 Temp = DAG.getZeroExtendInReg(SCC, N2.getValueType()); 3132 } else { 3133 SCC = DAG.getSetCC(MVT::i1, N0, N1, CC); 3134 Temp = DAG.getNode(ISD::ZERO_EXTEND, N2.getValueType(), SCC); 3135 } 3136 AddToWorkList(SCC.Val); 3137 AddToWorkList(Temp.Val); 3138 // shl setcc result by log2 n2c 3139 return DAG.getNode(ISD::SHL, N2.getValueType(), Temp, 3140 DAG.getConstant(Log2_64(N2C->getValue()), 3141 TLI.getShiftAmountTy())); 3142 } 3143 3144 // Check to see if this is the equivalent of setcc 3145 // FIXME: Turn all of these into setcc if setcc if setcc is legal 3146 // otherwise, go ahead with the folds. 3147 if (0 && N3C && N3C->isNullValue() && N2C && (N2C->getValue() == 1ULL)) { 3148 MVT::ValueType XType = N0.getValueType(); 3149 if (TLI.isOperationLegal(ISD::SETCC, TLI.getSetCCResultTy())) { 3150 SDOperand Res = DAG.getSetCC(TLI.getSetCCResultTy(), N0, N1, CC); 3151 if (Res.getValueType() != VT) 3152 Res = DAG.getNode(ISD::ZERO_EXTEND, VT, Res); 3153 return Res; 3154 } 3155 3156 // seteq X, 0 -> srl (ctlz X, log2(size(X))) 3157 if (N1C && N1C->isNullValue() && CC == ISD::SETEQ && 3158 TLI.isOperationLegal(ISD::CTLZ, XType)) { 3159 SDOperand Ctlz = DAG.getNode(ISD::CTLZ, XType, N0); 3160 return DAG.getNode(ISD::SRL, XType, Ctlz, 3161 DAG.getConstant(Log2_32(MVT::getSizeInBits(XType)), 3162 TLI.getShiftAmountTy())); 3163 } 3164 // setgt X, 0 -> srl (and (-X, ~X), size(X)-1) 3165 if (N1C && N1C->isNullValue() && CC == ISD::SETGT) { 3166 SDOperand NegN0 = DAG.getNode(ISD::SUB, XType, DAG.getConstant(0, XType), 3167 N0); 3168 SDOperand NotN0 = DAG.getNode(ISD::XOR, XType, N0, 3169 DAG.getConstant(~0ULL, XType)); 3170 return DAG.getNode(ISD::SRL, XType, 3171 DAG.getNode(ISD::AND, XType, NegN0, NotN0), 3172 DAG.getConstant(MVT::getSizeInBits(XType)-1, 3173 TLI.getShiftAmountTy())); 3174 } 3175 // setgt X, -1 -> xor (srl (X, size(X)-1), 1) 3176 if (N1C && N1C->isAllOnesValue() && CC == ISD::SETGT) { 3177 SDOperand Sign = DAG.getNode(ISD::SRL, XType, N0, 3178 DAG.getConstant(MVT::getSizeInBits(XType)-1, 3179 TLI.getShiftAmountTy())); 3180 return DAG.getNode(ISD::XOR, XType, Sign, DAG.getConstant(1, XType)); 3181 } 3182 } 3183 3184 // Check to see if this is an integer abs. select_cc setl[te] X, 0, -X, X -> 3185 // Y = sra (X, size(X)-1); xor (add (X, Y), Y) 3186 if (N1C && N1C->isNullValue() && (CC == ISD::SETLT || CC == ISD::SETLE) && 3187 N0 == N3 && N2.getOpcode() == ISD::SUB && N0 == N2.getOperand(1)) { 3188 if (ConstantSDNode *SubC = dyn_cast<ConstantSDNode>(N2.getOperand(0))) { 3189 MVT::ValueType XType = N0.getValueType(); 3190 if (SubC->isNullValue() && MVT::isInteger(XType)) { 3191 SDOperand Shift = DAG.getNode(ISD::SRA, XType, N0, 3192 DAG.getConstant(MVT::getSizeInBits(XType)-1, 3193 TLI.getShiftAmountTy())); 3194 SDOperand Add = DAG.getNode(ISD::ADD, XType, N0, Shift); 3195 AddToWorkList(Shift.Val); 3196 AddToWorkList(Add.Val); 3197 return DAG.getNode(ISD::XOR, XType, Add, Shift); 3198 } 3199 } 3200 } 3201 3202 return SDOperand(); 3203} 3204 3205SDOperand DAGCombiner::SimplifySetCC(MVT::ValueType VT, SDOperand N0, 3206 SDOperand N1, ISD::CondCode Cond, 3207 bool foldBooleans) { 3208 // These setcc operations always fold. 3209 switch (Cond) { 3210 default: break; 3211 case ISD::SETFALSE: 3212 case ISD::SETFALSE2: return DAG.getConstant(0, VT); 3213 case ISD::SETTRUE: 3214 case ISD::SETTRUE2: return DAG.getConstant(1, VT); 3215 } 3216 3217 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) { 3218 uint64_t C1 = N1C->getValue(); 3219 if (ConstantSDNode *N0C = dyn_cast<ConstantSDNode>(N0.Val)) { 3220 uint64_t C0 = N0C->getValue(); 3221 3222 // Sign extend the operands if required 3223 if (ISD::isSignedIntSetCC(Cond)) { 3224 C0 = N0C->getSignExtended(); 3225 C1 = N1C->getSignExtended(); 3226 } 3227 3228 switch (Cond) { 3229 default: assert(0 && "Unknown integer setcc!"); 3230 case ISD::SETEQ: return DAG.getConstant(C0 == C1, VT); 3231 case ISD::SETNE: return DAG.getConstant(C0 != C1, VT); 3232 case ISD::SETULT: return DAG.getConstant(C0 < C1, VT); 3233 case ISD::SETUGT: return DAG.getConstant(C0 > C1, VT); 3234 case ISD::SETULE: return DAG.getConstant(C0 <= C1, VT); 3235 case ISD::SETUGE: return DAG.getConstant(C0 >= C1, VT); 3236 case ISD::SETLT: return DAG.getConstant((int64_t)C0 < (int64_t)C1, VT); 3237 case ISD::SETGT: return DAG.getConstant((int64_t)C0 > (int64_t)C1, VT); 3238 case ISD::SETLE: return DAG.getConstant((int64_t)C0 <= (int64_t)C1, VT); 3239 case ISD::SETGE: return DAG.getConstant((int64_t)C0 >= (int64_t)C1, VT); 3240 } 3241 } else { 3242 // If the LHS is a ZERO_EXTEND, perform the comparison on the input. 3243 if (N0.getOpcode() == ISD::ZERO_EXTEND) { 3244 unsigned InSize = MVT::getSizeInBits(N0.getOperand(0).getValueType()); 3245 3246 // If the comparison constant has bits in the upper part, the 3247 // zero-extended value could never match. 3248 if (C1 & (~0ULL << InSize)) { 3249 unsigned VSize = MVT::getSizeInBits(N0.getValueType()); 3250 switch (Cond) { 3251 case ISD::SETUGT: 3252 case ISD::SETUGE: 3253 case ISD::SETEQ: return DAG.getConstant(0, VT); 3254 case ISD::SETULT: 3255 case ISD::SETULE: 3256 case ISD::SETNE: return DAG.getConstant(1, VT); 3257 case ISD::SETGT: 3258 case ISD::SETGE: 3259 // True if the sign bit of C1 is set. 3260 return DAG.getConstant((C1 & (1ULL << VSize)) != 0, VT); 3261 case ISD::SETLT: 3262 case ISD::SETLE: 3263 // True if the sign bit of C1 isn't set. 3264 return DAG.getConstant((C1 & (1ULL << VSize)) == 0, VT); 3265 default: 3266 break; 3267 } 3268 } 3269 3270 // Otherwise, we can perform the comparison with the low bits. 3271 switch (Cond) { 3272 case ISD::SETEQ: 3273 case ISD::SETNE: 3274 case ISD::SETUGT: 3275 case ISD::SETUGE: 3276 case ISD::SETULT: 3277 case ISD::SETULE: 3278 return DAG.getSetCC(VT, N0.getOperand(0), 3279 DAG.getConstant(C1, N0.getOperand(0).getValueType()), 3280 Cond); 3281 default: 3282 break; // todo, be more careful with signed comparisons 3283 } 3284 } else if (N0.getOpcode() == ISD::SIGN_EXTEND_INREG && 3285 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) { 3286 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N0.getOperand(1))->getVT(); 3287 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy); 3288 MVT::ValueType ExtDstTy = N0.getValueType(); 3289 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy); 3290 3291 // If the extended part has any inconsistent bits, it cannot ever 3292 // compare equal. In other words, they have to be all ones or all 3293 // zeros. 3294 uint64_t ExtBits = 3295 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1)); 3296 if ((C1 & ExtBits) != 0 && (C1 & ExtBits) != ExtBits) 3297 return DAG.getConstant(Cond == ISD::SETNE, VT); 3298 3299 SDOperand ZextOp; 3300 MVT::ValueType Op0Ty = N0.getOperand(0).getValueType(); 3301 if (Op0Ty == ExtSrcTy) { 3302 ZextOp = N0.getOperand(0); 3303 } else { 3304 int64_t Imm = ~0ULL >> (64-ExtSrcTyBits); 3305 ZextOp = DAG.getNode(ISD::AND, Op0Ty, N0.getOperand(0), 3306 DAG.getConstant(Imm, Op0Ty)); 3307 } 3308 AddToWorkList(ZextOp.Val); 3309 // Otherwise, make this a use of a zext. 3310 return DAG.getSetCC(VT, ZextOp, 3311 DAG.getConstant(C1 & (~0ULL>>(64-ExtSrcTyBits)), 3312 ExtDstTy), 3313 Cond); 3314 } else if ((N1C->getValue() == 0 || N1C->getValue() == 1) && 3315 (Cond == ISD::SETEQ || Cond == ISD::SETNE) && 3316 (N0.getOpcode() == ISD::XOR || 3317 (N0.getOpcode() == ISD::AND && 3318 N0.getOperand(0).getOpcode() == ISD::XOR && 3319 N0.getOperand(1) == N0.getOperand(0).getOperand(1))) && 3320 isa<ConstantSDNode>(N0.getOperand(1)) && 3321 cast<ConstantSDNode>(N0.getOperand(1))->getValue() == 1) { 3322 // If this is (X^1) == 0/1, swap the RHS and eliminate the xor. We can 3323 // only do this if the top bits are known zero. 3324 if (TLI.MaskedValueIsZero(N1, 3325 MVT::getIntVTBitMask(N0.getValueType())-1)) { 3326 // Okay, get the un-inverted input value. 3327 SDOperand Val; 3328 if (N0.getOpcode() == ISD::XOR) 3329 Val = N0.getOperand(0); 3330 else { 3331 assert(N0.getOpcode() == ISD::AND && 3332 N0.getOperand(0).getOpcode() == ISD::XOR); 3333 // ((X^1)&1)^1 -> X & 1 3334 Val = DAG.getNode(ISD::AND, N0.getValueType(), 3335 N0.getOperand(0).getOperand(0), N0.getOperand(1)); 3336 } 3337 return DAG.getSetCC(VT, Val, N1, 3338 Cond == ISD::SETEQ ? ISD::SETNE : ISD::SETEQ); 3339 } 3340 } 3341 3342 uint64_t MinVal, MaxVal; 3343 unsigned OperandBitSize = MVT::getSizeInBits(N1C->getValueType(0)); 3344 if (ISD::isSignedIntSetCC(Cond)) { 3345 MinVal = 1ULL << (OperandBitSize-1); 3346 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined. 3347 MaxVal = ~0ULL >> (65-OperandBitSize); 3348 else 3349 MaxVal = 0; 3350 } else { 3351 MinVal = 0; 3352 MaxVal = ~0ULL >> (64-OperandBitSize); 3353 } 3354 3355 // Canonicalize GE/LE comparisons to use GT/LT comparisons. 3356 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) { 3357 if (C1 == MinVal) return DAG.getConstant(1, VT); // X >= MIN --> true 3358 --C1; // X >= C0 --> X > (C0-1) 3359 return DAG.getSetCC(VT, N0, DAG.getConstant(C1, N1.getValueType()), 3360 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT); 3361 } 3362 3363 if (Cond == ISD::SETLE || Cond == ISD::SETULE) { 3364 if (C1 == MaxVal) return DAG.getConstant(1, VT); // X <= MAX --> true 3365 ++C1; // X <= C0 --> X < (C0+1) 3366 return DAG.getSetCC(VT, N0, DAG.getConstant(C1, N1.getValueType()), 3367 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT); 3368 } 3369 3370 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal) 3371 return DAG.getConstant(0, VT); // X < MIN --> false 3372 3373 // Canonicalize setgt X, Min --> setne X, Min 3374 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MinVal) 3375 return DAG.getSetCC(VT, N0, N1, ISD::SETNE); 3376 // Canonicalize setlt X, Max --> setne X, Max 3377 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MaxVal) 3378 return DAG.getSetCC(VT, N0, N1, ISD::SETNE); 3379 3380 // If we have setult X, 1, turn it into seteq X, 0 3381 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C1 == MinVal+1) 3382 return DAG.getSetCC(VT, N0, DAG.getConstant(MinVal, N0.getValueType()), 3383 ISD::SETEQ); 3384 // If we have setugt X, Max-1, turn it into seteq X, Max 3385 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C1 == MaxVal-1) 3386 return DAG.getSetCC(VT, N0, DAG.getConstant(MaxVal, N0.getValueType()), 3387 ISD::SETEQ); 3388 3389 // If we have "setcc X, C0", check to see if we can shrink the immediate 3390 // by changing cc. 3391 3392 // SETUGT X, SINTMAX -> SETLT X, 0 3393 if (Cond == ISD::SETUGT && OperandBitSize != 1 && 3394 C1 == (~0ULL >> (65-OperandBitSize))) 3395 return DAG.getSetCC(VT, N0, DAG.getConstant(0, N1.getValueType()), 3396 ISD::SETLT); 3397 3398 // FIXME: Implement the rest of these. 3399 3400 // Fold bit comparisons when we can. 3401 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 3402 VT == N0.getValueType() && N0.getOpcode() == ISD::AND) 3403 if (ConstantSDNode *AndRHS = 3404 dyn_cast<ConstantSDNode>(N0.getOperand(1))) { 3405 if (Cond == ISD::SETNE && C1 == 0) {// (X & 8) != 0 --> (X & 8) >> 3 3406 // Perform the xform if the AND RHS is a single bit. 3407 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) { 3408 return DAG.getNode(ISD::SRL, VT, N0, 3409 DAG.getConstant(Log2_64(AndRHS->getValue()), 3410 TLI.getShiftAmountTy())); 3411 } 3412 } else if (Cond == ISD::SETEQ && C1 == AndRHS->getValue()) { 3413 // (X & 8) == 8 --> (X & 8) >> 3 3414 // Perform the xform if C1 is a single bit. 3415 if ((C1 & (C1-1)) == 0) { 3416 return DAG.getNode(ISD::SRL, VT, N0, 3417 DAG.getConstant(Log2_64(C1),TLI.getShiftAmountTy())); 3418 } 3419 } 3420 } 3421 } 3422 } else if (isa<ConstantSDNode>(N0.Val)) { 3423 // Ensure that the constant occurs on the RHS. 3424 return DAG.getSetCC(VT, N1, N0, ISD::getSetCCSwappedOperands(Cond)); 3425 } 3426 3427 if (ConstantFPSDNode *N0C = dyn_cast<ConstantFPSDNode>(N0.Val)) 3428 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) { 3429 double C0 = N0C->getValue(), C1 = N1C->getValue(); 3430 3431 switch (Cond) { 3432 default: break; // FIXME: Implement the rest of these! 3433 case ISD::SETEQ: return DAG.getConstant(C0 == C1, VT); 3434 case ISD::SETNE: return DAG.getConstant(C0 != C1, VT); 3435 case ISD::SETLT: return DAG.getConstant(C0 < C1, VT); 3436 case ISD::SETGT: return DAG.getConstant(C0 > C1, VT); 3437 case ISD::SETLE: return DAG.getConstant(C0 <= C1, VT); 3438 case ISD::SETGE: return DAG.getConstant(C0 >= C1, VT); 3439 } 3440 } else { 3441 // Ensure that the constant occurs on the RHS. 3442 return DAG.getSetCC(VT, N1, N0, ISD::getSetCCSwappedOperands(Cond)); 3443 } 3444 3445 if (N0 == N1) { 3446 // We can always fold X == Y for integer setcc's. 3447 if (MVT::isInteger(N0.getValueType())) 3448 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT); 3449 unsigned UOF = ISD::getUnorderedFlavor(Cond); 3450 if (UOF == 2) // FP operators that are undefined on NaNs. 3451 return DAG.getConstant(ISD::isTrueWhenEqual(Cond), VT); 3452 if (UOF == unsigned(ISD::isTrueWhenEqual(Cond))) 3453 return DAG.getConstant(UOF, VT); 3454 // Otherwise, we can't fold it. However, we can simplify it to SETUO/SETO 3455 // if it is not already. 3456 ISD::CondCode NewCond = UOF == 0 ? ISD::SETO : ISD::SETUO; 3457 if (NewCond != Cond) 3458 return DAG.getSetCC(VT, N0, N1, NewCond); 3459 } 3460 3461 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) && 3462 MVT::isInteger(N0.getValueType())) { 3463 if (N0.getOpcode() == ISD::ADD || N0.getOpcode() == ISD::SUB || 3464 N0.getOpcode() == ISD::XOR) { 3465 // Simplify (X+Y) == (X+Z) --> Y == Z 3466 if (N0.getOpcode() == N1.getOpcode()) { 3467 if (N0.getOperand(0) == N1.getOperand(0)) 3468 return DAG.getSetCC(VT, N0.getOperand(1), N1.getOperand(1), Cond); 3469 if (N0.getOperand(1) == N1.getOperand(1)) 3470 return DAG.getSetCC(VT, N0.getOperand(0), N1.getOperand(0), Cond); 3471 if (isCommutativeBinOp(N0.getOpcode())) { 3472 // If X op Y == Y op X, try other combinations. 3473 if (N0.getOperand(0) == N1.getOperand(1)) 3474 return DAG.getSetCC(VT, N0.getOperand(1), N1.getOperand(0), Cond); 3475 if (N0.getOperand(1) == N1.getOperand(0)) 3476 return DAG.getSetCC(VT, N0.getOperand(0), N1.getOperand(1), Cond); 3477 } 3478 } 3479 3480 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(N1)) { 3481 if (ConstantSDNode *LHSR = dyn_cast<ConstantSDNode>(N0.getOperand(1))) { 3482 // Turn (X+C1) == C2 --> X == C2-C1 3483 if (N0.getOpcode() == ISD::ADD && N0.Val->hasOneUse()) { 3484 return DAG.getSetCC(VT, N0.getOperand(0), 3485 DAG.getConstant(RHSC->getValue()-LHSR->getValue(), 3486 N0.getValueType()), Cond); 3487 } 3488 3489 // Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0. 3490 if (N0.getOpcode() == ISD::XOR) 3491 // If we know that all of the inverted bits are zero, don't bother 3492 // performing the inversion. 3493 if (TLI.MaskedValueIsZero(N0.getOperand(0), ~LHSR->getValue())) 3494 return DAG.getSetCC(VT, N0.getOperand(0), 3495 DAG.getConstant(LHSR->getValue()^RHSC->getValue(), 3496 N0.getValueType()), Cond); 3497 } 3498 3499 // Turn (C1-X) == C2 --> X == C1-C2 3500 if (ConstantSDNode *SUBC = dyn_cast<ConstantSDNode>(N0.getOperand(0))) { 3501 if (N0.getOpcode() == ISD::SUB && N0.Val->hasOneUse()) { 3502 return DAG.getSetCC(VT, N0.getOperand(1), 3503 DAG.getConstant(SUBC->getValue()-RHSC->getValue(), 3504 N0.getValueType()), Cond); 3505 } 3506 } 3507 } 3508 3509 // Simplify (X+Z) == X --> Z == 0 3510 if (N0.getOperand(0) == N1) 3511 return DAG.getSetCC(VT, N0.getOperand(1), 3512 DAG.getConstant(0, N0.getValueType()), Cond); 3513 if (N0.getOperand(1) == N1) { 3514 if (isCommutativeBinOp(N0.getOpcode())) 3515 return DAG.getSetCC(VT, N0.getOperand(0), 3516 DAG.getConstant(0, N0.getValueType()), Cond); 3517 else { 3518 assert(N0.getOpcode() == ISD::SUB && "Unexpected operation!"); 3519 // (Z-X) == X --> Z == X<<1 3520 SDOperand SH = DAG.getNode(ISD::SHL, N1.getValueType(), 3521 N1, 3522 DAG.getConstant(1,TLI.getShiftAmountTy())); 3523 AddToWorkList(SH.Val); 3524 return DAG.getSetCC(VT, N0.getOperand(0), SH, Cond); 3525 } 3526 } 3527 } 3528 3529 if (N1.getOpcode() == ISD::ADD || N1.getOpcode() == ISD::SUB || 3530 N1.getOpcode() == ISD::XOR) { 3531 // Simplify X == (X+Z) --> Z == 0 3532 if (N1.getOperand(0) == N0) { 3533 return DAG.getSetCC(VT, N1.getOperand(1), 3534 DAG.getConstant(0, N1.getValueType()), Cond); 3535 } else if (N1.getOperand(1) == N0) { 3536 if (isCommutativeBinOp(N1.getOpcode())) { 3537 return DAG.getSetCC(VT, N1.getOperand(0), 3538 DAG.getConstant(0, N1.getValueType()), Cond); 3539 } else { 3540 assert(N1.getOpcode() == ISD::SUB && "Unexpected operation!"); 3541 // X == (Z-X) --> X<<1 == Z 3542 SDOperand SH = DAG.getNode(ISD::SHL, N1.getValueType(), N0, 3543 DAG.getConstant(1,TLI.getShiftAmountTy())); 3544 AddToWorkList(SH.Val); 3545 return DAG.getSetCC(VT, SH, N1.getOperand(0), Cond); 3546 } 3547 } 3548 } 3549 } 3550 3551 // Fold away ALL boolean setcc's. 3552 SDOperand Temp; 3553 if (N0.getValueType() == MVT::i1 && foldBooleans) { 3554 switch (Cond) { 3555 default: assert(0 && "Unknown integer setcc!"); 3556 case ISD::SETEQ: // X == Y -> (X^Y)^1 3557 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, N1); 3558 N0 = DAG.getNode(ISD::XOR, MVT::i1, Temp, DAG.getConstant(1, MVT::i1)); 3559 AddToWorkList(Temp.Val); 3560 break; 3561 case ISD::SETNE: // X != Y --> (X^Y) 3562 N0 = DAG.getNode(ISD::XOR, MVT::i1, N0, N1); 3563 break; 3564 case ISD::SETGT: // X >s Y --> X == 0 & Y == 1 --> X^1 & Y 3565 case ISD::SETULT: // X <u Y --> X == 0 & Y == 1 --> X^1 & Y 3566 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, DAG.getConstant(1, MVT::i1)); 3567 N0 = DAG.getNode(ISD::AND, MVT::i1, N1, Temp); 3568 AddToWorkList(Temp.Val); 3569 break; 3570 case ISD::SETLT: // X <s Y --> X == 1 & Y == 0 --> Y^1 & X 3571 case ISD::SETUGT: // X >u Y --> X == 1 & Y == 0 --> Y^1 & X 3572 Temp = DAG.getNode(ISD::XOR, MVT::i1, N1, DAG.getConstant(1, MVT::i1)); 3573 N0 = DAG.getNode(ISD::AND, MVT::i1, N0, Temp); 3574 AddToWorkList(Temp.Val); 3575 break; 3576 case ISD::SETULE: // X <=u Y --> X == 0 | Y == 1 --> X^1 | Y 3577 case ISD::SETGE: // X >=s Y --> X == 0 | Y == 1 --> X^1 | Y 3578 Temp = DAG.getNode(ISD::XOR, MVT::i1, N0, DAG.getConstant(1, MVT::i1)); 3579 N0 = DAG.getNode(ISD::OR, MVT::i1, N1, Temp); 3580 AddToWorkList(Temp.Val); 3581 break; 3582 case ISD::SETUGE: // X >=u Y --> X == 1 | Y == 0 --> Y^1 | X 3583 case ISD::SETLE: // X <=s Y --> X == 1 | Y == 0 --> Y^1 | X 3584 Temp = DAG.getNode(ISD::XOR, MVT::i1, N1, DAG.getConstant(1, MVT::i1)); 3585 N0 = DAG.getNode(ISD::OR, MVT::i1, N0, Temp); 3586 break; 3587 } 3588 if (VT != MVT::i1) { 3589 AddToWorkList(N0.Val); 3590 // FIXME: If running after legalize, we probably can't do this. 3591 N0 = DAG.getNode(ISD::ZERO_EXTEND, VT, N0); 3592 } 3593 return N0; 3594 } 3595 3596 // Could not fold it. 3597 return SDOperand(); 3598} 3599 3600/// BuildSDIVSequence - Given an ISD::SDIV node expressing a divide by constant, 3601/// return a DAG expression to select that will generate the same value by 3602/// multiplying by a magic number. See: 3603/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html> 3604SDOperand DAGCombiner::BuildSDIV(SDNode *N) { 3605 MVT::ValueType VT = N->getValueType(0); 3606 3607 // Check to see if we can do this. 3608 if (!TLI.isTypeLegal(VT) || (VT != MVT::i32 && VT != MVT::i64)) 3609 return SDOperand(); // BuildSDIV only operates on i32 or i64 3610 if (!TLI.isOperationLegal(ISD::MULHS, VT)) 3611 return SDOperand(); // Make sure the target supports MULHS. 3612 3613 int64_t d = cast<ConstantSDNode>(N->getOperand(1))->getSignExtended(); 3614 ms magics = (VT == MVT::i32) ? magic32(d) : magic64(d); 3615 3616 // Multiply the numerator (operand 0) by the magic value 3617 SDOperand Q = DAG.getNode(ISD::MULHS, VT, N->getOperand(0), 3618 DAG.getConstant(magics.m, VT)); 3619 // If d > 0 and m < 0, add the numerator 3620 if (d > 0 && magics.m < 0) { 3621 Q = DAG.getNode(ISD::ADD, VT, Q, N->getOperand(0)); 3622 AddToWorkList(Q.Val); 3623 } 3624 // If d < 0 and m > 0, subtract the numerator. 3625 if (d < 0 && magics.m > 0) { 3626 Q = DAG.getNode(ISD::SUB, VT, Q, N->getOperand(0)); 3627 AddToWorkList(Q.Val); 3628 } 3629 // Shift right algebraic if shift value is nonzero 3630 if (magics.s > 0) { 3631 Q = DAG.getNode(ISD::SRA, VT, Q, 3632 DAG.getConstant(magics.s, TLI.getShiftAmountTy())); 3633 AddToWorkList(Q.Val); 3634 } 3635 // Extract the sign bit and add it to the quotient 3636 SDOperand T = 3637 DAG.getNode(ISD::SRL, VT, Q, DAG.getConstant(MVT::getSizeInBits(VT)-1, 3638 TLI.getShiftAmountTy())); 3639 AddToWorkList(T.Val); 3640 return DAG.getNode(ISD::ADD, VT, Q, T); 3641} 3642 3643/// BuildUDIVSequence - Given an ISD::UDIV node expressing a divide by constant, 3644/// return a DAG expression to select that will generate the same value by 3645/// multiplying by a magic number. See: 3646/// <http://the.wall.riscom.net/books/proc/ppc/cwg/code2.html> 3647SDOperand DAGCombiner::BuildUDIV(SDNode *N) { 3648 MVT::ValueType VT = N->getValueType(0); 3649 3650 // Check to see if we can do this. 3651 if (!TLI.isTypeLegal(VT) || (VT != MVT::i32 && VT != MVT::i64)) 3652 return SDOperand(); // BuildUDIV only operates on i32 or i64 3653 if (!TLI.isOperationLegal(ISD::MULHU, VT)) 3654 return SDOperand(); // Make sure the target supports MULHU. 3655 3656 uint64_t d = cast<ConstantSDNode>(N->getOperand(1))->getValue(); 3657 mu magics = (VT == MVT::i32) ? magicu32(d) : magicu64(d); 3658 3659 // Multiply the numerator (operand 0) by the magic value 3660 SDOperand Q = DAG.getNode(ISD::MULHU, VT, N->getOperand(0), 3661 DAG.getConstant(magics.m, VT)); 3662 AddToWorkList(Q.Val); 3663 3664 if (magics.a == 0) { 3665 return DAG.getNode(ISD::SRL, VT, Q, 3666 DAG.getConstant(magics.s, TLI.getShiftAmountTy())); 3667 } else { 3668 SDOperand NPQ = DAG.getNode(ISD::SUB, VT, N->getOperand(0), Q); 3669 AddToWorkList(NPQ.Val); 3670 NPQ = DAG.getNode(ISD::SRL, VT, NPQ, 3671 DAG.getConstant(1, TLI.getShiftAmountTy())); 3672 AddToWorkList(NPQ.Val); 3673 NPQ = DAG.getNode(ISD::ADD, VT, NPQ, Q); 3674 AddToWorkList(NPQ.Val); 3675 return DAG.getNode(ISD::SRL, VT, NPQ, 3676 DAG.getConstant(magics.s-1, TLI.getShiftAmountTy())); 3677 } 3678} 3679 3680// SelectionDAG::Combine - This is the entry point for the file. 3681// 3682void SelectionDAG::Combine(bool RunningAfterLegalize) { 3683 /// run - This is the main entry point to this class. 3684 /// 3685 DAGCombiner(*this).Run(RunningAfterLegalize); 3686} 3687