1 //===- TargetLoweringBase.cpp - Implement the TargetLoweringBase class ----===// 2 // 3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4 // See https://llvm.org/LICENSE.txt for license information. 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 6 // 7 //===----------------------------------------------------------------------===// 8 // 9 // This implements the TargetLoweringBase class. 10 // 11 //===----------------------------------------------------------------------===// 12 13 #include "llvm/ADT/BitVector.h" 14 #include "llvm/ADT/STLExtras.h" 15 #include "llvm/ADT/SmallVector.h" 16 #include "llvm/ADT/StringExtras.h" 17 #include "llvm/ADT/StringRef.h" 18 #include "llvm/ADT/Triple.h" 19 #include "llvm/ADT/Twine.h" 20 #include "llvm/CodeGen/Analysis.h" 21 #include "llvm/CodeGen/ISDOpcodes.h" 22 #include "llvm/CodeGen/MachineBasicBlock.h" 23 #include "llvm/CodeGen/MachineFrameInfo.h" 24 #include "llvm/CodeGen/MachineFunction.h" 25 #include "llvm/CodeGen/MachineInstr.h" 26 #include "llvm/CodeGen/MachineInstrBuilder.h" 27 #include "llvm/CodeGen/MachineMemOperand.h" 28 #include "llvm/CodeGen/MachineOperand.h" 29 #include "llvm/CodeGen/MachineRegisterInfo.h" 30 #include "llvm/CodeGen/RuntimeLibcalls.h" 31 #include "llvm/CodeGen/StackMaps.h" 32 #include "llvm/CodeGen/TargetLowering.h" 33 #include "llvm/CodeGen/TargetOpcodes.h" 34 #include "llvm/CodeGen/TargetRegisterInfo.h" 35 #include "llvm/CodeGen/ValueTypes.h" 36 #include "llvm/IR/Attributes.h" 37 #include "llvm/IR/CallingConv.h" 38 #include "llvm/IR/DataLayout.h" 39 #include "llvm/IR/DerivedTypes.h" 40 #include "llvm/IR/Function.h" 41 #include "llvm/IR/GlobalValue.h" 42 #include "llvm/IR/GlobalVariable.h" 43 #include "llvm/IR/IRBuilder.h" 44 #include "llvm/IR/Module.h" 45 #include "llvm/IR/Type.h" 46 #include "llvm/Support/BranchProbability.h" 47 #include "llvm/Support/Casting.h" 48 #include "llvm/Support/CommandLine.h" 49 #include "llvm/Support/Compiler.h" 50 #include "llvm/Support/ErrorHandling.h" 51 #include "llvm/Support/MachineValueType.h" 52 #include "llvm/Support/MathExtras.h" 53 #include "llvm/Target/TargetMachine.h" 54 #include <algorithm> 55 #include <cassert> 56 #include <cstddef> 57 #include <cstdint> 58 #include <cstring> 59 #include <iterator> 60 #include <string> 61 #include <tuple> 62 #include <utility> 63 64 using namespace llvm; 65 66 static cl::opt<bool> JumpIsExpensiveOverride( 67 "jump-is-expensive", cl::init(false), 68 cl::desc("Do not create extra branches to split comparison logic."), 69 cl::Hidden); 70 71 static cl::opt<unsigned> MinimumJumpTableEntries 72 ("min-jump-table-entries", cl::init(4), cl::Hidden, 73 cl::desc("Set minimum number of entries to use a jump table.")); 74 75 static cl::opt<unsigned> MaximumJumpTableSize 76 ("max-jump-table-size", cl::init(UINT_MAX), cl::Hidden, 77 cl::desc("Set maximum size of jump tables.")); 78 79 /// Minimum jump table density for normal functions. 80 static cl::opt<unsigned> 81 JumpTableDensity("jump-table-density", cl::init(10), cl::Hidden, 82 cl::desc("Minimum density for building a jump table in " 83 "a normal function")); 84 85 /// Minimum jump table density for -Os or -Oz functions. 86 static cl::opt<unsigned> OptsizeJumpTableDensity( 87 "optsize-jump-table-density", cl::init(40), cl::Hidden, 88 cl::desc("Minimum density for building a jump table in " 89 "an optsize function")); 90 91 static bool darwinHasSinCos(const Triple &TT) { 92 assert(TT.isOSDarwin() && "should be called with darwin triple"); 93 // Don't bother with 32 bit x86. 94 if (TT.getArch() == Triple::x86) 95 return false; 96 // Macos < 10.9 has no sincos_stret. 97 if (TT.isMacOSX()) 98 return !TT.isMacOSXVersionLT(10, 9) && TT.isArch64Bit(); 99 // iOS < 7.0 has no sincos_stret. 100 if (TT.isiOS()) 101 return !TT.isOSVersionLT(7, 0); 102 // Any other darwin such as WatchOS/TvOS is new enough. 103 return true; 104 } 105 106 // Although this default value is arbitrary, it is not random. It is assumed 107 // that a condition that evaluates the same way by a higher percentage than this 108 // is best represented as control flow. Therefore, the default value N should be 109 // set such that the win from N% correct executions is greater than the loss 110 // from (100 - N)% mispredicted executions for the majority of intended targets. 111 static cl::opt<int> MinPercentageForPredictableBranch( 112 "min-predictable-branch", cl::init(99), 113 cl::desc("Minimum percentage (0-100) that a condition must be either true " 114 "or false to assume that the condition is predictable"), 115 cl::Hidden); 116 117 void TargetLoweringBase::InitLibcalls(const Triple &TT) { 118 #define HANDLE_LIBCALL(code, name) \ 119 setLibcallName(RTLIB::code, name); 120 #include "llvm/IR/RuntimeLibcalls.def" 121 #undef HANDLE_LIBCALL 122 // Initialize calling conventions to their default. 123 for (int LC = 0; LC < RTLIB::UNKNOWN_LIBCALL; ++LC) 124 setLibcallCallingConv((RTLIB::Libcall)LC, CallingConv::C); 125 126 // A few names are different on particular architectures or environments. 127 if (TT.isOSDarwin()) { 128 // For f16/f32 conversions, Darwin uses the standard naming scheme, instead 129 // of the gnueabi-style __gnu_*_ieee. 130 // FIXME: What about other targets? 131 setLibcallName(RTLIB::FPEXT_F16_F32, "__extendhfsf2"); 132 setLibcallName(RTLIB::FPROUND_F32_F16, "__truncsfhf2"); 133 134 // Some darwins have an optimized __bzero/bzero function. 135 switch (TT.getArch()) { 136 case Triple::x86: 137 case Triple::x86_64: 138 if (TT.isMacOSX() && !TT.isMacOSXVersionLT(10, 6)) 139 setLibcallName(RTLIB::BZERO, "__bzero"); 140 break; 141 case Triple::aarch64: 142 setLibcallName(RTLIB::BZERO, "bzero"); 143 break; 144 default: 145 break; 146 } 147 148 if (darwinHasSinCos(TT)) { 149 setLibcallName(RTLIB::SINCOS_STRET_F32, "__sincosf_stret"); 150 setLibcallName(RTLIB::SINCOS_STRET_F64, "__sincos_stret"); 151 if (TT.isWatchABI()) { 152 setLibcallCallingConv(RTLIB::SINCOS_STRET_F32, 153 CallingConv::ARM_AAPCS_VFP); 154 setLibcallCallingConv(RTLIB::SINCOS_STRET_F64, 155 CallingConv::ARM_AAPCS_VFP); 156 } 157 } 158 } else { 159 setLibcallName(RTLIB::FPEXT_F16_F32, "__gnu_h2f_ieee"); 160 setLibcallName(RTLIB::FPROUND_F32_F16, "__gnu_f2h_ieee"); 161 } 162 163 if (TT.isGNUEnvironment() || TT.isOSFuchsia() || 164 (TT.isAndroid() && !TT.isAndroidVersionLT(9))) { 165 setLibcallName(RTLIB::SINCOS_F32, "sincosf"); 166 setLibcallName(RTLIB::SINCOS_F64, "sincos"); 167 setLibcallName(RTLIB::SINCOS_F80, "sincosl"); 168 setLibcallName(RTLIB::SINCOS_F128, "sincosl"); 169 setLibcallName(RTLIB::SINCOS_PPCF128, "sincosl"); 170 } 171 172 if (TT.isOSOpenBSD()) { 173 setLibcallName(RTLIB::STACKPROTECTOR_CHECK_FAIL, nullptr); 174 } 175 } 176 177 /// getFPEXT - Return the FPEXT_*_* value for the given types, or 178 /// UNKNOWN_LIBCALL if there is none. 179 RTLIB::Libcall RTLIB::getFPEXT(EVT OpVT, EVT RetVT) { 180 if (OpVT == MVT::f16) { 181 if (RetVT == MVT::f32) 182 return FPEXT_F16_F32; 183 } else if (OpVT == MVT::f32) { 184 if (RetVT == MVT::f64) 185 return FPEXT_F32_F64; 186 if (RetVT == MVT::f128) 187 return FPEXT_F32_F128; 188 if (RetVT == MVT::ppcf128) 189 return FPEXT_F32_PPCF128; 190 } else if (OpVT == MVT::f64) { 191 if (RetVT == MVT::f128) 192 return FPEXT_F64_F128; 193 else if (RetVT == MVT::ppcf128) 194 return FPEXT_F64_PPCF128; 195 } else if (OpVT == MVT::f80) { 196 if (RetVT == MVT::f128) 197 return FPEXT_F80_F128; 198 } 199 200 return UNKNOWN_LIBCALL; 201 } 202 203 /// getFPROUND - Return the FPROUND_*_* value for the given types, or 204 /// UNKNOWN_LIBCALL if there is none. 205 RTLIB::Libcall RTLIB::getFPROUND(EVT OpVT, EVT RetVT) { 206 if (RetVT == MVT::f16) { 207 if (OpVT == MVT::f32) 208 return FPROUND_F32_F16; 209 if (OpVT == MVT::f64) 210 return FPROUND_F64_F16; 211 if (OpVT == MVT::f80) 212 return FPROUND_F80_F16; 213 if (OpVT == MVT::f128) 214 return FPROUND_F128_F16; 215 if (OpVT == MVT::ppcf128) 216 return FPROUND_PPCF128_F16; 217 } else if (RetVT == MVT::f32) { 218 if (OpVT == MVT::f64) 219 return FPROUND_F64_F32; 220 if (OpVT == MVT::f80) 221 return FPROUND_F80_F32; 222 if (OpVT == MVT::f128) 223 return FPROUND_F128_F32; 224 if (OpVT == MVT::ppcf128) 225 return FPROUND_PPCF128_F32; 226 } else if (RetVT == MVT::f64) { 227 if (OpVT == MVT::f80) 228 return FPROUND_F80_F64; 229 if (OpVT == MVT::f128) 230 return FPROUND_F128_F64; 231 if (OpVT == MVT::ppcf128) 232 return FPROUND_PPCF128_F64; 233 } else if (RetVT == MVT::f80) { 234 if (OpVT == MVT::f128) 235 return FPROUND_F128_F80; 236 } 237 238 return UNKNOWN_LIBCALL; 239 } 240 241 /// getFPTOSINT - Return the FPTOSINT_*_* value for the given types, or 242 /// UNKNOWN_LIBCALL if there is none. 243 RTLIB::Libcall RTLIB::getFPTOSINT(EVT OpVT, EVT RetVT) { 244 if (OpVT == MVT::f32) { 245 if (RetVT == MVT::i32) 246 return FPTOSINT_F32_I32; 247 if (RetVT == MVT::i64) 248 return FPTOSINT_F32_I64; 249 if (RetVT == MVT::i128) 250 return FPTOSINT_F32_I128; 251 } else if (OpVT == MVT::f64) { 252 if (RetVT == MVT::i32) 253 return FPTOSINT_F64_I32; 254 if (RetVT == MVT::i64) 255 return FPTOSINT_F64_I64; 256 if (RetVT == MVT::i128) 257 return FPTOSINT_F64_I128; 258 } else if (OpVT == MVT::f80) { 259 if (RetVT == MVT::i32) 260 return FPTOSINT_F80_I32; 261 if (RetVT == MVT::i64) 262 return FPTOSINT_F80_I64; 263 if (RetVT == MVT::i128) 264 return FPTOSINT_F80_I128; 265 } else if (OpVT == MVT::f128) { 266 if (RetVT == MVT::i32) 267 return FPTOSINT_F128_I32; 268 if (RetVT == MVT::i64) 269 return FPTOSINT_F128_I64; 270 if (RetVT == MVT::i128) 271 return FPTOSINT_F128_I128; 272 } else if (OpVT == MVT::ppcf128) { 273 if (RetVT == MVT::i32) 274 return FPTOSINT_PPCF128_I32; 275 if (RetVT == MVT::i64) 276 return FPTOSINT_PPCF128_I64; 277 if (RetVT == MVT::i128) 278 return FPTOSINT_PPCF128_I128; 279 } 280 return UNKNOWN_LIBCALL; 281 } 282 283 /// getFPTOUINT - Return the FPTOUINT_*_* value for the given types, or 284 /// UNKNOWN_LIBCALL if there is none. 285 RTLIB::Libcall RTLIB::getFPTOUINT(EVT OpVT, EVT RetVT) { 286 if (OpVT == MVT::f32) { 287 if (RetVT == MVT::i32) 288 return FPTOUINT_F32_I32; 289 if (RetVT == MVT::i64) 290 return FPTOUINT_F32_I64; 291 if (RetVT == MVT::i128) 292 return FPTOUINT_F32_I128; 293 } else if (OpVT == MVT::f64) { 294 if (RetVT == MVT::i32) 295 return FPTOUINT_F64_I32; 296 if (RetVT == MVT::i64) 297 return FPTOUINT_F64_I64; 298 if (RetVT == MVT::i128) 299 return FPTOUINT_F64_I128; 300 } else if (OpVT == MVT::f80) { 301 if (RetVT == MVT::i32) 302 return FPTOUINT_F80_I32; 303 if (RetVT == MVT::i64) 304 return FPTOUINT_F80_I64; 305 if (RetVT == MVT::i128) 306 return FPTOUINT_F80_I128; 307 } else if (OpVT == MVT::f128) { 308 if (RetVT == MVT::i32) 309 return FPTOUINT_F128_I32; 310 if (RetVT == MVT::i64) 311 return FPTOUINT_F128_I64; 312 if (RetVT == MVT::i128) 313 return FPTOUINT_F128_I128; 314 } else if (OpVT == MVT::ppcf128) { 315 if (RetVT == MVT::i32) 316 return FPTOUINT_PPCF128_I32; 317 if (RetVT == MVT::i64) 318 return FPTOUINT_PPCF128_I64; 319 if (RetVT == MVT::i128) 320 return FPTOUINT_PPCF128_I128; 321 } 322 return UNKNOWN_LIBCALL; 323 } 324 325 /// getSINTTOFP - Return the SINTTOFP_*_* value for the given types, or 326 /// UNKNOWN_LIBCALL if there is none. 327 RTLIB::Libcall RTLIB::getSINTTOFP(EVT OpVT, EVT RetVT) { 328 if (OpVT == MVT::i32) { 329 if (RetVT == MVT::f32) 330 return SINTTOFP_I32_F32; 331 if (RetVT == MVT::f64) 332 return SINTTOFP_I32_F64; 333 if (RetVT == MVT::f80) 334 return SINTTOFP_I32_F80; 335 if (RetVT == MVT::f128) 336 return SINTTOFP_I32_F128; 337 if (RetVT == MVT::ppcf128) 338 return SINTTOFP_I32_PPCF128; 339 } else if (OpVT == MVT::i64) { 340 if (RetVT == MVT::f32) 341 return SINTTOFP_I64_F32; 342 if (RetVT == MVT::f64) 343 return SINTTOFP_I64_F64; 344 if (RetVT == MVT::f80) 345 return SINTTOFP_I64_F80; 346 if (RetVT == MVT::f128) 347 return SINTTOFP_I64_F128; 348 if (RetVT == MVT::ppcf128) 349 return SINTTOFP_I64_PPCF128; 350 } else if (OpVT == MVT::i128) { 351 if (RetVT == MVT::f32) 352 return SINTTOFP_I128_F32; 353 if (RetVT == MVT::f64) 354 return SINTTOFP_I128_F64; 355 if (RetVT == MVT::f80) 356 return SINTTOFP_I128_F80; 357 if (RetVT == MVT::f128) 358 return SINTTOFP_I128_F128; 359 if (RetVT == MVT::ppcf128) 360 return SINTTOFP_I128_PPCF128; 361 } 362 return UNKNOWN_LIBCALL; 363 } 364 365 /// getUINTTOFP - Return the UINTTOFP_*_* value for the given types, or 366 /// UNKNOWN_LIBCALL if there is none. 367 RTLIB::Libcall RTLIB::getUINTTOFP(EVT OpVT, EVT RetVT) { 368 if (OpVT == MVT::i32) { 369 if (RetVT == MVT::f32) 370 return UINTTOFP_I32_F32; 371 if (RetVT == MVT::f64) 372 return UINTTOFP_I32_F64; 373 if (RetVT == MVT::f80) 374 return UINTTOFP_I32_F80; 375 if (RetVT == MVT::f128) 376 return UINTTOFP_I32_F128; 377 if (RetVT == MVT::ppcf128) 378 return UINTTOFP_I32_PPCF128; 379 } else if (OpVT == MVT::i64) { 380 if (RetVT == MVT::f32) 381 return UINTTOFP_I64_F32; 382 if (RetVT == MVT::f64) 383 return UINTTOFP_I64_F64; 384 if (RetVT == MVT::f80) 385 return UINTTOFP_I64_F80; 386 if (RetVT == MVT::f128) 387 return UINTTOFP_I64_F128; 388 if (RetVT == MVT::ppcf128) 389 return UINTTOFP_I64_PPCF128; 390 } else if (OpVT == MVT::i128) { 391 if (RetVT == MVT::f32) 392 return UINTTOFP_I128_F32; 393 if (RetVT == MVT::f64) 394 return UINTTOFP_I128_F64; 395 if (RetVT == MVT::f80) 396 return UINTTOFP_I128_F80; 397 if (RetVT == MVT::f128) 398 return UINTTOFP_I128_F128; 399 if (RetVT == MVT::ppcf128) 400 return UINTTOFP_I128_PPCF128; 401 } 402 return UNKNOWN_LIBCALL; 403 } 404 405 RTLIB::Libcall RTLIB::getSYNC(unsigned Opc, MVT VT) { 406 #define OP_TO_LIBCALL(Name, Enum) \ 407 case Name: \ 408 switch (VT.SimpleTy) { \ 409 default: \ 410 return UNKNOWN_LIBCALL; \ 411 case MVT::i8: \ 412 return Enum##_1; \ 413 case MVT::i16: \ 414 return Enum##_2; \ 415 case MVT::i32: \ 416 return Enum##_4; \ 417 case MVT::i64: \ 418 return Enum##_8; \ 419 case MVT::i128: \ 420 return Enum##_16; \ 421 } 422 423 switch (Opc) { 424 OP_TO_LIBCALL(ISD::ATOMIC_SWAP, SYNC_LOCK_TEST_AND_SET) 425 OP_TO_LIBCALL(ISD::ATOMIC_CMP_SWAP, SYNC_VAL_COMPARE_AND_SWAP) 426 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_ADD, SYNC_FETCH_AND_ADD) 427 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_SUB, SYNC_FETCH_AND_SUB) 428 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_AND, SYNC_FETCH_AND_AND) 429 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_OR, SYNC_FETCH_AND_OR) 430 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_XOR, SYNC_FETCH_AND_XOR) 431 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_NAND, SYNC_FETCH_AND_NAND) 432 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_MAX, SYNC_FETCH_AND_MAX) 433 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_UMAX, SYNC_FETCH_AND_UMAX) 434 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_MIN, SYNC_FETCH_AND_MIN) 435 OP_TO_LIBCALL(ISD::ATOMIC_LOAD_UMIN, SYNC_FETCH_AND_UMIN) 436 } 437 438 #undef OP_TO_LIBCALL 439 440 return UNKNOWN_LIBCALL; 441 } 442 443 RTLIB::Libcall RTLIB::getMEMCPY_ELEMENT_UNORDERED_ATOMIC(uint64_t ElementSize) { 444 switch (ElementSize) { 445 case 1: 446 return MEMCPY_ELEMENT_UNORDERED_ATOMIC_1; 447 case 2: 448 return MEMCPY_ELEMENT_UNORDERED_ATOMIC_2; 449 case 4: 450 return MEMCPY_ELEMENT_UNORDERED_ATOMIC_4; 451 case 8: 452 return MEMCPY_ELEMENT_UNORDERED_ATOMIC_8; 453 case 16: 454 return MEMCPY_ELEMENT_UNORDERED_ATOMIC_16; 455 default: 456 return UNKNOWN_LIBCALL; 457 } 458 } 459 460 RTLIB::Libcall RTLIB::getMEMMOVE_ELEMENT_UNORDERED_ATOMIC(uint64_t ElementSize) { 461 switch (ElementSize) { 462 case 1: 463 return MEMMOVE_ELEMENT_UNORDERED_ATOMIC_1; 464 case 2: 465 return MEMMOVE_ELEMENT_UNORDERED_ATOMIC_2; 466 case 4: 467 return MEMMOVE_ELEMENT_UNORDERED_ATOMIC_4; 468 case 8: 469 return MEMMOVE_ELEMENT_UNORDERED_ATOMIC_8; 470 case 16: 471 return MEMMOVE_ELEMENT_UNORDERED_ATOMIC_16; 472 default: 473 return UNKNOWN_LIBCALL; 474 } 475 } 476 477 RTLIB::Libcall RTLIB::getMEMSET_ELEMENT_UNORDERED_ATOMIC(uint64_t ElementSize) { 478 switch (ElementSize) { 479 case 1: 480 return MEMSET_ELEMENT_UNORDERED_ATOMIC_1; 481 case 2: 482 return MEMSET_ELEMENT_UNORDERED_ATOMIC_2; 483 case 4: 484 return MEMSET_ELEMENT_UNORDERED_ATOMIC_4; 485 case 8: 486 return MEMSET_ELEMENT_UNORDERED_ATOMIC_8; 487 case 16: 488 return MEMSET_ELEMENT_UNORDERED_ATOMIC_16; 489 default: 490 return UNKNOWN_LIBCALL; 491 } 492 } 493 494 /// InitCmpLibcallCCs - Set default comparison libcall CC. 495 static void InitCmpLibcallCCs(ISD::CondCode *CCs) { 496 memset(CCs, ISD::SETCC_INVALID, sizeof(ISD::CondCode)*RTLIB::UNKNOWN_LIBCALL); 497 CCs[RTLIB::OEQ_F32] = ISD::SETEQ; 498 CCs[RTLIB::OEQ_F64] = ISD::SETEQ; 499 CCs[RTLIB::OEQ_F128] = ISD::SETEQ; 500 CCs[RTLIB::OEQ_PPCF128] = ISD::SETEQ; 501 CCs[RTLIB::UNE_F32] = ISD::SETNE; 502 CCs[RTLIB::UNE_F64] = ISD::SETNE; 503 CCs[RTLIB::UNE_F128] = ISD::SETNE; 504 CCs[RTLIB::UNE_PPCF128] = ISD::SETNE; 505 CCs[RTLIB::OGE_F32] = ISD::SETGE; 506 CCs[RTLIB::OGE_F64] = ISD::SETGE; 507 CCs[RTLIB::OGE_F128] = ISD::SETGE; 508 CCs[RTLIB::OGE_PPCF128] = ISD::SETGE; 509 CCs[RTLIB::OLT_F32] = ISD::SETLT; 510 CCs[RTLIB::OLT_F64] = ISD::SETLT; 511 CCs[RTLIB::OLT_F128] = ISD::SETLT; 512 CCs[RTLIB::OLT_PPCF128] = ISD::SETLT; 513 CCs[RTLIB::OLE_F32] = ISD::SETLE; 514 CCs[RTLIB::OLE_F64] = ISD::SETLE; 515 CCs[RTLIB::OLE_F128] = ISD::SETLE; 516 CCs[RTLIB::OLE_PPCF128] = ISD::SETLE; 517 CCs[RTLIB::OGT_F32] = ISD::SETGT; 518 CCs[RTLIB::OGT_F64] = ISD::SETGT; 519 CCs[RTLIB::OGT_F128] = ISD::SETGT; 520 CCs[RTLIB::OGT_PPCF128] = ISD::SETGT; 521 CCs[RTLIB::UO_F32] = ISD::SETNE; 522 CCs[RTLIB::UO_F64] = ISD::SETNE; 523 CCs[RTLIB::UO_F128] = ISD::SETNE; 524 CCs[RTLIB::UO_PPCF128] = ISD::SETNE; 525 CCs[RTLIB::O_F32] = ISD::SETEQ; 526 CCs[RTLIB::O_F64] = ISD::SETEQ; 527 CCs[RTLIB::O_F128] = ISD::SETEQ; 528 CCs[RTLIB::O_PPCF128] = ISD::SETEQ; 529 } 530 531 /// NOTE: The TargetMachine owns TLOF. 532 TargetLoweringBase::TargetLoweringBase(const TargetMachine &tm) : TM(tm) { 533 initActions(); 534 535 // Perform these initializations only once. 536 MaxStoresPerMemset = MaxStoresPerMemcpy = MaxStoresPerMemmove = 537 MaxLoadsPerMemcmp = 8; 538 MaxGluedStoresPerMemcpy = 0; 539 MaxStoresPerMemsetOptSize = MaxStoresPerMemcpyOptSize = 540 MaxStoresPerMemmoveOptSize = MaxLoadsPerMemcmpOptSize = 4; 541 UseUnderscoreSetJmp = false; 542 UseUnderscoreLongJmp = false; 543 HasMultipleConditionRegisters = false; 544 HasExtractBitsInsn = false; 545 JumpIsExpensive = JumpIsExpensiveOverride; 546 PredictableSelectIsExpensive = false; 547 EnableExtLdPromotion = false; 548 StackPointerRegisterToSaveRestore = 0; 549 BooleanContents = UndefinedBooleanContent; 550 BooleanFloatContents = UndefinedBooleanContent; 551 BooleanVectorContents = UndefinedBooleanContent; 552 SchedPreferenceInfo = Sched::ILP; 553 JumpBufSize = 0; 554 JumpBufAlignment = 0; 555 MinFunctionAlignment = 0; 556 PrefFunctionAlignment = 0; 557 PrefLoopAlignment = 0; 558 GatherAllAliasesMaxDepth = 18; 559 MinStackArgumentAlignment = 1; 560 // TODO: the default will be switched to 0 in the next commit, along 561 // with the Target-specific changes necessary. 562 MaxAtomicSizeInBitsSupported = 1024; 563 564 MinCmpXchgSizeInBits = 0; 565 SupportsUnalignedAtomics = false; 566 567 std::fill(std::begin(LibcallRoutineNames), std::end(LibcallRoutineNames), nullptr); 568 569 InitLibcalls(TM.getTargetTriple()); 570 InitCmpLibcallCCs(CmpLibcallCCs); 571 } 572 573 void TargetLoweringBase::initActions() { 574 // All operations default to being supported. 575 memset(OpActions, 0, sizeof(OpActions)); 576 memset(LoadExtActions, 0, sizeof(LoadExtActions)); 577 memset(TruncStoreActions, 0, sizeof(TruncStoreActions)); 578 memset(IndexedModeActions, 0, sizeof(IndexedModeActions)); 579 memset(CondCodeActions, 0, sizeof(CondCodeActions)); 580 std::fill(std::begin(RegClassForVT), std::end(RegClassForVT), nullptr); 581 std::fill(std::begin(TargetDAGCombineArray), 582 std::end(TargetDAGCombineArray), 0); 583 584 for (MVT VT : MVT::fp_valuetypes()) { 585 MVT IntVT = MVT::getIntegerVT(VT.getSizeInBits()); 586 if (IntVT.isValid()) { 587 setOperationAction(ISD::ATOMIC_SWAP, VT, Promote); 588 AddPromotedToType(ISD::ATOMIC_SWAP, VT, IntVT); 589 } 590 } 591 592 // Set default actions for various operations. 593 for (MVT VT : MVT::all_valuetypes()) { 594 // Default all indexed load / store to expand. 595 for (unsigned IM = (unsigned)ISD::PRE_INC; 596 IM != (unsigned)ISD::LAST_INDEXED_MODE; ++IM) { 597 setIndexedLoadAction(IM, VT, Expand); 598 setIndexedStoreAction(IM, VT, Expand); 599 } 600 601 // Most backends expect to see the node which just returns the value loaded. 602 setOperationAction(ISD::ATOMIC_CMP_SWAP_WITH_SUCCESS, VT, Expand); 603 604 // These operations default to expand. 605 setOperationAction(ISD::FGETSIGN, VT, Expand); 606 setOperationAction(ISD::CONCAT_VECTORS, VT, Expand); 607 setOperationAction(ISD::FMINNUM, VT, Expand); 608 setOperationAction(ISD::FMAXNUM, VT, Expand); 609 setOperationAction(ISD::FMINNUM_IEEE, VT, Expand); 610 setOperationAction(ISD::FMAXNUM_IEEE, VT, Expand); 611 setOperationAction(ISD::FMINIMUM, VT, Expand); 612 setOperationAction(ISD::FMAXIMUM, VT, Expand); 613 setOperationAction(ISD::FMAD, VT, Expand); 614 setOperationAction(ISD::SMIN, VT, Expand); 615 setOperationAction(ISD::SMAX, VT, Expand); 616 setOperationAction(ISD::UMIN, VT, Expand); 617 setOperationAction(ISD::UMAX, VT, Expand); 618 setOperationAction(ISD::ABS, VT, Expand); 619 setOperationAction(ISD::FSHL, VT, Expand); 620 setOperationAction(ISD::FSHR, VT, Expand); 621 setOperationAction(ISD::SADDSAT, VT, Expand); 622 setOperationAction(ISD::UADDSAT, VT, Expand); 623 setOperationAction(ISD::SSUBSAT, VT, Expand); 624 setOperationAction(ISD::USUBSAT, VT, Expand); 625 setOperationAction(ISD::SMULFIX, VT, Expand); 626 setOperationAction(ISD::UMULFIX, VT, Expand); 627 628 // Overflow operations default to expand 629 setOperationAction(ISD::SADDO, VT, Expand); 630 setOperationAction(ISD::SSUBO, VT, Expand); 631 setOperationAction(ISD::UADDO, VT, Expand); 632 setOperationAction(ISD::USUBO, VT, Expand); 633 setOperationAction(ISD::SMULO, VT, Expand); 634 setOperationAction(ISD::UMULO, VT, Expand); 635 636 // ADDCARRY operations default to expand 637 setOperationAction(ISD::ADDCARRY, VT, Expand); 638 setOperationAction(ISD::SUBCARRY, VT, Expand); 639 setOperationAction(ISD::SETCCCARRY, VT, Expand); 640 641 // ADDC/ADDE/SUBC/SUBE default to expand. 642 setOperationAction(ISD::ADDC, VT, Expand); 643 setOperationAction(ISD::ADDE, VT, Expand); 644 setOperationAction(ISD::SUBC, VT, Expand); 645 setOperationAction(ISD::SUBE, VT, Expand); 646 647 // These default to Expand so they will be expanded to CTLZ/CTTZ by default. 648 setOperationAction(ISD::CTLZ_ZERO_UNDEF, VT, Expand); 649 setOperationAction(ISD::CTTZ_ZERO_UNDEF, VT, Expand); 650 651 setOperationAction(ISD::BITREVERSE, VT, Expand); 652 653 // These library functions default to expand. 654 setOperationAction(ISD::FROUND, VT, Expand); 655 setOperationAction(ISD::FPOWI, VT, Expand); 656 657 // These operations default to expand for vector types. 658 if (VT.isVector()) { 659 setOperationAction(ISD::FCOPYSIGN, VT, Expand); 660 setOperationAction(ISD::ANY_EXTEND_VECTOR_INREG, VT, Expand); 661 setOperationAction(ISD::SIGN_EXTEND_VECTOR_INREG, VT, Expand); 662 setOperationAction(ISD::ZERO_EXTEND_VECTOR_INREG, VT, Expand); 663 } 664 665 // For most targets @llvm.get.dynamic.area.offset just returns 0. 666 setOperationAction(ISD::GET_DYNAMIC_AREA_OFFSET, VT, Expand); 667 668 // Vector reduction default to expand. 669 setOperationAction(ISD::VECREDUCE_FADD, VT, Expand); 670 setOperationAction(ISD::VECREDUCE_FMUL, VT, Expand); 671 setOperationAction(ISD::VECREDUCE_ADD, VT, Expand); 672 setOperationAction(ISD::VECREDUCE_MUL, VT, Expand); 673 setOperationAction(ISD::VECREDUCE_AND, VT, Expand); 674 setOperationAction(ISD::VECREDUCE_OR, VT, Expand); 675 setOperationAction(ISD::VECREDUCE_XOR, VT, Expand); 676 setOperationAction(ISD::VECREDUCE_SMAX, VT, Expand); 677 setOperationAction(ISD::VECREDUCE_SMIN, VT, Expand); 678 setOperationAction(ISD::VECREDUCE_UMAX, VT, Expand); 679 setOperationAction(ISD::VECREDUCE_UMIN, VT, Expand); 680 setOperationAction(ISD::VECREDUCE_FMAX, VT, Expand); 681 setOperationAction(ISD::VECREDUCE_FMIN, VT, Expand); 682 } 683 684 // Most targets ignore the @llvm.prefetch intrinsic. 685 setOperationAction(ISD::PREFETCH, MVT::Other, Expand); 686 687 // Most targets also ignore the @llvm.readcyclecounter intrinsic. 688 setOperationAction(ISD::READCYCLECOUNTER, MVT::i64, Expand); 689 690 // ConstantFP nodes default to expand. Targets can either change this to 691 // Legal, in which case all fp constants are legal, or use isFPImmLegal() 692 // to optimize expansions for certain constants. 693 setOperationAction(ISD::ConstantFP, MVT::f16, Expand); 694 setOperationAction(ISD::ConstantFP, MVT::f32, Expand); 695 setOperationAction(ISD::ConstantFP, MVT::f64, Expand); 696 setOperationAction(ISD::ConstantFP, MVT::f80, Expand); 697 setOperationAction(ISD::ConstantFP, MVT::f128, Expand); 698 699 // These library functions default to expand. 700 for (MVT VT : {MVT::f32, MVT::f64, MVT::f128}) { 701 setOperationAction(ISD::FCBRT, VT, Expand); 702 setOperationAction(ISD::FLOG , VT, Expand); 703 setOperationAction(ISD::FLOG2, VT, Expand); 704 setOperationAction(ISD::FLOG10, VT, Expand); 705 setOperationAction(ISD::FEXP , VT, Expand); 706 setOperationAction(ISD::FEXP2, VT, Expand); 707 setOperationAction(ISD::FFLOOR, VT, Expand); 708 setOperationAction(ISD::FNEARBYINT, VT, Expand); 709 setOperationAction(ISD::FCEIL, VT, Expand); 710 setOperationAction(ISD::FRINT, VT, Expand); 711 setOperationAction(ISD::FTRUNC, VT, Expand); 712 setOperationAction(ISD::FROUND, VT, Expand); 713 setOperationAction(ISD::LROUND, VT, Expand); 714 setOperationAction(ISD::LLROUND, VT, Expand); 715 } 716 717 // Default ISD::TRAP to expand (which turns it into abort). 718 setOperationAction(ISD::TRAP, MVT::Other, Expand); 719 720 // On most systems, DEBUGTRAP and TRAP have no difference. The "Expand" 721 // here is to inform DAG Legalizer to replace DEBUGTRAP with TRAP. 722 setOperationAction(ISD::DEBUGTRAP, MVT::Other, Expand); 723 } 724 725 MVT TargetLoweringBase::getScalarShiftAmountTy(const DataLayout &DL, 726 EVT) const { 727 return MVT::getIntegerVT(DL.getPointerSizeInBits(0)); 728 } 729 730 EVT TargetLoweringBase::getShiftAmountTy(EVT LHSTy, const DataLayout &DL, 731 bool LegalTypes) const { 732 assert(LHSTy.isInteger() && "Shift amount is not an integer type!"); 733 if (LHSTy.isVector()) 734 return LHSTy; 735 return LegalTypes ? getScalarShiftAmountTy(DL, LHSTy) 736 : getPointerTy(DL); 737 } 738 739 bool TargetLoweringBase::canOpTrap(unsigned Op, EVT VT) const { 740 assert(isTypeLegal(VT)); 741 switch (Op) { 742 default: 743 return false; 744 case ISD::SDIV: 745 case ISD::UDIV: 746 case ISD::SREM: 747 case ISD::UREM: 748 return true; 749 } 750 } 751 752 void TargetLoweringBase::setJumpIsExpensive(bool isExpensive) { 753 // If the command-line option was specified, ignore this request. 754 if (!JumpIsExpensiveOverride.getNumOccurrences()) 755 JumpIsExpensive = isExpensive; 756 } 757 758 TargetLoweringBase::LegalizeKind 759 TargetLoweringBase::getTypeConversion(LLVMContext &Context, EVT VT) const { 760 // If this is a simple type, use the ComputeRegisterProp mechanism. 761 if (VT.isSimple()) { 762 MVT SVT = VT.getSimpleVT(); 763 assert((unsigned)SVT.SimpleTy < array_lengthof(TransformToType)); 764 MVT NVT = TransformToType[SVT.SimpleTy]; 765 LegalizeTypeAction LA = ValueTypeActions.getTypeAction(SVT); 766 767 assert((LA == TypeLegal || LA == TypeSoftenFloat || 768 ValueTypeActions.getTypeAction(NVT) != TypePromoteInteger) && 769 "Promote may not follow Expand or Promote"); 770 771 if (LA == TypeSplitVector) 772 return LegalizeKind(LA, 773 EVT::getVectorVT(Context, SVT.getVectorElementType(), 774 SVT.getVectorNumElements() / 2)); 775 if (LA == TypeScalarizeVector) 776 return LegalizeKind(LA, SVT.getVectorElementType()); 777 return LegalizeKind(LA, NVT); 778 } 779 780 // Handle Extended Scalar Types. 781 if (!VT.isVector()) { 782 assert(VT.isInteger() && "Float types must be simple"); 783 unsigned BitSize = VT.getSizeInBits(); 784 // First promote to a power-of-two size, then expand if necessary. 785 if (BitSize < 8 || !isPowerOf2_32(BitSize)) { 786 EVT NVT = VT.getRoundIntegerType(Context); 787 assert(NVT != VT && "Unable to round integer VT"); 788 LegalizeKind NextStep = getTypeConversion(Context, NVT); 789 // Avoid multi-step promotion. 790 if (NextStep.first == TypePromoteInteger) 791 return NextStep; 792 // Return rounded integer type. 793 return LegalizeKind(TypePromoteInteger, NVT); 794 } 795 796 return LegalizeKind(TypeExpandInteger, 797 EVT::getIntegerVT(Context, VT.getSizeInBits() / 2)); 798 } 799 800 // Handle vector types. 801 unsigned NumElts = VT.getVectorNumElements(); 802 EVT EltVT = VT.getVectorElementType(); 803 804 // Vectors with only one element are always scalarized. 805 if (NumElts == 1) 806 return LegalizeKind(TypeScalarizeVector, EltVT); 807 808 // Try to widen vector elements until the element type is a power of two and 809 // promote it to a legal type later on, for example: 810 // <3 x i8> -> <4 x i8> -> <4 x i32> 811 if (EltVT.isInteger()) { 812 // Vectors with a number of elements that is not a power of two are always 813 // widened, for example <3 x i8> -> <4 x i8>. 814 if (!VT.isPow2VectorType()) { 815 NumElts = (unsigned)NextPowerOf2(NumElts); 816 EVT NVT = EVT::getVectorVT(Context, EltVT, NumElts); 817 return LegalizeKind(TypeWidenVector, NVT); 818 } 819 820 // Examine the element type. 821 LegalizeKind LK = getTypeConversion(Context, EltVT); 822 823 // If type is to be expanded, split the vector. 824 // <4 x i140> -> <2 x i140> 825 if (LK.first == TypeExpandInteger) 826 return LegalizeKind(TypeSplitVector, 827 EVT::getVectorVT(Context, EltVT, NumElts / 2)); 828 829 // Promote the integer element types until a legal vector type is found 830 // or until the element integer type is too big. If a legal type was not 831 // found, fallback to the usual mechanism of widening/splitting the 832 // vector. 833 EVT OldEltVT = EltVT; 834 while (true) { 835 // Increase the bitwidth of the element to the next pow-of-two 836 // (which is greater than 8 bits). 837 EltVT = EVT::getIntegerVT(Context, 1 + EltVT.getSizeInBits()) 838 .getRoundIntegerType(Context); 839 840 // Stop trying when getting a non-simple element type. 841 // Note that vector elements may be greater than legal vector element 842 // types. Example: X86 XMM registers hold 64bit element on 32bit 843 // systems. 844 if (!EltVT.isSimple()) 845 break; 846 847 // Build a new vector type and check if it is legal. 848 MVT NVT = MVT::getVectorVT(EltVT.getSimpleVT(), NumElts); 849 // Found a legal promoted vector type. 850 if (NVT != MVT() && ValueTypeActions.getTypeAction(NVT) == TypeLegal) 851 return LegalizeKind(TypePromoteInteger, 852 EVT::getVectorVT(Context, EltVT, NumElts)); 853 } 854 855 // Reset the type to the unexpanded type if we did not find a legal vector 856 // type with a promoted vector element type. 857 EltVT = OldEltVT; 858 } 859 860 // Try to widen the vector until a legal type is found. 861 // If there is no wider legal type, split the vector. 862 while (true) { 863 // Round up to the next power of 2. 864 NumElts = (unsigned)NextPowerOf2(NumElts); 865 866 // If there is no simple vector type with this many elements then there 867 // cannot be a larger legal vector type. Note that this assumes that 868 // there are no skipped intermediate vector types in the simple types. 869 if (!EltVT.isSimple()) 870 break; 871 MVT LargerVector = MVT::getVectorVT(EltVT.getSimpleVT(), NumElts); 872 if (LargerVector == MVT()) 873 break; 874 875 // If this type is legal then widen the vector. 876 if (ValueTypeActions.getTypeAction(LargerVector) == TypeLegal) 877 return LegalizeKind(TypeWidenVector, LargerVector); 878 } 879 880 // Widen odd vectors to next power of two. 881 if (!VT.isPow2VectorType()) { 882 EVT NVT = VT.getPow2VectorType(Context); 883 return LegalizeKind(TypeWidenVector, NVT); 884 } 885 886 // Vectors with illegal element types are expanded. 887 EVT NVT = EVT::getVectorVT(Context, EltVT, VT.getVectorNumElements() / 2); 888 return LegalizeKind(TypeSplitVector, NVT); 889 } 890 891 static unsigned getVectorTypeBreakdownMVT(MVT VT, MVT &IntermediateVT, 892 unsigned &NumIntermediates, 893 MVT &RegisterVT, 894 TargetLoweringBase *TLI) { 895 // Figure out the right, legal destination reg to copy into. 896 unsigned NumElts = VT.getVectorNumElements(); 897 MVT EltTy = VT.getVectorElementType(); 898 899 unsigned NumVectorRegs = 1; 900 901 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we 902 // could break down into LHS/RHS like LegalizeDAG does. 903 if (!isPowerOf2_32(NumElts)) { 904 NumVectorRegs = NumElts; 905 NumElts = 1; 906 } 907 908 // Divide the input until we get to a supported size. This will always 909 // end with a scalar if the target doesn't support vectors. 910 while (NumElts > 1 && !TLI->isTypeLegal(MVT::getVectorVT(EltTy, NumElts))) { 911 NumElts >>= 1; 912 NumVectorRegs <<= 1; 913 } 914 915 NumIntermediates = NumVectorRegs; 916 917 MVT NewVT = MVT::getVectorVT(EltTy, NumElts); 918 if (!TLI->isTypeLegal(NewVT)) 919 NewVT = EltTy; 920 IntermediateVT = NewVT; 921 922 unsigned NewVTSize = NewVT.getSizeInBits(); 923 924 // Convert sizes such as i33 to i64. 925 if (!isPowerOf2_32(NewVTSize)) 926 NewVTSize = NextPowerOf2(NewVTSize); 927 928 MVT DestVT = TLI->getRegisterType(NewVT); 929 RegisterVT = DestVT; 930 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16. 931 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits()); 932 933 // Otherwise, promotion or legal types use the same number of registers as 934 // the vector decimated to the appropriate level. 935 return NumVectorRegs; 936 } 937 938 /// isLegalRC - Return true if the value types that can be represented by the 939 /// specified register class are all legal. 940 bool TargetLoweringBase::isLegalRC(const TargetRegisterInfo &TRI, 941 const TargetRegisterClass &RC) const { 942 for (auto I = TRI.legalclasstypes_begin(RC); *I != MVT::Other; ++I) 943 if (isTypeLegal(*I)) 944 return true; 945 return false; 946 } 947 948 /// Replace/modify any TargetFrameIndex operands with a targte-dependent 949 /// sequence of memory operands that is recognized by PrologEpilogInserter. 950 MachineBasicBlock * 951 TargetLoweringBase::emitPatchPoint(MachineInstr &InitialMI, 952 MachineBasicBlock *MBB) const { 953 MachineInstr *MI = &InitialMI; 954 MachineFunction &MF = *MI->getMF(); 955 MachineFrameInfo &MFI = MF.getFrameInfo(); 956 957 // We're handling multiple types of operands here: 958 // PATCHPOINT MetaArgs - live-in, read only, direct 959 // STATEPOINT Deopt Spill - live-through, read only, indirect 960 // STATEPOINT Deopt Alloca - live-through, read only, direct 961 // (We're currently conservative and mark the deopt slots read/write in 962 // practice.) 963 // STATEPOINT GC Spill - live-through, read/write, indirect 964 // STATEPOINT GC Alloca - live-through, read/write, direct 965 // The live-in vs live-through is handled already (the live through ones are 966 // all stack slots), but we need to handle the different type of stackmap 967 // operands and memory effects here. 968 969 // MI changes inside this loop as we grow operands. 970 for(unsigned OperIdx = 0; OperIdx != MI->getNumOperands(); ++OperIdx) { 971 MachineOperand &MO = MI->getOperand(OperIdx); 972 if (!MO.isFI()) 973 continue; 974 975 // foldMemoryOperand builds a new MI after replacing a single FI operand 976 // with the canonical set of five x86 addressing-mode operands. 977 int FI = MO.getIndex(); 978 MachineInstrBuilder MIB = BuildMI(MF, MI->getDebugLoc(), MI->getDesc()); 979 980 // Copy operands before the frame-index. 981 for (unsigned i = 0; i < OperIdx; ++i) 982 MIB.add(MI->getOperand(i)); 983 // Add frame index operands recognized by stackmaps.cpp 984 if (MFI.isStatepointSpillSlotObjectIndex(FI)) { 985 // indirect-mem-ref tag, size, #FI, offset. 986 // Used for spills inserted by StatepointLowering. This codepath is not 987 // used for patchpoints/stackmaps at all, for these spilling is done via 988 // foldMemoryOperand callback only. 989 assert(MI->getOpcode() == TargetOpcode::STATEPOINT && "sanity"); 990 MIB.addImm(StackMaps::IndirectMemRefOp); 991 MIB.addImm(MFI.getObjectSize(FI)); 992 MIB.add(MI->getOperand(OperIdx)); 993 MIB.addImm(0); 994 } else { 995 // direct-mem-ref tag, #FI, offset. 996 // Used by patchpoint, and direct alloca arguments to statepoints 997 MIB.addImm(StackMaps::DirectMemRefOp); 998 MIB.add(MI->getOperand(OperIdx)); 999 MIB.addImm(0); 1000 } 1001 // Copy the operands after the frame index. 1002 for (unsigned i = OperIdx + 1; i != MI->getNumOperands(); ++i) 1003 MIB.add(MI->getOperand(i)); 1004 1005 // Inherit previous memory operands. 1006 MIB.cloneMemRefs(*MI); 1007 assert(MIB->mayLoad() && "Folded a stackmap use to a non-load!"); 1008 1009 // Add a new memory operand for this FI. 1010 assert(MFI.getObjectOffset(FI) != -1); 1011 1012 // Note: STATEPOINT MMOs are added during SelectionDAG. STACKMAP, and 1013 // PATCHPOINT should be updated to do the same. (TODO) 1014 if (MI->getOpcode() != TargetOpcode::STATEPOINT) { 1015 auto Flags = MachineMemOperand::MOLoad; 1016 MachineMemOperand *MMO = MF.getMachineMemOperand( 1017 MachinePointerInfo::getFixedStack(MF, FI), Flags, 1018 MF.getDataLayout().getPointerSize(), MFI.getObjectAlignment(FI)); 1019 MIB->addMemOperand(MF, MMO); 1020 } 1021 1022 // Replace the instruction and update the operand index. 1023 MBB->insert(MachineBasicBlock::iterator(MI), MIB); 1024 OperIdx += (MIB->getNumOperands() - MI->getNumOperands()) - 1; 1025 MI->eraseFromParent(); 1026 MI = MIB; 1027 } 1028 return MBB; 1029 } 1030 1031 MachineBasicBlock * 1032 TargetLoweringBase::emitXRayCustomEvent(MachineInstr &MI, 1033 MachineBasicBlock *MBB) const { 1034 assert(MI.getOpcode() == TargetOpcode::PATCHABLE_EVENT_CALL && 1035 "Called emitXRayCustomEvent on the wrong MI!"); 1036 auto &MF = *MI.getMF(); 1037 auto MIB = BuildMI(MF, MI.getDebugLoc(), MI.getDesc()); 1038 for (unsigned OpIdx = 0; OpIdx != MI.getNumOperands(); ++OpIdx) 1039 MIB.add(MI.getOperand(OpIdx)); 1040 1041 MBB->insert(MachineBasicBlock::iterator(MI), MIB); 1042 MI.eraseFromParent(); 1043 return MBB; 1044 } 1045 1046 MachineBasicBlock * 1047 TargetLoweringBase::emitXRayTypedEvent(MachineInstr &MI, 1048 MachineBasicBlock *MBB) const { 1049 assert(MI.getOpcode() == TargetOpcode::PATCHABLE_TYPED_EVENT_CALL && 1050 "Called emitXRayTypedEvent on the wrong MI!"); 1051 auto &MF = *MI.getMF(); 1052 auto MIB = BuildMI(MF, MI.getDebugLoc(), MI.getDesc()); 1053 for (unsigned OpIdx = 0; OpIdx != MI.getNumOperands(); ++OpIdx) 1054 MIB.add(MI.getOperand(OpIdx)); 1055 1056 MBB->insert(MachineBasicBlock::iterator(MI), MIB); 1057 MI.eraseFromParent(); 1058 return MBB; 1059 } 1060 1061 /// findRepresentativeClass - Return the largest legal super-reg register class 1062 /// of the register class for the specified type and its associated "cost". 1063 // This function is in TargetLowering because it uses RegClassForVT which would 1064 // need to be moved to TargetRegisterInfo and would necessitate moving 1065 // isTypeLegal over as well - a massive change that would just require 1066 // TargetLowering having a TargetRegisterInfo class member that it would use. 1067 std::pair<const TargetRegisterClass *, uint8_t> 1068 TargetLoweringBase::findRepresentativeClass(const TargetRegisterInfo *TRI, 1069 MVT VT) const { 1070 const TargetRegisterClass *RC = RegClassForVT[VT.SimpleTy]; 1071 if (!RC) 1072 return std::make_pair(RC, 0); 1073 1074 // Compute the set of all super-register classes. 1075 BitVector SuperRegRC(TRI->getNumRegClasses()); 1076 for (SuperRegClassIterator RCI(RC, TRI); RCI.isValid(); ++RCI) 1077 SuperRegRC.setBitsInMask(RCI.getMask()); 1078 1079 // Find the first legal register class with the largest spill size. 1080 const TargetRegisterClass *BestRC = RC; 1081 for (unsigned i : SuperRegRC.set_bits()) { 1082 const TargetRegisterClass *SuperRC = TRI->getRegClass(i); 1083 // We want the largest possible spill size. 1084 if (TRI->getSpillSize(*SuperRC) <= TRI->getSpillSize(*BestRC)) 1085 continue; 1086 if (!isLegalRC(*TRI, *SuperRC)) 1087 continue; 1088 BestRC = SuperRC; 1089 } 1090 return std::make_pair(BestRC, 1); 1091 } 1092 1093 /// computeRegisterProperties - Once all of the register classes are added, 1094 /// this allows us to compute derived properties we expose. 1095 void TargetLoweringBase::computeRegisterProperties( 1096 const TargetRegisterInfo *TRI) { 1097 static_assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE, 1098 "Too many value types for ValueTypeActions to hold!"); 1099 1100 // Everything defaults to needing one register. 1101 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) { 1102 NumRegistersForVT[i] = 1; 1103 RegisterTypeForVT[i] = TransformToType[i] = (MVT::SimpleValueType)i; 1104 } 1105 // ...except isVoid, which doesn't need any registers. 1106 NumRegistersForVT[MVT::isVoid] = 0; 1107 1108 // Find the largest integer register class. 1109 unsigned LargestIntReg = MVT::LAST_INTEGER_VALUETYPE; 1110 for (; RegClassForVT[LargestIntReg] == nullptr; --LargestIntReg) 1111 assert(LargestIntReg != MVT::i1 && "No integer registers defined!"); 1112 1113 // Every integer value type larger than this largest register takes twice as 1114 // many registers to represent as the previous ValueType. 1115 for (unsigned ExpandedReg = LargestIntReg + 1; 1116 ExpandedReg <= MVT::LAST_INTEGER_VALUETYPE; ++ExpandedReg) { 1117 NumRegistersForVT[ExpandedReg] = 2*NumRegistersForVT[ExpandedReg-1]; 1118 RegisterTypeForVT[ExpandedReg] = (MVT::SimpleValueType)LargestIntReg; 1119 TransformToType[ExpandedReg] = (MVT::SimpleValueType)(ExpandedReg - 1); 1120 ValueTypeActions.setTypeAction((MVT::SimpleValueType)ExpandedReg, 1121 TypeExpandInteger); 1122 } 1123 1124 // Inspect all of the ValueType's smaller than the largest integer 1125 // register to see which ones need promotion. 1126 unsigned LegalIntReg = LargestIntReg; 1127 for (unsigned IntReg = LargestIntReg - 1; 1128 IntReg >= (unsigned)MVT::i1; --IntReg) { 1129 MVT IVT = (MVT::SimpleValueType)IntReg; 1130 if (isTypeLegal(IVT)) { 1131 LegalIntReg = IntReg; 1132 } else { 1133 RegisterTypeForVT[IntReg] = TransformToType[IntReg] = 1134 (MVT::SimpleValueType)LegalIntReg; 1135 ValueTypeActions.setTypeAction(IVT, TypePromoteInteger); 1136 } 1137 } 1138 1139 // ppcf128 type is really two f64's. 1140 if (!isTypeLegal(MVT::ppcf128)) { 1141 if (isTypeLegal(MVT::f64)) { 1142 NumRegistersForVT[MVT::ppcf128] = 2*NumRegistersForVT[MVT::f64]; 1143 RegisterTypeForVT[MVT::ppcf128] = MVT::f64; 1144 TransformToType[MVT::ppcf128] = MVT::f64; 1145 ValueTypeActions.setTypeAction(MVT::ppcf128, TypeExpandFloat); 1146 } else { 1147 NumRegistersForVT[MVT::ppcf128] = NumRegistersForVT[MVT::i128]; 1148 RegisterTypeForVT[MVT::ppcf128] = RegisterTypeForVT[MVT::i128]; 1149 TransformToType[MVT::ppcf128] = MVT::i128; 1150 ValueTypeActions.setTypeAction(MVT::ppcf128, TypeSoftenFloat); 1151 } 1152 } 1153 1154 // Decide how to handle f128. If the target does not have native f128 support, 1155 // expand it to i128 and we will be generating soft float library calls. 1156 if (!isTypeLegal(MVT::f128)) { 1157 NumRegistersForVT[MVT::f128] = NumRegistersForVT[MVT::i128]; 1158 RegisterTypeForVT[MVT::f128] = RegisterTypeForVT[MVT::i128]; 1159 TransformToType[MVT::f128] = MVT::i128; 1160 ValueTypeActions.setTypeAction(MVT::f128, TypeSoftenFloat); 1161 } 1162 1163 // Decide how to handle f64. If the target does not have native f64 support, 1164 // expand it to i64 and we will be generating soft float library calls. 1165 if (!isTypeLegal(MVT::f64)) { 1166 NumRegistersForVT[MVT::f64] = NumRegistersForVT[MVT::i64]; 1167 RegisterTypeForVT[MVT::f64] = RegisterTypeForVT[MVT::i64]; 1168 TransformToType[MVT::f64] = MVT::i64; 1169 ValueTypeActions.setTypeAction(MVT::f64, TypeSoftenFloat); 1170 } 1171 1172 // Decide how to handle f32. If the target does not have native f32 support, 1173 // expand it to i32 and we will be generating soft float library calls. 1174 if (!isTypeLegal(MVT::f32)) { 1175 NumRegistersForVT[MVT::f32] = NumRegistersForVT[MVT::i32]; 1176 RegisterTypeForVT[MVT::f32] = RegisterTypeForVT[MVT::i32]; 1177 TransformToType[MVT::f32] = MVT::i32; 1178 ValueTypeActions.setTypeAction(MVT::f32, TypeSoftenFloat); 1179 } 1180 1181 // Decide how to handle f16. If the target does not have native f16 support, 1182 // promote it to f32, because there are no f16 library calls (except for 1183 // conversions). 1184 if (!isTypeLegal(MVT::f16)) { 1185 NumRegistersForVT[MVT::f16] = NumRegistersForVT[MVT::f32]; 1186 RegisterTypeForVT[MVT::f16] = RegisterTypeForVT[MVT::f32]; 1187 TransformToType[MVT::f16] = MVT::f32; 1188 ValueTypeActions.setTypeAction(MVT::f16, TypePromoteFloat); 1189 } 1190 1191 // Loop over all of the vector value types to see which need transformations. 1192 for (unsigned i = MVT::FIRST_VECTOR_VALUETYPE; 1193 i <= (unsigned)MVT::LAST_VECTOR_VALUETYPE; ++i) { 1194 MVT VT = (MVT::SimpleValueType) i; 1195 if (isTypeLegal(VT)) 1196 continue; 1197 1198 MVT EltVT = VT.getVectorElementType(); 1199 unsigned NElts = VT.getVectorNumElements(); 1200 bool IsLegalWiderType = false; 1201 LegalizeTypeAction PreferredAction = getPreferredVectorAction(VT); 1202 switch (PreferredAction) { 1203 case TypePromoteInteger: 1204 // Try to promote the elements of integer vectors. If no legal 1205 // promotion was found, fall through to the widen-vector method. 1206 for (unsigned nVT = i + 1; nVT <= MVT::LAST_INTEGER_VECTOR_VALUETYPE; ++nVT) { 1207 MVT SVT = (MVT::SimpleValueType) nVT; 1208 // Promote vectors of integers to vectors with the same number 1209 // of elements, with a wider element type. 1210 if (SVT.getScalarSizeInBits() > EltVT.getSizeInBits() && 1211 SVT.getVectorNumElements() == NElts && isTypeLegal(SVT)) { 1212 TransformToType[i] = SVT; 1213 RegisterTypeForVT[i] = SVT; 1214 NumRegistersForVT[i] = 1; 1215 ValueTypeActions.setTypeAction(VT, TypePromoteInteger); 1216 IsLegalWiderType = true; 1217 break; 1218 } 1219 } 1220 if (IsLegalWiderType) 1221 break; 1222 LLVM_FALLTHROUGH; 1223 1224 case TypeWidenVector: 1225 // Try to widen the vector. 1226 for (unsigned nVT = i + 1; nVT <= MVT::LAST_VECTOR_VALUETYPE; ++nVT) { 1227 MVT SVT = (MVT::SimpleValueType) nVT; 1228 if (SVT.getVectorElementType() == EltVT 1229 && SVT.getVectorNumElements() > NElts && isTypeLegal(SVT)) { 1230 TransformToType[i] = SVT; 1231 RegisterTypeForVT[i] = SVT; 1232 NumRegistersForVT[i] = 1; 1233 ValueTypeActions.setTypeAction(VT, TypeWidenVector); 1234 IsLegalWiderType = true; 1235 break; 1236 } 1237 } 1238 if (IsLegalWiderType) 1239 break; 1240 LLVM_FALLTHROUGH; 1241 1242 case TypeSplitVector: 1243 case TypeScalarizeVector: { 1244 MVT IntermediateVT; 1245 MVT RegisterVT; 1246 unsigned NumIntermediates; 1247 NumRegistersForVT[i] = getVectorTypeBreakdownMVT(VT, IntermediateVT, 1248 NumIntermediates, RegisterVT, this); 1249 RegisterTypeForVT[i] = RegisterVT; 1250 1251 MVT NVT = VT.getPow2VectorType(); 1252 if (NVT == VT) { 1253 // Type is already a power of 2. The default action is to split. 1254 TransformToType[i] = MVT::Other; 1255 if (PreferredAction == TypeScalarizeVector) 1256 ValueTypeActions.setTypeAction(VT, TypeScalarizeVector); 1257 else if (PreferredAction == TypeSplitVector) 1258 ValueTypeActions.setTypeAction(VT, TypeSplitVector); 1259 else 1260 // Set type action according to the number of elements. 1261 ValueTypeActions.setTypeAction(VT, NElts == 1 ? TypeScalarizeVector 1262 : TypeSplitVector); 1263 } else { 1264 TransformToType[i] = NVT; 1265 ValueTypeActions.setTypeAction(VT, TypeWidenVector); 1266 } 1267 break; 1268 } 1269 default: 1270 llvm_unreachable("Unknown vector legalization action!"); 1271 } 1272 } 1273 1274 // Determine the 'representative' register class for each value type. 1275 // An representative register class is the largest (meaning one which is 1276 // not a sub-register class / subreg register class) legal register class for 1277 // a group of value types. For example, on i386, i8, i16, and i32 1278 // representative would be GR32; while on x86_64 it's GR64. 1279 for (unsigned i = 0; i != MVT::LAST_VALUETYPE; ++i) { 1280 const TargetRegisterClass* RRC; 1281 uint8_t Cost; 1282 std::tie(RRC, Cost) = findRepresentativeClass(TRI, (MVT::SimpleValueType)i); 1283 RepRegClassForVT[i] = RRC; 1284 RepRegClassCostForVT[i] = Cost; 1285 } 1286 } 1287 1288 EVT TargetLoweringBase::getSetCCResultType(const DataLayout &DL, LLVMContext &, 1289 EVT VT) const { 1290 assert(!VT.isVector() && "No default SetCC type for vectors!"); 1291 return getPointerTy(DL).SimpleTy; 1292 } 1293 1294 MVT::SimpleValueType TargetLoweringBase::getCmpLibcallReturnType() const { 1295 return MVT::i32; // return the default value 1296 } 1297 1298 /// getVectorTypeBreakdown - Vector types are broken down into some number of 1299 /// legal first class types. For example, MVT::v8f32 maps to 2 MVT::v4f32 1300 /// with Altivec or SSE1, or 8 promoted MVT::f64 values with the X86 FP stack. 1301 /// Similarly, MVT::v2i64 turns into 4 MVT::i32 values with both PPC and X86. 1302 /// 1303 /// This method returns the number of registers needed, and the VT for each 1304 /// register. It also returns the VT and quantity of the intermediate values 1305 /// before they are promoted/expanded. 1306 unsigned TargetLoweringBase::getVectorTypeBreakdown(LLVMContext &Context, EVT VT, 1307 EVT &IntermediateVT, 1308 unsigned &NumIntermediates, 1309 MVT &RegisterVT) const { 1310 unsigned NumElts = VT.getVectorNumElements(); 1311 1312 // If there is a wider vector type with the same element type as this one, 1313 // or a promoted vector type that has the same number of elements which 1314 // are wider, then we should convert to that legal vector type. 1315 // This handles things like <2 x float> -> <4 x float> and 1316 // <4 x i1> -> <4 x i32>. 1317 LegalizeTypeAction TA = getTypeAction(Context, VT); 1318 if (NumElts != 1 && (TA == TypeWidenVector || TA == TypePromoteInteger)) { 1319 EVT RegisterEVT = getTypeToTransformTo(Context, VT); 1320 if (isTypeLegal(RegisterEVT)) { 1321 IntermediateVT = RegisterEVT; 1322 RegisterVT = RegisterEVT.getSimpleVT(); 1323 NumIntermediates = 1; 1324 return 1; 1325 } 1326 } 1327 1328 // Figure out the right, legal destination reg to copy into. 1329 EVT EltTy = VT.getVectorElementType(); 1330 1331 unsigned NumVectorRegs = 1; 1332 1333 // FIXME: We don't support non-power-of-2-sized vectors for now. Ideally we 1334 // could break down into LHS/RHS like LegalizeDAG does. 1335 if (!isPowerOf2_32(NumElts)) { 1336 NumVectorRegs = NumElts; 1337 NumElts = 1; 1338 } 1339 1340 // Divide the input until we get to a supported size. This will always 1341 // end with a scalar if the target doesn't support vectors. 1342 while (NumElts > 1 && !isTypeLegal( 1343 EVT::getVectorVT(Context, EltTy, NumElts))) { 1344 NumElts >>= 1; 1345 NumVectorRegs <<= 1; 1346 } 1347 1348 NumIntermediates = NumVectorRegs; 1349 1350 EVT NewVT = EVT::getVectorVT(Context, EltTy, NumElts); 1351 if (!isTypeLegal(NewVT)) 1352 NewVT = EltTy; 1353 IntermediateVT = NewVT; 1354 1355 MVT DestVT = getRegisterType(Context, NewVT); 1356 RegisterVT = DestVT; 1357 unsigned NewVTSize = NewVT.getSizeInBits(); 1358 1359 // Convert sizes such as i33 to i64. 1360 if (!isPowerOf2_32(NewVTSize)) 1361 NewVTSize = NextPowerOf2(NewVTSize); 1362 1363 if (EVT(DestVT).bitsLT(NewVT)) // Value is expanded, e.g. i64 -> i16. 1364 return NumVectorRegs*(NewVTSize/DestVT.getSizeInBits()); 1365 1366 // Otherwise, promotion or legal types use the same number of registers as 1367 // the vector decimated to the appropriate level. 1368 return NumVectorRegs; 1369 } 1370 1371 /// Get the EVTs and ArgFlags collections that represent the legalized return 1372 /// type of the given function. This does not require a DAG or a return value, 1373 /// and is suitable for use before any DAGs for the function are constructed. 1374 /// TODO: Move this out of TargetLowering.cpp. 1375 void llvm::GetReturnInfo(CallingConv::ID CC, Type *ReturnType, 1376 AttributeList attr, 1377 SmallVectorImpl<ISD::OutputArg> &Outs, 1378 const TargetLowering &TLI, const DataLayout &DL) { 1379 SmallVector<EVT, 4> ValueVTs; 1380 ComputeValueVTs(TLI, DL, ReturnType, ValueVTs); 1381 unsigned NumValues = ValueVTs.size(); 1382 if (NumValues == 0) return; 1383 1384 for (unsigned j = 0, f = NumValues; j != f; ++j) { 1385 EVT VT = ValueVTs[j]; 1386 ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1387 1388 if (attr.hasAttribute(AttributeList::ReturnIndex, Attribute::SExt)) 1389 ExtendKind = ISD::SIGN_EXTEND; 1390 else if (attr.hasAttribute(AttributeList::ReturnIndex, Attribute::ZExt)) 1391 ExtendKind = ISD::ZERO_EXTEND; 1392 1393 // FIXME: C calling convention requires the return type to be promoted to 1394 // at least 32-bit. But this is not necessary for non-C calling 1395 // conventions. The frontend should mark functions whose return values 1396 // require promoting with signext or zeroext attributes. 1397 if (ExtendKind != ISD::ANY_EXTEND && VT.isInteger()) { 1398 MVT MinVT = TLI.getRegisterType(ReturnType->getContext(), MVT::i32); 1399 if (VT.bitsLT(MinVT)) 1400 VT = MinVT; 1401 } 1402 1403 unsigned NumParts = 1404 TLI.getNumRegistersForCallingConv(ReturnType->getContext(), CC, VT); 1405 MVT PartVT = 1406 TLI.getRegisterTypeForCallingConv(ReturnType->getContext(), CC, VT); 1407 1408 // 'inreg' on function refers to return value 1409 ISD::ArgFlagsTy Flags = ISD::ArgFlagsTy(); 1410 if (attr.hasAttribute(AttributeList::ReturnIndex, Attribute::InReg)) 1411 Flags.setInReg(); 1412 1413 // Propagate extension type if any 1414 if (attr.hasAttribute(AttributeList::ReturnIndex, Attribute::SExt)) 1415 Flags.setSExt(); 1416 else if (attr.hasAttribute(AttributeList::ReturnIndex, Attribute::ZExt)) 1417 Flags.setZExt(); 1418 1419 for (unsigned i = 0; i < NumParts; ++i) 1420 Outs.push_back(ISD::OutputArg(Flags, PartVT, VT, /*isFixed=*/true, 0, 0)); 1421 } 1422 } 1423 1424 /// getByValTypeAlignment - Return the desired alignment for ByVal aggregate 1425 /// function arguments in the caller parameter area. This is the actual 1426 /// alignment, not its logarithm. 1427 unsigned TargetLoweringBase::getByValTypeAlignment(Type *Ty, 1428 const DataLayout &DL) const { 1429 return DL.getABITypeAlignment(Ty); 1430 } 1431 1432 bool TargetLoweringBase::allowsMemoryAccess(LLVMContext &Context, 1433 const DataLayout &DL, EVT VT, 1434 unsigned AddrSpace, 1435 unsigned Alignment, 1436 bool *Fast) const { 1437 // Check if the specified alignment is sufficient based on the data layout. 1438 // TODO: While using the data layout works in practice, a better solution 1439 // would be to implement this check directly (make this a virtual function). 1440 // For example, the ABI alignment may change based on software platform while 1441 // this function should only be affected by hardware implementation. 1442 Type *Ty = VT.getTypeForEVT(Context); 1443 if (Alignment >= DL.getABITypeAlignment(Ty)) { 1444 // Assume that an access that meets the ABI-specified alignment is fast. 1445 if (Fast != nullptr) 1446 *Fast = true; 1447 return true; 1448 } 1449 1450 // This is a misaligned access. 1451 return allowsMisalignedMemoryAccesses(VT, AddrSpace, Alignment, Fast); 1452 } 1453 1454 BranchProbability TargetLoweringBase::getPredictableBranchThreshold() const { 1455 return BranchProbability(MinPercentageForPredictableBranch, 100); 1456 } 1457 1458 //===----------------------------------------------------------------------===// 1459 // TargetTransformInfo Helpers 1460 //===----------------------------------------------------------------------===// 1461 1462 int TargetLoweringBase::InstructionOpcodeToISD(unsigned Opcode) const { 1463 enum InstructionOpcodes { 1464 #define HANDLE_INST(NUM, OPCODE, CLASS) OPCODE = NUM, 1465 #define LAST_OTHER_INST(NUM) InstructionOpcodesCount = NUM 1466 #include "llvm/IR/Instruction.def" 1467 }; 1468 switch (static_cast<InstructionOpcodes>(Opcode)) { 1469 case Ret: return 0; 1470 case Br: return 0; 1471 case Switch: return 0; 1472 case IndirectBr: return 0; 1473 case Invoke: return 0; 1474 case CallBr: return 0; 1475 case Resume: return 0; 1476 case Unreachable: return 0; 1477 case CleanupRet: return 0; 1478 case CatchRet: return 0; 1479 case CatchPad: return 0; 1480 case CatchSwitch: return 0; 1481 case CleanupPad: return 0; 1482 case FNeg: return ISD::FNEG; 1483 case Add: return ISD::ADD; 1484 case FAdd: return ISD::FADD; 1485 case Sub: return ISD::SUB; 1486 case FSub: return ISD::FSUB; 1487 case Mul: return ISD::MUL; 1488 case FMul: return ISD::FMUL; 1489 case UDiv: return ISD::UDIV; 1490 case SDiv: return ISD::SDIV; 1491 case FDiv: return ISD::FDIV; 1492 case URem: return ISD::UREM; 1493 case SRem: return ISD::SREM; 1494 case FRem: return ISD::FREM; 1495 case Shl: return ISD::SHL; 1496 case LShr: return ISD::SRL; 1497 case AShr: return ISD::SRA; 1498 case And: return ISD::AND; 1499 case Or: return ISD::OR; 1500 case Xor: return ISD::XOR; 1501 case Alloca: return 0; 1502 case Load: return ISD::LOAD; 1503 case Store: return ISD::STORE; 1504 case GetElementPtr: return 0; 1505 case Fence: return 0; 1506 case AtomicCmpXchg: return 0; 1507 case AtomicRMW: return 0; 1508 case Trunc: return ISD::TRUNCATE; 1509 case ZExt: return ISD::ZERO_EXTEND; 1510 case SExt: return ISD::SIGN_EXTEND; 1511 case FPToUI: return ISD::FP_TO_UINT; 1512 case FPToSI: return ISD::FP_TO_SINT; 1513 case UIToFP: return ISD::UINT_TO_FP; 1514 case SIToFP: return ISD::SINT_TO_FP; 1515 case FPTrunc: return ISD::FP_ROUND; 1516 case FPExt: return ISD::FP_EXTEND; 1517 case PtrToInt: return ISD::BITCAST; 1518 case IntToPtr: return ISD::BITCAST; 1519 case BitCast: return ISD::BITCAST; 1520 case AddrSpaceCast: return ISD::ADDRSPACECAST; 1521 case ICmp: return ISD::SETCC; 1522 case FCmp: return ISD::SETCC; 1523 case PHI: return 0; 1524 case Call: return 0; 1525 case Select: return ISD::SELECT; 1526 case UserOp1: return 0; 1527 case UserOp2: return 0; 1528 case VAArg: return 0; 1529 case ExtractElement: return ISD::EXTRACT_VECTOR_ELT; 1530 case InsertElement: return ISD::INSERT_VECTOR_ELT; 1531 case ShuffleVector: return ISD::VECTOR_SHUFFLE; 1532 case ExtractValue: return ISD::MERGE_VALUES; 1533 case InsertValue: return ISD::MERGE_VALUES; 1534 case LandingPad: return 0; 1535 } 1536 1537 llvm_unreachable("Unknown instruction type encountered!"); 1538 } 1539 1540 std::pair<int, MVT> 1541 TargetLoweringBase::getTypeLegalizationCost(const DataLayout &DL, 1542 Type *Ty) const { 1543 LLVMContext &C = Ty->getContext(); 1544 EVT MTy = getValueType(DL, Ty); 1545 1546 int Cost = 1; 1547 // We keep legalizing the type until we find a legal kind. We assume that 1548 // the only operation that costs anything is the split. After splitting 1549 // we need to handle two types. 1550 while (true) { 1551 LegalizeKind LK = getTypeConversion(C, MTy); 1552 1553 if (LK.first == TypeLegal) 1554 return std::make_pair(Cost, MTy.getSimpleVT()); 1555 1556 if (LK.first == TypeSplitVector || LK.first == TypeExpandInteger) 1557 Cost *= 2; 1558 1559 // Do not loop with f128 type. 1560 if (MTy == LK.second) 1561 return std::make_pair(Cost, MTy.getSimpleVT()); 1562 1563 // Keep legalizing the type. 1564 MTy = LK.second; 1565 } 1566 } 1567 1568 Value *TargetLoweringBase::getDefaultSafeStackPointerLocation(IRBuilder<> &IRB, 1569 bool UseTLS) const { 1570 // compiler-rt provides a variable with a magic name. Targets that do not 1571 // link with compiler-rt may also provide such a variable. 1572 Module *M = IRB.GetInsertBlock()->getParent()->getParent(); 1573 const char *UnsafeStackPtrVar = "__safestack_unsafe_stack_ptr"; 1574 auto UnsafeStackPtr = 1575 dyn_cast_or_null<GlobalVariable>(M->getNamedValue(UnsafeStackPtrVar)); 1576 1577 Type *StackPtrTy = Type::getInt8PtrTy(M->getContext()); 1578 1579 if (!UnsafeStackPtr) { 1580 auto TLSModel = UseTLS ? 1581 GlobalValue::InitialExecTLSModel : 1582 GlobalValue::NotThreadLocal; 1583 // The global variable is not defined yet, define it ourselves. 1584 // We use the initial-exec TLS model because we do not support the 1585 // variable living anywhere other than in the main executable. 1586 UnsafeStackPtr = new GlobalVariable( 1587 *M, StackPtrTy, false, GlobalValue::ExternalLinkage, nullptr, 1588 UnsafeStackPtrVar, nullptr, TLSModel); 1589 } else { 1590 // The variable exists, check its type and attributes. 1591 if (UnsafeStackPtr->getValueType() != StackPtrTy) 1592 report_fatal_error(Twine(UnsafeStackPtrVar) + " must have void* type"); 1593 if (UseTLS != UnsafeStackPtr->isThreadLocal()) 1594 report_fatal_error(Twine(UnsafeStackPtrVar) + " must " + 1595 (UseTLS ? "" : "not ") + "be thread-local"); 1596 } 1597 return UnsafeStackPtr; 1598 } 1599 1600 Value *TargetLoweringBase::getSafeStackPointerLocation(IRBuilder<> &IRB) const { 1601 if (!TM.getTargetTriple().isAndroid()) 1602 return getDefaultSafeStackPointerLocation(IRB, true); 1603 1604 // Android provides a libc function to retrieve the address of the current 1605 // thread's unsafe stack pointer. 1606 Module *M = IRB.GetInsertBlock()->getParent()->getParent(); 1607 Type *StackPtrTy = Type::getInt8PtrTy(M->getContext()); 1608 FunctionCallee Fn = M->getOrInsertFunction("__safestack_pointer_address", 1609 StackPtrTy->getPointerTo(0)); 1610 return IRB.CreateCall(Fn); 1611 } 1612 1613 //===----------------------------------------------------------------------===// 1614 // Loop Strength Reduction hooks 1615 //===----------------------------------------------------------------------===// 1616 1617 /// isLegalAddressingMode - Return true if the addressing mode represented 1618 /// by AM is legal for this target, for a load/store of the specified type. 1619 bool TargetLoweringBase::isLegalAddressingMode(const DataLayout &DL, 1620 const AddrMode &AM, Type *Ty, 1621 unsigned AS, Instruction *I) const { 1622 // The default implementation of this implements a conservative RISCy, r+r and 1623 // r+i addr mode. 1624 1625 // Allows a sign-extended 16-bit immediate field. 1626 if (AM.BaseOffs <= -(1LL << 16) || AM.BaseOffs >= (1LL << 16)-1) 1627 return false; 1628 1629 // No global is ever allowed as a base. 1630 if (AM.BaseGV) 1631 return false; 1632 1633 // Only support r+r, 1634 switch (AM.Scale) { 1635 case 0: // "r+i" or just "i", depending on HasBaseReg. 1636 break; 1637 case 1: 1638 if (AM.HasBaseReg && AM.BaseOffs) // "r+r+i" is not allowed. 1639 return false; 1640 // Otherwise we have r+r or r+i. 1641 break; 1642 case 2: 1643 if (AM.HasBaseReg || AM.BaseOffs) // 2*r+r or 2*r+i is not allowed. 1644 return false; 1645 // Allow 2*r as r+r. 1646 break; 1647 default: // Don't allow n * r 1648 return false; 1649 } 1650 1651 return true; 1652 } 1653 1654 //===----------------------------------------------------------------------===// 1655 // Stack Protector 1656 //===----------------------------------------------------------------------===// 1657 1658 // For OpenBSD return its special guard variable. Otherwise return nullptr, 1659 // so that SelectionDAG handle SSP. 1660 Value *TargetLoweringBase::getIRStackGuard(IRBuilder<> &IRB) const { 1661 if (getTargetMachine().getTargetTriple().isOSOpenBSD()) { 1662 Module &M = *IRB.GetInsertBlock()->getParent()->getParent(); 1663 PointerType *PtrTy = Type::getInt8PtrTy(M.getContext()); 1664 return M.getOrInsertGlobal("__guard_local", PtrTy); 1665 } 1666 return nullptr; 1667 } 1668 1669 // Currently only support "standard" __stack_chk_guard. 1670 // TODO: add LOAD_STACK_GUARD support. 1671 void TargetLoweringBase::insertSSPDeclarations(Module &M) const { 1672 if (!M.getNamedValue("__stack_chk_guard")) 1673 new GlobalVariable(M, Type::getInt8PtrTy(M.getContext()), false, 1674 GlobalVariable::ExternalLinkage, 1675 nullptr, "__stack_chk_guard"); 1676 } 1677 1678 // Currently only support "standard" __stack_chk_guard. 1679 // TODO: add LOAD_STACK_GUARD support. 1680 Value *TargetLoweringBase::getSDagStackGuard(const Module &M) const { 1681 return M.getNamedValue("__stack_chk_guard"); 1682 } 1683 1684 Function *TargetLoweringBase::getSSPStackGuardCheck(const Module &M) const { 1685 return nullptr; 1686 } 1687 1688 unsigned TargetLoweringBase::getMinimumJumpTableEntries() const { 1689 return MinimumJumpTableEntries; 1690 } 1691 1692 void TargetLoweringBase::setMinimumJumpTableEntries(unsigned Val) { 1693 MinimumJumpTableEntries = Val; 1694 } 1695 1696 unsigned TargetLoweringBase::getMinimumJumpTableDensity(bool OptForSize) const { 1697 return OptForSize ? OptsizeJumpTableDensity : JumpTableDensity; 1698 } 1699 1700 unsigned TargetLoweringBase::getMaximumJumpTableSize() const { 1701 return MaximumJumpTableSize; 1702 } 1703 1704 void TargetLoweringBase::setMaximumJumpTableSize(unsigned Val) { 1705 MaximumJumpTableSize = Val; 1706 } 1707 1708 //===----------------------------------------------------------------------===// 1709 // Reciprocal Estimates 1710 //===----------------------------------------------------------------------===// 1711 1712 /// Get the reciprocal estimate attribute string for a function that will 1713 /// override the target defaults. 1714 static StringRef getRecipEstimateForFunc(MachineFunction &MF) { 1715 const Function &F = MF.getFunction(); 1716 return F.getFnAttribute("reciprocal-estimates").getValueAsString(); 1717 } 1718 1719 /// Construct a string for the given reciprocal operation of the given type. 1720 /// This string should match the corresponding option to the front-end's 1721 /// "-mrecip" flag assuming those strings have been passed through in an 1722 /// attribute string. For example, "vec-divf" for a division of a vXf32. 1723 static std::string getReciprocalOpName(bool IsSqrt, EVT VT) { 1724 std::string Name = VT.isVector() ? "vec-" : ""; 1725 1726 Name += IsSqrt ? "sqrt" : "div"; 1727 1728 // TODO: Handle "half" or other float types? 1729 if (VT.getScalarType() == MVT::f64) { 1730 Name += "d"; 1731 } else { 1732 assert(VT.getScalarType() == MVT::f32 && 1733 "Unexpected FP type for reciprocal estimate"); 1734 Name += "f"; 1735 } 1736 1737 return Name; 1738 } 1739 1740 /// Return the character position and value (a single numeric character) of a 1741 /// customized refinement operation in the input string if it exists. Return 1742 /// false if there is no customized refinement step count. 1743 static bool parseRefinementStep(StringRef In, size_t &Position, 1744 uint8_t &Value) { 1745 const char RefStepToken = ':'; 1746 Position = In.find(RefStepToken); 1747 if (Position == StringRef::npos) 1748 return false; 1749 1750 StringRef RefStepString = In.substr(Position + 1); 1751 // Allow exactly one numeric character for the additional refinement 1752 // step parameter. 1753 if (RefStepString.size() == 1) { 1754 char RefStepChar = RefStepString[0]; 1755 if (RefStepChar >= '0' && RefStepChar <= '9') { 1756 Value = RefStepChar - '0'; 1757 return true; 1758 } 1759 } 1760 report_fatal_error("Invalid refinement step for -recip."); 1761 } 1762 1763 /// For the input attribute string, return one of the ReciprocalEstimate enum 1764 /// status values (enabled, disabled, or not specified) for this operation on 1765 /// the specified data type. 1766 static int getOpEnabled(bool IsSqrt, EVT VT, StringRef Override) { 1767 if (Override.empty()) 1768 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1769 1770 SmallVector<StringRef, 4> OverrideVector; 1771 Override.split(OverrideVector, ','); 1772 unsigned NumArgs = OverrideVector.size(); 1773 1774 // Check if "all", "none", or "default" was specified. 1775 if (NumArgs == 1) { 1776 // Look for an optional setting of the number of refinement steps needed 1777 // for this type of reciprocal operation. 1778 size_t RefPos; 1779 uint8_t RefSteps; 1780 if (parseRefinementStep(Override, RefPos, RefSteps)) { 1781 // Split the string for further processing. 1782 Override = Override.substr(0, RefPos); 1783 } 1784 1785 // All reciprocal types are enabled. 1786 if (Override == "all") 1787 return TargetLoweringBase::ReciprocalEstimate::Enabled; 1788 1789 // All reciprocal types are disabled. 1790 if (Override == "none") 1791 return TargetLoweringBase::ReciprocalEstimate::Disabled; 1792 1793 // Target defaults for enablement are used. 1794 if (Override == "default") 1795 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1796 } 1797 1798 // The attribute string may omit the size suffix ('f'/'d'). 1799 std::string VTName = getReciprocalOpName(IsSqrt, VT); 1800 std::string VTNameNoSize = VTName; 1801 VTNameNoSize.pop_back(); 1802 static const char DisabledPrefix = '!'; 1803 1804 for (StringRef RecipType : OverrideVector) { 1805 size_t RefPos; 1806 uint8_t RefSteps; 1807 if (parseRefinementStep(RecipType, RefPos, RefSteps)) 1808 RecipType = RecipType.substr(0, RefPos); 1809 1810 // Ignore the disablement token for string matching. 1811 bool IsDisabled = RecipType[0] == DisabledPrefix; 1812 if (IsDisabled) 1813 RecipType = RecipType.substr(1); 1814 1815 if (RecipType.equals(VTName) || RecipType.equals(VTNameNoSize)) 1816 return IsDisabled ? TargetLoweringBase::ReciprocalEstimate::Disabled 1817 : TargetLoweringBase::ReciprocalEstimate::Enabled; 1818 } 1819 1820 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1821 } 1822 1823 /// For the input attribute string, return the customized refinement step count 1824 /// for this operation on the specified data type. If the step count does not 1825 /// exist, return the ReciprocalEstimate enum value for unspecified. 1826 static int getOpRefinementSteps(bool IsSqrt, EVT VT, StringRef Override) { 1827 if (Override.empty()) 1828 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1829 1830 SmallVector<StringRef, 4> OverrideVector; 1831 Override.split(OverrideVector, ','); 1832 unsigned NumArgs = OverrideVector.size(); 1833 1834 // Check if "all", "default", or "none" was specified. 1835 if (NumArgs == 1) { 1836 // Look for an optional setting of the number of refinement steps needed 1837 // for this type of reciprocal operation. 1838 size_t RefPos; 1839 uint8_t RefSteps; 1840 if (!parseRefinementStep(Override, RefPos, RefSteps)) 1841 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1842 1843 // Split the string for further processing. 1844 Override = Override.substr(0, RefPos); 1845 assert(Override != "none" && 1846 "Disabled reciprocals, but specifed refinement steps?"); 1847 1848 // If this is a general override, return the specified number of steps. 1849 if (Override == "all" || Override == "default") 1850 return RefSteps; 1851 } 1852 1853 // The attribute string may omit the size suffix ('f'/'d'). 1854 std::string VTName = getReciprocalOpName(IsSqrt, VT); 1855 std::string VTNameNoSize = VTName; 1856 VTNameNoSize.pop_back(); 1857 1858 for (StringRef RecipType : OverrideVector) { 1859 size_t RefPos; 1860 uint8_t RefSteps; 1861 if (!parseRefinementStep(RecipType, RefPos, RefSteps)) 1862 continue; 1863 1864 RecipType = RecipType.substr(0, RefPos); 1865 if (RecipType.equals(VTName) || RecipType.equals(VTNameNoSize)) 1866 return RefSteps; 1867 } 1868 1869 return TargetLoweringBase::ReciprocalEstimate::Unspecified; 1870 } 1871 1872 int TargetLoweringBase::getRecipEstimateSqrtEnabled(EVT VT, 1873 MachineFunction &MF) const { 1874 return getOpEnabled(true, VT, getRecipEstimateForFunc(MF)); 1875 } 1876 1877 int TargetLoweringBase::getRecipEstimateDivEnabled(EVT VT, 1878 MachineFunction &MF) const { 1879 return getOpEnabled(false, VT, getRecipEstimateForFunc(MF)); 1880 } 1881 1882 int TargetLoweringBase::getSqrtRefinementSteps(EVT VT, 1883 MachineFunction &MF) const { 1884 return getOpRefinementSteps(true, VT, getRecipEstimateForFunc(MF)); 1885 } 1886 1887 int TargetLoweringBase::getDivRefinementSteps(EVT VT, 1888 MachineFunction &MF) const { 1889 return getOpRefinementSteps(false, VT, getRecipEstimateForFunc(MF)); 1890 } 1891 1892 void TargetLoweringBase::finalizeLowering(MachineFunction &MF) const { 1893 MF.getRegInfo().freezeReservedRegs(MF); 1894 } 1895