1 //===----- LegalizeIntegerTypes.cpp - Legalization of integer types -------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This file implements integer type expansion and promotion for LegalizeTypes. 11 // Promotion is the act of changing a computation in an illegal type into a 12 // computation in a larger type. For example, implementing i8 arithmetic in an 13 // i32 register (often needed on powerpc). 14 // Expansion is the act of changing a computation in an illegal type into a 15 // computation in two identical registers of a smaller type. For example, 16 // implementing i64 arithmetic in two i32 registers (often needed on 32-bit 17 // targets). 18 // 19 //===----------------------------------------------------------------------===// 20 21 #include "LegalizeTypes.h" 22 #include "llvm/DerivedTypes.h" 23 #include "llvm/Support/ErrorHandling.h" 24 #include "llvm/Support/raw_ostream.h" 25 using namespace llvm; 26 27 //===----------------------------------------------------------------------===// 28 // Integer Result Promotion 29 //===----------------------------------------------------------------------===// 30 31 /// PromoteIntegerResult - This method is called when a result of a node is 32 /// found to be in need of promotion to a larger type. At this point, the node 33 /// may also have invalid operands or may have other results that need 34 /// expansion, we just know that (at least) one result needs promotion. 35 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) { 36 DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG); dbgs() << "\n"); 37 SDValue Res = SDValue(); 38 39 // See if the target wants to custom expand this node. 40 if (CustomLowerNode(N, N->getValueType(ResNo), true)) 41 return; 42 43 switch (N->getOpcode()) { 44 default: 45 #ifndef NDEBUG 46 dbgs() << "PromoteIntegerResult #" << ResNo << ": "; 47 N->dump(&DAG); dbgs() << "\n"; 48 #endif 49 llvm_unreachable("Do not know how to promote this operator!"); 50 case ISD::MERGE_VALUES:Res = PromoteIntRes_MERGE_VALUES(N, ResNo); break; 51 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break; 52 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break; 53 case ISD::BITCAST: Res = PromoteIntRes_BITCAST(N); break; 54 case ISD::BSWAP: Res = PromoteIntRes_BSWAP(N); break; 55 case ISD::BUILD_PAIR: Res = PromoteIntRes_BUILD_PAIR(N); break; 56 case ISD::Constant: Res = PromoteIntRes_Constant(N); break; 57 case ISD::CONVERT_RNDSAT: 58 Res = PromoteIntRes_CONVERT_RNDSAT(N); break; 59 case ISD::CTLZ_ZERO_UNDEF: 60 case ISD::CTLZ: Res = PromoteIntRes_CTLZ(N); break; 61 case ISD::CTPOP: Res = PromoteIntRes_CTPOP(N); break; 62 case ISD::CTTZ_ZERO_UNDEF: 63 case ISD::CTTZ: Res = PromoteIntRes_CTTZ(N); break; 64 case ISD::EXTRACT_VECTOR_ELT: 65 Res = PromoteIntRes_EXTRACT_VECTOR_ELT(N); break; 66 case ISD::LOAD: Res = PromoteIntRes_LOAD(cast<LoadSDNode>(N));break; 67 case ISD::SELECT: Res = PromoteIntRes_SELECT(N); break; 68 case ISD::VSELECT: Res = PromoteIntRes_VSELECT(N); break; 69 case ISD::SELECT_CC: Res = PromoteIntRes_SELECT_CC(N); break; 70 case ISD::SETCC: Res = PromoteIntRes_SETCC(N); break; 71 case ISD::SHL: Res = PromoteIntRes_SHL(N); break; 72 case ISD::SIGN_EXTEND_INREG: 73 Res = PromoteIntRes_SIGN_EXTEND_INREG(N); break; 74 case ISD::SRA: Res = PromoteIntRes_SRA(N); break; 75 case ISD::SRL: Res = PromoteIntRes_SRL(N); break; 76 case ISD::TRUNCATE: Res = PromoteIntRes_TRUNCATE(N); break; 77 case ISD::UNDEF: Res = PromoteIntRes_UNDEF(N); break; 78 case ISD::VAARG: Res = PromoteIntRes_VAARG(N); break; 79 80 case ISD::EXTRACT_SUBVECTOR: 81 Res = PromoteIntRes_EXTRACT_SUBVECTOR(N); break; 82 case ISD::VECTOR_SHUFFLE: 83 Res = PromoteIntRes_VECTOR_SHUFFLE(N); break; 84 case ISD::INSERT_VECTOR_ELT: 85 Res = PromoteIntRes_INSERT_VECTOR_ELT(N); break; 86 case ISD::BUILD_VECTOR: 87 Res = PromoteIntRes_BUILD_VECTOR(N); break; 88 case ISD::SCALAR_TO_VECTOR: 89 Res = PromoteIntRes_SCALAR_TO_VECTOR(N); break; 90 case ISD::CONCAT_VECTORS: 91 Res = PromoteIntRes_CONCAT_VECTORS(N); break; 92 93 case ISD::SIGN_EXTEND: 94 case ISD::ZERO_EXTEND: 95 case ISD::ANY_EXTEND: Res = PromoteIntRes_INT_EXTEND(N); break; 96 97 case ISD::FP_TO_SINT: 98 case ISD::FP_TO_UINT: Res = PromoteIntRes_FP_TO_XINT(N); break; 99 100 case ISD::FP32_TO_FP16:Res = PromoteIntRes_FP32_TO_FP16(N); break; 101 102 case ISD::AND: 103 case ISD::OR: 104 case ISD::XOR: 105 case ISD::ADD: 106 case ISD::SUB: 107 case ISD::MUL: Res = PromoteIntRes_SimpleIntBinOp(N); break; 108 109 case ISD::SDIV: 110 case ISD::SREM: Res = PromoteIntRes_SDIV(N); break; 111 112 case ISD::UDIV: 113 case ISD::UREM: Res = PromoteIntRes_UDIV(N); break; 114 115 case ISD::SADDO: 116 case ISD::SSUBO: Res = PromoteIntRes_SADDSUBO(N, ResNo); break; 117 case ISD::UADDO: 118 case ISD::USUBO: Res = PromoteIntRes_UADDSUBO(N, ResNo); break; 119 case ISD::SMULO: 120 case ISD::UMULO: Res = PromoteIntRes_XMULO(N, ResNo); break; 121 122 case ISD::ATOMIC_LOAD: 123 Res = PromoteIntRes_Atomic0(cast<AtomicSDNode>(N)); break; 124 125 case ISD::ATOMIC_LOAD_ADD: 126 case ISD::ATOMIC_LOAD_SUB: 127 case ISD::ATOMIC_LOAD_AND: 128 case ISD::ATOMIC_LOAD_OR: 129 case ISD::ATOMIC_LOAD_XOR: 130 case ISD::ATOMIC_LOAD_NAND: 131 case ISD::ATOMIC_LOAD_MIN: 132 case ISD::ATOMIC_LOAD_MAX: 133 case ISD::ATOMIC_LOAD_UMIN: 134 case ISD::ATOMIC_LOAD_UMAX: 135 case ISD::ATOMIC_SWAP: 136 Res = PromoteIntRes_Atomic1(cast<AtomicSDNode>(N)); break; 137 138 case ISD::ATOMIC_CMP_SWAP: 139 Res = PromoteIntRes_Atomic2(cast<AtomicSDNode>(N)); break; 140 } 141 142 // If the result is null then the sub-method took care of registering it. 143 if (Res.getNode()) 144 SetPromotedInteger(SDValue(N, ResNo), Res); 145 } 146 147 SDValue DAGTypeLegalizer::PromoteIntRes_MERGE_VALUES(SDNode *N, 148 unsigned ResNo) { 149 SDValue Op = DisintegrateMERGE_VALUES(N, ResNo); 150 return GetPromotedInteger(Op); 151 } 152 153 SDValue DAGTypeLegalizer::PromoteIntRes_AssertSext(SDNode *N) { 154 // Sign-extend the new bits, and continue the assertion. 155 SDValue Op = SExtPromotedInteger(N->getOperand(0)); 156 return DAG.getNode(ISD::AssertSext, N->getDebugLoc(), 157 Op.getValueType(), Op, N->getOperand(1)); 158 } 159 160 SDValue DAGTypeLegalizer::PromoteIntRes_AssertZext(SDNode *N) { 161 // Zero the new bits, and continue the assertion. 162 SDValue Op = ZExtPromotedInteger(N->getOperand(0)); 163 return DAG.getNode(ISD::AssertZext, N->getDebugLoc(), 164 Op.getValueType(), Op, N->getOperand(1)); 165 } 166 167 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic0(AtomicSDNode *N) { 168 EVT ResVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 169 SDValue Res = DAG.getAtomic(N->getOpcode(), N->getDebugLoc(), 170 N->getMemoryVT(), ResVT, 171 N->getChain(), N->getBasePtr(), 172 N->getMemOperand(), N->getOrdering(), 173 N->getSynchScope()); 174 // Legalized the chain result - switch anything that used the old chain to 175 // use the new one. 176 ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); 177 return Res; 178 } 179 180 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic1(AtomicSDNode *N) { 181 SDValue Op2 = GetPromotedInteger(N->getOperand(2)); 182 SDValue Res = DAG.getAtomic(N->getOpcode(), N->getDebugLoc(), 183 N->getMemoryVT(), 184 N->getChain(), N->getBasePtr(), 185 Op2, N->getMemOperand(), N->getOrdering(), 186 N->getSynchScope()); 187 // Legalized the chain result - switch anything that used the old chain to 188 // use the new one. 189 ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); 190 return Res; 191 } 192 193 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic2(AtomicSDNode *N) { 194 SDValue Op2 = GetPromotedInteger(N->getOperand(2)); 195 SDValue Op3 = GetPromotedInteger(N->getOperand(3)); 196 SDValue Res = DAG.getAtomic(N->getOpcode(), N->getDebugLoc(), 197 N->getMemoryVT(), N->getChain(), N->getBasePtr(), 198 Op2, Op3, N->getMemOperand(), N->getOrdering(), 199 N->getSynchScope()); 200 // Legalized the chain result - switch anything that used the old chain to 201 // use the new one. 202 ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); 203 return Res; 204 } 205 206 SDValue DAGTypeLegalizer::PromoteIntRes_BITCAST(SDNode *N) { 207 SDValue InOp = N->getOperand(0); 208 EVT InVT = InOp.getValueType(); 209 EVT NInVT = TLI.getTypeToTransformTo(*DAG.getContext(), InVT); 210 EVT OutVT = N->getValueType(0); 211 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 212 DebugLoc dl = N->getDebugLoc(); 213 214 switch (getTypeAction(InVT)) { 215 case TargetLowering::TypeLegal: 216 break; 217 case TargetLowering::TypePromoteInteger: 218 if (NOutVT.bitsEq(NInVT) && !NOutVT.isVector() && !NInVT.isVector()) 219 // The input promotes to the same size. Convert the promoted value. 220 return DAG.getNode(ISD::BITCAST, dl, NOutVT, GetPromotedInteger(InOp)); 221 break; 222 case TargetLowering::TypeSoftenFloat: 223 // Promote the integer operand by hand. 224 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT, GetSoftenedFloat(InOp)); 225 case TargetLowering::TypeExpandInteger: 226 case TargetLowering::TypeExpandFloat: 227 break; 228 case TargetLowering::TypeScalarizeVector: 229 // Convert the element to an integer and promote it by hand. 230 if (!NOutVT.isVector()) 231 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT, 232 BitConvertToInteger(GetScalarizedVector(InOp))); 233 break; 234 case TargetLowering::TypeSplitVector: { 235 // For example, i32 = BITCAST v2i16 on alpha. Convert the split 236 // pieces of the input into integers and reassemble in the final type. 237 SDValue Lo, Hi; 238 GetSplitVector(N->getOperand(0), Lo, Hi); 239 Lo = BitConvertToInteger(Lo); 240 Hi = BitConvertToInteger(Hi); 241 242 if (TLI.isBigEndian()) 243 std::swap(Lo, Hi); 244 245 InOp = DAG.getNode(ISD::ANY_EXTEND, dl, 246 EVT::getIntegerVT(*DAG.getContext(), 247 NOutVT.getSizeInBits()), 248 JoinIntegers(Lo, Hi)); 249 return DAG.getNode(ISD::BITCAST, dl, NOutVT, InOp); 250 } 251 case TargetLowering::TypeWidenVector: 252 // The input is widened to the same size. Convert to the widened value. 253 // Make sure that the outgoing value is not a vector, because this would 254 // make us bitcast between two vectors which are legalized in different ways. 255 if (NOutVT.bitsEq(NInVT) && !NOutVT.isVector()) 256 return DAG.getNode(ISD::BITCAST, dl, NOutVT, GetWidenedVector(InOp)); 257 } 258 259 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT, 260 CreateStackStoreLoad(InOp, OutVT)); 261 } 262 263 SDValue DAGTypeLegalizer::PromoteIntRes_BSWAP(SDNode *N) { 264 SDValue Op = GetPromotedInteger(N->getOperand(0)); 265 EVT OVT = N->getValueType(0); 266 EVT NVT = Op.getValueType(); 267 DebugLoc dl = N->getDebugLoc(); 268 269 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits(); 270 return DAG.getNode(ISD::SRL, dl, NVT, DAG.getNode(ISD::BSWAP, dl, NVT, Op), 271 DAG.getConstant(DiffBits, TLI.getPointerTy())); 272 } 273 274 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_PAIR(SDNode *N) { 275 // The pair element type may be legal, or may not promote to the same type as 276 // the result, for example i14 = BUILD_PAIR (i7, i7). Handle all cases. 277 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), 278 TLI.getTypeToTransformTo(*DAG.getContext(), 279 N->getValueType(0)), JoinIntegers(N->getOperand(0), 280 N->getOperand(1))); 281 } 282 283 SDValue DAGTypeLegalizer::PromoteIntRes_Constant(SDNode *N) { 284 EVT VT = N->getValueType(0); 285 // FIXME there is no actual debug info here 286 DebugLoc dl = N->getDebugLoc(); 287 // Zero extend things like i1, sign extend everything else. It shouldn't 288 // matter in theory which one we pick, but this tends to give better code? 289 unsigned Opc = VT.isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND; 290 SDValue Result = DAG.getNode(Opc, dl, 291 TLI.getTypeToTransformTo(*DAG.getContext(), VT), 292 SDValue(N, 0)); 293 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold ext?"); 294 return Result; 295 } 296 297 SDValue DAGTypeLegalizer::PromoteIntRes_CONVERT_RNDSAT(SDNode *N) { 298 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode(); 299 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU || 300 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU || 301 CvtCode == ISD::CVT_SF || CvtCode == ISD::CVT_UF) && 302 "can only promote integers"); 303 EVT OutVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 304 return DAG.getConvertRndSat(OutVT, N->getDebugLoc(), N->getOperand(0), 305 N->getOperand(1), N->getOperand(2), 306 N->getOperand(3), N->getOperand(4), CvtCode); 307 } 308 309 SDValue DAGTypeLegalizer::PromoteIntRes_CTLZ(SDNode *N) { 310 // Zero extend to the promoted type and do the count there. 311 SDValue Op = ZExtPromotedInteger(N->getOperand(0)); 312 DebugLoc dl = N->getDebugLoc(); 313 EVT OVT = N->getValueType(0); 314 EVT NVT = Op.getValueType(); 315 Op = DAG.getNode(N->getOpcode(), dl, NVT, Op); 316 // Subtract off the extra leading bits in the bigger type. 317 return DAG.getNode(ISD::SUB, dl, NVT, Op, 318 DAG.getConstant(NVT.getSizeInBits() - 319 OVT.getSizeInBits(), NVT)); 320 } 321 322 SDValue DAGTypeLegalizer::PromoteIntRes_CTPOP(SDNode *N) { 323 // Zero extend to the promoted type and do the count there. 324 SDValue Op = ZExtPromotedInteger(N->getOperand(0)); 325 return DAG.getNode(ISD::CTPOP, N->getDebugLoc(), Op.getValueType(), Op); 326 } 327 328 SDValue DAGTypeLegalizer::PromoteIntRes_CTTZ(SDNode *N) { 329 SDValue Op = GetPromotedInteger(N->getOperand(0)); 330 EVT OVT = N->getValueType(0); 331 EVT NVT = Op.getValueType(); 332 DebugLoc dl = N->getDebugLoc(); 333 if (N->getOpcode() == ISD::CTTZ) { 334 // The count is the same in the promoted type except if the original 335 // value was zero. This can be handled by setting the bit just off 336 // the top of the original type. 337 APInt TopBit(NVT.getSizeInBits(), 0); 338 TopBit.setBit(OVT.getSizeInBits()); 339 Op = DAG.getNode(ISD::OR, dl, NVT, Op, DAG.getConstant(TopBit, NVT)); 340 } 341 return DAG.getNode(N->getOpcode(), dl, NVT, Op); 342 } 343 344 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N) { 345 DebugLoc dl = N->getDebugLoc(); 346 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 347 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NVT, N->getOperand(0), 348 N->getOperand(1)); 349 } 350 351 SDValue DAGTypeLegalizer::PromoteIntRes_FP_TO_XINT(SDNode *N) { 352 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 353 unsigned NewOpc = N->getOpcode(); 354 DebugLoc dl = N->getDebugLoc(); 355 356 // If we're promoting a UINT to a larger size and the larger FP_TO_UINT is 357 // not Legal, check to see if we can use FP_TO_SINT instead. (If both UINT 358 // and SINT conversions are Custom, there is no way to tell which is 359 // preferable. We choose SINT because that's the right thing on PPC.) 360 if (N->getOpcode() == ISD::FP_TO_UINT && 361 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) && 362 TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NVT)) 363 NewOpc = ISD::FP_TO_SINT; 364 365 SDValue Res = DAG.getNode(NewOpc, dl, NVT, N->getOperand(0)); 366 367 // Assert that the converted value fits in the original type. If it doesn't 368 // (eg: because the value being converted is too big), then the result of the 369 // original operation was undefined anyway, so the assert is still correct. 370 return DAG.getNode(N->getOpcode() == ISD::FP_TO_UINT ? 371 ISD::AssertZext : ISD::AssertSext, dl, NVT, Res, 372 DAG.getValueType(N->getValueType(0).getScalarType())); 373 } 374 375 SDValue DAGTypeLegalizer::PromoteIntRes_FP32_TO_FP16(SDNode *N) { 376 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 377 DebugLoc dl = N->getDebugLoc(); 378 379 SDValue Res = DAG.getNode(N->getOpcode(), dl, NVT, N->getOperand(0)); 380 381 return DAG.getNode(ISD::AssertZext, dl, 382 NVT, Res, DAG.getValueType(N->getValueType(0))); 383 } 384 385 SDValue DAGTypeLegalizer::PromoteIntRes_INT_EXTEND(SDNode *N) { 386 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 387 DebugLoc dl = N->getDebugLoc(); 388 389 if (getTypeAction(N->getOperand(0).getValueType()) 390 == TargetLowering::TypePromoteInteger) { 391 SDValue Res = GetPromotedInteger(N->getOperand(0)); 392 assert(Res.getValueType().bitsLE(NVT) && "Extension doesn't make sense!"); 393 394 // If the result and operand types are the same after promotion, simplify 395 // to an in-register extension. 396 if (NVT == Res.getValueType()) { 397 // The high bits are not guaranteed to be anything. Insert an extend. 398 if (N->getOpcode() == ISD::SIGN_EXTEND) 399 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res, 400 DAG.getValueType(N->getOperand(0).getValueType())); 401 if (N->getOpcode() == ISD::ZERO_EXTEND) 402 return DAG.getZeroExtendInReg(Res, dl, 403 N->getOperand(0).getValueType().getScalarType()); 404 assert(N->getOpcode() == ISD::ANY_EXTEND && "Unknown integer extension!"); 405 return Res; 406 } 407 } 408 409 // Otherwise, just extend the original operand all the way to the larger type. 410 return DAG.getNode(N->getOpcode(), dl, NVT, N->getOperand(0)); 411 } 412 413 SDValue DAGTypeLegalizer::PromoteIntRes_LOAD(LoadSDNode *N) { 414 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!"); 415 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 416 ISD::LoadExtType ExtType = 417 ISD::isNON_EXTLoad(N) ? ISD::EXTLOAD : N->getExtensionType(); 418 DebugLoc dl = N->getDebugLoc(); 419 SDValue Res = DAG.getExtLoad(ExtType, dl, NVT, N->getChain(), N->getBasePtr(), 420 N->getPointerInfo(), 421 N->getMemoryVT(), N->isVolatile(), 422 N->isNonTemporal(), N->getAlignment()); 423 424 // Legalized the chain result - switch anything that used the old chain to 425 // use the new one. 426 ReplaceValueWith(SDValue(N, 1), Res.getValue(1)); 427 return Res; 428 } 429 430 /// Promote the overflow flag of an overflowing arithmetic node. 431 SDValue DAGTypeLegalizer::PromoteIntRes_Overflow(SDNode *N) { 432 // Simply change the return type of the boolean result. 433 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(1)); 434 EVT ValueVTs[] = { N->getValueType(0), NVT }; 435 SDValue Ops[] = { N->getOperand(0), N->getOperand(1) }; 436 SDValue Res = DAG.getNode(N->getOpcode(), N->getDebugLoc(), 437 DAG.getVTList(ValueVTs, 2), Ops, 2); 438 439 // Modified the sum result - switch anything that used the old sum to use 440 // the new one. 441 ReplaceValueWith(SDValue(N, 0), Res); 442 443 return SDValue(Res.getNode(), 1); 444 } 445 446 SDValue DAGTypeLegalizer::PromoteIntRes_SADDSUBO(SDNode *N, unsigned ResNo) { 447 if (ResNo == 1) 448 return PromoteIntRes_Overflow(N); 449 450 // The operation overflowed iff the result in the larger type is not the 451 // sign extension of its truncation to the original type. 452 SDValue LHS = SExtPromotedInteger(N->getOperand(0)); 453 SDValue RHS = SExtPromotedInteger(N->getOperand(1)); 454 EVT OVT = N->getOperand(0).getValueType(); 455 EVT NVT = LHS.getValueType(); 456 DebugLoc dl = N->getDebugLoc(); 457 458 // Do the arithmetic in the larger type. 459 unsigned Opcode = N->getOpcode() == ISD::SADDO ? ISD::ADD : ISD::SUB; 460 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS); 461 462 // Calculate the overflow flag: sign extend the arithmetic result from 463 // the original type. 464 SDValue Ofl = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res, 465 DAG.getValueType(OVT)); 466 // Overflowed if and only if this is not equal to Res. 467 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE); 468 469 // Use the calculated overflow everywhere. 470 ReplaceValueWith(SDValue(N, 1), Ofl); 471 472 return Res; 473 } 474 475 SDValue DAGTypeLegalizer::PromoteIntRes_SDIV(SDNode *N) { 476 // Sign extend the input. 477 SDValue LHS = SExtPromotedInteger(N->getOperand(0)); 478 SDValue RHS = SExtPromotedInteger(N->getOperand(1)); 479 return DAG.getNode(N->getOpcode(), N->getDebugLoc(), 480 LHS.getValueType(), LHS, RHS); 481 } 482 483 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT(SDNode *N) { 484 SDValue LHS = GetPromotedInteger(N->getOperand(1)); 485 SDValue RHS = GetPromotedInteger(N->getOperand(2)); 486 return DAG.getNode(ISD::SELECT, N->getDebugLoc(), 487 LHS.getValueType(), N->getOperand(0),LHS,RHS); 488 } 489 490 SDValue DAGTypeLegalizer::PromoteIntRes_VSELECT(SDNode *N) { 491 SDValue Mask = N->getOperand(0); 492 EVT OpTy = N->getOperand(1).getValueType(); 493 494 // Promote all the way up to the canonical SetCC type. 495 Mask = PromoteTargetBoolean(Mask, TLI.getSetCCResultType(OpTy)); 496 SDValue LHS = GetPromotedInteger(N->getOperand(1)); 497 SDValue RHS = GetPromotedInteger(N->getOperand(2)); 498 return DAG.getNode(ISD::VSELECT, N->getDebugLoc(), 499 LHS.getValueType(), Mask, LHS, RHS); 500 } 501 502 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT_CC(SDNode *N) { 503 SDValue LHS = GetPromotedInteger(N->getOperand(2)); 504 SDValue RHS = GetPromotedInteger(N->getOperand(3)); 505 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(), 506 LHS.getValueType(), N->getOperand(0), 507 N->getOperand(1), LHS, RHS, N->getOperand(4)); 508 } 509 510 SDValue DAGTypeLegalizer::PromoteIntRes_SETCC(SDNode *N) { 511 EVT SVT = TLI.getSetCCResultType(N->getOperand(0).getValueType()); 512 513 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 514 515 // Only use the result of getSetCCResultType if it is legal, 516 // otherwise just use the promoted result type (NVT). 517 if (!TLI.isTypeLegal(SVT)) 518 SVT = NVT; 519 520 DebugLoc dl = N->getDebugLoc(); 521 assert(SVT.isVector() == N->getOperand(0).getValueType().isVector() && 522 "Vector compare must return a vector result!"); 523 524 // Get the SETCC result using the canonical SETCC type. 525 SDValue SetCC = DAG.getNode(N->getOpcode(), dl, SVT, N->getOperand(0), 526 N->getOperand(1), N->getOperand(2)); 527 528 assert(NVT.bitsLE(SVT) && "Integer type overpromoted?"); 529 // Convert to the expected type. 530 return DAG.getNode(ISD::TRUNCATE, dl, NVT, SetCC); 531 } 532 533 SDValue DAGTypeLegalizer::PromoteIntRes_SHL(SDNode *N) { 534 return DAG.getNode(ISD::SHL, N->getDebugLoc(), 535 TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)), 536 GetPromotedInteger(N->getOperand(0)), N->getOperand(1)); 537 } 538 539 SDValue DAGTypeLegalizer::PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N) { 540 SDValue Op = GetPromotedInteger(N->getOperand(0)); 541 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(), 542 Op.getValueType(), Op, N->getOperand(1)); 543 } 544 545 SDValue DAGTypeLegalizer::PromoteIntRes_SimpleIntBinOp(SDNode *N) { 546 // The input may have strange things in the top bits of the registers, but 547 // these operations don't care. They may have weird bits going out, but 548 // that too is okay if they are integer operations. 549 SDValue LHS = GetPromotedInteger(N->getOperand(0)); 550 SDValue RHS = GetPromotedInteger(N->getOperand(1)); 551 return DAG.getNode(N->getOpcode(), N->getDebugLoc(), 552 LHS.getValueType(), LHS, RHS); 553 } 554 555 SDValue DAGTypeLegalizer::PromoteIntRes_SRA(SDNode *N) { 556 // The input value must be properly sign extended. 557 SDValue Res = SExtPromotedInteger(N->getOperand(0)); 558 return DAG.getNode(ISD::SRA, N->getDebugLoc(), 559 Res.getValueType(), Res, N->getOperand(1)); 560 } 561 562 SDValue DAGTypeLegalizer::PromoteIntRes_SRL(SDNode *N) { 563 // The input value must be properly zero extended. 564 EVT VT = N->getValueType(0); 565 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); 566 SDValue Res = ZExtPromotedInteger(N->getOperand(0)); 567 return DAG.getNode(ISD::SRL, N->getDebugLoc(), NVT, Res, N->getOperand(1)); 568 } 569 570 SDValue DAGTypeLegalizer::PromoteIntRes_TRUNCATE(SDNode *N) { 571 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 572 SDValue Res; 573 SDValue InOp = N->getOperand(0); 574 DebugLoc dl = N->getDebugLoc(); 575 576 switch (getTypeAction(InOp.getValueType())) { 577 default: llvm_unreachable("Unknown type action!"); 578 case TargetLowering::TypeLegal: 579 case TargetLowering::TypeExpandInteger: 580 Res = InOp; 581 break; 582 case TargetLowering::TypePromoteInteger: 583 Res = GetPromotedInteger(InOp); 584 break; 585 case TargetLowering::TypeSplitVector: 586 EVT InVT = InOp.getValueType(); 587 assert(InVT.isVector() && "Cannot split scalar types"); 588 unsigned NumElts = InVT.getVectorNumElements(); 589 assert(NumElts == NVT.getVectorNumElements() && 590 "Dst and Src must have the same number of elements"); 591 assert(isPowerOf2_32(NumElts) && 592 "Promoted vector type must be a power of two"); 593 594 SDValue EOp1, EOp2; 595 GetSplitVector(InOp, EOp1, EOp2); 596 597 EVT HalfNVT = EVT::getVectorVT(*DAG.getContext(), NVT.getScalarType(), 598 NumElts/2); 599 EOp1 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp1); 600 EOp2 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp2); 601 602 return DAG.getNode(ISD::CONCAT_VECTORS, dl, NVT, EOp1, EOp2); 603 } 604 605 // Truncate to NVT instead of VT 606 return DAG.getNode(ISD::TRUNCATE, dl, NVT, Res); 607 } 608 609 SDValue DAGTypeLegalizer::PromoteIntRes_UADDSUBO(SDNode *N, unsigned ResNo) { 610 if (ResNo == 1) 611 return PromoteIntRes_Overflow(N); 612 613 // The operation overflowed iff the result in the larger type is not the 614 // zero extension of its truncation to the original type. 615 SDValue LHS = ZExtPromotedInteger(N->getOperand(0)); 616 SDValue RHS = ZExtPromotedInteger(N->getOperand(1)); 617 EVT OVT = N->getOperand(0).getValueType(); 618 EVT NVT = LHS.getValueType(); 619 DebugLoc dl = N->getDebugLoc(); 620 621 // Do the arithmetic in the larger type. 622 unsigned Opcode = N->getOpcode() == ISD::UADDO ? ISD::ADD : ISD::SUB; 623 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS); 624 625 // Calculate the overflow flag: zero extend the arithmetic result from 626 // the original type. 627 SDValue Ofl = DAG.getZeroExtendInReg(Res, dl, OVT); 628 // Overflowed if and only if this is not equal to Res. 629 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE); 630 631 // Use the calculated overflow everywhere. 632 ReplaceValueWith(SDValue(N, 1), Ofl); 633 634 return Res; 635 } 636 637 SDValue DAGTypeLegalizer::PromoteIntRes_XMULO(SDNode *N, unsigned ResNo) { 638 // Promote the overflow bit trivially. 639 if (ResNo == 1) 640 return PromoteIntRes_Overflow(N); 641 642 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1); 643 DebugLoc DL = N->getDebugLoc(); 644 EVT SmallVT = LHS.getValueType(); 645 646 // To determine if the result overflowed in a larger type, we extend the 647 // input to the larger type, do the multiply, then check the high bits of 648 // the result to see if the overflow happened. 649 if (N->getOpcode() == ISD::SMULO) { 650 LHS = SExtPromotedInteger(LHS); 651 RHS = SExtPromotedInteger(RHS); 652 } else { 653 LHS = ZExtPromotedInteger(LHS); 654 RHS = ZExtPromotedInteger(RHS); 655 } 656 SDValue Mul = DAG.getNode(ISD::MUL, DL, LHS.getValueType(), LHS, RHS); 657 658 // Overflow occurred iff the high part of the result does not 659 // zero/sign-extend the low part. 660 SDValue Overflow; 661 if (N->getOpcode() == ISD::UMULO) { 662 // Unsigned overflow occurred iff the high part is non-zero. 663 SDValue Hi = DAG.getNode(ISD::SRL, DL, Mul.getValueType(), Mul, 664 DAG.getIntPtrConstant(SmallVT.getSizeInBits())); 665 Overflow = DAG.getSetCC(DL, N->getValueType(1), Hi, 666 DAG.getConstant(0, Hi.getValueType()), ISD::SETNE); 667 } else { 668 // Signed overflow occurred iff the high part does not sign extend the low. 669 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, Mul.getValueType(), 670 Mul, DAG.getValueType(SmallVT)); 671 Overflow = DAG.getSetCC(DL, N->getValueType(1), SExt, Mul, ISD::SETNE); 672 } 673 674 // Use the calculated overflow everywhere. 675 ReplaceValueWith(SDValue(N, 1), Overflow); 676 return Mul; 677 } 678 679 SDValue DAGTypeLegalizer::PromoteIntRes_UDIV(SDNode *N) { 680 // Zero extend the input. 681 SDValue LHS = ZExtPromotedInteger(N->getOperand(0)); 682 SDValue RHS = ZExtPromotedInteger(N->getOperand(1)); 683 return DAG.getNode(N->getOpcode(), N->getDebugLoc(), 684 LHS.getValueType(), LHS, RHS); 685 } 686 687 SDValue DAGTypeLegalizer::PromoteIntRes_UNDEF(SDNode *N) { 688 return DAG.getUNDEF(TLI.getTypeToTransformTo(*DAG.getContext(), 689 N->getValueType(0))); 690 } 691 692 SDValue DAGTypeLegalizer::PromoteIntRes_VAARG(SDNode *N) { 693 SDValue Chain = N->getOperand(0); // Get the chain. 694 SDValue Ptr = N->getOperand(1); // Get the pointer. 695 EVT VT = N->getValueType(0); 696 DebugLoc dl = N->getDebugLoc(); 697 698 EVT RegVT = TLI.getRegisterType(*DAG.getContext(), VT); 699 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), VT); 700 // The argument is passed as NumRegs registers of type RegVT. 701 702 SmallVector<SDValue, 8> Parts(NumRegs); 703 for (unsigned i = 0; i < NumRegs; ++i) { 704 Parts[i] = DAG.getVAArg(RegVT, dl, Chain, Ptr, N->getOperand(2), 705 N->getConstantOperandVal(3)); 706 Chain = Parts[i].getValue(1); 707 } 708 709 // Handle endianness of the load. 710 if (TLI.isBigEndian()) 711 std::reverse(Parts.begin(), Parts.end()); 712 713 // Assemble the parts in the promoted type. 714 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 715 SDValue Res = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[0]); 716 for (unsigned i = 1; i < NumRegs; ++i) { 717 SDValue Part = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[i]); 718 // Shift it to the right position and "or" it in. 719 Part = DAG.getNode(ISD::SHL, dl, NVT, Part, 720 DAG.getConstant(i * RegVT.getSizeInBits(), 721 TLI.getPointerTy())); 722 Res = DAG.getNode(ISD::OR, dl, NVT, Res, Part); 723 } 724 725 // Modified the chain result - switch anything that used the old chain to 726 // use the new one. 727 ReplaceValueWith(SDValue(N, 1), Chain); 728 729 return Res; 730 } 731 732 //===----------------------------------------------------------------------===// 733 // Integer Operand Promotion 734 //===----------------------------------------------------------------------===// 735 736 /// PromoteIntegerOperand - This method is called when the specified operand of 737 /// the specified node is found to need promotion. At this point, all of the 738 /// result types of the node are known to be legal, but other operands of the 739 /// node may need promotion or expansion as well as the specified one. 740 bool DAGTypeLegalizer::PromoteIntegerOperand(SDNode *N, unsigned OpNo) { 741 DEBUG(dbgs() << "Promote integer operand: "; N->dump(&DAG); dbgs() << "\n"); 742 SDValue Res = SDValue(); 743 744 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false)) 745 return false; 746 747 switch (N->getOpcode()) { 748 default: 749 #ifndef NDEBUG 750 dbgs() << "PromoteIntegerOperand Op #" << OpNo << ": "; 751 N->dump(&DAG); dbgs() << "\n"; 752 #endif 753 llvm_unreachable("Do not know how to promote this operator's operand!"); 754 755 case ISD::ANY_EXTEND: Res = PromoteIntOp_ANY_EXTEND(N); break; 756 case ISD::ATOMIC_STORE: 757 Res = PromoteIntOp_ATOMIC_STORE(cast<AtomicSDNode>(N)); 758 break; 759 case ISD::BITCAST: Res = PromoteIntOp_BITCAST(N); break; 760 case ISD::BR_CC: Res = PromoteIntOp_BR_CC(N, OpNo); break; 761 case ISD::BRCOND: Res = PromoteIntOp_BRCOND(N, OpNo); break; 762 case ISD::BUILD_PAIR: Res = PromoteIntOp_BUILD_PAIR(N); break; 763 case ISD::BUILD_VECTOR: Res = PromoteIntOp_BUILD_VECTOR(N); break; 764 case ISD::CONCAT_VECTORS: Res = PromoteIntOp_CONCAT_VECTORS(N); break; 765 case ISD::EXTRACT_VECTOR_ELT: Res = PromoteIntOp_EXTRACT_VECTOR_ELT(N); break; 766 case ISD::CONVERT_RNDSAT: 767 Res = PromoteIntOp_CONVERT_RNDSAT(N); break; 768 case ISD::INSERT_VECTOR_ELT: 769 Res = PromoteIntOp_INSERT_VECTOR_ELT(N, OpNo);break; 770 case ISD::MEMBARRIER: Res = PromoteIntOp_MEMBARRIER(N); break; 771 case ISD::SCALAR_TO_VECTOR: 772 Res = PromoteIntOp_SCALAR_TO_VECTOR(N); break; 773 case ISD::VSELECT: 774 case ISD::SELECT: Res = PromoteIntOp_SELECT(N, OpNo); break; 775 case ISD::SELECT_CC: Res = PromoteIntOp_SELECT_CC(N, OpNo); break; 776 case ISD::SETCC: Res = PromoteIntOp_SETCC(N, OpNo); break; 777 case ISD::SIGN_EXTEND: Res = PromoteIntOp_SIGN_EXTEND(N); break; 778 case ISD::SINT_TO_FP: Res = PromoteIntOp_SINT_TO_FP(N); break; 779 case ISD::STORE: Res = PromoteIntOp_STORE(cast<StoreSDNode>(N), 780 OpNo); break; 781 case ISD::TRUNCATE: Res = PromoteIntOp_TRUNCATE(N); break; 782 case ISD::FP16_TO_FP32: 783 case ISD::UINT_TO_FP: Res = PromoteIntOp_UINT_TO_FP(N); break; 784 case ISD::ZERO_EXTEND: Res = PromoteIntOp_ZERO_EXTEND(N); break; 785 786 case ISD::SHL: 787 case ISD::SRA: 788 case ISD::SRL: 789 case ISD::ROTL: 790 case ISD::ROTR: Res = PromoteIntOp_Shift(N); break; 791 } 792 793 // If the result is null, the sub-method took care of registering results etc. 794 if (!Res.getNode()) return false; 795 796 // If the result is N, the sub-method updated N in place. Tell the legalizer 797 // core about this. 798 if (Res.getNode() == N) 799 return true; 800 801 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && 802 "Invalid operand expansion"); 803 804 ReplaceValueWith(SDValue(N, 0), Res); 805 return false; 806 } 807 808 /// PromoteSetCCOperands - Promote the operands of a comparison. This code is 809 /// shared among BR_CC, SELECT_CC, and SETCC handlers. 810 void DAGTypeLegalizer::PromoteSetCCOperands(SDValue &NewLHS,SDValue &NewRHS, 811 ISD::CondCode CCCode) { 812 // We have to insert explicit sign or zero extends. Note that we could 813 // insert sign extends for ALL conditions, but zero extend is cheaper on 814 // many machines (an AND instead of two shifts), so prefer it. 815 switch (CCCode) { 816 default: llvm_unreachable("Unknown integer comparison!"); 817 case ISD::SETEQ: 818 case ISD::SETNE: 819 case ISD::SETUGE: 820 case ISD::SETUGT: 821 case ISD::SETULE: 822 case ISD::SETULT: 823 // ALL of these operations will work if we either sign or zero extend 824 // the operands (including the unsigned comparisons!). Zero extend is 825 // usually a simpler/cheaper operation, so prefer it. 826 NewLHS = ZExtPromotedInteger(NewLHS); 827 NewRHS = ZExtPromotedInteger(NewRHS); 828 break; 829 case ISD::SETGE: 830 case ISD::SETGT: 831 case ISD::SETLT: 832 case ISD::SETLE: 833 NewLHS = SExtPromotedInteger(NewLHS); 834 NewRHS = SExtPromotedInteger(NewRHS); 835 break; 836 } 837 } 838 839 SDValue DAGTypeLegalizer::PromoteIntOp_ANY_EXTEND(SDNode *N) { 840 SDValue Op = GetPromotedInteger(N->getOperand(0)); 841 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), N->getValueType(0), Op); 842 } 843 844 SDValue DAGTypeLegalizer::PromoteIntOp_ATOMIC_STORE(AtomicSDNode *N) { 845 SDValue Op2 = GetPromotedInteger(N->getOperand(2)); 846 return DAG.getAtomic(N->getOpcode(), N->getDebugLoc(), N->getMemoryVT(), 847 N->getChain(), N->getBasePtr(), Op2, N->getMemOperand(), 848 N->getOrdering(), N->getSynchScope()); 849 } 850 851 SDValue DAGTypeLegalizer::PromoteIntOp_BITCAST(SDNode *N) { 852 // This should only occur in unusual situations like bitcasting to an 853 // x86_fp80, so just turn it into a store+load 854 return CreateStackStoreLoad(N->getOperand(0), N->getValueType(0)); 855 } 856 857 SDValue DAGTypeLegalizer::PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo) { 858 assert(OpNo == 2 && "Don't know how to promote this operand!"); 859 860 SDValue LHS = N->getOperand(2); 861 SDValue RHS = N->getOperand(3); 862 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(1))->get()); 863 864 // The chain (Op#0), CC (#1) and basic block destination (Op#4) are always 865 // legal types. 866 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), 867 N->getOperand(1), LHS, RHS, N->getOperand(4)), 868 0); 869 } 870 871 SDValue DAGTypeLegalizer::PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo) { 872 assert(OpNo == 1 && "only know how to promote condition"); 873 874 // Promote all the way up to the canonical SetCC type. 875 EVT SVT = TLI.getSetCCResultType(MVT::Other); 876 SDValue Cond = PromoteTargetBoolean(N->getOperand(1), SVT); 877 878 // The chain (Op#0) and basic block destination (Op#2) are always legal types. 879 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Cond, 880 N->getOperand(2)), 0); 881 } 882 883 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_PAIR(SDNode *N) { 884 // Since the result type is legal, the operands must promote to it. 885 EVT OVT = N->getOperand(0).getValueType(); 886 SDValue Lo = ZExtPromotedInteger(N->getOperand(0)); 887 SDValue Hi = GetPromotedInteger(N->getOperand(1)); 888 assert(Lo.getValueType() == N->getValueType(0) && "Operand over promoted?"); 889 DebugLoc dl = N->getDebugLoc(); 890 891 Hi = DAG.getNode(ISD::SHL, dl, N->getValueType(0), Hi, 892 DAG.getConstant(OVT.getSizeInBits(), TLI.getPointerTy())); 893 return DAG.getNode(ISD::OR, dl, N->getValueType(0), Lo, Hi); 894 } 895 896 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_VECTOR(SDNode *N) { 897 // The vector type is legal but the element type is not. This implies 898 // that the vector is a power-of-two in length and that the element 899 // type does not have a strange size (eg: it is not i1). 900 EVT VecVT = N->getValueType(0); 901 unsigned NumElts = VecVT.getVectorNumElements(); 902 assert(!(NumElts & 1) && "Legal vector of one illegal element?"); 903 904 // Promote the inserted value. The type does not need to match the 905 // vector element type. Check that any extra bits introduced will be 906 // truncated away. 907 assert(N->getOperand(0).getValueType().getSizeInBits() >= 908 N->getValueType(0).getVectorElementType().getSizeInBits() && 909 "Type of inserted value narrower than vector element type!"); 910 911 SmallVector<SDValue, 16> NewOps; 912 for (unsigned i = 0; i < NumElts; ++i) 913 NewOps.push_back(GetPromotedInteger(N->getOperand(i))); 914 915 return SDValue(DAG.UpdateNodeOperands(N, &NewOps[0], NumElts), 0); 916 } 917 918 SDValue DAGTypeLegalizer::PromoteIntOp_CONVERT_RNDSAT(SDNode *N) { 919 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode(); 920 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU || 921 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU || 922 CvtCode == ISD::CVT_FS || CvtCode == ISD::CVT_FU) && 923 "can only promote integer arguments"); 924 SDValue InOp = GetPromotedInteger(N->getOperand(0)); 925 return DAG.getConvertRndSat(N->getValueType(0), N->getDebugLoc(), InOp, 926 N->getOperand(1), N->getOperand(2), 927 N->getOperand(3), N->getOperand(4), CvtCode); 928 } 929 930 SDValue DAGTypeLegalizer::PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, 931 unsigned OpNo) { 932 if (OpNo == 1) { 933 // Promote the inserted value. This is valid because the type does not 934 // have to match the vector element type. 935 936 // Check that any extra bits introduced will be truncated away. 937 assert(N->getOperand(1).getValueType().getSizeInBits() >= 938 N->getValueType(0).getVectorElementType().getSizeInBits() && 939 "Type of inserted value narrower than vector element type!"); 940 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), 941 GetPromotedInteger(N->getOperand(1)), 942 N->getOperand(2)), 943 0); 944 } 945 946 assert(OpNo == 2 && "Different operand and result vector types?"); 947 948 // Promote the index. 949 SDValue Idx = ZExtPromotedInteger(N->getOperand(2)); 950 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), 951 N->getOperand(1), Idx), 0); 952 } 953 954 SDValue DAGTypeLegalizer::PromoteIntOp_MEMBARRIER(SDNode *N) { 955 SDValue NewOps[6]; 956 DebugLoc dl = N->getDebugLoc(); 957 NewOps[0] = N->getOperand(0); 958 for (unsigned i = 1; i < array_lengthof(NewOps); ++i) { 959 SDValue Flag = GetPromotedInteger(N->getOperand(i)); 960 NewOps[i] = DAG.getZeroExtendInReg(Flag, dl, MVT::i1); 961 } 962 return SDValue(DAG.UpdateNodeOperands(N, NewOps, array_lengthof(NewOps)), 0); 963 } 964 965 SDValue DAGTypeLegalizer::PromoteIntOp_SCALAR_TO_VECTOR(SDNode *N) { 966 // Integer SCALAR_TO_VECTOR operands are implicitly truncated, so just promote 967 // the operand in place. 968 return SDValue(DAG.UpdateNodeOperands(N, 969 GetPromotedInteger(N->getOperand(0))), 0); 970 } 971 972 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT(SDNode *N, unsigned OpNo) { 973 assert(OpNo == 0 && "Only know how to promote the condition!"); 974 SDValue Cond = N->getOperand(0); 975 EVT OpTy = N->getOperand(1).getValueType(); 976 977 // Promote all the way up to the canonical SetCC type. 978 EVT SVT = TLI.getSetCCResultType(N->getOpcode() == ISD::SELECT ? 979 OpTy.getScalarType() : OpTy); 980 Cond = PromoteTargetBoolean(Cond, SVT); 981 982 return SDValue(DAG.UpdateNodeOperands(N, Cond, N->getOperand(1), 983 N->getOperand(2)), 0); 984 } 985 986 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo) { 987 assert(OpNo == 0 && "Don't know how to promote this operand!"); 988 989 SDValue LHS = N->getOperand(0); 990 SDValue RHS = N->getOperand(1); 991 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(4))->get()); 992 993 // The CC (#4) and the possible return values (#2 and #3) have legal types. 994 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2), 995 N->getOperand(3), N->getOperand(4)), 0); 996 } 997 998 SDValue DAGTypeLegalizer::PromoteIntOp_SETCC(SDNode *N, unsigned OpNo) { 999 assert(OpNo == 0 && "Don't know how to promote this operand!"); 1000 1001 SDValue LHS = N->getOperand(0); 1002 SDValue RHS = N->getOperand(1); 1003 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(2))->get()); 1004 1005 // The CC (#2) is always legal. 1006 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2)), 0); 1007 } 1008 1009 SDValue DAGTypeLegalizer::PromoteIntOp_Shift(SDNode *N) { 1010 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), 1011 ZExtPromotedInteger(N->getOperand(1))), 0); 1012 } 1013 1014 SDValue DAGTypeLegalizer::PromoteIntOp_SIGN_EXTEND(SDNode *N) { 1015 SDValue Op = GetPromotedInteger(N->getOperand(0)); 1016 DebugLoc dl = N->getDebugLoc(); 1017 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op); 1018 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Op.getValueType(), 1019 Op, DAG.getValueType(N->getOperand(0).getValueType())); 1020 } 1021 1022 SDValue DAGTypeLegalizer::PromoteIntOp_SINT_TO_FP(SDNode *N) { 1023 return SDValue(DAG.UpdateNodeOperands(N, 1024 SExtPromotedInteger(N->getOperand(0))), 0); 1025 } 1026 1027 SDValue DAGTypeLegalizer::PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo){ 1028 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!"); 1029 SDValue Ch = N->getChain(), Ptr = N->getBasePtr(); 1030 unsigned Alignment = N->getAlignment(); 1031 bool isVolatile = N->isVolatile(); 1032 bool isNonTemporal = N->isNonTemporal(); 1033 DebugLoc dl = N->getDebugLoc(); 1034 1035 SDValue Val = GetPromotedInteger(N->getValue()); // Get promoted value. 1036 1037 // Truncate the value and store the result. 1038 return DAG.getTruncStore(Ch, dl, Val, Ptr, N->getPointerInfo(), 1039 N->getMemoryVT(), 1040 isVolatile, isNonTemporal, Alignment); 1041 } 1042 1043 SDValue DAGTypeLegalizer::PromoteIntOp_TRUNCATE(SDNode *N) { 1044 SDValue Op = GetPromotedInteger(N->getOperand(0)); 1045 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), Op); 1046 } 1047 1048 SDValue DAGTypeLegalizer::PromoteIntOp_UINT_TO_FP(SDNode *N) { 1049 return SDValue(DAG.UpdateNodeOperands(N, 1050 ZExtPromotedInteger(N->getOperand(0))), 0); 1051 } 1052 1053 SDValue DAGTypeLegalizer::PromoteIntOp_ZERO_EXTEND(SDNode *N) { 1054 DebugLoc dl = N->getDebugLoc(); 1055 SDValue Op = GetPromotedInteger(N->getOperand(0)); 1056 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op); 1057 return DAG.getZeroExtendInReg(Op, dl, 1058 N->getOperand(0).getValueType().getScalarType()); 1059 } 1060 1061 1062 //===----------------------------------------------------------------------===// 1063 // Integer Result Expansion 1064 //===----------------------------------------------------------------------===// 1065 1066 /// ExpandIntegerResult - This method is called when the specified result of the 1067 /// specified node is found to need expansion. At this point, the node may also 1068 /// have invalid operands or may have other results that need promotion, we just 1069 /// know that (at least) one result needs expansion. 1070 void DAGTypeLegalizer::ExpandIntegerResult(SDNode *N, unsigned ResNo) { 1071 DEBUG(dbgs() << "Expand integer result: "; N->dump(&DAG); dbgs() << "\n"); 1072 SDValue Lo, Hi; 1073 Lo = Hi = SDValue(); 1074 1075 // See if the target wants to custom expand this node. 1076 if (CustomLowerNode(N, N->getValueType(ResNo), true)) 1077 return; 1078 1079 switch (N->getOpcode()) { 1080 default: 1081 #ifndef NDEBUG 1082 dbgs() << "ExpandIntegerResult #" << ResNo << ": "; 1083 N->dump(&DAG); dbgs() << "\n"; 1084 #endif 1085 llvm_unreachable("Do not know how to expand the result of this operator!"); 1086 1087 case ISD::MERGE_VALUES: SplitRes_MERGE_VALUES(N, ResNo, Lo, Hi); break; 1088 case ISD::SELECT: SplitRes_SELECT(N, Lo, Hi); break; 1089 case ISD::SELECT_CC: SplitRes_SELECT_CC(N, Lo, Hi); break; 1090 case ISD::UNDEF: SplitRes_UNDEF(N, Lo, Hi); break; 1091 1092 case ISD::BITCAST: ExpandRes_BITCAST(N, Lo, Hi); break; 1093 case ISD::BUILD_PAIR: ExpandRes_BUILD_PAIR(N, Lo, Hi); break; 1094 case ISD::EXTRACT_ELEMENT: ExpandRes_EXTRACT_ELEMENT(N, Lo, Hi); break; 1095 case ISD::EXTRACT_VECTOR_ELT: ExpandRes_EXTRACT_VECTOR_ELT(N, Lo, Hi); break; 1096 case ISD::VAARG: ExpandRes_VAARG(N, Lo, Hi); break; 1097 1098 case ISD::ANY_EXTEND: ExpandIntRes_ANY_EXTEND(N, Lo, Hi); break; 1099 case ISD::AssertSext: ExpandIntRes_AssertSext(N, Lo, Hi); break; 1100 case ISD::AssertZext: ExpandIntRes_AssertZext(N, Lo, Hi); break; 1101 case ISD::BSWAP: ExpandIntRes_BSWAP(N, Lo, Hi); break; 1102 case ISD::Constant: ExpandIntRes_Constant(N, Lo, Hi); break; 1103 case ISD::CTLZ_ZERO_UNDEF: 1104 case ISD::CTLZ: ExpandIntRes_CTLZ(N, Lo, Hi); break; 1105 case ISD::CTPOP: ExpandIntRes_CTPOP(N, Lo, Hi); break; 1106 case ISD::CTTZ_ZERO_UNDEF: 1107 case ISD::CTTZ: ExpandIntRes_CTTZ(N, Lo, Hi); break; 1108 case ISD::FP_TO_SINT: ExpandIntRes_FP_TO_SINT(N, Lo, Hi); break; 1109 case ISD::FP_TO_UINT: ExpandIntRes_FP_TO_UINT(N, Lo, Hi); break; 1110 case ISD::LOAD: ExpandIntRes_LOAD(cast<LoadSDNode>(N), Lo, Hi); break; 1111 case ISD::MUL: ExpandIntRes_MUL(N, Lo, Hi); break; 1112 case ISD::SDIV: ExpandIntRes_SDIV(N, Lo, Hi); break; 1113 case ISD::SIGN_EXTEND: ExpandIntRes_SIGN_EXTEND(N, Lo, Hi); break; 1114 case ISD::SIGN_EXTEND_INREG: ExpandIntRes_SIGN_EXTEND_INREG(N, Lo, Hi); break; 1115 case ISD::SREM: ExpandIntRes_SREM(N, Lo, Hi); break; 1116 case ISD::TRUNCATE: ExpandIntRes_TRUNCATE(N, Lo, Hi); break; 1117 case ISD::UDIV: ExpandIntRes_UDIV(N, Lo, Hi); break; 1118 case ISD::UREM: ExpandIntRes_UREM(N, Lo, Hi); break; 1119 case ISD::ZERO_EXTEND: ExpandIntRes_ZERO_EXTEND(N, Lo, Hi); break; 1120 case ISD::ATOMIC_LOAD: ExpandIntRes_ATOMIC_LOAD(N, Lo, Hi); break; 1121 1122 case ISD::ATOMIC_LOAD_ADD: 1123 case ISD::ATOMIC_LOAD_SUB: 1124 case ISD::ATOMIC_LOAD_AND: 1125 case ISD::ATOMIC_LOAD_OR: 1126 case ISD::ATOMIC_LOAD_XOR: 1127 case ISD::ATOMIC_LOAD_NAND: 1128 case ISD::ATOMIC_LOAD_MIN: 1129 case ISD::ATOMIC_LOAD_MAX: 1130 case ISD::ATOMIC_LOAD_UMIN: 1131 case ISD::ATOMIC_LOAD_UMAX: 1132 case ISD::ATOMIC_SWAP: { 1133 std::pair<SDValue, SDValue> Tmp = ExpandAtomic(N); 1134 SplitInteger(Tmp.first, Lo, Hi); 1135 ReplaceValueWith(SDValue(N, 1), Tmp.second); 1136 break; 1137 } 1138 1139 case ISD::AND: 1140 case ISD::OR: 1141 case ISD::XOR: ExpandIntRes_Logical(N, Lo, Hi); break; 1142 1143 case ISD::ADD: 1144 case ISD::SUB: ExpandIntRes_ADDSUB(N, Lo, Hi); break; 1145 1146 case ISD::ADDC: 1147 case ISD::SUBC: ExpandIntRes_ADDSUBC(N, Lo, Hi); break; 1148 1149 case ISD::ADDE: 1150 case ISD::SUBE: ExpandIntRes_ADDSUBE(N, Lo, Hi); break; 1151 1152 case ISD::SHL: 1153 case ISD::SRA: 1154 case ISD::SRL: ExpandIntRes_Shift(N, Lo, Hi); break; 1155 1156 case ISD::SADDO: 1157 case ISD::SSUBO: ExpandIntRes_SADDSUBO(N, Lo, Hi); break; 1158 case ISD::UADDO: 1159 case ISD::USUBO: ExpandIntRes_UADDSUBO(N, Lo, Hi); break; 1160 case ISD::UMULO: 1161 case ISD::SMULO: ExpandIntRes_XMULO(N, Lo, Hi); break; 1162 } 1163 1164 // If Lo/Hi is null, the sub-method took care of registering results etc. 1165 if (Lo.getNode()) 1166 SetExpandedInteger(SDValue(N, ResNo), Lo, Hi); 1167 } 1168 1169 /// Lower an atomic node to the appropriate builtin call. 1170 std::pair <SDValue, SDValue> DAGTypeLegalizer::ExpandAtomic(SDNode *Node) { 1171 unsigned Opc = Node->getOpcode(); 1172 MVT VT = cast<AtomicSDNode>(Node)->getMemoryVT().getSimpleVT(); 1173 RTLIB::Libcall LC; 1174 1175 switch (Opc) { 1176 default: 1177 llvm_unreachable("Unhandled atomic intrinsic Expand!"); 1178 case ISD::ATOMIC_SWAP: 1179 switch (VT.SimpleTy) { 1180 default: llvm_unreachable("Unexpected value type for atomic!"); 1181 case MVT::i8: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_1; break; 1182 case MVT::i16: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_2; break; 1183 case MVT::i32: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_4; break; 1184 case MVT::i64: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_8; break; 1185 } 1186 break; 1187 case ISD::ATOMIC_CMP_SWAP: 1188 switch (VT.SimpleTy) { 1189 default: llvm_unreachable("Unexpected value type for atomic!"); 1190 case MVT::i8: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1; break; 1191 case MVT::i16: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2; break; 1192 case MVT::i32: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4; break; 1193 case MVT::i64: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8; break; 1194 } 1195 break; 1196 case ISD::ATOMIC_LOAD_ADD: 1197 switch (VT.SimpleTy) { 1198 default: llvm_unreachable("Unexpected value type for atomic!"); 1199 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_ADD_1; break; 1200 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_ADD_2; break; 1201 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_ADD_4; break; 1202 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_ADD_8; break; 1203 } 1204 break; 1205 case ISD::ATOMIC_LOAD_SUB: 1206 switch (VT.SimpleTy) { 1207 default: llvm_unreachable("Unexpected value type for atomic!"); 1208 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_SUB_1; break; 1209 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_SUB_2; break; 1210 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_SUB_4; break; 1211 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_SUB_8; break; 1212 } 1213 break; 1214 case ISD::ATOMIC_LOAD_AND: 1215 switch (VT.SimpleTy) { 1216 default: llvm_unreachable("Unexpected value type for atomic!"); 1217 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_AND_1; break; 1218 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_AND_2; break; 1219 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_AND_4; break; 1220 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_AND_8; break; 1221 } 1222 break; 1223 case ISD::ATOMIC_LOAD_OR: 1224 switch (VT.SimpleTy) { 1225 default: llvm_unreachable("Unexpected value type for atomic!"); 1226 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_OR_1; break; 1227 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_OR_2; break; 1228 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_OR_4; break; 1229 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_OR_8; break; 1230 } 1231 break; 1232 case ISD::ATOMIC_LOAD_XOR: 1233 switch (VT.SimpleTy) { 1234 default: llvm_unreachable("Unexpected value type for atomic!"); 1235 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_XOR_1; break; 1236 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_XOR_2; break; 1237 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_XOR_4; break; 1238 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_XOR_8; break; 1239 } 1240 break; 1241 case ISD::ATOMIC_LOAD_NAND: 1242 switch (VT.SimpleTy) { 1243 default: llvm_unreachable("Unexpected value type for atomic!"); 1244 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_NAND_1; break; 1245 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_NAND_2; break; 1246 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_NAND_4; break; 1247 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_NAND_8; break; 1248 } 1249 break; 1250 } 1251 1252 return ExpandChainLibCall(LC, Node, false); 1253 } 1254 1255 /// ExpandShiftByConstant - N is a shift by a value that needs to be expanded, 1256 /// and the shift amount is a constant 'Amt'. Expand the operation. 1257 void DAGTypeLegalizer::ExpandShiftByConstant(SDNode *N, unsigned Amt, 1258 SDValue &Lo, SDValue &Hi) { 1259 DebugLoc DL = N->getDebugLoc(); 1260 // Expand the incoming operand to be shifted, so that we have its parts 1261 SDValue InL, InH; 1262 GetExpandedInteger(N->getOperand(0), InL, InH); 1263 1264 EVT NVT = InL.getValueType(); 1265 unsigned VTBits = N->getValueType(0).getSizeInBits(); 1266 unsigned NVTBits = NVT.getSizeInBits(); 1267 EVT ShTy = N->getOperand(1).getValueType(); 1268 1269 if (N->getOpcode() == ISD::SHL) { 1270 if (Amt > VTBits) { 1271 Lo = Hi = DAG.getConstant(0, NVT); 1272 } else if (Amt > NVTBits) { 1273 Lo = DAG.getConstant(0, NVT); 1274 Hi = DAG.getNode(ISD::SHL, DL, 1275 NVT, InL, DAG.getConstant(Amt-NVTBits, ShTy)); 1276 } else if (Amt == NVTBits) { 1277 Lo = DAG.getConstant(0, NVT); 1278 Hi = InL; 1279 } else if (Amt == 1 && 1280 TLI.isOperationLegalOrCustom(ISD::ADDC, 1281 TLI.getTypeToExpandTo(*DAG.getContext(), NVT))) { 1282 // Emit this X << 1 as X+X. 1283 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue); 1284 SDValue LoOps[2] = { InL, InL }; 1285 Lo = DAG.getNode(ISD::ADDC, DL, VTList, LoOps, 2); 1286 SDValue HiOps[3] = { InH, InH, Lo.getValue(1) }; 1287 Hi = DAG.getNode(ISD::ADDE, DL, VTList, HiOps, 3); 1288 } else { 1289 Lo = DAG.getNode(ISD::SHL, DL, NVT, InL, DAG.getConstant(Amt, ShTy)); 1290 Hi = DAG.getNode(ISD::OR, DL, NVT, 1291 DAG.getNode(ISD::SHL, DL, NVT, InH, 1292 DAG.getConstant(Amt, ShTy)), 1293 DAG.getNode(ISD::SRL, DL, NVT, InL, 1294 DAG.getConstant(NVTBits-Amt, ShTy))); 1295 } 1296 return; 1297 } 1298 1299 if (N->getOpcode() == ISD::SRL) { 1300 if (Amt > VTBits) { 1301 Lo = DAG.getConstant(0, NVT); 1302 Hi = DAG.getConstant(0, NVT); 1303 } else if (Amt > NVTBits) { 1304 Lo = DAG.getNode(ISD::SRL, DL, 1305 NVT, InH, DAG.getConstant(Amt-NVTBits,ShTy)); 1306 Hi = DAG.getConstant(0, NVT); 1307 } else if (Amt == NVTBits) { 1308 Lo = InH; 1309 Hi = DAG.getConstant(0, NVT); 1310 } else { 1311 Lo = DAG.getNode(ISD::OR, DL, NVT, 1312 DAG.getNode(ISD::SRL, DL, NVT, InL, 1313 DAG.getConstant(Amt, ShTy)), 1314 DAG.getNode(ISD::SHL, DL, NVT, InH, 1315 DAG.getConstant(NVTBits-Amt, ShTy))); 1316 Hi = DAG.getNode(ISD::SRL, DL, NVT, InH, DAG.getConstant(Amt, ShTy)); 1317 } 1318 return; 1319 } 1320 1321 assert(N->getOpcode() == ISD::SRA && "Unknown shift!"); 1322 if (Amt > VTBits) { 1323 Hi = Lo = DAG.getNode(ISD::SRA, DL, NVT, InH, 1324 DAG.getConstant(NVTBits-1, ShTy)); 1325 } else if (Amt > NVTBits) { 1326 Lo = DAG.getNode(ISD::SRA, DL, NVT, InH, 1327 DAG.getConstant(Amt-NVTBits, ShTy)); 1328 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH, 1329 DAG.getConstant(NVTBits-1, ShTy)); 1330 } else if (Amt == NVTBits) { 1331 Lo = InH; 1332 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH, 1333 DAG.getConstant(NVTBits-1, ShTy)); 1334 } else { 1335 Lo = DAG.getNode(ISD::OR, DL, NVT, 1336 DAG.getNode(ISD::SRL, DL, NVT, InL, 1337 DAG.getConstant(Amt, ShTy)), 1338 DAG.getNode(ISD::SHL, DL, NVT, InH, 1339 DAG.getConstant(NVTBits-Amt, ShTy))); 1340 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH, DAG.getConstant(Amt, ShTy)); 1341 } 1342 } 1343 1344 /// ExpandShiftWithKnownAmountBit - Try to determine whether we can simplify 1345 /// this shift based on knowledge of the high bit of the shift amount. If we 1346 /// can tell this, we know that it is >= 32 or < 32, without knowing the actual 1347 /// shift amount. 1348 bool DAGTypeLegalizer:: 1349 ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) { 1350 SDValue Amt = N->getOperand(1); 1351 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 1352 EVT ShTy = Amt.getValueType(); 1353 unsigned ShBits = ShTy.getScalarType().getSizeInBits(); 1354 unsigned NVTBits = NVT.getScalarType().getSizeInBits(); 1355 assert(isPowerOf2_32(NVTBits) && 1356 "Expanded integer type size not a power of two!"); 1357 DebugLoc dl = N->getDebugLoc(); 1358 1359 APInt HighBitMask = APInt::getHighBitsSet(ShBits, ShBits - Log2_32(NVTBits)); 1360 APInt KnownZero, KnownOne; 1361 DAG.ComputeMaskedBits(N->getOperand(1), KnownZero, KnownOne); 1362 1363 // If we don't know anything about the high bits, exit. 1364 if (((KnownZero|KnownOne) & HighBitMask) == 0) 1365 return false; 1366 1367 // Get the incoming operand to be shifted. 1368 SDValue InL, InH; 1369 GetExpandedInteger(N->getOperand(0), InL, InH); 1370 1371 // If we know that any of the high bits of the shift amount are one, then we 1372 // can do this as a couple of simple shifts. 1373 if (KnownOne.intersects(HighBitMask)) { 1374 // Mask out the high bit, which we know is set. 1375 Amt = DAG.getNode(ISD::AND, dl, ShTy, Amt, 1376 DAG.getConstant(~HighBitMask, ShTy)); 1377 1378 switch (N->getOpcode()) { 1379 default: llvm_unreachable("Unknown shift"); 1380 case ISD::SHL: 1381 Lo = DAG.getConstant(0, NVT); // Low part is zero. 1382 Hi = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part. 1383 return true; 1384 case ISD::SRL: 1385 Hi = DAG.getConstant(0, NVT); // Hi part is zero. 1386 Lo = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); // Lo part from Hi part. 1387 return true; 1388 case ISD::SRA: 1389 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign extend high part. 1390 DAG.getConstant(NVTBits-1, ShTy)); 1391 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); // Lo part from Hi part. 1392 return true; 1393 } 1394 } 1395 1396 // If we know that all of the high bits of the shift amount are zero, then we 1397 // can do this as a couple of simple shifts. 1398 if ((KnownZero & HighBitMask) == HighBitMask) { 1399 // Calculate 31-x. 31 is used instead of 32 to avoid creating an undefined 1400 // shift if x is zero. We can use XOR here because x is known to be smaller 1401 // than 32. 1402 SDValue Amt2 = DAG.getNode(ISD::XOR, dl, ShTy, Amt, 1403 DAG.getConstant(NVTBits-1, ShTy)); 1404 1405 unsigned Op1, Op2; 1406 switch (N->getOpcode()) { 1407 default: llvm_unreachable("Unknown shift"); 1408 case ISD::SHL: Op1 = ISD::SHL; Op2 = ISD::SRL; break; 1409 case ISD::SRL: 1410 case ISD::SRA: Op1 = ISD::SRL; Op2 = ISD::SHL; break; 1411 } 1412 1413 // When shifting right the arithmetic for Lo and Hi is swapped. 1414 if (N->getOpcode() != ISD::SHL) 1415 std::swap(InL, InH); 1416 1417 // Use a little trick to get the bits that move from Lo to Hi. First 1418 // shift by one bit. 1419 SDValue Sh1 = DAG.getNode(Op2, dl, NVT, InL, DAG.getConstant(1, ShTy)); 1420 // Then compute the remaining shift with amount-1. 1421 SDValue Sh2 = DAG.getNode(Op2, dl, NVT, Sh1, Amt2); 1422 1423 Lo = DAG.getNode(N->getOpcode(), dl, NVT, InL, Amt); 1424 Hi = DAG.getNode(ISD::OR, dl, NVT, DAG.getNode(Op1, dl, NVT, InH, Amt),Sh2); 1425 1426 if (N->getOpcode() != ISD::SHL) 1427 std::swap(Hi, Lo); 1428 return true; 1429 } 1430 1431 return false; 1432 } 1433 1434 /// ExpandShiftWithUnknownAmountBit - Fully general expansion of integer shift 1435 /// of any size. 1436 bool DAGTypeLegalizer:: 1437 ExpandShiftWithUnknownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) { 1438 SDValue Amt = N->getOperand(1); 1439 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 1440 EVT ShTy = Amt.getValueType(); 1441 unsigned NVTBits = NVT.getSizeInBits(); 1442 assert(isPowerOf2_32(NVTBits) && 1443 "Expanded integer type size not a power of two!"); 1444 DebugLoc dl = N->getDebugLoc(); 1445 1446 // Get the incoming operand to be shifted. 1447 SDValue InL, InH; 1448 GetExpandedInteger(N->getOperand(0), InL, InH); 1449 1450 SDValue NVBitsNode = DAG.getConstant(NVTBits, ShTy); 1451 SDValue AmtExcess = DAG.getNode(ISD::SUB, dl, ShTy, Amt, NVBitsNode); 1452 SDValue AmtLack = DAG.getNode(ISD::SUB, dl, ShTy, NVBitsNode, Amt); 1453 SDValue isShort = DAG.getSetCC(dl, TLI.getSetCCResultType(ShTy), 1454 Amt, NVBitsNode, ISD::SETULT); 1455 1456 SDValue LoS, HiS, LoL, HiL; 1457 switch (N->getOpcode()) { 1458 default: llvm_unreachable("Unknown shift"); 1459 case ISD::SHL: 1460 // Short: ShAmt < NVTBits 1461 LoS = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); 1462 HiS = DAG.getNode(ISD::OR, dl, NVT, 1463 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt), 1464 // FIXME: If Amt is zero, the following shift generates an undefined result 1465 // on some architectures. 1466 DAG.getNode(ISD::SRL, dl, NVT, InL, AmtLack)); 1467 1468 // Long: ShAmt >= NVTBits 1469 LoL = DAG.getConstant(0, NVT); // Lo part is zero. 1470 HiL = DAG.getNode(ISD::SHL, dl, NVT, InL, AmtExcess); // Hi from Lo part. 1471 1472 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL); 1473 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL); 1474 return true; 1475 case ISD::SRL: 1476 // Short: ShAmt < NVTBits 1477 HiS = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); 1478 LoS = DAG.getNode(ISD::OR, dl, NVT, 1479 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt), 1480 // FIXME: If Amt is zero, the following shift generates an undefined result 1481 // on some architectures. 1482 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack)); 1483 1484 // Long: ShAmt >= NVTBits 1485 HiL = DAG.getConstant(0, NVT); // Hi part is zero. 1486 LoL = DAG.getNode(ISD::SRL, dl, NVT, InH, AmtExcess); // Lo from Hi part. 1487 1488 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL); 1489 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL); 1490 return true; 1491 case ISD::SRA: 1492 // Short: ShAmt < NVTBits 1493 HiS = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); 1494 LoS = DAG.getNode(ISD::OR, dl, NVT, 1495 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt), 1496 // FIXME: If Amt is zero, the following shift generates an undefined result 1497 // on some architectures. 1498 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack)); 1499 1500 // Long: ShAmt >= NVTBits 1501 HiL = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign of Hi part. 1502 DAG.getConstant(NVTBits-1, ShTy)); 1503 LoL = DAG.getNode(ISD::SRA, dl, NVT, InH, AmtExcess); // Lo from Hi part. 1504 1505 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL); 1506 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL); 1507 return true; 1508 } 1509 } 1510 1511 void DAGTypeLegalizer::ExpandIntRes_ADDSUB(SDNode *N, 1512 SDValue &Lo, SDValue &Hi) { 1513 DebugLoc dl = N->getDebugLoc(); 1514 // Expand the subcomponents. 1515 SDValue LHSL, LHSH, RHSL, RHSH; 1516 GetExpandedInteger(N->getOperand(0), LHSL, LHSH); 1517 GetExpandedInteger(N->getOperand(1), RHSL, RHSH); 1518 1519 EVT NVT = LHSL.getValueType(); 1520 SDValue LoOps[2] = { LHSL, RHSL }; 1521 SDValue HiOps[3] = { LHSH, RHSH }; 1522 1523 // Do not generate ADDC/ADDE or SUBC/SUBE if the target does not support 1524 // them. TODO: Teach operation legalization how to expand unsupported 1525 // ADDC/ADDE/SUBC/SUBE. The problem is that these operations generate 1526 // a carry of type MVT::Glue, but there doesn't seem to be any way to 1527 // generate a value of this type in the expanded code sequence. 1528 bool hasCarry = 1529 TLI.isOperationLegalOrCustom(N->getOpcode() == ISD::ADD ? 1530 ISD::ADDC : ISD::SUBC, 1531 TLI.getTypeToExpandTo(*DAG.getContext(), NVT)); 1532 1533 if (hasCarry) { 1534 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue); 1535 if (N->getOpcode() == ISD::ADD) { 1536 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2); 1537 HiOps[2] = Lo.getValue(1); 1538 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3); 1539 } else { 1540 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2); 1541 HiOps[2] = Lo.getValue(1); 1542 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3); 1543 } 1544 return; 1545 } 1546 1547 if (N->getOpcode() == ISD::ADD) { 1548 Lo = DAG.getNode(ISD::ADD, dl, NVT, LoOps, 2); 1549 Hi = DAG.getNode(ISD::ADD, dl, NVT, HiOps, 2); 1550 SDValue Cmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[0], 1551 ISD::SETULT); 1552 SDValue Carry1 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp1, 1553 DAG.getConstant(1, NVT), 1554 DAG.getConstant(0, NVT)); 1555 SDValue Cmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[1], 1556 ISD::SETULT); 1557 SDValue Carry2 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp2, 1558 DAG.getConstant(1, NVT), Carry1); 1559 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, Carry2); 1560 } else { 1561 Lo = DAG.getNode(ISD::SUB, dl, NVT, LoOps, 2); 1562 Hi = DAG.getNode(ISD::SUB, dl, NVT, HiOps, 2); 1563 SDValue Cmp = 1564 DAG.getSetCC(dl, TLI.getSetCCResultType(LoOps[0].getValueType()), 1565 LoOps[0], LoOps[1], ISD::SETULT); 1566 SDValue Borrow = DAG.getNode(ISD::SELECT, dl, NVT, Cmp, 1567 DAG.getConstant(1, NVT), 1568 DAG.getConstant(0, NVT)); 1569 Hi = DAG.getNode(ISD::SUB, dl, NVT, Hi, Borrow); 1570 } 1571 } 1572 1573 void DAGTypeLegalizer::ExpandIntRes_ADDSUBC(SDNode *N, 1574 SDValue &Lo, SDValue &Hi) { 1575 // Expand the subcomponents. 1576 SDValue LHSL, LHSH, RHSL, RHSH; 1577 DebugLoc dl = N->getDebugLoc(); 1578 GetExpandedInteger(N->getOperand(0), LHSL, LHSH); 1579 GetExpandedInteger(N->getOperand(1), RHSL, RHSH); 1580 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue); 1581 SDValue LoOps[2] = { LHSL, RHSL }; 1582 SDValue HiOps[3] = { LHSH, RHSH }; 1583 1584 if (N->getOpcode() == ISD::ADDC) { 1585 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2); 1586 HiOps[2] = Lo.getValue(1); 1587 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3); 1588 } else { 1589 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2); 1590 HiOps[2] = Lo.getValue(1); 1591 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3); 1592 } 1593 1594 // Legalized the flag result - switch anything that used the old flag to 1595 // use the new one. 1596 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1)); 1597 } 1598 1599 void DAGTypeLegalizer::ExpandIntRes_ADDSUBE(SDNode *N, 1600 SDValue &Lo, SDValue &Hi) { 1601 // Expand the subcomponents. 1602 SDValue LHSL, LHSH, RHSL, RHSH; 1603 DebugLoc dl = N->getDebugLoc(); 1604 GetExpandedInteger(N->getOperand(0), LHSL, LHSH); 1605 GetExpandedInteger(N->getOperand(1), RHSL, RHSH); 1606 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue); 1607 SDValue LoOps[3] = { LHSL, RHSL, N->getOperand(2) }; 1608 SDValue HiOps[3] = { LHSH, RHSH }; 1609 1610 Lo = DAG.getNode(N->getOpcode(), dl, VTList, LoOps, 3); 1611 HiOps[2] = Lo.getValue(1); 1612 Hi = DAG.getNode(N->getOpcode(), dl, VTList, HiOps, 3); 1613 1614 // Legalized the flag result - switch anything that used the old flag to 1615 // use the new one. 1616 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1)); 1617 } 1618 1619 void DAGTypeLegalizer::ExpandIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo, 1620 SDValue &Lo, SDValue &Hi) { 1621 SDValue Res = DisintegrateMERGE_VALUES(N, ResNo); 1622 SplitInteger(Res, Lo, Hi); 1623 } 1624 1625 void DAGTypeLegalizer::ExpandIntRes_ANY_EXTEND(SDNode *N, 1626 SDValue &Lo, SDValue &Hi) { 1627 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 1628 DebugLoc dl = N->getDebugLoc(); 1629 SDValue Op = N->getOperand(0); 1630 if (Op.getValueType().bitsLE(NVT)) { 1631 // The low part is any extension of the input (which degenerates to a copy). 1632 Lo = DAG.getNode(ISD::ANY_EXTEND, dl, NVT, Op); 1633 Hi = DAG.getUNDEF(NVT); // The high part is undefined. 1634 } else { 1635 // For example, extension of an i48 to an i64. The operand type necessarily 1636 // promotes to the result type, so will end up being expanded too. 1637 assert(getTypeAction(Op.getValueType()) == 1638 TargetLowering::TypePromoteInteger && 1639 "Only know how to promote this result!"); 1640 SDValue Res = GetPromotedInteger(Op); 1641 assert(Res.getValueType() == N->getValueType(0) && 1642 "Operand over promoted?"); 1643 // Split the promoted operand. This will simplify when it is expanded. 1644 SplitInteger(Res, Lo, Hi); 1645 } 1646 } 1647 1648 void DAGTypeLegalizer::ExpandIntRes_AssertSext(SDNode *N, 1649 SDValue &Lo, SDValue &Hi) { 1650 DebugLoc dl = N->getDebugLoc(); 1651 GetExpandedInteger(N->getOperand(0), Lo, Hi); 1652 EVT NVT = Lo.getValueType(); 1653 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 1654 unsigned NVTBits = NVT.getSizeInBits(); 1655 unsigned EVTBits = EVT.getSizeInBits(); 1656 1657 if (NVTBits < EVTBits) { 1658 Hi = DAG.getNode(ISD::AssertSext, dl, NVT, Hi, 1659 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(), 1660 EVTBits - NVTBits))); 1661 } else { 1662 Lo = DAG.getNode(ISD::AssertSext, dl, NVT, Lo, DAG.getValueType(EVT)); 1663 // The high part replicates the sign bit of Lo, make it explicit. 1664 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo, 1665 DAG.getConstant(NVTBits-1, TLI.getPointerTy())); 1666 } 1667 } 1668 1669 void DAGTypeLegalizer::ExpandIntRes_AssertZext(SDNode *N, 1670 SDValue &Lo, SDValue &Hi) { 1671 DebugLoc dl = N->getDebugLoc(); 1672 GetExpandedInteger(N->getOperand(0), Lo, Hi); 1673 EVT NVT = Lo.getValueType(); 1674 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 1675 unsigned NVTBits = NVT.getSizeInBits(); 1676 unsigned EVTBits = EVT.getSizeInBits(); 1677 1678 if (NVTBits < EVTBits) { 1679 Hi = DAG.getNode(ISD::AssertZext, dl, NVT, Hi, 1680 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(), 1681 EVTBits - NVTBits))); 1682 } else { 1683 Lo = DAG.getNode(ISD::AssertZext, dl, NVT, Lo, DAG.getValueType(EVT)); 1684 // The high part must be zero, make it explicit. 1685 Hi = DAG.getConstant(0, NVT); 1686 } 1687 } 1688 1689 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N, 1690 SDValue &Lo, SDValue &Hi) { 1691 DebugLoc dl = N->getDebugLoc(); 1692 GetExpandedInteger(N->getOperand(0), Hi, Lo); // Note swapped operands. 1693 Lo = DAG.getNode(ISD::BSWAP, dl, Lo.getValueType(), Lo); 1694 Hi = DAG.getNode(ISD::BSWAP, dl, Hi.getValueType(), Hi); 1695 } 1696 1697 void DAGTypeLegalizer::ExpandIntRes_Constant(SDNode *N, 1698 SDValue &Lo, SDValue &Hi) { 1699 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 1700 unsigned NBitWidth = NVT.getSizeInBits(); 1701 const APInt &Cst = cast<ConstantSDNode>(N)->getAPIntValue(); 1702 Lo = DAG.getConstant(Cst.trunc(NBitWidth), NVT); 1703 Hi = DAG.getConstant(Cst.lshr(NBitWidth).trunc(NBitWidth), NVT); 1704 } 1705 1706 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N, 1707 SDValue &Lo, SDValue &Hi) { 1708 DebugLoc dl = N->getDebugLoc(); 1709 // ctlz (HiLo) -> Hi != 0 ? ctlz(Hi) : (ctlz(Lo)+32) 1710 GetExpandedInteger(N->getOperand(0), Lo, Hi); 1711 EVT NVT = Lo.getValueType(); 1712 1713 SDValue HiNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Hi, 1714 DAG.getConstant(0, NVT), ISD::SETNE); 1715 1716 SDValue LoLZ = DAG.getNode(N->getOpcode(), dl, NVT, Lo); 1717 SDValue HiLZ = DAG.getNode(ISD::CTLZ_ZERO_UNDEF, dl, NVT, Hi); 1718 1719 Lo = DAG.getNode(ISD::SELECT, dl, NVT, HiNotZero, HiLZ, 1720 DAG.getNode(ISD::ADD, dl, NVT, LoLZ, 1721 DAG.getConstant(NVT.getSizeInBits(), NVT))); 1722 Hi = DAG.getConstant(0, NVT); 1723 } 1724 1725 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N, 1726 SDValue &Lo, SDValue &Hi) { 1727 DebugLoc dl = N->getDebugLoc(); 1728 // ctpop(HiLo) -> ctpop(Hi)+ctpop(Lo) 1729 GetExpandedInteger(N->getOperand(0), Lo, Hi); 1730 EVT NVT = Lo.getValueType(); 1731 Lo = DAG.getNode(ISD::ADD, dl, NVT, DAG.getNode(ISD::CTPOP, dl, NVT, Lo), 1732 DAG.getNode(ISD::CTPOP, dl, NVT, Hi)); 1733 Hi = DAG.getConstant(0, NVT); 1734 } 1735 1736 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N, 1737 SDValue &Lo, SDValue &Hi) { 1738 DebugLoc dl = N->getDebugLoc(); 1739 // cttz (HiLo) -> Lo != 0 ? cttz(Lo) : (cttz(Hi)+32) 1740 GetExpandedInteger(N->getOperand(0), Lo, Hi); 1741 EVT NVT = Lo.getValueType(); 1742 1743 SDValue LoNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, 1744 DAG.getConstant(0, NVT), ISD::SETNE); 1745 1746 SDValue LoLZ = DAG.getNode(ISD::CTTZ_ZERO_UNDEF, dl, NVT, Lo); 1747 SDValue HiLZ = DAG.getNode(N->getOpcode(), dl, NVT, Hi); 1748 1749 Lo = DAG.getNode(ISD::SELECT, dl, NVT, LoNotZero, LoLZ, 1750 DAG.getNode(ISD::ADD, dl, NVT, HiLZ, 1751 DAG.getConstant(NVT.getSizeInBits(), NVT))); 1752 Hi = DAG.getConstant(0, NVT); 1753 } 1754 1755 void DAGTypeLegalizer::ExpandIntRes_FP_TO_SINT(SDNode *N, SDValue &Lo, 1756 SDValue &Hi) { 1757 DebugLoc dl = N->getDebugLoc(); 1758 EVT VT = N->getValueType(0); 1759 SDValue Op = N->getOperand(0); 1760 RTLIB::Libcall LC = RTLIB::getFPTOSINT(Op.getValueType(), VT); 1761 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-sint conversion!"); 1762 SplitInteger(MakeLibCall(LC, VT, &Op, 1, true/*irrelevant*/, dl), Lo, Hi); 1763 } 1764 1765 void DAGTypeLegalizer::ExpandIntRes_FP_TO_UINT(SDNode *N, SDValue &Lo, 1766 SDValue &Hi) { 1767 DebugLoc dl = N->getDebugLoc(); 1768 EVT VT = N->getValueType(0); 1769 SDValue Op = N->getOperand(0); 1770 RTLIB::Libcall LC = RTLIB::getFPTOUINT(Op.getValueType(), VT); 1771 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-uint conversion!"); 1772 SplitInteger(MakeLibCall(LC, VT, &Op, 1, false/*irrelevant*/, dl), Lo, Hi); 1773 } 1774 1775 void DAGTypeLegalizer::ExpandIntRes_LOAD(LoadSDNode *N, 1776 SDValue &Lo, SDValue &Hi) { 1777 if (ISD::isNormalLoad(N)) { 1778 ExpandRes_NormalLoad(N, Lo, Hi); 1779 return; 1780 } 1781 1782 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!"); 1783 1784 EVT VT = N->getValueType(0); 1785 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); 1786 SDValue Ch = N->getChain(); 1787 SDValue Ptr = N->getBasePtr(); 1788 ISD::LoadExtType ExtType = N->getExtensionType(); 1789 unsigned Alignment = N->getAlignment(); 1790 bool isVolatile = N->isVolatile(); 1791 bool isNonTemporal = N->isNonTemporal(); 1792 bool isInvariant = N->isInvariant(); 1793 DebugLoc dl = N->getDebugLoc(); 1794 1795 assert(NVT.isByteSized() && "Expanded type not byte sized!"); 1796 1797 if (N->getMemoryVT().bitsLE(NVT)) { 1798 EVT MemVT = N->getMemoryVT(); 1799 1800 Lo = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(), 1801 MemVT, isVolatile, isNonTemporal, Alignment); 1802 1803 // Remember the chain. 1804 Ch = Lo.getValue(1); 1805 1806 if (ExtType == ISD::SEXTLOAD) { 1807 // The high part is obtained by SRA'ing all but one of the bits of the 1808 // lo part. 1809 unsigned LoSize = Lo.getValueType().getSizeInBits(); 1810 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo, 1811 DAG.getConstant(LoSize-1, TLI.getPointerTy())); 1812 } else if (ExtType == ISD::ZEXTLOAD) { 1813 // The high part is just a zero. 1814 Hi = DAG.getConstant(0, NVT); 1815 } else { 1816 assert(ExtType == ISD::EXTLOAD && "Unknown extload!"); 1817 // The high part is undefined. 1818 Hi = DAG.getUNDEF(NVT); 1819 } 1820 } else if (TLI.isLittleEndian()) { 1821 // Little-endian - low bits are at low addresses. 1822 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, N->getPointerInfo(), 1823 isVolatile, isNonTemporal, isInvariant, Alignment); 1824 1825 unsigned ExcessBits = 1826 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits(); 1827 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits); 1828 1829 // Increment the pointer to the other half. 1830 unsigned IncrementSize = NVT.getSizeInBits()/8; 1831 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, 1832 DAG.getIntPtrConstant(IncrementSize)); 1833 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, 1834 N->getPointerInfo().getWithOffset(IncrementSize), NEVT, 1835 isVolatile, isNonTemporal, 1836 MinAlign(Alignment, IncrementSize)); 1837 1838 // Build a factor node to remember that this load is independent of the 1839 // other one. 1840 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), 1841 Hi.getValue(1)); 1842 } else { 1843 // Big-endian - high bits are at low addresses. Favor aligned loads at 1844 // the cost of some bit-fiddling. 1845 EVT MemVT = N->getMemoryVT(); 1846 unsigned EBytes = MemVT.getStoreSize(); 1847 unsigned IncrementSize = NVT.getSizeInBits()/8; 1848 unsigned ExcessBits = (EBytes - IncrementSize)*8; 1849 1850 // Load both the high bits and maybe some of the low bits. 1851 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(), 1852 EVT::getIntegerVT(*DAG.getContext(), 1853 MemVT.getSizeInBits() - ExcessBits), 1854 isVolatile, isNonTemporal, Alignment); 1855 1856 // Increment the pointer to the other half. 1857 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, 1858 DAG.getIntPtrConstant(IncrementSize)); 1859 // Load the rest of the low bits. 1860 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, NVT, Ch, Ptr, 1861 N->getPointerInfo().getWithOffset(IncrementSize), 1862 EVT::getIntegerVT(*DAG.getContext(), ExcessBits), 1863 isVolatile, isNonTemporal, 1864 MinAlign(Alignment, IncrementSize)); 1865 1866 // Build a factor node to remember that this load is independent of the 1867 // other one. 1868 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1), 1869 Hi.getValue(1)); 1870 1871 if (ExcessBits < NVT.getSizeInBits()) { 1872 // Transfer low bits from the bottom of Hi to the top of Lo. 1873 Lo = DAG.getNode(ISD::OR, dl, NVT, Lo, 1874 DAG.getNode(ISD::SHL, dl, NVT, Hi, 1875 DAG.getConstant(ExcessBits, 1876 TLI.getPointerTy()))); 1877 // Move high bits to the right position in Hi. 1878 Hi = DAG.getNode(ExtType == ISD::SEXTLOAD ? ISD::SRA : ISD::SRL, dl, 1879 NVT, Hi, 1880 DAG.getConstant(NVT.getSizeInBits() - ExcessBits, 1881 TLI.getPointerTy())); 1882 } 1883 } 1884 1885 // Legalized the chain result - switch anything that used the old chain to 1886 // use the new one. 1887 ReplaceValueWith(SDValue(N, 1), Ch); 1888 } 1889 1890 void DAGTypeLegalizer::ExpandIntRes_Logical(SDNode *N, 1891 SDValue &Lo, SDValue &Hi) { 1892 DebugLoc dl = N->getDebugLoc(); 1893 SDValue LL, LH, RL, RH; 1894 GetExpandedInteger(N->getOperand(0), LL, LH); 1895 GetExpandedInteger(N->getOperand(1), RL, RH); 1896 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LL, RL); 1897 Hi = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LH, RH); 1898 } 1899 1900 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N, 1901 SDValue &Lo, SDValue &Hi) { 1902 EVT VT = N->getValueType(0); 1903 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); 1904 DebugLoc dl = N->getDebugLoc(); 1905 1906 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, NVT); 1907 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, NVT); 1908 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, NVT); 1909 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, NVT); 1910 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) { 1911 SDValue LL, LH, RL, RH; 1912 GetExpandedInteger(N->getOperand(0), LL, LH); 1913 GetExpandedInteger(N->getOperand(1), RL, RH); 1914 unsigned OuterBitSize = VT.getSizeInBits(); 1915 unsigned InnerBitSize = NVT.getSizeInBits(); 1916 unsigned LHSSB = DAG.ComputeNumSignBits(N->getOperand(0)); 1917 unsigned RHSSB = DAG.ComputeNumSignBits(N->getOperand(1)); 1918 1919 APInt HighMask = APInt::getHighBitsSet(OuterBitSize, InnerBitSize); 1920 if (DAG.MaskedValueIsZero(N->getOperand(0), HighMask) && 1921 DAG.MaskedValueIsZero(N->getOperand(1), HighMask)) { 1922 // The inputs are both zero-extended. 1923 if (HasUMUL_LOHI) { 1924 // We can emit a umul_lohi. 1925 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL); 1926 Hi = SDValue(Lo.getNode(), 1); 1927 return; 1928 } 1929 if (HasMULHU) { 1930 // We can emit a mulhu+mul. 1931 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL); 1932 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL); 1933 return; 1934 } 1935 } 1936 if (LHSSB > InnerBitSize && RHSSB > InnerBitSize) { 1937 // The input values are both sign-extended. 1938 if (HasSMUL_LOHI) { 1939 // We can emit a smul_lohi. 1940 Lo = DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL); 1941 Hi = SDValue(Lo.getNode(), 1); 1942 return; 1943 } 1944 if (HasMULHS) { 1945 // We can emit a mulhs+mul. 1946 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL); 1947 Hi = DAG.getNode(ISD::MULHS, dl, NVT, LL, RL); 1948 return; 1949 } 1950 } 1951 if (HasUMUL_LOHI) { 1952 // Lo,Hi = umul LHS, RHS. 1953 SDValue UMulLOHI = DAG.getNode(ISD::UMUL_LOHI, dl, 1954 DAG.getVTList(NVT, NVT), LL, RL); 1955 Lo = UMulLOHI; 1956 Hi = UMulLOHI.getValue(1); 1957 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH); 1958 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL); 1959 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH); 1960 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH); 1961 return; 1962 } 1963 if (HasMULHU) { 1964 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL); 1965 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL); 1966 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH); 1967 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL); 1968 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH); 1969 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH); 1970 return; 1971 } 1972 } 1973 1974 // If nothing else, we can make a libcall. 1975 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 1976 if (VT == MVT::i16) 1977 LC = RTLIB::MUL_I16; 1978 else if (VT == MVT::i32) 1979 LC = RTLIB::MUL_I32; 1980 else if (VT == MVT::i64) 1981 LC = RTLIB::MUL_I64; 1982 else if (VT == MVT::i128) 1983 LC = RTLIB::MUL_I128; 1984 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported MUL!"); 1985 1986 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 1987 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true/*irrelevant*/, dl), Lo, Hi); 1988 } 1989 1990 void DAGTypeLegalizer::ExpandIntRes_SADDSUBO(SDNode *Node, 1991 SDValue &Lo, SDValue &Hi) { 1992 SDValue LHS = Node->getOperand(0); 1993 SDValue RHS = Node->getOperand(1); 1994 DebugLoc dl = Node->getDebugLoc(); 1995 1996 // Expand the result by simply replacing it with the equivalent 1997 // non-overflow-checking operation. 1998 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ? 1999 ISD::ADD : ISD::SUB, dl, LHS.getValueType(), 2000 LHS, RHS); 2001 SplitInteger(Sum, Lo, Hi); 2002 2003 // Compute the overflow. 2004 // 2005 // LHSSign -> LHS >= 0 2006 // RHSSign -> RHS >= 0 2007 // SumSign -> Sum >= 0 2008 // 2009 // Add: 2010 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign) 2011 // Sub: 2012 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign) 2013 // 2014 EVT OType = Node->getValueType(1); 2015 SDValue Zero = DAG.getConstant(0, LHS.getValueType()); 2016 2017 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE); 2018 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE); 2019 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign, 2020 Node->getOpcode() == ISD::SADDO ? 2021 ISD::SETEQ : ISD::SETNE); 2022 2023 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE); 2024 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE); 2025 2026 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE); 2027 2028 // Use the calculated overflow everywhere. 2029 ReplaceValueWith(SDValue(Node, 1), Cmp); 2030 } 2031 2032 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N, 2033 SDValue &Lo, SDValue &Hi) { 2034 EVT VT = N->getValueType(0); 2035 DebugLoc dl = N->getDebugLoc(); 2036 2037 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2038 if (VT == MVT::i16) 2039 LC = RTLIB::SDIV_I16; 2040 else if (VT == MVT::i32) 2041 LC = RTLIB::SDIV_I32; 2042 else if (VT == MVT::i64) 2043 LC = RTLIB::SDIV_I64; 2044 else if (VT == MVT::i128) 2045 LC = RTLIB::SDIV_I128; 2046 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SDIV!"); 2047 2048 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 2049 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true, dl), Lo, Hi); 2050 } 2051 2052 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N, 2053 SDValue &Lo, SDValue &Hi) { 2054 EVT VT = N->getValueType(0); 2055 DebugLoc dl = N->getDebugLoc(); 2056 2057 // If we can emit an efficient shift operation, do so now. Check to see if 2058 // the RHS is a constant. 2059 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N->getOperand(1))) 2060 return ExpandShiftByConstant(N, CN->getZExtValue(), Lo, Hi); 2061 2062 // If we can determine that the high bit of the shift is zero or one, even if 2063 // the low bits are variable, emit this shift in an optimized form. 2064 if (ExpandShiftWithKnownAmountBit(N, Lo, Hi)) 2065 return; 2066 2067 // If this target supports shift_PARTS, use it. First, map to the _PARTS opc. 2068 unsigned PartsOpc; 2069 if (N->getOpcode() == ISD::SHL) { 2070 PartsOpc = ISD::SHL_PARTS; 2071 } else if (N->getOpcode() == ISD::SRL) { 2072 PartsOpc = ISD::SRL_PARTS; 2073 } else { 2074 assert(N->getOpcode() == ISD::SRA && "Unknown shift!"); 2075 PartsOpc = ISD::SRA_PARTS; 2076 } 2077 2078 // Next check to see if the target supports this SHL_PARTS operation or if it 2079 // will custom expand it. 2080 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); 2081 TargetLowering::LegalizeAction Action = TLI.getOperationAction(PartsOpc, NVT); 2082 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) || 2083 Action == TargetLowering::Custom) { 2084 // Expand the subcomponents. 2085 SDValue LHSL, LHSH; 2086 GetExpandedInteger(N->getOperand(0), LHSL, LHSH); 2087 2088 SDValue Ops[] = { LHSL, LHSH, N->getOperand(1) }; 2089 EVT VT = LHSL.getValueType(); 2090 Lo = DAG.getNode(PartsOpc, dl, DAG.getVTList(VT, VT), Ops, 3); 2091 Hi = Lo.getValue(1); 2092 return; 2093 } 2094 2095 // Otherwise, emit a libcall. 2096 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2097 bool isSigned; 2098 if (N->getOpcode() == ISD::SHL) { 2099 isSigned = false; /*sign irrelevant*/ 2100 if (VT == MVT::i16) 2101 LC = RTLIB::SHL_I16; 2102 else if (VT == MVT::i32) 2103 LC = RTLIB::SHL_I32; 2104 else if (VT == MVT::i64) 2105 LC = RTLIB::SHL_I64; 2106 else if (VT == MVT::i128) 2107 LC = RTLIB::SHL_I128; 2108 } else if (N->getOpcode() == ISD::SRL) { 2109 isSigned = false; 2110 if (VT == MVT::i16) 2111 LC = RTLIB::SRL_I16; 2112 else if (VT == MVT::i32) 2113 LC = RTLIB::SRL_I32; 2114 else if (VT == MVT::i64) 2115 LC = RTLIB::SRL_I64; 2116 else if (VT == MVT::i128) 2117 LC = RTLIB::SRL_I128; 2118 } else { 2119 assert(N->getOpcode() == ISD::SRA && "Unknown shift!"); 2120 isSigned = true; 2121 if (VT == MVT::i16) 2122 LC = RTLIB::SRA_I16; 2123 else if (VT == MVT::i32) 2124 LC = RTLIB::SRA_I32; 2125 else if (VT == MVT::i64) 2126 LC = RTLIB::SRA_I64; 2127 else if (VT == MVT::i128) 2128 LC = RTLIB::SRA_I128; 2129 } 2130 2131 if (LC != RTLIB::UNKNOWN_LIBCALL && TLI.getLibcallName(LC)) { 2132 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 2133 SplitInteger(MakeLibCall(LC, VT, Ops, 2, isSigned, dl), Lo, Hi); 2134 return; 2135 } 2136 2137 if (!ExpandShiftWithUnknownAmountBit(N, Lo, Hi)) 2138 llvm_unreachable("Unsupported shift!"); 2139 } 2140 2141 void DAGTypeLegalizer::ExpandIntRes_SIGN_EXTEND(SDNode *N, 2142 SDValue &Lo, SDValue &Hi) { 2143 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 2144 DebugLoc dl = N->getDebugLoc(); 2145 SDValue Op = N->getOperand(0); 2146 if (Op.getValueType().bitsLE(NVT)) { 2147 // The low part is sign extension of the input (degenerates to a copy). 2148 Lo = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, N->getOperand(0)); 2149 // The high part is obtained by SRA'ing all but one of the bits of low part. 2150 unsigned LoSize = NVT.getSizeInBits(); 2151 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo, 2152 DAG.getConstant(LoSize-1, TLI.getPointerTy())); 2153 } else { 2154 // For example, extension of an i48 to an i64. The operand type necessarily 2155 // promotes to the result type, so will end up being expanded too. 2156 assert(getTypeAction(Op.getValueType()) == 2157 TargetLowering::TypePromoteInteger && 2158 "Only know how to promote this result!"); 2159 SDValue Res = GetPromotedInteger(Op); 2160 assert(Res.getValueType() == N->getValueType(0) && 2161 "Operand over promoted?"); 2162 // Split the promoted operand. This will simplify when it is expanded. 2163 SplitInteger(Res, Lo, Hi); 2164 unsigned ExcessBits = 2165 Op.getValueType().getSizeInBits() - NVT.getSizeInBits(); 2166 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi, 2167 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(), 2168 ExcessBits))); 2169 } 2170 } 2171 2172 void DAGTypeLegalizer:: 2173 ExpandIntRes_SIGN_EXTEND_INREG(SDNode *N, SDValue &Lo, SDValue &Hi) { 2174 DebugLoc dl = N->getDebugLoc(); 2175 GetExpandedInteger(N->getOperand(0), Lo, Hi); 2176 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT(); 2177 2178 if (EVT.bitsLE(Lo.getValueType())) { 2179 // sext_inreg the low part if needed. 2180 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Lo.getValueType(), Lo, 2181 N->getOperand(1)); 2182 2183 // The high part gets the sign extension from the lo-part. This handles 2184 // things like sextinreg V:i64 from i8. 2185 Hi = DAG.getNode(ISD::SRA, dl, Hi.getValueType(), Lo, 2186 DAG.getConstant(Hi.getValueType().getSizeInBits()-1, 2187 TLI.getPointerTy())); 2188 } else { 2189 // For example, extension of an i48 to an i64. Leave the low part alone, 2190 // sext_inreg the high part. 2191 unsigned ExcessBits = 2192 EVT.getSizeInBits() - Lo.getValueType().getSizeInBits(); 2193 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi, 2194 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(), 2195 ExcessBits))); 2196 } 2197 } 2198 2199 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N, 2200 SDValue &Lo, SDValue &Hi) { 2201 EVT VT = N->getValueType(0); 2202 DebugLoc dl = N->getDebugLoc(); 2203 2204 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2205 if (VT == MVT::i16) 2206 LC = RTLIB::SREM_I16; 2207 else if (VT == MVT::i32) 2208 LC = RTLIB::SREM_I32; 2209 else if (VT == MVT::i64) 2210 LC = RTLIB::SREM_I64; 2211 else if (VT == MVT::i128) 2212 LC = RTLIB::SREM_I128; 2213 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SREM!"); 2214 2215 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 2216 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true, dl), Lo, Hi); 2217 } 2218 2219 void DAGTypeLegalizer::ExpandIntRes_TRUNCATE(SDNode *N, 2220 SDValue &Lo, SDValue &Hi) { 2221 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 2222 DebugLoc dl = N->getDebugLoc(); 2223 Lo = DAG.getNode(ISD::TRUNCATE, dl, NVT, N->getOperand(0)); 2224 Hi = DAG.getNode(ISD::SRL, dl, 2225 N->getOperand(0).getValueType(), N->getOperand(0), 2226 DAG.getConstant(NVT.getSizeInBits(), TLI.getPointerTy())); 2227 Hi = DAG.getNode(ISD::TRUNCATE, dl, NVT, Hi); 2228 } 2229 2230 void DAGTypeLegalizer::ExpandIntRes_UADDSUBO(SDNode *N, 2231 SDValue &Lo, SDValue &Hi) { 2232 SDValue LHS = N->getOperand(0); 2233 SDValue RHS = N->getOperand(1); 2234 DebugLoc dl = N->getDebugLoc(); 2235 2236 // Expand the result by simply replacing it with the equivalent 2237 // non-overflow-checking operation. 2238 SDValue Sum = DAG.getNode(N->getOpcode() == ISD::UADDO ? 2239 ISD::ADD : ISD::SUB, dl, LHS.getValueType(), 2240 LHS, RHS); 2241 SplitInteger(Sum, Lo, Hi); 2242 2243 // Calculate the overflow: addition overflows iff a + b < a, and subtraction 2244 // overflows iff a - b > a. 2245 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Sum, LHS, 2246 N->getOpcode () == ISD::UADDO ? 2247 ISD::SETULT : ISD::SETUGT); 2248 2249 // Use the calculated overflow everywhere. 2250 ReplaceValueWith(SDValue(N, 1), Ofl); 2251 } 2252 2253 void DAGTypeLegalizer::ExpandIntRes_XMULO(SDNode *N, 2254 SDValue &Lo, SDValue &Hi) { 2255 EVT VT = N->getValueType(0); 2256 Type *RetTy = VT.getTypeForEVT(*DAG.getContext()); 2257 EVT PtrVT = TLI.getPointerTy(); 2258 Type *PtrTy = PtrVT.getTypeForEVT(*DAG.getContext()); 2259 DebugLoc dl = N->getDebugLoc(); 2260 2261 // A divide for UMULO should be faster than a function call. 2262 if (N->getOpcode() == ISD::UMULO) { 2263 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1); 2264 DebugLoc DL = N->getDebugLoc(); 2265 2266 SDValue MUL = DAG.getNode(ISD::MUL, DL, LHS.getValueType(), LHS, RHS); 2267 SplitInteger(MUL, Lo, Hi); 2268 2269 // A divide for UMULO will be faster than a function call. Select to 2270 // make sure we aren't using 0. 2271 SDValue isZero = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), 2272 RHS, DAG.getConstant(0, VT), ISD::SETNE); 2273 SDValue NotZero = DAG.getNode(ISD::SELECT, dl, VT, isZero, 2274 DAG.getConstant(1, VT), RHS); 2275 SDValue DIV = DAG.getNode(ISD::UDIV, DL, LHS.getValueType(), MUL, NotZero); 2276 SDValue Overflow; 2277 Overflow = DAG.getSetCC(DL, N->getValueType(1), DIV, LHS, ISD::SETNE); 2278 ReplaceValueWith(SDValue(N, 1), Overflow); 2279 return; 2280 } 2281 2282 // Replace this with a libcall that will check overflow. 2283 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2284 if (VT == MVT::i32) 2285 LC = RTLIB::MULO_I32; 2286 else if (VT == MVT::i64) 2287 LC = RTLIB::MULO_I64; 2288 else if (VT == MVT::i128) 2289 LC = RTLIB::MULO_I128; 2290 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported XMULO!"); 2291 2292 SDValue Temp = DAG.CreateStackTemporary(PtrVT); 2293 // Temporary for the overflow value, default it to zero. 2294 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl, 2295 DAG.getConstant(0, PtrVT), Temp, 2296 MachinePointerInfo(), false, false, 0); 2297 2298 TargetLowering::ArgListTy Args; 2299 TargetLowering::ArgListEntry Entry; 2300 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 2301 EVT ArgVT = N->getOperand(i).getValueType(); 2302 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext()); 2303 Entry.Node = N->getOperand(i); 2304 Entry.Ty = ArgTy; 2305 Entry.isSExt = true; 2306 Entry.isZExt = false; 2307 Args.push_back(Entry); 2308 } 2309 2310 // Also pass the address of the overflow check. 2311 Entry.Node = Temp; 2312 Entry.Ty = PtrTy->getPointerTo(); 2313 Entry.isSExt = true; 2314 Entry.isZExt = false; 2315 Args.push_back(Entry); 2316 2317 SDValue Func = DAG.getExternalSymbol(TLI.getLibcallName(LC), PtrVT); 2318 TargetLowering:: 2319 CallLoweringInfo CLI(Chain, RetTy, true, false, false, false, 2320 0, TLI.getLibcallCallingConv(LC), 2321 /*isTailCall=*/false, 2322 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true, 2323 Func, Args, DAG, dl); 2324 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI); 2325 2326 SplitInteger(CallInfo.first, Lo, Hi); 2327 SDValue Temp2 = DAG.getLoad(PtrVT, dl, CallInfo.second, Temp, 2328 MachinePointerInfo(), false, false, false, 0); 2329 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Temp2, 2330 DAG.getConstant(0, PtrVT), 2331 ISD::SETNE); 2332 // Use the overflow from the libcall everywhere. 2333 ReplaceValueWith(SDValue(N, 1), Ofl); 2334 } 2335 2336 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N, 2337 SDValue &Lo, SDValue &Hi) { 2338 EVT VT = N->getValueType(0); 2339 DebugLoc dl = N->getDebugLoc(); 2340 2341 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2342 if (VT == MVT::i16) 2343 LC = RTLIB::UDIV_I16; 2344 else if (VT == MVT::i32) 2345 LC = RTLIB::UDIV_I32; 2346 else if (VT == MVT::i64) 2347 LC = RTLIB::UDIV_I64; 2348 else if (VT == MVT::i128) 2349 LC = RTLIB::UDIV_I128; 2350 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UDIV!"); 2351 2352 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 2353 SplitInteger(MakeLibCall(LC, VT, Ops, 2, false, dl), Lo, Hi); 2354 } 2355 2356 void DAGTypeLegalizer::ExpandIntRes_UREM(SDNode *N, 2357 SDValue &Lo, SDValue &Hi) { 2358 EVT VT = N->getValueType(0); 2359 DebugLoc dl = N->getDebugLoc(); 2360 2361 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL; 2362 if (VT == MVT::i16) 2363 LC = RTLIB::UREM_I16; 2364 else if (VT == MVT::i32) 2365 LC = RTLIB::UREM_I32; 2366 else if (VT == MVT::i64) 2367 LC = RTLIB::UREM_I64; 2368 else if (VT == MVT::i128) 2369 LC = RTLIB::UREM_I128; 2370 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UREM!"); 2371 2372 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) }; 2373 SplitInteger(MakeLibCall(LC, VT, Ops, 2, false, dl), Lo, Hi); 2374 } 2375 2376 void DAGTypeLegalizer::ExpandIntRes_ZERO_EXTEND(SDNode *N, 2377 SDValue &Lo, SDValue &Hi) { 2378 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)); 2379 DebugLoc dl = N->getDebugLoc(); 2380 SDValue Op = N->getOperand(0); 2381 if (Op.getValueType().bitsLE(NVT)) { 2382 // The low part is zero extension of the input (degenerates to a copy). 2383 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N->getOperand(0)); 2384 Hi = DAG.getConstant(0, NVT); // The high part is just a zero. 2385 } else { 2386 // For example, extension of an i48 to an i64. The operand type necessarily 2387 // promotes to the result type, so will end up being expanded too. 2388 assert(getTypeAction(Op.getValueType()) == 2389 TargetLowering::TypePromoteInteger && 2390 "Only know how to promote this result!"); 2391 SDValue Res = GetPromotedInteger(Op); 2392 assert(Res.getValueType() == N->getValueType(0) && 2393 "Operand over promoted?"); 2394 // Split the promoted operand. This will simplify when it is expanded. 2395 SplitInteger(Res, Lo, Hi); 2396 unsigned ExcessBits = 2397 Op.getValueType().getSizeInBits() - NVT.getSizeInBits(); 2398 Hi = DAG.getZeroExtendInReg(Hi, dl, 2399 EVT::getIntegerVT(*DAG.getContext(), 2400 ExcessBits)); 2401 } 2402 } 2403 2404 void DAGTypeLegalizer::ExpandIntRes_ATOMIC_LOAD(SDNode *N, 2405 SDValue &Lo, SDValue &Hi) { 2406 DebugLoc dl = N->getDebugLoc(); 2407 EVT VT = cast<AtomicSDNode>(N)->getMemoryVT(); 2408 SDValue Zero = DAG.getConstant(0, VT); 2409 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl, VT, 2410 N->getOperand(0), 2411 N->getOperand(1), Zero, Zero, 2412 cast<AtomicSDNode>(N)->getMemOperand(), 2413 cast<AtomicSDNode>(N)->getOrdering(), 2414 cast<AtomicSDNode>(N)->getSynchScope()); 2415 ReplaceValueWith(SDValue(N, 0), Swap.getValue(0)); 2416 ReplaceValueWith(SDValue(N, 1), Swap.getValue(1)); 2417 } 2418 2419 //===----------------------------------------------------------------------===// 2420 // Integer Operand Expansion 2421 //===----------------------------------------------------------------------===// 2422 2423 /// ExpandIntegerOperand - This method is called when the specified operand of 2424 /// the specified node is found to need expansion. At this point, all of the 2425 /// result types of the node are known to be legal, but other operands of the 2426 /// node may need promotion or expansion as well as the specified one. 2427 bool DAGTypeLegalizer::ExpandIntegerOperand(SDNode *N, unsigned OpNo) { 2428 DEBUG(dbgs() << "Expand integer operand: "; N->dump(&DAG); dbgs() << "\n"); 2429 SDValue Res = SDValue(); 2430 2431 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false)) 2432 return false; 2433 2434 switch (N->getOpcode()) { 2435 default: 2436 #ifndef NDEBUG 2437 dbgs() << "ExpandIntegerOperand Op #" << OpNo << ": "; 2438 N->dump(&DAG); dbgs() << "\n"; 2439 #endif 2440 llvm_unreachable("Do not know how to expand this operator's operand!"); 2441 2442 case ISD::BITCAST: Res = ExpandOp_BITCAST(N); break; 2443 case ISD::BR_CC: Res = ExpandIntOp_BR_CC(N); break; 2444 case ISD::BUILD_VECTOR: Res = ExpandOp_BUILD_VECTOR(N); break; 2445 case ISD::EXTRACT_ELEMENT: Res = ExpandOp_EXTRACT_ELEMENT(N); break; 2446 case ISD::INSERT_VECTOR_ELT: Res = ExpandOp_INSERT_VECTOR_ELT(N); break; 2447 case ISD::SCALAR_TO_VECTOR: Res = ExpandOp_SCALAR_TO_VECTOR(N); break; 2448 case ISD::SELECT_CC: Res = ExpandIntOp_SELECT_CC(N); break; 2449 case ISD::SETCC: Res = ExpandIntOp_SETCC(N); break; 2450 case ISD::SINT_TO_FP: Res = ExpandIntOp_SINT_TO_FP(N); break; 2451 case ISD::STORE: Res = ExpandIntOp_STORE(cast<StoreSDNode>(N), OpNo); break; 2452 case ISD::TRUNCATE: Res = ExpandIntOp_TRUNCATE(N); break; 2453 case ISD::UINT_TO_FP: Res = ExpandIntOp_UINT_TO_FP(N); break; 2454 2455 case ISD::SHL: 2456 case ISD::SRA: 2457 case ISD::SRL: 2458 case ISD::ROTL: 2459 case ISD::ROTR: Res = ExpandIntOp_Shift(N); break; 2460 case ISD::RETURNADDR: 2461 case ISD::FRAMEADDR: Res = ExpandIntOp_RETURNADDR(N); break; 2462 2463 case ISD::ATOMIC_STORE: Res = ExpandIntOp_ATOMIC_STORE(N); break; 2464 } 2465 2466 // If the result is null, the sub-method took care of registering results etc. 2467 if (!Res.getNode()) return false; 2468 2469 // If the result is N, the sub-method updated N in place. Tell the legalizer 2470 // core about this. 2471 if (Res.getNode() == N) 2472 return true; 2473 2474 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 && 2475 "Invalid operand expansion"); 2476 2477 ReplaceValueWith(SDValue(N, 0), Res); 2478 return false; 2479 } 2480 2481 /// IntegerExpandSetCCOperands - Expand the operands of a comparison. This code 2482 /// is shared among BR_CC, SELECT_CC, and SETCC handlers. 2483 void DAGTypeLegalizer::IntegerExpandSetCCOperands(SDValue &NewLHS, 2484 SDValue &NewRHS, 2485 ISD::CondCode &CCCode, 2486 DebugLoc dl) { 2487 SDValue LHSLo, LHSHi, RHSLo, RHSHi; 2488 GetExpandedInteger(NewLHS, LHSLo, LHSHi); 2489 GetExpandedInteger(NewRHS, RHSLo, RHSHi); 2490 2491 if (CCCode == ISD::SETEQ || CCCode == ISD::SETNE) { 2492 if (RHSLo == RHSHi) { 2493 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) { 2494 if (RHSCST->isAllOnesValue()) { 2495 // Equality comparison to -1. 2496 NewLHS = DAG.getNode(ISD::AND, dl, 2497 LHSLo.getValueType(), LHSLo, LHSHi); 2498 NewRHS = RHSLo; 2499 return; 2500 } 2501 } 2502 } 2503 2504 NewLHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSLo, RHSLo); 2505 NewRHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSHi, RHSHi); 2506 NewLHS = DAG.getNode(ISD::OR, dl, NewLHS.getValueType(), NewLHS, NewRHS); 2507 NewRHS = DAG.getConstant(0, NewLHS.getValueType()); 2508 return; 2509 } 2510 2511 // If this is a comparison of the sign bit, just look at the top part. 2512 // X > -1, x < 0 2513 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(NewRHS)) 2514 if ((CCCode == ISD::SETLT && CST->isNullValue()) || // X < 0 2515 (CCCode == ISD::SETGT && CST->isAllOnesValue())) { // X > -1 2516 NewLHS = LHSHi; 2517 NewRHS = RHSHi; 2518 return; 2519 } 2520 2521 // FIXME: This generated code sucks. 2522 ISD::CondCode LowCC; 2523 switch (CCCode) { 2524 default: llvm_unreachable("Unknown integer setcc!"); 2525 case ISD::SETLT: 2526 case ISD::SETULT: LowCC = ISD::SETULT; break; 2527 case ISD::SETGT: 2528 case ISD::SETUGT: LowCC = ISD::SETUGT; break; 2529 case ISD::SETLE: 2530 case ISD::SETULE: LowCC = ISD::SETULE; break; 2531 case ISD::SETGE: 2532 case ISD::SETUGE: LowCC = ISD::SETUGE; break; 2533 } 2534 2535 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison 2536 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands 2537 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2; 2538 2539 // NOTE: on targets without efficient SELECT of bools, we can always use 2540 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3) 2541 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, false, true, true, NULL); 2542 SDValue Tmp1, Tmp2; 2543 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSLo.getValueType()), 2544 LHSLo, RHSLo, LowCC, false, DagCombineInfo, dl); 2545 if (!Tmp1.getNode()) 2546 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSLo.getValueType()), 2547 LHSLo, RHSLo, LowCC); 2548 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()), 2549 LHSHi, RHSHi, CCCode, false, DagCombineInfo, dl); 2550 if (!Tmp2.getNode()) 2551 Tmp2 = DAG.getNode(ISD::SETCC, dl, 2552 TLI.getSetCCResultType(LHSHi.getValueType()), 2553 LHSHi, RHSHi, DAG.getCondCode(CCCode)); 2554 2555 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.getNode()); 2556 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.getNode()); 2557 if ((Tmp1C && Tmp1C->isNullValue()) || 2558 (Tmp2C && Tmp2C->isNullValue() && 2559 (CCCode == ISD::SETLE || CCCode == ISD::SETGE || 2560 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) || 2561 (Tmp2C && Tmp2C->getAPIntValue() == 1 && 2562 (CCCode == ISD::SETLT || CCCode == ISD::SETGT || 2563 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) { 2564 // low part is known false, returns high part. 2565 // For LE / GE, if high part is known false, ignore the low part. 2566 // For LT / GT, if high part is known true, ignore the low part. 2567 NewLHS = Tmp2; 2568 NewRHS = SDValue(); 2569 return; 2570 } 2571 2572 NewLHS = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()), 2573 LHSHi, RHSHi, ISD::SETEQ, false, 2574 DagCombineInfo, dl); 2575 if (!NewLHS.getNode()) 2576 NewLHS = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()), 2577 LHSHi, RHSHi, ISD::SETEQ); 2578 NewLHS = DAG.getNode(ISD::SELECT, dl, Tmp1.getValueType(), 2579 NewLHS, Tmp1, Tmp2); 2580 NewRHS = SDValue(); 2581 } 2582 2583 SDValue DAGTypeLegalizer::ExpandIntOp_BR_CC(SDNode *N) { 2584 SDValue NewLHS = N->getOperand(2), NewRHS = N->getOperand(3); 2585 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(1))->get(); 2586 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc()); 2587 2588 // If ExpandSetCCOperands returned a scalar, we need to compare the result 2589 // against zero to select between true and false values. 2590 if (NewRHS.getNode() == 0) { 2591 NewRHS = DAG.getConstant(0, NewLHS.getValueType()); 2592 CCCode = ISD::SETNE; 2593 } 2594 2595 // Update N to have the operands specified. 2596 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), 2597 DAG.getCondCode(CCCode), NewLHS, NewRHS, 2598 N->getOperand(4)), 0); 2599 } 2600 2601 SDValue DAGTypeLegalizer::ExpandIntOp_SELECT_CC(SDNode *N) { 2602 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1); 2603 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(4))->get(); 2604 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc()); 2605 2606 // If ExpandSetCCOperands returned a scalar, we need to compare the result 2607 // against zero to select between true and false values. 2608 if (NewRHS.getNode() == 0) { 2609 NewRHS = DAG.getConstant(0, NewLHS.getValueType()); 2610 CCCode = ISD::SETNE; 2611 } 2612 2613 // Update N to have the operands specified. 2614 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS, 2615 N->getOperand(2), N->getOperand(3), 2616 DAG.getCondCode(CCCode)), 0); 2617 } 2618 2619 SDValue DAGTypeLegalizer::ExpandIntOp_SETCC(SDNode *N) { 2620 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1); 2621 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(2))->get(); 2622 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc()); 2623 2624 // If ExpandSetCCOperands returned a scalar, use it. 2625 if (NewRHS.getNode() == 0) { 2626 assert(NewLHS.getValueType() == N->getValueType(0) && 2627 "Unexpected setcc expansion!"); 2628 return NewLHS; 2629 } 2630 2631 // Otherwise, update N to have the operands specified. 2632 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS, 2633 DAG.getCondCode(CCCode)), 0); 2634 } 2635 2636 SDValue DAGTypeLegalizer::ExpandIntOp_Shift(SDNode *N) { 2637 // The value being shifted is legal, but the shift amount is too big. 2638 // It follows that either the result of the shift is undefined, or the 2639 // upper half of the shift amount is zero. Just use the lower half. 2640 SDValue Lo, Hi; 2641 GetExpandedInteger(N->getOperand(1), Lo, Hi); 2642 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Lo), 0); 2643 } 2644 2645 SDValue DAGTypeLegalizer::ExpandIntOp_RETURNADDR(SDNode *N) { 2646 // The argument of RETURNADDR / FRAMEADDR builtin is 32 bit contant. This 2647 // surely makes pretty nice problems on 8/16 bit targets. Just truncate this 2648 // constant to valid type. 2649 SDValue Lo, Hi; 2650 GetExpandedInteger(N->getOperand(0), Lo, Hi); 2651 return SDValue(DAG.UpdateNodeOperands(N, Lo), 0); 2652 } 2653 2654 SDValue DAGTypeLegalizer::ExpandIntOp_SINT_TO_FP(SDNode *N) { 2655 SDValue Op = N->getOperand(0); 2656 EVT DstVT = N->getValueType(0); 2657 RTLIB::Libcall LC = RTLIB::getSINTTOFP(Op.getValueType(), DstVT); 2658 assert(LC != RTLIB::UNKNOWN_LIBCALL && 2659 "Don't know how to expand this SINT_TO_FP!"); 2660 return MakeLibCall(LC, DstVT, &Op, 1, true, N->getDebugLoc()); 2661 } 2662 2663 SDValue DAGTypeLegalizer::ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo) { 2664 if (ISD::isNormalStore(N)) 2665 return ExpandOp_NormalStore(N, OpNo); 2666 2667 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!"); 2668 assert(OpNo == 1 && "Can only expand the stored value so far"); 2669 2670 EVT VT = N->getOperand(1).getValueType(); 2671 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT); 2672 SDValue Ch = N->getChain(); 2673 SDValue Ptr = N->getBasePtr(); 2674 unsigned Alignment = N->getAlignment(); 2675 bool isVolatile = N->isVolatile(); 2676 bool isNonTemporal = N->isNonTemporal(); 2677 DebugLoc dl = N->getDebugLoc(); 2678 SDValue Lo, Hi; 2679 2680 assert(NVT.isByteSized() && "Expanded type not byte sized!"); 2681 2682 if (N->getMemoryVT().bitsLE(NVT)) { 2683 GetExpandedInteger(N->getValue(), Lo, Hi); 2684 return DAG.getTruncStore(Ch, dl, Lo, Ptr, N->getPointerInfo(), 2685 N->getMemoryVT(), isVolatile, isNonTemporal, 2686 Alignment); 2687 } 2688 2689 if (TLI.isLittleEndian()) { 2690 // Little-endian - low bits are at low addresses. 2691 GetExpandedInteger(N->getValue(), Lo, Hi); 2692 2693 Lo = DAG.getStore(Ch, dl, Lo, Ptr, N->getPointerInfo(), 2694 isVolatile, isNonTemporal, Alignment); 2695 2696 unsigned ExcessBits = 2697 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits(); 2698 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits); 2699 2700 // Increment the pointer to the other half. 2701 unsigned IncrementSize = NVT.getSizeInBits()/8; 2702 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, 2703 DAG.getIntPtrConstant(IncrementSize)); 2704 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, 2705 N->getPointerInfo().getWithOffset(IncrementSize), 2706 NEVT, isVolatile, isNonTemporal, 2707 MinAlign(Alignment, IncrementSize)); 2708 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi); 2709 } 2710 2711 // Big-endian - high bits are at low addresses. Favor aligned stores at 2712 // the cost of some bit-fiddling. 2713 GetExpandedInteger(N->getValue(), Lo, Hi); 2714 2715 EVT ExtVT = N->getMemoryVT(); 2716 unsigned EBytes = ExtVT.getStoreSize(); 2717 unsigned IncrementSize = NVT.getSizeInBits()/8; 2718 unsigned ExcessBits = (EBytes - IncrementSize)*8; 2719 EVT HiVT = EVT::getIntegerVT(*DAG.getContext(), 2720 ExtVT.getSizeInBits() - ExcessBits); 2721 2722 if (ExcessBits < NVT.getSizeInBits()) { 2723 // Transfer high bits from the top of Lo to the bottom of Hi. 2724 Hi = DAG.getNode(ISD::SHL, dl, NVT, Hi, 2725 DAG.getConstant(NVT.getSizeInBits() - ExcessBits, 2726 TLI.getPointerTy())); 2727 Hi = DAG.getNode(ISD::OR, dl, NVT, Hi, 2728 DAG.getNode(ISD::SRL, dl, NVT, Lo, 2729 DAG.getConstant(ExcessBits, 2730 TLI.getPointerTy()))); 2731 } 2732 2733 // Store both the high bits and maybe some of the low bits. 2734 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, N->getPointerInfo(), 2735 HiVT, isVolatile, isNonTemporal, Alignment); 2736 2737 // Increment the pointer to the other half. 2738 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, 2739 DAG.getIntPtrConstant(IncrementSize)); 2740 // Store the lowest ExcessBits bits in the second half. 2741 Lo = DAG.getTruncStore(Ch, dl, Lo, Ptr, 2742 N->getPointerInfo().getWithOffset(IncrementSize), 2743 EVT::getIntegerVT(*DAG.getContext(), ExcessBits), 2744 isVolatile, isNonTemporal, 2745 MinAlign(Alignment, IncrementSize)); 2746 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi); 2747 } 2748 2749 SDValue DAGTypeLegalizer::ExpandIntOp_TRUNCATE(SDNode *N) { 2750 SDValue InL, InH; 2751 GetExpandedInteger(N->getOperand(0), InL, InH); 2752 // Just truncate the low part of the source. 2753 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), InL); 2754 } 2755 2756 static const fltSemantics *EVTToAPFloatSemantics(EVT VT) { 2757 switch (VT.getSimpleVT().SimpleTy) { 2758 default: llvm_unreachable("Unknown FP format"); 2759 case MVT::f32: return &APFloat::IEEEsingle; 2760 case MVT::f64: return &APFloat::IEEEdouble; 2761 case MVT::f80: return &APFloat::x87DoubleExtended; 2762 case MVT::f128: return &APFloat::IEEEquad; 2763 case MVT::ppcf128: return &APFloat::PPCDoubleDouble; 2764 } 2765 } 2766 2767 SDValue DAGTypeLegalizer::ExpandIntOp_UINT_TO_FP(SDNode *N) { 2768 SDValue Op = N->getOperand(0); 2769 EVT SrcVT = Op.getValueType(); 2770 EVT DstVT = N->getValueType(0); 2771 DebugLoc dl = N->getDebugLoc(); 2772 2773 // The following optimization is valid only if every value in SrcVT (when 2774 // treated as signed) is representable in DstVT. Check that the mantissa 2775 // size of DstVT is >= than the number of bits in SrcVT -1. 2776 const fltSemantics *sem = EVTToAPFloatSemantics(DstVT); 2777 if (APFloat::semanticsPrecision(*sem) >= SrcVT.getSizeInBits()-1 && 2778 TLI.getOperationAction(ISD::SINT_TO_FP, SrcVT) == TargetLowering::Custom){ 2779 // Do a signed conversion then adjust the result. 2780 SDValue SignedConv = DAG.getNode(ISD::SINT_TO_FP, dl, DstVT, Op); 2781 SignedConv = TLI.LowerOperation(SignedConv, DAG); 2782 2783 // The result of the signed conversion needs adjusting if the 'sign bit' of 2784 // the incoming integer was set. To handle this, we dynamically test to see 2785 // if it is set, and, if so, add a fudge factor. 2786 2787 const uint64_t F32TwoE32 = 0x4F800000ULL; 2788 const uint64_t F32TwoE64 = 0x5F800000ULL; 2789 const uint64_t F32TwoE128 = 0x7F800000ULL; 2790 2791 APInt FF(32, 0); 2792 if (SrcVT == MVT::i32) 2793 FF = APInt(32, F32TwoE32); 2794 else if (SrcVT == MVT::i64) 2795 FF = APInt(32, F32TwoE64); 2796 else if (SrcVT == MVT::i128) 2797 FF = APInt(32, F32TwoE128); 2798 else 2799 llvm_unreachable("Unsupported UINT_TO_FP!"); 2800 2801 // Check whether the sign bit is set. 2802 SDValue Lo, Hi; 2803 GetExpandedInteger(Op, Lo, Hi); 2804 SDValue SignSet = DAG.getSetCC(dl, 2805 TLI.getSetCCResultType(Hi.getValueType()), 2806 Hi, DAG.getConstant(0, Hi.getValueType()), 2807 ISD::SETLT); 2808 2809 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits. 2810 SDValue FudgePtr = DAG.getConstantPool( 2811 ConstantInt::get(*DAG.getContext(), FF.zext(64)), 2812 TLI.getPointerTy()); 2813 2814 // Get a pointer to FF if the sign bit was set, or to 0 otherwise. 2815 SDValue Zero = DAG.getIntPtrConstant(0); 2816 SDValue Four = DAG.getIntPtrConstant(4); 2817 if (TLI.isBigEndian()) std::swap(Zero, Four); 2818 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet, 2819 Zero, Four); 2820 unsigned Alignment = cast<ConstantPoolSDNode>(FudgePtr)->getAlignment(); 2821 FudgePtr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), FudgePtr, Offset); 2822 Alignment = std::min(Alignment, 4u); 2823 2824 // Load the value out, extending it from f32 to the destination float type. 2825 // FIXME: Avoid the extend by constructing the right constant pool? 2826 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, DstVT, DAG.getEntryNode(), 2827 FudgePtr, 2828 MachinePointerInfo::getConstantPool(), 2829 MVT::f32, 2830 false, false, Alignment); 2831 return DAG.getNode(ISD::FADD, dl, DstVT, SignedConv, Fudge); 2832 } 2833 2834 // Otherwise, use a libcall. 2835 RTLIB::Libcall LC = RTLIB::getUINTTOFP(SrcVT, DstVT); 2836 assert(LC != RTLIB::UNKNOWN_LIBCALL && 2837 "Don't know how to expand this UINT_TO_FP!"); 2838 return MakeLibCall(LC, DstVT, &Op, 1, true, dl); 2839 } 2840 2841 SDValue DAGTypeLegalizer::ExpandIntOp_ATOMIC_STORE(SDNode *N) { 2842 DebugLoc dl = N->getDebugLoc(); 2843 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl, 2844 cast<AtomicSDNode>(N)->getMemoryVT(), 2845 N->getOperand(0), 2846 N->getOperand(1), N->getOperand(2), 2847 cast<AtomicSDNode>(N)->getMemOperand(), 2848 cast<AtomicSDNode>(N)->getOrdering(), 2849 cast<AtomicSDNode>(N)->getSynchScope()); 2850 return Swap.getValue(1); 2851 } 2852 2853 2854 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_SUBVECTOR(SDNode *N) { 2855 SDValue InOp0 = N->getOperand(0); 2856 EVT InVT = InOp0.getValueType(); 2857 2858 EVT OutVT = N->getValueType(0); 2859 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 2860 assert(NOutVT.isVector() && "This type must be promoted to a vector type"); 2861 unsigned OutNumElems = OutVT.getVectorNumElements(); 2862 EVT NOutVTElem = NOutVT.getVectorElementType(); 2863 2864 DebugLoc dl = N->getDebugLoc(); 2865 SDValue BaseIdx = N->getOperand(1); 2866 2867 SmallVector<SDValue, 8> Ops; 2868 Ops.reserve(OutNumElems); 2869 for (unsigned i = 0; i != OutNumElems; ++i) { 2870 2871 // Extract the element from the original vector. 2872 SDValue Index = DAG.getNode(ISD::ADD, dl, BaseIdx.getValueType(), 2873 BaseIdx, DAG.getIntPtrConstant(i)); 2874 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, 2875 InVT.getVectorElementType(), N->getOperand(0), Index); 2876 2877 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, Ext); 2878 // Insert the converted element to the new vector. 2879 Ops.push_back(Op); 2880 } 2881 2882 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size()); 2883 } 2884 2885 2886 SDValue DAGTypeLegalizer::PromoteIntRes_VECTOR_SHUFFLE(SDNode *N) { 2887 ShuffleVectorSDNode *SV = cast<ShuffleVectorSDNode>(N); 2888 EVT VT = N->getValueType(0); 2889 DebugLoc dl = N->getDebugLoc(); 2890 2891 unsigned NumElts = VT.getVectorNumElements(); 2892 SmallVector<int, 8> NewMask; 2893 for (unsigned i = 0; i != NumElts; ++i) { 2894 NewMask.push_back(SV->getMaskElt(i)); 2895 } 2896 2897 SDValue V0 = GetPromotedInteger(N->getOperand(0)); 2898 SDValue V1 = GetPromotedInteger(N->getOperand(1)); 2899 EVT OutVT = V0.getValueType(); 2900 2901 return DAG.getVectorShuffle(OutVT, dl, V0, V1, &NewMask[0]); 2902 } 2903 2904 2905 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_VECTOR(SDNode *N) { 2906 EVT OutVT = N->getValueType(0); 2907 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 2908 assert(NOutVT.isVector() && "This type must be promoted to a vector type"); 2909 unsigned NumElems = N->getNumOperands(); 2910 EVT NOutVTElem = NOutVT.getVectorElementType(); 2911 2912 DebugLoc dl = N->getDebugLoc(); 2913 2914 SmallVector<SDValue, 8> Ops; 2915 Ops.reserve(NumElems); 2916 for (unsigned i = 0; i != NumElems; ++i) { 2917 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(i)); 2918 Ops.push_back(Op); 2919 } 2920 2921 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size()); 2922 } 2923 2924 SDValue DAGTypeLegalizer::PromoteIntRes_SCALAR_TO_VECTOR(SDNode *N) { 2925 2926 DebugLoc dl = N->getDebugLoc(); 2927 2928 assert(!N->getOperand(0).getValueType().isVector() && 2929 "Input must be a scalar"); 2930 2931 EVT OutVT = N->getValueType(0); 2932 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 2933 assert(NOutVT.isVector() && "This type must be promoted to a vector type"); 2934 EVT NOutVTElem = NOutVT.getVectorElementType(); 2935 2936 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(0)); 2937 2938 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NOutVT, Op); 2939 } 2940 2941 SDValue DAGTypeLegalizer::PromoteIntRes_CONCAT_VECTORS(SDNode *N) { 2942 DebugLoc dl = N->getDebugLoc(); 2943 2944 EVT OutVT = N->getValueType(0); 2945 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 2946 assert(NOutVT.isVector() && "This type must be promoted to a vector type"); 2947 2948 EVT InElemTy = OutVT.getVectorElementType(); 2949 EVT OutElemTy = NOutVT.getVectorElementType(); 2950 2951 unsigned NumElem = N->getOperand(0).getValueType().getVectorNumElements(); 2952 unsigned NumOutElem = NOutVT.getVectorNumElements(); 2953 unsigned NumOperands = N->getNumOperands(); 2954 assert(NumElem * NumOperands == NumOutElem && 2955 "Unexpected number of elements"); 2956 2957 // Take the elements from the first vector. 2958 SmallVector<SDValue, 8> Ops(NumOutElem); 2959 for (unsigned i = 0; i < NumOperands; ++i) { 2960 SDValue Op = N->getOperand(i); 2961 for (unsigned j = 0; j < NumElem; ++j) { 2962 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, 2963 InElemTy, Op, DAG.getIntPtrConstant(j)); 2964 Ops[i * NumElem + j] = DAG.getNode(ISD::ANY_EXTEND, dl, OutElemTy, Ext); 2965 } 2966 } 2967 2968 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size()); 2969 } 2970 2971 SDValue DAGTypeLegalizer::PromoteIntRes_INSERT_VECTOR_ELT(SDNode *N) { 2972 EVT OutVT = N->getValueType(0); 2973 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT); 2974 assert(NOutVT.isVector() && "This type must be promoted to a vector type"); 2975 2976 EVT NOutVTElem = NOutVT.getVectorElementType(); 2977 2978 DebugLoc dl = N->getDebugLoc(); 2979 SDValue V0 = GetPromotedInteger(N->getOperand(0)); 2980 2981 SDValue ConvElem = DAG.getNode(ISD::ANY_EXTEND, dl, 2982 NOutVTElem, N->getOperand(1)); 2983 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NOutVT, 2984 V0, ConvElem, N->getOperand(2)); 2985 } 2986 2987 SDValue DAGTypeLegalizer::PromoteIntOp_EXTRACT_VECTOR_ELT(SDNode *N) { 2988 DebugLoc dl = N->getDebugLoc(); 2989 SDValue V0 = GetPromotedInteger(N->getOperand(0)); 2990 SDValue V1 = N->getOperand(1); 2991 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, 2992 V0->getValueType(0).getScalarType(), V0, V1); 2993 2994 // EXTRACT_VECTOR_ELT can return types which are wider than the incoming 2995 // element types. If this is the case then we need to expand the outgoing 2996 // value and not truncate it. 2997 return DAG.getAnyExtOrTrunc(Ext, dl, N->getValueType(0)); 2998 } 2999 3000 SDValue DAGTypeLegalizer::PromoteIntOp_CONCAT_VECTORS(SDNode *N) { 3001 DebugLoc dl = N->getDebugLoc(); 3002 unsigned NumElems = N->getNumOperands(); 3003 3004 EVT RetSclrTy = N->getValueType(0).getVectorElementType(); 3005 3006 SmallVector<SDValue, 8> NewOps; 3007 NewOps.reserve(NumElems); 3008 3009 // For each incoming vector 3010 for (unsigned VecIdx = 0; VecIdx != NumElems; ++VecIdx) { 3011 SDValue Incoming = GetPromotedInteger(N->getOperand(VecIdx)); 3012 EVT SclrTy = Incoming->getValueType(0).getVectorElementType(); 3013 unsigned NumElem = Incoming->getValueType(0).getVectorNumElements(); 3014 3015 for (unsigned i=0; i<NumElem; ++i) { 3016 // Extract element from incoming vector 3017 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SclrTy, 3018 Incoming, DAG.getIntPtrConstant(i)); 3019 SDValue Tr = DAG.getNode(ISD::TRUNCATE, dl, RetSclrTy, Ex); 3020 NewOps.push_back(Tr); 3021 } 3022 } 3023 3024 return DAG.getNode(ISD::BUILD_VECTOR, dl, N->getValueType(0), 3025 &NewOps[0], NewOps.size()); 3026 } 3027