SelectionDAGBuilder.cpp revision 3eb67d59fcf724e8345fb783b1b891e31dcfc151
1//===-- SelectionDAGBuilder.cpp - Selection-DAG building ------------------===// 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 implements routines for translating from LLVM IR into SelectionDAG IR. 11// 12//===----------------------------------------------------------------------===// 13 14#define DEBUG_TYPE "isel" 15#include "SDNodeDbgValue.h" 16#include "SelectionDAGBuilder.h" 17#include "FunctionLoweringInfo.h" 18#include "llvm/ADT/BitVector.h" 19#include "llvm/ADT/SmallSet.h" 20#include "llvm/Analysis/AliasAnalysis.h" 21#include "llvm/Analysis/ConstantFolding.h" 22#include "llvm/Constants.h" 23#include "llvm/CallingConv.h" 24#include "llvm/DerivedTypes.h" 25#include "llvm/Function.h" 26#include "llvm/GlobalVariable.h" 27#include "llvm/InlineAsm.h" 28#include "llvm/Instructions.h" 29#include "llvm/Intrinsics.h" 30#include "llvm/IntrinsicInst.h" 31#include "llvm/LLVMContext.h" 32#include "llvm/Module.h" 33#include "llvm/CodeGen/Analysis.h" 34#include "llvm/CodeGen/FastISel.h" 35#include "llvm/CodeGen/GCStrategy.h" 36#include "llvm/CodeGen/GCMetadata.h" 37#include "llvm/CodeGen/MachineFunction.h" 38#include "llvm/CodeGen/MachineFrameInfo.h" 39#include "llvm/CodeGen/MachineInstrBuilder.h" 40#include "llvm/CodeGen/MachineJumpTableInfo.h" 41#include "llvm/CodeGen/MachineModuleInfo.h" 42#include "llvm/CodeGen/MachineRegisterInfo.h" 43#include "llvm/CodeGen/PseudoSourceValue.h" 44#include "llvm/CodeGen/SelectionDAG.h" 45#include "llvm/Analysis/DebugInfo.h" 46#include "llvm/Target/TargetRegisterInfo.h" 47#include "llvm/Target/TargetData.h" 48#include "llvm/Target/TargetFrameInfo.h" 49#include "llvm/Target/TargetInstrInfo.h" 50#include "llvm/Target/TargetIntrinsicInfo.h" 51#include "llvm/Target/TargetLowering.h" 52#include "llvm/Target/TargetOptions.h" 53#include "llvm/Support/Compiler.h" 54#include "llvm/Support/CommandLine.h" 55#include "llvm/Support/Debug.h" 56#include "llvm/Support/ErrorHandling.h" 57#include "llvm/Support/MathExtras.h" 58#include "llvm/Support/raw_ostream.h" 59#include <algorithm> 60using namespace llvm; 61 62/// LimitFloatPrecision - Generate low-precision inline sequences for 63/// some float libcalls (6, 8 or 12 bits). 64static unsigned LimitFloatPrecision; 65 66static cl::opt<unsigned, true> 67LimitFPPrecision("limit-float-precision", 68 cl::desc("Generate low-precision inline sequences " 69 "for some float libcalls"), 70 cl::location(LimitFloatPrecision), 71 cl::init(0)); 72 73namespace { 74 /// RegsForValue - This struct represents the registers (physical or virtual) 75 /// that a particular set of values is assigned, and the type information 76 /// about the value. The most common situation is to represent one value at a 77 /// time, but struct or array values are handled element-wise as multiple 78 /// values. The splitting of aggregates is performed recursively, so that we 79 /// never have aggregate-typed registers. The values at this point do not 80 /// necessarily have legal types, so each value may require one or more 81 /// registers of some legal type. 82 /// 83 struct RegsForValue { 84 /// TLI - The TargetLowering object. 85 /// 86 const TargetLowering *TLI; 87 88 /// ValueVTs - The value types of the values, which may not be legal, and 89 /// may need be promoted or synthesized from one or more registers. 90 /// 91 SmallVector<EVT, 4> ValueVTs; 92 93 /// RegVTs - The value types of the registers. This is the same size as 94 /// ValueVTs and it records, for each value, what the type of the assigned 95 /// register or registers are. (Individual values are never synthesized 96 /// from more than one type of register.) 97 /// 98 /// With virtual registers, the contents of RegVTs is redundant with TLI's 99 /// getRegisterType member function, however when with physical registers 100 /// it is necessary to have a separate record of the types. 101 /// 102 SmallVector<EVT, 4> RegVTs; 103 104 /// Regs - This list holds the registers assigned to the values. 105 /// Each legal or promoted value requires one register, and each 106 /// expanded value requires multiple registers. 107 /// 108 SmallVector<unsigned, 4> Regs; 109 110 RegsForValue() : TLI(0) {} 111 112 RegsForValue(const TargetLowering &tli, 113 const SmallVector<unsigned, 4> ®s, 114 EVT regvt, EVT valuevt) 115 : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 116 RegsForValue(const TargetLowering &tli, 117 const SmallVector<unsigned, 4> ®s, 118 const SmallVector<EVT, 4> ®vts, 119 const SmallVector<EVT, 4> &valuevts) 120 : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 121 RegsForValue(LLVMContext &Context, const TargetLowering &tli, 122 unsigned Reg, const Type *Ty) : TLI(&tli) { 123 ComputeValueVTs(tli, Ty, ValueVTs); 124 125 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 126 EVT ValueVT = ValueVTs[Value]; 127 unsigned NumRegs = TLI->getNumRegisters(Context, ValueVT); 128 EVT RegisterVT = TLI->getRegisterType(Context, ValueVT); 129 for (unsigned i = 0; i != NumRegs; ++i) 130 Regs.push_back(Reg + i); 131 RegVTs.push_back(RegisterVT); 132 Reg += NumRegs; 133 } 134 } 135 136 /// areValueTypesLegal - Return true if types of all the values are legal. 137 bool areValueTypesLegal() { 138 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 139 EVT RegisterVT = RegVTs[Value]; 140 if (!TLI->isTypeLegal(RegisterVT)) 141 return false; 142 } 143 return true; 144 } 145 146 147 /// append - Add the specified values to this one. 148 void append(const RegsForValue &RHS) { 149 TLI = RHS.TLI; 150 ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 151 RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 152 Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 153 } 154 155 156 /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 157 /// this value and returns the result as a ValueVTs value. This uses 158 /// Chain/Flag as the input and updates them for the output Chain/Flag. 159 /// If the Flag pointer is NULL, no flag is used. 160 SDValue getCopyFromRegs(SelectionDAG &DAG, DebugLoc dl, 161 SDValue &Chain, SDValue *Flag) const; 162 163 /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 164 /// specified value into the registers specified by this object. This uses 165 /// Chain/Flag as the input and updates them for the output Chain/Flag. 166 /// If the Flag pointer is NULL, no flag is used. 167 void getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl, 168 SDValue &Chain, SDValue *Flag) const; 169 170 /// AddInlineAsmOperands - Add this value to the specified inlineasm node 171 /// operand list. This adds the code marker, matching input operand index 172 /// (if applicable), and includes the number of values added into it. 173 void AddInlineAsmOperands(unsigned Kind, 174 bool HasMatching, unsigned MatchingIdx, 175 SelectionDAG &DAG, 176 std::vector<SDValue> &Ops) const; 177 }; 178} 179 180/// getCopyFromParts - Create a value that contains the specified legal parts 181/// combined into the value they represent. If the parts combine to a type 182/// larger then ValueVT then AssertOp can be used to specify whether the extra 183/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 184/// (ISD::AssertSext). 185static SDValue getCopyFromParts(SelectionDAG &DAG, DebugLoc dl, 186 const SDValue *Parts, 187 unsigned NumParts, EVT PartVT, EVT ValueVT, 188 ISD::NodeType AssertOp = ISD::DELETED_NODE) { 189 assert(NumParts > 0 && "No parts to assemble!"); 190 const TargetLowering &TLI = DAG.getTargetLoweringInfo(); 191 SDValue Val = Parts[0]; 192 193 if (NumParts > 1) { 194 // Assemble the value from multiple parts. 195 if (!ValueVT.isVector() && ValueVT.isInteger()) { 196 unsigned PartBits = PartVT.getSizeInBits(); 197 unsigned ValueBits = ValueVT.getSizeInBits(); 198 199 // Assemble the power of 2 part. 200 unsigned RoundParts = NumParts & (NumParts - 1) ? 201 1 << Log2_32(NumParts) : NumParts; 202 unsigned RoundBits = PartBits * RoundParts; 203 EVT RoundVT = RoundBits == ValueBits ? 204 ValueVT : EVT::getIntegerVT(*DAG.getContext(), RoundBits); 205 SDValue Lo, Hi; 206 207 EVT HalfVT = EVT::getIntegerVT(*DAG.getContext(), RoundBits/2); 208 209 if (RoundParts > 2) { 210 Lo = getCopyFromParts(DAG, dl, Parts, RoundParts / 2, 211 PartVT, HalfVT); 212 Hi = getCopyFromParts(DAG, dl, Parts + RoundParts / 2, 213 RoundParts / 2, PartVT, HalfVT); 214 } else { 215 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, HalfVT, Parts[0]); 216 Hi = DAG.getNode(ISD::BIT_CONVERT, dl, HalfVT, Parts[1]); 217 } 218 219 if (TLI.isBigEndian()) 220 std::swap(Lo, Hi); 221 222 Val = DAG.getNode(ISD::BUILD_PAIR, dl, RoundVT, Lo, Hi); 223 224 if (RoundParts < NumParts) { 225 // Assemble the trailing non-power-of-2 part. 226 unsigned OddParts = NumParts - RoundParts; 227 EVT OddVT = EVT::getIntegerVT(*DAG.getContext(), OddParts * PartBits); 228 Hi = getCopyFromParts(DAG, dl, 229 Parts + RoundParts, OddParts, PartVT, OddVT); 230 231 // Combine the round and odd parts. 232 Lo = Val; 233 if (TLI.isBigEndian()) 234 std::swap(Lo, Hi); 235 EVT TotalVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits); 236 Hi = DAG.getNode(ISD::ANY_EXTEND, dl, TotalVT, Hi); 237 Hi = DAG.getNode(ISD::SHL, dl, TotalVT, Hi, 238 DAG.getConstant(Lo.getValueType().getSizeInBits(), 239 TLI.getPointerTy())); 240 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, TotalVT, Lo); 241 Val = DAG.getNode(ISD::OR, dl, TotalVT, Lo, Hi); 242 } 243 } else if (ValueVT.isVector()) { 244 // Handle a multi-element vector. 245 EVT IntermediateVT, RegisterVT; 246 unsigned NumIntermediates; 247 unsigned NumRegs = 248 TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT, IntermediateVT, 249 NumIntermediates, RegisterVT); 250 assert(NumRegs == NumParts 251 && "Part count doesn't match vector breakdown!"); 252 NumParts = NumRegs; // Silence a compiler warning. 253 assert(RegisterVT == PartVT 254 && "Part type doesn't match vector breakdown!"); 255 assert(RegisterVT == Parts[0].getValueType() && 256 "Part type doesn't match part!"); 257 258 // Assemble the parts into intermediate operands. 259 SmallVector<SDValue, 8> Ops(NumIntermediates); 260 if (NumIntermediates == NumParts) { 261 // If the register was not expanded, truncate or copy the value, 262 // as appropriate. 263 for (unsigned i = 0; i != NumParts; ++i) 264 Ops[i] = getCopyFromParts(DAG, dl, &Parts[i], 1, 265 PartVT, IntermediateVT); 266 } else if (NumParts > 0) { 267 // If the intermediate type was expanded, build the intermediate 268 // operands from the parts. 269 assert(NumParts % NumIntermediates == 0 && 270 "Must expand into a divisible number of parts!"); 271 unsigned Factor = NumParts / NumIntermediates; 272 for (unsigned i = 0; i != NumIntermediates; ++i) 273 Ops[i] = getCopyFromParts(DAG, dl, &Parts[i * Factor], Factor, 274 PartVT, IntermediateVT); 275 } 276 277 // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the 278 // intermediate operands. 279 Val = DAG.getNode(IntermediateVT.isVector() ? 280 ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, dl, 281 ValueVT, &Ops[0], NumIntermediates); 282 } else if (PartVT.isFloatingPoint()) { 283 // FP split into multiple FP parts (for ppcf128) 284 assert(ValueVT == EVT(MVT::ppcf128) && PartVT == EVT(MVT::f64) && 285 "Unexpected split"); 286 SDValue Lo, Hi; 287 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, EVT(MVT::f64), Parts[0]); 288 Hi = DAG.getNode(ISD::BIT_CONVERT, dl, EVT(MVT::f64), Parts[1]); 289 if (TLI.isBigEndian()) 290 std::swap(Lo, Hi); 291 Val = DAG.getNode(ISD::BUILD_PAIR, dl, ValueVT, Lo, Hi); 292 } else { 293 // FP split into integer parts (soft fp) 294 assert(ValueVT.isFloatingPoint() && PartVT.isInteger() && 295 !PartVT.isVector() && "Unexpected split"); 296 EVT IntVT = EVT::getIntegerVT(*DAG.getContext(), ValueVT.getSizeInBits()); 297 Val = getCopyFromParts(DAG, dl, Parts, NumParts, PartVT, IntVT); 298 } 299 } 300 301 // There is now one part, held in Val. Correct it to match ValueVT. 302 PartVT = Val.getValueType(); 303 304 if (PartVT == ValueVT) 305 return Val; 306 307 if (PartVT.isVector()) { 308 assert(ValueVT.isVector() && "Unknown vector conversion!"); 309 return DAG.getNode(ISD::BIT_CONVERT, dl, ValueVT, Val); 310 } 311 312 if (ValueVT.isVector()) { 313 assert(ValueVT.getVectorElementType() == PartVT && 314 ValueVT.getVectorNumElements() == 1 && 315 "Only trivial scalar-to-vector conversions should get here!"); 316 return DAG.getNode(ISD::BUILD_VECTOR, dl, ValueVT, Val); 317 } 318 319 if (PartVT.isInteger() && 320 ValueVT.isInteger()) { 321 if (ValueVT.bitsLT(PartVT)) { 322 // For a truncate, see if we have any information to 323 // indicate whether the truncated bits will always be 324 // zero or sign-extension. 325 if (AssertOp != ISD::DELETED_NODE) 326 Val = DAG.getNode(AssertOp, dl, PartVT, Val, 327 DAG.getValueType(ValueVT)); 328 return DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val); 329 } else { 330 return DAG.getNode(ISD::ANY_EXTEND, dl, ValueVT, Val); 331 } 332 } 333 334 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 335 if (ValueVT.bitsLT(Val.getValueType())) { 336 // FP_ROUND's are always exact here. 337 return DAG.getNode(ISD::FP_ROUND, dl, ValueVT, Val, 338 DAG.getIntPtrConstant(1)); 339 } 340 341 return DAG.getNode(ISD::FP_EXTEND, dl, ValueVT, Val); 342 } 343 344 if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 345 return DAG.getNode(ISD::BIT_CONVERT, dl, ValueVT, Val); 346 347 llvm_unreachable("Unknown mismatch!"); 348 return SDValue(); 349} 350 351/// getCopyToParts - Create a series of nodes that contain the specified value 352/// split into legal parts. If the parts contain more bits than Val, then, for 353/// integers, ExtendKind can be used to specify how to generate the extra bits. 354static void getCopyToParts(SelectionDAG &DAG, DebugLoc dl, 355 SDValue Val, SDValue *Parts, unsigned NumParts, 356 EVT PartVT, 357 ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 358 const TargetLowering &TLI = DAG.getTargetLoweringInfo(); 359 EVT PtrVT = TLI.getPointerTy(); 360 EVT ValueVT = Val.getValueType(); 361 unsigned PartBits = PartVT.getSizeInBits(); 362 unsigned OrigNumParts = NumParts; 363 assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 364 365 if (!NumParts) 366 return; 367 368 if (!ValueVT.isVector()) { 369 if (PartVT == ValueVT) { 370 assert(NumParts == 1 && "No-op copy with multiple parts!"); 371 Parts[0] = Val; 372 return; 373 } 374 375 if (NumParts * PartBits > ValueVT.getSizeInBits()) { 376 // If the parts cover more bits than the value has, promote the value. 377 if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 378 assert(NumParts == 1 && "Do not know what to promote to!"); 379 Val = DAG.getNode(ISD::FP_EXTEND, dl, PartVT, Val); 380 } else if (PartVT.isInteger() && ValueVT.isInteger()) { 381 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits); 382 Val = DAG.getNode(ExtendKind, dl, ValueVT, Val); 383 } else { 384 llvm_unreachable("Unknown mismatch!"); 385 } 386 } else if (PartBits == ValueVT.getSizeInBits()) { 387 // Different types of the same size. 388 assert(NumParts == 1 && PartVT != ValueVT); 389 Val = DAG.getNode(ISD::BIT_CONVERT, dl, PartVT, Val); 390 } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 391 // If the parts cover less bits than value has, truncate the value. 392 if (PartVT.isInteger() && ValueVT.isInteger()) { 393 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits); 394 Val = DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val); 395 } else { 396 llvm_unreachable("Unknown mismatch!"); 397 } 398 } 399 400 // The value may have changed - recompute ValueVT. 401 ValueVT = Val.getValueType(); 402 assert(NumParts * PartBits == ValueVT.getSizeInBits() && 403 "Failed to tile the value with PartVT!"); 404 405 if (NumParts == 1) { 406 assert(PartVT == ValueVT && "Type conversion failed!"); 407 Parts[0] = Val; 408 return; 409 } 410 411 // Expand the value into multiple parts. 412 if (NumParts & (NumParts - 1)) { 413 // The number of parts is not a power of 2. Split off and copy the tail. 414 assert(PartVT.isInteger() && ValueVT.isInteger() && 415 "Do not know what to expand to!"); 416 unsigned RoundParts = 1 << Log2_32(NumParts); 417 unsigned RoundBits = RoundParts * PartBits; 418 unsigned OddParts = NumParts - RoundParts; 419 SDValue OddVal = DAG.getNode(ISD::SRL, dl, ValueVT, Val, 420 DAG.getConstant(RoundBits, 421 TLI.getPointerTy())); 422 getCopyToParts(DAG, dl, OddVal, Parts + RoundParts, 423 OddParts, PartVT); 424 425 if (TLI.isBigEndian()) 426 // The odd parts were reversed by getCopyToParts - unreverse them. 427 std::reverse(Parts + RoundParts, Parts + NumParts); 428 429 NumParts = RoundParts; 430 ValueVT = EVT::getIntegerVT(*DAG.getContext(), NumParts * PartBits); 431 Val = DAG.getNode(ISD::TRUNCATE, dl, ValueVT, Val); 432 } 433 434 // The number of parts is a power of 2. Repeatedly bisect the value using 435 // EXTRACT_ELEMENT. 436 Parts[0] = DAG.getNode(ISD::BIT_CONVERT, dl, 437 EVT::getIntegerVT(*DAG.getContext(), 438 ValueVT.getSizeInBits()), 439 Val); 440 441 for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 442 for (unsigned i = 0; i < NumParts; i += StepSize) { 443 unsigned ThisBits = StepSize * PartBits / 2; 444 EVT ThisVT = EVT::getIntegerVT(*DAG.getContext(), ThisBits); 445 SDValue &Part0 = Parts[i]; 446 SDValue &Part1 = Parts[i+StepSize/2]; 447 448 Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, 449 ThisVT, Part0, 450 DAG.getConstant(1, PtrVT)); 451 Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, 452 ThisVT, Part0, 453 DAG.getConstant(0, PtrVT)); 454 455 if (ThisBits == PartBits && ThisVT != PartVT) { 456 Part0 = DAG.getNode(ISD::BIT_CONVERT, dl, 457 PartVT, Part0); 458 Part1 = DAG.getNode(ISD::BIT_CONVERT, dl, 459 PartVT, Part1); 460 } 461 } 462 } 463 464 if (TLI.isBigEndian()) 465 std::reverse(Parts, Parts + OrigNumParts); 466 467 return; 468 } 469 470 // Vector ValueVT. 471 if (NumParts == 1) { 472 if (PartVT != ValueVT) { 473 if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) { 474 Val = DAG.getNode(ISD::BIT_CONVERT, dl, PartVT, Val); 475 } else { 476 assert(ValueVT.getVectorElementType() == PartVT && 477 ValueVT.getVectorNumElements() == 1 && 478 "Only trivial vector-to-scalar conversions should get here!"); 479 Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, 480 PartVT, Val, 481 DAG.getConstant(0, PtrVT)); 482 } 483 } 484 485 Parts[0] = Val; 486 return; 487 } 488 489 // Handle a multi-element vector. 490 EVT IntermediateVT, RegisterVT; 491 unsigned NumIntermediates; 492 unsigned NumRegs = TLI.getVectorTypeBreakdown(*DAG.getContext(), ValueVT, 493 IntermediateVT, NumIntermediates, RegisterVT); 494 unsigned NumElements = ValueVT.getVectorNumElements(); 495 496 assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 497 NumParts = NumRegs; // Silence a compiler warning. 498 assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 499 500 // Split the vector into intermediate operands. 501 SmallVector<SDValue, 8> Ops(NumIntermediates); 502 for (unsigned i = 0; i != NumIntermediates; ++i) { 503 if (IntermediateVT.isVector()) 504 Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, 505 IntermediateVT, Val, 506 DAG.getConstant(i * (NumElements / NumIntermediates), 507 PtrVT)); 508 else 509 Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, 510 IntermediateVT, Val, 511 DAG.getConstant(i, PtrVT)); 512 } 513 514 // Split the intermediate operands into legal parts. 515 if (NumParts == NumIntermediates) { 516 // If the register was not expanded, promote or copy the value, 517 // as appropriate. 518 for (unsigned i = 0; i != NumParts; ++i) 519 getCopyToParts(DAG, dl, Ops[i], &Parts[i], 1, PartVT); 520 } else if (NumParts > 0) { 521 // If the intermediate type was expanded, split each the value into 522 // legal parts. 523 assert(NumParts % NumIntermediates == 0 && 524 "Must expand into a divisible number of parts!"); 525 unsigned Factor = NumParts / NumIntermediates; 526 for (unsigned i = 0; i != NumIntermediates; ++i) 527 getCopyToParts(DAG, dl, Ops[i], &Parts[i*Factor], Factor, PartVT); 528 } 529} 530 531 532void SelectionDAGBuilder::init(GCFunctionInfo *gfi, AliasAnalysis &aa) { 533 AA = &aa; 534 GFI = gfi; 535 TD = DAG.getTarget().getTargetData(); 536} 537 538/// clear - Clear out the current SelectionDAG and the associated 539/// state and prepare this SelectionDAGBuilder object to be used 540/// for a new block. This doesn't clear out information about 541/// additional blocks that are needed to complete switch lowering 542/// or PHI node updating; that information is cleared out as it is 543/// consumed. 544void SelectionDAGBuilder::clear() { 545 NodeMap.clear(); 546 PendingLoads.clear(); 547 PendingExports.clear(); 548 CurDebugLoc = DebugLoc(); 549 HasTailCall = false; 550} 551 552/// getRoot - Return the current virtual root of the Selection DAG, 553/// flushing any PendingLoad items. This must be done before emitting 554/// a store or any other node that may need to be ordered after any 555/// prior load instructions. 556/// 557SDValue SelectionDAGBuilder::getRoot() { 558 if (PendingLoads.empty()) 559 return DAG.getRoot(); 560 561 if (PendingLoads.size() == 1) { 562 SDValue Root = PendingLoads[0]; 563 DAG.setRoot(Root); 564 PendingLoads.clear(); 565 return Root; 566 } 567 568 // Otherwise, we have to make a token factor node. 569 SDValue Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other, 570 &PendingLoads[0], PendingLoads.size()); 571 PendingLoads.clear(); 572 DAG.setRoot(Root); 573 return Root; 574} 575 576/// getControlRoot - Similar to getRoot, but instead of flushing all the 577/// PendingLoad items, flush all the PendingExports items. It is necessary 578/// to do this before emitting a terminator instruction. 579/// 580SDValue SelectionDAGBuilder::getControlRoot() { 581 SDValue Root = DAG.getRoot(); 582 583 if (PendingExports.empty()) 584 return Root; 585 586 // Turn all of the CopyToReg chains into one factored node. 587 if (Root.getOpcode() != ISD::EntryToken) { 588 unsigned i = 0, e = PendingExports.size(); 589 for (; i != e; ++i) { 590 assert(PendingExports[i].getNode()->getNumOperands() > 1); 591 if (PendingExports[i].getNode()->getOperand(0) == Root) 592 break; // Don't add the root if we already indirectly depend on it. 593 } 594 595 if (i == e) 596 PendingExports.push_back(Root); 597 } 598 599 Root = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other, 600 &PendingExports[0], 601 PendingExports.size()); 602 PendingExports.clear(); 603 DAG.setRoot(Root); 604 return Root; 605} 606 607void SelectionDAGBuilder::AssignOrderingToNode(const SDNode *Node) { 608 if (DAG.GetOrdering(Node) != 0) return; // Already has ordering. 609 DAG.AssignOrdering(Node, SDNodeOrder); 610 611 for (unsigned I = 0, E = Node->getNumOperands(); I != E; ++I) 612 AssignOrderingToNode(Node->getOperand(I).getNode()); 613} 614 615void SelectionDAGBuilder::visit(const Instruction &I) { 616 // Set up outgoing PHI node register values before emitting the terminator. 617 if (isa<TerminatorInst>(&I)) 618 HandlePHINodesInSuccessorBlocks(I.getParent()); 619 620 CurDebugLoc = I.getDebugLoc(); 621 622 visit(I.getOpcode(), I); 623 624 if (!isa<TerminatorInst>(&I) && !HasTailCall) 625 CopyToExportRegsIfNeeded(&I); 626 627 CurDebugLoc = DebugLoc(); 628} 629 630void SelectionDAGBuilder::visitPHI(const PHINode &) { 631 llvm_unreachable("SelectionDAGBuilder shouldn't visit PHI nodes!"); 632} 633 634void SelectionDAGBuilder::visit(unsigned Opcode, const User &I) { 635 // Note: this doesn't use InstVisitor, because it has to work with 636 // ConstantExpr's in addition to instructions. 637 switch (Opcode) { 638 default: llvm_unreachable("Unknown instruction type encountered!"); 639 // Build the switch statement using the Instruction.def file. 640#define HANDLE_INST(NUM, OPCODE, CLASS) \ 641 case Instruction::OPCODE: visit##OPCODE((CLASS&)I); break; 642#include "llvm/Instruction.def" 643 } 644 645 // Assign the ordering to the freshly created DAG nodes. 646 if (NodeMap.count(&I)) { 647 ++SDNodeOrder; 648 AssignOrderingToNode(getValue(&I).getNode()); 649 } 650} 651 652SDValue SelectionDAGBuilder::getValue(const Value *V) { 653 SDValue &N = NodeMap[V]; 654 if (N.getNode()) return N; 655 656 if (const Constant *C = dyn_cast<Constant>(V)) { 657 EVT VT = TLI.getValueType(V->getType(), true); 658 659 if (const ConstantInt *CI = dyn_cast<ConstantInt>(C)) 660 return N = DAG.getConstant(*CI, VT); 661 662 if (const GlobalValue *GV = dyn_cast<GlobalValue>(C)) 663 return N = DAG.getGlobalAddress(GV, VT); 664 665 if (isa<ConstantPointerNull>(C)) 666 return N = DAG.getConstant(0, TLI.getPointerTy()); 667 668 if (const ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 669 return N = DAG.getConstantFP(*CFP, VT); 670 671 if (isa<UndefValue>(C) && !V->getType()->isAggregateType()) 672 return N = DAG.getUNDEF(VT); 673 674 if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 675 visit(CE->getOpcode(), *CE); 676 SDValue N1 = NodeMap[V]; 677 assert(N1.getNode() && "visit didn't populate the NodeMap!"); 678 return N1; 679 } 680 681 if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 682 SmallVector<SDValue, 4> Constants; 683 for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 684 OI != OE; ++OI) { 685 SDNode *Val = getValue(*OI).getNode(); 686 // If the operand is an empty aggregate, there are no values. 687 if (!Val) continue; 688 // Add each leaf value from the operand to the Constants list 689 // to form a flattened list of all the values. 690 for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 691 Constants.push_back(SDValue(Val, i)); 692 } 693 694 return DAG.getMergeValues(&Constants[0], Constants.size(), 695 getCurDebugLoc()); 696 } 697 698 if (C->getType()->isStructTy() || C->getType()->isArrayTy()) { 699 assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 700 "Unknown struct or array constant!"); 701 702 SmallVector<EVT, 4> ValueVTs; 703 ComputeValueVTs(TLI, C->getType(), ValueVTs); 704 unsigned NumElts = ValueVTs.size(); 705 if (NumElts == 0) 706 return SDValue(); // empty struct 707 SmallVector<SDValue, 4> Constants(NumElts); 708 for (unsigned i = 0; i != NumElts; ++i) { 709 EVT EltVT = ValueVTs[i]; 710 if (isa<UndefValue>(C)) 711 Constants[i] = DAG.getUNDEF(EltVT); 712 else if (EltVT.isFloatingPoint()) 713 Constants[i] = DAG.getConstantFP(0, EltVT); 714 else 715 Constants[i] = DAG.getConstant(0, EltVT); 716 } 717 718 return DAG.getMergeValues(&Constants[0], NumElts, 719 getCurDebugLoc()); 720 } 721 722 if (const BlockAddress *BA = dyn_cast<BlockAddress>(C)) 723 return DAG.getBlockAddress(BA, VT); 724 725 const VectorType *VecTy = cast<VectorType>(V->getType()); 726 unsigned NumElements = VecTy->getNumElements(); 727 728 // Now that we know the number and type of the elements, get that number of 729 // elements into the Ops array based on what kind of constant it is. 730 SmallVector<SDValue, 16> Ops; 731 if (const ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 732 for (unsigned i = 0; i != NumElements; ++i) 733 Ops.push_back(getValue(CP->getOperand(i))); 734 } else { 735 assert(isa<ConstantAggregateZero>(C) && "Unknown vector constant!"); 736 EVT EltVT = TLI.getValueType(VecTy->getElementType()); 737 738 SDValue Op; 739 if (EltVT.isFloatingPoint()) 740 Op = DAG.getConstantFP(0, EltVT); 741 else 742 Op = DAG.getConstant(0, EltVT); 743 Ops.assign(NumElements, Op); 744 } 745 746 // Create a BUILD_VECTOR node. 747 return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(), 748 VT, &Ops[0], Ops.size()); 749 } 750 751 // If this is a static alloca, generate it as the frameindex instead of 752 // computation. 753 if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 754 DenseMap<const AllocaInst*, int>::iterator SI = 755 FuncInfo.StaticAllocaMap.find(AI); 756 if (SI != FuncInfo.StaticAllocaMap.end()) 757 return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 758 } 759 760 unsigned InReg = FuncInfo.ValueMap[V]; 761 assert(InReg && "Value not in map!"); 762 763 RegsForValue RFV(*DAG.getContext(), TLI, InReg, V->getType()); 764 SDValue Chain = DAG.getEntryNode(); 765 return RFV.getCopyFromRegs(DAG, getCurDebugLoc(), Chain, NULL); 766} 767 768/// Get the EVTs and ArgFlags collections that represent the legalized return 769/// type of the given function. This does not require a DAG or a return value, 770/// and is suitable for use before any DAGs for the function are constructed. 771static void getReturnInfo(const Type* ReturnType, 772 Attributes attr, SmallVectorImpl<EVT> &OutVTs, 773 SmallVectorImpl<ISD::ArgFlagsTy> &OutFlags, 774 const TargetLowering &TLI, 775 SmallVectorImpl<uint64_t> *Offsets = 0) { 776 SmallVector<EVT, 4> ValueVTs; 777 ComputeValueVTs(TLI, ReturnType, ValueVTs); 778 unsigned NumValues = ValueVTs.size(); 779 if (NumValues == 0) return; 780 unsigned Offset = 0; 781 782 for (unsigned j = 0, f = NumValues; j != f; ++j) { 783 EVT VT = ValueVTs[j]; 784 ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 785 786 if (attr & Attribute::SExt) 787 ExtendKind = ISD::SIGN_EXTEND; 788 else if (attr & Attribute::ZExt) 789 ExtendKind = ISD::ZERO_EXTEND; 790 791 // FIXME: C calling convention requires the return type to be promoted to 792 // at least 32-bit. But this is not necessary for non-C calling 793 // conventions. The frontend should mark functions whose return values 794 // require promoting with signext or zeroext attributes. 795 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) { 796 EVT MinVT = TLI.getRegisterType(ReturnType->getContext(), MVT::i32); 797 if (VT.bitsLT(MinVT)) 798 VT = MinVT; 799 } 800 801 unsigned NumParts = TLI.getNumRegisters(ReturnType->getContext(), VT); 802 EVT PartVT = TLI.getRegisterType(ReturnType->getContext(), VT); 803 unsigned PartSize = TLI.getTargetData()->getTypeAllocSize( 804 PartVT.getTypeForEVT(ReturnType->getContext())); 805 806 // 'inreg' on function refers to return value 807 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy(); 808 if (attr & Attribute::InReg) 809 Flags.setInReg(); 810 811 // Propagate extension type if any 812 if (attr & Attribute::SExt) 813 Flags.setSExt(); 814 else if (attr & Attribute::ZExt) 815 Flags.setZExt(); 816 817 for (unsigned i = 0; i < NumParts; ++i) { 818 OutVTs.push_back(PartVT); 819 OutFlags.push_back(Flags); 820 if (Offsets) 821 { 822 Offsets->push_back(Offset); 823 Offset += PartSize; 824 } 825 } 826 } 827} 828 829void SelectionDAGBuilder::visitRet(const ReturnInst &I) { 830 SDValue Chain = getControlRoot(); 831 SmallVector<ISD::OutputArg, 8> Outs; 832 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 833 834 if (!FLI.CanLowerReturn) { 835 unsigned DemoteReg = FLI.DemoteRegister; 836 const Function *F = I.getParent()->getParent(); 837 838 // Emit a store of the return value through the virtual register. 839 // Leave Outs empty so that LowerReturn won't try to load return 840 // registers the usual way. 841 SmallVector<EVT, 1> PtrValueVTs; 842 ComputeValueVTs(TLI, PointerType::getUnqual(F->getReturnType()), 843 PtrValueVTs); 844 845 SDValue RetPtr = DAG.getRegister(DemoteReg, PtrValueVTs[0]); 846 SDValue RetOp = getValue(I.getOperand(0)); 847 848 SmallVector<EVT, 4> ValueVTs; 849 SmallVector<uint64_t, 4> Offsets; 850 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs, &Offsets); 851 unsigned NumValues = ValueVTs.size(); 852 853 SmallVector<SDValue, 4> Chains(NumValues); 854 EVT PtrVT = PtrValueVTs[0]; 855 for (unsigned i = 0; i != NumValues; ++i) { 856 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT, RetPtr, 857 DAG.getConstant(Offsets[i], PtrVT)); 858 Chains[i] = 859 DAG.getStore(Chain, getCurDebugLoc(), 860 SDValue(RetOp.getNode(), RetOp.getResNo() + i), 861 Add, NULL, Offsets[i], false, false, 0); 862 } 863 864 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), 865 MVT::Other, &Chains[0], NumValues); 866 } else if (I.getNumOperands() != 0) { 867 SmallVector<EVT, 4> ValueVTs; 868 ComputeValueVTs(TLI, I.getOperand(0)->getType(), ValueVTs); 869 unsigned NumValues = ValueVTs.size(); 870 if (NumValues) { 871 SDValue RetOp = getValue(I.getOperand(0)); 872 for (unsigned j = 0, f = NumValues; j != f; ++j) { 873 EVT VT = ValueVTs[j]; 874 875 ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 876 877 const Function *F = I.getParent()->getParent(); 878 if (F->paramHasAttr(0, Attribute::SExt)) 879 ExtendKind = ISD::SIGN_EXTEND; 880 else if (F->paramHasAttr(0, Attribute::ZExt)) 881 ExtendKind = ISD::ZERO_EXTEND; 882 883 // FIXME: C calling convention requires the return type to be promoted 884 // to at least 32-bit. But this is not necessary for non-C calling 885 // conventions. The frontend should mark functions whose return values 886 // require promoting with signext or zeroext attributes. 887 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) { 888 EVT MinVT = TLI.getRegisterType(*DAG.getContext(), MVT::i32); 889 if (VT.bitsLT(MinVT)) 890 VT = MinVT; 891 } 892 893 unsigned NumParts = TLI.getNumRegisters(*DAG.getContext(), VT); 894 EVT PartVT = TLI.getRegisterType(*DAG.getContext(), VT); 895 SmallVector<SDValue, 4> Parts(NumParts); 896 getCopyToParts(DAG, getCurDebugLoc(), 897 SDValue(RetOp.getNode(), RetOp.getResNo() + j), 898 &Parts[0], NumParts, PartVT, ExtendKind); 899 900 // 'inreg' on function refers to return value 901 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy(); 902 if (F->paramHasAttr(0, Attribute::InReg)) 903 Flags.setInReg(); 904 905 // Propagate extension type if any 906 if (F->paramHasAttr(0, Attribute::SExt)) 907 Flags.setSExt(); 908 else if (F->paramHasAttr(0, Attribute::ZExt)) 909 Flags.setZExt(); 910 911 for (unsigned i = 0; i < NumParts; ++i) 912 Outs.push_back(ISD::OutputArg(Flags, Parts[i], /*isfixed=*/true)); 913 } 914 } 915 } 916 917 bool isVarArg = DAG.getMachineFunction().getFunction()->isVarArg(); 918 CallingConv::ID CallConv = 919 DAG.getMachineFunction().getFunction()->getCallingConv(); 920 Chain = TLI.LowerReturn(Chain, CallConv, isVarArg, 921 Outs, getCurDebugLoc(), DAG); 922 923 // Verify that the target's LowerReturn behaved as expected. 924 assert(Chain.getNode() && Chain.getValueType() == MVT::Other && 925 "LowerReturn didn't return a valid chain!"); 926 927 // Update the DAG with the new chain value resulting from return lowering. 928 DAG.setRoot(Chain); 929} 930 931/// CopyToExportRegsIfNeeded - If the given value has virtual registers 932/// created for it, emit nodes to copy the value into the virtual 933/// registers. 934void SelectionDAGBuilder::CopyToExportRegsIfNeeded(const Value *V) { 935 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V); 936 if (VMI != FuncInfo.ValueMap.end()) { 937 assert(!V->use_empty() && "Unused value assigned virtual registers!"); 938 CopyValueToVirtualRegister(V, VMI->second); 939 } 940} 941 942/// ExportFromCurrentBlock - If this condition isn't known to be exported from 943/// the current basic block, add it to ValueMap now so that we'll get a 944/// CopyTo/FromReg. 945void SelectionDAGBuilder::ExportFromCurrentBlock(const Value *V) { 946 // No need to export constants. 947 if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 948 949 // Already exported? 950 if (FuncInfo.isExportedInst(V)) return; 951 952 unsigned Reg = FuncInfo.InitializeRegForValue(V); 953 CopyValueToVirtualRegister(V, Reg); 954} 955 956bool SelectionDAGBuilder::isExportableFromCurrentBlock(const Value *V, 957 const BasicBlock *FromBB) { 958 // The operands of the setcc have to be in this block. We don't know 959 // how to export them from some other block. 960 if (const Instruction *VI = dyn_cast<Instruction>(V)) { 961 // Can export from current BB. 962 if (VI->getParent() == FromBB) 963 return true; 964 965 // Is already exported, noop. 966 return FuncInfo.isExportedInst(V); 967 } 968 969 // If this is an argument, we can export it if the BB is the entry block or 970 // if it is already exported. 971 if (isa<Argument>(V)) { 972 if (FromBB == &FromBB->getParent()->getEntryBlock()) 973 return true; 974 975 // Otherwise, can only export this if it is already exported. 976 return FuncInfo.isExportedInst(V); 977 } 978 979 // Otherwise, constants can always be exported. 980 return true; 981} 982 983static bool InBlock(const Value *V, const BasicBlock *BB) { 984 if (const Instruction *I = dyn_cast<Instruction>(V)) 985 return I->getParent() == BB; 986 return true; 987} 988 989/// EmitBranchForMergedCondition - Helper method for FindMergedConditions. 990/// This function emits a branch and is used at the leaves of an OR or an 991/// AND operator tree. 992/// 993void 994SelectionDAGBuilder::EmitBranchForMergedCondition(const Value *Cond, 995 MachineBasicBlock *TBB, 996 MachineBasicBlock *FBB, 997 MachineBasicBlock *CurBB, 998 MachineBasicBlock *SwitchBB) { 999 const BasicBlock *BB = CurBB->getBasicBlock(); 1000 1001 // If the leaf of the tree is a comparison, merge the condition into 1002 // the caseblock. 1003 if (const CmpInst *BOp = dyn_cast<CmpInst>(Cond)) { 1004 // The operands of the cmp have to be in this block. We don't know 1005 // how to export them from some other block. If this is the first block 1006 // of the sequence, no exporting is needed. 1007 if (CurBB == SwitchBB || 1008 (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 1009 isExportableFromCurrentBlock(BOp->getOperand(1), BB))) { 1010 ISD::CondCode Condition; 1011 if (const ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1012 Condition = getICmpCondCode(IC->getPredicate()); 1013 } else if (const FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1014 Condition = getFCmpCondCode(FC->getPredicate()); 1015 } else { 1016 Condition = ISD::SETEQ; // silence warning. 1017 llvm_unreachable("Unknown compare instruction"); 1018 } 1019 1020 CaseBlock CB(Condition, BOp->getOperand(0), 1021 BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1022 SwitchCases.push_back(CB); 1023 return; 1024 } 1025 } 1026 1027 // Create a CaseBlock record representing this branch. 1028 CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(*DAG.getContext()), 1029 NULL, TBB, FBB, CurBB); 1030 SwitchCases.push_back(CB); 1031} 1032 1033/// FindMergedConditions - If Cond is an expression like 1034void SelectionDAGBuilder::FindMergedConditions(const Value *Cond, 1035 MachineBasicBlock *TBB, 1036 MachineBasicBlock *FBB, 1037 MachineBasicBlock *CurBB, 1038 MachineBasicBlock *SwitchBB, 1039 unsigned Opc) { 1040 // If this node is not part of the or/and tree, emit it as a branch. 1041 const Instruction *BOp = dyn_cast<Instruction>(Cond); 1042 if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1043 (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 1044 BOp->getParent() != CurBB->getBasicBlock() || 1045 !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 1046 !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1047 EmitBranchForMergedCondition(Cond, TBB, FBB, CurBB, SwitchBB); 1048 return; 1049 } 1050 1051 // Create TmpBB after CurBB. 1052 MachineFunction::iterator BBI = CurBB; 1053 MachineFunction &MF = DAG.getMachineFunction(); 1054 MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 1055 CurBB->getParent()->insert(++BBI, TmpBB); 1056 1057 if (Opc == Instruction::Or) { 1058 // Codegen X | Y as: 1059 // jmp_if_X TBB 1060 // jmp TmpBB 1061 // TmpBB: 1062 // jmp_if_Y TBB 1063 // jmp FBB 1064 // 1065 1066 // Emit the LHS condition. 1067 FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, SwitchBB, Opc); 1068 1069 // Emit the RHS condition into TmpBB. 1070 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc); 1071 } else { 1072 assert(Opc == Instruction::And && "Unknown merge op!"); 1073 // Codegen X & Y as: 1074 // jmp_if_X TmpBB 1075 // jmp FBB 1076 // TmpBB: 1077 // jmp_if_Y TBB 1078 // jmp FBB 1079 // 1080 // This requires creation of TmpBB after CurBB. 1081 1082 // Emit the LHS condition. 1083 FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, SwitchBB, Opc); 1084 1085 // Emit the RHS condition into TmpBB. 1086 FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, SwitchBB, Opc); 1087 } 1088} 1089 1090/// If the set of cases should be emitted as a series of branches, return true. 1091/// If we should emit this as a bunch of and/or'd together conditions, return 1092/// false. 1093bool 1094SelectionDAGBuilder::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases){ 1095 if (Cases.size() != 2) return true; 1096 1097 // If this is two comparisons of the same values or'd or and'd together, they 1098 // will get folded into a single comparison, so don't emit two blocks. 1099 if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 1100 Cases[0].CmpRHS == Cases[1].CmpRHS) || 1101 (Cases[0].CmpRHS == Cases[1].CmpLHS && 1102 Cases[0].CmpLHS == Cases[1].CmpRHS)) { 1103 return false; 1104 } 1105 1106 // Handle: (X != null) | (Y != null) --> (X|Y) != 0 1107 // Handle: (X == null) & (Y == null) --> (X|Y) == 0 1108 if (Cases[0].CmpRHS == Cases[1].CmpRHS && 1109 Cases[0].CC == Cases[1].CC && 1110 isa<Constant>(Cases[0].CmpRHS) && 1111 cast<Constant>(Cases[0].CmpRHS)->isNullValue()) { 1112 if (Cases[0].CC == ISD::SETEQ && Cases[0].TrueBB == Cases[1].ThisBB) 1113 return false; 1114 if (Cases[0].CC == ISD::SETNE && Cases[0].FalseBB == Cases[1].ThisBB) 1115 return false; 1116 } 1117 1118 return true; 1119} 1120 1121void SelectionDAGBuilder::visitBr(const BranchInst &I) { 1122 MachineBasicBlock *BrMBB = FuncInfo.MBBMap[I.getParent()]; 1123 1124 // Update machine-CFG edges. 1125 MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 1126 1127 // Figure out which block is immediately after the current one. 1128 MachineBasicBlock *NextBlock = 0; 1129 MachineFunction::iterator BBI = BrMBB; 1130 if (++BBI != FuncInfo.MF->end()) 1131 NextBlock = BBI; 1132 1133 if (I.isUnconditional()) { 1134 // Update machine-CFG edges. 1135 BrMBB->addSuccessor(Succ0MBB); 1136 1137 // If this is not a fall-through branch, emit the branch. 1138 if (Succ0MBB != NextBlock) 1139 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), 1140 MVT::Other, getControlRoot(), 1141 DAG.getBasicBlock(Succ0MBB))); 1142 1143 return; 1144 } 1145 1146 // If this condition is one of the special cases we handle, do special stuff 1147 // now. 1148 const Value *CondVal = I.getCondition(); 1149 MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1150 1151 // If this is a series of conditions that are or'd or and'd together, emit 1152 // this as a sequence of branches instead of setcc's with and/or operations. 1153 // For example, instead of something like: 1154 // cmp A, B 1155 // C = seteq 1156 // cmp D, E 1157 // F = setle 1158 // or C, F 1159 // jnz foo 1160 // Emit: 1161 // cmp A, B 1162 // je foo 1163 // cmp D, E 1164 // jle foo 1165 // 1166 if (const BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1167 if (BOp->hasOneUse() && 1168 (BOp->getOpcode() == Instruction::And || 1169 BOp->getOpcode() == Instruction::Or)) { 1170 FindMergedConditions(BOp, Succ0MBB, Succ1MBB, BrMBB, BrMBB, 1171 BOp->getOpcode()); 1172 // If the compares in later blocks need to use values not currently 1173 // exported from this block, export them now. This block should always 1174 // be the first entry. 1175 assert(SwitchCases[0].ThisBB == BrMBB && "Unexpected lowering!"); 1176 1177 // Allow some cases to be rejected. 1178 if (ShouldEmitAsBranches(SwitchCases)) { 1179 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1180 ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1181 ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1182 } 1183 1184 // Emit the branch for this block. 1185 visitSwitchCase(SwitchCases[0], BrMBB); 1186 SwitchCases.erase(SwitchCases.begin()); 1187 return; 1188 } 1189 1190 // Okay, we decided not to do this, remove any inserted MBB's and clear 1191 // SwitchCases. 1192 for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 1193 FuncInfo.MF->erase(SwitchCases[i].ThisBB); 1194 1195 SwitchCases.clear(); 1196 } 1197 } 1198 1199 // Create a CaseBlock record representing this branch. 1200 CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(*DAG.getContext()), 1201 NULL, Succ0MBB, Succ1MBB, BrMBB); 1202 1203 // Use visitSwitchCase to actually insert the fast branch sequence for this 1204 // cond branch. 1205 visitSwitchCase(CB, BrMBB); 1206} 1207 1208/// visitSwitchCase - Emits the necessary code to represent a single node in 1209/// the binary search tree resulting from lowering a switch instruction. 1210void SelectionDAGBuilder::visitSwitchCase(CaseBlock &CB, 1211 MachineBasicBlock *SwitchBB) { 1212 SDValue Cond; 1213 SDValue CondLHS = getValue(CB.CmpLHS); 1214 DebugLoc dl = getCurDebugLoc(); 1215 1216 // Build the setcc now. 1217 if (CB.CmpMHS == NULL) { 1218 // Fold "(X == true)" to X and "(X == false)" to !X to 1219 // handle common cases produced by branch lowering. 1220 if (CB.CmpRHS == ConstantInt::getTrue(*DAG.getContext()) && 1221 CB.CC == ISD::SETEQ) 1222 Cond = CondLHS; 1223 else if (CB.CmpRHS == ConstantInt::getFalse(*DAG.getContext()) && 1224 CB.CC == ISD::SETEQ) { 1225 SDValue True = DAG.getConstant(1, CondLHS.getValueType()); 1226 Cond = DAG.getNode(ISD::XOR, dl, CondLHS.getValueType(), CondLHS, True); 1227 } else 1228 Cond = DAG.getSetCC(dl, MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 1229 } else { 1230 assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 1231 1232 const APInt& Low = cast<ConstantInt>(CB.CmpLHS)->getValue(); 1233 const APInt& High = cast<ConstantInt>(CB.CmpRHS)->getValue(); 1234 1235 SDValue CmpOp = getValue(CB.CmpMHS); 1236 EVT VT = CmpOp.getValueType(); 1237 1238 if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 1239 Cond = DAG.getSetCC(dl, MVT::i1, CmpOp, DAG.getConstant(High, VT), 1240 ISD::SETLE); 1241 } else { 1242 SDValue SUB = DAG.getNode(ISD::SUB, dl, 1243 VT, CmpOp, DAG.getConstant(Low, VT)); 1244 Cond = DAG.getSetCC(dl, MVT::i1, SUB, 1245 DAG.getConstant(High-Low, VT), ISD::SETULE); 1246 } 1247 } 1248 1249 // Update successor info 1250 SwitchBB->addSuccessor(CB.TrueBB); 1251 SwitchBB->addSuccessor(CB.FalseBB); 1252 1253 // Set NextBlock to be the MBB immediately after the current one, if any. 1254 // This is used to avoid emitting unnecessary branches to the next block. 1255 MachineBasicBlock *NextBlock = 0; 1256 MachineFunction::iterator BBI = SwitchBB; 1257 if (++BBI != FuncInfo.MF->end()) 1258 NextBlock = BBI; 1259 1260 // If the lhs block is the next block, invert the condition so that we can 1261 // fall through to the lhs instead of the rhs block. 1262 if (CB.TrueBB == NextBlock) { 1263 std::swap(CB.TrueBB, CB.FalseBB); 1264 SDValue True = DAG.getConstant(1, Cond.getValueType()); 1265 Cond = DAG.getNode(ISD::XOR, dl, Cond.getValueType(), Cond, True); 1266 } 1267 1268 SDValue BrCond = DAG.getNode(ISD::BRCOND, dl, 1269 MVT::Other, getControlRoot(), Cond, 1270 DAG.getBasicBlock(CB.TrueBB)); 1271 1272 // If the branch was constant folded, fix up the CFG. 1273 if (BrCond.getOpcode() == ISD::BR) { 1274 SwitchBB->removeSuccessor(CB.FalseBB); 1275 } else { 1276 // Otherwise, go ahead and insert the false branch. 1277 if (BrCond == getControlRoot()) 1278 SwitchBB->removeSuccessor(CB.TrueBB); 1279 1280 if (CB.FalseBB != NextBlock) 1281 BrCond = DAG.getNode(ISD::BR, dl, MVT::Other, BrCond, 1282 DAG.getBasicBlock(CB.FalseBB)); 1283 } 1284 1285 DAG.setRoot(BrCond); 1286} 1287 1288/// visitJumpTable - Emit JumpTable node in the current MBB 1289void SelectionDAGBuilder::visitJumpTable(JumpTable &JT) { 1290 // Emit the code for the jump table 1291 assert(JT.Reg != -1U && "Should lower JT Header first!"); 1292 EVT PTy = TLI.getPointerTy(); 1293 SDValue Index = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(), 1294 JT.Reg, PTy); 1295 SDValue Table = DAG.getJumpTable(JT.JTI, PTy); 1296 SDValue BrJumpTable = DAG.getNode(ISD::BR_JT, getCurDebugLoc(), 1297 MVT::Other, Index.getValue(1), 1298 Table, Index); 1299 DAG.setRoot(BrJumpTable); 1300} 1301 1302/// visitJumpTableHeader - This function emits necessary code to produce index 1303/// in the JumpTable from switch case. 1304void SelectionDAGBuilder::visitJumpTableHeader(JumpTable &JT, 1305 JumpTableHeader &JTH, 1306 MachineBasicBlock *SwitchBB) { 1307 // Subtract the lowest switch case value from the value being switched on and 1308 // conditional branch to default mbb if the result is greater than the 1309 // difference between smallest and largest cases. 1310 SDValue SwitchOp = getValue(JTH.SValue); 1311 EVT VT = SwitchOp.getValueType(); 1312 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp, 1313 DAG.getConstant(JTH.First, VT)); 1314 1315 // The SDNode we just created, which holds the value being switched on minus 1316 // the smallest case value, needs to be copied to a virtual register so it 1317 // can be used as an index into the jump table in a subsequent basic block. 1318 // This value may be smaller or larger than the target's pointer type, and 1319 // therefore require extension or truncating. 1320 SwitchOp = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), TLI.getPointerTy()); 1321 1322 unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1323 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(), 1324 JumpTableReg, SwitchOp); 1325 JT.Reg = JumpTableReg; 1326 1327 // Emit the range check for the jump table, and branch to the default block 1328 // for the switch statement if the value being switched on exceeds the largest 1329 // case in the switch. 1330 SDValue CMP = DAG.getSetCC(getCurDebugLoc(), 1331 TLI.getSetCCResultType(Sub.getValueType()), Sub, 1332 DAG.getConstant(JTH.Last-JTH.First,VT), 1333 ISD::SETUGT); 1334 1335 // Set NextBlock to be the MBB immediately after the current one, if any. 1336 // This is used to avoid emitting unnecessary branches to the next block. 1337 MachineBasicBlock *NextBlock = 0; 1338 MachineFunction::iterator BBI = SwitchBB; 1339 1340 if (++BBI != FuncInfo.MF->end()) 1341 NextBlock = BBI; 1342 1343 SDValue BrCond = DAG.getNode(ISD::BRCOND, getCurDebugLoc(), 1344 MVT::Other, CopyTo, CMP, 1345 DAG.getBasicBlock(JT.Default)); 1346 1347 if (JT.MBB != NextBlock) 1348 BrCond = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrCond, 1349 DAG.getBasicBlock(JT.MBB)); 1350 1351 DAG.setRoot(BrCond); 1352} 1353 1354/// visitBitTestHeader - This function emits necessary code to produce value 1355/// suitable for "bit tests" 1356void SelectionDAGBuilder::visitBitTestHeader(BitTestBlock &B, 1357 MachineBasicBlock *SwitchBB) { 1358 // Subtract the minimum value 1359 SDValue SwitchOp = getValue(B.SValue); 1360 EVT VT = SwitchOp.getValueType(); 1361 SDValue Sub = DAG.getNode(ISD::SUB, getCurDebugLoc(), VT, SwitchOp, 1362 DAG.getConstant(B.First, VT)); 1363 1364 // Check range 1365 SDValue RangeCmp = DAG.getSetCC(getCurDebugLoc(), 1366 TLI.getSetCCResultType(Sub.getValueType()), 1367 Sub, DAG.getConstant(B.Range, VT), 1368 ISD::SETUGT); 1369 1370 SDValue ShiftOp = DAG.getZExtOrTrunc(Sub, getCurDebugLoc(), 1371 TLI.getPointerTy()); 1372 1373 B.Reg = FuncInfo.MakeReg(TLI.getPointerTy()); 1374 SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), getCurDebugLoc(), 1375 B.Reg, ShiftOp); 1376 1377 // Set NextBlock to be the MBB immediately after the current one, if any. 1378 // This is used to avoid emitting unnecessary branches to the next block. 1379 MachineBasicBlock *NextBlock = 0; 1380 MachineFunction::iterator BBI = SwitchBB; 1381 if (++BBI != FuncInfo.MF->end()) 1382 NextBlock = BBI; 1383 1384 MachineBasicBlock* MBB = B.Cases[0].ThisBB; 1385 1386 SwitchBB->addSuccessor(B.Default); 1387 SwitchBB->addSuccessor(MBB); 1388 1389 SDValue BrRange = DAG.getNode(ISD::BRCOND, getCurDebugLoc(), 1390 MVT::Other, CopyTo, RangeCmp, 1391 DAG.getBasicBlock(B.Default)); 1392 1393 if (MBB != NextBlock) 1394 BrRange = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, CopyTo, 1395 DAG.getBasicBlock(MBB)); 1396 1397 DAG.setRoot(BrRange); 1398} 1399 1400/// visitBitTestCase - this function produces one "bit test" 1401void SelectionDAGBuilder::visitBitTestCase(MachineBasicBlock* NextMBB, 1402 unsigned Reg, 1403 BitTestCase &B, 1404 MachineBasicBlock *SwitchBB) { 1405 // Make desired shift 1406 SDValue ShiftOp = DAG.getCopyFromReg(getControlRoot(), getCurDebugLoc(), Reg, 1407 TLI.getPointerTy()); 1408 SDValue SwitchVal = DAG.getNode(ISD::SHL, getCurDebugLoc(), 1409 TLI.getPointerTy(), 1410 DAG.getConstant(1, TLI.getPointerTy()), 1411 ShiftOp); 1412 1413 // Emit bit tests and jumps 1414 SDValue AndOp = DAG.getNode(ISD::AND, getCurDebugLoc(), 1415 TLI.getPointerTy(), SwitchVal, 1416 DAG.getConstant(B.Mask, TLI.getPointerTy())); 1417 SDValue AndCmp = DAG.getSetCC(getCurDebugLoc(), 1418 TLI.getSetCCResultType(AndOp.getValueType()), 1419 AndOp, DAG.getConstant(0, TLI.getPointerTy()), 1420 ISD::SETNE); 1421 1422 SwitchBB->addSuccessor(B.TargetBB); 1423 SwitchBB->addSuccessor(NextMBB); 1424 1425 SDValue BrAnd = DAG.getNode(ISD::BRCOND, getCurDebugLoc(), 1426 MVT::Other, getControlRoot(), 1427 AndCmp, DAG.getBasicBlock(B.TargetBB)); 1428 1429 // Set NextBlock to be the MBB immediately after the current one, if any. 1430 // This is used to avoid emitting unnecessary branches to the next block. 1431 MachineBasicBlock *NextBlock = 0; 1432 MachineFunction::iterator BBI = SwitchBB; 1433 if (++BBI != FuncInfo.MF->end()) 1434 NextBlock = BBI; 1435 1436 if (NextMBB != NextBlock) 1437 BrAnd = DAG.getNode(ISD::BR, getCurDebugLoc(), MVT::Other, BrAnd, 1438 DAG.getBasicBlock(NextMBB)); 1439 1440 DAG.setRoot(BrAnd); 1441} 1442 1443void SelectionDAGBuilder::visitInvoke(const InvokeInst &I) { 1444 MachineBasicBlock *InvokeMBB = FuncInfo.MBBMap[I.getParent()]; 1445 1446 // Retrieve successors. 1447 MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1448 MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 1449 1450 const Value *Callee(I.getCalledValue()); 1451 if (isa<InlineAsm>(Callee)) 1452 visitInlineAsm(&I); 1453 else 1454 LowerCallTo(&I, getValue(Callee), false, LandingPad); 1455 1456 // If the value of the invoke is used outside of its defining block, make it 1457 // available as a virtual register. 1458 CopyToExportRegsIfNeeded(&I); 1459 1460 // Update successor info 1461 InvokeMBB->addSuccessor(Return); 1462 InvokeMBB->addSuccessor(LandingPad); 1463 1464 // Drop into normal successor. 1465 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), 1466 MVT::Other, getControlRoot(), 1467 DAG.getBasicBlock(Return))); 1468} 1469 1470void SelectionDAGBuilder::visitUnwind(const UnwindInst &I) { 1471} 1472 1473/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1474/// small case ranges). 1475bool SelectionDAGBuilder::handleSmallSwitchRange(CaseRec& CR, 1476 CaseRecVector& WorkList, 1477 const Value* SV, 1478 MachineBasicBlock *Default, 1479 MachineBasicBlock *SwitchBB) { 1480 Case& BackCase = *(CR.Range.second-1); 1481 1482 // Size is the number of Cases represented by this range. 1483 size_t Size = CR.Range.second - CR.Range.first; 1484 if (Size > 3) 1485 return false; 1486 1487 // Get the MachineFunction which holds the current MBB. This is used when 1488 // inserting any additional MBBs necessary to represent the switch. 1489 MachineFunction *CurMF = FuncInfo.MF; 1490 1491 // Figure out which block is immediately after the current one. 1492 MachineBasicBlock *NextBlock = 0; 1493 MachineFunction::iterator BBI = CR.CaseBB; 1494 1495 if (++BBI != FuncInfo.MF->end()) 1496 NextBlock = BBI; 1497 1498 // TODO: If any two of the cases has the same destination, and if one value 1499 // is the same as the other, but has one bit unset that the other has set, 1500 // use bit manipulation to do two compares at once. For example: 1501 // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1502 1503 // Rearrange the case blocks so that the last one falls through if possible. 1504 if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1505 // The last case block won't fall through into 'NextBlock' if we emit the 1506 // branches in this order. See if rearranging a case value would help. 1507 for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 1508 if (I->BB == NextBlock) { 1509 std::swap(*I, BackCase); 1510 break; 1511 } 1512 } 1513 } 1514 1515 // Create a CaseBlock record representing a conditional branch to 1516 // the Case's target mbb if the value being switched on SV is equal 1517 // to C. 1518 MachineBasicBlock *CurBlock = CR.CaseBB; 1519 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1520 MachineBasicBlock *FallThrough; 1521 if (I != E-1) { 1522 FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 1523 CurMF->insert(BBI, FallThrough); 1524 1525 // Put SV in a virtual register to make it available from the new blocks. 1526 ExportFromCurrentBlock(SV); 1527 } else { 1528 // If the last case doesn't match, go to the default block. 1529 FallThrough = Default; 1530 } 1531 1532 const Value *RHS, *LHS, *MHS; 1533 ISD::CondCode CC; 1534 if (I->High == I->Low) { 1535 // This is just small small case range :) containing exactly 1 case 1536 CC = ISD::SETEQ; 1537 LHS = SV; RHS = I->High; MHS = NULL; 1538 } else { 1539 CC = ISD::SETLE; 1540 LHS = I->Low; MHS = SV; RHS = I->High; 1541 } 1542 CaseBlock CB(CC, LHS, RHS, MHS, I->BB, FallThrough, CurBlock); 1543 1544 // If emitting the first comparison, just call visitSwitchCase to emit the 1545 // code into the current block. Otherwise, push the CaseBlock onto the 1546 // vector to be later processed by SDISel, and insert the node's MBB 1547 // before the next MBB. 1548 if (CurBlock == SwitchBB) 1549 visitSwitchCase(CB, SwitchBB); 1550 else 1551 SwitchCases.push_back(CB); 1552 1553 CurBlock = FallThrough; 1554 } 1555 1556 return true; 1557} 1558 1559static inline bool areJTsAllowed(const TargetLowering &TLI) { 1560 return !DisableJumpTables && 1561 (TLI.isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) || 1562 TLI.isOperationLegalOrCustom(ISD::BRIND, MVT::Other)); 1563} 1564 1565static APInt ComputeRange(const APInt &First, const APInt &Last) { 1566 APInt LastExt(Last), FirstExt(First); 1567 uint32_t BitWidth = std::max(Last.getBitWidth(), First.getBitWidth()) + 1; 1568 LastExt.sext(BitWidth); FirstExt.sext(BitWidth); 1569 return (LastExt - FirstExt + 1ULL); 1570} 1571 1572/// handleJTSwitchCase - Emit jumptable for current switch case range 1573bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec& CR, 1574 CaseRecVector& WorkList, 1575 const Value* SV, 1576 MachineBasicBlock* Default, 1577 MachineBasicBlock *SwitchBB) { 1578 Case& FrontCase = *CR.Range.first; 1579 Case& BackCase = *(CR.Range.second-1); 1580 1581 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue(); 1582 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue(); 1583 1584 APInt TSize(First.getBitWidth(), 0); 1585 for (CaseItr I = CR.Range.first, E = CR.Range.second; 1586 I!=E; ++I) 1587 TSize += I->size(); 1588 1589 if (!areJTsAllowed(TLI) || TSize.ult(4)) 1590 return false; 1591 1592 APInt Range = ComputeRange(First, Last); 1593 double Density = TSize.roundToDouble() / Range.roundToDouble(); 1594 if (Density < 0.4) 1595 return false; 1596 1597 DEBUG(dbgs() << "Lowering jump table\n" 1598 << "First entry: " << First << ". Last entry: " << Last << '\n' 1599 << "Range: " << Range 1600 << "Size: " << TSize << ". Density: " << Density << "\n\n"); 1601 1602 // Get the MachineFunction which holds the current MBB. This is used when 1603 // inserting any additional MBBs necessary to represent the switch. 1604 MachineFunction *CurMF = FuncInfo.MF; 1605 1606 // Figure out which block is immediately after the current one. 1607 MachineFunction::iterator BBI = CR.CaseBB; 1608 ++BBI; 1609 1610 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1611 1612 // Create a new basic block to hold the code for loading the address 1613 // of the jump table, and jumping to it. Update successor information; 1614 // we will either branch to the default case for the switch, or the jump 1615 // table. 1616 MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 1617 CurMF->insert(BBI, JumpTableBB); 1618 CR.CaseBB->addSuccessor(Default); 1619 CR.CaseBB->addSuccessor(JumpTableBB); 1620 1621 // Build a vector of destination BBs, corresponding to each target 1622 // of the jump table. If the value of the jump table slot corresponds to 1623 // a case statement, push the case's BB onto the vector, otherwise, push 1624 // the default BB. 1625 std::vector<MachineBasicBlock*> DestBBs; 1626 APInt TEI = First; 1627 for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 1628 const APInt &Low = cast<ConstantInt>(I->Low)->getValue(); 1629 const APInt &High = cast<ConstantInt>(I->High)->getValue(); 1630 1631 if (Low.sle(TEI) && TEI.sle(High)) { 1632 DestBBs.push_back(I->BB); 1633 if (TEI==High) 1634 ++I; 1635 } else { 1636 DestBBs.push_back(Default); 1637 } 1638 } 1639 1640 // Update successor info. Add one edge to each unique successor. 1641 BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1642 for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1643 E = DestBBs.end(); I != E; ++I) { 1644 if (!SuccsHandled[(*I)->getNumber()]) { 1645 SuccsHandled[(*I)->getNumber()] = true; 1646 JumpTableBB->addSuccessor(*I); 1647 } 1648 } 1649 1650 // Create a jump table index for this jump table. 1651 unsigned JTEncoding = TLI.getJumpTableEncoding(); 1652 unsigned JTI = CurMF->getOrCreateJumpTableInfo(JTEncoding) 1653 ->createJumpTableIndex(DestBBs); 1654 1655 // Set the jump table information so that we can codegen it as a second 1656 // MachineBasicBlock 1657 JumpTable JT(-1U, JTI, JumpTableBB, Default); 1658 JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == SwitchBB)); 1659 if (CR.CaseBB == SwitchBB) 1660 visitJumpTableHeader(JT, JTH, SwitchBB); 1661 1662 JTCases.push_back(JumpTableBlock(JTH, JT)); 1663 1664 return true; 1665} 1666 1667/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1668/// 2 subtrees. 1669bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR, 1670 CaseRecVector& WorkList, 1671 const Value* SV, 1672 MachineBasicBlock *Default, 1673 MachineBasicBlock *SwitchBB) { 1674 // Get the MachineFunction which holds the current MBB. This is used when 1675 // inserting any additional MBBs necessary to represent the switch. 1676 MachineFunction *CurMF = FuncInfo.MF; 1677 1678 // Figure out which block is immediately after the current one. 1679 MachineFunction::iterator BBI = CR.CaseBB; 1680 ++BBI; 1681 1682 Case& FrontCase = *CR.Range.first; 1683 Case& BackCase = *(CR.Range.second-1); 1684 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1685 1686 // Size is the number of Cases represented by this range. 1687 unsigned Size = CR.Range.second - CR.Range.first; 1688 1689 const APInt &First = cast<ConstantInt>(FrontCase.Low)->getValue(); 1690 const APInt &Last = cast<ConstantInt>(BackCase.High)->getValue(); 1691 double FMetric = 0; 1692 CaseItr Pivot = CR.Range.first + Size/2; 1693 1694 // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1695 // (heuristically) allow us to emit JumpTable's later. 1696 APInt TSize(First.getBitWidth(), 0); 1697 for (CaseItr I = CR.Range.first, E = CR.Range.second; 1698 I!=E; ++I) 1699 TSize += I->size(); 1700 1701 APInt LSize = FrontCase.size(); 1702 APInt RSize = TSize-LSize; 1703 DEBUG(dbgs() << "Selecting best pivot: \n" 1704 << "First: " << First << ", Last: " << Last <<'\n' 1705 << "LSize: " << LSize << ", RSize: " << RSize << '\n'); 1706 for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 1707 J!=E; ++I, ++J) { 1708 const APInt &LEnd = cast<ConstantInt>(I->High)->getValue(); 1709 const APInt &RBegin = cast<ConstantInt>(J->Low)->getValue(); 1710 APInt Range = ComputeRange(LEnd, RBegin); 1711 assert((Range - 2ULL).isNonNegative() && 1712 "Invalid case distance"); 1713 double LDensity = (double)LSize.roundToDouble() / 1714 (LEnd - First + 1ULL).roundToDouble(); 1715 double RDensity = (double)RSize.roundToDouble() / 1716 (Last - RBegin + 1ULL).roundToDouble(); 1717 double Metric = Range.logBase2()*(LDensity+RDensity); 1718 // Should always split in some non-trivial place 1719 DEBUG(dbgs() <<"=>Step\n" 1720 << "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n' 1721 << "LDensity: " << LDensity 1722 << ", RDensity: " << RDensity << '\n' 1723 << "Metric: " << Metric << '\n'); 1724 if (FMetric < Metric) { 1725 Pivot = J; 1726 FMetric = Metric; 1727 DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n'); 1728 } 1729 1730 LSize += J->size(); 1731 RSize -= J->size(); 1732 } 1733 if (areJTsAllowed(TLI)) { 1734 // If our case is dense we *really* should handle it earlier! 1735 assert((FMetric > 0) && "Should handle dense range earlier!"); 1736 } else { 1737 Pivot = CR.Range.first + Size/2; 1738 } 1739 1740 CaseRange LHSR(CR.Range.first, Pivot); 1741 CaseRange RHSR(Pivot, CR.Range.second); 1742 Constant *C = Pivot->Low; 1743 MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1744 1745 // We know that we branch to the LHS if the Value being switched on is 1746 // less than the Pivot value, C. We use this to optimize our binary 1747 // tree a bit, by recognizing that if SV is greater than or equal to the 1748 // LHS's Case Value, and that Case Value is exactly one less than the 1749 // Pivot's Value, then we can branch directly to the LHS's Target, 1750 // rather than creating a leaf node for it. 1751 if ((LHSR.second - LHSR.first) == 1 && 1752 LHSR.first->High == CR.GE && 1753 cast<ConstantInt>(C)->getValue() == 1754 (cast<ConstantInt>(CR.GE)->getValue() + 1LL)) { 1755 TrueBB = LHSR.first->BB; 1756 } else { 1757 TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 1758 CurMF->insert(BBI, TrueBB); 1759 WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1760 1761 // Put SV in a virtual register to make it available from the new blocks. 1762 ExportFromCurrentBlock(SV); 1763 } 1764 1765 // Similar to the optimization above, if the Value being switched on is 1766 // known to be less than the Constant CR.LT, and the current Case Value 1767 // is CR.LT - 1, then we can branch directly to the target block for 1768 // the current Case Value, rather than emitting a RHS leaf node for it. 1769 if ((RHSR.second - RHSR.first) == 1 && CR.LT && 1770 cast<ConstantInt>(RHSR.first->Low)->getValue() == 1771 (cast<ConstantInt>(CR.LT)->getValue() - 1LL)) { 1772 FalseBB = RHSR.first->BB; 1773 } else { 1774 FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 1775 CurMF->insert(BBI, FalseBB); 1776 WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1777 1778 // Put SV in a virtual register to make it available from the new blocks. 1779 ExportFromCurrentBlock(SV); 1780 } 1781 1782 // Create a CaseBlock record representing a conditional branch to 1783 // the LHS node if the value being switched on SV is less than C. 1784 // Otherwise, branch to LHS. 1785 CaseBlock CB(ISD::SETLT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB); 1786 1787 if (CR.CaseBB == SwitchBB) 1788 visitSwitchCase(CB, SwitchBB); 1789 else 1790 SwitchCases.push_back(CB); 1791 1792 return true; 1793} 1794 1795/// handleBitTestsSwitchCase - if current case range has few destination and 1796/// range span less, than machine word bitwidth, encode case range into series 1797/// of masks and emit bit tests with these masks. 1798bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR, 1799 CaseRecVector& WorkList, 1800 const Value* SV, 1801 MachineBasicBlock* Default, 1802 MachineBasicBlock *SwitchBB){ 1803 EVT PTy = TLI.getPointerTy(); 1804 unsigned IntPtrBits = PTy.getSizeInBits(); 1805 1806 Case& FrontCase = *CR.Range.first; 1807 Case& BackCase = *(CR.Range.second-1); 1808 1809 // Get the MachineFunction which holds the current MBB. This is used when 1810 // inserting any additional MBBs necessary to represent the switch. 1811 MachineFunction *CurMF = FuncInfo.MF; 1812 1813 // If target does not have legal shift left, do not emit bit tests at all. 1814 if (!TLI.isOperationLegal(ISD::SHL, TLI.getPointerTy())) 1815 return false; 1816 1817 size_t numCmps = 0; 1818 for (CaseItr I = CR.Range.first, E = CR.Range.second; 1819 I!=E; ++I) { 1820 // Single case counts one, case range - two. 1821 numCmps += (I->Low == I->High ? 1 : 2); 1822 } 1823 1824 // Count unique destinations 1825 SmallSet<MachineBasicBlock*, 4> Dests; 1826 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 1827 Dests.insert(I->BB); 1828 if (Dests.size() > 3) 1829 // Don't bother the code below, if there are too much unique destinations 1830 return false; 1831 } 1832 DEBUG(dbgs() << "Total number of unique destinations: " 1833 << Dests.size() << '\n' 1834 << "Total number of comparisons: " << numCmps << '\n'); 1835 1836 // Compute span of values. 1837 const APInt& minValue = cast<ConstantInt>(FrontCase.Low)->getValue(); 1838 const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue(); 1839 APInt cmpRange = maxValue - minValue; 1840 1841 DEBUG(dbgs() << "Compare range: " << cmpRange << '\n' 1842 << "Low bound: " << minValue << '\n' 1843 << "High bound: " << maxValue << '\n'); 1844 1845 if (cmpRange.uge(IntPtrBits) || 1846 (!(Dests.size() == 1 && numCmps >= 3) && 1847 !(Dests.size() == 2 && numCmps >= 5) && 1848 !(Dests.size() >= 3 && numCmps >= 6))) 1849 return false; 1850 1851 DEBUG(dbgs() << "Emitting bit tests\n"); 1852 APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth()); 1853 1854 // Optimize the case where all the case values fit in a 1855 // word without having to subtract minValue. In this case, 1856 // we can optimize away the subtraction. 1857 if (minValue.isNonNegative() && maxValue.slt(IntPtrBits)) { 1858 cmpRange = maxValue; 1859 } else { 1860 lowBound = minValue; 1861 } 1862 1863 CaseBitsVector CasesBits; 1864 unsigned i, count = 0; 1865 1866 for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 1867 MachineBasicBlock* Dest = I->BB; 1868 for (i = 0; i < count; ++i) 1869 if (Dest == CasesBits[i].BB) 1870 break; 1871 1872 if (i == count) { 1873 assert((count < 3) && "Too much destinations to test!"); 1874 CasesBits.push_back(CaseBits(0, Dest, 0)); 1875 count++; 1876 } 1877 1878 const APInt& lowValue = cast<ConstantInt>(I->Low)->getValue(); 1879 const APInt& highValue = cast<ConstantInt>(I->High)->getValue(); 1880 1881 uint64_t lo = (lowValue - lowBound).getZExtValue(); 1882 uint64_t hi = (highValue - lowBound).getZExtValue(); 1883 1884 for (uint64_t j = lo; j <= hi; j++) { 1885 CasesBits[i].Mask |= 1ULL << j; 1886 CasesBits[i].Bits++; 1887 } 1888 1889 } 1890 std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 1891 1892 BitTestInfo BTC; 1893 1894 // Figure out which block is immediately after the current one. 1895 MachineFunction::iterator BBI = CR.CaseBB; 1896 ++BBI; 1897 1898 const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1899 1900 DEBUG(dbgs() << "Cases:\n"); 1901 for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 1902 DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask 1903 << ", Bits: " << CasesBits[i].Bits 1904 << ", BB: " << CasesBits[i].BB << '\n'); 1905 1906 MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 1907 CurMF->insert(BBI, CaseBB); 1908 BTC.push_back(BitTestCase(CasesBits[i].Mask, 1909 CaseBB, 1910 CasesBits[i].BB)); 1911 1912 // Put SV in a virtual register to make it available from the new blocks. 1913 ExportFromCurrentBlock(SV); 1914 } 1915 1916 BitTestBlock BTB(lowBound, cmpRange, SV, 1917 -1U, (CR.CaseBB == SwitchBB), 1918 CR.CaseBB, Default, BTC); 1919 1920 if (CR.CaseBB == SwitchBB) 1921 visitBitTestHeader(BTB, SwitchBB); 1922 1923 BitTestCases.push_back(BTB); 1924 1925 return true; 1926} 1927 1928/// Clusterify - Transform simple list of Cases into list of CaseRange's 1929size_t SelectionDAGBuilder::Clusterify(CaseVector& Cases, 1930 const SwitchInst& SI) { 1931 size_t numCmps = 0; 1932 1933 // Start with "simple" cases 1934 for (size_t i = 1; i < SI.getNumSuccessors(); ++i) { 1935 MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 1936 Cases.push_back(Case(SI.getSuccessorValue(i), 1937 SI.getSuccessorValue(i), 1938 SMBB)); 1939 } 1940 std::sort(Cases.begin(), Cases.end(), CaseCmp()); 1941 1942 // Merge case into clusters 1943 if (Cases.size() >= 2) 1944 // Must recompute end() each iteration because it may be 1945 // invalidated by erase if we hold on to it 1946 for (CaseItr I = Cases.begin(), J = ++(Cases.begin()); J != Cases.end(); ) { 1947 const APInt& nextValue = cast<ConstantInt>(J->Low)->getValue(); 1948 const APInt& currentValue = cast<ConstantInt>(I->High)->getValue(); 1949 MachineBasicBlock* nextBB = J->BB; 1950 MachineBasicBlock* currentBB = I->BB; 1951 1952 // If the two neighboring cases go to the same destination, merge them 1953 // into a single case. 1954 if ((nextValue - currentValue == 1) && (currentBB == nextBB)) { 1955 I->High = J->High; 1956 J = Cases.erase(J); 1957 } else { 1958 I = J++; 1959 } 1960 } 1961 1962 for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 1963 if (I->Low != I->High) 1964 // A range counts double, since it requires two compares. 1965 ++numCmps; 1966 } 1967 1968 return numCmps; 1969} 1970 1971void SelectionDAGBuilder::visitSwitch(const SwitchInst &SI) { 1972 MachineBasicBlock *SwitchMBB = FuncInfo.MBBMap[SI.getParent()]; 1973 1974 // Figure out which block is immediately after the current one. 1975 MachineBasicBlock *NextBlock = 0; 1976 MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 1977 1978 // If there is only the default destination, branch to it if it is not the 1979 // next basic block. Otherwise, just fall through. 1980 if (SI.getNumOperands() == 2) { 1981 // Update machine-CFG edges. 1982 1983 // If this is not a fall-through branch, emit the branch. 1984 SwitchMBB->addSuccessor(Default); 1985 if (Default != NextBlock) 1986 DAG.setRoot(DAG.getNode(ISD::BR, getCurDebugLoc(), 1987 MVT::Other, getControlRoot(), 1988 DAG.getBasicBlock(Default))); 1989 1990 return; 1991 } 1992 1993 // If there are any non-default case statements, create a vector of Cases 1994 // representing each one, and sort the vector so that we can efficiently 1995 // create a binary search tree from them. 1996 CaseVector Cases; 1997 size_t numCmps = Clusterify(Cases, SI); 1998 DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size() 1999 << ". Total compares: " << numCmps << '\n'); 2000 numCmps = 0; 2001 2002 // Get the Value to be switched on and default basic blocks, which will be 2003 // inserted into CaseBlock records, representing basic blocks in the binary 2004 // search tree. 2005 const Value *SV = SI.getOperand(0); 2006 2007 // Push the initial CaseRec onto the worklist 2008 CaseRecVector WorkList; 2009 WorkList.push_back(CaseRec(SwitchMBB,0,0, 2010 CaseRange(Cases.begin(),Cases.end()))); 2011 2012 while (!WorkList.empty()) { 2013 // Grab a record representing a case range to process off the worklist 2014 CaseRec CR = WorkList.back(); 2015 WorkList.pop_back(); 2016 2017 if (handleBitTestsSwitchCase(CR, WorkList, SV, Default, SwitchMBB)) 2018 continue; 2019 2020 // If the range has few cases (two or less) emit a series of specific 2021 // tests. 2022 if (handleSmallSwitchRange(CR, WorkList, SV, Default, SwitchMBB)) 2023 continue; 2024 2025 // If the switch has more than 5 blocks, and at least 40% dense, and the 2026 // target supports indirect branches, then emit a jump table rather than 2027 // lowering the switch to a binary tree of conditional branches. 2028 if (handleJTSwitchCase(CR, WorkList, SV, Default, SwitchMBB)) 2029 continue; 2030 2031 // Emit binary tree. We need to pick a pivot, and push left and right ranges 2032 // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2033 handleBTSplitSwitchCase(CR, WorkList, SV, Default, SwitchMBB); 2034 } 2035} 2036 2037void SelectionDAGBuilder::visitIndirectBr(const IndirectBrInst &I) { 2038 MachineBasicBlock *IndirectBrMBB = FuncInfo.MBBMap[I.getParent()]; 2039 2040 // Update machine-CFG edges with unique successors. 2041 SmallVector<BasicBlock*, 32> succs; 2042 succs.reserve(I.getNumSuccessors()); 2043 for (unsigned i = 0, e = I.getNumSuccessors(); i != e; ++i) 2044 succs.push_back(I.getSuccessor(i)); 2045 array_pod_sort(succs.begin(), succs.end()); 2046 succs.erase(std::unique(succs.begin(), succs.end()), succs.end()); 2047 for (unsigned i = 0, e = succs.size(); i != e; ++i) 2048 IndirectBrMBB->addSuccessor(FuncInfo.MBBMap[succs[i]]); 2049 2050 DAG.setRoot(DAG.getNode(ISD::BRIND, getCurDebugLoc(), 2051 MVT::Other, getControlRoot(), 2052 getValue(I.getAddress()))); 2053} 2054 2055void SelectionDAGBuilder::visitFSub(const User &I) { 2056 // -0.0 - X --> fneg 2057 const Type *Ty = I.getType(); 2058 if (Ty->isVectorTy()) { 2059 if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 2060 const VectorType *DestTy = cast<VectorType>(I.getType()); 2061 const Type *ElTy = DestTy->getElementType(); 2062 unsigned VL = DestTy->getNumElements(); 2063 std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2064 Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2065 if (CV == CNZ) { 2066 SDValue Op2 = getValue(I.getOperand(1)); 2067 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(), 2068 Op2.getValueType(), Op2)); 2069 return; 2070 } 2071 } 2072 } 2073 2074 if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 2075 if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 2076 SDValue Op2 = getValue(I.getOperand(1)); 2077 setValue(&I, DAG.getNode(ISD::FNEG, getCurDebugLoc(), 2078 Op2.getValueType(), Op2)); 2079 return; 2080 } 2081 2082 visitBinary(I, ISD::FSUB); 2083} 2084 2085void SelectionDAGBuilder::visitBinary(const User &I, unsigned OpCode) { 2086 SDValue Op1 = getValue(I.getOperand(0)); 2087 SDValue Op2 = getValue(I.getOperand(1)); 2088 setValue(&I, DAG.getNode(OpCode, getCurDebugLoc(), 2089 Op1.getValueType(), Op1, Op2)); 2090} 2091 2092void SelectionDAGBuilder::visitShift(const User &I, unsigned Opcode) { 2093 SDValue Op1 = getValue(I.getOperand(0)); 2094 SDValue Op2 = getValue(I.getOperand(1)); 2095 if (!I.getType()->isVectorTy() && 2096 Op2.getValueType() != TLI.getShiftAmountTy()) { 2097 // If the operand is smaller than the shift count type, promote it. 2098 EVT PTy = TLI.getPointerTy(); 2099 EVT STy = TLI.getShiftAmountTy(); 2100 if (STy.bitsGT(Op2.getValueType())) 2101 Op2 = DAG.getNode(ISD::ANY_EXTEND, getCurDebugLoc(), 2102 TLI.getShiftAmountTy(), Op2); 2103 // If the operand is larger than the shift count type but the shift 2104 // count type has enough bits to represent any shift value, truncate 2105 // it now. This is a common case and it exposes the truncate to 2106 // optimization early. 2107 else if (STy.getSizeInBits() >= 2108 Log2_32_Ceil(Op2.getValueType().getSizeInBits())) 2109 Op2 = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), 2110 TLI.getShiftAmountTy(), Op2); 2111 // Otherwise we'll need to temporarily settle for some other 2112 // convenient type; type legalization will make adjustments as 2113 // needed. 2114 else if (PTy.bitsLT(Op2.getValueType())) 2115 Op2 = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), 2116 TLI.getPointerTy(), Op2); 2117 else if (PTy.bitsGT(Op2.getValueType())) 2118 Op2 = DAG.getNode(ISD::ANY_EXTEND, getCurDebugLoc(), 2119 TLI.getPointerTy(), Op2); 2120 } 2121 2122 setValue(&I, DAG.getNode(Opcode, getCurDebugLoc(), 2123 Op1.getValueType(), Op1, Op2)); 2124} 2125 2126void SelectionDAGBuilder::visitICmp(const User &I) { 2127 ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2128 if (const ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2129 predicate = IC->getPredicate(); 2130 else if (const ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2131 predicate = ICmpInst::Predicate(IC->getPredicate()); 2132 SDValue Op1 = getValue(I.getOperand(0)); 2133 SDValue Op2 = getValue(I.getOperand(1)); 2134 ISD::CondCode Opcode = getICmpCondCode(predicate); 2135 2136 EVT DestVT = TLI.getValueType(I.getType()); 2137 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Opcode)); 2138} 2139 2140void SelectionDAGBuilder::visitFCmp(const User &I) { 2141 FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2142 if (const FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2143 predicate = FC->getPredicate(); 2144 else if (const ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2145 predicate = FCmpInst::Predicate(FC->getPredicate()); 2146 SDValue Op1 = getValue(I.getOperand(0)); 2147 SDValue Op2 = getValue(I.getOperand(1)); 2148 ISD::CondCode Condition = getFCmpCondCode(predicate); 2149 EVT DestVT = TLI.getValueType(I.getType()); 2150 setValue(&I, DAG.getSetCC(getCurDebugLoc(), DestVT, Op1, Op2, Condition)); 2151} 2152 2153void SelectionDAGBuilder::visitSelect(const User &I) { 2154 SmallVector<EVT, 4> ValueVTs; 2155 ComputeValueVTs(TLI, I.getType(), ValueVTs); 2156 unsigned NumValues = ValueVTs.size(); 2157 if (NumValues == 0) return; 2158 2159 SmallVector<SDValue, 4> Values(NumValues); 2160 SDValue Cond = getValue(I.getOperand(0)); 2161 SDValue TrueVal = getValue(I.getOperand(1)); 2162 SDValue FalseVal = getValue(I.getOperand(2)); 2163 2164 for (unsigned i = 0; i != NumValues; ++i) 2165 Values[i] = DAG.getNode(ISD::SELECT, getCurDebugLoc(), 2166 TrueVal.getNode()->getValueType(TrueVal.getResNo()+i), 2167 Cond, 2168 SDValue(TrueVal.getNode(), 2169 TrueVal.getResNo() + i), 2170 SDValue(FalseVal.getNode(), 2171 FalseVal.getResNo() + i)); 2172 2173 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(), 2174 DAG.getVTList(&ValueVTs[0], NumValues), 2175 &Values[0], NumValues)); 2176} 2177 2178void SelectionDAGBuilder::visitTrunc(const User &I) { 2179 // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 2180 SDValue N = getValue(I.getOperand(0)); 2181 EVT DestVT = TLI.getValueType(I.getType()); 2182 setValue(&I, DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), DestVT, N)); 2183} 2184 2185void SelectionDAGBuilder::visitZExt(const User &I) { 2186 // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 2187 // ZExt also can't be a cast to bool for same reason. So, nothing much to do 2188 SDValue N = getValue(I.getOperand(0)); 2189 EVT DestVT = TLI.getValueType(I.getType()); 2190 setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), DestVT, N)); 2191} 2192 2193void SelectionDAGBuilder::visitSExt(const User &I) { 2194 // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 2195 // SExt also can't be a cast to bool for same reason. So, nothing much to do 2196 SDValue N = getValue(I.getOperand(0)); 2197 EVT DestVT = TLI.getValueType(I.getType()); 2198 setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, getCurDebugLoc(), DestVT, N)); 2199} 2200 2201void SelectionDAGBuilder::visitFPTrunc(const User &I) { 2202 // FPTrunc is never a no-op cast, no need to check 2203 SDValue N = getValue(I.getOperand(0)); 2204 EVT DestVT = TLI.getValueType(I.getType()); 2205 setValue(&I, DAG.getNode(ISD::FP_ROUND, getCurDebugLoc(), 2206 DestVT, N, DAG.getIntPtrConstant(0))); 2207} 2208 2209void SelectionDAGBuilder::visitFPExt(const User &I){ 2210 // FPTrunc is never a no-op cast, no need to check 2211 SDValue N = getValue(I.getOperand(0)); 2212 EVT DestVT = TLI.getValueType(I.getType()); 2213 setValue(&I, DAG.getNode(ISD::FP_EXTEND, getCurDebugLoc(), DestVT, N)); 2214} 2215 2216void SelectionDAGBuilder::visitFPToUI(const User &I) { 2217 // FPToUI is never a no-op cast, no need to check 2218 SDValue N = getValue(I.getOperand(0)); 2219 EVT DestVT = TLI.getValueType(I.getType()); 2220 setValue(&I, DAG.getNode(ISD::FP_TO_UINT, getCurDebugLoc(), DestVT, N)); 2221} 2222 2223void SelectionDAGBuilder::visitFPToSI(const User &I) { 2224 // FPToSI is never a no-op cast, no need to check 2225 SDValue N = getValue(I.getOperand(0)); 2226 EVT DestVT = TLI.getValueType(I.getType()); 2227 setValue(&I, DAG.getNode(ISD::FP_TO_SINT, getCurDebugLoc(), DestVT, N)); 2228} 2229 2230void SelectionDAGBuilder::visitUIToFP(const User &I) { 2231 // UIToFP is never a no-op cast, no need to check 2232 SDValue N = getValue(I.getOperand(0)); 2233 EVT DestVT = TLI.getValueType(I.getType()); 2234 setValue(&I, DAG.getNode(ISD::UINT_TO_FP, getCurDebugLoc(), DestVT, N)); 2235} 2236 2237void SelectionDAGBuilder::visitSIToFP(const User &I){ 2238 // SIToFP is never a no-op cast, no need to check 2239 SDValue N = getValue(I.getOperand(0)); 2240 EVT DestVT = TLI.getValueType(I.getType()); 2241 setValue(&I, DAG.getNode(ISD::SINT_TO_FP, getCurDebugLoc(), DestVT, N)); 2242} 2243 2244void SelectionDAGBuilder::visitPtrToInt(const User &I) { 2245 // What to do depends on the size of the integer and the size of the pointer. 2246 // We can either truncate, zero extend, or no-op, accordingly. 2247 SDValue N = getValue(I.getOperand(0)); 2248 EVT SrcVT = N.getValueType(); 2249 EVT DestVT = TLI.getValueType(I.getType()); 2250 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT)); 2251} 2252 2253void SelectionDAGBuilder::visitIntToPtr(const User &I) { 2254 // What to do depends on the size of the integer and the size of the pointer. 2255 // We can either truncate, zero extend, or no-op, accordingly. 2256 SDValue N = getValue(I.getOperand(0)); 2257 EVT SrcVT = N.getValueType(); 2258 EVT DestVT = TLI.getValueType(I.getType()); 2259 setValue(&I, DAG.getZExtOrTrunc(N, getCurDebugLoc(), DestVT)); 2260} 2261 2262void SelectionDAGBuilder::visitBitCast(const User &I) { 2263 SDValue N = getValue(I.getOperand(0)); 2264 EVT DestVT = TLI.getValueType(I.getType()); 2265 2266 // BitCast assures us that source and destination are the same size so this is 2267 // either a BIT_CONVERT or a no-op. 2268 if (DestVT != N.getValueType()) 2269 setValue(&I, DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), 2270 DestVT, N)); // convert types. 2271 else 2272 setValue(&I, N); // noop cast. 2273} 2274 2275void SelectionDAGBuilder::visitInsertElement(const User &I) { 2276 SDValue InVec = getValue(I.getOperand(0)); 2277 SDValue InVal = getValue(I.getOperand(1)); 2278 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), 2279 TLI.getPointerTy(), 2280 getValue(I.getOperand(2))); 2281 setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, getCurDebugLoc(), 2282 TLI.getValueType(I.getType()), 2283 InVec, InVal, InIdx)); 2284} 2285 2286void SelectionDAGBuilder::visitExtractElement(const User &I) { 2287 SDValue InVec = getValue(I.getOperand(0)); 2288 SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, getCurDebugLoc(), 2289 TLI.getPointerTy(), 2290 getValue(I.getOperand(1))); 2291 setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(), 2292 TLI.getValueType(I.getType()), InVec, InIdx)); 2293} 2294 2295// Utility for visitShuffleVector - Returns true if the mask is mask starting 2296// from SIndx and increasing to the element length (undefs are allowed). 2297static bool SequentialMask(SmallVectorImpl<int> &Mask, unsigned SIndx) { 2298 unsigned MaskNumElts = Mask.size(); 2299 for (unsigned i = 0; i != MaskNumElts; ++i) 2300 if ((Mask[i] >= 0) && (Mask[i] != (int)(i + SIndx))) 2301 return false; 2302 return true; 2303} 2304 2305void SelectionDAGBuilder::visitShuffleVector(const User &I) { 2306 SmallVector<int, 8> Mask; 2307 SDValue Src1 = getValue(I.getOperand(0)); 2308 SDValue Src2 = getValue(I.getOperand(1)); 2309 2310 // Convert the ConstantVector mask operand into an array of ints, with -1 2311 // representing undef values. 2312 SmallVector<Constant*, 8> MaskElts; 2313 cast<Constant>(I.getOperand(2))->getVectorElements(MaskElts); 2314 unsigned MaskNumElts = MaskElts.size(); 2315 for (unsigned i = 0; i != MaskNumElts; ++i) { 2316 if (isa<UndefValue>(MaskElts[i])) 2317 Mask.push_back(-1); 2318 else 2319 Mask.push_back(cast<ConstantInt>(MaskElts[i])->getSExtValue()); 2320 } 2321 2322 EVT VT = TLI.getValueType(I.getType()); 2323 EVT SrcVT = Src1.getValueType(); 2324 unsigned SrcNumElts = SrcVT.getVectorNumElements(); 2325 2326 if (SrcNumElts == MaskNumElts) { 2327 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2, 2328 &Mask[0])); 2329 return; 2330 } 2331 2332 // Normalize the shuffle vector since mask and vector length don't match. 2333 if (SrcNumElts < MaskNumElts && MaskNumElts % SrcNumElts == 0) { 2334 // Mask is longer than the source vectors and is a multiple of the source 2335 // vectors. We can use concatenate vector to make the mask and vectors 2336 // lengths match. 2337 if (SrcNumElts*2 == MaskNumElts && SequentialMask(Mask, 0)) { 2338 // The shuffle is concatenating two vectors together. 2339 setValue(&I, DAG.getNode(ISD::CONCAT_VECTORS, getCurDebugLoc(), 2340 VT, Src1, Src2)); 2341 return; 2342 } 2343 2344 // Pad both vectors with undefs to make them the same length as the mask. 2345 unsigned NumConcat = MaskNumElts / SrcNumElts; 2346 bool Src1U = Src1.getOpcode() == ISD::UNDEF; 2347 bool Src2U = Src2.getOpcode() == ISD::UNDEF; 2348 SDValue UndefVal = DAG.getUNDEF(SrcVT); 2349 2350 SmallVector<SDValue, 8> MOps1(NumConcat, UndefVal); 2351 SmallVector<SDValue, 8> MOps2(NumConcat, UndefVal); 2352 MOps1[0] = Src1; 2353 MOps2[0] = Src2; 2354 2355 Src1 = Src1U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS, 2356 getCurDebugLoc(), VT, 2357 &MOps1[0], NumConcat); 2358 Src2 = Src2U ? DAG.getUNDEF(VT) : DAG.getNode(ISD::CONCAT_VECTORS, 2359 getCurDebugLoc(), VT, 2360 &MOps2[0], NumConcat); 2361 2362 // Readjust mask for new input vector length. 2363 SmallVector<int, 8> MappedOps; 2364 for (unsigned i = 0; i != MaskNumElts; ++i) { 2365 int Idx = Mask[i]; 2366 if (Idx < (int)SrcNumElts) 2367 MappedOps.push_back(Idx); 2368 else 2369 MappedOps.push_back(Idx + MaskNumElts - SrcNumElts); 2370 } 2371 2372 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2, 2373 &MappedOps[0])); 2374 return; 2375 } 2376 2377 if (SrcNumElts > MaskNumElts) { 2378 // Analyze the access pattern of the vector to see if we can extract 2379 // two subvectors and do the shuffle. The analysis is done by calculating 2380 // the range of elements the mask access on both vectors. 2381 int MinRange[2] = { SrcNumElts+1, SrcNumElts+1}; 2382 int MaxRange[2] = {-1, -1}; 2383 2384 for (unsigned i = 0; i != MaskNumElts; ++i) { 2385 int Idx = Mask[i]; 2386 int Input = 0; 2387 if (Idx < 0) 2388 continue; 2389 2390 if (Idx >= (int)SrcNumElts) { 2391 Input = 1; 2392 Idx -= SrcNumElts; 2393 } 2394 if (Idx > MaxRange[Input]) 2395 MaxRange[Input] = Idx; 2396 if (Idx < MinRange[Input]) 2397 MinRange[Input] = Idx; 2398 } 2399 2400 // Check if the access is smaller than the vector size and can we find 2401 // a reasonable extract index. 2402 int RangeUse[2] = { 2, 2 }; // 0 = Unused, 1 = Extract, 2 = Can not 2403 // Extract. 2404 int StartIdx[2]; // StartIdx to extract from 2405 for (int Input=0; Input < 2; ++Input) { 2406 if (MinRange[Input] == (int)(SrcNumElts+1) && MaxRange[Input] == -1) { 2407 RangeUse[Input] = 0; // Unused 2408 StartIdx[Input] = 0; 2409 } else if (MaxRange[Input] - MinRange[Input] < (int)MaskNumElts) { 2410 // Fits within range but we should see if we can find a good 2411 // start index that is a multiple of the mask length. 2412 if (MaxRange[Input] < (int)MaskNumElts) { 2413 RangeUse[Input] = 1; // Extract from beginning of the vector 2414 StartIdx[Input] = 0; 2415 } else { 2416 StartIdx[Input] = (MinRange[Input]/MaskNumElts)*MaskNumElts; 2417 if (MaxRange[Input] - StartIdx[Input] < (int)MaskNumElts && 2418 StartIdx[Input] + MaskNumElts < SrcNumElts) 2419 RangeUse[Input] = 1; // Extract from a multiple of the mask length. 2420 } 2421 } 2422 } 2423 2424 if (RangeUse[0] == 0 && RangeUse[1] == 0) { 2425 setValue(&I, DAG.getUNDEF(VT)); // Vectors are not used. 2426 return; 2427 } 2428 else if (RangeUse[0] < 2 && RangeUse[1] < 2) { 2429 // Extract appropriate subvector and generate a vector shuffle 2430 for (int Input=0; Input < 2; ++Input) { 2431 SDValue &Src = Input == 0 ? Src1 : Src2; 2432 if (RangeUse[Input] == 0) 2433 Src = DAG.getUNDEF(VT); 2434 else 2435 Src = DAG.getNode(ISD::EXTRACT_SUBVECTOR, getCurDebugLoc(), VT, 2436 Src, DAG.getIntPtrConstant(StartIdx[Input])); 2437 } 2438 2439 // Calculate new mask. 2440 SmallVector<int, 8> MappedOps; 2441 for (unsigned i = 0; i != MaskNumElts; ++i) { 2442 int Idx = Mask[i]; 2443 if (Idx < 0) 2444 MappedOps.push_back(Idx); 2445 else if (Idx < (int)SrcNumElts) 2446 MappedOps.push_back(Idx - StartIdx[0]); 2447 else 2448 MappedOps.push_back(Idx - SrcNumElts - StartIdx[1] + MaskNumElts); 2449 } 2450 2451 setValue(&I, DAG.getVectorShuffle(VT, getCurDebugLoc(), Src1, Src2, 2452 &MappedOps[0])); 2453 return; 2454 } 2455 } 2456 2457 // We can't use either concat vectors or extract subvectors so fall back to 2458 // replacing the shuffle with extract and build vector. 2459 // to insert and build vector. 2460 EVT EltVT = VT.getVectorElementType(); 2461 EVT PtrVT = TLI.getPointerTy(); 2462 SmallVector<SDValue,8> Ops; 2463 for (unsigned i = 0; i != MaskNumElts; ++i) { 2464 if (Mask[i] < 0) { 2465 Ops.push_back(DAG.getUNDEF(EltVT)); 2466 } else { 2467 int Idx = Mask[i]; 2468 SDValue Res; 2469 2470 if (Idx < (int)SrcNumElts) 2471 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(), 2472 EltVT, Src1, DAG.getConstant(Idx, PtrVT)); 2473 else 2474 Res = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, getCurDebugLoc(), 2475 EltVT, Src2, 2476 DAG.getConstant(Idx - SrcNumElts, PtrVT)); 2477 2478 Ops.push_back(Res); 2479 } 2480 } 2481 2482 setValue(&I, DAG.getNode(ISD::BUILD_VECTOR, getCurDebugLoc(), 2483 VT, &Ops[0], Ops.size())); 2484} 2485 2486void SelectionDAGBuilder::visitInsertValue(const InsertValueInst &I) { 2487 const Value *Op0 = I.getOperand(0); 2488 const Value *Op1 = I.getOperand(1); 2489 const Type *AggTy = I.getType(); 2490 const Type *ValTy = Op1->getType(); 2491 bool IntoUndef = isa<UndefValue>(Op0); 2492 bool FromUndef = isa<UndefValue>(Op1); 2493 2494 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 2495 I.idx_begin(), I.idx_end()); 2496 2497 SmallVector<EVT, 4> AggValueVTs; 2498 ComputeValueVTs(TLI, AggTy, AggValueVTs); 2499 SmallVector<EVT, 4> ValValueVTs; 2500 ComputeValueVTs(TLI, ValTy, ValValueVTs); 2501 2502 unsigned NumAggValues = AggValueVTs.size(); 2503 unsigned NumValValues = ValValueVTs.size(); 2504 SmallVector<SDValue, 4> Values(NumAggValues); 2505 2506 SDValue Agg = getValue(Op0); 2507 SDValue Val = getValue(Op1); 2508 unsigned i = 0; 2509 // Copy the beginning value(s) from the original aggregate. 2510 for (; i != LinearIndex; ++i) 2511 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) : 2512 SDValue(Agg.getNode(), Agg.getResNo() + i); 2513 // Copy values from the inserted value(s). 2514 for (; i != LinearIndex + NumValValues; ++i) 2515 Values[i] = FromUndef ? DAG.getUNDEF(AggValueVTs[i]) : 2516 SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex); 2517 // Copy remaining value(s) from the original aggregate. 2518 for (; i != NumAggValues; ++i) 2519 Values[i] = IntoUndef ? DAG.getUNDEF(AggValueVTs[i]) : 2520 SDValue(Agg.getNode(), Agg.getResNo() + i); 2521 2522 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(), 2523 DAG.getVTList(&AggValueVTs[0], NumAggValues), 2524 &Values[0], NumAggValues)); 2525} 2526 2527void SelectionDAGBuilder::visitExtractValue(const ExtractValueInst &I) { 2528 const Value *Op0 = I.getOperand(0); 2529 const Type *AggTy = Op0->getType(); 2530 const Type *ValTy = I.getType(); 2531 bool OutOfUndef = isa<UndefValue>(Op0); 2532 2533 unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 2534 I.idx_begin(), I.idx_end()); 2535 2536 SmallVector<EVT, 4> ValValueVTs; 2537 ComputeValueVTs(TLI, ValTy, ValValueVTs); 2538 2539 unsigned NumValValues = ValValueVTs.size(); 2540 SmallVector<SDValue, 4> Values(NumValValues); 2541 2542 SDValue Agg = getValue(Op0); 2543 // Copy out the selected value(s). 2544 for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 2545 Values[i - LinearIndex] = 2546 OutOfUndef ? 2547 DAG.getUNDEF(Agg.getNode()->getValueType(Agg.getResNo() + i)) : 2548 SDValue(Agg.getNode(), Agg.getResNo() + i); 2549 2550 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(), 2551 DAG.getVTList(&ValValueVTs[0], NumValValues), 2552 &Values[0], NumValValues)); 2553} 2554 2555void SelectionDAGBuilder::visitGetElementPtr(const User &I) { 2556 SDValue N = getValue(I.getOperand(0)); 2557 const Type *Ty = I.getOperand(0)->getType(); 2558 2559 for (GetElementPtrInst::const_op_iterator OI = I.op_begin()+1, E = I.op_end(); 2560 OI != E; ++OI) { 2561 const Value *Idx = *OI; 2562 if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2563 unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 2564 if (Field) { 2565 // N = N + Offset 2566 uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 2567 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N, 2568 DAG.getIntPtrConstant(Offset)); 2569 } 2570 2571 Ty = StTy->getElementType(Field); 2572 } else if (const UnionType *UnTy = dyn_cast<UnionType>(Ty)) { 2573 unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 2574 2575 // Offset canonically 0 for unions, but type changes 2576 Ty = UnTy->getElementType(Field); 2577 } else { 2578 Ty = cast<SequentialType>(Ty)->getElementType(); 2579 2580 // If this is a constant subscript, handle it quickly. 2581 if (const ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2582 if (CI->getZExtValue() == 0) continue; 2583 uint64_t Offs = 2584 TD->getTypeAllocSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 2585 SDValue OffsVal; 2586 EVT PTy = TLI.getPointerTy(); 2587 unsigned PtrBits = PTy.getSizeInBits(); 2588 if (PtrBits < 64) 2589 OffsVal = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), 2590 TLI.getPointerTy(), 2591 DAG.getConstant(Offs, MVT::i64)); 2592 else 2593 OffsVal = DAG.getIntPtrConstant(Offs); 2594 2595 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), N.getValueType(), N, 2596 OffsVal); 2597 continue; 2598 } 2599 2600 // N = N + Idx * ElementSize; 2601 APInt ElementSize = APInt(TLI.getPointerTy().getSizeInBits(), 2602 TD->getTypeAllocSize(Ty)); 2603 SDValue IdxN = getValue(Idx); 2604 2605 // If the index is smaller or larger than intptr_t, truncate or extend 2606 // it. 2607 IdxN = DAG.getSExtOrTrunc(IdxN, getCurDebugLoc(), N.getValueType()); 2608 2609 // If this is a multiply by a power of two, turn it into a shl 2610 // immediately. This is a very common case. 2611 if (ElementSize != 1) { 2612 if (ElementSize.isPowerOf2()) { 2613 unsigned Amt = ElementSize.logBase2(); 2614 IdxN = DAG.getNode(ISD::SHL, getCurDebugLoc(), 2615 N.getValueType(), IdxN, 2616 DAG.getConstant(Amt, TLI.getPointerTy())); 2617 } else { 2618 SDValue Scale = DAG.getConstant(ElementSize, TLI.getPointerTy()); 2619 IdxN = DAG.getNode(ISD::MUL, getCurDebugLoc(), 2620 N.getValueType(), IdxN, Scale); 2621 } 2622 } 2623 2624 N = DAG.getNode(ISD::ADD, getCurDebugLoc(), 2625 N.getValueType(), N, IdxN); 2626 } 2627 } 2628 2629 setValue(&I, N); 2630} 2631 2632void SelectionDAGBuilder::visitAlloca(const AllocaInst &I) { 2633 // If this is a fixed sized alloca in the entry block of the function, 2634 // allocate it statically on the stack. 2635 if (FuncInfo.StaticAllocaMap.count(&I)) 2636 return; // getValue will auto-populate this. 2637 2638 const Type *Ty = I.getAllocatedType(); 2639 uint64_t TySize = TLI.getTargetData()->getTypeAllocSize(Ty); 2640 unsigned Align = 2641 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 2642 I.getAlignment()); 2643 2644 SDValue AllocSize = getValue(I.getArraySize()); 2645 2646 EVT IntPtr = TLI.getPointerTy(); 2647 if (AllocSize.getValueType() != IntPtr) 2648 AllocSize = DAG.getZExtOrTrunc(AllocSize, getCurDebugLoc(), IntPtr); 2649 2650 AllocSize = DAG.getNode(ISD::MUL, getCurDebugLoc(), IntPtr, 2651 AllocSize, 2652 DAG.getConstant(TySize, IntPtr)); 2653 2654 // Handle alignment. If the requested alignment is less than or equal to 2655 // the stack alignment, ignore it. If the size is greater than or equal to 2656 // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 2657 unsigned StackAlign = TM.getFrameInfo()->getStackAlignment(); 2658 if (Align <= StackAlign) 2659 Align = 0; 2660 2661 // Round the size of the allocation up to the stack alignment size 2662 // by add SA-1 to the size. 2663 AllocSize = DAG.getNode(ISD::ADD, getCurDebugLoc(), 2664 AllocSize.getValueType(), AllocSize, 2665 DAG.getIntPtrConstant(StackAlign-1)); 2666 2667 // Mask out the low bits for alignment purposes. 2668 AllocSize = DAG.getNode(ISD::AND, getCurDebugLoc(), 2669 AllocSize.getValueType(), AllocSize, 2670 DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 2671 2672 SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 2673 SDVTList VTs = DAG.getVTList(AllocSize.getValueType(), MVT::Other); 2674 SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, getCurDebugLoc(), 2675 VTs, Ops, 3); 2676 setValue(&I, DSA); 2677 DAG.setRoot(DSA.getValue(1)); 2678 2679 // Inform the Frame Information that we have just allocated a variable-sized 2680 // object. 2681 FuncInfo.MF->getFrameInfo()->CreateVariableSizedObject(); 2682} 2683 2684void SelectionDAGBuilder::visitLoad(const LoadInst &I) { 2685 const Value *SV = I.getOperand(0); 2686 SDValue Ptr = getValue(SV); 2687 2688 const Type *Ty = I.getType(); 2689 2690 bool isVolatile = I.isVolatile(); 2691 bool isNonTemporal = I.getMetadata("nontemporal") != 0; 2692 unsigned Alignment = I.getAlignment(); 2693 2694 SmallVector<EVT, 4> ValueVTs; 2695 SmallVector<uint64_t, 4> Offsets; 2696 ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 2697 unsigned NumValues = ValueVTs.size(); 2698 if (NumValues == 0) 2699 return; 2700 2701 SDValue Root; 2702 bool ConstantMemory = false; 2703 if (I.isVolatile()) 2704 // Serialize volatile loads with other side effects. 2705 Root = getRoot(); 2706 else if (AA->pointsToConstantMemory(SV)) { 2707 // Do not serialize (non-volatile) loads of constant memory with anything. 2708 Root = DAG.getEntryNode(); 2709 ConstantMemory = true; 2710 } else { 2711 // Do not serialize non-volatile loads against each other. 2712 Root = DAG.getRoot(); 2713 } 2714 2715 SmallVector<SDValue, 4> Values(NumValues); 2716 SmallVector<SDValue, 4> Chains(NumValues); 2717 EVT PtrVT = Ptr.getValueType(); 2718 for (unsigned i = 0; i != NumValues; ++i) { 2719 SDValue A = DAG.getNode(ISD::ADD, getCurDebugLoc(), 2720 PtrVT, Ptr, 2721 DAG.getConstant(Offsets[i], PtrVT)); 2722 SDValue L = DAG.getLoad(ValueVTs[i], getCurDebugLoc(), Root, 2723 A, SV, Offsets[i], isVolatile, 2724 isNonTemporal, Alignment); 2725 2726 Values[i] = L; 2727 Chains[i] = L.getValue(1); 2728 } 2729 2730 if (!ConstantMemory) { 2731 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), 2732 MVT::Other, &Chains[0], NumValues); 2733 if (isVolatile) 2734 DAG.setRoot(Chain); 2735 else 2736 PendingLoads.push_back(Chain); 2737 } 2738 2739 setValue(&I, DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(), 2740 DAG.getVTList(&ValueVTs[0], NumValues), 2741 &Values[0], NumValues)); 2742} 2743 2744void SelectionDAGBuilder::visitStore(const StoreInst &I) { 2745 const Value *SrcV = I.getOperand(0); 2746 const Value *PtrV = I.getOperand(1); 2747 2748 SmallVector<EVT, 4> ValueVTs; 2749 SmallVector<uint64_t, 4> Offsets; 2750 ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 2751 unsigned NumValues = ValueVTs.size(); 2752 if (NumValues == 0) 2753 return; 2754 2755 // Get the lowered operands. Note that we do this after 2756 // checking if NumResults is zero, because with zero results 2757 // the operands won't have values in the map. 2758 SDValue Src = getValue(SrcV); 2759 SDValue Ptr = getValue(PtrV); 2760 2761 SDValue Root = getRoot(); 2762 SmallVector<SDValue, 4> Chains(NumValues); 2763 EVT PtrVT = Ptr.getValueType(); 2764 bool isVolatile = I.isVolatile(); 2765 bool isNonTemporal = I.getMetadata("nontemporal") != 0; 2766 unsigned Alignment = I.getAlignment(); 2767 2768 for (unsigned i = 0; i != NumValues; ++i) { 2769 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT, Ptr, 2770 DAG.getConstant(Offsets[i], PtrVT)); 2771 Chains[i] = DAG.getStore(Root, getCurDebugLoc(), 2772 SDValue(Src.getNode(), Src.getResNo() + i), 2773 Add, PtrV, Offsets[i], isVolatile, 2774 isNonTemporal, Alignment); 2775 } 2776 2777 DAG.setRoot(DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), 2778 MVT::Other, &Chains[0], NumValues)); 2779} 2780 2781/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 2782/// node. 2783void SelectionDAGBuilder::visitTargetIntrinsic(const CallInst &I, 2784 unsigned Intrinsic) { 2785 bool HasChain = !I.doesNotAccessMemory(); 2786 bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2787 2788 // Build the operand list. 2789 SmallVector<SDValue, 8> Ops; 2790 if (HasChain) { // If this intrinsic has side-effects, chainify it. 2791 if (OnlyLoad) { 2792 // We don't need to serialize loads against other loads. 2793 Ops.push_back(DAG.getRoot()); 2794 } else { 2795 Ops.push_back(getRoot()); 2796 } 2797 } 2798 2799 // Info is set by getTgtMemInstrinsic 2800 TargetLowering::IntrinsicInfo Info; 2801 bool IsTgtIntrinsic = TLI.getTgtMemIntrinsic(Info, I, Intrinsic); 2802 2803 // Add the intrinsic ID as an integer operand if it's not a target intrinsic. 2804 if (!IsTgtIntrinsic) 2805 Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 2806 2807 // Add all operands of the call to the operand list. 2808 for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 2809 SDValue Op = getValue(I.getOperand(i)); 2810 assert(TLI.isTypeLegal(Op.getValueType()) && 2811 "Intrinsic uses a non-legal type?"); 2812 Ops.push_back(Op); 2813 } 2814 2815 SmallVector<EVT, 4> ValueVTs; 2816 ComputeValueVTs(TLI, I.getType(), ValueVTs); 2817#ifndef NDEBUG 2818 for (unsigned Val = 0, E = ValueVTs.size(); Val != E; ++Val) { 2819 assert(TLI.isTypeLegal(ValueVTs[Val]) && 2820 "Intrinsic uses a non-legal type?"); 2821 } 2822#endif // NDEBUG 2823 2824 if (HasChain) 2825 ValueVTs.push_back(MVT::Other); 2826 2827 SDVTList VTs = DAG.getVTList(ValueVTs.data(), ValueVTs.size()); 2828 2829 // Create the node. 2830 SDValue Result; 2831 if (IsTgtIntrinsic) { 2832 // This is target intrinsic that touches memory 2833 Result = DAG.getMemIntrinsicNode(Info.opc, getCurDebugLoc(), 2834 VTs, &Ops[0], Ops.size(), 2835 Info.memVT, Info.ptrVal, Info.offset, 2836 Info.align, Info.vol, 2837 Info.readMem, Info.writeMem); 2838 } else if (!HasChain) { 2839 Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, getCurDebugLoc(), 2840 VTs, &Ops[0], Ops.size()); 2841 } else if (!I.getType()->isVoidTy()) { 2842 Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, getCurDebugLoc(), 2843 VTs, &Ops[0], Ops.size()); 2844 } else { 2845 Result = DAG.getNode(ISD::INTRINSIC_VOID, getCurDebugLoc(), 2846 VTs, &Ops[0], Ops.size()); 2847 } 2848 2849 if (HasChain) { 2850 SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1); 2851 if (OnlyLoad) 2852 PendingLoads.push_back(Chain); 2853 else 2854 DAG.setRoot(Chain); 2855 } 2856 2857 if (!I.getType()->isVoidTy()) { 2858 if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 2859 EVT VT = TLI.getValueType(PTy); 2860 Result = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), VT, Result); 2861 } 2862 2863 setValue(&I, Result); 2864 } 2865} 2866 2867/// GetSignificand - Get the significand and build it into a floating-point 2868/// number with exponent of 1: 2869/// 2870/// Op = (Op & 0x007fffff) | 0x3f800000; 2871/// 2872/// where Op is the hexidecimal representation of floating point value. 2873static SDValue 2874GetSignificand(SelectionDAG &DAG, SDValue Op, DebugLoc dl) { 2875 SDValue t1 = DAG.getNode(ISD::AND, dl, MVT::i32, Op, 2876 DAG.getConstant(0x007fffff, MVT::i32)); 2877 SDValue t2 = DAG.getNode(ISD::OR, dl, MVT::i32, t1, 2878 DAG.getConstant(0x3f800000, MVT::i32)); 2879 return DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t2); 2880} 2881 2882/// GetExponent - Get the exponent: 2883/// 2884/// (float)(int)(((Op & 0x7f800000) >> 23) - 127); 2885/// 2886/// where Op is the hexidecimal representation of floating point value. 2887static SDValue 2888GetExponent(SelectionDAG &DAG, SDValue Op, const TargetLowering &TLI, 2889 DebugLoc dl) { 2890 SDValue t0 = DAG.getNode(ISD::AND, dl, MVT::i32, Op, 2891 DAG.getConstant(0x7f800000, MVT::i32)); 2892 SDValue t1 = DAG.getNode(ISD::SRL, dl, MVT::i32, t0, 2893 DAG.getConstant(23, TLI.getPointerTy())); 2894 SDValue t2 = DAG.getNode(ISD::SUB, dl, MVT::i32, t1, 2895 DAG.getConstant(127, MVT::i32)); 2896 return DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, t2); 2897} 2898 2899/// getF32Constant - Get 32-bit floating point constant. 2900static SDValue 2901getF32Constant(SelectionDAG &DAG, unsigned Flt) { 2902 return DAG.getConstantFP(APFloat(APInt(32, Flt)), MVT::f32); 2903} 2904 2905/// Inlined utility function to implement binary input atomic intrinsics for 2906/// visitIntrinsicCall: I is a call instruction 2907/// Op is the associated NodeType for I 2908const char * 2909SelectionDAGBuilder::implVisitBinaryAtomic(const CallInst& I, 2910 ISD::NodeType Op) { 2911 SDValue Root = getRoot(); 2912 SDValue L = 2913 DAG.getAtomic(Op, getCurDebugLoc(), 2914 getValue(I.getOperand(2)).getValueType().getSimpleVT(), 2915 Root, 2916 getValue(I.getOperand(1)), 2917 getValue(I.getOperand(2)), 2918 I.getOperand(1)); 2919 setValue(&I, L); 2920 DAG.setRoot(L.getValue(1)); 2921 return 0; 2922} 2923 2924// implVisitAluOverflow - Lower arithmetic overflow instrinsics. 2925const char * 2926SelectionDAGBuilder::implVisitAluOverflow(const CallInst &I, ISD::NodeType Op) { 2927 SDValue Op1 = getValue(I.getOperand(1)); 2928 SDValue Op2 = getValue(I.getOperand(2)); 2929 2930 SDVTList VTs = DAG.getVTList(Op1.getValueType(), MVT::i1); 2931 setValue(&I, DAG.getNode(Op, getCurDebugLoc(), VTs, Op1, Op2)); 2932 return 0; 2933} 2934 2935/// visitExp - Lower an exp intrinsic. Handles the special sequences for 2936/// limited-precision mode. 2937void 2938SelectionDAGBuilder::visitExp(const CallInst &I) { 2939 SDValue result; 2940 DebugLoc dl = getCurDebugLoc(); 2941 2942 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 && 2943 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 2944 SDValue Op = getValue(I.getOperand(1)); 2945 2946 // Put the exponent in the right bit position for later addition to the 2947 // final result: 2948 // 2949 // #define LOG2OFe 1.4426950f 2950 // IntegerPartOfX = ((int32_t)(X * LOG2OFe)); 2951 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op, 2952 getF32Constant(DAG, 0x3fb8aa3b)); 2953 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0); 2954 2955 // FractionalPartOfX = (X * LOG2OFe) - (float)IntegerPartOfX; 2956 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX); 2957 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1); 2958 2959 // IntegerPartOfX <<= 23; 2960 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX, 2961 DAG.getConstant(23, TLI.getPointerTy())); 2962 2963 if (LimitFloatPrecision <= 6) { 2964 // For floating-point precision of 6: 2965 // 2966 // TwoToFractionalPartOfX = 2967 // 0.997535578f + 2968 // (0.735607626f + 0.252464424f * x) * x; 2969 // 2970 // error 0.0144103317, which is 6 bits 2971 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 2972 getF32Constant(DAG, 0x3e814304)); 2973 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 2974 getF32Constant(DAG, 0x3f3c50c8)); 2975 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 2976 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 2977 getF32Constant(DAG, 0x3f7f5e7e)); 2978 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl,MVT::i32, t5); 2979 2980 // Add the exponent into the result in integer domain. 2981 SDValue t6 = DAG.getNode(ISD::ADD, dl, MVT::i32, 2982 TwoToFracPartOfX, IntegerPartOfX); 2983 2984 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t6); 2985 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 2986 // For floating-point precision of 12: 2987 // 2988 // TwoToFractionalPartOfX = 2989 // 0.999892986f + 2990 // (0.696457318f + 2991 // (0.224338339f + 0.792043434e-1f * x) * x) * x; 2992 // 2993 // 0.000107046256 error, which is 13 to 14 bits 2994 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 2995 getF32Constant(DAG, 0x3da235e3)); 2996 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 2997 getF32Constant(DAG, 0x3e65b8f3)); 2998 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 2999 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3000 getF32Constant(DAG, 0x3f324b07)); 3001 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3002 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3003 getF32Constant(DAG, 0x3f7ff8fd)); 3004 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl,MVT::i32, t7); 3005 3006 // Add the exponent into the result in integer domain. 3007 SDValue t8 = DAG.getNode(ISD::ADD, dl, MVT::i32, 3008 TwoToFracPartOfX, IntegerPartOfX); 3009 3010 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t8); 3011 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3012 // For floating-point precision of 18: 3013 // 3014 // TwoToFractionalPartOfX = 3015 // 0.999999982f + 3016 // (0.693148872f + 3017 // (0.240227044f + 3018 // (0.554906021e-1f + 3019 // (0.961591928e-2f + 3020 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x; 3021 // 3022 // error 2.47208000*10^(-7), which is better than 18 bits 3023 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3024 getF32Constant(DAG, 0x3924b03e)); 3025 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3026 getF32Constant(DAG, 0x3ab24b87)); 3027 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3028 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3029 getF32Constant(DAG, 0x3c1d8c17)); 3030 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3031 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3032 getF32Constant(DAG, 0x3d634a1d)); 3033 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3034 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8, 3035 getF32Constant(DAG, 0x3e75fe14)); 3036 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X); 3037 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10, 3038 getF32Constant(DAG, 0x3f317234)); 3039 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X); 3040 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12, 3041 getF32Constant(DAG, 0x3f800000)); 3042 SDValue TwoToFracPartOfX = DAG.getNode(ISD::BIT_CONVERT, dl, 3043 MVT::i32, t13); 3044 3045 // Add the exponent into the result in integer domain. 3046 SDValue t14 = DAG.getNode(ISD::ADD, dl, MVT::i32, 3047 TwoToFracPartOfX, IntegerPartOfX); 3048 3049 result = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f32, t14); 3050 } 3051 } else { 3052 // No special expansion. 3053 result = DAG.getNode(ISD::FEXP, dl, 3054 getValue(I.getOperand(1)).getValueType(), 3055 getValue(I.getOperand(1))); 3056 } 3057 3058 setValue(&I, result); 3059} 3060 3061/// visitLog - Lower a log intrinsic. Handles the special sequences for 3062/// limited-precision mode. 3063void 3064SelectionDAGBuilder::visitLog(const CallInst &I) { 3065 SDValue result; 3066 DebugLoc dl = getCurDebugLoc(); 3067 3068 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 && 3069 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3070 SDValue Op = getValue(I.getOperand(1)); 3071 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op); 3072 3073 // Scale the exponent by log(2) [0.69314718f]. 3074 SDValue Exp = GetExponent(DAG, Op1, TLI, dl); 3075 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp, 3076 getF32Constant(DAG, 0x3f317218)); 3077 3078 // Get the significand and build it into a floating-point number with 3079 // exponent of 1. 3080 SDValue X = GetSignificand(DAG, Op1, dl); 3081 3082 if (LimitFloatPrecision <= 6) { 3083 // For floating-point precision of 6: 3084 // 3085 // LogofMantissa = 3086 // -1.1609546f + 3087 // (1.4034025f - 0.23903021f * x) * x; 3088 // 3089 // error 0.0034276066, which is better than 8 bits 3090 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3091 getF32Constant(DAG, 0xbe74c456)); 3092 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3093 getF32Constant(DAG, 0x3fb3a2b1)); 3094 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3095 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3096 getF32Constant(DAG, 0x3f949a29)); 3097 3098 result = DAG.getNode(ISD::FADD, dl, 3099 MVT::f32, LogOfExponent, LogOfMantissa); 3100 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 3101 // For floating-point precision of 12: 3102 // 3103 // LogOfMantissa = 3104 // -1.7417939f + 3105 // (2.8212026f + 3106 // (-1.4699568f + 3107 // (0.44717955f - 0.56570851e-1f * x) * x) * x) * x; 3108 // 3109 // error 0.000061011436, which is 14 bits 3110 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3111 getF32Constant(DAG, 0xbd67b6d6)); 3112 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3113 getF32Constant(DAG, 0x3ee4f4b8)); 3114 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3115 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3116 getF32Constant(DAG, 0x3fbc278b)); 3117 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3118 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3119 getF32Constant(DAG, 0x40348e95)); 3120 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3121 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6, 3122 getF32Constant(DAG, 0x3fdef31a)); 3123 3124 result = DAG.getNode(ISD::FADD, dl, 3125 MVT::f32, LogOfExponent, LogOfMantissa); 3126 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3127 // For floating-point precision of 18: 3128 // 3129 // LogOfMantissa = 3130 // -2.1072184f + 3131 // (4.2372794f + 3132 // (-3.7029485f + 3133 // (2.2781945f + 3134 // (-0.87823314f + 3135 // (0.19073739f - 0.17809712e-1f * x) * x) * x) * x) * x)*x; 3136 // 3137 // error 0.0000023660568, which is better than 18 bits 3138 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3139 getF32Constant(DAG, 0xbc91e5ac)); 3140 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3141 getF32Constant(DAG, 0x3e4350aa)); 3142 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3143 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3144 getF32Constant(DAG, 0x3f60d3e3)); 3145 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3146 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3147 getF32Constant(DAG, 0x4011cdf0)); 3148 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3149 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6, 3150 getF32Constant(DAG, 0x406cfd1c)); 3151 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3152 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8, 3153 getF32Constant(DAG, 0x408797cb)); 3154 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X); 3155 SDValue LogOfMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10, 3156 getF32Constant(DAG, 0x4006dcab)); 3157 3158 result = DAG.getNode(ISD::FADD, dl, 3159 MVT::f32, LogOfExponent, LogOfMantissa); 3160 } 3161 } else { 3162 // No special expansion. 3163 result = DAG.getNode(ISD::FLOG, dl, 3164 getValue(I.getOperand(1)).getValueType(), 3165 getValue(I.getOperand(1))); 3166 } 3167 3168 setValue(&I, result); 3169} 3170 3171/// visitLog2 - Lower a log2 intrinsic. Handles the special sequences for 3172/// limited-precision mode. 3173void 3174SelectionDAGBuilder::visitLog2(const CallInst &I) { 3175 SDValue result; 3176 DebugLoc dl = getCurDebugLoc(); 3177 3178 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 && 3179 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3180 SDValue Op = getValue(I.getOperand(1)); 3181 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op); 3182 3183 // Get the exponent. 3184 SDValue LogOfExponent = GetExponent(DAG, Op1, TLI, dl); 3185 3186 // Get the significand and build it into a floating-point number with 3187 // exponent of 1. 3188 SDValue X = GetSignificand(DAG, Op1, dl); 3189 3190 // Different possible minimax approximations of significand in 3191 // floating-point for various degrees of accuracy over [1,2]. 3192 if (LimitFloatPrecision <= 6) { 3193 // For floating-point precision of 6: 3194 // 3195 // Log2ofMantissa = -1.6749035f + (2.0246817f - .34484768f * x) * x; 3196 // 3197 // error 0.0049451742, which is more than 7 bits 3198 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3199 getF32Constant(DAG, 0xbeb08fe0)); 3200 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3201 getF32Constant(DAG, 0x40019463)); 3202 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3203 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3204 getF32Constant(DAG, 0x3fd6633d)); 3205 3206 result = DAG.getNode(ISD::FADD, dl, 3207 MVT::f32, LogOfExponent, Log2ofMantissa); 3208 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 3209 // For floating-point precision of 12: 3210 // 3211 // Log2ofMantissa = 3212 // -2.51285454f + 3213 // (4.07009056f + 3214 // (-2.12067489f + 3215 // (.645142248f - 0.816157886e-1f * x) * x) * x) * x; 3216 // 3217 // error 0.0000876136000, which is better than 13 bits 3218 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3219 getF32Constant(DAG, 0xbda7262e)); 3220 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3221 getF32Constant(DAG, 0x3f25280b)); 3222 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3223 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3224 getF32Constant(DAG, 0x4007b923)); 3225 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3226 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3227 getF32Constant(DAG, 0x40823e2f)); 3228 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3229 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6, 3230 getF32Constant(DAG, 0x4020d29c)); 3231 3232 result = DAG.getNode(ISD::FADD, dl, 3233 MVT::f32, LogOfExponent, Log2ofMantissa); 3234 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3235 // For floating-point precision of 18: 3236 // 3237 // Log2ofMantissa = 3238 // -3.0400495f + 3239 // (6.1129976f + 3240 // (-5.3420409f + 3241 // (3.2865683f + 3242 // (-1.2669343f + 3243 // (0.27515199f - 3244 // 0.25691327e-1f * x) * x) * x) * x) * x) * x; 3245 // 3246 // error 0.0000018516, which is better than 18 bits 3247 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3248 getF32Constant(DAG, 0xbcd2769e)); 3249 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3250 getF32Constant(DAG, 0x3e8ce0b9)); 3251 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3252 SDValue t3 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3253 getF32Constant(DAG, 0x3fa22ae7)); 3254 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3255 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3256 getF32Constant(DAG, 0x40525723)); 3257 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3258 SDValue t7 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t6, 3259 getF32Constant(DAG, 0x40aaf200)); 3260 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3261 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8, 3262 getF32Constant(DAG, 0x40c39dad)); 3263 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X); 3264 SDValue Log2ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t10, 3265 getF32Constant(DAG, 0x4042902c)); 3266 3267 result = DAG.getNode(ISD::FADD, dl, 3268 MVT::f32, LogOfExponent, Log2ofMantissa); 3269 } 3270 } else { 3271 // No special expansion. 3272 result = DAG.getNode(ISD::FLOG2, dl, 3273 getValue(I.getOperand(1)).getValueType(), 3274 getValue(I.getOperand(1))); 3275 } 3276 3277 setValue(&I, result); 3278} 3279 3280/// visitLog10 - Lower a log10 intrinsic. Handles the special sequences for 3281/// limited-precision mode. 3282void 3283SelectionDAGBuilder::visitLog10(const CallInst &I) { 3284 SDValue result; 3285 DebugLoc dl = getCurDebugLoc(); 3286 3287 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 && 3288 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3289 SDValue Op = getValue(I.getOperand(1)); 3290 SDValue Op1 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, Op); 3291 3292 // Scale the exponent by log10(2) [0.30102999f]. 3293 SDValue Exp = GetExponent(DAG, Op1, TLI, dl); 3294 SDValue LogOfExponent = DAG.getNode(ISD::FMUL, dl, MVT::f32, Exp, 3295 getF32Constant(DAG, 0x3e9a209a)); 3296 3297 // Get the significand and build it into a floating-point number with 3298 // exponent of 1. 3299 SDValue X = GetSignificand(DAG, Op1, dl); 3300 3301 if (LimitFloatPrecision <= 6) { 3302 // For floating-point precision of 6: 3303 // 3304 // Log10ofMantissa = 3305 // -0.50419619f + 3306 // (0.60948995f - 0.10380950f * x) * x; 3307 // 3308 // error 0.0014886165, which is 6 bits 3309 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3310 getF32Constant(DAG, 0xbdd49a13)); 3311 SDValue t1 = DAG.getNode(ISD::FADD, dl, MVT::f32, t0, 3312 getF32Constant(DAG, 0x3f1c0789)); 3313 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3314 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t2, 3315 getF32Constant(DAG, 0x3f011300)); 3316 3317 result = DAG.getNode(ISD::FADD, dl, 3318 MVT::f32, LogOfExponent, Log10ofMantissa); 3319 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 3320 // For floating-point precision of 12: 3321 // 3322 // Log10ofMantissa = 3323 // -0.64831180f + 3324 // (0.91751397f + 3325 // (-0.31664806f + 0.47637168e-1f * x) * x) * x; 3326 // 3327 // error 0.00019228036, which is better than 12 bits 3328 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3329 getF32Constant(DAG, 0x3d431f31)); 3330 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, 3331 getF32Constant(DAG, 0x3ea21fb2)); 3332 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3333 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3334 getF32Constant(DAG, 0x3f6ae232)); 3335 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3336 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4, 3337 getF32Constant(DAG, 0x3f25f7c3)); 3338 3339 result = DAG.getNode(ISD::FADD, dl, 3340 MVT::f32, LogOfExponent, Log10ofMantissa); 3341 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3342 // For floating-point precision of 18: 3343 // 3344 // Log10ofMantissa = 3345 // -0.84299375f + 3346 // (1.5327582f + 3347 // (-1.0688956f + 3348 // (0.49102474f + 3349 // (-0.12539807f + 0.13508273e-1f * x) * x) * x) * x) * x; 3350 // 3351 // error 0.0000037995730, which is better than 18 bits 3352 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3353 getF32Constant(DAG, 0x3c5d51ce)); 3354 SDValue t1 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, 3355 getF32Constant(DAG, 0x3e00685a)); 3356 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t1, X); 3357 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3358 getF32Constant(DAG, 0x3efb6798)); 3359 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3360 SDValue t5 = DAG.getNode(ISD::FSUB, dl, MVT::f32, t4, 3361 getF32Constant(DAG, 0x3f88d192)); 3362 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3363 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3364 getF32Constant(DAG, 0x3fc4316c)); 3365 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3366 SDValue Log10ofMantissa = DAG.getNode(ISD::FSUB, dl, MVT::f32, t8, 3367 getF32Constant(DAG, 0x3f57ce70)); 3368 3369 result = DAG.getNode(ISD::FADD, dl, 3370 MVT::f32, LogOfExponent, Log10ofMantissa); 3371 } 3372 } else { 3373 // No special expansion. 3374 result = DAG.getNode(ISD::FLOG10, dl, 3375 getValue(I.getOperand(1)).getValueType(), 3376 getValue(I.getOperand(1))); 3377 } 3378 3379 setValue(&I, result); 3380} 3381 3382/// visitExp2 - Lower an exp2 intrinsic. Handles the special sequences for 3383/// limited-precision mode. 3384void 3385SelectionDAGBuilder::visitExp2(const CallInst &I) { 3386 SDValue result; 3387 DebugLoc dl = getCurDebugLoc(); 3388 3389 if (getValue(I.getOperand(1)).getValueType() == MVT::f32 && 3390 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3391 SDValue Op = getValue(I.getOperand(1)); 3392 3393 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, Op); 3394 3395 // FractionalPartOfX = x - (float)IntegerPartOfX; 3396 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX); 3397 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, Op, t1); 3398 3399 // IntegerPartOfX <<= 23; 3400 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX, 3401 DAG.getConstant(23, TLI.getPointerTy())); 3402 3403 if (LimitFloatPrecision <= 6) { 3404 // For floating-point precision of 6: 3405 // 3406 // TwoToFractionalPartOfX = 3407 // 0.997535578f + 3408 // (0.735607626f + 0.252464424f * x) * x; 3409 // 3410 // error 0.0144103317, which is 6 bits 3411 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3412 getF32Constant(DAG, 0x3e814304)); 3413 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3414 getF32Constant(DAG, 0x3f3c50c8)); 3415 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3416 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3417 getF32Constant(DAG, 0x3f7f5e7e)); 3418 SDValue t6 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t5); 3419 SDValue TwoToFractionalPartOfX = 3420 DAG.getNode(ISD::ADD, dl, MVT::i32, t6, IntegerPartOfX); 3421 3422 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3423 MVT::f32, TwoToFractionalPartOfX); 3424 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 3425 // For floating-point precision of 12: 3426 // 3427 // TwoToFractionalPartOfX = 3428 // 0.999892986f + 3429 // (0.696457318f + 3430 // (0.224338339f + 0.792043434e-1f * x) * x) * x; 3431 // 3432 // error 0.000107046256, which is 13 to 14 bits 3433 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3434 getF32Constant(DAG, 0x3da235e3)); 3435 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3436 getF32Constant(DAG, 0x3e65b8f3)); 3437 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3438 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3439 getF32Constant(DAG, 0x3f324b07)); 3440 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3441 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3442 getF32Constant(DAG, 0x3f7ff8fd)); 3443 SDValue t8 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t7); 3444 SDValue TwoToFractionalPartOfX = 3445 DAG.getNode(ISD::ADD, dl, MVT::i32, t8, IntegerPartOfX); 3446 3447 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3448 MVT::f32, TwoToFractionalPartOfX); 3449 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3450 // For floating-point precision of 18: 3451 // 3452 // TwoToFractionalPartOfX = 3453 // 0.999999982f + 3454 // (0.693148872f + 3455 // (0.240227044f + 3456 // (0.554906021e-1f + 3457 // (0.961591928e-2f + 3458 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x; 3459 // error 2.47208000*10^(-7), which is better than 18 bits 3460 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3461 getF32Constant(DAG, 0x3924b03e)); 3462 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3463 getF32Constant(DAG, 0x3ab24b87)); 3464 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3465 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3466 getF32Constant(DAG, 0x3c1d8c17)); 3467 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3468 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3469 getF32Constant(DAG, 0x3d634a1d)); 3470 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3471 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8, 3472 getF32Constant(DAG, 0x3e75fe14)); 3473 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X); 3474 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10, 3475 getF32Constant(DAG, 0x3f317234)); 3476 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X); 3477 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12, 3478 getF32Constant(DAG, 0x3f800000)); 3479 SDValue t14 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t13); 3480 SDValue TwoToFractionalPartOfX = 3481 DAG.getNode(ISD::ADD, dl, MVT::i32, t14, IntegerPartOfX); 3482 3483 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3484 MVT::f32, TwoToFractionalPartOfX); 3485 } 3486 } else { 3487 // No special expansion. 3488 result = DAG.getNode(ISD::FEXP2, dl, 3489 getValue(I.getOperand(1)).getValueType(), 3490 getValue(I.getOperand(1))); 3491 } 3492 3493 setValue(&I, result); 3494} 3495 3496/// visitPow - Lower a pow intrinsic. Handles the special sequences for 3497/// limited-precision mode with x == 10.0f. 3498void 3499SelectionDAGBuilder::visitPow(const CallInst &I) { 3500 SDValue result; 3501 const Value *Val = I.getOperand(1); 3502 DebugLoc dl = getCurDebugLoc(); 3503 bool IsExp10 = false; 3504 3505 if (getValue(Val).getValueType() == MVT::f32 && 3506 getValue(I.getOperand(2)).getValueType() == MVT::f32 && 3507 LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3508 if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(Val))) { 3509 if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { 3510 APFloat Ten(10.0f); 3511 IsExp10 = CFP->getValueAPF().bitwiseIsEqual(Ten); 3512 } 3513 } 3514 } 3515 3516 if (IsExp10 && LimitFloatPrecision > 0 && LimitFloatPrecision <= 18) { 3517 SDValue Op = getValue(I.getOperand(2)); 3518 3519 // Put the exponent in the right bit position for later addition to the 3520 // final result: 3521 // 3522 // #define LOG2OF10 3.3219281f 3523 // IntegerPartOfX = (int32_t)(x * LOG2OF10); 3524 SDValue t0 = DAG.getNode(ISD::FMUL, dl, MVT::f32, Op, 3525 getF32Constant(DAG, 0x40549a78)); 3526 SDValue IntegerPartOfX = DAG.getNode(ISD::FP_TO_SINT, dl, MVT::i32, t0); 3527 3528 // FractionalPartOfX = x - (float)IntegerPartOfX; 3529 SDValue t1 = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, IntegerPartOfX); 3530 SDValue X = DAG.getNode(ISD::FSUB, dl, MVT::f32, t0, t1); 3531 3532 // IntegerPartOfX <<= 23; 3533 IntegerPartOfX = DAG.getNode(ISD::SHL, dl, MVT::i32, IntegerPartOfX, 3534 DAG.getConstant(23, TLI.getPointerTy())); 3535 3536 if (LimitFloatPrecision <= 6) { 3537 // For floating-point precision of 6: 3538 // 3539 // twoToFractionalPartOfX = 3540 // 0.997535578f + 3541 // (0.735607626f + 0.252464424f * x) * x; 3542 // 3543 // error 0.0144103317, which is 6 bits 3544 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3545 getF32Constant(DAG, 0x3e814304)); 3546 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3547 getF32Constant(DAG, 0x3f3c50c8)); 3548 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3549 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3550 getF32Constant(DAG, 0x3f7f5e7e)); 3551 SDValue t6 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t5); 3552 SDValue TwoToFractionalPartOfX = 3553 DAG.getNode(ISD::ADD, dl, MVT::i32, t6, IntegerPartOfX); 3554 3555 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3556 MVT::f32, TwoToFractionalPartOfX); 3557 } else if (LimitFloatPrecision > 6 && LimitFloatPrecision <= 12) { 3558 // For floating-point precision of 12: 3559 // 3560 // TwoToFractionalPartOfX = 3561 // 0.999892986f + 3562 // (0.696457318f + 3563 // (0.224338339f + 0.792043434e-1f * x) * x) * x; 3564 // 3565 // error 0.000107046256, which is 13 to 14 bits 3566 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3567 getF32Constant(DAG, 0x3da235e3)); 3568 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3569 getF32Constant(DAG, 0x3e65b8f3)); 3570 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3571 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3572 getF32Constant(DAG, 0x3f324b07)); 3573 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3574 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3575 getF32Constant(DAG, 0x3f7ff8fd)); 3576 SDValue t8 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t7); 3577 SDValue TwoToFractionalPartOfX = 3578 DAG.getNode(ISD::ADD, dl, MVT::i32, t8, IntegerPartOfX); 3579 3580 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3581 MVT::f32, TwoToFractionalPartOfX); 3582 } else { // LimitFloatPrecision > 12 && LimitFloatPrecision <= 18 3583 // For floating-point precision of 18: 3584 // 3585 // TwoToFractionalPartOfX = 3586 // 0.999999982f + 3587 // (0.693148872f + 3588 // (0.240227044f + 3589 // (0.554906021e-1f + 3590 // (0.961591928e-2f + 3591 // (0.136028312e-2f + 0.157059148e-3f *x)*x)*x)*x)*x)*x; 3592 // error 2.47208000*10^(-7), which is better than 18 bits 3593 SDValue t2 = DAG.getNode(ISD::FMUL, dl, MVT::f32, X, 3594 getF32Constant(DAG, 0x3924b03e)); 3595 SDValue t3 = DAG.getNode(ISD::FADD, dl, MVT::f32, t2, 3596 getF32Constant(DAG, 0x3ab24b87)); 3597 SDValue t4 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t3, X); 3598 SDValue t5 = DAG.getNode(ISD::FADD, dl, MVT::f32, t4, 3599 getF32Constant(DAG, 0x3c1d8c17)); 3600 SDValue t6 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t5, X); 3601 SDValue t7 = DAG.getNode(ISD::FADD, dl, MVT::f32, t6, 3602 getF32Constant(DAG, 0x3d634a1d)); 3603 SDValue t8 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t7, X); 3604 SDValue t9 = DAG.getNode(ISD::FADD, dl, MVT::f32, t8, 3605 getF32Constant(DAG, 0x3e75fe14)); 3606 SDValue t10 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t9, X); 3607 SDValue t11 = DAG.getNode(ISD::FADD, dl, MVT::f32, t10, 3608 getF32Constant(DAG, 0x3f317234)); 3609 SDValue t12 = DAG.getNode(ISD::FMUL, dl, MVT::f32, t11, X); 3610 SDValue t13 = DAG.getNode(ISD::FADD, dl, MVT::f32, t12, 3611 getF32Constant(DAG, 0x3f800000)); 3612 SDValue t14 = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::i32, t13); 3613 SDValue TwoToFractionalPartOfX = 3614 DAG.getNode(ISD::ADD, dl, MVT::i32, t14, IntegerPartOfX); 3615 3616 result = DAG.getNode(ISD::BIT_CONVERT, dl, 3617 MVT::f32, TwoToFractionalPartOfX); 3618 } 3619 } else { 3620 // No special expansion. 3621 result = DAG.getNode(ISD::FPOW, dl, 3622 getValue(I.getOperand(1)).getValueType(), 3623 getValue(I.getOperand(1)), 3624 getValue(I.getOperand(2))); 3625 } 3626 3627 setValue(&I, result); 3628} 3629 3630 3631/// ExpandPowI - Expand a llvm.powi intrinsic. 3632static SDValue ExpandPowI(DebugLoc DL, SDValue LHS, SDValue RHS, 3633 SelectionDAG &DAG) { 3634 // If RHS is a constant, we can expand this out to a multiplication tree, 3635 // otherwise we end up lowering to a call to __powidf2 (for example). When 3636 // optimizing for size, we only want to do this if the expansion would produce 3637 // a small number of multiplies, otherwise we do the full expansion. 3638 if (ConstantSDNode *RHSC = dyn_cast<ConstantSDNode>(RHS)) { 3639 // Get the exponent as a positive value. 3640 unsigned Val = RHSC->getSExtValue(); 3641 if ((int)Val < 0) Val = -Val; 3642 3643 // powi(x, 0) -> 1.0 3644 if (Val == 0) 3645 return DAG.getConstantFP(1.0, LHS.getValueType()); 3646 3647 const Function *F = DAG.getMachineFunction().getFunction(); 3648 if (!F->hasFnAttr(Attribute::OptimizeForSize) || 3649 // If optimizing for size, don't insert too many multiplies. This 3650 // inserts up to 5 multiplies. 3651 CountPopulation_32(Val)+Log2_32(Val) < 7) { 3652 // We use the simple binary decomposition method to generate the multiply 3653 // sequence. There are more optimal ways to do this (for example, 3654 // powi(x,15) generates one more multiply than it should), but this has 3655 // the benefit of being both really simple and much better than a libcall. 3656 SDValue Res; // Logically starts equal to 1.0 3657 SDValue CurSquare = LHS; 3658 while (Val) { 3659 if (Val & 1) { 3660 if (Res.getNode()) 3661 Res = DAG.getNode(ISD::FMUL, DL,Res.getValueType(), Res, CurSquare); 3662 else 3663 Res = CurSquare; // 1.0*CurSquare. 3664 } 3665 3666 CurSquare = DAG.getNode(ISD::FMUL, DL, CurSquare.getValueType(), 3667 CurSquare, CurSquare); 3668 Val >>= 1; 3669 } 3670 3671 // If the original was negative, invert the result, producing 1/(x*x*x). 3672 if (RHSC->getSExtValue() < 0) 3673 Res = DAG.getNode(ISD::FDIV, DL, LHS.getValueType(), 3674 DAG.getConstantFP(1.0, LHS.getValueType()), Res); 3675 return Res; 3676 } 3677 } 3678 3679 // Otherwise, expand to a libcall. 3680 return DAG.getNode(ISD::FPOWI, DL, LHS.getValueType(), LHS, RHS); 3681} 3682 3683/// EmitFuncArgumentDbgValue - If the DbgValueInst is a dbg_value of a function 3684/// argument, create the corresponding DBG_VALUE machine instruction for it now. 3685/// At the end of instruction selection, they will be inserted to the entry BB. 3686bool 3687SelectionDAGBuilder::EmitFuncArgumentDbgValue(const DbgValueInst &DI, 3688 const Value *V, MDNode *Variable, 3689 uint64_t Offset, 3690 const SDValue &N) { 3691 if (!isa<Argument>(V)) 3692 return false; 3693 3694 MachineFunction &MF = DAG.getMachineFunction(); 3695 // Ignore inlined function arguments here. 3696 DIVariable DV(Variable); 3697 if (DV.isInlinedFnArgument(MF.getFunction())) 3698 return false; 3699 3700 MachineBasicBlock *MBB = FuncInfo.MBBMap[DI.getParent()]; 3701 if (MBB != &MF.front()) 3702 return false; 3703 3704 unsigned Reg = 0; 3705 if (N.getOpcode() == ISD::CopyFromReg) { 3706 Reg = cast<RegisterSDNode>(N.getOperand(1))->getReg(); 3707 if (Reg && TargetRegisterInfo::isVirtualRegister(Reg)) { 3708 MachineRegisterInfo &RegInfo = MF.getRegInfo(); 3709 unsigned PR = RegInfo.getLiveInPhysReg(Reg); 3710 if (PR) 3711 Reg = PR; 3712 } 3713 } 3714 3715 if (!Reg) { 3716 DenseMap<const Value *, unsigned>::iterator VMI = FuncInfo.ValueMap.find(V); 3717 if (VMI == FuncInfo.ValueMap.end()) 3718 return false; 3719 Reg = VMI->second; 3720 } 3721 3722 const TargetInstrInfo *TII = DAG.getTarget().getInstrInfo(); 3723 MachineInstrBuilder MIB = BuildMI(MF, getCurDebugLoc(), 3724 TII->get(TargetOpcode::DBG_VALUE)) 3725 .addReg(Reg, RegState::Debug).addImm(Offset).addMetadata(Variable); 3726 FuncInfo.ArgDbgValues.push_back(&*MIB); 3727 return true; 3728} 3729 3730// VisualStudio defines setjmp as _setjmp 3731#if defined(_MSC_VER) && defined(setjmp) 3732#define setjmp_undefined_for_visual_studio 3733#undef setjmp 3734#endif 3735 3736/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3737/// we want to emit this as a call to a named external function, return the name 3738/// otherwise lower it and return null. 3739const char * 3740SelectionDAGBuilder::visitIntrinsicCall(const CallInst &I, unsigned Intrinsic) { 3741 DebugLoc dl = getCurDebugLoc(); 3742 SDValue Res; 3743 3744 switch (Intrinsic) { 3745 default: 3746 // By default, turn this into a target intrinsic node. 3747 visitTargetIntrinsic(I, Intrinsic); 3748 return 0; 3749 case Intrinsic::vastart: visitVAStart(I); return 0; 3750 case Intrinsic::vaend: visitVAEnd(I); return 0; 3751 case Intrinsic::vacopy: visitVACopy(I); return 0; 3752 case Intrinsic::returnaddress: 3753 setValue(&I, DAG.getNode(ISD::RETURNADDR, dl, TLI.getPointerTy(), 3754 getValue(I.getOperand(1)))); 3755 return 0; 3756 case Intrinsic::frameaddress: 3757 setValue(&I, DAG.getNode(ISD::FRAMEADDR, dl, TLI.getPointerTy(), 3758 getValue(I.getOperand(1)))); 3759 return 0; 3760 case Intrinsic::setjmp: 3761 return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3762 case Intrinsic::longjmp: 3763 return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3764 case Intrinsic::memcpy: { 3765 // Assert for address < 256 since we support only user defined address 3766 // spaces. 3767 assert(cast<PointerType>(I.getOperand(1)->getType())->getAddressSpace() 3768 < 256 && 3769 cast<PointerType>(I.getOperand(2)->getType())->getAddressSpace() 3770 < 256 && 3771 "Unknown address space"); 3772 SDValue Op1 = getValue(I.getOperand(1)); 3773 SDValue Op2 = getValue(I.getOperand(2)); 3774 SDValue Op3 = getValue(I.getOperand(3)); 3775 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3776 bool isVol = cast<ConstantInt>(I.getOperand(5))->getZExtValue(); 3777 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, isVol, false, 3778 I.getOperand(1), 0, I.getOperand(2), 0)); 3779 return 0; 3780 } 3781 case Intrinsic::memset: { 3782 // Assert for address < 256 since we support only user defined address 3783 // spaces. 3784 assert(cast<PointerType>(I.getOperand(1)->getType())->getAddressSpace() 3785 < 256 && 3786 "Unknown address space"); 3787 SDValue Op1 = getValue(I.getOperand(1)); 3788 SDValue Op2 = getValue(I.getOperand(2)); 3789 SDValue Op3 = getValue(I.getOperand(3)); 3790 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3791 bool isVol = cast<ConstantInt>(I.getOperand(5))->getZExtValue(); 3792 DAG.setRoot(DAG.getMemset(getRoot(), dl, Op1, Op2, Op3, Align, isVol, 3793 I.getOperand(1), 0)); 3794 return 0; 3795 } 3796 case Intrinsic::memmove: { 3797 // Assert for address < 256 since we support only user defined address 3798 // spaces. 3799 assert(cast<PointerType>(I.getOperand(1)->getType())->getAddressSpace() 3800 < 256 && 3801 cast<PointerType>(I.getOperand(2)->getType())->getAddressSpace() 3802 < 256 && 3803 "Unknown address space"); 3804 SDValue Op1 = getValue(I.getOperand(1)); 3805 SDValue Op2 = getValue(I.getOperand(2)); 3806 SDValue Op3 = getValue(I.getOperand(3)); 3807 unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3808 bool isVol = cast<ConstantInt>(I.getOperand(5))->getZExtValue(); 3809 3810 // If the source and destination are known to not be aliases, we can 3811 // lower memmove as memcpy. 3812 uint64_t Size = -1ULL; 3813 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3814 Size = C->getZExtValue(); 3815 if (AA->alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3816 AliasAnalysis::NoAlias) { 3817 DAG.setRoot(DAG.getMemcpy(getRoot(), dl, Op1, Op2, Op3, Align, isVol, 3818 false, I.getOperand(1), 0, I.getOperand(2), 0)); 3819 return 0; 3820 } 3821 3822 DAG.setRoot(DAG.getMemmove(getRoot(), dl, Op1, Op2, Op3, Align, isVol, 3823 I.getOperand(1), 0, I.getOperand(2), 0)); 3824 return 0; 3825 } 3826 case Intrinsic::dbg_declare: { 3827 const DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3828 if (!DIVariable(DI.getVariable()).Verify()) 3829 return 0; 3830 3831 MDNode *Variable = DI.getVariable(); 3832 // Parameters are handled specially. 3833 bool isParameter = 3834 DIVariable(Variable).getTag() == dwarf::DW_TAG_arg_variable; 3835 const Value *Address = DI.getAddress(); 3836 if (!Address) 3837 return 0; 3838 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(Address)) 3839 Address = BCI->getOperand(0); 3840 const AllocaInst *AI = dyn_cast<AllocaInst>(Address); 3841 if (AI) { 3842 // Don't handle byval arguments or VLAs, for example. 3843 // Non-byval arguments are handled here (they refer to the stack temporary 3844 // alloca at this point). 3845 DenseMap<const AllocaInst*, int>::iterator SI = 3846 FuncInfo.StaticAllocaMap.find(AI); 3847 if (SI == FuncInfo.StaticAllocaMap.end()) 3848 return 0; // VLAs. 3849 int FI = SI->second; 3850 3851 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI(); 3852 if (!DI.getDebugLoc().isUnknown() && MMI.hasDebugInfo()) 3853 MMI.setVariableDbgInfo(Variable, FI, DI.getDebugLoc()); 3854 } 3855 3856 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder 3857 // but do not always have a corresponding SDNode built. The SDNodeOrder 3858 // absolute, but not relative, values are different depending on whether 3859 // debug info exists. 3860 ++SDNodeOrder; 3861 SDValue &N = NodeMap[Address]; 3862 SDDbgValue *SDV; 3863 if (N.getNode()) { 3864 if (isParameter && !AI) { 3865 FrameIndexSDNode *FINode = dyn_cast<FrameIndexSDNode>(N.getNode()); 3866 if (FINode) 3867 // Byval parameter. We have a frame index at this point. 3868 SDV = DAG.getDbgValue(Variable, FINode->getIndex(), 3869 0, dl, SDNodeOrder); 3870 else 3871 // Can't do anything with other non-AI cases yet. This might be a 3872 // parameter of a callee function that got inlined, for example. 3873 return 0; 3874 } else if (AI) 3875 SDV = DAG.getDbgValue(Variable, N.getNode(), N.getResNo(), 3876 0, dl, SDNodeOrder); 3877 else 3878 // Can't do anything with other non-AI cases yet. 3879 return 0; 3880 DAG.AddDbgValue(SDV, N.getNode(), isParameter); 3881 } else { 3882 // This isn't useful, but it shows what we're missing. 3883 SDV = DAG.getDbgValue(Variable, UndefValue::get(Address->getType()), 3884 0, dl, SDNodeOrder); 3885 DAG.AddDbgValue(SDV, 0, isParameter); 3886 } 3887 return 0; 3888 } 3889 case Intrinsic::dbg_value: { 3890 const DbgValueInst &DI = cast<DbgValueInst>(I); 3891 if (!DIVariable(DI.getVariable()).Verify()) 3892 return 0; 3893 3894 MDNode *Variable = DI.getVariable(); 3895 uint64_t Offset = DI.getOffset(); 3896 const Value *V = DI.getValue(); 3897 if (!V) 3898 return 0; 3899 3900 // Build an entry in DbgOrdering. Debug info input nodes get an SDNodeOrder 3901 // but do not always have a corresponding SDNode built. The SDNodeOrder 3902 // absolute, but not relative, values are different depending on whether 3903 // debug info exists. 3904 ++SDNodeOrder; 3905 SDDbgValue *SDV; 3906 if (isa<ConstantInt>(V) || isa<ConstantFP>(V)) { 3907 SDV = DAG.getDbgValue(Variable, V, Offset, dl, SDNodeOrder); 3908 DAG.AddDbgValue(SDV, 0, false); 3909 } else { 3910 bool createUndef = false; 3911 // FIXME : Why not use getValue() directly ? 3912 SDValue &N = NodeMap[V]; 3913 if (N.getNode()) { 3914 if (!EmitFuncArgumentDbgValue(DI, V, Variable, Offset, N)) { 3915 SDV = DAG.getDbgValue(Variable, N.getNode(), 3916 N.getResNo(), Offset, dl, SDNodeOrder); 3917 DAG.AddDbgValue(SDV, N.getNode(), false); 3918 } 3919 } else if (isa<PHINode>(V) && !V->use_empty()) { 3920 SDValue N = getValue(V); 3921 if (N.getNode()) { 3922 if (!EmitFuncArgumentDbgValue(DI, V, Variable, Offset, N)) { 3923 SDV = DAG.getDbgValue(Variable, N.getNode(), 3924 N.getResNo(), Offset, dl, SDNodeOrder); 3925 DAG.AddDbgValue(SDV, N.getNode(), false); 3926 } 3927 } else 3928 createUndef = true; 3929 } else 3930 createUndef = true; 3931 if (createUndef) { 3932 // We may expand this to cover more cases. One case where we have no 3933 // data available is an unreferenced parameter; we need this fallback. 3934 SDV = DAG.getDbgValue(Variable, UndefValue::get(V->getType()), 3935 Offset, dl, SDNodeOrder); 3936 DAG.AddDbgValue(SDV, 0, false); 3937 } 3938 } 3939 3940 // Build a debug info table entry. 3941 if (const BitCastInst *BCI = dyn_cast<BitCastInst>(V)) 3942 V = BCI->getOperand(0); 3943 const AllocaInst *AI = dyn_cast<AllocaInst>(V); 3944 // Don't handle byval struct arguments or VLAs, for example. 3945 if (!AI) 3946 return 0; 3947 DenseMap<const AllocaInst*, int>::iterator SI = 3948 FuncInfo.StaticAllocaMap.find(AI); 3949 if (SI == FuncInfo.StaticAllocaMap.end()) 3950 return 0; // VLAs. 3951 int FI = SI->second; 3952 3953 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI(); 3954 if (!DI.getDebugLoc().isUnknown() && MMI.hasDebugInfo()) 3955 MMI.setVariableDbgInfo(Variable, FI, DI.getDebugLoc()); 3956 return 0; 3957 } 3958 case Intrinsic::eh_exception: { 3959 // Insert the EXCEPTIONADDR instruction. 3960 assert(FuncInfo.MBBMap[I.getParent()]->isLandingPad() && 3961 "Call to eh.exception not in landing pad!"); 3962 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3963 SDValue Ops[1]; 3964 Ops[0] = DAG.getRoot(); 3965 SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, dl, VTs, Ops, 1); 3966 setValue(&I, Op); 3967 DAG.setRoot(Op.getValue(1)); 3968 return 0; 3969 } 3970 3971 case Intrinsic::eh_selector: { 3972 MachineBasicBlock *CallMBB = FuncInfo.MBBMap[I.getParent()]; 3973 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI(); 3974 if (CallMBB->isLandingPad()) 3975 AddCatchInfo(I, &MMI, CallMBB); 3976 else { 3977#ifndef NDEBUG 3978 FuncInfo.CatchInfoLost.insert(&I); 3979#endif 3980 // FIXME: Mark exception selector register as live in. Hack for PR1508. 3981 unsigned Reg = TLI.getExceptionSelectorRegister(); 3982 if (Reg) FuncInfo.MBBMap[I.getParent()]->addLiveIn(Reg); 3983 } 3984 3985 // Insert the EHSELECTION instruction. 3986 SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3987 SDValue Ops[2]; 3988 Ops[0] = getValue(I.getOperand(1)); 3989 Ops[1] = getRoot(); 3990 SDValue Op = DAG.getNode(ISD::EHSELECTION, dl, VTs, Ops, 2); 3991 DAG.setRoot(Op.getValue(1)); 3992 setValue(&I, DAG.getSExtOrTrunc(Op, dl, MVT::i32)); 3993 return 0; 3994 } 3995 3996 case Intrinsic::eh_typeid_for: { 3997 // Find the type id for the given typeinfo. 3998 GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 3999 unsigned TypeID = DAG.getMachineFunction().getMMI().getTypeIDFor(GV); 4000 Res = DAG.getConstant(TypeID, MVT::i32); 4001 setValue(&I, Res); 4002 return 0; 4003 } 4004 4005 case Intrinsic::eh_return_i32: 4006 case Intrinsic::eh_return_i64: 4007 DAG.getMachineFunction().getMMI().setCallsEHReturn(true); 4008 DAG.setRoot(DAG.getNode(ISD::EH_RETURN, dl, 4009 MVT::Other, 4010 getControlRoot(), 4011 getValue(I.getOperand(1)), 4012 getValue(I.getOperand(2)))); 4013 return 0; 4014 case Intrinsic::eh_unwind_init: 4015 DAG.getMachineFunction().getMMI().setCallsUnwindInit(true); 4016 return 0; 4017 case Intrinsic::eh_dwarf_cfa: { 4018 EVT VT = getValue(I.getOperand(1)).getValueType(); 4019 SDValue CfaArg = DAG.getSExtOrTrunc(getValue(I.getOperand(1)), dl, 4020 TLI.getPointerTy()); 4021 SDValue Offset = DAG.getNode(ISD::ADD, dl, 4022 TLI.getPointerTy(), 4023 DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, dl, 4024 TLI.getPointerTy()), 4025 CfaArg); 4026 SDValue FA = DAG.getNode(ISD::FRAMEADDR, dl, 4027 TLI.getPointerTy(), 4028 DAG.getConstant(0, TLI.getPointerTy())); 4029 setValue(&I, DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), 4030 FA, Offset)); 4031 return 0; 4032 } 4033 case Intrinsic::eh_sjlj_callsite: { 4034 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI(); 4035 ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(1)); 4036 assert(CI && "Non-constant call site value in eh.sjlj.callsite!"); 4037 assert(MMI.getCurrentCallSite() == 0 && "Overlapping call sites!"); 4038 4039 MMI.setCurrentCallSite(CI->getZExtValue()); 4040 return 0; 4041 } 4042 case Intrinsic::eh_sjlj_setjmp: { 4043 setValue(&I, DAG.getNode(ISD::EH_SJLJ_SETJMP, dl, MVT::i32, getRoot(), 4044 getValue(I.getOperand(1)))); 4045 return 0; 4046 } 4047 case Intrinsic::eh_sjlj_longjmp: { 4048 DAG.setRoot(DAG.getNode(ISD::EH_SJLJ_LONGJMP, dl, MVT::Other, 4049 getRoot(), 4050 getValue(I.getOperand(1)))); 4051 return 0; 4052 } 4053 4054 case Intrinsic::convertff: 4055 case Intrinsic::convertfsi: 4056 case Intrinsic::convertfui: 4057 case Intrinsic::convertsif: 4058 case Intrinsic::convertuif: 4059 case Intrinsic::convertss: 4060 case Intrinsic::convertsu: 4061 case Intrinsic::convertus: 4062 case Intrinsic::convertuu: { 4063 ISD::CvtCode Code = ISD::CVT_INVALID; 4064 switch (Intrinsic) { 4065 case Intrinsic::convertff: Code = ISD::CVT_FF; break; 4066 case Intrinsic::convertfsi: Code = ISD::CVT_FS; break; 4067 case Intrinsic::convertfui: Code = ISD::CVT_FU; break; 4068 case Intrinsic::convertsif: Code = ISD::CVT_SF; break; 4069 case Intrinsic::convertuif: Code = ISD::CVT_UF; break; 4070 case Intrinsic::convertss: Code = ISD::CVT_SS; break; 4071 case Intrinsic::convertsu: Code = ISD::CVT_SU; break; 4072 case Intrinsic::convertus: Code = ISD::CVT_US; break; 4073 case Intrinsic::convertuu: Code = ISD::CVT_UU; break; 4074 } 4075 EVT DestVT = TLI.getValueType(I.getType()); 4076 const Value *Op1 = I.getOperand(1); 4077 Res = DAG.getConvertRndSat(DestVT, getCurDebugLoc(), getValue(Op1), 4078 DAG.getValueType(DestVT), 4079 DAG.getValueType(getValue(Op1).getValueType()), 4080 getValue(I.getOperand(2)), 4081 getValue(I.getOperand(3)), 4082 Code); 4083 setValue(&I, Res); 4084 return 0; 4085 } 4086 case Intrinsic::sqrt: 4087 setValue(&I, DAG.getNode(ISD::FSQRT, dl, 4088 getValue(I.getOperand(1)).getValueType(), 4089 getValue(I.getOperand(1)))); 4090 return 0; 4091 case Intrinsic::powi: 4092 setValue(&I, ExpandPowI(dl, getValue(I.getOperand(1)), 4093 getValue(I.getOperand(2)), DAG)); 4094 return 0; 4095 case Intrinsic::sin: 4096 setValue(&I, DAG.getNode(ISD::FSIN, dl, 4097 getValue(I.getOperand(1)).getValueType(), 4098 getValue(I.getOperand(1)))); 4099 return 0; 4100 case Intrinsic::cos: 4101 setValue(&I, DAG.getNode(ISD::FCOS, dl, 4102 getValue(I.getOperand(1)).getValueType(), 4103 getValue(I.getOperand(1)))); 4104 return 0; 4105 case Intrinsic::log: 4106 visitLog(I); 4107 return 0; 4108 case Intrinsic::log2: 4109 visitLog2(I); 4110 return 0; 4111 case Intrinsic::log10: 4112 visitLog10(I); 4113 return 0; 4114 case Intrinsic::exp: 4115 visitExp(I); 4116 return 0; 4117 case Intrinsic::exp2: 4118 visitExp2(I); 4119 return 0; 4120 case Intrinsic::pow: 4121 visitPow(I); 4122 return 0; 4123 case Intrinsic::convert_to_fp16: 4124 setValue(&I, DAG.getNode(ISD::FP32_TO_FP16, dl, 4125 MVT::i16, getValue(I.getOperand(1)))); 4126 return 0; 4127 case Intrinsic::convert_from_fp16: 4128 setValue(&I, DAG.getNode(ISD::FP16_TO_FP32, dl, 4129 MVT::f32, getValue(I.getOperand(1)))); 4130 return 0; 4131 case Intrinsic::pcmarker: { 4132 SDValue Tmp = getValue(I.getOperand(1)); 4133 DAG.setRoot(DAG.getNode(ISD::PCMARKER, dl, MVT::Other, getRoot(), Tmp)); 4134 return 0; 4135 } 4136 case Intrinsic::readcyclecounter: { 4137 SDValue Op = getRoot(); 4138 Res = DAG.getNode(ISD::READCYCLECOUNTER, dl, 4139 DAG.getVTList(MVT::i64, MVT::Other), 4140 &Op, 1); 4141 setValue(&I, Res); 4142 DAG.setRoot(Res.getValue(1)); 4143 return 0; 4144 } 4145 case Intrinsic::bswap: 4146 setValue(&I, DAG.getNode(ISD::BSWAP, dl, 4147 getValue(I.getOperand(1)).getValueType(), 4148 getValue(I.getOperand(1)))); 4149 return 0; 4150 case Intrinsic::cttz: { 4151 SDValue Arg = getValue(I.getOperand(1)); 4152 EVT Ty = Arg.getValueType(); 4153 setValue(&I, DAG.getNode(ISD::CTTZ, dl, Ty, Arg)); 4154 return 0; 4155 } 4156 case Intrinsic::ctlz: { 4157 SDValue Arg = getValue(I.getOperand(1)); 4158 EVT Ty = Arg.getValueType(); 4159 setValue(&I, DAG.getNode(ISD::CTLZ, dl, Ty, Arg)); 4160 return 0; 4161 } 4162 case Intrinsic::ctpop: { 4163 SDValue Arg = getValue(I.getOperand(1)); 4164 EVT Ty = Arg.getValueType(); 4165 setValue(&I, DAG.getNode(ISD::CTPOP, dl, Ty, Arg)); 4166 return 0; 4167 } 4168 case Intrinsic::stacksave: { 4169 SDValue Op = getRoot(); 4170 Res = DAG.getNode(ISD::STACKSAVE, dl, 4171 DAG.getVTList(TLI.getPointerTy(), MVT::Other), &Op, 1); 4172 setValue(&I, Res); 4173 DAG.setRoot(Res.getValue(1)); 4174 return 0; 4175 } 4176 case Intrinsic::stackrestore: { 4177 Res = getValue(I.getOperand(1)); 4178 DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, dl, MVT::Other, getRoot(), Res)); 4179 return 0; 4180 } 4181 case Intrinsic::stackprotector: { 4182 // Emit code into the DAG to store the stack guard onto the stack. 4183 MachineFunction &MF = DAG.getMachineFunction(); 4184 MachineFrameInfo *MFI = MF.getFrameInfo(); 4185 EVT PtrTy = TLI.getPointerTy(); 4186 4187 SDValue Src = getValue(I.getOperand(1)); // The guard's value. 4188 AllocaInst *Slot = cast<AllocaInst>(I.getOperand(2)); 4189 4190 int FI = FuncInfo.StaticAllocaMap[Slot]; 4191 MFI->setStackProtectorIndex(FI); 4192 4193 SDValue FIN = DAG.getFrameIndex(FI, PtrTy); 4194 4195 // Store the stack protector onto the stack. 4196 Res = DAG.getStore(getRoot(), getCurDebugLoc(), Src, FIN, 4197 PseudoSourceValue::getFixedStack(FI), 4198 0, true, false, 0); 4199 setValue(&I, Res); 4200 DAG.setRoot(Res); 4201 return 0; 4202 } 4203 case Intrinsic::objectsize: { 4204 // If we don't know by now, we're never going to know. 4205 ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(2)); 4206 4207 assert(CI && "Non-constant type in __builtin_object_size?"); 4208 4209 SDValue Arg = getValue(I.getOperand(0)); 4210 EVT Ty = Arg.getValueType(); 4211 4212 if (CI->getZExtValue() == 0) 4213 Res = DAG.getConstant(-1ULL, Ty); 4214 else 4215 Res = DAG.getConstant(0, Ty); 4216 4217 setValue(&I, Res); 4218 return 0; 4219 } 4220 case Intrinsic::var_annotation: 4221 // Discard annotate attributes 4222 return 0; 4223 4224 case Intrinsic::init_trampoline: { 4225 const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 4226 4227 SDValue Ops[6]; 4228 Ops[0] = getRoot(); 4229 Ops[1] = getValue(I.getOperand(1)); 4230 Ops[2] = getValue(I.getOperand(2)); 4231 Ops[3] = getValue(I.getOperand(3)); 4232 Ops[4] = DAG.getSrcValue(I.getOperand(1)); 4233 Ops[5] = DAG.getSrcValue(F); 4234 4235 Res = DAG.getNode(ISD::TRAMPOLINE, dl, 4236 DAG.getVTList(TLI.getPointerTy(), MVT::Other), 4237 Ops, 6); 4238 4239 setValue(&I, Res); 4240 DAG.setRoot(Res.getValue(1)); 4241 return 0; 4242 } 4243 case Intrinsic::gcroot: 4244 if (GFI) { 4245 const Value *Alloca = I.getOperand(1); 4246 const Constant *TypeMap = cast<Constant>(I.getOperand(2)); 4247 4248 FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode()); 4249 GFI->addStackRoot(FI->getIndex(), TypeMap); 4250 } 4251 return 0; 4252 case Intrinsic::gcread: 4253 case Intrinsic::gcwrite: 4254 llvm_unreachable("GC failed to lower gcread/gcwrite intrinsics!"); 4255 return 0; 4256 case Intrinsic::flt_rounds: 4257 setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, dl, MVT::i32)); 4258 return 0; 4259 case Intrinsic::trap: 4260 DAG.setRoot(DAG.getNode(ISD::TRAP, dl,MVT::Other, getRoot())); 4261 return 0; 4262 case Intrinsic::uadd_with_overflow: 4263 return implVisitAluOverflow(I, ISD::UADDO); 4264 case Intrinsic::sadd_with_overflow: 4265 return implVisitAluOverflow(I, ISD::SADDO); 4266 case Intrinsic::usub_with_overflow: 4267 return implVisitAluOverflow(I, ISD::USUBO); 4268 case Intrinsic::ssub_with_overflow: 4269 return implVisitAluOverflow(I, ISD::SSUBO); 4270 case Intrinsic::umul_with_overflow: 4271 return implVisitAluOverflow(I, ISD::UMULO); 4272 case Intrinsic::smul_with_overflow: 4273 return implVisitAluOverflow(I, ISD::SMULO); 4274 4275 case Intrinsic::prefetch: { 4276 SDValue Ops[4]; 4277 Ops[0] = getRoot(); 4278 Ops[1] = getValue(I.getOperand(1)); 4279 Ops[2] = getValue(I.getOperand(2)); 4280 Ops[3] = getValue(I.getOperand(3)); 4281 DAG.setRoot(DAG.getNode(ISD::PREFETCH, dl, MVT::Other, &Ops[0], 4)); 4282 return 0; 4283 } 4284 4285 case Intrinsic::memory_barrier: { 4286 SDValue Ops[6]; 4287 Ops[0] = getRoot(); 4288 for (int x = 1; x < 6; ++x) 4289 Ops[x] = getValue(I.getOperand(x)); 4290 4291 DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, dl, MVT::Other, &Ops[0], 6)); 4292 return 0; 4293 } 4294 case Intrinsic::atomic_cmp_swap: { 4295 SDValue Root = getRoot(); 4296 SDValue L = 4297 DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, getCurDebugLoc(), 4298 getValue(I.getOperand(2)).getValueType().getSimpleVT(), 4299 Root, 4300 getValue(I.getOperand(1)), 4301 getValue(I.getOperand(2)), 4302 getValue(I.getOperand(3)), 4303 I.getOperand(1)); 4304 setValue(&I, L); 4305 DAG.setRoot(L.getValue(1)); 4306 return 0; 4307 } 4308 case Intrinsic::atomic_load_add: 4309 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD); 4310 case Intrinsic::atomic_load_sub: 4311 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB); 4312 case Intrinsic::atomic_load_or: 4313 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR); 4314 case Intrinsic::atomic_load_xor: 4315 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR); 4316 case Intrinsic::atomic_load_and: 4317 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND); 4318 case Intrinsic::atomic_load_nand: 4319 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND); 4320 case Intrinsic::atomic_load_max: 4321 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX); 4322 case Intrinsic::atomic_load_min: 4323 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN); 4324 case Intrinsic::atomic_load_umin: 4325 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN); 4326 case Intrinsic::atomic_load_umax: 4327 return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX); 4328 case Intrinsic::atomic_swap: 4329 return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP); 4330 4331 case Intrinsic::invariant_start: 4332 case Intrinsic::lifetime_start: 4333 // Discard region information. 4334 setValue(&I, DAG.getUNDEF(TLI.getPointerTy())); 4335 return 0; 4336 case Intrinsic::invariant_end: 4337 case Intrinsic::lifetime_end: 4338 // Discard region information. 4339 return 0; 4340 } 4341} 4342 4343void SelectionDAGBuilder::LowerCallTo(ImmutableCallSite CS, SDValue Callee, 4344 bool isTailCall, 4345 MachineBasicBlock *LandingPad) { 4346 const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 4347 const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 4348 const Type *RetTy = FTy->getReturnType(); 4349 MachineModuleInfo &MMI = DAG.getMachineFunction().getMMI(); 4350 MCSymbol *BeginLabel = 0; 4351 4352 TargetLowering::ArgListTy Args; 4353 TargetLowering::ArgListEntry Entry; 4354 Args.reserve(CS.arg_size()); 4355 4356 // Check whether the function can return without sret-demotion. 4357 SmallVector<EVT, 4> OutVTs; 4358 SmallVector<ISD::ArgFlagsTy, 4> OutsFlags; 4359 SmallVector<uint64_t, 4> Offsets; 4360 getReturnInfo(RetTy, CS.getAttributes().getRetAttributes(), 4361 OutVTs, OutsFlags, TLI, &Offsets); 4362 4363 bool CanLowerReturn = TLI.CanLowerReturn(CS.getCallingConv(), 4364 FTy->isVarArg(), OutVTs, OutsFlags, DAG); 4365 4366 SDValue DemoteStackSlot; 4367 4368 if (!CanLowerReturn) { 4369 uint64_t TySize = TLI.getTargetData()->getTypeAllocSize( 4370 FTy->getReturnType()); 4371 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment( 4372 FTy->getReturnType()); 4373 MachineFunction &MF = DAG.getMachineFunction(); 4374 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false); 4375 const Type *StackSlotPtrType = PointerType::getUnqual(FTy->getReturnType()); 4376 4377 DemoteStackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 4378 Entry.Node = DemoteStackSlot; 4379 Entry.Ty = StackSlotPtrType; 4380 Entry.isSExt = false; 4381 Entry.isZExt = false; 4382 Entry.isInReg = false; 4383 Entry.isSRet = true; 4384 Entry.isNest = false; 4385 Entry.isByVal = false; 4386 Entry.Alignment = Align; 4387 Args.push_back(Entry); 4388 RetTy = Type::getVoidTy(FTy->getContext()); 4389 } 4390 4391 for (ImmutableCallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 4392 i != e; ++i) { 4393 SDValue ArgNode = getValue(*i); 4394 Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 4395 4396 unsigned attrInd = i - CS.arg_begin() + 1; 4397 Entry.isSExt = CS.paramHasAttr(attrInd, Attribute::SExt); 4398 Entry.isZExt = CS.paramHasAttr(attrInd, Attribute::ZExt); 4399 Entry.isInReg = CS.paramHasAttr(attrInd, Attribute::InReg); 4400 Entry.isSRet = CS.paramHasAttr(attrInd, Attribute::StructRet); 4401 Entry.isNest = CS.paramHasAttr(attrInd, Attribute::Nest); 4402 Entry.isByVal = CS.paramHasAttr(attrInd, Attribute::ByVal); 4403 Entry.Alignment = CS.getParamAlignment(attrInd); 4404 Args.push_back(Entry); 4405 } 4406 4407 if (LandingPad) { 4408 // Insert a label before the invoke call to mark the try range. This can be 4409 // used to detect deletion of the invoke via the MachineModuleInfo. 4410 BeginLabel = MMI.getContext().CreateTempSymbol(); 4411 4412 // For SjLj, keep track of which landing pads go with which invokes 4413 // so as to maintain the ordering of pads in the LSDA. 4414 unsigned CallSiteIndex = MMI.getCurrentCallSite(); 4415 if (CallSiteIndex) { 4416 MMI.setCallSiteBeginLabel(BeginLabel, CallSiteIndex); 4417 // Now that the call site is handled, stop tracking it. 4418 MMI.setCurrentCallSite(0); 4419 } 4420 4421 // Both PendingLoads and PendingExports must be flushed here; 4422 // this call might not return. 4423 (void)getRoot(); 4424 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getControlRoot(), BeginLabel)); 4425 } 4426 4427 // Check if target-independent constraints permit a tail call here. 4428 // Target-dependent constraints are checked within TLI.LowerCallTo. 4429 if (isTailCall && 4430 !isInTailCallPosition(CS, CS.getAttributes().getRetAttributes(), TLI)) 4431 isTailCall = false; 4432 4433 std::pair<SDValue,SDValue> Result = 4434 TLI.LowerCallTo(getRoot(), RetTy, 4435 CS.paramHasAttr(0, Attribute::SExt), 4436 CS.paramHasAttr(0, Attribute::ZExt), FTy->isVarArg(), 4437 CS.paramHasAttr(0, Attribute::InReg), FTy->getNumParams(), 4438 CS.getCallingConv(), 4439 isTailCall, 4440 !CS.getInstruction()->use_empty(), 4441 Callee, Args, DAG, getCurDebugLoc()); 4442 assert((isTailCall || Result.second.getNode()) && 4443 "Non-null chain expected with non-tail call!"); 4444 assert((Result.second.getNode() || !Result.first.getNode()) && 4445 "Null value expected with tail call!"); 4446 if (Result.first.getNode()) { 4447 setValue(CS.getInstruction(), Result.first); 4448 } else if (!CanLowerReturn && Result.second.getNode()) { 4449 // The instruction result is the result of loading from the 4450 // hidden sret parameter. 4451 SmallVector<EVT, 1> PVTs; 4452 const Type *PtrRetTy = PointerType::getUnqual(FTy->getReturnType()); 4453 4454 ComputeValueVTs(TLI, PtrRetTy, PVTs); 4455 assert(PVTs.size() == 1 && "Pointers should fit in one register"); 4456 EVT PtrVT = PVTs[0]; 4457 unsigned NumValues = OutVTs.size(); 4458 SmallVector<SDValue, 4> Values(NumValues); 4459 SmallVector<SDValue, 4> Chains(NumValues); 4460 4461 for (unsigned i = 0; i < NumValues; ++i) { 4462 SDValue Add = DAG.getNode(ISD::ADD, getCurDebugLoc(), PtrVT, 4463 DemoteStackSlot, 4464 DAG.getConstant(Offsets[i], PtrVT)); 4465 SDValue L = DAG.getLoad(OutVTs[i], getCurDebugLoc(), Result.second, 4466 Add, NULL, Offsets[i], false, false, 1); 4467 Values[i] = L; 4468 Chains[i] = L.getValue(1); 4469 } 4470 4471 SDValue Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), 4472 MVT::Other, &Chains[0], NumValues); 4473 PendingLoads.push_back(Chain); 4474 4475 // Collect the legal value parts into potentially illegal values 4476 // that correspond to the original function's return values. 4477 SmallVector<EVT, 4> RetTys; 4478 RetTy = FTy->getReturnType(); 4479 ComputeValueVTs(TLI, RetTy, RetTys); 4480 ISD::NodeType AssertOp = ISD::DELETED_NODE; 4481 SmallVector<SDValue, 4> ReturnValues; 4482 unsigned CurReg = 0; 4483 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 4484 EVT VT = RetTys[I]; 4485 EVT RegisterVT = TLI.getRegisterType(RetTy->getContext(), VT); 4486 unsigned NumRegs = TLI.getNumRegisters(RetTy->getContext(), VT); 4487 4488 SDValue ReturnValue = 4489 getCopyFromParts(DAG, getCurDebugLoc(), &Values[CurReg], NumRegs, 4490 RegisterVT, VT, AssertOp); 4491 ReturnValues.push_back(ReturnValue); 4492 CurReg += NumRegs; 4493 } 4494 4495 setValue(CS.getInstruction(), 4496 DAG.getNode(ISD::MERGE_VALUES, getCurDebugLoc(), 4497 DAG.getVTList(&RetTys[0], RetTys.size()), 4498 &ReturnValues[0], ReturnValues.size())); 4499 4500 } 4501 4502 // As a special case, a null chain means that a tail call has been emitted and 4503 // the DAG root is already updated. 4504 if (Result.second.getNode()) 4505 DAG.setRoot(Result.second); 4506 else 4507 HasTailCall = true; 4508 4509 if (LandingPad) { 4510 // Insert a label at the end of the invoke call to mark the try range. This 4511 // can be used to detect deletion of the invoke via the MachineModuleInfo. 4512 MCSymbol *EndLabel = MMI.getContext().CreateTempSymbol(); 4513 DAG.setRoot(DAG.getEHLabel(getCurDebugLoc(), getRoot(), EndLabel)); 4514 4515 // Inform MachineModuleInfo of range. 4516 MMI.addInvoke(LandingPad, BeginLabel, EndLabel); 4517 } 4518} 4519 4520/// IsOnlyUsedInZeroEqualityComparison - Return true if it only matters that the 4521/// value is equal or not-equal to zero. 4522static bool IsOnlyUsedInZeroEqualityComparison(const Value *V) { 4523 for (Value::const_use_iterator UI = V->use_begin(), E = V->use_end(); 4524 UI != E; ++UI) { 4525 if (const ICmpInst *IC = dyn_cast<ICmpInst>(*UI)) 4526 if (IC->isEquality()) 4527 if (const Constant *C = dyn_cast<Constant>(IC->getOperand(1))) 4528 if (C->isNullValue()) 4529 continue; 4530 // Unknown instruction. 4531 return false; 4532 } 4533 return true; 4534} 4535 4536static SDValue getMemCmpLoad(const Value *PtrVal, MVT LoadVT, 4537 const Type *LoadTy, 4538 SelectionDAGBuilder &Builder) { 4539 4540 // Check to see if this load can be trivially constant folded, e.g. if the 4541 // input is from a string literal. 4542 if (const Constant *LoadInput = dyn_cast<Constant>(PtrVal)) { 4543 // Cast pointer to the type we really want to load. 4544 LoadInput = ConstantExpr::getBitCast(const_cast<Constant *>(LoadInput), 4545 PointerType::getUnqual(LoadTy)); 4546 4547 if (const Constant *LoadCst = 4548 ConstantFoldLoadFromConstPtr(const_cast<Constant *>(LoadInput), 4549 Builder.TD)) 4550 return Builder.getValue(LoadCst); 4551 } 4552 4553 // Otherwise, we have to emit the load. If the pointer is to unfoldable but 4554 // still constant memory, the input chain can be the entry node. 4555 SDValue Root; 4556 bool ConstantMemory = false; 4557 4558 // Do not serialize (non-volatile) loads of constant memory with anything. 4559 if (Builder.AA->pointsToConstantMemory(PtrVal)) { 4560 Root = Builder.DAG.getEntryNode(); 4561 ConstantMemory = true; 4562 } else { 4563 // Do not serialize non-volatile loads against each other. 4564 Root = Builder.DAG.getRoot(); 4565 } 4566 4567 SDValue Ptr = Builder.getValue(PtrVal); 4568 SDValue LoadVal = Builder.DAG.getLoad(LoadVT, Builder.getCurDebugLoc(), Root, 4569 Ptr, PtrVal /*SrcValue*/, 0/*SVOffset*/, 4570 false /*volatile*/, 4571 false /*nontemporal*/, 1 /* align=1 */); 4572 4573 if (!ConstantMemory) 4574 Builder.PendingLoads.push_back(LoadVal.getValue(1)); 4575 return LoadVal; 4576} 4577 4578 4579/// visitMemCmpCall - See if we can lower a call to memcmp in an optimized form. 4580/// If so, return true and lower it, otherwise return false and it will be 4581/// lowered like a normal call. 4582bool SelectionDAGBuilder::visitMemCmpCall(const CallInst &I) { 4583 // Verify that the prototype makes sense. int memcmp(void*,void*,size_t) 4584 if (I.getNumOperands() != 4) 4585 return false; 4586 4587 const Value *LHS = I.getOperand(1), *RHS = I.getOperand(2); 4588 if (!LHS->getType()->isPointerTy() || !RHS->getType()->isPointerTy() || 4589 !I.getOperand(3)->getType()->isIntegerTy() || 4590 !I.getType()->isIntegerTy()) 4591 return false; 4592 4593 const ConstantInt *Size = dyn_cast<ConstantInt>(I.getOperand(3)); 4594 4595 // memcmp(S1,S2,2) != 0 -> (*(short*)LHS != *(short*)RHS) != 0 4596 // memcmp(S1,S2,4) != 0 -> (*(int*)LHS != *(int*)RHS) != 0 4597 if (Size && IsOnlyUsedInZeroEqualityComparison(&I)) { 4598 bool ActuallyDoIt = true; 4599 MVT LoadVT; 4600 const Type *LoadTy; 4601 switch (Size->getZExtValue()) { 4602 default: 4603 LoadVT = MVT::Other; 4604 LoadTy = 0; 4605 ActuallyDoIt = false; 4606 break; 4607 case 2: 4608 LoadVT = MVT::i16; 4609 LoadTy = Type::getInt16Ty(Size->getContext()); 4610 break; 4611 case 4: 4612 LoadVT = MVT::i32; 4613 LoadTy = Type::getInt32Ty(Size->getContext()); 4614 break; 4615 case 8: 4616 LoadVT = MVT::i64; 4617 LoadTy = Type::getInt64Ty(Size->getContext()); 4618 break; 4619 /* 4620 case 16: 4621 LoadVT = MVT::v4i32; 4622 LoadTy = Type::getInt32Ty(Size->getContext()); 4623 LoadTy = VectorType::get(LoadTy, 4); 4624 break; 4625 */ 4626 } 4627 4628 // This turns into unaligned loads. We only do this if the target natively 4629 // supports the MVT we'll be loading or if it is small enough (<= 4) that 4630 // we'll only produce a small number of byte loads. 4631 4632 // Require that we can find a legal MVT, and only do this if the target 4633 // supports unaligned loads of that type. Expanding into byte loads would 4634 // bloat the code. 4635 if (ActuallyDoIt && Size->getZExtValue() > 4) { 4636 // TODO: Handle 5 byte compare as 4-byte + 1 byte. 4637 // TODO: Handle 8 byte compare on x86-32 as two 32-bit loads. 4638 if (!TLI.isTypeLegal(LoadVT) ||!TLI.allowsUnalignedMemoryAccesses(LoadVT)) 4639 ActuallyDoIt = false; 4640 } 4641 4642 if (ActuallyDoIt) { 4643 SDValue LHSVal = getMemCmpLoad(LHS, LoadVT, LoadTy, *this); 4644 SDValue RHSVal = getMemCmpLoad(RHS, LoadVT, LoadTy, *this); 4645 4646 SDValue Res = DAG.getSetCC(getCurDebugLoc(), MVT::i1, LHSVal, RHSVal, 4647 ISD::SETNE); 4648 EVT CallVT = TLI.getValueType(I.getType(), true); 4649 setValue(&I, DAG.getZExtOrTrunc(Res, getCurDebugLoc(), CallVT)); 4650 return true; 4651 } 4652 } 4653 4654 4655 return false; 4656} 4657 4658 4659void SelectionDAGBuilder::visitCall(const CallInst &I) { 4660 const char *RenameFn = 0; 4661 if (Function *F = I.getCalledFunction()) { 4662 if (F->isDeclaration()) { 4663 const TargetIntrinsicInfo *II = TM.getIntrinsicInfo(); 4664 if (II) { 4665 if (unsigned IID = II->getIntrinsicID(F)) { 4666 RenameFn = visitIntrinsicCall(I, IID); 4667 if (!RenameFn) 4668 return; 4669 } 4670 } 4671 if (unsigned IID = F->getIntrinsicID()) { 4672 RenameFn = visitIntrinsicCall(I, IID); 4673 if (!RenameFn) 4674 return; 4675 } 4676 } 4677 4678 // Check for well-known libc/libm calls. If the function is internal, it 4679 // can't be a library call. 4680 if (!F->hasLocalLinkage() && F->hasName()) { 4681 StringRef Name = F->getName(); 4682 if (Name == "copysign" || Name == "copysignf" || Name == "copysignl") { 4683 if (I.getNumOperands() == 3 && // Basic sanity checks. 4684 I.getOperand(1)->getType()->isFloatingPointTy() && 4685 I.getType() == I.getOperand(1)->getType() && 4686 I.getType() == I.getOperand(2)->getType()) { 4687 SDValue LHS = getValue(I.getOperand(1)); 4688 SDValue RHS = getValue(I.getOperand(2)); 4689 setValue(&I, DAG.getNode(ISD::FCOPYSIGN, getCurDebugLoc(), 4690 LHS.getValueType(), LHS, RHS)); 4691 return; 4692 } 4693 } else if (Name == "fabs" || Name == "fabsf" || Name == "fabsl") { 4694 if (I.getNumOperands() == 2 && // Basic sanity checks. 4695 I.getOperand(1)->getType()->isFloatingPointTy() && 4696 I.getType() == I.getOperand(1)->getType()) { 4697 SDValue Tmp = getValue(I.getOperand(1)); 4698 setValue(&I, DAG.getNode(ISD::FABS, getCurDebugLoc(), 4699 Tmp.getValueType(), Tmp)); 4700 return; 4701 } 4702 } else if (Name == "sin" || Name == "sinf" || Name == "sinl") { 4703 if (I.getNumOperands() == 2 && // Basic sanity checks. 4704 I.getOperand(1)->getType()->isFloatingPointTy() && 4705 I.getType() == I.getOperand(1)->getType() && 4706 I.onlyReadsMemory()) { 4707 SDValue Tmp = getValue(I.getOperand(1)); 4708 setValue(&I, DAG.getNode(ISD::FSIN, getCurDebugLoc(), 4709 Tmp.getValueType(), Tmp)); 4710 return; 4711 } 4712 } else if (Name == "cos" || Name == "cosf" || Name == "cosl") { 4713 if (I.getNumOperands() == 2 && // Basic sanity checks. 4714 I.getOperand(1)->getType()->isFloatingPointTy() && 4715 I.getType() == I.getOperand(1)->getType() && 4716 I.onlyReadsMemory()) { 4717 SDValue Tmp = getValue(I.getOperand(1)); 4718 setValue(&I, DAG.getNode(ISD::FCOS, getCurDebugLoc(), 4719 Tmp.getValueType(), Tmp)); 4720 return; 4721 } 4722 } else if (Name == "sqrt" || Name == "sqrtf" || Name == "sqrtl") { 4723 if (I.getNumOperands() == 2 && // Basic sanity checks. 4724 I.getOperand(1)->getType()->isFloatingPointTy() && 4725 I.getType() == I.getOperand(1)->getType() && 4726 I.onlyReadsMemory()) { 4727 SDValue Tmp = getValue(I.getOperand(1)); 4728 setValue(&I, DAG.getNode(ISD::FSQRT, getCurDebugLoc(), 4729 Tmp.getValueType(), Tmp)); 4730 return; 4731 } 4732 } else if (Name == "memcmp") { 4733 if (visitMemCmpCall(I)) 4734 return; 4735 } 4736 } 4737 } else if (isa<InlineAsm>(I.getOperand(0))) { 4738 visitInlineAsm(&I); 4739 return; 4740 } 4741 4742 SDValue Callee; 4743 if (!RenameFn) 4744 Callee = getValue(I.getOperand(0)); 4745 else 4746 Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 4747 4748 // Check if we can potentially perform a tail call. More detailed checking is 4749 // be done within LowerCallTo, after more information about the call is known. 4750 LowerCallTo(&I, Callee, I.isTailCall()); 4751} 4752 4753/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 4754/// this value and returns the result as a ValueVT value. This uses 4755/// Chain/Flag as the input and updates them for the output Chain/Flag. 4756/// If the Flag pointer is NULL, no flag is used. 4757SDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, DebugLoc dl, 4758 SDValue &Chain, SDValue *Flag) const { 4759 // Assemble the legal parts into the final values. 4760 SmallVector<SDValue, 4> Values(ValueVTs.size()); 4761 SmallVector<SDValue, 8> Parts; 4762 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 4763 // Copy the legal parts from the registers. 4764 EVT ValueVT = ValueVTs[Value]; 4765 unsigned NumRegs = TLI->getNumRegisters(*DAG.getContext(), ValueVT); 4766 EVT RegisterVT = RegVTs[Value]; 4767 4768 Parts.resize(NumRegs); 4769 for (unsigned i = 0; i != NumRegs; ++i) { 4770 SDValue P; 4771 if (Flag == 0) { 4772 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT); 4773 } else { 4774 P = DAG.getCopyFromReg(Chain, dl, Regs[Part+i], RegisterVT, *Flag); 4775 *Flag = P.getValue(2); 4776 } 4777 4778 Chain = P.getValue(1); 4779 4780 // If the source register was virtual and if we know something about it, 4781 // add an assert node. 4782 if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 4783 RegisterVT.isInteger() && !RegisterVT.isVector()) { 4784 unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 4785 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 4786 if (FLI.LiveOutRegInfo.size() > SlotNo) { 4787 FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 4788 4789 unsigned RegSize = RegisterVT.getSizeInBits(); 4790 unsigned NumSignBits = LOI.NumSignBits; 4791 unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 4792 4793 // FIXME: We capture more information than the dag can represent. For 4794 // now, just use the tightest assertzext/assertsext possible. 4795 bool isSExt = true; 4796 EVT FromVT(MVT::Other); 4797 if (NumSignBits == RegSize) 4798 isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 4799 else if (NumZeroBits >= RegSize-1) 4800 isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 4801 else if (NumSignBits > RegSize-8) 4802 isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 4803 else if (NumZeroBits >= RegSize-8) 4804 isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 4805 else if (NumSignBits > RegSize-16) 4806 isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 4807 else if (NumZeroBits >= RegSize-16) 4808 isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 4809 else if (NumSignBits > RegSize-32) 4810 isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 4811 else if (NumZeroBits >= RegSize-32) 4812 isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 4813 4814 if (FromVT != MVT::Other) 4815 P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, dl, 4816 RegisterVT, P, DAG.getValueType(FromVT)); 4817 } 4818 } 4819 4820 Parts[i] = P; 4821 } 4822 4823 Values[Value] = getCopyFromParts(DAG, dl, Parts.begin(), 4824 NumRegs, RegisterVT, ValueVT); 4825 Part += NumRegs; 4826 Parts.clear(); 4827 } 4828 4829 return DAG.getNode(ISD::MERGE_VALUES, dl, 4830 DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 4831 &Values[0], ValueVTs.size()); 4832} 4833 4834/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 4835/// specified value into the registers specified by this object. This uses 4836/// Chain/Flag as the input and updates them for the output Chain/Flag. 4837/// If the Flag pointer is NULL, no flag is used. 4838void RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, DebugLoc dl, 4839 SDValue &Chain, SDValue *Flag) const { 4840 // Get the list of the values's legal parts. 4841 unsigned NumRegs = Regs.size(); 4842 SmallVector<SDValue, 8> Parts(NumRegs); 4843 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 4844 EVT ValueVT = ValueVTs[Value]; 4845 unsigned NumParts = TLI->getNumRegisters(*DAG.getContext(), ValueVT); 4846 EVT RegisterVT = RegVTs[Value]; 4847 4848 getCopyToParts(DAG, dl, 4849 Val.getValue(Val.getResNo() + Value), 4850 &Parts[Part], NumParts, RegisterVT); 4851 Part += NumParts; 4852 } 4853 4854 // Copy the parts into the registers. 4855 SmallVector<SDValue, 8> Chains(NumRegs); 4856 for (unsigned i = 0; i != NumRegs; ++i) { 4857 SDValue Part; 4858 if (Flag == 0) { 4859 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i]); 4860 } else { 4861 Part = DAG.getCopyToReg(Chain, dl, Regs[i], Parts[i], *Flag); 4862 *Flag = Part.getValue(1); 4863 } 4864 4865 Chains[i] = Part.getValue(0); 4866 } 4867 4868 if (NumRegs == 1 || Flag) 4869 // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 4870 // flagged to it. That is the CopyToReg nodes and the user are considered 4871 // a single scheduling unit. If we create a TokenFactor and return it as 4872 // chain, then the TokenFactor is both a predecessor (operand) of the 4873 // user as well as a successor (the TF operands are flagged to the user). 4874 // c1, f1 = CopyToReg 4875 // c2, f2 = CopyToReg 4876 // c3 = TokenFactor c1, c2 4877 // ... 4878 // = op c3, ..., f2 4879 Chain = Chains[NumRegs-1]; 4880 else 4881 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Chains[0], NumRegs); 4882} 4883 4884/// AddInlineAsmOperands - Add this value to the specified inlineasm node 4885/// operand list. This adds the code marker and includes the number of 4886/// values added into it. 4887void RegsForValue::AddInlineAsmOperands(unsigned Code, bool HasMatching, 4888 unsigned MatchingIdx, 4889 SelectionDAG &DAG, 4890 std::vector<SDValue> &Ops) const { 4891 unsigned Flag = InlineAsm::getFlagWord(Code, Regs.size()); 4892 if (HasMatching) 4893 Flag = InlineAsm::getFlagWordForMatchingOp(Flag, MatchingIdx); 4894 SDValue Res = DAG.getTargetConstant(Flag, MVT::i32); 4895 Ops.push_back(Res); 4896 4897 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 4898 unsigned NumRegs = TLI->getNumRegisters(*DAG.getContext(), ValueVTs[Value]); 4899 EVT RegisterVT = RegVTs[Value]; 4900 for (unsigned i = 0; i != NumRegs; ++i) { 4901 assert(Reg < Regs.size() && "Mismatch in # registers expected"); 4902 Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 4903 } 4904 } 4905} 4906 4907/// isAllocatableRegister - If the specified register is safe to allocate, 4908/// i.e. it isn't a stack pointer or some other special register, return the 4909/// register class for the register. Otherwise, return null. 4910static const TargetRegisterClass * 4911isAllocatableRegister(unsigned Reg, MachineFunction &MF, 4912 const TargetLowering &TLI, 4913 const TargetRegisterInfo *TRI) { 4914 EVT FoundVT = MVT::Other; 4915 const TargetRegisterClass *FoundRC = 0; 4916 for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 4917 E = TRI->regclass_end(); RCI != E; ++RCI) { 4918 EVT ThisVT = MVT::Other; 4919 4920 const TargetRegisterClass *RC = *RCI; 4921 // If none of the value types for this register class are valid, we 4922 // can't use it. For example, 64-bit reg classes on 32-bit targets. 4923 for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 4924 I != E; ++I) { 4925 if (TLI.isTypeLegal(*I)) { 4926 // If we have already found this register in a different register class, 4927 // choose the one with the largest VT specified. For example, on 4928 // PowerPC, we favor f64 register classes over f32. 4929 if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 4930 ThisVT = *I; 4931 break; 4932 } 4933 } 4934 } 4935 4936 if (ThisVT == MVT::Other) continue; 4937 4938 // NOTE: This isn't ideal. In particular, this might allocate the 4939 // frame pointer in functions that need it (due to them not being taken 4940 // out of allocation, because a variable sized allocation hasn't been seen 4941 // yet). This is a slight code pessimization, but should still work. 4942 for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 4943 E = RC->allocation_order_end(MF); I != E; ++I) 4944 if (*I == Reg) { 4945 // We found a matching register class. Keep looking at others in case 4946 // we find one with larger registers that this physreg is also in. 4947 FoundRC = RC; 4948 FoundVT = ThisVT; 4949 break; 4950 } 4951 } 4952 return FoundRC; 4953} 4954 4955 4956namespace llvm { 4957/// AsmOperandInfo - This contains information for each constraint that we are 4958/// lowering. 4959class LLVM_LIBRARY_VISIBILITY SDISelAsmOperandInfo : 4960 public TargetLowering::AsmOperandInfo { 4961public: 4962 /// CallOperand - If this is the result output operand or a clobber 4963 /// this is null, otherwise it is the incoming operand to the CallInst. 4964 /// This gets modified as the asm is processed. 4965 SDValue CallOperand; 4966 4967 /// AssignedRegs - If this is a register or register class operand, this 4968 /// contains the set of register corresponding to the operand. 4969 RegsForValue AssignedRegs; 4970 4971 explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 4972 : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 4973 } 4974 4975 /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 4976 /// busy in OutputRegs/InputRegs. 4977 void MarkAllocatedRegs(bool isOutReg, bool isInReg, 4978 std::set<unsigned> &OutputRegs, 4979 std::set<unsigned> &InputRegs, 4980 const TargetRegisterInfo &TRI) const { 4981 if (isOutReg) { 4982 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 4983 MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 4984 } 4985 if (isInReg) { 4986 for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 4987 MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 4988 } 4989 } 4990 4991 /// getCallOperandValEVT - Return the EVT of the Value* that this operand 4992 /// corresponds to. If there is no Value* for this operand, it returns 4993 /// MVT::Other. 4994 EVT getCallOperandValEVT(LLVMContext &Context, 4995 const TargetLowering &TLI, 4996 const TargetData *TD) const { 4997 if (CallOperandVal == 0) return MVT::Other; 4998 4999 if (isa<BasicBlock>(CallOperandVal)) 5000 return TLI.getPointerTy(); 5001 5002 const llvm::Type *OpTy = CallOperandVal->getType(); 5003 5004 // If this is an indirect operand, the operand is a pointer to the 5005 // accessed type. 5006 if (isIndirect) { 5007 const llvm::PointerType *PtrTy = dyn_cast<PointerType>(OpTy); 5008 if (!PtrTy) 5009 report_fatal_error("Indirect operand for inline asm not a pointer!"); 5010 OpTy = PtrTy->getElementType(); 5011 } 5012 5013 // If OpTy is not a single value, it may be a struct/union that we 5014 // can tile with integers. 5015 if (!OpTy->isSingleValueType() && OpTy->isSized()) { 5016 unsigned BitSize = TD->getTypeSizeInBits(OpTy); 5017 switch (BitSize) { 5018 default: break; 5019 case 1: 5020 case 8: 5021 case 16: 5022 case 32: 5023 case 64: 5024 case 128: 5025 OpTy = IntegerType::get(Context, BitSize); 5026 break; 5027 } 5028 } 5029 5030 return TLI.getValueType(OpTy, true); 5031 } 5032 5033private: 5034 /// MarkRegAndAliases - Mark the specified register and all aliases in the 5035 /// specified set. 5036 static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 5037 const TargetRegisterInfo &TRI) { 5038 assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 5039 Regs.insert(Reg); 5040 if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 5041 for (; *Aliases; ++Aliases) 5042 Regs.insert(*Aliases); 5043 } 5044}; 5045} // end llvm namespace. 5046 5047 5048/// GetRegistersForValue - Assign registers (virtual or physical) for the 5049/// specified operand. We prefer to assign virtual registers, to allow the 5050/// register allocator to handle the assignment process. However, if the asm 5051/// uses features that we can't model on machineinstrs, we have SDISel do the 5052/// allocation. This produces generally horrible, but correct, code. 5053/// 5054/// OpInfo describes the operand. 5055/// Input and OutputRegs are the set of already allocated physical registers. 5056/// 5057void SelectionDAGBuilder:: 5058GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, 5059 std::set<unsigned> &OutputRegs, 5060 std::set<unsigned> &InputRegs) { 5061 LLVMContext &Context = FuncInfo.Fn->getContext(); 5062 5063 // Compute whether this value requires an input register, an output register, 5064 // or both. 5065 bool isOutReg = false; 5066 bool isInReg = false; 5067 switch (OpInfo.Type) { 5068 case InlineAsm::isOutput: 5069 isOutReg = true; 5070 5071 // If there is an input constraint that matches this, we need to reserve 5072 // the input register so no other inputs allocate to it. 5073 isInReg = OpInfo.hasMatchingInput(); 5074 break; 5075 case InlineAsm::isInput: 5076 isInReg = true; 5077 isOutReg = false; 5078 break; 5079 case InlineAsm::isClobber: 5080 isOutReg = true; 5081 isInReg = true; 5082 break; 5083 } 5084 5085 5086 MachineFunction &MF = DAG.getMachineFunction(); 5087 SmallVector<unsigned, 4> Regs; 5088 5089 // If this is a constraint for a single physreg, or a constraint for a 5090 // register class, find it. 5091 std::pair<unsigned, const TargetRegisterClass*> PhysReg = 5092 TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 5093 OpInfo.ConstraintVT); 5094 5095 unsigned NumRegs = 1; 5096 if (OpInfo.ConstraintVT != MVT::Other) { 5097 // If this is a FP input in an integer register (or visa versa) insert a bit 5098 // cast of the input value. More generally, handle any case where the input 5099 // value disagrees with the register class we plan to stick this in. 5100 if (OpInfo.Type == InlineAsm::isInput && 5101 PhysReg.second && !PhysReg.second->hasType(OpInfo.ConstraintVT)) { 5102 // Try to convert to the first EVT that the reg class contains. If the 5103 // types are identical size, use a bitcast to convert (e.g. two differing 5104 // vector types). 5105 EVT RegVT = *PhysReg.second->vt_begin(); 5106 if (RegVT.getSizeInBits() == OpInfo.ConstraintVT.getSizeInBits()) { 5107 OpInfo.CallOperand = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), 5108 RegVT, OpInfo.CallOperand); 5109 OpInfo.ConstraintVT = RegVT; 5110 } else if (RegVT.isInteger() && OpInfo.ConstraintVT.isFloatingPoint()) { 5111 // If the input is a FP value and we want it in FP registers, do a 5112 // bitcast to the corresponding integer type. This turns an f64 value 5113 // into i64, which can be passed with two i32 values on a 32-bit 5114 // machine. 5115 RegVT = EVT::getIntegerVT(Context, 5116 OpInfo.ConstraintVT.getSizeInBits()); 5117 OpInfo.CallOperand = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), 5118 RegVT, OpInfo.CallOperand); 5119 OpInfo.ConstraintVT = RegVT; 5120 } 5121 } 5122 5123 NumRegs = TLI.getNumRegisters(Context, OpInfo.ConstraintVT); 5124 } 5125 5126 EVT RegVT; 5127 EVT ValueVT = OpInfo.ConstraintVT; 5128 5129 // If this is a constraint for a specific physical register, like {r17}, 5130 // assign it now. 5131 if (unsigned AssignedReg = PhysReg.first) { 5132 const TargetRegisterClass *RC = PhysReg.second; 5133 if (OpInfo.ConstraintVT == MVT::Other) 5134 ValueVT = *RC->vt_begin(); 5135 5136 // Get the actual register value type. This is important, because the user 5137 // may have asked for (e.g.) the AX register in i32 type. We need to 5138 // remember that AX is actually i16 to get the right extension. 5139 RegVT = *RC->vt_begin(); 5140 5141 // This is a explicit reference to a physical register. 5142 Regs.push_back(AssignedReg); 5143 5144 // If this is an expanded reference, add the rest of the regs to Regs. 5145 if (NumRegs != 1) { 5146 TargetRegisterClass::iterator I = RC->begin(); 5147 for (; *I != AssignedReg; ++I) 5148 assert(I != RC->end() && "Didn't find reg!"); 5149 5150 // Already added the first reg. 5151 --NumRegs; ++I; 5152 for (; NumRegs; --NumRegs, ++I) { 5153 assert(I != RC->end() && "Ran out of registers to allocate!"); 5154 Regs.push_back(*I); 5155 } 5156 } 5157 5158 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 5159 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 5160 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 5161 return; 5162 } 5163 5164 // Otherwise, if this was a reference to an LLVM register class, create vregs 5165 // for this reference. 5166 if (const TargetRegisterClass *RC = PhysReg.second) { 5167 RegVT = *RC->vt_begin(); 5168 if (OpInfo.ConstraintVT == MVT::Other) 5169 ValueVT = RegVT; 5170 5171 // Create the appropriate number of virtual registers. 5172 MachineRegisterInfo &RegInfo = MF.getRegInfo(); 5173 for (; NumRegs; --NumRegs) 5174 Regs.push_back(RegInfo.createVirtualRegister(RC)); 5175 5176 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 5177 return; 5178 } 5179 5180 // This is a reference to a register class that doesn't directly correspond 5181 // to an LLVM register class. Allocate NumRegs consecutive, available, 5182 // registers from the class. 5183 std::vector<unsigned> RegClassRegs 5184 = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 5185 OpInfo.ConstraintVT); 5186 5187 const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 5188 unsigned NumAllocated = 0; 5189 for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 5190 unsigned Reg = RegClassRegs[i]; 5191 // See if this register is available. 5192 if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 5193 (isInReg && InputRegs.count(Reg))) { // Already used. 5194 // Make sure we find consecutive registers. 5195 NumAllocated = 0; 5196 continue; 5197 } 5198 5199 // Check to see if this register is allocatable (i.e. don't give out the 5200 // stack pointer). 5201 const TargetRegisterClass *RC = isAllocatableRegister(Reg, MF, TLI, TRI); 5202 if (!RC) { // Couldn't allocate this register. 5203 // Reset NumAllocated to make sure we return consecutive registers. 5204 NumAllocated = 0; 5205 continue; 5206 } 5207 5208 // Okay, this register is good, we can use it. 5209 ++NumAllocated; 5210 5211 // If we allocated enough consecutive registers, succeed. 5212 if (NumAllocated == NumRegs) { 5213 unsigned RegStart = (i-NumAllocated)+1; 5214 unsigned RegEnd = i+1; 5215 // Mark all of the allocated registers used. 5216 for (unsigned i = RegStart; i != RegEnd; ++i) 5217 Regs.push_back(RegClassRegs[i]); 5218 5219 OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 5220 OpInfo.ConstraintVT); 5221 OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 5222 return; 5223 } 5224 } 5225 5226 // Otherwise, we couldn't allocate enough registers for this. 5227} 5228 5229/// visitInlineAsm - Handle a call to an InlineAsm object. 5230/// 5231void SelectionDAGBuilder::visitInlineAsm(ImmutableCallSite CS) { 5232 const InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 5233 5234 /// ConstraintOperands - Information about all of the constraints. 5235 std::vector<SDISelAsmOperandInfo> ConstraintOperands; 5236 5237 std::set<unsigned> OutputRegs, InputRegs; 5238 5239 // Do a prepass over the constraints, canonicalizing them, and building up the 5240 // ConstraintOperands list. 5241 std::vector<InlineAsm::ConstraintInfo> 5242 ConstraintInfos = IA->ParseConstraints(); 5243 5244 bool hasMemory = hasInlineAsmMemConstraint(ConstraintInfos, TLI); 5245 5246 SDValue Chain, Flag; 5247 5248 // We won't need to flush pending loads if this asm doesn't touch 5249 // memory and is nonvolatile. 5250 if (hasMemory || IA->hasSideEffects()) 5251 Chain = getRoot(); 5252 else 5253 Chain = DAG.getRoot(); 5254 5255 unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 5256 unsigned ResNo = 0; // ResNo - The result number of the next output. 5257 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 5258 ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 5259 SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 5260 5261 EVT OpVT = MVT::Other; 5262 5263 // Compute the value type for each operand. 5264 switch (OpInfo.Type) { 5265 case InlineAsm::isOutput: 5266 // Indirect outputs just consume an argument. 5267 if (OpInfo.isIndirect) { 5268 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++)); 5269 break; 5270 } 5271 5272 // The return value of the call is this value. As such, there is no 5273 // corresponding argument. 5274 assert(!CS.getType()->isVoidTy() && 5275 "Bad inline asm!"); 5276 if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 5277 OpVT = TLI.getValueType(STy->getElementType(ResNo)); 5278 } else { 5279 assert(ResNo == 0 && "Asm only has one result!"); 5280 OpVT = TLI.getValueType(CS.getType()); 5281 } 5282 ++ResNo; 5283 break; 5284 case InlineAsm::isInput: 5285 OpInfo.CallOperandVal = const_cast<Value *>(CS.getArgument(ArgNo++)); 5286 break; 5287 case InlineAsm::isClobber: 5288 // Nothing to do. 5289 break; 5290 } 5291 5292 // If this is an input or an indirect output, process the call argument. 5293 // BasicBlocks are labels, currently appearing only in asm's. 5294 if (OpInfo.CallOperandVal) { 5295 // Strip bitcasts, if any. This mostly comes up for functions. 5296 OpInfo.CallOperandVal = OpInfo.CallOperandVal->stripPointerCasts(); 5297 5298 if (const BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) { 5299 OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 5300 } else { 5301 OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 5302 } 5303 5304 OpVT = OpInfo.getCallOperandValEVT(*DAG.getContext(), TLI, TD); 5305 } 5306 5307 OpInfo.ConstraintVT = OpVT; 5308 } 5309 5310 // Second pass over the constraints: compute which constraint option to use 5311 // and assign registers to constraints that want a specific physreg. 5312 for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 5313 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 5314 5315 // If this is an output operand with a matching input operand, look up the 5316 // matching input. If their types mismatch, e.g. one is an integer, the 5317 // other is floating point, or their sizes are different, flag it as an 5318 // error. 5319 if (OpInfo.hasMatchingInput()) { 5320 SDISelAsmOperandInfo &Input = ConstraintOperands[OpInfo.MatchingInput]; 5321 5322 if (OpInfo.ConstraintVT != Input.ConstraintVT) { 5323 if ((OpInfo.ConstraintVT.isInteger() != 5324 Input.ConstraintVT.isInteger()) || 5325 (OpInfo.ConstraintVT.getSizeInBits() != 5326 Input.ConstraintVT.getSizeInBits())) { 5327 report_fatal_error("Unsupported asm: input constraint" 5328 " with a matching output constraint of" 5329 " incompatible type!"); 5330 } 5331 Input.ConstraintVT = OpInfo.ConstraintVT; 5332 } 5333 } 5334 5335 // Compute the constraint code and ConstraintType to use. 5336 TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, hasMemory, &DAG); 5337 5338 // If this is a memory input, and if the operand is not indirect, do what we 5339 // need to to provide an address for the memory input. 5340 if (OpInfo.ConstraintType == TargetLowering::C_Memory && 5341 !OpInfo.isIndirect) { 5342 assert(OpInfo.Type == InlineAsm::isInput && 5343 "Can only indirectify direct input operands!"); 5344 5345 // Memory operands really want the address of the value. If we don't have 5346 // an indirect input, put it in the constpool if we can, otherwise spill 5347 // it to a stack slot. 5348 5349 // If the operand is a float, integer, or vector constant, spill to a 5350 // constant pool entry to get its address. 5351 const Value *OpVal = OpInfo.CallOperandVal; 5352 if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 5353 isa<ConstantVector>(OpVal)) { 5354 OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 5355 TLI.getPointerTy()); 5356 } else { 5357 // Otherwise, create a stack slot and emit a store to it before the 5358 // asm. 5359 const Type *Ty = OpVal->getType(); 5360 uint64_t TySize = TLI.getTargetData()->getTypeAllocSize(Ty); 5361 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 5362 MachineFunction &MF = DAG.getMachineFunction(); 5363 int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align, false); 5364 SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 5365 Chain = DAG.getStore(Chain, getCurDebugLoc(), 5366 OpInfo.CallOperand, StackSlot, NULL, 0, 5367 false, false, 0); 5368 OpInfo.CallOperand = StackSlot; 5369 } 5370 5371 // There is no longer a Value* corresponding to this operand. 5372 OpInfo.CallOperandVal = 0; 5373 5374 // It is now an indirect operand. 5375 OpInfo.isIndirect = true; 5376 } 5377 5378 // If this constraint is for a specific register, allocate it before 5379 // anything else. 5380 if (OpInfo.ConstraintType == TargetLowering::C_Register) 5381 GetRegistersForValue(OpInfo, OutputRegs, InputRegs); 5382 } 5383 5384 ConstraintInfos.clear(); 5385 5386 // Second pass - Loop over all of the operands, assigning virtual or physregs 5387 // to register class operands. 5388 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 5389 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 5390 5391 // C_Register operands have already been allocated, Other/Memory don't need 5392 // to be. 5393 if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 5394 GetRegistersForValue(OpInfo, OutputRegs, InputRegs); 5395 } 5396 5397 // AsmNodeOperands - The operands for the ISD::INLINEASM node. 5398 std::vector<SDValue> AsmNodeOperands; 5399 AsmNodeOperands.push_back(SDValue()); // reserve space for input chain 5400 AsmNodeOperands.push_back( 5401 DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), 5402 TLI.getPointerTy())); 5403 5404 // If we have a !srcloc metadata node associated with it, we want to attach 5405 // this to the ultimately generated inline asm machineinstr. To do this, we 5406 // pass in the third operand as this (potentially null) inline asm MDNode. 5407 const MDNode *SrcLoc = CS.getInstruction()->getMetadata("srcloc"); 5408 AsmNodeOperands.push_back(DAG.getMDNode(SrcLoc)); 5409 5410 // Loop over all of the inputs, copying the operand values into the 5411 // appropriate registers and processing the output regs. 5412 RegsForValue RetValRegs; 5413 5414 // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 5415 std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 5416 5417 for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 5418 SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 5419 5420 switch (OpInfo.Type) { 5421 case InlineAsm::isOutput: { 5422 if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 5423 OpInfo.ConstraintType != TargetLowering::C_Register) { 5424 // Memory output, or 'other' output (e.g. 'X' constraint). 5425 assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 5426 5427 // Add information to the INLINEASM node to know about this output. 5428 unsigned OpFlags = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1); 5429 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlags, 5430 TLI.getPointerTy())); 5431 AsmNodeOperands.push_back(OpInfo.CallOperand); 5432 break; 5433 } 5434 5435 // Otherwise, this is a register or register class output. 5436 5437 // Copy the output from the appropriate register. Find a register that 5438 // we can use. 5439 if (OpInfo.AssignedRegs.Regs.empty()) 5440 report_fatal_error("Couldn't allocate output reg for constraint '" + 5441 Twine(OpInfo.ConstraintCode) + "'!"); 5442 5443 // If this is an indirect operand, store through the pointer after the 5444 // asm. 5445 if (OpInfo.isIndirect) { 5446 IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 5447 OpInfo.CallOperandVal)); 5448 } else { 5449 // This is the result value of the call. 5450 assert(!CS.getType()->isVoidTy() && "Bad inline asm!"); 5451 // Concatenate this output onto the outputs list. 5452 RetValRegs.append(OpInfo.AssignedRegs); 5453 } 5454 5455 // Add information to the INLINEASM node to know that this register is 5456 // set. 5457 OpInfo.AssignedRegs.AddInlineAsmOperands(OpInfo.isEarlyClobber ? 5458 InlineAsm::Kind_RegDefEarlyClobber : 5459 InlineAsm::Kind_RegDef, 5460 false, 5461 0, 5462 DAG, 5463 AsmNodeOperands); 5464 break; 5465 } 5466 case InlineAsm::isInput: { 5467 SDValue InOperandVal = OpInfo.CallOperand; 5468 5469 if (OpInfo.isMatchingInputConstraint()) { // Matching constraint? 5470 // If this is required to match an output register we have already set, 5471 // just use its register. 5472 unsigned OperandNo = OpInfo.getMatchedOperand(); 5473 5474 // Scan until we find the definition we already emitted of this operand. 5475 // When we find it, create a RegsForValue operand. 5476 unsigned CurOp = InlineAsm::Op_FirstOperand; 5477 for (; OperandNo; --OperandNo) { 5478 // Advance to the next operand. 5479 unsigned OpFlag = 5480 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue(); 5481 assert((InlineAsm::isRegDefKind(OpFlag) || 5482 InlineAsm::isRegDefEarlyClobberKind(OpFlag) || 5483 InlineAsm::isMemKind(OpFlag)) && "Skipped past definitions?"); 5484 CurOp += InlineAsm::getNumOperandRegisters(OpFlag)+1; 5485 } 5486 5487 unsigned OpFlag = 5488 cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getZExtValue(); 5489 if (InlineAsm::isRegDefKind(OpFlag) || 5490 InlineAsm::isRegDefEarlyClobberKind(OpFlag)) { 5491 // Add (OpFlag&0xffff)>>3 registers to MatchedRegs. 5492 if (OpInfo.isIndirect) { 5493 // This happens on gcc/testsuite/gcc.dg/pr8788-1.c 5494 LLVMContext &Ctx = *DAG.getContext(); 5495 Ctx.emitError(CS.getInstruction(), "inline asm not supported yet:" 5496 " don't know how to handle tied " 5497 "indirect register inputs"); 5498 } 5499 5500 RegsForValue MatchedRegs; 5501 MatchedRegs.TLI = &TLI; 5502 MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 5503 EVT RegVT = AsmNodeOperands[CurOp+1].getValueType(); 5504 MatchedRegs.RegVTs.push_back(RegVT); 5505 MachineRegisterInfo &RegInfo = DAG.getMachineFunction().getRegInfo(); 5506 for (unsigned i = 0, e = InlineAsm::getNumOperandRegisters(OpFlag); 5507 i != e; ++i) 5508 MatchedRegs.Regs.push_back 5509 (RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT))); 5510 5511 // Use the produced MatchedRegs object to 5512 MatchedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(), 5513 Chain, &Flag); 5514 MatchedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, 5515 true, OpInfo.getMatchedOperand(), 5516 DAG, AsmNodeOperands); 5517 break; 5518 } 5519 5520 assert(InlineAsm::isMemKind(OpFlag) && "Unknown matching constraint!"); 5521 assert(InlineAsm::getNumOperandRegisters(OpFlag) == 1 && 5522 "Unexpected number of operands"); 5523 // Add information to the INLINEASM node to know about this input. 5524 // See InlineAsm.h isUseOperandTiedToDef. 5525 OpFlag = InlineAsm::getFlagWordForMatchingOp(OpFlag, 5526 OpInfo.getMatchedOperand()); 5527 AsmNodeOperands.push_back(DAG.getTargetConstant(OpFlag, 5528 TLI.getPointerTy())); 5529 AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 5530 break; 5531 } 5532 5533 if (OpInfo.ConstraintType == TargetLowering::C_Other) { 5534 assert(!OpInfo.isIndirect && 5535 "Don't know how to handle indirect other inputs yet!"); 5536 5537 std::vector<SDValue> Ops; 5538 TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 5539 hasMemory, Ops, DAG); 5540 if (Ops.empty()) 5541 report_fatal_error("Invalid operand for inline asm constraint '" + 5542 Twine(OpInfo.ConstraintCode) + "'!"); 5543 5544 // Add information to the INLINEASM node to know about this input. 5545 unsigned ResOpType = 5546 InlineAsm::getFlagWord(InlineAsm::Kind_Imm, Ops.size()); 5547 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 5548 TLI.getPointerTy())); 5549 AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 5550 break; 5551 } 5552 5553 if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 5554 assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 5555 assert(InOperandVal.getValueType() == TLI.getPointerTy() && 5556 "Memory operands expect pointer values"); 5557 5558 // Add information to the INLINEASM node to know about this input. 5559 unsigned ResOpType = InlineAsm::getFlagWord(InlineAsm::Kind_Mem, 1); 5560 AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 5561 TLI.getPointerTy())); 5562 AsmNodeOperands.push_back(InOperandVal); 5563 break; 5564 } 5565 5566 assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 5567 OpInfo.ConstraintType == TargetLowering::C_Register) && 5568 "Unknown constraint type!"); 5569 assert(!OpInfo.isIndirect && 5570 "Don't know how to handle indirect register inputs yet!"); 5571 5572 // Copy the input into the appropriate registers. 5573 if (OpInfo.AssignedRegs.Regs.empty() || 5574 !OpInfo.AssignedRegs.areValueTypesLegal()) 5575 report_fatal_error("Couldn't allocate input reg for constraint '" + 5576 Twine(OpInfo.ConstraintCode) + "'!"); 5577 5578 OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, getCurDebugLoc(), 5579 Chain, &Flag); 5580 5581 OpInfo.AssignedRegs.AddInlineAsmOperands(InlineAsm::Kind_RegUse, false, 0, 5582 DAG, AsmNodeOperands); 5583 break; 5584 } 5585 case InlineAsm::isClobber: { 5586 // Add the clobbered value to the operand list, so that the register 5587 // allocator is aware that the physreg got clobbered. 5588 if (!OpInfo.AssignedRegs.Regs.empty()) 5589 OpInfo.AssignedRegs.AddInlineAsmOperands( 5590 InlineAsm::Kind_RegDefEarlyClobber, 5591 false, 0, DAG, 5592 AsmNodeOperands); 5593 break; 5594 } 5595 } 5596 } 5597 5598 // Finish up input operands. Set the input chain and add the flag last. 5599 AsmNodeOperands[0] = Chain; 5600 if (Flag.getNode()) AsmNodeOperands.push_back(Flag); 5601 5602 Chain = DAG.getNode(ISD::INLINEASM, getCurDebugLoc(), 5603 DAG.getVTList(MVT::Other, MVT::Flag), 5604 &AsmNodeOperands[0], AsmNodeOperands.size()); 5605 Flag = Chain.getValue(1); 5606 5607 // If this asm returns a register value, copy the result from that register 5608 // and set it as the value of the call. 5609 if (!RetValRegs.Regs.empty()) { 5610 SDValue Val = RetValRegs.getCopyFromRegs(DAG, getCurDebugLoc(), 5611 Chain, &Flag); 5612 5613 // FIXME: Why don't we do this for inline asms with MRVs? 5614 if (CS.getType()->isSingleValueType() && CS.getType()->isSized()) { 5615 EVT ResultType = TLI.getValueType(CS.getType()); 5616 5617 // If any of the results of the inline asm is a vector, it may have the 5618 // wrong width/num elts. This can happen for register classes that can 5619 // contain multiple different value types. The preg or vreg allocated may 5620 // not have the same VT as was expected. Convert it to the right type 5621 // with bit_convert. 5622 if (ResultType != Val.getValueType() && Val.getValueType().isVector()) { 5623 Val = DAG.getNode(ISD::BIT_CONVERT, getCurDebugLoc(), 5624 ResultType, Val); 5625 5626 } else if (ResultType != Val.getValueType() && 5627 ResultType.isInteger() && Val.getValueType().isInteger()) { 5628 // If a result value was tied to an input value, the computed result may 5629 // have a wider width than the expected result. Extract the relevant 5630 // portion. 5631 Val = DAG.getNode(ISD::TRUNCATE, getCurDebugLoc(), ResultType, Val); 5632 } 5633 5634 assert(ResultType == Val.getValueType() && "Asm result value mismatch!"); 5635 } 5636 5637 setValue(CS.getInstruction(), Val); 5638 // Don't need to use this as a chain in this case. 5639 if (!IA->hasSideEffects() && !hasMemory && IndirectStoresToEmit.empty()) 5640 return; 5641 } 5642 5643 std::vector<std::pair<SDValue, const Value *> > StoresToEmit; 5644 5645 // Process indirect outputs, first output all of the flagged copies out of 5646 // physregs. 5647 for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 5648 RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 5649 const Value *Ptr = IndirectStoresToEmit[i].second; 5650 SDValue OutVal = OutRegs.getCopyFromRegs(DAG, getCurDebugLoc(), 5651 Chain, &Flag); 5652 StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 5653 } 5654 5655 // Emit the non-flagged stores from the physregs. 5656 SmallVector<SDValue, 8> OutChains; 5657 for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) { 5658 SDValue Val = DAG.getStore(Chain, getCurDebugLoc(), 5659 StoresToEmit[i].first, 5660 getValue(StoresToEmit[i].second), 5661 StoresToEmit[i].second, 0, 5662 false, false, 0); 5663 OutChains.push_back(Val); 5664 } 5665 5666 if (!OutChains.empty()) 5667 Chain = DAG.getNode(ISD::TokenFactor, getCurDebugLoc(), MVT::Other, 5668 &OutChains[0], OutChains.size()); 5669 5670 DAG.setRoot(Chain); 5671} 5672 5673void SelectionDAGBuilder::visitVAStart(const CallInst &I) { 5674 DAG.setRoot(DAG.getNode(ISD::VASTART, getCurDebugLoc(), 5675 MVT::Other, getRoot(), 5676 getValue(I.getOperand(1)), 5677 DAG.getSrcValue(I.getOperand(1)))); 5678} 5679 5680void SelectionDAGBuilder::visitVAArg(const VAArgInst &I) { 5681 SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getCurDebugLoc(), 5682 getRoot(), getValue(I.getOperand(0)), 5683 DAG.getSrcValue(I.getOperand(0))); 5684 setValue(&I, V); 5685 DAG.setRoot(V.getValue(1)); 5686} 5687 5688void SelectionDAGBuilder::visitVAEnd(const CallInst &I) { 5689 DAG.setRoot(DAG.getNode(ISD::VAEND, getCurDebugLoc(), 5690 MVT::Other, getRoot(), 5691 getValue(I.getOperand(1)), 5692 DAG.getSrcValue(I.getOperand(1)))); 5693} 5694 5695void SelectionDAGBuilder::visitVACopy(const CallInst &I) { 5696 DAG.setRoot(DAG.getNode(ISD::VACOPY, getCurDebugLoc(), 5697 MVT::Other, getRoot(), 5698 getValue(I.getOperand(1)), 5699 getValue(I.getOperand(2)), 5700 DAG.getSrcValue(I.getOperand(1)), 5701 DAG.getSrcValue(I.getOperand(2)))); 5702} 5703 5704/// TargetLowering::LowerCallTo - This is the default LowerCallTo 5705/// implementation, which just calls LowerCall. 5706/// FIXME: When all targets are 5707/// migrated to using LowerCall, this hook should be integrated into SDISel. 5708std::pair<SDValue, SDValue> 5709TargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy, 5710 bool RetSExt, bool RetZExt, bool isVarArg, 5711 bool isInreg, unsigned NumFixedArgs, 5712 CallingConv::ID CallConv, bool isTailCall, 5713 bool isReturnValueUsed, 5714 SDValue Callee, 5715 ArgListTy &Args, SelectionDAG &DAG, 5716 DebugLoc dl) const { 5717 // Handle all of the outgoing arguments. 5718 SmallVector<ISD::OutputArg, 32> Outs; 5719 for (unsigned i = 0, e = Args.size(); i != e; ++i) { 5720 SmallVector<EVT, 4> ValueVTs; 5721 ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 5722 for (unsigned Value = 0, NumValues = ValueVTs.size(); 5723 Value != NumValues; ++Value) { 5724 EVT VT = ValueVTs[Value]; 5725 const Type *ArgTy = VT.getTypeForEVT(RetTy->getContext()); 5726 SDValue Op = SDValue(Args[i].Node.getNode(), 5727 Args[i].Node.getResNo() + Value); 5728 ISD::ArgFlagsTy Flags; 5729 unsigned OriginalAlignment = 5730 getTargetData()->getABITypeAlignment(ArgTy); 5731 5732 if (Args[i].isZExt) 5733 Flags.setZExt(); 5734 if (Args[i].isSExt) 5735 Flags.setSExt(); 5736 if (Args[i].isInReg) 5737 Flags.setInReg(); 5738 if (Args[i].isSRet) 5739 Flags.setSRet(); 5740 if (Args[i].isByVal) { 5741 Flags.setByVal(); 5742 const PointerType *Ty = cast<PointerType>(Args[i].Ty); 5743 const Type *ElementTy = Ty->getElementType(); 5744 unsigned FrameAlign = getByValTypeAlignment(ElementTy); 5745 unsigned FrameSize = getTargetData()->getTypeAllocSize(ElementTy); 5746 // For ByVal, alignment should come from FE. BE will guess if this 5747 // info is not there but there are cases it cannot get right. 5748 if (Args[i].Alignment) 5749 FrameAlign = Args[i].Alignment; 5750 Flags.setByValAlign(FrameAlign); 5751 Flags.setByValSize(FrameSize); 5752 } 5753 if (Args[i].isNest) 5754 Flags.setNest(); 5755 Flags.setOrigAlign(OriginalAlignment); 5756 5757 EVT PartVT = getRegisterType(RetTy->getContext(), VT); 5758 unsigned NumParts = getNumRegisters(RetTy->getContext(), VT); 5759 SmallVector<SDValue, 4> Parts(NumParts); 5760 ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 5761 5762 if (Args[i].isSExt) 5763 ExtendKind = ISD::SIGN_EXTEND; 5764 else if (Args[i].isZExt) 5765 ExtendKind = ISD::ZERO_EXTEND; 5766 5767 getCopyToParts(DAG, dl, Op, &Parts[0], NumParts, 5768 PartVT, ExtendKind); 5769 5770 for (unsigned j = 0; j != NumParts; ++j) { 5771 // if it isn't first piece, alignment must be 1 5772 ISD::OutputArg MyFlags(Flags, Parts[j], i < NumFixedArgs); 5773 if (NumParts > 1 && j == 0) 5774 MyFlags.Flags.setSplit(); 5775 else if (j != 0) 5776 MyFlags.Flags.setOrigAlign(1); 5777 5778 Outs.push_back(MyFlags); 5779 } 5780 } 5781 } 5782 5783 // Handle the incoming return values from the call. 5784 SmallVector<ISD::InputArg, 32> Ins; 5785 SmallVector<EVT, 4> RetTys; 5786 ComputeValueVTs(*this, RetTy, RetTys); 5787 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 5788 EVT VT = RetTys[I]; 5789 EVT RegisterVT = getRegisterType(RetTy->getContext(), VT); 5790 unsigned NumRegs = getNumRegisters(RetTy->getContext(), VT); 5791 for (unsigned i = 0; i != NumRegs; ++i) { 5792 ISD::InputArg MyFlags; 5793 MyFlags.VT = RegisterVT; 5794 MyFlags.Used = isReturnValueUsed; 5795 if (RetSExt) 5796 MyFlags.Flags.setSExt(); 5797 if (RetZExt) 5798 MyFlags.Flags.setZExt(); 5799 if (isInreg) 5800 MyFlags.Flags.setInReg(); 5801 Ins.push_back(MyFlags); 5802 } 5803 } 5804 5805 SmallVector<SDValue, 4> InVals; 5806 Chain = LowerCall(Chain, Callee, CallConv, isVarArg, isTailCall, 5807 Outs, Ins, dl, DAG, InVals); 5808 5809 // Verify that the target's LowerCall behaved as expected. 5810 assert(Chain.getNode() && Chain.getValueType() == MVT::Other && 5811 "LowerCall didn't return a valid chain!"); 5812 assert((!isTailCall || InVals.empty()) && 5813 "LowerCall emitted a return value for a tail call!"); 5814 assert((isTailCall || InVals.size() == Ins.size()) && 5815 "LowerCall didn't emit the correct number of values!"); 5816 5817 // For a tail call, the return value is merely live-out and there aren't 5818 // any nodes in the DAG representing it. Return a special value to 5819 // indicate that a tail call has been emitted and no more Instructions 5820 // should be processed in the current block. 5821 if (isTailCall) { 5822 DAG.setRoot(Chain); 5823 return std::make_pair(SDValue(), SDValue()); 5824 } 5825 5826 DEBUG(for (unsigned i = 0, e = Ins.size(); i != e; ++i) { 5827 assert(InVals[i].getNode() && 5828 "LowerCall emitted a null value!"); 5829 assert(Ins[i].VT == InVals[i].getValueType() && 5830 "LowerCall emitted a value with the wrong type!"); 5831 }); 5832 5833 // Collect the legal value parts into potentially illegal values 5834 // that correspond to the original function's return values. 5835 ISD::NodeType AssertOp = ISD::DELETED_NODE; 5836 if (RetSExt) 5837 AssertOp = ISD::AssertSext; 5838 else if (RetZExt) 5839 AssertOp = ISD::AssertZext; 5840 SmallVector<SDValue, 4> ReturnValues; 5841 unsigned CurReg = 0; 5842 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 5843 EVT VT = RetTys[I]; 5844 EVT RegisterVT = getRegisterType(RetTy->getContext(), VT); 5845 unsigned NumRegs = getNumRegisters(RetTy->getContext(), VT); 5846 5847 ReturnValues.push_back(getCopyFromParts(DAG, dl, &InVals[CurReg], 5848 NumRegs, RegisterVT, VT, 5849 AssertOp)); 5850 CurReg += NumRegs; 5851 } 5852 5853 // For a function returning void, there is no return value. We can't create 5854 // such a node, so we just return a null return value in that case. In 5855 // that case, nothing will actualy look at the value. 5856 if (ReturnValues.empty()) 5857 return std::make_pair(SDValue(), Chain); 5858 5859 SDValue Res = DAG.getNode(ISD::MERGE_VALUES, dl, 5860 DAG.getVTList(&RetTys[0], RetTys.size()), 5861 &ReturnValues[0], ReturnValues.size()); 5862 return std::make_pair(Res, Chain); 5863} 5864 5865void TargetLowering::LowerOperationWrapper(SDNode *N, 5866 SmallVectorImpl<SDValue> &Results, 5867 SelectionDAG &DAG) const { 5868 SDValue Res = LowerOperation(SDValue(N, 0), DAG); 5869 if (Res.getNode()) 5870 Results.push_back(Res); 5871} 5872 5873SDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) const { 5874 llvm_unreachable("LowerOperation not implemented for this target!"); 5875 return SDValue(); 5876} 5877 5878void 5879SelectionDAGBuilder::CopyValueToVirtualRegister(const Value *V, unsigned Reg) { 5880 SDValue Op = getValue(V); 5881 assert((Op.getOpcode() != ISD::CopyFromReg || 5882 cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 5883 "Copy from a reg to the same reg!"); 5884 assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 5885 5886 RegsForValue RFV(V->getContext(), TLI, Reg, V->getType()); 5887 SDValue Chain = DAG.getEntryNode(); 5888 RFV.getCopyToRegs(Op, DAG, getCurDebugLoc(), Chain, 0); 5889 PendingExports.push_back(Chain); 5890} 5891 5892#include "llvm/CodeGen/SelectionDAGISel.h" 5893 5894void SelectionDAGISel::LowerArguments(const BasicBlock *LLVMBB) { 5895 // If this is the entry block, emit arguments. 5896 const Function &F = *LLVMBB->getParent(); 5897 SelectionDAG &DAG = SDB->DAG; 5898 SDValue OldRoot = DAG.getRoot(); 5899 DebugLoc dl = SDB->getCurDebugLoc(); 5900 const TargetData *TD = TLI.getTargetData(); 5901 SmallVector<ISD::InputArg, 16> Ins; 5902 5903 // Check whether the function can return without sret-demotion. 5904 SmallVector<EVT, 4> OutVTs; 5905 SmallVector<ISD::ArgFlagsTy, 4> OutsFlags; 5906 getReturnInfo(F.getReturnType(), F.getAttributes().getRetAttributes(), 5907 OutVTs, OutsFlags, TLI); 5908 FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 5909 5910 FLI.CanLowerReturn = TLI.CanLowerReturn(F.getCallingConv(), F.isVarArg(), 5911 OutVTs, OutsFlags, DAG); 5912 if (!FLI.CanLowerReturn) { 5913 // Put in an sret pointer parameter before all the other parameters. 5914 SmallVector<EVT, 1> ValueVTs; 5915 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs); 5916 5917 // NOTE: Assuming that a pointer will never break down to more than one VT 5918 // or one register. 5919 ISD::ArgFlagsTy Flags; 5920 Flags.setSRet(); 5921 EVT RegisterVT = TLI.getRegisterType(*DAG.getContext(), ValueVTs[0]); 5922 ISD::InputArg RetArg(Flags, RegisterVT, true); 5923 Ins.push_back(RetArg); 5924 } 5925 5926 // Set up the incoming argument description vector. 5927 unsigned Idx = 1; 5928 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); 5929 I != E; ++I, ++Idx) { 5930 SmallVector<EVT, 4> ValueVTs; 5931 ComputeValueVTs(TLI, I->getType(), ValueVTs); 5932 bool isArgValueUsed = !I->use_empty(); 5933 for (unsigned Value = 0, NumValues = ValueVTs.size(); 5934 Value != NumValues; ++Value) { 5935 EVT VT = ValueVTs[Value]; 5936 const Type *ArgTy = VT.getTypeForEVT(*DAG.getContext()); 5937 ISD::ArgFlagsTy Flags; 5938 unsigned OriginalAlignment = 5939 TD->getABITypeAlignment(ArgTy); 5940 5941 if (F.paramHasAttr(Idx, Attribute::ZExt)) 5942 Flags.setZExt(); 5943 if (F.paramHasAttr(Idx, Attribute::SExt)) 5944 Flags.setSExt(); 5945 if (F.paramHasAttr(Idx, Attribute::InReg)) 5946 Flags.setInReg(); 5947 if (F.paramHasAttr(Idx, Attribute::StructRet)) 5948 Flags.setSRet(); 5949 if (F.paramHasAttr(Idx, Attribute::ByVal)) { 5950 Flags.setByVal(); 5951 const PointerType *Ty = cast<PointerType>(I->getType()); 5952 const Type *ElementTy = Ty->getElementType(); 5953 unsigned FrameAlign = TLI.getByValTypeAlignment(ElementTy); 5954 unsigned FrameSize = TD->getTypeAllocSize(ElementTy); 5955 // For ByVal, alignment should be passed from FE. BE will guess if 5956 // this info is not there but there are cases it cannot get right. 5957 if (F.getParamAlignment(Idx)) 5958 FrameAlign = F.getParamAlignment(Idx); 5959 Flags.setByValAlign(FrameAlign); 5960 Flags.setByValSize(FrameSize); 5961 } 5962 if (F.paramHasAttr(Idx, Attribute::Nest)) 5963 Flags.setNest(); 5964 Flags.setOrigAlign(OriginalAlignment); 5965 5966 EVT RegisterVT = TLI.getRegisterType(*CurDAG->getContext(), VT); 5967 unsigned NumRegs = TLI.getNumRegisters(*CurDAG->getContext(), VT); 5968 for (unsigned i = 0; i != NumRegs; ++i) { 5969 ISD::InputArg MyFlags(Flags, RegisterVT, isArgValueUsed); 5970 if (NumRegs > 1 && i == 0) 5971 MyFlags.Flags.setSplit(); 5972 // if it isn't first piece, alignment must be 1 5973 else if (i > 0) 5974 MyFlags.Flags.setOrigAlign(1); 5975 Ins.push_back(MyFlags); 5976 } 5977 } 5978 } 5979 5980 // Call the target to set up the argument values. 5981 SmallVector<SDValue, 8> InVals; 5982 SDValue NewRoot = TLI.LowerFormalArguments(DAG.getRoot(), F.getCallingConv(), 5983 F.isVarArg(), Ins, 5984 dl, DAG, InVals); 5985 5986 // Verify that the target's LowerFormalArguments behaved as expected. 5987 assert(NewRoot.getNode() && NewRoot.getValueType() == MVT::Other && 5988 "LowerFormalArguments didn't return a valid chain!"); 5989 assert(InVals.size() == Ins.size() && 5990 "LowerFormalArguments didn't emit the correct number of values!"); 5991 DEBUG({ 5992 for (unsigned i = 0, e = Ins.size(); i != e; ++i) { 5993 assert(InVals[i].getNode() && 5994 "LowerFormalArguments emitted a null value!"); 5995 assert(Ins[i].VT == InVals[i].getValueType() && 5996 "LowerFormalArguments emitted a value with the wrong type!"); 5997 } 5998 }); 5999 6000 // Update the DAG with the new chain value resulting from argument lowering. 6001 DAG.setRoot(NewRoot); 6002 6003 // Set up the argument values. 6004 unsigned i = 0; 6005 Idx = 1; 6006 if (!FLI.CanLowerReturn) { 6007 // Create a virtual register for the sret pointer, and put in a copy 6008 // from the sret argument into it. 6009 SmallVector<EVT, 1> ValueVTs; 6010 ComputeValueVTs(TLI, PointerType::getUnqual(F.getReturnType()), ValueVTs); 6011 EVT VT = ValueVTs[0]; 6012 EVT RegVT = TLI.getRegisterType(*CurDAG->getContext(), VT); 6013 ISD::NodeType AssertOp = ISD::DELETED_NODE; 6014 SDValue ArgValue = getCopyFromParts(DAG, dl, &InVals[0], 1, 6015 RegVT, VT, AssertOp); 6016 6017 MachineFunction& MF = SDB->DAG.getMachineFunction(); 6018 MachineRegisterInfo& RegInfo = MF.getRegInfo(); 6019 unsigned SRetReg = RegInfo.createVirtualRegister(TLI.getRegClassFor(RegVT)); 6020 FLI.DemoteRegister = SRetReg; 6021 NewRoot = SDB->DAG.getCopyToReg(NewRoot, SDB->getCurDebugLoc(), 6022 SRetReg, ArgValue); 6023 DAG.setRoot(NewRoot); 6024 6025 // i indexes lowered arguments. Bump it past the hidden sret argument. 6026 // Idx indexes LLVM arguments. Don't touch it. 6027 ++i; 6028 } 6029 6030 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 6031 ++I, ++Idx) { 6032 SmallVector<SDValue, 4> ArgValues; 6033 SmallVector<EVT, 4> ValueVTs; 6034 ComputeValueVTs(TLI, I->getType(), ValueVTs); 6035 unsigned NumValues = ValueVTs.size(); 6036 for (unsigned Value = 0; Value != NumValues; ++Value) { 6037 EVT VT = ValueVTs[Value]; 6038 EVT PartVT = TLI.getRegisterType(*CurDAG->getContext(), VT); 6039 unsigned NumParts = TLI.getNumRegisters(*CurDAG->getContext(), VT); 6040 6041 if (!I->use_empty()) { 6042 ISD::NodeType AssertOp = ISD::DELETED_NODE; 6043 if (F.paramHasAttr(Idx, Attribute::SExt)) 6044 AssertOp = ISD::AssertSext; 6045 else if (F.paramHasAttr(Idx, Attribute::ZExt)) 6046 AssertOp = ISD::AssertZext; 6047 6048 ArgValues.push_back(getCopyFromParts(DAG, dl, &InVals[i], 6049 NumParts, PartVT, VT, 6050 AssertOp)); 6051 } 6052 6053 i += NumParts; 6054 } 6055 6056 if (!I->use_empty()) { 6057 SDValue Res; 6058 if (!ArgValues.empty()) 6059 Res = DAG.getMergeValues(&ArgValues[0], NumValues, 6060 SDB->getCurDebugLoc()); 6061 SDB->setValue(I, Res); 6062 6063 // If this argument is live outside of the entry block, insert a copy from 6064 // whereever we got it to the vreg that other BB's will reference it as. 6065 SDB->CopyToExportRegsIfNeeded(I); 6066 } 6067 } 6068 6069 assert(i == InVals.size() && "Argument register count mismatch!"); 6070 6071 // Finally, if the target has anything special to do, allow it to do so. 6072 // FIXME: this should insert code into the DAG! 6073 EmitFunctionEntryCode(); 6074} 6075 6076/// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 6077/// ensure constants are generated when needed. Remember the virtual registers 6078/// that need to be added to the Machine PHI nodes as input. We cannot just 6079/// directly add them, because expansion might result in multiple MBB's for one 6080/// BB. As such, the start of the BB might correspond to a different MBB than 6081/// the end. 6082/// 6083void 6084SelectionDAGBuilder::HandlePHINodesInSuccessorBlocks(const BasicBlock *LLVMBB) { 6085 const TerminatorInst *TI = LLVMBB->getTerminator(); 6086 6087 SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled; 6088 6089 // Check successor nodes' PHI nodes that expect a constant to be available 6090 // from this block. 6091 for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 6092 const BasicBlock *SuccBB = TI->getSuccessor(succ); 6093 if (!isa<PHINode>(SuccBB->begin())) continue; 6094 MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 6095 6096 // If this terminator has multiple identical successors (common for 6097 // switches), only handle each succ once. 6098 if (!SuccsHandled.insert(SuccMBB)) continue; 6099 6100 MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 6101 6102 // At this point we know that there is a 1-1 correspondence between LLVM PHI 6103 // nodes and Machine PHI nodes, but the incoming operands have not been 6104 // emitted yet. 6105 for (BasicBlock::const_iterator I = SuccBB->begin(); 6106 const PHINode *PN = dyn_cast<PHINode>(I); ++I) { 6107 // Ignore dead phi's. 6108 if (PN->use_empty()) continue; 6109 6110 unsigned Reg; 6111 const Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 6112 6113 if (const Constant *C = dyn_cast<Constant>(PHIOp)) { 6114 unsigned &RegOut = ConstantsOut[C]; 6115 if (RegOut == 0) { 6116 RegOut = FuncInfo.CreateRegForValue(C); 6117 CopyValueToVirtualRegister(C, RegOut); 6118 } 6119 Reg = RegOut; 6120 } else { 6121 Reg = FuncInfo.ValueMap[PHIOp]; 6122 if (Reg == 0) { 6123 assert(isa<AllocaInst>(PHIOp) && 6124 FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 6125 "Didn't codegen value into a register!??"); 6126 Reg = FuncInfo.CreateRegForValue(PHIOp); 6127 CopyValueToVirtualRegister(PHIOp, Reg); 6128 } 6129 } 6130 6131 // Remember that this register needs to added to the machine PHI node as 6132 // the input for this MBB. 6133 SmallVector<EVT, 4> ValueVTs; 6134 ComputeValueVTs(TLI, PN->getType(), ValueVTs); 6135 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 6136 EVT VT = ValueVTs[vti]; 6137 unsigned NumRegisters = TLI.getNumRegisters(*DAG.getContext(), VT); 6138 for (unsigned i = 0, e = NumRegisters; i != e; ++i) 6139 FuncInfo.PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 6140 Reg += NumRegisters; 6141 } 6142 } 6143 } 6144 ConstantsOut.clear(); 6145} 6146